Home
last modified time | relevance | path

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

12345678910

/dragonfly/usr.bin/ctags/
H A Dctags.c83 int step; /* step through args */ in main() local
139 for (exit_val = step = 0; step < argc; ++step) in main()
141 warn("%s", argv[step]); in main()
145 curfile = argv[step]; in main()
146 find_entries(argv[step]); in main()
166 for (step = 0; step < argc; step++) { in main()
170 if (regcomp(regx + step, lbuf, in main()
176 for (step = 0; step < argc; step++) in main()
177 if (regexec(regx + step, in main()
182 for (step = 0; step < argc; step++) in main()
[all …]
/dragonfly/contrib/gmp/mpz/
H A Dhamdist.c61 mp_size_t old_vsize, step; in mpz_hamdist() local
116 step = old_vsize - vsize - 1; in mpz_hamdist()
118 step = MIN (step, usize); in mpz_hamdist()
119 if (step != 0) in mpz_hamdist()
122 usize -= step; in mpz_hamdist()
123 up += step; in mpz_hamdist()
141 if (step != 0) in mpz_hamdist()
144 usize -= step; in mpz_hamdist()
145 vsize -= step; in mpz_hamdist()
146 up += step; in mpz_hamdist()
[all …]
H A Dfac_ui.c264 b = start + step; in ap_product_small()
273 a--, b += 2 * step) in ap_product_small()
284 MPZ_SET_1_NZ (ret, start * (start + step) * (start + 2 * step)); in ap_product_small()
289 MPZ_MUL_1_POS (ret, ret, b * (b + step) * (b + 2 * step)); in ap_product_small()
291 b = b * (b + step); in ap_product_small()
303 MPZ_SET_1_NZ (ret, start * (start + step) * (start + 2 * step)); in ap_product_small()
307 start * (start + step) * (start + 2 * step) * (start + in ap_product_small()
308 3 * step)); in ap_product_small()
314 b * (b + step) * (b + 2 * step) * (b + 3 * step)); in ap_product_small()
316 b = b * (b + step); in ap_product_small()
[all …]
/dragonfly/contrib/gcc-8.0/gcc/
H A Dtree-ssa-loop-prefetch.c323 if (operand_equal_p ((*groups)->step, step, 0) in find_or_create_group()
336 group->step = step; in find_or_create_group()
445 step = iv.step; in idx_analyze_ref()
472 *ar_data->step = step; in idx_analyze_ref()
528 ar_data.step = step; in analyze_ref()
680 step = int_cst_value (ref->group->step); in prune_ref_by_self_reuse()
692 step = -step; in prune_ref_by_self_reuse()
791 step = int_cst_value (ref->group->step); in prune_ref_by_group_reuse()
806 if (!step) in prune_ref_by_group_reuse()
830 step = -step; in prune_ref_by_group_reuse()
[all …]
H A Dtree-ssa-loop-niter.c1481 if ((integer_onep (iv0->step) && integer_zerop (iv1->step)) in number_of_iterations_lt()
1509 step = fold_convert (niter_type, iv0->step); in number_of_iterations_lt()
1523 zps.step = step; in number_of_iterations_lt()
1740 iv0->step, iv1->step); in number_of_iterations_cond()
1749 iv0->step = step; in number_of_iterations_cond()
1760 if (integer_zerop (iv0->step) && integer_zerop (iv1->step)) in number_of_iterations_cond()
1766 if (iv0->step && tree_int_cst_sign_bit (iv0->step)) in number_of_iterations_cond()
3143 iv->step = niter->control.step; in record_control_iv()
3219 step = fold_convert (unsigned_type, step); in record_nonwrapping_iv()
3306 || !step in idx_infer_loop_bounds()
[all …]
H A Dloop-iv.c543 iv0->step = simplify_gen_binary (op, mode, iv0->step, iv1->step); in iv_add()
2404 if (iv0.step != const0_rtx && iv1.step != const0_rtx) in iv_number_of_iterations()
2409 iv0.step = simplify_gen_binary (MINUS, comp_mode, iv0.step, iv1.step); in iv_number_of_iterations()
2413 iv0.step = lowpart_subreg (mode, iv0.step, comp_mode); in iv_number_of_iterations()
2414 iv1.step = lowpart_subreg (mode, iv1.step, comp_mode); in iv_number_of_iterations()
2418 if (iv0.step == const0_rtx && iv1.step == const0_rtx) in iv_number_of_iterations()
2525 step = iv0.step; in iv_number_of_iterations()
2526 step = lowpart_subreg (mode, step, comp_mode); in iv_number_of_iterations()
2595 inc = INTVAL (iv0.step) - INTVAL (iv1.step); in iv_number_of_iterations()
2641 iv0.step = simplify_gen_binary (MINUS, comp_mode, iv0.step, iv1.step); in iv_number_of_iterations()
[all …]
H A Dtree-ssa-loop-ivopts.c1209 iv->step = step;
1318 step = iv.step; in find_bivs()
2105 dta->step = fold_build2 (PLUS_EXPR, sizetype, dta->step, step); in idx_find_step()
2321 step = civ->step; in find_interesting_uses_address()
2331 step = civ->step; in find_interesting_uses_address()
2364 step = ifs_ivopts_data.step; in find_interesting_uses_address()
3101 step = fold_convert (type, step);
3382 ent.step = step; in record_common_cand()
3391 (*slot)->step = step; in record_common_cand()
3497 tree step = iv->step; in add_iv_candidate_for_use() local
[all …]
H A Dvector-builder.h223 derived ()->step (prev, final)); in elt()
256 unsigned int step) in repeating_sequence_p() argument
258 for (unsigned int i = start; i < end - step; ++i) in repeating_sequence_p()
259 if (!derived ()->equal_p ((*this)[i], (*this)[i + step])) in repeating_sequence_p()
271 unsigned int step) in stepped_sequence_p() argument
276 for (unsigned int i = start + step * 2; i < end; ++i) in stepped_sequence_p()
278 T elt1 = (*this)[i - step * 2]; in stepped_sequence_p()
279 T elt2 = (*this)[i - step]; in stepped_sequence_p()
287 if (maybe_ne (derived ()->step (elt1, elt2), in stepped_sequence_p()
288 derived ()->step (elt2, elt3))) in stepped_sequence_p()
H A Dtree-ssa-address.c124 if (step) in gen_addr_rtx()
199 if (addr->step && !integer_onep (addr->step)) in addr_for_mem_ref()
294 if (step) in tree_mem_ref_addr()
296 act_elem, step); in tree_mem_ref_addr()
357 if (addr->step && integer_onep (addr->step)) in create_mem_ref_raw()
841 if (parts.step && !integer_onep (parts.step)) in create_mem_ref()
957 gcc_assert (!parts.step || integer_onep (parts.step)); in create_mem_ref()
1102 if (addr.step) in maybe_fold_tmr()
1105 off, addr.step); in maybe_fold_tmr()
1106 addr.step = NULL_TREE; in maybe_fold_tmr()
[all …]
H A Domp-general.c96 tree step; in omp_get_for_step_from_incr() local
100 step = TREE_OPERAND (incr, 1); in omp_get_for_step_from_incr()
106 step = TREE_OPERAND (incr, 1); in omp_get_for_step_from_incr()
107 step = fold_build1_loc (loc, NEGATE_EXPR, TREE_TYPE (step), step); in omp_get_for_step_from_incr()
112 return step; in omp_get_for_step_from_incr()
286 loop->n2, loop->step); in omp_extract_for_data()
303 loop->n2, loop->step); in omp_extract_for_data()
309 loop->n2, loop->step); in omp_extract_for_data()
334 && TREE_CODE (loop->step) == INTEGER_CST) in omp_extract_for_data()
353 loop->step))); in omp_extract_for_data()
[all …]
H A Dtree-ssa-loop-manip.c90 if (TREE_CODE (step) == INTEGER_CST) in create_iv()
92 if (TYPE_UNSIGNED (TREE_TYPE (step))) in create_iv()
94 step1 = fold_build1 (NEGATE_EXPR, TREE_TYPE (step), step); in create_iv()
95 if (tree_int_cst_lt (step1, step)) in create_iv()
98 step = step1; in create_iv()
109 step = fold_build1 (NEGATE_EXPR, TREE_TYPE (step), step); in create_iv()
117 step = convert_to_ptrofftype (step); in create_iv()
119 step = fold_build1 (NEGATE_EXPR, TREE_TYPE (step), step); in create_iv()
124 step = force_gimple_operand (step, &stmts, true, NULL_TREE); in create_iv()
991 tree step = desc->control.step; in determine_exit_conditions() local
[all …]
H A Dint-vector-builder.h44 T step (T, T) const;
76 int_vector_builder<T>::step (T elt1, T elt2) const in step() function
85 int_vector_builder<T>::apply_step (T base, unsigned int factor, T step) const in apply_step() argument
87 return base + factor * step; in apply_step()
H A Dtree-ssa-loop-split.c114 if (!integer_zerop (iv2.step)) in split_at_bb_p()
122 else if (integer_zerop (iv->step)) in split_at_bb_p()
124 if (!integer_zerop (iv2.step)) in split_at_bb_p()
136 print_generic_expr (dump_file, iv->step, TDF_SLIM); in split_at_bb_p()
398 tree controlstep = niter->control.step; in compute_new_first_bound()
507 if ((tree_int_cst_sign_bit (iv.step) in split_loop()
508 != tree_int_cst_sign_bit (niter->control.step)) in split_loop()
509 || !tree_int_cst_equal (iv.step, niter->control.step)) in split_loop()
534 initial_true = !tree_int_cst_sign_bit (iv.step); in split_loop()
538 initial_true = tree_int_cst_sign_bit (iv.step); in split_loop()
/dragonfly/contrib/gcc-4.7/gcc/
H A Dtree-ssa-loop-prefetch.c319 if (operand_equal_p ((*groups)->step, step, 0) in find_or_create_group()
332 group->step = step; in find_or_create_group()
430 step = iv.step; in idx_analyze_ref()
457 *ar_data->step = step; in idx_analyze_ref()
513 ar_data.step = step; in analyze_ref()
627 step = int_cst_value (ref->group->step); in prune_ref_by_self_reuse()
639 step = -step; in prune_ref_by_self_reuse()
738 step = int_cst_value (ref->group->step); in prune_ref_by_group_reuse()
753 if (!step) in prune_ref_by_group_reuse()
777 step = -step; in prune_ref_by_group_reuse()
[all …]
H A Dtree-ssa-loop-niter.c1047 if ((integer_onep (iv0->step) && integer_zerop (iv1->step)) in number_of_iterations_lt()
1073 step = fold_convert (niter_type, iv0->step); in number_of_iterations_lt()
1087 zps.step = step; in number_of_iterations_lt()
1277 if (!integer_zerop (iv0->step) && !integer_zerop (iv1->step)) in number_of_iterations_cond()
1284 iv0->step, iv1->step); in number_of_iterations_cond()
1293 if (integer_zerop (iv0->step) && integer_zerop (iv1->step)) in number_of_iterations_cond()
1299 if (iv0->step && tree_int_cst_sign_bit (iv0->step)) in number_of_iterations_cond()
2605 if (TREE_CODE (step) != INTEGER_CST || integer_zerop (step)) in record_nonwrapping_iv()
2623 step = fold_convert (unsigned_type, step); in record_nonwrapping_iv()
2631 step = fold_build1 (NEGATE_EXPR, unsigned_type, step); in record_nonwrapping_iv()
[all …]
H A Dloop-iv.c535 iv0->step = simplify_gen_binary (op, mode, iv0->step, iv1->step); in iv_add()
2355 if (iv0.step != const0_rtx && iv1.step != const0_rtx) in iv_number_of_iterations()
2360 iv0.step = simplify_gen_binary (MINUS, comp_mode, iv0.step, iv1.step); in iv_number_of_iterations()
2364 iv0.step = lowpart_subreg (mode, iv0.step, comp_mode); in iv_number_of_iterations()
2365 iv1.step = lowpart_subreg (mode, iv1.step, comp_mode); in iv_number_of_iterations()
2369 if (iv0.step == const0_rtx && iv1.step == const0_rtx) in iv_number_of_iterations()
2476 step = iv0.step; in iv_number_of_iterations()
2477 step = lowpart_subreg (mode, step, comp_mode); in iv_number_of_iterations()
2546 inc = INTVAL (iv0.step) - INTVAL (iv1.step); in iv_number_of_iterations()
2589 iv0.step = simplify_gen_binary (MINUS, comp_mode, iv0.step, iv1.step); in iv_number_of_iterations()
[all …]
H A Dtree-ssa-address.c121 if (step) in gen_addr_rtx()
196 if (addr->step && !integer_onep (addr->step)) in addr_for_mem_ref()
281 if (step) in tree_mem_ref_addr()
283 act_elem, step); in tree_mem_ref_addr()
344 if (addr->step && integer_onep (addr->step)) in create_mem_ref_raw()
705 if (parts.step && !integer_onep (parts.step)) in create_mem_ref()
794 gcc_assert (!parts.step || integer_onep (parts.step)); in create_mem_ref()
945 if (addr.step) in maybe_fold_tmr()
948 off, addr.step); in maybe_fold_tmr()
949 addr.step = NULL_TREE; in maybe_fold_tmr()
[all …]
H A Dtree-ssa-loop-manip.c76 if (TREE_CODE (step) == INTEGER_CST) in create_iv()
78 if (TYPE_UNSIGNED (TREE_TYPE (step))) in create_iv()
80 step1 = fold_build1 (NEGATE_EXPR, TREE_TYPE (step), step); in create_iv()
81 if (tree_int_cst_lt (step1, step)) in create_iv()
84 step = step1; in create_iv()
95 step = fold_build1 (NEGATE_EXPR, TREE_TYPE (step), step); in create_iv()
103 step = convert_to_ptrofftype (step); in create_iv()
105 step = fold_build1 (NEGATE_EXPR, TREE_TYPE (step), step); in create_iv()
110 step = force_gimple_operand (step, &stmts, true, NULL_TREE); in create_iv()
699 tree step = desc->control.step; in determine_exit_conditions() local
[all …]
H A Dtree-ssa-loop-ivopts.c935 iv->step = step; in alloc_iv()
1034 step = convert_to_ptrofftype (step); in find_bivs()
1036 step = fold_convert (type, step); in find_bivs()
1527 dta->step = fold_build2 (PLUS_EXPR, sizetype, dta->step, step); in idx_find_step()
1737 step = civ->step; in find_interesting_uses_address()
1747 step = civ->step; in find_interesting_uses_address()
1780 step = ifs_ivopts_data.step; in find_interesting_uses_address()
2231 step = fold_convert (type, step); in add_candidate_1()
2259 && operand_equal_p (step, cand->iv->step, 0) in add_candidate_1()
4342 tree step = iv->step, period, type; in iv_period() local
[all …]
/dragonfly/contrib/gcc-8.0/libgomp/
H A Dtaskloop.c57 TYPE s = step; in GOMP_taskloop()
58 if (step > 0) in GOMP_taskloop()
77 n = (end - start + step - 1) / step; in GOMP_taskloop()
83 n = (start - end - step - 1) / -step; in GOMP_taskloop()
87 TYPE task_step = step; in GOMP_taskloop()
115 task_step += step; in GOMP_taskloop()
126 task_step += step; in GOMP_taskloop()
144 task_step += step; in GOMP_taskloop()
199 task_step -= step; in GOMP_taskloop()
232 task_step -= step; in GOMP_taskloop()
[all …]
/dragonfly/sys/netinet/
H A Din_var.h230 #define IN_NEXT_MULTI(step, inm) \ argument
234 if (((inm) = (step).i_inm) != NULL) \
235 (step).i_inm = LIST_NEXT((step).i_inm, inm_link); \
238 #define IN_FIRST_MULTI(step, inm) \ argument
242 (step).i_inm = LIST_FIRST(&in_multihead); \
243 IN_NEXT_MULTI((step), (inm)); \
/dragonfly/games/adventure/
H A Dcrc.c107 c->step = 0; in crc_start()
125 x = c->step++; in crc_add()
126 if (c->step >= __arraycount(crctab)) { in crc_add()
127 c->step = 0; in crc_add()
/dragonfly/stand/lib/
H A Dif_ether.h219 #define ETHER_NEXT_MULTI(step, enm) \ argument
223 if (((enm) = (step).e_enm) != NULL) \
224 (step).e_enm = (enm)->enm_list.le_next; \
227 #define ETHER_FIRST_MULTI(step, ac, enm) \ argument
232 (step).e_enm = (ac)->ac_multiaddrs.lh_first; \
233 ETHER_NEXT_MULTI((step), (enm)); \
/dragonfly/usr.bin/last/
H A Dlast.c462 ARG *step; in wantx() local
478 for (step = arglist; step; step = step->next) in wantx()
479 switch(step->type) { in wantx()
481 if (!strncasecmp(step->name, bp->ut_host, UTX_HOSTSIZE)) in wantx()
485 if (!strncmp(step->name, bp->ut_line, UTX_LINESIZE)) in wantx()
489 if (!strncmp(step->name, bp->ut_name, UTX_USERSIZE)) in wantx()
/dragonfly/contrib/libarchive/libarchive/
H A Darchive_blake2sp_ref.c302 size_t i, step; in main() local
323 for(step = 1; step < BLAKE2S_BLOCKBYTES; ++step) { in main()
335 while (mlen >= step) { in main()
336 if ( (err = blake2sp_update(&S, p, step)) < 0 ) { in main()
339 mlen -= step; in main()
340 p += step; in main()

12345678910