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 >=30% 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");
45 $rp="edi"; $bp="edi"; # overlapping variables!!!
49 $_rp=&DWP(4*0,"esp"); # stack top layout
54 $_num=&DWP(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 ################################# load argument block...
65 &mov ("eax",&wparam(0)); # BN_ULONG *rp
66 &mov ("ebx",&wparam(1)); # const BN_ULONG *ap
67 &mov ("ecx",&wparam(2)); # const BN_ULONG *bp
68 &mov ("edx",&wparam(3)); # const BN_ULONG *np
69 &mov ("esi",&wparam(4)); # const BN_ULONG *n0
70 #&mov ("edi",&wparam(5)); # int num
72 &mov ("ebp","esp"); # saved stack pointer!
73 &add ("edi",2); # extra two words on top of tp
75 &lea ("esp",&DWP(-$frame,"esp","edi",4)); # alloca($frame+4*(num+2))
77 &and ("esp",-4096); # minimize TLB utilization
79 &mov ("esi",&DWP(0,"esi")); # pull n0[0]
80 &mov ($_rp,"eax"); # ... save a copy of argument block
85 &lea ($num,&DWP(-3,"edi")); # num=num-1 to assist modulo-scheduling
86 #&mov ($_num,$num); # redundant as $num is not reused
87 &mov ($_sp,"ebp"); # saved stack pointer!
90 $acc0="mm0"; # mmx register bank layout
99 &picmeup("eax","OPENSSL_ia32cap_P");
100 &bt (&DWP(0,"eax"),26);
101 &jnc (&label("non_sse2"));
104 &movd ($mask,"eax"); # mask 32 lower bits
106 &mov ($ap,$_ap); # load input pointers
113 &movd ($mul0,&DWP(0,$bp)); # bp[0]
114 &movd ($mul1,&DWP(0,$ap)); # ap[0]
115 &movd ($car1,&DWP(0,$np)); # np[0]
117 &pmuludq($mul1,$mul0); # ap[0]*bp[0]
119 &movq ($acc0,$mul1); # I wish movd worked for
120 &pand ($acc0,$mask); # inter-register transfers
122 &pmuludq($mul1,$_n0); # *=n0
124 &pmuludq($car1,$mul1); # "t[0]"*np[0]*n0
125 &paddq ($car1,$acc0);
127 &movd ($acc1,&DWP(4,$np)); # np[1]
128 &movd ($acc0,&DWP(4,$ap)); # ap[1]
135 &pmuludq($acc0,$mul0); # ap[j]*bp[0]
136 &pmuludq($acc1,$mul1); # np[j]*m1
137 &paddq ($car0,$acc0); # +=c0
138 &paddq ($car1,$acc1); # +=c1
142 &movd ($acc1,&DWP(4,$np,$j,4)); # np[j+1]
143 &paddq ($car1,$acc0); # +=ap[j]*bp[0];
144 &movd ($acc0,&DWP(4,$ap,$j,4)); # ap[j+1]
146 &movd (&DWP($frame-4,"esp",$j,4),$car1); # tp[j-1]=
149 &lea ($j,&DWP(1,$j));
153 &pmuludq($acc0,$mul0); # ap[num-1]*bp[0]
154 &pmuludq($acc1,$mul1); # np[num-1]*m1
155 &paddq ($car0,$acc0); # +=c0
156 &paddq ($car1,$acc1); # +=c1
160 &paddq ($car1,$acc0); # +=ap[num-1]*bp[0];
161 &movd (&DWP($frame-4,"esp",$j,4),$car1); # tp[num-2]=
166 &paddq ($car1,$car0);
167 &movq (&DWP($frame,"esp",$num,4),$car1); # tp[num].tp[num-1]
173 &movd ($mul0,&DWP(0,$bp,$i,4)); # bp[i]
174 &movd ($mul1,&DWP(0,$ap)); # ap[0]
175 &movd ($temp,&DWP($frame,"esp")); # tp[0]
176 &movd ($car1,&DWP(0,$np)); # np[0]
177 &pmuludq($mul1,$mul0); # ap[0]*bp[i]
179 &paddq ($mul1,$temp); # +=tp[0]
184 &pmuludq($mul1,$_n0); # *=n0
186 &pmuludq($car1,$mul1);
187 &paddq ($car1,$acc0);
189 &movd ($temp,&DWP($frame+4,"esp")); # tp[1]
190 &movd ($acc1,&DWP(4,$np)); # np[1]
191 &movd ($acc0,&DWP(4,$ap)); # ap[1]
195 &paddq ($car0,$temp); # +=tp[1]
200 &pmuludq($acc0,$mul0); # ap[j]*bp[i]
201 &pmuludq($acc1,$mul1); # np[j]*m1
202 &paddq ($car0,$acc0); # +=c0
203 &paddq ($car1,$acc1); # +=c1
206 &movd ($temp,&DWP($frame+4,"esp",$j,4));# tp[j+1]
208 &movd ($acc1,&DWP(4,$np,$j,4)); # np[j+1]
209 &paddq ($car1,$acc0); # +=ap[j]*bp[i]+tp[j]
210 &movd ($acc0,&DWP(4,$ap,$j,4)); # ap[j+1]
212 &movd (&DWP($frame-4,"esp",$j,4),$car1);# tp[j-1]=
214 &paddq ($car0,$temp); # +=tp[j+1]
217 &lea ($j,&DWP(1,$j)); # j++
218 &jnz (&label("inner"));
221 &pmuludq($acc0,$mul0); # ap[num-1]*bp[i]
222 &pmuludq($acc1,$mul1); # np[num-1]*m1
223 &paddq ($car0,$acc0); # +=c0
224 &paddq ($car1,$acc1); # +=c1
228 &paddq ($car1,$acc0); # +=ap[num-1]*bp[i]+tp[num-1]
229 &movd (&DWP($frame-4,"esp",$j,4),$car1); # tp[num-2]=
233 &movd ($temp,&DWP($frame+4,"esp",$num,4)); # += tp[num]
234 &paddq ($car1,$car0);
235 &paddq ($car1,$temp);
236 &movq (&DWP($frame,"esp",$num,4),$car1); # tp[num].tp[num-1]
238 &lea ($i,&DWP(1,$i)); # i++
240 &jle (&label("outer"));
242 &emms (); # done with mmx bank
243 &jmp (&label("common_tail"));
245 &set_label("non_sse2",16);
250 &xor ("eax","eax"); # signal "not fast enough [yet]"
251 &jmp (&label("just_leave"));
252 # While the below code provides competitive performance for
253 # all key lengthes on modern cores, it's still a tad slower
254 # for >=2048-bits keys on *elder* CPUs:-( "Competitive" means
255 # compared to the original integer-only assembler. 512-bit
256 # RSA sign is better by >=30%, but that's about all one can
257 # say about all CPUs...
259 $inp="esi"; # integer path uses these registers differently
264 &lea ($carry,&DWP(1,$num));
268 &and ($carry,1); # see if num is even
269 &sub ("edx",$word); # see if ap==bp
270 &lea ("eax",&DWP(4,$word,$num,4)); # &bp[num]
272 &mov ($word,&DWP(0,$word)); # bp[0]
273 &jz (&label("bn_sqr_mont"));
274 &mov ($_bpend,"eax");
275 &mov ("eax",&DWP(0,$inp));
278 &set_label("mull",16);
280 &mul ($word); # ap[j]*bp[0]
282 &lea ($j,&DWP(1,$j));
284 &mov ("eax",&DWP(0,$inp,$j,4)); # ap[j+1]
286 &mov (&DWP($frame-4,"esp",$j,4),$carry); # tp[j]=
287 &jl (&label("mull"));
290 &mul ($word); # ap[num-1]*bp[0]
295 &imul ($word,&DWP($frame,"esp")); # n0*tp[0]
297 &mov (&DWP($frame,"esp",$num,4),"eax"); # tp[num-1]=
299 &mov (&DWP($frame+4,"esp",$num,4),"edx"); # tp[num]=
300 &mov (&DWP($frame+8,"esp",$num,4),$j); # tp[num+1]=
302 &mov ("eax",&DWP(0,$inp)); # np[0]
303 &mul ($word); # np[0]*m
304 &add ("eax",&DWP($frame,"esp")); # +=tp[0]
305 &mov ("eax",&DWP(4,$inp)); # np[1]
309 &jmp (&label("2ndmadd"));
311 &set_label("1stmadd",16);
313 &mul ($word); # ap[j]*bp[i]
314 &add ($carry,&DWP($frame,"esp",$j,4)); # +=tp[j]
315 &lea ($j,&DWP(1,$j));
318 &mov ("eax",&DWP(0,$inp,$j,4)); # ap[j+1]
321 &mov (&DWP($frame-4,"esp",$j,4),$carry); # tp[j]=
322 &jl (&label("1stmadd"));
325 &mul ($word); # ap[num-1]*bp[i]
326 &add ("eax",&DWP($frame,"esp",$num,4)); # +=tp[num-1]
332 &imul ($word,&DWP($frame,"esp")); # n0*tp[0]
335 &add ("edx",&DWP($frame+4,"esp",$num,4)); # carry+=tp[num]
336 &mov (&DWP($frame,"esp",$num,4),$carry); # tp[num-1]=
338 &mov ("eax",&DWP(0,$inp)); # np[0]
339 &mov (&DWP($frame+4,"esp",$num,4),"edx"); # tp[num]=
340 &mov (&DWP($frame+8,"esp",$num,4),$j); # tp[num+1]=
342 &mul ($word); # np[0]*m
343 &add ("eax",&DWP($frame,"esp")); # +=tp[0]
344 &mov ("eax",&DWP(4,$inp)); # np[1]
348 &set_label("2ndmadd",16);
350 &mul ($word); # np[j]*m
351 &add ($carry,&DWP($frame,"esp",$j,4)); # +=tp[j]
352 &lea ($j,&DWP(1,$j));
355 &mov ("eax",&DWP(0,$inp,$j,4)); # np[j+1]
358 &mov (&DWP($frame-8,"esp",$j,4),$carry); # tp[j-1]=
359 &jl (&label("2ndmadd"));
362 &mul ($word); # np[j]*m
363 &add ($carry,&DWP($frame,"esp",$num,4)); # +=tp[num-1]
367 &mov (&DWP($frame-4,"esp",$num,4),$carry); # tp[num-2]=
370 &mov ($j,$_bp); # &bp[i]
371 &add ("edx",&DWP($frame+4,"esp",$num,4)); # carry+=tp[num]
372 &adc ("eax",&DWP($frame+8,"esp",$num,4)); # +=tp[num+1]
373 &lea ($j,&DWP(4,$j));
374 &mov (&DWP($frame,"esp",$num,4),"edx"); # tp[num-1]=
376 &mov (&DWP($frame+4,"esp",$num,4),"eax"); # tp[num]=
377 &je (&label("common_tail"));
379 &mov ($word,&DWP(0,$j)); # bp[i+1]
381 &mov ($_bp,$j); # &bp[++i]
384 &mov ("eax",&DWP(0,$inp));
385 &jmp (&label("1stmadd"));
387 &set_label("bn_sqr_mont",16);
390 &mov ($_bp,$j); # i=0
392 &mov ("eax",$word); # ap[0]
393 &mul ($word); # ap[0]*ap[0]
394 &mov (&DWP($frame,"esp"),"eax"); # tp[0]=
399 &set_label("sqr",16);
400 &mov ("eax",&DWP(0,$inp,$j,4)); # ap[j]
402 &mul ($word); # ap[j]*ap[0]
404 &lea ($j,&DWP(1,$j));
406 &lea ($carry,&DWP(0,$sbit,"eax",2));
410 &mov (&DWP($frame-4,"esp",$j,4),$carry); # tp[j]=
413 &mov ("eax",&DWP(0,$inp,$j,4)); # ap[num-1]
415 &mul ($word); # ap[num-1]*ap[0]
420 &lea ($carry,&DWP(0,$sbit,"eax",2));
421 &imul ($word,&DWP($frame,"esp")); # n0*tp[0]
423 &mov (&DWP($frame,"esp",$j,4),$carry); # tp[num-1]=
425 &lea ($carry,&DWP(0,"eax","edx",2));
426 &mov ("eax",&DWP(0,$inp)); # np[0]
428 &mov (&DWP($frame+4,"esp",$j,4),$carry); # tp[num]=
429 &mov (&DWP($frame+8,"esp",$j,4),"edx"); # tp[num+1]=
431 &mul ($word); # np[0]*m
432 &add ("eax",&DWP($frame,"esp")); # +=tp[0]
435 &mov ("eax",&DWP(4,$inp)); # np[1]
438 &set_label("3rdmadd",16);
440 &mul ($word); # np[j]*m
441 &add ($carry,&DWP($frame,"esp",$j,4)); # +=tp[j]
444 &mov ("eax",&DWP(4,$inp,$j,4)); # np[j+1]
446 &mov (&DWP($frame-4,"esp",$j,4),$carry); # tp[j-1]=
449 &mul ($word); # np[j+1]*m
450 &add ($carry,&DWP($frame+4,"esp",$j,4)); # +=tp[j+1]
451 &lea ($j,&DWP(2,$j));
454 &mov ("eax",&DWP(0,$inp,$j,4)); # np[j+2]
457 &mov (&DWP($frame-8,"esp",$j,4),$carry); # tp[j]=
458 &jl (&label("3rdmadd"));
461 &mul ($word); # np[j]*m
462 &add ($carry,&DWP($frame,"esp",$num,4)); # +=tp[num-1]
466 &mov (&DWP($frame-4,"esp",$num,4),$carry); # tp[num-2]=
471 &add ("edx",&DWP($frame+4,"esp",$num,4)); # carry+=tp[num]
472 &adc ("eax",&DWP($frame+8,"esp",$num,4)); # +=tp[num+1]
473 &mov (&DWP($frame,"esp",$num,4),"edx"); # tp[num-1]=
475 &mov (&DWP($frame+4,"esp",$num,4),"eax"); # tp[num]=
476 &je (&label("common_tail"));
478 &mov ($word,&DWP(4,$inp,$j,4)); # ap[i]
479 &lea ($j,&DWP(1,$j));
481 &mov ($_bp,$j); # ++i
482 &mul ($word); # ap[i]*ap[i]
483 &add ("eax",&DWP($frame,"esp",$j,4)); # +=tp[i]
485 &mov (&DWP($frame,"esp",$j,4),"eax"); # tp[i]=
486 &xor ($carry,$carry);
488 &lea ($j,&DWP(1,$j));
489 &je (&label("sqrlast"));
491 &mov ($sbit,"edx"); # zaps $num
494 &set_label("sqradd",16);
495 &mov ("eax",&DWP(0,$inp,$j,4)); # ap[j]
497 &mul ($word); # ap[j]*ap[i]
499 &lea ($j,&DWP(1,$j));
501 &lea ($carry,&DWP(0,$sbit,"eax",2));
505 &add ($carry,&DWP($frame-4,"esp",$j,4)); # +=tp[j]
508 &mov (&DWP($frame-4,"esp",$j,4),$carry); # tp[j]=
510 &jle (&label("sqradd"));
513 &lea ("edx",&DWP(0,$sbit,"edx",2));
515 &set_label("sqrlast");
518 &imul ($word,&DWP($frame,"esp")); # n0*tp[0]
520 &add ("edx",&DWP($frame,"esp",$j,4)); # +=tp[num]
521 &mov ("eax",&DWP(0,$inp)); # np[0]
523 &mov (&DWP($frame,"esp",$j,4),"edx"); # tp[num]=
524 &mov (&DWP($frame+4,"esp",$j,4),$carry); # tp[num+1]=
526 &mul ($word); # np[0]*m
527 &add ("eax",&DWP($frame,"esp")); # +=tp[0]
528 &lea ($num,&DWP(-1,$j));
531 &mov ("eax",&DWP(4,$inp)); # np[1]
533 &jmp (&label("3rdmadd"));
536 &set_label("common_tail",16);
538 &mov ("esi",&DWP($frame+4,"esp",$num,4));# load upmost overflow bit
539 &mov ($rp,$_rp); # load result pointer
540 # [$ap and $bp are zapped]
542 &mov ($j,$num); # j=num-1
543 &cmp ("esi",0); # clears CF unconditionally
544 &jnz (&label("sub"));
545 &mov ("eax",&DWP($frame,"esp",$j,4));
546 &cmp ("eax",&DWP(0,$np,$j,4)); # tp[num-1]-np[num-1]?
547 &jae (&label("sub")); # if taken CF is cleared
548 &set_label("copy",16);
549 &mov ("eax",&DWP($frame,"esp",$j,4));
550 &mov (&DWP(0,$rp,$j,4),"eax"); # rp[i]=tp[i]
551 &mov (&DWP($frame,"esp",$j,4),$j); # zap temporary vector
553 &jge (&label("copy"));
554 &jmp (&label("exit"));
556 &set_label("sub",16);
557 &mov ("eax",&DWP($frame,"esp",$i,4));
558 &sbb ("eax",&DWP(0,$np,$i,4));
559 &mov (&DWP(0,$rp,$i,4),"eax"); # rp[i]=tp[i]-np[i]
560 &lea ($i,&DWP(1,$i)); # i++
561 &dec ($j); # doesn't affect CF!
562 &jge (&label("sub"));
563 &mov ($j,$num); # j=num-1
564 &sbb ("esi",0); # esi holds upmost overflow bit
565 &jc (&label("copy"));
567 &mov (&DWP($frame,"esp",$j,4),$i); # zap temporary vector
569 &jge (&label("zap"));
571 &set_label("exit",8);
572 &mov ("esp",$_sp); # pull saved stack pointer
574 &set_label("just_leave");
575 &function_end("bn_mul_mont");
577 &asciz("Montgomery Multiplication for x86, CRYPTOGAMS by <appro\@openssl.org>");