Lines Matching full:sets
181 /* BN_dup allocates a new BIGNUM and sets it equal to |src|. It returns the
185 /* BN_copy sets |dest| equal to |src| and returns |dest| or NULL on allocation
189 /* BN_clear sets |bn| to zero and erases the old data. */
213 /* BN_zero sets |bn| to zero. */
216 /* BN_one sets |bn| to one. It returns one on success or zero on allocation
220 /* BN_set_word sets |bn| to |value|. It returns one on success or zero on
224 /* BN_set_negative sets the sign of |bn|. */
233 /* BN_set_flags sets |flags| on |bn|. */
239 /* BN_bin2bn sets |*ret| to the value of |len| bytes from |in|, interpreted as
374 /* BN_add sets |r| = |a| + |b|, where |r| may be the same pointer as either |a|
378 /* BN_uadd sets |r| = |a| + |b|, where |a| and |b| are non-negative and |r| may
386 /* BN_sub sets |r| = |a| - |b|, where |r| must be a distinct pointer from |a|
390 /* BN_usub sets |r| = |a| - |b|, where |a| and |b| are non-negative integers,
399 /* BN_mul sets |r| = |a| * |b|, where |r| may be the same pointer as |a| or
404 /* BN_mul_word sets |bn| = |bn| * |w|. It returns one on success or zero on
408 /* BN_sqr sets |r| = |a|^2 (i.e. squares), where |r| may be the same pointer as
422 /* BN_div_word sets |numerator| = |numerator|/|divisor| and returns the
426 /* BN_sqrt sets |*out_sqrt| (which may be the same |BIGNUM| as |in|) to the
463 /* BN_lshift sets |r| equal to |a| << n. The |a| and |r| arguments may be the
467 /* BN_lshift1 sets |r| equal to |a| << 1, where |r| and |a| may be the same
471 /* BN_rshift sets |r| equal to |a| >> n, where |r| and |a| may be the same
475 /* BN_rshift1 sets |r| equal to |a| >> 1, where |r| and |a| may be the same
479 /* BN_set_bit sets the |n|th, least-significant bit in |a|. For example, if |a|
513 /* BN_mod_add sets |r| = |a| + |b| mod |m|. It returns one on success and zero
523 /* BN_mod_sub sets |r| = |a| - |b| mod |m|. It returns one on success and zero
533 /* BN_mod_mul sets |r| = |a|*|b| mod |m|. It returns one on success and zero
538 /* BN_mod_sqr sets |r| = |a|^2 mod |m|. It returns one on success and zero
543 /* BN_mod_lshift sets |r| = (|a| << n) mod |m|, where |r| and |a| may be the
553 /* BN_mod_lshift1 sets |r| = (|a| << 1) mod |m|, where |r| and |a| may be the
570 /* BN_rand sets |rnd| to a random number of length |bits|. If |top| is zero, the
584 /* BN_rand_range sets |rnd| to a random value [0..range). It returns one on
628 /* BN_GENCB_set configures |callback| to call |f| and sets |callout->arg| to
639 /* BN_generate_prime_ex sets |ret| to a prime number of |bits| length. If safe
660 /* BN_primality_test sets |*is_probably_prime| to one if |candidate| is
704 /* BN_gcd sets |r| = gcd(|a|, |b|). It returns one on success and zero
709 /* BN_mod_inverse sets |out| equal to |a|^-1, mod |n|. If either of |a| or |n|
740 /* BN_MONT_CTX_copy sets |to| equal to |from|. It returns |to| on success or
745 /* BN_MONT_CTX_set sets up a Montgomery context given the modulus, |mod|. It
751 * so, it creates a new |BN_MONT_CTX| and sets the modulus for it to |mod|. It
758 /* BN_to_montgomery sets |ret| equal to |a| in the Montgomery domain. It
763 /* BN_from_montgomery sets |ret| equal to |a| * R^-1, i.e. translates values
778 /* BN_exp sets |r| equal to |a|^{|p|}. It does so with a square-and-multiply
784 /* BN_mod_exp sets |r| equal to |a|^{|p|} mod |m|. It does so with the best
