/external/llvm-project/polly/lib/External/isl/ |
D | isl_mat.c | 42 isl_hash_byte(hash, mat->n_col & 0xFF); in isl_mat_get_hash() 46 row_hash = isl_seq_get_hash(mat->row[i], mat->n_col); 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() 72 mat->row[i] = mat->block.data + i * n_col; in isl_mat_alloc() 78 mat->n_col = n_col; in isl_mat_alloc() 79 mat->max_col = n_col; 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() 100 if (mat->n_col < n_col) in isl_mat_extend() [all …]
|
D | isl_mat_private.h | 16 unsigned n_col; 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);
|
D | isl_equalities.c | 77 M = isl_mat_alloc(B->ctx, B->n_row, B->n_row + B->n_col - 1); in particular_solution() 87 for (j = 0; j < B->n_col - 1; ++j) in particular_solution() 108 T = isl_mat_sub_alloc(U, B->n_row, B->n_col - 1, 0, B->n_row); in particular_solution() 134 U = isl_mat_alloc(B->ctx, B->n_col - 1, B->n_col - 1); in parameter_compression_1() 137 isl_seq_cpy(U->row[0], B->row[0] + 1, B->n_col - 1); in parameter_compression_1() 173 size = B->n_col - 1; in parameter_compression_multi() 184 for (k = 0; k < U->n_col; ++k) in parameter_compression_multi() 188 for (k = 0; k < U->n_col; ++k) in parameter_compression_multi() 323 if (cst->n_col == 0) { in isl_mat_parameter_compression() 324 T = isl_mat_alloc(B->ctx, B->n_col, 0); in isl_mat_parameter_compression() [all …]
|
D | isl_local.c | 187 isl_size n_col; in isl_local_cmp() local 201 n_col = isl_mat_cols(mat1); in isl_local_cmp() 202 if (n_col < 0) in isl_local_cmp() 213 last1 = isl_seq_last_non_zero(mat1->row[i] + 1, n_col - 1); in isl_local_cmp() 214 last2 = isl_seq_last_non_zero(mat2->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() 247 mat = isl_mat_alloc(div->ctx, div->n_row, div->n_col + extra); in isl_local_reorder() 253 isl_seq_clr(mat->row[i] + 2, mat->n_col - 2); in isl_local_reorder()
|
D | isl_tab.c | 72 tab->n_col = n_var; in isl_tab_alloc() 128 tab->n_row + n_new, off + tab->n_col); in isl_tab_extend_cons() 165 if (tab->mat->n_col < off + tab->n_col + n_new) { in isl_tab_extend_vars() 169 tab->mat->n_row, off + tab->n_col + n_new); in isl_tab_extend_vars() 173 int, tab->n_col + n_new); in isl_tab_extend_vars() 249 dup->col_var = isl_alloc_array(tab->mat->ctx, int, tab->mat->n_col - off); in isl_tab_dup() 250 if ((tab->mat->n_col - off) && !dup->col_var) in isl_tab_dup() 252 for (i = 0; i < tab->n_col; ++i) in isl_tab_dup() 282 dup->n_col = tab->n_col; in isl_tab_dup() 464 tab1->n_col, tab2->n_col, off, r1, r2, d1, d2); in isl_tab_product() [all …]
|
D | isl_factorization.c | 154 g->pos = isl_alloc_array(H->ctx, int, H->n_col); in init_groups() 155 g->group = isl_alloc_array(H->ctx, int, H->n_col); in init_groups() 156 g->cnt = isl_alloc_array(H->ctx, int, H->n_col); in init_groups() 164 for (i = 0, j = 0; i < H->n_col; ++i) { in init_groups() 170 for (i = 0; i < H->n_col; ++i) { in init_groups() 203 for (k = i + 1; k < H->n_col && j >= g->pos[k]; ++k) { in update_group_i_with_row_j() 231 for (i = 0; i < H->n_col && g->cnt[0] < H->n_col; ++i) { in update_groups() 245 for (i = 1; i < H->n_col; ++i) in update_groups()
|
D | isl_morph.c | 479 if (C && C->n_col == 0) { in isl_basic_set_variable_compression() 613 isl_seq_gcd(morph->inv->row[1 + i], morph->inv->n_col, &gcd); in add_strides() 624 morph->inv->n_col); in add_strides() 625 isl_seq_clr(bset->eq[k] + morph->inv->n_col, bset->n_div); in add_strides() 626 isl_int_set(bset->eq[k][morph->inv->n_col + div], in add_strides() 674 isl_seq_cpy(res->eq[k], mat->row[i], mat->n_col); in isl_morph_basic_set() 675 isl_seq_scale(res->eq[k] + mat->n_col, bset->eq[i] + mat->n_col, in isl_morph_basic_set() 689 isl_seq_cpy(res->ineq[k], mat->row[i], mat->n_col); in isl_morph_basic_set() 690 isl_seq_scale(res->ineq[k] + mat->n_col, in isl_morph_basic_set() 691 bset->ineq[i] + mat->n_col, in isl_morph_basic_set() [all …]
|
D | isl_local_space.c | 586 if (ls->div->n_col != div->size) in isl_local_space_add_div() 630 unsigned c = src->n_col - src->n_row; in expand_row() 633 isl_seq_clr(dst->row[d] + c, dst->n_col - c); in expand_row() 646 unsigned n_row, unsigned n_col) in cmp_row() argument 658 li = n_col - n_row + i; in cmp_row() 660 li = isl_seq_last_non_zero(row_i, n_col); in cmp_row() 662 lj = n_col - n_row + j; in cmp_row() 664 lj = isl_seq_last_non_zero(row_j, n_col); in cmp_row() 669 return isl_seq_cmp(row_i, row_j, n_col); 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 …]
|
D | isl_affine_hull.c | 642 isl_assert(tab->mat->ctx, tab->samples->n_col == 1 + tab->n_var, goto error); in isl_tab_detect_equalities() 1039 isl_seq_gcd(M->row[i], M->n_col, &gcd); in add_strides() 1049 isl_seq_cpy(bmap->eq[k], M->row[i], M->n_col); in add_strides() 1050 isl_seq_clr(bmap->eq[k] + M->n_col, bmap->n_div - n_known); in add_strides() 1051 isl_int_set(bmap->eq[k][M->n_col - n_known + div], in add_strides() 1095 int n, n_col; in isl_basic_map_make_strides_explicit() local 1124 n_col = bmap->n_div - n_known; in isl_basic_map_make_strides_explicit() 1125 A = isl_mat_sub_alloc6(ctx, bmap->eq, 0, n, 1 + v_div + n_known, n_col); in isl_basic_map_make_strides_explicit() 1127 A = isl_mat_drop_cols(A, n, n_col - n); in isl_basic_map_make_strides_explicit()
|
D | isl_tab_pip.c | 620 isl_seq_scale(mat->row[i], mat->row[i], m, mat->n_col); in scale_rows() 704 isl_seq_clr(mat->row[0] + 1, mat->n_col - 1); in sol_add() 710 isl_seq_clr(mat->row[1 + row], mat->n_col); in sol_add() 746 mat->n_col); in sol_add() 1047 tab->mat->row[row][0], 1 + tab->M + tab->n_col); in set_row_cst_to_div() 1059 1 + tab->M + tab->n_col); in set_row_cst_to_div() 1270 int col = tab->n_col; in lexmin_pivot_col() 1278 for (j = tab->n_dead; j < tab->n_col; ++j) { in lexmin_pivot_col() 1285 if (col == tab->n_col) in lexmin_pivot_col() 1348 for (col = tab->n_dead; col < tab->n_col; ++col) { in check_lexpos() [all …]
|
D | isl_polynomial.c | 1441 int n_row, n_col; in compatible_divs() local 1445 div1->n_col >= div2->n_col, in compatible_divs() 1452 n_col = div1->n_col; in compatible_divs() 1454 div1->n_col = div2->n_col; in compatible_divs() 1459 div1->n_col = n_col; in compatible_divs() 1468 li = isl_seq_last_non_zero(div->row[i], div->n_col); in cmp_row() 1469 lj = isl_seq_last_non_zero(div->row[j], div->n_col); in cmp_row() 1474 return isl_seq_cmp(div->row[i], div->row[j], div->n_col); in cmp_row() 1516 len = qp->div->n_col - 2; in sort_divs() 1548 qp->div->row[i - skip], qp->div->n_col)) { in sort_divs() [all …]
|
D | isl_sample.c | 162 n_eq = tab->n_var - tab->n_col + tab->n_dead; in tab_equalities() 204 tab->n_zero = n_eq = tab->n_var - tab->n_col + tab->n_dead; in initial_basis() 403 isl_assert(tab->mat->ctx, tab->basis->n_col == tab->n_var + 1, in isl_tab_sample() 714 isl_seq_clr(T->row[i] + 1, T->n_col - 1); in plug_in() 716 for (i = 0; i < T->n_col - 1; ++i) { in plug_in() 717 isl_seq_clr(T->row[sample->size + i], T->n_col); in plug_in() 1095 if (tab_cone->n_col == tab_cone->n_dead) { in isl_tab_set_initial_basis_with_cone()
|
D | polytope_scan.c | 37 ss->samples->n_col); in scan_samples_add_sample()
|
D | isl_map_simplify.c | 1004 if (C->n_col == 0) { in normalize_divs() 1030 if (T->n_col == 0) { in normalize_divs() 2705 isl_size n_row, n_col; in uset_gist_compressed() local 2722 n_col = isl_mat_cols(ineq); in uset_gist_compressed() 2723 if (n_row < 0 || n_col < 0) in uset_gist_compressed() 2727 isl_seq_gcd(ineq->row[i] + 1, n_col - 1, &ctx->normalize_gcd); in uset_gist_compressed() 2733 ctx->normalize_gcd, n_col - 1); in uset_gist_compressed() 2844 if (T && T->n_col == 0) { in uset_gist() 2911 if (1 + total != eq->n_col) in basic_map_from_equalities() 2921 isl_seq_cpy(bmap->eq[k], eq->row[i], eq->n_col); in basic_map_from_equalities() [all …]
|
D | isl_tab.h | 138 unsigned n_col; member
|
/external/eigen/Eigen/src/OrderingMethods/ |
D | Eigen_Colamd.h | 202 inline IndexType colamd_c(IndexType n_col) in colamd_c() argument 203 { return IndexType( ((n_col) + 1) * sizeof (colamd_col<IndexType>) / sizeof (IndexType) ) ; } in colamd_c() 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… 220 static void order_children (IndexType n_col, colamd_col<IndexType> Col [], IndexType p []); 226 static IndexType garbage_collection (IndexType n_row, IndexType n_col, 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/rust/crates/rusqlite/src/vtab/ |
D | csvtab.rs | 121 let mut n_col = None; in connect() localVariable 141 if n_col.is_some() { in connect() 150 n_col = Some(n); in connect() 206 if vtab.has_headers || (n_col.is_none() && schema.is_none()) { in connect() 212 if n_col.is_none() && schema.is_none() { in connect() 228 } else if let Some(n_col) = n_col { in connect() 229 for i in 0..n_col { in connect()
|
/external/eigen/Eigen/src/UmfPackSupport/ |
D | UmfPackSupport.h | 56 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/ |
D | mat.h | 29 unsigned n_row, unsigned n_col); 31 unsigned n_row, unsigned n_col);
|
/external/tensorflow/tensorflow/lite/kernels/internal/reference/ |
D | portable_tensor_utils.h | 144 int32_t n_row, int32_t n_col, in MatrixScalarMultiplyAccumulate() argument 146 PortableMatrixScalarMultiplyAccumulate(matrix, scalar, n_row, n_col, output); in MatrixScalarMultiplyAccumulate()
|
D | portable_tensor_utils_impl.h | 137 int32_t n_col, int32_t* output);
|
/external/tensorflow/tensorflow/lite/kernels/internal/optimized/ |
D | sse_tensor_utils.h | 145 int32_t n_row, int32_t n_col, in MatrixScalarMultiplyAccumulate() argument 147 PortableMatrixScalarMultiplyAccumulate(matrix, scalar, n_row, n_col, output); in MatrixScalarMultiplyAccumulate()
|
D | neon_tensor_utils.h | 136 int32_t n_row, int32_t n_col, in MatrixScalarMultiplyAccumulate() argument 138 NEON_OR_PORTABLE(MatrixScalarMultiplyAccumulate, matrix, scalar, n_row, n_col, in MatrixScalarMultiplyAccumulate()
|
D | neon_tensor_utils_impl.h | 103 int32_t n_row, int32_t n_col,
|
/external/eigen/bench/ |
D | sparse_setter.cpp | 301 const int n_col, in coo_tocsr() argument 379 const I n_col, in csr_sum_duplicates() argument
|