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 if ( (current_token == parmnum) && (len < maxlen) ) {
135 else if ((current_token > parmnum) || (len >= maxlen)) {
142 if (current_token < parmnum) return(-1);
148 * extract_token() - a string tokenizer
150 long extract_token(char *dest, const char *source, int parmnum, char separator, int maxlen)
153 const char *s; /* source */
159 /* Locate desired parameter */
161 while (count < parmnum) {
162 /* End of string, bail! */
167 if (*s == separator) {
172 if (!s) return -1; /* Parameter not found */
174 for (d = dest; *s && *s != separator && ++len<maxlen; s++, d++) {
184 * remove_token() - a tokenizer that kills, maims, and destroys
186 void remove_token(char *source, int parmnum, char separator)
188 char *d, *s; /* dest, source */
191 /* Find desired parameter */
193 while (count < parmnum) {
194 /* End of string, bail! */
199 if (*d == separator) {
204 if (!d) return; /* Parameter not found */
206 /* Find next parameter */
208 while (*s && *s != separator) {
215 else if (d == source)
229 * extract_int() - extract an int parm w/o supplying a buffer
231 int extract_int(const char *source, int parmnum)
235 extract_token(buf, source, parmnum, '|', sizeof buf);
240 * extract_long() - extract an long parm w/o supplying a buffer
242 long extract_long(const char *source, int parmnum)
246 extract_token(buf, source, parmnum, '|', sizeof buf);
252 * extract_unsigned_long() - extract an unsigned long parm
254 unsigned long extract_unsigned_long(const char *source, int parmnum)
258 extract_token(buf, source, parmnum, '|', sizeof buf);
259 return strtoul(buf, NULL, 10);
264 * CtdlDecodeBase64() and CtdlEncodeBase64() are adaptations of code by
265 * John Walker, found in full in the file "base64.c" included with this
266 * distribution. We are moving in the direction of eventually discarding
267 * the separate executables, and using the ones in our code exclusively.
270 void CtdlEncodeBase64(char *dest, const char *source, size_t sourcelen)
272 int i, hiteof = FALSE;
276 /* Fill dtable with character encodings. */
278 for (i = 0; i < 26; i++) {
280 dtable[26 + i] = 'a' + i;
282 for (i = 0; i < 10; i++) {
283 dtable[52 + i] = '0' + i;
289 byte igroup[3], ogroup[4];
292 igroup[0] = igroup[1] = igroup[2] = 0;
293 for (n = 0; n < 3; n++) {
294 if (spos >= sourcelen) {
299 igroup[n] = (byte) c;
302 ogroup[0] = dtable[igroup[0] >> 2];
303 ogroup[1] = dtable[((igroup[0] & 3) << 4) | (igroup[1] >> 4)];
304 ogroup[2] = dtable[((igroup[1] & 0xF) << 2) | (igroup[2] >> 6)];
305 ogroup[3] = dtable[igroup[2] & 0x3F];
307 /* Replace characters in output stream with "=" pad
308 characters if fewer than three characters were
309 read from the end of the input stream. */
317 for (i = 0; i < 4; i++) {
318 dest[dpos++] = ogroup[i];
327 * Convert base64-encoded to binary. Returns the length of the decoded data.
328 * It will stop after reading 'length' bytes.
330 int CtdlDecodeBase64(char *dest, const char *source, size_t length)
336 for (i = 0; i < 255; i++) {
339 for (i = 'A'; i <= 'Z'; i++) {
340 dtable[i] = 0 + (i - 'A');
342 for (i = 'a'; i <= 'z'; i++) {
343 dtable[i] = 26 + (i - 'a');
345 for (i = '0'; i <= '9'; i++) {
346 dtable[i] = 52 + (i - '0');
352 /*CONSTANTCONDITION*/
354 byte a[4], b[4], o[3];
356 for (i = 0; i < 4; i++) {
357 if (spos >= length) {
368 if (dtable[c] & 0x80) {
369 /* Ignoring errors: discard invalid character. */
374 b[i] = (byte) dtable[c];
376 o[0] = (b[0] << 2) | (b[1] >> 4);
377 o[1] = (b[1] << 4) | (b[2] >> 2);
378 o[2] = (b[2] << 6) | b[3];
379 i = a[2] == '=' ? 1 : (a[3] == '=' ? 2 : 3);
380 if (i>=1) dest[dpos++] = o[0];
381 if (i>=2) dest[dpos++] = o[1];
382 if (i>=3) dest[dpos++] = o[2];
391 * if we send out non ascii subjects, we encode it this way.
393 char *rfc2047encode(char *line, long length)
395 char *AlreadyEncoded;
398 #define UTF8_HEADER "=?UTF-8?B?"
400 /* check if we're already done */
401 AlreadyEncoded = strstr(line, "=?");
402 if ((AlreadyEncoded != NULL) &&
403 ((strstr(AlreadyEncoded, "?B?") != NULL)||
404 (strstr(AlreadyEncoded, "?Q?") != NULL)))
409 result = (char*) malloc(strlen(UTF8_HEADER) + 4 + length * 2);
410 strncpy (result, UTF8_HEADER, strlen (UTF8_HEADER));
411 CtdlEncodeBase64(result + strlen(UTF8_HEADER), line, length);
412 end = strlen (result);
421 * Strip leading and trailing spaces from a string
423 void striplt(char *buf)
425 if (IsEmptyStr(buf)) return;
426 while ((!IsEmptyStr(buf)) && (isspace(buf[0])))
427 strcpy(buf, &buf[1]);
428 if (IsEmptyStr(buf)) return;
429 while ((!IsEmptyStr(buf)) && (isspace(buf[strlen(buf) - 1])))
430 buf[strlen(buf) - 1] = 0;
438 * \brief check for the presence of a character within a string (returns count)
439 * \param st the string to examine
440 * \param ch the char to search
441 * \return the position inside of st
443 int haschar(const char *st,int ch)
449 while (!IsEmptyStr(ptr))
463 * Format a date/time stamp for output
464 * seconds is whether to print the seconds
466 void fmt_date(char *buf, size_t n, time_t thetime, int seconds) {
471 localtime_r(&thetime, &tm);
474 if (hour == 0) hour = 12;
475 else if (hour > 12) hour = hour - 12;
478 snprintf(buf, n, "%s %d %4d %d:%02d:%02d%s",
479 ascmonths[tm.tm_mon],
485 ( (tm.tm_hour >= 12) ? "pm" : "am" )
488 snprintf(buf, n, "%s %d %4d %d:%02d%s",
489 ascmonths[tm.tm_mon],
494 ( (tm.tm_hour >= 12) ? "pm" : "am" )
502 * Determine whether the specified message number is contained within the
503 * specified sequence set.
505 int is_msg_in_sequence_set(char *mset, long msgnum) {
508 char setstr[128], lostr[128], histr[128];
511 num_sets = num_tokens(mset, ',');
512 for (s=0; s<num_sets; ++s) {
513 extract_token(setstr, mset, s, ',', sizeof setstr);
515 extract_token(lostr, setstr, 0, ':', sizeof lostr);
516 if (num_tokens(setstr, ':') >= 2) {
517 extract_token(histr, setstr, 1, ':', sizeof histr);
518 if (!strcmp(histr, "*")) {
519 snprintf(histr, sizeof histr, "%ld", LONG_MAX);
523 strcpy(histr, lostr);
528 if ((msgnum >= lo) && (msgnum <= hi)) return(1);
535 * \brief Utility function to "readline" from memory
536 * \param start Location in memory from which we are reading.
537 * \param buf the buffer to place the string in.
538 * \param maxlen Size of string buffer
539 * \return Pointer to the source memory right after we stopped reading.
541 char *memreadline(char *start, char *buf, int maxlen)
545 int len = 0; /**< tally our own length to avoid strlen() delays */
551 if ((len + 1 < (maxlen)) && (ch != 13) && (ch != 10)) {
554 if ((ch == 10) || (ch == 0)) {
565 * Strip a boundarized substring out of a string (for example, remove
566 * parentheses and anything inside them).
568 void stripout(char *str, char leftboundary, char rightboundary) {
573 for (a = 0; a < strlen(str); ++a) {
574 if (str[a] == leftboundary) lb = a;
575 if (str[a] == rightboundary) rb = a;
578 if ( (lb > 0) && (rb > lb) ) {
579 strcpy(&str[lb - 1], &str[rb + 1]);
582 else if ( (lb == 0) && (rb > lb) ) {
583 strcpy(str, &str[rb + 1]);
590 * Reduce a string down to a boundarized substring (for example, remove
591 * parentheses and anything outside them).
593 void stripallbut(char *str, char leftboundary, char rightboundary) {
596 for (a = 0; a < strlen(str); ++ a) {
597 if (str[a] == leftboundary) strcpy(str, &str[a+1]);
600 for (a = 0; a < strlen(str); ++ a) {
601 if (str[a] == rightboundary) str[a] = 0;
606 char *myfgets(char *s, int size, FILE *stream) {
607 char *ret = fgets(s, size, stream);
611 nl = strchr(s, '\n');
621 * Escape a string for feeding out as a URL.
622 * Output buffer must be big enough to handle escape expansion!
624 void urlesc(char *outbuf, char *strbuf)
627 char *ec = " #&;`'|*?-~<>^()[]{}$\\";
631 for (a = 0; a < (int)strlen(strbuf); ++a) {
633 for (b = 0; b < strlen(ec); ++b) {
634 if (strbuf[a] == ec[b])
639 sprintf(&outbuf[b], "%%%02x", strbuf[a]);
641 sprintf(&outbuf[b], "%c", strbuf[a]);
648 * In our world, we want strcpy() to be able to work with overlapping strings.
653 char *strcpy(char *dest, const char *src) {
654 memmove(dest, src, (strlen(src) + 1) );
660 * Generate a new, globally unique UID parameter for a calendar etc. object
662 void generate_uuid(char *buf) {
665 sprintf(buf, "%lx-"F_XPID_T"-%x",
673 * bmstrcasestr() -- case-insensitive substring search
675 * This uses the Boyer-Moore search algorithm and is therefore quite fast.
676 * The code is roughly based on the strstr() replacement from 'tin' written
679 char *bmstrcasestr(char *text, char *pattern) {
681 register unsigned char *p, *t;
682 register int i, j, *delta;
688 textlen = strlen (text);
689 patlen = strlen (pattern);
691 /* algorithm fails if pattern is empty */
692 if ((p1 = patlen) == 0)
695 /* code below fails (whenever i is unsigned) if pattern too long */
701 for (i = 0; i <= 255; i++)
703 for (p = (unsigned char *) pattern, i = p1; --i > 0;)
704 delta[tolower(*p++)] = i;
707 * From now on, we want patlen - 1.
708 * In the loop below, p points to the end of the pattern,
709 * t points to the end of the text to be tested against the
710 * pattern, and i counts the amount of text remaining, not
711 * including the part to be tested.
714 p = (unsigned char *) pattern + p1;
715 t = (unsigned char *) text + p1;
716 i = textlen - patlen;
718 if (tolower(p[0]) == tolower(t[0])) {
719 if (strncasecmp ((const char *)(p - p1), (const char *)(t - p1), p1) == 0) {
720 return ((char *)t - p1);
723 j = delta[tolower(t[0])];
735 * Local replacement for controversial C library function that generates
736 * names for temporary files. Included to shut up compiler warnings.
738 void CtdlMakeTempFileName(char *name, int len) {
741 while (i++, i < 100) {
742 snprintf(name, len, "/tmp/ctdl."F_XPID_T".%04x",
746 if (!access(name, F_OK)) {