/*
- * tools.c -- Miscellaneous routines
+ * $Id$
+ *
+ * Miscellaneous routines
*/
-#include <ctype.h>
-#include <stdlib.h>
-#include <unistd.h>
-#include <stdio.h>
-#include <fcntl.h>
-#include <signal.h>
-#include <sys/types.h>
-#include <sys/wait.h>
-#include <sys/socket.h>
-#include <sys/time.h>
-#include <limits.h>
-#include <netinet/in.h>
-#include <netdb.h>
-#include <string.h>
-#include <pwd.h>
-#include <errno.h>
-#include <stdarg.h>
-#include <pthread.h>
-#include <signal.h>
-#include <sys/time.h>
#include "webcit.h"
#include "webserver.h"
+
typedef unsigned char byte;
#define FALSE 0
#define TRUE 1
-char *ascmonths[] = {
- "Jan", "Feb", "Mar", "Apr", "May", "Jun",
- "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"
-};
-
-char *ascdays[] = {
- "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat"
-};
-
static byte dtable[256]; /* base64 encode / decode table */
char *safestrncpy(char *dest, const char *src, size_t n)
}
/*
- * extract_token() - a smarter string tokenizer
+ * extract_token() - a string tokenizer
*/
-void extract_token(char *dest, char *source, int parmnum, char separator)
+void extract_token(char *dest, const char *source, int parmnum, char separator, int maxlen)
{
- int i;
- int len;
- int curr_parm;
-
- strcpy(dest, "");
- len = 0;
- curr_parm = 0;
-
- if (strlen(source) == 0) {
- return;
+ char *d; /* dest */
+ const char *s; /* source */
+ int count = 0;
+ int len = 0;
+
+ dest[0] = 0;
+
+ /* Locate desired parameter */
+ s = source;
+ while (count < parmnum) {
+ /* End of string, bail! */
+ if (!*s) {
+ s = NULL;
+ break;
+ }
+ if (*s == separator) {
+ count++;
+ }
+ s++;
}
+ if (!s) return; /* Parameter not found */
- for (i = 0; i < strlen(source); ++i) {
- if (source[i] == separator) {
- ++curr_parm;
- } else if (curr_parm == parmnum) {
- dest[len + 1] = 0;
- dest[len++] = source[i];
- }
+ for (d = dest; *s && *s != separator && ++len<maxlen; s++, d++) {
+ *d = *s;
}
+ *d = 0;
}
/*
* extract_int() - extract an int parm w/o supplying a buffer
*/
-int extract_int(char *source, int parmnum)
+int extract_int(const char *source, int parmnum)
{
- char buf[SIZ];
-
- extract_token(buf, source, parmnum, '|');
- return (atoi(buf));
+ char buf[32];
+
+ extract_token(buf, source, parmnum, '|', sizeof buf);
+ return(atoi(buf));
}
/*
* extract_long() - extract an long parm w/o supplying a buffer
*/
-long extract_long(char *source, long int parmnum)
+long extract_long(const char *source, int parmnum)
{
- char buf[SIZ];
-
- extract_token(buf, source, parmnum, '|');
- return (atol(buf));
+ char buf[32];
+
+ extract_token(buf, source, parmnum, '|', sizeof buf);
+ return(atol(buf));
}
-
-
-
-
-
-
-
-
-
/*
* check for the presence of a character within a string (returns count)
*/
}
-/*
- * Format a date/time stamp for output
- */
-void fmt_date(char *buf, time_t thetime)
-{
- struct tm *tm;
- int hour;
-
- strcpy(buf, "");
- tm = localtime(&thetime);
- hour = tm->tm_hour;
- if (hour == 0)
- hour = 12;
- else if (hour > 12)
- hour = hour - 12;
-
- sprintf(buf, "%s %d %d %2d:%02d%s",
- ascmonths[tm->tm_mon],
- tm->tm_mday,
- tm->tm_year + 1900,
- hour, tm->tm_min, ((tm->tm_hour > 12) ? "pm" : "am")
- );
-}
-
-
-
-/*
- * Format TIME ONLY for output
- */
-void fmt_time(char *buf, time_t thetime)
-{
- struct tm *tm;
- int hour;
-
- strcpy(buf, "");
- tm = localtime(&thetime);
- hour = tm->tm_hour;
- if (hour == 0)
- hour = 12;
- else if (hour > 12)
- hour = hour - 12;
-
- sprintf(buf, "%d:%02d%s",
- hour, tm->tm_min, ((tm->tm_hour > 12) ? "pm" : "am")
- );
-}
-
-
-
-
-/*
- * Format a date/time stamp to the format used in HTTP headers
- */
-void httpdate(char *buf, time_t thetime)
-{
- struct tm *tm;
-
- strcpy(buf, "");
- tm = localtime(&thetime);
-
- sprintf(buf, "%s, %02d %s %4d %02d:%02d:%02d",
- ascdays[tm->tm_wday],
- tm->tm_mday,
- ascmonths[tm->tm_mon],
- tm->tm_year + 1900, tm->tm_hour, tm->tm_min, tm->tm_sec);
-}
-
-
-
-
-
/*
* Utility function to "readline" from memory
* (returns new pointer)
*/
void striplt(char *buf)
{
+ if (strlen(buf) == 0) return;
while ((strlen(buf) > 0) && (isspace(buf[0])))
strcpy(buf, &buf[1]);
+ if (strlen(buf) == 0) return;
while (isspace(buf[strlen(buf) - 1]))
buf[strlen(buf) - 1] = 0;
}
* Determine whether the specified message number is contained within the
* specified set.
*/
-int is_msg_in_mset(char *mset, long msgnum)
-{
+int is_msg_in_mset(char *mset, long msgnum) {
int num_sets;
int s;
char setstr[SIZ], lostr[SIZ], histr[SIZ]; /* was 1024 */
* Now set it for all specified messages.
*/
num_sets = num_tokens(mset, ',');
- for (s = 0; s < num_sets; ++s) {
- extract_token(setstr, mset, s, ',');
+ for (s=0; s<num_sets; ++s) {
+ extract_token(setstr, mset, s, ',', sizeof setstr);
- extract_token(lostr, setstr, 0, ':');
+ extract_token(lostr, setstr, 0, ':', sizeof lostr);
if (num_tokens(setstr, ':') >= 2) {
- extract_token(histr, setstr, 1, ':');
+ extract_token(histr, setstr, 1, ':', sizeof histr);
if (!strcmp(histr, "*")) {
- snprintf(histr, sizeof histr, "%ld",
- LONG_MAX);
+ snprintf(histr, sizeof histr, "%ld", LONG_MAX);
}
- } else {
+ }
+ else {
strcpy(histr, lostr);
}
lo = atol(lostr);
hi = atol(histr);
- if ((msgnum >= lo) && (msgnum <= hi))
- return (1);
+ if ((msgnum >= lo) && (msgnum <= hi)) return(1);
}
- return (0);
+ return(0);
}
+
/*
* Strip a boundarized substring out of a string (for example, remove
* parentheses and anything inside them).
return (dpos);
}
if (dtable[c] & 0x80) {
- /* Ignoring errors: discard invalid character. */
+ /* Ignoring errors: discard invalid character */
i--;
continue;
}
}
}
}
+
+
+
+/*
+ * Generate a new, globally unique UID parameter for a calendar etc. object
+ */
+void generate_uuid(char *buf) {
+ static int seq = 0;
+
+ sprintf(buf, "%s-%lx-%x-%x",
+ serv_info.serv_nodename,
+ (long)time(NULL),
+ getpid(),
+ (seq++)
+ );
+}
+
+
+
+/*
+ * bmstrstr() is a variant of strstr() that uses the Boyer-Moore search
+ * algorithm, and can use any caller-supplied string compare function whose
+ * calling syntax is similar to strncmp(). For example, we can supply it
+ * with strncasecmp() to do a case-insensitive search.
+ *
+ * Original code: copyright (c) 1997-1998 by Urs Janssen <urs@tin.org>
+ * Modifications: copyright (c) 2003 by Art Cancro <ajc@uncensored.citadel.org>
+ */
+char *bmstrstr(char *text, char *pattern,
+ int (*cmpfunc)(const char *, const char *, size_t) )
+{
+ register unsigned char *p, *t;
+ register int i, j, *delta;
+ register size_t p1;
+ int deltaspace[256];
+ size_t textlen;
+ size_t patlen;
+
+ if (text == NULL) return(NULL);
+ if (pattern == NULL) return(NULL);
+
+ textlen = strlen(text);
+ patlen = strlen(pattern);
+
+ /* algorithm fails if pattern is empty */
+ if ((p1 = patlen) == 0)
+ return (text);
+
+ /* code below fails (whenever i is unsigned) if pattern too long */
+ if (p1 > textlen)
+ return (NULL);
+
+ /* set up deltas */
+ delta = deltaspace;
+ for (i = 0; i <= 255; i++)
+ delta[i] = p1;
+ for (p = (unsigned char *) pattern, i = p1; --i > 0;)
+ delta[*p++] = i;
+
+ /*
+ * From now on, we want patlen - 1.
+ * In the loop below, p points to the end of the pattern,
+ * t points to the end of the text to be tested against the
+ * pattern, and i counts the amount of text remaining, not
+ * including the part to be tested.
+ */
+ p1--;
+ p = (unsigned char *) pattern + p1;
+ t = (unsigned char *) text + p1;
+ i = textlen - patlen;
+ while (1) {
+ if (tolower(*p) == tolower(*t)
+ && cmpfunc((p - p1), (t - p1), p1) == 0)
+ return ((char *) t - p1);
+ j = delta[*t];
+ if (i < j)
+ break;
+ i -= j;
+ t += j;
+ }
+ return (NULL);
+}
+
projects / citadel.git / blobdiff