/barrelfish-2018-10-04/lib/libc/iconv/ |
H A D | _strtol.h | 50 __INT acc, cutoff; local 94 * Compute the cutoff value between legal numbers and illegal 102 * cutoff will be set to 214748364 and cutlim to either 110 cutoff = (neg ? __INT_MIN : __INT_MAX); 111 cutlim = (int)(cutoff % base); 112 cutoff /= base; 116 cutoff += 1; 132 if (acc < cutoff || (acc == cutoff && i > cutlim)) { 147 if (acc > cutoff || (ac [all...] |
H A D | _strtoul.h | 49 __UINT acc, cutoff; local 92 cutoff = __UINT_MAX / (__UINT)base; 105 if (acc > cutoff || (acc == cutoff && i > cutlim)) {
|
H A D | citrus_prop.c | 82 _type_ acc, cutoff; \ 87 cutoff = _max_ / base; \ 94 if (acc > cutoff || (acc == cutoff && n > cutlim)) \
|
/barrelfish-2018-10-04/lib/libc/locale/ |
H A D | wcstol.c | 55 unsigned long cutoff; local 86 cutoff = neg ? (unsigned long)-(LONG_MIN + LONG_MAX) + LONG_MAX 88 cutlim = cutoff % base; 89 cutoff /= base; 106 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
|
H A D | wcstoll.c | 61 unsigned long long cutoff; local 92 cutoff = neg ? (unsigned long long)-(LLONG_MIN + LLONG_MAX) + LLONG_MAX 94 cutlim = cutoff % base; 95 cutoff /= base; 112 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
|
H A D | wcstoimax.c | 61 uintmax_t cutoff; local 92 cutoff = neg ? (uintmax_t)-(INTMAX_MIN + INTMAX_MAX) + INTMAX_MAX 94 cutlim = cutoff % base; 95 cutoff /= base; 112 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
|
H A D | wcstoul.c | 55 unsigned long cutoff; local 86 cutoff = ULONG_MAX / base; 104 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
|
H A D | wcstoull.c | 61 unsigned long long cutoff; local 92 cutoff = ULLONG_MAX / base; 110 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
|
H A D | wcstoumax.c | 61 uintmax_t cutoff; local 92 cutoff = UINTMAX_MAX / base; 110 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
|
/barrelfish-2018-10-04/lib/libc/stdlib/ |
H A D | strtoimax.c | 60 uintmax_t cutoff; local 97 * Compute the cutoff value between legal numbers and illegal 105 * is 10, cutoff will be set to 922337203685477580 and cutlim to 114 cutoff = neg ? (uintmax_t)-(INTMAX_MIN + INTMAX_MAX) + INTMAX_MAX 116 cutlim = cutoff % base; 117 cutoff /= base; 129 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
|
H A D | strtol.c | 61 unsigned long cutoff; local 98 * Compute the cutoff value between legal numbers and illegal 106 * cutoff will be set to 214748364 and cutlim to either 114 cutoff = neg ? (unsigned long)-(LONG_MIN + LONG_MAX) + LONG_MAX 116 cutlim = cutoff % base; 117 cutoff /= base; 129 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
|
H A D | strtoll.c | 60 unsigned long long cutoff; local 97 * Compute the cutoff value between legal numbers and illegal 105 * is 10, cutoff will be set to 922337203685477580 and cutlim to 114 cutoff = neg ? (unsigned long long)-(LLONG_MIN + LLONG_MAX) + LLONG_MAX 116 cutlim = cutoff % base; 117 cutoff /= base; 129 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
|
H A D | strtoul.c | 59 unsigned long cutoff; local 93 cutoff = ULONG_MAX / base; 106 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
|
H A D | strtoull.c | 60 unsigned long long cutoff; local 94 cutoff = ULLONG_MAX / base; 107 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
|
H A D | strtoumax.c | 60 uintmax_t cutoff; local 94 cutoff = UINTMAX_MAX / base; 107 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/x509v3/ |
H A D | v3_ocsp.c | 185 static int i2r_ocsp_acutoff(const X509V3_EXT_METHOD *method, void *cutoff, argument 189 if(!ASN1_GENERALIZEDTIME_print(bp, cutoff)) return 0;
|
/barrelfish-2018-10-04/usr/eclipseclp/GecodeInterface/ |
H A D | gfd.hpp | 276 o.cutoff = Search::Cutoff::constant(ULONG_MAX); 280 // cutoff and nogoods limit set already for o
|
H A D | gfd.cpp | 4837 Search::Cutoff* cutoff; \ 4844 cutoff = Search::Cutoff::geometric((unsigned long)l,b); \ 4848 cutoff = Search::Cutoff::luby((unsigned long)l); \ 4859 cutoff = Search::Cutoff::rnd(seed,min,max,l); \ 4863 cutoff = Search::Cutoff::constant((unsigned int)l); \ 4867 cutoff = Search::Cutoff::linear((unsigned int)l); \ 4869 o.cutoff = cutoff; \ 5171 o.cutoff = Search::Cutoff::constant(ULONG_MAX);
|
/barrelfish-2018-10-04/usr/eclipseclp/ecrc_solvers/ |
H A D | r.pl | 1559 :- meta_attribute(cutoff, [unify:cutoff_handler/2]). 1564 user_variable(_{cutoff:user(_Object)}) ?- true. 1566 object_variable(_{cutoff:object(_User)}) ?- true. 1569 get_object_variable(_{cutoff:user(Vo)}, Vo1) ?- 1572 get_user_variable(_{cutoff:object(V)}, V1) ?- 1576 add_attribute(V, user(Vo), cutoff), 1577 add_attribute(Vo, object(V), cutoff). 1580 r_notify_constrained(_{cutoff:object(User)}) ?- 1597 add_attribute(Value, object(UserV), cutoff)
|
/barrelfish-2018-10-04/usr/eclipseclp/Eplex/ |
H A D | coinplex.cpp | 266 1 linear relaxation not feasible (or worse than cutoff) 1529 int coin_get_mipcutoff(COINprob* lp, double* cutoff) argument 1534 *cutoff = (lp->Solver->getObjSense() == 1 ? mip->getCutoff() : -1.0*mip->getCutoff()); 1536 *cutoff = (lp->Solver->getObjSense() == 1 ? lp->Solver->getInfinity() : -1.0*lp->Solver->getInfinity());
|
/barrelfish-2018-10-04/lib/tommath/ |
H A D | bn.tex | 1238 actually faster than Comba until you hit distinct ``cutoff'' points. For Karatsuba with the default configuration, 1239 GCC 3.3.1 and an Athlon XP processor the cutoff point is roughly 110 digits (about 70 for the Intel P4). That is, at 1242 Toom-Cook has incredible overhead and is probably only useful for very large inputs. So far no known cutoff points 1243 exist and for the most part I just set the cutoff points very high to make sure they're not called. 1245 A demo program in the ``etc/'' directory of the project called ``tune.c'' can be used to find the cutoff points. This 1270 When the program is running it will output a series of measurements for different cutoff points. It will first find 1272 tuning takes a very long time as the cutoff points are likely to be very high.
|
H A D | tommath.tex | 2904 the cutoff point $y$ will be. 2911 influence over the cutoff point. 2915 A clean cutoff point separation occurs when a point $y$ is found such that all of the cutoff point conditions are met. For example, if the point 2916 is too low then there will be values of $m$ such that $m > y$ and the Comba method is still faster. Finding the cutoff points is fairly simple when 2942 of this system of equations has made Karatsuba fairly popular. In fact the cutoff point is often fairly low\footnote{With LibTomMath 0.18 it is 70 and 109 digits for the Intel P4 and AMD Athlon respectively.} 3052 the algorithm can be faster than a baseline multiplication. However, the greater complexity of this algorithm places the cutoff point 3053 (\textbf{TOOM\_MUL\_CUTOFF}) where Toom-Cook becomes more efficient much higher than the Karatsuba cutoff point. 3153 algorithm is not practical as Karatsuba has a much lower cutoff point. 3427 instead? The answer to this arises from the cutoff poin [all...] |