| /src/usr.sbin/bootp/bootptest/ |
| getether.c | 87 int nit;
92 nit = open("/dev/nit", 0);
93 if (nit < 0) {
94 report(LOG_ERR, "getether: open /dev/nit: %s",
99 if (ioctl(nit, NIOCBIND, &ifrnit) < 0) {
100 report(LOG_ERR, "getether: NIOCBIND on nit");
103 if (ioctl(nit, SIOCGIFADDR, &ifrnit) < 0) {
104 report(LOG_ERR, "getether: SIOCGIFADDR on nit");
110 close(nit);
86 int nit; local
[all...] |
| /src/usr.sbin/iopctl/ |
| iopctl.c | 426 int hc, lc, i, nit; local
438 nit = (le16toh(status.orgid) != I2O_ORG_DPT);
441 if (nit && *src == '\0')
|
| /src/sys/dev/i2o/ |
| iop.c | 2308 int hc, lc, i, nit; local
2320 nit = (le16toh(sc->sc_status.orgid) != I2O_ORG_DPT);
2323 if (nit && *src == '\0')
|
| /src/external/bsd/mdocml/dist/ |
| mdoc_validate.c | 1712 struct roff_node *nbl, *nit, *nch; local
1718 nit = mdoc->last;
1719 if (nit->type != ROFFT_BLOCK)
1722 nbl = nit->parent->parent;
1731 if (nit->head->child == NULL)
1733 nit->line, nit->pos, "Bl -%s It",
1740 if (nit->body == NULL || nit->body->child == NULL)
1742 nit->line, nit->pos, "Bl -%s It"
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| cfgloop.cc | 1954 widest_int nit;
1957 if (!get_estimated_loop_iterations (loop, &nit))
1960 if (!wi::fits_shwi_p (nit))
1962 hwi_nit = nit.to_shwi ();
1974 HOST_WIDE_INT nit = get_max_loop_iterations_int (loop);
1977 if (nit == -1)
1980 snit = (HOST_WIDE_INT) ((unsigned HOST_WIDE_INT) nit + 1);
1993 HOST_WIDE_INT nit = get_likely_max_loop_iterations_int (loop);
1996 if (nit == -1)
1999 snit = (HOST_WIDE_INT) ((unsigned HOST_WIDE_INT) nit + 1)
1953 widest_int nit; local
1973 HOST_WIDE_INT nit = get_max_loop_iterations_int (loop); local
1992 HOST_WIDE_INT nit = get_likely_max_loop_iterations_int (loop); local
2051 widest_int nit; local
2085 widest_int nit; local
[all...] |
| graphite-sese-to-poly.cc | 806 widest_int nit; local
807 if (!max_stmt_executions (loop, &nit))
814 /* NIT is an upper bound to NB_ITERS: "NIT >= NB_ITERS", although we
816 --nit;
818 isl_pw_aff *approx = extract_affine_wi (nit, isl_space_copy (space));
827 isl_val *v = isl_val_int_from_wi (scop->isl_context, nit);
|
| profile.cc | 1610 sreal nit;
1617 && expected_loop_iterations_by_profile (loop, &nit, &reliable)
1620 widest_int bound = nit.to_nearest_int ();
1609 sreal nit; local
|
| tree-scalar-evolution.cc | 3064 widest_int nit;
3090 if (!get_max_loop_iterations (loop, &nit))
3103 nit = wi::add (nit, 1, SIGNED, &overflow);
3107 /* NIT is typeless and can exceed the precision of the type. In this case
3109 if (wi::min_precision (nit, UNSIGNED) > TYPE_PRECISION (type))
3111 wide_int nit2 = wide_int::from (nit, TYPE_PRECISION (type), UNSIGNED);
3113 /* If step can be positive, check that nit*step <= type_max-base.
3125 /* If step can be negative, check that nit*(-step) <= base_min-type_min. */
3057 widest_int nit; local
|
| vr-values.cc | 213 /* Return TRUE if STEP * NIT may overflow when calculated in TYPE. */
217 const wide_int &step, const widest_int &nit)
222 nit, sign, &ovf);
285 widest_int nit; local
286 if (!max_loop_iterations (l, &nit))
289 if (!induction_variable_may_overflow_p (type, rstep.lower_bound (), nit))
292 wide_int w = wide_int::from (nit, TYPE_PRECISION (type), TYPE_SIGN (type));
|
| predict.cc | 2004 widest_int nit; local
2049 && estimated_stmt_executions (loop, &nit))
2051 if (wi::gtu_p (nit, max))
2054 nitercst = nit.to_shwi ();
2061 && likely_max_stmt_executions (loop, &nit)
2062 && wi::ltu_p (nit,
2070 nitercst = nit.to_shwi ();
|
| tree-parloops.cc | 2498 without duplication of the loop body. NIT is the number of iterations of the
2505 tree nit)
2531 tree nit_type = TREE_TYPE (nit);
2533 /* Figure out whether nit + 1 overflows. */
2534 if (poly_int_tree_p (nit))
2536 if (!tree_int_cst_equal (nit, TYPE_MAX_VALUE (nit_type)))
2539 nit, build_one_cst (nit_type));
2554 gcc_assert (TREE_CODE (nit) == SSA_NAME);
2556 /* Variable nit is the loop bound as returned by canonicalize_loop_ivs, for an
2562 if (iv_1 < nit)
2976 tree many_iterations_cond, type, nit; local
[all...] |
| tree-ssa-loop-niter.cc | 3326 widest_int nit; local
3362 || (!loop->finite_p && max_loop_iterations (loop, &nit)))
4797 sreal nit; local
4812 && expected_loop_iterations_by_profile (loop, &nit, &reliable)
4815 bound = nit.to_nearest_int ();
4884 /* Sets NIT to the estimated number of executions of the latch of the
4885 LOOP. If CONSERVATIVE is true, we must be sure that NIT is at least as
4890 estimated_loop_iterations (class loop *loop, widest_int *nit)
4897 return (get_estimated_loop_iterations (loop, nit));
4907 widest_int nit; local
4943 widest_int nit; local
4978 widest_int nit; local
4998 HOST_WIDE_INT nit = estimated_loop_iterations_int (loop); local
[all...] |
| tree-ssa-loop-ivopts.cc | 5129 aff_tree step, delta, nit; local
5169 tree_to_aff_combination (niter, TREE_TYPE (niter), &nit);
5170 aff_combination_convert (&nit, steptype);
5171 aff_combination_mult (&nit, &step, &delta);
5341 class aff_tree nit, tmpa, tmpb; local
5398 tree_to_aff_combination (niter->niter, nit_type, &nit);
5401 aff_combination_scale (&nit, -1);
5404 aff_combination_add (&tmpb, &nit);
|
| tree-vect-loop.cc | 1972 widest_int nit; local
1973 if (estimated_stmt_executions (loop->inner, &nit))
1975 = wi::smin (nit, param_vect_inner_loop_cost_factor).to_uhwi ();
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| cfgloop.cc | 145 gcov_type nit = expected_loop_iterations_unbounded (loop, &read_profile_p);
148 (uint64_t) nit);
1956 widest_int nit;
1959 if (!get_estimated_loop_iterations (loop, &nit))
1962 if (!wi::fits_shwi_p (nit))
1964 hwi_nit = nit.to_shwi ();
1976 HOST_WIDE_INT nit = get_max_loop_iterations_int (loop);
1979 if (nit == -1)
1982 snit = (HOST_WIDE_INT) ((unsigned HOST_WIDE_INT) nit + 1);
1995 HOST_WIDE_INT nit = get_likely_max_loop_iterations_int (loop)
144 gcov_type nit = expected_loop_iterations_unbounded (loop, &read_profile_p); local
1955 widest_int nit; local
1975 HOST_WIDE_INT nit = get_max_loop_iterations_int (loop); local
1994 HOST_WIDE_INT nit = get_likely_max_loop_iterations_int (loop); local
2051 widest_int nit; local
2085 widest_int nit; local
[all...] |
| graphite-sese-to-poly.cc | 804 widest_int nit; local
805 if (!max_stmt_executions (loop, &nit))
812 /* NIT is an upper bound to NB_ITERS: "NIT >= NB_ITERS", although we
814 --nit;
816 isl_pw_aff *approx = extract_affine_wi (nit, isl_space_copy (space));
825 isl_val *v = isl_val_int_from_wi (scop->isl_context, nit);
|
| profile.cc | 1553 gcov_type nit = expected_loop_iterations_unbounded (loop);
1554 widest_int bound = gcov_type_to_wide_int (nit);
1552 gcov_type nit = expected_loop_iterations_unbounded (loop); local
|
| tree-scalar-evolution.cc | 3038 widest_int nit;
3062 if (!get_max_loop_iterations (loop, &nit))
3075 nit = wi::add (nit, 1, SIGNED, &overflow);
3079 /* NIT is typeless and can exceed the precision of the type. In this case
3081 if (wi::min_precision (nit, UNSIGNED) > TYPE_PRECISION (type))
3083 wide_int nit2 = wide_int::from (nit, TYPE_PRECISION (type), UNSIGNED);
3085 /* If step can be positive, check that nit*step <= type_max-base.
3097 /* If step can be negative, check that nit*(-step) <= base_min-type_min. */
3031 widest_int nit; local
|
| predict.cc | 1998 widest_int nit; local
2043 && estimated_stmt_executions (loop, &nit))
2045 if (wi::gtu_p (nit, max))
2048 nitercst = nit.to_shwi ();
2055 && likely_max_stmt_executions (loop, &nit)
2056 && wi::ltu_p (nit,
2064 nitercst = nit.to_shwi ();
|
| tree-parloops.cc | 2498 without duplication of the loop body. NIT is the number of iterations of the
2505 tree nit)
2531 tree nit_type = TREE_TYPE (nit);
2533 /* Figure out whether nit + 1 overflows. */
2534 if (TREE_CODE (nit) == INTEGER_CST)
2536 if (!tree_int_cst_equal (nit, TYPE_MAX_VALUE (nit_type)))
2539 nit, build_one_cst (nit_type));
2553 gcc_assert (TREE_CODE (nit) == SSA_NAME);
2555 /* Variable nit is the loop bound as returned by canonicalize_loop_ivs, for an
2561 if (iv_1 < nit)
2975 tree many_iterations_cond, type, nit; local
[all...] |
| tree-ssa-loop-niter.cc | 2925 widest_int nit; local
2938 || max_loop_iterations (loop, &nit))
4380 gcov_type nit = expected_loop_iterations_unbounded (loop); local
4381 bound = gcov_type_to_wide_int (nit);
4447 /* Sets NIT to the estimated number of executions of the latch of the
4448 LOOP. If CONSERVATIVE is true, we must be sure that NIT is at least as
4453 estimated_loop_iterations (class loop *loop, widest_int *nit)
4460 return (get_estimated_loop_iterations (loop, nit));
4470 widest_int nit; local
4473 if (!estimated_loop_iterations (loop, &nit))
4506 widest_int nit; local
4541 widest_int nit; local
4561 HOST_WIDE_INT nit = estimated_loop_iterations_int (loop); local
[all...] |
| vr-values.cc | 1704 widest_int nit; local
1708 if (max_loop_iterations (loop, &nit))
1713 widest_int wtmp = wi::mul (wi::to_widest (step), nit, sgn,
1749 /* Check if init + nit * step overflows. Though we checked
|
| tree-ssa-loop-ivopts.cc | 5080 aff_tree step, delta, nit; local
5120 tree_to_aff_combination (niter, TREE_TYPE (niter), &nit);
5121 aff_combination_convert (&nit, steptype);
5122 aff_combination_mult (&nit, &step, &delta);
5292 class aff_tree nit, tmpa, tmpb; local
5349 tree_to_aff_combination (niter->niter, nit_type, &nit);
5352 aff_combination_scale (&nit, -1);
5355 aff_combination_add (&tmpb, &nit);
|
| tree-vect-loop.cc | 1529 widest_int nit; local
1530 if (estimated_stmt_executions (loop->inner, &nit))
1532 = wi::smin (nit, param_vect_inner_loop_cost_factor).to_uhwi ();
|
