floraachy
/
OpenBLAS
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Merge pull request #2313 from ewanglong/develop 

Fix the integer overflow issue for large matrix size
This commit is contained in:
Martin Kroeker 2019-11-20 14:49:15 +01:00 committed by GitHub
parent 73128f3883 1191db1a49
commit 63d3ee8dfc
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
2 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
kernel/x86_64/sgemm_kernel_16x4_skylakex.c
View File

@ -762,7 +762,7 @@ USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
int __attribute__ ((noinline)) int __attribute__ ((noinline))
CNAME(BLASLONG m, BLASLONG n, BLASLONG k, float alpha, float * __restrict A, float * __restrict B, float * __restrict C, BLASLONG ldc) CNAME(BLASLONG m, BLASLONG n, BLASLONG k, float alpha, float * __restrict A, float * __restrict B, float * __restrict C, BLASLONG ldc)
{ {
unsigned long M = m, N = n, K = k; unsigned long long M = m, N = n, K = k;
if (M == 0) if (M == 0)
return 0; return 0;
if (N == 0) if (N == 0)
@ -1215,7 +1215,7 @@ CNAME(BLASLONG m, BLASLONG n, BLASLONG k, float alpha, float * __restrict A, flo
int sgemm_kernel_direct_performant(BLASLONG M, BLASLONG N, BLASLONG K) int sgemm_kernel_direct_performant(BLASLONG M, BLASLONG N, BLASLONG K)
{ {
int mnk = M * N * K; unsigned long mnk = M * N * K;
/* large matrixes -> not performant */ /* large matrixes -> not performant */
if (mnk >= 28 * 512 * 512) if (mnk >= 28 * 512 * 512)
return 0; return 0;
@ -1639,4 +1639,4 @@ void sgemm_kernel_direct (BLASLONG M, BLASLONG N, BLASLONG K, float * __restrict
STORE_SCALAR(0, 0); STORE_SCALAR(0, 0);
} }
} }
} }

2
kernel/x86_64/sgemm_kernel_16x4_skylakex_2.c
View File

@ -452,7 +452,7 @@ CNAME(BLASLONG m, BLASLONG n, BLASLONG k, float alpha, float * __restrict__ A, f
int sgemm_kernel_direct_performant(BLASLONG M, BLASLONG N, BLASLONG K) int sgemm_kernel_direct_performant(BLASLONG M, BLASLONG N, BLASLONG K)
{ {
int mnk = M * N * K; unsigned long long mnk = M * N * K;
/* large matrixes -> not performant */ /* large matrixes -> not performant */
if (mnk >= 28 * 512 * 512) if (mnk >= 28 * 512 * 512)
return 0; return 0;