Searched refs:PartitionFreelistEntry (Results 1 – 2 of 2) sorted by relevance
234 struct PartitionFreelistEntry { struct235 PartitionFreelistEntry* next; argument264 PartitionFreelistEntry* freelist_head;493 ALWAYS_INLINE PartitionFreelistEntry* PartitionFreelistMask( in PartitionFreelistMask()494 PartitionFreelistEntry* ptr) { in PartitionFreelistMask()508 return reinterpret_cast<PartitionFreelistEntry*>(masked); in PartitionFreelistMask()673 PartitionFreelistEntry* new_head = in PartitionBucketAlloc()674 PartitionFreelistMask(static_cast<PartitionFreelistEntry*>(ret)->next); in PartitionBucketAlloc()738 PartitionFreelistEntry* freelist_head = page->freelist_head; in PartitionFreeWithPage()743 auto* entry = static_cast<PartitionFreelistEntry*>(ptr); in PartitionFreeWithPage()
516 firstFreelistPointer + sizeof(PartitionFreelistEntry*); in PartitionPageAllocAndFillFreelist()549 PartitionFreelistEntry* entry = in PartitionPageAllocAndFillFreelist()550 reinterpret_cast<PartitionFreelistEntry*>(freelist_pointer); in PartitionPageAllocAndFillFreelist()554 PartitionFreelistEntry* next_entry = in PartitionPageAllocAndFillFreelist()555 reinterpret_cast<PartitionFreelistEntry*>(freelist_pointer); in PartitionPageAllocAndFillFreelist()691 page->freelist_head = reinterpret_cast<PartitionFreelistEntry*>(slot); in PartitionDirectMap()692 PartitionFreelistEntry* next_entry = in PartitionDirectMap()693 reinterpret_cast<PartitionFreelistEntry*>(slot); in PartitionDirectMap()839 PartitionFreelistEntry* entry = new_page->freelist_head; in PartitionAllocSlowPath()840 PartitionFreelistEntry* new_head = PartitionFreelistMask(entry->next); in PartitionAllocSlowPath()[all …]