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

1234567891011>>

/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Dregcprop.h23 extern void copyprop_hardreg_forward_bb_without_debug_insn (basic_block bb);
H A Dtracer.h23 extern basic_block transform_duplicate (basic_block bb, basic_block bb2);
24 extern bool ignore_bb_p (const_basic_block bb);
H A Dtracer.c71 mark_bb_seen (basic_block bb) argument
75 if ((unsigned int)bb->index >= size)
78 bitmap_set_bit (bb_seen, bb->index);
82 bb_seen_p (basic_block bb) argument
84 return bitmap_bit_p (bb_seen, bb->index);
89 ignore_bb_p (const_basic_block bb) argument
91 if (bb->index < NUM_FIXED_BLOCKS)
93 if (optimize_bb_for_size_p (bb))
96 if (gimple *g = last_stmt (CONST_CAST_BB (bb)))
117 count_insns (basic_block bb) argument
147 find_best_successor(basic_block bb) argument
171 find_best_predecessor(basic_block bb) argument
197 find_trace(basic_block bb, basic_block *trace) argument
238 transform_duplicate(basic_block bb, basic_block bb2) argument
269 basic_block bb; local
308 basic_block bb = heap.extract_min (); local
[all...]
H A Dgimple-ssa-split-paths.c53 basic_block bb = get_immediate_dominator (CDI_DOMINATORS, latch); local
54 gcc_assert (single_pred_edge (latch)->src == bb);
58 if (ignore_bb_p (bb))
61 gimple *last = gsi_stmt (gsi_last_nondebug_bb (bb));
72 if (EDGE_COUNT (bb->preds) == 2
73 && !(EDGE_PRED (bb, 0)->flags & EDGE_COMPLEX)
74 && !(EDGE_PRED (bb, 1)->flags & EDGE_COMPLEX)
75 && EDGE_COUNT (bb->succs) == 2
76 && !(EDGE_SUCC (bb, 0)->flags & EDGE_COMPLEX)
77 && !(EDGE_SUCC (bb,
116 count_stmts_in_block(basic_block bb) argument
159 is_feasible_trace(basic_block bb) argument
451 basic_block bb local
[all...]
H A Domp-expand.h29 extern bool omp_make_gimple_edges (basic_block bb, struct omp_region **region,
H A Dshrink-wrap.c40 #include "bb-reorder.h"
101 [REGNO, END_REGNO). Return the live edge if its dest bb has
105 live_edge_for_reg (basic_block bb, int regno, int end_regno) argument
113 FOR_EACH_EDGE (e, ei, bb->succs)
152 move_insn_for_shrink_wrap (basic_block bb, rtx_insn *insn, argument
273 live_edge = live_edge_for_reg (bb, dregno, end_dregno);
282 if (EDGE_COUNT (bb->succs) == 1)
296 bitmap_and (df_get_live_in (next_block), df_get_live_out (bb),
313 FOR_BB_INSNS_REVERSE (bb, dinsn)
325 live_out = df_get_live_out (bb);
516 can_dup_for_shrink_wrapping(basic_block bb, basic_block pro, unsigned max_size) argument
726 basic_block bb; local
792 basic_block bb = vec.pop (); local
859 basic_block bb = vec.pop (); local
1104 SW(basic_block bb) argument
1115 basic_block bb; local
1147 basic_block bb; local
1169 basic_block bb = head; local
1287 basic_block bb; local
1425 basic_block bb; local
1499 basic_block bb; local
1584 basic_block bb; local
1689 basic_block bb; local
[all...]
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dregcprop.h23 extern void copyprop_hardreg_forward_bb_without_debug_insn (basic_block bb);
H A Dtracer.h23 extern basic_block transform_duplicate (basic_block bb, basic_block bb2);
24 extern bool ignore_bb_p (const_basic_block bb);
H A Dtracer.cc71 mark_bb_seen (basic_block bb) argument
75 if ((unsigned int)bb->index >= size)
78 bitmap_set_bit (bb_seen, bb->index);
82 bb_seen_p (basic_block bb) argument
84 return bitmap_bit_p (bb_seen, bb->index);
91 cache_can_duplicate_bb_p (const_basic_block bb, bool val) argument
94 bitmap_set_bit (can_duplicate_bb, bb->index);
99 cached_can_duplicate_bb_p (const_basic_block bb) argument
104 if ((unsigned int)bb->index < size)
105 return bitmap_bit_p (can_duplicate_bb, bb
116 ignore_bb_p(const_basic_block bb) argument
129 analyze_bb(basic_block bb, int *count) argument
161 find_best_successor(basic_block bb) argument
185 find_best_predecessor(basic_block bb) argument
211 find_trace(basic_block bb, basic_block *trace) argument
252 transform_duplicate(basic_block bb, basic_block bb2) argument
283 basic_block bb; local
325 basic_block bb = heap.extract_min (); local
[all...]
H A Dgimple-ssa-split-paths.cc54 basic_block bb = get_immediate_dominator (CDI_DOMINATORS, latch); local
55 gcc_assert (single_pred_edge (latch)->src == bb); local
59 if (ignore_bb_p (bb))
62 gimple *last = gsi_stmt (gsi_last_nondebug_bb (bb));
73 if (EDGE_COUNT (bb->preds) == 2
74 && !(EDGE_PRED (bb, 0)->flags & EDGE_COMPLEX)
75 && !(EDGE_PRED (bb, 1)->flags & EDGE_COMPLEX)
76 && EDGE_COUNT (bb->succs) == 2
77 && !(EDGE_SUCC (bb, 0)->flags & EDGE_COMPLEX)
78 && !(EDGE_SUCC (bb,
117 count_stmts_in_block(basic_block bb) argument
160 is_feasible_trace(basic_block bb) argument
489 basic_block bb local
[all...]
H A Domp-expand.h29 extern bool omp_make_gimple_edges (basic_block bb, struct omp_region **region,
/netbsd-current/external/lgpl3/mpc/dist/src/
H A Dui_div.c28 mpc_t bb; local
30 mpc_init2 (bb, sizeof(unsigned long int) * CHAR_BIT);
31 mpc_set_ui (bb, b, rnd); /* exact */
32 inex = mpc_div (a, bb, c, rnd);
33 mpc_clear (bb);
/netbsd-current/common/lib/libc/quad/
H A Danddi3.c53 union uu aa, bb; local
56 bb.q = b;
57 aa.ul[0] &= bb.ul[0];
58 aa.ul[1] &= bb.ul[1];
H A Diordi3.c53 union uu aa, bb; local
56 bb.q = b;
57 aa.ul[0] |= bb.ul[0];
58 aa.ul[1] |= bb.ul[1];
H A Dxordi3.c53 union uu aa, bb; local
56 bb.q = b;
57 aa.ul[0] ^= bb.ul[0];
58 aa.ul[1] ^= bb.ul[1];
H A Dcmpdi2.c55 union uu aa, bb; local
58 bb.q = b;
59 return (aa.sl[H] < bb.sl[H] ? 0 : aa.sl[H] > bb.sl[H] ? 2 :
60 aa.ul[L] < bb.ul[L] ? 0 : aa.ul[L] > bb.ul[L] ? 2 : 1);
H A Ducmpdi2.c54 union uu aa, bb; local
57 bb.uq = b;
58 return (aa.ul[H] < bb.ul[H] ? 0 : aa.ul[H] > bb.ul[H] ? 2 :
59 aa.ul[L] < bb.ul[L] ? 0 : aa.ul[L] > bb.ul[L] ? 2 : 1);
H A Dadddi3.c55 union uu aa, bb, sum; local
58 bb.q = b;
59 sum.ul[L] = aa.ul[L] + bb.ul[L];
60 sum.ul[H] = aa.ul[H] + bb.ul[H] + (sum.ul[L] < bb.ul[L]);
H A Dsubdi3.c54 union uu aa, bb, diff; local
57 bb.q = b;
58 diff.ul[L] = aa.ul[L] - bb.ul[L];
59 diff.ul[H] = aa.ul[H] - bb.ul[H] - (diff.ul[L] > aa.ul[L]);
/netbsd-current/common/lib/libc/arch/arm/quad/
H A D__aeabi_lcmp.c42 const union uu aa = { .q = a }, bb = { .q = b }; local
44 if (aa.sl[H] < bb.sl[H])
46 if (aa.sl[H] > bb.sl[H])
49 if (aa.sl[L] < bb.sl[L])
51 if (aa.sl[L] > bb.sl[L])
H A D__aeabi_ulcmp.c42 const union uu aa = { .uq = a }, bb = { .uq = b }; local
44 if (aa.ul[H] < bb.ul[H])
46 if (aa.ul[H] > bb.ul[H])
49 if (aa.ul[L] < bb.ul[L])
51 if (aa.ul[L] > bb.ul[L])
/netbsd-current/external/lgpl3/gmp/dist/mpz/
H A Dui_pow_ui.c40 mp_limb_t bb[2]; local
41 bb[0] = b & GMP_NUMB_MASK;
42 bb[1] = b >> GMP_NUMB_BITS;
43 mpz_n_pow_ui (r, bb, (mp_size_t) 2, e);
/netbsd-current/usr.sbin/installboot/arch/
H A Dalpha.c115 static void resum(ib_params *, struct alpha_boot_block * const bb,
136 struct alpha_boot_block bb; local
150 rv = pread(params->fsfd, &bb, sizeof(bb), ALPHA_BOOT_BLOCK_OFFSET);
154 } else if (rv != sizeof(bb)) {
158 ALPHA_BOOT_BLOCK_CKSUM(&bb, &cksum);
159 if (cksum != bb.bb_cksum) { // XXX check bb_cksum endian?
162 (unsigned long long)le64toh(bb.bb_cksum),
170 (unsigned long long)le64toh(bb.bb_secstart));
172 (unsigned long long)le64toh(bb
211 struct alpha_boot_block bb; local
366 resum(ib_params *params, struct alpha_boot_block * const bb, uint16_t *bb16) argument
382 sun_bootstrap(ib_params *params, struct alpha_boot_block * const bb) argument
445 check_sparc(const struct alpha_boot_block * const bb, const char *when) argument
[all...]
/netbsd-current/external/gpl3/gdb.old/dist/gas/testsuite/gas/crx/
H A Djscond_insn.d55 1e: 01 bb seq r1
58 20: 12 bb sne r2
61 22: 23 bb scs r3
64 24: 34 bb scc r4
67 26: 45 bb shi r5
70 28: 56 bb sls r6
73 2a: 67 bb sgt r7
76 2c: 78 bb sle r8
79 2e: 89 bb sfs r9
82 30: 9a bb sf
[all...]
/netbsd-current/external/gpl3/gdb.old/dist/ld/testsuite/ld-elf/
H A Ddl5.cc46 A *bb = new A[10]; local
47 delete [] bb;
48 bb = new (std::nothrow) A [10];
49 delete [] bb;

Completed in 302 milliseconds

1234567891011>>