HeapBlock.cpp 1.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445
  1. /*
  2. * Copyright (c) 2020, Andreas Kling <kling@serenityos.org>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include <AK/Assertions.h>
  7. #include <AK/NonnullOwnPtr.h>
  8. #include <LibJS/Heap/Heap.h>
  9. #include <LibJS/Heap/HeapBlock.h>
  10. #include <stdio.h>
  11. #include <sys/mman.h>
  12. namespace JS {
  13. NonnullOwnPtr<HeapBlock> HeapBlock::create_with_cell_size(Heap& heap, size_t cell_size)
  14. {
  15. char name[64];
  16. snprintf(name, sizeof(name), "LibJS: HeapBlock(%zu)", cell_size);
  17. auto* block = static_cast<HeapBlock*>(heap.block_allocator().allocate_block(name));
  18. new (block) HeapBlock(heap, cell_size);
  19. return NonnullOwnPtr<HeapBlock>(NonnullOwnPtr<HeapBlock>::Adopt, *block);
  20. }
  21. HeapBlock::HeapBlock(Heap& heap, size_t cell_size)
  22. : m_heap(heap)
  23. , m_cell_size(cell_size)
  24. {
  25. VERIFY(cell_size >= sizeof(FreelistEntry));
  26. }
  27. void HeapBlock::deallocate(Cell* cell)
  28. {
  29. VERIFY(is_valid_cell_pointer(cell));
  30. VERIFY(!m_freelist || is_valid_cell_pointer(m_freelist));
  31. VERIFY(cell->state() == Cell::State::Live);
  32. VERIFY(!cell->is_marked());
  33. cell->~Cell();
  34. auto* freelist_entry = new (cell) FreelistEntry();
  35. freelist_entry->set_state(Cell::State::Dead);
  36. freelist_entry->next = m_freelist;
  37. m_freelist = freelist_entry;
  38. }
  39. }