Lines Matching refs:intptr_t
322 if ((reinterpret_cast<intptr_t>(owner_) & kFailureTagMask) ==
331 ASSERT((reinterpret_cast<intptr_t>(space) & kFailureTagMask) == 0);
333 ASSERT((reinterpret_cast<intptr_t>(owner_) & kFailureTagMask) ==
440 void SetFlags(intptr_t flags, intptr_t mask) {
445 intptr_t GetFlags() { return flags_; }
477 static const intptr_t kAlignment =
480 static const intptr_t kAlignmentMask = kAlignment - 1;
482 static const intptr_t kSizeOffset = kPointerSize + kPointerSize;
484 static const intptr_t kLiveBytesOffset =
549 const intptr_t offset =
550 reinterpret_cast<intptr_t>(addr) & kAlignmentMask;
608 intptr_t flags_;
702 static const intptr_t kPageAlignmentMask = (1 << kPageSizeBits) - 1;
773 virtual intptr_t Size() = 0;
777 virtual intptr_t SizeOfObjects() { return Size(); }
949 bool SetUp(intptr_t max_capacity, intptr_t capacity_executable);
955 LargePage* AllocateLargePage(intptr_t object_size,
962 intptr_t Available() { return capacity_ < size_ ? 0 : capacity_ - size_; }
965 intptr_t Size() { return size_; }
968 intptr_t AvailableExecutable() {
974 intptr_t SizeExecutable() { return size_executable_; }
977 intptr_t MaxAvailable() {
986 MemoryChunk* AllocateChunk(intptr_t body_size,
1240 intptr_t Capacity() { return capacity_; }
1241 intptr_t Size() { return size_; }
1242 intptr_t Waste() { return waste_; }
1263 void AllocateBytes(intptr_t size_in_bytes) {
1269 void DeallocateBytes(intptr_t size_in_bytes) {
1282 intptr_t capacity_;
1283 intptr_t size_;
1284 intptr_t waste_;
1357 intptr_t available() { return available_; }
1375 static intptr_t SumFreeList(FreeListNode* node);
1377 intptr_t SumFreeLists();
1382 intptr_t Total() {
1386 intptr_t small_size_;
1387 intptr_t medium_size_;
1388 intptr_t large_size_;
1389 intptr_t huge_size_;
1394 intptr_t EvictFreeListItems(Page* p);
1431 intptr_t max_capacity,
1465 intptr_t Capacity() { return accounting_stats_.Capacity(); }
1469 intptr_t CommittedMemory() { return Capacity(); }
1484 intptr_t Available() { return free_list_.available(); }
1489 virtual intptr_t Size() { return accounting_stats_.Size(); }
1493 virtual intptr_t SizeOfObjects() {
1501 virtual intptr_t Waste() { return accounting_stats_.Waste(); }
1599 bool AdvanceSweeper(intptr_t bytes_to_sweep);
1628 intptr_t max_capacity_;
1657 intptr_t unswept_free_bytes_;
1723 static const intptr_t kCopyOnFlipFlagsMask =
1753 return (reinterpret_cast<intptr_t>(addr) & Page::kPageAlignmentMask)
1758 return (reinterpret_cast<intptr_t>(addr) & Page::kPageAlignmentMask) == 0;
1889 virtual intptr_t Size() {
1934 void FlipPages(intptr_t flags, intptr_t flag_mask);
2100 virtual intptr_t Size() {
2106 // intptr_t because it is inherited, but if we know we are dealing with the
2111 intptr_t EffectiveCapacity() {
2117 intptr_t Capacity() {
2123 intptr_t CommittedMemory() {
2129 intptr_t Available() {
2183 void LowerInlineAllocationLimit(intptr_t step) {
2264 inline intptr_t inline_allocation_limit_step() {
2297 intptr_t inline_allocation_limit_step_;
2321 intptr_t max_capacity,
2352 intptr_t max_capacity,
2392 MapSpace(Heap* heap, intptr_t max_capacity, AllocationSpace id)
2435 CellSpace(Heap* heap, intptr_t max_capacity, AllocationSpace id)
2466 LargeObjectSpace(Heap* heap, intptr_t max_capacity, AllocationSpace id);
2475 static intptr_t ObjectSizeFor(intptr_t chunk_size) {
2486 inline intptr_t Available();
2488 virtual intptr_t Size() {
2492 virtual intptr_t
2536 intptr_t max_capacity_;
2539 intptr_t size_; // allocated bytes
2541 intptr_t objects_size_; // size of objects
