50#pragma omp parallel for schedule(static) reduction(+ : s)
51 for (i = rows - 1; i >= 0; i--) {
82#pragma omp parallel for schedule(static) reduction(+ : s)
83 for (i = rows - 1; i >= 0; i--) {
114#pragma omp parallel for schedule(static) reduction(+ : s)
115 for (i = rows - 1; i >= 0; i--) {
145 for (i = rows - 2; i >= 0; i--) {
177#pragma omp for schedule(static)
178 for (i = rows - 1; i >= 0; i--) {
182 else if ((a == 1.0) && (
b == 1.0)) {
183#pragma omp for schedule(static)
184 for (i = rows - 1; i >= 0; i--) {
188 else if ((a == 1.0) && (
b == -1.0)) {
189#pragma omp for schedule(static)
190 for (i = rows - 1; i >= 0; i--) {
195#pragma omp for schedule(static)
196 for (i = rows - 1; i >= 0; i--) {
197 z[i] = a * (
x[i] + y[i]);
200 else if (
b == -1.0) {
201#pragma omp for schedule(static)
202 for (i = rows - 1; i >= 0; i--) {
203 z[i] = a *
x[i] - y[i];
207#pragma omp for schedule(static)
208 for (i = rows - 1; i >= 0; i--) {
209 z[i] = a *
x[i] + y[i];
213#pragma omp for schedule(static)
214 for (i = rows - 1; i >= 0; i--) {
215 z[i] = a *
x[i] +
b * y[i];
236 y =
memcpy(y,
x, rows *
sizeof(
double));
267#pragma omp parallel for schedule(static) reduction(+ : s)
268 for (i = rows - 1; i >= 0; i--) {
299#pragma omp parallel for schedule(static) reduction(+ : s)
300 for (i = rows - 1; i >= 0; i--) {
331#pragma omp parallel for schedule(static) private(i) reduction(+ : s)
332 for (i = 0; i < rows; i++) {
362 for (i = rows - 2; i >= 0; i--) {
393#pragma omp for schedule(static)
394 for (i = rows - 1; i >= 0; i--) {
398 else if ((a == 1.0) && (
b == 1.0)) {
399#pragma omp for schedule(static)
400 for (i = rows - 1; i >= 0; i--) {
404 else if ((a == 1.0) && (
b == -1.0)) {
405#pragma omp for schedule(static)
406 for (i = rows - 1; i >= 0; i--) {
411#pragma omp for schedule(static)
412 for (i = rows - 1; i >= 0; i--) {
413 z[i] = a * (
x[i] + y[i]);
416 else if (
b == -1.0) {
417#pragma omp for schedule(static)
418 for (i = rows - 1; i >= 0; i--) {
419 z[i] = a *
x[i] - y[i];
423#pragma omp for schedule(static)
424 for (i = rows - 1; i >= 0; i--) {
425 z[i] = a *
x[i] + y[i];
429#pragma omp for schedule(static)
430 for (i = rows - 1; i >= 0; i--) {
431 z[i] = a *
x[i] +
b * y[i];
452 y =
memcpy(y,
x, rows *
sizeof(
float));
483#pragma omp parallel for schedule(static) reduction(+ : s)
484 for (i = rows - 1; i >= 0; i--) {
515#pragma omp parallel for schedule(static) reduction(+ : s)
516 for (i = rows - 1; i >= 0; i--) {
547#pragma omp parallel for schedule(static) reduction(+ : s)
548 for (i = rows - 1; i >= 0; i--) {
578 for (i = rows - 2; i >= 0; i--) {
609#pragma omp for schedule(static)
610 for (i = rows - 1; i >= 0; i--) {
614 else if ((a == 1.0) && (
b == 1.0)) {
615#pragma omp for schedule(static)
616 for (i = rows - 1; i >= 0; i--) {
620 else if ((a == 1.0) && (
b == -1.0)) {
621#pragma omp for schedule(static)
622 for (i = rows - 1; i >= 0; i--) {
627#pragma omp for schedule(static)
628 for (i = rows - 1; i >= 0; i--) {
629 z[i] = a * (
x[i] + y[i]);
632 else if (
b == -1.0) {
633#pragma omp for schedule(static)
634 for (i = rows - 1; i >= 0; i--) {
635 z[i] = a *
x[i] - y[i];
639#pragma omp for schedule(static)
640 for (i = rows - 1; i >= 0; i--) {
641 z[i] = a *
x[i] + y[i];
645#pragma omp for schedule(static)
646 for (i = rows - 1; i >= 0; i--) {
647 z[i] = a *
x[i] +
b * y[i];
668 y =
memcpy(y,
x, rows *
sizeof(
int));
void G_math_i_euclid_norm(int *x, double *value, int rows)
Compute the euclid norm of vector x.
void G_math_d_asum_norm(double *x, double *value, int rows)
Compute the asum norm of vector x.
void G_math_f_asum_norm(float *x, float *value, int rows)
Compute the asum norm of vector x.
void G_math_d_max_norm(double *x, double *value, int rows)
Compute the maximum norm of vector x.
void G_math_i_asum_norm(int *x, double *value, int rows)
Compute the asum norm of vector x.
void G_math_f_max_norm(float *x, float *value, int rows)
Compute the maximum norm of vector x.
void G_math_d_x_dot_y(double *x, double *y, double *value, int rows)
Compute the dot product of vector x and y.
void G_math_f_euclid_norm(float *x, float *value, int rows)
Compute the euclid norm of vector x.
void G_math_d_ax_by(double *x, double *y, double *z, double a, double b, int rows)
Scales vectors x and y with the scalars a and b and adds them.
void G_math_f_x_dot_y(float *x, float *y, float *value, int rows)
Compute the dot product of vector x and y.
void G_math_f_ax_by(float *x, float *y, float *z, float a, float b, int rows)
Scales vectors x and y with the scalars a and b and adds them.
void G_math_d_copy(double *x, double *y, int rows)
Copy the vector x to y.
void G_math_i_ax_by(int *x, int *y, int *z, int a, int b, int rows)
Scales vectors x and y with the scalars a and b and adds them.
void G_math_d_euclid_norm(double *x, double *value, int rows)
Compute the euclid norm of vector x.
void G_math_i_max_norm(int *x, int *value, int rows)
Compute the maximum norm of vector x.
void G_math_i_copy(int *x, int *y, int rows)
Copy the vector x to y.
void G_math_i_x_dot_y(int *x, int *y, double *value, int rows)
Compute the dot product of vector x and y.
void G_math_f_copy(float *x, float *y, int rows)
Copy the vector x to y.