contrib/gcc/postreload-gcse.c

63    1. Build available expressions hash table:
66        the hash table.
91 /* We need to keep a hash table of expressions.  The table entries are of
98 /* Expression elements in the hash table.  */
104   /* The same hash for this entry.  */
105   hashval_t hash;
144    This array is used during the building of the hash table (step 1) to
178 /* Support for hash table construction and transformations.  */
239   /* Allocate the available expressions hash table.  We don't want to
240      make the hash table too small, but unnecessarily making it too large
297    Return the hash value for expression EXP.  We don't actually hash
298    here, we just return the cached hash value.  */
304   return exp->hash;
317   gcc_assert (!equiv_p || exp1->hash == exp2->hash);
323 /* Insert expression X in INSN in the hash TABLE.
331   hashval_t hash;
335   hash = hash_expr (x, &do_not_record_p);
344      allocate a new hash table element here already and set its fields.
351   cur_expr->hash = hash;
355 						    hash, INSERT);
404 /* Lookup pattern PAT in the expression hash table.
412   hashval_t hash = hash_expr (pat, &do_not_record_p);
420   tmp_expr->hash = hash;
424                                                     hash, INSERT);
436    expression hash table to FILE.  */
448   fprintf (file,"\nhashcode: %u\n", expr->hash);
465   fprintf (file, "\n\nexpression hash table\n");
611    the hash table construction or redundancy elimination phases start
770 /* Scan the pattern of INSN and add an entry to the hash TABLE.
809       /* Only record sets of pseudo-regs in the hash table.  */
830 /* Create hash table of memory expressions available at end of basic
831    blocks.  Basically you should think of this hash table as the
857       /* The next pass actually builds the hash table.  */
1232 /* Go over the expression hash table and delete insns that were