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 */
87 if (*s == separator) {
90 else if ( (current_token == parmnum) && (len < maxlen) ) {
98 if (current_token < parmnum) return(-1);
104 * \brief a tokenizer that kills, maims, and destroys
105 * \param source the string to process
106 * \param parmnum which token to kill
107 * \param separator the tokenizer string
109 void remove_token(char *source, int parmnum, char separator)
121 slen = strlen(source);
127 ( (i < slen) && (end == -1) );
129 if ((start < 0) && (curr_parm == parmnum)) {
133 if ((end < 0) && (curr_parm == (parmnum + 1))) {
137 if (source[i] == separator) {
145 memmove(&source[start], &source[end], slen - end + 1);
152 * \brief extract an int parm w/o supplying a buffer
153 * \param source the string to locate the int in
154 * \param parmnum the n'th token to grab the int from
155 * \return the integer
157 int extract_int(const char *source, int parmnum)
161 extract_token(buf, source, parmnum, '|', sizeof buf);
166 * \brief extract an long parm w/o supplying a buffer
167 * \param source string to examine
168 * \param parmnum n'th token to search long in
169 * \return the found long value
171 long extract_long(const char *source, int parmnum)
175 extract_token(buf, source, parmnum, '|', sizeof buf);
185 * \brief check for the presence of a character within a string (returns count)
186 * \param st the string to examine
187 * \param ch the char to search
188 * \return the position inside of st
190 int haschar(char *st,char ch)
195 for (a = 0; a < len; ++a)
203 * \brief Utility function to "readline" from memory
204 * \param start Location in memory from which we are reading.
205 * \param buf the buffer to place the string in.
206 * \param maxlen Size of string buffer
207 * \return Pointer to the source memory right after we stopped reading.
209 char *memreadline(char *start, char *buf, int maxlen)
213 int len = 0; /**< tally our own length to avoid strlen() delays */
216 memset(buf, 0, maxlen);
220 if ((len + 1 < (maxlen)) && (ch != 13) && (ch != 10)) {
224 if ((ch == 10) || (ch == 0)) {
233 * \brief searches for a paternn within asearch string
234 * \param search the string to search
235 * \param patn the pattern to find in string
236 * \returns position in string
238 int pattern2(char *search, char *patn)
242 len = strlen (search);
243 plen = strlen (patn);
244 for (a = 0; a < len; ++a) {
245 if (!strncasecmp(&search[a], patn, plen))
253 * \brief Strip leading and trailing spaces from a string; with premeasured and adjusted length.
254 * \param buf the string to modify
255 * \param len length of the string.
257 void stripltlen(char *buf, int *len)
260 if (*len == 0) return;
261 while ((*len > delta) && (isspace(buf[delta]))){
264 memmove (buf, &buf[delta], *len - delta + 1);
267 if (*len == 0) return;
268 while (isspace(buf[(*len) - 1])){
269 buf[--(*len)] = '\0';
274 * \brief Strip leading and trailing spaces from a string
275 * \param buf the string to modify
277 void striplt(char *buf)
281 stripltlen(buf, &len);
286 * \brief Determine whether the specified message number is contained within the
289 * \param mset Message set string
290 * \param msgnum Message number we are looking for
292 * \return Nonzero if the specified message number is in the specified message set string.
294 int is_msg_in_mset(char *mset, long msgnum) {
297 char setstr[SIZ], lostr[SIZ], histr[SIZ]; /* was 1024 */
301 * Now set it for all specified messages.
303 num_sets = num_tokens(mset, ',');
304 for (s=0; s<num_sets; ++s) {
305 extract_token(setstr, mset, s, ',', sizeof setstr);
307 extract_token(lostr, setstr, 0, ':', sizeof lostr);
308 if (num_tokens(setstr, ':') >= 2) {
309 extract_token(histr, setstr, 1, ':', sizeof histr);
310 if (!strcmp(histr, "*")) {
311 snprintf(histr, sizeof histr, "%ld", LONG_MAX);
315 strcpy(histr, lostr);
320 if ((msgnum >= lo) && (msgnum <= hi)) return(1);
329 * \brief Strip a boundarized substring out of a string
330 * (for example, remove
331 * parentheses and anything inside them).
333 * This improved version can strip out *multiple* boundarized substrings.
334 * \param str the string to process
335 * \param leftboundary the boundary character on the left side of the target string
336 * \param rightboundary the boundary character on the right side of the target string
338 void stripout(char *str, char leftboundary, char rightboundary)
343 int len = strlen(str);
349 for (a = 0; a < len; ++a) {
350 if (str[a] == leftboundary)
352 if (str[a] == rightboundary)
356 if ((lb > 0) && (rb > lb)) {
357 memmove(&str[lb - 1], &str[rb + 1], len - rb);
358 len -= (rb - lb + 2);
361 } while ((lb > 0) && (rb > lb));
368 * \brief Replacement for sleep() that uses select() in order to avoid SIGALRM
369 * \param seconds how many seconds should we sleep?
371 void sleeeeeeeeeep(int seconds)
377 select(0, NULL, NULL, NULL, &tv);
383 * \brief encode a string into base64 to for example tunnel it through mail transport
384 * CtdlDecodeBase64() and CtdlEncodeBase64() are adaptations of code by
385 * John Walker, copied over from the Citadel server.
386 * \param dest encrypted string
387 * \param source the string to encrypt
388 * \param sourcelen the length of the source data (may contain string terminators)
391 void CtdlEncodeBase64(char *dest, const char *source, size_t sourcelen, int linebreaks)
393 int i, hiteof = FALSE;
398 /** Fill dtable with character encodings. */
400 for (i = 0; i < 26; i++) {
402 dtable[26 + i] = 'a' + i;
404 for (i = 0; i < 10; i++) {
405 dtable[52 + i] = '0' + i;
411 byte igroup[3], ogroup[4];
414 igroup[0] = igroup[1] = igroup[2] = 0;
415 for (n = 0; n < 3; n++) {
416 if (spos >= sourcelen) {
421 igroup[n] = (byte) c;
424 ogroup[0] = dtable[igroup[0] >> 2];
426 dtable[((igroup[0] & 3) << 4) |
429 dtable[((igroup[1] & 0xF) << 2) |
431 ogroup[3] = dtable[igroup[2] & 0x3F];
434 * Replace characters in output stream with "=" pad
435 * characters if fewer than three characters were
436 * read from the end of the input stream.
445 for (i = 0; i < 4; i++) {
446 dest[dpos++] = ogroup[i];
450 if ( (linebreaks) && (thisline > 70) ) {
458 if ( (linebreaks) && (thisline > 70) ) {
468 * \brief Convert base64-encoded to binary.
469 * It will stop after reading 'length' bytes.
471 * \param dest The destination buffer
472 * \param source The base64 data to be decoded.
473 * \param length The number of bytes to decode.
474 * \return The actual length of the decoded data.
476 int CtdlDecodeBase64(char *dest, const char *source, size_t length)
482 for (i = 0; i < 255; i++) {
485 for (i = 'A'; i <= 'Z'; i++) {
486 dtable[i] = 0 + (i - 'A');
488 for (i = 'a'; i <= 'z'; i++) {
489 dtable[i] = 26 + (i - 'a');
491 for (i = '0'; i <= '9'; i++) {
492 dtable[i] = 52 + (i - '0');
498 /**CONSTANTCONDITION*/ while (TRUE) {
499 byte a[4], b[4], o[3];
501 for (i = 0; i < 4; i++) {
502 if (spos >= length) {
513 if (dtable[c] & 0x80) {
514 /** Ignoring errors: discard invalid character */
519 b[i] = (byte) dtable[c];
521 o[0] = (b[0] << 2) | (b[1] >> 4);
522 o[1] = (b[1] << 4) | (b[2] >> 2);
523 o[2] = (b[2] << 6) | b[3];
524 i = a[2] == '=' ? 1 : (a[3] == '=' ? 2 : 3);
541 * \brief Generate a new, globally unique UID parameter for a calendar etc. object
543 * \param buf String buffer into which our newly created UUID should be placed
545 void generate_uuid(char *buf) {
548 sprintf(buf, "%s-%lx-%lx-%x",
549 serv_info.serv_nodename,
558 * \brief Local replacement for controversial C library function that generates
559 * names for temporary files. Included to shut up compiler warnings.
560 * \todo return a fd to the file instead of the name for security reasons
561 * \param name the created filename
562 * \param len the length of the filename
564 void CtdlMakeTempFileName(char *name, int len) {
567 while (i++, i < 100) {
568 snprintf(name, len, "/tmp/ctdl.%04x.%04x",
572 if (!access(name, F_OK)) {
581 * \brief case-insensitive substring search
583 * This uses the Boyer-Moore search algorithm and is therefore quite fast.
584 * The code is roughly based on the strstr() replacement from 'tin' written
587 * \param text String to be searched
588 * \param pattern String to search for
590 char *bmstrcasestr(char *text, char *pattern) {
592 register unsigned char *p, *t;
593 register int i, j, *delta;
599 textlen = strlen (text);
600 patlen = strlen (pattern);
602 /* algorithm fails if pattern is empty */
603 if ((p1 = patlen) == 0)
606 /* code below fails (whenever i is unsigned) if pattern too long */
612 for (i = 0; i <= 255; i++)
614 for (p = (unsigned char *) pattern, i = p1; --i > 0;)
615 delta[tolower(*p++)] = i;
618 * From now on, we want patlen - 1.
619 * In the loop below, p points to the end of the pattern,
620 * t points to the end of the text to be tested against the
621 * pattern, and i counts the amount of text remaining, not
622 * including the part to be tested.
625 p = (unsigned char *) pattern + p1;
626 t = (unsigned char *) text + p1;
627 i = textlen - patlen;
629 if (tolower(p[0]) == tolower(t[0])) {
630 if (strncasecmp ((const char *)(p - p1), (const char *)(t - p1), p1) == 0) {
631 return ((char *)t - p1);
634 j = delta[tolower(t[0])];