Home | History | Annotate | Download | only in coregrind

Lines Matching defs:chains

50    VgHashNode** chains;     // expanding array of hash chains
76 table->chains = VG_(calloc)("hashtable.Hc.2", 1, sz);
96 VgHashNode** chains;
125 chains = VG_(calloc)("hashtable.resize.1", 1, sz);
128 node = table->chains[i];
132 node->next = chains[chain];
133 chains[chain] = node;
138 VG_(free)(table->chains);
139 table->chains = chains;
148 node->next = table->chains[chain];
149 table->chains[chain] = node;
162 VgHashNode* curr = table->chains[ CHAIN_NO(key, table) ];
179 VgHashNode* curr = table->chains[ CHAIN_NO(hnode->key, table) ]; // GEN!!!
194 VgHashNode* curr = table->chains[chain];
195 VgHashNode** prev_next_ptr = &(table->chains[chain]);
218 VgHashNode* curr = table->chains[chain];
219 VgHashNode** prev_next_ptr = &(table->chains[chain]);
244 cno_occurences : how many chains have that length.
260 for (cnode = table->chains[i]; cnode != NULL; cnode = cnode->next) {
265 for (node = table->chains[i]; node != cnode; node = node->next) {
280 for (node = table->chains[i]; node != cnode; node = node->next) {
302 " chains of len N,"
345 for (node = table->chains[i]; node != NULL; node = node->next) {
379 if (table->chains[i]) {
380 table->iterNode = table->chains[i];
397 if (table->chains[curChain] == table->iterNode) {
399 table->chains[curChain] = table->iterNode->next;
405 VgHashNode* prev = table->chains[curChain];
425 for (node = table->chains[i]; node != NULL; node = node_next) {
430 VG_(free)(table->chains);