VirtualBox

source: vbox/trunk/src/libs/openssl-1.1.1l/crypto/bn/asm/x86-mont.pl@ 92014

Last change on this file since 92014 was 91772, checked in by vboxsync, 3 years ago

openssl-1.1.1l: Applied and adjusted our OpenSSL changes to 1.1.1l. bugref:10126

  • Property svn:executable set to *
File size: 17.3 KB
Line 
1#! /usr/bin/env perl
2# Copyright 2005-2020 The OpenSSL Project Authors. All Rights Reserved.
3#
4# Licensed under the OpenSSL license (the "License"). You may not use
5# this file except in compliance with the License. You can obtain a copy
6# in the file LICENSE in the source distribution or at
7# https://www.openssl.org/source/license.html
8
9
10# ====================================================================
11# Written by Andy Polyakov <[email protected]> for the OpenSSL
12# project. The module is, however, dual licensed under OpenSSL and
13# CRYPTOGAMS licenses depending on where you obtain it. For further
14# details see http://www.openssl.org/~appro/cryptogams/.
15# ====================================================================
16
17# October 2005
18#
19# This is a "teaser" code, as it can be improved in several ways...
20# First of all non-SSE2 path should be implemented (yes, for now it
21# performs Montgomery multiplication/convolution only on SSE2-capable
22# CPUs such as P4, others fall down to original code). Then inner loop
23# can be unrolled and modulo-scheduled to improve ILP and possibly
24# moved to 128-bit XMM register bank (though it would require input
25# rearrangement and/or increase bus bandwidth utilization). Dedicated
26# squaring procedure should give further performance improvement...
27# Yet, for being draft, the code improves rsa512 *sign* benchmark by
28# 110%(!), rsa1024 one - by 70% and rsa4096 - by 20%:-)
29
30# December 2006
31#
32# Modulo-scheduling SSE2 loops results in further 15-20% improvement.
33# Integer-only code [being equipped with dedicated squaring procedure]
34# gives ~40% on rsa512 sign benchmark...
35
36$0 =~ m/(.*[\/\\])[^\/\\]+$/; $dir=$1;
37push(@INC,"${dir}","${dir}../../perlasm");
38require "x86asm.pl";
39
40$output = pop;
41open STDOUT,">$output";
42
43&asm_init($ARGV[0]);
44
45$sse2=0;
46for (@ARGV) { $sse2=1 if (/-DOPENSSL_IA32_SSE2/); }
47
48&external_label("OPENSSL_ia32cap_P") if ($sse2);
49
50&function_begin("bn_mul_mont");
51
52$i="edx";
53$j="ecx";
54$ap="esi"; $tp="esi"; # overlapping variables!!!
55$rp="edi"; $bp="edi"; # overlapping variables!!!
56$np="ebp";
57$num="ebx";
58
59$_num=&DWP(4*0,"esp"); # stack top layout
60$_rp=&DWP(4*1,"esp");
61$_ap=&DWP(4*2,"esp");
62$_bp=&DWP(4*3,"esp");
63$_np=&DWP(4*4,"esp");
64$_n0=&DWP(4*5,"esp"); $_n0q=&QWP(4*5,"esp");
65$_sp=&DWP(4*6,"esp");
66$_bpend=&DWP(4*7,"esp");
67$frame=32; # size of above frame rounded up to 16n
68
69 &xor ("eax","eax");
70 &mov ("edi",&wparam(5)); # int num
71 &cmp ("edi",4);
72 &jl (&label("just_leave"));
73
74 &lea ("esi",&wparam(0)); # put aside pointer to argument block
75 &lea ("edx",&wparam(1)); # load ap
76 &add ("edi",2); # extra two words on top of tp
77 &neg ("edi");
78 &lea ("ebp",&DWP(-$frame,"esp","edi",4)); # future alloca($frame+4*(num+2))
79 &neg ("edi");
80
81 # minimize cache contention by arranging 2K window between stack
82 # pointer and ap argument [np is also position sensitive vector,
83 # but it's assumed to be near ap, as it's allocated at ~same
84 # time].
85 &mov ("eax","ebp");
86 &sub ("eax","edx");
87 &and ("eax",2047);
88 &sub ("ebp","eax"); # this aligns sp and ap modulo 2048
89
90 &xor ("edx","ebp");
91 &and ("edx",2048);
92 &xor ("edx",2048);
93 &sub ("ebp","edx"); # this splits them apart modulo 4096
94
95 &and ("ebp",-64); # align to cache line
96
97 # An OS-agnostic version of __chkstk.
98 #
99 # Some OSes (Windows) insist on stack being "wired" to
100 # physical memory in strictly sequential manner, i.e. if stack
101 # allocation spans two pages, then reference to farmost one can
102 # be punishable by SEGV. But page walking can do good even on
103 # other OSes, because it guarantees that villain thread hits
104 # the guard page before it can make damage to innocent one...
105 &mov ("eax","esp");
106 &sub ("eax","ebp");
107 &and ("eax",-4096);
108 &mov ("edx","esp"); # saved stack pointer!
109 &lea ("esp",&DWP(0,"ebp","eax"));
110 &mov ("eax",&DWP(0,"esp"));
111 &cmp ("esp","ebp");
112 &ja (&label("page_walk"));
113 &jmp (&label("page_walk_done"));
114
115&set_label("page_walk",16);
116 &lea ("esp",&DWP(-4096,"esp"));
117 &mov ("eax",&DWP(0,"esp"));
118 &cmp ("esp","ebp");
119 &ja (&label("page_walk"));
120&set_label("page_walk_done");
121
122 ################################# load argument block...
123 &mov ("eax",&DWP(0*4,"esi"));# BN_ULONG *rp
124 &mov ("ebx",&DWP(1*4,"esi"));# const BN_ULONG *ap
125 &mov ("ecx",&DWP(2*4,"esi"));# const BN_ULONG *bp
126 &mov ("ebp",&DWP(3*4,"esi"));# const BN_ULONG *np
127 &mov ("esi",&DWP(4*4,"esi"));# const BN_ULONG *n0
128 #&mov ("edi",&DWP(5*4,"esi"));# int num
129
130 &mov ("esi",&DWP(0,"esi")); # pull n0[0]
131 &mov ($_rp,"eax"); # ... save a copy of argument block
132 &mov ($_ap,"ebx");
133 &mov ($_bp,"ecx");
134 &mov ($_np,"ebp");
135 &mov ($_n0,"esi");
136 &lea ($num,&DWP(-3,"edi")); # num=num-1 to assist modulo-scheduling
137 #&mov ($_num,$num); # redundant as $num is not reused
138 &mov ($_sp,"edx"); # saved stack pointer!
139
140
141if($sse2) {
142$acc0="mm0"; # mmx register bank layout
143$acc1="mm1";
144$car0="mm2";
145$car1="mm3";
146$mul0="mm4";
147$mul1="mm5";
148$temp="mm6";
149$mask="mm7";
150
151 &picmeup("eax","OPENSSL_ia32cap_P");
152 &bt (&DWP(0,"eax"),26);
153 &jnc (&label("non_sse2"));
154
155 &mov ("eax",-1);
156 &movd ($mask,"eax"); # mask 32 lower bits
157
158 &mov ($ap,$_ap); # load input pointers
159 &mov ($bp,$_bp);
160 &mov ($np,$_np);
161
162 &xor ($i,$i); # i=0
163 &xor ($j,$j); # j=0
164
165 &movd ($mul0,&DWP(0,$bp)); # bp[0]
166 &movd ($mul1,&DWP(0,$ap)); # ap[0]
167 &movd ($car1,&DWP(0,$np)); # np[0]
168
169 &pmuludq($mul1,$mul0); # ap[0]*bp[0]
170 &movq ($car0,$mul1);
171 &movq ($acc0,$mul1); # I wish movd worked for
172 &pand ($acc0,$mask); # inter-register transfers
173
174 &pmuludq($mul1,$_n0q); # *=n0
175
176 &pmuludq($car1,$mul1); # "t[0]"*np[0]*n0
177 &paddq ($car1,$acc0);
178
179 &movd ($acc1,&DWP(4,$np)); # np[1]
180 &movd ($acc0,&DWP(4,$ap)); # ap[1]
181
182 &psrlq ($car0,32);
183 &psrlq ($car1,32);
184
185 &inc ($j); # j++
186&set_label("1st",16);
187 &pmuludq($acc0,$mul0); # ap[j]*bp[0]
188 &pmuludq($acc1,$mul1); # np[j]*m1
189 &paddq ($car0,$acc0); # +=c0
190 &paddq ($car1,$acc1); # +=c1
191
192 &movq ($acc0,$car0);
193 &pand ($acc0,$mask);
194 &movd ($acc1,&DWP(4,$np,$j,4)); # np[j+1]
195 &paddq ($car1,$acc0); # +=ap[j]*bp[0];
196 &movd ($acc0,&DWP(4,$ap,$j,4)); # ap[j+1]
197 &psrlq ($car0,32);
198 &movd (&DWP($frame-4,"esp",$j,4),$car1); # tp[j-1]=
199 &psrlq ($car1,32);
200
201 &lea ($j,&DWP(1,$j));
202 &cmp ($j,$num);
203 &jl (&label("1st"));
204
205 &pmuludq($acc0,$mul0); # ap[num-1]*bp[0]
206 &pmuludq($acc1,$mul1); # np[num-1]*m1
207 &paddq ($car0,$acc0); # +=c0
208 &paddq ($car1,$acc1); # +=c1
209
210 &movq ($acc0,$car0);
211 &pand ($acc0,$mask);
212 &paddq ($car1,$acc0); # +=ap[num-1]*bp[0];
213 &movd (&DWP($frame-4,"esp",$j,4),$car1); # tp[num-2]=
214
215 &psrlq ($car0,32);
216 &psrlq ($car1,32);
217
218 &paddq ($car1,$car0);
219 &movq (&QWP($frame,"esp",$num,4),$car1); # tp[num].tp[num-1]
220
221
222 &inc ($i); # i++
223&set_label("outer");
224 &xor ($j,$j); # j=0
225
226 &movd ($mul0,&DWP(0,$bp,$i,4)); # bp[i]
227 &movd ($mul1,&DWP(0,$ap)); # ap[0]
228 &movd ($temp,&DWP($frame,"esp")); # tp[0]
229 &movd ($car1,&DWP(0,$np)); # np[0]
230 &pmuludq($mul1,$mul0); # ap[0]*bp[i]
231
232 &paddq ($mul1,$temp); # +=tp[0]
233 &movq ($acc0,$mul1);
234 &movq ($car0,$mul1);
235 &pand ($acc0,$mask);
236
237 &pmuludq($mul1,$_n0q); # *=n0
238
239 &pmuludq($car1,$mul1);
240 &paddq ($car1,$acc0);
241
242 &movd ($temp,&DWP($frame+4,"esp")); # tp[1]
243 &movd ($acc1,&DWP(4,$np)); # np[1]
244 &movd ($acc0,&DWP(4,$ap)); # ap[1]
245
246 &psrlq ($car0,32);
247 &psrlq ($car1,32);
248 &paddq ($car0,$temp); # +=tp[1]
249
250 &inc ($j); # j++
251 &dec ($num);
252&set_label("inner");
253 &pmuludq($acc0,$mul0); # ap[j]*bp[i]
254 &pmuludq($acc1,$mul1); # np[j]*m1
255 &paddq ($car0,$acc0); # +=c0
256 &paddq ($car1,$acc1); # +=c1
257
258 &movq ($acc0,$car0);
259 &movd ($temp,&DWP($frame+4,"esp",$j,4));# tp[j+1]
260 &pand ($acc0,$mask);
261 &movd ($acc1,&DWP(4,$np,$j,4)); # np[j+1]
262 &paddq ($car1,$acc0); # +=ap[j]*bp[i]+tp[j]
263 &movd ($acc0,&DWP(4,$ap,$j,4)); # ap[j+1]
264 &psrlq ($car0,32);
265 &movd (&DWP($frame-4,"esp",$j,4),$car1);# tp[j-1]=
266 &psrlq ($car1,32);
267 &paddq ($car0,$temp); # +=tp[j+1]
268
269 &dec ($num);
270 &lea ($j,&DWP(1,$j)); # j++
271 &jnz (&label("inner"));
272
273 &mov ($num,$j);
274 &pmuludq($acc0,$mul0); # ap[num-1]*bp[i]
275 &pmuludq($acc1,$mul1); # np[num-1]*m1
276 &paddq ($car0,$acc0); # +=c0
277 &paddq ($car1,$acc1); # +=c1
278
279 &movq ($acc0,$car0);
280 &pand ($acc0,$mask);
281 &paddq ($car1,$acc0); # +=ap[num-1]*bp[i]+tp[num-1]
282 &movd (&DWP($frame-4,"esp",$j,4),$car1); # tp[num-2]=
283 &psrlq ($car0,32);
284 &psrlq ($car1,32);
285
286 &movd ($temp,&DWP($frame+4,"esp",$num,4)); # += tp[num]
287 &paddq ($car1,$car0);
288 &paddq ($car1,$temp);
289 &movq (&QWP($frame,"esp",$num,4),$car1); # tp[num].tp[num-1]
290
291 &lea ($i,&DWP(1,$i)); # i++
292 &cmp ($i,$num);
293 &jle (&label("outer"));
294
295 &emms (); # done with mmx bank
296 &jmp (&label("common_tail"));
297
298&set_label("non_sse2",16);
299}
300
301
302if (0) {
303 &mov ("esp",$_sp);
304 &xor ("eax","eax"); # signal "not fast enough [yet]"
305 &jmp (&label("just_leave"));
306 # While the below code provides competitive performance for
307 # all key lengths on modern Intel cores, it's still more
308 # than 10% slower for 4096-bit key elsewhere:-( "Competitive"
309 # means compared to the original integer-only assembler.
310 # 512-bit RSA sign is better by ~40%, but that's about all
311 # one can say about all CPUs...
312} else {
313$inp="esi"; # integer path uses these registers differently
314$word="edi";
315$carry="ebp";
316
317 &mov ($inp,$_ap);
318 &lea ($carry,&DWP(1,$num));
319 &mov ($word,$_bp);
320 &xor ($j,$j); # j=0
321 &mov ("edx",$inp);
322 &and ($carry,1); # see if num is even
323 &sub ("edx",$word); # see if ap==bp
324 &lea ("eax",&DWP(4,$word,$num,4)); # &bp[num]
325 &or ($carry,"edx");
326 &mov ($word,&DWP(0,$word)); # bp[0]
327 &jz (&label("bn_sqr_mont"));
328 &mov ($_bpend,"eax");
329 &mov ("eax",&DWP(0,$inp));
330 &xor ("edx","edx");
331
332&set_label("mull",16);
333 &mov ($carry,"edx");
334 &mul ($word); # ap[j]*bp[0]
335 &add ($carry,"eax");
336 &lea ($j,&DWP(1,$j));
337 &adc ("edx",0);
338 &mov ("eax",&DWP(0,$inp,$j,4)); # ap[j+1]
339 &cmp ($j,$num);
340 &mov (&DWP($frame-4,"esp",$j,4),$carry); # tp[j]=
341 &jl (&label("mull"));
342
343 &mov ($carry,"edx");
344 &mul ($word); # ap[num-1]*bp[0]
345 &mov ($word,$_n0);
346 &add ("eax",$carry);
347 &mov ($inp,$_np);
348 &adc ("edx",0);
349 &imul ($word,&DWP($frame,"esp")); # n0*tp[0]
350
351 &mov (&DWP($frame,"esp",$num,4),"eax"); # tp[num-1]=
352 &xor ($j,$j);
353 &mov (&DWP($frame+4,"esp",$num,4),"edx"); # tp[num]=
354 &mov (&DWP($frame+8,"esp",$num,4),$j); # tp[num+1]=
355
356 &mov ("eax",&DWP(0,$inp)); # np[0]
357 &mul ($word); # np[0]*m
358 &add ("eax",&DWP($frame,"esp")); # +=tp[0]
359 &mov ("eax",&DWP(4,$inp)); # np[1]
360 &adc ("edx",0);
361 &inc ($j);
362
363 &jmp (&label("2ndmadd"));
364
365
366
367&set_label("1stmadd",16);
368 &mov ($carry,"edx");
369 &mul ($word); # ap[j]*bp[i]
370 &add ($carry,&DWP($frame,"esp",$j,4)); # +=tp[j]
371 &lea ($j,&DWP(1,$j));
372 &adc ("edx",0);
373 &add ($carry,"eax");
374 &mov ("eax",&DWP(0,$inp,$j,4)); # ap[j+1]
375 &adc ("edx",0);
376 &cmp ($j,$num);
377 &mov (&DWP($frame-4,"esp",$j,4),$carry); # tp[j]=
378 &jl (&label("1stmadd"));
379
380 &mov ($carry,"edx");
381 &mul ($word); # ap[num-1]*bp[i]
382 &add ("eax",&DWP($frame,"esp",$num,4)); # +=tp[num-1]
383 &mov ($word,$_n0);
384 &adc ("edx",0);
385 &mov ($inp,$_np);
386 &add ($carry,"eax");
387 &adc ("edx",0);
388 &imul ($word,&DWP($frame,"esp")); # n0*tp[0]
389
390 &xor ($j,$j);
391 &add ("edx",&DWP($frame+4,"esp",$num,4)); # carry+=tp[num]
392 &mov (&DWP($frame,"esp",$num,4),$carry); # tp[num-1]=
393 &adc ($j,0);
394 &mov ("eax",&DWP(0,$inp)); # np[0]
395 &mov (&DWP($frame+4,"esp",$num,4),"edx"); # tp[num]=
396 &mov (&DWP($frame+8,"esp",$num,4),$j); # tp[num+1]=
397
398 &mul ($word); # np[0]*m
399 &add ("eax",&DWP($frame,"esp")); # +=tp[0]
400 &mov ("eax",&DWP(4,$inp)); # np[1]
401 &adc ("edx",0);
402 &mov ($j,1);
403
404
405&set_label("2ndmadd",16);
406 &mov ($carry,"edx");
407 &mul ($word); # np[j]*m
408 &add ($carry,&DWP($frame,"esp",$j,4)); # +=tp[j]
409 &lea ($j,&DWP(1,$j));
410 &adc ("edx",0);
411 &add ($carry,"eax");
412 &mov ("eax",&DWP(0,$inp,$j,4)); # np[j+1]
413 &adc ("edx",0);
414 &cmp ($j,$num);
415 &mov (&DWP($frame-8,"esp",$j,4),$carry); # tp[j-1]=
416 &jl (&label("2ndmadd"));
417
418 &mov ($carry,"edx");
419 &mul ($word); # np[j]*m
420 &add ($carry,&DWP($frame,"esp",$num,4)); # +=tp[num-1]
421 &adc ("edx",0);
422 &add ($carry,"eax");
423 &adc ("edx",0);
424 &mov (&DWP($frame-4,"esp",$num,4),$carry); # tp[num-2]=
425
426 &xor ("eax","eax");
427 &mov ($j,$_bp); # &bp[i]
428 &add ("edx",&DWP($frame+4,"esp",$num,4)); # carry+=tp[num]
429 &adc ("eax",&DWP($frame+8,"esp",$num,4)); # +=tp[num+1]
430 &lea ($j,&DWP(4,$j));
431 &mov (&DWP($frame,"esp",$num,4),"edx"); # tp[num-1]=
432 &cmp ($j,$_bpend);
433 &mov (&DWP($frame+4,"esp",$num,4),"eax"); # tp[num]=
434 &je (&label("common_tail"));
435
436 &mov ($word,&DWP(0,$j)); # bp[i+1]
437 &mov ($inp,$_ap);
438 &mov ($_bp,$j); # &bp[++i]
439 &xor ($j,$j);
440 &xor ("edx","edx");
441 &mov ("eax",&DWP(0,$inp));
442 &jmp (&label("1stmadd"));
443
444
445&set_label("bn_sqr_mont",16);
446$sbit=$num;
447 &mov ($_num,$num);
448 &mov ($_bp,$j); # i=0
449
450 &mov ("eax",$word); # ap[0]
451 &mul ($word); # ap[0]*ap[0]
452 &mov (&DWP($frame,"esp"),"eax"); # tp[0]=
453 &mov ($sbit,"edx");
454 &shr ("edx",1);
455 &and ($sbit,1);
456 &inc ($j);
457&set_label("sqr",16);
458 &mov ("eax",&DWP(0,$inp,$j,4)); # ap[j]
459 &mov ($carry,"edx");
460 &mul ($word); # ap[j]*ap[0]
461 &add ("eax",$carry);
462 &lea ($j,&DWP(1,$j));
463 &adc ("edx",0);
464 &lea ($carry,&DWP(0,$sbit,"eax",2));
465 &shr ("eax",31);
466 &cmp ($j,$_num);
467 &mov ($sbit,"eax");
468 &mov (&DWP($frame-4,"esp",$j,4),$carry); # tp[j]=
469 &jl (&label("sqr"));
470
471 &mov ("eax",&DWP(0,$inp,$j,4)); # ap[num-1]
472 &mov ($carry,"edx");
473 &mul ($word); # ap[num-1]*ap[0]
474 &add ("eax",$carry);
475 &mov ($word,$_n0);
476 &adc ("edx",0);
477 &mov ($inp,$_np);
478 &lea ($carry,&DWP(0,$sbit,"eax",2));
479 &imul ($word,&DWP($frame,"esp")); # n0*tp[0]
480 &shr ("eax",31);
481 &mov (&DWP($frame,"esp",$j,4),$carry); # tp[num-1]=
482
483 &lea ($carry,&DWP(0,"eax","edx",2));
484 &mov ("eax",&DWP(0,$inp)); # np[0]
485 &shr ("edx",31);
486 &mov (&DWP($frame+4,"esp",$j,4),$carry); # tp[num]=
487 &mov (&DWP($frame+8,"esp",$j,4),"edx"); # tp[num+1]=
488
489 &mul ($word); # np[0]*m
490 &add ("eax",&DWP($frame,"esp")); # +=tp[0]
491 &mov ($num,$j);
492 &adc ("edx",0);
493 &mov ("eax",&DWP(4,$inp)); # np[1]
494 &mov ($j,1);
495
496
497
498&set_label("3rdmadd",16);
499 &mov ($carry,"edx");
500 &mul ($word); # np[j]*m
501 &add ($carry,&DWP($frame,"esp",$j,4)); # +=tp[j]
502 &adc ("edx",0);
503 &add ($carry,"eax");
504 &mov ("eax",&DWP(4,$inp,$j,4)); # np[j+1]
505 &adc ("edx",0);
506 &mov (&DWP($frame-4,"esp",$j,4),$carry); # tp[j-1]=
507
508 &mov ($carry,"edx");
509 &mul ($word); # np[j+1]*m
510 &add ($carry,&DWP($frame+4,"esp",$j,4)); # +=tp[j+1]
511 &lea ($j,&DWP(2,$j));
512 &adc ("edx",0);
513 &add ($carry,"eax");
514 &mov ("eax",&DWP(0,$inp,$j,4)); # np[j+2]
515 &adc ("edx",0);
516 &cmp ($j,$num);
517 &mov (&DWP($frame-8,"esp",$j,4),$carry); # tp[j]=
518 &jl (&label("3rdmadd"));
519
520 &mov ($carry,"edx");
521 &mul ($word); # np[j]*m
522 &add ($carry,&DWP($frame,"esp",$num,4)); # +=tp[num-1]
523 &adc ("edx",0);
524 &add ($carry,"eax");
525 &adc ("edx",0);
526 &mov (&DWP($frame-4,"esp",$num,4),$carry); # tp[num-2]=
527
528 &mov ($j,$_bp); # i
529 &xor ("eax","eax");
530 &mov ($inp,$_ap);
531 &add ("edx",&DWP($frame+4,"esp",$num,4)); # carry+=tp[num]
532 &adc ("eax",&DWP($frame+8,"esp",$num,4)); # +=tp[num+1]
533 &mov (&DWP($frame,"esp",$num,4),"edx"); # tp[num-1]=
534 &cmp ($j,$num);
535 &mov (&DWP($frame+4,"esp",$num,4),"eax"); # tp[num]=
536 &je (&label("common_tail"));
537
538
539 &mov ($word,&DWP(4,$inp,$j,4)); # ap[i]
540 &lea ($j,&DWP(1,$j));
541 &mov ("eax",$word);
542 &mov ($_bp,$j); # ++i
543 &mul ($word); # ap[i]*ap[i]
544 &add ("eax",&DWP($frame,"esp",$j,4)); # +=tp[i]
545 &adc ("edx",0);
546 &mov (&DWP($frame,"esp",$j,4),"eax"); # tp[i]=
547 &xor ($carry,$carry);
548 &cmp ($j,$num);
549 &lea ($j,&DWP(1,$j));
550 &je (&label("sqrlast"));
551
552 &mov ($sbit,"edx"); # zaps $num
553 &shr ("edx",1);
554 &and ($sbit,1);
555&set_label("sqradd",16);
556 &mov ("eax",&DWP(0,$inp,$j,4)); # ap[j]
557 &mov ($carry,"edx");
558 &mul ($word); # ap[j]*ap[i]
559 &add ("eax",$carry);
560 &lea ($carry,&DWP(0,"eax","eax"));
561 &adc ("edx",0);
562 &shr ("eax",31);
563 &add ($carry,&DWP($frame,"esp",$j,4)); # +=tp[j]
564 &lea ($j,&DWP(1,$j));
565 &adc ("eax",0);
566 &add ($carry,$sbit);
567 &adc ("eax",0);
568 &cmp ($j,$_num);
569 &mov (&DWP($frame-4,"esp",$j,4),$carry); # tp[j]=
570 &mov ($sbit,"eax");
571 &jle (&label("sqradd"));
572
573 &mov ($carry,"edx");
574 &add ("edx","edx");
575 &shr ($carry,31);
576 &add ("edx",$sbit);
577 &adc ($carry,0);
578&set_label("sqrlast");
579 &mov ($word,$_n0);
580 &mov ($inp,$_np);
581 &imul ($word,&DWP($frame,"esp")); # n0*tp[0]
582
583 &add ("edx",&DWP($frame,"esp",$j,4)); # +=tp[num]
584 &mov ("eax",&DWP(0,$inp)); # np[0]
585 &adc ($carry,0);
586 &mov (&DWP($frame,"esp",$j,4),"edx"); # tp[num]=
587 &mov (&DWP($frame+4,"esp",$j,4),$carry); # tp[num+1]=
588
589 &mul ($word); # np[0]*m
590 &add ("eax",&DWP($frame,"esp")); # +=tp[0]
591 &lea ($num,&DWP(-1,$j));
592 &adc ("edx",0);
593 &mov ($j,1);
594 &mov ("eax",&DWP(4,$inp)); # np[1]
595
596 &jmp (&label("3rdmadd"));
597}
598
599
600&set_label("common_tail",16);
601 &mov ($np,$_np); # load modulus pointer
602 &mov ($rp,$_rp); # load result pointer
603 &lea ($tp,&DWP($frame,"esp")); # [$ap and $bp are zapped]
604
605 &mov ("eax",&DWP(0,$tp)); # tp[0]
606 &mov ($j,$num); # j=num-1
607 &xor ($i,$i); # i=0 and clear CF!
608
609&set_label("sub",16);
610 &sbb ("eax",&DWP(0,$np,$i,4));
611 &mov (&DWP(0,$rp,$i,4),"eax"); # rp[i]=tp[i]-np[i]
612 &dec ($j); # doesn't affect CF!
613 &mov ("eax",&DWP(4,$tp,$i,4)); # tp[i+1]
614 &lea ($i,&DWP(1,$i)); # i++
615 &jge (&label("sub"));
616
617 &sbb ("eax",0); # handle upmost overflow bit
618 &mov ("edx",-1);
619 &xor ("edx","eax");
620 &jmp (&label("copy"));
621
622&set_label("copy",16); # conditional copy
623 &mov ($tp,&DWP($frame,"esp",$num,4));
624 &mov ($np,&DWP(0,$rp,$num,4));
625 &mov (&DWP($frame,"esp",$num,4),$j); # zap temporary vector
626 &and ($tp,"eax");
627 &and ($np,"edx");
628 &or ($np,$tp);
629 &mov (&DWP(0,$rp,$num,4),$np);
630 &dec ($num);
631 &jge (&label("copy"));
632
633 &mov ("esp",$_sp); # pull saved stack pointer
634 &mov ("eax",1);
635&set_label("just_leave");
636&function_end("bn_mul_mont");
637
638&asciz("Montgomery Multiplication for x86, CRYPTOGAMS by <appro\@openssl.org>");
639
640&asm_finish();
641
642close STDOUT or die "error closing STDOUT: $!";
Note: See TracBrowser for help on using the repository browser.

© 2024 Oracle Support Privacy / Do Not Sell My Info Terms of Use Trademark Policy Automated Access Etiquette