X-Git-Url: https://diplodocus.org/git/nmh/blobdiff_plain/5dd6771b28c257af405d7248639ed0e3bcdce38b..349ccb810b6e89b1830dbbe70c9e805a2773fcbe:/sbr/utils.c diff --git a/sbr/utils.c b/sbr/utils.c index 48969abc..7f0760a0 100644 --- a/sbr/utils.c +++ b/sbr/utils.c @@ -9,9 +9,7 @@ #include #include -#include #include -#include /* * We allocate space for messages (msgs array) @@ -94,7 +92,7 @@ pwd(void) * -- malloc'ed memory. Then free "s1". */ char * -add (char *s2, char *s1) +add (const char *s2, char *s1) { char *cp; size_t len1 = 0, len2 = 0; @@ -122,11 +120,24 @@ add (char *s2, char *s1) return cp; } +/* + * addlist + * Append an item to a comma separated list + */ +char * +addlist (char *list, const char *item) +{ + if (list) + list = add (", ", list); + + return add (item, list); +} + /* * folder_exists * Check to see if a folder exists. */ -int folder_exists(char *folder) +int folder_exists(const char *folder) { struct stat st; int exists = 0; @@ -200,17 +211,35 @@ num_digits (int n) /* * Append a message arg to an array of them, resizing it if necessary. - * The function is written to suit the arg parsing code it was extracted - * from, and will probably be changed when the other code is cleaned up. + * Really a simple vector-of-(char *) maintenance routine. */ void app_msgarg(struct msgs_array *msgs, char *cp) { - if(msgs->size >= msgs->max) - msgs->msgs = mh_xrealloc(msgs->msgs, (msgs->max+=MAXMSGS)*sizeof(*msgs->msgs)); + if(msgs->size >= msgs->max) { + msgs->max += MAXMSGS; + msgs->msgs = mh_xrealloc(msgs->msgs, + msgs->max * sizeof(*msgs->msgs)); + } msgs->msgs[msgs->size++] = cp; } +/* + * Append a message number to an array of them, resizing it if necessary. + * Like app_msgarg, but with a vector-of-ints instead. + */ + +void +app_msgnum(struct msgnum_array *msgs, int msgnum) +{ + if (msgs->size >= msgs->max) { + msgs->max += MAXMSGS; + msgs->msgnums = mh_xrealloc(msgs->msgnums, + msgs->max * sizeof(*msgs->msgnums)); + } + msgs->msgnums[msgs->size++] = msgnum; +} + /* Open a form or components file */ int open_form(char **form, char *def) @@ -226,3 +255,65 @@ open_form(char **form, char *def) } return in; } + + +/* + * Finds first occurrence of str in buf. buf is not a C string but a + * byte array of length buflen. str is a null-terminated C string. + * find_str() does not modify buf but passes back a non-const char * + * pointer so that the caller can modify it. + */ +char * +find_str (const char buf[], size_t buflen, const char *str) { + const size_t len = strlen (str); + size_t i; + + for (i = 0; i + len <= buflen; ++i, ++buf) { + if (! memcmp (buf, str, len)) return (char *) buf; + } + + return NULL; +} + + +/* + * Finds last occurrence of str in buf. buf is not a C string but a + * byte array of length buflen. str is a null-terminated C string. + * find_str() does not modify buf but passes back a non-const char * + * pointer so that the caller can modify it. + */ +char * +rfind_str (const char buf[], size_t buflen, const char *str) { + const size_t len = strlen (str); + size_t i; + + for (i = 0, buf += buflen - len; i + len <= buflen; ++i, --buf) { + if (! memcmp (buf, str, len)) return (char *) buf; + } + + return NULL; +} + + +/* POSIX doesn't have strcasestr() so emulate it. */ +char * +nmh_strcasestr (const char *s1, const char *s2) { + const size_t len = strlen (s2); + + if (isupper ((unsigned char) s2[0]) || islower ((unsigned char)s2[0])) { + char first[3]; + first[0] = (char) toupper ((unsigned char) s2[0]); + first[1] = (char) tolower ((unsigned char) s2[0]); + first[2] = '\0'; + + for (s1 = strpbrk (s1, first); s1; s1 = strpbrk (++s1, first)) { + if (! strncasecmp (s1, s2, len)) return (char *) s1; + } + } else { + for (s1 = strchr (s1, s2[0]); s1; s1 = strchr (++s1, s2[0])) { + if (! strncasecmp (s1, s2, len)) return (char *) s1; + } + } + + return NULL; +}