Lines Matching refs:VgHashNode
48 VgHashNode* iterNode; // current iterator node
50 VgHashNode** chains; // expanding array of hash chains
73 SizeT sz = n_chains * sizeof(VgHashNode*);
96 VgHashNode** chains;
97 VgHashNode * node;
124 sz = new_chains * sizeof(VgHashNode*);
130 VgHashNode* next = node->next;
142 /* Puts a new, heap allocated VgHashNode, into the VgHashTable. Prepends
146 VgHashNode* node = (VgHashNode*)vnode;
159 /* Looks up a VgHashNode by key in the table. Returns NULL if not found. */
162 VgHashNode* curr = table->chains[ CHAIN_NO(key, table) ];
173 /* Looks up a VgHashNode by node in the table. Returns NULL if not found.
178 const VgHashNode* hnode = node; // GEN!!!
179 VgHashNode* curr = table->chains[ CHAIN_NO(hnode->key, table) ]; // GEN!!!
190 /* Removes a VgHashNode from the table. Returns NULL if not found. */
194 VgHashNode* curr = table->chains[chain];
195 VgHashNode** prev_next_ptr = &(table->chains[chain]);
212 /* Removes a VgHashNode by node from the table. Returns NULL if not found.
216 const VgHashNode* hnode = node; // GEN!!!
218 VgHashNode* curr = table->chains[chain];
219 VgHashNode** prev_next_ptr = &(table->chains[chain]);
249 VgHashNode *cnode, *node;
331 VgHashNode** VG_(HT_to_array) (const VgHashTable *table, /*OUT*/ UInt* n_elems)
334 VgHashNode** arr;
335 VgHashNode* node;
341 arr = VG_(malloc)( "hashtable.Hta.1", *n_elems * sizeof(VgHashNode*) );
389 VgHashNode *node, *node_next;
