/freebsd-11-stable/contrib/netbsd-tests/net/icmp/ |
H A D | t_ping.c | 151 int loop, succ; local 180 for (loop = 0; loop < loops; loop++) { 182 icmp->icmp_seq = htons(loop); 331 int s, x, loop; local 342 for (loop = 0;; loop++) { 347 if (loop == 1) 359 if (loop [all...] |
/freebsd-11-stable/crypto/openssl/crypto/bn/ |
H A D | bn_prime.c | 179 loop: 193 /* if (BN_mod_word(ret,(BN_ULONG)3) == 1) goto loop; */ 203 goto loop; 217 goto loop; 223 goto loop; 381 loop:for (i = 1; i < NUMPRIMES; i++) { 390 goto loop; 429 loop:for (i = 1; i < NUMPRIMES; i++) { 434 goto loop; 485 loop [all...] |
H A D | bn_ctx.c | 241 unsigned loop = 0; local 242 while (loop < BN_CTX_POOL_SIZE) 243 fprintf(stderr, "%02x ", pool->vals[loop++].dmax); 372 unsigned int loop = 0; local 374 while (loop++ < BN_CTX_POOL_SIZE) { 390 unsigned int loop = 0; local 392 while (loop++ < BN_CTX_POOL_SIZE) { 408 unsigned int loop = 0; local 414 while (loop++ < BN_CTX_POOL_SIZE)
|
H A D | bn_div.c | 193 int norm_shift, i, loop; local 285 loop = num_n - div_n; 291 wnum.d = &(snum->d[loop]); 297 wnum.dmax = snum->dmax - loop; /* so we don't step out of bounds */ 309 if (!bn_wexpand(res, (loop + 1))) 311 res->top = loop - no_branch; 312 resp = &(res->d[loop - 1]); 341 for (i = 0; i < loop - 1; i++, wnump--, resp--) { 344 * the first part of the loop uses the top two words of snum and sdiv
|
/freebsd-11-stable/libexec/revnetgroup/ |
H A D | hash.c | 57 size_t loop; local 65 loop = (len + 8 - 1) >> 3; 92 } while (--loop);
|
/freebsd-11-stable/contrib/gcc/ |
H A D | cfghooks.h | 112 /* A hook for duplicating loop in CFG, currently this is used 113 in loop versioning. */ 114 bool (*cfg_hook_duplicate_loop_to_header_edge) (struct loop *loop, edge e, 122 /* Add condition to new basic block and update CFG used in loop 126 /* Update the PHI nodes in case of loop versioning. */ 136 E->dest (only in tree-ssa loop versioning. */ 166 extern bool cfg_hook_duplicate_loop_to_header_edge (struct loop *loop, edge,
|
H A D | predict.c | 77 static void estimate_loops_at_level (struct loop *, bitmap); 78 static void propagate_freq (struct loop *, bitmap); 630 /* Predict edge probabilities by exploiting loop structure. 641 /* Try to predict out blocks in a loop that are not part of a 642 natural loop. */ 648 struct loop *loop = loops_info->parray[i]; local 653 exits = get_loop_exit_edges (loop, &n_exits); 657 iv_analysis_loop_init (loop); 658 find_simple_exit (loop, 1553 propagate_freq(struct loop *loop, bitmap tovisit) argument 1694 struct loop *loop; local [all...] |
H A D | modulo-sched.c | 65 1. Build a data-dependence graph (DDG) for each loop. 66 2. Use the DDG to order the insns of a loop (not in topological order 69 3. Compute MII: a lower bound on the number of cycles to schedule the loop. 70 4. Use the ordering to perform list-scheduling of the loop: 71 1. Set II = MII. We will try to schedule the loop within II cycles. 82 5. If we succeeded in scheduling the loop within II cycles, we now 83 generate prolog and epilog, decrease the counter of the loop, and 190 static void generate_prolog_epilog (partial_schedule_ptr ,struct loop * loop, rtx); 401 /* Calculate an upper bound for II. SMS should not schedule the loop i 728 generate_prolog_epilog(partial_schedule_ptr ps, struct loop * loop, rtx count_reg) argument 780 loop_single_full_bb_p(struct loop *loop) argument 824 loop_canon_p(struct loop *loop) argument 873 canon_loop(struct loop *loop) argument 957 struct loop *loop = loops->parray[i]; local 1070 struct loop *loop = loops->parray[i]; local [all...] |
H A D | loop-iv.c | 21 /* This is a simple analysis of induction variables of the loop. The major use 22 is for determining the number of iterations of a loop for loop unrolling, 30 The analysis works always with one loop -- you must call 31 iv_analysis_loop_init (loop) for it. All the other functions then work with 32 this loop. When you need to work with another loop, just call 48 iv_current_loop_df (): Returns the dataflow object for the current loop used 75 /* The use is trivial invariant of the loop, i.e. is not changed 76 inside the loop 243 iv_analysis_loop_init(struct loop *loop) argument 1698 simplify_using_initial_values(struct loop *loop, enum rtx_code op, rtx *expr) argument 1989 iv_number_of_iterations(struct loop *loop, rtx insn, rtx condition, struct niter_desc *desc) argument 2541 check_simple_exit(struct loop *loop, edge e, struct niter_desc *desc) argument 2588 find_simple_exit(struct loop *loop, struct niter_desc *desc) argument 2676 get_simple_loop_desc(struct loop *loop) argument 2729 free_simple_loop_desc(struct loop *loop) argument [all...] |
H A D | tree-ssa-loop-ivopts.c | 21 /* This pass tries to find the optimal set of induction variables for the loop. 60 All of this is done loop by loop. Doing it globally is theoretically 96 /* The expected number of loop iterations. TODO -- use profiling instead of 118 bool has_nonlin_use; /* For a loop-level invariant, whether it is used in 203 /* The currently optimized loop. */ 204 struct loop *current_loop; 209 /* Numbers of iterations for all exits of the current loop. */ 299 optimizing such a loop would help, and it would take ages). */ 347 /* The single loop exi 350 single_dom_exit(struct loop *loop) argument 582 stmt_after_ip_normal_pos(struct loop *loop, tree stmt) argument 628 stmt_after_increment(struct loop *loop, struct iv_cand *cand, tree stmt) argument 947 struct loop *loop = bb_for_stmt (phi)->loop_father; local 967 struct loop *loop = data->current_loop; local 1003 struct loop *loop = data->current_loop; local 1035 struct loop *loop = data->current_loop; local 1087 struct loop *loop = data->current_loop; local 1299 expr_invariant_in_loop_p(struct loop *loop, tree expr) argument 1345 struct loop *loop = dta->ivopts_data->current_loop; local 2091 allow_ip_end_pos_p(struct loop *loop) argument 2532 var_at_stmt(struct loop *loop, struct iv_cand *cand, tree stmt) argument 3031 get_computation_aff(struct loop *loop, struct iv_use *use, struct iv_cand *cand, tree at, struct affine_tree_combination *aff) argument 3198 get_computation_at(struct loop *loop, struct iv_use *use, struct iv_cand *cand, tree at) argument 3214 get_computation(struct loop *loop, struct iv_use *use, struct iv_cand *cand) argument 4077 cand_value_at(struct loop *loop, struct iv_cand *cand, tree at, tree niter) argument 4116 struct loop *loop = data->current_loop; local 4139 struct loop *loop = data->current_loop; local 4414 struct loop *loop = data->current_loop; local 5803 tree_ssa_iv_optimize_loop(struct ivopts_data *data, struct loop *loop) argument 5877 struct loop *loop; local [all...] |
/freebsd-11-stable/contrib/opie/libopie/ |
H A D | readpass.c | 225 loop: 257 goto loop; 271 goto loop; 286 goto loop;
|
/freebsd-11-stable/lib/libc/mips/string/ |
H A D | strcmp.S | 56 lbu t0, 1(a0) # unroll loop
|
/freebsd-11-stable/tests/sys/netgraph/ |
H A D | hub.c | 118 ATF_TC(loop); variable 119 ATF_TC_HEAD(loop, conf) 124 ATF_TC_BODY(loop, dummy) 145 * Open loop 159 * Closed loop, DANGEROUS! 226 ATF_TP_ADD_TC(hub, loop);
|
/freebsd-11-stable/tools/tools/npe/npestats/ |
H A D | main.c | 116 loop: 136 goto loop;
|
/freebsd-11-stable/tools/tools/ath/athaggrstats/ |
H A D | main.c | 132 loop: 152 goto loop;
|
/freebsd-11-stable/tools/tools/ath/athstats/ |
H A D | main.c | 137 loop: 157 goto loop;
|
/freebsd-11-stable/sys/libkern/arm64/ |
H A D | crc32c_armv8.S | 60 loop: label 64 b.ne loop
|
/freebsd-11-stable/sys/arm/arm/ |
H A D | disassem.c | 555 int loop; local 563 for (loop = 0; loop < 17; ++loop) { 565 if (loop == 16 || !(insn & (1 << loop))) { 570 if (start == loop - 1) 573 di->di_printf("r%d-r%d", start, loop - 1); 577 if (insn & (1 << loop)) 578 start = loop; [all...] |
H A D | undefined.c | 171 int loop; local 174 for (loop = 0; loop < MAX_COPROCS; ++loop) 175 LIST_INIT(&undefined_handlers[loop]);
|
/freebsd-11-stable/sys/dev/ata/ |
H A D | ata-sata.c | 156 int loop, retry, sata_rev; local 190 for (loop = 0; loop < 10; loop++) { 201 for (loop = 0; loop < 10; loop++) {
|
/freebsd-11-stable/contrib/byacc/ |
H A D | reader.c | 669 loop: 678 goto loop; 690 goto loop; 700 goto loop; 717 goto loop; 763 loop: 772 goto loop; 776 goto loop; 786 goto loop; 795 goto loop; [all...] |
/freebsd-11-stable/sys/dev/ppbus/ |
H A D | ppb_msq.c | 118 ppb_MS_init(device_t bus, device_t dev, struct ppb_microseq *loop, int opcode) argument 124 xfer->loop = loop; 157 * Execute a microseq loop 169 /* loop: */ 171 MS_DBRA(-1 /* loop: */), 183 /* execute the loop */ 288 if (!xfer->loop) { 315 ppb_MS_microseq(bus, dev, xfer->loop, &error);
|
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_deadlock_detector1.cpp | 144 rep->loop[i].thr_ctx = unique_tid; 145 rep->loop[i].mtx_ctx0 = m0->ctx; 146 rep->loop[i].mtx_ctx1 = m1->ctx; 147 rep->loop[i].stk[0] = stk_to; 148 rep->loop[i].stk[1] = stk_from;
|
/freebsd-11-stable/contrib/ntp/util/ |
H A D | sht.c | 129 printf (" l loop (so, rcl will read and clear in a loop\n"); 163 int loop=0; local 167 case 'l': loop=1; break; 185 if (loop) {
|
/freebsd-11-stable/stand/pc98/boot0.5/ |
H A D | support.s | 43 loop wait_loop 87 loop beep_loop1 92 loop beep_loop2
|