1 /* @(#)string.c 8.1 (Berkeley) 6/6/93 */ 2 /* $NetBSD: string.c,v 1.10 2009/04/14 08:50:06 lukem Exp $ */ 3 4 /* 5 * Copyright (c) 1983, 1993 6 * The Regents of the University of California. All rights reserved. 7 * 8 * This code is derived from software contributed to Berkeley by 9 * Edward Wang at The University of California, Berkeley. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 14 * 1. Redistributions of source code must retain the above copyright 15 * notice, this list of conditions and the following disclaimer. 16 * 2. Redistributions in binary form must reproduce the above copyright 17 * notice, this list of conditions and the following disclaimer in the 18 * documentation and/or other materials provided with the distribution. 19 * 3. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 */ 35 36 #include <stdio.h> 37 #include <stdlib.h> 38 #include <string.h> 39 #define EXTERN 40 #include "window_string.h" 41 #undef EXTERN 42 43 char * 44 str_cpy(const char *s) 45 { 46 char *str; 47 char *p; 48 49 str = p = str_alloc(strlen(s) + 1); 50 if (p == NULL) 51 return 0; 52 while ((*p++ = *s++)) 53 ; 54 return str; 55 } 56 57 char * 58 str_ncpy(const char *s, int n) 59 { 60 int l = strlen(s); 61 char *str; 62 char *p; 63 64 if (n > l) 65 n = l; 66 str = p = str_alloc(n + 1); 67 if (p == NULL) 68 return 0; 69 while (--n >= 0) 70 *p++ = *s++; 71 *p = 0; 72 return str; 73 } 74 75 char * 76 str_itoa(int i) 77 { 78 char buf[30]; 79 80 (void) snprintf(buf, sizeof(buf), "%d", i); 81 return str_cpy(buf); 82 } 83 84 char * 85 str_cat(const char *s1, const char *s2) 86 { 87 char *str; 88 char *p; 89 const char *q; 90 91 str = p = str_alloc(strlen(s1) + strlen(s2) + 1); 92 if (p == NULL) 93 return 0; 94 for (q = s1; (*p++ = *q++);) 95 ; 96 for (q = s2, p--; (*p++ = *q++);) 97 ; 98 return str; 99 } 100 101 /* 102 * match s against p. 103 * s can be a prefix of p with at least min characters. 104 */ 105 int 106 str_match(const char *s, const char *p, int min) 107 { 108 for (; *s && *p && *s == *p; s++, p++, min--) 109 ; 110 return *s == *p || (*s == 0 && min <= 0); 111 } 112 113 #ifdef STR_DEBUG 114 char * 115 str_alloc(size_t l) 116 { 117 struct string *s; 118 119 s = malloc(offsetof(struct string, s_data[l])); 120 if (s == NULL) 121 return 0; 122 if (str_head.s_forw == 0) 123 str_head.s_forw = str_head.s_back = &str_head; 124 s->s_forw = str_head.s_forw; 125 s->s_back = &str_head; 126 str_head.s_forw = s; 127 s->s_forw->s_back = s; 128 return s->s_data; 129 } 130 131 void 132 str_free(char *str) 133 { 134 struct string *s; 135 136 for (s = str_head.s_forw; s != &str_head && s->s_data != str; 137 s = s->s_forw) 138 ; 139 if (s == &str_head) 140 abort(); 141 s->s_back->s_forw = s->s_forw; 142 s->s_forw->s_back = s->s_back; 143 free((char *)s); 144 } 145 #endif 146