11#include <batchlas/export.hh>
28using gesv =
Event(Queue&,
29 const MatrixView<T, MatrixFormat::Dense>&,
30 const MatrixView<T, MatrixFormat::Dense>&,
34using gesv_buffer_size = size_t(Queue&,
35 const MatrixView<T, MatrixFormat::Dense>&,
36 const MatrixView<T, MatrixFormat::Dense>&);
52 "GESV: Matrix dimensions cannot be negative (A: rows=" +
53 std::to_string(A.
rows()) +
", cols=" + std::to_string(A.
cols()) +
54 "; B: rows=" + std::to_string(B.
rows()) +
55 ", cols=" + std::to_string(B.
cols()) +
")");
59 "GESV: A must be square, got " + std::to_string(A.
rows()) +
"x" +
60 std::to_string(A.
cols()));
64 "GESV: B must have A.rows() rows, got " + std::to_string(B.
rows()) +
65 " against " + std::to_string(A.
rows()));
69 "GESV: A and B must share a batch size, got " +
100template <Backend Back,
typename T>
113template <Backend Back,
typename T>
121template <Backend Back,
typename T>
Non-owning view of a batch of matrices: the argument type of every entry point.
int rows() const
Rows per item (the capacity on a heterogeneous batch).
int cols() const
Columns per item (the capacity on a heterogeneous batch).
int batch_size() const
Number of batch items.
The call violates the API contract.
Enumerations, scalar traits and scalar concepts shared by every public header.
void gesv_validate_params(const MatrixView< T, MatrixFormat::Dense > &A, const MatrixView< T, MatrixFormat::Dense > &B)
Validates the arguments of gesv() and gesv_buffer_size().
size_t gesv_buffer_size(Queue &ctx, const MatrixView< T, MatrixFormat::Dense > &A, const MatrixView< T, MatrixFormat::Dense > &B)
Workspace, in bytes, that gesv() needs for these operands on this queue.
Event gesv(Queue &ctx, const MatrixView< T, MatrixFormat::Dense > &A, const MatrixView< T, MatrixFormat::Dense > &B, Span< int64_t > pivots, Span< std::byte > work_space, Span< int32_t > info)
Batched solve of by LU with partial pivoting.
The batched containers: Matrix (owning), MatrixView (non-owning), KernelMatrixView (device-side),...
Span(T *, typename Span< T >::size_t) -> Span< T >
Backend deduction from the Queue and the USM pointer check.
#define BATCHLAS_DISPATCH_ON_QUEUE(NAME)
Completion handle of enqueued work, returned by every entry point.
Event()
An empty Event, already complete.
Where BatchLAS work runs: a device, a backend, an ordered SYCL queue and a workspace arena.
Non-owning view of size() contiguous elements of type T.
batchlas::Device, batchlas::Event and batchlas::Queue: where work runs and how it is ordered.
batchlas::Span, the non-owning pointer + length every entry point takes for 1-D data.