4 * Utility functions that are used by both the client and server.
17 #if TIME_WITH_SYS_TIME
18 # include <sys/time.h>
22 # include <sys/time.h>
30 #include "sysdep_decls.h"
35 typedef unsigned char byte; /* Byte type */
36 static byte dtable[256]; /* base64 encode / decode table */
38 /* Month strings for date conversions */
39 char *ascmonths[12] = {
40 "Jan", "Feb", "Mar", "Apr", "May", "Jun",
41 "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"
44 char *safestrncpy(char *dest, const char *src, size_t n)
48 if (dest == NULL || src == NULL) {
49 fprintf(stderr, "safestrncpy: NULL argument\n");
55 if (dest[i] == 0) return(dest);
64 #ifndef HAVE_STRNCASECMP
65 int strncasecmp(char *lstr, char *rstr, int len)
70 lc=tolower(lstr[pos]);
71 rc=tolower(rstr[pos]);
72 if ((lc==0)&&(rc==0)) return(0);
73 if (lc<rc) return(-1);
84 * num_tokens() - discover number of parameters/tokens in a string
86 int num_tokens(const char *source, char tok)
89 const char *ptr = source;
95 while (*ptr != '\0') {
106 * extract_token() - a string tokenizer
107 * returns -1 if not found, or length of token.
109 long extract_token(char *dest, const char *source, int parmnum, char separator, int maxlen)
111 const char *s; /* source */
116 /* Locate desired parameter */
119 /* End of string, bail! */
122 return -1; /* Parameter not found */
124 if (*s == separator) {
126 if (count == parmnum)
127 start = s + 1; // we found da start border!
128 else if (count == parmnum + 1)
130 end = s; // we found da end border!
131 break; // so we're done.
139 /** TODO: do find an alternative for this if we're not inside of the server
141 "Warning: Tokenizer failed due to space. better use grab_token here? "
142 "(Token: %d N: %d Extractstring at: %s FullString: %s",
143 (char)separator, parmnum, start, source);
146 return -1; /* Parameter exceeds space */
148 memcpy(dest, start, len);
154 * extract_token() - a string tokenizer
155 * returns -1 if not found, or length of token.
157 long grab_token(char **dest, const char *source, int parmnum, char separator)
159 const char *s; /* source */
165 /* Locate desired parameter */
168 /* End of string, bail! */
171 return -1; /* Parameter not found */
173 if (*s == separator) {
175 if (count == parmnum)
176 start = s + 1; // we found da start border!
177 else if (count == parmnum + 1)
179 end = s; // we found da end border!
180 break; // so we're done.
187 *dest = (char*)malloc (len + 1);
188 memcpy(*dest, start, len);
195 * remove_token() - a tokenizer that kills, maims, and destroys
197 void remove_token(char *source, int parmnum, char separator)
199 char *d, *s; /* dest, source */
202 /* Find desired parameter */
204 while (count < parmnum) {
205 /* End of string, bail! */
210 if (*d == separator) {
215 if (!d) return; /* Parameter not found */
217 /* Find next parameter */
219 while (*s && *s != separator) {
226 else if (d == source)
240 * extract_int() - extract an int parm w/o supplying a buffer
242 int extract_int(const char *source, int parmnum)
246 extract_token(buf, source, parmnum, '|', sizeof buf);
251 * extract_long() - extract an long parm w/o supplying a buffer
253 long extract_long(const char *source, int parmnum)
257 extract_token(buf, source, parmnum, '|', sizeof buf);
263 * extract_unsigned_long() - extract an unsigned long parm
265 unsigned long extract_unsigned_long(const char *source, int parmnum)
269 extract_token(buf, source, parmnum, '|', sizeof buf);
270 return strtoul(buf, NULL, 10);
275 * CtdlDecodeBase64() and CtdlEncodeBase64() are adaptations of code by
276 * John Walker, found in full in the file "base64.c" included with this
277 * distribution. We are moving in the direction of eventually discarding
278 * the separate executables, and using the ones in our code exclusively.
281 void CtdlEncodeBase64(char *dest, const char *source, size_t sourcelen)
283 int i, hiteof = FALSE;
287 /* Fill dtable with character encodings. */
289 for (i = 0; i < 26; i++) {
291 dtable[26 + i] = 'a' + i;
293 for (i = 0; i < 10; i++) {
294 dtable[52 + i] = '0' + i;
300 byte igroup[3], ogroup[4];
303 igroup[0] = igroup[1] = igroup[2] = 0;
304 for (n = 0; n < 3; n++) {
305 if (spos >= sourcelen) {
310 igroup[n] = (byte) c;
313 ogroup[0] = dtable[igroup[0] >> 2];
314 ogroup[1] = dtable[((igroup[0] & 3) << 4) | (igroup[1] >> 4)];
315 ogroup[2] = dtable[((igroup[1] & 0xF) << 2) | (igroup[2] >> 6)];
316 ogroup[3] = dtable[igroup[2] & 0x3F];
318 /* Replace characters in output stream with "=" pad
319 characters if fewer than three characters were
320 read from the end of the input stream. */
328 for (i = 0; i < 4; i++) {
329 dest[dpos++] = ogroup[i];
338 * Convert base64-encoded to binary. Returns the length of the decoded data.
339 * It will stop after reading 'length' bytes.
341 int CtdlDecodeBase64(char *dest, const char *source, size_t length)
347 for (i = 0; i < 255; i++) {
350 for (i = 'A'; i <= 'Z'; i++) {
351 dtable[i] = 0 + (i - 'A');
353 for (i = 'a'; i <= 'z'; i++) {
354 dtable[i] = 26 + (i - 'a');
356 for (i = '0'; i <= '9'; i++) {
357 dtable[i] = 52 + (i - '0');
363 /*CONSTANTCONDITION*/
365 byte a[4], b[4], o[3];
367 for (i = 0; i < 4; i++) {
368 if (spos >= length) {
379 if (dtable[c] & 0x80) {
380 /* Ignoring errors: discard invalid character. */
385 b[i] = (byte) dtable[c];
387 o[0] = (b[0] << 2) | (b[1] >> 4);
388 o[1] = (b[1] << 4) | (b[2] >> 2);
389 o[2] = (b[2] << 6) | b[3];
390 i = a[2] == '=' ? 1 : (a[3] == '=' ? 2 : 3);
391 if (i>=1) dest[dpos++] = o[0];
392 if (i>=2) dest[dpos++] = o[1];
393 if (i>=3) dest[dpos++] = o[2];
402 * if we send out non ascii subjects, we encode it this way.
404 char *rfc2047encode(char *line, long length)
406 char *AlreadyEncoded;
409 #define UTF8_HEADER "=?UTF-8?B?"
411 /* check if we're already done */
412 AlreadyEncoded = strstr(line, "=?");
413 if ((AlreadyEncoded != NULL) &&
414 ((strstr(AlreadyEncoded, "?B?") != NULL)||
415 (strstr(AlreadyEncoded, "?Q?") != NULL)))
420 result = (char*) malloc(strlen(UTF8_HEADER) + 4 + length * 2);
421 strncpy (result, UTF8_HEADER, strlen (UTF8_HEADER));
422 CtdlEncodeBase64(result + strlen(UTF8_HEADER), line, length);
423 end = strlen (result);
432 * Strip leading and trailing spaces from a string
434 void striplt(char *buf)
436 if (IsEmptyStr(buf)) return;
437 while ((!IsEmptyStr(buf)) && (isspace(buf[0])))
438 strcpy(buf, &buf[1]);
439 if (IsEmptyStr(buf)) return;
440 while ((!IsEmptyStr(buf)) && (isspace(buf[strlen(buf) - 1])))
441 buf[strlen(buf) - 1] = 0;
449 * \brief check for the presence of a character within a string (returns count)
450 * \param st the string to examine
451 * \param ch the char to search
452 * \return the position inside of st
454 int haschar(const char *st,int ch)
460 while (!IsEmptyStr(ptr))
471 * Format a date/time stamp for output
472 * seconds is whether to print the seconds
474 void fmt_date(char *buf, size_t n, time_t thetime, int seconds) {
479 localtime_r(&thetime, &tm);
482 if (hour == 0) hour = 12;
483 else if (hour > 12) hour = hour - 12;
486 snprintf(buf, n, "%s %d %4d %d:%02d:%02d%s",
487 ascmonths[tm.tm_mon],
493 ( (tm.tm_hour >= 12) ? "pm" : "am" )
496 snprintf(buf, n, "%s %d %4d %d:%02d%s",
497 ascmonths[tm.tm_mon],
502 ( (tm.tm_hour >= 12) ? "pm" : "am" )
510 * Determine whether the specified message number is contained within the
511 * specified sequence set.
513 int is_msg_in_sequence_set(char *mset, long msgnum) {
516 char setstr[128], lostr[128], histr[128];
519 num_sets = num_tokens(mset, ',');
520 for (s=0; s<num_sets; ++s) {
521 extract_token(setstr, mset, s, ',', sizeof setstr);
523 extract_token(lostr, setstr, 0, ':', sizeof lostr);
524 if (num_tokens(setstr, ':') >= 2) {
525 extract_token(histr, setstr, 1, ':', sizeof histr);
526 if (!strcmp(histr, "*")) {
527 snprintf(histr, sizeof histr, "%ld", LONG_MAX);
531 strcpy(histr, lostr);
536 if ((msgnum >= lo) && (msgnum <= hi)) return(1);
543 * \brief Utility function to "readline" from memory
544 * \param start Location in memory from which we are reading.
545 * \param buf the buffer to place the string in.
546 * \param maxlen Size of string buffer
547 * \return Pointer to the source memory right after we stopped reading.
549 char *memreadline(char *start, char *buf, int maxlen)
553 int len = 0; /**< tally our own length to avoid strlen() delays */
559 if ((len + 1 < (maxlen)) && (ch != 13) && (ch != 10)) {
562 if ((ch == 10) || (ch == 0)) {
573 * Strip a boundarized substring out of a string (for example, remove
574 * parentheses and anything inside them).
576 void stripout(char *str, char leftboundary, char rightboundary) {
581 for (a = 0; a < strlen(str); ++a) {
582 if (str[a] == leftboundary) lb = a;
583 if (str[a] == rightboundary) rb = a;
586 if ( (lb > 0) && (rb > lb) ) {
587 strcpy(&str[lb - 1], &str[rb + 1]);
590 else if ( (lb == 0) && (rb > lb) ) {
591 strcpy(str, &str[rb + 1]);
598 * Reduce a string down to a boundarized substring (for example, remove
599 * parentheses and anything outside them).
601 void stripallbut(char *str, char leftboundary, char rightboundary) {
604 for (a = 0; a < strlen(str); ++ a) {
605 if (str[a] == leftboundary) strcpy(str, &str[a+1]);
608 for (a = 0; a < strlen(str); ++ a) {
609 if (str[a] == rightboundary) str[a] = 0;
614 char *myfgets(char *s, int size, FILE *stream) {
615 char *ret = fgets(s, size, stream);
619 nl = strchr(s, '\n');
629 * Escape a string for feeding out as a URL.
630 * Output buffer must be big enough to handle escape expansion!
632 void urlesc(char *outbuf, char *strbuf)
635 char *ec = " #&;`'|*?-~<>^()[]{}$\\";
639 for (a = 0; a < (int)strlen(strbuf); ++a) {
641 for (b = 0; b < strlen(ec); ++b) {
642 if (strbuf[a] == ec[b])
647 sprintf(&outbuf[b], "%%%02x", strbuf[a]);
649 sprintf(&outbuf[b], "%c", strbuf[a]);
656 * In our world, we want strcpy() to be able to work with overlapping strings.
661 char *strcpy(char *dest, const char *src) {
662 memmove(dest, src, (strlen(src) + 1) );
668 * Generate a new, globally unique UID parameter for a calendar etc. object
670 void generate_uuid(char *buf) {
673 sprintf(buf, "%lx-"F_XPID_T"-%x",
681 * bmstrcasestr() -- case-insensitive substring search
683 * This uses the Boyer-Moore search algorithm and is therefore quite fast.
684 * The code is roughly based on the strstr() replacement from 'tin' written
687 char *bmstrcasestr(char *text, char *pattern) {
689 register unsigned char *p, *t;
690 register int i, j, *delta;
696 textlen = strlen (text);
697 patlen = strlen (pattern);
699 /* algorithm fails if pattern is empty */
700 if ((p1 = patlen) == 0)
703 /* code below fails (whenever i is unsigned) if pattern too long */
709 for (i = 0; i <= 255; i++)
711 for (p = (unsigned char *) pattern, i = p1; --i > 0;)
712 delta[tolower(*p++)] = i;
715 * From now on, we want patlen - 1.
716 * In the loop below, p points to the end of the pattern,
717 * t points to the end of the text to be tested against the
718 * pattern, and i counts the amount of text remaining, not
719 * including the part to be tested.
722 p = (unsigned char *) pattern + p1;
723 t = (unsigned char *) text + p1;
724 i = textlen - patlen;
726 if (tolower(p[0]) == tolower(t[0])) {
727 if (strncasecmp ((const char *)(p - p1), (const char *)(t - p1), p1) == 0) {
728 return ((char *)t - p1);
731 j = delta[tolower(t[0])];
743 * Local replacement for controversial C library function that generates
744 * names for temporary files. Included to shut up compiler warnings.
746 void CtdlMakeTempFileName(char *name, int len) {
749 while (i++, i < 100) {
750 snprintf(name, len, "/tmp/ctdl."F_XPID_T".%04x",
754 if (!access(name, F_OK)) {