Lines Matching refs:wds
300 Bigint then x->wds >= 1, and either x->wds == 1 or x[wds-1] is nonzero.
314 - wds is the actual number of significant words
316 significant (x[0]) to most significant (x[wds-1]).
322 int k, maxwds, sign, wds;
378 rv->sign = rv->wds = 0;
423 rv->sign = rv->wds = 0;
440 y->wds*sizeof(Long) + 2*sizeof(int))
449 int i, wds;
459 wds = b->wds;
476 while(++i < wds);
478 if (wds >= b->maxwds) {
488 b->x[wds++] = (ULong)carry;
489 b->wds = wds;
513 b->wds = 1;
621 b->wds = 1;
642 if ((!a->x[0] && a->wds == 1) || (!b->x[0] && b->wds == 1)) {
646 c->wds = 1;
651 if (a->wds < b->wds) {
657 wa = a->wds;
658 wb = b->wds;
721 c->wds = wc;
849 if (!k || (!b->x[0] && b->wds == 1))
854 n1 = n + b->wds + 1;
866 xe = x + b->wds;
881 b1->wds = n1 - 1;
895 i = a->wds;
896 j = b->wds;
899 Bug("cmp called with a->x[a->wds-1] == 0");
901 Bug("cmp called with b->x[b->wds-1] == 0");
940 c->wds = 1;
956 wa = a->wds;
959 wb = b->wds;
995 c->wds = wa;
1024 xa = xa0 + a->wds;
1082 b->wds = 2;
1116 b->wds = 1;
1155 b->wds = (x[1] = z) ? 2 : 1;
1161 b->wds = 1;
1186 k = ka - kb + 32*(a->wds - b->wds);
1222 int rv = hi0bits(b->x[b->wds-1]) - 4;
1244 n = S->wds;
1246 /*debug*/ if (b->wds > n)
1249 if (b->wds < n)
1287 b->wds = n;
1321 b->wds = n;
1487 if (!b->x[0] && b->wds == 1) {
2059 if (!delta->x[0] && delta->wds <= 1) {
2839 if (!b->x[0] && b->wds <= 1) {
2888 if (!b->x[0] && b->wds <= 1) {
