Lines Matching defs:array
83 struct node **array;
526 for (node = f->id_table.array[hash]; node != NULL; node = node->id_next)
579 newarray = realloc(t->array, sizeof(struct node *) * newsize);
581 t->array = newarray;
599 upper = &t->array[t->split + t->size / 2];
603 for (nodep = &t->array[t->split]; *nodep;
615 struct node **nodep = &f->id_table.array[id_hash(f, node->nodeid)];
633 newarray = realloc(t->array, sizeof(struct node *) * newsize);
637 t->array = newarray;
638 memset(t->array + t->size, 0, t->size * sizeof(struct node *));
657 for (nodep = &t->array[hash]; *nodep != NULL; nodep = next) {
664 node->id_next = t->array[newhash];
665 t->array[newhash] = node;
677 node->id_next = f->id_table.array[hash];
678 f->id_table.array[hash] = node;
716 upper = &t->array[t->split + t->size / 2];
720 for (nodep = &t->array[t->split]; *nodep;
734 struct node **nodep = &f->name_table.array[hash];
770 for (nodep = &t->array[hash]; *nodep != NULL; nodep = next) {
777 node->name_next = t->array[newhash];
778 t->array[newhash] = node;
803 node->name_next = f->name_table.array[hash];
804 f->name_table.array[hash] = node;
852 for (node = f->name_table.array[hash]; node != NULL; node = node->name_next)
4839 t->array = (struct node **) calloc(1, sizeof(struct node *) * t->size);
4840 if (t->array == NULL) {
5014 free(f->id_table.array);
5016 free(f->name_table.array);
5072 for (node = f->id_table.array[i]; node != NULL;
5088 for (node = f->id_table.array[i]; node != NULL; node = next) {
5100 free(f->id_table.array);
5101 free(f->name_table.array);