3 # ====================================================================
4 # Written by Andy Polyakov <appro@fy.chalmers.se> for the OpenSSL
5 # project. Rights for redistribution and usage in source and binary
6 # forms are granted according to the OpenSSL license.
7 # ====================================================================
11 # "Teaser" Montgomery multiplication module for PowerPC. It's possible
12 # to gain a bit more by modulo-scheduling outer loop, then dedicated
13 # squaring procedure should give further 20% and code can be adapted
14 # for 32-bit application running on 64-bit CPU. As for the latter.
15 # It won't be able to achieve "native" 64-bit performance, because in
16 # 32-bit application context every addc instruction will have to be
17 # expanded as addc, twice right shift by 32 and finally adde, etc.
18 # So far RSA *sign* performance improvement over pre-bn_mul_mont asm
19 # for 64-bit application running on PPC970/G5 is:
28 if ($output =~ /32\-mont\.s/) {
36 $LDU= "lwzu"; # load and update
37 $LDX= "lwzx"; # load indexed
39 $STU= "stwu"; # store and update
40 $STX= "stwx"; # store indexed
41 $STUX= "stwux"; # store indexed and update
42 $UMULL= "mullw"; # unsigned multiply low
43 $UMULH= "mulhwu"; # unsigned multiply high
44 $UCMP= "cmplw"; # unsigned compare
47 } elsif ($output =~ /64\-mont\.s/) {
54 # same as above, but 64-bit mnemonics...
56 $LDU= "ldu"; # load and update
57 $LDX= "ldx"; # load indexed
59 $STU= "stdu"; # store and update
60 $STX= "stdx"; # store indexed
61 $STUX= "stdux"; # store indexed and update
62 $UMULL= "mulld"; # unsigned multiply low
63 $UMULH= "mulhdu"; # unsigned multiply high
64 $UCMP= "cmpld"; # unsigned compare
67 } else { die "nonsense $output"; }
69 ( defined shift || open STDOUT
,"| $^X ../perlasm/ppc-xlate.pl $output" ) ||
70 die "can't call ../perlasm/ppc-xlate.pl: $!";
80 $rp="r9"; # $rp is reassigned
84 # non-volatile registers
108 mr
$rp,r3
; $rp is reassigned
112 slwi
$num,$num,`log($BNSZ)/log(2)`
114 addi
$ovf,$num,`$FRAME+$RZONE`
115 subf
$ovf,$ovf,$sp ; $sp-$ovf
116 and $ovf,$ovf,$tj ; minimize TLB usage
117 subf
$ovf,$sp,$ovf ; $ovf-$sp
118 srwi
$num,$num,`log($BNSZ)/log(2)`
121 $PUSH r14
,`4*$SIZE_T`($sp)
122 $PUSH r15
,`5*$SIZE_T`($sp)
123 $PUSH r16
,`6*$SIZE_T`($sp)
124 $PUSH r17
,`7*$SIZE_T`($sp)
125 $PUSH r18
,`8*$SIZE_T`($sp)
126 $PUSH r19
,`9*$SIZE_T`($sp)
127 $PUSH r20
,`10*$SIZE_T`($sp)
128 $PUSH r21
,`11*$SIZE_T`($sp)
129 $PUSH r22
,`12*$SIZE_T`($sp)
130 $PUSH r23
,`13*$SIZE_T`($sp)
131 $PUSH r24
,`14*$SIZE_T`($sp)
132 $PUSH r25
,`15*$SIZE_T`($sp)
134 $LD $n0,0($n0) ; pull n0
[0] value
135 addi
$num,$num,-2 ; adjust
$num for counter register
137 $LD $m0,0($bp) ; m0
=bp
[0]
138 $LD $aj,0($ap) ; ap
[0]
140 $UMULL $lo0,$aj,$m0 ; ap
[0]*bp
[0]
143 $LD $aj,$BNSZ($ap) ; ap
[1]
144 $LD $nj,0($np) ; np
[0]
146 $UMULL $m1,$lo0,$n0 ; "tp[0]"*n0
148 $UMULL $alo,$aj,$m0 ; ap
[1]*bp
[0]
151 $UMULL $lo1,$nj,$m1 ; np
[0]*m1
153 $LD $nj,$BNSZ($np) ; np
[1]
157 $UMULL $nlo,$nj,$m1 ; np
[1]*m1
164 $LDX $aj,$ap,$j ; ap
[j
]
165 $LDX $nj,$np,$j ; np
[j
]
168 $UMULL $alo,$aj,$m0 ; ap
[j
]*bp
[0]
173 $UMULL $nlo,$nj,$m1 ; np
[j
]*m1
175 addc
$lo1,$lo1,$lo0 ; np
[j
]*m1
+ap
[j
]*bp
[0]
177 $ST $lo1,0($tp) ; tp
[j
-1]
179 addi
$j,$j,$BNSZ ; j
++
180 addi
$tp,$tp,$BNSZ ; tp
++
188 addc
$lo1,$lo1,$lo0 ; np
[j
]*m1
+ap
[j
]*bp
[0]
190 $ST $lo1,0($tp) ; tp
[j
-1]
194 addze
$ovf,$ovf ; upmost overflow bit
200 $LDX $m0,$bp,$i ; m0
=bp
[i
]
201 $LD $aj,0($ap) ; ap
[0]
203 $LD $tj,$FRAME($sp) ; tp
[0]
204 $UMULL $lo0,$aj,$m0 ; ap
[0]*bp
[i
]
206 $LD $aj,$BNSZ($ap) ; ap
[1]
207 $LD $nj,0($np) ; np
[0]
208 addc
$lo0,$lo0,$tj ; ap
[0]*bp
[i
]+tp
[0]
211 $UMULL $m1,$lo0,$n0 ; tp
[0]*n0
213 $UMULL $alo,$aj,$m0 ; ap
[j
]*bp
[i
]
216 $UMULL $lo1,$nj,$m1 ; np
[0]*m1
218 $LD $nj,$BNSZ($np) ; np
[1]
222 $UMULL $nlo,$nj,$m1 ; np
[1]*m1
229 $LDX $aj,$ap,$j ; ap
[j
]
230 $LD $tj,$BNSZ($tp) ; tp
[j
]
233 $LDX $nj,$np,$j ; np
[j
]
234 addc
$lo0,$lo0,$tj ; ap
[j
]*bp
[i
]+tp
[j
]
236 $UMULL $alo,$aj,$m0 ; ap
[j
]*bp
[i
]
241 $UMULL $nlo,$nj,$m1 ; np
[j
]*m1
243 addc
$lo1,$lo1,$lo0 ; np
[j
]*m1
+ap
[j
]*bp
[i
]+tp
[j
]
245 $ST $lo1,0($tp) ; tp
[j
-1]
247 addi
$j,$j,$BNSZ ; j
++
248 addi
$tp,$tp,$BNSZ ; tp
++
251 $LD $tj,$BNSZ($tp) ; tp
[j
]
254 addc
$lo0,$lo0,$tj ; ap
[j
]*bp
[i
]+tp
[j
]
259 addc
$lo1,$lo1,$lo0 ; np
[j
]*m1
+ap
[j
]*bp
[i
]+tp
[j
]
261 $ST $lo1,0($tp) ; tp
[j
-1]
263 addic
$ovf,$ovf,-1 ; move upmost overflow to XER
[CA
]
269 slwi
$tj,$num,`log($BNSZ)/log(2)`
274 addi
$num,$num,2 ; restore
$num
279 subfc
. $ovf,$j,$ovf ; sets XER
[CA
]
287 $STX $j,$tp,$j ; zap at once
292 $POP r14
,`4*$SIZE_T`($sp)
293 $POP r15
,`5*$SIZE_T`($sp)
294 $POP r16
,`6*$SIZE_T`($sp)
295 $POP r17
,`7*$SIZE_T`($sp)
296 $POP r18
,`8*$SIZE_T`($sp)
297 $POP r19
,`9*$SIZE_T`($sp)
298 $POP r20
,`10*$SIZE_T`($sp)
299 $POP r21
,`11*$SIZE_T`($sp)
300 $POP r22
,`12*$SIZE_T`($sp)
301 $POP r23
,`13*$SIZE_T`($sp)
302 $POP r24
,`14*$SIZE_T`($sp)
303 $POP r25
,`15*$SIZE_T`($sp)
309 Lsub
: $LDX $tj,$tp,$j
311 subfe
$tj,$nj,$tj ; tp
[j
]-np
[j
]
326 $code =~ s/\`([^\`]*)\`/eval $1/gem;