5 * \defgroup MiscRout Miscellaneous routines
11 #include "webserver.h"
14 typedef unsigned char byte; /**< byte data type */
16 #define FALSE 0 /**< no. */
17 #define TRUE 1 /**< yes. */
19 static byte dtable[256]; /**< base64 encode / decode table */
22 * \brief sanitize strncopy.
23 * \param dest destination string
24 * \param src source string
25 * \param n length of source to copy
26 * \return result string
28 char *safestrncpy(char *dest, const char *src, size_t n)
30 if (dest == NULL || src == NULL) {
33 strncpy(dest, src, n);
41 * \brief discover number of parameters/tokens in a string
42 * \param source string to inspect
43 * \param tok seperation token
44 * \return number of tokenized parts found
46 int num_tokens(char *source, char tok)
55 while (*ptr != '\0') {
65 * extract_token() - a string tokenizer
66 * returns -1 if not found, or length of token.
68 long extract_token(char *dest, const char *source, int parmnum, char separator, int maxlen)
70 const char *s; //* source * /
71 int len = 0; //* running total length of extracted string * /
72 int current_token = 0; //* token currently being processed * /
81 // lprintf (CTDL_DEBUG, "test >: n: %d sep: %c source: %s \n willi \n", parmnum, separator, source);
91 if (*s == separator) {
94 if ( (current_token == parmnum) &&
100 else if ((current_token > parmnum) || (len >= maxlen)) {
107 if (current_token < parmnum) {
108 // lprintf (CTDL_DEBUG,"test <!: %s\n", dest);
111 // lprintf (CTDL_DEBUG,"test <: %d; %s\n", len, dest);
118 * \brief a tokenizer that kills, maims, and destroys
119 * \param source the string to process
120 * \param parmnum which token to kill
121 * \param separator the tokenizer string
123 void remove_token(char *source, int parmnum, char separator)
135 slen = strlen(source);
141 ( (i < slen) && (end == -1) );
143 if ((start < 0) && (curr_parm == parmnum)) {
147 if ((end < 0) && (curr_parm == (parmnum + 1))) {
151 if (source[i] == separator) {
159 memmove(&source[start], &source[end], slen - end + 1);
166 * \brief extract an int parm w/o supplying a buffer
167 * \param source the string to locate the int in
168 * \param parmnum the n'th token to grab the int from
169 * \return the integer
171 int extract_int(const char *source, int parmnum)
175 extract_token(buf, source, parmnum, '|', sizeof buf);
180 * \brief extract an long parm w/o supplying a buffer
181 * \param source string to examine
182 * \param parmnum n'th token to search long in
183 * \return the found long value
185 long extract_long(const char *source, int parmnum)
189 extract_token(buf, source, parmnum, '|', sizeof buf);
199 * \brief check for the presence of a character within a string (returns count)
200 * \param st the string to examine
201 * \param ch the char to search
202 * \return the position inside of st
204 int haschar(const char *st,char ch)
210 while (!IsEmptyStr(ptr))
218 * \brief Utility function to "readline" from memory
219 * \param start Location in memory from which we are reading.
220 * \param buf the buffer to place the string in.
221 * \param maxlen Size of string buffer
222 * \return Pointer to the source memory right after we stopped reading.
224 char *memreadline(char *start, char *buf, int maxlen)
228 int len = 0; /**< tally our own length to avoid strlen() delays */
233 if ((len + 1 < (maxlen)) && (ch != 13) && (ch != 10)) {
236 if ((ch == 10) || (ch == 0)) {
245 * \brief Utility function to "readline" from memory
246 * \param start Location in memory from which we are reading.
247 * \param buf the buffer to place the string in.
248 * \param maxlen Size of string buffer
249 * \param retlen the length of the returned string
250 * \return Pointer to the source memory right after we stopped reading.
252 char *memreadlinelen(char *start, char *buf, int maxlen, int *retlen)
256 int len = 0; /**< tally our own length to avoid strlen() delays */
262 if ((len + 1 < (maxlen)) && (ch != 13) && (ch != 10)) {
265 if ((ch == 10) || (ch == 0)) {
276 * \brief searches for a paternn within asearch string
277 * \param search the string to search
278 * \param patn the pattern to find in string
279 * \returns position in string
281 int pattern2(char *search, char *patn)
285 len = strlen (search);
286 plen = strlen (patn);
287 for (a = 0; a < len; ++a) {
288 if (!strncasecmp(&search[a], patn, plen))
296 * \brief Strip leading and trailing spaces from a string; with premeasured and adjusted length.
297 * \param buf the string to modify
298 * \param len length of the string.
300 void stripltlen(char *buf, int *len)
303 if (*len == 0) return;
304 while ((*len > delta) && (isspace(buf[delta]))){
307 memmove (buf, &buf[delta], *len - delta + 1);
310 if (*len == 0) return;
311 while (isspace(buf[(*len) - 1])){
312 buf[--(*len)] = '\0';
317 * \brief Strip leading and trailing spaces from a string
318 * \param buf the string to modify
320 void striplt(char *buf)
324 stripltlen(buf, &len);
329 * \brief Determine whether the specified message number is contained within the
332 * \param mset Message set string
333 * \param msgnum Message number we are looking for
335 * \return Nonzero if the specified message number is in the specified message set string.
337 int is_msg_in_mset(char *mset, long msgnum) {
340 char setstr[SIZ], lostr[SIZ], histr[SIZ]; /* was 1024 */
344 * Now set it for all specified messages.
346 num_sets = num_tokens(mset, ',');
347 for (s=0; s<num_sets; ++s) {
348 extract_token(setstr, mset, s, ',', sizeof setstr);
350 extract_token(lostr, setstr, 0, ':', sizeof lostr);
351 if (num_tokens(setstr, ':') >= 2) {
352 extract_token(histr, setstr, 1, ':', sizeof histr);
353 if (!strcmp(histr, "*")) {
354 snprintf(histr, sizeof histr, "%ld", LONG_MAX);
358 strcpy(histr, lostr);
363 if ((msgnum >= lo) && (msgnum <= hi)) return(1);
372 * \brief Strip a boundarized substring out of a string
373 * (for example, remove
374 * parentheses and anything inside them).
376 * This improved version can strip out *multiple* boundarized substrings.
377 * \param str the string to process
378 * \param leftboundary the boundary character on the left side of the target string
379 * \param rightboundary the boundary character on the right side of the target string
381 void stripout(char *str, char leftboundary, char rightboundary)
386 int len = strlen(str);
392 for (a = 0; a < len; ++a) {
393 if (str[a] == leftboundary)
395 if (str[a] == rightboundary)
399 if ((lb > 0) && (rb > lb)) {
400 memmove(&str[lb - 1], &str[rb + 1], len - rb);
401 len -= (rb - lb + 2);
404 } while ((lb > 0) && (rb > lb));
411 * \brief Replacement for sleep() that uses select() in order to avoid SIGALRM
412 * \param seconds how many seconds should we sleep?
414 void sleeeeeeeeeep(int seconds)
420 select(0, NULL, NULL, NULL, &tv);
426 * \brief encode a string into base64 to for example tunnel it through mail transport
427 * CtdlDecodeBase64() and CtdlEncodeBase64() are adaptations of code by
428 * John Walker, copied over from the Citadel server.
429 * \param dest encrypted string
430 * \param source the string to encrypt
431 * \param sourcelen the length of the source data (may contain string terminators)
432 * \return the length of the encoded string.
435 size_t CtdlEncodeBase64(char **pdest, const char *source, size_t sourcelen, size_t *destlen, int linebreaks)
437 int i, hiteof = FALSE;
445 /** Fill dtable with character encodings. */
447 for (i = 0; i < 26; i++) {
449 dtable[26 + i] = 'a' + i;
451 for (i = 0; i < 10; i++) {
452 dtable[52 + i] = '0' + i;
458 byte igroup[3], ogroup[4];
461 igroup[0] = igroup[1] = igroup[2] = 0;
462 for (n = 0; n < 3; n++) {
463 if (spos >= sourcelen) {
468 igroup[n] = (byte) c;
471 ogroup[0] = dtable[igroup[0] >> 2];
473 dtable[((igroup[0] & 3) << 4) |
476 dtable[((igroup[1] & 0xF) << 2) |
478 ogroup[3] = dtable[igroup[2] & 0x3F];
481 * Replace characters in output stream with "=" pad
482 * characters if fewer than three characters were
483 * read from the end of the input stream.
492 for (i = 0; i < 4; i++) {
497 newlen = *destlen + *destlen / 2;
498 newbuf = (char*) malloc(newlen);
499 memcpy(newbuf, dest, *destlen);
500 *pdest = dest = newbuf;
503 dest[dpos++] = ogroup[i];
507 if ( (linebreaks) && (thisline > 70) ) {
508 if (dpos + 3 > *destlen)
512 newlen = *destlen + *destlen / 2;
513 newbuf = (char*) malloc(newlen);
514 memcpy(newbuf, dest, *destlen);
515 *pdest = dest = newbuf;
525 if ( (linebreaks) && (thisline > 70) ) {
526 if (dpos + 3 > *destlen)
530 newlen = *destlen + 5;
531 newbuf = (char*) malloc(newlen);
532 memcpy(newbuf, dest, *destlen);
533 *pdest = dest = newbuf;
546 * \brief Convert base64-encoded to binary.
547 * It will stop after reading 'length' bytes.
549 * \param dest The destination buffer
550 * \param source The base64 data to be decoded.
551 * \param length The number of bytes to decode.
552 * \return The actual length of the decoded data.
554 int CtdlDecodeBase64(char *dest, const char *source, size_t length)
560 for (i = 0; i < 255; i++) {
563 for (i = 'A'; i <= 'Z'; i++) {
564 dtable[i] = 0 + (i - 'A');
566 for (i = 'a'; i <= 'z'; i++) {
567 dtable[i] = 26 + (i - 'a');
569 for (i = '0'; i <= '9'; i++) {
570 dtable[i] = 52 + (i - '0');
576 /**CONSTANTCONDITION*/ while (TRUE) {
577 byte a[4], b[4], o[3];
579 for (i = 0; i < 4; i++) {
580 if (spos >= length) {
591 if (dtable[c] & 0x80) {
592 /** Ignoring errors: discard invalid character */
597 b[i] = (byte) dtable[c];
599 o[0] = (b[0] << 2) | (b[1] >> 4);
600 o[1] = (b[1] << 4) | (b[2] >> 2);
601 o[2] = (b[2] << 6) | b[3];
602 i = a[2] == '=' ? 1 : (a[3] == '=' ? 2 : 3);
619 * \brief Generate a new, globally unique UID parameter for a calendar etc. object
621 * \param buf String buffer into which our newly created UUID should be placed
623 void generate_uuid(char *buf) {
626 sprintf(buf, "%s-%lx-%lx-%x",
627 serv_info.serv_nodename,
636 * Convert "quoted-printable" to binary. Returns number of bytes decoded.
637 * according to RFC2045 section 6.7
639 int CtdlDecodeQuotedPrintable(char *decoded, char *encoded, int sourcelen) {
641 int decoded_length = 0;
644 while (pos < sourcelen)
646 if (!strncmp(&encoded[pos], "=\r\n", 3))
650 else if (!strncmp(&encoded[pos], "=\n", 2))
654 else if (encoded[pos] == '=')
657 sscanf(&encoded[pos+1], "%02x", &ch);
659 decoded[decoded_length++] = ch;
663 decoded[decoded_length++] = encoded[pos];
667 decoded[decoded_length] = 0;
668 return(decoded_length);
673 * \brief Local replacement for controversial C library function that generates
674 * names for temporary files. Included to shut up compiler warnings.
675 * \todo return a fd to the file instead of the name for security reasons
676 * \param name the created filename
677 * \param len the length of the filename
679 void CtdlMakeTempFileName(char *name, int len) {
682 while (i++, i < 100) {
683 snprintf(name, len, "/tmp/ctdl.%04x.%04x",
687 if (!access(name, F_OK)) {
696 * \brief case-insensitive substring search
698 * This uses the Boyer-Moore search algorithm and is therefore quite fast.
699 * The code is roughly based on the strstr() replacement from 'tin' written
702 * \param text String to be searched
703 * \param pattern String to search for
705 char *bmstrcasestr(char *text, char *pattern) {
707 register unsigned char *p, *t;
708 register int i, j, *delta;
714 textlen = strlen (text);
715 patlen = strlen (pattern);
717 /* algorithm fails if pattern is empty */
718 if ((p1 = patlen) == 0)
721 /* code below fails (whenever i is unsigned) if pattern too long */
727 for (i = 0; i <= 255; i++)
729 for (p = (unsigned char *) pattern, i = p1; --i > 0;)
730 delta[tolower(*p++)] = i;
733 * From now on, we want patlen - 1.
734 * In the loop below, p points to the end of the pattern,
735 * t points to the end of the text to be tested against the
736 * pattern, and i counts the amount of text remaining, not
737 * including the part to be tested.
740 p = (unsigned char *) pattern + p1;
741 t = (unsigned char *) text + p1;
742 i = textlen - patlen;
744 if (tolower(p[0]) == tolower(t[0])) {
745 if (strncasecmp ((const char *)(p - p1), (const char *)(t - p1), p1) == 0) {
746 return ((char *)t - p1);
749 j = delta[tolower(t[0])];