/*
* A basic toolset containing miscellaneous functions for string manipluation,
* encoding/decoding, and a bunch of other stuff.
+ *
+ * Copyright (c) 1987-2011 by the citadel.org team
+ *
+ * This program is open source software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation; either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
char *ptr;
size_t new_len = 0;
- if (!buf) {
+ if ((buf == NULL) || (*buf == '\0')) {
return 0;
}
* \brief check for the presence of a character within a string (returns count)
* \param st the string to examine
* \param ch the char to search
- * \return the position inside of st
+ * \return the number of times ch appears in st
*/
-int haschar(const char *st,int ch)
+int haschar(const char *st, int ch)
{
const char *ptr;
int b;
}
+/**
+ * \brief Utility function to "readline" from memory
+ * \param start Location in memory from which we are reading.
+ * \param buf the buffer to place the string in.
+ * \param maxlen Size of string buffer
+ * \return Pointer to the source memory right after we stopped reading.
+ */
+const char *cmemreadline(const char *start, char *buf, int maxlen)
+{
+ char ch;
+ const char *ptr;
+ int len = 0; /**< tally our own length to avoid strlen() delays */
+
+ ptr = start;
+
+ while (1) {
+ ch = *ptr++;
+ if ((len + 1 < (maxlen)) && (ch != 13) && (ch != 10)) {
+ buf[len++] = ch;
+ }
+ if ((ch == 10) || (ch == 0)) {
+ buf[len] = 0;
+ return ptr;
+ }
+ }
+}
+
+
+/**
+ * \brief Utility function to "readline" from memory
+ * \param start Location in memory from which we are reading.
+ * \param buf the buffer to place the string in.
+ * \param maxlen Size of string buffer
+ * \param retlen the length of the returned string
+ * \return Pointer to the source memory right after we stopped reading.
+ */
+const char *cmemreadlinelen(const char *start, char *buf, int maxlen, int *retlen)
+{
+ char ch;
+ const char *ptr;
+ int len = 0; /**< tally our own length to avoid strlen() delays */
+
+ ptr = start;
+
+ while (1) {
+ ch = *ptr++;
+ if ((len + 1 < (maxlen)) && (ch != 13) && (ch != 10)) {
+ buf[len++] = ch;
+ }
+ if ((ch == 10) || (ch == 0)) {
+ buf[len] = 0;
+ *retlen = len;
+ return ptr;
+ }
+ }
+}
+
+
/*
* Reduce a string down to a boundarized substring (for example, remove
* parentheses and anything outside them).
*/
-void stripallbut(char *str, char leftboundary, char rightboundary) {
- int a;
-
- for (a = 0; a < strlen(str); ++ a) {
- if (str[a] == leftboundary) strcpy(str, &str[a+1]);
- }
-
- for (a = 0; a < strlen(str); ++ a) {
- if (str[a] == rightboundary) str[a] = 0;
+long stripallbut(char *str, char leftboundary, char rightboundary) {
+ long len = 0;
+
+ char *lb = NULL;
+ char *rb = NULL;
+
+ lb = strrchr(str, leftboundary);
+ if (lb != NULL) {
+ ++lb;
+ rb = strchr(str, rightboundary);
+ if ((rb != NULL) && (rb >= lb)) {
+ *rb = 0;
+ fflush(stderr);
+ len = (long)rb - (long)lb;
+ memmove(str, lb, len);
+ str[len] = 0;
+ return(len);
+ }
}
+ return (long)strlen(str);
}
+
char *myfgets(char *s, int size, FILE *stream) {
char *ret = fgets(s, size, stream);
char *nl;
* Generate a new, globally unique UID parameter for a calendar etc. object
*/
void generate_uuid(char *buf) {
- static int seq = 0;
+ static int seq = (-1);
- sprintf(buf, "%lx-%lx-%x",
- time(NULL),
+ if (seq == (-1)) {
+ seq = (int)rand();
+ }
+ ++seq;
+ seq = (seq % 0x0FFF) ;
+
+ sprintf(buf, "%08lx-%04lx-4%03x-a%03x-%012lx",
+ (long)time(NULL),
(long)getpid(),
- (seq++)
+ seq,
+ seq,
+ (long)rand()
);
}
* The code is roughly based on the strstr() replacement from 'tin' written
* by Urs Jannsen.
*/
-inline char *_bmstrcasestr_len(char *text, size_t textlen, char *pattern, size_t patlen) {
+inline static char *_bmstrcasestr_len(char *text, size_t textlen, const char *pattern, size_t patlen) {
register unsigned char *p, *t;
register int i, j, *delta;
* The code is roughly based on the strstr() replacement from 'tin' written
* by Urs Jannsen.
*/
-char *bmstrcasestr(char *text, char *pattern) {
+char *bmstrcasestr(char *text, const char *pattern) {
size_t textlen;
size_t patlen;
return _bmstrcasestr_len(text, textlen, pattern, patlen);
}
-char *bmstrcasestr_len(char *text, size_t textlen, char *pattern, size_t patlen) {
+char *bmstrcasestr_len(char *text, size_t textlen, const char *pattern, size_t patlen) {
return _bmstrcasestr_len(text, textlen, pattern, patlen);
}
+
+
+
+/*
+ * bmstrcasestr() -- 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.
+ */
+inline static const char *_cbmstrcasestr_len(const char *text, size_t textlen, const char *pattern, size_t patlen) {
+
+ register unsigned char *p, *t;
+ register int i, j, *delta;
+ register size_t p1;
+ int deltaspace[256];
+
+ if (!text) return(NULL);
+ if (!pattern) return(NULL);
+
+ /* 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);
+}
+
+/*
+ * bmstrcasestr() -- 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.
+ */
+const char *cbmstrcasestr(const char *text, const char *pattern) {
+ size_t textlen;
+ size_t patlen;
+
+ if (!text) return(NULL);
+ if (!pattern) return(NULL);
+
+ textlen = strlen (text);
+ patlen = strlen (pattern);
+
+ return _cbmstrcasestr_len(text, textlen, pattern, patlen);
+}
+
+const char *cbmstrcasestr_len(const char *text, size_t textlen, const char *pattern, size_t patlen) {
+ return _cbmstrcasestr_len(text, textlen, pattern, patlen);
+}
+
/*
* Local replacement for controversial C library function that generates
* names for temporary files. Included to shut up compiler warnings.
}
+/*
+ * check whether the provided string needs to be qp encoded or not
+ */
+int CheckEncode(const char *pch, long len, const char *pche)
+{
+ if (pche == NULL)
+ pche = pch + len;
+ while (pch < pche) {
+ if (((unsigned char) *pch < 32) ||
+ ((unsigned char) *pch > 126)) {
+ return 1;
+ }
+ pch++;
+ }
+ return 0;
+}
+