X-Git-Url: http://git.madism.org/?p=apps%2Fmadmutt.git;a=blobdiff_plain;f=lib-lib%2Fstr.c;h=ab603da1ab8e760f8f4f250ac757985427c6418a;hp=3b9b5b5ec267cd6c82d6ab4bf632e6881bcc5576;hb=75b25db9f40ea7bbd11e63652d5fae591b3f1206;hpb=b36dc16c428cc2b1371bb99c0581aa014f302791 diff --git a/lib-lib/str.c b/lib-lib/str.c index 3b9b5b5..ab603da 100644 --- a/lib-lib/str.c +++ b/lib-lib/str.c @@ -17,9 +17,17 @@ * Copyright © 2006 Pierre Habouzit */ -#include "macros.h" -#include "str.h" +/** \addtogroup mutt_strings */ +/*@{*/ +/** \file str.c + * \brief Madmutt string API module implementation. + * \author Pierre Habouzit + */ + +#include "lib-lib.h" + +#ifndef _DOXYGEN_SKIP_ME #define XX 255 unsigned char const __m_strdigits[128] = { XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, XX, @@ -67,13 +75,25 @@ char const __m_b36chars_upper[36] = { 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z' }; +#endif - +/** \brief safe strcpy. + * + * Copies at most n-1 characters from \c src into \c dst, always + * adding a final \c '\\0' in \c dst. + * + * \param[in] dst destination buffer. + * \param[in] n size of the buffer. Negative sizes are allowed. + * \param[in] src source string. + * + * \return \c src \e length. If this value is \>= \c n then the copy was + * truncated. + */ ssize_t m_strcpy(char *dst, ssize_t n, const char *src) { ssize_t len = m_strlen(src); - if (dst && n > 0) { + if (n > 0) { ssize_t dlen = MIN(n - 1, len); memcpy(dst, src, dlen); dst[dlen] = '\0'; @@ -86,7 +106,7 @@ ssize_t m_strncpy(char *dst, ssize_t n, const char *src, ssize_t l) { ssize_t len = MIN(m_strlen(src), l); - if (dst && n > 0) { + if (n > 0) { ssize_t dlen = MIN(n - 1, len); memcpy(dst, src, dlen); dst[dlen] = '\0'; @@ -94,3 +114,86 @@ ssize_t m_strncpy(char *dst, ssize_t n, const char *src, ssize_t l) return len; } + +char *m_strrtrim(char *s) +{ + ssize_t len = m_strlen(s); + + while (len > 1 && ISSPACE(s[len - 1])) + s[--len] = '\0'; + + return s + len; +} + +const char *m_stristrn(const char *haystack, const char *needle, ssize_t nlen) +{ + int nc; + + if (!nlen) + return haystack; + + nc = tolower(*needle); + for (;;) { + int c = tolower(*haystack); + + if (c != nc) { + if (c == '\0') + return NULL; + } else { + ssize_t i; + + /* compare the rest of needle */ + for (i = 1;; i++) { + if (i == nlen) + return haystack; + if (c == '\0') + return NULL; + c = tolower(haystack[i]); + if (c != tolower(needle[i])) + break; + } + } + + haystack++; + } +} + +int ascii_strcasecmp(const char *a, const char *b) +{ + int i; + + if (a == b) + return 0; + if (a == NULL && b) + return -1; + if (b == NULL && a) + return 1; + + for (; *a || *b; a++, b++) { + if ((i = ascii_tolower(*a) - ascii_tolower(*b))) + return i; + } + + return 0; +} + +int ascii_strncasecmp (const char *a, const char *b, ssize_t n) +{ + int i, j; + + if (a == b) + return 0; + if (a == NULL && b) + return -1; + if (b == NULL && a) + return 1; + + for (j = 0; (*a || *b) && j < n; a++, b++, j++) { + if ((i = ascii_tolower(*a) - ascii_tolower(*b))) + return i; + } + + return 0; +} + +/*@}*/