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
|
/* list.c - Functions for manipulating linked lists of objects. */
/* Copyright (C) 1996-2009 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 3 of the License, 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. If not, see <http://www.gnu.org/licenses/>.
*/
#include "config.h"
#if defined (HAVE_UNISTD_H)
# ifdef _MINIX
# include <sys/types.h>
# endif
# include <unistd.h>
#endif
#include "shell.h"
/* A global variable which acts as a sentinel for an `error' list return. */
GENERIC_LIST global_error_list;
#ifdef INCLUDE_UNUSED
/* Call FUNCTION on every member of LIST, a generic list. */
void
list_walk (list, function)
GENERIC_LIST *list;
sh_glist_func_t *function;
{
for ( ; list; list = list->next)
if ((*function) (list) < 0)
return;
}
/* Call FUNCTION on every string in WORDS. */
void
wlist_walk (words, function)
WORD_LIST *words;
sh_icpfunc_t *function;
{
for ( ; words; words = words->next)
if ((*function) (words->word->word) < 0)
return;
}
#endif /* INCLUDE_UNUSED */
/* Reverse the chain of structures in LIST. Output the new head
of the chain. You should always assign the output value of this
function to something, or you will lose the chain. */
GENERIC_LIST *
list_reverse (list)
GENERIC_LIST *list;
{
register GENERIC_LIST *next, *prev;
for (prev = (GENERIC_LIST *)NULL; list; )
{
next = list->next;
list->next = prev;
prev = list;
list = next;
}
return (prev);
}
/* Return the number of elements in LIST, a generic list. */
int
list_length (list)
GENERIC_LIST *list;
{
register int i;
for (i = 0; list; list = list->next, i++);
return (i);
}
/* Append TAIL to HEAD. Return the header of the list. */
GENERIC_LIST *
list_append (head, tail)
GENERIC_LIST *head, *tail;
{
register GENERIC_LIST *t_head;
if (head == 0)
return (tail);
for (t_head = head; t_head->next; t_head = t_head->next)
;
t_head->next = tail;
return (head);
}
#ifdef INCLUDE_UNUSED
/* Delete the element of LIST which satisfies the predicate function COMPARER.
Returns the element that was deleted, so you can dispose of it, or -1 if
the element wasn't found. COMPARER is called with the list element and
then ARG. Note that LIST contains the address of a variable which points
to the list. You might call this function like this:
SHELL_VAR *elt = list_remove (&variable_list, check_var_has_name, "foo");
dispose_variable (elt);
*/
GENERIC_LIST *
list_remove (list, comparer, arg)
GENERIC_LIST **list;
Function *comparer;
char *arg;
{
register GENERIC_LIST *prev, *temp;
for (prev = (GENERIC_LIST *)NULL, temp = *list; temp; prev = temp, temp = temp->next)
{
if ((*comparer) (temp, arg))
{
if (prev)
prev->next = temp->next;
else
*list = temp->next;
return (temp);
}
}
return ((GENERIC_LIST *)&global_error_list);
}
#endif
|
