*/
int num_tokens(char *source, char tok)
{
- int a = 0;
int count = 1;
+ char *ptr = source;
- if (source == NULL)
+ if (source == NULL) {
return (0);
- for (a = 0; a < strlen(source); ++a) {
- if (source[a] == tok)
+ }
+
+ while (*ptr) {
+ if (*ptr++ == tok) {
++count;
+ }
}
+
return (count);
}
void remove_token(char *source, int parmnum, char separator)
{
int i;
- int len;
+ int len, slen;
int curr_parm;
int start, end;
start = (-1);
end = (-1);
- if (strlen(source) == 0) {
+ slen = strlen(source);
+ if (slen == 0) {
return;
}
- for (i = 0; i < strlen(source); ++i) {
+ for (i = 0;
+ ( (i < slen) && (end == -1) );
+ ++i) {
if ((start < 0) && (curr_parm == parmnum)) {
start = i;
}
}
if (end < 0)
- end = strlen(source);
+ end = slen;
- strcpy(&source[start], &source[end]);
+ memmove(&source[start], &source[end], slen - end + 1);
}
*/
int haschar(char *st,char ch)
{
- int a, b;
+ int a, b, len;
b = 0;
- for (a = 0; a < strlen(st); ++a)
+ len = strlen(st);
+ for (a = 0; a < len; ++a)
if (st[a] == ch)
++b;
return (b);
while (1) {
ch = *ptr++;
- if ((len < (maxlen - 1)) && (ch != 13) && (ch != 10)) {
- buf[strlen(buf) + 1] = 0;
- buf[strlen(buf)] = ch;
- ++len;
+ if ((len + 1 < (maxlen)) && (ch != 13) && (ch != 10)) {
+ buf[len++] = ch;
+ buf[len] = 0;
}
if ((ch == 10) || (ch == 0)) {
return ptr;
int pattern2(char *search, char *patn)
{
int a;
- for (a = 0; a < strlen(search); ++a) {
- if (!strncasecmp(&search[a], patn, strlen(patn)))
+ int len, plen;
+ len = strlen (search);
+ plen = strlen (patn);
+ for (a = 0; a < len; ++a) {
+ if (!strncasecmp(&search[a], patn, plen))
return (a);
}
return (-1);
}
+/**
+ * \brief Strip leading and trailing spaces from a string; with premeasured and adjusted length.
+ * \param buf the string to modify
+ * \param len length of the string.
+ */
+void stripltlen(char *buf, int *len)
+{
+ int delta = 0;
+ if (*len == 0) return;
+ while ((*len > delta) && (isspace(buf[delta]))){
+ delta ++;
+ }
+ memmove (buf, &buf[delta], *len - delta + 1);
+ (*len) -=delta;
+
+ if (*len == 0) return;
+ while (isspace(buf[(*len) - 1])){
+ buf[--(*len)] = '\0';
+ }
+}
+
/**
* \brief Strip leading and trailing spaces from a string
* \param buf the string to modify
*/
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;
+ int len;
+ len = strlen(buf);
+ stripltlen(buf, &len);
}
int a;
int lb = (-1);
int rb = (-1);
+ int len = strlen(str);
do {
lb = (-1);
rb = (-1);
- for (a = 0; a < strlen(str); ++a) {
+ for (a = 0; a < len; ++a) {
if (str[a] == leftboundary)
lb = a;
if (str[a] == rightboundary)
}
if ((lb > 0) && (rb > lb)) {
- strcpy(&str[lb - 1], &str[rb + 1]);
+ memmove(&str[lb - 1], &str[rb + 1], len - rb);
+ len -= (rb - lb + 2);
}
} while ((lb > 0) && (rb > lb));
* \param sourcelen the length of the source data (may contain string terminators)
*/
-void CtdlEncodeBase64(char *dest, const char *source, size_t sourcelen)
+void CtdlEncodeBase64(char *dest, const char *source, size_t sourcelen, int linebreaks)
{
int i, hiteof = FALSE;
int spos = 0;
dest[dpos] = 0;
}
thisline += 4;
- if (thisline > 70) {
+ if ( (linebreaks) && (thisline > 70) ) {
dest[dpos++] = '\r';
dest[dpos++] = '\n';
dest[dpos] = 0;
}
}
}
- if (thisline > 70) {
+ if ( (linebreaks) && (thisline > 70) ) {
dest[dpos++] = '\r';
dest[dpos++] = '\n';
dest[dpos] = 0;
void generate_uuid(char *buf) {
static int seq = 0;
- sprintf(buf, "%s-%lx-%x-%x",
+ sprintf(buf, "%s-%lx-%lx-%x",
serv_info.serv_nodename,
(long)time(NULL),
- getpid(),
+ (long)getpid(),
(seq++)
);
}
+/*
+ * \brief case-insensitive substring search
+ *
+ * This uses the Boyer-Moore search algorithm and is therefore quite fast.
+ * The code is roughly based on the strstr() replacement from 'tin' written
+ * by Urs Jannsen.
+ *
+ * \param text String to be searched
+ * \param pattern String to search for
+ */
+char *bmstrcasestr(char *text, char *pattern) {
+
+ register unsigned char *p, *t;
+ register int i, j, *delta;
+ register size_t p1;
+ int deltaspace[256];
+ size_t textlen;
+ size_t patlen;
+
+ 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[tolower(*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[0]) == tolower(t[0])) {
+ if (strncasecmp ((const char *)(p - p1), (const char *)(t - p1), p1) == 0) {
+ return ((char *)t - p1);
+ }
+ }
+ j = delta[tolower(t[0])];
+ if (i < j)
+ break;
+ i -= j;
+ t += j;
+ }
+ return (NULL);
+}
+
+
+
+
+
/*@}*/
projects / citadel.git / blobdiff