| /openbsd-src/gnu/llvm/libcxx/benchmarks/algorithms/ |
| H A D | common.h | 32 enum class Order { enum
41 struct AllOrders : EnumValuesAsTuple<AllOrders, Order, 7> {
92 void fillValues(std::vector<T>& V, size_t N, Order O) { in fillValues()
93 if (O == Order::SingleElement) { in fillValues()
95 } else if (O == Order::QuickSortAdversary) { in fillValues()
104 void fillValues(std::vector<std::pair<T, T> >& V, size_t N, Order O) { in fillValues()
105 if (O == Order::SingleElement) { in fillValues()
119 void fillValues(std::vector<std::tuple<T1, T2, T3> >& V, size_t N, Order O) { in fillValues()
120 if (O == Order::SingleElement) { in fillValues()
140 inline void fillValues(std::vector<std::string>& V, size_t N, Order O) { in fillValues()
[all …]
|
| H A D | ranges_stable_sort.bench.cpp | 14 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 D | ranges_sort.bench.cpp | 14 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 D | sort.bench.cpp | 14 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 D | stable_sort.bench.cpp | 14 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 D | push_heap.bench.cpp | 14 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 D | ranges_push_heap.bench.cpp | 14 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 D | ranges_make_heap.bench.cpp | 14 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 D | make_heap.bench.cpp | 14 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 D | ranges_make_heap_then_sort_heap.bench.cpp | 14 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 D | min_max_element.bench.cpp | 14 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 D | make_heap_then_sort_heap.bench.cpp | 14 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()
|
| /openbsd-src/gnu/llvm/llvm/tools/llvm-tapi-diff/ |
| H A D | DiffEngine.cpp | 24 StringRef setOrderIndicator(InterfaceInputOrder Order) { in setOrderIndicator() argument
25 return ((Order == lhs) ? "< " : "> "); in setOrderIndicator()
35 OS << Indent << "\t" << setOrderIndicator(Order) << Val << "\n"; in print()
42 OS << Indent << "\t\t" << setOrderIndicator(Order) << Val << "\n"; in print()
49 OS << Indent << "\t" << setOrderIndicator(Order) << std::to_string(Val) in print()
57 OS << Indent << "\t" << setOrderIndicator(Order) in print()
98 OS << Indent << "\t\t" << ((Order == lhs) ? "< " : "> ") in print()
103 OS << Indent << "\t\t" << ((Order == lhs) ? "< " : "> ") in print()
107 OS << Indent << "\t\t" << ((Order == lhs) ? "< " : "> ") in print()
120 InterfaceInputOrder Order) { in addDiffForTargSlice() argument
[all …]
|
| H A D | DiffEngine.h | 64 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()
95 InterfaceInputOrder getOrder() const { return Order; } in getOrder()
99 InterfaceInputOrder Order;
|
| /openbsd-src/gnu/llvm/libcxx/benchmarks/ |
| H A D | map.bench.cpp | 45 enum class Order { Sorted, Random }; enum
46 struct AllOrders : EnumValuesAsTuple<AllOrders, Order, 2> {
236 template <class Mode, class Order>
243 Order::value == ::Order::Random ? Shuffle::Keys : Shuffle::None, 1000); in run()
264 Order::value == ::Order::Random ? Shuffle::Keys in run()
272 return "BM_Insert" + baseName() + Mode::name() + Order::name(); in name()
355 template <class Mode, class Order>
362 Order::value == ::Order::Random ? Shuffle::Keys : Shuffle::None, 1000); in run()
383 Order::value == ::Order::Random ? Shuffle::Keys in run()
391 return "BM_InsertAssign" + baseName() + Mode::name() + Order::name(); in name()
[all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/ |
| H A D | AllocationOrder.h | 32 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 D | AllocationOrder.cpp | 34 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()
|
| H A D | RegAllocGreedy.cpp | 395 AllocationOrder &Order, in tryAssign() argument
399 for (auto I = Order.begin(), E = Order.end(); I != E && !PhysReg; ++I) { in tryAssign()
416 if (Order.isHint(Hint)) { in tryAssign()
439 MCRegister CheapReg = tryEvict(VirtReg, Order, NewVRegs, Cost, FixedRegisters); in tryAssign()
449 auto Order = in canReassign() local
452 for (auto I = Order.begin(), E = Order.end(); I != E && !PhysReg; ++I) { in canReassign()
528 const AllocationOrder &Order, in getOrderLimit() argument
530 unsigned OrderLimit = Order.getOrder().size(); in getOrderLimit()
544 if (RegCosts[Order.getOrder().back()] >= CostPerUseLimit) { in getOrderLimit()
574 AllocationOrder &Order, in tryEvict() argument
[all …]
|
| H A D | RegisterClassInfo.cpp | 134 if (!RCI.Order) in compute()
135 RCI.Order.reset(new MCPhysReg[NumRegs]); in compute()
160 RCI.Order[N++] = PhysReg; in compute()
173 RCI.Order[N++] = PhysReg; in compute()
193 dbgs() << ' ' << printReg(RCI.Order[I], TRI); in compute()
|
| /openbsd-src/gnu/llvm/llvm/lib/Support/ |
| H A D | DynamicLibrary.cpp | 81 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()
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/ |
| H A D | SelectionDAGNodes.h | 734 void setIROrder(unsigned Order) { IROrder = Order; }
1084 SDNode(unsigned Opc, unsigned Order, DebugLoc dl, SDVTList VTs)
1086 IROrder(Order), debugLoc(std::move(dl)) {
1115 SDLoc(const Instruction *I, int Order) : IROrder(Order) {
1116 assert(Order >= 0 && "bad IROrder");
1263 AddrSpaceCastSDNode(unsigned Order, const DebugLoc &dl, EVT VT,
1285 MemSDNode(unsigned Opc, unsigned Order, const DebugLoc &dl, SDVTList VTs,
1446 AtomicSDNode(unsigned Opc, unsigned Order, const DebugLoc &dl, SDVTList VTL,
1448 : MemSDNode(Opc, Order, dl, VTL, MemVT, MMO) {
1504 MemIntrinsicSDNode(unsigned Opc, unsigned Order, const DebugLoc &dl,
[all …]
|
| H A D | ScheduleDAG.h | 56 Order ///< Any other ordering dependency. enumerator
124 : Dep(S, Order), Contents(), Latency(0) { in SDep()
169 return getKind() == Order && (Contents.OrdKind == MayAliasMem in isNormalMemory()
175 return getKind() == Order && Contents.OrdKind == Barrier; in isBarrier()
187 return getKind() == Order && Contents.OrdKind == MustAliasMem; in isMustAlias()
195 return getKind() == Order && Contents.OrdKind >= Weak; in isWeak()
201 return getKind() == Order && Contents.OrdKind == Artificial; in isArtificial()
207 return getKind() == Order && Contents.OrdKind == Cluster; in isCluster()
473 case Order: in overlaps()
|
| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | SDNodeDbgValue.h | 149 unsigned Order; variable
163 Var(Var), Expr(Expr), DL(DL), Order(O), IsIndirect(IsIndirect), in SDDbgValue()
219 unsigned getOrder() const { return Order; } in getOrder()
245 unsigned Order; variable
249 : Label(Label), DL(std::move(dl)), Order(O) {} in SDDbgLabel()
259 unsigned getOrder() const { return Order; } in getOrder()
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Scalar/ |
| H A D | StructurizeCFG.cpp | 250 SmallVector<RegionNode *, 8> Order; member in __anon82769d8e0111::StructurizeCFG
380 Order.resize(std::distance(GraphTraits<Region *>::nodes_begin(ParentRegion), in INITIALIZE_PASS_DEPENDENCY()
382 if (Order.empty()) in INITIALIZE_PASS_DEPENDENCY()
390 unsigned I = 0, E = Order.size(); in INITIALIZE_PASS_DEPENDENCY()
409 Order[I++] = N.first; in INITIALIZE_PASS_DEPENDENCY()
424 Nodes.insert(Order.begin() + I, Order.begin() + E - 1); in INITIALIZE_PASS_DEPENDENCY()
427 EntryNode.first = Order[E - 1]; in INITIALIZE_PASS_DEPENDENCY()
534 for (RegionNode *RN : reverse(Order)) { in collectInfos()
854 BasicBlock *Insert = Order.empty() ? ParentRegion->getExit() : in getNextFlow()
855 Order.back()->getEntry(); in getNextFlow()
[all …]
|
| /openbsd-src/gnu/llvm/llvm/tools/llvm-profgen/ |
| H A D | CSPreInliner.cpp | 76 std::vector<StringRef> Order; in buildTopDownOrder() local
91 Order.push_back(Node->Name); in buildTopDownOrder()
95 std::reverse(Order.begin(), Order.end()); in buildTopDownOrder()
97 return Order; in buildTopDownOrder()
|