contrib/gcc/gcse.c

245    1) Build the hash table of expressions we wish to GCSE (expr_hash_table).
296   /* Next entry with the same hash.  */
334 /* Expression and copy propagation hash tables.
335    Each hash table is an array of buckets.
349   /* Size of the hash table, in elements.  */
352   /* Number of hash table elements.  */
359 /* Expression hash table.  */
362 /* Copy propagation hash table.  */
456   unsigned int hash_index;	/* Index when in a hash table.  */
476    It is computed during hash table computation and not by compute_sets
695      [since it's unchanging], however it is currently done during hash table
700      information about memory sets when we build the hash tables.  */
1011    TABLE controls which hash table to look at.  If it is  set hash table,
1446    the current size of the hash table to be probed.  */
1452   unsigned int hash;
1456   hash = hash_rtx (x, mode, do_not_record_p,
1458   return hash % hash_table_size;
1471   unsigned int hash;
1473   hash = regno;
1474   return hash % hash_table_size;
1485 /* Insert expression X in INSN in the hash TABLE.
1500   unsigned int hash;
1504   hash = hash_expr (x, mode, &do_not_record_p, table->size);
1512   cur_expr = table->table[hash];
1527       if (table->table[hash] == NULL)
1529 	table->table[hash] = cur_expr;
1531 	/* Add EXPR to end of this hash chain.  */
1592 /* Insert pattern X in INSN in the hash table.
1601   unsigned int hash;
1607   hash = hash_set (REGNO (SET_DEST (x)), table->size);
1609   cur_expr = table->table[hash];
1624       if (table->table[hash] == NULL)
1626 	table->table[hash] = cur_expr;
1628 	/* Add EXPR to end of this hash chain.  */
1689 /* Scan pattern PAT of INSN and add an entry to the hash TABLE (set or
1718       /* Only record sets of pseudo-regs in the hash table.  */
1777             /* Only record sets of pseudo-regs in the hash table.  */
1806 	       /* Record the memory expression (DEST) in the hash table.  */
1827 /* Process INSN and add hash table entries as appropriate.
1835    If SET_P is nonzero, this is for the assignment hash table,
1836    otherwise it is for the expression hash table.
1892   fprintf (file, "%s hash table (%d buckets, %d entries)\n",
1899 	fprintf (file, "Index %d (hash value %d)\n  ",
2022 /* Top level function to create an expression or assignment hash table.
2024    Expression entries are placed in the hash table if
2029    Assignment entries are placed in the hash table if
2043   /* While we compute the hash table we also compute a bit array of which
2085       /* Insert implicit sets in the hash table.  */
2091       /* The next pass builds the hash table.  */
2110 /* Allocate space for the set/expr hash TABLE.
2125   /* Attempt to maintain efficient use of hash table.
2142 /* Compute the hash TABLE for doing copy/const propagation or
2143    expression hash table.  */
2148   /* Initialize count of number of entries in hash table.  */
2164   unsigned int hash = hash_set (regno, table->size);
2167   expr = table->table[hash];
4510      hash table entry.  */
4852      hash table entry.  */
5072   unsigned int hash;
5076   hash = hash_rtx (x, GET_MODE (x), &do_not_record_p,
5080   slot = htab_find_slot_with_hash (pre_ldst_table, &e, hash, INSERT);
5095   ptr->hash_index   = hash;
5375 	  unsigned int hash = ptr->hash_index % expr_hash_table.size;
5377 	  for (expr = expr_hash_table.table[hash];
6564      [since it's unchanging], however it is currently done during hash table
6569      information about memory sets when we build the hash tables.  */