63 BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w)  in BN_mod_word()  argument
72 	if (w == 0)  in BN_mod_word()
76 	w&=BN_MASK2;  in BN_mod_word()
80 		ret=((ret<<BN_BITS4)|((a->d[i]>>BN_BITS4)&BN_MASK2l))%w;  in BN_mod_word()
81 		ret=((ret<<BN_BITS4)|(a->d[i]&BN_MASK2l))%w;  in BN_mod_word()
84 			(BN_ULLONG)w);  in BN_mod_word()
90 BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w)  in BN_div_word()  argument
96 	w &= BN_MASK2;  in BN_div_word()
98 	if (!w)  in BN_div_word()
105 	j = BN_BITS2 - BN_num_bits_word(w);  in BN_div_word()
106 	w <<= j;  in BN_div_word()
115 		d=bn_div_words(ret,l,w);  in BN_div_word()
116 		ret=(l-((d*w)&BN_MASK2))&BN_MASK2;  in BN_div_word()
126 int BN_add_word(BIGNUM *a, BN_ULONG w)  in BN_add_word()  argument
132 	w &= BN_MASK2;  in BN_add_word()
135 	if (!w) return 1;  in BN_add_word()
137 	if(BN_is_zero(a)) return BN_set_word(a, w);  in BN_add_word()
142 		i=BN_sub_word(a,w);  in BN_add_word()
147 	for (i=0;w!=0 && i<a->top;i++)  in BN_add_word()
149 		a->d[i] = l = (a->d[i]+w)&BN_MASK2;  in BN_add_word()
150 		w = (w>l)?1:0;  in BN_add_word()
152 	if (w && i==a->top)  in BN_add_word()
156 		a->d[i]=w;  in BN_add_word()
162 int BN_sub_word(BIGNUM *a, BN_ULONG w)  in BN_sub_word()  argument
167 	w &= BN_MASK2;  in BN_sub_word()
170 	if (!w) return 1;  in BN_sub_word()
174 		i = BN_set_word(a,w);  in BN_sub_word()
183 		i=BN_add_word(a,w);  in BN_sub_word()
188 	if ((a->top == 1) && (a->d[0] < w))  in BN_sub_word()
190 		a->d[0]=w-a->d[0];  in BN_sub_word()
197 		if (a->d[i] >= w)  in BN_sub_word()
199 			a->d[i]-=w;  in BN_sub_word()
204 			a->d[i]=(a->d[i]-w)&BN_MASK2;  in BN_sub_word()
206 			w=1;  in BN_sub_word()
215 int BN_mul_word(BIGNUM *a, BN_ULONG w)  in BN_mul_word()  argument
220 	w&=BN_MASK2;  in BN_mul_word()
223 		if (w == 0)  in BN_mul_word()
227 			ll=bn_mul_words(a->d,a->d,a->top,w);  in BN_mul_word()