Home
last modified time | relevance | path

Searched refs:mat1 (Results 1 – 7 of 7) sorted by relevance

/llvm-project-15.0.7/polly/lib/External/isl/
H A Disl_local.c188 isl_mat *mat1 = local1; in isl_local_cmp() local
198 if (mat1->n_row != mat2->n_row) in isl_local_cmp()
199 return mat1->n_row - mat2->n_row; in isl_local_cmp()
201 n_col = isl_mat_cols(mat1); in isl_local_cmp()
204 for (i = 0; i < mat1->n_row; ++i) { in isl_local_cmp()
213 last1 = isl_seq_last_non_zero(mat1->row[i] + 1, n_col - 1); in isl_local_cmp()
217 cmp = isl_seq_cmp(mat1->row[i], mat2->row[i], n_col); in isl_local_cmp()
H A Disl_mat.c927 if (!mat1 || !mat2) in isl_mat_diagonal()
930 mat = isl_mat_alloc(mat1->ctx, mat1->n_row + mat2->n_row, in isl_mat_diagonal()
935 isl_seq_cpy(mat->row[i], mat1->row[i], mat1->n_col); in isl_mat_diagonal()
939 isl_seq_clr(mat->row[mat1->n_row + i], mat1->n_col); in isl_mat_diagonal()
940 isl_seq_cpy(mat->row[mat1->n_row + i] + mat1->n_col, in isl_mat_diagonal()
943 isl_mat_free(mat1); in isl_mat_diagonal()
947 isl_mat_free(mat1); in isl_mat_diagonal()
1803 if (!mat1 || !mat2) in isl_mat_is_equal()
1813 if (!isl_seq_eq(mat1->row[i], mat2->row[i], mat1->n_col)) in isl_mat_is_equal()
2059 n1 = isl_mat_rows(mat1); in isl_mat_row_basis_extension()
[all …]
H A Disl_tab.c323 static __isl_give isl_mat *tab_mat_product(__isl_keep isl_mat *mat1, in tab_mat_product() argument
332 prod = isl_mat_alloc(mat1->ctx, mat1->n_row + mat2->n_row, in tab_mat_product()
339 isl_seq_cpy(prod->row[n + i], mat1->row[i], off + d1); in tab_mat_product()
342 mat1->row[i] + off + d1, col1 - d1); in tab_mat_product()
359 isl_seq_cpy(prod->row[n + i], mat1->row[r1 + i], off + d1); in tab_mat_product()
362 mat1->row[r1 + i] + off + d1, col1 - d1); in tab_mat_product()
/llvm-project-15.0.7/llvm/test/Analysis/FunctionPropertiesAnalysis/
H A Dmatmul.ll8 %mat1 = alloca [2 x [2 x i32]], align 16
14 %arraydecay = getelementptr inbounds [2 x [2 x i32]], [2 x [2 x i32]]* %mat1, i64 0, i64 0
29 define void @multiply([2 x i32]* %mat1, [2 x i32]* %mat2, [2 x i32]* %res) {
32 %mat1.addr = alloca [2 x i32]*, align 8
38 store [2 x i32]* %mat1, [2 x i32]** %mat1.addr, align 8
76 %6 = load [2 x i32]*, [2 x i32]** %mat1.addr, align 8
/llvm-project-15.0.7/polly/lib/External/isl/include/isl/
H A Dmat.h58 __isl_give isl_mat *isl_mat_diagonal(__isl_take isl_mat *mat1,
97 __isl_take isl_mat *mat1, __isl_take isl_mat *mat2);
105 isl_bool isl_mat_is_equal(__isl_keep isl_mat *mat1, __isl_keep isl_mat *mat2);
106 isl_bool isl_mat_has_linearly_independent_rows(__isl_keep isl_mat *mat1,
/llvm-project-15.0.7/clang/test/Sema/
H A Darray-init.c265 const Matrix mat1 = { in test_matrix() local
/llvm-project-15.0.7/polly/lib/External/isl/doc/
H A Duser.pod9614 The following function computes rows that extend a basis of C<mat1>
9618 __isl_take isl_mat *mat1,
9622 among the combined rows of "mat1" and "mat2" that is not already present
9623 in "mat1" or "mat2" individually.
9624 If "mat1" and "mat2" have linearly independent rows by themselves,
9628 __isl_keep isl_mat *mat1,