| /external/google-breakpad/src/common/ |
| simple_string_dictionary.h | 89 const Entry* entry = &map_.entries_[current_++];
104 NonAllocatingMap() : entries_() {
117 memcpy(entries_, other.entries_, sizeof(entries_));
125 assert(size == sizeof(entries_));
126 if (size == sizeof(entries_)) {
127 memcpy(entries_, map, size);
136 if (entries_[i].is_active()) {
181 if (!entries_[i].is_active())
251 Entry entries_[NumEntries]; member in class:google_breakpad::NonAllocatingMap
[all...] |
| /external/v8/src/compiler/ |
| value-numbering-reducer.cc | 46 : entries_(nullptr), capacity_(0), size_(0), zone_(zone) {}
56 if (!entries_) {
61 entries_ = zone()->NewArray<Node*>(kInitialCapacity);
62 memset(entries_, 0, sizeof(*entries_) * kInitialCapacity);
63 entries_[hash & (kInitialCapacity - 1)] = node;
75 Node* entry = entries_[i];
79 entries_[dead] = node;
82 entries_[i] = node;
104 Node* entry = entries_[j]
[all...] |
| node-cache.cc | 35 Entry* old_entries = entries_;
39 entries_ = zone->NewArray<Entry>(num_entries);
40 memset(entries_, 0, sizeof(Entry) * num_entries);
50 Entry* entry = &entries_[j];
66 if (!entries_) {
69 entries_ = zone->NewArray<Entry>(num_entries);
71 memset(entries_, 0, sizeof(Entry) * num_entries);
72 Entry* entry = &entries_[hash & (kInitialSize - 1)];
82 Entry* entry = &entries_[i];
94 Entry* entry = &entries_[hash & (size_ - 1)]
[all...] |
| node-cache.h | 33 : entries_(nullptr), size_(0), max_(max) {}
52 Entry* entries_; // lazily-allocated hash entries. member in class:v8::internal::compiler::final
|
| value-numbering-reducer.h | 27 Node** entries_; member in class:v8::internal::compiler::final
|
| liveness-analyzer.h | 84 void Lookup(int var) { entries_.push_back(Entry(Entry::kLookup, var)); }
85 void Bind(int var) { entries_.push_back(Entry(Entry::kBind, var)); }
86 void Checkpoint(Node* node) { entries_.push_back(Entry(node)); }
132 ZoneDeque<Entry> entries_; member in class:v8::internal::compiler::LivenessAnalyzerBlock
|
| /art/runtime/ |
| type_lookup_table.cc | 37 entries_.release();
75 entries_(storage != nullptr ? reinterpret_cast<Entry*>(storage) : new Entry[mask_ + 1]),
112 entries_(reinterpret_cast<Entry*>(const_cast<uint8_t*>(raw_data))),
117 if (!entries_[pos].IsEmpty()) {
120 entries_[pos] = entry;
121 entries_[pos].next_pos_delta = 0;
128 while (!entries_[next_pos].IsEmpty()) {
132 entries_[pos].next_pos_delta = delta;
133 entries_[next_pos] = entry;
134 entries_[next_pos].next_pos_delta = 0
[all...] |
| reference_table.cc | 36 entries_.reserve(initial_size);
45 if (entries_.size() >= max_size_) {
49 entries_.push_back(GcRoot<mirror::Object>(obj));
54 for (int i = entries_.size() - 1; i >= 0; --i) {
55 mirror::Object* entry = entries_[i].Read();
57 entries_.erase(entries_.begin() + i);
110 return entries_.size();
115 Dump(os, entries_);
242 for (GcRoot<mirror::Object>& root : entries_) {
[all...] |
| type_lookup_table.h | 48 const Entry* entry = &entries_[pos];
57 entry = &entries_[pos];
70 return reinterpret_cast<const uint8_t*>(entries_.get());
159 std::unique_ptr<Entry[]> entries_; member in class:art::TypeLookupTable
160 // owns_entries_ specifies if the lookup table owns the entries_ array.
|
| reference_table.h | 63 Table entries_; member in class:art::ReferenceTable
|
| /art/runtime/verifier/ |
| reg_type_cache.cc | 54 entries_.push_back(UndefinedType::GetInstance());
55 entries_.push_back(ConflictType::GetInstance());
56 entries_.push_back(BooleanType::GetInstance());
57 entries_.push_back(ByteType::GetInstance());
58 entries_.push_back(ShortType::GetInstance());
59 entries_.push_back(CharType::GetInstance());
60 entries_.push_back(IntegerType::GetInstance());
61 entries_.push_back(LongLoType::GetInstance());
62 entries_.push_back(LongHiType::GetInstance());
63 entries_.push_back(FloatType::GetInstance())
[all...] |
| reg_type_cache-inl.h | 31 DCHECK_LT(id, entries_.size());
32 const RegType* result = entries_[id];
124 entries_.push_back(new_entry);
|
| /system/security/keystore/ |
| auth_token_table.cpp | 55 if (entries_.size() >= max_entries_) {
57 *min_element(entries_) = std::move(new_entry);
59 entries_.push_back(std::move(new_entry));
111 entries_, [&](Entry& e) { return e.token()->challenge == op_handle && !e.completed(); });
113 if (matching_op == entries_.end())
128 for (auto& entry : entries_)
154 entries_.erase(remove_if(entries_, [&](Entry& e) { return entry.Supersedes(e); }),
155 entries_.end());
159 entries_.clear()
[all...] |
| auth_token_table.h | 100 size_t size() { return entries_.size(); }
156 std::vector<Entry> entries_; member in class:keymaster::AuthTokenTable
|
| /bionic/libc/malloc_debug/ |
| MapData.cpp | 127 auto it = entries_.find(entry);
128 if (it == entries_.end()) {
129 entries_.insert(entry);
139 for (auto* entry : entries_) {
142 entries_.clear();
151 auto it = entries_.find(&pc_entry);
152 if (it == entries_.end()) {
155 it = entries_.find(&pc_entry);
156 if (it == entries_.end()) {
|
| MapData.h | 73 std::set<MapEntry*, compare_entries> entries_; member in class:MapData
|
| /external/libweave/src/ |
| access_black_list_manager_impl.cc | 41 decltype(entries_)::key_type key;
49 entries_[key] = expiration_time;
52 if (entries_.size() < list->GetSize()) {
67 for (const auto& e : entries_) {
81 for (auto i = begin(entries_); i != end(entries_);) {
83 i = entries_.erase(i);
104 if (entries_.size() >= capacity_) {
113 auto& value = entries_[std::make_pair(user_id, app_id)];
121 if (!entries_.erase(std::make_pair(user_id, app_id)))
[all...] |
| access_black_list_manager_impl.h | 51 entries_; member in class:weave::AccessBlackListManagerImpl
|
| /external/regex-re2/re2/ |
| prefilter_tree.cc | 25 for (int i = 0; i < entries_.size(); i++)
26 delete entries_[i].parents;
104 for (int i = 0; i < entries_.size(); i++) {
105 IntMap* parents = entries_[i].parents;
114 (entries_[it->index()].propagate_up_at_count > 1);
119 entries_[it->index()].propagate_up_at_count -= 1;
209 entries_.resize(node_map_.size());
220 Entry* entry = &entries_[prefilter->unique_id()];
233 Entry* entry = &entries_[prefilter->unique_id()];
259 Entry* child_entry = &entries_[child_id]
[all...] |
| prefilter_tree.h | 107 vector<Entry> entries_; member in class:re2::PrefilterTree
|
| /art/runtime/gc/ |
| allocation_record.h | 226 if (entries_.size() == alloc_record_max_) {
227 entries_.pop_front();
229 entries_.push_back(EntryPair(GcRoot<mirror::Object>(obj), std::move(record)));
233 return entries_.size();
238 size_t sz = entries_.size();
266 // TODO: Is there a better way to hide the entries_'s type?
270 return entries_.begin();
276 return entries_.end();
282 return entries_.rbegin();
288 return entries_.rend()
[all...] |
| allocation_record.cc | 102 // Only visit the last recent_record_max_ number of allocation records in entries_ and mark the
104 for (auto it = entries_.rbegin(), end = entries_.rend(); it != end; ++it) {
141 const size_t delete_bound = std::max(entries_.size(), recent_record_max_) - recent_record_max_;
142 for (auto it = entries_.begin(), end = entries_.end(); it != end;) {
154 it = entries_.erase(it);
312 entries_.clear();
|
| /toolchain/binutils/binutils-2.25/gold/ |
| copy-relocs.h | 57 : entries_(), copy_reloc_type_(copy_reloc_type), dynbss_(NULL)
77 { return !this->entries_.empty(); }
127 Copy_reloc_entries entries_; member in class:gold::Copy_relocs
|
| /external/v8/src/ |
| unicode-inl.h | 15 CacheEntry entry = entries_[code_point & kMask];
23 entries_[code_point & kMask] = CacheEntry(code_point, result);
29 CacheEntry entry = entries_[c & kMask];
48 entries_[c & kMask] = CacheEntry(c, result[0] - c);
51 entries_[c & kMask] = CacheEntry(c, 0);
|
| /external/webrtc/webrtc/p2p/base/ |
| relayport.cc | 200 entries_.push_back(
206 for (size_t i = 0; i < entries_.size(); ++i)
207 delete entries_[i];
273 ASSERT(entries_.size() == 1);
274 entries_[0]->Connect();
318 for (size_t i = 0; i < entries_.size(); ++i) {
319 if (entries_[i]->address().IsNil() && payload) {
320 entry = entries_[i];
323 } else if (entries_[i]->address() == addr) {
324 entry = entries_[i]
[all...] |
