sysc/utils/sc_hash.cpp

106     sc_phash_elem* ptr;
110         ptr = bins[i];
111         while (ptr != 0) {
112             next = ptr->next;
113             delete ptr;
114             ptr = next;
123     sc_phash_elem* ptr;
139         ptr = old_bins[i];
140         while (ptr != 0) {
141             next = ptr->next;
142             hash_val = do_hash(ptr->key);
143             ptr->next = bins[hash_val];
144             bins[hash_val] = ptr;
146             ptr = next;
156     sc_phash_elem*  ptr  = *last;
158     /* The (ptr->key != key) here is meant by the "q" */
159     while ((ptr != 0) && (ptr->key != key)) {
161         last = &(ptr->next);
162         ptr  = *last;
164     if ((ptr != 0) && reorder_flag) {
165         *last = ptr->next;
166         ptr->next = bins[hash_val];
167         bins[hash_val] = ptr;
171     return ptr;
178     sc_phash_elem*  ptr  = *last;
180     while ((ptr != 0) && ((*cmpr)(ptr->key, key) != 0)) {
181         last = &(ptr->next);
182         ptr = *last;
185     if ((ptr != 0) && reorder_flag) {
186         *last = ptr->next;
187         ptr->next = bins[hash_val];
188         bins[hash_val] = ptr;
192     return ptr;
213         sc_phash_elem* ptr = bins[i];
214         while (ptr != 0) {
215             sc_phash_elem* next = ptr->next;
216             delete ptr;
217             ptr = next;
229         sc_phash_elem* ptr = bins[i];
230         while (ptr != 0) {
231             sc_phash_elem* next = ptr->next;
232             (*kfree)(ptr->key);
233             delete ptr;
234             ptr = next;
264     sc_phash_elem* ptr = find_entry( hash_val, k );
265     if (ptr == 0) {
270         ptr->contents = c;
279     sc_phash_elem* ptr = find_entry( hash_val, k );
280     if (ptr == 0) {
285         ptr->contents = c;
294     sc_phash_elem* ptr = find_entry( hash_val, k );
295     if (ptr == 0) {
307     sc_phash_elem* ptr = find_entry( hash_val, k );
308     if (ptr == 0) {
321     sc_phash_elem*  ptr = find_entry( hash_val, k, &last );
323     if (ptr == 0)
326     assert(*last == ptr);
327     *last = ptr->next;
328     delete ptr;
338     sc_phash_elem*  ptr = find_entry( hash_val, k, &last );
340     if (ptr == 0) {
346         *pk = ptr->key;
347         *pc = ptr->contents;
350     assert(*last == ptr);
351     *last = ptr->next;
352     delete ptr;
374     sc_phash_elem*  ptr;
379         ptr = *last;
380         while (ptr != 0) {
381             if (ptr->contents != c) {
382                 last = &(ptr->next);
383                 ptr  = *last;
386                 *last = ptr->next;
387                 delete ptr;
388                 ptr = *last;
401     sc_phash_elem*  ptr;
406         ptr = *last;
407         while (ptr != 0) {
408             if (! (*predicate)(ptr->contents, arg)) {
409                 last = &(ptr->next);
410                 ptr  = *last;
413                 *last = ptr->next;
414                 delete ptr;
415                 ptr = *last;
428     sc_phash_elem*  ptr;
433         ptr = *last;
434         while (ptr != 0) {
435             if (ptr->contents != c) {
436                 last = &(ptr->next);
437                 ptr  = *last;
440                 *last = ptr->next;
441                 (*kfree)(ptr->key);
442                 delete ptr;
443                 ptr = *last;
456     sc_phash_elem*  ptr;
461         ptr = *last;
462         while (ptr != 0) {
463             if (! (*predicate)(ptr->contents, arg)) {
464                 last = &(ptr->next);
465                 ptr  = *last;
468                 *last = ptr->next;
469                 (*kfree)(ptr->key);
470                 delete ptr;
471                 ptr = *last;
484     sc_phash_elem* ptr = find_entry( hash_val, k );
485     if (ptr == 0) {
490         if (c_ptr != 0) *c_ptr = ptr->contents;