Home
last modified time | relevance | path

Searched refs:Order (Results 1 – 25 of 217) sorted by relevance

123456789

/llvm-project/llvm/unittests/CodeGen/
H A DAllocationOrderTest.cpp29 SmallVector<MCPhysReg, 16> Order = {4, 5, 6, 7}; in TEST() local
30 AllocationOrder O(std::move(Hints), Order, false); in TEST()
36 SmallVector<MCPhysReg, 16> Order = {4, 1, 5, 6}; in TEST() local
37 AllocationOrder O(std::move(Hints), Order, false); in TEST()
43 SmallVector<MCPhysReg, 16> Order = {4, 5, 6, 7}; in TEST() local
44 AllocationOrder O(std::move(Hints), Order, true); in TEST()
50 SmallVector<MCPhysReg, 16> Order = {4, 5, 6, 7}; in TEST() local
51 AllocationOrder O(std::move(Hints), Order, false); in TEST()
59 SmallVector<MCPhysReg, 16> Order = {4, 1, 5, 6}; in TEST() local
60 AllocationOrder O(std::move(Hints), Order, false); in TEST()
[all …]
/llvm-project/libcxx/test/support/
H A Dtest_container_comparisons.h19 template <template <typename...> typename Container, typename Elem, typename Order>
25 assert(testOrder(l1, l2, Order::equivalent)); in test_sequence_container_spaceship_with_type()
31 assert(testOrder(l1, l2, Order::equivalent)); in test_sequence_container_spaceship_with_type()
37 assert(testOrder(l1, l2, Order::less)); in test_sequence_container_spaceship_with_type()
43 assert(testOrder(l1, l2, Order::greater)); in test_sequence_container_spaceship_with_type()
49 assert(testOrder(l1, l2, Order::less)); in test_sequence_container_spaceship_with_type()
55 assert(testOrder(l1, l2, Order::greater)); in test_sequence_container_spaceship_with_type()
61 assert(testOrder(l1, l2, Order::unordered)); in test_sequence_container_spaceship_with_type()
92 typename Order>
100 assert(testOrder(ca1, ca2, Order::equivalent)); in test_sequence_container_adaptor_spaceship_with_type()
[all …]
/llvm-project/llvm/unittests/Transforms/Utils/
H A DCodeLayoutTest.cpp18 auto Order = computeCacheDirectedLayout(Sizes, Counts, Edges, CallOffsets); in TEST() local
19 EXPECT_THAT(Order, ElementsAreArray({0, 2, 1})); in TEST()
28 auto Order = computeCacheDirectedLayout(Sizes, Counts, Edges, CallOffsets); in TEST() local
29 EXPECT_THAT(Order, ElementsAreArray({0, 1, 2})); in TEST()
41 auto Order = computeCacheDirectedLayout(Sizes, Counts, Edges, CallOffsets); in TEST() local
42 EXPECT_THAT(Order, ElementsAreArray({0, 3, 4, 2, 1})); in TEST()
48 Order = in TEST()
50 EXPECT_THAT(Order, ElementsAreArray({0, 3, 4, 1, 2})); in TEST()
62 auto Order = computeCacheDirectedLayout(Sizes, Counts, Edges, CallOffsets); in TEST() local
63 EXPECT_THAT(Order, ElementsAreArray({4, 0, 1, 2, 3, 5})); in TEST()
[all …]
/llvm-project/libcxx/benchmarks/algorithms/
H A Dcommon.h
H A Dranges_stable_sort.bench.cpp
H A Dranges_sort.bench.cpp
H A Dsort.bench.cpp
H A Dstable_sort.bench.cpp
H A Dpstl.stable_sort.bench.cpp
H A Dpush_heap.bench.cpp
H A Dranges_push_heap.bench.cpp
/llvm-project/libcxx/benchmarks/
H A Dmap.bench.cpp
/llvm-project/llvm/tools/llvm-readtapi/
H A DDiffEngine.cpp26 StringRef setOrderIndicator(InterfaceInputOrder Order) { in setOrderIndicator() argument
27 return ((Order == lhs) ? "< " : "> "); in setOrderIndicator()
37 OS << Indent << "\t" << setOrderIndicator(Order) << Val << "\n"; in print()
44 OS << Indent << "\t\t" << setOrderIndicator(Order) << Val << "\n"; in print()
51 OS << Indent << "\t" << setOrderIndicator(Order) << std::to_string(Val) in print()
59 OS << Indent << "\t" << setOrderIndicator(Order) in print()
104 OS << Indent << "\t\t" << ((Order == lhs) ? "< " : "> ") in print()
109 OS << Indent << "\t\t" << ((Order == lhs) ? "< " : "> ") in print()
112 OS << Indent << "\t\t" << ((Order == lhs) ? "< " : "> ") in print()
128 InterfaceInputOrder Order) { in addDiffForTargSlice() argument
[all …]
H A DDiffEngine.h64 DiffScalarVal(InterfaceInputOrder Order, T Val) in DiffScalarVal() argument
65 : AttributeDiff(U), Order(Order), Val(Val){}; in DiffScalarVal()
72 InterfaceInputOrder getOrder() const { return Order; } in getOrder()
76 InterfaceInputOrder Order;
83 SymScalar(InterfaceInputOrder Order, const MachO::Symbol *Sym) in SymScalar() argument
84 : Order(Order), Val(Sym){}; in SymScalar()
91 InterfaceInputOrder getOrder() const { return Order; } in getOrder()
95 InterfaceInputOrder Order;
/llvm-project/llvm/lib/CodeGen/
H A DAllocationOrder.h32 ArrayRef<MCPhysReg> Order; variable
59 return AO.Order[Pos];
67 while (Pos >= 0 && Pos < AO.IterationLimit && AO.isHint(AO.Order[Pos]))
90 AllocationOrder(SmallVector<MCPhysReg, 16> &&Hints, ArrayRef<MCPhysReg> Order, in AllocationOrder() argument
92 : Hints(std::move(Hints)), Order(Order), in AllocationOrder()
93 IterationLimit(HardHints ? 0 : static_cast<int>(Order.size())) {} in AllocationOrder()
102 assert(OrderLimit <= Order.size()); in getOrderLimitEnd()
111 ArrayRef<MCPhysReg> getOrder() const { return Order; } in getOrder()
/llvm-project/clang-tools-extra/clangd/unittests/
H A DThreadCrashReporterTests.cpp59 std::string Order = ""; in TEST() local
61 ThreadCrashReporter ScopedReporter([&Order] { Order.push_back('a'); }); in TEST()
63 ThreadCrashReporter ScopedReporter([&Order] { Order.push_back('b'); }); in TEST()
67 EXPECT_EQ(Order, "ba"); in TEST()
72 EXPECT_EQ(Order, "baa"); in TEST()
/llvm-project/bolt/lib/Passes/
H A DReorderData.cpp163 DataOrder Order; in baseOrder() local
170 Order.emplace_back(BD, BDCount); in baseOrder()
172 return Order; in baseOrder()
273 DataOrder Order = baseOrder(BC, Section); in sortedByFunc() local
274 unsigned SplitPoint = Order.size(); in sortedByFunc()
277 Order, in sortedByFunc()
292 for (unsigned Idx = 0; Idx < Order.size(); ++Idx) { in sortedByFunc()
293 if (!BDtoFuncCount[Order[Idx].first]) { in sortedByFunc()
299 return std::make_pair(Order, SplitPoint); in sortedByFunc()
305 DataOrder Order = baseOrder(BC, Section); in sortedByCount() local
[all …]
H A DReorderAlgorithm.cpp403 BasicBlockOrder &Order) const { in reorderBasicBlocks()
476 Order.push_back(IndexToBB[Last]); in reorderBasicBlocks()
492 Order.push_back(IndexToBB[Last]); in reorderBasicBlocks()
495 std::reverse(Order.begin(), Order.end()); in reorderBasicBlocks()
501 Order.push_back(BB); in reorderBasicBlocks()
505 BasicBlockOrder &Order) const { in reorderBasicBlocks()
512 Order.push_back(BB); in reorderBasicBlocks()
549 Order.reserve(BF.getLayout().block_size()); in reorderBasicBlocks()
551 Order.push_back(OrigOrder[R]); in reorderBasicBlocks()
555 BinaryFunction &BF, BasicBlockOrder &Order) const { in reorderBasicBlocks()
[all …]
/llvm-project/libcxx/test/std/containers/sequences/array/
H A Dcompare.three_way.pass.cpp33 template <typename Elem, typename Order>
39 assert(testOrder(l1, l2, Order::equivalent)); in test_sequence_container_array_spaceship_with_type()
45 assert(testOrder(l1, l2, Order::equivalent)); in test_sequence_container_array_spaceship_with_type()
51 assert(testOrder(l1, l2, Order::less)); in test_sequence_container_array_spaceship_with_type()
57 assert(testOrder(l1, l2, Order::greater)); in test_sequence_container_array_spaceship_with_type()
65 assert(testOrder(l1, l2, Order::unordered)); in test_sequence_container_array_spaceship_with_type()
/llvm-project/llvm/lib/Support/
H A DDynamicLibrary.cpp81 void *LibLookup(const char *Symbol, DynamicLibrary::SearchOrdering Order) { in LibLookup() argument
82 if (Order & SO_LoadOrder) { in LibLookup()
96 void *Lookup(const char *Symbol, DynamicLibrary::SearchOrdering Order) { in Lookup() argument
97 assert(!((Order & SO_LoadedFirst) && (Order & SO_LoadedLast)) && in Lookup()
100 if (!Process || (Order & SO_LoadedFirst)) { in Lookup()
101 if (void *Ptr = LibLookup(Symbol, Order)) in Lookup()
110 if (Order & SO_LoadedLast) { in Lookup()
111 if (void *Ptr = LibLookup(Symbol, Order)) in Lookup()
/llvm-project/llvm/include/llvm/CodeGen/
H A DSelectionDAGNodes.h761 void setIROrder(unsigned Order) { IROrder = Order; }
1160 SDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs)
1162 IROrder(Order), debugLoc(std::move(dl)) {
1191 SDLoc(const Instruction *I, int Order) : IROrder(Order) {
1192 assert(Order >= 0 && "bad IROrder");
1338 AddrSpaceCastSDNode(unsigned Order, const DebugLoc &dl, SDVTList VTs,
1340 : SDNode(ISD::ADDRSPACECAST, Order, dl, VTs), SrcAddrSpace(SrcAS),
1362 MemSDNode(unsigned Opc, unsigned Order, cons
[all...]
/llvm-project/bolt/include/bolt/Passes/
H A DReorderAlgorithm.h171 BasicBlockOrder &Order) const = 0;
189 BasicBlockOrder &Order) const override;
200 BasicBlockOrder &Order) const override;
213 BasicBlockOrder &Order) const override;
226 BasicBlockOrder &Order) const override;
233 BasicBlockOrder &Order) const override;
240 BasicBlockOrder &Order) const override;
251 BasicBlockOrder &Order) const override;
/llvm-project/libcxx/test/std/utilities/function.objects/refwrap/refwrap.comparissons/
H A Dcompare.three_way.refwrap.const_ref.pass.cpp39 template <typename T, typename Order>
51 assert(testOrder(rw1, t, Order::equivalent)); in test()
56 assert(testOrder(rw1, bigger, Order::less)); in test()
61 assert(testOrder(rw1, smaller, Order::greater)); in test()
66 assert(testOrder(rw1, unordered, Order::unordered)); in test()
H A Dcompare.three_way.refwrap.refwrap.pass.cpp39 template <typename T, typename Order>
52 assert(testOrder(rw1, rw2, Order::equivalent)); in test()
58 assert(testOrder(rw1, rw2, Order::less)); in test()
64 assert(testOrder(rw1, rw2, Order::greater)); in test()
70 assert(testOrder(rw1, rw2, Order::unordered)); in test()
H A Dcompare.three_way.refwrap.refwrap_const.pass.cpp41 template <typename T, typename Order>
54 assert(testOrder(rw1, rw2, Order::equivalent)); in test()
60 assert(testOrder(rw1, rw2, Order::less)); in test()
66 assert(testOrder(rw1, rw2, Order::greater)); in test()
72 assert(testOrder(rw1, rw2, Order::unordered)); in test()

123456789