249 lines
5.1 KiB
C
249 lines
5.1 KiB
C
|
|
/* stringlist.c - functions to handle a generic `list of strings' structure */
|
||
|
|
|
||
|
|
/* Copyright (C) 2000 Free Software Foundation, Inc.
|
||
|
|
|
||
|
|
This file is part of GNU Bash, the Bourne Again SHell.
|
||
|
|
|
||
|
|
Bash is free software; you can redistribute it and/or modify it under
|
||
|
|
the terms of the GNU General Public License as published by the Free
|
||
|
|
Software Foundation; either version 2, or (at your option) any later
|
||
|
|
version.
|
||
|
|
|
||
|
|
Bash 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 General Public License
|
||
|
|
for more details.
|
||
|
|
|
||
|
|
You should have received a copy of the GNU General Public License along
|
||
|
|
with Bash; see the file COPYING. If not, write to the Free Software
|
||
|
|
Foundation, 59 Temple Place, Suite 330, Boston, MA 02111 USA. */
|
||
|
|
|
||
|
|
#include <config.h>
|
||
|
|
|
||
|
|
#if defined (HAVE_UNISTD_H)
|
||
|
|
# include <unistd.h>
|
||
|
|
#endif
|
||
|
|
|
||
|
|
#include <stdio.h>
|
||
|
|
#include "bashansi.h"
|
||
|
|
|
||
|
|
#include "shell.h"
|
||
|
|
|
||
|
|
#ifdef STRDUP
|
||
|
|
# undef STRDUP
|
||
|
|
#endif
|
||
|
|
#define STRDUP(x) ((x) ? savestring (x) : (char *)NULL)
|
||
|
|
|
||
|
|
/* Allocate a new STRINGLIST, with room for N strings. */
|
||
|
|
|
||
|
|
STRINGLIST *
|
||
|
|
alloc_stringlist (n)
|
||
|
|
int n;
|
||
|
|
{
|
||
|
|
STRINGLIST *ret;
|
||
|
|
register int i;
|
||
|
|
|
||
|
|
ret = (STRINGLIST *)xmalloc (sizeof (STRINGLIST));
|
||
|
|
if (n)
|
||
|
|
{
|
||
|
|
ret->list = alloc_array (n+1);
|
||
|
|
ret->list_size = n;
|
||
|
|
for (i = 0; i < n; i++)
|
||
|
|
ret->list[i] = (char *)NULL;
|
||
|
|
}
|
||
|
|
else
|
||
|
|
{
|
||
|
|
ret->list = (char **)NULL;
|
||
|
|
ret->list_size = 0;
|
||
|
|
}
|
||
|
|
ret->list_len = 0;
|
||
|
|
return ret;
|
||
|
|
}
|
||
|
|
|
||
|
|
STRINGLIST *
|
||
|
|
realloc_stringlist (sl, n)
|
||
|
|
STRINGLIST *sl;
|
||
|
|
int n;
|
||
|
|
{
|
||
|
|
register int i;
|
||
|
|
|
||
|
|
if (n > sl->list_size)
|
||
|
|
{
|
||
|
|
sl->list = (char **)xrealloc (sl->list, (n+1) * sizeof (char *));
|
||
|
|
for (i = sl->list_size; i <= n; i++)
|
||
|
|
sl->list[i] = (char *)NULL;
|
||
|
|
sl->list_size = n;
|
||
|
|
}
|
||
|
|
return sl;
|
||
|
|
}
|
||
|
|
|
||
|
|
void
|
||
|
|
free_stringlist (sl)
|
||
|
|
STRINGLIST *sl;
|
||
|
|
{
|
||
|
|
if (sl == 0)
|
||
|
|
return;
|
||
|
|
if (sl->list)
|
||
|
|
free_array (sl->list);
|
||
|
|
free (sl);
|
||
|
|
}
|
||
|
|
|
||
|
|
STRINGLIST *
|
||
|
|
copy_stringlist (sl)
|
||
|
|
STRINGLIST *sl;
|
||
|
|
{
|
||
|
|
STRINGLIST *new;
|
||
|
|
register int i;
|
||
|
|
|
||
|
|
new = alloc_stringlist (sl->list_size);
|
||
|
|
/* I'd like to use copy_array, but that doesn't copy everything. */
|
||
|
|
if (sl->list)
|
||
|
|
{
|
||
|
|
for (i = 0; i < sl->list_size; i++)
|
||
|
|
new->list[i] = STRDUP (sl->list[i]);
|
||
|
|
}
|
||
|
|
new->list_size = sl->list_size;
|
||
|
|
new->list_len = sl->list_len;
|
||
|
|
/* just being careful */
|
||
|
|
if (new->list)
|
||
|
|
new->list[new->list_len] = (char *)NULL;
|
||
|
|
return new;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Return a new STRINGLIST with everything from M1 and M2. */
|
||
|
|
|
||
|
|
STRINGLIST *
|
||
|
|
merge_stringlists (m1, m2)
|
||
|
|
STRINGLIST *m1, *m2;
|
||
|
|
{
|
||
|
|
STRINGLIST *sl;
|
||
|
|
int i, n, l1, l2;
|
||
|
|
|
||
|
|
l1 = m1 ? m1->list_len : 0;
|
||
|
|
l2 = m2 ? m2->list_len : 0;
|
||
|
|
|
||
|
|
sl = alloc_stringlist (l1 + l2 + 1);
|
||
|
|
for (i = n = 0; i < l1; i++, n++)
|
||
|
|
sl->list[n] = STRDUP (m1->list[i]);
|
||
|
|
for (i = 0; i < l2; i++, n++)
|
||
|
|
sl->list[n] = STRDUP (m2->list[i]);
|
||
|
|
sl->list_len = n;
|
||
|
|
sl->list[n] = (char *)NULL;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Make STRINGLIST M1 contain everything in M1 and M2. */
|
||
|
|
STRINGLIST *
|
||
|
|
append_stringlist (m1, m2)
|
||
|
|
STRINGLIST *m1, *m2;
|
||
|
|
{
|
||
|
|
register int i, n, len1, len2;
|
||
|
|
|
||
|
|
if (m1 == 0)
|
||
|
|
{
|
||
|
|
m1 = copy_stringlist (m2);
|
||
|
|
return m1;
|
||
|
|
}
|
||
|
|
|
||
|
|
len1 = m1->list_len;
|
||
|
|
len2 = m2 ? m2->list_len : 0;
|
||
|
|
|
||
|
|
if (len2)
|
||
|
|
{
|
||
|
|
m1 = realloc_stringlist (m1, len1 + len2 + 1);
|
||
|
|
for (i = 0, n = len1; i < len2; i++, n++)
|
||
|
|
m1->list[n] = STRDUP (m2->list[i]);
|
||
|
|
m1->list[n] = (char *)NULL;
|
||
|
|
m1->list_len = n;
|
||
|
|
}
|
||
|
|
|
||
|
|
return m1;
|
||
|
|
}
|
||
|
|
|
||
|
|
STRINGLIST *
|
||
|
|
prefix_suffix_stringlist (sl, prefix, suffix)
|
||
|
|
STRINGLIST *sl;
|
||
|
|
char *prefix, *suffix;
|
||
|
|
{
|
||
|
|
int plen, slen, tlen, llen, i;
|
||
|
|
char *t;
|
||
|
|
|
||
|
|
if (sl == 0 || sl->list == 0 || sl->list_len == 0)
|
||
|
|
return sl;
|
||
|
|
|
||
|
|
plen = STRLEN (prefix);
|
||
|
|
slen = STRLEN (suffix);
|
||
|
|
|
||
|
|
if (plen == 0 && slen == 0)
|
||
|
|
return (sl);
|
||
|
|
|
||
|
|
for (i = 0; i < sl->list_len; i++)
|
||
|
|
{
|
||
|
|
llen = STRLEN (sl->list[i]);
|
||
|
|
tlen = plen + llen + slen + 1;
|
||
|
|
t = xmalloc (tlen + 1);
|
||
|
|
if (plen)
|
||
|
|
strcpy (t, prefix);
|
||
|
|
strcpy (t + plen, sl->list[i]);
|
||
|
|
if (slen)
|
||
|
|
strcpy (t + plen + llen, suffix);
|
||
|
|
free (sl->list[i]);
|
||
|
|
sl->list[i] = t;
|
||
|
|
}
|
||
|
|
|
||
|
|
return (sl);
|
||
|
|
}
|
||
|
|
|
||
|
|
void
|
||
|
|
print_stringlist (sl, prefix)
|
||
|
|
STRINGLIST *sl;
|
||
|
|
char *prefix;
|
||
|
|
{
|
||
|
|
register int i;
|
||
|
|
|
||
|
|
if (sl == 0)
|
||
|
|
return;
|
||
|
|
for (i = 0; i < sl->list_len; i++)
|
||
|
|
printf ("%s%s\n", prefix ? prefix : "", sl->list[i]);
|
||
|
|
}
|
||
|
|
|
||
|
|
void
|
||
|
|
sort_stringlist (sl)
|
||
|
|
STRINGLIST *sl;
|
||
|
|
{
|
||
|
|
if (sl == 0 || sl->list_len == 0 || sl->list == 0)
|
||
|
|
return;
|
||
|
|
sort_char_array (sl->list);
|
||
|
|
}
|
||
|
|
|
||
|
|
STRINGLIST *
|
||
|
|
word_list_to_stringlist (list, copy, starting_index, ip)
|
||
|
|
WORD_LIST *list;
|
||
|
|
int copy, starting_index, *ip;
|
||
|
|
{
|
||
|
|
STRINGLIST *ret;
|
||
|
|
int slen, len;
|
||
|
|
|
||
|
|
slen = list_length (list);
|
||
|
|
ret = (STRINGLIST *)xmalloc (sizeof (STRINGLIST));
|
||
|
|
ret->list = word_list_to_argv (list, copy, starting_index, &len);
|
||
|
|
ret->list_size = slen + starting_index;
|
||
|
|
ret->list_len = len;
|
||
|
|
if (ip)
|
||
|
|
*ip = len;
|
||
|
|
return ret;
|
||
|
|
}
|
||
|
|
|
||
|
|
WORD_LIST *
|
||
|
|
stringlist_to_word_list (sl, copy, starting_index)
|
||
|
|
STRINGLIST *sl;
|
||
|
|
int copy, starting_index;
|
||
|
|
{
|
||
|
|
WORD_LIST *list;
|
||
|
|
|
||
|
|
if (sl == 0 || sl->list == 0)
|
||
|
|
return ((WORD_LIST *)NULL);
|
||
|
|
|
||
|
|
list = argv_to_word_list (sl->list, copy, starting_index);
|
||
|
|
return list;
|
||
|
|
}
|