Lines Matching refs:wds
283 Bigint then x->wds >= 1, and either x->wds == 1 or x[wds-1] is nonzero.
297 - wds is the actual number of significant words
299 significant (x[0]) to most significant (x[wds-1]).
305 int k, maxwds, sign, wds;
361 rv->sign = rv->wds = 0;
406 rv->sign = rv->wds = 0;
423 y->wds*sizeof(Long) + 2*sizeof(int))
432 int i, wds;
442 wds = b->wds;
459 while(++i < wds);
461 if (wds >= b->maxwds) {
471 b->x[wds++] = (ULong)carry;
472 b->wds = wds;
496 b->wds = 1;
604 b->wds = 1;
625 if ((!a->x[0] && a->wds == 1) || (!b->x[0] && b->wds == 1)) {
629 c->wds = 1;
634 if (a->wds < b->wds) {
640 wa = a->wds;
641 wb = b->wds;
704 c->wds = wc;
832 if (!k || (!b->x[0] && b->wds == 1))
837 n1 = n + b->wds + 1;
849 xe = x + b->wds;
864 b1->wds = n1 - 1;
878 i = a->wds;
879 j = b->wds;
882 Bug("cmp called with a->x[a->wds-1] == 0");
884 Bug("cmp called with b->x[b->wds-1] == 0");
923 c->wds = 1;
939 wa = a->wds;
942 wb = b->wds;
978 c->wds = wa;
1007 xa = xa0 + a->wds;
1065 b->wds = 2;
1099 b->wds = 1;
1138 b->wds = (x[1] = z) ? 2 : 1;
1144 b->wds = 1;
1169 k = ka - kb + 32*(a->wds - b->wds);
1205 int rv = hi0bits(b->x[b->wds-1]) - 4;
1227 n = S->wds;
1229 /*debug*/ if (b->wds > n)
1232 if (b->wds < n)
1270 b->wds = n;
1304 b->wds = n;
1470 if (!b->x[0] && b->wds == 1) {
2028 if (!delta->x[0] && delta->wds <= 1) {
2808 if (!b->x[0] && b->wds <= 1) {
2857 if (!b->x[0] && b->wds <= 1) {
