Searched refs:smax (Results 1 - 20 of 20) sorted by relevance

/freebsd-11-stable/lib/libc/string/
H A Dmemset_s.c37 memset_s(void *s, rsize_t smax, int c, rsize_t n) argument
45 lim = n < smax ? n : smax;
50 } else if (smax > RSIZE_MAX) {
51 __throw_constraint_handler_s("memset_s : smax > RSIZE_MAX",
58 if (n > smax) {
59 __throw_constraint_handler_s("memset_s : n > smax",
/freebsd-11-stable/tools/regression/p1003_1b/
H A Dsched.c64 int smax; local
71 if ( (smax = sched_get_priority_max(sched)) == -1 && errno)
74 if (smax - smin + 1 < 32 || smax < smin) {
76 sched_text(sched), smin, smax);
82 sched_text(sched), smin, smax);
/freebsd-11-stable/contrib/apr-util/misc/
H A Dapr_reslist.c48 int smax; /* soft maximum on the total number of resources */ member in struct:apr_reslist_t
223 while (reslist->nidle > reslist->smax && reslist->nidle > 0) {
252 int min, int smax, int hmax,
264 if (min < 0 || min > smax || min > hmax || smax > hmax || hmax == 0 ||
274 if (smax > 0) {
275 smax = 1;
283 rl->smax = smax;
/freebsd-11-stable/contrib/apr-util/include/
H A Dapr_reslist.h72 * @param smax Resources will be destroyed during reslist maintenance to
86 * automatically set to 1 and values of min and smax will be forced to
90 int min, int smax, int hmax,
H A Dapr_memcache.h210 * @param smax soft maximum number of client connections to open
215 * @remark min, smax, and max are only used when APR_HAS_THREADS
221 apr_uint32_t smax,
H A Dapr_redis.h222 * @param smax soft maximum number of client connections to open
228 * @remark min, smax, and max are only used when APR_HAS_THREADS
234 apr_uint32_t smax,
/freebsd-11-stable/contrib/ncurses/form/
H A Dfrm_def.c241 form->page[page_nr].smax = fld->sprev->index;
246 form->page[page_nr].smax = 0;
H A Dform.h64 short smax; /* index of bottom rightmost field on page */ member in struct:__anon4623
H A Dfrm_driver.c3689 Sorted_Next_Field(form->field[form->page[form->curpage].smax])));
/freebsd-11-stable/contrib/apr-util/dbm/sdbm/
H A Dsdbm.c309 register int smax = SPLTMAX; local
364 } while (--smax);
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/
H A DConstantRange.h368 ConstantRange smax(const ConstantRange &Other) const;
/freebsd-11-stable/contrib/elftoolchain/libelf/
H A Delf_update.c371 const uint64_t smax = start + size; local
385 } else if (smax <= tmin) {
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/
H A DConstantRange.cpp988 ConstantRange::smax(const ConstantRange &Other) const {
989 // X smax Y is: range(smax(X_smin, Y_smin),
990 // smax(X_smax, Y_smax))
993 APInt NewL = APIntOps::smax(getSignedMin(), Other.getSignedMin());
994 APInt NewU = APIntOps::smax(getSignedMax(), Other.getSignedMax()) + 1;
1457 // a s+ b overflows high iff a s>=0 && b s>= 0 && a s> smax - b.
1503 // a s- b overflows high iff a s>=0 && b s< 0 && a s> smax + b.
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLowerSwitch.cpp508 APInt Max = APIntOps::smax(ValRange.getSignedMax(), High);
/freebsd-11-stable/contrib/apr-util/redis/
H A Dapr_redis.c429 apr_uint32_t smax,
460 smax, /* soft maximum */
/freebsd-11-stable/contrib/apr-util/memcache/
H A Dapr_memcache.c401 apr_uint32_t min, apr_uint32_t smax,
425 smax, /* soft maximum */
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DAPInt.h2167 inline const APInt &smax(const APInt &A, const APInt &B) {
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DConstantFolding.cpp2330 Product = APIntOps::smax(Product, MinValue);
H A DLazyValueInfo.cpp909 return TrueCR.smax(FalseCR);
H A DScalarEvolution.cpp300 case scSMaxExpr: OpStr = " smax "; break;
3585 return APIntOps::smax(LHS, RHS);
3668 assert(!Ops.empty() && "Reduced smax down to nothing!");
5348 // Try to match some simple smax or umax patterns.
5363 // a >s b ? a+x : b+x -> smax(a, b)+x
5610 X = X.smax(getRangeRef(SMax->getOperand(i), SignHint));
8202 break; // TODO: smax, umax, smin, umax.
10623 StrideForMaxBECount = APIntOps::smax(One, StrideForMaxBECount);
10844 IsSigned ? APIntOps::smax(getSignedRangeMin(RHS), Limit)

Completed in 329 milliseconds