/haiku-buildtools/binutils/gas/testsuite/gas/cris/ |
H A D | rd-v10_32o-2.s | 18 beq bb1 20 bb1: label
|
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/cris/ |
H A D | rd-v10_32o-2.s | 18 beq bb1 20 bb1: label
|
/haiku-buildtools/gcc/gcc/ |
H A D | domwalk.c | 147 basic_block bb1 = *(basic_block *)const_cast<void *>(a); local 149 if (bb1->index == bb2->index) 152 if (bb_postorder[bb1->index] > bb_postorder[bb2->index])
|
H A D | tree-ssa-tail-merge.c | 578 basic_block bb1, bb2; local 599 bb1 = BASIC_BLOCK_FOR_FN (cfun, first1); 602 if (BB_SIZE (bb1) != BB_SIZE (bb2)) 605 gsi1 = gsi_start_nondebug_bb (bb1); 1071 set_cluster (basic_block bb1, basic_block bb2) argument 1076 if (BB_CLUSTER (bb1) == NULL && BB_CLUSTER (bb2) == NULL) 1079 add_bb_to_cluster (c, bb1); 1081 BB_CLUSTER (bb1) = c; 1086 else if (BB_CLUSTER (bb1) == NULL || BB_CLUSTER (bb2) == NULL) 1088 merge_bb = BB_CLUSTER (bb1) 1138 basic_block bb1 = gimple_bb (s1), bb2 = gimple_bb (s2); local 1254 find_duplicate(same_succ same_succ, basic_block bb1, basic_block bb2) argument 1336 same_phi_alternatives(same_succ same_succ, basic_block bb1, basic_block bb2) argument 1406 deps_ok_for_redirect(basic_block bb1, basic_block bb2) argument 1423 basic_block bb1, bb2; local 1508 replace_block_by(basic_block bb1, basic_block bb2) argument 1584 basic_block bb1, bb2; local [all...] |
H A D | cfgcleanup.c | 1290 walk_to_nondebug_insn (rtx_insn **i1, basic_block *bb1, bool follow_fallthru, 1300 if (*i1 != BB_HEAD (*bb1)) 1309 fallthru = find_fallthru_edge ((*bb1)->preds); 1314 *bb1 = fallthru->src; 1315 *i1 = BB_END (*bb1); 1333 flow_find_cross_jump (basic_block bb1, basic_block bb2, rtx_insn **f1, 1351 i1 = BB_END (bb1); 1391 walk_to_nondebug_insn (&i1, &bb1, follow_fallthru, &did_fallthru); 1400 if (i1 == BB_HEAD (bb1) || i2 == BB_HEAD (bb2)) 1438 bb1 1283 walk_to_nondebug_insn(rtx_insn **i1, basic_block *bb1, bool follow_fallthru, bool *did_fallthru) argument 1326 flow_find_cross_jump(basic_block bb1, basic_block bb2, rtx_insn **f1, rtx_insn **f2, enum replace_direction *dir_p) argument 1461 flow_find_head_matching_sequence(basic_block bb1, basic_block bb2, rtx_insn **f1, rtx_insn **f2, int stop_after) argument 1565 outgoing_edges_match(int mode, basic_block bb1, basic_block bb2) argument [all...] |
H A D | tree-ssa-phiopt.c | 113 if (cond) goto bb2; else goto bb1; 114 bb1: 121 if (cond) goto bb1; else goto bb2; 122 bb1: 132 if (cond) goto bb2; else goto bb1; 133 bb1: 143 if (cond) goto bb3; else goto bb1; 144 bb1: 224 basic_block bb1, bb2; local 237 bb1 1905 hoist_adjacent_loads(basic_block bb0, basic_block bb1, basic_block bb2, basic_block bb3) argument [all...] |
H A D | auto-profile.c | 1138 basic_block bb1; local 1145 FOR_EACH_VEC_ELT (dom_bbs, i, bb1) 1146 if (bb1->aux == NULL && dominated_by_p (CDI_POST_DOMINATORS, bb, bb1) 1147 && bb1->loop_father == bb->loop_father) 1149 bb1->aux = bb; 1150 if (bb1->count > bb->count && is_bb_annotated (bb1, *annotated_bb)) 1152 bb->count = bb1->count; 1157 FOR_EACH_VEC_ELT (dom_bbs, i, bb1) [all...] |
H A D | sched-ebb.c | 251 basic_block bb1 = BLOCK_FOR_INSN (insn1); 254 if (bb1->count > bb2->count 255 || bb1->frequency > bb2->frequency) 257 if (bb1->count < bb2->count 258 || bb1->frequency < bb2->frequency) 249 basic_block bb1 = BLOCK_FOR_INSN (insn1); local
|
H A D | ipa-icf-gimple.h | 154 bool compare_bb (sem_bb *bb1, sem_bb *bb2);
|
H A D | tree-switch-conversion.c | 1233 bb1 is the bb to be used when the range check went ok. It is derived from 1240 bbF is a fall through for both bb1 and bb2 and contains exactly what 1261 basic_block bb0, bb1, bb2, bbf, bbd; 1300 bb1 = e21->dest; 1303 e1d = split_block (bb1, info->arr_ref_last); 1308 e01 = make_edge (bb0, bb1, EDGE_TRUE_VALUE); 1320 e1f = make_edge (bb1, bbf, EDGE_FALLTHRU); 1329 bb1->frequency = EDGE_FREQUENCY (e01); 1344 set_immediate_dominator (CDI_DOMINATORS, bb1, bb0); 1352 bbs_to_fix_dom.quick_push (bb1); 1258 basic_block bb0, bb1, bb2, bbf, bbd; local [all...] |
H A D | profile.c | 1380 basic_block group = bb, bb1; 1388 bb1 = (basic_block) bb->aux; 1390 bb = bb1; 1396 union_groups (basic_block bb1, basic_block bb2) 1398 basic_block bb1g = find_group (bb1); 1378 basic_block group = bb, bb1; local 1394 union_groups(basic_block bb1, basic_block bb2) argument
|
H A D | dominance.c | 880 nearest_common_dominator (enum cdi_direction dir, basic_block bb1, basic_block bb2) argument 886 if (!bb1) 889 return bb1; 891 return (basic_block) et_nca (bb1->dom[dir_index], bb2->dom[dir_index])->data; 991 dominated_by_p (enum cdi_direction dir, const_basic_block bb1, const_basic_block bb2) argument 994 struct et_node *n1 = bb1->dom[dir_index], *n2 = bb2->dom[dir_index];
|
H A D | regrename.c | 711 basic_block bb1 = BASIC_BLOCK_FOR_FN (cfun, inverse_postorder[i]); local 718 this_info = (struct bb_rename_info *) bb1->aux; 723 fprintf (dump_file, "\nprocessing block %d:\n", bb1->index); 725 init_rename_info (this_info, bb1); 727 success = build_def_use (bb1); 732 bb1->aux = NULL; 740 FOR_BB_INSNS (bb1, insn) 756 FOR_EACH_EDGE (e, ei, bb1->succs)
|
H A D | ipa-icf-gimple.c | 398 int *bb1 = m_label_bb_map.get (t1); local 401 return return_with_debug (*bb1 == *bb2); 661 func_checker::compare_bb (sem_bb *bb1, sem_bb *bb2) argument 666 gsi1 = gsi_start_bb_nondebug (bb1->bb);
|
H A D | tree-ssa-ifcombine.c | 176 same_phi_args_p (basic_block bb1, basic_block bb2, basic_block dest) argument 178 edge e1 = find_edge (bb1, dest);
|
H A D | ipa-icf.h | 350 bool compare_phi_node (basic_block bb1, basic_block bb2);
|
H A D | gimple-ssa-strength-reduction.c | 2958 ncd_for_two_cands (basic_block bb1, basic_block bb2, 2963 if (!bb1) 2972 return bb1; 2975 ncd = nearest_common_dominator (CDI_DOMINATORS, bb1, bb2); 2979 if (bb1 == ncd && bb2 == ncd) 2989 else if (bb1 == ncd) 2949 ncd_for_two_cands(basic_block bb1, basic_block bb2, slsr_cand_t c1, slsr_cand_t c2, slsr_cand_t *where) argument
|
H A D | ipa-icf.c | 735 basic_block bb1, bb2; 829 bb1 = bb_sorted[i]->bb; 834 for (ei1 = ei_start (bb1->preds); ei_cond (ei1, &e1); ei_next (&ei1)) 1547 sem_function::compare_phi_node (basic_block bb1, basic_block bb2) argument 1555 gcc_assert (bb1 != NULL); 1559 for (si1 = gsi_start_phis (bb1); !gsi_end_p (si1);
|
H A D | tree-parloops.c | 1285 bb1: 1310 basic_block bb1 = split_edge (entry); local 1311 basic_block bb0 = single_pred (bb1); 1320 basic_block entry_bb = bb1; 1408 ld_st_data->load_bb = bb1;
|
H A D | cfghooks.c | 728 can_merge_blocks_p (basic_block bb1, basic_block bb2) argument 735 ret = cfg_hooks->can_merge_blocks_p (bb1, bb2);
|
H A D | graphite-sese-to-poly.c | 395 const_basic_block const bb1 = *(const_basic_block const*)p1; local 397 int d1 = loop_depth (bb1->loop_father); 2614 basic_block bb1 = gimple_bb (DR_STMT (dr)); local 2616 if (bb1 != bb) 2618 gimple_bb_p gbb1 = gbb_from_bb (bb1);
|
H A D | sel-sched.c | 2843 basic_block bb1 = BLOCK_FOR_INSN (succ); 2845 gcc_assert (BB_LV_SET_VALID_P (bb0) && BB_LV_SET_VALID_P (bb1)); 2848 BB_LV_SET (bb1), 7045 basic_block bb1 = bb; 7051 bitmap_set_bit (scheduled_blocks, BLOCK_TO_BB (bb1->index)); 7054 sel_print ("%d; ", bb1->index); 7056 while (!bb_ends_ebb_p (bb1) && (bb1 = bb_next_bb (bb1))); 7061 get_ebb_head_tail (bb, bb1, 2834 basic_block bb1 = BLOCK_FOR_INSN (succ); local 7032 basic_block bb1 = bb; local [all...] |
/haiku-buildtools/gcc/gmp/mpn/m88k/mc88110/ |
H A D | add_n.S | 36 bb1 2,r12,L1 49 bb1 lt,r12,Lend2 117 bb1 2,r12,L2 131 bb1 eq,r12,Ljone
|
H A D | sub_n.S | 36 bb1 2,r12,L1 49 bb1 lt,r12,Lend2 118 bb1 2,r12,L2 131 bb1 lt,r12,Lend2 206 bb1 eq,r12,Ljone
|
/haiku-buildtools/gcc/gcc/config/sh/ |
H A D | sh_treg_combine.cc | 363 basic_block bb1[] = { b, a }; local 368 if (ei_edge (ei)->dest == bb1[i])
|