Home
last modified time | relevance | path

Searched refs:n_row (Results 1 – 25 of 39) sorted by relevance

12

/external/llvm-project/polly/lib/External/isl/
Disl_mat.c41 isl_hash_byte(hash, mat->n_row & 0xFF); in isl_mat_get_hash()
43 for (i = 0; i < mat->n_row; ++i) { in isl_mat_get_hash()
54 unsigned n_row, unsigned n_col) in isl_mat_alloc() argument
64 mat->block = isl_blk_alloc(ctx, n_row * n_col); in isl_mat_alloc()
67 mat->row = isl_alloc_array(ctx, isl_int *, n_row); in isl_mat_alloc()
68 if (n_row && !mat->row) in isl_mat_alloc()
71 for (i = 0; i < n_row; ++i) in isl_mat_alloc()
77 mat->n_row = n_row; in isl_mat_alloc()
90 unsigned n_row, unsigned n_col) in isl_mat_extend() argument
99 if (mat->max_col >= n_col && mat->n_row >= n_row) { in isl_mat_extend()
[all …]
Disl_equalities.c77 M = isl_mat_alloc(B->ctx, B->n_row, B->n_row + B->n_col - 1); in particular_solution()
78 C = isl_mat_alloc(B->ctx, 1 + B->n_row, 1); in particular_solution()
82 for (i = 0; i < B->n_row; ++i) { in particular_solution()
83 isl_seq_clr(M->row[i], B->n_row); in particular_solution()
88 isl_int_fdiv_r(M->row[i][B->n_row + j], in particular_solution()
94 H = isl_mat_sub_alloc(M, 0, B->n_row, 0, B->n_row); in particular_solution()
99 for (i = 0; i < B->n_row; ++i) { in particular_solution()
104 if (i < B->n_row) in particular_solution()
105 cst = isl_mat_alloc(B->ctx, B->n_row, 0); in particular_solution()
107 cst = isl_mat_sub_alloc(C, 1, B->n_row, 0, 1); in particular_solution()
[all …]
Disl_mat_private.h15 unsigned n_row; member
28 __isl_give isl_mat *isl_mat_zero(isl_ctx *ctx, unsigned n_row, unsigned n_col);
32 unsigned first_row, unsigned n_row, unsigned first_col, unsigned n_col);
34 unsigned first_row, unsigned n_row, unsigned first_col, unsigned n_col);
36 unsigned n_row, unsigned dst_col, unsigned src_col, unsigned n_col);
38 unsigned n_row, unsigned dst_col, unsigned src_col, unsigned n_col);
39 isl_stat isl_mat_sub_transform(isl_int **row, unsigned n_row,
41 __isl_give isl_mat *isl_mat_diag(isl_ctx *ctx, unsigned n_row, isl_int d);
Disl_local_space.c241 return ls->div->n_row; in isl_local_space_dim()
246 return dim + ls->div->n_row; in isl_local_space_dim()
378 if (pos < 0 || pos >= ls->div->n_row) in isl_local_space_get_div()
595 isl_seq_cpy(ls->div->row[ls->div->n_row - 1], div->el, div->size); in isl_local_space_add_div()
596 isl_int_set_si(ls->div->row[ls->div->n_row - 1][div->size], 0); in isl_local_space_add_div()
630 unsigned c = src->n_col - src->n_row; in expand_row()
646 unsigned n_row, unsigned n_col) in cmp_row() argument
658 li = n_col - n_row + i; in cmp_row()
662 lj = n_col - n_row + j; in cmp_row()
676 return cmp_row(div->row[i], div->row[j], i, j, div->n_row, div->n_col); in isl_mat_cmp_div()
[all …]
Disl_local.c198 if (mat1->n_row != mat2->n_row) in isl_local_cmp()
199 return mat1->n_row - mat2->n_row; in isl_local_cmp()
204 for (i = 0; i < mat1->n_row; ++i) { in isl_local_cmp()
246 extra = dim + div->n_row - r->len; in isl_local_reorder()
247 mat = isl_mat_alloc(div->ctx, div->n_row, div->n_col + extra); in isl_local_reorder()
251 for (i = 0; i < div->n_row; ++i) { in isl_local_reorder()
Disl_tab.c34 unsigned n_row, unsigned n_var, unsigned M) in isl_tab_alloc() argument
43 tab->mat = isl_mat_alloc(ctx, n_row, off + n_var); in isl_tab_alloc()
49 tab->con = isl_alloc_array(ctx, struct isl_tab_var, n_row); in isl_tab_alloc()
50 if (n_row && !tab->con) in isl_tab_alloc()
55 tab->row_var = isl_alloc_array(ctx, int, n_row); in isl_tab_alloc()
56 if (n_row && !tab->row_var) in isl_tab_alloc()
68 tab->n_row = 0; in isl_tab_alloc()
71 tab->max_con = n_row; in isl_tab_alloc()
124 if (tab->mat->n_row < tab->n_row + n_new) { in isl_tab_extend_cons()
128 tab->n_row + n_new, off + tab->n_col); in isl_tab_extend_cons()
[all …]
Disl_polynomial.c510 return qp->div->n_row; in isl_qpolynomial_domain_dim()
1332 dup = isl_qpolynomial_alloc(isl_space_copy(qp->dim), qp->div->n_row, in isl_qpolynomial_dup()
1441 int n_row, n_col; in compatible_divs() local
1444 isl_assert(div1->ctx, div1->n_row >= div2->n_row && in compatible_divs()
1448 if (div1->n_row == div2->n_row) in compatible_divs()
1451 n_row = div1->n_row; in compatible_divs()
1453 div1->n_row = div2->n_row; in compatible_divs()
1458 div1->n_row = n_row; in compatible_divs()
1505 if (qp->div->n_row <= 1) in sort_divs()
1513 qp->div->n_row); in sort_divs()
[all …]
Dpolytope_scan.c36 ss->samples = isl_mat_extend(ss->samples, ss->samples->n_row + 1, in scan_samples_add_sample()
41 isl_seq_cpy(ss->samples->row[ss->samples->n_row - 1], in scan_samples_add_sample()
Disl_factorization.c157 g->rowgroup = isl_alloc_array(H->ctx, int, H->n_row); in init_groups()
162 for (i = 0; i < H->n_row; ++i) in init_groups()
165 for ( ; j < H->n_row; ++j) in init_groups()
232 if (g->pos[i] == H->n_row) in update_groups()
236 for (j = g->pos[i] + 1; j < H->n_row; ++j) { in update_groups()
Disl_scheduler.c370 int n_row; member
2449 isl_size n_row = isl_mat_rows(node->sched); in extract_linear_schedule() local
2451 if (n_row < 0) in extract_linear_schedule()
2453 return isl_mat_sub_alloc(node->sched, 0, n_row, in extract_linear_schedule()
3064 return node->nvar - node->rank >= graph->maxvar - graph->n_row; in needs_row()
3221 graph->n_row++; in update_schedule()
3808 nvar = node->nvar + graph->n_row - node->rank; in compute_maxvar()
3847 sub->n_row = graph->n_row; in extract_sub_graph()
3920 graph->n_row -= drop; in reset_band()
4491 isl_size n_row; in split_scaled() local
[all …]
Disl_coalesce.c518 unsigned extra_rows = extra ? extra->n_row : 0; in fuse()
843 for (j = 1; j < T->n_row; ++j) { in not_unique_unit_row()
1232 wraps->mat->n_row = 0; in wraps_init()
1355 w = wraps->mat->n_row; in add_selected_wraps()
1396 wraps->mat->n_row = w; in add_selected_wraps()
1439 for (i = wraps->mat->n_row - 1; i >= first; --i) { in check_wraps()
1557 n = wraps->mat->n_row; in add_selected_wraps_around_facet()
1779 wraps.mat->n_row = 1; in can_wrap_in_facet()
1890 w = wraps->mat->n_row++; in try_wrap_in_facets()
1908 w = wraps->mat->n_row++; in try_wrap_in_facets()
[all …]
Disl_morph.c612 for (i = 0; 1 + i < morph->inv->n_row; ++i) { in add_strides()
655 max_stride = morph->inv->n_row - 1; in isl_morph_basic_set()
666 0, morph->inv->n_row); in isl_morph_basic_set()
681 0, morph->inv->n_row); in isl_morph_basic_set()
697 1, morph->inv->n_row); in isl_morph_basic_set()
Disl_tab.h137 unsigned n_row; member
184 unsigned n_row, unsigned n_var, unsigned M);
Disl_tab_pip.c288 for (i = 1; i < M->n_row; ++i) { in set_from_affine_matrix()
612 static void scale_rows(struct isl_mat *mat, isl_int m, int n_row) in scale_rows() argument
619 for (i = 0; i < n_row; ++i) in scale_rows()
1311 for (row = tab->n_redundant; row < tab->n_row; ++row) { in first_neg()
1320 for (row = tab->n_redundant; row < tab->n_row; ++row) { in first_neg()
2065 for (i = tab->n_outside; i < samples->n_row; ++i) { in context_tab_insert_div()
2326 enum isl_tab_row_sign, tab->mat->n_row); in tab_for_lexmin()
2327 if (tab->mat->n_row && !tab->row_sign) in tab_for_lexmin()
2414 for (split = tab->n_redundant; split < tab->n_row; ++split) { in best_split()
2438 for (row = tab->n_redundant; row < tab->n_row; ++row) { in best_split()
[all …]
Disl_map_simplify.c1037 for (i = 0; i < T->n_row - 1; ++i) { in normalize_divs()
1044 pos = isl_alloc_array(bmap->ctx, int, T->n_row); in normalize_divs()
1062 for (i = 1; i < T->n_row; ++i) { in normalize_divs()
1073 for (i = 1; i < T->n_row; ++i) { in normalize_divs()
1087 if (pos[j] < T->n_row && C2) in normalize_divs()
2705 isl_size n_row, n_col; in uset_gist_compressed() local
2721 n_row = isl_mat_rows(ineq); in uset_gist_compressed()
2723 if (n_row < 0 || n_col < 0) in uset_gist_compressed()
2726 for (i = 0; i < n_row; ++i) { in uset_gist_compressed()
2916 0, eq->n_row, 0); in basic_map_from_equalities()
[all …]
/external/eigen/Eigen/src/OrderingMethods/
DEigen_Colamd.h206 inline IndexType colamd_r(IndexType n_row) in colamd_r() argument
207 { return IndexType(((n_row) + 1) * sizeof (Colamd_Row<IndexType>) / sizeof (IndexType)); } in colamd_r()
211 static IndexType init_rows_cols (IndexType n_row, IndexType n_col, Colamd_Row<IndexType> Row [], co…
214 static void init_scoring (IndexType n_row, IndexType n_col, Colamd_Row<IndexType> Row [], colamd_co…
217 static IndexType find_ordering (IndexType n_row, IndexType n_col, IndexType Alen, Colamd_Row<IndexT…
226 static IndexType garbage_collection (IndexType n_row, IndexType n_col, Colamd_Row<IndexType> Row []…
229 static inline IndexType clear_mark (IndexType n_row, Colamd_Row<IndexType> Row [] ) ;
257 inline IndexType colamd_recommended ( IndexType nnz, IndexType n_row, IndexType n_col) in colamd_recommended() argument
259 if ((nnz) < 0 || (n_row) < 0 || (n_col) < 0) in colamd_recommended()
262 return (2 * (nnz) + colamd_c (n_col) + colamd_r (n_row) + (n_col) + ((nnz) / 5)); in colamd_recommended()
[all …]
/external/libvpx/libvpx/tools/3D-Reconstruction/MotionEST/
DMotionEST.py96 n_row = 1
99 n_row = 2
100 plt.figure(figsize=(n_row * size, size * self.height / self.width))
101 plt.subplot(1, n_row, 1)
105 plt.subplot(1, n_row, 2)
/external/eigen/bench/
Dsparse_setter.cpp300 void coo_tocsr(const int n_row, in coo_tocsr() argument
310 std::fill(Bp, Bp + n_row, 0); in coo_tocsr()
317 for(int i = 0, cumsum = 0; i < n_row; i++){ in coo_tocsr()
322 Bp[n_row] = nnz; in coo_tocsr()
335 for(int i = 0, last = 0; i <= n_row; i++){ in coo_tocsr()
351 void csr_sort_indices(const I n_row, in csr_sort_indices() argument
358 for(I i = 0; i < n_row; i++){ in csr_sort_indices()
378 void csr_sum_duplicates(const I n_row, in csr_sum_duplicates() argument
386 for(I i = 0; i < n_row; i++){ in csr_sum_duplicates()
/external/eigen/Eigen/src/UmfPackSupport/
DUmfPackSupport.h56 inline int umfpack_symbolic(int n_row,int n_col, in umfpack_symbolic() argument
60 return umfpack_di_symbolic(n_row,n_col,Ap,Ai,Ax,Symbolic,Control,Info); in umfpack_symbolic()
63 inline int umfpack_symbolic(int n_row,int n_col, in umfpack_symbolic() argument
67 return umfpack_zi_symbolic(n_row,n_col,Ap,Ai,&numext::real_ref(Ax[0]),0,Symbolic,Control,Info); in umfpack_symbolic()
98 inline int umfpack_get_lunz(int *lnz, int *unz, int *n_row, int *n_col, int *nz_udiag, void *Numeri… in umfpack_get_lunz() argument
100 return umfpack_di_get_lunz(lnz,unz,n_row,n_col,nz_udiag,Numeric); in umfpack_get_lunz()
103 inline int umfpack_get_lunz(int *lnz, int *unz, int *n_row, int *n_col, int *nz_udiag, void *Numeri… in umfpack_get_lunz() argument
105 return umfpack_zi_get_lunz(lnz,unz,n_row,n_col,nz_udiag,Numeric); in umfpack_get_lunz()
/external/llvm-project/polly/lib/External/isl/include/isl/
Dmat.h29 unsigned n_row, unsigned n_col);
31 unsigned n_row, unsigned n_col);
32 __isl_give isl_mat *isl_mat_identity(isl_ctx *ctx, unsigned n_row);
/external/tensorflow/tensorflow/lite/kernels/internal/reference/
Dportable_tensor_utils.h144 int32_t n_row, int32_t n_col, in MatrixScalarMultiplyAccumulate() argument
146 PortableMatrixScalarMultiplyAccumulate(matrix, scalar, n_row, n_col, output); in MatrixScalarMultiplyAccumulate()
Dportable_tensor_utils_impl.h136 int32_t scalar, int32_t n_row,
/external/tensorflow/tensorflow/lite/kernels/internal/optimized/
Dsse_tensor_utils.h145 int32_t n_row, int32_t n_col, in MatrixScalarMultiplyAccumulate() argument
147 PortableMatrixScalarMultiplyAccumulate(matrix, scalar, n_row, n_col, output); in MatrixScalarMultiplyAccumulate()
Dneon_tensor_utils.h136 int32_t n_row, int32_t n_col, in MatrixScalarMultiplyAccumulate() argument
138 NEON_OR_PORTABLE(MatrixScalarMultiplyAccumulate, matrix, scalar, n_row, n_col, in MatrixScalarMultiplyAccumulate()
Dneon_tensor_utils_impl.h103 int32_t n_row, int32_t n_col,

12