Lines Matching defs:hibound
1827 caddr_t hibound = lobound + *lenp;
1846 * This increases the chance that hibound will be adjusted to
1886 * use a_lastgap's base as a better estimate of hibound.
1890 hibound >= as->a_lastgap->s_base)
1891 hibound = as->a_lastgap->s_base;
1893 hseg = as_findseg(as, hibound, 1);
1894 if (hseg->s_base + hseg->s_size < hibound) {
1905 * use MAXADDR in place of hibound in the expression below,
1906 * but can't express it easily; using hibound in its place is
1910 hi = (hseg == NULL) ? hibound : hseg->s_base;
1913 * to hibound it's pointless to continue.
1915 if ((forward && lo > hibound) || (!forward && hi < lobound))
1917 else if (lo > hibound || hi < lobound)
1922 * i.e., to [max(lo, lobound), min(hi, hibound)].
1926 if (hi > hibound)
1927 hi = hibound;