OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:IsFull
(Results
1 - 8
of
8
) sorted by null
/external/webp/src/utils/
huffman.c
38
static int
IsFull
(const HuffmanTree* const tree) {
212
if (
IsFull
(tree)) return 0; // error: too many symbols.
282
ok = ok &&
IsFull
(tree);
316
ok = ok &&
IsFull
(tree);
/art/runtime/gc/allocator/
rosalloc-inl.h
55
inline bool RosAlloc::Run::
IsFull
() {
86
return !thread_local_run->
IsFull
();
155
DCHECK(
IsFull
());
rosalloc.cc
601
DCHECK(current_run->
IsFull
());
623
DCHECK(!current_run->
IsFull
());
690
DCHECK(thread_local_run->
IsFull
());
697
DCHECK(!thread_local_run->
IsFull
());
705
DCHECK(thread_local_run->
IsFull
());
729
DCHECK(!thread_local_run->
IsFull
());
732
DCHECK(!thread_local_run->
IsFull
());
781
run_was_full = run->
IsFull
();
[
all
...]
rosalloc.h
238
ALWAYS_INLINE bool
IsFull
();
/external/v8/src/heap/
mark-compact.h
156
inline bool
IsFull
() { return ((top_ + 1) & mask_) == bottom_; }
171
if (
IsFull
()) {
183
if (
IsFull
()) {
201
if (
IsFull
()) {
310
inline bool
IsFull
() { return idx_ == kNumberOfElements; }
336
if (buffer == NULL || buffer->
IsFull
()) {
mark-compact.cc
[
all
...]
incremental-marking.cc
197
scan_until_end = heap->incremental_marking()->marking_deque()->
IsFull
();
[
all
...]
/external/v8/test/cctest/
test-mark-compact.cc
61
while (!s.
IsFull
()) {
Completed in 190 milliseconds