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);
123 for (i = 0; i < slen; ++i) {
124 if ((start < 0) && (curr_parm == parmnum)) {
128 if ((end < 0) && (curr_parm == (parmnum + 1))) {
132 if (source[i] == separator) {
138 end = strlen(source);
140 memmove(&source[start], &source[end], slen - end);
147 * \brief extract an int parm w/o supplying a buffer
148 * \param source the string to locate the int in
149 * \param parmnum the n'th token to grab the int from
150 * \return the integer
152 int extract_int(const char *source, int parmnum)
156 extract_token(buf, source, parmnum, '|', sizeof buf);
161 * \brief extract an long parm w/o supplying a buffer
162 * \param source string to examine
163 * \param parmnum n'th token to search long in
164 * \return the found long value
166 long extract_long(const char *source, int parmnum)
170 extract_token(buf, source, parmnum, '|', sizeof buf);
180 * \brief check for the presence of a character within a string (returns count)
181 * \param st the string to examine
182 * \param ch the char to search
183 * \return the position inside of st
185 int haschar(char *st,char ch)
189 for (a = 0; a < strlen(st); ++a)
197 * \brief Utility function to "readline" from memory
198 * \param start Location in memory from which we are reading.
199 * \param buf the buffer to place the string in.
200 * \param maxlen Size of string buffer
201 * \return Pointer to the source memory right after we stopped reading.
203 char *memreadline(char *start, char *buf, int maxlen)
207 int len = 0; /**< tally our own length to avoid strlen() delays */
210 memset(buf, 0, maxlen);
214 if ((len < (maxlen - 1)) && (ch != 13) && (ch != 10)) {
215 buf[strlen(buf) + 1] = 0;
216 buf[strlen(buf)] = ch;
219 if ((ch == 10) || (ch == 0)) {
228 * \brief searches for a paternn within asearch string
229 * \param search the string to search
230 * \param patn the pattern to find in string
231 * \returns position in string
233 int pattern2(char *search, char *patn)
236 for (a = 0; a < strlen(search); ++a) {
237 if (!strncasecmp(&search[a], patn, strlen(patn)))
245 * \brief Strip leading and trailing spaces from a string
246 * \param buf the string to modify
248 void striplt(char *buf)
250 if (strlen(buf) == 0) return;
251 while ((strlen(buf) > 0) && (isspace(buf[0])))
252 strcpy(buf, &buf[1]);
253 if (strlen(buf) == 0) return;
254 while (isspace(buf[strlen(buf) - 1]))
255 buf[strlen(buf) - 1] = 0;
260 * \brief Determine whether the specified message number is contained within the
263 * \param mset Message set string
264 * \param msgnum Message number we are looking for
266 * \return Nonzero if the specified message number is in the specified message set string.
268 int is_msg_in_mset(char *mset, long msgnum) {
271 char setstr[SIZ], lostr[SIZ], histr[SIZ]; /* was 1024 */
275 * Now set it for all specified messages.
277 num_sets = num_tokens(mset, ',');
278 for (s=0; s<num_sets; ++s) {
279 extract_token(setstr, mset, s, ',', sizeof setstr);
281 extract_token(lostr, setstr, 0, ':', sizeof lostr);
282 if (num_tokens(setstr, ':') >= 2) {
283 extract_token(histr, setstr, 1, ':', sizeof histr);
284 if (!strcmp(histr, "*")) {
285 snprintf(histr, sizeof histr, "%ld", LONG_MAX);
289 strcpy(histr, lostr);
294 if ((msgnum >= lo) && (msgnum <= hi)) return(1);
303 * \brief Strip a boundarized substring out of a string
304 * (for example, remove
305 * parentheses and anything inside them).
307 * This improved version can strip out *multiple* boundarized substrings.
308 * \param str the string to process
309 * \param leftboundary the boundary character on the left side of the target string
310 * \param rightboundary the boundary character on the right side of the target string
312 void stripout(char *str, char leftboundary, char rightboundary)
322 for (a = 0; a < strlen(str); ++a) {
323 if (str[a] == leftboundary)
325 if (str[a] == rightboundary)
329 if ((lb > 0) && (rb > lb)) {
330 strcpy(&str[lb - 1], &str[rb + 1]);
333 } while ((lb > 0) && (rb > lb));
340 * \brief Replacement for sleep() that uses select() in order to avoid SIGALRM
341 * \param seconds how many seconds should we sleep?
343 void sleeeeeeeeeep(int seconds)
349 select(0, NULL, NULL, NULL, &tv);
355 * \brief encode a string into base64 to for example tunnel it through mail transport
356 * CtdlDecodeBase64() and CtdlEncodeBase64() are adaptations of code by
357 * John Walker, copied over from the Citadel server.
358 * \param dest encrypted string
359 * \param source the string to encrypt
360 * \param sourcelen the length of the source data (may contain string terminators)
363 void CtdlEncodeBase64(char *dest, const char *source, size_t sourcelen, int linebreaks)
365 int i, hiteof = FALSE;
370 /** Fill dtable with character encodings. */
372 for (i = 0; i < 26; i++) {
374 dtable[26 + i] = 'a' + i;
376 for (i = 0; i < 10; i++) {
377 dtable[52 + i] = '0' + i;
383 byte igroup[3], ogroup[4];
386 igroup[0] = igroup[1] = igroup[2] = 0;
387 for (n = 0; n < 3; n++) {
388 if (spos >= sourcelen) {
393 igroup[n] = (byte) c;
396 ogroup[0] = dtable[igroup[0] >> 2];
398 dtable[((igroup[0] & 3) << 4) |
401 dtable[((igroup[1] & 0xF) << 2) |
403 ogroup[3] = dtable[igroup[2] & 0x3F];
406 * Replace characters in output stream with "=" pad
407 * characters if fewer than three characters were
408 * read from the end of the input stream.
417 for (i = 0; i < 4; i++) {
418 dest[dpos++] = ogroup[i];
422 if ( (linebreaks) && (thisline > 70) ) {
430 if ( (linebreaks) && (thisline > 70) ) {
440 * \brief Convert base64-encoded to binary.
441 * It will stop after reading 'length' bytes.
443 * \param dest The destination buffer
444 * \param source The base64 data to be decoded.
445 * \param length The number of bytes to decode.
446 * \return The actual length of the decoded data.
448 int CtdlDecodeBase64(char *dest, const char *source, size_t length)
454 for (i = 0; i < 255; i++) {
457 for (i = 'A'; i <= 'Z'; i++) {
458 dtable[i] = 0 + (i - 'A');
460 for (i = 'a'; i <= 'z'; i++) {
461 dtable[i] = 26 + (i - 'a');
463 for (i = '0'; i <= '9'; i++) {
464 dtable[i] = 52 + (i - '0');
470 /**CONSTANTCONDITION*/ while (TRUE) {
471 byte a[4], b[4], o[3];
473 for (i = 0; i < 4; i++) {
474 if (spos >= length) {
485 if (dtable[c] & 0x80) {
486 /** Ignoring errors: discard invalid character */
491 b[i] = (byte) dtable[c];
493 o[0] = (b[0] << 2) | (b[1] >> 4);
494 o[1] = (b[1] << 4) | (b[2] >> 2);
495 o[2] = (b[2] << 6) | b[3];
496 i = a[2] == '=' ? 1 : (a[3] == '=' ? 2 : 3);
513 * \brief Generate a new, globally unique UID parameter for a calendar etc. object
515 * \param buf String buffer into which our newly created UUID should be placed
517 void generate_uuid(char *buf) {
520 sprintf(buf, "%s-%lx-%lx-%x",
521 serv_info.serv_nodename,
530 * \brief Local replacement for controversial C library function that generates
531 * names for temporary files. Included to shut up compiler warnings.
532 * \todo return a fd to the file instead of the name for security reasons
533 * \param name the created filename
534 * \param len the length of the filename
536 void CtdlMakeTempFileName(char *name, int len) {
539 while (i++, i < 100) {
540 snprintf(name, len, "/tmp/ctdl.%04x.%04x",
544 if (!access(name, F_OK)) {
553 * \brief case-insensitive substring search
555 * This uses the Boyer-Moore search algorithm and is therefore quite fast.
556 * The code is roughly based on the strstr() replacement from 'tin' written
559 * \param text String to be searched
560 * \param pattern String to search for
562 char *bmstrcasestr(char *text, char *pattern) {
564 register unsigned char *p, *t;
565 register int i, j, *delta;
571 textlen = strlen (text);
572 patlen = strlen (pattern);
574 /* algorithm fails if pattern is empty */
575 if ((p1 = patlen) == 0)
578 /* code below fails (whenever i is unsigned) if pattern too long */
584 for (i = 0; i <= 255; i++)
586 for (p = (unsigned char *) pattern, i = p1; --i > 0;)
587 delta[tolower(*p++)] = i;
590 * From now on, we want patlen - 1.
591 * In the loop below, p points to the end of the pattern,
592 * t points to the end of the text to be tested against the
593 * pattern, and i counts the amount of text remaining, not
594 * including the part to be tested.
597 p = (unsigned char *) pattern + p1;
598 t = (unsigned char *) text + p1;
599 i = textlen - patlen;
601 if (tolower(p[0]) == tolower(t[0])) {
602 if (strncasecmp ((const char *)(p - p1), (const char *)(t - p1), p1) == 0) {
603 return ((char *)t - p1);
606 j = delta[tolower(t[0])];