Home
last modified time | relevance | path

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

/trueos/contrib/gcc/
HDtracer.c168 basic_block bb2 = e->src; in find_trace() local
169 if (seen (bb2) || (e->flags & (EDGE_DFS_BACK | EDGE_COMPLEX)) in find_trace()
170 || find_best_successor (bb2) != e) in find_trace()
174 bb = bb2; in find_trace()
267 basic_block bb2 = trace[pos]; in tail_duplicate() local
269 if (blocks[bb2->index]) in tail_duplicate()
271 fibheap_delete_node (heap, blocks[bb2->index]); in tail_duplicate()
272 blocks[bb2->index] = NULL; in tail_duplicate()
274 traced_insns += bb2->frequency * counts [bb2->index]; in tail_duplicate()
275 if (EDGE_COUNT (bb2->preds) > 1 in tail_duplicate()
[all …]
HDcfgcleanup.c1059 basic_block bb2, rtx *f1, rtx *f2) in flow_find_cross_jump() argument
1076 i2 = BB_END (bb2); in flow_find_cross_jump()
1093 while (!INSN_P (i2) && i2 != BB_HEAD (bb2)) in flow_find_cross_jump()
1096 if (i1 == BB_HEAD (bb1) || i2 == BB_HEAD (bb2)) in flow_find_cross_jump()
1150 while (last2 != BB_HEAD (bb2) && !INSN_P (PREV_INSN (last2))) in flow_find_cross_jump()
1153 if (last2 != BB_HEAD (bb2) && LABEL_P (PREV_INSN (last2))) in flow_find_cross_jump()
1168 basic_block bb2 = info->y_block; in condjump_equiv_p() local
1170 edge b2 = BRANCH_EDGE (bb2); in condjump_equiv_p()
1172 edge f2 = FALLTHRU_EDGE (bb2); in condjump_equiv_p()
1203 set2 = pc_set (BB_END (bb2)); in condjump_equiv_p()
[all …]
HDvalue-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()
248 e24 = make_edge (bb2, bb4, EDGE_FALLTHRU); 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()
415 e24 = make_edge (bb2, bb4, EDGE_FALLTHRU); in tree_mod_pow2()
[all …]
HDtree-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()
HDdominance.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()
HDsched-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()
HDcfghooks.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()
HDprofile.c1080 union_groups (basic_block bb1, basic_block bb2) in union_groups() argument
1083 basic_block bb2g = find_group (bb2); in union_groups()
HDtree-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()
HDemit-rtl.c3641 basic_block bb, bb2; in reorder_insns() local
3652 && (bb2 = BLOCK_FOR_INSN (from))) in reorder_insns()
3654 if (BB_END (bb2) == to) in reorder_insns()
3655 BB_END (bb2) = prev; in reorder_insns()
3656 bb2->flags |= BB_DIRTY; in reorder_insns()
HDglobal.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()
/trueos/contrib/apr-util/test/
HDtestbuckets.c143 apr_bucket_brigade *bb, *bb2; in test_split() local
150 bb2 = apr_brigade_split(bb, e); in test_split()
153 count_buckets(bb2) == 1); in test_split()
158 flatten_match(tc, "match split brigade", bb2, "world"); in test_split()
160 apr_brigade_destroy(bb2); in test_split()
476 apr_bucket_brigade *bb2; in test_write_split() local
482 bb2 = apr_brigade_split(bb1, APR_BRIGADE_LAST(bb1)); in test_write_split()
484 test_bucket_content(tc, APR_BRIGADE_FIRST(bb2), "world", 5); in test_write_split()
487 apr_brigade_destroy(bb2); in test_write_split()
/trueos/contrib/gdtoa/
HDstrtodg.c325 int bb0, bb2, bb5, bbe, bd2, bd5, bbbits, bs2, c, decpt, denorm; local
724 bb2 = bb5 = 0;
728 bb2 = bb5 = -e;
732 bb2 += bbe;
735 bs2 = bb2;
740 bb2 += j;
742 i = bb2 < bd2 ? bb2 : bd2;
746 bb2 -= i;
756 bb2 -= bb0;
757 if (bb2 > 0)
[all …]
HDstrtod.c95 int bb2, bb5, bbe, bd2, bd5, bbbits, bs2, c, decpt, dsign, local
586 bb2 = bb5 = 0;
590 bb2 = bb5 = -e;
594 bb2 += bbe;
597 bs2 = bb2;
632 bb2 += j;
637 i = bb2 < bd2 ? bb2 : bd2;
641 bb2 -= i;
651 if (bb2 > 0)
652 bb = lshift(bb, bb2);
/trueos/sys/contrib/dev/ath/ath_hal/ar9300/
HDar9340.ini394 { 0x00016144 , 0x01884080 }, //bb2