mirror of
https://github.com/servalproject/serval-dna.git
synced 2024-12-24 15:26:43 +00:00
276 lines
11 KiB
C
276 lines
11 KiB
C
/*
|
|
Serval string primitives
|
|
Copyright (C) 2012 Serval Project Inc.
|
|
|
|
This program is free 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 2
|
|
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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
*/
|
|
|
|
#ifndef __STR_H__
|
|
#define __STR_H__
|
|
|
|
#include <string.h>
|
|
#include <stdint.h>
|
|
#include <sys/types.h>
|
|
#include <ctype.h>
|
|
#include <alloca.h>
|
|
|
|
#ifndef __STR_INLINE
|
|
# if __GNUC__ && !__GNUC_STDC_INLINE__
|
|
# define __STR_INLINE extern inline
|
|
# else
|
|
# define __STR_INLINE inline
|
|
# endif
|
|
#endif
|
|
|
|
/* Return true iff 'len' bytes starting at 'text' are hex digits, upper or lower case.
|
|
* Does not check the following byte.
|
|
*
|
|
* @author Andrew Bettison <andrew@servalproject.com>
|
|
*/
|
|
__STR_INLINE int is_xsubstring(const char *text, int len)
|
|
{
|
|
while (len--)
|
|
if (!isxdigit(*text++))
|
|
return 0;
|
|
return 1;
|
|
}
|
|
|
|
/* Return true iff the nul-terminated string 'text' has length 'len' and consists only of hex
|
|
* digits, upper or lower case.
|
|
*
|
|
* @author Andrew Bettison <andrew@servalproject.com>
|
|
*/
|
|
__STR_INLINE int is_xstring(const char *text, int len)
|
|
{
|
|
while (len--)
|
|
if (!isxdigit(*text++))
|
|
return 0;
|
|
return *text == '\0';
|
|
}
|
|
|
|
extern const char hexdigit[16];
|
|
char *tohex(char *dstHex, const unsigned char *srcBinary, size_t bytes);
|
|
size_t fromhex(unsigned char *dstBinary, const char *srcHex, size_t nbinary);
|
|
int fromhexstr(unsigned char *dstBinary, const char *srcHex, size_t nbinary);
|
|
int is_all_matching(const unsigned char *ptr, size_t len, unsigned char value);
|
|
char *str_toupper_inplace(char *s);
|
|
|
|
#define alloca_tohex(buf,len) tohex((char *)alloca((len)*2+1), (buf), (len))
|
|
|
|
__STR_INLINE int hexvalue(char c)
|
|
{
|
|
if (c >= '0' && c <= '9') return c - '0';
|
|
if (c >= 'A' && c <= 'F') return c - 'A' + 10;
|
|
if (c >= 'a' && c <= 'f') return c - 'a' + 10;
|
|
return -1;
|
|
}
|
|
|
|
char *toprint(char *dstStr, ssize_t dstBufSiz, const char *srcBuf, size_t srcBytes, const char quotes[2]);
|
|
char *toprint_str(char *dstStr, ssize_t dstBufSiz, const char *srcStr, const char quotes[2]);
|
|
size_t toprint_len(const char *srcBuf, size_t srcBytes, const char quotes[2]);
|
|
size_t toprint_str_len(const char *srcStr, const char quotes[2]);
|
|
size_t str_fromprint(unsigned char *dst, const char *src);
|
|
|
|
#define alloca_toprint(dstlen,buf,len) toprint((char *)alloca((dstlen) == -1 ? toprint_len((const char *)(buf),(len), "``") + 1 : (dstlen)), (dstlen), (const char *)(buf), (len), "``")
|
|
#define alloca_str_toprint(str) toprint_str((char *)alloca(toprint_str_len(str, "``") + 1), -1, (str), "``")
|
|
|
|
/* Check if a given nul-terminated string 'str' starts with a given nul-terminated sub-string. If
|
|
* so, return 1 and, if afterp is not NULL, set *afterp to point to the character in 'str'
|
|
* immediately following the substring. Otherwise return 0.
|
|
*
|
|
* This function is used to parse HTTP headers and responses, which are typically not
|
|
* nul-terminated, but are held in a buffer which has an associated length. To avoid this function
|
|
* running past the end of the buffer, the caller must ensure that the buffer contains a sub-string
|
|
* that is not part of the sub-string being sought, eg, "\r\n\r\n" as detected by
|
|
* http_header_complete(). This guarantees that this function will return nonzero before running
|
|
* past the end of the buffer.
|
|
*
|
|
* @author Andrew Bettison <andrew@servalproject.com>
|
|
*/
|
|
int str_startswith(const char *str, const char *substring, const char **afterp);
|
|
|
|
/* Check if a given string 'str' of a given length 'len' starts with a given nul-terminated
|
|
* sub-string. If so, return 1 and, if afterp is not NULL, set *afterp to point to the character
|
|
* immediately following the substring. Otherwise return 0.
|
|
*
|
|
* @author Andrew Bettison <andrew@servalproject.com>
|
|
*/
|
|
int strn_startswith(const char *str, size_t len, const char *substring, const char **afterp);
|
|
|
|
/* Case-insensitive form of str_startswith().
|
|
* @author Andrew Bettison <andrew@servalproject.com>
|
|
*/
|
|
int strcase_startswith(const char *str, const char *substring, const char **afterp);
|
|
|
|
/* Case-insensitive form of strn_startswith().
|
|
* @author Andrew Bettison <andrew@servalproject.com>
|
|
*/
|
|
int strncase_startswith(const char *str, size_t len, const char *substring, const char **afterp);
|
|
|
|
/* Compare the given string 'str1' of a given length 'len1' with a given nul-terminated string
|
|
* 'str2'. Equivalent to { str1[len1] = '\0'; return strcmp(str1, str2); } except without modifying
|
|
* str1[].
|
|
*
|
|
* @author Andrew Bettison <andrew@servalproject.com>
|
|
*/
|
|
int strn_str_cmp(const char *str1, size_t len1, const char *str2);
|
|
|
|
/* Compare case-insenstivively the given string 'str1' of a given length 'len1' with a given
|
|
* nul-terminated string 'str2'. Equivalent to { str1[len1] = '\0'; return strcasecmp(str1, str2);
|
|
* } except without modifying str1[].
|
|
*
|
|
* @author Andrew Bettison <andrew@servalproject.com>
|
|
*/
|
|
int strn_str_casecmp(const char *str1, size_t len1, const char *str2);
|
|
|
|
/* like strstr(3), but doesn't depend on null termination.
|
|
*
|
|
* @author Paul Gardner-Stephen <paul@servalproject.org>
|
|
* @author Andrew Bettison <andrew@servalproject.com>
|
|
*/
|
|
char *str_str(char *haystack, const char *needle, int haystack_len);
|
|
|
|
/* Parse a string as an integer in ASCII radix notation in the given 'base' (eg, base=10 means
|
|
* decimal) and scale the result by a factor given by an optional suffix "scaling" character in the
|
|
* set {kKmMgG}: 'k' = 1e3, 'K' = 1<<10, 'm' = 1e6, 'M' = 1<<20, 'g' = 1e9, 'G' = * 1<<30.
|
|
*
|
|
* Return 1 if a valid scaled integer was parsed, storing the value in *result (unless result is
|
|
* NULL) and storing a pointer to the immediately succeeding character in *afterp (unless afterp is
|
|
* NULL, in which case returns 1 only if the immediately succeeding character is a nul '\0').
|
|
* Returns 0 otherwise, leaving *result and *afterp unchanged.
|
|
*
|
|
* NOTE: an argument base > 16 will cause any trailing 'g' or 'G' character to be parsed as part of
|
|
* the integer, not as a scale suffix. Ditto for base > 20 and 'k' 'K', and base > 22 and 'm' 'M'.
|
|
*
|
|
* @author Andrew Bettison <andrew@servalproject.com>
|
|
*/
|
|
int str_to_int64_scaled(const char *str, int base, int64_t *result, const char **afterp);
|
|
int str_to_uint64_scaled(const char *str, int base, uint64_t *result, const char **afterp);
|
|
uint64_t scale_factor(const char *str, const char **afterp);
|
|
|
|
/* Format a string as a decimal integer in ASCII radix notation with a scale suffix character in the
|
|
* set {kKmMgG}: 'k' = 1e3, 'K' = 1<<10, 'm' = 1e6, 'M' = 1<<20, 'g' = 1e9, 'G' = * 1<<30 if the
|
|
* value is an exact multiple.
|
|
*
|
|
* Return 1 if the supplied string buffer was large enough to hold the formatted result plus a
|
|
* terminating nul character, 0 otherwise.
|
|
*
|
|
* @author Andrew Bettison <andrew@servalproject.com>
|
|
*/
|
|
int uint64_scaled_to_str(char *str, size_t len, uint64_t value);
|
|
|
|
/* Return true if the string resembles a nul-terminated URI.
|
|
* Based on RFC-3986 generic syntax, assuming nothing about the hierarchical part.
|
|
*
|
|
* uri := scheme ":" hierarchical [ "?" query ] [ "#" fragment ]
|
|
*
|
|
* @author Andrew Bettison <andrew@servalproject.com>
|
|
*/
|
|
int str_is_uri(const char *uri);
|
|
|
|
__STR_INLINE int is_uri_char_scheme(char c)
|
|
{
|
|
return isalpha(c) || isdigit(c) || c == '+' || c == '-' || c == '.';
|
|
}
|
|
|
|
__STR_INLINE int is_uri_char_unreserved(char c)
|
|
{
|
|
return isalpha(c) || isdigit(c) || c == '-' || c == '.' || c == '_' || c == '~';
|
|
}
|
|
|
|
__STR_INLINE int is_uri_char_reserved(char c)
|
|
{
|
|
switch (c) {
|
|
case ':': case '/': case '?': case '#': case '[': case ']': case '@':
|
|
case '!': case '$': case '&': case '\'': case '(': case ')':
|
|
case '*': case '+': case ',': case ';': case '=':
|
|
return 1;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
/* Return true if the string resembles a URI scheme without the terminating colon.
|
|
* Based on RFC-3986 generic syntax.
|
|
*
|
|
* @author Andrew Bettison <andrew@servalproject.com>
|
|
*/
|
|
__STR_INLINE int str_is_uri_scheme(const char *scheme)
|
|
{
|
|
if (!isalpha(*scheme++))
|
|
return 0;
|
|
while (is_uri_char_scheme(*scheme))
|
|
++scheme;
|
|
return *scheme == '\0';
|
|
}
|
|
|
|
/* Pick apart a URI into its basic parts.
|
|
*
|
|
* uri := scheme ":" hierarchical [ "?" query ] [ "#" fragment ]
|
|
*
|
|
* Based on RFC-3986 generic syntax, assuming nothing about the hierarchical
|
|
* part. If the respective part is found, sets (*partp) to point to the start
|
|
* of the part within the supplied 'uri' string, sets (*lenp) to the length of
|
|
* the part substring and returns 1. Otherwise returns 0. These functions
|
|
* do not reliably validate that the string in 'uri' is a valid URI; that must
|
|
* be done by calling str_is_uri().
|
|
*
|
|
* @author Andrew Bettison <andrew@servalproject.com>
|
|
*/
|
|
int str_uri_scheme(const char *uri, const char **partp, size_t *lenp);
|
|
int str_uri_hierarchical(const char *uri, const char **partp, size_t *lenp);
|
|
int str_uri_query(const char *uri, const char **partp, size_t *lenp);
|
|
int str_uri_fragment(const char *uri, const char **partp, size_t *lenp);
|
|
|
|
/* Pick apart a URI hierarchical part into its basic parts.
|
|
*
|
|
* hierarchical := "//" authority [ "/" path ]
|
|
*
|
|
* If the respective part is found, sets (*partp) to point to the start of the
|
|
* part within the supplied 'uri' string, sets (*lenp) to the length of the
|
|
* part substring and returns 1. Otherwise returns 0.
|
|
*
|
|
* These functions may be called directly on the part returned by
|
|
* str_uri_hierarchical(), even though it is not nul-terminated, because they
|
|
* treat "?" and "#" as equally valid terminators.
|
|
*
|
|
* @author Andrew Bettison <andrew@servalproject.com>
|
|
*/
|
|
int str_uri_hierarchical_authority(const char *hier, const char **partp, size_t *lenp);
|
|
int str_uri_hierarchical_path(const char *hier, const char **partp, size_t *lenp);
|
|
|
|
/* Pick apart a URI authority into its basic parts.
|
|
*
|
|
* authority := [ username ":" password "@" ] hostname [ ":" port ]
|
|
*
|
|
* If the respective part is found, sets (*partp) to point to the start of the
|
|
* part within the supplied 'uri' string, sets (*lenp) to the length of the
|
|
* part substring and returns 1. Otherwise returns 0.
|
|
*
|
|
* These functions may be called directly on the part returned by
|
|
* str_uri_hierarchical_authority(), even though it is not nul-terminated,
|
|
* because they treat "/", "?" and "#" as equally valid terminators.
|
|
*
|
|
* @author Andrew Bettison <andrew@servalproject.com>
|
|
*/
|
|
int str_uri_authority_username(const char *auth, const char **partp, size_t *lenp);
|
|
int str_uri_authority_password(const char *auth, const char **partp, size_t *lenp);
|
|
int str_uri_authority_hostname(const char *auth, const char **partp, size_t *lenp);
|
|
int str_uri_authority_port(const char *auth, unsigned short *portp);
|
|
|
|
|
|
int parse_argv(char *cmdline, char delim, char **argv, int max_argv);
|
|
|
|
#endif
|