Searched refs:node_table (Results 1 – 6 of 6) sorted by relevance
57 cache->node_table in objc_hash_new()59 assert (cache->node_table); in objc_hash_new()90 if ((node = cache->node_table[i])) in objc_hash_delete()104 objc_free(cache->node_table); in objc_hash_delete()120 node->next = (*cachep)->node_table[indx]; in objc_hash_add()125 node_ptr node1 = (*cachep)->node_table[indx]; in objc_hash_add()135 (*cachep)->node_table[indx] = node; in objc_hash_add()173 node_ptr node = cache->node_table[indx]; in objc_hash_remove()183 cache->node_table[indx] = node->next; in objc_hash_remove()239 if (cache->node_table[cache->last_bucket]) in objc_hash_next()[all …]
82 node_ptr *node_table; /* Pointer to an array of hash nodes. */ member
244 struct isl_hash_table *node_table; member
183 graph->node_table = isl_hash_table_alloc(ctx, graph->n); in graph_init_table()184 if (!graph->node_table) in graph_init_table()192 entry = isl_hash_table_find(ctx, graph->node_table, hash, in graph_init_table()216 entry = isl_hash_table_find(ctx, graph->node_table, hash, in isl_sched_graph_find_node()535 isl_hash_table_free(ctx, graph->node_table); in isl_sched_graph_free()