blob: 95092993adfa4e3a24e5da64e07aabf6d40794f6 [file] [log] [blame]
Jari Aaltoccc6cda1996-12-23 17:02:34 +00001/* stringlib.c - Miscellaneous string functions. */
2
Jari Aalto31859422009-01-12 13:36:28 +00003/* Copyright (C) 1996-2009 Free Software Foundation, Inc.
Jari Aaltoccc6cda1996-12-23 17:02:34 +00004
5 This file is part of GNU Bash, the Bourne Again SHell.
6
Jari Aalto31859422009-01-12 13:36:28 +00007 Bash is free software: you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation, either version 3 of the License, or
10 (at your option) any later version.
Jari Aaltoccc6cda1996-12-23 17:02:34 +000011
Jari Aalto31859422009-01-12 13:36:28 +000012 Bash is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
Jari Aaltoccc6cda1996-12-23 17:02:34 +000016
Jari Aalto31859422009-01-12 13:36:28 +000017 You should have received a copy of the GNU General Public License
18 along with Bash. If not, see <http://www.gnu.org/licenses/>.
19*/
Jari Aaltoccc6cda1996-12-23 17:02:34 +000020
21#include "config.h"
22
23#include "bashtypes.h"
24
25#if defined (HAVE_UNISTD_H)
26# include <unistd.h>
27#endif
28
29#include "bashansi.h"
30#include <stdio.h>
Jari Aaltof73dda02001-11-13 17:56:06 +000031#include "chartypes.h"
Jari Aaltoccc6cda1996-12-23 17:02:34 +000032
33#include "shell.h"
Jari Aaltobb706242000-03-17 21:46:59 +000034#include "pathexp.h"
35
Jari Aaltof73dda02001-11-13 17:56:06 +000036#include <glob/glob.h>
37
Jari Aaltobb706242000-03-17 21:46:59 +000038#if defined (EXTENDED_GLOB)
Jari Aaltof73dda02001-11-13 17:56:06 +000039# include <glob/strmatch.h>
Jari Aaltobb706242000-03-17 21:46:59 +000040#endif
Jari Aaltoccc6cda1996-12-23 17:02:34 +000041
Jari Aaltoccc6cda1996-12-23 17:02:34 +000042/* **************************************************************** */
43/* */
44/* Functions to manage arrays of strings */
45/* */
46/* **************************************************************** */
47
Jari Aaltobb706242000-03-17 21:46:59 +000048/* Find STRING in ALIST, a list of string key/int value pairs. If FLAGS
Jari Aaltof73dda02001-11-13 17:56:06 +000049 is 1, STRING is treated as a pattern and matched using strmatch. */
Jari Aaltobb706242000-03-17 21:46:59 +000050int
51find_string_in_alist (string, alist, flags)
52 char *string;
53 STRING_INT_ALIST *alist;
54 int flags;
55{
56 register int i;
57 int r;
58
59 for (i = r = 0; alist[i].word; i++)
60 {
61#if defined (EXTENDED_GLOB)
62 if (flags)
Jari Aaltof73dda02001-11-13 17:56:06 +000063 r = strmatch (alist[i].word, string, FNM_EXTMATCH) != FNM_NOMATCH;
Jari Aaltobb706242000-03-17 21:46:59 +000064 else
65#endif
Jari Aalto28ef6c32001-04-06 19:14:31 +000066 r = STREQ (string, alist[i].word);
Jari Aaltobb706242000-03-17 21:46:59 +000067
68 if (r)
Jari Aalto28ef6c32001-04-06 19:14:31 +000069 return (alist[i].token);
Jari Aaltobb706242000-03-17 21:46:59 +000070 }
71 return -1;
72}
73
Jari Aalto7117c2d2002-07-17 14:10:11 +000074/* Find TOKEN in ALIST, a list of string/int value pairs. Return the
75 corresponding string. Allocates memory for the returned
76 string. FLAGS is currently ignored, but reserved. */
77char *
78find_token_in_alist (token, alist, flags)
79 int token;
80 STRING_INT_ALIST *alist;
81 int flags;
82{
83 register int i;
84
85 for (i = 0; alist[i].word; i++)
86 {
87 if (alist[i].token == token)
88 return (savestring (alist[i].word));
89 }
90 return ((char *)NULL);
91}
92
93int
94find_index_in_alist (string, alist, flags)
95 char *string;
96 STRING_INT_ALIST *alist;
97 int flags;
98{
99 register int i;
100 int r;
101
102 for (i = r = 0; alist[i].word; i++)
103 {
104#if defined (EXTENDED_GLOB)
105 if (flags)
106 r = strmatch (alist[i].word, string, FNM_EXTMATCH) != FNM_NOMATCH;
107 else
108#endif
109 r = STREQ (string, alist[i].word);
110
111 if (r)
112 return (i);
113 }
114
115 return -1;
116}
117
Jari Aaltoccc6cda1996-12-23 17:02:34 +0000118/* **************************************************************** */
119/* */
120/* String Management Functions */
121/* */
122/* **************************************************************** */
123
Jari Aalto7117c2d2002-07-17 14:10:11 +0000124/* Cons a new string from STRING starting at START and ending at END,
125 not including END. */
126char *
127substring (string, start, end)
Chet Ramey00018032011-11-21 20:51:19 -0500128 const char *string;
Jari Aalto7117c2d2002-07-17 14:10:11 +0000129 int start, end;
130{
131 register int len;
132 register char *result;
133
134 len = end - start;
135 result = (char *)xmalloc (len + 1);
Chet Rameyac50fba2014-02-26 09:36:43 -0500136 memcpy (result, string + start, len);
Jari Aalto7117c2d2002-07-17 14:10:11 +0000137 result[len] = '\0';
138 return (result);
139}
140
Jari Aaltoccc6cda1996-12-23 17:02:34 +0000141/* Replace occurrences of PAT with REP in STRING. If GLOBAL is non-zero,
142 replace all occurrences, otherwise replace only the first.
143 This returns a new string; the caller should free it. */
144char *
145strsub (string, pat, rep, global)
146 char *string, *pat, *rep;
147 int global;
148{
Jari Aaltocce855b1998-04-17 19:52:44 +0000149 int patlen, replen, templen, tempsize, repl, i;
Jari Aaltoccc6cda1996-12-23 17:02:34 +0000150 char *temp, *r;
151
152 patlen = strlen (pat);
Jari Aaltocce855b1998-04-17 19:52:44 +0000153 replen = strlen (rep);
Jari Aaltoccc6cda1996-12-23 17:02:34 +0000154 for (temp = (char *)NULL, i = templen = tempsize = 0, repl = 1; string[i]; )
155 {
156 if (repl && STREQN (string + i, pat, patlen))
Jari Aalto28ef6c32001-04-06 19:14:31 +0000157 {
Jari Aaltof73dda02001-11-13 17:56:06 +0000158 if (replen)
159 RESIZE_MALLOCED_BUFFER (temp, templen, replen, tempsize, (replen * 2));
Jari Aaltoccc6cda1996-12-23 17:02:34 +0000160
Chet Rameyac50fba2014-02-26 09:36:43 -0500161 for (r = rep; *r; ) /* can rep == "" */
Jari Aaltoccc6cda1996-12-23 17:02:34 +0000162 temp[templen++] = *r++;
163
Jari Aaltof73dda02001-11-13 17:56:06 +0000164 i += patlen ? patlen : 1; /* avoid infinite recursion */
Jari Aaltoccc6cda1996-12-23 17:02:34 +0000165 repl = global != 0;
Jari Aalto28ef6c32001-04-06 19:14:31 +0000166 }
Jari Aaltoccc6cda1996-12-23 17:02:34 +0000167 else
168 {
169 RESIZE_MALLOCED_BUFFER (temp, templen, 1, tempsize, 16);
170 temp[templen++] = string[i++];
171 }
172 }
Jari Aalto31859422009-01-12 13:36:28 +0000173 if (temp)
174 temp[templen] = 0;
175 else
176 temp = savestring (string);
Jari Aaltoccc6cda1996-12-23 17:02:34 +0000177 return (temp);
178}
179
Jari Aaltobb706242000-03-17 21:46:59 +0000180/* Replace all instances of C in STRING with TEXT. TEXT may be empty or
181 NULL. If DO_GLOB is non-zero, we quote the replacement text for
182 globbing. Backslash may be used to quote C. */
183char *
184strcreplace (string, c, text, do_glob)
185 char *string;
186 int c;
187 char *text;
188 int do_glob;
189{
190 char *ret, *p, *r, *t;
191 int len, rlen, ind, tlen;
192
193 len = STRLEN (text);
194 rlen = len + strlen (string) + 2;
Jari Aaltof73dda02001-11-13 17:56:06 +0000195 ret = (char *)xmalloc (rlen);
Jari Aaltobb706242000-03-17 21:46:59 +0000196
197 for (p = string, r = ret; p && *p; )
198 {
199 if (*p == c)
200 {
201 if (len)
202 {
203 ind = r - ret;
204 if (do_glob && (glob_pattern_p (text) || strchr (text, '\\')))
205 {
206 t = quote_globbing_chars (text);
207 tlen = strlen (t);
208 RESIZE_MALLOCED_BUFFER (ret, ind, tlen, rlen, rlen);
209 r = ret + ind; /* in case reallocated */
210 strcpy (r, t);
211 r += tlen;
212 free (t);
213 }
214 else
215 {
216 RESIZE_MALLOCED_BUFFER (ret, ind, len, rlen, rlen);
217 r = ret + ind; /* in case reallocated */
218 strcpy (r, text);
219 r += len;
220 }
221 }
222 p++;
223 continue;
224 }
225
Jari Aalto28ef6c32001-04-06 19:14:31 +0000226 if (*p == '\\' && p[1] == c)
Jari Aaltobb706242000-03-17 21:46:59 +0000227 p++;
228
Jari Aaltof73dda02001-11-13 17:56:06 +0000229 ind = r - ret;
Jari Aalto28ef6c32001-04-06 19:14:31 +0000230 RESIZE_MALLOCED_BUFFER (ret, ind, 2, rlen, rlen);
231 r = ret + ind; /* in case reallocated */
Jari Aaltobb706242000-03-17 21:46:59 +0000232 *r++ = *p++;
233 }
234 *r = '\0';
235
236 return ret;
237}
238
Jari Aaltod166f041997-06-05 14:59:13 +0000239#ifdef INCLUDE_UNUSED
Jari Aaltoccc6cda1996-12-23 17:02:34 +0000240/* Remove all leading whitespace from STRING. This includes
241 newlines. STRING should be terminated with a zero. */
242void
243strip_leading (string)
244 char *string;
245{
246 char *start = string;
247
248 while (*string && (whitespace (*string) || *string == '\n'))
249 string++;
250
251 if (string != start)
252 {
253 int len = strlen (string);
254 FASTCOPY (string, start, len);
255 start[len] = '\0';
256 }
257}
Jari Aaltod166f041997-06-05 14:59:13 +0000258#endif
Jari Aaltoccc6cda1996-12-23 17:02:34 +0000259
260/* Remove all trailing whitespace from STRING. This includes
261 newlines. If NEWLINES_ONLY is non-zero, only trailing newlines
262 are removed. STRING should be terminated with a zero. */
263void
Jari Aaltod166f041997-06-05 14:59:13 +0000264strip_trailing (string, len, newlines_only)
Jari Aaltoccc6cda1996-12-23 17:02:34 +0000265 char *string;
Jari Aaltod166f041997-06-05 14:59:13 +0000266 int len;
Jari Aaltoccc6cda1996-12-23 17:02:34 +0000267 int newlines_only;
268{
Jari Aaltoccc6cda1996-12-23 17:02:34 +0000269 while (len >= 0)
270 {
271 if ((newlines_only && string[len] == '\n') ||
Jari Aalto28ef6c32001-04-06 19:14:31 +0000272 (!newlines_only && whitespace (string[len])))
273 len--;
Jari Aaltoccc6cda1996-12-23 17:02:34 +0000274 else
Jari Aalto28ef6c32001-04-06 19:14:31 +0000275 break;
Jari Aaltoccc6cda1996-12-23 17:02:34 +0000276 }
277 string[len + 1] = '\0';
278}
279
Jari Aaltoccc6cda1996-12-23 17:02:34 +0000280/* A wrapper for bcopy that can be prototyped in general.h */
281void
282xbcopy (s, d, n)
283 char *s, *d;
284 int n;
285{
286 FASTCOPY (s, d, n);
287}