Searched refs:bb (Results 1 - 25 of 243) sorted by relevance

12345678910

/freebsd-9.3-release/lib/libc/quad/
H A Dcmpdi2.c51 union uu aa, bb; local
54 bb.q = b;
55 return (aa.sl[H] < bb.sl[H] ? 0 : aa.sl[H] > bb.sl[H] ? 2 :
56 aa.ul[L] < bb.ul[L] ? 0 : aa.ul[L] > bb.ul[L] ? 2 : 1);
H A Ducmpdi2.c50 union uu aa, bb; local
53 bb.uq = b;
54 return (aa.ul[H] < bb.ul[H] ? 0 : aa.ul[H] > bb.ul[H] ? 2 :
55 aa.ul[L] < bb.ul[L] ? 0 : aa.ul[L] > bb.ul[L] ? 2 : 1);
H A Danddi3.c49 union uu aa, bb; local
52 bb.q = b;
53 aa.ul[0] &= bb.ul[0];
54 aa.ul[1] &= bb.ul[1];
H A Diordi3.c49 union uu aa, bb; local
52 bb.q = b;
53 aa.ul[0] |= bb.ul[0];
54 aa.ul[1] |= bb.ul[1];
H A Dxordi3.c49 union uu aa, bb; local
52 bb.q = b;
53 aa.ul[0] ^= bb.ul[0];
54 aa.ul[1] ^= bb.ul[1];
H A Dadddi3.c51 union uu aa, bb, sum; local
54 bb.q = b;
55 sum.ul[L] = aa.ul[L] + bb.ul[L];
56 sum.ul[H] = aa.ul[H] + bb.ul[H] + (sum.ul[L] < bb.ul[L]);
H A Dsubdi3.c50 union uu aa, bb, diff; local
53 bb.q = b;
54 diff.ul[L] = aa.ul[L] - bb.ul[L];
55 diff.ul[H] = aa.ul[H] - bb.ul[H] - (diff.ul[L] > aa.ul[L]);
/freebsd-9.3-release/sys/libkern/
H A Dcmpdi2.c48 union uu aa, bb; local
51 bb.q = b;
52 return (aa.sl[H] < bb.sl[H] ? 0 : aa.sl[H] > bb.sl[H] ? 2 :
53 aa.ul[L] < bb.ul[L] ? 0 : aa.ul[L] > bb.ul[L] ? 2 : 1);
H A Ducmpdi2.c47 union uu aa, bb; local
50 bb.uq = b;
51 return (aa.ul[H] < bb.ul[H] ? 0 : aa.ul[H] > bb.ul[H] ? 2 :
52 aa.ul[L] < bb.ul[L] ? 0 : aa.ul[L] > bb.ul[L] ? 2 : 1);
H A Dmemset.c36 char *bb; local
41 for (bb = (char *)b; len--; )
42 *bb++ = c;
/freebsd-9.3-release/contrib/gcc/
H A Dtracer.c69 #define seen(bb) (bb->il.rtl->visited || bb->aux)
73 ignore_bb_p (basic_block bb) argument
75 if (bb->index < NUM_FIXED_BLOCKS)
77 if (!maybe_hot_bb_p (bb))
85 count_insns (basic_block bb) argument
90 for (insn = BB_HEAD (bb);
91 insn != NEXT_INSN (BB_END (bb));
118 find_best_successor (basic_block bb) argument
137 find_best_predecessor(basic_block bb) argument
158 find_trace(basic_block bb, basic_block *trace) argument
210 basic_block bb; local
243 basic_block bb = fibheap_extract_min (heap); local
326 basic_block bb = end->next_bb; local
[all...]
H A Dtree-cfgcleanup.c72 cleanup_control_expr_graph (basic_block bb, block_stmt_iterator bsi) argument
78 if (!single_succ_p (bb))
105 taken_edge = find_taken_edge (bb, val);
114 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
139 taken_edge = single_succ_edge (bb);
163 basic_block bb; local
172 bb = bb_for_stmt (stmt);
173 if (bb != NULL && last_stmt (bb) != stmt && noreturn_call_p (stmt))
174 split_block (bb, stm
259 tree_forwarder_block_p(basic_block bb, bool phi_wanted) argument
338 has_abnormal_incoming_edge_p(basic_block bb) argument
381 remove_forwarder_block(basic_block bb, basic_block **worklist) argument
516 basic_block bb; local
632 remove_forwarder_block_with_phi(basic_block bb) argument
764 basic_block bb; local
[all...]
H A Dcfghooks.c76 basic_block bb, last_bb_seen; local
83 /* Check bb chain & numbers. */
85 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR->next_bb, NULL, next_bb)
87 if (bb != EXIT_BLOCK_PTR
88 && bb != BASIC_BLOCK (bb->index))
90 error ("bb %d on wrong place", bb->index);
94 if (bb->prev_bb != last_bb_seen)
97 bb
236 dump_bb(basic_block bb, FILE *outf, int indent) argument
319 split_block(basic_block bb, void *i) argument
346 split_block_after_labels(basic_block bb) argument
355 move_block_after(basic_block bb, basic_block after) argument
370 delete_basic_block(basic_block bb) argument
511 predicted_by_p(basic_block bb, enum br_predictor predictor) argument
565 make_forwarder_block(basic_block bb, bool (*redirect_edge_p) (edge), void (*new_bb_cbk) (basic_block)) argument
673 can_duplicate_block_p(basic_block bb) argument
698 duplicate_block(basic_block bb, edge e, basic_block after) argument
771 block_ends_with_call_p(basic_block bb) argument
782 block_ends_with_condjump_p(basic_block bb) argument
[all...]
H A Ddomwalk.c143 walk_dominator_tree (struct dom_walk_data *walk_data, basic_block bb) argument
155 if (EDGE_COUNT (bb->preds) > 0 || bb == ENTRY_BLOCK_PTR)
162 bb->index);
186 walk_data->initialize_block_local_data (walk_data, bb,
194 (*walk_data->before_dom_children_before_stmts) (walk_data, bb);
200 for (bsi = bsi_last (bb); !bsi_end_p (bsi); bsi_prev (&bsi))
201 (*walk_data->before_dom_children_walk_stmts) (walk_data, bb,
204 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
205 (*walk_data->before_dom_children_walk_stmts) (walk_data, bb,
[all...]
H A Dcfglayout.c83 skip_insns_after_block (basic_block bb)
88 if (bb->next_bb != EXIT_BLOCK_PTR)
89 next_head = BB_HEAD (bb->next_bb);
91 for (last_insn = insn = BB_END (bb); (insn = NEXT_INSN (insn)) != 0; )
147 for (insn = last_insn; insn != BB_END (bb); insn = prev)
168 label_for_bb (basic_block bb)
170 rtx label = BB_HEAD (bb);
175 fprintf (dump_file, "Emitting label for block %d\n", bb->index);
177 label = block_label (bb);
190 basic_block bb;
81 skip_insns_after_block(basic_block bb) argument
166 label_for_bb(basic_block bb) argument
188 basic_block bb; local
586 basic_block bb, prev_bb; local
872 basic_block bb = NULL; local
919 cfg_layout_can_duplicate_bb_p(basic_block bb) argument
1031 cfg_layout_duplicate_bb(basic_block bb) argument
1100 basic_block bb; local
1128 basic_block bb; local
1222 basic_block bb, new_bb, dom_bb; local
[all...]
H A Dsched-ebb.c135 basic_block bb;
167 bb = split_edge (e);
168 gcc_assert (NOTE_INSN_BASIC_BLOCK_P (BB_END (bb)));
172 bb = create_basic_block (NEXT_INSN (insn), NULL_RTX, last_bb);
178 current_sched_info->next_tail = NEXT_INSN (BB_END (bb));
181 add_block (bb, last_bb);
182 gcc_assert (last_bb == bb);
307 basic_block bb, earliest_block = NULL;
338 for (bb = last_block; bb; b
133 basic_block bb; local
304 basic_block bb, earliest_block = NULL; local
360 basic_block last_block = NULL, bb; local
543 basic_block bb; local
702 add_block1(basic_block bb, basic_block after) argument
716 advance_target_bb(basic_block bb, rtx insn) argument
768 ebb_head_or_leaf_p(basic_block bb, int leaf_p) argument
[all...]
H A Dcfgbuild.c257 basic_block bb;
271 FOR_BB_BETWEEN (bb, min, max->next_bb, next_bb)
278 if (STATE (bb) == BLOCK_ORIGINAL)
287 FOR_EACH_EDGE (e, ei, bb->succs)
293 if (LABEL_P (BB_HEAD (bb))
294 && LABEL_ALT_ENTRY_P (BB_HEAD (bb)))
295 cached_make_edge (NULL, ENTRY_BLOCK_PTR, bb, 0);
300 insn = BB_END (bb);
310 rtl_make_eh_edge (edge_cache, bb, insn);
329 make_label_edge (edge_cache, bb,
254 basic_block bb; local
518 basic_block bb; local
581 basic_block bb; local
592 purge_dead_tablejump_edges(basic_block bb, rtx table) argument
635 find_bb_boundaries(basic_block bb) argument
753 basic_block bb, min, max; local
[all...]
H A Dcfg.c113 basic_block bb;
117 FOR_EACH_BB (bb)
119 FOR_EACH_EDGE (e, ei, bb->succs)
121 VEC_truncate (edge, bb->succs, 0);
122 VEC_truncate (edge, bb->preds, 0);
139 basic_block bb;
140 bb = ggc_alloc_cleared (sizeof (*bb));
141 return bb;
169 basic_block bb;
110 basic_block bb; local
135 basic_block bb; local
165 basic_block bb; local
415 basic_block bb; local
428 check_bb_profile(basic_block bb, FILE * file) argument
477 dump_bb_info(basic_block bb, bool header, bool footer, int flags, const char *prefix, FILE *file) argument
533 basic_block bb; local
662 alloc_aux_for_block(basic_block bb, int size) argument
690 basic_block bb; local
702 basic_block bb; local
753 basic_block bb; local
771 basic_block bb; local
796 debug_bb(basic_block bb) argument
804 basic_block bb = BASIC_BLOCK (n); local
812 dump_cfg_bb_info(FILE *file, basic_block bb) argument
854 basic_block bb; local
870 update_bb_profile_for_threading(basic_block bb, int edge_frequency, gcov_type count, edge taken_edge) argument
1077 set_bb_original(basic_block bb, basic_block original) argument
1101 get_bb_original(basic_block bb) argument
1119 set_bb_copy(basic_block bb, basic_block copy) argument
1143 get_bb_copy(basic_block bb) argument
[all...]
H A Dpredict.c118 maybe_hot_bb_p (basic_block bb) argument
121 && (bb->count
124 if (bb->frequency < BB_FREQ_MAX / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION))
132 probably_cold_bb_p (basic_block bb) argument
135 && (bb->count
138 if (bb->frequency < BB_FREQ_MAX / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION))
145 probably_never_executed_bb_p (basic_block bb) argument
148 return ((bb->count + profile_info->runs / 2) / profile_info->runs) == 0;
156 rtl_predicted_by_p (basic_block bb, enum br_predictor predictor) argument
159 if (!INSN_P (BB_END (bb)))
172 tree_predicted_by_p(basic_block bb, enum br_predictor predictor) argument
349 dump_prediction(FILE *file, enum br_predictor predictor, int probability, basic_block bb, int used) argument
384 set_even_probabilities(basic_block bb) argument
404 combine_predictions_for_insn(rtx insn, basic_block bb) argument
520 combine_predictions_for_bb(basic_block bb) argument
645 basic_block bb, *bbs; local
789 bb_estimate_probability_locally(basic_block bb) argument
887 guess_outgoing_edge_probabilities(basic_block bb) argument
890 combine_predictions_for_insn (BB_END (bb), bb); local
1001 basic_block bb; local
1028 tree_predict_by_opcode(basic_block bb) argument
1247 basic_block bb; local
1291 basic_block bb; local
1455 last_basic_block_p(basic_block bb) argument
1473 predict_paths_leading_to(basic_block bb, int *heads, enum br_predictor pred, enum prediction taken) argument
1556 basic_block bb; local
1727 basic_block bb; local
1747 basic_block bb; local
1784 basic_block bb; local
1858 basic_block bb; local
[all...]
H A Dcfgrtl.c251 basic_block bb;
254 && (bb = NOTE_BASIC_BLOCK (bb_note)) != NULL
255 && bb->aux == NULL)
276 bb = alloc_block ();
278 init_rtl_bb_info (bb);
296 NOTE_BASIC_BLOCK (bb_note) = bb;
299 /* Always include the bb note in the block. */
303 BB_HEAD (bb) = head;
304 BB_END (bb) = end;
305 bb
248 basic_block bb; local
325 basic_block bb; local
392 basic_block bb; local
461 update_bb_for_insn(basic_block bb) argument
478 rtl_split_block(basic_block bb, void *insnp) argument
1054 basic_block bb = create_basic_block (BB_HEAD (e->dest), NULL, ENTRY_BLOCK_PTR); local
1258 basic_block bb; local
1354 basic_block bb = NULL; local
1499 basic_block bb; local
1544 basic_block bb; local
1587 rtl_dump_bb(basic_block bb, FILE *outf, int indent) argument
1628 basic_block bb; local
1697 update_br_prob_note(basic_block bb) argument
1711 get_last_bb_insn(basic_block bb) argument
1755 basic_block bb; local
1992 basic_block bb; local
2115 purge_dead_edges(basic_block bb) argument
2335 basic_block bb; local
2350 cfg_layout_split_block(basic_block bb, void *insnp) argument
2458 cfg_layout_delete_block(basic_block bb) argument
2699 rtl_block_ends_with_call_p(basic_block bb) argument
2713 rtl_block_ends_with_condjump_p(basic_block bb) argument
2779 basic_block bb = EXIT_BLOCK_PTR->prev_bb; local
2806 basic_block bb = BASIC_BLOCK (i); local
2927 init_rtl_bb_info(basic_block bb) argument
2937 insert_insn_end_bb_new(rtx pat, basic_block bb) argument
[all...]
H A Dlcm.c102 basic_block bb;
119 FOR_EACH_BB_REVERSE (bb)
121 *qin++ = bb;
122 bb->aux = bb;
138 bb = *qout++;
144 if (bb->aux == EXIT_BLOCK_PTR)
148 sbitmap_zero (antout[bb->index]);
153 bb->aux = NULL;
154 sbitmap_intersection_of_succs (antout[bb
101 basic_block bb; local
253 basic_block *worklist, *qin, *qout, *qend, bb; local
357 basic_block bb; local
480 basic_block *worklist, *qin, *qout, *qend, bb; local
609 basic_block *worklist, *tos, bb; local
691 basic_block bb; local
[all...]
H A Dtree-stdarg.h28 basic_block bb; member in struct:stdarg_info
H A Dtree-ssa-math-opts.c108 basic_block bb; member in struct:occurrence
150 occ_new (basic_block bb, struct occurrence *children) argument
154 occ = bb->aux = pool_alloc (occ_pool);
157 occ->bb = bb;
179 basic_block bb = new_occ->bb, occ_bb = occ->bb; local
180 basic_block dom = nearest_common_dominator (CDI_DOMINATORS, occ_bb, bb);
181 if (dom == bb)
231 register_division_in(basic_block bb) argument
258 basic_block bb; local
351 basic_block bb = bb_for_stmt (use_stmt); local
456 basic_block bb; local
[all...]
H A Dprofile.c138 basic_block bb;
140 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
145 FOR_EACH_EDGE (e, ei, bb->succs)
234 basic_block bb;
238 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
243 FOR_EACH_EDGE (e, ei, bb->succs)
267 basic_block bb;
294 /* Attach extra info block to each bb. */
297 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
302 FOR_EACH_EDGE (e, ei, bb
137 basic_block bb; local
232 basic_block bb; local
264 basic_block bb; local
677 output_location(char const *file_name, int line, gcov_position_t *offset, basic_block bb) argument
738 basic_block bb; local
985 &offset, bb); local
997 LOCATION_LINE (curr_location), &offset, bb); local
1062 find_group(basic_block bb) argument
1104 basic_block bb; local
[all...]
/freebsd-9.3-release/sys/gnu/fs/xfs/
H A Dxfs_bmap_btree.h212 #define XFS_BMAP_REC_DADDR(bb,i,cur) \
214 be16_to_cpu((bb)->bb_level), cur), \
215 xfs_bmbt, bb, i, XFS_BMAP_BLOCK_DMAXRECS( \
216 be16_to_cpu((bb)->bb_level), cur)))
217 #define XFS_BMAP_REC_IADDR(bb,i,cur) \
219 be16_to_cpu((bb)->bb_level), cur), \
220 xfs_bmbt, bb, i, XFS_BMAP_BLOCK_IMAXRECS( \
221 be16_to_cpu((bb)->bb_level), cur)))
223 #define XFS_BMAP_KEY_DADDR(bb,i,cur) \
225 be16_to_cpu((bb)
[all...]

Completed in 184 milliseconds

12345678910