Lines Matching refs:bytes
50 // bytes. The first word of a page is an opaque page header that has the
52 // have the allocation top address of this page. The next 248 bytes are
53 // remembered sets. Heap objects are aligned to the pointer size (4 bytes). A
93 // A page normally has 8K bytes. Large object pages may be larger. A page
96 // bytes are used as remembered set, and the rest of the page is the object
103 // 256th byte (8K/32). Bytes 0 to 255 do not need the remembered set, so that
108 // only 128 bytes for the RSet, and only get two bytes free in the RSet's RSet.
215 // Page size in bytes. This must be a multiple of the OS page size.
221 // The offset of the remembered set in a page, in addition to the empty bytes
241 // Object area size in bytes.
308 // After calling this we can allocate a certain number of bytes using only
314 virtual bool ReserveSpace(int bytes) = 0;
472 // but keep track of allocated bytes as part of heap.
481 // Returns the maximum available bytes of heaps.
484 // Returns allocated spaces in bytes.
487 // Returns maximum available bytes that the old space can have.
527 // 8K * 8K * 16 = 1G bytes.
536 // Maximum space size in bytes.
539 // Allocated space size in bytes.
755 // The 'capacity' of a space is the number of object-area bytes (ie, not
757 // of a space is the number of allocated bytes, the 'waste' in the space is
758 // the number of bytes that are not allocated and not available to
760 // to internal fragmentation, top of page areas in map space), and the bytes
761 // 'available' is the number of unallocated bytes that are not waste. The
781 // wasted or allocated bytes).
794 // Grow the space by adding available bytes.
800 // Shrink the space by removing available bytes.
806 // Allocate from available bytes (available -> size).
812 // Free allocated bytes, making them available (size -> available).
818 bytes (available -> waste).
824 // Consider the wasted bytes to be allocated, as they contain filler
888 // Available bytes without growing.
891 // Allocated bytes in this space.
894 // Wasted bytes due to fragmentation and not recoverable until the
904 // Allocate the requested number of bytes in the space if possible, return a
908 // Allocate the requested number of bytes for relocation during mark-compact
912 virtual bool ReserveSpace(int bytes);
985 // Bytes of each page that cannot be allocated. Possibly non-zero
1058 int bytes() const { return bytes_; }
1163 virtual bool ReserveSpace(int bytes) {
1294 // Return the allocated bytes in the active semispace.
1309 // Return the available bytes without growing in the active semispace.
1347 // Allocate the requested number of bytes for relocation during mark-compact
1388 virtual bool ReserveSpace(int bytes);
1479 // Set the size in bytes, which can be read with HeapObject::Size(). This
1504 // Return the number of bytes available on the free list.
1509 // number of bytes that have been lost due to internal fragmentation by
1517 // number of bytes lost to fragmentation is returned in the output parameter
1522 // The size range of blocks, in bytes. (Smaller allocations are allowed, but
1531 // Total available bytes in all blocks on this free list.
1606 // Return the number of bytes available on the free list.
1620 // Available bytes on the free list.
1651 // The bytes available on the free list (ie, not above the linear allocation
1900 // extra padding bytes (Page::kPageSize + Page::kObjectStartOffset).
1910 // object and possibly extra remembered set words) bytes after the object
1980 // Available bytes for objects in this space, not including any extra
2017 virtual bool ReserveSpace(int bytes);
2040 int size_; // allocated bytes
2050 // Returns the number of extra bytes (rounded up to the nearest full word)
2051 // required for extra_object_bytes of extra pointers (in bytes).
