Home
last modified time | relevance | path

Searched refs:bb2 (Results 1 – 25 of 25) sorted by relevance

/openbsd/gnu/usr.bin/gcc/gcc/
H A Dtracer.c174 bb = bb2;
270 if (blocks[bb2->index]) in tail_duplicate()
275 traced_insns += bb2->frequency * counts [bb2->index]; in tail_duplicate()
276 if (bb2->pred && bb2->pred->pred_next in tail_duplicate()
279 edge e = bb2->pred; in tail_duplicate()
280 basic_block old = bb2; in tail_duplicate()
285 bb2 = cfg_layout_duplicate_bb (bb2, e); in tail_duplicate()
295 old->index, bb2->index, bb2->frequency); in tail_duplicate()
297 RBI (bb)->next = bb2; in tail_duplicate()
298 RBI (bb2)->visited = 1; in tail_duplicate()
[all …]
H A Dcfgcleanup.c1027 basic_block bb1, bb2;
1045 i2 = bb2->end;
1140 basic_block bb2;
1151 return (bb2->succ && !bb2->succ->succ_next
1153 && (GET_CODE (bb2->end) != JUMP_INSN || simplejump_p (bb2->end)));
1168 if (!bb2->succ
1169 || !bb2->succ->succ_next
1172 || !onlyjump_p (bb2->end))
1187 b2 = BRANCH_EDGE (bb2);
1249 && maybe_hot_bb_p (bb2))
[all …]
H A Ddominance.c687 nearest_common_dominator (dom, bb1, bb2) in nearest_common_dominator() argument
690 basic_block bb2;
693 return bb2;
694 if (!bb2)
700 bb2)));
705 dominated_by_p (dom, bb1, bb2) in dominated_by_p() argument
708 basic_block bb2;
710 return nearest_common_dominator (dom, bb1, bb2) == bb2;
808 basic_block bb, bb2; local
810 if ((bb2 = get_immediate_dominator (dom, bb)))
[all …]
H A Dprofile.c1095 union_groups (bb1, bb2) in union_groups() argument
1096 basic_block bb1, bb2; in union_groups()
1099 basic_block bb2g = find_group (bb2);
H A Dcfgrtl.c1240 back_edge_of_syntactic_loop_p (bb1, bb2) in back_edge_of_syntactic_loop_p() argument
1241 basic_block bb1, bb2; in back_edge_of_syntactic_loop_p()
1247 if (bb1 == bb2)
1252 for (bb = bb1; bb && bb != bb2; bb = bb->next_bb)
1258 for (insn = bb1->end; insn != bb2->head && count >= 0;
H A Demit-rtl.c3796 basic_block bb, bb2; local
3807 && (bb2 = BLOCK_FOR_INSN (from)))
3809 if (bb2->end == to)
3810 bb2->end = prev;
3811 bb2->flags |= BB_DIRTY;
/openbsd/gnu/gcc/gcc/
H A Dtracer.c168 basic_block bb2 = e->src; in find_trace() local
174 bb = bb2; in find_trace()
269 if (blocks[bb2->index]) in tail_duplicate()
274 traced_insns += bb2->frequency * counts [bb2->index]; in tail_duplicate()
279 basic_block old = bb2; in tail_duplicate()
281 e = find_edge (bb, bb2); in tail_duplicate()
284 bb2 = duplicate_block (bb2, e, bb); in tail_duplicate()
294 old->index, bb2->index, bb2->frequency); in tail_duplicate()
296 bb->aux = bb2; in tail_duplicate()
297 bb2->il.rtl->visited = 1; in tail_duplicate()
[all …]
H A Dcfgcleanup.c1076 i2 = BB_END (bb2); in flow_find_cross_jump()
1170 edge b2 = BRANCH_EDGE (bb2); in condjump_equiv_p()
1203 set2 = pc_set (BB_END (bb2)); in condjump_equiv_p()
1258 && maybe_hot_bb_p (bb2)) in condjump_equiv_p()
1284 bb1->index, bb2->index); in condjump_equiv_p()
1310 return (single_succ_p (bb2) in outgoing_edges_match()
1313 && (!JUMP_P (BB_END (bb2)) || simplejump_p (BB_END (bb2)))); in outgoing_edges_match()
1332 b2 = BRANCH_EDGE (bb2); in outgoing_edges_match()
1334 f2 = FALLTHRU_EDGE (bb2); in outgoing_edges_match()
1394 && maybe_hot_bb_p (bb2)) in outgoing_edges_match()
[all …]
H A Dvalue-prof.c186 basic_block bb, bb2, bb3, bb4; in tree_divmod_fixed_value() local
228 bb2 = e12->dest; in tree_divmod_fixed_value()
229 bb2->count = count; in tree_divmod_fixed_value()
230 e23 = split_block (bb2, bb2end); in tree_divmod_fixed_value()
349 basic_block bb, bb2, bb3, bb4; in tree_mod_pow2() local
395 bb2 = e12->dest; in tree_mod_pow2()
396 bb2->count = count; in tree_mod_pow2()
397 e23 = split_block (bb2, bb2end); in tree_mod_pow2()
513 basic_block bb, bb2, bb3, bb4; in tree_mod_subtract() local
566 bb2 = e12->dest; in tree_mod_subtract()
[all …]
H A Dtree-ssa-phiopt.c158 basic_block bb1, bb2; in tree_ssa_phiopt() local
173 bb2 = e2->dest; in tree_ssa_phiopt()
182 || bb2 == NULL in tree_ssa_phiopt()
183 || EDGE_COUNT (bb2->succs) == 0) in tree_ssa_phiopt()
187 if (EDGE_SUCC (bb1, 0)->dest == bb2) in tree_ssa_phiopt()
189 else if (EDGE_SUCC (bb2, 0)->dest == bb1) in tree_ssa_phiopt()
193 bb1 = bb2; in tree_ssa_phiopt()
194 bb2 = bb_tmp; in tree_ssa_phiopt()
214 phi = phi_nodes (bb2); in tree_ssa_phiopt()
H A Ddominance.c790 nearest_common_dominator (enum cdi_direction dir, basic_block bb1, basic_block bb2) in nearest_common_dominator() argument
795 return bb2; in nearest_common_dominator()
796 if (!bb2) in nearest_common_dominator()
799 return et_nca (bb1->dom[dir], bb2->dom[dir])->data; in nearest_common_dominator()
899 dominated_by_p (enum cdi_direction dir, basic_block bb1, basic_block bb2) in dominated_by_p() argument
901 struct et_node *n1 = bb1->dom[dir], *n2 = bb2->dom[dir]; in dominated_by_p()
1107 basic_block bb, bb2; in debug_dominance_info() local
1109 if ((bb2 = get_immediate_dominator (dir, bb))) in debug_dominance_info()
1110 fprintf (stderr, "%i %i\n", bb->index, bb2->index); in debug_dominance_info()
H A Dsched-ebb.c206 basic_block bb2 = BLOCK_FOR_INSN (insn2); in rank() local
208 if (bb1->count > bb2->count in rank()
209 || bb1->frequency > bb2->frequency) in rank()
211 if (bb1->count < bb2->count in rank()
212 || bb1->frequency < bb2->frequency) in rank()
H A Dcfghooks.c489 can_merge_blocks_p (basic_block bb1, basic_block bb2) in can_merge_blocks_p() argument
496 ret = cfg_hooks->can_merge_blocks_p (bb1, bb2); in can_merge_blocks_p()
H A Dprofile.c1080 union_groups (basic_block bb1, basic_block bb2) in union_groups() argument
1083 basic_block bb2g = find_group (bb2); in union_groups()
H A Dtree-ssa-loop-niter.c1917 basic_block bb1 = bb_for_stmt (s1), bb2 = bb_for_stmt (s2); in stmt_dominates_stmt_p() local
1923 if (bb1 == bb2) in stmt_dominates_stmt_p()
1934 return dominated_by_p (CDI_DOMINATORS, bb2, bb1); in stmt_dominates_stmt_p()
H A Demit-rtl.c3639 basic_block bb, bb2; in reorder_insns() local
3650 && (bb2 = BLOCK_FOR_INSN (from))) in reorder_insns()
3652 if (BB_END (bb2) == to) in reorder_insns()
3653 BB_END (bb2) = prev; in reorder_insns()
3654 bb2->flags |= BB_DIRTY; in reorder_insns()
H A Dglobal.c2315 rpost_cmp (const void *bb1, const void *bb2) in rpost_cmp() argument
2317 basic_block b1 = *(basic_block *) bb1, b2 = *(basic_block *) bb2; in rpost_cmp()
/openbsd/lib/libc/gdtoa/
H A Dstrtodg.c768 bb2 = bb5 = 0;
772 bb2 = bb5 = -e;
776 bb2 += bbe;
779 bs2 = bb2;
784 bb2 += j;
786 i = bb2 < bd2 ? bb2 : bd2;
790 bb2 -= i;
804 bb2 -= bb0;
805 if (bb2 > 0) {
810 else if (bb2 < 0)
[all …]
H A Dstrtod.c93 int bb2, bb5, bbe, bd2, bd5, bbbits, bs2, c, decpt, dsign, local
590 bb2 = bb5 = 0;
594 bb2 = bb5 = -e;
598 bb2 += bbe;
601 bs2 = bb2;
636 bb2 += j;
641 i = bb2 < bd2 ? bb2 : bd2;
645 bb2 -= i;
659 if (bb2 > 0) {
660 bb = lshift(bb, bb2);
/openbsd/gnu/llvm/llvm/lib/Target/X86/
H A DREADME-X86-64.txt95 LBB1_2: ## bb2
102 jmp LBB1_2 ## bb2
107 JMP mbb<bb2,0x203afb0>
115 bb2: 0x203afb0, LLVM BB @0x1e02340, ID#3:
/openbsd/gnu/llvm/llvm/docs/GlobalISel/
H A DPipeline.rst180 br %bb2
182 bb2:
/openbsd/gnu/llvm/llvm/lib/Target/
H A DREADME.txt956 bb: ; preds = %bb2, %entry
957 %.rle = phi i32 [ 0, %entry ], [ %.rle6, %bb2 ]
958 %i.05 = phi i32 [ 0, %entry ], [ %indvar.next, %bb2 ]
961 br i1 %2, label %bb2, label %bb1
966 br label %bb2
968 bb2: ; preds = %bb, %bb1
1104 bb2: ; preds = %bb1
1109 bb3: ; preds = %bb1, %bb2, %bb
1110 %c_addr.0 = phi %struct.f* [ %g, %bb2 ], [ %c, %bb ], [ %c, %bb1 ]
1111 %b_addr.0 = phi %struct.f* [ %b, %bb2 ], [ %g, %bb ], [ %b, %bb1 ]
[all …]
/openbsd/gnu/llvm/llvm/docs/
H A DBitCodeFormat.rst606 br #n+1, label #(bb1), label #(bb2)
614 br #1, label #(bb1), label #(bb2)
H A DSourceLevelDebugging.rst680 br i1 %cond, label %bb1, label %bb2, !dbg !5
682 bb2: ; preds = %bb1
714 bb.2.bb2:
H A DLangRef.rst8413 indirectbr ptr %Addr, [ label %bb1, label %bb2, label %bb3 ]