Home
last modified time | relevance | path

Searched refs:IsFull (Results 1 - 16 of 16) sorted by relevance

/third_party/node/src/tracing/
H A Dnode_trace_buffer.cc19 if (total_chunks_ == 0 || chunks_[total_chunks_ - 1]->IsFull()) { in AddTraceEvent()
150 if (prev_buf->IsFull()) { in TryLoadAvailableBuffer()
154 if (!other_buf->IsFull()) { in TryLoadAvailableBuffer()
166 if (buffer->buffer1_.IsFull() && !buffer->buffer1_.IsFlushing()) { in NonBlockingFlushSignalCb()
169 if (buffer->buffer2_.IsFull() && !buffer->buffer2_.IsFlushing()) { in NonBlockingFlushSignalCb()
H A Dnode_trace_buffer.h27 bool IsFull() const { in IsFull() function in node::tracing::InternalTraceBuffer
28 return total_chunks_ == max_chunks_ && chunks_[total_chunks_ - 1]->IsFull(); in IsFull()
/third_party/lzma/CPP/7zip/Bundles/LzmaSpec/
H A DLzmaSpec.cpp69 bool IsFull; member in COutWindow
83 IsFull = false; in Create()
94 IsFull = true; in PutByte()
112 return dist <= Pos || IsFull; in CheckDistance()
117 return Pos == 0 && !IsFull; in IsEmpty()
/third_party/node/deps/v8/src/objects/
H A Dswiss-name-dictionary.cc18 DCHECK(IsFull(table->GetCtrl(entry.as_int()))); in DeleteEntry()
97 if (IsFull(GetCtrl(i))) { in EqualsForTesting()
164 if (IsFull(table->GetCtrl(i))) { in ShallowCopy()
H A Dswiss-name-dictionary-inl.h144 DCHECK(IsFull(GetCtrl(entry))); in SetEntryForEnumerationIndex()
304 DCHECK(IsFull(GetCtrl(entry.as_int()))); in ValueAt()
326 DCHECK(IsFull(GetCtrl(entry))); in DetailsAt()
725 bool SwissNameDictionary::IsFull(ctrl_t c) { in IsFull() function in v8::internal::SwissNameDictionary
H A Dswiss-name-dictionary.h303 inline static bool IsFull(ctrl_t c);
H A Dfixed-array.h399 V8_EXPORT_PRIVATE bool IsFull() const;
H A Dobjects.cc4232 bool WeakArrayList::IsFull() const { return length() == capacity(); } in IsFull() function in v8::WeakArrayList
4304 if (!array->IsFull()) { in Add()
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/
H A Draw_hash_set.h319 inline bool IsFull(ctrl_t c) { return c >= static_cast<ctrl_t>(0); }
526 ABSL_HARDENING_ASSERT((ctrl != nullptr && IsFull(*ctrl)) &&
532 ABSL_HARDENING_ASSERT((ctrl == nullptr || IsFull(*ctrl)) &&
618 if (IsFull(h)) {
1074 if (IsFull(ctrl_[i])) {
1585 assert(IsFull(*it.inner_.ctrl_) && "erasing a dangling iterator");
1637 if (IsFull(ctrl_[i])) {
1663 if (IsFull(old_ctrl[i])) {
1971 if (container_internal::IsFull(c.ctrl_[i])) {
H A Draw_hash_set_test.cc250 if (IsFull(expected)) expected = ctrl_t::kDeleted; in TEST()
/third_party/node/deps/v8/src/heap/base/
H A Dworklist.h28 bool IsFull() const { return index_ == capacity_; } in IsFull() function in heap::base::internal::SegmentBase
243 DCHECK(!IsFull()); in Push()
392 if (V8_UNLIKELY(push_segment_->IsFull())) { in Push()
/third_party/node/deps/v8/src/libplatform/tracing/
H A Dtrace-buffer.cc20 if (is_empty_ || chunks_[chunk_index_]->IsFull()) { in AddTraceEvent()
/third_party/node/deps/v8/include/libplatform/
H A Dv8-tracing.h140 bool IsFull() const { return next_free_ == kChunkSize; } in IsFull() function in v8::platform::tracing::TraceBufferChunk
/third_party/node/deps/v8/include/v8-include/libplatform/
H A Dv8-tracing.h140 bool IsFull() const { return next_free_ == kChunkSize; } in IsFull() function in v8::platform::tracing::TraceBufferChunk
/third_party/node/deps/v8/src/diagnostics/
H A Dobjects-debug.cc1426 if (IsFull(ctrl) || slow_checks) { in SwissNameDictionaryVerify()
1430 if (IsFull(ctrl)) { in SwissNameDictionaryVerify()
1478 CHECK(IsFull(ctrl) || IsDeleted(ctrl)); in SwissNameDictionaryVerify()
/third_party/node/deps/v8/src/heap/
H A Dheap.cc6321 if (array->IsFull()) { in AddRetainedMap()

Completed in 36 milliseconds