4 * Utility functions that are used by both the client and server.
21 #if TIME_WITH_SYS_TIME
22 # include <sys/time.h>
26 # include <sys/time.h>
38 typedef unsigned char byte; /* Byte type */
39 static byte dtable[256]; /* base64 encode / decode table */
41 /* Month strings for date conversions */
42 char *ascmonths[12] = {
43 "Jan", "Feb", "Mar", "Apr", "May", "Jun",
44 "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"
47 char *safestrncpy(char *dest, const char *src, size_t n)
49 if (dest == NULL || src == NULL) {
50 fprintf(stderr, "safestrncpy: NULL argument\n");
53 strncpy(dest, src, n);
60 #ifndef HAVE_STRNCASECMP
61 int strncasecmp(char *lstr, char *rstr, int len)
66 lc=tolower(lstr[pos]);
67 rc=tolower(rstr[pos]);
68 if ((lc==0)&&(rc==0)) return(0);
69 if (lc<rc) return(-1);
80 * num_tokens() - discover number of parameters/tokens in a string
82 int num_tokens(const char *source, char tok) {
86 if (source == NULL) return(0);
87 for (a=0; a<strlen(source); ++a) {
88 if (source[a]==tok) ++count;
94 /* extract_token() - a smarter string tokenizer */
95 void extract_token(char *dest, const char *source, unsigned long parmnum, char separator)
98 const char *s; /* source */
103 /* Locate desired parameter */
105 while (count < parmnum) {
106 /* End of string, bail! */
111 if (*s == separator) {
116 if (!s) return; /* Parameter not found */
118 for (d = dest; *s && *s != separator; s++, d++) {
125 /* remove_token() - a tokenizer that kills, maims, and destroys fast */
126 void remove_token(char *source, unsigned long parmnum, char separator)
128 char *d, *s; /* dest, source */
131 /* Find desired parameter */
133 while (count < parmnum) {
134 /* End of string, bail! */
139 if (*d == separator) {
144 if (!d) return; /* Parameter not found */
146 /* Find next parameter */
148 while (*s && *s != separator) {
155 else if (d == source)
169 * extract_int() - extract an int parm w/o supplying a buffer
171 int extract_int(const char *source, unsigned long parmnum)
175 extract_token(buf, source, parmnum, '|');
180 * extract_long() - extract an long parm w/o supplying a buffer
182 long extract_long(const char *source, unsigned long parmnum)
186 extract_token(buf, source, parmnum, '|');
192 * extract_unsigned_long() - extract an unsigned long parm
194 unsigned long extract_unsigned_long(const char *source, unsigned long parmnum)
198 extract_token(buf, source, parmnum, '|');
199 return strtoul(buf, NULL, 10);
204 * CtdlDecodeBase64() and CtdlEncodeBase64() are adaptations of code by
205 * John Walker, found in full in the file "base64.c" included with this
206 * distribution. We are moving in the direction of eventually discarding
207 * the separate executables, and using the ones in our code exclusively.
210 void CtdlEncodeBase64(char *dest, const char *source, size_t sourcelen)
212 int i, hiteof = FALSE;
216 /* Fill dtable with character encodings. */
218 for (i = 0; i < 26; i++) {
220 dtable[26 + i] = 'a' + i;
222 for (i = 0; i < 10; i++) {
223 dtable[52 + i] = '0' + i;
229 byte igroup[3], ogroup[4];
232 igroup[0] = igroup[1] = igroup[2] = 0;
233 for (n = 0; n < 3; n++) {
234 if (spos >= sourcelen) {
239 igroup[n] = (byte) c;
242 ogroup[0] = dtable[igroup[0] >> 2];
243 ogroup[1] = dtable[((igroup[0] & 3) << 4) | (igroup[1] >> 4)];
244 ogroup[2] = dtable[((igroup[1] & 0xF) << 2) | (igroup[2] >> 6)];
245 ogroup[3] = dtable[igroup[2] & 0x3F];
247 /* Replace characters in output stream with "=" pad
248 characters if fewer than three characters were
249 read from the end of the input stream. */
257 for (i = 0; i < 4; i++) {
258 dest[dpos++] = ogroup[i];
267 * Convert base64-encoded to binary. Returns the length of the decoded data.
268 * It will stop after reading 'length' bytes.
270 int CtdlDecodeBase64(char *dest, const char *source, size_t length)
276 for (i = 0; i < 255; i++) {
279 for (i = 'A'; i <= 'Z'; i++) {
280 dtable[i] = 0 + (i - 'A');
282 for (i = 'a'; i <= 'z'; i++) {
283 dtable[i] = 26 + (i - 'a');
285 for (i = '0'; i <= '9'; i++) {
286 dtable[i] = 52 + (i - '0');
292 /*CONSTANTCONDITION*/
294 byte a[4], b[4], o[3];
296 for (i = 0; i < 4; i++) {
297 if (spos >= length) {
308 if (dtable[c] & 0x80) {
309 /* Ignoring errors: discard invalid character. */
314 b[i] = (byte) dtable[c];
316 o[0] = (b[0] << 2) | (b[1] >> 4);
317 o[1] = (b[1] << 4) | (b[2] >> 2);
318 o[2] = (b[2] << 6) | b[3];
319 i = a[2] == '=' ? 1 : (a[3] == '=' ? 2 : 3);
320 if (i>=1) dest[dpos++] = o[0];
321 if (i>=2) dest[dpos++] = o[1];
322 if (i>=3) dest[dpos++] = o[2];
333 * Strip leading and trailing spaces from a string
335 void striplt(char *buf)
337 while ((strlen(buf) > 0) && (isspace(buf[0])))
338 strcpy(buf, &buf[1]);
339 while ((strlen(buf) > 0) && (isspace(buf[strlen(buf) - 1])))
340 buf[strlen(buf) - 1] = 0;
348 * Return the number of occurances of character ch in string st
350 int haschar(const char *st, int ch)
354 for (a = 0; a < strlen(st); ++a)
365 * Format a date/time stamp for output
366 * seconds is whether to print the seconds
368 void fmt_date(char *buf, size_t n, time_t thetime, int seconds) {
373 localtime_r(&thetime, &tm);
376 if (hour == 0) hour = 12;
377 else if (hour > 12) hour = hour - 12;
380 snprintf(buf, n, "%s %d %4d %d:%02d:%02d%s",
381 ascmonths[tm.tm_mon],
387 ( (tm.tm_hour >= 12) ? "pm" : "am" )
390 snprintf(buf, n, "%s %d %4d %d:%02d%s",
391 ascmonths[tm.tm_mon],
396 ( (tm.tm_hour >= 12) ? "pm" : "am" )
404 * Determine whether the specified message number is contained within the
407 int is_msg_in_mset(char *mset, long msgnum) {
410 char setstr[SIZ], lostr[SIZ], histr[SIZ]; /* was 1024 */
414 * Now set it for all specified messages.
416 num_sets = num_tokens(mset, ',');
417 for (s=0; s<num_sets; ++s) {
418 extract_token(setstr, mset, s, ',');
420 extract_token(lostr, setstr, 0, ':');
421 if (num_tokens(setstr, ':') >= 2) {
422 extract_token(histr, setstr, 1, ':');
423 if (!strcmp(histr, "*")) {
424 snprintf(histr, sizeof histr, "%ld", LONG_MAX);
428 strcpy(histr, lostr);
433 if ((msgnum >= lo) && (msgnum <= hi)) return(1);
441 * Utility function to "readline" from memory
442 * (returns new pointer)
444 char *memreadline(char *start, char *buf, int maxlen)
448 int len = 0; /* tally our own length to avoid strlen() delays */
451 memset(buf, 0, maxlen);
455 if ( (len < (maxlen - 1)) && (ch != 13) && (ch != 10) ) {
456 buf[strlen(buf) + 1] = 0;
457 buf[strlen(buf)] = ch;
460 if ((ch == 10) || (ch == 0)) {
468 * Strip a boundarized substring out of a string (for example, remove
469 * parentheses and anything inside them).
471 void stripout(char *str, char leftboundary, char rightboundary) {
476 for (a = 0; a < strlen(str); ++a) {
477 if (str[a] == leftboundary) lb = a;
478 if (str[a] == rightboundary) rb = a;
481 if ( (lb > 0) && (rb > lb) ) {
482 strcpy(&str[lb - 1], &str[rb + 1]);
485 else if ( (lb == 0) && (rb > lb) ) {
486 strcpy(str, &str[rb + 1]);
493 * Reduce a string down to a boundarized substring (for example, remove
494 * parentheses and anything outside them).
496 void stripallbut(char *str, char leftboundary, char rightboundary) {
499 for (a = 0; a < strlen(str); ++ a) {
500 if (str[a] == leftboundary) strcpy(str, &str[a+1]);
503 for (a = 0; a < strlen(str); ++ a) {
504 if (str[a] == rightboundary) str[a] = 0;
509 char *myfgets(char *s, int size, FILE *stream) {
510 char *ret = fgets(s, size, stream);
514 nl = strchr(s, '\n');
524 * Escape a string for feeding out as a URL.
525 * Output buffer must be big enough to handle escape expansion!
527 void urlesc(char *outbuf, char *strbuf)
530 char *ec = " #&;`'|*?-~<>^()[]{}$\\";
534 for (a = 0; a < strlen(strbuf); ++a) {
536 for (b = 0; b < strlen(ec); ++b) {
537 if (strbuf[a] == ec[b])
542 sprintf(&outbuf[b], "%%%02x", strbuf[a]);
544 sprintf(&outbuf[b], "%c", strbuf[a]);
550 * bmstrstr() is a variant of strstr() that uses the Boyer-Moore search
551 * algorithm, and can use any caller-supplied string compare function whose
552 * calling syntax is similar to strncmp(). For example, we can supply it
553 * with strncasecmp() to do a case-insensitive search.
555 * Original code: copyright (c) 1997-1998 by Urs Janssen <urs@tin.org>
556 * Modifications: copyright (c) 2003 by Art Cancro <ajc@uncensored.citadel.org>
558 char *bmstrstr(char *text, char *pattern,
559 int (*cmpfunc)(const char *, const char *, size_t) )
561 register unsigned char *p, *t;
562 register int i, j, *delta;
568 if (text == NULL) return(NULL);
569 if (pattern == NULL) return(NULL);
571 textlen = strlen(text);
572 patlen = strlen(pattern);
574 /* algorithm fails if pattern is empty */
575 if ((p1 = patlen) == 0)
578 /* code below fails (whenever i is unsigned) if pattern too long */
584 for (i = 0; i <= 255; i++)
586 for (p = (unsigned char *) pattern, i = p1; --i > 0;)
590 * From now on, we want patlen - 1.
591 * In the loop below, p points to the end of the pattern,
592 * t points to the end of the text to be tested against the
593 * pattern, and i counts the amount of text remaining, not
594 * including the part to be tested.
597 p = (unsigned char *) pattern + p1;
598 t = (unsigned char *) text + p1;
599 i = textlen - patlen;
601 if (tolower(*p) == tolower(*t)
602 && cmpfunc((p - p1), (t - p1), p1) == 0)
603 return ((char *) t - p1);