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