Home
last modified time | relevance | path

Searched refs:entries_ (Results 1 - 25 of 40) sorted by relevance

12

/third_party/node/deps/v8/src/compiler/
H A Dvalue-numbering-reducer.cc18 : entries_(nullptr), in ValueNumberingReducer()
31 if (!entries_) { in Reduce()
36 entries_ = temp_zone()->NewArray<Node*>(kInitialCapacity); in Reduce()
37 memset(entries_, 0, sizeof(*entries_) * kInitialCapacity); in Reduce()
38 entries_[hash & (kInitialCapacity - 1)] = node; in Reduce()
50 Node* entry = entries_[i]; in Reduce()
54 entries_[dead] = node; in Reduce()
57 entries_[i] = node; in Reduce()
79 Node* other_entry = entries_[ in Reduce()
[all...]
H A Dvalue-numbering-reducer.h34 Node** entries_; member in v8::internal::compiler::final
/third_party/node/deps/v8/src/interpreter/
H A Dhandler-table-builder.cc16 HandlerTableBuilder::HandlerTableBuilder(Zone* zone) : entries_(zone) {} in HandlerTableBuilder()
20 int handler_table_size = static_cast<int>(entries_.size()); in ToHandlerTable()
25 Entry& entry = entries_[i]; in ToHandlerTable()
41 int handler_id = static_cast<int>(entries_.size()); in NewHandlerEntry()
43 entries_.push_back(entry); in NewHandlerEntry()
50 entries_[handler_id].offset_start = offset; in SetTryRegionStart()
56 entries_[handler_id].offset_end = offset; in SetTryRegionEnd()
62 entries_[handler_id].offset_target = offset; in SetHandlerTarget()
67 entries_[handler_id].catch_prediction_ = prediction; in SetPrediction()
72 entries_[handler_i in SetContextRegister()
[all...]
H A Dhandler-table-builder.h59 ZoneVector<Entry> entries_; member in v8::internal::interpreter::final
/third_party/skia/third_party/externals/tint/fuzzers/tint_spirv_tools_fuzzer/
H A Dmutator_cache.cc22 : map_(), entries_(), max_size_(max_size) { in MutatorCache()
32 return entries_.front().second.get(); in Get()
43 Remove(*entries_.back().first); in Put()
46 entries_.emplace_front(nullptr, std::move(value)); in Put()
47 auto pair = map_.emplace(key, entries_.begin()); in Put()
49 entries_.front().first = &pair.first->first; in Put()
59 entries_.erase(it->second); in Remove()
71 entries_.erase(it->second); in UpdateUsage()
72 entries_.push_front(std::move(entry)); in UpdateUsage()
73 it->second = entries_ in UpdateUsage()
[all...]
H A Dmutator_cache.h91 std::list<Entry> entries_; member in tint::fuzzers::spvtools_fuzzer::MutatorCache
/third_party/node/deps/v8/src/codegen/
H A Dsafepoint-table.cc114 entries_.push_back(EntryBuilder(zone_, assembler->pc_offset_for_safepoint())); in DefineSafepoint()
115 return SafepointTableBuilder::Safepoint(&entries_.back(), this); in DefineSafepoint()
123 auto it = entries_.Find(start); in UpdateDeoptimizationInfo()
124 DCHECK(std::any_of(it, entries_.end(), in UpdateDeoptimizationInfo()
139 for (const EntryBuilder& entry : entries_) { in Emit()
146 DCHECK_LT(entries_.back().pc, entry.trampoline); in Emit()
177 for (const EntryBuilder& entry : entries_) { in Emit()
222 int length = static_cast<int>(entries_.size()); in Emit()
232 for (const EntryBuilder& entry : entries_) { in Emit()
249 for (const EntryBuilder& entry : entries_) { in Emit()
[all...]
H A Dconstant-pool.cc246 entries_.insert(std::make_pair(key, offset)); in RecordKey()
259 auto existing = entries_.find(key); in GetRelocInfoStatusFor()
260 if (existing != entries_.end()) { in GetRelocInfoStatusFor()
305 entries_.clear(); in Clear()
339 for (auto iter = entries_.begin(); iter != entries_.end();) { in EmitEntries()
341 auto range = entries_.equal_range(iter->first); in EmitEntries()
494 entries_.insert(std::make_pair(key, offset)); in RecordKey()
507 auto existing = entries_.find(key); in GetRelocInfoStatusFor()
508 if (existing != entries_ in GetRelocInfoStatusFor()
[all...]
H A Dsafepoint-table.h219 explicit SafepointTableBuilder(Zone* zone) : entries_(zone), zone_(zone) {} in SafepointTableBuilder()
300 ZoneChunkList<EntryBuilder> entries_; member in v8::internal::SafepointTableBuilder
/third_party/node/deps/v8/src/wasm/
H A Dwasm-debug.h119 : num_locals_(num_locals), entries_(std::move(entries)) { in DebugSideTable()
121 std::is_sorted(entries_.begin(), entries_.end(), EntryPositionLess{})); in DebugSideTable()
125 auto it = std::lower_bound(entries_.begin(), entries_.end(), in GetEntry()
127 if (it == entries_.end() || it->pc_offset() != pc_offset) return nullptr; in GetEntry()
137 DCHECK(entry == &entries_.front() || in FindValue()
142 DCHECK_NE(&entries_.front(), entry); in FindValue()
148 return base::make_iterator_range(entries_.begin(), entries_ in entries()
163 std::vector<Entry> entries_; global() member in v8::internal::wasm::DebugSideTable
[all...]
/third_party/node/deps/v8/src/profiler/
H A Dweak-code-registry.cc36 entries_.push_back(entry); in Track()
41 for (CodeEntry* entry : entries_) { in Sweep()
52 entries_ = std::move(alive_entries); in Sweep()
56 for (CodeEntry* entry : entries_) { in Clear()
59 entries_.clear(); in Clear()
H A Dheap-snapshot-generator.cc427 DCHECK(entries_.empty()); // Root entry must be the first one. in AddRootEntry()
430 DCHECK_EQ(1u, entries_.size()); in AddRootEntry()
431 DCHECK_EQ(root_entry_, &entries_.front()); in AddRootEntry()
457 entries_.emplace_back(this, static_cast<int>(entries_.size()), type, name, id, in AddEntry()
459 return &entries_.back(); in AddEntry()
478 entries_by_id_cache_.reserve(entries_.size()); in GetEntryById()
479 for (HeapEntry& entry : entries_) { in GetEntryById()
508 entries_.emplace_back(0, kNullAddress, 0, true); in HeapObjectsMap()
526 entries_ in MoveObject()
[all...]
H A Dweak-code-registry.h40 std::vector<CodeEntry*> entries_; member in v8::internal::WeakCodeRegistry
/third_party/node/deps/v8/include/cppgc/internal/
H A Datomic-entry-flag.h31 void Enter() { entries_.fetch_add(1, std::memory_order_relaxed); } in Enter()
32 void Exit() { entries_.fetch_sub(1, std::memory_order_relaxed); } in Exit()
38 return entries_.load(std::memory_order_relaxed) != 0; in MightBeEntered()
42 std::atomic_int entries_{0};
/third_party/node/deps/v8/include/v8-include/cppgc/internal/
H A Datomic-entry-flag.h31 void Enter() { entries_.fetch_add(1, std::memory_order_relaxed); } in Enter()
32 void Exit() { entries_.fetch_sub(1, std::memory_order_relaxed); } in Exit()
38 return entries_.load(std::memory_order_relaxed) != 0; in MightBeEntered()
42 std::atomic_int entries_{0};
/third_party/ninja/src/
H A Dbuild_log.cc151 Entries::iterator i = entries_.find(path); in RecordCommand()
153 if (i != entries_.end()) { in RecordCommand()
157 entries_.insert(Entries::value_type(log_entry->output, log_entry)); in RecordCommand()
341 Entries::iterator i = entries_.find(output); in Load()
342 if (i != entries_.end()) { in Load()
346 entries_.insert(Entries::value_type(entry->output, entry)); in Load()
380 Entries::iterator i = entries_.find(path); in LookupByOutput()
381 if (i != entries_.end()) in LookupByOutput()
411 for (Entries::iterator i = entries_.begin(); i != entries_ in Recompact()
[all...]
H A Dbuild_log.h94 const Entries& entries() const { return entries_; } in entries()
101 Entries entries_; member
/third_party/node/deps/v8/src/compiler/backend/
H A Dspill-placer.cc211 DCHECK_EQ(entries_, nullptr);
214 entries_ =
217 new (&entries_[i]) Entry();
243 new (&entries_[i]) Entry(); in ClearData()
277 entries_[block->rpo_number().ToSize()].SetSpillRequiredSingleValue( in SetSpillRequired()
284 entries_[block.ToSize()].SetDefinitionSingleValue(value_index); in SetDefinition()
295 Entry& entry = entries_[i]; in FirstBackwardPass()
306 const Entry& successor_entry = entries_[successor_id.ToSize()]; in FirstBackwardPass()
348 Entry& entry = entries_[i]; in ForwardPass()
361 const Entry& predecessor_entry = entries_[predecessor_i in ForwardPass()
[all...]
H A Dspill-placer.h151 Entry* entries_ = nullptr; member in v8::internal::compiler::SpillPlacer
/third_party/skia/third_party/externals/tint/src/diagnostic/
H A Ddiagnostic.h109 entries_.emplace_back(std::move(diag)); in add()
214 size_t count() const { return entries_.size(); } in count()
216 iterator begin() const { return entries_.begin(); } in begin()
218 iterator end() const { return entries_.end(); } in end()
224 std::vector<Diagnostic> entries_; member in tint::diag::List
H A Ddiagnostic.cc23 List::List(std::initializer_list<Diagnostic> list) : entries_(list) {} in List()
/third_party/node/deps/v8/src/strings/
H A Dunicode-inl.h17 CacheEntry entry = entries_[code_point & kMask]; in get()
25 entries_[code_point & kMask] = CacheEntry(code_point, result); in CalculateValue()
31 CacheEntry entry = entries_[c & kMask]; in get()
50 entries_[c & kMask] = CacheEntry(c, result[0] - c); in CalculateValue()
53 entries_[c & kMask] = CacheEntry(c, 0); in CalculateValue()
H A Dunicode.h61 CacheEntry entries_[kSize]; member in unibrow::Predicate
87 CacheEntry entries_[kSize]; member in unibrow::Mapping
/third_party/node/deps/v8/src/logging/
H A Druntime-call-stats.cc28 std::sort(entries_.rbegin(), entries_.rend()); in Print()
32 for (Entry& entry : entries_) { in Print()
45 entries_.push_back( in Add()
98 std::vector<Entry> entries_; member in v8::internal::RuntimeCallStatEntries
/third_party/node/deps/v8/src/heap/base/
H A Dworklist.h227 EntryType entries_[kSize]; member in heap::base::Worklist::Segment
244 entries_[index_++] = entry; in Push()
250 *entry = entries_[--index_]; in Pop()
258 if (callback(entries_[i], &entries_[new_index])) { in Update()
270 callback(entries_[i]); in Iterate()

Completed in 14 milliseconds

12