/external/mesa3d/src/glx/ |
glxhash.c | 179 __glxHashBucketPtr bucket; local 187 for (bucket = table->buckets[i]; bucket;) { 188 next = bucket->next; 189 HASH_FREE(bucket); 190 bucket = next; 197 /* Find the bucket and organize the list so that this bucket is at the 205 __glxHashBucketPtr bucket; local 210 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) 234 __glxHashBucketPtr bucket; local 250 __glxHashBucketPtr bucket; local 277 __glxHashBucketPtr bucket; local 359 __glxHashBucketPtr bucket; local [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...] |
/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...] |
/frameworks/base/core/java/com/android/internal/logging/ |
EventLogTags.logtags | 10 524291 sysui_histogram (name|3),(bucket|1)
|
/prebuilts/go/darwin-x86/misc/cgo/testplugin/src/issue18676/ |
main.go | 7 // (concrete type / interface type). This itab goes in hash bucket 0x111. 9 // chain rooted at hash bucket 0x111. 11 // json.Unmarshaler. This itab happens to also live in bucket 0x111. 14 // same bucket, and so that the second itab doesn't exist in
|
/prebuilts/go/linux-x86/misc/cgo/testplugin/src/issue18676/ |
main.go | 7 // (concrete type / interface type). This itab goes in hash bucket 0x111. 9 // chain rooted at hash bucket 0x111. 11 // json.Unmarshaler. This itab happens to also live in bucket 0x111. 14 // same bucket, and so that the second itab doesn't exist in
|
/external/libcxx/test/std/containers/unord/unord.multimap/ |
local_iterators.fail.cpp | 46 C::size_type b = c.bucket(0); 51 b = c.bucket(1); 62 b = c.bucket(2); 72 b = c.bucket(3); 79 b = c.bucket(4); 86 b = c.bucket(5); 91 b = c.bucket(6); 111 C::size_type b = c.bucket(0); 116 b = c.bucket(1); 126 b = c.bucket(2) [all...] |
/external/libcxx/test/std/containers/unord/unord.multiset/ |
local_iterators.fail.cpp | 45 C::size_type b = c.bucket(0); 50 b = c.bucket(1); 59 b = c.bucket(2); 67 b = c.bucket(3); 73 b = c.bucket(4); 79 b = c.bucket(5); 84 b = c.bucket(6); 104 C::size_type b = c.bucket(0); 109 b = c.bucket(1); 117 b = c.bucket(2) [all...] |
/external/libcxx/test/std/containers/unord/unord.set/ |
local_iterators.fail.cpp | 43 C::size_type b = c.bucket(0); 48 b = c.bucket(1); 57 b = c.bucket(2); 65 b = c.bucket(3); 71 b = c.bucket(4); 77 b = c.bucket(5); 82 b = c.bucket(6); 102 C::size_type b = c.bucket(0); 107 b = c.bucket(1); 115 b = c.bucket(2) [all...] |
local_iterators.pass.cpp | 45 C::size_type b = c.bucket(0); 50 b = c.bucket(1); 56 b = c.bucket(2); 62 b = c.bucket(3); 68 b = c.bucket(4); 89 C::size_type b = c.bucket(0); 94 b = c.bucket(1); 100 b = c.bucket(2); 106 b = c.bucket(3); 112 b = c.bucket(4) [all...] |
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/ |
local_iterators.fail.cpp | 44 C::size_type b = c.bucket(0); 49 b = c.bucket(1); 60 b = c.bucket(2); 70 b = c.bucket(3); 77 b = c.bucket(4); 84 b = c.bucket(5); 89 b = c.bucket(6); 109 C::size_type b = c.bucket(0); 114 b = c.bucket(1); 124 b = c.bucket(2) [all...] |
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
local_iterators.fail.cpp | 43 C::size_type b = c.bucket(0); 48 b = c.bucket(1); 57 b = c.bucket(2); 65 b = c.bucket(3); 71 b = c.bucket(4); 77 b = c.bucket(5); 82 b = c.bucket(6); 102 C::size_type b = c.bucket(0); 107 b = c.bucket(1); 115 b = c.bucket(2) [all...] |
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
local_iterators.fail.cpp | 43 C::size_type b = c.bucket(0); 48 b = c.bucket(1); 57 b = c.bucket(2); 65 b = c.bucket(3); 71 b = c.bucket(4); 77 b = c.bucket(5); 82 b = c.bucket(6); 102 C::size_type b = c.bucket(0); 107 b = c.bucket(1); 115 b = c.bucket(2) [all...] |
local_iterators.pass.cpp | 45 C::size_type b = c.bucket(0); 50 b = c.bucket(1); 56 b = c.bucket(2); 62 b = c.bucket(3); 68 b = c.bucket(4); 89 C::size_type b = c.bucket(0); 94 b = c.bucket(1); 100 b = c.bucket(2); 106 b = c.bucket(3); 112 b = c.bucket(4) [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multimap/ |
local_iterators.fail.cpp | 44 C::size_type b = c.bucket(0); 49 b = c.bucket(1); 60 b = c.bucket(2); 70 b = c.bucket(3); 77 b = c.bucket(4); 84 b = c.bucket(5); 89 b = c.bucket(6); 109 C::size_type b = c.bucket(0); 114 b = c.bucket(1); 124 b = c.bucket(2) [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multiset/ |
local_iterators.fail.cpp | 43 C::size_type b = c.bucket(0); 48 b = c.bucket(1); 57 b = c.bucket(2); 65 b = c.bucket(3); 71 b = c.bucket(4); 77 b = c.bucket(5); 82 b = c.bucket(6); 102 C::size_type b = c.bucket(0); 107 b = c.bucket(1); 115 b = c.bucket(2) [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.set/ |
local_iterators.fail.cpp | 43 C::size_type b = c.bucket(0); 48 b = c.bucket(1); 57 b = c.bucket(2); 65 b = c.bucket(3); 71 b = c.bucket(4); 77 b = c.bucket(5); 82 b = c.bucket(6); 102 C::size_type b = c.bucket(0); 107 b = c.bucket(1); 115 b = c.bucket(2) [all...] |
local_iterators.pass.cpp | 45 C::size_type b = c.bucket(0); 50 b = c.bucket(1); 56 b = c.bucket(2); 62 b = c.bucket(3); 68 b = c.bucket(4); 89 C::size_type b = c.bucket(0); 94 b = c.bucket(1); 100 b = c.bucket(2); 106 b = c.bucket(3); 112 b = c.bucket(4) [all...] |
/external/autotest/client/site_tests/firmware_TouchMTB/ |
cros_gs.py | 57 self.bucket = GS_BUCKET_PUBLIC if boto == PUBLIC_BOTO else GS_BUCKET 58 bucket = self.bucket 62 self.ls_cmd = '{0} {1} {2}/%s'.format(_cmd_prefix, 'ls', bucket) 64 self.upload_cmd = upload_cmd_str.format(_cmd_prefix, 'cp', bucket) 66 self.download_cmd = download_cmd_str.format(_cmd_prefix, 'cp', bucket) 67 self.rm_cmd = '{0} {1} {2}/%s'.format(_cmd_prefix, 'rm', bucket) 70 """ls the files in the selected bucket.""" 74 """Upload the data to the chosen bucket.""" 81 print msg % os.path.join(self.bucket, bucket_dir, data_dir [all...] |
/external/libcxx/test/std/containers/unord/unord.map/ |
local_iterators.pass.cpp | 46 C::size_type b = c.bucket(0); 51 b = c.bucket(1); 58 b = c.bucket(2); 65 b = c.bucket(3); 72 b = c.bucket(4); 94 C::size_type b = c.bucket(0); 99 b = c.bucket(1); 106 b = c.bucket(2); 113 b = c.bucket(3); 120 b = c.bucket(4) [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...] |
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/ |
local_iterators.pass.cpp | 46 C::size_type b = c.bucket(0); 51 b = c.bucket(1); 58 b = c.bucket(2); 65 b = c.bucket(3); 72 b = c.bucket(4); 94 C::size_type b = c.bucket(0); 99 b = c.bucket(1); 106 b = c.bucket(2); 113 b = c.bucket(3); 120 b = c.bucket(4) [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.map/ |
local_iterators.pass.cpp | 46 C::size_type b = c.bucket(0); 51 b = c.bucket(1); 58 b = c.bucket(2); 65 b = c.bucket(3); 72 b = c.bucket(4); 94 C::size_type b = c.bucket(0); 99 b = c.bucket(1); 106 b = c.bucket(2); 113 b = c.bucket(3); 120 b = c.bucket(4) [all...] |
/external/icu/icu4c/source/i18n/ |
alphaindex.cpp | 82 inline AlphabeticIndex::Bucket *getBucket(const UVector &list, int32_t i) { 83 return static_cast<AlphabeticIndex::Bucket *>(list[i]); 151 const AlphabeticIndex::Bucket *bucket = getBucket(*bucketList_, i); local 153 collatorPrimaryOnly.compare(name, bucket->lowerBoundary_, errorCode); 160 const AlphabeticIndex::Bucket *bucket = getBucket(*bucketList_, start); local 161 if (bucket->displayBucket_ != NULL) { 162 bucket = bucket->displayBucket_ 454 Bucket *bucket = new Bucket(getUnderflowLabel(), emptyString_, U_ALPHAINDEX_UNDERFLOW); local 677 Bucket *bucket = currentBucket; local [all...] |
/external/chromium-trace/catapult/telemetry/telemetry/util/ |
perf_tests_results_helper.py | 45 for bucket in histogram['buckets']: 46 if 'high' in bucket: 47 bucket['mean'] = (bucket['low'] + bucket['high']) / 2.0 49 bucket['mean'] = bucket['low'] 50 if bucket['mean'] > 0: 51 sum_of_logs += math.log(bucket['mean']) * bucket['count' [all...] |