contrib/gcc/tree-ssa-dom.c

91    expressions it enters into the hash table along with a marker entry
93    remove the expressions from the global hash table until we hit the
102    hash code for an expression and be unable to find/remove it from
106 /* Structure for entries in the expression hash table.
108    This requires more memory for the hash table entries, but allows us
110    eliminates 2 global hash tables and two block local varrays.
112    It also allows us to reduce the number of hash table lookups we
128   /* The hash value for RHS/ann.  */
129   hashval_t hash;
247   /* Create our hash tables.  */
462    initialize the hash table element pointed to by ELEMENT.  */
469      For the former case, we have no annotation and we want to hash the
504   element->hash = avail_expr_hash (element);
523       htab_remove_elt_with_hash (avail_exprs, &element, element.hash);
637 		 into our expression hash tables.  */
677 		 into our expression hash tables.  */
887 /* Dump statistics for the hash table HTAB.  */
898 /* Enter a statement into the true/false expression hash table indicating
910 				   element->hash, INSERT);
1462    If safe, record this expression into the available expression hash
1478      themselves be entered into the hash tables.  */
1944   /* Finally try to find the expression in the main expression hash table.  */
1945   slot = htab_find_slot_with_hash (avail_exprs, element, element->hash,
1996   /* If the hash table entry is not associated with a statement, then we
1997      can just hash the expression and not worry about virtual operands
2015   return ((const struct expr_hash_elt *)p)->hash;
2041       gcc_assert (!ret || ((struct expr_hash_elt *)p1)->hash
2042 		  == ((struct expr_hash_elt *)p2)->hash);