generic-library/openssl
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Explain *cough*-dows

Browse Source 
Reviewed-by: Andy Polyakov <appro@openssl.org>
This commit is contained in:
Emilia Kasper 2016-03-15 21:52:31 +01:00 committed by Richard Levitte
parent 4def90c5de
commit 1bf80d9302
3 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
crypto/bn/asm/x86-mont.pl
View File

@ -88,7 +88,7 @@ $frame=32; # size of above frame rounded up to 16n
&and ("esp",-64); # align to cache line &and ("esp",-64); # align to cache line
# Some OSes, *cough*-dows, insist on stack being "wired" to # Some OSes (Windows) insist on stack being "wired" to
# physical memory in strictly sequential manner, i.e. if stack # physical memory in strictly sequential manner, i.e. if stack
# allocation spans two pages, then reference to farmost one can # allocation spans two pages, then reference to farmost one can
# be punishable by SEGV. But page walking can do good even on # be punishable by SEGV. But page walking can do good even on

2
crypto/bn/asm/x86_64-mont.pl
View File

@ -130,7 +130,7 @@ $code.=<<___;
mov %r11,8(%rsp,$num,8) # tp[num+1]=%rsp mov %r11,8(%rsp,$num,8) # tp[num+1]=%rsp
.Lmul_body: .Lmul_body:
# Some OSes, *cough*-dows, insist on stack being "wired" to # Some OSes (Windows) insist on stack being "wired" to
# physical memory in strictly sequential manner, i.e. if stack # physical memory in strictly sequential manner, i.e. if stack
# allocation spans two pages, then reference to farmost one can # allocation spans two pages, then reference to farmost one can
# be punishable by SEGV. But page walking can do good even on # be punishable by SEGV. But page walking can do good even on

2
crypto/bn/asm/x86_64-mont5.pl
View File

@ -115,7 +115,7 @@ $code.=<<___;
mov %rax,8(%rsp,$num,8) # tp[num+1]=%rsp mov %rax,8(%rsp,$num,8) # tp[num+1]=%rsp
.Lmul_body: .Lmul_body:
# Some OSes, *cough*-dows, insist on stack being "wired" to # Some OSes (Windows) insist on stack being "wired" to
# physical memory in strictly sequential manner, i.e. if stack # physical memory in strictly sequential manner, i.e. if stack
# allocation spans two pages, then reference to farmost one can # allocation spans two pages, then reference to farmost one can
# be punishable by SEGV. But page walking can do good even on # be punishable by SEGV. But page walking can do good even on