Lines Matching refs:bn
46 #include <bn.h>
59 BN_free(BIGNUM *bn)
61 BN_clear(bn);
62 free(bn);
66 BN_clear(BIGNUM *bn)
68 heim_integer *hi = (heim_integer *)bn;
77 BN_clear_free(BIGNUM *bn)
79 BN_free(bn);
83 BN_dup(const BIGNUM *bn)
86 if (der_copy_heim_integer((const heim_integer *)bn, (heim_integer *)b)) {
99 BN_num_bits(const BIGNUM *bn)
111 const heim_integer *i = (const void *)bn;
118 BN_num_bytes(const BIGNUM *bn)
120 return ((const heim_integer *)bn)->length;
128 BN_bin2bn(const void *s, int len, BIGNUM *bn)
130 heim_integer *hi = (void *)bn;
145 if (bn == NULL)
155 BN_bn2bin(const BIGNUM *bn, void *to)
157 const heim_integer *hi = (const void *)bn;
196 BN_bn2hex(const BIGNUM *bn)
203 len = BN_num_bytes(bn);
208 len = BN_bn2bin(bn, data);
226 BN_set_negative(BIGNUM *bn, int flag)
228 ((heim_integer *)bn)->negative = (flag ? 1 : 0);
232 BN_is_negative(const BIGNUM *bn)
234 return ((const heim_integer *)bn)->negative ? 1 : 0;
240 BN_is_bit_set(const BIGNUM *bn, int bit)
242 heim_integer *hi = (heim_integer *)bn;
252 BN_set_bit(BIGNUM *bn, int bit)
254 heim_integer *hi = (heim_integer *)bn;
274 BN_clear_bit(BIGNUM *bn, int bit)
276 heim_integer *hi = (heim_integer *)bn;
288 BN_set_word(BIGNUM *bn, unsigned long num)
303 bn = BN_bin2bn(p, len, bn);
304 return bn != NULL;
308 BN_get_word(const BIGNUM *bn)
310 heim_integer *hi = (heim_integer *)bn;
323 BN_rand(BIGNUM *bn, int bits, int top, int bottom)
326 heim_integer *i = (heim_integer *)bn;
328 BN_clear(bn);
345 BN_clear_bit(bn, j - 1);
353 BN_set_bit(bn, bits - 1);
355 BN_set_bit(bn, bits - 1);
356 BN_set_bit(bn, bits - 2);
358 BN_clear(bn);
363 BN_set_bit(bn, 0);
453 } bn;
473 for (i = 0; i < c->bn.len; i++)
474 BN_free(c->bn.val[i]);
475 free(c->bn.val);
482 if (c->bn.used == c->bn.len) {
485 c->bn.len += 16;
486 ptr = realloc(c->bn.val, c->bn.len * sizeof(c->bn.val[0]));
489 c->bn.val = ptr;
490 for (i = c->bn.used; i < c->bn.len; i++) {
491 c->bn.val[i] = BN_new();
492 if (c->bn.val[i] == NULL) {
493 c->bn.len = i;
498 return c->bn.val[c->bn.used++];
512 c->stack.val[c->stack.used++] = c->bn.used;
524 for (i = prev; i < c->bn.used; i++)
525 BN_clear(c->bn.val[i]);
528 c->bn.used = prev;