| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.move/ |
| H A D | contiguous_trivial_optimization.pass.cpp | 61 constexpr TCBNTM(int& moves) : p(&moves) {} in TCBNTM() 70 int moves = 0; in test_trivial_copyassign_but_no_trivial_moveassign() local 71 TCBNTM ia[] = { moves, moves, moves, moves }; in test_trivial_copyassign_but_no_trivial_moveassign() 72 TCBNTM ib[] = { moves, moves, moves, moves }; in test_trivial_copyassign_but_no_trivial_moveassign() 74 assert(moves == 4); in test_trivial_copyassign_but_no_trivial_moveassign() 75 moves = 0; in test_trivial_copyassign_but_no_trivial_moveassign() 77 assert(moves == 4); in test_trivial_copyassign_but_no_trivial_moveassign() 79 moves = 0; in test_trivial_copyassign_but_no_trivial_moveassign() 81 assert(moves == 4); in test_trivial_copyassign_but_no_trivial_moveassign() 82 moves = 0; in test_trivial_copyassign_but_no_trivial_moveassign() [all …]
|
| /llvm-project-15.0.7/llvm/test/CodeGen/SystemZ/ |
| H A D | vec-move-01.ll | 1 ; Test vector register moves. 5 ; Test v16i8 moves. 13 ; Test v8i16 moves. 21 ; Test v4i32 moves. 29 ; Test v2i64 moves. 37 ; Test v4f32 moves. 45 ; Test v2f64 moves. 53 ; Test v2i8 moves. 61 ; Test v4i8 moves. 69 ; Test v8i8 moves. [all …]
|
| H A D | int-move-01.ll | 1 ; Test moves between GPRs. 5 ; Test 8-bit moves, which should get promoted to i32. 13 ; Test 16-bit moves, which again should get promoted to i32. 21 ; Test 32-bit moves. 29 ; Test 64-bit moves.
|
| H A D | fp-move-01.ll | 1 ; Test moves between FPRs. 5 ; Test f32 moves. 13 ; Test f64 moves. 21 ; Test f128 moves. Since f128s are passed by reference, we need to force
|
| H A D | fp-move-13.ll | 1 ; Test f128 moves on z14. 5 ; VR-to-VR moves. Since f128s are passed by reference, 21 ; Test 128-bit moves from GPRs to VRs. i128 isn't a legitimate type, 34 ; Test 128-bit moves from VRs to GPRs, with the same restriction as f2.
|
| H A D | fp-move-12.ll | 1 ; Test moves between FPRs on z13. 13 ; Test f64 moves. 21 ; Test f128 moves. Since f128s are passed by reference, we need to force
|
| H A D | fp-move-10.ll | 1 ; Test moves between FPRs and GPRs for z13 and above. 5 ; Check that moves from i32s to floats use a low GR32 and vector operation. 19 ; Check that moves from floats to i32s use a low GR32 and vector operation.
|
| H A D | fp-move-09.ll | 1 ; Test moves between FPRs and GPRs for z196 and zEC12. 5 ; Check that moves from i32s to floats can use high registers. 19 ; Check that moves from floats to i32s can use high registers.
|
| H A D | int-const-05.ll | 1 ; Test moves of integers to 4-byte memory locations. 5 ; Check moves of zero. 32 ; Check moves of -1.
|
| H A D | int-const-06.ll | 1 ; Test moves of integers to 8-byte memory locations. 5 ; Check moves of zero. 32 ; Check moves of -1.
|
| H A D | fp-move-02.ll | 1 ; Test moves between FPRs and GPRs. The 32-bit cases test the z10 11 ; Test 32-bit moves from GPRs to FPRs. The GPR must be moved into the high 57 ; Test 64-bit moves from GPRs to FPRs. 65 ; Test 128-bit moves from GPRs to FPRs. i128 isn't a legitimate type, 80 ; Test 32-bit moves from FPRs to GPRs. The high 32 bits of the FPR should 90 ; Test 64-bit moves from FPRs to GPRs. 98 ; Test 128-bit moves from FPRs to GPRs, with the same restriction as f6.
|
| /llvm-project-15.0.7/libcxx/test/std/ranges/range.adaptors/range.zip/ |
| H A D | ctor.views.pass.cpp | 34 int moves = 0; member 36 constexpr MoveAwareView(MoveAwareView&& other) : moves(other.moves + 1) { other.moves = 1; } in MoveAwareView() 38 moves = other.moves + 1; in operator =() 39 other.moves = 0; in operator =() 42 constexpr const int* begin() const { return &moves; } in begin() 43 constexpr const int* end() const { return &moves + 1; } in end()
|
| /llvm-project-15.0.7/libcxx/test/std/utilities/memory/util.smartptr/util.smartptr.shared/util.smartptr.shared.const/ |
| H A D | unique_ptr.pass.cpp | 86 explicit MovingDeleter(int *moves) : moves_(moves) {} in MovingDeleter() 250 int moves = 0; in main() local 252 std::unique_ptr<int, MovingDeleter> u(&i, MovingDeleter(&moves)); in main() 253 assert(moves == 1); in main() 255 assert(moves >= 2); in main() 262 int moves = 0; in main() local 264 std::unique_ptr<int[], MovingDeleter> u(a, MovingDeleter(&moves)); in main() 265 assert(moves == 1); in main() 267 assert(moves >= 2); in main()
|
| /llvm-project-15.0.7/libcxx/test/std/iterators/iterator.requirements/iterator.cust/iterator.cust.swap/ |
| H A D | iter_swap.pass.cpp | 174 assert(arr[0].moves() == 1 && arr[1].moves() == 3); in test() 176 assert(arr[0].moves() == 1 && arr[1].moves() == 2); in test()
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-mca/X86/BtVer2/ |
| H A D | reg-move-elimination-1.s | 42 # CHECK-NEXT: Number of optimizable moves: 3 43 # CHECK-NEXT: Number of moves eliminated: 3 (100.0%) 44 # CHECK-NEXT: Number of zero moves: 3 (100.0%) 45 # CHECK-NEXT: Max moves eliminated per cycle: 1
|
| H A D | reg-move-elimination-5.s | 48 # CHECK-NEXT: Number of optimizable moves: 12 49 # CHECK-NEXT: Number of moves eliminated: 12 (100.0%) 50 # CHECK-NEXT: Number of zero moves: 12 (100.0%) 51 # CHECK-NEXT: Max moves eliminated per cycle: 2
|
| H A D | reg-move-elimination-4.s | 48 # CHECK-NEXT: Number of optimizable moves: 12 49 # CHECK-NEXT: Number of moves eliminated: 12 (100.0%) 50 # CHECK-NEXT: Number of zero moves: 12 (100.0%) 51 # CHECK-NEXT: Max moves eliminated per cycle: 2
|
| H A D | reg-move-elimination-3.s | 47 # CHECK-NEXT: Number of optimizable moves: 18 48 # CHECK-NEXT: Number of moves eliminated: 18 (100.0%) 49 # CHECK-NEXT: Number of zero moves: 18 (100.0%) 50 # CHECK-NEXT: Max moves eliminated per cycle: 2
|
| H A D | reg-move-elimination-6.s | 50 # CHECK-NEXT: Number of optimizable moves: 100 51 # CHECK-NEXT: Number of moves eliminated: 100 (100.0%) 52 # CHECK-NEXT: Number of zero moves: 100 (100.0%) 53 # CHECK-NEXT: Max moves eliminated per cycle: 1
|
| H A D | reg-move-elimination-2.s | 52 # CHECK-NEXT: Number of optimizable moves: 21 53 # CHECK-NEXT: Number of moves eliminated: 21 (100.0%) 54 # CHECK-NEXT: Number of zero moves: 21 (100.0%) 55 # CHECK-NEXT: Max moves eliminated per cycle: 2
|
| /llvm-project-15.0.7/llvm/test/Transforms/InstCombine/ |
| H A D | memset2.ll | 7 define i32 @test(%struct.Moves addrspace(1)* nocapture %moves) { 10 …%gep = getelementptr inbounds %struct.Moves, %struct.Moves addrspace(1)* %moves, i32 1, i32 0, i32…
|
| /llvm-project-15.0.7/clang-tools-extra/docs/clang-tidy/checks/bugprone/ |
| H A D | use-after-move.rst | 111 Unsequenced moves, uses, and reinitializations 129 occur in the same statement as moves or uses. A reinitialization is only 137 function parameters. It does not check moves of member variables or global 176 When analyzing the order in which moves, uses and reinitializations happen (see 177 section `Unsequenced moves, uses, and reinitializations`_), the move is assumed
|
| /llvm-project-15.0.7/lldb/third_party/Python/module/six/ |
| H A D | six.py | 316 moves = _MovedItems(__name__ + ".moves") variable 317 _importer._add_module(moves, "moves") 516 del moves.__dict__[name] 698 exec_ = getattr(moves.builtins, "exec") 740 print_ = getattr(moves.builtins, "print", None)
|
| /llvm-project-15.0.7/llvm/test/DebugInfo/MIR/X86/ |
| H A D | dvl-livedebugvalues-movements.mir | 3 # The MIR below moves values from argument registers to callee saved registers, 4 # moves that are followed by DBG_VALUEs and which should also result in
|
| /llvm-project-15.0.7/llvm/test/CodeGen/X86/ |
| H A D | statepoint-stack-usage.ll | 17 ; There should be no more than three moves 24 ; This is the key check. There should NOT be any memory moves here 47 ; This is the key check. There should NOT be any memory moves here 104 ; This is the key check. There should NOT be any memory moves here
|