Searched refs:expr_hash_table (Results 1 - 2 of 2) sorted by relevance
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/ |
H A D | gcse.c | 237 1) Build the hash table of expressions we wish to GCSE (expr_hash_table). 347 static struct hash_table_d expr_hash_table; 3259 compute_local_properties (transp, comp, antloc, &expr_hash_table); 3263 trapping_expr = sbitmap_alloc (expr_hash_table.n_elems); 3265 for (ui = 0; ui < expr_hash_table.size; ui++) 3268 for (e = expr_hash_table.table[ui]; e != NULL; e = e->next_same_hash) 3299 edge_list = pre_edge_lcm (expr_hash_table.n_elems, transp, comp, antloc, 3564 inserted = sbitmap_vector_alloc (num_edges, expr_hash_table.n_elems); 3576 for (j = indx; insert && j < (int) expr_hash_table.n_elems; j++, insert >>= 1) 3751 for (i = 0; i < expr_hash_table 346 static struct hash_table_d expr_hash_table; variable in typeref:struct:hash_table_d [all...] |
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/ |
H A D | gcse.c | 245 1) Build the hash table of expressions we wish to GCSE (expr_hash_table). 370 static struct hash_table expr_hash_table; 3834 compute_local_properties (transp, comp, antloc, &expr_hash_table); 3838 trapping_expr = sbitmap_alloc (expr_hash_table.n_elems); 3840 for (ui = 0; ui < expr_hash_table.size; ui++) 3843 for (e = expr_hash_table.table[ui]; e != NULL; e = e->next_same_hash) 3874 edge_list = pre_edge_lcm (gcse_file, expr_hash_table.n_elems, transp, comp, antloc, 4142 inserted = sbitmap_vector_alloc (num_edges, expr_hash_table.n_elems); 4154 for (j = indx; insert && j < (int) expr_hash_table.n_elems; j++, insert >>= 1) 4326 for (i = 0; i < expr_hash_table 369 static struct hash_table expr_hash_table; variable in typeref:struct:hash_table [all...] |
Completed in 168 milliseconds