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(const char *st,char ch)
196 while (!IsEmptyStr(ptr))
204 * \brief Utility function to "readline" from memory
205 * \param start Location in memory from which we are reading.
206 * \param buf the buffer to place the string in.
207 * \param maxlen Size of string buffer
208 * \return Pointer to the source memory right after we stopped reading.
210 char *memreadline(char *start, char *buf, int maxlen)
214 int len = 0; /**< tally our own length to avoid strlen() delays */
219 if ((len + 1 < (maxlen)) && (ch != 13) && (ch != 10)) {
222 if ((ch == 10) || (ch == 0)) {
232 * \brief searches for a paternn within asearch string
233 * \param search the string to search
234 * \param patn the pattern to find in string
235 * \returns position in string
237 int pattern2(char *search, char *patn)
241 len = strlen (search);
242 plen = strlen (patn);
243 for (a = 0; a < len; ++a) {
244 if (!strncasecmp(&search[a], patn, plen))
252 * \brief Strip leading and trailing spaces from a string; with premeasured and adjusted length.
253 * \param buf the string to modify
254 * \param len length of the string.
256 void stripltlen(char *buf, int *len)
259 if (*len == 0) return;
260 while ((*len > delta) && (isspace(buf[delta]))){
263 memmove (buf, &buf[delta], *len - delta + 1);
266 if (*len == 0) return;
267 while (isspace(buf[(*len) - 1])){
268 buf[--(*len)] = '\0';
273 * \brief Strip leading and trailing spaces from a string
274 * \param buf the string to modify
276 void striplt(char *buf)
280 stripltlen(buf, &len);
285 * \brief Determine whether the specified message number is contained within the
288 * \param mset Message set string
289 * \param msgnum Message number we are looking for
291 * \return Nonzero if the specified message number is in the specified message set string.
293 int is_msg_in_mset(char *mset, long msgnum) {
296 char setstr[SIZ], lostr[SIZ], histr[SIZ]; /* was 1024 */
300 * Now set it for all specified messages.
302 num_sets = num_tokens(mset, ',');
303 for (s=0; s<num_sets; ++s) {
304 extract_token(setstr, mset, s, ',', sizeof setstr);
306 extract_token(lostr, setstr, 0, ':', sizeof lostr);
307 if (num_tokens(setstr, ':') >= 2) {
308 extract_token(histr, setstr, 1, ':', sizeof histr);
309 if (!strcmp(histr, "*")) {
310 snprintf(histr, sizeof histr, "%ld", LONG_MAX);
314 strcpy(histr, lostr);
319 if ((msgnum >= lo) && (msgnum <= hi)) return(1);
328 * \brief Strip a boundarized substring out of a string
329 * (for example, remove
330 * parentheses and anything inside them).
332 * This improved version can strip out *multiple* boundarized substrings.
333 * \param str the string to process
334 * \param leftboundary the boundary character on the left side of the target string
335 * \param rightboundary the boundary character on the right side of the target string
337 void stripout(char *str, char leftboundary, char rightboundary)
342 int len = strlen(str);
348 for (a = 0; a < len; ++a) {
349 if (str[a] == leftboundary)
351 if (str[a] == rightboundary)
355 if ((lb > 0) && (rb > lb)) {
356 memmove(&str[lb - 1], &str[rb + 1], len - rb);
357 len -= (rb - lb + 2);
360 } while ((lb > 0) && (rb > lb));
367 * \brief Replacement for sleep() that uses select() in order to avoid SIGALRM
368 * \param seconds how many seconds should we sleep?
370 void sleeeeeeeeeep(int seconds)
376 select(0, NULL, NULL, NULL, &tv);
382 * \brief encode a string into base64 to for example tunnel it through mail transport
383 * CtdlDecodeBase64() and CtdlEncodeBase64() are adaptations of code by
384 * John Walker, copied over from the Citadel server.
385 * \param dest encrypted string
386 * \param source the string to encrypt
387 * \param sourcelen the length of the source data (may contain string terminators)
390 void CtdlEncodeBase64(char *dest, const char *source, size_t sourcelen, int linebreaks)
392 int i, hiteof = FALSE;
397 /** Fill dtable with character encodings. */
399 for (i = 0; i < 26; i++) {
401 dtable[26 + i] = 'a' + i;
403 for (i = 0; i < 10; i++) {
404 dtable[52 + i] = '0' + i;
410 byte igroup[3], ogroup[4];
413 igroup[0] = igroup[1] = igroup[2] = 0;
414 for (n = 0; n < 3; n++) {
415 if (spos >= sourcelen) {
420 igroup[n] = (byte) c;
423 ogroup[0] = dtable[igroup[0] >> 2];
425 dtable[((igroup[0] & 3) << 4) |
428 dtable[((igroup[1] & 0xF) << 2) |
430 ogroup[3] = dtable[igroup[2] & 0x3F];
433 * Replace characters in output stream with "=" pad
434 * characters if fewer than three characters were
435 * read from the end of the input stream.
444 for (i = 0; i < 4; i++) {
445 dest[dpos++] = ogroup[i];
449 if ( (linebreaks) && (thisline > 70) ) {
457 if ( (linebreaks) && (thisline > 70) ) {
467 * \brief Convert base64-encoded to binary.
468 * It will stop after reading 'length' bytes.
470 * \param dest The destination buffer
471 * \param source The base64 data to be decoded.
472 * \param length The number of bytes to decode.
473 * \return The actual length of the decoded data.
475 int CtdlDecodeBase64(char *dest, const char *source, size_t length)
481 for (i = 0; i < 255; i++) {
484 for (i = 'A'; i <= 'Z'; i++) {
485 dtable[i] = 0 + (i - 'A');
487 for (i = 'a'; i <= 'z'; i++) {
488 dtable[i] = 26 + (i - 'a');
490 for (i = '0'; i <= '9'; i++) {
491 dtable[i] = 52 + (i - '0');
497 /**CONSTANTCONDITION*/ while (TRUE) {
498 byte a[4], b[4], o[3];
500 for (i = 0; i < 4; i++) {
501 if (spos >= length) {
512 if (dtable[c] & 0x80) {
513 /** Ignoring errors: discard invalid character */
518 b[i] = (byte) dtable[c];
520 o[0] = (b[0] << 2) | (b[1] >> 4);
521 o[1] = (b[1] << 4) | (b[2] >> 2);
522 o[2] = (b[2] << 6) | b[3];
523 i = a[2] == '=' ? 1 : (a[3] == '=' ? 2 : 3);
540 * \brief Generate a new, globally unique UID parameter for a calendar etc. object
542 * \param buf String buffer into which our newly created UUID should be placed
544 void generate_uuid(char *buf) {
547 sprintf(buf, "%s-%lx-%lx-%x",
548 serv_info.serv_nodename,
557 * \brief Local replacement for controversial C library function that generates
558 * names for temporary files. Included to shut up compiler warnings.
559 * \todo return a fd to the file instead of the name for security reasons
560 * \param name the created filename
561 * \param len the length of the filename
563 void CtdlMakeTempFileName(char *name, int len) {
566 while (i++, i < 100) {
567 snprintf(name, len, "/tmp/ctdl.%04x.%04x",
571 if (!access(name, F_OK)) {
580 * \brief case-insensitive substring search
582 * This uses the Boyer-Moore search algorithm and is therefore quite fast.
583 * The code is roughly based on the strstr() replacement from 'tin' written
586 * \param text String to be searched
587 * \param pattern String to search for
589 char *bmstrcasestr(char *text, char *pattern) {
591 register unsigned char *p, *t;
592 register int i, j, *delta;
598 textlen = strlen (text);
599 patlen = strlen (pattern);
601 /* algorithm fails if pattern is empty */
602 if ((p1 = patlen) == 0)
605 /* code below fails (whenever i is unsigned) if pattern too long */
611 for (i = 0; i <= 255; i++)
613 for (p = (unsigned char *) pattern, i = p1; --i > 0;)
614 delta[tolower(*p++)] = i;
617 * From now on, we want patlen - 1.
618 * In the loop below, p points to the end of the pattern,
619 * t points to the end of the text to be tested against the
620 * pattern, and i counts the amount of text remaining, not
621 * including the part to be tested.
624 p = (unsigned char *) pattern + p1;
625 t = (unsigned char *) text + p1;
626 i = textlen - patlen;
628 if (tolower(p[0]) == tolower(t[0])) {
629 if (strncasecmp ((const char *)(p - p1), (const char *)(t - p1), p1) == 0) {
630 return ((char *)t - p1);
633 j = delta[tolower(t[0])];