Explain *cough*-dows

(Imports upstream's 1bf80d93024e72628d4351c7ad19c0dfe635aa95.)

Change-Id: If1d61336edc7f63cdfd8ac14157376bde2651a31
Reviewed-on: https://boringssl-review.googlesource.com/13769
Commit-Queue: Adam Langley <agl@google.com>
Reviewed-by: David Benjamin <davidben@google.com>
This commit is contained in:
Adam Langley 2017-02-09 12:13:52 -08:00 committed by David Benjamin
parent edcd8fda65
commit b8344501d3
3 changed files with 3 additions and 3 deletions

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

View File

@ -117,7 +117,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

View File

@ -102,7 +102,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