| /external/clang/test/SemaCXX/ |
| 2008-01-11-BadWarning.cpp | 4 void** f(void **Buckets, unsigned NumBuckets) {
5 return Buckets + NumBuckets;
|
| /external/llvm/lib/Support/ |
| FoldingSet.cpp | 188 /// The problem with this is that the start of the hash buckets are not
209 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) {
212 return Buckets + BucketNum;
217 void **Buckets = static_cast<void**>(calloc(NumBuckets+1, sizeof(void*)));
219 Buckets[NumBuckets] = reinterpret_cast<void*>(-1);
220 return Buckets;
232 Buckets = AllocateBuckets(NumBuckets);
237 : Buckets(Arg.Buckets), NumBuckets(Arg.NumBuckets), NumNodes(Arg.NumNodes) {
238 Arg.Buckets = nullptr
[all...] |
| /external/llvm/include/llvm/Support/ |
| OnDiskHashTable.h | 86 Bucket *Buckets;
90 void insert(Bucket *Buckets, size_t Size, Item *E) {
91 Bucket &B = Buckets[E->Hash & (Size - 1)];
97 /// \brief Resize the hash table, moving the old entries into the new buckets.
102 for (Item *E = Buckets[I].Head; E;) {
109 free(Buckets);
111 Buckets = NewBuckets;
130 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj));
136 for (Item *I = Buckets[Hash & (NumBuckets - 1)].Head; I; I = I->Next)
157 Bucket &B = Buckets[I]
[all...] |
| GenericDomTreeConstruction.h | 180 // Instead of using a bucket per vertex, we use a single array Buckets that
182 // Buckets[i] stores the index of the first element in V's bucket. After V's
183 // bucket is processed, Buckets[i] stores the index of the next element in the
185 SmallVector<unsigned, 32> Buckets;
186 Buckets.resize(N + 1);
188 Buckets[i] = i;
196 for (unsigned j = i; Buckets[j] != i; j = Buckets[j]) {
197 typename GraphT::NodeType* V = DT.Vertex[Buckets[j]];
224 Buckets[i] = Buckets[WInfo.Semi]
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfAccelTable.cpp | 87 // Figure out how many buckets we need, then compute the bucket
95 Buckets.resize(Header.bucket_count);
98 Buckets[bucket].push_back(Data[i]);
102 // Sort the contents of the buckets by hash value so that hash
105 for (size_t i = 0; i < Buckets.size(); ++i)
106 std::stable_sort(Buckets[i].begin(), Buckets[i].end(),
139 // Walk through and emit the buckets for the table. Each index is
143 for (size_t i = 0, e = Buckets.size(); i < e; ++i) {
145 if (Buckets[i].size() != 0
[all...] |
| DwarfAccelTable.h | 37 // | BUCKETS |
47 // the number of buckets, total number of hashes, and room for a special
50 // The buckets contain an index (e.g. 6) into the hashes array. The hashes
56 // number of buckets giving us our bucket. From there we take the bucket value
76 // Helper function to compute the number of buckets needed based on
84 uint32_t bucket_count; // The number of buckets in this hash table.
88 // indexes (buckets) for correct alignment.
238 // Buckets/Hashes/Offsets
241 BucketList Buckets;
|
| /external/llvm/lib/Target/PowerPC/ |
| PPCLoopPreIncPrep.cpp | 179 // Collect buckets of comparable addresses used by loads and stores.
180 SmallVector<Bucket, 16> Buckets;
222 for (auto &B : Buckets) {
232 if (Buckets.size() == MaxVars)
234 Buckets.push_back(Bucket(LSCEV, MemI));
239 if (Buckets.empty())
255 DEBUG(dbgs() << "PIP: Found " << Buckets.size() << " buckets\n");
258 for (unsigned i = 0, e = Buckets.size(); i != e; ++i) {
271 for (int j = 0, je = Buckets[i].Elements.size(); j != je; ++j)
[all...] |
| /external/llvm/include/llvm/ADT/ |
| FoldingSet.h | 33 /// "buckets" are actually the nodes themselves (the next pointer is in the
104 /// structure is an array of buckets. Each bucket is indexed by the hash of
113 /// Buckets - Array of bucket chains.
115 void **Buckets;
117 /// NumBuckets - Length of the Buckets array. Always a power of 2.
122 /// is greater than twice the number of buckets.
432 iterator begin() { return iterator(Buckets); }
433 iterator end() { return iterator(Buckets+NumBuckets); }
436 const_iterator begin() const { return const_iterator(Buckets); }
437 const_iterator end() const { return const_iterator(Buckets+NumBuckets);
[all...] |
| DenseMap.h | 84 /// Grow the densemap so that it has at least Size buckets. Does not shrink
250 /// somewhere into the DenseMap's array of buckets (i.e. either to a key or
256 /// getPointerIntoBucketsArray() - Return an opaque pointer into the buckets
282 "# initial buckets must be a power of two!");
430 // the buckets are empty (meaning that many are filled with tombstones),
452 // so that when growing buckets we have self-consistent entry count.
547 BucketT *Buckets;
575 operator delete(Buckets);
581 std::swap(Buckets, RHS.Buckets);
[all...] |
| /external/llvm/tools/llvm-dwp/ |
| llvm-dwp.cpp | 197 std::vector<unsigned> Buckets(NextPowerOf2(3 * IndexEntries.size() / 2));
198 uint64_t Mask = Buckets.size() - 1;
202 while (Buckets[H]) {
203 assert(S != IndexEntries[Buckets[H] - 1].Signature &&
207 Buckets[H] = i + 1;
214 Out.EmitIntValue(Buckets.size(), 4); // Num Buckets
217 for (const auto &I : Buckets)
221 for (const auto &I : Buckets)
|
| /external/clang/lib/Serialization/ |
| MultiOnDiskHashTable.h | 53 storage_type Buckets, storage_type Payload, storage_type Base,
56 Table(NumBuckets, NumEntries, Buckets, Payload, Base, InfoObj) {}
200 storage_type Buckets = Data + BucketOffset;
202 OnDiskTable::HashTable::readNumBucketsAndEntries(Buckets);
207 Buckets, Ptr, Data, std::move(InfoObj));
|
| /external/llvm/include/llvm/ProfileData/ |
| InstrProfReader.h | 310 InstrProfReaderIndex(const unsigned char *Buckets,
|
| /external/llvm/lib/ProfileData/ |
| InstrProfReader.cpp | 536 const unsigned char *Buckets, const unsigned char *const Payload,
541 Buckets, Payload, Base,
|
| /external/chromium-trace/catapult/third_party/gsutil/gslib/third_party/storage_apitools/ |
| storage_v1_messages.py | 50 kind: The kind of item this is. For buckets, this is always
286 class Buckets(messages.Message):
287 """A list of buckets.
291 kind: The kind of item this is. For lists of buckets, this is always
292 storage#buckets.
299 kind = messages.StringField(2, default=u'storage#buckets')
455 format. For buckets with versioning enabled, changing an object's
860 maxResults: Maximum number of buckets to return.
863 prefix: Filter results to buckets whose names begin with this prefix.
[all...] |
| /external/chromium-trace/catapult/third_party/gsutil/third_party/apitools/samples/storage_sample/storage/ |
| storage_v1_messages.py | 38 kind: The kind of item this is. For buckets, this is always
274 class Buckets(_messages.Message):
275 """A list of buckets.
279 kind: The kind of item this is. For lists of buckets, this is always
280 storage#buckets.
287 kind = _messages.StringField(2, default=u'storage#buckets')
443 format. For buckets with versioning enabled, changing an object's
852 maxResults: Maximum number of buckets to return.
855 prefix: Filter results to buckets whose names begin with this prefix.
[all...] |
| /prebuilts/go/darwin-x86/src/runtime/ |
| hashmap.go | 10 // into an array of buckets. Each bucket contains up to
17 // extra buckets.
20 // of buckets twice as big. Buckets are incrementally
23 // Map iterators walk through the array of buckets and
34 // buckets, too small and we waste a lot of space. I wrote
48 // %overflow = percentage of buckets which have an overflow bucket
84 // Each bucket (including its overflow buckets, if any) will have either all or none of its
94 iterator = 1 // there may be an iterator using buckets
107 B uint8 // log_2 of # of buckets (can hold up to loadFactor * 2^B items
[all...] |
| /prebuilts/go/linux-x86/src/runtime/ |
| hashmap.go | 10 // into an array of buckets. Each bucket contains up to
17 // extra buckets.
20 // of buckets twice as big. Buckets are incrementally
23 // Map iterators walk through the array of buckets and
34 // buckets, too small and we waste a lot of space. I wrote
48 // %overflow = percentage of buckets which have an overflow bucket
84 // Each bucket (including its overflow buckets, if any) will have either all or none of its
94 iterator = 1 // there may be an iterator using buckets
107 B uint8 // log_2 of # of buckets (can hold up to loadFactor * 2^B items
[all...] |
