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