Home
last modified time | relevance | path

Searched refs:step (Results 1 – 25 of 696) sorted by relevance

12345678910>>...28

/openbsd-src/gnu/gcc/libgomp/testsuite/libgomp.c++/
H A Dloop-1.C10 int i, N1, N2, step; in main1() local
15 step = rand () % 7 + 1; in main1()
17 printf ("N1 = %d\nN2 = %d\nstep = %d\n", N1, N2, step); in main1()
19 for (i = N1; i <= N2; i += step) in main1()
24 #pragma omp parallel shared(a,b,N1,N2,step) private(i) in main1()
27 for (i = N1; i < N2; i += step) in main1()
32 for (i = N1; i < N2; i += step) in main1()
36 printf ("for (i = %d; i < %d; i += %d) [OK]\n", N1, N2, step); in main1()
40 #pragma omp parallel shared(a,b,N1,N2,step) private(i) in main1()
43 for (i = N1; i <= N2; i += step) in main1()
[all …]
/openbsd-src/gnu/gcc/libgomp/testsuite/libgomp.c/
H A Domp-loop01.c10 int i, N1, N2, step; in main1() local
15 step = rand () % 7 + 1; in main1()
17 printf ("N1 = %d\nN2 = %d\nstep = %d\n", N1, N2, step); in main1()
19 for (i = N1; i <= N2; i += step) in main1()
24 #pragma omp parallel shared(a,b,N1,N2,step) private(i) in main1()
27 for (i = N1; i < N2; i += step) in main1()
32 for (i = N1; i < N2; i += step) in main1()
36 printf ("for (i = %d; i < %d; i += %d) [OK]\n", N1, N2, step); in main1()
40 #pragma omp parallel shared(a,b,N1,N2,step) private(i) in main1()
43 for (i = N1; i <= N2; i += step) in main1()
[all …]
/openbsd-src/gnu/gcc/gcc/
H A Dtree-ssa-loop-prefetch.c179 HOST_WIDE_INT step; /* Step of the reference. */ member
217 fprintf (file, HOST_WIDE_INT_PRINT_DEC, ref->group->step); in dump_mem_ref()
234 HOST_WIDE_INT step) in find_or_create_group() argument
240 if ((*groups)->step == step in find_or_create_group()
245 if ((*groups)->step < step) in find_or_create_group()
251 group->step = step; in find_or_create_group()
327 HOST_WIDE_INT *step; /* Step of the memory reference. */ member
338 tree ibase, step, stepsize; in idx_analyze_ref() local
349 step = iv.step; in idx_analyze_ref()
351 if (zero_p (step)) in idx_analyze_ref()
[all …]
H A Dtree-ssa-loop-niter.c149 if (tree_int_cst_sign_bit (iv->step)) in number_of_iterations_ne()
152 fold_build1 (NEGATE_EXPR, type, iv->step)); in number_of_iterations_ne()
159 s = fold_convert (niter_type, iv->step); in number_of_iterations_ne()
213 tree *delta, tree step) in number_of_iterations_lt_to_ne() argument
215 tree niter_type = TREE_TYPE (step); in number_of_iterations_lt_to_ne()
216 tree mod = fold_build2 (FLOOR_MOD_EXPR, niter_type, *delta, step); in number_of_iterations_lt_to_ne()
223 mod = fold_build2 (MINUS_EXPR, niter_type, step, mod); in number_of_iterations_lt_to_ne()
226 if (nonzero_p (iv0->step)) in number_of_iterations_lt_to_ne()
284 struct tree_niter_desc *niter, tree step) in assert_no_overflow_lt() argument
287 tree niter_type = TREE_TYPE (step); in assert_no_overflow_lt()
[all …]
H A Dtree-ssa-address.c99 gen_addr_rtx (rtx symbol, rtx base, rtx index, rtx step, rtx offset, in gen_addr_rtx() argument
113 if (step) in gen_addr_rtx()
115 act_elem = gen_rtx_MULT (Pmode, act_elem, step); in gen_addr_rtx()
180 if (addr->step && !integer_onep (addr->step)) in addr_for_mem_ref()
181 st = immed_double_const (TREE_INT_CST_LOW (addr->step), in addr_for_mem_ref()
182 TREE_INT_CST_HIGH (addr->step), Pmode); in addr_for_mem_ref()
248 tree step = TMR_STEP (mem_ref), offset = TMR_OFFSET (mem_ref); in tree_mem_ref_addr() local
263 if (step) in tree_mem_ref_addr()
264 act_elem = fold_build2 (MULT_EXPR, sizetype, act_elem, step); in tree_mem_ref_addr()
324 if (addr->step && integer_onep (addr->step)) in create_mem_ref_raw()
[all …]
H A Dloop-iv.c132 if (iv->step == const0_rtx in dump_iv_info()
137 if (iv->step != const0_rtx) in dump_iv_info()
140 print_rtl (file, iv->step); in dump_iv_info()
368 iv->step = const0_rtx; in iv_constant()
384 if (iv->step == const0_rtx in iv_subreg()
410 iv->step = simplify_gen_binary (MULT, iv->extend_mode, iv->step, iv->mult); in iv_subreg()
424 if (iv->step == const0_rtx in iv_extend()
459 iv->step = simplify_gen_unary (NEG, iv->extend_mode, in iv_neg()
460 iv->step, iv->extend_mode); in iv_neg()
484 && iv0->step == const0_rtx in iv_add()
[all …]
H A Dtree-ssa-loop-manip.c51 create_iv (tree base, tree step, tree var, struct loop *loop, in create_iv() argument
75 if (TREE_CODE (step) == INTEGER_CST) in create_iv()
77 if (TYPE_UNSIGNED (TREE_TYPE (step))) in create_iv()
79 step1 = fold_build1 (NEGATE_EXPR, TREE_TYPE (step), step); in create_iv()
80 if (tree_int_cst_lt (step1, step)) in create_iv()
83 step = step1; in create_iv()
90 if (!tree_expr_nonnegative_warnv_p (step, &ovf) in create_iv()
91 && may_negate_without_overflow_p (step)) in create_iv()
94 step = fold_build1 (NEGATE_EXPR, TREE_TYPE (step), step); in create_iv()
101 step = force_gimple_operand (step, &stmts, true, var); in create_iv()
[all …]
H A Dtree-ssa-loop-ivopts.c106 tree step; /* Step of the iv (constant only). */ member
380 if (iv->step) in dump_iv()
387 print_generic_expr (file, iv->step, TDF_SLIM); in dump_iv()
890 alloc_iv (tree base, tree step) in alloc_iv() argument
894 if (step && integer_zerop (step)) in alloc_iv()
895 step = NULL_TREE; in alloc_iv()
899 iv->step = step; in alloc_iv()
911 set_iv (struct ivopts_data *data, tree iv, tree base, tree step) in set_iv() argument
918 info->iv = alloc_iv (base, step); in set_iv()
957 return (zero_p (iv.step) ? NULL_TREE : iv.step); in determine_biv_step()
[all …]
/openbsd-src/sys/arch/hppa/spmath/
H A Ddivu.S52 ds rem,dvr,rem ; 1st divide step, if carry
55 ds rem,dvr,rem ; 2nd divide step
57 ds rem,dvr,rem ; 3rd divide step
59 ds rem,dvr,rem ; 4th divide step
61 ds rem,dvr,rem ; 5th divide step
63 ds rem,dvr,rem ; 6th divide step
65 ds rem,dvr,rem ; 7th divide step
67 ds rem,dvr,rem ; 8th divide step
69 ds rem,dvr,rem ; 9th divide step
71 ds rem,dvr,rem ; 10th divide step
[all …]
/openbsd-src/sys/dev/pci/drm/i915/
H A Dintel_step.c145 u8 step = gmd->step + STEP_A0; in gmd_to_intel_step() local
147 if (step >= STEP_FUTURE) { in gmd_to_intel_step()
152 return step; in gmd_to_intel_step()
162 struct intel_step_info step = {}; in intel_step_init() local
165 step.graphics_step = gmd_to_intel_step(i915, in intel_step_init()
167 step.media_step = gmd_to_intel_step(i915, in intel_step_init()
169 step.display_step = STEP_A0 + DISPLAY_RUNTIME_INFO(i915)->ip.step; in intel_step_init()
170 if (step.display_step >= STEP_FUTURE) { in intel_step_init()
172 step.display_step = STEP_FUTURE; in intel_step_init()
175 RUNTIME_INFO(i915)->step = step; in intel_step_init()
[all …]
/openbsd-src/gnu/usr.bin/perl/cpan/Test-Simple/t/Legacy/subtest/
H A Dcallback.t14 my $step = 0;
19 $step,
23 ++$step;
32 $step,
36 ++$step;
48 $step,
/openbsd-src/usr.bin/jot/
H A Djot.c60 static double step = 1; variable
136 if (!sscanf(argv[3], "%lf", &step)) in main()
200 if (step != 0.0) { in main()
201 long t = (ender - begin + step) / step; in main()
213 step = 0.0; in main()
215 step = (ender - begin) / (reps - 1); in main()
218 step = ender > begin ? 1 : -1; /* FreeBSD's behavior. */ in main()
221 if (step == 0.0) { in main()
226 reps = (ender - begin + step) / step; in main()
237 begin = ender - reps * step + step; in main()
[all …]
/openbsd-src/gnu/usr.bin/perl/cpan/Test-Simple/t/Test2/behavior/
H A DSubtest_callback.t8 my $step = 0;
13 $step,
17 ++$step;
26 $step,
30 ++$step;
43 $step,
/openbsd-src/games/adventure/
H A Dcrc.c102 unsigned int step; variable
107 crcval = step = 0; in crc_start()
120 i = step++; in crc()
121 if (step >= sizeof(crctab) / sizeof(crctab[0])) in crc()
122 step = 0; in crc()
/openbsd-src/gnu/usr.bin/gcc/gcc/testsuite/gcc.c-torture/execute/
H A D20000605-1.c16 float step; in render_image_rgb_a() local
21 step = 1.0 / info->scaley; in render_image_rgb_a()
23 error = y * step; in render_image_rgb_a()
24 error -= ((int) error) - step; in render_image_rgb_a()
32 error += step; in render_image_rgb_a()
/openbsd-src/sys/dev/pci/drm/i915/selftests/
H A Di915_syncmap.c335 unsigned int step, order, idx; in igt_syncmap_join_below() local
344 for (step = 0; step < KSYNCMAP; step++) { in igt_syncmap_join_below()
346 u64 context = step * BIT_ULL(order); in igt_syncmap_join_below()
354 context, order, step, sync->height, sync->prefix); in igt_syncmap_join_below()
361 for (step = 0; step < KSYNCMAP; step++) { in igt_syncmap_join_below()
363 u64 context = step * BIT_ULL(order); in igt_syncmap_join_below()
367 context, order, step); in igt_syncmap_join_below()
375 context + idx, order, step); in igt_syncmap_join_below()
384 for (step = 0; step < KSYNCMAP; step++) { in igt_syncmap_join_below()
385 u64 context = step * BIT_ULL(order); in igt_syncmap_join_below()
[all …]
/openbsd-src/usr.bin/last/
H A Dlast.c185 struct arg *step; in checkargs() local
190 for (step = arglist; step; step = step->next) in checkargs()
191 switch (step->type) { in checkargs()
419 struct arg *step; in want() local
444 for (step = arglist; step; step = step->next) in want()
445 switch (step->type) { in want()
447 if (!strncasecmp(step->name, bp->ut_host, UT_HOSTSIZE)) in want()
451 if (!strncmp(step->name, bp->ut_line, UT_LINESIZE)) in want()
455 if (!strncmp(step->name, bp->ut_name, UT_NAMESIZE)) in want()
/openbsd-src/sys/dev/rasops/
H A Drasops32.c67 int width, height, step, cnt, fs, b, f; in rasops32_putchar() local
92 step = ri->ri_stride >> 3; in rasops32_putchar()
106 rp += step; in rasops32_putchar()
121 rp += step; in rasops32_putchar()
133 rp += step; in rasops32_putchar()
148 rp += step; in rasops32_putchar()
165 rp += step; in rasops32_putchar()
192 rp += step; in rasops32_putchar()
210 rp += step; in rasops32_putchar()
218 rp -= step;
[all...]
/openbsd-src/sys/arch/loongson/loongson/
H A Dloongson2_machdep.c283 uint32_t step, val; in loongson2f_cpuspeed() local
286 step = (val & 0x7) + 1; in loongson2f_cpuspeed()
287 *freq = ((bootcpu_hwinfo.clock / 8) * step) / 1000000; in loongson2f_cpuspeed()
295 uint32_t step, val; in loongson2f_setperf() local
297 step = percent * 8 / 100; in loongson2f_setperf()
298 if (step < 2) in loongson2f_setperf()
299 step = 2; in loongson2f_setperf()
305 val = (val & ~0x7) | (step - 1); in loongson2f_setperf()
/openbsd-src/usr.bin/ctags/
H A Dctags.c77 int step; /* step through args */ in main() local
130 for (exit_val = step = 0; step < argc; ++step) in main()
131 if (!(inf = fopen(argv[step], "r"))) { in main()
132 warn("%s", argv[step]); in main()
136 curfile = argv[step]; in main()
137 find_entries(argv[step]); in main()
/openbsd-src/sys/lib/libkern/arch/hppa/
H A Dmilli.S482 ds r0,arg1,temp ; 1st divide step, if no carry
484 ds temp,arg1,temp ; 2nd divide step
486 ds temp,arg1,temp ; 3rd divide step
488 ds temp,arg1,temp ; 4th divide step
490 ds temp,arg1,temp ; 5th divide step
492 ds temp,arg1,temp ; 6th divide step
494 ds temp,arg1,temp ; 7th divide step
496 ds temp,arg1,temp ; 8th divide step
498 ds temp,arg1,temp ; 9th divide step
500 ds temp,arg1,temp ; 10th divide step
[all …]
/openbsd-src/gnu/usr.bin/binutils/gdb/testsuite/gdb.base/
H A Dsigstep.exp181 advance step
234 skip_to_handler step
275 skip_to_handler_entry step
305 skip_over_handler step
342 breakpoint_to_handler step
387 breakpoint_to_handler_entry step
421 breakpoint_over_handler step
/openbsd-src/sys/arch/i386/i386/
H A Dmtrr.c42 int family, model, step; in mem_range_attach() local
46 step = (cpu_id >> 0) & 0xf; in mem_range_attach()
52 step > 0x7))) { in mem_range_attach()
/openbsd-src/gnu/usr.bin/binutils/gdb/gdbserver/
H A Dserver.c174 default_action.step = 0; in handle_v_cont()
186 resume_info[i].step = 1; in handle_v_cont()
188 resume_info[i].step = 0; in handle_v_cont()
278 myresume (int step, int sig) in myresume() argument
283 if (step || sig || cont_thread > 0) in myresume()
287 resume_info[0].step = step; in myresume()
293 resume_info[n].step = 0; in myresume()
/openbsd-src/gnu/usr.bin/perl/cpan/Math-BigInt/lib/Math/BigInt/
H A DCalc.pm248 $MAX_EXP_F--; # last test failed, so retract one step
1544 my $step = 2;
1546 while ($r * $cf < $BASE && $step < $steps) {
1549 $step++;
1551 if ((@$cx == 1) && $step == $cx->[0]) {
1579 while ($step < $base_2) {
1584 my $b = $step * ($step + 1);
1585 $step += 2;
1588 $step
[all...]

12345678910>>...28