HomeSort by: relevance | last modified time | path
    Searched refs:node_table (Results 1 - 6 of 6) sorted by relevancy

  /src/external/gpl3/gcc/dist/libobjc/
hash.c 57 cache->node_table
59 assert (cache->node_table);
90 if ((node = cache->node_table[i]))
104 objc_free(cache->node_table);
120 node->next = (*cachep)->node_table[indx];
125 node_ptr node1 = (*cachep)->node_table[indx];
135 (*cachep)->node_table[indx] = node;
173 node_ptr node = cache->node_table[indx];
183 cache->node_table[indx] = node->next;
239 if (cache->node_table[cache->last_bucket]
    [all...]
  /src/external/gpl3/gcc.old/dist/libobjc/
hash.c 57 cache->node_table
59 assert (cache->node_table);
90 if ((node = cache->node_table[i]))
104 objc_free(cache->node_table);
120 node->next = (*cachep)->node_table[indx];
125 node_ptr node1 = (*cachep)->node_table[indx];
135 (*cachep)->node_table[indx] = node;
173 node_ptr node = cache->node_table[indx];
183 cache->node_table[indx] = node->next;
239 if (cache->node_table[cache->last_bucket]
    [all...]
  /src/external/gpl3/gcc/dist/libobjc/objc-private/
hash.h 82 node_ptr *node_table; /* Pointer to an array of hash nodes. */ member in struct:cache
87 "node_table"). Must be a power of two. */
  /src/external/gpl3/gcc.old/dist/libobjc/objc-private/
hash.h 82 node_ptr *node_table; /* Pointer to an array of hash nodes. */ member in struct:cache
87 "node_table"). Must be a power of two. */
  /src/external/mit/isl/dist/
isl_scheduler.h 206 * node_table contains pointers into the node array, hashed on the space tuples
244 struct isl_hash_table *node_table; member in struct:isl_sched_graph
isl_scheduler.c 177 /* Initialize node_table based on the list of nodes.
183 graph->node_table = isl_hash_table_alloc(ctx, graph->n);
184 if (!graph->node_table)
192 entry = isl_hash_table_find(ctx, graph->node_table, hash,
216 entry = isl_hash_table_find(ctx, graph->node_table, hash,
535 isl_hash_table_free(ctx, graph->node_table);

Completed in 22 milliseconds