/external/v8/test/unittests/base/platform/ |
platform-unittest.cc | 42 for (size_t i = 0; i < arraysize(keys_); ++i) { 43 keys_[i] = Thread::CreateThreadLocalKey(); 47 for (size_t i = 0; i < arraysize(keys_); ++i) { 48 Thread::DeleteThreadLocalKey(keys_[i]); 53 for (size_t i = 0; i < arraysize(keys_); i++) { 54 CHECK(!Thread::HasThreadLocal(keys_[i])); 56 for (size_t i = 0; i < arraysize(keys_); i++) { 57 Thread::SetThreadLocal(keys_[i], GetValue(i)); 59 for (size_t i = 0; i < arraysize(keys_); i++) { 60 CHECK(Thread::HasThreadLocal(keys_[i])) 87 Thread::LocalStorageKey keys_[32]; member in class:v8::base::__anon23989::ThreadLocalStorageTest [all...] |
/external/v8/src/ |
identity-map.cc | 20 if (keys_) { 21 heap_->UnregisterStrongRoots(keys_); 22 keys_ = nullptr; 53 if (keys_[index] == address) return index; // Found. 54 if (keys_[index] == not_mapped) return -1; // Not found. 57 if (keys_[index] == address) return index; // Found. 58 if (keys_[index] == not_mapped) return -1; // Not found. 71 if (keys_[index] == address) return index; // Found. 72 if (keys_[index] == not_mapped) { // Free entry. 73 keys_[index] = address [all...] |
identity-map.h | 23 // within the {keys_} array in order to simulate a moving GC. 34 keys_(nullptr), 58 Object** keys_; member in class:v8::internal::IdentityMapBase
|
keys.h | 86 Handle<OrderedHashSet> keys() { return Handle<OrderedHashSet>::cast(keys_); } 89 // keys_ is either an Handle<OrderedHashSet> or in the case of own JSProxy 91 Handle<FixedArray> keys_; member in class:v8::internal::BASE_EMBEDDED
|
keys.cc | 47 if (keys_.is_null()) { 51 keys_->map() == isolate_->heap()->fixed_array_map()) { 52 return Handle<FixedArray>::cast(keys_); 72 if (keys_.is_null()) { 73 keys_ = OrderedHashSet::Allocate(isolate_, 16); 80 keys_ = OrderedHashSet::Add(keys(), key); 139 keys_ = keys;
|
/art/compiler/utils/ |
dedupe_set-inl.h | 59 keys_() { 63 for (const HashedKey<StoreKey>& key : keys_) { 72 auto it = keys_.Find(hashed_in_key); 73 if (it != keys_.end()) { 78 keys_.Insert(HashedKey<StoreKey> { hash, store_key }); 90 global_stats->total_probe_distance += keys_.TotalProbeDistance(); 91 global_stats->total_size += keys_.Size(); 92 for (const HashedKey<StoreKey>& key : keys_) { 178 HashSet<HashedKey<StoreKey>, ShardEmptyFn, ShardHashFn, ShardPred> keys_ GUARDED_BY(lock_);
|
/external/google-breakpad/src/processor/ |
static_map_iterator.h | 106 // keys_[i] = key of i_th node. 107 const Key* keys_; member in class:google_breakpad::StaticMapIterator
|
static_map_iterator-inl.h | 52 keys_ = reinterpret_cast<const Key*>( 111 return &(keys_[index_]);
|
static_map.h | 136 // keys_[i] = key of i_th node 137 const Key* keys_; member in class:google_breakpad::StaticMap
|
static_map-inl.h | 55 keys_ = reinterpret_cast<const Key*>( 171 return keys_[index];
|
/external/v8/src/ast/ |
scopeinfo.h | 40 keys_[i].data = NULL; 41 keys_[i].name = NULL; 103 Key keys_[kLength]; member in class:v8::internal::ContextSlotCache
|
scopeinfo.cc | 653 Key& key = keys_[index]; 676 Key& key = keys_[index]; 690 for (int index = 0; index < kLength; index++) keys_[index].data = NULL; 706 Key& key = keys_[index];
|
/external/v8/test/cctest/ |
test-identity-map.cc | 84 if (map.keys_[i]->IsSmi()) { 85 map.keys_[i] = Smi::FromInt(Smi::cast(map.keys_[i])->value() + shift); 106 PrintF(" %3d: %p => %p\n", i, reinterpret_cast<void*>(map.keys_[i]),
|
/external/v8/src/heap/ |
heap.h | 2517 Key keys_[kLength]; member in class:v8::internal::KeyedLookupCache 2561 Key keys_[kLength]; member in class:v8::internal::DescriptorLookupCache [all...] |
heap-inl.h | 680 Key& key = keys_[index]; 689 Key& key = keys_[index];
|
heap.cc | [all...] |
/external/jsoncpp/include/json/ |
value.h | 644 char* keys_[itemPerLink]; member in class:Json::ValueInternalLink
|