Home
last modified time | relevance | path

Searched full:in2 (Results 1 – 25 of 142) sorted by relevance

123456

/freebsd/crypto/openssl/crypto/ec/asm/
H A Decp_nistp521-ppc64.pl161 my @in2 = map("v$_",(35..43));
173 load_vrs($in2p, \@in2);
176 vmsumudm $out[0],$in1[0],$in2[0],$vzero
179 xxpermdi $t2,$in2[1],$in2[0],0b00
182 xxpermdi $t2,$in2[2],$in2[1],0b00
184 vmsumudm $out[2],$in1[2],$in2[0],$out[2]
186 xxpermdi $t2,$in2[3],$in2[2],0b00
189 xxpermdi $t4,$in2[1],$in2[0],0b00
192 xxpermdi $t2,$in2[4],$in2[3],0b00
194 xxpermdi $t4,$in2[2],$in2[1],0b00
[all …]
/freebsd/crypto/libecc/src/nn/
H A Dnn_add.c23 * o out = in1 +/- in2 if cnd is not zero.
27 * constant time for that specific factor, nor on the values of in1 and in2.
28 * It still depends on the maximal length of in1 and in2.
35 * Conditionally adds 'in2' to 'in1' according to "cnd", storing the result
41 * commutative, i.e. "_nn_cnd_add(cnd, out, in1, in2)" is not equivalent
42 * to "_nn_cnd_add(cnd, out, in2, in1)". It is commutative though if "cnd"
43 * is not zero or 'in1' == 'in2'.
46 * that is if not aliased to 'in1' or 'in2'. The length of "out" is set to
47 * the maximal length of 'in1' and 'in2'. Note that both 'in1' and 'in2' will
54 * o the data stored in 'in1' and 'in2'.
[all …]
H A Dnn_mul.c22 * Compute out = (in1 * in2) & (2^(WORD_BYTES * wlimits) - 1).
44 ATTRIBUTE_WARN_UNUSED_RET static int _nn_mul_low(nn_t out, nn_src_t in1, nn_src_t in2, in _nn_mul_low() argument
60 for (j = 0; j < in2->wlen; j++) { in _nn_mul_low()
77 in1->val[i], in2->val[j]); in _nn_mul_low()
106 ATTRIBUTE_WARN_UNUSED_RET static int _nn_mul_low_aliased(nn_t out, nn_src_t in1, nn_src_t in2, in _nn_mul_low_aliased() argument
113 ret = _nn_mul_low(&out_cpy, in1, in2, wlimit); EG(ret, err); in _nn_mul_low_aliased()
124 int nn_mul_low(nn_t out, nn_src_t in1, nn_src_t in2, u8 wlimit) in nn_mul_low() argument
129 ret = nn_check_initialized(in2); EG(ret, err); in nn_mul_low()
132 if ((out == in1) || (out == in2)) { in nn_mul_low()
133 ret = _nn_mul_low_aliased(out, in1, in2, wlimit); in nn_mul_low()
[all …]
H A Dnn_mul_redc1.c124 ATTRIBUTE_WARN_UNUSED_RET static int _nn_mul_redc1(nn_t out, nn_src_t in1, nn_src_t in2, nn_src_t p, in _nn_mul_redc1() argument
141 SHOULD_HAVE((!nn_cmp(in2, p, &cmp)) && (cmp < 0), ret, err); in _nn_mul_redc1()
145 /* Check which one of in1 or in2 is the biggest */ in _nn_mul_redc1()
146 a = (in1->wlen <= in2->wlen) ? in2 : in1; in _nn_mul_redc1()
147 b = (in1->wlen <= in2->wlen) ? in1 : in2; in _nn_mul_redc1()
225 ATTRIBUTE_WARN_UNUSED_RET static int _nn_mul_redc1_aliased(nn_t out, nn_src_t in1, nn_src_t in2, in _nn_mul_redc1_aliased() argument
232 ret = _nn_mul_redc1(&out_cpy, in1, in2, p, mpinv); EG(ret, err); in _nn_mul_redc1_aliased()
246 int nn_mul_redc1(nn_t out, nn_src_t in1, nn_src_t in2, nn_src_t p, in nn_mul_redc1() argument
252 ret = nn_check_initialized(in2); EG(ret, err); in nn_mul_redc1()
256 if ((out == in1) || (out == in2) || (out == p)) { in nn_mul_redc1()
[all …]
/freebsd/crypto/libecc/src/fp/
H A Dfp_montgomery.c22 /* Compute out = in1 + in2 mod p in the Montgomery form.
28 int fp_add_monty(fp_t out, fp_src_t in1, fp_src_t in2) in fp_add_monty() argument
30 return fp_add(out, in1, in2); in fp_add_monty()
33 /* Compute out = in1 - in2 mod p in the Montgomery form.
39 int fp_sub_monty(fp_t out, fp_src_t in1, fp_src_t in2) in fp_sub_monty() argument
41 return fp_sub(out, in1, in2); in fp_sub_monty()
44 /* Compute out = in1 * in2 mod p in the Montgomery form.
50 int fp_mul_monty(fp_t out, fp_src_t in1, fp_src_t in2) in fp_mul_monty() argument
52 return fp_mul_redc1(out, in1, in2); in fp_mul_monty()
67 * Compute out such that in1 = out * in2 mod p in the Montgomery form.
[all …]
H A Dfp_add.c20 * Compute out = in1 + in2 mod p. 'out' parameter must have been initialized
25 int fp_add(fp_t out, fp_src_t in1, fp_src_t in2) in fp_add() argument
31 ret = fp_check_initialized(in2); EG(ret, err); in fp_add()
33 MUST_HAVE(((&(in1->ctx->p)) == (&(in2->ctx->p))), ret, err); in fp_add()
37 SHOULD_HAVE(!nn_cmp(&in2->fp_val, &(in2->ctx->p), &cmp) && (cmp < 0), ret, err); in fp_add()
40 &(in2->fp_val), &(in1->ctx->p)); in fp_add()
70 * Compute out = in1 - in2 mod p. 'out' parameter must have been initialized
75 int fp_sub(fp_t out, fp_src_t in1, fp_src_t in2) in fp_sub() argument
81 ret = fp_check_initialized(in2); EG(ret, err); in fp_sub()
83 MUST_HAVE(((&(in1->ctx->p)) == (&(in2->ctx->p))), ret, err); in fp_sub()
[all …]
H A Dfp_mul_redc1.c25 ATTRIBUTE_WARN_UNUSED_RET static inline int _fp_mul_redc1(nn_t out, nn_src_t in1, nn_src_t in2, in _fp_mul_redc1() argument
28 return nn_mul_redc1(out, in1, in2, &(ctx->p), ctx->mpinv); in _fp_mul_redc1()
32 * Compute out = in1 * in2 mod (p) in redcified form.
39 int fp_mul_redc1(fp_t out, fp_src_t in1, fp_src_t in2) in fp_mul_redc1() argument
44 ret = fp_check_initialized(in2); EG(ret, err); in fp_mul_redc1()
48 MUST_HAVE((out->ctx == in2->ctx), ret, err); in fp_mul_redc1()
50 ret = _fp_mul_redc1(&(out->fp_val), &(in1->fp_val), &(in2->fp_val), in fp_mul_redc1()
H A Dfp.c289 * less than that of in2, 0 if they are equal and 1 if the value of in2 is
294 int fp_cmp(fp_src_t in1, fp_src_t in2, int *cmp) in fp_cmp() argument
299 ret = fp_check_initialized(in2); EG(ret, err); in fp_cmp()
301 MUST_HAVE((in1->ctx == in2->ctx), ret, err); in fp_cmp()
303 ret = nn_cmp(&(in1->fp_val), &(in2->fp_val), cmp); in fp_cmp()
405 * The function tests if in1 and in2 parameters are equal or opposite in
407 * in2 are not equal or opposite, 'eq_or_opp' is set to 0. The function
413 int fp_eq_or_opp(fp_src_t in1, fp_src_t in2, int *eq_or_opp) in fp_eq_or_opp() argument
421 ret = fp_check_initialized(in2); EG(ret, err); in fp_eq_or_opp()
422 MUST_HAVE((in1->ctx == in2->ctx), ret, err); in fp_eq_or_opp()
[all …]
H A Dfp_mul.c25 * Compute out = in1 * in2 mod p. 'out' parameter must have been initialized
30 int fp_mul(fp_t out, fp_src_t in1, fp_src_t in2) in fp_mul() argument
35 ret = fp_check_initialized(in2); EG(ret, err); in fp_mul()
39 MUST_HAVE(out->ctx == in2->ctx, ret, err); in fp_mul()
41 ret = nn_mul(&(out->fp_val), &(in1->fp_val), &(in2->fp_val)); EG(ret, err); in fp_mul()
/freebsd/crypto/libecc/src/curves/
H A Dprj_pt.c299 * Compare projective points 'in1' and 'in2'. On success, 'cmp' is set to
300 * the result of the comparison (0 if in1 == in2, !0 if in1 != in2). The
303 int prj_pt_cmp(prj_pt_src_t in1, prj_pt_src_t in2, int *cmp) in prj_pt_cmp() argument
311 ret = prj_pt_check_initialized(in2); EG(ret, err); in prj_pt_cmp()
313 MUST_HAVE((in1->crv == in2->crv), ret, err); in prj_pt_cmp()
316 ret = fp_init(&X2, (in2->X).ctx); EG(ret, err); in prj_pt_cmp()
318 ret = fp_init(&Y2, (in2->Y).ctx); EG(ret, err); in prj_pt_cmp()
325 ret = fp_mul_monty(&X1, &(in1->X), &(in2->Z)); EG(ret, err); in prj_pt_cmp()
326 ret = fp_mul_monty(&X2, &(in2->X), &(in1->Z)); EG(ret, err); in prj_pt_cmp()
327 ret = fp_mul_monty(&Y1, &(in1->Y), &(in2->Z)); EG(ret, err); in prj_pt_cmp()
[all …]
H A Daff_pt.c214 * Compare affine points 'in1' and 'in2'. On success, 0 is returned and
218 int ec_shortw_aff_cmp(aff_pt_src_t in1, aff_pt_src_t in2, int *cmp) in ec_shortw_aff_cmp() argument
225 ret = aff_pt_check_initialized(in2); EG(ret, err); in ec_shortw_aff_cmp()
227 MUST_HAVE((in1->crv == in2->crv), ret, err); in ec_shortw_aff_cmp()
229 ret = fp_cmp(&(in1->x), &(in2->x), &cmp_x); EG(ret, err); in ec_shortw_aff_cmp()
230 ret = fp_cmp(&(in1->y), &(in2->y), &cmp_y); EG(ret, err); in ec_shortw_aff_cmp()
239 * Check if given affine points 'in1' and 'in2' on the same curve are equal
246 int ec_shortw_aff_eq_or_opp(aff_pt_src_t in1, aff_pt_src_t in2, in ec_shortw_aff_eq_or_opp() argument
252 ret = aff_pt_check_initialized(in2); EG(ret, err); in ec_shortw_aff_eq_or_opp()
253 MUST_HAVE((in1->crv == in2->crv), ret, err); in ec_shortw_aff_eq_or_opp()
[all …]
/freebsd/crypto/libecc/include/libecc/nn/
H A Dnn_add.h20 ATTRIBUTE_WARN_UNUSED_RET int nn_cnd_add(int cnd, nn_t out, nn_src_t in1, nn_src_t in2);
21 ATTRIBUTE_WARN_UNUSED_RET int nn_cnd_sub(int cnd, nn_t out, nn_src_t in1, nn_src_t in2);
22 ATTRIBUTE_WARN_UNUSED_RET int nn_add(nn_t out, nn_src_t in1, nn_src_t in2);
24 ATTRIBUTE_WARN_UNUSED_RET int nn_sub(nn_t out, nn_src_t in1, nn_src_t in2);
26 ATTRIBUTE_WARN_UNUSED_RET int nn_mod_add(nn_t out, nn_src_t in1, nn_src_t in2, nn_src_t p);
28 ATTRIBUTE_WARN_UNUSED_RET int nn_mod_sub(nn_t out, nn_src_t in1, nn_src_t in2, nn_src_t p);
/freebsd/crypto/openssl/crypto/des/
H A Dxcbc_enc.c28 register const unsigned char *in2; in DES_xcbc_encrypt() local
33 in2 = &(*inw)[0]; in DES_xcbc_encrypt()
34 c2l(in2, inW0); in DES_xcbc_encrypt()
35 c2l(in2, inW1); in DES_xcbc_encrypt()
36 in2 = &(*outw)[0]; in DES_xcbc_encrypt()
37 c2l(in2, outW0); in DES_xcbc_encrypt()
38 c2l(in2, outW1); in DES_xcbc_encrypt()
/freebsd/crypto/openssl/crypto/modes/asm/
H A Dghashp8-ppc.pl379 my ($Xl3,$Xm2,$IN2,$H3l,$H3,$H3h,
448 lvx_u $IN2,r9,$inp
453 le?vperm $IN2,$IN2,$IN2,$lemask
463 vperm $t0,$IN2,$IN3,$loperm
465 vperm $t1,$IN2,$IN3,$hiperm
466 vpmsumd $Xm2,$IN2,$H2 # H^2.lo·Xi+2.hi+H^2.hi·Xi+2.lo
482 lvx_u $IN2,r9,$inp
486 le?vperm $IN2,$IN2,$IN2,$lemask
500 vperm $t0,$IN2,$IN3,$loperm
501 vperm $t1,$IN2,$IN3,$hiperm
[all …]
/freebsd/crypto/libecc/include/libecc/fp/
H A Dfp_montgomery.h24 ATTRIBUTE_WARN_UNUSED_RET int fp_add_monty(fp_t out, fp_src_t in1, fp_src_t in2);
25 ATTRIBUTE_WARN_UNUSED_RET int fp_sub_monty(fp_t out, fp_src_t in1, fp_src_t in2);
26 ATTRIBUTE_WARN_UNUSED_RET int fp_mul_monty(fp_t out, fp_src_t in1, fp_src_t in2);
28 ATTRIBUTE_WARN_UNUSED_RET int fp_div_monty(fp_t out, fp_src_t in1, fp_src_t in2);
/freebsd/crypto/openssl/crypto/poly1305/asm/
H A Dpoly1305-sparcv9.pl447 my ($in0,$in1,$in2,$in3,$in4) = map("%o$_",(0..4));
501 ldxa [$inp+$i1]0x88,$in2
509 sllx $in2,$shl,$in1
510 srlx $in2,$shr,$in2
513 or $in3,$in2,$in2
520 srlx $in2,32,$in3
521 andn $in2,$i2,$in2
526 st $in2,[$ctx+`8*6+4`]
649 ldxa [$inp+$i1]0x88,$in2
655 sllx $in2,$shl,$in1
[all …]
/freebsd/crypto/openssl/crypto/des/asm/
H A Ddes_enc.m476 #define in2 %i2
276 ! also compares in2 to 8
456 cmp in2, 8
621 ! also adds -8 to length in2 and loads loop counter to out4
659 add in2, -8, in2
1129 cmp in2, 0 ! enc
1215 cmp in2, 0
1300 add in2, 120, in4 ! ks2
1303 mov in3, in2 ! save ks3
1313 mov in2, in3 ! preload ks3
[all …]
/freebsd/crypto/openssl/providers/implementations/rands/
H A Ddrbg_hmac.c48 * in1, in2, in3 are optional inputs that can be NULL.
52 * hmac->K = HMAC(hmac->K, hmac->V || inbyte || [in1] || [in2] || [in3])
59 const unsigned char *in2, size_t in2len, in do_hmac() argument
65 /* K = HMAC(K, V || inbyte || [in1] || [in2] || [in3]) */ in do_hmac()
69 || !(in2 == NULL || in2len == 0 || EVP_MAC_update(ctx, in2, in2len)) in do_hmac()
85 * K,V = do_hmac(hmac, 0, in1, in2, in3)
87 * K,V = do_hmac(hmac, 1, in1, in2, in3)
89 * where in1, in2, in3 are optional input buffers that can be NULL.
96 const unsigned char *in2, size_ in drbg_hmac_update() argument
[all...]
/freebsd/crypto/openssl/crypto/ec/
H A Decp_nistp521.c481 * felem_mul sets |out| = |in1| * |in2|
484 * in2[i] < 2^63
486 * out[i] < 17 * max(in1[i]) * max(in2[i])
488 static void felem_mul_ref(largefelem out, const felem in1, const felem in2) in felem_mul_ref() argument
491 felem_scalar(in2x2, in2, 2); in felem_mul_ref()
493 out[0] = ((uint128_t) in1[0]) * in2[0]; in felem_mul_ref()
495 out[1] = ((uint128_t) in1[0]) * in2[1] + in felem_mul_ref()
496 ((uint128_t) in1[1]) * in2[0]; in felem_mul_ref()
498 out[2] = ((uint128_t) in1[0]) * in2[2] + in felem_mul_ref()
499 ((uint128_t) in1[1]) * in2[1] + in felem_mul_ref()
[all …]
/freebsd/contrib/wireguard-tools/
H A Dcurve25519-fiat32.h222 static void fe_add_impl(u32 out[10], const u32 in1[10], const u32 in2[10]) in fe_add_impl()
234 { const u32 x38 = in2[9]; in fe_add_impl()
235 { const u32 x39 = in2[8]; in fe_add_impl()
236 { const u32 x37 = in2[7]; in fe_add_impl()
237 { const u32 x35 = in2[6]; in fe_add_impl()
238 { const u32 x33 = in2[5]; in fe_add_impl()
239 { const u32 x31 = in2[4]; in fe_add_impl()
240 { const u32 x29 = in2[3]; in fe_add_impl()
241 { const u32 x27 = in2[2]; in fe_add_impl()
242 { const u32 x25 = in2[1]; in fe_add_impl()
[all …]
/freebsd/crypto/openssl/crypto/aes/asm/
H A Daesv8-armx.pl437 my ($dat2,$in2,$tmp2)=map("q$_",(10,11,9));
442 ($dat2,$dat3,$dat4,$in2,$in3,$in4,$tmp3,$tmp4)=map("q$_",(16..23));
713 vld1.8 {$in2},[$inp],#16
725 vorr $dat2,$in2,$in2
744 vorr $dat0,$in2,$in2
822 vld1.8 {$in2},[$inp],#16
837 vorr $dat2,$in2,$in2
1033 vld1.8 {$in2},[$inp],#16
1045 vorr $dat2,$in2,$in2
1064 vorr $dat0,$in2,$in2
[all …]
H A Daesp8-ppc.pl679 my ($in0, $in1, $in2, $in3, $in4, $in5, $in6, $in7 )=map("v$_",(0..3,10..13));
783 lvx_u $in2,$x20,$inp
788 le?vperm $in2,$in2,$in2,$inpperm
795 vxor $out2,$in2,$rndkey0
904 vxor $in2,$in2,v31
919 vncipherlast $out3,$out3,$in2
921 lvx_u $in2,$x20,$inp
926 le?vperm $in2,$in2,$in2,$inpperm
950 vxor $out2,$in2,$rndkey0
1049 vxor $in2,$in2,v31
[all …]
/freebsd/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/json/
H A Dtst.general.d25 #define IN2(vala, valb) \ macro
93 IN2("[\"string\",32,true,{\"a\":9,\"b\":false},100.3e10,false,200.5,",
114 IN2("\n[\t\"string\" ,\t32 , true\t,\t {\"a\": 9,\t\"b\": false},\t\t",
135 IN2("[\"abcd \\\" \\\\ \\/ \\b \\f \\n \\r \\t \\u0000 \\uf00F \", ",
147 IN2("{ \"top\": { \"mid\" : { \"legs\": \"feet\" }, \"number\": 9, ",
/freebsd/crypto/openssl/test/recipes/
H A D04-test_conf.t41 my $in2 = $_[1];
43 $in2 =~ s/\r\n/\n/g;
44 $in1 ne $in2}), 0,
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Din_in_result.h33 _LIBCPP_NO_UNIQUE_ADDRESS _InIter2 in2;
38 return {in1, in2};
44 return {std::move(in1), std::move(in2)}; in in_in_result()
30 _LIBCPP_NO_UNIQUE_ADDRESS _InIter2 in2; global() member

123456