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;
95 * extract_token() - a string tokenizer
97 void extract_token(char *dest, const char *source, int parmnum, char separator)
100 const char *s; /* source */
105 /* Locate desired parameter */
107 while (count < parmnum) {
108 /* End of string, bail! */
113 if (*s == separator) {
118 if (!s) return; /* Parameter not found */
120 for (d = dest; *s && *s != separator; s++, d++) {
128 * remove_token() - a tokenizer that kills, maims, and destroys
130 void remove_token(char *source, int parmnum, char separator)
132 char *d, *s; /* dest, source */
135 /* Find desired parameter */
137 while (count < parmnum) {
138 /* End of string, bail! */
143 if (*d == separator) {
148 if (!d) return; /* Parameter not found */
150 /* Find next parameter */
152 while (*s && *s != separator) {
159 else if (d == source)
173 * extract_int() - extract an int parm w/o supplying a buffer
175 int extract_int(const char *source, int parmnum)
179 extract_token(buf, source, parmnum, '|');
184 * extract_long() - extract an long parm w/o supplying a buffer
186 long extract_long(const char *source, int parmnum)
190 extract_token(buf, source, parmnum, '|');
196 * extract_unsigned_long() - extract an unsigned long parm
198 unsigned long extract_unsigned_long(const char *source, int parmnum)
202 extract_token(buf, source, parmnum, '|');
203 return strtoul(buf, NULL, 10);
208 * CtdlDecodeBase64() and CtdlEncodeBase64() are adaptations of code by
209 * John Walker, found in full in the file "base64.c" included with this
210 * distribution. We are moving in the direction of eventually discarding
211 * the separate executables, and using the ones in our code exclusively.
214 void CtdlEncodeBase64(char *dest, const char *source, size_t sourcelen)
216 int i, hiteof = FALSE;
220 /* Fill dtable with character encodings. */
222 for (i = 0; i < 26; i++) {
224 dtable[26 + i] = 'a' + i;
226 for (i = 0; i < 10; i++) {
227 dtable[52 + i] = '0' + i;
233 byte igroup[3], ogroup[4];
236 igroup[0] = igroup[1] = igroup[2] = 0;
237 for (n = 0; n < 3; n++) {
238 if (spos >= sourcelen) {
243 igroup[n] = (byte) c;
246 ogroup[0] = dtable[igroup[0] >> 2];
247 ogroup[1] = dtable[((igroup[0] & 3) << 4) | (igroup[1] >> 4)];
248 ogroup[2] = dtable[((igroup[1] & 0xF) << 2) | (igroup[2] >> 6)];
249 ogroup[3] = dtable[igroup[2] & 0x3F];
251 /* Replace characters in output stream with "=" pad
252 characters if fewer than three characters were
253 read from the end of the input stream. */
261 for (i = 0; i < 4; i++) {
262 dest[dpos++] = ogroup[i];
271 * Convert base64-encoded to binary. Returns the length of the decoded data.
272 * It will stop after reading 'length' bytes.
274 int CtdlDecodeBase64(char *dest, const char *source, size_t length)
280 for (i = 0; i < 255; i++) {
283 for (i = 'A'; i <= 'Z'; i++) {
284 dtable[i] = 0 + (i - 'A');
286 for (i = 'a'; i <= 'z'; i++) {
287 dtable[i] = 26 + (i - 'a');
289 for (i = '0'; i <= '9'; i++) {
290 dtable[i] = 52 + (i - '0');
296 /*CONSTANTCONDITION*/
298 byte a[4], b[4], o[3];
300 for (i = 0; i < 4; i++) {
301 if (spos >= length) {
312 if (dtable[c] & 0x80) {
313 /* Ignoring errors: discard invalid character. */
318 b[i] = (byte) dtable[c];
320 o[0] = (b[0] << 2) | (b[1] >> 4);
321 o[1] = (b[1] << 4) | (b[2] >> 2);
322 o[2] = (b[2] << 6) | b[3];
323 i = a[2] == '=' ? 1 : (a[3] == '=' ? 2 : 3);
324 if (i>=1) dest[dpos++] = o[0];
325 if (i>=2) dest[dpos++] = o[1];
326 if (i>=3) dest[dpos++] = o[2];
337 * Strip leading and trailing spaces from a string
339 void striplt(char *buf)
341 if (strlen(buf) == 0) return;
342 while ((strlen(buf) > 0) && (isspace(buf[0])))
343 strcpy(buf, &buf[1]);
344 if (strlen(buf) == 0) return;
345 while ((strlen(buf) > 0) && (isspace(buf[strlen(buf) - 1])))
346 buf[strlen(buf) - 1] = 0;
354 * Return the number of occurances of character ch in string st
356 int haschar(const char *st, int ch)
360 for (a = 0; a < strlen(st); ++a)
371 * Format a date/time stamp for output
372 * seconds is whether to print the seconds
374 void fmt_date(char *buf, size_t n, time_t thetime, int seconds) {
379 localtime_r(&thetime, &tm);
382 if (hour == 0) hour = 12;
383 else if (hour > 12) hour = hour - 12;
386 snprintf(buf, n, "%s %d %4d %d:%02d:%02d%s",
387 ascmonths[tm.tm_mon],
393 ( (tm.tm_hour >= 12) ? "pm" : "am" )
396 snprintf(buf, n, "%s %d %4d %d:%02d%s",
397 ascmonths[tm.tm_mon],
402 ( (tm.tm_hour >= 12) ? "pm" : "am" )
410 * Determine whether the specified message number is contained within the
413 int is_msg_in_mset(char *mset, long msgnum) {
416 char setstr[SIZ], lostr[SIZ], histr[SIZ]; /* was 1024 */
420 * Now set it for all specified messages.
422 num_sets = num_tokens(mset, ',');
423 for (s=0; s<num_sets; ++s) {
424 extract_token(setstr, mset, s, ',');
426 extract_token(lostr, setstr, 0, ':');
427 if (num_tokens(setstr, ':') >= 2) {
428 extract_token(histr, setstr, 1, ':');
429 if (!strcmp(histr, "*")) {
430 snprintf(histr, sizeof histr, "%ld", LONG_MAX);
434 strcpy(histr, lostr);
439 if ((msgnum >= lo) && (msgnum <= hi)) return(1);
447 * Utility function to "readline" from memory
448 * (returns new pointer)
450 char *memreadline(char *start, char *buf, int maxlen)
454 int len = 0; /* tally our own length to avoid strlen() delays */
457 memset(buf, 0, maxlen);
461 if ( (len < (maxlen - 1)) && (ch != 13) && (ch != 10) ) {
462 buf[strlen(buf) + 1] = 0;
463 buf[strlen(buf)] = ch;
466 if ((ch == 10) || (ch == 0)) {
474 * Strip a boundarized substring out of a string (for example, remove
475 * parentheses and anything inside them).
477 void stripout(char *str, char leftboundary, char rightboundary) {
482 for (a = 0; a < strlen(str); ++a) {
483 if (str[a] == leftboundary) lb = a;
484 if (str[a] == rightboundary) rb = a;
487 if ( (lb > 0) && (rb > lb) ) {
488 strcpy(&str[lb - 1], &str[rb + 1]);
491 else if ( (lb == 0) && (rb > lb) ) {
492 strcpy(str, &str[rb + 1]);
499 * Reduce a string down to a boundarized substring (for example, remove
500 * parentheses and anything outside them).
502 void stripallbut(char *str, char leftboundary, char rightboundary) {
505 for (a = 0; a < strlen(str); ++ a) {
506 if (str[a] == leftboundary) strcpy(str, &str[a+1]);
509 for (a = 0; a < strlen(str); ++ a) {
510 if (str[a] == rightboundary) str[a] = 0;
515 char *myfgets(char *s, int size, FILE *stream) {
516 char *ret = fgets(s, size, stream);
520 nl = strchr(s, '\n');
530 * Escape a string for feeding out as a URL.
531 * Output buffer must be big enough to handle escape expansion!
533 void urlesc(char *outbuf, char *strbuf)
536 char *ec = " #&;`'|*?-~<>^()[]{}$\\";
540 for (a = 0; a < (int)strlen(strbuf); ++a) {
542 for (b = 0; b < strlen(ec); ++b) {
543 if (strbuf[a] == ec[b])
548 sprintf(&outbuf[b], "%%%02x", strbuf[a]);
550 sprintf(&outbuf[b], "%c", strbuf[a]);
556 * bmstrstr() is a variant of strstr() that uses the Boyer-Moore search
557 * algorithm, and can use any caller-supplied string compare function whose
558 * calling syntax is similar to strncmp(). For example, we can supply it
559 * with strncasecmp() to do a case-insensitive search.
561 * Original code: copyright (c) 1997-1998 by Urs Janssen <urs@tin.org>
562 * Modifications: copyright (c) 2003 by Art Cancro <ajc@uncensored.citadel.org>
564 char *bmstrstr(char *text, char *pattern,
565 int (*cmpfunc)(const char *, const char *, size_t) )
567 register unsigned char *p, *t;
568 register int i, j, *delta;
574 if (text == NULL) return(NULL);
575 if (pattern == NULL) return(NULL);
577 textlen = strlen(text);
578 patlen = strlen(pattern);
580 /* algorithm fails if pattern is empty */
581 if ((p1 = patlen) == 0)
584 /* code below fails (whenever i is unsigned) if pattern too long */
590 for (i = 0; i <= 255; i++)
592 for (p = (unsigned char *) pattern, i = p1; --i > 0;)
596 * From now on, we want patlen - 1.
597 * In the loop below, p points to the end of the pattern,
598 * t points to the end of the text to be tested against the
599 * pattern, and i counts the amount of text remaining, not
600 * including the part to be tested.
603 p = (unsigned char *) pattern + p1;
604 t = (unsigned char *) text + p1;
605 i = textlen - patlen;
607 if (tolower(*p) == tolower(*t)
608 && cmpfunc((p - p1), (t - p1), p1) == 0)
609 return ((char *) t - p1);
621 * In our world, we want strcpy() to be able to work with overlapping strings.
623 char *strcpy(char *dest, const char *src) {
624 memmove(dest, src, (strlen(src) + 1) );