| /llvm-project-15.0.7/mlir/unittests/Analysis/Presburger/ |
| H A D | MatrixTest.cpp | 18 for (unsigned row = 0; row < 5; ++row) in TEST() local 21 for (unsigned row = 0; row < 5; ++row) in TEST() local 28 for (unsigned row = 0; row < 5; ++row) in TEST() local 32 for (unsigned row = 0; row < 5; ++row) in TEST() local 43 for (unsigned row = 0; row < 5; ++row) in TEST() local 50 for (unsigned row = 0; row < 5; ++row) in TEST() local 54 for (unsigned row = 0; row < 5; ++row) in TEST() local 65 for (unsigned row = 0; row < 5; ++row) in TEST() local 74 for (unsigned row = 0; row < 5; ++row) in TEST() local 82 for (unsigned row = 0; row < 3; ++row) in TEST() local [all …]
|
| /llvm-project-15.0.7/lldb/unittests/ObjectFile/PECOFF/ |
| H A D | TestPECallFrameInfo.cpp | 214 row.SetOffset(0); in TEST_F() 220 row.SetOffset(2); in TEST_F() 225 row.SetOffset(3); in TEST_F() 230 row.SetOffset(4); in TEST_F() 235 row.SetOffset(6); in TEST_F() 240 row.SetOffset(8); in TEST_F() 256 row.SetOffset(0); in TEST_F() 267 row.SetOffset(5); in TEST_F() 278 row.SetOffset(0); in TEST_F() 284 row.SetOffset(6); in TEST_F() [all …]
|
| /llvm-project-15.0.7/polly/lib/External/isl/ |
| H A D | isl_mat.c | 132 mat->row = row; in isl_mat_extend() 990 isl_seq_neg(left->row[row]+row, left->row[row]+row, left->n_col-row); in inv_oppose() 1000 m, left->row[row]+row, in inv_subtract() 1051 left->row[row][row]); in isl_mat_inverse_product() 1063 isl_int_gcd(a, left->row[row][row], left->row[i][row]); in isl_mat_inverse_product() 1085 isl_int_divexact(left->row[row][row], a, left->row[row][row]); in isl_mat_inverse_product() 1088 isl_seq_scale(right->row[row], right->row[row], in isl_mat_inverse_product() 1159 mat->row[row][row]); in isl_mat_right_inverse() 1169 isl_int_gcd(a, mat->row[row][row], mat->row[row][i]); in isl_mat_right_inverse() 1187 isl_int_divexact(mat->row[row][row], a, mat->row[row][row]); in isl_mat_right_inverse() [all …]
|
| H A D | isl_tab.c | 1139 isl_int_swap(mat->row[row][0], mat->row[row][off + col]); in isl_tab_pivot() 1142 isl_int_neg(mat->row[row][0], mat->row[row][0]); in isl_tab_pivot() 1143 isl_int_neg(mat->row[row][off + col], mat->row[row][off + col]); in isl_tab_pivot() 1148 isl_int_neg(mat->row[row][1 + j], mat->row[row][1 + j]); in isl_tab_pivot() 1157 isl_int_mul(mat->row[i][0], mat->row[i][0], mat->row[row][0]); in isl_tab_pivot() 1162 mat->row[i][1 + j], mat->row[row][0]); in isl_tab_pivot() 1164 mat->row[i][off + col], mat->row[row][1 + j]); in isl_tab_pivot() 1167 mat->row[i][off + col], mat->row[row][off + col]); in isl_tab_pivot() 2163 isl_seq_neg(tab->mat->row[row] + 1, tab->mat->row[row] + 1, in isl_tab_add_eq() 2558 tab->mat->row[row][1], tab->mat->row[row][0]); in extract_integer_sample() [all …]
|
| H A D | basis_reduction_tab.c | 19 struct isl_vec *row; member 107 #define GBR_lp_add_row(lp, row, dim) add_lp_row(lp, row, dim) argument 108 #define GBR_lp_get_alpha(lp, row, alpha) get_alpha(lp, row, alpha) argument 123 if (!tab || !row) in gbr_tab() 159 if (!lp->row) in init_lp() 176 lp->obj = row; in set_lp_obj() 225 isl_seq_cpy(lp->row->el + 1, row, lp->dim); in cut_lp_to_hyperplane() 236 isl_seq_cpy(lp->row->el + 1 + lp->dim, row, lp->dim); in cut_lp_to_hyperplane() 261 isl_vec_free(lp->row); in delete_lp() 273 isl_seq_cpy(lp->row->el + 1, row, lp->dim); in add_lp_row() [all …]
|
| H A D | isl_tab_pip.c | 706 for (row = 0; row < sol->n_out; ++row) { in sol_add() 745 isl_seq_neg(mat->row[1 + row], mat->row[1 + row], in sol_add() 1046 isl_seq_fdiv_q(tab->mat->row[row] + 1, tab->mat->row[row] + 1, in set_row_cst_to_div() 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() 1847 tab->mat->row[row][off + i], tab->mat->row[row][0]); in add_cut() 1896 row = add_cut(tab, row); in cut_to_integer_lexmin() 1966 if (isl_int_ne(tab->mat->row[row][0], tab->mat->row[row][2])) in sample_is_finite() 2237 tab->mat->row[row][0]); in add_parametric_cut() 2246 tab->mat->row[row][0]); in add_parametric_cut() [all …]
|
| H A D | isl_equalities.c | 85 isl_int_neg(C->row[1 + i][0], B->row[i][0]); in particular_solution() 86 isl_int_fdiv_r(C->row[1+i][0], C->row[1+i][0], M->row[i][i]); in particular_solution() 89 B->row[i][1 + j], M->row[i][i]); in particular_solution() 100 if (!isl_int_is_divisible_by(C->row[1+i][0], C->row[0][0])) in particular_solution() 102 isl_int_divexact(C->row[1+i][0], C->row[1+i][0], C->row[0][0]); in particular_solution() 137 isl_seq_cpy(U->row[0], B->row[0] + 1, B->n_col - 1); in parameter_compression_1() 179 isl_seq_cpy(U->row[0], B->row[i] + 1, size); in parameter_compression_multi() 185 isl_int_mul(A->row[k][i*size+0], D, U->row[0][k]); in parameter_compression_multi() 477 isl_int_set(mat->row[1 + i][1 + i], mat->row[0][0]); in insert_parameter_rows() 790 if (!isl_int_is_divisible_by(C->row[1][0], C->row[0][0])) { in isl_basic_set_dim_residue_class() [all …]
|
| H A D | basis_reduction_templ.c | 57 int row; in isl_tab_compute_reduced_basis() local 133 GBR_lp_set_obj(lp, B->row[1+i]+1, dim); in isl_tab_compute_reduced_basis() 141 empty = GBR_lp_cut(lp, B->row[1+i]+1); in isl_tab_compute_reduced_basis() 160 row = GBR_lp_next_row(lp); in isl_tab_compute_reduced_basis() 165 row = GBR_lp_add_row(lp, B->row[1+i]+1, dim); in isl_tab_compute_reduced_basis() 173 GBR_lp_get_alpha(lp, row, &alpha); in isl_tab_compute_reduced_basis() 176 save_alpha(lp, row-i, i, alpha_saved); in isl_tab_compute_reduced_basis() 194 ctx->one, B->row[1+i+1]+1, in isl_tab_compute_reduced_basis() 195 tmp, B->row[1+i]+1, dim); in isl_tab_compute_reduced_basis() 216 isl_seq_combine(B->row[1+i+1]+1, ctx->one, B->row[1+i+1]+1, in isl_tab_compute_reduced_basis() [all …]
|
| H A D | isl_mat_private.h | 18 isl_int **row; member 33 __isl_give isl_mat *isl_mat_sub_alloc6(isl_ctx *ctx, isl_int **row, 39 isl_stat isl_mat_sub_transform(isl_int **row, unsigned n_row, 46 __isl_give isl_mat *isl_mat_scale_down_row(__isl_take isl_mat *mat, int row, 49 __isl_give isl_vec *isl_mat_get_row(__isl_keep isl_mat *mat, unsigned row); 55 isl_stat isl_mat_row_gcd(__isl_keep isl_mat *mat, int row, isl_int *gcd); 64 __isl_give isl_mat *isl_mat_row_neg(__isl_take isl_mat *mat, int row); 66 int isl_mat_get_element(__isl_keep isl_mat *mat, int row, int col, isl_int *v); 68 int row, int col, isl_int v);
|
| H A D | isl_affine_hull.c | 80 if (isl_int_eq(bset1->eq[row][col], bset2->eq[row][col])) in set_common_multiple() 85 isl_int_lcm(m, bset1->eq[row][col], bset2->eq[row][col]); in set_common_multiple() 87 isl_seq_scale(bset1->eq[row], bset1->eq[row], c, col+1); in set_common_multiple() 89 isl_seq_scale(bset2->eq[row], bset2->eq[row], c, col+1); in set_common_multiple() 101 t = bset->eq[row]; in delete_row() 144 delete_row(bset1, row); in construct_column() 208 int row; in affine_hull() local 216 row = 0; in affine_hull() 224 ++row; in affine_hull() 238 --row; in affine_hull() [all …]
|
| /llvm-project-15.0.7/mlir/lib/Analysis/Presburger/ |
| H A D | Matrix.cpp | 49 return row; in appendExtraRow() 83 for (unsigned row = 0; row < nRows; row++) in swapColumns() local 84 std::swap(at(row, column), at(row, otherColumn)); in swapColumns() 205 for (unsigned row = 0, e = getNumRows(); row < e; ++row) in addToColumn() local 206 at(row, targetColumn) += scale * at(row, sourceColumn); in addToColumn() 210 for (unsigned row = 0, e = getNumRows(); row < e; ++row) in negateColumn() local 211 at(row, column) = -at(row, column); in negateColumn() 216 at(row, column) = -at(row, column); in negateRow() 244 for (unsigned row = 0, e = getNumRows(); row < e; row++) in postMultiplyWithColumn() local 246 result[row] += at(row, i) * colVec[i]; in postMultiplyWithColumn() [all …]
|
| H A D | Simplex.cpp | 474 for (unsigned row = 0, e = getNumRows(); row < e; ++row) in maybeGetAlwaysViolatedRow() local 478 for (unsigned row = 0, e = getNumRows(); row < e; ++row) { in maybeGetAlwaysViolatedRow() local 666 for (unsigned row = 0, e = getNumRows(); row < e; ++row) in maybeGetViolatedRow() local 941 for (unsigned row = 0, numRows = getNumRows(); row < numRows; ++row) { in pivot() local 1009 for (unsigned row = nRedundant, e = getNumRows(); row < e; ++row) { in findPivotRow() local 1143 for (unsigned row = nRedundant, e = getNumRows(); row < e; ++row) in findAnyPivotRow() local 1317 if (maybePivot->row == row) in computeRowOptimum() 1524 for (unsigned row = 0; row < a.nRedundant; ++row) in makeProduct() local 1526 for (unsigned row = 0; row < b.nRedundant; ++row) in makeProduct() local 1528 for (unsigned row = a.nRedundant, e = a.getNumRows(); row < e; ++row) in makeProduct() local [all …]
|
| H A D | LinearTransform.cpp | 23 static void modEntryColumnOperation(Matrix &m, unsigned row, unsigned sourceCol, in modEntryColumnOperation() argument 25 assert(m(row, sourceCol) != 0 && "Cannot divide by zero!"); in modEntryColumnOperation() 26 assert((m(row, sourceCol) > 0 && m(row, targetCol) > 0) && in modEntryColumnOperation() 28 int64_t ratio = m(row, targetCol) / m(row, sourceCol); in modEntryColumnOperation() 46 for (unsigned row = 0; row < m.getNumRows(); ++row) { in makeTransformToColumnEchelon() local 50 if (m(row, nonZeroCol) == 0) in makeTransformToColumnEchelon() 68 if (m(row, echelonCol) < 0) { in makeTransformToColumnEchelon() 79 if (m(row, i) < 0) { in makeTransformToColumnEchelon() 96 while (m(row, targetCol) != 0 && m(row, sourceCol) != 0) { in makeTransformToColumnEchelon() 97 modEntryColumnOperation(m, row, sourceCol, targetCol, resultMatrix); in makeTransformToColumnEchelon() [all …]
|
| /llvm-project-15.0.7/llvm/utils/ |
| H A D | llvm-original-di-preservation.py | 77 row = [] 82 row.append(file) 90 for column in row: 119 row = [] 125 for column in row: 161 row = [] 201 row = [] 207 for column in row: 243 row = [] 284 row = [] [all …]
|
| /llvm-project-15.0.7/lldb/unittests/Symbol/ |
| H A D | TestDWARFCallFrameInfo.cpp | 46 row.Dump(SS, nullptr, nullptr, 0); in operator <<() 52 UnwindPlan::Row row; in GetExpectedRow0() local 53 row.SetOffset(0); in GetExpectedRow0() 54 row.GetCFAValue().SetIsRegisterPlusOffset(dwarf_rsp_x86_64, 8); in GetExpectedRow0() 56 return row; in GetExpectedRow0() 60 UnwindPlan::Row row; in GetExpectedRow1() local 61 row.SetOffset(1); in GetExpectedRow1() 65 return row; in GetExpectedRow1() 69 UnwindPlan::Row row; in GetExpectedRow2() local 70 row.SetOffset(4); in GetExpectedRow2() [all …]
|
| /llvm-project-15.0.7/mlir/include/mlir/Analysis/Presburger/ |
| H A D | Matrix.h | 51 int64_t &at(unsigned row, unsigned column) { in at() argument 54 return data[row * nReservedColumns + column]; in at() 60 return data[row * nReservedColumns + column]; in at() 63 int64_t &operator()(unsigned row, unsigned column) { return at(row, column); } in operator() 66 return at(row, column); in operator() 73 void swapRows(unsigned row, unsigned otherRow); 89 MutableArrayRef<int64_t> getRow(unsigned row); 90 ArrayRef<int64_t> getRow(unsigned row) const; 127 void fillRow(unsigned row, int64_t value); 139 void negateRow(unsigned row); [all …]
|
| H A D | Simplex.h | 255 unsigned row, column; member 268 void swapRowWithCol(unsigned row, unsigned col); 271 void pivot(unsigned row, unsigned col); 279 const Unknown &unknownFromRow(unsigned row) const; 285 Unknown &unknownFromRow(unsigned row); 450 LogicalResult moveRowUnknownToColumn(unsigned row); 464 LogicalResult addCut(unsigned row); 474 unsigned getLexMinPivotColumn(unsigned row, unsigned colA, 519 bool rowIsViolated(unsigned row) const; 652 LogicalResult addSymbolicCut(unsigned row); [all …]
|
| /llvm-project-15.0.7/lldb/source/Plugins/Platform/Linux/ |
| H A D | PlatformLinux.cpp | 213 UnwindPlan::RowSP row = std::make_shared<UnwindPlan::Row>(); in GetAArch64TrapHanlderUnwindPlan() local 214 row->SetOffset(0); in GetAArch64TrapHanlderUnwindPlan() 238 row->GetCFAValue().SetIsRegisterPlusOffset(arm64_dwarf::sp, offset); in GetAArch64TrapHanlderUnwindPlan() 240 row->SetRegisterLocationToAtCFAPlusOffset(arm64_dwarf::x0, 0 * 8, false); in GetAArch64TrapHanlderUnwindPlan() 241 row->SetRegisterLocationToAtCFAPlusOffset(arm64_dwarf::x1, 1 * 8, false); in GetAArch64TrapHanlderUnwindPlan() 242 row->SetRegisterLocationToAtCFAPlusOffset(arm64_dwarf::x2, 2 * 8, false); in GetAArch64TrapHanlderUnwindPlan() 243 row->SetRegisterLocationToAtCFAPlusOffset(arm64_dwarf::x3, 3 * 8, false); in GetAArch64TrapHanlderUnwindPlan() 244 row->SetRegisterLocationToAtCFAPlusOffset(arm64_dwarf::x4, 4 * 8, false); in GetAArch64TrapHanlderUnwindPlan() 245 row->SetRegisterLocationToAtCFAPlusOffset(arm64_dwarf::x5, 5 * 8, false); in GetAArch64TrapHanlderUnwindPlan() 246 row->SetRegisterLocationToAtCFAPlusOffset(arm64_dwarf::x6, 6 * 8, false); in GetAArch64TrapHanlderUnwindPlan() [all …]
|
| /llvm-project-15.0.7/lldb/source/Symbol/ |
| H A D | CompactUnwindInfo.cpp | 757 row->SetOffset(0); in CreateUnwindPlan_x86_64() 790 unwind_plan.AppendRow(row); in CreateUnwindPlan_x86_64() 847 row->SetOffset(0); in CreateUnwindPlan_x86_64() 958 unwind_plan.AppendRow(row); in CreateUnwindPlan_x86_64() 1028 row->SetOffset(0); in CreateUnwindPlan_i386() 1110 row->SetOffset(0); in CreateUnwindPlan_i386() 1326 row->SetOffset(0); in CreateUnwindPlan_arm64() 1351 row->SetOffset(0); in CreateUnwindPlan_arm64() 1434 unwind_plan.AppendRow(row); in CreateUnwindPlan_arm64() 1465 row->SetOffset(0); in CreateUnwindPlan_armv7() [all …]
|
| H A D | DWARFCallFrameInfo.cpp | 655 *newrow = *row.get(); in FDEToUnwindPlan() 656 row.reset(newrow); in FDEToUnwindPlan() 690 *newrow = *row.get(); in FDEToUnwindPlan() 691 row.reset(newrow); in FDEToUnwindPlan() 704 *newrow = *row.get(); in FDEToUnwindPlan() 705 row.reset(newrow); in FDEToUnwindPlan() 718 row.reset(newrow); in FDEToUnwindPlan() 731 row.reset(newrow); in FDEToUnwindPlan() 761 row.reset(newrow); in FDEToUnwindPlan() 784 row = stack.back(); in FDEToUnwindPlan() [all …]
|
| /llvm-project-15.0.7/openmp/runtime/test/worksharing/for/ |
| H A D | omp_doacross.c | 33 int row, col; in test_doacross() local 35 for (row = 1; row < N; ++row) { in test_doacross() 37 #pragma omp ordered depend(sink : row - 1, col) depend(sink : row, col - 1) in test_doacross() 38 m[row * N + col] = m[(row - 1) * N + col] + m[row * N + (col - 1)] - in test_doacross() 39 m[(row - 1) * N + (col - 1)]; in test_doacross()
|
| /llvm-project-15.0.7/mlir/test/Conversion/VectorToGPU/ |
| H A D | vector-to-mma-ops-mma-sync.mlir | 4 // INT8 row-row-row 106 // f64 row-row-row 137 // CHECK-DAG: [[row:%.+]] = affine.apply [[$rowA0_map]] 168 // FP16 row-row-row 189 // CHECK-DAG: [[row:%.+]] = affine.apply [[$rowA_map]] 193 // CHECK-DAG: [[row:%.+]] = affine.apply [[$rowB_map]] 225 // CHECK-DAG: [[row:%.+]] = affine.apply [[$Arow_map]] 247 // FP16 row-col-row 292 // TF32 (multiplicand) F32 (accumulator) row-row-row 414 // INT4 row-col-row [all …]
|
| /llvm-project-15.0.7/lldb/source/Plugins/UnwindAssembly/x86/ |
| H A D | x86AssemblyInspectionEngine.cpp | 950 unwind_plan.AppendRow(row); in GetNonCallSiteUnwindPlanFromAssembly() 954 *newrow = *row.get(); in GetNonCallSiteUnwindPlanFromAssembly() 955 row.reset(newrow); in GetNonCallSiteUnwindPlanFromAssembly() 1263 row.reset(newrow); in GetNonCallSiteUnwindPlanFromAssembly() 1299 *newrow = *row.get(); in GetNonCallSiteUnwindPlanFromAssembly() 1300 row.reset(newrow); in GetNonCallSiteUnwindPlanFromAssembly() 1307 *newrow = *row.get(); in GetNonCallSiteUnwindPlanFromAssembly() 1403 *row = *new_row; in AugmentUnwindPlanFromCallSite() 1416 *row = *original_row; in AugmentUnwindPlanFromCallSite() 1440 row->SetOffset(offset); in AugmentUnwindPlanFromCallSite() [all …]
|
| /llvm-project-15.0.7/llvm/test/CodeGen/X86/AMX/ |
| H A D | amx-configO2toO0-lower.ll | 7 define dso_local void @test_api(i32 %cond, i16 signext %row, i16 signext %col) local_unnamed_addr { 17 ; CHECK-NEXT: %{{[0-9]+}} = tail call x86_amx @llvm.x86.tileloadd64.internal(i16 %row, i16 8, ptr… 18 ; CHECK-NEXT: call void @llvm.x86.tilestored64.internal(i16 %row, i16 8, ptr %{{[0-9]+}}, i64 64,… 21 ; CHECK-NEXT: %{{[0-9]+}} = tail call x86_amx @llvm.x86.tileloadd64.internal(i16 %row, i16 %col, … 25 ; CHECK-NEXT: %{{[0-9]+}} = tail call x86_amx @llvm.x86.tileloadd64.internal(i16 %row, i16 8, ptr… 33 ; CHECK-NEXT: %{{[0-9]+}} = call x86_amx @llvm.x86.tileloadd64.internal(i16 %row, i16 8, ptr %{{[… 47 %0 = tail call x86_amx @llvm.x86.tileloadd64.internal(i16 %row, i16 8, ptr @buf, i64 32) 49 %2 = tail call x86_amx @llvm.x86.tileloadd64.internal(i16 %row, i16 %col, ptr @buf, i64 32) 53 %3 = tail call x86_amx @llvm.x86.tileloadd64.internal(i16 %row, i16 8, ptr @buf2, i64 32) 55 %5 = tail call x86_amx @llvm.x86.tileloadd64.internal(i16 %row, i16 %col, ptr @buf2, i64 32) [all …]
|
| /llvm-project-15.0.7/llvm/test/CodeGen/AMDGPU/ |
| H A D | llvm.amdgcn.exp.row.ll | 5 declare void @llvm.amdgcn.exp.row.i32(i32, i32, i32, i32, i32, i32, i1, i32) 6 declare void @llvm.amdgcn.exp.row.f32(i32, i32, float, float, float, float, i1, i32) 16 …call void @llvm.amdgcn.exp.row.i32(i32 12, i32 0, i32 undef, i32 undef, i32 undef, i32 undef, i1 f… 17 …call void @llvm.amdgcn.exp.row.i32(i32 13, i32 0, i32 undef, i32 undef, i32 undef, i32 undef, i1 t… 41 call void @llvm.amdgcn.exp.row.i32(i32 12, i32 7, i32 0, i32 0, i32 0, i32 undef, i1 false, i32 0) 42 call void @llvm.amdgcn.exp.row.i32(i32 13, i32 7, i32 0, i32 0, i32 0, i32 undef, i1 true, i32 0) 66 …call void @llvm.amdgcn.exp.row.i32(i32 12, i32 1, i32 %id, i32 undef, i32 undef, i32 undef, i1 tru… 70 define amdgpu_kernel void @id_arg_i32(i32 %row) #0 { 79 …call void @llvm.amdgcn.exp.row.i32(i32 12, i32 1, i32 %id, i32 undef, i32 undef, i32 undef, i1 tru… 83 ; Divergent row number just causes a readfirstlane for now. [all …]
|