/* * Copyright (c) 2007 The Akuma Project * * Permission is hereby granted, free of charge, to any person obtaining a copy * of this software and associated documentation files (the "Software"), to * deal in the Software without restriction, including without limitation the * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or * sell copies of the Software, and to permit persons to whom the Software is * furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included in * all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS * IN THE SOFTWARE. * * $Id: cstring.c 133 2007-05-29 14:32:04Z asmodai $ */ /* Crown Copyright (c) 1997 This TenDRA(r) Computer Program is subject to Copyright owned by the United Kingdom Secretary of State for Defence acting through the Defence Evaluation and Research Agency (DERA). It is made available to Recipients with a royalty-free licence for its use, reproduction, transfer to other parties and amendment for any purpose not excluding product development provided that any such use et cetera shall be deemed to be acceptance of the following conditions:- (1) Its Recipients shall ensure that this Notice is reproduced upon any copies or amended versions of it; (2) Any amended version of it shall be clearly marked to show both the nature of and the organisation responsible for the relevant amendment or amendments; (3) Its onward transfer from a recipient to another party shall be deemed to be that party's acceptance of these conditions; (4) DERA gives no warranty or assurance as to its quality or suitability for any purpose and DERA accepts no liability whatsoever in relation to any use to which it may be put. */ /**** cstring.c --- C string manipulation. * ** Author: Steve Folkes * **** Commentary: * * This file implements the C string manipulation facility specified in the * file "cstring.h". See that file for more details. * **** Change Log: * $Log: cstring.c,v $ * Revision 1.3 1998/03/17 11:38:15 release * Missing ';'. * * Revision 1.2 1998/03/16 11:26:34 release * Modifications prior to version 4.1.2. * * Revision 1.1.1.1 1998/01/17 15:57:45 release * First version to be checked into rolling release. * * Revision 1.2 1994/12/12 11:45:24 smf * Performing changes for 'CR94_178.sid+tld-update' - bringing in line with * OSSG C Coding Standards. * * Revision 1.1.1.1 1994/07/25 16:06:09 smf * Initial import of os-interface shared files. * **/ /****************************************************************************/ #include "cstring.h" #include "syntax.h" /*--------------------------------------------------------------------------*/ CStringP cstring_duplicate(CStringP cstring) { unsigned length = cstring_length(cstring); CStringP tmp = ALLOCATE_VECTOR(char, length + 1); (void)strcpy(tmp, cstring); return(tmp); } CStringP cstring_duplicate_prefix(CStringP cstring, unsigned prefix) { unsigned length = cstring_length(cstring); if (length <= prefix) { CStringP tmp = ALLOCATE_VECTOR(char, length + 1); (void)strcpy(tmp, cstring); return(tmp); } else { CStringP tmp = ALLOCATE_VECTOR(char, prefix + 1); (void)memcpy((GenericP)tmp, (GenericP)cstring, (SizeT)prefix); tmp[prefix] = '\0'; return(tmp); } } unsigned cstring_hash_value(CStringP cstring) { unsigned value = 0; while (*cstring) { value += ((unsigned)(*cstring++)); } return(value); } #ifdef FS_FAST #undef cstring_length #endif /* defined (FS_FAST) */ unsigned cstring_length(CStringP cstring) { return((unsigned)strlen(cstring)); } #ifdef FS_FAST #define cstring_length(s) ((unsigned)strlen(s)) #endif /* defined (FS_FAST) */ #ifdef FS_FAST #undef cstring_equal #endif /* defined (FS_FAST) */ BoolT cstring_equal(CStringP cstring1, CStringP cstring2) { return(strcmp(cstring1, cstring2) == 0); } #ifdef FS_FAST #define cstring_equal(s1, s2) (strcmp((s1), (s2)) == 0) #endif /* defined (FS_FAST) */ BoolT cstring_ci_equal(CStringP cstring1, CStringP cstring2) { char c1; char c2; do { c1 = syntax_upcase(*cstring1++); c2 = syntax_upcase(*cstring2++); } while ((c1) && (c2) && (c1 == c2)); return(c1 == c2); } BoolT cstring_to_unsigned(CStringP cstring, unsigned *num_ref) { unsigned number = 0; if (*cstring == '\0') { return(FALSE); } do { int value = syntax_value(*cstring); if ((value == SYNTAX_NO_VALUE) || (value >= 10) || (((UINT_MAX - (unsigned)value) / (unsigned)10) < number)) { return(FALSE); } number *= (unsigned)10; number += (unsigned)value; } while (*++ cstring); *num_ref = number; return(TRUE); } BoolT cstring_starts(CStringP cstring, CStringP s) { return(strncmp(cstring, s, strlen(s)) == 0); } #ifdef FS_FAST #undef cstring_contains #endif /* defined (FS_FAST) */ BoolT cstring_contains(CStringP cstring, char c) { return(strchr(cstring, c) != NIL(CStringP)); } #ifdef FS_FAST #define cstring_contains(s, c) (strchr((s), (c)) != NIL(CStringP)) #endif /* defined (FS_FAST) */ #ifdef FS_FAST #undef cstring_find #endif /* defined (FS_FAST) */ CStringP cstring_find(CStringP cstring, char c) { return(strchr(cstring, c)); } #ifdef FS_FAST #define cstring_find(s, c) (strchr((s), (c))) #endif /* defined (FS_FAST) */ #ifdef FS_FAST #undef cstring_find_reverse #endif /* defined (FS_FAST) */ CStringP cstring_find_reverse(CStringP cstring, char c) { return(strrchr(cstring, c)); } #ifdef FS_FAST #define cstring_find_reverse(s, c) (strrchr((s), (c))) #endif /* defined (FS_FAST) */ CStringP cstring_find_basename(CStringP cstring) { CStringP bstring = cstring_find_reverse(cstring, '/'); if (bstring != NIL(CStringP)) { cstring = bstring + 1; } return(cstring); }