Home
last modified time | relevance | path

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

/dragonfly/contrib/gcc-8.0/gcc/
H A Dcfgloop.c145 (uint64_t) nit); in flow_loop_dump()
1911 widest_int nit; in get_estimated_loop_iterations_int() local
1917 if (!wi::fits_shwi_p (nit)) in get_estimated_loop_iterations_int()
1919 hwi_nit = nit.to_shwi (); in get_estimated_loop_iterations_int()
1934 if (nit == -1) in max_stmt_executions_int()
1953 if (nit == -1) in likely_max_stmt_executions_int()
2007 widest_int nit; in get_max_loop_iterations_int() local
2013 if (!wi::fits_shwi_p (nit)) in get_max_loop_iterations_int()
2015 hwi_nit = nit.to_shwi (); in get_max_loop_iterations_int()
2041 widest_int nit; in get_likely_max_loop_iterations_int() local
[all …]
H A Dtree-ssa-loop-niter.c2527 widest_int nit; in finite_loop_p() local
3983 widest_int nit; in estimated_loop_iterations_int() local
4019 widest_int nit; in max_loop_iterations_int() local
4054 widest_int nit; in likely_max_loop_iterations_int() local
4077 if (nit == -1) in estimated_stmt_executions_int()
4098 nit_minus_one = *nit; in max_stmt_executions()
4100 *nit += 1; in max_stmt_executions()
4117 nit_minus_one = *nit; in likely_max_stmt_executions()
4119 *nit += 1; in likely_max_stmt_executions()
4136 nit_minus_one = *nit; in estimated_stmt_executions()
[all …]
H A Dtree-parloops.c1798 tree nit) in try_transform_to_exit_first_loop_alt() argument
1824 tree nit_type = TREE_TYPE (nit); in try_transform_to_exit_first_loop_alt()
1827 if (TREE_CODE (nit) == INTEGER_CST) in try_transform_to_exit_first_loop_alt()
1832 nit, build_one_cst (nit_type)); in try_transform_to_exit_first_loop_alt()
1846 gcc_assert (TREE_CODE (nit) == SSA_NAME); in try_transform_to_exit_first_loop_alt()
1878 gimple *def = SSA_NAME_DEF_STMT (nit); in try_transform_to_exit_first_loop_alt()
1896 alt_bound = fold_build2 (PLUS_EXPR, nit_type, nit, in try_transform_to_exit_first_loop_alt()
1917 tree nit) in transform_to_exit_first_loop() argument
1935 gcc_assert (gimple_cond_rhs (cond_stmt) == nit); in transform_to_exit_first_loop()
2270 tree many_iterations_cond, type, nit; in gen_parallel_loop() local
[all …]
H A Dcfgloop.h852 extern bool get_estimated_loop_iterations (struct loop *loop, widest_int *nit);
853 extern bool get_max_loop_iterations (const struct loop *loop, widest_int *nit);
854 extern bool get_likely_max_loop_iterations (struct loop *loop, widest_int *nit);
H A Dtree-ssa-loop-manip.c1505 canonicalize_loop_ivs (struct loop *loop, tree *nit, bool bump_in_latch) in canonicalize_loop_ivs() argument
1507 unsigned precision = TYPE_PRECISION (TREE_TYPE (*nit)); in canonicalize_loop_ivs()
1547 *nit = fold_convert (type, *nit); in canonicalize_loop_ivs()
1548 *nit = force_gimple_operand (*nit, &stmts, true, NULL_TREE); in canonicalize_loop_ivs()
1574 gimple_cond_set_rhs (stmt, *nit); in canonicalize_loop_ivs()
H A Dtree-scalar-evolution.c3154 widest_int nit; in iv_can_overflow_p() local
3179 if (!get_max_loop_iterations (loop, &nit)) in iv_can_overflow_p()
3192 nit = wi::add (nit, 1, SIGNED, &overflow); in iv_can_overflow_p()
3198 if (wi::min_precision (nit, UNSIGNED) > TYPE_PRECISION (type)) in iv_can_overflow_p()
3200 wide_int nit2 = wide_int::from (nit, TYPE_PRECISION (type), UNSIGNED); in iv_can_overflow_p()
H A Dpredict.c1907 widest_int nit; in predict_loops() local
1952 && estimated_stmt_executions (loop, &nit)) in predict_loops()
1954 if (wi::gtu_p (nit, max)) in predict_loops()
1957 nitercst = nit.to_shwi (); in predict_loops()
1964 && likely_max_stmt_executions (loop, &nit) in predict_loops()
1965 && wi::ltu_p (nit, in predict_loops()
1973 nitercst = nit.to_shwi (); in predict_loops()
H A Dprofile.c1384 gcov_type nit = expected_loop_iterations_unbounded (loop); in branch_prob() local
1385 widest_int bound = gcov_type_to_wide_int (nit); in branch_prob()
H A Dtree-ssa-loop-ivopts.c4779 aff_tree step, delta, nit; in cand_value_at() local
4790 tree_to_aff_combination (niter, TREE_TYPE (niter), &nit); in cand_value_at()
4791 aff_combination_convert (&nit, steptype); in cand_value_at()
4792 aff_combination_mult (&nit, &step, &delta); in cand_value_at()
4962 struct aff_tree nit, tmpa, tmpb; in iv_elimination_compare_lt() local
5019 tree_to_aff_combination (niter->niter, nit_type, &nit); in iv_elimination_compare_lt()
5022 aff_combination_scale (&nit, -1); in iv_elimination_compare_lt()
5025 aff_combination_add (&tmpb, &nit); in iv_elimination_compare_lt()
H A Dtree-data-ref.c2892 widest_int nit; in max_stmt_executions_tree() local
2894 if (!max_stmt_executions (loop, &nit)) in max_stmt_executions_tree()
2897 if (!wi::fits_to_tree_p (nit, unsigned_type_node)) in max_stmt_executions_tree()
2900 return wide_int_to_tree (unsigned_type_node, nit); in max_stmt_executions_tree()
H A Dvr-values.c1772 widest_int nit; in adjust_range_with_scev() local
1776 if (max_loop_iterations (loop, &nit)) in adjust_range_with_scev()
1782 widest_int wtmp = wi::mul (wi::to_widest (step), nit, sgn, in adjust_range_with_scev()
/dragonfly/libexec/bootpd/
H A Dgetether.c82 int nit; local
87 nit = open("/dev/nit", 0);
88 if (nit < 0) {
94 if (ioctl(nit, NIOCBIND, &ifrnit) < 0) {
98 if (ioctl(nit, SIOCGIFADDR, &ifrnit) < 0) {
105 close(nit);
/dragonfly/contrib/mdocml/
H A Dmdoc_validate.c1715 nit = mdoc->last; in post_it()
1716 if (nit->type != ROFFT_BLOCK) in post_it()
1719 nbl = nit->parent->parent; in post_it()
1728 if (nit->head->child == NULL) in post_it()
1730 nit->line, nit->pos, "Bl -%s It", in post_it()
1737 if (nit->body == NULL || nit->body->child == NULL) in post_it()
1739 nit->line, nit->pos, "Bl -%s It", in post_it()
1745 nit->line, nit->pos, "It %s", in post_it()
1757 nit->line, nit->pos, "It"); in post_it()
1771 mandoc_msg(MANDOCERR_BL_COL, nit->line, nit->pos, in post_it()
[all …]
/dragonfly/contrib/gcc-4.7/gcc/
H A Dtree-ssa-loop-niter.c3041 bound = gcov_type_to_double_int (nit); in estimate_numbers_of_iterations_loop()
3061 double_int *nit) in estimated_loop_iterations() argument
3069 *nit = loop->nb_iterations_upper_bound; in estimated_loop_iterations()
3076 *nit = loop->nb_iterations_estimate; in estimated_loop_iterations()
3089 double_int nit; in estimated_loop_iterations_int() local
3095 if (!double_int_fits_in_shwi_p (nit)) in estimated_loop_iterations_int()
3097 hwi_nit = double_int_to_shwi (nit); in estimated_loop_iterations_int()
3112 if (nit == -1) in max_stmt_executions_int()
3134 nit_minus_one = *nit; in max_stmt_executions()
3136 *nit = double_int_add (*nit, double_int_one); in max_stmt_executions()
[all …]
H A Dtree-ssa-loop-manip.c1194 canonicalize_loop_ivs (struct loop *loop, tree *nit, bool bump_in_latch) in canonicalize_loop_ivs() argument
1196 unsigned precision = TYPE_PRECISION (TREE_TYPE (*nit)); in canonicalize_loop_ivs()
1236 *nit = fold_convert (type, *nit); in canonicalize_loop_ivs()
1237 *nit = force_gimple_operand (*nit, &stmts, true, NULL_TREE); in canonicalize_loop_ivs()
1263 gimple_cond_set_rhs (stmt, *nit); in canonicalize_loop_ivs()
H A Dtree-parloops.c1474 transform_to_exit_first_loop (struct loop *loop, htab_t reduction_list, tree nit) in transform_to_exit_first_loop() argument
1493 gcc_assert (gimple_cond_rhs (cond_stmt) == nit); in transform_to_exit_first_loop()
1757 tree many_iterations_cond, type, nit; in gen_parallel_loop() local
1821 nit = force_gimple_operand (unshare_expr (niter->niter), &stmts, true, in gen_parallel_loop()
1828 nit, build_int_cst (type, MIN_PER_THREAD * n_threads)); in gen_parallel_loop()
1856 canonicalize_loop_ivs (loop, &nit, true); in gen_parallel_loop()
1859 transform_to_exit_first_loop (loop, reduction_list, nit); in gen_parallel_loop()
H A Dgraphite-sese-to-poly.c959 add_upper_bounds_from_estimated_nit (scop_p scop, double_int nit, in add_upper_bounds_from_estimated_nit() argument
975 mpz_set_double_int (val, nit, false); in add_upper_bounds_from_estimated_nit()
1086 double_int nit; in build_loop_iteration_domains() local
1095 if (max_stmt_executions (loop, true, &nit)) in build_loop_iteration_domains()
1096 add_upper_bounds_from_estimated_nit (scop, nit, dim, ub_expr); in build_loop_iteration_domains()
H A Dtree-ssa-loop-ivopts.c4319 aff_tree step, delta, nit; in cand_value_at() local
4327 tree_to_aff_combination (niter, TREE_TYPE (niter), &nit); in cand_value_at()
4328 aff_combination_convert (&nit, steptype); in cand_value_at()
4329 aff_combination_mult (&nit, &step, &delta); in cand_value_at()
4538 struct affine_tree_combination nit, tmpa, tmpb; in iv_elimination_compare_lt() local
4595 tree_to_aff_combination (niter->niter, nit_type, &nit); in iv_elimination_compare_lt()
4598 aff_combination_scale (&nit, double_int_minus_one); in iv_elimination_compare_lt()
4601 aff_combination_add (&tmpb, &nit); in iv_elimination_compare_lt()
H A Dtree-data-ref.c1745 double_int nit; in max_stmt_executions_tree() local
1747 if (!max_stmt_executions (loop, true, &nit)) in max_stmt_executions_tree()
1750 if (!double_int_fits_to_tree_p (unsigned_type_node, nit)) in max_stmt_executions_tree()
1753 return double_int_to_tree (unsigned_type_node, nit); in max_stmt_executions_tree()
H A Dtree-vrp.c3410 double_int nit; in adjust_range_with_scev() local
3412 if (estimated_loop_iterations (loop, true, &nit)) in adjust_range_with_scev()
3419 dtmp = double_int_mul_with_sign (tree_to_double_int (step), nit, in adjust_range_with_scev()
/dragonfly/contrib/libpcap/
H A DREADME.DELETED56 pcap-nit.c
/dragonfly/usr.bin/calendar/calendars/de_DE.UTF-8/
H A Dcalendar.geschichte114 05/05 Natobeitritt, Wiederbewaffnung, Souveränität der Bundesrepublik, 1955
/dragonfly/contrib/tcp_wrappers/
H A DREADME579 netlog from Texas A&M relies on the SunOS 4.x /dev/nit interface to
/dragonfly/share/dict/
H A Dweb2a37204 nit grass
H A Dweb2124644 nit