Searched refs:node_table (Results 1 - 3 of 3) sorted by relevance

/haiku-buildtools/legacy/gcc/libobjc/
H A Dhash.c59 cache->node_table
61 assert (cache->node_table);
90 if ((node = cache->node_table[i])) {
103 objc_free(cache->node_table);
120 node->next = (*cachep)->node_table[indx];
125 { node_ptr node1 = (*cachep)->node_table[indx];
136 (*cachep)->node_table[indx] = node;
176 node_ptr node = cache->node_table[indx];
184 cache->node_table[indx] = node->next;
233 if (cache->node_table[cach
[all...]
/haiku-buildtools/legacy/gcc/libobjc/objc/
H A Dhash.h83 node_ptr *node_table; /* Pointer to an array of hash nodes. */ member in struct:cache
88 "node_table"). Must be a power of two. */
/haiku-buildtools/isl/
H A Disl_schedule.c162 * node_table contains pointers into the node array, hashed on the space
196 struct isl_hash_table *node_table; member in struct:isl_sched_graph
207 /* Initialize node_table based on the list of nodes.
213 graph->node_table = isl_hash_table_alloc(ctx, graph->n);
214 if (!graph->node_table)
222 entry = isl_hash_table_find(ctx, graph->node_table, hash,
243 entry = isl_hash_table_find(ctx, graph->node_table, hash,
472 isl_hash_table_free(ctx, graph->node_table);

Completed in 54 milliseconds