HeapBlock.cpp 1.6 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
  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/HeapBlock.h>
  9. #include <stdio.h>
  10. #include <sys/mman.h>
  11. namespace JS {
  12. NonnullOwnPtr<HeapBlock> HeapBlock::create_with_cell_size(Heap& heap, size_t cell_size)
  13. {
  14. char name[64];
  15. snprintf(name, sizeof(name), "LibJS: HeapBlock(%zu)", cell_size);
  16. #ifdef __serenity__
  17. auto* block = (HeapBlock*)serenity_mmap(nullptr, block_size, PROT_READ | PROT_WRITE, MAP_ANONYMOUS | MAP_RANDOMIZED | MAP_PRIVATE, 0, 0, block_size, name);
  18. #else
  19. auto* block = (HeapBlock*)aligned_alloc(block_size, block_size);
  20. #endif
  21. VERIFY(block != MAP_FAILED);
  22. new (block) HeapBlock(heap, cell_size);
  23. return NonnullOwnPtr<HeapBlock>(NonnullOwnPtr<HeapBlock>::Adopt, *block);
  24. }
  25. void HeapBlock::operator delete(void* ptr)
  26. {
  27. #ifdef __serenity__
  28. int rc = munmap(ptr, block_size);
  29. VERIFY(rc == 0);
  30. #else
  31. free(ptr);
  32. #endif
  33. }
  34. HeapBlock::HeapBlock(Heap& heap, size_t cell_size)
  35. : m_heap(heap)
  36. , m_cell_size(cell_size)
  37. {
  38. VERIFY(cell_size >= sizeof(FreelistEntry));
  39. }
  40. void HeapBlock::deallocate(Cell* cell)
  41. {
  42. VERIFY(is_valid_cell_pointer(cell));
  43. VERIFY(!m_freelist || is_valid_cell_pointer(m_freelist));
  44. VERIFY(cell->state() == Cell::State::Live);
  45. VERIFY(!cell->is_marked());
  46. cell->~Cell();
  47. auto* freelist_entry = new (cell) FreelistEntry();
  48. freelist_entry->set_state(Cell::State::Dead);
  49. freelist_entry->next = m_freelist;
  50. m_freelist = freelist_entry;
  51. }
  52. }