yuanjia
803e8d4838
1.Verify correctness using BLAS-Tester
2.Using the built-in benchmark to verify performance, the performance of float and doule type improved by about 60% and about 40% respectively.The test command is:
export OMP_NUM_THREADS=1;numactl -C 10 -l ./sgemv.goto 3000 4000 100
export OMP_NUM_THREADS=1;numactl -C 10 -l ./dgemv.goto 3000 4000 100
145 lines
4.6 KiB
C
145 lines
4.6 KiB
C
/***************************************************************************
|
|
Copyright (c) 2024-2025, The OpenBLAS Project
|
|
All rights reserved.
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
modification, are permitted provided that the following conditions are
|
|
met:
|
|
|
|
1. Redistributions of source code must retain the above copyright
|
|
notice, this list of conditions and the following disclaimer.
|
|
|
|
2. Redistributions in binary form must reproduce the above copyright
|
|
notice, this list of conditions and the following disclaimer in
|
|
the documentation and/or other materials provided with the
|
|
distribution.
|
|
3. Neither the name of the OpenBLAS project nor the names of
|
|
its contributors may be used to endorse or promote products
|
|
derived from this software without specific prior written
|
|
permission.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
|
|
USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*****************************************************************************/
|
|
|
|
#include <arm_sve.h>
|
|
#include "common.h"
|
|
|
|
#ifdef DOUBLE
|
|
#define SV_COUNT svcntd
|
|
#define SV_TYPE svfloat64_t
|
|
#define SV_TRUE svptrue_b64
|
|
#define SV_WHILE svwhilelt_b64_s64
|
|
#define SV_DUP svdup_f64
|
|
#else
|
|
#define SV_COUNT svcntw
|
|
#define SV_TYPE svfloat32_t
|
|
#define SV_TRUE svptrue_b32
|
|
#define SV_WHILE svwhilelt_b32_s64
|
|
#define SV_DUP svdup_f32
|
|
#endif
|
|
|
|
int CNAME(BLASLONG m, BLASLONG n, BLASLONG dummy1, FLOAT alpha, FLOAT *a, BLASLONG lda, FLOAT *x, BLASLONG inc_x, FLOAT *y, BLASLONG inc_y, FLOAT *buffer)
|
|
{
|
|
BLASLONG i;
|
|
BLASLONG ix,iy;
|
|
BLASLONG j;
|
|
FLOAT *a_ptr;
|
|
FLOAT temp;
|
|
|
|
ix = 0;
|
|
a_ptr = a;
|
|
|
|
if (inc_y == 1) {
|
|
BLASLONG width = n / 3;
|
|
uint64_t sve_size = SV_COUNT();
|
|
svbool_t pg_true = SV_TRUE();
|
|
svbool_t pg = SV_WHILE(0, m % sve_size);
|
|
|
|
FLOAT *a0_ptr = a + lda * width * 0;
|
|
FLOAT *a1_ptr = a + lda * width * 1;
|
|
FLOAT *a2_ptr = a + lda * width * 2;
|
|
|
|
for (j = 0; j < width; j++) {
|
|
ix = j * inc_x;
|
|
|
|
SV_TYPE x0_vec = SV_DUP(alpha * x[ix + (inc_x * width * 0)]);
|
|
SV_TYPE x1_vec = SV_DUP(alpha * x[ix + (inc_x * width * 1)]);
|
|
SV_TYPE x2_vec = SV_DUP(alpha * x[ix + (inc_x * width * 2)]);
|
|
for (i = 0; (i + sve_size - 1) < m; i += sve_size) {
|
|
SV_TYPE a00_vec = svld1(pg_true, a0_ptr + i);
|
|
SV_TYPE a01_vec = svld1(pg_true, a1_ptr + i);
|
|
SV_TYPE a02_vec = svld1(pg_true, a2_ptr + i);
|
|
|
|
SV_TYPE y_vec = svld1(pg_true, y + i);
|
|
y_vec = svmla_lane(y_vec, a00_vec, x0_vec, 0);
|
|
y_vec = svmla_lane(y_vec, a01_vec, x1_vec, 0);
|
|
y_vec = svmla_lane(y_vec, a02_vec, x2_vec, 0);
|
|
|
|
svst1(pg_true, y + i, y_vec);
|
|
}
|
|
|
|
if (i < m) {
|
|
SV_TYPE a00_vec = svld1(pg, a0_ptr + i);
|
|
SV_TYPE a01_vec = svld1(pg, a1_ptr + i);
|
|
SV_TYPE a02_vec = svld1(pg, a2_ptr + i);
|
|
|
|
SV_TYPE y_vec = svld1(pg, y + i);
|
|
y_vec = svmla_m(pg, y_vec, a00_vec, x0_vec);
|
|
y_vec = svmla_m(pg, y_vec, a01_vec, x1_vec);
|
|
y_vec = svmla_m(pg, y_vec, a02_vec, x2_vec);
|
|
|
|
ix += inc_x;
|
|
|
|
svst1(pg, y + i, y_vec);
|
|
}
|
|
|
|
a0_ptr += lda;
|
|
a1_ptr += lda;
|
|
a2_ptr += lda;
|
|
}
|
|
|
|
a_ptr = a2_ptr;
|
|
for (j = width * 3; j < n; j++) {
|
|
ix = j * inc_x;
|
|
SV_TYPE x_vec = SV_DUP(alpha * x[(ix)]);
|
|
for (i = 0; (i + sve_size - 1) < m; i += sve_size) {
|
|
SV_TYPE y_vec = svld1(pg_true, y + i);
|
|
SV_TYPE a_vec = svld1(pg_true, a_ptr + i);
|
|
y_vec = svmla_x(pg_true, y_vec, a_vec, x_vec);
|
|
svst1(pg_true, y + i, y_vec);
|
|
}
|
|
|
|
if (i < m) {
|
|
SV_TYPE y_vec = svld1(pg, y + i);
|
|
SV_TYPE a_vec = svld1(pg, a_ptr + i);
|
|
y_vec = svmla_m(pg, y_vec, a_vec, x_vec);
|
|
svst1(pg, y + i, y_vec);
|
|
}
|
|
|
|
a_ptr += lda;
|
|
ix += inc_x;
|
|
}
|
|
return (0);
|
|
}
|
|
|
|
for (j = 0; j < n; j++) {
|
|
temp = alpha * x[ix];
|
|
iy = 0;
|
|
for (i = 0; i < m; i++) {
|
|
y[iy] += temp * a_ptr[i];
|
|
iy += inc_y;
|
|
}
|
|
a_ptr += lda;
|
|
ix += inc_x;
|
|
}
|
|
return (0);
|
|
} |