ems_kfc.c 3.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131
  1. /*
  2. * Copyright (C) 2019 Intel Corporation. All rights reserved.
  3. * SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  4. */
  5. #include "ems_gc_internal.h"
  6. gc_handle_t
  7. gc_init_with_pool(char *buf, gc_size_t buf_size)
  8. {
  9. char *buf_end = buf + buf_size;
  10. char *buf_aligned = (char*) (((uintptr_t) buf + 7) & (uintptr_t)~7);
  11. char *base_addr = buf_aligned + sizeof(gc_heap_t);
  12. gc_heap_t *heap = (gc_heap_t*) buf_aligned;
  13. gc_size_t heap_max_size;
  14. hmu_normal_node_t *p = NULL;
  15. hmu_tree_node_t *root = NULL, *q = NULL;
  16. int i = 0, ret;
  17. if (buf_size < 1024) {
  18. os_printf("[GC_ERROR]heap_init_size(%d) < 1024\n", buf_size);
  19. return NULL;
  20. }
  21. base_addr = (char*) (((uintptr_t) base_addr + 7) & (uintptr_t)~7) + GC_HEAD_PADDING;
  22. heap_max_size = (uint32)(buf_end - base_addr) & (uint32)~7;
  23. memset(heap, 0, sizeof *heap);
  24. memset(base_addr, 0, heap_max_size);
  25. ret = os_mutex_init(&heap->lock);
  26. if (ret != BHT_OK) {
  27. os_printf("[GC_ERROR]failed to init lock\n");
  28. return NULL;
  29. }
  30. /* init all data structures*/
  31. heap->max_size = heap_max_size;
  32. heap->current_size = heap_max_size;
  33. heap->base_addr = (gc_uint8*)base_addr;
  34. heap->heap_id = (gc_handle_t)heap;
  35. heap->total_free_size = heap->current_size;
  36. heap->highmark_size = 0;
  37. for (i = 0; i < HMU_NORMAL_NODE_CNT; i++) {
  38. /* make normal node look like a FC*/
  39. p = &heap->kfc_normal_list[i];
  40. memset(p, 0, sizeof *p);
  41. hmu_set_ut(&p->hmu_header, HMU_FC);
  42. hmu_set_size(&p->hmu_header, sizeof *p);
  43. }
  44. root = &heap->kfc_tree_root;
  45. memset(root, 0, sizeof *root);
  46. root->size = sizeof *root;
  47. hmu_set_ut(&root->hmu_header, HMU_FC);
  48. hmu_set_size(&root->hmu_header, sizeof *root);
  49. q = (hmu_tree_node_t *) heap->base_addr;
  50. memset(q, 0, sizeof *q);
  51. hmu_set_ut(&q->hmu_header, HMU_FC);
  52. hmu_set_size(&q->hmu_header, heap->current_size);
  53. hmu_mark_pinuse(&q->hmu_header);
  54. root->right = q;
  55. q->parent = root;
  56. q->size = heap->current_size;
  57. bh_assert(root->size <= HMU_FC_NORMAL_MAX_SIZE
  58. && HMU_FC_NORMAL_MAX_SIZE < q->size);
  59. #if BH_ENABLE_MEMORY_PROFILING != 0
  60. os_printf("heap is successfully initialized with max_size=%u.\n",
  61. heap_max_size);
  62. #endif
  63. return heap;
  64. }
  65. int
  66. gc_destroy_with_pool(gc_handle_t handle)
  67. {
  68. gc_heap_t *heap = (gc_heap_t *) handle;
  69. os_mutex_destroy(&heap->lock);
  70. memset(heap->base_addr, 0, heap->max_size);
  71. memset(heap, 0, sizeof(gc_heap_t));
  72. return GC_SUCCESS;
  73. }
  74. #if BH_ENABLE_GC_VERIFY != 0
  75. void
  76. gci_verify_heap(gc_heap_t *heap)
  77. {
  78. hmu_t *cur = NULL, *end = NULL;
  79. bh_assert(heap && gci_is_heap_valid(heap));
  80. cur = (hmu_t *)heap->base_addr;
  81. end = (hmu_t *)(heap->base_addr + heap->current_size);
  82. while(cur < end)
  83. {
  84. hmu_verify(cur);
  85. cur = (hmu_t *)((gc_uint8*)cur + hmu_get_size(cur));
  86. }
  87. bh_assert(cur == end);
  88. }
  89. #endif
  90. void *
  91. gc_heap_stats(void *heap_arg, uint32* stats, int size)
  92. {
  93. int i;
  94. gc_heap_t *heap = (gc_heap_t *) heap_arg;
  95. for (i = 0; i < size; i++) {
  96. switch (i) {
  97. case GC_STAT_TOTAL:
  98. stats[i] = heap->current_size;
  99. break;
  100. case GC_STAT_FREE:
  101. stats[i] = heap->total_free_size;
  102. break;
  103. case GC_STAT_HIGHMARK:
  104. stats[i] = heap->highmark_size;
  105. break;
  106. default:
  107. break;
  108. }
  109. }
  110. return heap;
  111. }