| /external/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 41 SmallVector<FreeList*, 8> Bucket;
43 // Remove an entry from the free list in Bucket[Idx] and return it.
46 if (Idx >= Bucket.size())
48 FreeList *Entry = Bucket[Idx];
51 Bucket[Idx] = Entry->Next;
55 // Add an entry to the free list at Bucket[Idx].
59 if (Idx >= Bucket.size())
60 Bucket.resize(size_t(Idx) + 1);
61 Entry->Next = Bucket[Idx];
62 Bucket[Idx] = Entry
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 40 SmallVector<FreeList*, 8> Bucket;
42 // Remove an entry from the free list in Bucket[Idx] and return it.
45 if (Idx >= Bucket.size())
47 FreeList *Entry = Bucket[Idx];
50 Bucket[Idx] = Entry->Next;
54 // Add an entry to the free list at Bucket[Idx].
58 if (Idx >= Bucket.size())
59 Bucket.resize(size_t(Idx) + 1);
60 Entry->Next = Bucket[Idx];
61 Bucket[Idx] = Entry
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 40 SmallVector<FreeList*, 8> Bucket;
42 // Remove an entry from the free list in Bucket[Idx] and return it.
45 if (Idx >= Bucket.size())
47 FreeList *Entry = Bucket[Idx];
50 Bucket[Idx] = Entry->Next;
54 // Add an entry to the free list at Bucket[Idx].
58 if (Idx >= Bucket.size())
59 Bucket.resize(size_t(Idx) + 1);
60 Entry->Next = Bucket[Idx];
61 Bucket[Idx] = Entry
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 40 SmallVector<FreeList*, 8> Bucket;
42 // Remove an entry from the free list in Bucket[Idx] and return it.
45 if (Idx >= Bucket.size())
47 FreeList *Entry = Bucket[Idx];
50 Bucket[Idx] = Entry->Next;
54 // Add an entry to the free list at Bucket[Idx].
58 if (Idx >= Bucket.size())
59 Bucket.resize(size_t(Idx) + 1);
60 Entry->Next = Bucket[Idx];
61 Bucket[Idx] = Entry
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 40 SmallVector<FreeList*, 8> Bucket;
42 // Remove an entry from the free list in Bucket[Idx] and return it.
45 if (Idx >= Bucket.size())
47 FreeList *Entry = Bucket[Idx];
50 Bucket[Idx] = Entry->Next;
54 // Add an entry to the free list at Bucket[Idx].
58 if (Idx >= Bucket.size())
59 Bucket.resize(size_t(Idx) + 1);
60 Entry->Next = Bucket[Idx];
61 Bucket[Idx] = Entry
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 40 SmallVector<FreeList*, 8> Bucket;
42 // Remove an entry from the free list in Bucket[Idx] and return it.
45 if (Idx >= Bucket.size())
47 FreeList *Entry = Bucket[Idx];
50 Bucket[Idx] = Entry->Next;
54 // Add an entry to the free list at Bucket[Idx].
58 if (Idx >= Bucket.size())
59 Bucket.resize(size_t(Idx) + 1);
60 Entry->Next = Bucket[Idx];
61 Bucket[Idx] = Entry
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 40 SmallVector<FreeList*, 8> Bucket;
42 // Remove an entry from the free list in Bucket[Idx] and return it.
45 if (Idx >= Bucket.size())
47 FreeList *Entry = Bucket[Idx];
50 Bucket[Idx] = Entry->Next;
54 // Add an entry to the free list at Bucket[Idx].
58 if (Idx >= Bucket.size())
59 Bucket.resize(size_t(Idx) + 1);
60 Entry->Next = Bucket[Idx];
61 Bucket[Idx] = Entry
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 40 SmallVector<FreeList*, 8> Bucket;
42 // Remove an entry from the free list in Bucket[Idx] and return it.
45 if (Idx >= Bucket.size())
47 FreeList *Entry = Bucket[Idx];
50 Bucket[Idx] = Entry->Next;
54 // Add an entry to the free list at Bucket[Idx].
58 if (Idx >= Bucket.size())
59 Bucket.resize(size_t(Idx) + 1);
60 Entry->Next = Bucket[Idx];
61 Bucket[Idx] = Entry
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 40 SmallVector<FreeList*, 8> Bucket;
42 // Remove an entry from the free list in Bucket[Idx] and return it.
45 if (Idx >= Bucket.size())
47 FreeList *Entry = Bucket[Idx];
50 Bucket[Idx] = Entry->Next;
54 // Add an entry to the free list at Bucket[Idx].
58 if (Idx >= Bucket.size())
59 Bucket.resize(size_t(Idx) + 1);
60 Entry->Next = Bucket[Idx];
61 Bucket[Idx] = Entry
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Support/ |
| SmallPtrSet.cpp | 64 // Okay, we know we have space. Find a hash bucket.
65 const void **Bucket = const_cast<const void**>(FindBucketFor(Ptr));
66 if (*Bucket == Ptr) return false; // Already inserted, good.
69 if (*Bucket == getTombstoneMarker())
71 *Bucket = Ptr;
92 // Okay, we know we have space. Find a hash bucket.
93 void **Bucket = const_cast<void**>(FindBucketFor(Ptr));
94 if (*Bucket != Ptr) return false; // Not in the set?
97 *Bucket = getTombstoneMarker();
104 unsigned Bucket = Hash(Ptr)
[all...] |
| FoldingSet.cpp | 184 /// GetNextPtr - In order to save space, each bucket is a
188 /// Nodes. If NextInBucketPtr is a bucket pointer, this method returns null:
191 // The low bit is set if this is the pointer back to the bucket.
202 assert((Ptr & 1) && "Not a bucket pointer");
206 /// GetBucketFor - Hash the specified node ID and return the hash bucket for
214 /// AllocateBuckets - Allocated initialized bucket memory.
217 // Set the very last bucket to be a non-null "pointer".
236 // Set all but the last bucket to null pointers.
239 // Set the very last bucket to be a non-null "pointer".
267 // Insert the node into the new bucket, after recomputing the hash
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
| StringMap.h | 80 /// LookupBucketFor - Look up the bucket that the specified string should end
82 /// specified bucket will be non-null. Otherwise, it will be null. In either
83 /// case, the FullHashValue field of the bucket will be set to the hash value
87 /// FindKey - Look up the bucket that contains the specified key. If it exists
88 /// in the map, return the bucket number of the key. Otherwise return -1.
272 StringMapEntryBase *Bucket = RHS.TheTable[I];
273 if (!Bucket || Bucket == getTombstoneVal()) {
274 TheTable[I] = Bucket;
279 static_cast<MapEntryTy *>(Bucket)->getKey(), Allocator
[all...] |
| SmallPtrSet.h | 192 auto *Bucket = FindBucketFor(Ptr);
193 if (*Bucket == Ptr)
194 return Bucket;
228 const void *const *Bucket;
233 : Bucket(BP), End(E) {
244 return Bucket == RHS.Bucket;
247 return Bucket != RHS.Bucket;
251 /// AdvanceIfNotValid - If the current bucket isn't valid, advance to a bucke
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
| StringMap.h | 80 /// LookupBucketFor - Look up the bucket that the specified string should end
82 /// specified bucket will be non-null. Otherwise, it will be null. In either
83 /// case, the FullHashValue field of the bucket will be set to the hash value
87 /// FindKey - Look up the bucket that contains the specified key. If it exists
88 /// in the map, return the bucket number of the key. Otherwise return -1.
272 StringMapEntryBase *Bucket = RHS.TheTable[I];
273 if (!Bucket || Bucket == getTombstoneVal()) {
274 TheTable[I] = Bucket;
279 static_cast<MapEntryTy *>(Bucket)->getKey(), Allocator
[all...] |
| SmallPtrSet.h | 192 auto *Bucket = FindBucketFor(Ptr);
193 if (*Bucket == Ptr)
194 return Bucket;
228 const void *const *Bucket;
233 : Bucket(BP), End(E) {
244 return Bucket == RHS.Bucket;
247 return Bucket != RHS.Bucket;
251 /// AdvanceIfNotValid - If the current bucket isn't valid, advance to a bucke
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
| StringMap.h | 80 /// LookupBucketFor - Look up the bucket that the specified string should end
82 /// specified bucket will be non-null. Otherwise, it will be null. In either
83 /// case, the FullHashValue field of the bucket will be set to the hash value
87 /// FindKey - Look up the bucket that contains the specified key. If it exists
88 /// in the map, return the bucket number of the key. Otherwise return -1.
272 StringMapEntryBase *Bucket = RHS.TheTable[I];
273 if (!Bucket || Bucket == getTombstoneVal()) {
274 TheTable[I] = Bucket;
279 static_cast<MapEntryTy *>(Bucket)->getKey(), Allocator
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| StringMap.h | 80 /// LookupBucketFor - Look up the bucket that the specified string should end
82 /// specified bucket will be non-null. Otherwise, it will be null. In either
83 /// case, the FullHashValue field of the bucket will be set to the hash value
87 /// FindKey - Look up the bucket that contains the specified key. If it exists
88 /// in the map, return the bucket number of the key. Otherwise return -1.
272 StringMapEntryBase *Bucket = RHS.TheTable[I];
273 if (!Bucket || Bucket == getTombstoneVal()) {
274 TheTable[I] = Bucket;
279 static_cast<MapEntryTy *>(Bucket)->getKey(), Allocator
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
| StringMap.h | 80 /// LookupBucketFor - Look up the bucket that the specified string should end
82 /// specified bucket will be non-null. Otherwise, it will be null. In either
83 /// case, the FullHashValue field of the bucket will be set to the hash value
87 /// FindKey - Look up the bucket that contains the specified key. If it exists
88 /// in the map, return the bucket number of the key. Otherwise return -1.
272 StringMapEntryBase *Bucket = RHS.TheTable[I];
273 if (!Bucket || Bucket == getTombstoneVal()) {
274 TheTable[I] = Bucket;
279 static_cast<MapEntryTy *>(Bucket)->getKey(), Allocator
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
| StringMap.h | 80 /// LookupBucketFor - Look up the bucket that the specified string should end
82 /// specified bucket will be non-null. Otherwise, it will be null. In either
83 /// case, the FullHashValue field of the bucket will be set to the hash value
87 /// FindKey - Look up the bucket that contains the specified key. If it exists
88 /// in the map, return the bucket number of the key. Otherwise return -1.
272 StringMapEntryBase *Bucket = RHS.TheTable[I];
273 if (!Bucket || Bucket == getTombstoneVal()) {
274 TheTable[I] = Bucket;
279 static_cast<MapEntryTy *>(Bucket)->getKey(), Allocator
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
| StringMap.h | 80 /// LookupBucketFor - Look up the bucket that the specified string should end
82 /// specified bucket will be non-null. Otherwise, it will be null. In either
83 /// case, the FullHashValue field of the bucket will be set to the hash value
87 /// FindKey - Look up the bucket that contains the specified key. If it exists
88 /// in the map, return the bucket number of the key. Otherwise return -1.
272 StringMapEntryBase *Bucket = RHS.TheTable[I];
273 if (!Bucket || Bucket == getTombstoneVal()) {
274 TheTable[I] = Bucket;
279 static_cast<MapEntryTy *>(Bucket)->getKey(), Allocator
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| StringMap.h | 80 /// LookupBucketFor - Look up the bucket that the specified string should end
82 /// specified bucket will be non-null. Otherwise, it will be null. In either
83 /// case, the FullHashValue field of the bucket will be set to the hash value
87 /// FindKey - Look up the bucket that contains the specified key. If it exists
88 /// in the map, return the bucket number of the key. Otherwise return -1.
272 StringMapEntryBase *Bucket = RHS.TheTable[I];
273 if (!Bucket || Bucket == getTombstoneVal()) {
274 TheTable[I] = Bucket;
279 static_cast<MapEntryTy *>(Bucket)->getKey(), Allocator
[all...] |
| /external/llvm/lib/Support/ |
| FoldingSet.cpp | 185 /// GetNextPtr - In order to save space, each bucket is a
189 /// Nodes. If NextInBucketPtr is a bucket pointer, this method returns null:
192 // The low bit is set if this is the pointer back to the bucket.
203 assert((Ptr & 1) && "Not a bucket pointer");
207 /// GetBucketFor - Hash the specified node ID and return the hash bucket for
215 /// AllocateBuckets - Allocated initialized bucket memory.
218 // Set the very last bucket to be a non-null "pointer".
259 // Set all but the last bucket to null pointers.
262 // Set the very last bucket to be a non-null "pointer".
271 assert(isPowerOf2_32(NewBucketCount) && "Bad bucket count!")
[all...] |
| /external/swiftshader/third_party/llvm-subzero/lib/Support/ |
| FoldingSet.cpp | 185 /// GetNextPtr - In order to save space, each bucket is a
189 /// Nodes. If NextInBucketPtr is a bucket pointer, this method returns null:
192 // The low bit is set if this is the pointer back to the bucket.
203 assert((Ptr & 1) && "Not a bucket pointer");
207 /// GetBucketFor - Hash the specified node ID and return the hash bucket for
215 /// AllocateBuckets - Allocated initialized bucket memory.
218 // Set the very last bucket to be a non-null "pointer".
259 // Set all but the last bucket to null pointers.
262 // Set the very last bucket to be a non-null "pointer".
271 assert(isPowerOf2_32(NewBucketCount) && "Bad bucket count!")
[all...] |
| /external/llvm/include/llvm/ADT/ |
| StringMap.h | 72 /// LookupBucketFor - Look up the bucket that the specified string should end
74 /// specified bucket will be non-null. Otherwise, it will be null. In either
75 /// case, the FullHashValue field of the bucket will be set to the hash value
79 /// FindKey - Look up the bucket that contains the specified key. If it exists
80 /// in the map, return the bucket number of the key. Otherwise return -1.
265 StringMapEntryBase *Bucket = RHS.TheTable[I];
266 if (!Bucket || Bucket == getTombstoneVal()) {
267 TheTable[I] = Bucket;
272 static_cast<MapEntryTy *>(Bucket)->getKey(), Allocator
[all...] |
| /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| StringMap.h | 79 /// LookupBucketFor - Look up the bucket that the specified string should end
81 /// specified bucket will be non-null. Otherwise, it will be null. In either
82 /// case, the FullHashValue field of the bucket will be set to the hash value
86 /// FindKey - Look up the bucket that contains the specified key. If it exists
87 /// in the map, return the bucket number of the key. Otherwise return -1.
271 StringMapEntryBase *Bucket = RHS.TheTable[I];
272 if (!Bucket || Bucket == getTombstoneVal()) {
273 TheTable[I] = Bucket;
278 static_cast<MapEntryTy *>(Bucket)->getKey(), Allocator
[all...] |
