Explain *cough*-dows

Reviewed-by: Andy Polyakov <appro@openssl.org>

diff --git a/crypto/bn/asm/x86-mont.pl b/crypto/bn/asm/x86-mont.pl
index 972de2650b6cb2a7442b1651627f41748654652c..50d33507147c1335907f89cc739315989470f2d2 100755 (executable)
--- a/crypto/bn/asm/x86-mont.pl
+++ b/crypto/bn/asm/x86-mont.pl
@@ -88,7 +88,7 @@ $frame=32;                            # size of above frame rounded up to 16n
 
        &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
        # allocation spans two pages, then reference to farmost one can
        # be punishable by SEGV. But page walking can do good even on

diff --git a/crypto/bn/asm/x86_64-mont.pl b/crypto/bn/asm/x86_64-mont.pl
index 8fb6c994e1efb5322bdc59cd2c1d665546fe4212..f8070ca246a0b97d07e0cd4f576a2813ae8c2f0f 100755 (executable)
--- a/crypto/bn/asm/x86_64-mont.pl
+++ b/crypto/bn/asm/x86_64-mont.pl
@@ -130,7 +130,7 @@ $code.=<<___;
 
        mov     %r11,8(%rsp,$num,8)     # tp[num+1]=%rsp
 .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
        # allocation spans two pages, then reference to farmost one can
        # be punishable by SEGV. But page walking can do good even on

diff --git a/crypto/bn/asm/x86_64-mont5.pl b/crypto/bn/asm/x86_64-mont5.pl
index 938e170818036447b923f791b55eee3efc36a7dc..712bfbc6b84ceaf6b740f08f2d3c2f6b68a07e9a 100755 (executable)
--- a/crypto/bn/asm/x86_64-mont5.pl
+++ b/crypto/bn/asm/x86_64-mont5.pl
@@ -115,7 +115,7 @@ $code.=<<___;
 
        mov     %rax,8(%rsp,$num,8)     # tp[num+1]=%rsp
 .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
        # allocation spans two pages, then reference to farmost one can
        # be punishable by SEGV. But page walking can do good even on