gcse_hash_table_d Struct Reference

Collaboration diagram for gcse_hash_table_d:

Data Fields
struct gcse_expr **	table
unsigned int	size
unsigned int	n_elems

Detailed Description

Expression hash tables.
Each hash table is an array of buckets.
??? It is known that if it were an array of entries, structure elements
`next_same_hash' and `bitmap_index' wouldn't be necessary.  However, it is
not clear whether in the final analysis a sufficient amount of memory would
be saved as the size of the available expression bitmaps would be larger
[one could build a mapping table without holes afterwards though].
Someday I'll perform the computation and figure it out.   

Field Documentation

n_elems

unsigned int gcse_hash_table_d::n_elems

Referenced by compute_pre_data(), hoist_code(), one_code_hoisting_pass(), one_pre_gcse_pass(), pre_edge_insert(), pre_gcse(), and prune_expressions().

size

unsigned int gcse_hash_table_d::size

Referenced by hoist_code(), pre_delete(), pre_gcse(), pre_insert_copies(), prune_expressions(), and trim_ld_motion_mems().

table

struct gcse_expr** gcse_hash_table_d::table

Referenced by hoist_code(), pre_delete(), pre_gcse(), pre_insert_copies(), prune_expressions(), and trim_ld_motion_mems().

---

The documentation for this struct was generated from the following file:

• gcse.cc