3 # ====================================================================
4 # Written by Andy Polyakov <appro@fy.chalmers.se> for the OpenSSL
5 # project. The module is, however, dual licensed under OpenSSL and
6 # CRYPTOGAMS licenses depending on where you obtain it. For further
7 # details see http://www.openssl.org/~appro/cryptogams/.
8 # ====================================================================
12 # This is a "teaser" code, as it can be improved in several ways...
13 # First of all non-SSE2 path should be implemented (yes, for now it
14 # performs Montgomery multiplication/convolution only on SSE2-capable
15 # CPUs such as P4, others fall down to original code). Then inner loop
16 # can be unrolled and modulo-scheduled to improve ILP and possibly
17 # moved to 128-bit XMM register bank (though it would require input
18 # rearrangement and/or increase bus bandwidth utilization). Dedicated
19 # squaring procedure should give further performance improvement...
20 # Yet, for being draft, the code improves rsa512 *sign* benchmark by
21 # 110%(!), rsa1024 one - by 70% and rsa4096 - by 20%:-)
25 # Modulo-scheduling SSE2 loops results in further 15-20% improvement.
26 # Integer-only code [being equipped with dedicated squaring procedure]
27 # gives ~40% on rsa512 sign benchmark...
29 $0 =~ m/(.*[\/\\])[^\/\\]+$/; $dir=$1;
30 push(@INC,"${dir}","${dir}../../perlasm");
33 &asm_init($ARGV[0],$0);
36 for (@ARGV) { $sse2=1 if (/-DOPENSSL_IA32_SSE2/); }
38 &external_label("OPENSSL_ia32cap_P") if ($sse2);
40 &function_begin("bn_mul_mont");
44 $ap="esi"; $tp="esi"; # overlapping variables!!!
45 $rp="edi"; $bp="edi"; # overlapping variables!!!
49 $_num=&DWP(4*0,"esp"); # stack top layout
54 $_n0=&DWP(4*5,"esp"); $_n0q=&QWP(4*5,"esp");
56 $_bpend=&DWP(4*7,"esp");
57 $frame=32; # size of above frame rounded up to 16n
60 &mov ("edi",&wparam(5)); # int num
62 &jl (&label("just_leave"));
64 &lea ("esi",&wparam(0)); # put aside pointer to argument block
65 &lea ("edx",&wparam(1)); # load ap
66 &mov ("ebp","esp"); # saved stack pointer!
67 &add ("edi",2); # extra two words on top of tp
69 &lea ("esp",&DWP(-$frame,"esp","edi",4)); # alloca($frame+4*(num+2))
72 # minimize cache contention by arraning 2K window between stack
73 # pointer and ap argument [np is also position sensitive vector,
74 # but it's assumed to be near ap, as it's allocated at ~same
79 &sub ("esp","eax"); # this aligns sp and ap modulo 2048
84 &sub ("esp","edx"); # this splits them apart modulo 4096
86 &and ("esp",-64); # align to cache line
88 # Some OSes, *cough*-dows, insist on stack being "wired" to
89 # physical memory in strictly sequential manner, i.e. if stack
90 # allocation spans two pages, then reference to farmost one can
91 # be punishable by SEGV. But page walking can do good even on
92 # other OSes, because it guarantees that villain thread hits
93 # the guard page before it can make damage to innocent one...
97 &set_label("page_walk");
98 &mov ("edx",&DWP(0,"esp","eax"));
101 &jnc (&label("page_walk"));
103 ################################# load argument block...
104 &mov ("eax",&DWP(0*4,"esi"));# BN_ULONG *rp
105 &mov ("ebx",&DWP(1*4,"esi"));# const BN_ULONG *ap
106 &mov ("ecx",&DWP(2*4,"esi"));# const BN_ULONG *bp
107 &mov ("edx",&DWP(3*4,"esi"));# const BN_ULONG *np
108 &mov ("esi",&DWP(4*4,"esi"));# const BN_ULONG *n0
109 #&mov ("edi",&DWP(5*4,"esi"));# int num
111 &mov ("esi",&DWP(0,"esi")); # pull n0[0]
112 &mov ($_rp,"eax"); # ... save a copy of argument block
117 &lea ($num,&DWP(-3,"edi")); # num=num-1 to assist modulo-scheduling
118 #&mov ($_num,$num); # redundant as $num is not reused
119 &mov ($_sp,"ebp"); # saved stack pointer!
122 $acc0="mm0"; # mmx register bank layout
131 &picmeup("eax","OPENSSL_ia32cap_P");
132 &bt (&DWP(0,"eax"),26);
133 &jnc (&label("non_sse2"));
136 &movd ($mask,"eax"); # mask 32 lower bits
138 &mov ($ap,$_ap); # load input pointers
145 &movd ($mul0,&DWP(0,$bp)); # bp[0]
146 &movd ($mul1,&DWP(0,$ap)); # ap[0]
147 &movd ($car1,&DWP(0,$np)); # np[0]
149 &pmuludq($mul1,$mul0); # ap[0]*bp[0]
151 &movq ($acc0,$mul1); # I wish movd worked for
152 &pand ($acc0,$mask); # inter-register transfers
154 &pmuludq($mul1,$_n0q); # *=n0
156 &pmuludq($car1,$mul1); # "t[0]"*np[0]*n0
157 &paddq ($car1,$acc0);
159 &movd ($acc1,&DWP(4,$np)); # np[1]
160 &movd ($acc0,&DWP(4,$ap)); # ap[1]
166 &set_label("1st",16);
167 &pmuludq($acc0,$mul0); # ap[j]*bp[0]
168 &pmuludq($acc1,$mul1); # np[j]*m1
169 &paddq ($car0,$acc0); # +=c0
170 &paddq ($car1,$acc1); # +=c1
174 &movd ($acc1,&DWP(4,$np,$j,4)); # np[j+1]
175 &paddq ($car1,$acc0); # +=ap[j]*bp[0];
176 &movd ($acc0,&DWP(4,$ap,$j,4)); # ap[j+1]
178 &movd (&DWP($frame-4,"esp",$j,4),$car1); # tp[j-1]=
181 &lea ($j,&DWP(1,$j));
185 &pmuludq($acc0,$mul0); # ap[num-1]*bp[0]
186 &pmuludq($acc1,$mul1); # np[num-1]*m1
187 &paddq ($car0,$acc0); # +=c0
188 &paddq ($car1,$acc1); # +=c1
192 &paddq ($car1,$acc0); # +=ap[num-1]*bp[0];
193 &movd (&DWP($frame-4,"esp",$j,4),$car1); # tp[num-2]=
198 &paddq ($car1,$car0);
199 &movq (&QWP($frame,"esp",$num,4),$car1); # tp[num].tp[num-1]
205 &movd ($mul0,&DWP(0,$bp,$i,4)); # bp[i]
206 &movd ($mul1,&DWP(0,$ap)); # ap[0]
207 &movd ($temp,&DWP($frame,"esp")); # tp[0]
208 &movd ($car1,&DWP(0,$np)); # np[0]
209 &pmuludq($mul1,$mul0); # ap[0]*bp[i]
211 &paddq ($mul1,$temp); # +=tp[0]
216 &pmuludq($mul1,$_n0q); # *=n0
218 &pmuludq($car1,$mul1);
219 &paddq ($car1,$acc0);
221 &movd ($temp,&DWP($frame+4,"esp")); # tp[1]
222 &movd ($acc1,&DWP(4,$np)); # np[1]
223 &movd ($acc0,&DWP(4,$ap)); # ap[1]
227 &paddq ($car0,$temp); # +=tp[1]
232 &pmuludq($acc0,$mul0); # ap[j]*bp[i]
233 &pmuludq($acc1,$mul1); # np[j]*m1
234 &paddq ($car0,$acc0); # +=c0
235 &paddq ($car1,$acc1); # +=c1
238 &movd ($temp,&DWP($frame+4,"esp",$j,4));# tp[j+1]
240 &movd ($acc1,&DWP(4,$np,$j,4)); # np[j+1]
241 &paddq ($car1,$acc0); # +=ap[j]*bp[i]+tp[j]
242 &movd ($acc0,&DWP(4,$ap,$j,4)); # ap[j+1]
244 &movd (&DWP($frame-4,"esp",$j,4),$car1);# tp[j-1]=
246 &paddq ($car0,$temp); # +=tp[j+1]
249 &lea ($j,&DWP(1,$j)); # j++
250 &jnz (&label("inner"));
253 &pmuludq($acc0,$mul0); # ap[num-1]*bp[i]
254 &pmuludq($acc1,$mul1); # np[num-1]*m1
255 &paddq ($car0,$acc0); # +=c0
256 &paddq ($car1,$acc1); # +=c1
260 &paddq ($car1,$acc0); # +=ap[num-1]*bp[i]+tp[num-1]
261 &movd (&DWP($frame-4,"esp",$j,4),$car1); # tp[num-2]=
265 &movd ($temp,&DWP($frame+4,"esp",$num,4)); # += tp[num]
266 &paddq ($car1,$car0);
267 &paddq ($car1,$temp);
268 &movq (&QWP($frame,"esp",$num,4),$car1); # tp[num].tp[num-1]
270 &lea ($i,&DWP(1,$i)); # i++
272 &jle (&label("outer"));
274 &emms (); # done with mmx bank
275 &jmp (&label("common_tail"));
277 &set_label("non_sse2",16);
282 &xor ("eax","eax"); # signal "not fast enough [yet]"
283 &jmp (&label("just_leave"));
284 # While the below code provides competitive performance for
285 # all key lengthes on modern Intel cores, it's still more
286 # than 10% slower for 4096-bit key elsewhere:-( "Competitive"
287 # means compared to the original integer-only assembler.
288 # 512-bit RSA sign is better by ~40%, but that's about all
289 # one can say about all CPUs...
291 $inp="esi"; # integer path uses these registers differently
296 &lea ($carry,&DWP(1,$num));
300 &and ($carry,1); # see if num is even
301 &sub ("edx",$word); # see if ap==bp
302 &lea ("eax",&DWP(4,$word,$num,4)); # &bp[num]
304 &mov ($word,&DWP(0,$word)); # bp[0]
305 &jz (&label("bn_sqr_mont"));
306 &mov ($_bpend,"eax");
307 &mov ("eax",&DWP(0,$inp));
310 &set_label("mull",16);
312 &mul ($word); # ap[j]*bp[0]
314 &lea ($j,&DWP(1,$j));
316 &mov ("eax",&DWP(0,$inp,$j,4)); # ap[j+1]
318 &mov (&DWP($frame-4,"esp",$j,4),$carry); # tp[j]=
319 &jl (&label("mull"));
322 &mul ($word); # ap[num-1]*bp[0]
327 &imul ($word,&DWP($frame,"esp")); # n0*tp[0]
329 &mov (&DWP($frame,"esp",$num,4),"eax"); # tp[num-1]=
331 &mov (&DWP($frame+4,"esp",$num,4),"edx"); # tp[num]=
332 &mov (&DWP($frame+8,"esp",$num,4),$j); # tp[num+1]=
334 &mov ("eax",&DWP(0,$inp)); # np[0]
335 &mul ($word); # np[0]*m
336 &add ("eax",&DWP($frame,"esp")); # +=tp[0]
337 &mov ("eax",&DWP(4,$inp)); # np[1]
341 &jmp (&label("2ndmadd"));
343 &set_label("1stmadd",16);
345 &mul ($word); # ap[j]*bp[i]
346 &add ($carry,&DWP($frame,"esp",$j,4)); # +=tp[j]
347 &lea ($j,&DWP(1,$j));
350 &mov ("eax",&DWP(0,$inp,$j,4)); # ap[j+1]
353 &mov (&DWP($frame-4,"esp",$j,4),$carry); # tp[j]=
354 &jl (&label("1stmadd"));
357 &mul ($word); # ap[num-1]*bp[i]
358 &add ("eax",&DWP($frame,"esp",$num,4)); # +=tp[num-1]
364 &imul ($word,&DWP($frame,"esp")); # n0*tp[0]
367 &add ("edx",&DWP($frame+4,"esp",$num,4)); # carry+=tp[num]
368 &mov (&DWP($frame,"esp",$num,4),$carry); # tp[num-1]=
370 &mov ("eax",&DWP(0,$inp)); # np[0]
371 &mov (&DWP($frame+4,"esp",$num,4),"edx"); # tp[num]=
372 &mov (&DWP($frame+8,"esp",$num,4),$j); # tp[num+1]=
374 &mul ($word); # np[0]*m
375 &add ("eax",&DWP($frame,"esp")); # +=tp[0]
376 &mov ("eax",&DWP(4,$inp)); # np[1]
380 &set_label("2ndmadd",16);
382 &mul ($word); # np[j]*m
383 &add ($carry,&DWP($frame,"esp",$j,4)); # +=tp[j]
384 &lea ($j,&DWP(1,$j));
387 &mov ("eax",&DWP(0,$inp,$j,4)); # np[j+1]
390 &mov (&DWP($frame-8,"esp",$j,4),$carry); # tp[j-1]=
391 &jl (&label("2ndmadd"));
394 &mul ($word); # np[j]*m
395 &add ($carry,&DWP($frame,"esp",$num,4)); # +=tp[num-1]
399 &mov (&DWP($frame-4,"esp",$num,4),$carry); # tp[num-2]=
402 &mov ($j,$_bp); # &bp[i]
403 &add ("edx",&DWP($frame+4,"esp",$num,4)); # carry+=tp[num]
404 &adc ("eax",&DWP($frame+8,"esp",$num,4)); # +=tp[num+1]
405 &lea ($j,&DWP(4,$j));
406 &mov (&DWP($frame,"esp",$num,4),"edx"); # tp[num-1]=
408 &mov (&DWP($frame+4,"esp",$num,4),"eax"); # tp[num]=
409 &je (&label("common_tail"));
411 &mov ($word,&DWP(0,$j)); # bp[i+1]
413 &mov ($_bp,$j); # &bp[++i]
416 &mov ("eax",&DWP(0,$inp));
417 &jmp (&label("1stmadd"));
419 &set_label("bn_sqr_mont",16);
422 &mov ($_bp,$j); # i=0
424 &mov ("eax",$word); # ap[0]
425 &mul ($word); # ap[0]*ap[0]
426 &mov (&DWP($frame,"esp"),"eax"); # tp[0]=
431 &set_label("sqr",16);
432 &mov ("eax",&DWP(0,$inp,$j,4)); # ap[j]
434 &mul ($word); # ap[j]*ap[0]
436 &lea ($j,&DWP(1,$j));
438 &lea ($carry,&DWP(0,$sbit,"eax",2));
442 &mov (&DWP($frame-4,"esp",$j,4),$carry); # tp[j]=
445 &mov ("eax",&DWP(0,$inp,$j,4)); # ap[num-1]
447 &mul ($word); # ap[num-1]*ap[0]
452 &lea ($carry,&DWP(0,$sbit,"eax",2));
453 &imul ($word,&DWP($frame,"esp")); # n0*tp[0]
455 &mov (&DWP($frame,"esp",$j,4),$carry); # tp[num-1]=
457 &lea ($carry,&DWP(0,"eax","edx",2));
458 &mov ("eax",&DWP(0,$inp)); # np[0]
460 &mov (&DWP($frame+4,"esp",$j,4),$carry); # tp[num]=
461 &mov (&DWP($frame+8,"esp",$j,4),"edx"); # tp[num+1]=
463 &mul ($word); # np[0]*m
464 &add ("eax",&DWP($frame,"esp")); # +=tp[0]
467 &mov ("eax",&DWP(4,$inp)); # np[1]
470 &set_label("3rdmadd",16);
472 &mul ($word); # np[j]*m
473 &add ($carry,&DWP($frame,"esp",$j,4)); # +=tp[j]
476 &mov ("eax",&DWP(4,$inp,$j,4)); # np[j+1]
478 &mov (&DWP($frame-4,"esp",$j,4),$carry); # tp[j-1]=
481 &mul ($word); # np[j+1]*m
482 &add ($carry,&DWP($frame+4,"esp",$j,4)); # +=tp[j+1]
483 &lea ($j,&DWP(2,$j));
486 &mov ("eax",&DWP(0,$inp,$j,4)); # np[j+2]
489 &mov (&DWP($frame-8,"esp",$j,4),$carry); # tp[j]=
490 &jl (&label("3rdmadd"));
493 &mul ($word); # np[j]*m
494 &add ($carry,&DWP($frame,"esp",$num,4)); # +=tp[num-1]
498 &mov (&DWP($frame-4,"esp",$num,4),$carry); # tp[num-2]=
503 &add ("edx",&DWP($frame+4,"esp",$num,4)); # carry+=tp[num]
504 &adc ("eax",&DWP($frame+8,"esp",$num,4)); # +=tp[num+1]
505 &mov (&DWP($frame,"esp",$num,4),"edx"); # tp[num-1]=
507 &mov (&DWP($frame+4,"esp",$num,4),"eax"); # tp[num]=
508 &je (&label("common_tail"));
510 &mov ($word,&DWP(4,$inp,$j,4)); # ap[i]
511 &lea ($j,&DWP(1,$j));
513 &mov ($_bp,$j); # ++i
514 &mul ($word); # ap[i]*ap[i]
515 &add ("eax",&DWP($frame,"esp",$j,4)); # +=tp[i]
517 &mov (&DWP($frame,"esp",$j,4),"eax"); # tp[i]=
518 &xor ($carry,$carry);
520 &lea ($j,&DWP(1,$j));
521 &je (&label("sqrlast"));
523 &mov ($sbit,"edx"); # zaps $num
526 &set_label("sqradd",16);
527 &mov ("eax",&DWP(0,$inp,$j,4)); # ap[j]
529 &mul ($word); # ap[j]*ap[i]
531 &lea ($carry,&DWP(0,"eax","eax"));
534 &add ($carry,&DWP($frame,"esp",$j,4)); # +=tp[j]
535 &lea ($j,&DWP(1,$j));
540 &mov (&DWP($frame-4,"esp",$j,4),$carry); # tp[j]=
542 &jle (&label("sqradd"));
549 &set_label("sqrlast");
552 &imul ($word,&DWP($frame,"esp")); # n0*tp[0]
554 &add ("edx",&DWP($frame,"esp",$j,4)); # +=tp[num]
555 &mov ("eax",&DWP(0,$inp)); # np[0]
557 &mov (&DWP($frame,"esp",$j,4),"edx"); # tp[num]=
558 &mov (&DWP($frame+4,"esp",$j,4),$carry); # tp[num+1]=
560 &mul ($word); # np[0]*m
561 &add ("eax",&DWP($frame,"esp")); # +=tp[0]
562 &lea ($num,&DWP(-1,$j));
565 &mov ("eax",&DWP(4,$inp)); # np[1]
567 &jmp (&label("3rdmadd"));
570 &set_label("common_tail",16);
571 &mov ($np,$_np); # load modulus pointer
572 &mov ($rp,$_rp); # load result pointer
573 &lea ($tp,&DWP($frame,"esp")); # [$ap and $bp are zapped]
575 &mov ("eax",&DWP(0,$tp)); # tp[0]
576 &mov ($j,$num); # j=num-1
577 &xor ($i,$i); # i=0 and clear CF!
579 &set_label("sub",16);
580 &sbb ("eax",&DWP(0,$np,$i,4));
581 &mov (&DWP(0,$rp,$i,4),"eax"); # rp[i]=tp[i]-np[i]
582 &dec ($j); # doesn't affect CF!
583 &mov ("eax",&DWP(4,$tp,$i,4)); # tp[i+1]
584 &lea ($i,&DWP(1,$i)); # i++
585 &jge (&label("sub"));
587 &sbb ("eax",0); # handle upmost overflow bit
592 &or ($tp,$np); # tp=carry?tp:rp
594 &set_label("copy",16); # copy or in-place refresh
595 &mov ("eax",&DWP(0,$tp,$num,4));
596 &mov (&DWP(0,$rp,$num,4),"eax"); # rp[i]=tp[i]
597 &mov (&DWP($frame,"esp",$num,4),$j); # zap temporary vector
599 &jge (&label("copy"));
601 &mov ("esp",$_sp); # pull saved stack pointer
603 &set_label("just_leave");
604 &function_end("bn_mul_mont");
606 &asciz("Montgomery Multiplication for x86, CRYPTOGAMS by <appro\@openssl.org>");