| /external/bison/lib/ |
| hash.c | 54 /* The array of buckets starts at BUCKET and extends to BUCKET_LIMIT-1,
57 struct hash_entry *bucket; member in struct:hash_table
93 slot. A bucket is the collection of all entries hashing to the same slot.
96 In the ideal case, the length of each bucket is roughly the number of
99 entry is linear in time with the size of the bucket. Consequently, a
119 /* If a deletion empties a bucket and causes the ratio of used buckets to
171 /* Return the length of the longest chain (bucket). */
176 struct hash_entry const *bucket; local
179 for (bucket = table->bucket; bucket < table->bucket_limit; bucket++
203 struct hash_entry const *bucket; local
252 struct hash_entry const *bucket local
281 struct hash_entry const *bucket; local
300 struct hash_entry const *bucket local
330 struct hash_entry const *bucket; local
362 struct hash_entry const *bucket; local
607 struct hash_entry *bucket; local
650 struct hash_entry *bucket; local
747 struct hash_entry *bucket local
822 struct hash_entry *bucket; local
911 struct hash_entry *bucket; local
986 struct hash_entry *bucket; local
1031 struct hash_entry const *bucket; local
[all...] |
| /external/webkit/LayoutTests/storage/domstorage/ |
| quota-expected.txt | 12 Putting 'data' into another bucket.h
22 Putting 'data' into another bucket.h
26 Removing bucket 38.
27 Adding 'Hello!' into a new bucket.
|
| /external/chromium/chrome/browser/extensions/ |
| 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.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_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...] |
| /external/qemu/distrib/sdl-1.2.12/src/video/dga/ |
| SDL_dgavideo.c | 595 vidmem_bucket *bucket; local
600 for ( bucket=&surfaces; bucket; bucket=bucket->next ) {
601 printf("Bucket: %p, %d (%s)\n", bucket->base, bucket->size, bucket->used ? "used" : "free");
602 if ( bucket->prev )
623 vidmem_bucket *bucket; local
655 vidmem_bucket *bucket, *freeable; local
678 vidmem_bucket *bucket; local
691 vidmem_bucket *bucket; local
772 vidmem_bucket *bucket, *freeable; local
[all...] |
| /external/chromium/net/base/ |
| ssl_false_start_blacklist.cc | 14 const unsigned bucket = Hash(last_two_labels) & (kBuckets - 1); local
15 const uint32 start = kHashTable[bucket];
16 const uint32 end = kHashTable[bucket + 1];
|
| /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...] |
| 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...] |
| 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...] |
| /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...] |
| /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/webkit/LayoutTests/storage/domstorage/script-tests/ |
| quota.js | 26 debug("Putting 'data' into another bucket.h");
37 debug("Removing bucket 38.");
40 debug("Adding 'Hello!' into a new bucket.");
72 debug("Putting 'data' into another bucket.h");
|
| /external/iproute2/man/man8/ |
| tc-tbf.8 | 3 tbf \- Token Bucket Filter
24 The Token Bucket Filter is a classless queueing discipline available for
51 in one go. Tokens arrive at a steady rate, until the bucket is full.
57 to limit the speed at which the bucket empties. This peakrate is implemented as a second TBF
58 with a very small bucket, so that it doesn't burst.
60 To achieve perfection, the second bucket may contain only a single packet, which leads to
77 bucket, the rate and possibly the peakrate (if set). These two parameters
82 Size of the bucket, in bytes. This is the maximum amount of bytes that tokens can be available for instantaneously.
86 If your buffer is too small, packets may be dropped because more tokens arrive per timer tick than fit in your bucket.
109 Maximum depletion rate of the bucket. Limited to 1mbit/s on Intel, 10mbit/s on Alpha. The peakrate does
[all...] |
| /external/llvm/include/llvm/ADT/ |
| 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...] |
| 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...] |
| /external/qemu/distrib/sdl-1.2.12/src/video/fbcon/ |
| SDL_fbvideo.c | 1079 vidmem_bucket *bucket; local
1084 for ( bucket=&surfaces; bucket; bucket=bucket->next ) {
1085 printf("Bucket: %p, %d (%s)\n", bucket->base, bucket->size, bucket->used ? "used" : "free");
1086 if ( bucket->prev )
1107 vidmem_bucket *bucket; local
1139 vidmem_bucket *bucket, *freeable; local
1152 vidmem_bucket *bucket; local
1227 vidmem_bucket *bucket, *freeable; local
[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/mesa3d/src/mesa/program/ |
| hash_table.c | 115 const unsigned bucket = hash_value % ht->num_buckets; local
118 foreach(node, & ht->buckets[bucket]) {
134 const unsigned bucket = hash_value % ht->num_buckets; local
142 insert_at_head(& ht->buckets[bucket], & node->link);
149 const unsigned bucket = hash_value % ht->num_buckets; local
152 foreach(node, & ht->buckets[bucket]) {
|
| /development/tools/axl/ |
| chewperf.py | 64 bucket = x[0] / 1000
66 if bucket in buckets:
67 buckets[bucket] += bytes
69 buckets[bucket] = bytes
|
| /external/qemu/android/ |
| hw-lcd.c | 21 /* Map density to one of our five bucket values.
22 The TV density is a bit particular (and not actually a bucket
|
| /external/emma/core/java12/com/vladium/util/ |
| IntIntMap.java | 86 // index into the corresponding hash bucket:
90 // traverse the singly-linked list of entries in the bucket:
110 // index into the corresponding hash bucket:
114 // traverse the singly-linked list of entries in the bucket:
129 // index into the corresponding hash bucket:
133 // traverse the singly-linked list of entries in the bucket:
174 // index into the corresponding hash bucket:
177 // traverse the singly-linked list of entries in the bucket:
217 // index into the corresponding hash bucket:
220 // traverse the singly-linked list of entries in the bucket
[all...] |
| /external/dbus/dbus/ |
| dbus-hash.c | 101 * When there are this many entries per bucket, on average, rebuild
108 * hash tables bucket list. The idea is to make it so that
146 * hash bucket, or #NULL for end of
159 DBusHashEntry ***bucket,
171 DBusHashEntry **buckets; /**< Pointer to bucket array. Each
173 * bucket's hash chain, or #NULL.
176 /**< Bucket array used for small tables
215 DBusHashEntry **bucket; /**< Pointer to bucket that points to member in struct:__anon5446
220 DBusHashEntry *next_entry; /**< Next entry to be iterated onto in current bucket */
781 DBusHashEntry **bucket; local
1102 DBusHashEntry **bucket; local
1284 DBusHashEntry **bucket; local
1313 DBusHashEntry **bucket; local
1342 DBusHashEntry **bucket; local
1372 DBusHashEntry **bucket; local
1401 DBusHashEntry **bucket; local
[all...] |
| /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
|
