/freebsd-9.3-release/contrib/gcc/ |
H A D | df-core.c | 525 gcc_assert (TEST_BIT (dataflow->pending, bb->index)); 532 if (!TEST_BIT (dataflow->considered, e->src->index)) 549 if (!TEST_BIT (dataflow->considered, e->dest->index)) 559 if (!TEST_BIT (dataflow->considered, e->dest->index)) 561 if (!TEST_BIT (dataflow->visited, e->dest->index)) 577 gcc_assert (TEST_BIT (dataflow->pending, bb->index)); 584 if (!TEST_BIT (dataflow->considered, e->dest->index)) 602 if (!TEST_BIT (dataflow->considered, e->src->index)) 613 if (!TEST_BIT (dataflow->considered, e->src->index)) 616 if (!TEST_BIT (dataflo [all...] |
H A D | domwalk.c | 161 || TEST_BIT (walk_data->interesting_blocks, 229 || TEST_BIT (walk_data->interesting_blocks,
|
H A D | cfganal.c | 201 if (dest != EXIT_BLOCK_PTR && ! TEST_BIT (visited, dest->index)) 692 if (dest != EXIT_BLOCK_PTR && ! TEST_BIT (visited, dest->index)) 781 if (dest != EXIT_BLOCK_PTR && ! TEST_BIT (visited, dest->index)) 912 if (!TEST_BIT (data->visited_blocks, e->src->index)) 918 if (!TEST_BIT (data->visited_blocks, bb->index)) 956 #define VISITED_P(BB) (TEST_BIT (visited, (BB)->index))
|
H A D | gcse.c | 2458 if (TEST_BIT (reg_set_in_block[bb->index], REGNO (x))) 2472 if (TEST_BIT (reg_set_in_block[bb->index], REGNO (x))) 2738 if (TEST_BIT (cprop_avin[BLOCK_NUM (insn)], set->bitmap_index)) 3480 if (TEST_BIT (cprop_avout[bb], set->bitmap_index)) 3914 else if (TEST_BIT (comp[pred_bb->index], expr->bitmap_index)) 3925 else if (! TEST_BIT (transp[pred_bb->index], expr->bitmap_index)) 4034 || TEST_BIT (antloc[bb->index], expr->bitmap_index) 4035 || TEST_BIT (transp[bb->index], expr->bitmap_index)); 4079 || TEST_BIT (antloc[bb->index], expr->bitmap_index) 4080 || TEST_BIT (trans [all...] |
H A D | cfgloopmanip.c | 209 if (TEST_BIT (in_queue, pred->index)) 226 if (TEST_BIT (in_queue, pred->index)) 297 if (ae->dest != EXIT_BLOCK_PTR && !TEST_BIT (seen, ae->dest->index)) 329 if (TEST_BIT (seen, bb->index)) 487 if (!TEST_BIT (seen, ldom->index)) 858 scale_step[i - 1] = TEST_BIT (wont_exit, i) 885 prob_pass_main = TEST_BIT (wont_exit, 0) 936 if (orig && TEST_BIT (wont_exit, 0)) 1002 if (orig && TEST_BIT (wont_exit, j + 1))
|
H A D | tree-ssa-structalias.c | 1141 if (TEST_BIT (si->roots, w)) 1144 if (!TEST_BIT (si->visited, w)) 1224 if (update_changed && TEST_BIT (changed, from)) 1227 if (!TEST_BIT (changed, to)) 1241 if (update_changed && !TEST_BIT (changed, to)) 1315 if (!TEST_BIT (ti->visited, j)) 1372 if (!TEST_BIT (changed, t)) 1438 if (!TEST_BIT (changed, lhs)) 1475 if (!TEST_BIT (changed, t)) 1508 if (!TEST_BIT (change [all...] |
H A D | tree-ssa-dce.c | 259 if (TEST_BIT (processed, ver)) 460 if (TEST_BIT (last_stmt_necessary, cd_bb->index)) 505 && ! TEST_BIT (visited_control_parents, bb->index)) 534 && ! TEST_BIT (visited_control_parents, arg_bb->index))
|
H A D | tree-ssa-propagate.c | 180 gcc_assert (!TEST_BIT (bb_in_list, bb->index)); 275 if (TEST_BIT (bb_in_list, bb->index)) 379 || TEST_BIT (executable_blocks, bb->index)) 407 if (!TEST_BIT (executable_blocks, block->index))
|
H A D | modulo-sched.c | 1390 if (TEST_BIT (sched_nodes, v_node->cuid)) 1414 if (TEST_BIT (sched_nodes, v_node->cuid)) 1439 if (TEST_BIT (sched_nodes, v_node->cuid)) 1452 if (TEST_BIT (sched_nodes, v_node->cuid)) 1537 if (TEST_BIT (sched_nodes, u)) 1546 if (TEST_BIT (NODE_PREDECESSORS (u_node), nodes_order[j - 1]) 1547 || TEST_BIT (NODE_SUCCESSORS (u_node), nodes_order[j - 1])) 1572 if (TEST_BIT (sched_nodes, e->src->cuid) 1578 if (TEST_BIT (sched_nodes, e->dest->cuid) 1675 gcc_assert (u < num_nodes && u >= 0 && !TEST_BIT (tm [all...] |
H A D | ddg.c | 423 if (! TEST_BIT (dest_node->successors, j)) 716 if (TEST_BIT (nodes, e->dest->cuid)) 942 if (!TEST_BIT (reachable_from, v)) 971 if (!TEST_BIT (reach_to, v)) 1005 if (TEST_BIT (nodes, v)
|
H A D | mode-switching.c | 154 if (e->aux || ! TEST_BIT (transp[pb->index], j)) 597 if (! TEST_BIT (insert[e], j)) 625 if (TEST_BIT (delete[bb->index], j))
|
H A D | sbitmap.h | 50 #define TEST_BIT(BITMAP, BITNO) \ macro
|
H A D | sched-rgn.c | 234 ( TEST_BIT (dom[bb_src], bb_trg) ) 581 if (max_hdr[child] >= 0 && TEST_BIT (in_stack, max_hdr[child])) 612 if (TEST_BIT (in_stack, child)) 627 if (max_hdr[child] >= 0 && TEST_BIT (in_stack, max_hdr[child])) 704 if (TEST_BIT (header, bb->index) && TEST_BIT (inner, bb->index)) 858 else if (!TEST_BIT (in_queue, node) && node != bb->index) 1080 if (max_hdr[bbn] != -1 && !TEST_BIT (header, bbn)) 1421 if (!TEST_BIT (visited, e->dest->index)) 1707 || (TEST_BIT (ancestor_edge [all...] |
H A D | tree-outof-ssa.c | 417 if (!TEST_BIT (g->visited, S)) 432 if (!TEST_BIT (g->visited, P)) 447 if (!TEST_BIT (g->visited, P)) 472 if (!TEST_BIT (g->visited, P)) 521 if (!TEST_BIT (g->visited, p)) 529 if (!TEST_BIT (g->visited, x))
|
H A D | cfgloop.c | 714 if (!TEST_BIT (headers, rc_order[b])) 1174 && !TEST_BIT (irreds, bb->index)) 1180 && TEST_BIT (irreds, bb->index))
|
H A D | tree-ssa-live.c | 223 if (!TEST_BIT (used, tmp) && map->partition_to_var[tmp] != NULL_TREE) 1038 if (TEST_BIT (seen, p)) 1112 if (TEST_BIT (seen, p))
|
H A D | cfgbuild.c | 762 TEST_BIT (blocks, bb->index) ? BLOCK_TO_SPLIT : BLOCK_ORIGINAL);
|
H A D | tree-ssa-copy.c | 528 if (TEST_BIT (visited, SSA_NAME_VERSION (val)))
|
H A D | tree-ssa-phiopt.c | 260 #define VISITED_P(BB) (TEST_BIT (visited, (BB)->index))
|
H A D | tree-stdarg.c | 98 if (! TEST_BIT (visited, src->index))
|
H A D | var-tracking.c | 1869 if (!TEST_BIT (visited, bb->index)) 1894 if (TEST_BIT (visited, e->dest->index)) 1896 if (!TEST_BIT (in_pending, e->dest->index)) 1905 else if (!TEST_BIT (in_worklist, e->dest->index))
|
H A D | tree-into-ssa.c | 559 return ver < new_ssa_names->n_bits && TEST_BIT (old_ssa_names, ver); 569 return ver < new_ssa_names->n_bits && TEST_BIT (new_ssa_names, ver);
|
H A D | cfg.c | 298 if (! TEST_BIT (edge_cache, dst->index))
|
H A D | sbitmap.c | 762 if (TEST_BIT (bmap, i))
|
H A D | tree-ssa-loop-im.c | 1455 if (TEST_BIT (contains_call, bb->index))
|