hash_chain_entry 41 gc/finalize.c struct hash_chain_entry { hash_chain_entry 43 gc/finalize.c struct hash_chain_entry * next; hash_chain_entry 50 gc/finalize.c struct hash_chain_entry prolog; hash_chain_entry 54 gc/finalize.c # define dl_set_next(x,y) (x) -> prolog.next = (struct hash_chain_entry *)(y) hash_chain_entry 68 gc/finalize.c struct hash_chain_entry prolog; hash_chain_entry 74 gc/finalize.c # define fo_set_next(x,y) (x) -> prolog.next = (struct hash_chain_entry *)(y) hash_chain_entry 102 gc/finalize.c struct hash_chain_entry ***table; hash_chain_entry 106 gc/finalize.c register struct hash_chain_entry *p; hash_chain_entry 111 gc/finalize.c struct hash_chain_entry **new_table = (struct hash_chain_entry **) hash_chain_entry 113 gc/finalize.c (size_t)new_size * sizeof(struct hash_chain_entry *), NORMAL); hash_chain_entry 126 gc/finalize.c register struct hash_chain_entry *next = p -> next; hash_chain_entry 179 gc/finalize.c GC_grow_table((struct hash_chain_entry ***)(&dl_head), hash_chain_entry 352 gc/finalize.c GC_grow_table((struct hash_chain_entry ***)(&fo_head),