Lines Matching defs:id_table
110 struct node_table id_table;
512 uint64_t hash = ((uint32_t) ino * 2654435761U) % f->id_table.size;
513 uint64_t oldhash = hash % (f->id_table.size / 2);
515 if (oldhash >= f->id_table.split)
526 for (node = f->id_table.array[hash]; node != NULL; node = node->id_next)
589 struct node_table *t = &f->id_table;
615 struct node **nodep = &f->id_table.array[id_hash(f, node->nodeid)];
620 f->id_table.use--;
622 if(f->id_table.use < f->id_table.size / 4)
647 struct node_table *t = &f->id_table;
677 node->id_next = f->id_table.array[hash];
678 f->id_table.array[hash] = node;
679 f->id_table.use++;
681 if (f->id_table.use >= f->id_table.size / 2)
4981 if (node_table_init(&f->id_table) == -1)
5014 free(f->id_table.array);
5069 for (i = 0; i < f->id_table.size; i++) {
5072 for (node = f->id_table.array[i]; node != NULL;
5084 for (i = 0; i < f->id_table.size; i++) {
5088 for (node = f->id_table.array[i]; node != NULL; node = next) {
5091 f->id_table.use--;
5100 free(f->id_table.array);