/haiku-buildtools/gcc/gmp/mpn/x86/pentium4/sse2/ |
H A D | add_n.asm | 33 C for a basic adc loop.
|
/haiku-buildtools/legacy/gcc/gcc/ |
H A D | make-l2.com | 55 $loop: 62 $if flnm.eqs."" then goto loop 63 $if flnm.eqs." " then goto loop
|
/haiku-buildtools/gcc/libgcc/config/microblaze/ |
H A D | moddi3.S | 43 swi r28,r1,12 # used for loop count 65 ADDIK r28,r0,64 # Initialize the loop count
|
/haiku-buildtools/gcc/gmp/mpn/pa32/hppa1_1/pa7100/ |
H A D | submul_1.asm | 104 C main loop ------------------------------------------------------------------ 105 LDEF(loop) 147 addib,>= -4,size_param,L(loop)
|
/haiku-buildtools/gcc/gmp/mpn/pa64/ |
H A D | aorslsh1_n.asm | 30 C * Explicitly align loop. 131 LDEF(loop) 179 addib,> -8, n, L(loop)
|
H A D | udiv.asm | 63 ldi 8,%r31 C setup loop counter
|
/haiku-buildtools/gcc/gmp/mpn/x86/k6/mmx/ |
H A D | logops_n.asm | 101 C able to get 1.0 with just a 4 limb loop, being 3 instructions per 2 limbs. 103 C because there's nowhere to hide some loop control. 198 loop L(top)
|
/haiku-buildtools/gcc/gmp/mpn/x86/k7/ |
H A D | aors_n.asm | 23 C K7: 1.64 cycles/limb (at 16 limbs/loop). 70 dnl Must have UNROLL_THRESHOLD >= 2, since the unrolled loop can't handle 1. 122 C This loop in in a single 16 byte code block already, so no
|
/haiku-buildtools/gcc/gmp/mpn/x86/ |
H A D | mul_basecase.asm | 42 C of the Louter loop, for the four different outcomes of un mod 4. That 47 C The mul loop (at L(oopM)) might need some tweaking. It's current speed is 186 C we incremented wp and xp in the loop above; compensate
|
/haiku-buildtools/gcc/gcc/ |
H A D | ira-int.h | 76 following structure describes loop tree node (representing basic 77 block or loop). We need such tree because the loop tree from 85 basic_block bb; /* NULL for loop. */ 86 /* NULL for BB or for loop tree root if we did not build CFG loop tree. */ 87 struct loop *loop; member in struct:ira_loop_tree_node 88 /* NEXT/SUBLOOP_NEXT is the next node/loop-node of the same parent. 91 /* CHILDREN/SUBLOOPS is the first node/loop [all...] |
H A D | tree-ssa-dce.c | 83 #include "tree-ssa-loop-niter.h" 434 struct loop *loop; local 445 fprintf (dump_file, "Marking back edge of irreducible loop %i->%i\n", 451 FOR_EACH_LOOP (loop, 0) 452 if (!finite_loop_p (loop)) 455 fprintf (dump_file, "can not prove finiteness of loop %i\n", loop->num); 456 mark_control_dependent_edges_necessary (loop->latch, false); 716 the loop [all...] |
H A D | tree-ssa-live.c | 947 struct loop *loop; local 948 FOR_EACH_LOOP (loop, 0) 949 if (loop->simduid && !is_used_p (loop->simduid)) 950 loop->simduid = NULL_TREE;
|
H A D | lto-streamer-out.c | 1895 /* Output each loop, skipping the tree root which has number zero. */ 1898 struct loop *loop = get_loop (fn, i); local 1900 /* Write the index of the loop header. That's enough to rebuild 1901 the loop tree on the reader side. Stream -1 for an unused 1902 loop entry. */ 1903 if (!loop) 1909 streamer_write_hwi (ob, loop->header->index); 1913 loop_estimation, EST_LAST, loop->estimate_state); 1914 streamer_write_hwi (ob, loop [all...] |
H A D | tree-ssa-threadedge.c | 64 #include "tree-ssa-loop.h" 114 not optimized away because they forward from outside a loop 115 to the loop header. We want to thread through them as we can 116 sometimes thread to the loop exit, which is obviously profitable. 421 feeds a conditional inside a loop. We might derive an equivalence 477 allow us to simplify the condition at the end of the loop. 688 (consider threading the backedge of a loop where we have 689 a loop invariant SSA_NAME used in the condition. */ 978 VISITED_BBS is used to make sure we don't fall into an infinite loop. Bound 984 hash_set<basic_block> *visited_bbs, loop_p loop) 982 fsm_find_thread_path(basic_block start_bb, basic_block end_bb, vec<basic_block, va_gc> *&path, hash_set<basic_block> *visited_bbs, loop_p loop) argument 1152 loop_p loop = (*path)[0]->loop_father; local [all...] |
/haiku-buildtools/gcc/gcc/fortran/ |
H A D | parse.c | 630 match ("end kernels loop", gfc_match_omp_eos, ST_OACC_END_KERNELS_LOOP); 632 match ("end loop", gfc_match_omp_eos, ST_OACC_END_LOOP); 633 match ("end parallel loop", gfc_match_omp_eos, ST_OACC_END_PARALLEL_LOOP); 642 match ("parallel loop", gfc_match_oacc_parallel_loop, ST_OACC_PARALLEL_LOOP); 646 match ("kernels loop", gfc_match_oacc_kernels_loop, ST_OACC_KERNELS_LOOP); 650 match ("loop", gfc_match_oacc_loop, ST_OACC_LOOP); 2205 (where EXEC_NOP is added inside the loop) for two 2208 it, the loop counter must be increased. 2971 loop: 2996 goto loop; [all...] |
/haiku-buildtools/gcc/gmp/mpn/alpha/ev6/ |
H A D | add_n.asm | 101 blt r19, $Lend C U1 loop control 104 C Main loop. 8-way unrolled. 189 bge r19, $Loop C U1 loop control 190 C ==== main loop end 228 lda r19, -1(r19) C decr loop cnt
|
H A D | sub_n.asm | 101 blt r19, $Lend C U1 loop control 104 C Main loop. 8-way unrolled. 189 bge r19, $Loop C U1 loop control 190 C ==== main loop end 228 lda r19, -1(r19) C decr loop cnt
|
H A D | mul_1.asm | 39 C 8-way unrolled loop 42 C Some notes about unrolled loop: 117 and r18, 7, r20 C count for the first loop, 0-7 118 srl r18, 3, r18 C count for unrolled loop 120 beq r20, $L_8_or_more C skip first loop 162 lda r0, -1(r31) C put -1 in r0, for tricky loop control
|
/haiku-buildtools/gcc/gcc/config/mn10300/ |
H A D | mn10300.c | 3207 /* This label is used both as an entry point to the loop 3208 and as a loop-back point for the loop. We need to separate 3210 but the loop-back does not go to the SETLB instruction. */ 3215 DUMP ("Created new loop-back label:", label); 3257 mn10300_loop_contains_call_insn (loop_p loop) 3263 bbs = get_loop_body (loop); 3265 for (i = 0; i < loop->num_nodes; i++) 3279 loop_p loop; 3290 if an inner loop i 3253 mn10300_loop_contains_call_insn(loop_p loop) argument 3275 loop_p loop; local [all...] |
/haiku-buildtools/gcc/gcc/cp/ |
H A D | cp-gimplify.c | 209 /* Build a generic representation of one of the C loop forms. COND is the 210 loop condition or NULL_TREE. BODY is the (possibly compound) statement 211 controlled by the loop. INCR is the increment expression of a for-loop, 213 evaluated before the loop body as in while and for loops, or after the 214 loop body as in do-while loops. */ 239 we won't build a loop. If it's true, any exits are in the body. */ 258 tree loop; local 262 loop = fold_build3_loc (start_locus, COND_EXPR, 266 loop 287 tree loop; local [all...] |
/haiku-buildtools/legacy/binutils/bfd/ |
H A D | versados.c | 454 int loop = 1; local 467 while (loop) 478 loop = 0;
|
/haiku-buildtools/gcc/gmp/mpn/x86/pentium/mmx/ |
H A D | mul_1.asm | 233 C instructions are rotated to the top of the loop to find somewhere useful 236 C Trouble has been taken to avoid overlapping successive loop iterations, 245 C The m signs calculated in %mm3 are a loop invariant and could be held in
|
/haiku-buildtools/legacy/binutils/gas/config/ |
H A D | tc-ns32k.c | 919 int pcrel, b, loop, pcrel_adjust; 922 for (loop = 0; loop < argc; loop++) 925 i = operandsP[loop << 1] - '1'; 933 switch ((d = operandsP[(loop << 1) + 1])) 914 int pcrel, b, loop, pcrel_adjust; local
|
/haiku-buildtools/binutils/gas/config/ |
H A D | tc-ns32k.c | 915 int pcrel, b, loop, pcrel_adjust; 918 for (loop = 0; loop < argc; loop++) 921 i = operandsP[loop << 1] - '1'; 929 switch ((d = operandsP[(loop << 1) + 1])) 910 int pcrel, b, loop, pcrel_adjust; local
|
/haiku-buildtools/gcc/gmp/mpn/arm/ |
H A D | udiv.asm | 39 mov r12, #8 C loop counter for both loops below
|