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)
53 for (a = 0; a < strlen(source); ++a) {
61 * brief a string tokenizer
62 * \param dest destination string
63 * \param source the string to grab tokens from
64 * \param parmnum the n'th token to grab
65 * \param separator the tokenizer string
66 * \param maxlen the length of dest
68 void extract_token(char *dest, const char *source, int parmnum, char separator, int maxlen)
71 const char *s; /* source */
77 /* Locate desired parameter */
79 while (count < parmnum) {
80 /* End of string, bail! */
85 if (*s == separator) {
90 if (!s) return; /* Parameter not found */
92 for (d = dest; *s && *s != separator && ++len<maxlen; s++, d++) {
101 * \brief a tokenizer that kills, maims, and destroys
102 * \param source the string to process
103 * \param parmnum which token to kill
104 * \param separator the tokenizer string
106 void remove_token(char *source, int parmnum, char separator)
118 slen = strlen(source);
124 ( (i < slen) && (end == -1) );
126 if ((start < 0) && (curr_parm == parmnum)) {
130 if ((end < 0) && (curr_parm == (parmnum + 1))) {
134 if (source[i] == separator) {
142 memmove(&source[start], &source[end], slen - end + 1);
149 * \brief extract an int parm w/o supplying a buffer
150 * \param source the string to locate the int in
151 * \param parmnum the n'th token to grab the int from
152 * \return the integer
154 int extract_int(const char *source, int parmnum)
158 extract_token(buf, source, parmnum, '|', sizeof buf);
163 * \brief extract an long parm w/o supplying a buffer
164 * \param source string to examine
165 * \param parmnum n'th token to search long in
166 * \return the found long value
168 long extract_long(const char *source, int parmnum)
172 extract_token(buf, source, parmnum, '|', sizeof buf);
182 * \brief check for the presence of a character within a string (returns count)
183 * \param st the string to examine
184 * \param ch the char to search
185 * \return the position inside of st
187 int haschar(char *st,char ch)
191 for (a = 0; a < strlen(st); ++a)
199 * \brief Utility function to "readline" from memory
200 * \param start Location in memory from which we are reading.
201 * \param buf the buffer to place the string in.
202 * \param maxlen Size of string buffer
203 * \return Pointer to the source memory right after we stopped reading.
205 char *memreadline(char *start, char *buf, int maxlen)
209 int len = 0; /**< tally our own length to avoid strlen() delays */
212 memset(buf, 0, maxlen);
216 if ((len < (maxlen - 1)) && (ch != 13) && (ch != 10)) {
217 buf[strlen(buf) + 1] = 0;
218 buf[strlen(buf)] = ch;
221 if ((ch == 10) || (ch == 0)) {
230 * \brief searches for a paternn within asearch string
231 * \param search the string to search
232 * \param patn the pattern to find in string
233 * \returns position in string
235 int pattern2(char *search, char *patn)
238 for (a = 0; a < strlen(search); ++a) {
239 if (!strncasecmp(&search[a], patn, strlen(patn)))
247 * \brief Strip leading and trailing spaces from a string
248 * \param buf the string to modify
250 void striplt(char *buf)
255 if (len == 0) return;
256 while ((len > 0) && (isspace(buf[0]))){
257 memmove (buf, &buf[1], len);
260 if (len == 0) return;
261 while (isspace(buf[len - 1])){
269 * \brief Determine whether the specified message number is contained within the
272 * \param mset Message set string
273 * \param msgnum Message number we are looking for
275 * \return Nonzero if the specified message number is in the specified message set string.
277 int is_msg_in_mset(char *mset, long msgnum) {
280 char setstr[SIZ], lostr[SIZ], histr[SIZ]; /* was 1024 */
284 * Now set it for all specified messages.
286 num_sets = num_tokens(mset, ',');
287 for (s=0; s<num_sets; ++s) {
288 extract_token(setstr, mset, s, ',', sizeof setstr);
290 extract_token(lostr, setstr, 0, ':', sizeof lostr);
291 if (num_tokens(setstr, ':') >= 2) {
292 extract_token(histr, setstr, 1, ':', sizeof histr);
293 if (!strcmp(histr, "*")) {
294 snprintf(histr, sizeof histr, "%ld", LONG_MAX);
298 strcpy(histr, lostr);
303 if ((msgnum >= lo) && (msgnum <= hi)) return(1);
312 * \brief Strip a boundarized substring out of a string
313 * (for example, remove
314 * parentheses and anything inside them).
316 * This improved version can strip out *multiple* boundarized substrings.
317 * \param str the string to process
318 * \param leftboundary the boundary character on the left side of the target string
319 * \param rightboundary the boundary character on the right side of the target string
321 void stripout(char *str, char leftboundary, char rightboundary)
331 for (a = 0; a < strlen(str); ++a) {
332 if (str[a] == leftboundary)
334 if (str[a] == rightboundary)
338 if ((lb > 0) && (rb > lb)) {
339 strcpy(&str[lb - 1], &str[rb + 1]);
342 } while ((lb > 0) && (rb > lb));
349 * \brief Replacement for sleep() that uses select() in order to avoid SIGALRM
350 * \param seconds how many seconds should we sleep?
352 void sleeeeeeeeeep(int seconds)
358 select(0, NULL, NULL, NULL, &tv);
364 * \brief encode a string into base64 to for example tunnel it through mail transport
365 * CtdlDecodeBase64() and CtdlEncodeBase64() are adaptations of code by
366 * John Walker, copied over from the Citadel server.
367 * \param dest encrypted string
368 * \param source the string to encrypt
369 * \param sourcelen the length of the source data (may contain string terminators)
372 void CtdlEncodeBase64(char *dest, const char *source, size_t sourcelen, int linebreaks)
374 int i, hiteof = FALSE;
379 /** Fill dtable with character encodings. */
381 for (i = 0; i < 26; i++) {
383 dtable[26 + i] = 'a' + i;
385 for (i = 0; i < 10; i++) {
386 dtable[52 + i] = '0' + i;
392 byte igroup[3], ogroup[4];
395 igroup[0] = igroup[1] = igroup[2] = 0;
396 for (n = 0; n < 3; n++) {
397 if (spos >= sourcelen) {
402 igroup[n] = (byte) c;
405 ogroup[0] = dtable[igroup[0] >> 2];
407 dtable[((igroup[0] & 3) << 4) |
410 dtable[((igroup[1] & 0xF) << 2) |
412 ogroup[3] = dtable[igroup[2] & 0x3F];
415 * Replace characters in output stream with "=" pad
416 * characters if fewer than three characters were
417 * read from the end of the input stream.
426 for (i = 0; i < 4; i++) {
427 dest[dpos++] = ogroup[i];
431 if ( (linebreaks) && (thisline > 70) ) {
439 if ( (linebreaks) && (thisline > 70) ) {
449 * \brief Convert base64-encoded to binary.
450 * It will stop after reading 'length' bytes.
452 * \param dest The destination buffer
453 * \param source The base64 data to be decoded.
454 * \param length The number of bytes to decode.
455 * \return The actual length of the decoded data.
457 int CtdlDecodeBase64(char *dest, const char *source, size_t length)
463 for (i = 0; i < 255; i++) {
466 for (i = 'A'; i <= 'Z'; i++) {
467 dtable[i] = 0 + (i - 'A');
469 for (i = 'a'; i <= 'z'; i++) {
470 dtable[i] = 26 + (i - 'a');
472 for (i = '0'; i <= '9'; i++) {
473 dtable[i] = 52 + (i - '0');
479 /**CONSTANTCONDITION*/ while (TRUE) {
480 byte a[4], b[4], o[3];
482 for (i = 0; i < 4; i++) {
483 if (spos >= length) {
494 if (dtable[c] & 0x80) {
495 /** Ignoring errors: discard invalid character */
500 b[i] = (byte) dtable[c];
502 o[0] = (b[0] << 2) | (b[1] >> 4);
503 o[1] = (b[1] << 4) | (b[2] >> 2);
504 o[2] = (b[2] << 6) | b[3];
505 i = a[2] == '=' ? 1 : (a[3] == '=' ? 2 : 3);
522 * \brief Generate a new, globally unique UID parameter for a calendar etc. object
524 * \param buf String buffer into which our newly created UUID should be placed
526 void generate_uuid(char *buf) {
529 sprintf(buf, "%s-%lx-%lx-%x",
530 serv_info.serv_nodename,
539 * \brief Local replacement for controversial C library function that generates
540 * names for temporary files. Included to shut up compiler warnings.
541 * \todo return a fd to the file instead of the name for security reasons
542 * \param name the created filename
543 * \param len the length of the filename
545 void CtdlMakeTempFileName(char *name, int len) {
548 while (i++, i < 100) {
549 snprintf(name, len, "/tmp/ctdl.%04x.%04x",
553 if (!access(name, F_OK)) {
562 * \brief case-insensitive substring search
564 * This uses the Boyer-Moore search algorithm and is therefore quite fast.
565 * The code is roughly based on the strstr() replacement from 'tin' written
568 * \param text String to be searched
569 * \param pattern String to search for
571 char *bmstrcasestr(char *text, char *pattern) {
573 register unsigned char *p, *t;
574 register int i, j, *delta;
580 textlen = strlen (text);
581 patlen = strlen (pattern);
583 /* algorithm fails if pattern is empty */
584 if ((p1 = patlen) == 0)
587 /* code below fails (whenever i is unsigned) if pattern too long */
593 for (i = 0; i <= 255; i++)
595 for (p = (unsigned char *) pattern, i = p1; --i > 0;)
596 delta[tolower(*p++)] = i;
599 * From now on, we want patlen - 1.
600 * In the loop below, p points to the end of the pattern,
601 * t points to the end of the text to be tested against the
602 * pattern, and i counts the amount of text remaining, not
603 * including the part to be tested.
606 p = (unsigned char *) pattern + p1;
607 t = (unsigned char *) text + p1;
608 i = textlen - patlen;
610 if (tolower(p[0]) == tolower(t[0])) {
611 if (strncasecmp ((const char *)(p - p1), (const char *)(t - p1), p1) == 0) {
612 return ((char *)t - p1);
615 j = delta[tolower(t[0])];