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 */
112 int len = 0; /* running total length of extracted string */
113 int current_token = 0; /* token currently being processed */
128 if (*s == separator) {
131 else if ( (current_token == parmnum) && (len < maxlen) ) {
139 if (current_token < parmnum) return(-1);
145 * remove_token() - a tokenizer that kills, maims, and destroys
147 void remove_token(char *source, int parmnum, char separator)
149 char *d, *s; /* dest, source */
152 /* Find desired parameter */
154 while (count < parmnum) {
155 /* End of string, bail! */
160 if (*d == separator) {
165 if (!d) return; /* Parameter not found */
167 /* Find next parameter */
169 while (*s && *s != separator) {
176 else if (d == source)
190 * extract_int() - extract an int parm w/o supplying a buffer
192 int extract_int(const char *source, int parmnum)
196 extract_token(buf, source, parmnum, '|', sizeof buf);
201 * extract_long() - extract an long parm w/o supplying a buffer
203 long extract_long(const char *source, int parmnum)
207 extract_token(buf, source, parmnum, '|', sizeof buf);
213 * extract_unsigned_long() - extract an unsigned long parm
215 unsigned long extract_unsigned_long(const char *source, int parmnum)
219 extract_token(buf, source, parmnum, '|', sizeof buf);
220 return strtoul(buf, NULL, 10);
225 * CtdlDecodeBase64() and CtdlEncodeBase64() are adaptations of code by
226 * John Walker, found in full in the file "base64.c" included with this
227 * distribution. We are moving in the direction of eventually discarding
228 * the separate executables, and using the ones in our code exclusively.
231 void CtdlEncodeBase64(char *dest, const char *source, size_t sourcelen)
233 int i, hiteof = FALSE;
237 /* Fill dtable with character encodings. */
239 for (i = 0; i < 26; i++) {
241 dtable[26 + i] = 'a' + i;
243 for (i = 0; i < 10; i++) {
244 dtable[52 + i] = '0' + i;
250 byte igroup[3], ogroup[4];
253 igroup[0] = igroup[1] = igroup[2] = 0;
254 for (n = 0; n < 3; n++) {
255 if (spos >= sourcelen) {
260 igroup[n] = (byte) c;
263 ogroup[0] = dtable[igroup[0] >> 2];
264 ogroup[1] = dtable[((igroup[0] & 3) << 4) | (igroup[1] >> 4)];
265 ogroup[2] = dtable[((igroup[1] & 0xF) << 2) | (igroup[2] >> 6)];
266 ogroup[3] = dtable[igroup[2] & 0x3F];
268 /* Replace characters in output stream with "=" pad
269 characters if fewer than three characters were
270 read from the end of the input stream. */
278 for (i = 0; i < 4; i++) {
279 dest[dpos++] = ogroup[i];
288 * Convert base64-encoded to binary. Returns the length of the decoded data.
289 * It will stop after reading 'length' bytes.
291 int CtdlDecodeBase64(char *dest, const char *source, size_t length)
297 for (i = 0; i < 255; i++) {
300 for (i = 'A'; i <= 'Z'; i++) {
301 dtable[i] = 0 + (i - 'A');
303 for (i = 'a'; i <= 'z'; i++) {
304 dtable[i] = 26 + (i - 'a');
306 for (i = '0'; i <= '9'; i++) {
307 dtable[i] = 52 + (i - '0');
313 /*CONSTANTCONDITION*/
315 byte a[4], b[4], o[3];
317 for (i = 0; i < 4; i++) {
318 if (spos >= length) {
329 if (dtable[c] & 0x80) {
330 /* Ignoring errors: discard invalid character. */
335 b[i] = (byte) dtable[c];
337 o[0] = (b[0] << 2) | (b[1] >> 4);
338 o[1] = (b[1] << 4) | (b[2] >> 2);
339 o[2] = (b[2] << 6) | b[3];
340 i = a[2] == '=' ? 1 : (a[3] == '=' ? 2 : 3);
341 if (i>=1) dest[dpos++] = o[0];
342 if (i>=2) dest[dpos++] = o[1];
343 if (i>=3) dest[dpos++] = o[2];
352 * if we send out non ascii subjects, we encode it this way.
354 char *rfc2047encode(char *line, long length)
356 char *AlreadyEncoded;
359 #define UTF8_HEADER "=?UTF-8?B?"
361 /* check if we're already done */
362 AlreadyEncoded = strstr(line, "=?");
363 if ((AlreadyEncoded != NULL) &&
364 ((strstr(AlreadyEncoded, "?B?") != NULL)||
365 (strstr(AlreadyEncoded, "?Q?") != NULL)))
370 result = (char*) malloc(strlen(UTF8_HEADER) + 4 + length * 2);
371 strncpy (result, UTF8_HEADER, strlen (UTF8_HEADER));
372 CtdlEncodeBase64(result + strlen(UTF8_HEADER), line, length);
373 end = strlen (result);
382 * Strip leading and trailing spaces from a string
384 void striplt(char *buf)
386 if (IsEmptyStr(buf)) return;
387 while ((!IsEmptyStr(buf)) && (isspace(buf[0])))
388 strcpy(buf, &buf[1]);
389 if (IsEmptyStr(buf)) return;
390 while ((!IsEmptyStr(buf)) && (isspace(buf[strlen(buf) - 1])))
391 buf[strlen(buf) - 1] = 0;
399 * \brief check for the presence of a character within a string (returns count)
400 * \param st the string to examine
401 * \param ch the char to search
402 * \return the position inside of st
404 int haschar(const char *st,int ch)
410 while (!IsEmptyStr(ptr))
421 * Format a date/time stamp for output
422 * seconds is whether to print the seconds
424 void fmt_date(char *buf, size_t n, time_t thetime, int seconds) {
429 localtime_r(&thetime, &tm);
432 if (hour == 0) hour = 12;
433 else if (hour > 12) hour = hour - 12;
436 snprintf(buf, n, "%s %d %4d %d:%02d:%02d%s",
437 ascmonths[tm.tm_mon],
443 ( (tm.tm_hour >= 12) ? "pm" : "am" )
446 snprintf(buf, n, "%s %d %4d %d:%02d%s",
447 ascmonths[tm.tm_mon],
452 ( (tm.tm_hour >= 12) ? "pm" : "am" )
460 * Determine whether the specified message number is contained within the
461 * specified sequence set.
463 int is_msg_in_sequence_set(char *mset, long msgnum) {
466 char setstr[128], lostr[128], histr[128];
469 num_sets = num_tokens(mset, ',');
470 for (s=0; s<num_sets; ++s) {
471 extract_token(setstr, mset, s, ',', sizeof setstr);
473 extract_token(lostr, setstr, 0, ':', sizeof lostr);
474 if (num_tokens(setstr, ':') >= 2) {
475 extract_token(histr, setstr, 1, ':', sizeof histr);
476 if (!strcmp(histr, "*")) {
477 snprintf(histr, sizeof histr, "%ld", LONG_MAX);
481 strcpy(histr, lostr);
486 if ((msgnum >= lo) && (msgnum <= hi)) return(1);
493 * \brief Utility function to "readline" from memory
494 * \param start Location in memory from which we are reading.
495 * \param buf the buffer to place the string in.
496 * \param maxlen Size of string buffer
497 * \return Pointer to the source memory right after we stopped reading.
499 char *memreadline(char *start, char *buf, int maxlen)
503 int len = 0; /**< tally our own length to avoid strlen() delays */
509 if ((len + 1 < (maxlen)) && (ch != 13) && (ch != 10)) {
512 if ((ch == 10) || (ch == 0)) {
523 * Strip a boundarized substring out of a string (for example, remove
524 * parentheses and anything inside them).
526 void stripout(char *str, char leftboundary, char rightboundary) {
531 for (a = 0; a < strlen(str); ++a) {
532 if (str[a] == leftboundary) lb = a;
533 if (str[a] == rightboundary) rb = a;
536 if ( (lb > 0) && (rb > lb) ) {
537 strcpy(&str[lb - 1], &str[rb + 1]);
540 else if ( (lb == 0) && (rb > lb) ) {
541 strcpy(str, &str[rb + 1]);
548 * Reduce a string down to a boundarized substring (for example, remove
549 * parentheses and anything outside them).
551 void stripallbut(char *str, char leftboundary, char rightboundary) {
554 for (a = 0; a < strlen(str); ++ a) {
555 if (str[a] == leftboundary) strcpy(str, &str[a+1]);
558 for (a = 0; a < strlen(str); ++ a) {
559 if (str[a] == rightboundary) str[a] = 0;
564 char *myfgets(char *s, int size, FILE *stream) {
565 char *ret = fgets(s, size, stream);
569 nl = strchr(s, '\n');
579 * Escape a string for feeding out as a URL.
580 * Output buffer must be big enough to handle escape expansion!
582 void urlesc(char *outbuf, char *strbuf)
585 char *ec = " #&;`'|*?-~<>^()[]{}$\\";
589 for (a = 0; a < (int)strlen(strbuf); ++a) {
591 for (b = 0; b < strlen(ec); ++b) {
592 if (strbuf[a] == ec[b])
597 sprintf(&outbuf[b], "%%%02x", strbuf[a]);
599 sprintf(&outbuf[b], "%c", strbuf[a]);
606 * In our world, we want strcpy() to be able to work with overlapping strings.
611 char *strcpy(char *dest, const char *src) {
612 memmove(dest, src, (strlen(src) + 1) );
618 * Generate a new, globally unique UID parameter for a calendar etc. object
620 void generate_uuid(char *buf) {
623 sprintf(buf, "%lx-"F_XPID_T"-%x",
631 * bmstrcasestr() -- case-insensitive substring search
633 * This uses the Boyer-Moore search algorithm and is therefore quite fast.
634 * The code is roughly based on the strstr() replacement from 'tin' written
637 char *bmstrcasestr(char *text, char *pattern) {
639 register unsigned char *p, *t;
640 register int i, j, *delta;
646 textlen = strlen (text);
647 patlen = strlen (pattern);
649 /* algorithm fails if pattern is empty */
650 if ((p1 = patlen) == 0)
653 /* code below fails (whenever i is unsigned) if pattern too long */
659 for (i = 0; i <= 255; i++)
661 for (p = (unsigned char *) pattern, i = p1; --i > 0;)
662 delta[tolower(*p++)] = i;
665 * From now on, we want patlen - 1.
666 * In the loop below, p points to the end of the pattern,
667 * t points to the end of the text to be tested against the
668 * pattern, and i counts the amount of text remaining, not
669 * including the part to be tested.
672 p = (unsigned char *) pattern + p1;
673 t = (unsigned char *) text + p1;
674 i = textlen - patlen;
676 if (tolower(p[0]) == tolower(t[0])) {
677 if (strncasecmp ((const char *)(p - p1), (const char *)(t - p1), p1) == 0) {
678 return ((char *)t - p1);
681 j = delta[tolower(t[0])];
693 * Local replacement for controversial C library function that generates
694 * names for temporary files. Included to shut up compiler warnings.
696 void CtdlMakeTempFileName(char *name, int len) {
699 while (i++, i < 100) {
700 snprintf(name, len, "/tmp/ctdl."F_XPID_T".%04x",
704 if (!access(name, F_OK)) {