Home
last modified time | relevance | path

Searched refs:pivot (Results 1 – 20 of 20) sorted by relevance

/llvm-project-15.0.7/llvm/test/CodeGen/VE/Vector/
H A Dvp_merge.ll6 …256 x i32> @test_vp_merge_v256i32_vv(<256 x i32> %i0, <256 x i32> %i1, <256 x i1> %m, i32 %pivot) {
16 …all <256 x i32> @llvm.vp.merge.v256i32(<256 x i1> %m, <256 x i32> %i0, <256 x i32> %i1, i32 %pivot)
20 …fastcc <256 x i32> @test_vp_merge_v256i32_vr(<256 x i32> %i0, i32 %s1, <256 x i1> %m, i32 %pivot) {
36 …all <256 x i32> @llvm.vp.merge.v256i32(<256 x i1> %m, <256 x i32> %i0, <256 x i32> %i1, i32 %pivot)
52 …56 x float> @llvm.vp.merge.v256f32(<256 x i1> %m, <256 x float> %i0, <256 x float> %i1, i32 %pivot)
56 … <256 x float> @test_vp_merge_v256f32_vr(<256 x float> %i0, float %s1, <256 x i1> %m, i32 %pivot) {
71 …56 x float> @llvm.vp.merge.v256f32(<256 x i1> %m, <256 x float> %i0, <256 x float> %i1, i32 %pivot)
112 …256 x i64> @test_vp_merge_v256i64_vv(<256 x i64> %i0, <256 x i64> %i1, <256 x i1> %m, i32 %pivot) {
122 …all <256 x i64> @llvm.vp.merge.v256i64(<256 x i1> %m, <256 x i64> %i0, <256 x i64> %i1, i32 %pivot)
126 …fastcc <256 x i64> @test_vp_merge_v256i64_vr(<256 x i64> %i0, i64 %s1, <256 x i1> %m, i32 %pivot) {
[all …]
H A Dvp_select.ll6 …56 x i32> @test_vp_select_v256i32_vv(<256 x i32> %i0, <256 x i32> %i1, <256 x i1> %m, i32 %pivot) {
16 …ll <256 x i32> @llvm.vp.select.v256i32(<256 x i1> %m, <256 x i32> %i0, <256 x i32> %i1, i32 %pivot)
20 …astcc <256 x i32> @test_vp_select_v256i32_vr(<256 x i32> %i0, i32 %s1, <256 x i1> %m, i32 %pivot) {
36 …ll <256 x i32> @llvm.vp.select.v256i32(<256 x i1> %m, <256 x i32> %i0, <256 x i32> %i1, i32 %pivot)
52 …6 x float> @llvm.vp.select.v256f32(<256 x i1> %m, <256 x float> %i0, <256 x float> %i1, i32 %pivot)
56 …<256 x float> @test_vp_select_v256f32_vr(<256 x float> %i0, float %s1, <256 x i1> %m, i32 %pivot) {
71 …6 x float> @llvm.vp.select.v256f32(<256 x i1> %m, <256 x float> %i0, <256 x float> %i1, i32 %pivot)
112 …56 x i64> @test_vp_select_v256i64_vv(<256 x i64> %i0, <256 x i64> %i1, <256 x i1> %m, i32 %pivot) {
122 …ll <256 x i64> @llvm.vp.select.v256i64(<256 x i1> %m, <256 x i64> %i0, <256 x i64> %i1, i32 %pivot)
126 …astcc <256 x i64> @test_vp_select_v256i64_vr(<256 x i64> %i0, i64 %s1, <256 x i1> %m, i32 %pivot) {
[all …]
/llvm-project-15.0.7/libc/src/stdlib/
H A Dqsort.cpp63 uint8_t *pivot = array.get(pivot_index); in partition() local
70 while ((compare_i = array.elem_compare(i, pivot)) < 0) in partition()
72 while ((compare_j = array.elem_compare(j, pivot)) > 0) in partition()
84 pivot = array.get(j); in partition()
87 pivot = array.get(i); in partition()
/llvm-project-15.0.7/llvm/test/tools/llvm-profgen/
H A Dcold-profile-trimming-symbolized.test23 int pivot = array[high];
26 if (array[j] < pivot)
33 int pivot = array[low];
36 if (array[j] < pivot) { if (j != i) swap(&array[i], &array[j]); i++;}
H A Dcold-profile-trimming.test28 int pivot = array[high];
31 if (array[j] < pivot)
38 int pivot = array[low];
41 if (array[j] < pivot) { if (j != i) swap(&array[i], &array[j]); i++;}
H A Dprofile-density.test24 int pivot = array[high];
27 if (array[j] < pivot)
34 int pivot = array[low];
37 if (array[j] < pivot) { if (j != i) swap(&array[i], &array[j]); i++;}
H A Dfs-discriminator.test103 int pivot = array[high];
106 if (array[j] < pivot)
113 int pivot = array[low];
116 if (array[j] < pivot) { if (j != i) swap(&array[i], &array[j]); i++;}
H A Dinline-noprobe2.test119 int pivot = array[high];
122 if (array[j] < pivot)
129 int pivot = array[low];
132 if (array[j] < pivot) { if (j != i) swap(&array[i], &array[j]); i++;}
/llvm-project-15.0.7/lld/MachO/
H A DExportTrie.cpp187 int pivot = charAt(pivotSymbol, pos); in sortAndBuild() local
192 if (c < pivot) in sortAndBuild()
194 else if (c > pivot) in sortAndBuild()
200 bool isTerminal = pivot == -1; in sortAndBuild()
/llvm-project-15.0.7/mlir/lib/Analysis/Presburger/
H A DSimplex.cpp758 pivot(row, *maybeColumn); in moveRowUnknownToColumn()
893 void SimplexBase::pivot(Pivot pair) { pivot(pair.row, pair.column); } in pivot() function in SimplexBase
971 pivot(*maybePivot); in restoreRow()
1164 pivot(*maybeRow, column); in undoLastConstraint()
1167 pivot(*maybeRow, column); in undoLastConstraint()
1171 pivot(*row, column); in undoLastConstraint()
1190 pivot(*row, column); in undoLastConstraint()
1245 pivot(u.pos, col); in undo()
1319 pivot(*maybePivot); in computeRowOptimum()
1352 pivot(*pivotRow, column); in computeOptimum()
[all …]
/llvm-project-15.0.7/polly/lib/External/isl/
H A Disl_mat.c1033 int pivot, first, i, off; in isl_mat_inverse_product() local
1035 if (pivot < 0) { in isl_mat_inverse_product()
1038 isl_assert(left->ctx, pivot >= 0, goto error); in isl_mat_inverse_product()
1040 pivot += row; in isl_mat_inverse_product()
1041 if (pivot != row) in isl_mat_inverse_product()
1142 int pivot, first, i, off; in isl_mat_right_inverse() local
1144 if (pivot < 0) { in isl_mat_right_inverse()
1147 isl_assert(mat->ctx, pivot >= 0, goto error); in isl_mat_right_inverse()
1149 pivot += row; in isl_mat_right_inverse()
1150 if (pivot != row) in isl_mat_right_inverse()
[all …]
/llvm-project-15.0.7/llvm/lib/Target/VE/
H A DVVPInstrPatternsVec.td193 i32:$pivot),
198 $pivot,
229 i32:$pivot),
234 $pivot,
265 i32:$pivot),
270 $pivot,
/llvm-project-15.0.7/mlir/include/mlir/Analysis/Presburger/
H A DSimplex.h271 void pivot(unsigned row, unsigned col);
272 void pivot(Pivot pair);
/llvm-project-15.0.7/libc/utils/MPFRWrapper/
H A DMPFRUtils.cpp440 MPFRNumber pivot(uint32_t(1)); in ulp() local
441 mpfr_mul_2si(pivot.value, pivot.value, maxExponent, MPFR_RNDN); in ulp()
443 mpfr_sub(minMPFR.value, pivot.value, minMPFR.value, MPFR_RNDN); in ulp()
448 mpfr_sub(maxMPFR.value, maxMPFR.value, pivot.value, MPFR_RNDN); in ulp()
/llvm-project-15.0.7/llvm/test/CodeGen/Generic/
H A DMachineBranchProb.ll65 ; Check that we set branch weights on the pivot cmp instruction correctly.
/llvm-project-15.0.7/llvm/test/CodeGen/X86/
H A Dswitch-density.ll19 ; Should pivot around 400 for two subtrees with two jump tables each.
H A Dswitch.ll687 ; Should pivot around 400 for two subtrees of equal size.
780 ; Should pivot around 300 for two subtrees with two jump tables each.
1722 ; Make sure to pick a pivot in the middle also with zero-weight cases.
1848 ; Without branch probabilities, the pivot would be 40, since that would yield
1850 ; pivot. Since there is room for 3 cases in a leaf, cases 50 and 60 are also
2329 ; as its components, so 100 is selected as the pivot.
/llvm-project-15.0.7/llvm/include/llvm/IR/
H A DVPIntrinsics.def497 // llvm.vp.merge(cond,on_true,on_false,pivot)
/llvm-project-15.0.7/polly/lib/External/isl/doc/
H A Dimplementation.tex203 on a tableau exchanges a column and a row variable and is called a pivot.
217 In particular, each pivot exchanges a row variable
404 Given an equality involving at least one unknown, we pivot
612 while on the negative side, we need to perform a pivot, which may
/llvm-project-15.0.7/llvm/docs/
H A DLangRef.rst18121 …m.vp.merge.v16i32 (<16 x i1> <condition>, <16 x i32> <on_true>, <16 x i32> <on_false>, i32 <pivot>)
18122 …le x 4 x i1> <condition>, <vscale x 4 x i64> <on_true>, <vscale x 4 x i64> <on_false>, i32 <pivot>)
18136 false or the lane position is greater equal than the pivot. The fourth operand
18137 is the pivot.
18149 condition vector and pivot value.
18152 than ``%pivot`` the lane is taken from the second operand. Otherwise, the lane
18160 …<4 x i32> @llvm.vp.merge.v4i32(<4 x i1> %cond, <4 x i32> %on_true, <4 x i32> %on_false, i32 %pivot)
18163 ;; Lanes at and above %pivot are taken from %on_false
18164 %atfirst = insertelement <4 x i32> undef, i32 %pivot, i32 0