| /llvm-project-15.0.7/clang/include/clang/AST/ |
| H A D | CharUnits.h | 69 Quantity += Other.Quantity;
80 Quantity -= Other.Quantity;
93 return Quantity == Other.Quantity;
96 return Quantity != Other.Quantity;
101 return Quantity < Other.Quantity;
104 return Quantity <= Other.Quantity;
107 return Quantity > Other.Quantity;
110 return Quantity >= Other.Quantity;
130 return (Quantity & -Quantity) == Quantity; in isPowerOfTwo()
157 return Quantity / Other.Quantity;
[all …]
|
| /llvm-project-15.0.7/llvm/include/llvm/MCA/HardwareUnits/ |
| H A D | RetireControlUnit.h | 65 unsigned normalizeQuantity(unsigned Quantity) const { in normalizeQuantity()
69 Quantity = std::min(Quantity, NumROBEntries); in normalizeQuantity()
74 return std::max(Quantity, 1U); in normalizeQuantity()
84 bool isAvailable(unsigned Quantity = 1) const {
85 return AvailableEntries >= normalizeQuantity(Quantity);
|
| /llvm-project-15.0.7/libcxx/benchmarks/algorithms/ |
| H A D | ranges_sort_heap.bench.cpp | 16 size_t Quantity; member
20 state, Quantity, Order::Heap, BatchSize::CountElements, in run()
25 return "BM_RangesSortHeap" + ValueType::name() + "_" + std::to_string(Quantity); in name()
|
| H A D | ranges_make_heap.bench.cpp | 16 size_t Quantity; member
20 state, Quantity, Order(), BatchSize::CountElements, in run()
26 std::to_string(Quantity); in name()
|
| H A D | sort_heap.bench.cpp | 16 size_t Quantity; member
20 state, Quantity, Order::Heap, BatchSize::CountElements, in run()
25 return "BM_SortHeap" + ValueType::name() + "_" + std::to_string(Quantity); in name()
|
| H A D | make_heap.bench.cpp | 16 size_t Quantity; member
20 state, Quantity, Order(), BatchSize::CountElements, in run()
26 std::to_string(Quantity); in name()
|
| H A D | ranges_make_heap_then_sort_heap.bench.cpp | 16 size_t Quantity; member
19 runOpOnCopies<ValueType>(state, Quantity, Order(), BatchSize::CountElements, in run()
28 std::to_string(Quantity); in name()
|
| H A D | ranges_sort.bench.cpp | 16 size_t Quantity; member
20 state, Quantity, Order(), BatchSize::CountElements, in run()
28 std::to_string(Quantity); in name()
|
| H A D | min_max_element.bench.cpp | 16 size_t Quantity; member
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 | ranges_stable_sort.bench.cpp | 16 size_t Quantity; member
20 state, Quantity, Order(), BatchSize::CountElements, in run()
28 std::to_string(Quantity); in name()
|
| H A D | pop_heap.bench.cpp | 16 size_t Quantity; member
20 state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) { in run()
28 return "BM_PopHeap" + ValueType::name() + "_" + std::to_string(Quantity); in name()
|
| H A D | ranges_pop_heap.bench.cpp | 16 size_t Quantity; member
20 state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) { in run()
28 return "BM_RangesPopHeap" + ValueType::name() + "_" + std::to_string(Quantity); in name()
|
| H A D | stable_sort.bench.cpp | 16 size_t Quantity; member
20 state, Quantity, Order(), BatchSize::CountElements, in run()
28 std::to_string(Quantity); in name()
|
| H A D | sort.bench.cpp | 16 size_t Quantity; member
20 state, Quantity, Order(), BatchSize::CountElements, in run()
28 std::to_string(Quantity); in name()
|
| H A D | make_heap_then_sort_heap.bench.cpp | 16 size_t Quantity; member
19 runOpOnCopies<ValueType>(state, Quantity, Order(), BatchSize::CountElements, in run()
28 std::to_string(Quantity); in name()
|
| H A D | lower_bound.bench.cpp | 19 size_t Quantity; member
24 …runOpOnCopies<ValueType>(state, Quantity, Order::Ascending, BatchSize::CountBatch, [&](auto& Copy)… in run()
31 return "BM_LowerBound" + ValueType::name() + "_" + std::to_string(Quantity); in name()
|
| H A D | push_heap.bench.cpp | 16 size_t Quantity; member
20 state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) { in run()
31 std::to_string(Quantity); in name()
|
| H A D | ranges_push_heap.bench.cpp | 16 size_t Quantity; member
20 state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) { in run()
31 std::to_string(Quantity); in name()
|
| H A D | common.h | 215 void runOpOnCopies(benchmark::State& state, size_t Quantity, Order O, in runOpOnCopies() argument
217 auto Copies = makeOrderedValues<ValueType>(Quantity, O); in runOpOnCopies()
221 ? Copies.size() * Quantity in runOpOnCopies()
|
| /llvm-project-15.0.7/llvm/include/llvm/CodeGen/ |
| H A D | ScheduleHazardRecognizer.h | 120 virtual void EmitNoops(unsigned Quantity) { in EmitNoops() argument
122 for (unsigned i = 0; i < Quantity; ++i) in EmitNoops()
|
| H A D | TargetInstrInfo.h | 1422 unsigned Quantity) const;
|
| /llvm-project-15.0.7/libcxx/benchmarks/ |
| H A D | algorithms.partition_point.bench.cpp | 94 size_t Quantity; member
98 TestType::Name + '/' + std::to_string(Quantity); in name()
102 auto Data = TestType::generateInput(Quantity); in run()
|
| /llvm-project-15.0.7/llvm/lib/Target/AMDGPU/ |
| H A D | GCNHazardRecognizer.cpp | 258 unsigned Quantity) { in insertNoopsInBundle() argument
259 while (Quantity > 0) { in insertNoopsInBundle()
260 unsigned Arg = std::min(Quantity, 8u); in insertNoopsInBundle()
261 Quantity -= Arg; in insertNoopsInBundle()
|
| H A D | SIInstrInfo.h | 1014 unsigned Quantity) const override;
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | TargetInstrInfo.cpp | 74 unsigned Quantity) const { in insertNoops()
75 for (unsigned i = 0; i < Quantity; ++i) in insertNoops()
|