Home
last modified time | relevance | path

Searched refs:triangle (Results 1 – 22 of 22) sorted by relevance

/llvm-project-15.0.7/llvm/test/CodeGen/ARM/
H A Darm-frame-lowering-no-terminator.ll12 define internal void @foo(%t2* nocapture %this, %t1* nocapture readonly %triangle, i32 %partId, i32…
17 %arrayidx.i = getelementptr inbounds %t1, %t1* %triangle, i32 0, i32 0, i32 0
19 %arrayidx5.i = getelementptr inbounds %t1, %t1* %triangle, i32 0, i32 0, i32 1
22 %arrayidx11.i = getelementptr inbounds %t1, %t1* %triangle, i32 0, i32 0, i32 2
26 %arrayidx.i129 = getelementptr inbounds %t1, %t1* %triangle, i32 1, i32 0, i32 0
29 %arrayidx5.i132 = getelementptr inbounds %t1, %t1* %triangle, i32 1, i32 0, i32 1
32 %arrayidx11.i135 = getelementptr inbounds %t1, %t1* %triangle, i32 1, i32 0, i32 2
35 %arrayidx.i149 = getelementptr inbounds %t1, %t1* %triangle, i32 2, i32 0, i32 0
38 %arrayidx5.i152 = getelementptr inbounds %t1, %t1* %triangle, i32 2, i32 0, i32 1
H A Difcvt_triangleWoCvtToNextEdge.mir6 # Nevertheless, IfConversion treats bb.1, bb.2, bb.3 as a triangle and
/llvm-project-15.0.7/libcxx/test/std/numerics/numeric.ops/exclusive.scan/
H A Dexclusive_scan.pass.cpp60 constexpr size_t triangle(size_t n) { return n*(n+1)/2; } in triangle() function
79 assert(v[i] == 30 + triangle(i-1)); in basic_tests()
87 assert(v[i] == 40 + triangle(i)); in basic_tests()
/llvm-project-15.0.7/libcxx/test/std/numerics/numeric.ops/inclusive.scan/
H A Dinclusive_scan.pass.cpp61 constexpr size_t triangle(size_t n) { return n*(n+1)/2; } in triangle() function
80 assert(v[i] == triangle(i)); in basic_tests()
88 assert(v[i] == triangle(i + 1)); in basic_tests()
H A Dinclusive_scan_op.pass.cpp65 constexpr size_t triangle(size_t n) { return n*(n+1)/2; } in triangle() function
84 assert(v[i] == triangle(i)); in basic_tests()
92 assert(v[i] == triangle(i + 1)); in basic_tests()
H A Dinclusive_scan_op_init.pass.cpp65 constexpr size_t triangle(size_t n) { return n*(n+1)/2; } in triangle() function
84 assert(v[i] == 40 + triangle(i)); in basic_tests()
92 assert(v[i] == 30 + triangle(i + 1)); in basic_tests()
/llvm-project-15.0.7/libcxx/test/std/numerics/numeric.ops/transform.inclusive.scan/
H A Dtransform_inclusive_scan_bop_uop.pass.cpp80 constexpr size_t triangle(size_t n) { return n*(n+1)/2; } in triangle() function
99 assert(v[i] == triangle(i) + i + 1); in basic_tests()
107 assert(v[i] == triangle(i + 1) + i + 1); in basic_tests()
H A Dtransform_inclusive_scan_bop_uop_init.pass.cpp93 constexpr size_t triangle(size_t n) { return n*(n+1)/2; } in triangle() function
112 assert(v[i] == 30 + triangle(i) + i + 1); in basic_tests()
120 assert(v[i] == 40 + triangle(i + 1) + i + 1); in basic_tests()
/llvm-project-15.0.7/mlir/unittests/Analysis/Presburger/
H A DPresburgerSetTest.cpp527 IntegerPolyhedron triangle = parsePoly("(x,y) : (y >= 0, " in TEST() local
530 EXPECT_TRUE(triangle.containsPoint({1000, 1000})); in TEST()
531 EXPECT_FALSE(triangle.containsPoint({1001, 1001})); in TEST()
532 expectEqual(triangle, tetrahedron); in TEST()
534 convertSuffixDimsToLocals(triangle, 1); in TEST()
536 expectEqual(line, triangle); in TEST()
/llvm-project-15.0.7/libcxx/test/std/numerics/numeric.ops/transform.exclusive.scan/
H A Dtransform_exclusive_scan_init_bop_uop.pass.cpp91 constexpr size_t triangle(size_t n) { return n*(n+1)/2; } in triangle() function
110 assert(v[i] == 30 + triangle(i - 1) + i); in basic_tests()
118 assert(v[i] == 40 + triangle(i) + i); in basic_tests()
/llvm-project-15.0.7/llvm/test/CodeGen/WebAssembly/
H A Dphi.ll7 ; Basic phi triangle.
H A Dcfg-stackify.ll159 ; CHECK-LABEL: triangle:
164 define i32 @triangle(i32* %p, i32 %a) {
/llvm-project-15.0.7/llvm/test/CodeGen/PowerPC/
H A Dmisched-inorder-latency.ll2 ; RUN: -disable-ifcvt-triangle-false -disable-post-ra -mtriple=powerpc64-unknown-linux-gnu…
H A Dtail-dup-layout.ll424 ; The h;i->j;ret trellis contains a triangle edge, and should be resolved as
505 ; triangle trellis. Here D->F->G is the triangle, and D;E are both predecessors
571 ; Verify that we did not mis-identify triangle trellises if it is not
572 ; really a triangle.
/llvm-project-15.0.7/llvm/test/Transforms/SampleProfile/
H A Dprofile-inference-rebalance.ll4 ; The test contains a "diamond" and a "triangle" that needs to be rebalanced
107 ; The test contains a triangle comprised of dangling blocks.
/llvm-project-15.0.7/llvm/test/Transforms/MemCpyOpt/
H A Dnonlocal-memcpy-memcpy.ll50 ; A CFG triangle with a partial redundancy targeting an alloca. Test that the
51 ; memcpy inside the triangle is optimized to copy directly from the original
/llvm-project-15.0.7/polly/www/video-js/
H A Dvideo-js.css102 /* Drawing the play triangle with borders - http://www.infimum.dk/HTML/slantinfo.html */
174 .vjs-fullscreen-control div span:nth-child(1) { /* Top-left triangle */
216 /* Drawing the play triangle with borders - http://www.infimum.dk/HTML/slantinfo.html */
/llvm-project-15.0.7/llvm/test/Transforms/LICM/
H A Dhoist-phi.ll470 ; triangle. Check that we duplicate the triangle and not the diamond.
1075 ; %loop/%if/%then form a triangle, but %loop/%if/%then/%end also form a diamond.
1076 ; The triangle should be picked for conditional hoisting.
/llvm-project-15.0.7/mlir/include/mlir/Dialect/SparseTensor/IR/
H A DSparseTensorOps.td386 Example of A+B in upper triangle, A-B in lower triangle:
/llvm-project-15.0.7/llvm/test/Transforms/ObjCARC/
H A Dmove-and-form-retain-autorelease.ll3 ; The optimizer should be able to move the autorelease past a control triangle
/llvm-project-15.0.7/llvm/test/CodeGen/X86/
H A Dblock-placement.ll1246 ; break triangle shaped CFG constrains when doing block placement if profile
1270 ; break triangle shaped CFG constrains when doing block placement if profile
/llvm-project-15.0.7/llvm/test/Transforms/LoopSimplifyCFG/
H A Dconstant-fold-branch.ll85 ; Check that we can eliminate a triangle.