mirror of
https://github.com/vale981/arb
synced 2025-03-04 17:01:40 -05:00
133 lines
3 KiB
C
133 lines
3 KiB
C
/*
|
|
Copyright (C) 2013 Fredrik Johansson
|
|
|
|
This file is part of Arb.
|
|
|
|
Arb is free software: you can redistribute it and/or modify it under
|
|
the terms of the GNU Lesser General Public License (LGPL) as published
|
|
by the Free Software Foundation; either version 2.1 of the License, or
|
|
(at your option) any later version. See <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#include "arb_mat.h"
|
|
#include "pthread.h"
|
|
|
|
typedef struct
|
|
{
|
|
arb_ptr * C;
|
|
const arb_ptr * A;
|
|
const arb_ptr * B;
|
|
slong ar0;
|
|
slong ar1;
|
|
slong bc0;
|
|
slong bc1;
|
|
slong br;
|
|
slong prec;
|
|
}
|
|
arb_mat_mul_arg_t;
|
|
|
|
void *
|
|
_arb_mat_mul_thread(void * arg_ptr)
|
|
{
|
|
arb_mat_mul_arg_t arg = *((arb_mat_mul_arg_t *) arg_ptr);
|
|
slong i, j, br, bc;
|
|
arb_ptr tmp;
|
|
TMP_INIT;
|
|
|
|
br = arg.br;
|
|
bc = arg.bc1 - arg.bc0;
|
|
|
|
TMP_START;
|
|
tmp = TMP_ALLOC(sizeof(arb_struct) * br * bc);
|
|
|
|
for (i = 0; i < br; i++)
|
|
for (j = 0; j < bc; j++)
|
|
tmp[j * br + i] = arg.B[i][arg.bc0 + j];
|
|
|
|
for (i = arg.ar0; i < arg.ar1; i++)
|
|
{
|
|
for (j = arg.bc0; j < arg.bc1; j++)
|
|
{
|
|
arb_dot(arg.C[i] + j, NULL, 0,
|
|
arg.A[i], 1, tmp + (j - arg.bc0) * br, 1, br, arg.prec);
|
|
}
|
|
}
|
|
|
|
TMP_END;
|
|
flint_cleanup();
|
|
return NULL;
|
|
}
|
|
|
|
void
|
|
arb_mat_mul_threaded(arb_mat_t C, const arb_mat_t A, const arb_mat_t B, slong prec)
|
|
{
|
|
slong ar, ac, br, bc, i, num_threads;
|
|
pthread_t * threads;
|
|
arb_mat_mul_arg_t * args;
|
|
|
|
ar = arb_mat_nrows(A);
|
|
ac = arb_mat_ncols(A);
|
|
br = arb_mat_nrows(B);
|
|
bc = arb_mat_ncols(B);
|
|
|
|
if (ac != br || ar != arb_mat_nrows(C) || bc != arb_mat_ncols(C))
|
|
{
|
|
flint_printf("arb_mat_mul_threaded: incompatible dimensions\n");
|
|
flint_abort();
|
|
}
|
|
|
|
if (br == 0)
|
|
{
|
|
arb_mat_zero(C);
|
|
return;
|
|
}
|
|
|
|
if (A == C || B == C)
|
|
{
|
|
arb_mat_t T;
|
|
arb_mat_init(T, ar, bc);
|
|
arb_mat_mul_threaded(T, A, B, prec);
|
|
arb_mat_swap_entrywise(T, C);
|
|
arb_mat_clear(T);
|
|
return;
|
|
}
|
|
|
|
num_threads = flint_get_num_threads();
|
|
threads = flint_malloc(sizeof(pthread_t) * num_threads);
|
|
args = flint_malloc(sizeof(arb_mat_mul_arg_t) * num_threads);
|
|
|
|
for (i = 0; i < num_threads; i++)
|
|
{
|
|
args[i].C = C->rows;
|
|
args[i].A = A->rows;
|
|
args[i].B = B->rows;
|
|
|
|
if (ar >= bc)
|
|
{
|
|
args[i].ar0 = (ar * i) / num_threads;
|
|
args[i].ar1 = (ar * (i + 1)) / num_threads;
|
|
args[i].bc0 = 0;
|
|
args[i].bc1 = bc;
|
|
}
|
|
else
|
|
{
|
|
args[i].ar0 = 0;
|
|
args[i].ar1 = ar;
|
|
args[i].bc0 = (bc * i) / num_threads;
|
|
args[i].bc1 = (bc * (i + 1)) / num_threads;
|
|
}
|
|
|
|
args[i].br = br;
|
|
args[i].prec = prec;
|
|
|
|
pthread_create(&threads[i], NULL, _arb_mat_mul_thread, &args[i]);
|
|
}
|
|
|
|
for (i = 0; i < num_threads; i++)
|
|
{
|
|
pthread_join(threads[i], NULL);
|
|
}
|
|
|
|
flint_free(threads);
|
|
flint_free(args);
|
|
}
|