| /src/external/gpl3/gcc/dist/gcc/ |
| postreload-gcse.cc | 101 unsigned int bitmap_index;
406 cur_expr->bitmap_index = expr_table->elements () - 1;
981 get_bb_avail_insn (basic_block bb, struct occr *orig_occr, int bitmap_index)
994 && bitmap_bit_p (transp[bb->index], bitmap_index)
995 && (occr = get_bb_avail_insn (single_pred (bb), orig_occr, bitmap_index)))
1015 compute_transp (expr->expr, expr->bitmap_index, transp,
1077 expr->bitmap_index);
1081 expr->bitmap_index))
1229 for (a_occr = get_bb_avail_insn (bb, expr->avail_occr, expr->bitmap_index);
1231 a_occr = get_bb_avail_insn (bb, a_occr->next, expr->bitmap_index))
100 unsigned int bitmap_index; member in struct:expr
[all...] |
| cprop.cc | 71 int bitmap_index;
84 `next_same_hash' and `bitmap_index' wouldn't be necessary. However, it is
110 block index. In other words, implicit_set_indexes[i] is the bitmap_index
215 cur_expr->bitmap_index = table->n_elems++;
242 /* Record bitmap_index of the implicit set in implicit_set_indexes. */
245 = cur_expr->bitmap_index;
350 flat_table[expr->bitmap_index] = expr;
351 hash_val[expr->bitmap_index] = i;
362 expr->bitmap_index, hash_val[i]);
610 int indx = expr->bitmap_index;
70 int bitmap_index; member in struct:cprop_expr
[all...] |
| gcse.cc | 262 int bitmap_index;
312 `next_same_hash' and `bitmap_index' wouldn't be necessary. However, it is
697 int indx = expr->bitmap_index;
1169 cur_expr->bitmap_index = table->n_elems++;
1416 flat_table[expr->bitmap_index] = expr;
1417 hash_val[expr->bitmap_index] = i;
1429 expr->bitmap_index, hash_val[i], expr->max_distance);
1731 bitmap_set_bit (prune_exprs, expr->bitmap_index);
1770 bitmap_set_bit (prune_exprs, expr->bitmap_index);
1943 else if (bitmap_bit_p (comp[pred_bb->index], expr->bitmap_index))
261 int bitmap_index; member in struct:gcse_expr
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| cprop.cc | 71 int bitmap_index;
84 `next_same_hash' and `bitmap_index' wouldn't be necessary. However, it is
110 block index. In other words, implicit_set_indexes[i] is the bitmap_index
215 cur_expr->bitmap_index = table->n_elems++;
242 /* Record bitmap_index of the implicit set in implicit_set_indexes. */
245 = cur_expr->bitmap_index;
350 flat_table[expr->bitmap_index] = expr;
351 hash_val[expr->bitmap_index] = i;
362 expr->bitmap_index, hash_val[i]);
610 int indx = expr->bitmap_index;
70 int bitmap_index; member in struct:cprop_expr
[all...] |
| postreload-gcse.cc | 101 unsigned int bitmap_index;
406 cur_expr->bitmap_index = expr_table->elements () - 1;
980 get_bb_avail_insn (basic_block bb, struct occr *orig_occr, int bitmap_index)
993 && bitmap_bit_p (transp[bb->index], bitmap_index)
994 && (occr = get_bb_avail_insn (single_pred (bb), orig_occr, bitmap_index)))
1014 compute_transp (expr->expr, expr->bitmap_index, transp,
1076 expr->bitmap_index);
1080 expr->bitmap_index))
1228 for (a_occr = get_bb_avail_insn (bb, expr->avail_occr, expr->bitmap_index);
1230 a_occr = get_bb_avail_insn (bb, a_occr->next, expr->bitmap_index))
100 unsigned int bitmap_index; member in struct:expr
[all...] |
| gcse.cc | 262 int bitmap_index;
312 `next_same_hash' and `bitmap_index' wouldn't be necessary. However, it is
697 int indx = expr->bitmap_index;
1168 cur_expr->bitmap_index = table->n_elems++;
1415 flat_table[expr->bitmap_index] = expr;
1416 hash_val[expr->bitmap_index] = i;
1428 expr->bitmap_index, hash_val[i], expr->max_distance);
1730 bitmap_set_bit (prune_exprs, expr->bitmap_index);
1769 bitmap_set_bit (prune_exprs, expr->bitmap_index);
1942 else if (bitmap_bit_p (comp[pred_bb->index], expr->bitmap_index))
261 int bitmap_index; member in struct:gcse_expr
[all...] |
