| /external/tensorflow/tensorflow/core/lib/monitoring/ |
| D | mobile_sampler.h | 54 class Buckets {
56 Buckets() = default;
57 ~Buckets() = default;
59 static std::unique_ptr<Buckets> Explicit( in Explicit()
61 return std::unique_ptr<Buckets>(new Buckets()); in Explicit()
64 static std::unique_ptr<Buckets> Exponential(double scale, in Exponential()
67 return std::unique_ptr<Buckets>(new Buckets()); in Exponential()
77 TF_DISALLOW_COPY_AND_ASSIGN(Buckets);
89 std::unique_ptr<Buckets> buckets) { in New()
101 Sampler(std::unique_ptr<Buckets> buckets) : buckets_(std::move(buckets)) {} in Sampler()
[all …]
|
| D | sampler.cc | 33 class ExplicitBuckets : public Buckets {
66 class ExponentialBuckets : public Buckets {
100 std::unique_ptr<Buckets> Buckets::Explicit(std::vector<double> bucket_limits) { in Explicit()
101 return std::unique_ptr<Buckets>( in Explicit()
106 std::unique_ptr<Buckets> Buckets::Explicit( in Explicit()
108 return std::unique_ptr<Buckets>(new ExplicitBuckets(bucket_limits)); in Explicit()
112 std::unique_ptr<Buckets> Buckets::Exponential(double scale, in Exponential()
115 return std::unique_ptr<Buckets>( in Exponential()
|
| D | sampler.h | 84 class Buckets {
86 virtual ~Buckets() = default;
93 static std::unique_ptr<Buckets> Exponential(double scale,
99 static std::unique_ptr<Buckets> Explicit(
105 static std::unique_ptr<Buckets> Explicit(std::vector<double> bucket_limits);
138 std::unique_ptr<Buckets> buckets);
152 std::unique_ptr<Buckets> buckets) in Sampler()
182 std::unique_ptr<Buckets> buckets_;
212 std::unique_ptr<Buckets> buckets) { in New()
|
| D | sampler_test.cc | 37 Buckets::Explicit({10.0, 20.0}));
64 Buckets::Explicit(std::vector<double>{1.5, 2.8}));
74 Buckets::Explicit({1.5, 2.8}));
94 Buckets::Exponential(1, 2, 3));
118 Buckets::Explicit({10.0, 20.0})); in TEST()
|
| /external/llvm-project/llvm/include/llvm/Support/ |
| D | OnDiskHashTable.h | 85 Bucket *Buckets; variable
89 void insert(Bucket *Buckets, size_t Size, Item *E) { in insert() argument
90 Bucket &B = Buckets[E->Hash & (Size - 1)]; in insert()
102 for (Item *E = Buckets[I].Head; E;) { in resize()
109 free(Buckets); in resize()
111 Buckets = NewBuckets; in resize()
130 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj)); in insert()
136 for (Item *I = Buckets[Hash & (NumBuckets - 1)].Head; I; I = I->Next) in contains()
173 Bucket &B = Buckets[I]; in Emit()
220 LE.write<offset_type>(Buckets[I].Off); in Emit()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/ |
| D | OnDiskHashTable.h | 85 Bucket *Buckets; variable
89 void insert(Bucket *Buckets, size_t Size, Item *E) { in insert() argument
90 Bucket &B = Buckets[E->Hash & (Size - 1)]; in insert()
102 for (Item *E = Buckets[I].Head; E;) { in resize()
109 free(Buckets); in resize()
111 Buckets = NewBuckets; in resize()
130 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj)); in insert()
136 for (Item *I = Buckets[Hash & (NumBuckets - 1)].Head; I; I = I->Next) in contains()
173 Bucket &B = Buckets[I]; in Emit()
220 LE.write<offset_type>(Buckets[I].Off); in Emit()
[all …]
|
| /external/llvm/include/llvm/Support/ |
| D | OnDiskHashTable.h | 86 Bucket *Buckets; variable
90 void insert(Bucket *Buckets, size_t Size, Item *E) { in insert() argument
91 Bucket &B = Buckets[E->Hash & (Size - 1)]; in insert()
102 for (Item *E = Buckets[I].Head; E;) { in resize()
109 free(Buckets); in resize()
111 Buckets = NewBuckets; in resize()
130 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj)); in insert()
136 for (Item *I = Buckets[Hash & (NumBuckets - 1)].Head; I; I = I->Next) in contains()
173 Bucket &B = Buckets[I]; in Emit()
220 LE.write<offset_type>(Buckets[I].Off); in Emit()
[all …]
|
| D | GenericDomTreeConstruction.h | 185 SmallVector<unsigned, 32> Buckets; in Calculate() local
186 Buckets.resize(N + 1); in Calculate()
188 Buckets[i] = i; in Calculate()
196 for (unsigned j = i; Buckets[j] != i; j = Buckets[j]) { in Calculate()
197 typename GraphT::NodeType* V = DT.Vertex[Buckets[j]]; in Calculate()
224 Buckets[i] = Buckets[WInfo.Semi]; in Calculate()
225 Buckets[WInfo.Semi] = i; in Calculate()
231 for (unsigned j = 1; Buckets[j] != 1; j = Buckets[j]) { in Calculate()
232 typename GraphT::NodeType* V = DT.Vertex[Buckets[j]]; in Calculate()
|
| /external/llvm/lib/Support/ |
| D | FoldingSet.cpp | 209 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) { in GetBucketFor() argument
212 return Buckets + BucketNum; in GetBucketFor()
217 void **Buckets = static_cast<void**>(calloc(NumBuckets+1, sizeof(void*))); in AllocateBuckets() local
219 Buckets[NumBuckets] = reinterpret_cast<void*>(-1); in AllocateBuckets()
220 return Buckets; in AllocateBuckets()
232 Buckets = AllocateBuckets(NumBuckets); in FoldingSetImpl()
237 : Buckets(Arg.Buckets), NumBuckets(Arg.NumBuckets), NumNodes(Arg.NumNodes) { in FoldingSetImpl()
238 Arg.Buckets = nullptr; in FoldingSetImpl()
244 free(Buckets); // This may be null if the set is in a moved-from state. in operator =()
245 Buckets = RHS.Buckets; in operator =()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Support/ |
| D | FoldingSet.cpp | 208 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) { in GetBucketFor() argument
211 return Buckets + BucketNum; in GetBucketFor()
216 void **Buckets = static_cast<void**>(safe_calloc(NumBuckets + 1, in AllocateBuckets() local
219 Buckets[NumBuckets] = reinterpret_cast<void*>(-1); in AllocateBuckets()
220 return Buckets; in AllocateBuckets()
232 Buckets = AllocateBuckets(NumBuckets); in FoldingSetBase()
237 : Buckets(Arg.Buckets), NumBuckets(Arg.NumBuckets), NumNodes(Arg.NumNodes) { in FoldingSetBase()
238 Arg.Buckets = nullptr; in FoldingSetBase()
244 free(Buckets); // This may be null if the set is in a moved-from state. in operator =()
245 Buckets = RHS.Buckets; in operator =()
[all …]
|
| /external/swiftshader/third_party/llvm-subzero/lib/Support/ |
| D | FoldingSet.cpp | 209 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) { in GetBucketFor() argument
212 return Buckets + BucketNum; in GetBucketFor()
217 void **Buckets = static_cast<void**>(calloc(NumBuckets+1, sizeof(void*))); in AllocateBuckets() local
219 Buckets[NumBuckets] = reinterpret_cast<void*>(-1); in AllocateBuckets()
220 return Buckets; in AllocateBuckets()
232 Buckets = AllocateBuckets(NumBuckets); in FoldingSetImpl()
237 : Buckets(Arg.Buckets), NumBuckets(Arg.NumBuckets), NumNodes(Arg.NumNodes) { in FoldingSetImpl()
238 Arg.Buckets = nullptr; in FoldingSetImpl()
244 free(Buckets); // This may be null if the set is in a moved-from state. in operator =()
245 Buckets = RHS.Buckets; in operator =()
[all …]
|
| /external/llvm-project/llvm/lib/Support/ |
| D | FoldingSet.cpp | 213 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) { in GetBucketFor() argument
216 return Buckets + BucketNum; in GetBucketFor()
221 void **Buckets = static_cast<void**>(safe_calloc(NumBuckets + 1, in AllocateBuckets() local
224 Buckets[NumBuckets] = reinterpret_cast<void*>(-1); in AllocateBuckets()
225 return Buckets; in AllocateBuckets()
235 Buckets = AllocateBuckets(NumBuckets); in FoldingSetBase()
240 : Buckets(Arg.Buckets), NumBuckets(Arg.NumBuckets), NumNodes(Arg.NumNodes) { in FoldingSetBase()
241 Arg.Buckets = nullptr; in FoldingSetBase()
247 free(Buckets); // This may be null if the set is in a moved-from state. in operator =()
248 Buckets = RHS.Buckets; in operator =()
[all …]
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| D | DwarfAccelTable.cpp | 95 Buckets.resize(Header.bucket_count); in FinalizeTable()
98 Buckets[bucket].push_back(Data[i]); in FinalizeTable()
105 for (size_t i = 0; i < Buckets.size(); ++i) in FinalizeTable()
106 std::stable_sort(Buckets[i].begin(), Buckets[i].end(), in FinalizeTable()
143 for (size_t i = 0, e = Buckets.size(); i < e; ++i) { in EmitBuckets()
145 if (Buckets[i].size() != 0) in EmitBuckets()
152 for (auto *HD : Buckets[i]) { in EmitBuckets()
165 for (size_t i = 0, e = Buckets.size(); i < e; ++i) { in EmitHashes()
166 for (HashList::const_iterator HI = Buckets[i].begin(), in EmitHashes()
167 HE = Buckets[i].end(); in EmitHashes()
[all …]
|
| /external/llvm-project/llvm/include/llvm/DebugInfo/PDB/Native/ |
| D | HashTable.h | 74 return Map->Buckets[Index];
83 while (Index < Map->Buckets.size()) {
115 HashTable() { Buckets.resize(8); } in HashTable()
117 Buckets.resize(Capacity); in HashTable()
131 Buckets.resize(H->Capacity); in load()
146 if (auto EC = Stream.readInteger(Buckets[P].first)) in load()
151 Buckets[P].second = *Value; in load()
207 Buckets.resize(8); in clear()
213 uint32_t capacity() const { return Buckets.size(); } in capacity()
228 if (Traits.storageKeyToLookupKey(Buckets[I].first) == K) in find_as()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/DebugInfo/PDB/Native/ |
| D | HashTable.h | 74 return Map->Buckets[Index];
83 while (Index < Map->Buckets.size()) {
115 HashTable() { Buckets.resize(8); } in HashTable()
117 Buckets.resize(Capacity); in HashTable()
131 Buckets.resize(H->Capacity); in load()
146 if (auto EC = Stream.readInteger(Buckets[P].first)) in load()
151 Buckets[P].second = *Value; in load()
207 Buckets.resize(8); in clear()
213 uint32_t capacity() const { return Buckets.size(); } in capacity()
228 if (Traits.storageKeyToLookupKey(Buckets[I].first) == K) in find_as()
[all …]
|
| /external/llvm/lib/Target/PowerPC/ |
| D | PPCLoopPreIncPrep.cpp | 183 SmallVector<Bucket, 16> Buckets; in runOnLoop() local
225 for (auto &B : Buckets) { in runOnLoop()
235 if (Buckets.size() == MaxVars) in runOnLoop()
237 Buckets.push_back(Bucket(LSCEV, MemI)); in runOnLoop()
242 if (Buckets.empty()) in runOnLoop()
258 DEBUG(dbgs() << "PIP: Found " << Buckets.size() << " buckets\n"); in runOnLoop()
261 for (unsigned i = 0, e = Buckets.size(); i != e; ++i) { in runOnLoop()
274 for (int j = 0, je = Buckets[i].Elements.size(); j != je; ++j) { in runOnLoop()
275 if (auto *II = dyn_cast<IntrinsicInst>(Buckets[i].Elements[j].Instr)) in runOnLoop()
285 if (!Buckets[i].Elements[j].Offset || in runOnLoop()
[all …]
|
| /external/llvm/test/tools/llvm-readobj/ |
| D | elf-gnuhash.test | 22 I386-NEXT: Num Buckets: 3
27 I386-NEXT: Buckets: [1, 4, 0]
33 X86_64-NEXT: Num Buckets: 3
38 X86_64-NEXT: Buckets: [1, 4, 0]
44 PPC-NEXT: Num Buckets: 3
49 PPC-NEXT: Buckets: [1, 5, 0]
55 PPC64-NEXT: Num Buckets: 3
60 PPC64-NEXT: Buckets: [1, 4, 0]
|
| /external/llvm/include/llvm/ADT/ |
| D | FoldingSet.h | 114 void **Buckets;
446 iterator begin() { return iterator(Buckets); } in begin()
447 iterator end() { return iterator(Buckets+NumBuckets); } in end()
450 const_iterator begin() const { return const_iterator(Buckets); } in begin()
451 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } in end()
456 return bucket_iterator(Buckets + (hash & (NumBuckets-1))); in bucket_begin()
460 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true); in bucket_end()
524 iterator begin() { return iterator(Buckets); } in begin()
525 iterator end() { return iterator(Buckets+NumBuckets); } in end()
528 const_iterator begin() const { return const_iterator(Buckets); } in begin()
[all …]
|
| D | DenseMap.h | 592 BucketT *Buckets; variable
620 operator delete(Buckets); in ~DenseMap()
626 std::swap(Buckets, RHS.Buckets); in swap()
640 operator delete(Buckets);
648 operator delete(Buckets); in copyFrom()
669 BucketT *OldBuckets = Buckets; in grow()
672 assert(Buckets); in grow()
697 operator delete(Buckets); in shrink_and_clear()
717 return Buckets; in getBuckets()
727 Buckets = nullptr; in allocateBuckets()
[all …]
|
| /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| D | FoldingSet.h | 119 void **Buckets;
454 iterator begin() { return iterator(Buckets); } in begin()
455 iterator end() { return iterator(Buckets+NumBuckets); } in end()
458 const_iterator begin() const { return const_iterator(Buckets); } in begin()
459 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } in end()
464 return bucket_iterator(Buckets + (hash & (NumBuckets-1))); in bucket_begin()
468 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true); in bucket_end()
534 iterator begin() { return iterator(Buckets); } in begin()
535 iterator end() { return iterator(Buckets+NumBuckets); } in end()
538 const_iterator begin() const { return const_iterator(Buckets); } in begin()
[all …]
|
| D | DenseMap.h | 590 BucketT *Buckets; variable
618 operator delete(Buckets); in ~DenseMap()
624 std::swap(Buckets, RHS.Buckets); in swap()
638 operator delete(Buckets);
646 operator delete(Buckets); in copyFrom()
667 BucketT *OldBuckets = Buckets; in grow()
670 assert(Buckets); in grow()
695 operator delete(Buckets); in shrink_and_clear()
715 return Buckets; in getBuckets()
725 Buckets = nullptr; in allocateBuckets()
[all …]
|
| /external/llvm-project/llvm/lib/Target/PowerPC/ |
| D | PPCLoopInstrFormPrep.cpp | 202 SmallVector<Bucket, 16> &Buckets,
206 bool updateFormPrep(Loop *L, SmallVector<Bucket, 16> &Buckets);
210 bool dispFormPrep(Loop *L, SmallVector<Bucket, 16> &Buckets,
310 SmallVector<Bucket, 16> &Buckets, in addOneCandidate() argument
316 for (auto &B : Buckets) { in addOneCandidate()
326 if (Buckets.size() == MaxCandidateNum) in addOneCandidate()
328 Buckets.push_back(Bucket(LSCEV, MemI)); in addOneCandidate()
336 SmallVector<Bucket, 16> Buckets; in collectCandidates() local
372 addOneCandidate(MemI, LSCEV, Buckets, MaxCandidateNum); in collectCandidates()
374 return Buckets; in collectCandidates()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/PowerPC/ |
| D | PPCLoopInstrFormPrep.cpp | 204 SmallVector<Bucket, 16> &Buckets,
208 bool updateFormPrep(Loop *L, SmallVector<Bucket, 16> &Buckets);
212 bool dispFormPrep(Loop *L, SmallVector<Bucket, 16> &Buckets,
309 SmallVector<Bucket, 16> &Buckets, in addOneCandidate() argument
315 for (auto &B : Buckets) { in addOneCandidate()
325 if (Buckets.size() == MaxCandidateNum) in addOneCandidate()
327 Buckets.push_back(Bucket(LSCEV, MemI)); in addOneCandidate()
335 SmallVector<Bucket, 16> Buckets; in collectCandidates() local
367 addOneCandidate(MemI, LSCEV, Buckets, MaxCandidateNum); in collectCandidates()
369 return Buckets; in collectCandidates()
[all …]
|
| /external/clang/unittests/Lex/ |
| D | HeaderMapTest.cpp | 27 HMapBucket Buckets[NumBuckets]; member
35 Header.StringsOffset = sizeof(Header) + sizeof(Buckets); in init()
79 if (!File.Buckets[I].Key) { in addBucket()
80 File.Buckets[I].Key = Key; in addBucket()
81 File.Buckets[I].Prefix = Prefix; in addBucket()
82 File.Buckets[I].Suffix = Suffix; in addBucket()
139 ASSERT_EQ(3 * sizeof(HMapBucket), sizeof(File.Buckets)); in TEST()
|
| /external/llvm-project/clang/unittests/Lex/ |
| D | HeaderMapTest.cpp | 26 HMapBucket Buckets[NumBuckets]; member
34 Header.StringsOffset = sizeof(Header) + sizeof(Buckets); in init()
78 if (!File.Buckets[I].Key) { in addBucket()
79 File.Buckets[I].Key = Key; in addBucket()
80 File.Buckets[I].Prefix = Prefix; in addBucket()
81 File.Buckets[I].Suffix = Suffix; in addBucket()
138 ASSERT_EQ(3 * sizeof(HMapBucket), sizeof(File.Buckets)); in TEST()
|