Lines Matching defs:hash
460 * Check if we have this node in the hash table already
919 * find the tdesc struct in the hash table for this type
923 if (tdp == NULL) { /* not in hash list */
1053 lookup_name(tdesc_t **hash, const char *name1)
1058 for (tdp = hash[bucket]; tdp != NULL; tdp = tdp->t_next) {
1077 * Add a node to the hash queues.
1082 int hash = HASH(num);
1087 * If it already exists in the hash table don't add it again
1094 tdp->t_hash = hash_table[hash];
1095 hash_table[hash] = tdp;
1102 hash = compute_sum(tdp->t_name);
1103 tdp->t_next = name_table[hash];
1104 name_table[hash] = tdp;
1109 terminate("stabs: broken hash\n");
1136 printf("checking hash\n");
1144 terminate("cycle in hash bucket %d\n", i);