Searched refs:oldused (Results 1 - 6 of 6) sorted by relevance
| /barrelfish-2018-10-04/lib/tommath/ |
| H A D | bn_mp_div_2.c | 21 int x, res, oldused; local
30 oldused = b->used;
56 for (x = b->used; x < oldused; x++) {
|
| H A D | bn_mp_mul_2.c | 21 int x, res, oldused; local
30 oldused = b->used;
71 for (x = b->used; x < oldused; x++) {
|
| H A D | bn_mp_add_d.c | 22 int res, ix, oldused; local
50 oldused = c->used;
93 /* setup count so the clearing of oldused
99 /* now zero to oldused */
100 while (ix++ < oldused) {
|
| H A D | bn_mp_sub_d.c | 23 int res, ix, oldused; local
47 oldused = c->used;
82 while (ix++ < oldused) {
|
| H A D | tommath.tex | 1671 4. $oldused \leftarrow c.used$ \\
1685 \hspace{+3mm}10.1 for $n$ from $max + 1$ to $oldused - 1$ do \\
1720 The final carry is stored in $c_{max}$ and digits above $max$ upto $oldused$ are zeroed which completes the addition.
1772 4. $oldused \leftarrow c.used$ \\
1784 9. if $oldused > max$ then do \\
1785 \hspace{3mm}9.1 for $n$ from $max$ to $oldused - 1$ do \\
2032 2. $oldused \leftarrow b.used$ \\
2042 7. If $b.used < oldused - 1$ then do \\
2043 \hspace{3mm}7.1 for $n$ from $b.used$ to $oldused - 1$ do \\
2094 3. $oldused \leftarro
[all...] |
| /barrelfish-2018-10-04/lib/tommath/pre_gen/ |
| H A D | mpi.c | 354 /* zero oldused digits, if the input a was larger than
889 int res, ix, oldused; local
917 oldused = c->used;
960 /* setup count so the clearing of oldused
966 /* now zero to oldused */
967 while (ix++ < oldused) {
1872 int x, res, oldused; local
1881 oldused = b->used;
1907 for (x = b->used; x < oldused; x++) {
5011 int x, res, oldused; local
7551 int res, ix, oldused; local
[all...] |
Completed in 105 milliseconds