Home
last modified time | relevance | path

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

12345678

/llvm-project-15.0.7/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
59 SmallVector<MCPhysReg, 16> Order = {4, 1, 5, 6}; in TEST() local
69 SmallVector<MCPhysReg, 16> Order = {4, 1, 5, 6}; in TEST() local
76 SmallVector<MCPhysReg, 16> Order = {1, 4, 5, 6}; in TEST() local
[all …]
/llvm-project-15.0.7/libcxx/benchmarks/algorithms/
H A Dcommon.h32 enum class Order { enum
93 if (O == Order::SingleElement) { in fillValues()
105 if (O == Order::SingleElement) { in fillValues()
150 void sortValues(T& V, Order O) { in sortValues()
152 case Order::Random: { in sortValues()
158 case Order::Ascending: in sortValues()
161 case Order::Descending: in sortValues()
164 case Order::SingleElement: in sortValues()
167 case Order::PipeOrgan: in sortValues()
171 case Order::Heap: in sortValues()
[all …]
H A Dranges_sort.bench.cpp14 template <class ValueType, class Order>
20 state, Quantity, Order(), BatchSize::CountElements, in run()
24 bool skip() const { return Order() == ::Order::Heap; } in skip()
27 return "BM_RangesSort" + ValueType::name() + Order::name() + "_" + in name()
H A Dranges_stable_sort.bench.cpp14 template <class ValueType, class Order>
20 state, Quantity, Order(), BatchSize::CountElements, in run()
24 bool skip() const { return Order() == ::Order::Heap; } in skip()
27 return "BM_RangesStableSort" + ValueType::name() + Order::name() + "_" + in name()
H A Dstable_sort.bench.cpp14 template <class ValueType, class Order>
20 state, Quantity, Order(), BatchSize::CountElements, in run()
24 bool skip() const { return Order() == ::Order::Heap; } in skip()
27 return "BM_StableSort" + ValueType::name() + Order::name() + "_" + in name()
H A Dsort.bench.cpp14 template <class ValueType, class Order>
20 state, Quantity, Order(), BatchSize::CountElements, in run()
24 bool skip() const { return Order() == ::Order::Heap; } in skip()
27 return "BM_Sort" + ValueType::name() + Order::name() + "_" + in name()
H A Dpush_heap.bench.cpp14 template <class ValueType, class Order>
20 state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) { in run()
27 bool skip() const { return Order() == ::Order::Heap; } in skip()
30 return "BM_PushHeap" + ValueType::name() + Order::name() + "_" + in name()
H A Dranges_push_heap.bench.cpp14 template <class ValueType, class Order>
20 state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) { in run()
27 bool skip() const { return Order() == ::Order::Heap; } in skip()
30 return "BM_RangesPushHeap" + ValueType::name() + Order::name() + "_" + in name()
H A Dranges_make_heap.bench.cpp14 template <class ValueType, class Order>
20 state, Quantity, Order(), BatchSize::CountElements, in run()
25 return "BM_RangesMakeHeap" + ValueType::name() + Order::name() + "_" + in name()
H A Dmake_heap.bench.cpp14 template <class ValueType, class Order>
20 state, Quantity, Order(), BatchSize::CountElements, in run()
25 return "BM_MakeHeap" + ValueType::name() + Order::name() + "_" + in name()
H A Dranges_make_heap_then_sort_heap.bench.cpp14 template <class ValueType, class Order>
19 runOpOnCopies<ValueType>(state, Quantity, Order(), BatchSize::CountElements, in run()
27 return "BM_RangesMakeThenSortHeap" + ValueType::name() + Order::name() + "_" + in name()
H A Dmin_max_element.bench.cpp14 template <class ValueType, class Order>
19 runOpOnCopies<ValueType>(state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) { in run()
25 return "BM_MinMaxElement" + ValueType::name() + Order::name() + "_" + std::to_string(Quantity); in name()
H A Dmake_heap_then_sort_heap.bench.cpp14 template <class ValueType, class Order>
19 runOpOnCopies<ValueType>(state, Quantity, Order(), BatchSize::CountElements, in run()
27 return "BM_MakeThenSortHeap" + ValueType::name() + Order::name() + "_" + in name()
/llvm-project-15.0.7/llvm/tools/llvm-tapi-diff/
H A DDiffEngine.cpp24 StringRef setOrderIndicator(InterfaceInputOrder Order) { in setOrderIndicator() argument
25 return ((Order == lhs) ? "< " : "> "); in setOrderIndicator()
57 OS << Indent << "\t" << setOrderIndicator(Order) in print()
120 InterfaceInputOrder Order) { in addDiffForTargSlice() argument
128 ValTypeT NewVal(Order, Val); in addDiffForTargSlice()
132 ValTypeT NewVal(Order, Val); in addDiffForTargSlice()
146 IRef.getInstallName(), Targ, Diff, Order); in getSingleAttrDiff()
189 Output.push_back(getSingleAttrDiff(Val, Name, Order)); in diffAttribute()
209 Order, Interface->isInstallAPI())); in getSingleIF()
219 Order); in getSingleIF()
[all …]
H A DDiffEngine.h65 DiffScalarVal(InterfaceInputOrder Order, T Val) in DiffScalarVal() argument
66 : AttributeDiff(U), Order(Order), Val(Val){}; in DiffScalarVal()
73 InterfaceInputOrder getOrder() const { return Order; } in getOrder()
77 InterfaceInputOrder Order;
84 SymScalar(InterfaceInputOrder Order, const MachO::Symbol *Sym) in SymScalar() argument
85 : Order(Order), Val(Sym){}; in SymScalar()
96 InterfaceInputOrder getOrder() const { return Order; } in getOrder()
100 InterfaceInputOrder Order;
/llvm-project-15.0.7/libcxx/benchmarks/
H A Dmap.bench.cpp243 Order::value == ::Order::Random ? Shuffle::Keys : Shuffle::None, 1000); in run()
264 Order::value == ::Order::Random ? Shuffle::Keys in run()
383 Order::value == ::Order::Random ? Shuffle::Keys in run()
503 Order::value == ::Order::Random ? Shuffle::Keys in run()
623 Order::value == ::Order::Random ? Shuffle::Keys in run()
742 Order::value == ::Order::Random ? Shuffle::Keys in run()
754 template <class Order>
824 Order::value == ::Order::Random ? Shuffle::Keys : Shuffle::None, 1); in run()
856 Order::value == ::Order::Random ? Shuffle::Keys : Shuffle::None, 1); in run()
888 Order::value == ::Order::Random ? Shuffle::Keys : Shuffle::None, 1); in run()
[all …]
/llvm-project-15.0.7/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-15.0.7/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()
H A DAllocationOrder.cpp34 auto Order = RegClassInfo.getOrder(MF.getRegInfo().getRegClass(VirtReg)); in create() local
37 TRI->getRegAllocationHints(VirtReg, Order, Hints, MF, &VRM, Matrix); in create()
49 assert(is_contained(Order, Hints[I]) && in create()
52 return AllocationOrder(std::move(Hints), Order, HardHints); in create()
/llvm-project-15.0.7/bolt/lib/Passes/
H A DReorderData.cpp165 DataOrder Order; in baseOrder() local
172 Order.emplace_back(BD, BDCount); in baseOrder()
174 return Order; in baseOrder()
275 DataOrder Order = baseOrder(BC, Section); in sortedByFunc() local
276 unsigned SplitPoint = Order.size(); in sortedByFunc()
279 Order, in sortedByFunc()
308 unsigned SplitPoint = Order.size(); in sortedByCount()
323 if (!Order[Idx].second) { in sortedByCount()
485 DataOrder Order; in runOnFunctions() local
493 std::tie(Order, SplitPointIdx) = in runOnFunctions()
[all …]
H A DReorderAlgorithm.cpp476 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 const BinaryFunction &BF, BasicBlockOrder &Order) const { in reorderBasicBlocks()
517 Order.insert(Order.end(), Cluster.begin(), Cluster.end()); in reorderBasicBlocks()
621 Order.insert(Order.end(), Cluster.begin(), Cluster.end()); in reorderBasicBlocks()
670 Order.insert(Order.end(), Cluster.begin(), Cluster.end()); in reorderBasicBlocks()
685 Order.push_back(FirstBB); in reorderBasicBlocks()
687 Order.push_back(*RLI); in reorderBasicBlocks()
[all …]
/llvm-project-15.0.7/llvm/lib/Support/
H A DDynamicLibrary.cpp71 void *LibLookup(const char *Symbol, DynamicLibrary::SearchOrdering Order) { in LibLookup() argument
72 if (Order & SO_LoadOrder) { in LibLookup()
86 void *Lookup(const char *Symbol, DynamicLibrary::SearchOrdering Order) { in Lookup() argument
87 assert(!((Order & SO_LoadedFirst) && (Order & SO_LoadedLast)) && in Lookup()
90 if (!Process || (Order & SO_LoadedFirst)) { in Lookup()
91 if (void *Ptr = LibLookup(Symbol, Order)) in Lookup()
100 if (Order & SO_LoadedLast) { in Lookup()
101 if (void *Ptr = LibLookup(Symbol, Order)) in Lookup()
/llvm-project-15.0.7/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-15.0.7/llvm/include/llvm/CodeGen/
H A DSelectionDAGNodes.h723 void setIROrder(unsigned Order) { IROrder = Order; }
1071 IROrder(Order), debugLoc(std::move(dl)) {
1100 SDLoc(const Instruction *I, int Order) : IROrder(Order) {
1101 assert(Order >= 0 && "bad IROrder");
1433 : MemSDNode(Opc, Order, dl, VTL, MemVT, MMO) {
1489 : MemSDNode(Opc, Order, dl, VTs, MemoryVT, MMO) {
2296 : MemSDNode(NodeTy, Order, dl, VTs, MemVT, MMO) {
2392 : MemSDNode(NodeTy, Order, DL, VTs, MemVT, MMO) {
2600 : MemSDNode(NodeTy, Order, dl, VTs, MemVT, MMO) {
2706 : MemSDNode(NodeTy, Order, dl, VTs, MemVT, MMO) {
[all …]
/llvm-project-15.0.7/llvm/unittests/Support/DynamicLibrary/
H A DDynamicLibraryTest.cpp119 std::vector<std::string> Order; in TEST() local
159 TO_0(Order); in TEST()
160 TO_1(Order); in TEST()
169 EXPECT_EQ(Order.size(), 2UL); in TEST()
170 EXPECT_EQ(Order.front(), "SecondLib"); in TEST()
171 EXPECT_EQ(Order.back(), "PipSqueak"); in TEST()

12345678