aboutsummaryrefslogtreecommitdiffstats
path: root/main/s390-tools/argz.c
blob: 09ede86bae960b783072e5b12eaef6eb0d3e1c7d (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
/* Copyright (C) 1996-2019 Free Software Foundation, Inc.
   This file is part of the GNU C Library.
   Contributed by Ulrich Drepper <drepper@gnu.ai.mit.edu>, 1996.

   The GNU C Library is free software; you can redistribute it and/or
   modify it under the terms of the GNU Lesser General Public
   License as published by the Free Software Foundation; either
   version 2.1 of the License, or (at your option) any later version.

   The GNU C Library is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
   Lesser General Public License for more details.

   You should have received a copy of the GNU Lesser General Public
   License along with the GNU C Library; if not, see
   <http://www.gnu.org/licenses/>.  */

#include <argz.h>
#include <stdlib.h>


/* Add BUF, of length BUF_LEN to the argz vector in ARGZ & ARGZ_LEN.	*/
error_t
argz_append (char **argz, size_t *argz_len, const char *buf, size_t buf_len)
{
	size_t new_argz_len = *argz_len + buf_len;
	char *new_argz = realloc (*argz, new_argz_len);
	if (new_argz)
		{
			memcpy (new_argz + *argz_len, buf, buf_len);
			*argz = new_argz;
			*argz_len = new_argz_len;
			return 0;
		}
	else
		return ENOMEM;
}

/* Add STR to the argz vector in ARGZ & ARGZ_LEN.	This should be moved into
	 argz.c in libshouldbelibc.	*/
error_t
argz_add (char **argz, size_t *argz_len, const char *str)
{
	return argz_append (argz, argz_len, str, strlen (str) + 1);
}

/* Returns the number of strings in ARGZ.	*/
size_t
argz_count (const char *argz, size_t len)
{
	size_t count = 0;
	while (len > 0)
		{
			size_t part_len = strlen(argz);
			argz += part_len + 1;
			len -= part_len + 1;
			count++;
		}
	return count;
}

/* Make a '\0' separated arg vector from a unix argv vector, returning it in
	 ARGZ, and the total length in LEN.	If a memory allocation error occurs,
	 ENOMEM is returned, otherwise 0.	*/
error_t
argz_create (char *const argv[], char **argz, size_t *len)
{
	int argc;
	size_t tlen = 0;
	char *const *ap;
	char *p;

	for (argc = 0; argv[argc] != NULL; ++argc)
		tlen += strlen (argv[argc]) + 1;

	if (tlen == 0)
		*argz = NULL;
	else
		{
			*argz = malloc (tlen);
			if (*argz == NULL)
	return ENOMEM;

			for (p = *argz, ap = argv; *ap; ++ap, ++p)
	p = stpcpy (p, *ap);
		}
	*len = tlen;

	return 0;
}

error_t
argz_create_sep (const char *string, int delim, char **argz, size_t *len)
{
	size_t nlen = strlen (string) + 1;

	if (nlen > 1)
		{
			const char *rp;
			char *wp;

			*argz = (char *) malloc (nlen);
			if (*argz == NULL)
	return ENOMEM;

			rp = string;
			wp = *argz;
			do
	if (*rp == delim)
		{
			if (wp > *argz && wp[-1] != '\0')
				*wp++ = '\0';
			else
				--nlen;
		}
	else
		*wp++ = *rp;
			while (*rp++ != '\0');

			if (nlen == 0)
	{
		free (*argz);
		*argz = NULL;
		*len = 0;
	}

			*len = nlen;
		}
	else
		{
			*argz = NULL;
			*len = 0;
		}

	return 0;
}

char *
argz_next (const char *argz, size_t argz_len, const char *entry)
{
	if (entry)
		{
			if (entry < argz + argz_len)
	entry = strchr (entry, '\0') + 1;

			return entry >= argz + argz_len ? NULL : (char *) entry;
		}
	else
		if (argz_len > 0)
			return (char *) argz;
		else
			return NULL;
}

/* Delete ENTRY from ARGZ & ARGZ_LEN, if any.	*/
void
argz_delete (char **argz, size_t *argz_len, char *entry)
{
	if (entry)
		/* Get rid of the old value for NAME.	*/
		{
			size_t entry_len = strlen (entry) + 1;
			*argz_len -= entry_len;
			memmove (entry, entry + entry_len, *argz_len - (entry - *argz));
			if (*argz_len == 0)
	{
		free (*argz);
		*argz = 0;
	}
		}
}

/* Puts pointers to each string in ARGZ, plus a terminating 0 element, into
	 ARGV, which must be large enough to hold them all.	*/
void
argz_extract (const char *argz, size_t len, char **argv)
{
	while (len > 0)
		{
			size_t part_len = strlen (argz);
			*argv++ = (char *) argz;
			argz += part_len + 1;
			len -= part_len + 1;
		}
	*argv = 0;
}

/* Insert ENTRY into ARGZ & ARGZ_LEN before BEFORE, which should be an
	 existing entry in ARGZ; if BEFORE is NULL, ENTRY is appended to the end.
	 Since ARGZ's first entry is the same as ARGZ, argz_insert (ARGZ, ARGZ_LEN,
	 ARGZ, ENTRY) will insert ENTRY at the beginning of ARGZ.	If BEFORE is not
	 in ARGZ, EINVAL is returned, else if memory can't be allocated for the new
	 ARGZ, ENOMEM is returned, else 0.	*/
error_t
argz_insert (char **argz, size_t *argz_len, char *before, const char *entry)
{
	if (! before)
		return argz_add (argz, argz_len, entry);

	if (before < *argz || before >= *argz + *argz_len)
		return EINVAL;

	if (before > *argz)
		/* Make sure before is actually the beginning of an entry.	*/
		while (before[-1])
			before--;

	{
		size_t after_before = *argz_len - (before - *argz);
		size_t entry_len = strlen	(entry) + 1;
		size_t new_argz_len = *argz_len + entry_len;
		char *new_argz = realloc (*argz, new_argz_len);

		if (new_argz)
			{
	before = new_argz + (before - *argz);
	memmove (before + entry_len, before, after_before);
	memmove (before, entry, entry_len);
	*argz = new_argz;
	*argz_len = new_argz_len;
	return 0;
			}
		else
			return ENOMEM;
	}
}

/* Make '\0' separated arg vector ARGZ printable by converting all the '\0's
	 except the last into the character SEP.	*/
void
argz_stringify (char *argz, size_t len, int sep)
{
	if (len > 0)
		while (1)
			{
	size_t part_len = strnlen (argz, len);
	argz += part_len;
	len -= part_len;
	if (len-- <= 1)		/* includes final '\0' we want to stop at */
		break;
	*argz++ = sep;
			}
}

error_t
argz_add_sep (char **argz, size_t *argz_len, const char *string, int delim)
{
	size_t nlen = strlen (string) + 1;

	if (nlen > 1)
		{
			const char *rp;
			char *wp;

			*argz = (char *) realloc (*argz, *argz_len + nlen);
			if (*argz == NULL)
	return ENOMEM;

			wp = *argz + *argz_len;
			rp = string;
			do
	if (*rp == delim)
		{
			if (wp > *argz && wp[-1] != '\0')
				*wp++ = '\0';
			else
				--nlen;
		}
	else
		*wp++ = *rp;
			while (*rp++ != '\0');

			*argz_len += nlen;
		}

	return 0;
}

/* Append BUF, of length BUF_LEN to *TO, of length *TO_LEN, reallocating and
	 updating *TO & *TO_LEN appropriately.	If an allocation error occurs,
	 *TO's old value is freed, and *TO is set to 0.	*/
static void
str_append (char **to, size_t *to_len, const char *buf, const size_t buf_len)
{
	size_t new_len = *to_len + buf_len;
	char *new_to = realloc (*to, new_len + 1);

	if (new_to)
		{
			*((char *) mempcpy (new_to + *to_len, buf, buf_len)) = '\0';
			*to = new_to;
			*to_len = new_len;
		}
	else
		{
			free (*to);
			*to = 0;
		}
}

/* Replace any occurrences of the string STR in ARGZ with WITH, reallocating
	 ARGZ as necessary.	If REPLACE_COUNT is non-zero, *REPLACE_COUNT will be
	 incremented by number of replacements performed.	*/
error_t
argz_replace (char **argz, size_t *argz_len, const char *str, const char *with,
		unsigned *replace_count)
{
	error_t err = 0;

	if (str && *str)
		{
			char *arg = 0;
			char *src = *argz;
			size_t src_len = *argz_len;
			char *dst = 0;
			size_t dst_len = 0;
			int delayed_copy = 1;	/* True while we've avoided copying anything.	*/
			size_t str_len = strlen (str), with_len = strlen (with);

			while (!err && (arg = argz_next (src, src_len, arg)))
	{
		char *match = strstr (arg, str);
		if (match)
			{
				char *from = match + str_len;
				size_t to_len = match - arg;
				char *to = strndup (arg, to_len);

				while (to && from)
		{
			str_append (&to, &to_len, with, with_len);
			if (to)
				{
					match = strstr (from, str);
					if (match)
			{
				str_append (&to, &to_len, from, match - from);
				from = match + str_len;
			}
					else
			{
				str_append (&to, &to_len, from, strlen (from));
				from = 0;
			}
				}
		}

				if (to)
		{
			if (delayed_copy)
				/* We avoided copying SRC to DST until we found a match;
											 now that we've done so, copy everything from the start
											 of SRC.	*/
				{
					if (arg > src)
			err = argz_append (&dst, &dst_len, src, (arg - src));
					delayed_copy = 0;
				}
			if (! err)
				err = argz_add (&dst, &dst_len, to);
			free (to);
		}
				else
		err = ENOMEM;

				if (replace_count)
		(*replace_count)++;
			}
		else if (! delayed_copy)
			err = argz_add (&dst, &dst_len, arg);
	}

			if (! err)
	{
		if (! delayed_copy)
			/* We never found any instances of str.	*/
			{
				free (src);
				*argz = dst;
				*argz_len = dst_len;
			}
	}
			else if (dst_len > 0)
	free (dst);
		}

	return err;
}