Searched refs:le (Results 1 - 16 of 16) sorted by relevance
/barrelfish-2018-10-04/lib/cxx/cxx/ |
H A D | stdexcept.cpp | 42 logic_error::logic_error(const logic_error& le) _NOEXCEPT : __imp_(le.__imp_) 47 logic_error::operator=(const logic_error& le) _NOEXCEPT 49 __imp_ = le.__imp_; 75 runtime_error::runtime_error(const runtime_error& le) _NOEXCEPT 76 : __imp_(le.__imp_) 81 runtime_error::operator=(const runtime_error& le) _NOEXCEPT 83 __imp_ = le.__imp_;
|
/barrelfish-2018-10-04/lib/compiler-rt/builtins/arm/ |
H A D | aeabi_dcmp.S | 12 // int __aeabi_dcmp{eq,lt,le,ge,gt}(double a, double b) { 13 // int result = __{eq,lt,le,ge,gt}df2(a, b); 38 DEFINE_AEABI_DCMP(le)
|
H A D | aeabi_fcmp.S | 12 // int __aeabi_fcmp{eq,lt,le,ge,gt}(float a, float b) { 13 // int result = __{eq,lt,le,ge,gt}sf2(a, b); 38 DEFINE_AEABI_FCMP(le)
|
/barrelfish-2018-10-04/lib/bulk_transfer/ |
H A D | bulk_allocator.c | 99 struct bulk_buffer_mng *le = alloc->mngs + i; local 100 le->buffer = buf; 101 le->next = alloc->free_buffers; 102 alloc->free_buffers = le;
|
/barrelfish-2018-10-04/lib/acpica/tests/aslts/bin/ |
H A D | common | 541 if [ $RAWHOURS -le 9 ]; then 549 if [ $RAWMINUTES -le 9 ]; then 555 if [ $RAWSECONDS -le 9 ]; then 561 if [ $RAWCENTISECS -le 9 ]; then
|
H A D | Do | 447 if [ $nparam -le 1 ]; then 458 if [ $nparam -le 2 ]; then
|
/barrelfish-2018-10-04/lib/lua/src/ |
H A D | lauxlib.c | 103 int li = 1, le = 1; local 105 while (lua_getstack(L, le, &ar)) { li = le; le *= 2; } 107 while (li < le) { 108 int m = (li + le)/2; 110 else le = m; 112 return le - 1;
|
/barrelfish-2018-10-04/lib/libc/arm/aeabi/ |
H A D | aeabi_vfp_float.S | 109 ite le
|
H A D | aeabi_vfp_double.S | 117 ite le
|
/barrelfish-2018-10-04/usr/eclipseclp/ |
H A D | BUILD_ROTD | 1044 while [ "$n" -le "$NUM_INSTALLS" ] ; do 1224 while [ "$n" -le "$NUM_TESTS" ] ; do 1498 while [ $n -le $NUM_TESTS ] ; do 1546 while [ $n -le $NUM_TESTS ] ; do 1956 while [ "$n" -le "$NUM_INSTALLS" ] ; do 1962 while [ "$n" -le "$NUM_TESTS" ] ; do
|
/barrelfish-2018-10-04/usr/eclipseclp/lib_tcl/ |
H A D | tkinspect.tcl | 263 foreach {yfollow le re te be} [$h yfollowstate] { 265 set tkinspectvalues(ysle,$iw) [expr round($le*100)] 297 grid [scale $xf.le -label "% from left edge" -from 0 -to 50 -length 200 \ 327 set le [expr $tkinspectvalues(ysle,$iw).0/100] 331 $h yfollowitem $le $re $te $be
|
/barrelfish-2018-10-04/lib/tommath/ |
H A D | tommath.tex | 310 the range $0 \le x < q \beta$ while a double precision variable must be able to represent integers in the range 311 $0 \le x < q \beta^2$. The extra radix-$q$ factor allows additions and subtractions to proceed without truncation of the 325 range $0 \le x < 10^3$, while a double precision data type may represent a value in the range $0 \le x < 10^5$. Let 782 a subsequent expression (or body of expressions) are to be evaluated upto $c - b$ times so long as $b \le c$. In each 1714 in $\mu$ and finally the digit of the result $c_n$ is truncated within the range $0 \le c_n < \beta$. 1754 the range $0 \le x < 2\beta$ for the algorithms to work correctly. However, it is allowable that a mp\_digit represent a larger range of values. For 1759 data type must be able to represent $0 \le x < 2^{32}$ meaning that in this case $\gamma \ge 32$. 2154 1. If $b \le 0$ then return(\textit{MP\_OKAY}). \\ 2180 $b \le [all...] |
H A D | bn.tex | 229 \hline Moduli $\le 2560$ bits & BN\_MP\_MONTGOMERY\_REDUCE\_C \\ 1059 Which will divide $a$ by $2^b$, store the quotient in ``c'' and the remainder in ``d'. If $b \le 0$ then the 1284 Of particular interest to cryptography are reductions where $b$ is limited to the range $0 \le b < c^2$ since particularly 1299 of $b$. This algorithm accepts an input $a$ of any range and is not limited by $0 \le a < b^2$. 1320 $0 \le a < b^2$. 1393 $0 \le a < b^2$. 1516 dimminished radix form and $a$ must be in the range $0 \le a < b^2$. Dimminished radix reductions are 1576 This computes $c = a^{1/b}$ such that $c^b \le a$ and $(c+1)^b > a$. The implementation of this function is not 1642 $1 \le t < PRIME\_SIZE$ where $PRIME\_SIZE$ is the number of primes in the prime number table (by default this is $256$).
|
/barrelfish-2018-10-04/usr/eclipseclp/config/ |
H A D | config.sub | 295 | sh | sh[1234] | sh[24]a | sh[24]aeb | sh[23]e | sh[34]eb | sheb | shbe | shle | sh[1234]le | sh3ele \ 391 | shle-* | sh[1234]le-* | sh3ele-* | sh64-* | sh64le-* \ 957 ppcle | powerpclittle | ppc-le | powerpc-little) 967 ppc64le | powerpc64little | ppc64-le | powerpc64-little) 1231 sh[1234] | sh[24]a | sh[24]aeb | sh[34]eb | sh[1234]le | sh[23]ele)
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/bn/asm/ |
H A D | ia64.S | 176 cmp4.le p6,p0=r35,r0 };; 229 cmp4.le p6,p0=r35,r0 };; 293 cmp4.le p6,p0=r34,r0 402 cmp4.le p6,p0=r34,r0 471 { .mii; cmp.le p6,p0=r34,r0
|
/barrelfish-2018-10-04/usr/eclipseclp/Shm/src/ |
H A D | configure | 4172 if test $ac_lo -le $ac_mid; then 4270 if test $ac_mid -le $ac_hi; then 4586 if test $ac_lo -le $ac_mid; then 4684 if test $ac_mid -le $ac_hi; then 5000 if test $ac_lo -le $ac_mid; then 5098 if test $ac_mid -le $ac_hi; then
|
Completed in 255 milliseconds