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.3 2005/02/28 13:57:05 joerg Exp $ 39 */ 40 41 #include <string.h> /* System string definitions. */ 42 #include "mystring.h" /* Local string definitions. */ 43 44 char * 45 str_cpy(s) 46 register char *s; 47 { 48 char *str; 49 register char *p; 50 51 str = p = str_alloc(strlen(s) + 1); 52 if (p == 0) 53 return 0; 54 while (*p++ = *s++) 55 ; 56 return str; 57 } 58 59 char * 60 str_ncpy(s, n) 61 register char *s; 62 register n; 63 { 64 int l = strlen(s); 65 char *str; 66 register char *p; 67 68 if (n > l) 69 n = l; 70 str = p = str_alloc(n + 1); 71 if (p == 0) 72 return 0; 73 while (--n >= 0) 74 *p++ = *s++; 75 *p = 0; 76 return str; 77 } 78 79 char * 80 str_itoa(i) 81 int i; 82 { 83 char buf[30]; 84 85 (void) sprintf(buf, "%d", i); 86 return str_cpy(buf); 87 } 88 89 char * 90 str_cat(s1, s2) 91 char *s1, *s2; 92 { 93 char *str; 94 register char *p, *q; 95 96 str = p = str_alloc(strlen(s1) + strlen(s2) + 1); 97 if (p == 0) 98 return 0; 99 for (q = s1; *p++ = *q++;) 100 ; 101 for (q = s2, p--; *p++ = *q++;) 102 ; 103 return str; 104 } 105 106 /* 107 * match s against p. 108 * s can be a prefix of p with at least min characters. 109 */ 110 str_match(s, p, min) 111 register char *s, *p; 112 register min; 113 { 114 for (; *s && *p && *s == *p; s++, p++, min--) 115 ; 116 return *s == *p || *s == 0 && min <= 0; 117 } 118 119 #ifdef STR_DEBUG 120 char * 121 str_alloc(l) 122 int l; 123 { 124 register struct mystring *s; 125 126 s = (struct mystring *) malloc((unsigned)l + str_offset); 127 if (s == 0) 128 return 0; 129 if (str_head.s_forw == 0) 130 str_head.s_forw = str_head.s_back = &str_head; 131 s->s_forw = str_head.s_forw; 132 s->s_back = &str_head; 133 str_head.s_forw = s; 134 s->s_forw->s_back = s; 135 return s->s_data; 136 } 137 138 str_free(str) 139 char *str; 140 { 141 register struct mystring *s; 142 143 for (s = str_head.s_forw; s != &str_head && s->s_data != str; 144 s = s->s_forw) 145 ; 146 if (s == &str_head) 147 abort(); 148 s->s_back->s_forw = s->s_forw; 149 s->s_forw->s_back = s->s_back; 150 free((char *)s); 151 } 152 #endif 153