HomeSort by relevance Sort by last modified time
    Searched refs:IsFull (Results 1 - 23 of 23) sorted by null

  /external/webrtc/webrtc/libjingle/xmpp/
jid_unittest.cc 25 EXPECT_FALSE(jid.IsFull());
37 EXPECT_FALSE(jid.IsFull());
49 EXPECT_TRUE(jid.IsFull());
61 EXPECT_TRUE(jid.IsFull());
73 EXPECT_FALSE(jid.IsFull());
85 EXPECT_FALSE(jid.IsFull());
97 EXPECT_FALSE(jid.IsFull());
109 EXPECT_TRUE(jid.IsFull());
121 EXPECT_TRUE(jid.IsFull());
jid.h 47 bool IsFull() const;
jid.cc 117 bool Jid::IsFull() const {
124 if (!IsFull())
xmpplogintask.cc 285 if (!fullJid_.IsFull()) {
  /external/libchrome/base/trace_event/
trace_buffer.h 27 bool IsFull() const { return next_free_ == kTraceBufferChunkSize; }
68 virtual bool IsFull() const = 0;
trace_buffer.cc 67 bool IsFull() const override { return false; }
146 bool IsFull() const override { return false; }
211 // AddMetadataEventsWhileLocked(). We can not DECHECK(!IsFull()) because we
230 bool IsFull() const override { return chunks_.size() >= max_chunks_; }
306 DCHECK(!IsFull());
334 if (IsFull() && num_cached_estimated_events == size()) {
342 if (IsFull()) {
trace_log.cc 283 if (chunk_ && chunk_->IsFull()) {
760 return logged_events_->IsFull();
768 if (thread_shared_chunk_ && thread_shared_chunk_->IsFull()) {
793 if (logged_events_->IsFull()) {
    [all...]
trace_event_unittest.cc     [all...]
  /external/v8/src/heap/
slots-buffer.h 115 inline bool IsFull() { return idx_ == kNumberOfElements; }
129 if (buffer == NULL || buffer->IsFull()) {
mark-compact.h 194 inline bool IsFull() { return ((top_ + 1) & mask_) == bottom_; }
210 if (IsFull()) {
232 if (IsFull()) {
mark-compact.cc     [all...]
incremental-marking.cc 249 heap->mark_compact_collector()->marking_deque()->IsFull();
    [all...]
heap.cc     [all...]
  /external/opencv3/3rdparty/libwebp/utils/
huffman.c 34 static int IsFull(const HuffmanTree* const tree) {
129 if (IsFull(tree)) return 0; // error: too many symbols.
198 ok = ok && IsFull(tree);
233 ok = ok && IsFull(tree);
  /art/runtime/gc/allocator/
rosalloc-inl.h 55 inline bool RosAlloc::Run::IsFull() {
75 return !thread_local_run->IsFull();
rosalloc.cc 608 DCHECK(current_run->IsFull());
630 DCHECK(!current_run->IsFull());
685 DCHECK(thread_local_run->IsFull());
692 DCHECK(!thread_local_run->IsFull());
696 DCHECK(thread_local_run->IsFull());
720 DCHECK(!thread_local_run->IsFull());
723 DCHECK(!thread_local_run->IsFull());
772 run_was_full = run->IsFull();
    [all...]
rosalloc.h 437 ALWAYS_INLINE bool IsFull();
    [all...]
  /external/lzma/CPP/7zip/Bundles/LzmaSpec/
LzmaSpec.cpp 69 bool IsFull;
83 IsFull = false;
94 IsFull = true;
112 return dist <= Pos || IsFull;
117 return Pos == 0 && !IsFull;
  /art/runtime/gc/accounting/
atomic_stack.h 158 bool IsFull() const {
  /art/runtime/gc/collector/
concurrent_copying.cc 572 DCHECK(gc_mark_stack_->IsFull());
580 DCHECK(!gc_mark_stack_->IsFull());
593 if (UNLIKELY(gc_mark_stack_->IsFull())) {
600 if (UNLIKELY(tl_mark_stack == nullptr || tl_mark_stack->IsFull())) {
629 if (UNLIKELY(gc_mark_stack_->IsFull())) {
643 if (UNLIKELY(gc_mark_stack_->IsFull())) {
    [all...]
  /external/v8/test/cctest/heap/
test-mark-compact.cc 64 while (!s.IsFull()) {
  /external/v8/src/
objects.h     [all...]
objects.cc     [all...]

Completed in 301 milliseconds