GCC Middle and Back End API Reference
|
Data Fields | |
struct gcse_expr ** | table |
unsigned int | size |
unsigned int | n_elems |
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.
unsigned int gcse_hash_table_d::n_elems |
unsigned int gcse_hash_table_d::size |
struct gcse_expr** gcse_hash_table_d::table |