| /external/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/webkit/Source/WebKit/android/jni/ |
| PictureSet.h | 65 typedef WTF::Vector<BucketPicture> Bucket;
66 typedef WTF::HashMap<BucketPosition , Bucket* > BucketMap;
77 void displayBucket(Bucket* bucket);
79 WTF::Vector<Bucket*>* bucketsToUpdate() { return &mUpdatedBuckets; }
80 Bucket* getBucket(int x, int y);
81 void addToBucket(Bucket* bucket, int dx, int dy, SkIRect& rect);
82 void gatherBucketsForArea(WTF::Vector<Bucket*>& list, const SkIRect& rect);
119 WTF::Vector<Bucket*> mUpdatedBuckets
[all...] |
| PictureSet.cpp | 113 WTF::Vector<Bucket*>* buckets = bucketsToUpdate();
115 Bucket* bucket = (*buckets)[i]; local
116 for (unsigned int j = 0; j < bucket->size(); j++) {
117 BucketPicture& bucketPicture = (*bucket)[j];
188 Bucket* PictureSet::getBucket(int x, int y)
197 XLOG("PictureSet::getBucket(%d, %d) adding new bucket", x, y);
198 Bucket* bucket = new Bucket(); local
367 Bucket* bucket = getBucket(i, j); local
404 Bucket* bucket = getBucket(i, j); local
674 Bucket* bucket = iter->second; local
711 Bucket* bucket = list[i]; local
[all...] |
| WebViewCore.cpp | 854 WTF::Vector<Bucket*>* buckets = pictureSet->bucketsToUpdate();
857 Bucket* bucket = (*buckets)[i]; local
858 for (unsigned int j = 0; j < bucket->size(); j++) {
859 BucketPicture& bucketPicture = (*bucket)[j];
[all...] |
| /external/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...] |
| DenseMap.h | 286 // The later case is tricky. For example, if we had one empty bucket with
288 // probe almost the entire table until it found the empty bucket. If the
320 /// LookupBucketFor - Lookup the appropriate bucket for Val, returning it in
321 /// FoundBucket. If the bucket contains the key and a value, this returns
322 /// true, otherwise it returns a bucket with an empty marker or tombstone and
344 // Found Val's bucket? If so, return it.
350 // If we found an empty bucket, the key doesn't exist in the set.
354 // of the empty bucket we eventually probed to.
483 typedef std::pair<KeyT, ValueT> Bucket;
489 typedef typename conditional<IsConst, const Bucket, Bucket>::type value_type
[all...] |
| /external/chromium/chrome/browser/extensions/ |
| extensions_quota_service.h | 7 // represented by a 'Bucket' that holds state for that item for one single
11 // arguments to a unique Bucket (the BucketMapper), and another to determine
80 // (represented by its Bucket) constitutes a quota violation.
84 // Bucket objects (see Below) and how often they are replenished.
86 // The maximum number of tokens a bucket can contain, and is refilled to
90 // Specifies how frequently the bucket is logically refilled with tokens.
94 // A Bucket is how the heuristic portrays an individual item (since quota
100 // come in). So, a bucket has an expiration to denote it has becomes stale.
101 class Bucket {
103 Bucket() : num_tokens_(0) {
[all...] |
| extensions_quota_service.cc | 51 // Apply heuristic to each item (bucket).
80 void QuotaLimitHeuristic::Bucket::Reset(const Config& config,
98 if ((*i)->expiration().is_null()) // A brand new bucket.
114 bool ExtensionsQuotaService::TimedLimit::Apply(Bucket* bucket,
116 if (event_time > bucket->expiration())
117 bucket->Reset(config(), event_time);
119 return bucket->DeductToken();
122 bool ExtensionsQuotaService::SustainedLimit::Apply(Bucket* bucket,
[all...] |
| extensions_quota_service_unittest.cc | 14 typedef QuotaLimitHeuristic::Bucket Bucket;
37 buckets_[id] = new Bucket();
42 typedef std::map<int, Bucket*> BucketMap;
116 Bucket* b,
141 Bucket b;
160 Bucket bucket; local
162 bucket.Reset(k2PerMinute, kStartTime);
163 DoMoreThan2PerMinuteFor5Minutes(kStartTime, &lim, &bucket, -1)
[all...] |
| extension_bookmarks_module.cc | 41 typedef QuotaLimitHeuristic::Bucket Bucket;
642 Bucket* GetBucket(const BucketIdType& id) {
643 Bucket* b = buckets_[id];
645 b = new Bucket();
651 std::map<BucketIdType, Bucket*> buckets_;
655 // unique bucket.
|
| /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...] |
| /external/clang/include/clang/Basic/ |
| OnDiskHashTable.h | 132 class Bucket {
138 Bucket() {}
141 Bucket* Buckets;
144 void insert(Bucket* b, size_t size, Item* E) {
146 Bucket& B = b[idx];
153 Bucket* newBuckets = (Bucket*) std::calloc(newsize, sizeof(Bucket));
195 Bucket& B = Buckets[i];
198 // Store the offset for the data of this bucket
[all...] |
| /external/clang/lib/Lex/ |
| HeaderMap.cpp | 135 /// getBucket - Return the specified hash table bucket from the header map,
136 /// bswap'ing its fields as appropriate. If the bucket number is not valid,
137 /// this return a bucket with an empty key (0).
153 // Otherwise, the bucket is valid. Load the values, bswapping as needed.
213 for (unsigned Bucket = HashHMapKey(Filename);; ++Bucket) {
214 HMapBucket B = getBucket(Bucket & (NumBuckets-1));
|
| /frameworks/ex/common/tools/ |
| make-iana-tld-pattern.py | 29 class Bucket:
103 bucket = buckets.get(letter)
105 if bucket is None:
106 bucket = Bucket(letter)
107 buckets[letter] = bucket
109 return bucket
|
