2 # $OpenBSD: ecp_nistz256-sparcv9.pl,v 1.1 2016/11/04 17:33:20 miod Exp $
4 # Copyright 2015-2016 The OpenSSL Project Authors. All Rights Reserved.
6 # Licensed under the OpenSSL license (the "License"). You may not use
7 # this file except in compliance with the License. You can obtain a copy
8 # in the file LICENSE in the source distribution or at
9 # https://www.openssl.org/source/license.html
12 # ====================================================================
13 # Written by Andy Polyakov <appro@openssl.org> for the OpenSSL
14 # project. The module is, however, dual licensed under OpenSSL and
15 # CRYPTOGAMS licenses depending on where you obtain it. For further
16 # details see http://www.openssl.org/~appro/cryptogams/.
17 # ====================================================================
19 # ECP_NISTZ256 module for SPARCv9.
23 # Original ECP_NISTZ256 submission targeting x86_64 is detailed in
24 # http://eprint.iacr.org/2013/816. In the process of adaptation
25 # original .c module was made 32-bit savvy in order to make this
26 # implementation possible.
28 # with/without -DECP_NISTZ256_ASM
29 # UltraSPARC III +12-18%
30 # SPARC T4 +99-550% (+66-150% on 32-bit Solaris)
32 # Ranges denote minimum and maximum improvement coefficients depending
33 # on benchmark. Lower coefficients are for ECDSA sign, server-side
34 # operation. Keep in mind that +200% means 3x improvement.
36 # Uncomment when all sparcv9 assembly generators are updated to take the output
37 # file as last argument...
39 # open STDOUT,">$output";
42 #define STACK_FRAME 192
43 #define STACK_BIAS 2047
45 #define LOCALS (STACK_BIAS+STACK_FRAME)
46 .register
%g2,#scratch
47 .register
%g3,#scratch
48 # define STACK64_FRAME STACK_FRAME
49 # define LOCALS64 LOCALS
51 .section
".text",#alloc,#execinstr
55 my ($rp,$ap,$bp)=map("%i$_",(0..2));
56 my @acc=map("%l$_",(0..7));
57 my ($t0,$t1,$t2,$t3,$t4,$t5,$t6,$t7)=(map("%o$_",(0..5)),"%g4","%g5");
58 my ($bi,$a0,$mask,$carry)=(map("%i$_",(3..5)),"%g1");
59 my ($rp_real,$ap_real)=("%g2","%g3");
66 ! void ecp_nistz256_from_mont
(BN_ULONG
%i0[8],const BN_ULONG
%i1[8]);
67 .globl ecp_nistz256_from_mont
69 ecp_nistz256_from_mont
:
70 save
%sp,-STACK_FRAME
,%sp
74 call __ecp_nistz256_mul_mont
78 .type ecp_nistz256_from_mont
,#function
79 .size ecp_nistz256_from_mont
,.-ecp_nistz256_from_mont
81 ! void ecp_nistz256_mul_mont
(BN_ULONG
%i0[8],const BN_ULONG
%i1[8],
82 ! const BN_ULONG
%i2[8]);
83 .globl ecp_nistz256_mul_mont
85 ecp_nistz256_mul_mont
:
86 save
%sp,-STACK_FRAME
,%sp
88 call __ecp_nistz256_mul_mont
92 .type ecp_nistz256_mul_mont
,#function
93 .size ecp_nistz256_mul_mont
,.-ecp_nistz256_mul_mont
95 ! void ecp_nistz256_sqr_mont
(BN_ULONG
%i0[8],const BN_ULONG
%i2[8]);
96 .globl ecp_nistz256_sqr_mont
98 ecp_nistz256_sqr_mont
:
99 save
%sp,-STACK_FRAME
,%sp
101 call __ecp_nistz256_mul_mont
105 .type ecp_nistz256_sqr_mont
,#function
106 .size ecp_nistz256_sqr_mont
,.-ecp_nistz256_sqr_mont
109 ########################################################################
110 # Special thing to keep in mind is that $t0-$t7 hold 64-bit values,
111 # while all others are meant to keep 32. "Meant to" means that additions
112 # to @acc[0-7] do "contaminate" upper bits, but they are cleared before
113 # they can affect outcome (follow 'and' with $mask). Also keep in mind
114 # that addition with carry is addition with 32-bit carry, even though
115 # CPU is 64-bit. [Addition with 64-bit carry was introduced in T3, see
116 # below for VIS3 code paths.]
120 __ecp_nistz256_mul_mont
:
121 ld
[$bp+0],$bi ! b
[0]
124 srl
$mask,0,$mask ! 0xffffffff
132 mulx
$a0,$bi,$t0 ! a
[0-7]*b
[0], 64-bit results
140 srlx
$t0,32,@acc[1] ! extract high parts
147 srlx
$t7,32,@acc[0] ! "@acc[8]"
150 for($i=1;$i<8;$i++) {
152 addcc
@acc[1],$t1,@acc[1] ! accumulate high parts
153 ld
[$bp+4*$i],$bi ! b
[$i]
154 ld
[$ap+4],$t1 ! re
-load a
[1-7]
155 addccc
@acc[2],$t2,@acc[2]
156 addccc
@acc[3],$t3,@acc[3]
159 addccc
@acc[4],$t4,@acc[4]
160 addccc
@acc[5],$t5,@acc[5]
163 addccc
@acc[6],$t6,@acc[6]
164 addccc
@acc[7],$t7,@acc[7]
167 addccc
@acc[0],$carry,@acc[0] ! "@acc[8]"
170 # Reduction iteration is normally performed by accumulating
171 # result of multiplication of modulus by "magic" digit [and
172 # omitting least significant word, which is guaranteed to
173 # be 0], but thanks to special form of modulus and "magic"
174 # digit being equal to least significant word, it can be
175 # performed with additions and subtractions alone. Indeed:
177 # ffff.0001.0000.0000.0000.ffff.ffff.ffff
179 # + xxxx.xxxx.xxxx.xxxx.xxxx.xxxx.xxxx.xxxx.abcd
181 # Now observing that ff..ff*x = (2^n-1)*x = 2^n*x-x, we
184 # xxxx.xxxx.xxxx.xxxx.xxxx.xxxx.xxxx.xxxx.abcd
185 # + abcd.0000.abcd.0000.0000.abcd.0000.0000.0000
186 # - abcd.0000.0000.0000.0000.0000.0000.abcd
188 # or marking redundant operations:
190 # xxxx.xxxx.xxxx.xxxx.xxxx.xxxx.xxxx.xxxx.----
191 # + abcd.0000.abcd.0000.0000.abcd.----.----.----
192 # - abcd.----.----.----.----.----.----.----
195 ! multiplication
-less reduction
196 addcc
@acc[3],$t0,@acc[3] ! r
[3]+=r
[0]
197 addccc
@acc[4],%g0,@acc[4] ! r
[4]+=0
198 and @acc[1],$mask,@acc[1]
199 and @acc[2],$mask,@acc[2]
200 addccc
@acc[5],%g0,@acc[5] ! r
[5]+=0
201 addccc
@acc[6],$t0,@acc[6] ! r
[6]+=r
[0]
202 and @acc[3],$mask,@acc[3]
203 and @acc[4],$mask,@acc[4]
204 addccc
@acc[7],%g0,@acc[7] ! r
[7]+=0
205 addccc
@acc[0],$t0,@acc[0] ! r
[8]+=r
[0] "@acc[8]"
206 and @acc[5],$mask,@acc[5]
207 and @acc[6],$mask,@acc[6]
208 addc
$carry,%g0,$carry ! top
-most carry
209 subcc
@acc[7],$t0,@acc[7] ! r
[7]-=r
[0]
210 subccc
@acc[0],%g0,@acc[0] ! r
[8]-=0 "@acc[8]"
211 subc
$carry,%g0,$carry ! top
-most carry
212 and @acc[7],$mask,@acc[7]
213 and @acc[0],$mask,@acc[0] ! "@acc[8]"
215 push(@acc,shift(@acc)); # rotate registers to "omit" acc[0]
217 mulx
$a0,$bi,$t0 ! a
[0-7]*b
[$i], 64-bit results
225 add
@acc[0],$t0,$t0 ! accumulate low parts
, can
't overflow
227 srlx $t0,32,@acc[1] ! extract high parts
240 srlx $t7,32,@acc[0] ! "@acc[8]"
244 addcc @acc[1],$t1,@acc[1] ! accumulate high parts
245 addccc @acc[2],$t2,@acc[2]
246 addccc @acc[3],$t3,@acc[3]
247 addccc @acc[4],$t4,@acc[4]
248 addccc @acc[5],$t5,@acc[5]
249 addccc @acc[6],$t6,@acc[6]
250 addccc @acc[7],$t7,@acc[7]
251 addccc @acc[0],$carry,@acc[0] ! "@acc[8]"
254 addcc @acc[3],$t0,@acc[3] ! multiplication-less reduction
255 addccc @acc[4],%g0,@acc[4]
256 addccc @acc[5],%g0,@acc[5]
257 addccc @acc[6],$t0,@acc[6]
258 addccc @acc[7],%g0,@acc[7]
259 addccc @acc[0],$t0,@acc[0] ! "@acc[8]"
260 addc $carry,%g0,$carry
261 subcc @acc[7],$t0,@acc[7]
262 subccc @acc[0],%g0,@acc[0] ! "@acc[8]"
263 subc $carry,%g0,$carry ! top-most carry
265 push(@acc,shift(@acc)); # rotate registers to omit acc[0]
267 ! Final step is "if result > mod, subtract mod", but we do it
268 ! "other way around", namely subtract modulus from result
269 ! and if it borrowed, add modulus back.
271 subcc @acc[0],-1,@acc[0] ! subtract modulus
272 subccc @acc[1],-1,@acc[1]
273 subccc @acc[2],-1,@acc[2]
274 subccc @acc[3],0,@acc[3]
275 subccc @acc[4],0,@acc[4]
276 subccc @acc[5],0,@acc[5]
277 subccc @acc[6],1,@acc[6]
278 subccc @acc[7],-1,@acc[7]
279 subc $carry,0,$carry ! broadcast borrow bit
281 ! Note that because mod has special form, i.e. consists of
282 ! 0xffffffff, 1 and 0s, we can conditionally synthesize it by
283 ! using value of broadcasted borrow and the borrow bit itself.
284 ! To minimize dependency chain we first broadcast and then
285 ! extract the bit by negating (follow $bi).
287 addcc @acc[0],$carry,@acc[0] ! add modulus or zero
288 addccc @acc[1],$carry,@acc[1]
291 addccc @acc[2],$carry,@acc[2]
293 addccc @acc[3],0,@acc[3]
295 addccc @acc[4],0,@acc[4]
297 addccc @acc[5],0,@acc[5]
299 addccc @acc[6],$bi,@acc[6]
301 addc @acc[7],$carry,@acc[7]
305 .type __ecp_nistz256_mul_mont,#function
306 .size __ecp_nistz256_mul_mont,.-__ecp_nistz256_mul_mont
308 ! void ecp_nistz256_add(BN_ULONG %i0[8],const BN_ULONG %i1[8],
309 ! const BN_ULONG %i2[8]);
310 .globl ecp_nistz256_add
313 save %sp,-STACK_FRAME,%sp
321 call __ecp_nistz256_add
325 .type ecp_nistz256_add,#function
326 .size ecp_nistz256_add,.-ecp_nistz256_add
330 ld [$bp+0],$t0 ! b[0]
334 addcc @acc[0],$t0,@acc[0]
337 addccc @acc[1],$t1,@acc[1]
340 addccc @acc[2],$t2,@acc[2]
341 addccc @acc[3],$t3,@acc[3]
342 addccc @acc[4],$t4,@acc[4]
343 addccc @acc[5],$t5,@acc[5]
344 addccc @acc[6],$t6,@acc[6]
345 addccc @acc[7],$t7,@acc[7]
350 ! if a+b >= modulus, subtract modulus.
352 ! But since comparison implies subtraction, we subtract
353 ! modulus and then add it back if subraction borrowed.
355 subcc @acc[0],-1,@acc[0]
356 subccc @acc[1],-1,@acc[1]
357 subccc @acc[2],-1,@acc[2]
358 subccc @acc[3], 0,@acc[3]
359 subccc @acc[4], 0,@acc[4]
360 subccc @acc[5], 0,@acc[5]
361 subccc @acc[6], 1,@acc[6]
362 subccc @acc[7],-1,@acc[7]
365 ! Note that because mod has special form, i.e. consists of
366 ! 0xffffffff, 1 and 0s, we can conditionally synthesize it by
367 ! using value of borrow and its negative.
369 addcc @acc[0],$carry,@acc[0] ! add synthesized modulus
370 addccc @acc[1],$carry,@acc[1]
373 addccc @acc[2],$carry,@acc[2]
375 addccc @acc[3],0,@acc[3]
377 addccc @acc[4],0,@acc[4]
379 addccc @acc[5],0,@acc[5]
381 addccc @acc[6],$bi,@acc[6]
383 addc @acc[7],$carry,@acc[7]
387 .type __ecp_nistz256_add,#function
388 .size __ecp_nistz256_add,.-__ecp_nistz256_add
390 ! void ecp_nistz256_mul_by_2(BN_ULONG %i0[8],const BN_ULONG %i1[8]);
391 .globl ecp_nistz256_mul_by_2
393 ecp_nistz256_mul_by_2:
394 save %sp,-STACK_FRAME,%sp
402 call __ecp_nistz256_mul_by_2
406 .type ecp_nistz256_mul_by_2,#function
407 .size ecp_nistz256_mul_by_2,.-ecp_nistz256_mul_by_2
410 __ecp_nistz256_mul_by_2:
411 addcc @acc[0],@acc[0],@acc[0] ! a+a=2*a
412 addccc @acc[1],@acc[1],@acc[1]
413 addccc @acc[2],@acc[2],@acc[2]
414 addccc @acc[3],@acc[3],@acc[3]
415 addccc @acc[4],@acc[4],@acc[4]
416 addccc @acc[5],@acc[5],@acc[5]
417 addccc @acc[6],@acc[6],@acc[6]
418 addccc @acc[7],@acc[7],@acc[7]
421 .type __ecp_nistz256_mul_by_2,#function
422 .size __ecp_nistz256_mul_by_2,.-__ecp_nistz256_mul_by_2
424 ! void ecp_nistz256_mul_by_3(BN_ULONG %i0[8],const BN_ULONG %i1[8]);
425 .globl ecp_nistz256_mul_by_3
427 ecp_nistz256_mul_by_3:
428 save %sp,-STACK_FRAME,%sp
436 call __ecp_nistz256_mul_by_3
440 .type ecp_nistz256_mul_by_3,#function
441 .size ecp_nistz256_mul_by_3,.-ecp_nistz256_mul_by_3
444 __ecp_nistz256_mul_by_3:
445 addcc @acc[0],@acc[0],$t0 ! a+a=2*a
446 addccc @acc[1],@acc[1],$t1
447 addccc @acc[2],@acc[2],$t2
448 addccc @acc[3],@acc[3],$t3
449 addccc @acc[4],@acc[4],$t4
450 addccc @acc[5],@acc[5],$t5
451 addccc @acc[6],@acc[6],$t6
452 addccc @acc[7],@acc[7],$t7
455 subcc $t0,-1,$t0 ! .Lreduce_by_sub but without stores
465 addcc $t0,$carry,$t0 ! add synthesized modulus
466 addccc $t1,$carry,$t1
468 addccc $t2,$carry,$t2
475 addcc $t0,@acc[0],@acc[0] ! 2*a+a=3*a
476 addccc $t1,@acc[1],@acc[1]
477 addccc $t2,@acc[2],@acc[2]
478 addccc $t3,@acc[3],@acc[3]
479 addccc $t4,@acc[4],@acc[4]
480 addccc $t5,@acc[5],@acc[5]
481 addccc $t6,@acc[6],@acc[6]
482 addccc $t7,@acc[7],@acc[7]
485 .type __ecp_nistz256_mul_by_3,#function
486 .size __ecp_nistz256_mul_by_3,.-__ecp_nistz256_mul_by_3
488 ! void ecp_nistz256_neg(BN_ULONG %i0[8],const BN_ULONG %i1[8]);
489 .globl ecp_nistz256_neg
492 save %sp,-STACK_FRAME,%sp
501 call __ecp_nistz256_sub_from
505 .type ecp_nistz256_neg,#function
506 .size ecp_nistz256_neg,.-ecp_nistz256_neg
509 __ecp_nistz256_sub_from:
510 ld [$bp+0],$t0 ! b[0]
514 subcc @acc[0],$t0,@acc[0]
517 subccc @acc[1],$t1,@acc[1]
518 subccc @acc[2],$t2,@acc[2]
521 subccc @acc[3],$t3,@acc[3]
522 subccc @acc[4],$t4,@acc[4]
523 subccc @acc[5],$t5,@acc[5]
524 subccc @acc[6],$t6,@acc[6]
525 subccc @acc[7],$t7,@acc[7]
526 subc %g0,%g0,$carry ! broadcast borrow bit
530 ! if a-b borrows, add modulus.
532 ! Note that because mod has special form, i.e. consists of
533 ! 0xffffffff, 1 and 0s, we can conditionally synthesize it by
534 ! using value of broadcasted borrow and the borrow bit itself.
535 ! To minimize dependency chain we first broadcast and then
536 ! extract the bit by negating (follow $bi).
538 addcc @acc[0],$carry,@acc[0] ! add synthesized modulus
539 addccc @acc[1],$carry,@acc[1]
542 addccc @acc[2],$carry,@acc[2]
544 addccc @acc[3],0,@acc[3]
546 addccc @acc[4],0,@acc[4]
548 addccc @acc[5],0,@acc[5]
550 addccc @acc[6],$bi,@acc[6]
552 addc @acc[7],$carry,@acc[7]
556 .type __ecp_nistz256_sub_from,#function
557 .size __ecp_nistz256_sub_from,.-__ecp_nistz256_sub_from
560 __ecp_nistz256_sub_morf:
561 ld [$bp+0],$t0 ! b[0]
565 subcc $t0,@acc[0],@acc[0]
568 subccc $t1,@acc[1],@acc[1]
569 subccc $t2,@acc[2],@acc[2]
572 subccc $t3,@acc[3],@acc[3]
573 subccc $t4,@acc[4],@acc[4]
574 subccc $t5,@acc[5],@acc[5]
575 subccc $t6,@acc[6],@acc[6]
576 subccc $t7,@acc[7],@acc[7]
578 subc %g0,%g0,$carry ! broadcast borrow bit
579 .type __ecp_nistz256_sub_morf,#function
580 .size __ecp_nistz256_sub_morf,.-__ecp_nistz256_sub_morf
582 ! void ecp_nistz256_div_by_2(BN_ULONG %i0[8],const BN_ULONG %i1[8]);
583 .globl ecp_nistz256_div_by_2
585 ecp_nistz256_div_by_2:
586 save %sp,-STACK_FRAME,%sp
594 call __ecp_nistz256_div_by_2
598 .type ecp_nistz256_div_by_2,#function
599 .size ecp_nistz256_div_by_2,.-ecp_nistz256_div_by_2
602 __ecp_nistz256_div_by_2:
603 ! ret = (a is odd ? a+mod : a) >> 1
607 addcc @acc[0],$carry,@acc[0]
608 addccc @acc[1],$carry,@acc[1]
609 addccc @acc[2],$carry,@acc[2]
610 addccc @acc[3],0,@acc[3]
611 addccc @acc[4],0,@acc[4]
612 addccc @acc[5],0,@acc[5]
613 addccc @acc[6],$bi,@acc[6]
614 addccc @acc[7],$carry,@acc[7]
619 srl @acc[0],1,@acc[0]
621 srl @acc[1],1,@acc[1]
622 or @acc[0],$t0,@acc[0]
624 srl @acc[2],1,@acc[2]
625 or @acc[1],$t1,@acc[1]
628 srl @acc[3],1,@acc[3]
629 or @acc[2],$t2,@acc[2]
632 srl @acc[4],1,@acc[4]
633 or @acc[3],$t3,@acc[3]
636 srl @acc[5],1,@acc[5]
637 or @acc[4],$t4,@acc[4]
640 srl @acc[6],1,@acc[6]
641 or @acc[5],$t5,@acc[5]
644 srl @acc[7],1,@acc[7]
645 or @acc[6],$t6,@acc[6]
648 or @acc[7],$t7,@acc[7]
652 .type __ecp_nistz256_div_by_2,#function
653 .size __ecp_nistz256_div_by_2,.-__ecp_nistz256_div_by_2
656 ########################################################################
657 # following subroutines are "literal" implementation of those found in
660 ########################################################################
661 # void ecp_nistz256_point_double(P256_POINT *out,const P256_POINT *inp);
664 my ($S,$M,$Zsqr,$tmp0)=map(32*$_,(0..3));
665 # above map() describes stack layout with 4 temporary
666 # 256-bit vectors on top.
675 .globl ecp_nistz256_point_double
677 ecp_nistz256_point_double:
679 SPARC_LOAD_ADDRESS_LEAF(OPENSSL_sparcv9cap_P,%g1,%g5)
680 ld [%g1],%g1 ! OPENSSL_sparcv9cap_P[0]
681 and %g1,(SPARCV9_VIS3|SPARCV9_64BIT_STACK),%g1
682 cmp %g1,(SPARCV9_VIS3|SPARCV9_64BIT_STACK)
683 be ecp_nistz256_point_double_vis3
687 save %sp,-STACK_FRAME-32*4,%sp
692 .Lpoint_double_shortcut:
694 ld [$ap+32+4],@acc[1]
695 ld [$ap+32+8],@acc[2]
696 ld [$ap+32+12],@acc[3]
697 ld [$ap+32+16],@acc[4]
698 ld [$ap+32+20],@acc[5]
699 ld [$ap+32+24],@acc[6]
700 ld [$ap+32+28],@acc[7]
701 call __ecp_nistz256_mul_by_2 ! p256_mul_by_2(S, in_y);
702 add %sp,LOCALS+$S,$rp
706 call __ecp_nistz256_mul_mont ! p256_sqr_mont(Zsqr, in_z);
707 add %sp,LOCALS+$Zsqr,$rp
710 call __ecp_nistz256_add ! p256_add(M, Zsqr, in_x);
711 add %sp,LOCALS+$M,$rp
713 add %sp,LOCALS+$S,$bp
714 add %sp,LOCALS+$S,$ap
715 call __ecp_nistz256_mul_mont ! p256_sqr_mont(S, S);
716 add %sp,LOCALS+$S,$rp
718 ld [$ap_real],@acc[0]
719 add %sp,LOCALS+$Zsqr,$bp
720 ld [$ap_real+4],@acc[1]
721 ld [$ap_real+8],@acc[2]
722 ld [$ap_real+12],@acc[3]
723 ld [$ap_real+16],@acc[4]
724 ld [$ap_real+20],@acc[5]
725 ld [$ap_real+24],@acc[6]
726 ld [$ap_real+28],@acc[7]
727 call __ecp_nistz256_sub_from ! p256_sub(Zsqr, in_x, Zsqr);
728 add %sp,LOCALS+$Zsqr,$rp
732 call __ecp_nistz256_mul_mont ! p256_mul_mont(tmp0, in_z, in_y);
733 add %sp,LOCALS+$tmp0,$rp
735 call __ecp_nistz256_mul_by_2 ! p256_mul_by_2(res_z, tmp0);
738 add %sp,LOCALS+$Zsqr,$bp
739 add %sp,LOCALS+$M,$ap
740 call __ecp_nistz256_mul_mont ! p256_mul_mont(M, M, Zsqr);
741 add %sp,LOCALS+$M,$rp
743 call __ecp_nistz256_mul_by_3 ! p256_mul_by_3(M, M);
744 add %sp,LOCALS+$M,$rp
746 add %sp,LOCALS+$S,$bp
747 add %sp,LOCALS+$S,$ap
748 call __ecp_nistz256_mul_mont ! p256_sqr_mont(tmp0, S);
749 add %sp,LOCALS+$tmp0,$rp
751 call __ecp_nistz256_div_by_2 ! p256_div_by_2(res_y, tmp0);
755 add %sp,LOCALS+$S,$ap
756 call __ecp_nistz256_mul_mont ! p256_mul_mont(S, S, in_x);
757 add %sp,LOCALS+$S,$rp
759 call __ecp_nistz256_mul_by_2 ! p256_mul_by_2(tmp0, S);
760 add %sp,LOCALS+$tmp0,$rp
762 add %sp,LOCALS+$M,$bp
763 add %sp,LOCALS+$M,$ap
764 call __ecp_nistz256_mul_mont ! p256_sqr_mont(res_x, M);
767 add %sp,LOCALS+$tmp0,$bp
768 call __ecp_nistz256_sub_from ! p256_sub(res_x, res_x, tmp0);
771 add %sp,LOCALS+$S,$bp
772 call __ecp_nistz256_sub_morf ! p256_sub(S, S, res_x);
773 add %sp,LOCALS+$S,$rp
775 add %sp,LOCALS+$M,$bp
776 add %sp,LOCALS+$S,$ap
777 call __ecp_nistz256_mul_mont ! p256_mul_mont(S, S, M);
778 add %sp,LOCALS+$S,$rp
781 call __ecp_nistz256_sub_from ! p256_sub(res_y, S, res_y);
786 .type ecp_nistz256_point_double,#function
787 .size ecp_nistz256_point_double,.-ecp_nistz256_point_double
791 ########################################################################
792 # void ecp_nistz256_point_add(P256_POINT *out,const P256_POINT *in1,
793 # const P256_POINT *in2);
795 my ($res_x,$res_y,$res_z,
796 $H,$Hsqr,$R,$Rsqr,$Hcub,
797 $U1,$U2,$S1,$S2)=map(32*$_,(0..11));
798 my ($Z1sqr, $Z2sqr) = ($Hsqr, $Rsqr);
800 # above map() describes stack layout with 12 temporary
801 # 256-bit vectors on top. Then we reserve some space for
802 # !in1infty, !in2infty, result of check for zero and return pointer.
804 my $bp_real=$rp_real;
807 .globl ecp_nistz256_point_add
809 ecp_nistz256_point_add:
811 SPARC_LOAD_ADDRESS_LEAF(OPENSSL_sparcv9cap_P,%g1,%g5)
812 ld [%g1],%g1 ! OPENSSL_sparcv9cap_P[0]
813 and %g1,(SPARCV9_VIS3|SPARCV9_64BIT_STACK),%g1
814 cmp %g1,(SPARCV9_VIS3|SPARCV9_64BIT_STACK)
815 be ecp_nistz256_point_add_vis3
819 save %sp,-STACK_FRAME-32*12-32,%sp
821 stx $rp,[%fp+STACK_BIAS-8] ! off-load $rp
825 ld [$bp+64],$t0 ! in2_z
839 or $t4,$t0,$t0 ! !in2infty
841 st $t0,[%fp+STACK_BIAS-12]
843 ld [$ap+64],$t0 ! in1_z
857 or $t4,$t0,$t0 ! !in1infty
859 st $t0,[%fp+STACK_BIAS-16]
863 call __ecp_nistz256_mul_mont ! p256_sqr_mont(Z2sqr, in2_z);
864 add %sp,LOCALS+$Z2sqr,$rp
868 call __ecp_nistz256_mul_mont ! p256_sqr_mont(Z1sqr, in1_z);
869 add %sp,LOCALS+$Z1sqr,$rp
872 add %sp,LOCALS+$Z2sqr,$ap
873 call __ecp_nistz256_mul_mont ! p256_mul_mont(S1, Z2sqr, in2_z);
874 add %sp,LOCALS+$S1,$rp
877 add %sp,LOCALS+$Z1sqr,$ap
878 call __ecp_nistz256_mul_mont ! p256_mul_mont(S2, Z1sqr, in1_z);
879 add %sp,LOCALS+$S2,$rp
882 add %sp,LOCALS+$S1,$ap
883 call __ecp_nistz256_mul_mont ! p256_mul_mont(S1, S1, in1_y);
884 add %sp,LOCALS+$S1,$rp
887 add %sp,LOCALS+$S2,$ap
888 call __ecp_nistz256_mul_mont ! p256_mul_mont(S2, S2, in2_y);
889 add %sp,LOCALS+$S2,$rp
891 add %sp,LOCALS+$S1,$bp
892 call __ecp_nistz256_sub_from ! p256_sub(R, S2, S1);
893 add %sp,LOCALS+$R,$rp
895 or @acc[1],@acc[0],@acc[0] ! see if result is zero
896 or @acc[3],@acc[2],@acc[2]
897 or @acc[5],@acc[4],@acc[4]
898 or @acc[7],@acc[6],@acc[6]
899 or @acc[2],@acc[0],@acc[0]
900 or @acc[6],@acc[4],@acc[4]
901 or @acc[4],@acc[0],@acc[0]
902 st @acc[0],[%fp+STACK_BIAS-20]
905 add %sp,LOCALS+$Z2sqr,$ap
906 call __ecp_nistz256_mul_mont ! p256_mul_mont(U1, in1_x, Z2sqr);
907 add %sp,LOCALS+$U1,$rp
910 add %sp,LOCALS+$Z1sqr,$ap
911 call __ecp_nistz256_mul_mont ! p256_mul_mont(U2, in2_x, Z1sqr);
912 add %sp,LOCALS+$U2,$rp
914 add %sp,LOCALS+$U1,$bp
915 call __ecp_nistz256_sub_from ! p256_sub(H, U2, U1);
916 add %sp,LOCALS+$H,$rp
918 or @acc[1],@acc[0],@acc[0] ! see if result is zero
919 or @acc[3],@acc[2],@acc[2]
920 or @acc[5],@acc[4],@acc[4]
921 or @acc[7],@acc[6],@acc[6]
922 or @acc[2],@acc[0],@acc[0]
923 or @acc[6],@acc[4],@acc[4]
924 orcc @acc[4],@acc[0],@acc[0]
926 bne,pt %icc,.Ladd_proceed ! is_equal(U1,U2)?
929 ld [%fp+STACK_BIAS-12],$t0
930 ld [%fp+STACK_BIAS-16],$t1
931 ld [%fp+STACK_BIAS-20],$t2
933 be,pt %icc,.Ladd_proceed ! (in1infty || in2infty)?
936 be,pt %icc,.Ladd_double ! is_equal(S1,S2)?
939 ldx [%fp+STACK_BIAS-8],$rp
969 ldx [%fp+STACK_BIAS-8],$rp_real
971 b .Lpoint_double_shortcut
972 add %sp,32*(12-4)+32,%sp ! difference in frame sizes
976 add %sp,LOCALS+$R,$bp
977 add %sp,LOCALS+$R,$ap
978 call __ecp_nistz256_mul_mont ! p256_sqr_mont(Rsqr, R);
979 add %sp,LOCALS+$Rsqr,$rp
982 add %sp,LOCALS+$H,$ap
983 call __ecp_nistz256_mul_mont ! p256_mul_mont(res_z, H, in1_z);
984 add %sp,LOCALS+$res_z,$rp
986 add %sp,LOCALS+$H,$bp
987 add %sp,LOCALS+$H,$ap
988 call __ecp_nistz256_mul_mont ! p256_sqr_mont(Hsqr, H);
989 add %sp,LOCALS+$Hsqr,$rp
992 add %sp,LOCALS+$res_z,$ap
993 call __ecp_nistz256_mul_mont ! p256_mul_mont(res_z, res_z, in2_z);
994 add %sp,LOCALS+$res_z,$rp
996 add %sp,LOCALS+$H,$bp
997 add %sp,LOCALS+$Hsqr,$ap
998 call __ecp_nistz256_mul_mont ! p256_mul_mont(Hcub, Hsqr, H);
999 add %sp,LOCALS+$Hcub,$rp
1001 add %sp,LOCALS+$U1,$bp
1002 add %sp,LOCALS+$Hsqr,$ap
1003 call __ecp_nistz256_mul_mont ! p256_mul_mont(U2, U1, Hsqr);
1004 add %sp,LOCALS+$U2,$rp
1006 call __ecp_nistz256_mul_by_2 ! p256_mul_by_2(Hsqr, U2);
1007 add %sp,LOCALS+$Hsqr,$rp
1009 add %sp,LOCALS+$Rsqr,$bp
1010 call __ecp_nistz256_sub_morf ! p256_sub(res_x, Rsqr, Hsqr);
1011 add %sp,LOCALS+$res_x,$rp
1013 add %sp,LOCALS+$Hcub,$bp
1014 call __ecp_nistz256_sub_from ! p256_sub(res_x, res_x, Hcub);
1015 add %sp,LOCALS+$res_x,$rp
1017 add %sp,LOCALS+$U2,$bp
1018 call __ecp_nistz256_sub_morf ! p256_sub(res_y, U2, res_x);
1019 add %sp,LOCALS+$res_y,$rp
1021 add %sp,LOCALS+$Hcub,$bp
1022 add %sp,LOCALS+$S1,$ap
1023 call __ecp_nistz256_mul_mont ! p256_mul_mont(S2, S1, Hcub);
1024 add %sp,LOCALS+$S2,$rp
1026 add %sp,LOCALS+$R,$bp
1027 add %sp,LOCALS+$res_y,$ap
1028 call __ecp_nistz256_mul_mont ! p256_mul_mont(res_y, res_y, R);
1029 add %sp,LOCALS+$res_y,$rp
1031 add %sp,LOCALS+$S2,$bp
1032 call __ecp_nistz256_sub_from ! p256_sub(res_y, res_y, S2);
1033 add %sp,LOCALS+$res_y,$rp
1035 ld [%fp+STACK_BIAS-16],$t1 ! !in1infty
1036 ld [%fp+STACK_BIAS-12],$t2 ! !in2infty
1037 ldx [%fp+STACK_BIAS-8],$rp
1039 for($i=0;$i<96;$i+=8) { # conditional moves
1041 ld [%sp+LOCALS+$i],@acc[0] ! res
1042 ld [%sp+LOCALS+$i+4],@acc[1]
1043 ld [$bp_real+$i],@acc[2] ! in2
1044 ld [$bp_real+$i+4],@acc[3]
1045 ld [$ap_real+$i],@acc[4] ! in1
1046 ld [$ap_real+$i+4],@acc[5]
1047 movrz $t1,@acc[2],@acc[0]
1048 movrz $t1,@acc[3],@acc[1]
1049 movrz $t2,@acc[4],@acc[0]
1050 movrz $t2,@acc[5],@acc[1]
1052 st @acc[1],[$rp+$i+4]
1059 .type ecp_nistz256_point_add,#function
1060 .size ecp_nistz256_point_add,.-ecp_nistz256_point_add
1064 ########################################################################
1065 # void ecp_nistz256_point_add_affine(P256_POINT *out,const P256_POINT *in1,
1066 # const P256_POINT_AFFINE *in2);
1068 my ($res_x,$res_y,$res_z,
1069 $U2,$S2,$H,$R,$Hsqr,$Hcub,$Rsqr)=map(32*$_,(0..9));
1071 # above map() describes stack layout with 10 temporary
1072 # 256-bit vectors on top. Then we reserve some space for
1073 # !in1infty, !in2infty, result of check for zero and return pointer.
1075 my @ONE_mont=(1,0,0,-1,-1,-1,-2,0);
1076 my $bp_real=$rp_real;
1079 .globl ecp_nistz256_point_add_affine
1081 ecp_nistz256_point_add_affine:
1083 SPARC_LOAD_ADDRESS_LEAF(OPENSSL_sparcv9cap_P,%g1,%g5)
1084 ld [%g1],%g1 ! OPENSSL_sparcv9cap_P[0]
1085 and %g1,(SPARCV9_VIS3|SPARCV9_64BIT_STACK),%g1
1086 cmp %g1,(SPARCV9_VIS3|SPARCV9_64BIT_STACK)
1087 be ecp_nistz256_point_add_affine_vis3
1091 save %sp,-STACK_FRAME-32*10-32,%sp
1093 stx $rp,[%fp+STACK_BIAS-8] ! off-load $rp
1097 ld [$ap+64],$t0 ! in1_z
1111 or $t4,$t0,$t0 ! !in1infty
1113 st $t0,[%fp+STACK_BIAS-16]
1115 ld [$bp],@acc[0] ! in2_x
1123 ld [$bp+32],$t0 ! in2_y
1131 or @acc[1],@acc[0],@acc[0]
1132 or @acc[3],@acc[2],@acc[2]
1133 or @acc[5],@acc[4],@acc[4]
1134 or @acc[7],@acc[6],@acc[6]
1135 or @acc[2],@acc[0],@acc[0]
1136 or @acc[6],@acc[4],@acc[4]
1137 or @acc[4],@acc[0],@acc[0]
1145 or @acc[0],$t0,$t0 ! !in2infty
1147 st $t0,[%fp+STACK_BIAS-12]
1151 call __ecp_nistz256_mul_mont ! p256_sqr_mont(Z1sqr, in1_z);
1152 add %sp,LOCALS+$Z1sqr,$rp
1155 add %sp,LOCALS+$Z1sqr,$ap
1156 call __ecp_nistz256_mul_mont ! p256_mul_mont(U2, Z1sqr, in2_x);
1157 add %sp,LOCALS+$U2,$rp
1160 call __ecp_nistz256_sub_from ! p256_sub(H, U2, in1_x);
1161 add %sp,LOCALS+$H,$rp
1164 add %sp,LOCALS+$Z1sqr,$ap
1165 call __ecp_nistz256_mul_mont ! p256_mul_mont(S2, Z1sqr, in1_z);
1166 add %sp,LOCALS+$S2,$rp
1169 add %sp,LOCALS+$H,$ap
1170 call __ecp_nistz256_mul_mont ! p256_mul_mont(res_z, H, in1_z);
1171 add %sp,LOCALS+$res_z,$rp
1174 add %sp,LOCALS+$S2,$ap
1175 call __ecp_nistz256_mul_mont ! p256_mul_mont(S2, S2, in2_y);
1176 add %sp,LOCALS+$S2,$rp
1179 call __ecp_nistz256_sub_from ! p256_sub(R, S2, in1_y);
1180 add %sp,LOCALS+$R,$rp
1182 add %sp,LOCALS+$H,$bp
1183 add %sp,LOCALS+$H,$ap
1184 call __ecp_nistz256_mul_mont ! p256_sqr_mont(Hsqr, H);
1185 add %sp,LOCALS+$Hsqr,$rp
1187 add %sp,LOCALS+$R,$bp
1188 add %sp,LOCALS+$R,$ap
1189 call __ecp_nistz256_mul_mont ! p256_sqr_mont(Rsqr, R);
1190 add %sp,LOCALS+$Rsqr,$rp
1192 add %sp,LOCALS+$H,$bp
1193 add %sp,LOCALS+$Hsqr,$ap
1194 call __ecp_nistz256_mul_mont ! p256_mul_mont(Hcub, Hsqr, H);
1195 add %sp,LOCALS+$Hcub,$rp
1198 add %sp,LOCALS+$Hsqr,$ap
1199 call __ecp_nistz256_mul_mont ! p256_mul_mont(U2, in1_x, Hsqr);
1200 add %sp,LOCALS+$U2,$rp
1202 call __ecp_nistz256_mul_by_2 ! p256_mul_by_2(Hsqr, U2);
1203 add %sp,LOCALS+$Hsqr,$rp
1205 add %sp,LOCALS+$Rsqr,$bp
1206 call __ecp_nistz256_sub_morf ! p256_sub(res_x, Rsqr, Hsqr);
1207 add %sp,LOCALS+$res_x,$rp
1209 add %sp,LOCALS+$Hcub,$bp
1210 call __ecp_nistz256_sub_from ! p256_sub(res_x, res_x, Hcub);
1211 add %sp,LOCALS+$res_x,$rp
1213 add %sp,LOCALS+$U2,$bp
1214 call __ecp_nistz256_sub_morf ! p256_sub(res_y, U2, res_x);
1215 add %sp,LOCALS+$res_y,$rp
1218 add %sp,LOCALS+$Hcub,$ap
1219 call __ecp_nistz256_mul_mont ! p256_mul_mont(S2, in1_y, Hcub);
1220 add %sp,LOCALS+$S2,$rp
1222 add %sp,LOCALS+$R,$bp
1223 add %sp,LOCALS+$res_y,$ap
1224 call __ecp_nistz256_mul_mont ! p256_mul_mont(res_y, res_y, R);
1225 add %sp,LOCALS+$res_y,$rp
1227 add %sp,LOCALS+$S2,$bp
1228 call __ecp_nistz256_sub_from ! p256_sub(res_y, res_y, S2);
1229 add %sp,LOCALS+$res_y,$rp
1231 ld [%fp+STACK_BIAS-16],$t1 ! !in1infty
1232 ld [%fp+STACK_BIAS-12],$t2 ! !in2infty
1233 ldx [%fp+STACK_BIAS-8],$rp
1235 for($i=0;$i<64;$i+=8) { # conditional moves
1237 ld [%sp+LOCALS+$i],@acc[0] ! res
1238 ld [%sp+LOCALS+$i+4],@acc[1]
1239 ld [$bp_real+$i],@acc[2] ! in2
1240 ld [$bp_real+$i+4],@acc[3]
1241 ld [$ap_real+$i],@acc[4] ! in1
1242 ld [$ap_real+$i+4],@acc[5]
1243 movrz $t1,@acc[2],@acc[0]
1244 movrz $t1,@acc[3],@acc[1]
1245 movrz $t2,@acc[4],@acc[0]
1246 movrz $t2,@acc[5],@acc[1]
1248 st @acc[1],[$rp+$i+4]
1254 ld [%sp+LOCALS+$i],@acc[0] ! res
1255 ld [%sp+LOCALS+$i+4],@acc[1]
1256 ld [$ap_real+$i],@acc[4] ! in1
1257 ld [$ap_real+$i+4],@acc[5]
1258 movrz $t1,@ONE_mont[$j],@acc[0]
1259 movrz $t1,@ONE_mont[$j+1],@acc[1]
1260 movrz $t2,@acc[4],@acc[0]
1261 movrz $t2,@acc[5],@acc[1]
1263 st @acc[1],[$rp+$i+4]
1269 .type ecp_nistz256_point_add_affine,#function
1270 .size ecp_nistz256_point_add_affine,.-ecp_nistz256_point_add_affine
1274 my ($out,$inp,$index)=map("%i$_",(0..2));
1278 ! void ecp_nistz256_select_w5(P256_POINT *%i0,const void *%i1,
1280 .globl ecp_nistz256_select_w5
1282 ecp_nistz256_select_w5:
1283 save %sp,-STACK_FRAME,%sp
1288 add $index,$mask,$index
1290 add $inp,$index,$inp
1373 .type ecp_nistz256_select_w5,#function
1374 .size ecp_nistz256_select_w5,.-ecp_nistz256_select_w5
1376 ! void ecp_nistz256_select_w7(P256_POINT_AFFINE *%i0,const void *%i1,
1378 .globl ecp_nistz256_select_w7
1380 ecp_nistz256_select_w7:
1381 save %sp,-STACK_FRAME,%sp
1386 add $index,$mask,$index
1387 add $inp,$index,$inp
1391 ldub [$inp+64*0],%l0
1392 prefetch [$inp+3840+64*0],1
1393 subcc $index,1,$index
1394 ldub [$inp+64*1],%l1
1395 prefetch [$inp+3840+64*1],1
1396 ldub [$inp+64*2],%l2
1397 prefetch [$inp+3840+64*2],1
1398 ldub [$inp+64*3],%l3
1399 prefetch [$inp+3840+64*3],1
1414 .type ecp_nistz256_select_w7,#function
1415 .size ecp_nistz256_select_w7,.-ecp_nistz256_select_w7
1419 ########################################################################
1420 # Following subroutines are VIS3 counterparts of those above that
1421 # implement ones found in ecp_nistz256.c. Key difference is that they
1422 # use 128-bit muliplication and addition with 64-bit carry, and in order
1423 # to do that they perform conversion from uin32_t[8] to uint64_t[4] upon
1424 # entry and vice versa on return.
1426 my ($rp,$ap,$bp)=map("%i$_",(0..2));
1427 my ($t0,$t1,$t2,$t3,$a0,$a1,$a2,$a3)=map("%l$_",(0..7));
1428 my ($acc0,$acc1,$acc2,$acc3,$acc4,$acc5)=map("%o$_",(0..5));
1429 my ($bi,$poly1,$poly3,$minus1)=(map("%i$_",(3..5)),"%g1");
1430 my ($rp_real,$ap_real)=("%g2","%g3");
1431 my ($acc6,$acc7)=($bp,$bi); # used in squaring
1436 __ecp_nistz256_mul_by_2_vis3:
1437 addcc $acc0,$acc0,$acc0
1438 addxccc $acc1,$acc1,$acc1
1439 addxccc $acc2,$acc2,$acc2
1440 addxccc $acc3,$acc3,$acc3
1441 b .Lreduce_by_sub_vis3
1442 addxc %g0,%g0,$acc4 ! did it carry?
1443 .type __ecp_nistz256_mul_by_2_vis3,#function
1444 .size __ecp_nistz256_mul_by_2_vis3,.-__ecp_nistz256_mul_by_2_vis3
1447 __ecp_nistz256_add_vis3:
1453 __ecp_nistz256_add_noload_vis3:
1455 addcc $t0,$acc0,$acc0
1456 addxccc $t1,$acc1,$acc1
1457 addxccc $t2,$acc2,$acc2
1458 addxccc $t3,$acc3,$acc3
1459 addxc %g0,%g0,$acc4 ! did it carry?
1461 .Lreduce_by_sub_vis3:
1463 addcc $acc0,1,$t0 ! add -modulus, i.e. subtract
1464 addxccc $acc1,$poly1,$t1
1465 addxccc $acc2,$minus1,$t2
1466 addxccc $acc3,$poly3,$t3
1467 addxc $acc4,$minus1,$acc4
1469 movrz $acc4,$t0,$acc0 ! ret = borrow ? ret : ret-modulus
1470 movrz $acc4,$t1,$acc1
1472 movrz $acc4,$t2,$acc2
1474 movrz $acc4,$t3,$acc3
1478 .type __ecp_nistz256_add_vis3,#function
1479 .size __ecp_nistz256_add_vis3,.-__ecp_nistz256_add_vis3
1481 ! Trouble with subtraction is that there is no subtraction with 64-bit
1482 ! borrow, only with 32-bit one. For this reason we "decompose" 64-bit
1483 ! $acc0-$acc3 to 32-bit values and pick b[4] in 32-bit pieces. But
1484 ! recall that SPARC is big-endian, which is why you'll observe that
1485 ! b
[4] is accessed as
4-0-12-8-20-16-28-24. And prior reduction we
1486 ! "collect" result back to
64-bit
$acc0-$acc3.
1488 __ecp_nistz256_sub_from_vis3
:
1497 subcc
$acc0,$t0,$acc0
1499 subccc
$acc4,$t1,$acc4
1501 subccc
$acc1,$t2,$acc1
1503 and $acc0,$poly1,$acc0
1504 subccc
$acc5,$t3,$acc5
1507 and $acc1,$poly1,$acc1
1509 or $acc0,$acc4,$acc0
1511 or $acc1,$acc5,$acc1
1513 subccc
$acc2,$t0,$acc2
1514 subccc
$acc4,$t1,$acc4
1515 subccc
$acc3,$t2,$acc3
1516 and $acc2,$poly1,$acc2
1517 subccc
$acc5,$t3,$acc5
1519 and $acc3,$poly1,$acc3
1521 or $acc2,$acc4,$acc2
1522 subc
%g0,%g0,$acc4 ! did it borrow?
1523 b
.Lreduce_by_add_vis3
1524 or $acc3,$acc5,$acc3
1525 .type __ecp_nistz256_sub_from_vis3
,#function
1526 .size __ecp_nistz256_sub_from_vis3
,.-__ecp_nistz256_sub_from_vis3
1529 __ecp_nistz256_sub_morf_vis3
:
1538 subcc
$t0,$acc0,$acc0
1540 subccc
$t1,$acc4,$acc4
1542 subccc
$t2,$acc1,$acc1
1544 and $acc0,$poly1,$acc0
1545 subccc
$t3,$acc5,$acc5
1548 and $acc1,$poly1,$acc1
1550 or $acc0,$acc4,$acc0
1552 or $acc1,$acc5,$acc1
1554 subccc
$t0,$acc2,$acc2
1555 subccc
$t1,$acc4,$acc4
1556 subccc
$t2,$acc3,$acc3
1557 and $acc2,$poly1,$acc2
1558 subccc
$t3,$acc5,$acc5
1560 and $acc3,$poly1,$acc3
1562 or $acc2,$acc4,$acc2
1563 subc
%g0,%g0,$acc4 ! did it borrow?
1564 or $acc3,$acc5,$acc3
1566 .Lreduce_by_add_vis3
:
1568 addcc
$acc0,-1,$t0 ! add modulus
1570 addxccc
$acc1,$poly1,$t1
1571 not $poly1,$poly1 ! restore
$poly1
1572 addxccc
$acc2,%g0,$t2
1575 movrnz
$acc4,$t0,$acc0 ! if a
-b borrowed
, ret
= ret
+mod
1576 movrnz
$acc4,$t1,$acc1
1578 movrnz
$acc4,$t2,$acc2
1580 movrnz
$acc4,$t3,$acc3
1584 .type __ecp_nistz256_sub_morf_vis3
,#function
1585 .size __ecp_nistz256_sub_morf_vis3
,.-__ecp_nistz256_sub_morf_vis3
1588 __ecp_nistz256_div_by_2_vis3
:
1589 ! ret
= (a is odd ? a
+mod
: a
) >> 1
1594 addcc
$acc0,-1,$t0 ! add modulus
1595 addxccc
$acc1,$t1,$t1
1596 addxccc
$acc2,%g0,$t2
1597 addxccc
$acc3,$t3,$t3
1598 addxc
%g0,%g0,$acc4 ! carry bit
1600 movrnz
$acc5,$t0,$acc0
1601 movrnz
$acc5,$t1,$acc1
1602 movrnz
$acc5,$t2,$acc2
1603 movrnz
$acc5,$t3,$acc3
1604 movrz
$acc5,%g0,$acc4
1619 sllx
$acc4,63,$t3 ! don
't forget carry bit
1625 .type __ecp_nistz256_div_by_2_vis3,#function
1626 .size __ecp_nistz256_div_by_2_vis3,.-__ecp_nistz256_div_by_2_vis3
1628 ! compared to __ecp_nistz256_mul_mont it's almost
4x smaller
and
1629 ! 4x faster
[on T4
]...
1631 __ecp_nistz256_mul_mont_vis3
:
1633 not $poly3,$poly3 ! 0xFFFFFFFF00000001
1641 ldx
[$bp+8],$bi ! b
[1]
1643 addcc
$acc1,$t0,$acc1 ! accumulate high parts of multiplication
1645 addxccc
$acc2,$t1,$acc2
1647 addxccc
$acc3,$t2,$acc3
1651 for($i=1;$i<4;$i++) {
1652 # Reduction iteration is normally performed by accumulating
1653 # result of multiplication of modulus by "magic" digit [and
1654 # omitting least significant word, which is guaranteed to
1655 # be 0], but thanks to special form of modulus and "magic"
1656 # digit being equal to least significant word, it can be
1657 # performed with additions and subtractions alone. Indeed:
1659 # ffff0001.00000000.0000ffff.ffffffff
1661 # + xxxxxxxx.xxxxxxxx.xxxxxxxx.xxxxxxxx.abcdefgh
1663 # Now observing that ff..ff*x = (2^n-1)*x = 2^n*x-x, we
1666 # xxxxxxxx.xxxxxxxx.xxxxxxxx.xxxxxxxx.abcdefgh
1667 # + abcdefgh.abcdefgh.0000abcd.efgh0000.00000000
1668 # - 0000abcd.efgh0000.00000000.00000000.abcdefgh
1670 # or marking redundant operations:
1672 # xxxxxxxx.xxxxxxxx.xxxxxxxx.xxxxxxxx.--------
1673 # + abcdefgh.abcdefgh.0000abcd.efgh0000.--------
1674 # - 0000abcd.efgh0000.--------.--------.--------
1675 # ^^^^^^^^ but this word is calculated with umulxhi, because
1676 # there is no subtract with 64-bit borrow:-(
1679 sub $acc0,$t0,$t2 ! acc0
*0xFFFFFFFF00000001, low part
1680 umulxhi
$acc0,$poly3,$t3 ! acc0
*0xFFFFFFFF00000001, high part
1681 addcc
$acc1,$t0,$acc0 ! +=acc
[0]<<96 and omit acc
[0]
1683 addxccc
$acc2,$t1,$acc1
1685 addxccc
$acc3,$t2,$acc2 ! +=acc
[0]*0xFFFFFFFF00000001
1687 addxccc
$acc4,$t3,$acc3
1689 addxc
$acc5,%g0,$acc4
1691 addcc
$acc0,$t0,$acc0 ! accumulate low parts of multiplication
1693 addxccc
$acc1,$t1,$acc1
1695 addxccc
$acc2,$t2,$acc2
1697 addxccc
$acc3,$t3,$acc3
1699 addxc
$acc4,%g0,$acc4
1701 $code.=<<___
if ($i<3);
1702 ldx
[$bp+8*($i+1)],$bi ! bp
[$i+1]
1705 addcc
$acc1,$t0,$acc1 ! accumulate high parts of multiplication
1707 addxccc
$acc2,$t1,$acc2
1709 addxccc
$acc3,$t2,$acc3
1710 addxccc
$acc4,$t3,$acc4
1715 sub $acc0,$t0,$t2 ! acc0
*0xFFFFFFFF00000001, low part
1716 umulxhi
$acc0,$poly3,$t3 ! acc0
*0xFFFFFFFF00000001, high part
1717 addcc
$acc1,$t0,$acc0 ! +=acc
[0]<<96 and omit acc
[0]
1718 addxccc
$acc2,$t1,$acc1
1719 addxccc
$acc3,$t2,$acc2 ! +=acc
[0]*0xFFFFFFFF00000001
1720 addxccc
$acc4,$t3,$acc3
1721 b
.Lmul_final_vis3
! see below
1722 addxc
$acc5,%g0,$acc4
1723 .type __ecp_nistz256_mul_mont_vis3
,#function
1724 .size __ecp_nistz256_mul_mont_vis3
,.-__ecp_nistz256_mul_mont_vis3
1726 ! compared to above __ecp_nistz256_mul_mont_vis3 it
's 21% less
1727 ! instructions, but only 14% faster [on T4]...
1729 __ecp_nistz256_sqr_mont_vis3:
1730 ! | | | | | |a1*a0| |
1731 ! | | | | |a2*a0| | |
1732 ! | |a3*a2|a3*a0| | | |
1733 ! | | | |a2*a1| | | |
1734 ! | | |a3*a1| | | | |
1735 ! *| | | | | | | | 2|
1736 ! +|a3*a3|a2*a2|a1*a1|a0*a0|
1737 ! |--+--+--+--+--+--+--+--|
1738 ! |A7|A6|A5|A4|A3|A2|A1|A0|, where Ax is $accx, i.e. follow $accx
1740 ! "can't overflow
" below mark carrying into high part of
1741 ! multiplication result, which can't overflow, because it
1742 ! can never be all ones.
1744 mulx $a1,$a0,$acc1 ! a[1]*a[0]
1746 mulx $a2,$a0,$acc2 ! a[2]*a[0]
1748 mulx $a3,$a0,$acc3 ! a[3]*a[0]
1749 umulxhi $a3,$a0,$acc4
1751 addcc $acc2,$t1,$acc2 ! accumulate high parts of multiplication
1752 mulx $a2,$a1,$t0 ! a[2]*a[1]
1754 addxccc $acc3,$t2,$acc3
1755 mulx $a3,$a1,$t2 ! a[3]*a[1]
1757 addxc $acc4,%g0,$acc4 ! can't overflow
1759 mulx $a3,$a2,$acc5 ! a[3]*a[2]
1760 not $poly3,$poly3 ! 0xFFFFFFFF00000001
1761 umulxhi $a3,$a2,$acc6
1763 addcc $t2,$t1,$t1 ! accumulate high parts of multiplication
1764 mulx $a0,$a0,$acc0 ! a[0]*a[0]
1765 addxc $t3,%g0,$t2 ! can't overflow
1767 addcc $acc3,$t0,$acc3 ! accumulate low parts of multiplication
1769 addxccc $acc4,$t1,$acc4
1770 mulx $a1,$a1,$t1 ! a[1]*a[1]
1771 addxccc $acc5,$t2,$acc5
1773 addxc $acc6,%g0,$acc6 ! can't overflow
1775 addcc $acc1,$acc1,$acc1 ! acc[1-6]*=2
1776 mulx $a2,$a2,$t2 ! a[2]*a[2]
1777 addxccc $acc2,$acc2,$acc2
1779 addxccc $acc3,$acc3,$acc3
1780 mulx $a3,$a3,$t3 ! a[3]*a[3]
1781 addxccc $acc4,$acc4,$acc4
1783 addxccc $acc5,$acc5,$acc5
1784 addxccc $acc6,$acc6,$acc6
1787 addcc $acc1,$a0,$acc1 ! +a[i]*a[i]
1788 addxccc $acc2,$t1,$acc2
1789 addxccc $acc3,$a1,$acc3
1790 addxccc $acc4,$t2,$acc4
1792 addxccc $acc5,$a2,$acc5
1794 addxccc $acc6,$t3,$acc6
1795 sub $acc0,$t0,$t2 ! acc0*0xFFFFFFFF00000001, low part
1796 addxc $acc7,$a3,$acc7
1798 for($i=0;$i<3;$i++) { # reductions, see commentary
1799 # in multiplication for details
1801 umulxhi $acc0,$poly3,$t3 ! acc0*0xFFFFFFFF00000001, high part
1802 addcc $acc1,$t0,$acc0 ! +=acc[0]<<96 and omit acc[0]
1804 addxccc $acc2,$t1,$acc1
1806 addxccc $acc3,$t2,$acc2 ! +=acc[0]*0xFFFFFFFF00000001
1807 sub $acc0,$t0,$t2 ! acc0*0xFFFFFFFF00000001, low part
1808 addxc %g0,$t3,$acc3 ! cant't overflow
1812 umulxhi $acc0,$poly3,$t3 ! acc0*0xFFFFFFFF00000001, high part
1813 addcc $acc1,$t0,$acc0 ! +=acc[0]<<96 and omit acc[0]
1814 addxccc $acc2,$t1,$acc1
1815 addxccc $acc3,$t2,$acc2 ! +=acc[0]*0xFFFFFFFF00000001
1816 addxc %g0,$t3,$acc3 ! can't overflow
1818 addcc $acc0,$acc4,$acc0 ! accumulate upper half
1819 addxccc $acc1,$acc5,$acc1
1820 addxccc $acc2,$acc6,$acc2
1821 addxccc $acc3,$acc7,$acc3
1826 ! Final step is "if result
> mod
, subtract mod
", but as comparison
1827 ! means subtraction, we do the subtraction and then copy outcome
1828 ! if it didn't borrow. But note that as we [have to] replace
1829 ! subtraction with addition with negative, carry/borrow logic is
1832 addcc $acc0,1,$t0 ! add -modulus, i.e. subtract
1833 not $poly3,$poly3 ! restore 0x00000000FFFFFFFE
1834 addxccc $acc1,$poly1,$t1
1835 addxccc $acc2,$minus1,$t2
1836 addxccc $acc3,$poly3,$t3
1837 addxccc $acc4,$minus1,%g0 ! did it carry?
1839 movcs %xcc,$t0,$acc0
1840 movcs %xcc,$t1,$acc1
1842 movcs %xcc,$t2,$acc2
1844 movcs %xcc,$t3,$acc3
1848 .type __ecp_nistz256_sqr_mont_vis3,#function
1849 .size __ecp_nistz256_sqr_mont_vis3,.-__ecp_nistz256_sqr_mont_vis3
1852 ########################################################################
1853 # void ecp_nistz256_point_double(P256_POINT *out,const P256_POINT *inp);
1856 my ($res_x,$res_y,$res_z,
1858 $S,$M,$Zsqr,$tmp0)=map(32*$_,(0..9));
1859 # above map() describes stack layout with 10 temporary
1860 # 256-bit vectors on top.
1864 ecp_nistz256_point_double_vis3:
1865 save %sp,-STACK64_FRAME-32*10,%sp
1868 .Ldouble_shortcut_vis3:
1871 sllx $minus1,32,$poly1 ! 0xFFFFFFFF00000000
1872 srl $poly3,0,$poly3 ! 0x00000000FFFFFFFE
1874 ! convert input to uint64_t[4]
1885 ld [$ap+32],$acc0 ! in_y
1893 ld [$ap+32+16],$acc2
1897 ld [$ap+32+24],$acc3
1901 stx $a0,[%sp+LOCALS64+$in_x]
1903 stx $a1,[%sp+LOCALS64+$in_x+8]
1905 stx $a2,[%sp+LOCALS64+$in_x+16]
1907 stx $a3,[%sp+LOCALS64+$in_x+24]
1909 stx $acc0,[%sp+LOCALS64+$in_y]
1911 stx $acc1,[%sp+LOCALS64+$in_y+8]
1913 stx $acc2,[%sp+LOCALS64+$in_y+16]
1914 stx $acc3,[%sp+LOCALS64+$in_y+24]
1916 ld [$ap+64],$a0 ! in_z
1934 stx $a0,[%sp+LOCALS64+$in_z]
1936 stx $a1,[%sp+LOCALS64+$in_z+8]
1938 stx $a2,[%sp+LOCALS64+$in_z+16]
1939 stx $a3,[%sp+LOCALS64+$in_z+24]
1941 ! in_y is still in $acc0-$acc3
1942 call __ecp_nistz256_mul_by_2_vis3 ! p256_mul_by_2(S, in_y);
1943 add %sp,LOCALS64+$S,$rp
1945 ! in_z is still in $a0-$a3
1946 call __ecp_nistz256_sqr_mont_vis3 ! p256_sqr_mont(Zsqr, in_z);
1947 add %sp,LOCALS64+$Zsqr,$rp
1949 mov $acc0,$a0 ! put Zsqr aside
1954 add %sp,LOCALS64+$in_x,$bp
1955 call __ecp_nistz256_add_vis3 ! p256_add(M, Zsqr, in_x);
1956 add %sp,LOCALS64+$M,$rp
1958 mov $a0,$acc0 ! restore Zsqr
1959 ldx [%sp+LOCALS64+$S],$a0 ! forward load
1961 ldx [%sp+LOCALS64+$S+8],$a1
1963 ldx [%sp+LOCALS64+$S+16],$a2
1965 ldx [%sp+LOCALS64+$S+24],$a3
1967 add %sp,LOCALS64+$in_x,$bp
1968 call __ecp_nistz256_sub_morf_vis3 ! p256_sub(Zsqr, in_x, Zsqr);
1969 add %sp,LOCALS64+$Zsqr,$rp
1971 call __ecp_nistz256_sqr_mont_vis3 ! p256_sqr_mont(S, S);
1972 add %sp,LOCALS64+$S,$rp
1974 ldx [%sp+LOCALS64+$in_z],$bi
1975 ldx [%sp+LOCALS64+$in_y],$a0
1976 ldx [%sp+LOCALS64+$in_y+8],$a1
1977 ldx [%sp+LOCALS64+$in_y+16],$a2
1978 ldx [%sp+LOCALS64+$in_y+24],$a3
1979 add %sp,LOCALS64+$in_z,$bp
1980 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(tmp0, in_z, in_y);
1981 add %sp,LOCALS64+$tmp0,$rp
1983 ldx [%sp+LOCALS64+$M],$bi ! forward load
1984 ldx [%sp+LOCALS64+$Zsqr],$a0
1985 ldx [%sp+LOCALS64+$Zsqr+8],$a1
1986 ldx [%sp+LOCALS64+$Zsqr+16],$a2
1987 ldx [%sp+LOCALS64+$Zsqr+24],$a3
1989 call __ecp_nistz256_mul_by_2_vis3 ! p256_mul_by_2(res_z, tmp0);
1990 add %sp,LOCALS64+$res_z,$rp
1992 add %sp,LOCALS64+$M,$bp
1993 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(M, M, Zsqr);
1994 add %sp,LOCALS64+$M,$rp
1996 mov $acc0,$a0 ! put aside M
2000 call __ecp_nistz256_mul_by_2_vis3
2001 add %sp,LOCALS64+$M,$rp
2002 mov $a0,$t0 ! copy M
2003 ldx [%sp+LOCALS64+$S],$a0 ! forward load
2005 ldx [%sp+LOCALS64+$S+8],$a1
2007 ldx [%sp+LOCALS64+$S+16],$a2
2009 ldx [%sp+LOCALS64+$S+24],$a3
2010 call __ecp_nistz256_add_noload_vis3 ! p256_mul_by_3(M, M);
2011 add %sp,LOCALS64+$M,$rp
2013 call __ecp_nistz256_sqr_mont_vis3 ! p256_sqr_mont(tmp0, S);
2014 add %sp,LOCALS64+$tmp0,$rp
2016 ldx [%sp+LOCALS64+$S],$bi ! forward load
2017 ldx [%sp+LOCALS64+$in_x],$a0
2018 ldx [%sp+LOCALS64+$in_x+8],$a1
2019 ldx [%sp+LOCALS64+$in_x+16],$a2
2020 ldx [%sp+LOCALS64+$in_x+24],$a3
2022 call __ecp_nistz256_div_by_2_vis3 ! p256_div_by_2(res_y, tmp0);
2023 add %sp,LOCALS64+$res_y,$rp
2025 add %sp,LOCALS64+$S,$bp
2026 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(S, S, in_x);
2027 add %sp,LOCALS64+$S,$rp
2029 ldx [%sp+LOCALS64+$M],$a0 ! forward load
2030 ldx [%sp+LOCALS64+$M+8],$a1
2031 ldx [%sp+LOCALS64+$M+16],$a2
2032 ldx [%sp+LOCALS64+$M+24],$a3
2034 call __ecp_nistz256_mul_by_2_vis3 ! p256_mul_by_2(tmp0, S);
2035 add %sp,LOCALS64+$tmp0,$rp
2037 call __ecp_nistz256_sqr_mont_vis3 ! p256_sqr_mont(res_x, M);
2038 add %sp,LOCALS64+$res_x,$rp
2040 add %sp,LOCALS64+$tmp0,$bp
2041 call __ecp_nistz256_sub_from_vis3 ! p256_sub(res_x, res_x, tmp0);
2042 add %sp,LOCALS64+$res_x,$rp
2044 ldx [%sp+LOCALS64+$M],$a0 ! forward load
2045 ldx [%sp+LOCALS64+$M+8],$a1
2046 ldx [%sp+LOCALS64+$M+16],$a2
2047 ldx [%sp+LOCALS64+$M+24],$a3
2049 add %sp,LOCALS64+$S,$bp
2050 call __ecp_nistz256_sub_morf_vis3 ! p256_sub(S, S, res_x);
2051 add %sp,LOCALS64+$S,$rp
2054 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(S, S, M);
2055 add %sp,LOCALS64+$S,$rp
2057 ldx [%sp+LOCALS64+$res_x],$a0 ! forward load
2058 ldx [%sp+LOCALS64+$res_x+8],$a1
2059 ldx [%sp+LOCALS64+$res_x+16],$a2
2060 ldx [%sp+LOCALS64+$res_x+24],$a3
2062 add %sp,LOCALS64+$res_y,$bp
2063 call __ecp_nistz256_sub_from_vis3 ! p256_sub(res_y, S, res_y);
2064 add %sp,LOCALS64+$res_y,$bp
2066 ! convert output to uint_32[8]
2069 st $a0,[$rp_real] ! res_x
2074 st $t1,[$rp_real+12]
2075 st $a2,[$rp_real+16]
2076 st $t2,[$rp_real+20]
2077 st $a3,[$rp_real+24]
2078 st $t3,[$rp_real+28]
2080 ldx [%sp+LOCALS64+$res_z],$a0 ! forward load
2082 ldx [%sp+LOCALS64+$res_z+8],$a1
2084 ldx [%sp+LOCALS64+$res_z+16],$a2
2086 ldx [%sp+LOCALS64+$res_z+24],$a3
2088 st $acc0,[$rp_real+32] ! res_y
2089 st $t0, [$rp_real+32+4]
2090 st $acc1,[$rp_real+32+8]
2091 st $t1, [$rp_real+32+12]
2092 st $acc2,[$rp_real+32+16]
2093 st $t2, [$rp_real+32+20]
2094 st $acc3,[$rp_real+32+24]
2095 st $t3, [$rp_real+32+28]
2099 st $a0,[$rp_real+64] ! res_z
2101 st $t0,[$rp_real+64+4]
2103 st $a1,[$rp_real+64+8]
2104 st $t1,[$rp_real+64+12]
2105 st $a2,[$rp_real+64+16]
2106 st $t2,[$rp_real+64+20]
2107 st $a3,[$rp_real+64+24]
2108 st $t3,[$rp_real+64+28]
2112 .type ecp_nistz256_point_double_vis3,#function
2113 .size ecp_nistz256_point_double_vis3,.-ecp_nistz256_point_double_vis3
2116 ########################################################################
2117 # void ecp_nistz256_point_add(P256_POINT *out,const P256_POINT *in1,
2118 # const P256_POINT *in2);
2120 my ($res_x,$res_y,$res_z,
2121 $in1_x,$in1_y,$in1_z,
2122 $in2_x,$in2_y,$in2_z,
2123 $H,$Hsqr,$R,$Rsqr,$Hcub,
2124 $U1,$U2,$S1,$S2)=map(32*$_,(0..17));
2125 my ($Z1sqr, $Z2sqr) = ($Hsqr, $Rsqr);
2127 # above map() describes stack layout with 18 temporary
2128 # 256-bit vectors on top. Then we reserve some space for
2129 # !in1infty, !in2infty and result of check for zero.
2132 .globl ecp_nistz256_point_add_vis3
2134 ecp_nistz256_point_add_vis3:
2135 save %sp,-STACK64_FRAME-32*18-32,%sp
2140 sllx $minus1,32,$poly1 ! 0xFFFFFFFF00000000
2141 srl $poly3,0,$poly3 ! 0x00000000FFFFFFFE
2143 ! convert input to uint64_t[4]
2144 ld [$bp],$a0 ! in2_x
2154 ld [$bp+32],$acc0 ! in2_y
2162 ld [$bp+32+16],$acc2
2166 ld [$bp+32+24],$acc3
2170 stx $a0,[%sp+LOCALS64+$in2_x]
2172 stx $a1,[%sp+LOCALS64+$in2_x+8]
2174 stx $a2,[%sp+LOCALS64+$in2_x+16]
2176 stx $a3,[%sp+LOCALS64+$in2_x+24]
2178 stx $acc0,[%sp+LOCALS64+$in2_y]
2180 stx $acc1,[%sp+LOCALS64+$in2_y+8]
2182 stx $acc2,[%sp+LOCALS64+$in2_y+16]
2183 stx $acc3,[%sp+LOCALS64+$in2_y+24]
2185 ld [$bp+64],$acc0 ! in2_z
2189 ld [$bp+64+16],$acc2
2191 ld [$bp+64+24],$acc3
2195 ld [$ap],$a0 ! in1_x
2211 stx $acc0,[%sp+LOCALS64+$in2_z]
2213 stx $acc1,[%sp+LOCALS64+$in2_z+8]
2215 stx $acc2,[%sp+LOCALS64+$in2_z+16]
2216 stx $acc3,[%sp+LOCALS64+$in2_z+24]
2218 or $acc1,$acc0,$acc0
2219 or $acc3,$acc2,$acc2
2220 or $acc2,$acc0,$acc0
2221 movrnz $acc0,-1,$acc0 ! !in2infty
2222 stx $acc0,[%fp+STACK_BIAS-8]
2225 ld [$ap+32],$acc0 ! in1_y
2232 ld [$ap+32+16],$acc2
2234 ld [$ap+32+24],$acc3
2238 stx $a0,[%sp+LOCALS64+$in1_x]
2240 stx $a1,[%sp+LOCALS64+$in1_x+8]
2242 stx $a2,[%sp+LOCALS64+$in1_x+16]
2244 stx $a3,[%sp+LOCALS64+$in1_x+24]
2246 stx $acc0,[%sp+LOCALS64+$in1_y]
2248 stx $acc1,[%sp+LOCALS64+$in1_y+8]
2250 stx $acc2,[%sp+LOCALS64+$in1_y+16]
2251 stx $acc3,[%sp+LOCALS64+$in1_y+24]
2253 ldx [%sp+LOCALS64+$in2_z],$a0 ! forward load
2254 ldx [%sp+LOCALS64+$in2_z+8],$a1
2255 ldx [%sp+LOCALS64+$in2_z+16],$a2
2256 ldx [%sp+LOCALS64+$in2_z+24],$a3
2258 ld [$ap+64],$acc0 ! in1_z
2262 ld [$ap+64+16],$acc2
2264 ld [$ap+64+24],$acc3
2272 stx $acc0,[%sp+LOCALS64+$in1_z]
2274 stx $acc1,[%sp+LOCALS64+$in1_z+8]
2276 stx $acc2,[%sp+LOCALS64+$in1_z+16]
2277 stx $acc3,[%sp+LOCALS64+$in1_z+24]
2279 or $acc1,$acc0,$acc0
2280 or $acc3,$acc2,$acc2
2281 or $acc2,$acc0,$acc0
2282 movrnz $acc0,-1,$acc0 ! !in1infty
2283 stx $acc0,[%fp+STACK_BIAS-16]
2285 call __ecp_nistz256_sqr_mont_vis3 ! p256_sqr_mont(Z2sqr, in2_z);
2286 add %sp,LOCALS64+$Z2sqr,$rp
2288 ldx [%sp+LOCALS64+$in1_z],$a0
2289 ldx [%sp+LOCALS64+$in1_z+8],$a1
2290 ldx [%sp+LOCALS64+$in1_z+16],$a2
2291 ldx [%sp+LOCALS64+$in1_z+24],$a3
2292 call __ecp_nistz256_sqr_mont_vis3 ! p256_sqr_mont(Z1sqr, in1_z);
2293 add %sp,LOCALS64+$Z1sqr,$rp
2295 ldx [%sp+LOCALS64+$Z2sqr],$bi
2296 ldx [%sp+LOCALS64+$in2_z],$a0
2297 ldx [%sp+LOCALS64+$in2_z+8],$a1
2298 ldx [%sp+LOCALS64+$in2_z+16],$a2
2299 ldx [%sp+LOCALS64+$in2_z+24],$a3
2300 add %sp,LOCALS64+$Z2sqr,$bp
2301 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(S1, Z2sqr, in2_z);
2302 add %sp,LOCALS64+$S1,$rp
2304 ldx [%sp+LOCALS64+$Z1sqr],$bi
2305 ldx [%sp+LOCALS64+$in1_z],$a0
2306 ldx [%sp+LOCALS64+$in1_z+8],$a1
2307 ldx [%sp+LOCALS64+$in1_z+16],$a2
2308 ldx [%sp+LOCALS64+$in1_z+24],$a3
2309 add %sp,LOCALS64+$Z1sqr,$bp
2310 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(S2, Z1sqr, in1_z);
2311 add %sp,LOCALS64+$S2,$rp
2313 ldx [%sp+LOCALS64+$S1],$bi
2314 ldx [%sp+LOCALS64+$in1_y],$a0
2315 ldx [%sp+LOCALS64+$in1_y+8],$a1
2316 ldx [%sp+LOCALS64+$in1_y+16],$a2
2317 ldx [%sp+LOCALS64+$in1_y+24],$a3
2318 add %sp,LOCALS64+$S1,$bp
2319 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(S1, S1, in1_y);
2320 add %sp,LOCALS64+$S1,$rp
2322 ldx [%sp+LOCALS64+$S2],$bi
2323 ldx [%sp+LOCALS64+$in2_y],$a0
2324 ldx [%sp+LOCALS64+$in2_y+8],$a1
2325 ldx [%sp+LOCALS64+$in2_y+16],$a2
2326 ldx [%sp+LOCALS64+$in2_y+24],$a3
2327 add %sp,LOCALS64+$S2,$bp
2328 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(S2, S2, in2_y);
2329 add %sp,LOCALS64+$S2,$rp
2331 ldx [%sp+LOCALS64+$Z2sqr],$bi ! forward load
2332 ldx [%sp+LOCALS64+$in1_x],$a0
2333 ldx [%sp+LOCALS64+$in1_x+8],$a1
2334 ldx [%sp+LOCALS64+$in1_x+16],$a2
2335 ldx [%sp+LOCALS64+$in1_x+24],$a3
2337 add %sp,LOCALS64+$S1,$bp
2338 call __ecp_nistz256_sub_from_vis3 ! p256_sub(R, S2, S1);
2339 add %sp,LOCALS64+$R,$rp
2341 or $acc1,$acc0,$acc0 ! see if result is zero
2342 or $acc3,$acc2,$acc2
2343 or $acc2,$acc0,$acc0
2344 stx $acc0,[%fp+STACK_BIAS-24]
2346 add %sp,LOCALS64+$Z2sqr,$bp
2347 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(U1, in1_x, Z2sqr);
2348 add %sp,LOCALS64+$U1,$rp
2350 ldx [%sp+LOCALS64+$Z1sqr],$bi
2351 ldx [%sp+LOCALS64+$in2_x],$a0
2352 ldx [%sp+LOCALS64+$in2_x+8],$a1
2353 ldx [%sp+LOCALS64+$in2_x+16],$a2
2354 ldx [%sp+LOCALS64+$in2_x+24],$a3
2355 add %sp,LOCALS64+$Z1sqr,$bp
2356 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(U2, in2_x, Z1sqr);
2357 add %sp,LOCALS64+$U2,$rp
2359 ldx [%sp+LOCALS64+$R],$a0 ! forward load
2360 ldx [%sp+LOCALS64+$R+8],$a1
2361 ldx [%sp+LOCALS64+$R+16],$a2
2362 ldx [%sp+LOCALS64+$R+24],$a3
2364 add %sp,LOCALS64+$U1,$bp
2365 call __ecp_nistz256_sub_from_vis3 ! p256_sub(H, U2, U1);
2366 add %sp,LOCALS64+$H,$rp
2368 or $acc1,$acc0,$acc0 ! see if result is zero
2369 or $acc3,$acc2,$acc2
2370 orcc $acc2,$acc0,$acc0
2372 bne,pt %xcc,.Ladd_proceed_vis3 ! is_equal(U1,U2)?
2375 ldx [%fp+STACK_BIAS-8],$t0
2376 ldx [%fp+STACK_BIAS-16],$t1
2377 ldx [%fp+STACK_BIAS-24],$t2
2379 be,pt %xcc,.Ladd_proceed_vis3 ! (in1infty || in2infty)?
2382 be,a,pt %xcc,.Ldouble_shortcut_vis3 ! is_equal(S1,S2)?
2383 add %sp,32*(12-10)+32,%sp ! difference in frame sizes
2388 st %g0,[$rp_real+12]
2389 st %g0,[$rp_real+16]
2390 st %g0,[$rp_real+20]
2391 st %g0,[$rp_real+24]
2392 st %g0,[$rp_real+28]
2393 st %g0,[$rp_real+32]
2394 st %g0,[$rp_real+32+4]
2395 st %g0,[$rp_real+32+8]
2396 st %g0,[$rp_real+32+12]
2397 st %g0,[$rp_real+32+16]
2398 st %g0,[$rp_real+32+20]
2399 st %g0,[$rp_real+32+24]
2400 st %g0,[$rp_real+32+28]
2401 st %g0,[$rp_real+64]
2402 st %g0,[$rp_real+64+4]
2403 st %g0,[$rp_real+64+8]
2404 st %g0,[$rp_real+64+12]
2405 st %g0,[$rp_real+64+16]
2406 st %g0,[$rp_real+64+20]
2407 st %g0,[$rp_real+64+24]
2408 st %g0,[$rp_real+64+28]
2414 call __ecp_nistz256_sqr_mont_vis3 ! p256_sqr_mont(Rsqr, R);
2415 add %sp,LOCALS64+$Rsqr,$rp
2417 ldx [%sp+LOCALS64+$H],$bi
2418 ldx [%sp+LOCALS64+$in1_z],$a0
2419 ldx [%sp+LOCALS64+$in1_z+8],$a1
2420 ldx [%sp+LOCALS64+$in1_z+16],$a2
2421 ldx [%sp+LOCALS64+$in1_z+24],$a3
2422 add %sp,LOCALS64+$H,$bp
2423 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(res_z, H, in1_z);
2424 add %sp,LOCALS64+$res_z,$rp
2426 ldx [%sp+LOCALS64+$H],$a0
2427 ldx [%sp+LOCALS64+$H+8],$a1
2428 ldx [%sp+LOCALS64+$H+16],$a2
2429 ldx [%sp+LOCALS64+$H+24],$a3
2430 call __ecp_nistz256_sqr_mont_vis3 ! p256_sqr_mont(Hsqr, H);
2431 add %sp,LOCALS64+$Hsqr,$rp
2433 ldx [%sp+LOCALS64+$res_z],$bi
2434 ldx [%sp+LOCALS64+$in2_z],$a0
2435 ldx [%sp+LOCALS64+$in2_z+8],$a1
2436 ldx [%sp+LOCALS64+$in2_z+16],$a2
2437 ldx [%sp+LOCALS64+$in2_z+24],$a3
2438 add %sp,LOCALS64+$res_z,$bp
2439 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(res_z, res_z, in2_z);
2440 add %sp,LOCALS64+$res_z,$rp
2442 ldx [%sp+LOCALS64+$H],$bi
2443 ldx [%sp+LOCALS64+$Hsqr],$a0
2444 ldx [%sp+LOCALS64+$Hsqr+8],$a1
2445 ldx [%sp+LOCALS64+$Hsqr+16],$a2
2446 ldx [%sp+LOCALS64+$Hsqr+24],$a3
2447 add %sp,LOCALS64+$H,$bp
2448 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(Hcub, Hsqr, H);
2449 add %sp,LOCALS64+$Hcub,$rp
2451 ldx [%sp+LOCALS64+$U1],$bi
2452 ldx [%sp+LOCALS64+$Hsqr],$a0
2453 ldx [%sp+LOCALS64+$Hsqr+8],$a1
2454 ldx [%sp+LOCALS64+$Hsqr+16],$a2
2455 ldx [%sp+LOCALS64+$Hsqr+24],$a3
2456 add %sp,LOCALS64+$U1,$bp
2457 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(U2, U1, Hsqr);
2458 add %sp,LOCALS64+$U2,$rp
2460 call __ecp_nistz256_mul_by_2_vis3 ! p256_mul_by_2(Hsqr, U2);
2461 add %sp,LOCALS64+$Hsqr,$rp
2463 add %sp,LOCALS64+$Rsqr,$bp
2464 call __ecp_nistz256_sub_morf_vis3 ! p256_sub(res_x, Rsqr, Hsqr);
2465 add %sp,LOCALS64+$res_x,$rp
2467 add %sp,LOCALS64+$Hcub,$bp
2468 call __ecp_nistz256_sub_from_vis3 ! p256_sub(res_x, res_x, Hcub);
2469 add %sp,LOCALS64+$res_x,$rp
2471 ldx [%sp+LOCALS64+$S1],$bi ! forward load
2472 ldx [%sp+LOCALS64+$Hcub],$a0
2473 ldx [%sp+LOCALS64+$Hcub+8],$a1
2474 ldx [%sp+LOCALS64+$Hcub+16],$a2
2475 ldx [%sp+LOCALS64+$Hcub+24],$a3
2477 add %sp,LOCALS64+$U2,$bp
2478 call __ecp_nistz256_sub_morf_vis3 ! p256_sub(res_y, U2, res_x);
2479 add %sp,LOCALS64+$res_y,$rp
2481 add %sp,LOCALS64+$S1,$bp
2482 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(S2, S1, Hcub);
2483 add %sp,LOCALS64+$S2,$rp
2485 ldx [%sp+LOCALS64+$R],$bi
2486 ldx [%sp+LOCALS64+$res_y],$a0
2487 ldx [%sp+LOCALS64+$res_y+8],$a1
2488 ldx [%sp+LOCALS64+$res_y+16],$a2
2489 ldx [%sp+LOCALS64+$res_y+24],$a3
2490 add %sp,LOCALS64+$R,$bp
2491 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(res_y, res_y, R);
2492 add %sp,LOCALS64+$res_y,$rp
2494 add %sp,LOCALS64+$S2,$bp
2495 call __ecp_nistz256_sub_from_vis3 ! p256_sub(res_y, res_y, S2);
2496 add %sp,LOCALS64+$res_y,$rp
2498 ldx [%fp+STACK_BIAS-16],$t1 ! !in1infty
2499 ldx [%fp+STACK_BIAS-8],$t2 ! !in2infty
2501 for($i=0;$i<96;$i+=16) { # conditional moves
2503 ldx [%sp+LOCALS64+$res_x+$i],$acc0 ! res
2504 ldx [%sp+LOCALS64+$res_x+$i+8],$acc1
2505 ldx [%sp+LOCALS64+$in2_x+$i],$acc2 ! in2
2506 ldx [%sp+LOCALS64+$in2_x+$i+8],$acc3
2507 ldx [%sp+LOCALS64+$in1_x+$i],$acc4 ! in1
2508 ldx [%sp+LOCALS64+$in1_x+$i+8],$acc5
2509 movrz $t1,$acc2,$acc0
2510 movrz $t1,$acc3,$acc1
2511 movrz $t2,$acc4,$acc0
2512 movrz $t2,$acc5,$acc1
2515 st $acc0,[$rp_real+$i]
2516 st $acc2,[$rp_real+$i+4]
2517 st $acc1,[$rp_real+$i+8]
2518 st $acc3,[$rp_real+$i+12]
2525 .type ecp_nistz256_point_add_vis3,#function
2526 .size ecp_nistz256_point_add_vis3,.-ecp_nistz256_point_add_vis3
2529 ########################################################################
2530 # void ecp_nistz256_point_add_affine(P256_POINT *out,const P256_POINT *in1,
2531 # const P256_POINT_AFFINE *in2);
2533 my ($res_x,$res_y,$res_z,
2534 $in1_x,$in1_y,$in1_z,
2536 $U2,$S2,$H,$R,$Hsqr,$Hcub,$Rsqr)=map(32*$_,(0..14));
2538 # above map() describes stack layout with 15 temporary
2539 # 256-bit vectors on top. Then we reserve some space for
2540 # !in1infty and !in2infty.
2544 ecp_nistz256_point_add_affine_vis3:
2545 save %sp,-STACK64_FRAME-32*15-32,%sp
2550 sllx $minus1,32,$poly1 ! 0xFFFFFFFF00000000
2551 srl $poly3,0,$poly3 ! 0x00000000FFFFFFFE
2553 ! convert input to uint64_t[4]
2554 ld [$bp],$a0 ! in2_x
2564 ld [$bp+32],$acc0 ! in2_y
2572 ld [$bp+32+16],$acc2
2576 ld [$bp+32+24],$acc3
2580 stx $a0,[%sp+LOCALS64+$in2_x]
2582 stx $a1,[%sp+LOCALS64+$in2_x+8]
2584 stx $a2,[%sp+LOCALS64+$in2_x+16]
2586 stx $a3,[%sp+LOCALS64+$in2_x+24]
2588 stx $acc0,[%sp+LOCALS64+$in2_y]
2590 stx $acc1,[%sp+LOCALS64+$in2_y+8]
2592 stx $acc2,[%sp+LOCALS64+$in2_y+16]
2593 stx $acc3,[%sp+LOCALS64+$in2_y+24]
2597 or $acc1,$acc0,$acc0
2598 or $acc3,$acc2,$acc2
2600 or $acc2,$acc0,$acc0
2602 movrnz $a0,-1,$a0 ! !in2infty
2603 stx $a0,[%fp+STACK_BIAS-8]
2605 ld [$ap],$a0 ! in1_x
2615 ld [$ap+32],$acc0 ! in1_y
2623 ld [$ap+32+16],$acc2
2627 ld [$ap+32+24],$acc3
2631 stx $a0,[%sp+LOCALS64+$in1_x]
2633 stx $a1,[%sp+LOCALS64+$in1_x+8]
2635 stx $a2,[%sp+LOCALS64+$in1_x+16]
2637 stx $a3,[%sp+LOCALS64+$in1_x+24]
2639 stx $acc0,[%sp+LOCALS64+$in1_y]
2641 stx $acc1,[%sp+LOCALS64+$in1_y+8]
2643 stx $acc2,[%sp+LOCALS64+$in1_y+16]
2644 stx $acc3,[%sp+LOCALS64+$in1_y+24]
2646 ld [$ap+64],$a0 ! in1_z
2660 stx $a0,[%sp+LOCALS64+$in1_z]
2662 stx $a1,[%sp+LOCALS64+$in1_z+8]
2664 stx $a2,[%sp+LOCALS64+$in1_z+16]
2665 stx $a3,[%sp+LOCALS64+$in1_z+24]
2670 movrnz $t0,-1,$t0 ! !in1infty
2671 stx $t0,[%fp+STACK_BIAS-16]
2673 call __ecp_nistz256_sqr_mont_vis3 ! p256_sqr_mont(Z1sqr, in1_z);
2674 add %sp,LOCALS64+$Z1sqr,$rp
2676 ldx [%sp+LOCALS64+$in2_x],$bi
2681 add %sp,LOCALS64+$in2_x,$bp
2682 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(U2, Z1sqr, in2_x);
2683 add %sp,LOCALS64+$U2,$rp
2685 ldx [%sp+LOCALS64+$Z1sqr],$bi ! forward load
2686 ldx [%sp+LOCALS64+$in1_z],$a0
2687 ldx [%sp+LOCALS64+$in1_z+8],$a1
2688 ldx [%sp+LOCALS64+$in1_z+16],$a2
2689 ldx [%sp+LOCALS64+$in1_z+24],$a3
2691 add %sp,LOCALS64+$in1_x,$bp
2692 call __ecp_nistz256_sub_from_vis3 ! p256_sub(H, U2, in1_x);
2693 add %sp,LOCALS64+$H,$rp
2695 add %sp,LOCALS64+$Z1sqr,$bp
2696 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(S2, Z1sqr, in1_z);
2697 add %sp,LOCALS64+$S2,$rp
2699 ldx [%sp+LOCALS64+$H],$bi
2700 ldx [%sp+LOCALS64+$in1_z],$a0
2701 ldx [%sp+LOCALS64+$in1_z+8],$a1
2702 ldx [%sp+LOCALS64+$in1_z+16],$a2
2703 ldx [%sp+LOCALS64+$in1_z+24],$a3
2704 add %sp,LOCALS64+$H,$bp
2705 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(res_z, H, in1_z);
2706 add %sp,LOCALS64+$res_z,$rp
2708 ldx [%sp+LOCALS64+$S2],$bi
2709 ldx [%sp+LOCALS64+$in2_y],$a0
2710 ldx [%sp+LOCALS64+$in2_y+8],$a1
2711 ldx [%sp+LOCALS64+$in2_y+16],$a2
2712 ldx [%sp+LOCALS64+$in2_y+24],$a3
2713 add %sp,LOCALS64+$S2,$bp
2714 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(S2, S2, in2_y);
2715 add %sp,LOCALS64+$S2,$rp
2717 ldx [%sp+LOCALS64+$H],$a0 ! forward load
2718 ldx [%sp+LOCALS64+$H+8],$a1
2719 ldx [%sp+LOCALS64+$H+16],$a2
2720 ldx [%sp+LOCALS64+$H+24],$a3
2722 add %sp,LOCALS64+$in1_y,$bp
2723 call __ecp_nistz256_sub_from_vis3 ! p256_sub(R, S2, in1_y);
2724 add %sp,LOCALS64+$R,$rp
2726 call __ecp_nistz256_sqr_mont_vis3 ! p256_sqr_mont(Hsqr, H);
2727 add %sp,LOCALS64+$Hsqr,$rp
2729 ldx [%sp+LOCALS64+$R],$a0
2730 ldx [%sp+LOCALS64+$R+8],$a1
2731 ldx [%sp+LOCALS64+$R+16],$a2
2732 ldx [%sp+LOCALS64+$R+24],$a3
2733 call __ecp_nistz256_sqr_mont_vis3 ! p256_sqr_mont(Rsqr, R);
2734 add %sp,LOCALS64+$Rsqr,$rp
2736 ldx [%sp+LOCALS64+$H],$bi
2737 ldx [%sp+LOCALS64+$Hsqr],$a0
2738 ldx [%sp+LOCALS64+$Hsqr+8],$a1
2739 ldx [%sp+LOCALS64+$Hsqr+16],$a2
2740 ldx [%sp+LOCALS64+$Hsqr+24],$a3
2741 add %sp,LOCALS64+$H,$bp
2742 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(Hcub, Hsqr, H);
2743 add %sp,LOCALS64+$Hcub,$rp
2745 ldx [%sp+LOCALS64+$Hsqr],$bi
2746 ldx [%sp+LOCALS64+$in1_x],$a0
2747 ldx [%sp+LOCALS64+$in1_x+8],$a1
2748 ldx [%sp+LOCALS64+$in1_x+16],$a2
2749 ldx [%sp+LOCALS64+$in1_x+24],$a3
2750 add %sp,LOCALS64+$Hsqr,$bp
2751 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(U2, in1_x, Hsqr);
2752 add %sp,LOCALS64+$U2,$rp
2754 call __ecp_nistz256_mul_by_2_vis3 ! p256_mul_by_2(Hsqr, U2);
2755 add %sp,LOCALS64+$Hsqr,$rp
2757 add %sp,LOCALS64+$Rsqr,$bp
2758 call __ecp_nistz256_sub_morf_vis3 ! p256_sub(res_x, Rsqr, Hsqr);
2759 add %sp,LOCALS64+$res_x,$rp
2761 add %sp,LOCALS64+$Hcub,$bp
2762 call __ecp_nistz256_sub_from_vis3 ! p256_sub(res_x, res_x, Hcub);
2763 add %sp,LOCALS64+$res_x,$rp
2765 ldx [%sp+LOCALS64+$Hcub],$bi ! forward load
2766 ldx [%sp+LOCALS64+$in1_y],$a0
2767 ldx [%sp+LOCALS64+$in1_y+8],$a1
2768 ldx [%sp+LOCALS64+$in1_y+16],$a2
2769 ldx [%sp+LOCALS64+$in1_y+24],$a3
2771 add %sp,LOCALS64+$U2,$bp
2772 call __ecp_nistz256_sub_morf_vis3 ! p256_sub(res_y, U2, res_x);
2773 add %sp,LOCALS64+$res_y,$rp
2775 add %sp,LOCALS64+$Hcub,$bp
2776 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(S2, in1_y, Hcub);
2777 add %sp,LOCALS64+$S2,$rp
2779 ldx [%sp+LOCALS64+$R],$bi
2780 ldx [%sp+LOCALS64+$res_y],$a0
2781 ldx [%sp+LOCALS64+$res_y+8],$a1
2782 ldx [%sp+LOCALS64+$res_y+16],$a2
2783 ldx [%sp+LOCALS64+$res_y+24],$a3
2784 add %sp,LOCALS64+$R,$bp
2785 call __ecp_nistz256_mul_mont_vis3 ! p256_mul_mont(res_y, res_y, R);
2786 add %sp,LOCALS64+$res_y,$rp
2788 add %sp,LOCALS64+$S2,$bp
2789 call __ecp_nistz256_sub_from_vis3 ! p256_sub(res_y, res_y, S2);
2790 add %sp,LOCALS64+$res_y,$rp
2792 ldx [%fp+STACK_BIAS-16],$t1 ! !in1infty
2793 ldx [%fp+STACK_BIAS-8],$t2 ! !in2infty
2795 add %o7,.Lone_mont_vis3-1b,$bp
2797 for($i=0;$i<64;$i+=16) { # conditional moves
2799 ldx [%sp+LOCALS64+$res_x+$i],$acc0 ! res
2800 ldx [%sp+LOCALS64+$res_x+$i+8],$acc1
2801 ldx [%sp+LOCALS64+$in2_x+$i],$acc2 ! in2
2802 ldx [%sp+LOCALS64+$in2_x+$i+8],$acc3
2803 ldx [%sp+LOCALS64+$in1_x+$i],$acc4 ! in1
2804 ldx [%sp+LOCALS64+$in1_x+$i+8],$acc5
2805 movrz $t1,$acc2,$acc0
2806 movrz $t1,$acc3,$acc1
2807 movrz $t2,$acc4,$acc0
2808 movrz $t2,$acc5,$acc1
2811 st $acc0,[$rp_real+$i]
2812 st $acc2,[$rp_real+$i+4]
2813 st $acc1,[$rp_real+$i+8]
2814 st $acc3,[$rp_real+$i+12]
2817 for(;$i<96;$i+=16) {
2819 ldx [%sp+LOCALS64+$res_x+$i],$acc0 ! res
2820 ldx [%sp+LOCALS64+$res_x+$i+8],$acc1
2821 ldx [$bp+$i-64],$acc2 ! "in2
"
2822 ldx [$bp+$i-64+8],$acc3
2823 ldx [%sp+LOCALS64+$in1_x+$i],$acc4 ! in1
2824 ldx [%sp+LOCALS64+$in1_x+$i+8],$acc5
2825 movrz $t1,$acc2,$acc0
2826 movrz $t1,$acc3,$acc1
2827 movrz $t2,$acc4,$acc0
2828 movrz $t2,$acc5,$acc1
2831 st $acc0,[$rp_real+$i]
2832 st $acc2,[$rp_real+$i+4]
2833 st $acc1,[$rp_real+$i+8]
2834 st $acc3,[$rp_real+$i+12]
2840 .type ecp_nistz256_point_add_affine_vis3,#function
2841 .size ecp_nistz256_point_add_affine_vis3,.-ecp_nistz256_point_add_affine_vis3
2844 .long 0x00000000,0x00000001, 0xffffffff,0x00000000
2845 .long 0xffffffff,0xffffffff, 0x00000000,0xfffffffe
2851 # Purpose of these subroutines is to explicitly encode VIS instructions,
2852 # so that one can compile the module without having to specify VIS
2853 # extensions on compiler command line, e.g. -xarch=v9 vs. -xarch=v9a.
2854 # Idea is to reserve for option to produce "universal
" binary and let
2855 # programmer detect if current CPU is VIS capable at run-time.
2857 my ($mnemonic,$rs1,$rs2,$rd)=@_;
2858 my %bias = ( "g
" => 0, "o
" => 8, "l
" => 16, "i
" => 24 );
2860 my %visopf = ( "addxc
" => 0x011,
2862 "umulxhi
" => 0x016 );
2864 $ref = "$mnemonic\t$rs1,$rs2,$rd";
2866 if ($opf=$visopf{$mnemonic}) {
2867 foreach ($rs1,$rs2,$rd) {
2868 return $ref if (!/%([goli])([0-9])/);
2872 return sprintf ".word
\t0x
%08x !%s",
2873 0x81b00000|$rd<<25|$rs1<<14|$opf<<5|$rs2,
2880 foreach (split("\n",$code)) {
2881 s/\`([^\`]*)\`/eval $1/ge;
2883 s/\b(umulxhi|addxc[c]{0,2})\s+(%[goli][0-7]),\s*(%[goli][0-7]),\s*(%[goli][0-7])/
2884 &unvis3($1,$2,$3,$4)