Lines Matching defs:array
34 /* An array of pointers. Each one is for a different index. The
35 "synindex" command changes which array slot is pointed to by a
524 make_index_entries_unique (INDEX_ELT **array, int count)
535 || array[i]->node != array[i + 1]->node
536 || !STREQ (array[i]->entry, array[i + 1]->entry))
537 copy[j++] = array[i];
540 free (array[i]->entry);
541 free (array[i]->entry_text);
542 free (array[i]);
548 original array have been freed. Replace the current array with
571 array[i] = copy[i];
573 array[i] = NULL;
580 /* Sort the index passed in INDEX, returning an array of pointers to
581 elements. The array is terminated with a NULL pointer. */
586 INDEX_ELT **array;
602 /* We have the length, now we can allocate an array. */
603 array = xmalloc ((count + 1) * sizeof (INDEX_ELT *));
607 /* Allocate new memory for the return array, since parts of the
612 array[count] = xmalloc (sizeof (INDEX_ELT));
613 *(array[count]) = *(temp); /* struct assignment, hope it's ok */
617 array[count-1]->next = array[count];
621 line_number = array[count]->defining_line;
622 input_filename = array[count]->defining_file;
626 array[count]->entry = expansion (temp->entry_text, array[count]->code);
628 array[count] = NULL; /* terminate the array. */
649 /* Sort the array. */
650 qsort (array, count, sizeof (INDEX_ELT *), index_element_compare);
653 make_index_entries_unique (array, count);
658 *index = **array;
660 return array;
744 INDEX_ELT **array;
771 array = sort_index (index);
811 for (item = 0; (index = array[item]); item++)