Searched refs:quotient (Results 1 - 23 of 23) sorted by path

/barrelfish-2018-10-04/kernel/
H A Dmicrobenchmarks.c26 static uint64_t divide_round(uint64_t quotient, uint64_t divisor) argument
28 if ((quotient % divisor) * 2 >= divisor) {
30 return (quotient / divisor) + 1;
32 return (quotient / divisor);
/barrelfish-2018-10-04/lib/compiler-rt/builtins/arm/
H A Ddivmodsi4.S28 @ Calculate the quotient and remainder of the (signed) division. The return
29 @ value is the quotient, the remainder is placed in the variable.
46 // Set aside the sign of the quotient and modulus, and the address for the
58 // Apply the sign of quotient and modulus
H A Ddivsi3.S31 @ Calculate and return the quotient of the (signed) division.
44 // Set aside the sign of the quotient.
53 // Apply sign of quotient to result and return.
H A Dudivmodsi4.S22 @ Calculate the quotient and remainder of the (unsigned) division. The return
23 @ value is the quotient, the remainder is placed in the variable.
52 * block(shift) implements the test-and-update-quotient core.
54 * that (r0 << shift) < 2 * r1. The quotient is stored in r3.
H A Dudivsi3.S24 @ Calculate and return the quotient of the (unsigned) division.
52 * block(shift) implements the test-and-update-quotient core.
54 * that (r0 << shift) < 2 * r1. The quotient is stored in r3.
/barrelfish-2018-10-04/lib/compiler-rt/builtins/
H A Ddivdf3.c135 rep_t quotient, quotientLo; local
136 wideMultiply(aSignificand << 2, reciprocal, &quotient, &quotientLo);
138 // Two cases: quotient is in [0.5, 1.0) or quotient is in [1.0, 2.0).
149 // We also take this time to right shift quotient if it falls in the [1,2)
152 if (quotient < (implicitBit << 1)) {
153 residual = (aSignificand << 53) - quotient * bSignificand;
156 quotient >>= 1;
157 residual = (aSignificand << 52) - quotient * bSignificand;
176 rep_t absResult = quotient
[all...]
H A Ddivsf3.c121 rep_t quotient = (uint64_t)reciprocal*(aSignificand << 1) >> 32; local
123 // Two cases: quotient is in [0.5, 1.0) or quotient is in [1.0, 2.0).
134 // We also take this time to right shift quotient if it falls in the [1,2)
137 if (quotient < (implicitBit << 1)) {
138 residual = (aSignificand << 24) - quotient * bSignificand;
141 quotient >>= 1;
142 residual = (aSignificand << 23) - quotient * bSignificand;
161 rep_t absResult = quotient & significandMask;
H A Ddivtf3.c149 rep_t quotient, quotientLo; local
150 wideMultiply(aSignificand << 2, reciprocal, &quotient, &quotientLo);
152 // Two cases: quotient is in [0.5, 1.0) or quotient is in [1.0, 2.0).
163 // We also take this time to right shift quotient if it falls in the [1,2)
168 if (quotient < (implicitBit << 1)) {
169 wideMultiply(quotient, bSignificand, &dummy, &qb);
173 quotient >>= 1;
174 wideMultiply(quotient, bSignificand, &dummy, &qb);
192 rep_t absResult = quotient
[all...]
/barrelfish-2018-10-04/lib/openssl-1.0.0d/MacOS/GetHTTPS.src/
H A DCPStringUtils.cpp755 unsigned long tempNum,quotient,remainder; local
789 quotient = tempNum / 10;
791 remainder = tempNum - (quotient * 10);
797 tempNum = quotient;
/barrelfish-2018-10-04/lib/tommath/
H A Dbn.tex1059 Which will divide $a$ by $2^b$, store the quotient in ``c'' and the remainder in ``d'. If $b \le 0$ then the
1145 This divides $a$ by $b$ and stores the quotient in $c$ and $d$. The signed quotient is computed such that
H A Dtommath.tex2376 This algorithm will divide an input $a$ by $2^b$ and produce the quotient and remainder. The algorithm is designed much like algorithm
2390 the quotient is obtained.
3673 Provided that $2^q \ge a$ this algorithm will produce a quotient that is either exactly correct or off by a value of one. In the context of Barrett
3677 Let $n$ represent the number of digits in $b$. This algorithm requires approximately $2n^2$ single precision multiplications to produce the quotient and
3682 $a = 180388626447$ modulo $b$ using the above reduction equation. The quotient using the new formula is $\lfloor (a \cdot \mu) / 2^q \rfloor = 152913$.
3689 the initial multiplication that finds the quotient.
3694 $m - 1$'th digit of $a$ will contribute at most a value of $1$ to the quotient because $\beta^k < b$ for any $0 \le k \le m - 1$. Another way to
3696 ${a \over b} \equiv {{a' + a''} \over b}$ which is equivalent to ${a' \over b} + {a'' \over b}$. Since $a'$ is bound to be less than $b$ the quotient
3699 Since the digits of $a'$ do not contribute much to the quotient the observation is that they might as well be zero. However, if the digits
3709 would have the exponent $2m$ so in the end the exponents do ``add up''. Using the above equation the quotient
[all...]
/barrelfish-2018-10-04/usr/bench/
H A Dbench.c80 divide_round(uint64_t quotient, uint64_t divisor) argument
82 if ((quotient % divisor) * 2 >= divisor) {
84 return (quotient / divisor) + 1;
86 return (quotient / divisor);
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/
H A Ddistfix.pl471 e.g. p(X,[by],p(Y,[giving,quotient],p(Q,[and,remainder],p(R,99)))).
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/
H A Dbip_db.c662 Push_Struct_Frame(d_.quotient);
1102 Push_Struct_Frame(d_.quotient);
1249 Push_Struct_Frame(d_.quotient);
1716 if (IsStructure(t1) && v1.ptr->val.did == d_.quotient)
1745 if (IsStructure(t2) && v2.ptr->val.did == d_.quotient)
1815 pwd[0].val.did = d_.quotient;
1976 Push_Struct_Frame(d_.quotient);
3115 Push_Struct_Frame(d_.quotient);
3130 Push_Struct_Frame(d_.quotient);
H A Dbip_io.c2959 if (IsStructure(taddr) && vaddr.ptr->val.did == d_.quotient)
3012 pw[0].val.did = d_.quotient;
3097 if (!IsStructure(taddr) || vaddr.ptr->val.did != d_.quotient)
3249 pw[0].val.did = d_.quotient;
H A Dbip_load.c870 if(p->val.did == d_.quotient)
H A Dbip_module.c202 || vb.ptr->val.did != d_.quotient))
222 ptr[0].val.did = d_.quotient;
H A Ddict.c1141 d_.quotient = in_dict("/",2);
H A Declipse_cc.cc626 OP2(operator/, ec_.d.quotient)
H A Dhandlers.c1133 if (vh.ptr->val.did != d_.quotient) {Bip_Error(TYPE_ERROR); }
1180 Push_Struct_Frame(d_.quotient);
1209 if (vh.ptr->val.did != d_.quotient) {Bip_Error(TYPE_ERROR); }
1234 Push_Struct_Frame(d_.quotient);
H A Dproc_desc.c397 Push_Struct_Frame(d_.quotient); ++tg;
H A Dsepia.h1112 if (IsStructure(t) && v.ptr->val.did == d_.quotient)\
1138 if (IsStructure(t) && v.ptr->val.did == d_.quotient)\
H A Dtypes.h957 quotient, member in struct:__anon1659

Completed in 195 milliseconds