Searched refs:bb2 (Results 1 - 13 of 13) sorted by relevance

/freebsd-9.3-release/contrib/gcc/
H A Dtracer.c168 basic_block bb2 = e->src; local
169 if (seen (bb2) || (e->flags & (EDGE_DFS_BACK | EDGE_COMPLEX))
170 || find_best_successor (bb2) != e)
174 bb = bb2;
267 basic_block bb2 = trace[pos]; local
269 if (blocks[bb2->index])
271 fibheap_delete_node (heap, blocks[bb2->index]);
272 blocks[bb2->index] = NULL;
274 traced_insns += bb2->frequency * counts [bb2
[all...]
H A Dcfgcleanup.c1066 basic_block bb2, rtx *f1, rtx *f2)
1083 i2 = BB_END (bb2);
1100 while (!INSN_P (i2) && i2 != BB_HEAD (bb2))
1103 if (i1 == BB_HEAD (bb1) || i2 == BB_HEAD (bb2))
1157 while (last2 != BB_HEAD (bb2) && !INSN_P (PREV_INSN (last2)))
1160 if (last2 != BB_HEAD (bb2) && LABEL_P (PREV_INSN (last2)))
1175 basic_block bb2 = info->y_block;
1177 edge b2 = BRANCH_EDGE (bb2);
1179 edge f2 = FALLTHRU_EDGE (bb2);
1210 set2 = pc_set (BB_END (bb2));
1058 flow_find_cross_jump(int mode ATTRIBUTE_UNUSED, basic_block bb1, basic_block bb2, rtx *f1, rtx *f2) argument
1168 basic_block bb2 = info->y_block; local
1298 outgoing_edges_match(int mode, basic_block bb1, basic_block bb2) argument
[all...]
H A Dvalue-prof.c186 basic_block bb, bb2, bb3, bb4; local
226 /* Edge e23 connects bb2 to bb3, etc. */
228 bb2 = e12->dest;
229 bb2->count = count;
230 e23 = split_block (bb2, bb2end);
248 e24 = make_edge (bb2, bb4, EDGE_FALLTHRU);
349 basic_block bb, bb2, bb3, bb4; local
393 /* Edge e23 connects bb2 to bb3, etc. */
395 bb2 = e12->dest;
396 bb2
513 basic_block bb, bb2, bb3, bb4; local
[all...]
H A Dtree-ssa-phiopt.c61 if (cond) goto bb2; else goto bb1;
63 bb2:
70 goto bb2;
71 bb2:
83 if (a != b) goto bb2; else goto bb1;
85 bb2:
91 bb2:
103 if (a >= 0) goto bb2; else goto bb1;
106 bb2:
113 bb2
158 basic_block bb1, bb2; local
[all...]
H A Dsched-ebb.c208 basic_block bb2 = BLOCK_FOR_INSN (insn2);
210 if (bb1->count > bb2->count
211 || bb1->frequency > bb2->frequency)
213 if (bb1->count < bb2->count
214 || bb1->frequency < bb2->frequency)
206 basic_block bb2 = BLOCK_FOR_INSN (insn2); local
H A Ddominance.c790 nearest_common_dominator (enum cdi_direction dir, basic_block bb1, basic_block bb2) argument
795 return bb2;
796 if (!bb2)
799 return et_nca (bb1->dom[dir], bb2->dom[dir])->data;
899 dominated_by_p (enum cdi_direction dir, basic_block bb1, basic_block bb2) argument
901 struct et_node *n1 = bb1->dom[dir], *n2 = bb2->dom[dir];
1107 basic_block bb, bb2; local
1109 if ((bb2 = get_immediate_dominator (dir, bb)))
1110 fprintf (stderr, "%i %i\n", bb->index, bb2->index);
H A Dcfghooks.c489 can_merge_blocks_p (basic_block bb1, basic_block bb2) argument
496 ret = cfg_hooks->can_merge_blocks_p (bb1, bb2);
H A Dprofile.c1084 union_groups (basic_block bb1, basic_block bb2)
1087 basic_block bb2g = find_group (bb2);
1080 union_groups(basic_block bb1, basic_block bb2) argument
H A Dtree-ssa-loop-niter.c1917 basic_block bb1 = bb_for_stmt (s1), bb2 = bb_for_stmt (s2); local
1923 if (bb1 == bb2)
1934 return dominated_by_p (CDI_DOMINATORS, bb2, bb1);
H A Demit-rtl.c3659 basic_block bb, bb2;
3670 && (bb2 = BLOCK_FOR_INSN (from)))
3672 if (BB_END (bb2) == to)
3673 BB_END (bb2) = prev;
3674 bb2->flags |= BB_DIRTY;
3641 basic_block bb, bb2; local
H A Dglobal.c2330 rpost_cmp (const void *bb1, const void *bb2)
2332 basic_block b1 = *(basic_block *) bb1, b2 = *(basic_block *) bb2;
2315 rpost_cmp(const void *bb1, const void *bb2) argument
/freebsd-9.3-release/contrib/gdtoa/
H A Dstrtodg.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
[all...]
H A Dstrtod.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 >
[all...]

Completed in 117 milliseconds