2 * array.c - functions to create, destroy, access, and manipulate arrays
5 * Arrays are sparse doubly-linked lists. An element's index is stored
13 #if defined (ARRAY_VARS)
15 #if defined (HAVE_UNISTD_H)
22 #include "builtins/common.h"
24 extern char *quote_string (); /* XXX */
26 #define ADD_BEFORE(ae, new) \
28 ae->prev->next = new; \
29 new->prev = ae->prev; \
35 * Allocate and return a new array element with index INDEX and value
39 new_array_element(indx, value)
45 r = (ARRAY_ELEMENT *) xmalloc(sizeof(ARRAY_ELEMENT));
47 r->value = value ? savestring(value) : (char *)NULL;
48 r->next = r->prev = (ARRAY_ELEMENT *) NULL;
53 destroy_array_element(ae)
66 r =(ARRAY *) xmalloc(sizeof(ARRAY));
67 r->type = array_indexed;
68 r->max_index = r->max_size = -1;
70 head = new_array_element(-1, (char *)NULL); /* dummy head */
71 head->prev = head->next = head;
80 register ARRAY_ELEMENT *r, *r1;
84 for (r = element_forw(a->head); r != a->head; ) {
86 destroy_array_element(r);
89 a->head->next = a->head->prev = a->head;
90 a->max_index = a->max_size = -1;
91 a->num_elements = a->max_size = 0;
101 destroy_array_element(a->head);
110 ARRAY_ELEMENT *ae, *new;
113 return((ARRAY *) NULL);
116 a1->max_index = a->max_index;
117 a1->num_elements = a->num_elements;
118 a1->max_size = a->max_size;
119 for (ae = element_forw(a->head); ae != a->head; ae = element_forw(ae)) {
120 new = new_array_element(element_index(ae), element_value(ae));
121 ADD_BEFORE(a1->head, new);
127 * Make and return a new array composed of the elements in array A from
131 dup_array_subrange(array, s, e)
133 ARRAY_ELEMENT *s, *e;
136 ARRAY_ELEMENT *p, *n;
140 a->type = array->type;
142 for (p = s, i = 0; p != e; p = element_forw(p), i++) {
143 n = new_array_element (i, element_value(p));
144 ADD_BEFORE(a->head, n);
146 a->num_elements = a->max_index = i;
151 copy_array_element(ae)
154 return(ae ? new_array_element(element_index(ae), element_value(ae))
155 : (ARRAY_ELEMENT *) NULL);
159 * Add a new element with index I and value V to array A (a[i] = v).
162 array_add_element(a, i, v)
167 register ARRAY_ELEMENT *new, *ae;
171 new = new_array_element(i, v);
172 if (i > array_max_index(a)) {
174 * Hook onto the end. This also works for an empty array.
175 * Fast path for the common case of allocating arrays
178 ADD_BEFORE(a->head, new);
184 * Otherwise we search for the spot to insert it.
186 for (ae = element_forw(a->head); ae != a->head; ae = element_forw(ae)) {
187 if (element_index(ae) == i) {
189 * Replacing an existing element.
191 destroy_array_element(new);
192 free(element_value(ae));
193 ae->value = savestring(v);
195 } else if (element_index(ae) > i) {
201 return (-1); /* problem */
205 * Delete the element with index I from array A and return it so the
206 * caller can dispose of it.
209 array_delete_element(a, i)
213 register ARRAY_ELEMENT *ae;
215 if (!a || array_empty(a))
216 return((ARRAY_ELEMENT *) NULL);
217 for (ae = element_forw(a->head); ae != a->head; ae = element_forw(ae))
218 if (element_index(ae) == i) {
219 ae->next->prev = ae->prev;
220 ae->prev->next = ae->next;
222 if (i == array_max_index(a))
223 a->max_index = element_index(ae->prev);
226 return((ARRAY_ELEMENT *) NULL);
230 * Return the value of a[i].
233 array_reference(a, i)
237 register ARRAY_ELEMENT *ae;
239 if (a == 0 || array_empty(a))
240 return((char *) NULL);
241 for (ae = element_forw(a->head); ae != a->head; ae = element_forw(ae))
242 if (element_index(ae) == i)
243 return(element_value(ae));
244 return((char *) NULL);
248 * Walk the array, calling FUNC once for each element, with the array
249 * element as the argument.
256 register ARRAY_ELEMENT *ae;
258 if (a == 0 || array_empty(a))
260 for (ae = element_forw(a->head); ae != a->head; ae = element_forw(ae))
265 * Return a string that is the concatenation of all the elements in A,
269 array_to_string_internal (start, end, sep, quoted)
270 ARRAY_ELEMENT *start, *end;
276 int slen, rsize, rlen, reg;
278 if (start == end) /* XXX - should not happen */
279 return ((char *)NULL);
282 for (rsize = rlen = 0, ae = start; ae != end; ae = element_forw(ae)) {
284 result = xmalloc (rsize = 64);
285 if (element_value(ae)) {
286 t = quoted ? quote_string(element_value(ae)) : element_value(ae);
288 RESIZE_MALLOCED_BUFFER (result, rlen, (reg + slen + 2),
290 strcpy(result + rlen, t);
295 * Add a separator only after non-null elements.
297 if (element_forw(ae) != end) {
298 strcpy(result + rlen, sep);
303 result[rlen] = '\0'; /* XXX */
308 array_to_string (a, sep, quoted)
314 return((char *)NULL);
316 return(savestring(""));
317 return (array_to_string_internal (element_forw(a->head), a->head, sep, quoted));
321 array_to_assignment_string (a)
324 char *result, *indstr, *valstr;
326 int rsize, rlen, elen;
328 if (a == 0 || array_empty (a))
329 return((char *)NULL);
331 result = xmalloc (rsize = 128);
335 for (ae = element_forw(a->head); ae != a->head; ae = element_forw(ae)) {
336 indstr = itos (element_index(ae));
337 valstr = element_value (ae) ? double_quote (element_value(ae))
339 elen = STRLEN (indstr) + 8 + STRLEN (valstr);
340 RESIZE_MALLOCED_BUFFER (result, rlen, (elen + 1), rsize, rsize);
342 result[rlen++] = '[';
343 strcpy (result + rlen, indstr);
344 rlen += STRLEN (indstr);
345 result[rlen++] = ']';
346 result[rlen++] = '=';
348 strcpy (result + rlen, valstr);
349 rlen += STRLEN (valstr);
352 if (element_forw(ae) != a->head)
353 result[rlen++] = ' ';
358 RESIZE_MALLOCED_BUFFER (result, rlen, 1, rsize, 8);
359 result[rlen++] = ')';
365 quoted_array_assignment_string (a)
370 sv = array_to_assignment_string (a);
372 return ((char *)NULL);
374 vstr = single_quote (sv);
380 /* Determine if s2 occurs in s1. If so, return a pointer to the
381 match in s1. The compare is case sensitive. */
384 register char *s1, *s2;
386 register int i, l, len;
388 for (i = 0, l = strlen(s2), len = strlen(s1); (len - i) >= l; i++)
389 if (strncmp (s1 + i, s2, l) == 0)
391 return ((char *)NULL);
396 * Return an array consisting of elements in S, separated by SEP
399 string_to_array(s, sep)
406 return((ARRAY *)NULL);
407 w = list_string (s, sep, 0);
409 return((ARRAY *)NULL);
410 a = word_list_to_array (w);
414 /* Convenience routines for the shell to translate to and from the form used
415 by the rest of the code. */
417 array_to_word_list(a)
423 if (a == 0 || array_empty(a))
424 return((WORD_LIST *)NULL);
425 list = (WORD_LIST *)NULL;
426 for (ae = element_forw(a->head); ae != a->head; ae = element_forw(ae))
427 list = make_word_list (make_bare_word(element_value(ae)), list);
428 return (REVERSE_LIST(list, WORD_LIST *));
432 assign_word_list (array, list)
436 register WORD_LIST *l;
437 register arrayind_t i;
439 for (l = list, i = 0; l; l = l->next, i++)
440 array_add_element(array, i, l->word->word);
445 word_list_to_array (list)
451 return((ARRAY *)NULL);
453 return (assign_word_list (a, list));
463 if (array == 0 || array->head == 0 || array_empty (array))
464 return (ARRAY *)NULL;
465 for (a = element_forw(array->head); a != array->head; a = element_forw(a)) {
466 t = quote_string (a->value);
474 array_subrange (a, start, end, quoted)
476 int start, end, quoted;
478 ARRAY_ELEMENT *h, *p;
482 if (p == 0 || array_empty (a) || start > array_num_elements (a))
483 return ((char *)NULL);
485 for (i = 0, p = element_forw(p); p != a->head && i < start; i++, p = element_forw(p))
488 return ((char *)NULL);
489 for (h = p; p != a->head && i < end; i++, p = element_forw(p))
492 return (array_to_string_internal (h, p, " ", quoted));
496 array_pat_subst (a, pat, rep, mflags)
505 if (array_head (a) == 0 || array_empty (a))
506 return ((char *)NULL);
509 for (e = element_forw(a2->head); e != a2->head; e = element_forw(e)) {
510 t = pat_subst(element_value(e), pat, rep, mflags);
511 FREE(element_value(e));
515 if (mflags & MATCH_QUOTED)
517 t = array_to_string (a2, " ", 0);
524 #if defined (TEST_ARRAY)
528 printf("array[%d] = %s\n",(int)element_index(ae), element_value(ae));
535 array_walk(a, print_element);
540 ARRAY *a, *new_a, *copy_of_a;
545 array_add_element(a, 1, "one");
546 array_add_element(a, 7, "seven");
547 array_add_element(a, 4, "four");
548 array_add_element(a, 1029, "one thousand twenty-nine");
549 array_add_element(a, 12, "twelve");
550 array_add_element(a, 42, "forty-two");
552 s = array_to_string (a, " ");
553 printf("s = %s\n", s);
554 copy_of_a = string_to_array(s, " ");
555 printf("copy_of_a:");
556 print_array(copy_of_a);
557 dispose_array(copy_of_a);
560 ae = array_delete_element(a, 4);
561 destroy_array_element(ae);
562 ae = array_delete_element(a, 1029);
563 destroy_array_element(ae);
564 array_add_element(a, 16, "sixteen");
566 s = array_to_string (a, " ");
567 printf("s = %s\n", s);
568 copy_of_a = string_to_array(s, " ");
569 printf("copy_of_a:");
570 print_array(copy_of_a);
571 dispose_array(copy_of_a);
574 array_add_element(a, 2, "two");
575 array_add_element(a, 1029, "new one thousand twenty-nine");
576 array_add_element(a, 0, "zero");
577 array_add_element(a, 134, "");
579 s = array_to_string (a, ":");
580 printf("s = %s\n", s);
581 copy_of_a = string_to_array(s, ":");
582 printf("copy_of_a:");
583 print_array(copy_of_a);
584 dispose_array(copy_of_a);
587 new_a = copy_array(a);
589 s = array_to_string (new_a, ":");
590 printf("s = %s\n", s);
591 copy_of_a = string_to_array(s, ":");
592 printf("copy_of_a:");
593 print_array(copy_of_a);
594 dispose_array(copy_of_a);
598 dispose_array(new_a);
601 #endif /* TEST_ARRAY */
602 #endif /* ARRAY_VARS */