arne
/
cryptopp
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Fix SunStudio compile on Solaris (GH #226)

pull/668/merge
Jeffrey Walton 2018-07-15 19:26:15 -04:00
parent 692ed2a2bb
commit 339cc240a2
No known key found for this signature in database
GPG Key ID: B36AB348921B1838
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
gcm-simd.cpp
View File

@ -19,9 +19,9 @@
# undef CRYPTOPP_SSE2_ASM_AVAILABLE # undef CRYPTOPP_SSE2_ASM_AVAILABLE
#endif #endif
// SunCC 12.3 - 12.5 crash in GCM_Reduce_CLMUL // SunCC 12.3 - 12.6 crash in GCM_Reduce_CLMUL
// http://github.com/weidai11/cryptopp/issues/226 // http://github.com/weidai11/cryptopp/issues/226
#if defined(__SUNPRO_CC) && (__SUNPRO_CC <= 0x5140) #if defined(__SUNPRO_CC) && (__SUNPRO_CC <= 0x5150)
# undef CRYPTOPP_CLMUL_AVAILABLE # undef CRYPTOPP_CLMUL_AVAILABLE
#endif #endif
@ -506,7 +506,7 @@ __m128i _mm_clmulepi64_si128(const __m128i &a, const __m128i &b, int i)
} }
#endif // Testing #endif // Testing
__m128i GCM_Reduce_CLMUL(__m128i c0, __m128i c1, __m128i c2, const __m128i &r) inline __m128i GCM_Reduce_CLMUL(__m128i c0, __m128i c1, __m128i c2, const __m128i &r)
{ {
/* /*
The polynomial to be reduced is c0 * x^128 + c1 * x^64 + c2. c0t below refers to the most The polynomial to be reduced is c0 * x^128 + c1 * x^64 + c2. c0t below refers to the most