| /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...] |
| /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...] |
| StringMap.cpp | 44 // Allocate one extra bucket, set it to look filled so the iterators stop at
50 /// LookupBucketFor - Look up the bucket that the specified string should end
52 /// specified bucket will be non-null. Otherwise, it will be null. In either
53 /// case, the FullHashValue field of the bucket will be set to the hash value
67 ItemBucket &Bucket = TheTable[BucketNo];
68 StringMapEntryBase *BucketItem = Bucket.Item;
69 // If we found an empty bucket, this key isn't in the table yet, return it.
72 // empty bucket. This reduces probing.
78 Bucket.FullHashValue = FullHashValue;
85 } else if (Bucket.FullHashValue == FullHashValue)
[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...] |
| SmallPtrSet.cpp | 49 // Okay, we know we have space. Find a hash bucket.
50 const void **Bucket = const_cast<const void**>(FindBucketFor(Ptr));
51 if (*Bucket == Ptr)
52 return std::make_pair(Bucket, false); // Already inserted, good.
55 if (*Bucket == getTombstoneMarker())
59 *Bucket = Ptr;
60 return std::make_pair(Bucket, true);
78 // Okay, we know we have space. Find a hash bucket.
79 void **Bucket = const_cast<void**>(FindBucketFor(Ptr));
80 if (*Bucket != Ptr) return false; // Not in the set
[all...] |
| StringMap.cpp | 61 // Allocate one extra bucket, set it to look filled so the iterators stop at
67 /// LookupBucketFor - Look up the bucket that the specified string should end
69 /// specified bucket will be non-null. Otherwise, it will be null. In either
70 /// case, the FullHashValue field of the bucket will be set to the hash value
86 // If we found an empty bucket, this key isn't in the table yet, return it.
89 // empty bucket. This reduces probing.
117 // Okay, we didn't find the item. Probe to the next bucket.
127 /// FindKey - Look up the bucket that contains the specified key. If it exists
128 /// in the map, return the bucket number of the key. Otherwise return -1.
140 // If we found an empty bucket, this key isn't in the table yet, return
[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...] |
| SmallPtrSet.h | 201 const void *const *Bucket;
206 : Bucket(BP), End(E) {
211 return Bucket == RHS.Bucket;
214 return Bucket != RHS.Bucket;
218 /// AdvanceIfNotValid - If the current bucket isn't valid, advance to a bucket
219 /// that is. This is guaranteed to stop because the end() bucket is marked
222 assert(Bucket <= End)
[all...] |
| /external/libchrome/base/trace_event/ |
| heap_profiler_heap_dump_writer.cc | 30 // The pairs are grouped into |Bucket|s. A bucket is a group of (context, size)
33 // bucket that represents the entire heap. Then this bucket is recursively
34 // broken down into smaller buckets. Each bucket keeps track of whether further
46 struct Bucket {
47 Bucket()
63 // elements in this bucket, the stack frames 0 up to (but not including) the
67 // When true, the type name for all elements in this bucket must be equal.
72 bool operator<(const Bucket& lhs, const Bucket& rhs)
[all...] |
| heap_profiler_heap_dump_writer.h | 37 struct Bucket;
83 // Inserts an |Entry| for |Bucket| into |entries_|. Returns false if the
85 bool AddEntryForBucket(const Bucket& bucket);
87 // Recursively breaks down a bucket into smaller buckets and adds entries for
89 void BreakDown(const Bucket& bucket);
102 // Minimum size of an allocation for which an allocation bucket will be
|
| heap_profiler_allocation_register.h | 59 buckets_(static_cast<Bucket*>(
60 AllocateGuardedVirtualMemory(NumBuckets * sizeof(Bucket)))),
66 FreeGuardedVirtualMemory(buckets_, NumBuckets * sizeof(Bucket));
137 bits::Align(sizeof(Bucket) * NumBuckets, page_size);
148 // also participate in the bucket's cell list - they point to the list's
151 // that points to this Cell" kind of thing. So |p_prev| points to a bucket
159 using Bucket = Cell*;
228 mutable Bucket* buckets_;
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| SmallPtrSet.h | 147 const void *const *Bucket;
149 explicit SmallPtrSetIteratorImpl(const void *const *BP) : Bucket(BP) {
154 return Bucket == RHS.Bucket;
157 return Bucket != RHS.Bucket;
161 /// AdvanceIfNotValid - If the current bucket isn't valid, advance to a bucket
162 /// that is. This is guaranteed to stop because the end() bucket is marked
165 while (*Bucket == SmallPtrSetImpl::getEmptyMarker() |
[all...] |
| StringMap.h | 83 /// LookupBucketFor - Look up the bucket that the specified string should end
85 /// specified bucket will be non-null. Otherwise, it will be null. In either
86 /// case, the FullHashValue field of the bucket will be set to the hash value
90 /// FindKey - Look up the bucket that contains the specified key. If it exists
91 /// in the map, return the bucket number of the key. Otherwise return -1.
153 // Okay, the item doesn't already exist, and 'Bucket' is the bucket to fill
290 int Bucket = FindKey(Key);
291 if (Bucket == -1) return end();
292 return iterator(TheTable+Bucket);
[all...] |
| FoldingSet.h | 31 /// it, otherwise return the bucket it should be inserted into.
36 /// node). The last node points back to the bucket to simplify node removal.
106 /// structure is an array of buckets. Each bucket is indexed by the hash of
107 /// the nodes it contains. The bucket itself points to the nodes contained
108 /// in the bucket via a singly linked list. The last node in the list points
109 /// back to the bucket to facilitate node removal.
113 /// Buckets - Array of bucket chains.
130 /// Node - This class is used to maintain the singly linked bucket list in
135 // NextInFoldingSetBucket - next link in the bucket list.
526 FoldingSetIteratorImpl(void **Bucket);
[all...] |
| /frameworks/opt/net/wifi/service/java/com/android/server/wifi/scanner/ |
| BackgroundScanScheduler.java | 48 * where each bucket represents a set of channels and an interval to scan at. This
51 * <p>Each new request is placed in the best predefined bucket. Once all requests have been added
52 * the last buckets (lower priority) are placed in the next best bucket until the number of buckets
66 // Max channels that can be specified per bucket
90 * the next smallest bucket with the smallest bucket having a period of PERIOD_MIN_GCD_MS.
103 * scan will be placed in the 20s bucket.
105 * If there are special scan requests such as exponential back off, we always dedicate a bucket
128 * collection to be scanned by the bucket as settings are added to it.
130 private class Bucket {
276 Bucket bucket = mBuckets[index]; local
[all...] |
| /frameworks/base/core/java/android/app/usage/ |
| NetworkStats.java | 130 public static class Bucket {
202 * <p>Any cellular usage in this bucket was incurred while the device was connected to a
213 * <p>Any cellular usage in this bucket as incurred while the device was roaming on another
277 public Bucket() {
281 * Key of the bucket. Usually an app uid or one of the following special values:<p />
287 * @return Bucket key.
294 * Tag of the bucket.<p />
295 * @return Bucket tag.
342 * Start timestamp of the bucket's time interval. Defined in terms of "Unix time", see
351 * End timestamp of the bucket's time interval. Defined in terms of "Unix time", se
570 Bucket bucket = new Bucket(); local
[all...] |
| /frameworks/support/v7/recyclerview/tests/src/android/support/v7/widget/ |
| BucketTest.java | 39 ChildHelper.Bucket mBucket;
49 mBucket = new ChildHelper.Bucket();
53 mArr.add(i * (ChildHelper.Bucket.BITS_PER_WORD - 1));
54 mArr.add(i * (ChildHelper.Bucket.BITS_PER_WORD));
55 mArr.add(i * (ChildHelper.Bucket.BITS_PER_WORD + 1));
56 mArr.add(i * ChildHelper.Bucket.BITS_PER_WORD - 1);
57 mArr.add(i * ChildHelper.Bucket.BITS_PER_WORD);
58 mArr.add(i * ChildHelper.Bucket.BITS_PER_WORD + 1);
|
| /external/llvm/test/tools/dsymutil/Inputs/scattered-reloc/ |
| 1.s | 115 .long 1 @ Header Bucket Count
122 .long 0 @ Bucket 0
123 .long 193487034 @ Hash in Bucket 0
124 .long LNames0-Lnames_begin @ Offset in Bucket 0
135 .long 1 @ Header Bucket Count
142 .long -1 @ Bucket 0
148 .long 1 @ Header Bucket Count
155 .long -1 @ Bucket 0
161 .long 1 @ Header Bucket Count
172 .long 0 @ Bucket
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| AlphabeticIndex.java | 20 import android.icu.text.AlphabeticIndex.Bucket;
21 import android.icu.text.AlphabeticIndex.Bucket.LabelType;
44 * (bucket) of a larger "target" list. That is, each label corresponds to a bucket in
45 * the target list, where everything in the bucket is greater than or equal to the character
47 * they will be in sorted order in the right bucket.
52 * into an inflow bucket between the other two scripts.
73 * for (AlphabeticIndex.Bucket<Integer> bucket : index) {
74 * if (showAll || bucket.size() != 0)
781 Bucket<V> bucket = currentBucket; local
1012 Bucket<V> bucket = new Bucket<V>(fixLabel(current), current, LabelType.NORMAL); local
1079 Bucket<V> bucket = bucketList.get(i); local
1125 Bucket<V> bucket = bucketList.get(i); local
1133 Bucket<V> bucket = bucketList.get(start); local
[all...] |
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/ |
| AlphabeticIndex.java | 19 import com.ibm.icu.text.AlphabeticIndex.Bucket;
20 import com.ibm.icu.text.AlphabeticIndex.Bucket.LabelType;
43 * (bucket) of a larger "target" list. That is, each label corresponds to a bucket in
44 * the target list, where everything in the bucket is greater than or equal to the character
46 * they will be in sorted order in the right bucket.
51 * into an inflow bucket between the other two scripts.
72 * for (AlphabeticIndex.Bucket<Integer> bucket : index) {
73 * if (showAll || bucket.size() != 0)
809 Bucket<V> bucket = currentBucket; local
1058 Bucket<V> bucket = new Bucket<V>(fixLabel(current), current, LabelType.NORMAL); local
1125 Bucket<V> bucket = bucketList.get(i); local
1171 Bucket<V> bucket = bucketList.get(i); local
1179 Bucket<V> bucket = bucketList.get(start); local
[all...] |
| /development/tools/idegen/src/ |
| Eclipse.java | 61 List<Bucket> buckets = new ArrayList<Bucket>(patterns.size());
63 buckets.add(new Bucket(pattern));
71 for (Bucket bucket : buckets) {
72 if (bucket.matches(path)) {
73 bucket.sourceRoots.add(sourceRoot);
80 for (Bucket bucket : buckets) {
81 for (File sourceRoot : bucket.sourceRoots)
[all...] |
| /cts/tests/tests/app.usage/src/android/app/usage/cts/ |
| NetworkUsageStatsTest.java | 343 NetworkStats.Bucket bucket = null; local
345 bucket = mNsm.querySummaryForDevice(
351 assertNotNull(bucket);
352 assertTimestamps(bucket);
353 assertEquals(bucket.getState(), NetworkStats.Bucket.STATE_ALL);
354 assertEquals(bucket.getUid(), NetworkStats.Bucket.UID_ALL);
355 assertEquals(bucket.getMetered(), NetworkStats.Bucket.METERED_ALL)
376 NetworkStats.Bucket bucket = null; local
415 NetworkStats.Bucket bucket = new NetworkStats.Bucket(); local
475 NetworkStats.Bucket bucket = new NetworkStats.Bucket(); local
531 NetworkStats.Bucket bucket = new NetworkStats.Bucket(); local
586 NetworkStats.Bucket bucket = new NetworkStats.Bucket(); local
[all...] |
| /external/icu/icu4c/source/i18n/unicode/ |
| alphaindex.h | 37 * in the bucket with this label.
43 * Undeflow Label. The bucket with this label contains names
44 * in scripts that sort before any of the bucket labels in this index.
50 * Inflow Label. The bucket with this label contains names
51 * in scripts that sort between two of the bucket labels in this index.
60 * Overflow Label. Te bucket with this label contains names in scripts
61 * that sort after all of the bucket labels in this index.
101 * (bucket) of a larger "target" list. That is, each label corresponds to a bucket in
102 * the target list, where everything in the bucket is greater than or equal to the characte
[all...] |
| /external/llvm/lib/DebugInfo/DWARF/ |
| DWARFAcceleratorTable.cpp | 54 << "Bucket count = " << Hdr.NumBuckets << '\n'
82 for (unsigned Bucket = 0; Bucket < Hdr.NumBuckets; ++Bucket) {
85 OS << format("Bucket[%d]\n", Bucket);
96 if (Hash % Hdr.NumBuckets != Bucket)
|
