49 increment(b) Bigint *b;  in increment()  argument
51 increment(Bigint *b)
60 	x = b->x;
61 	xe = x + b->wds;
66 			return b;
76 			return b;
81 		if (b->wds >= b->maxwds) {
82 			b1 = Balloc(b->k+1);
85 			Bcopy(b1,b);
86 			Bfree(b);
87 			b = b1;
89 		b->x[b->wds++] = 1;
91 	return b;
96 decrement(b) Bigint *b;  in decrement()  argument
98 decrement(Bigint *b)
106 	x = b->x;
107 	xe = x + b->wds;
128 all_on(b, n) Bigint *b; int n;  in all_on()  argument
130 all_on(Bigint *b, int n)
135 	x = b->x;
147 set_ones(b, n) Bigint *b; int n;  in set_ones()  argument
149 set_ones(Bigint *b, int n)
156 	if (b->k < k) {
157 		Bfree(b);
158 		b = Balloc(k);
159 		if (b == NULL)
165 	b->wds = k;
166 	x = b->x;
172 	return b;
184 	Bigint *b;  local
189 	b = d2b(dval(d), &e, &bdif);
190 	if (b == NULL) {
227 			if (b->x[0] & 2)
231 		if (b->x[k>>kshift] & ((ULong)1 << (k & kmask)))
240 		if ( (lostbits = any_on(b, bdif)) !=0)
242 		rshift(b, bdif);
245 			b = increment(b);
246 			if (b == NULL) {
252 			if (hi0bits(b->x[b->wds - 1]) != j) {
254 					lostbits = b->x[0] & 1;
255 				rshift(b, 1);
261 		b = lshift(b, -bdif);
262 		if (b == NULL) {
271 			b->wds = inex = 0;
277 				lostbits = any_on(b, k1);
281 			  carry = b->x[k1>>kshift] & (1 << (k1 & kmask));
282 			rshift(b, k);
285 				b = increment(b);
286 				if (b == NULL) {
302 		b->wds = inex = 0;
305 	copybits(bits, nb, b);
309 	Bfree(b);
354 	ULong *b, *be, y, z;  local
1106 		b = bits;
1107 		be = b + ((fpi->nbits + 31) >> 5);
1108 		while(b < be)
1109 			*b++ = -1;