shim_brk.c 8.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278
  1. /* -*- mode:c; c-file-style:"k&r"; c-basic-offset: 4; tab-width:4; indent-tabs-mode:nil; mode:auto-fill; fill-column:78; -*- */
  2. /* vim: set ts=4 sw=4 et tw=78 fo=cqt wm=0: */
  3. /* Copyright (C) 2014 Stony Brook University
  4. This file is part of Graphene Library OS.
  5. Graphene Library OS is free software: you can redistribute it and/or
  6. modify it under the terms of the GNU Lesser General Public License
  7. as published by the Free Software Foundation, either version 3 of the
  8. License, or (at your option) any later version.
  9. Graphene Library OS is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. GNU Lesser General Public License for more details.
  13. You should have received a copy of the GNU Lesser General Public License
  14. along with this program. If not, see <http://www.gnu.org/licenses/>. */
  15. /*
  16. * shim_brk.c
  17. *
  18. * Implementation of system call "brk".
  19. */
  20. #include <shim_internal.h>
  21. #include <shim_utils.h>
  22. #include <shim_table.h>
  23. #include <shim_vma.h>
  24. #include <shim_checkpoint.h>
  25. #include <shim_profile.h>
  26. #include <pal.h>
  27. #include <sys/mman.h>
  28. #define BRK_SIZE 4096
  29. unsigned long brk_max_size = 0;
  30. struct shim_brk_info {
  31. void * brk_start;
  32. void * brk_end;
  33. void * brk_current;
  34. };
  35. static struct shim_brk_info region;
  36. DEFINE_PROFILE_OCCURENCE(brk, memory);
  37. DEFINE_PROFILE_OCCURENCE(brk_count, memory);
  38. DEFINE_PROFILE_OCCURENCE(brk_migrate_count, memory);
  39. void get_brk_region (void ** start, void ** end, void ** current)
  40. {
  41. master_lock();
  42. *start = region.brk_start;
  43. *end = region.brk_end;
  44. *current = region.brk_current;
  45. master_unlock();
  46. }
  47. int init_brk_region (void * brk_region)
  48. {
  49. if (region.brk_start)
  50. return 0;
  51. if (!brk_max_size) {
  52. char brk_cfg[CONFIG_MAX];
  53. if (root_config &&
  54. get_config(root_config, "sys.brk.size", brk_cfg, CONFIG_MAX) > 0)
  55. brk_max_size = parse_int(brk_cfg);
  56. if (!brk_max_size)
  57. brk_max_size = DEFAULT_BRK_MAX_SIZE;
  58. }
  59. int flags = MAP_PRIVATE|MAP_ANONYMOUS;
  60. /*
  61. * Chia-Che 8/24/2017
  62. * Adding an argument to specify the initial starting
  63. * address of brk region.
  64. * The general assumption of Linux is that the brk region
  65. * should be within [exec-data-end, exec-data-end + 0x2000000)
  66. */
  67. if (brk_region) {
  68. while (true) {
  69. uint32_t rand;
  70. getrand(&rand, sizeof(rand));
  71. rand %= 0x2000000;
  72. rand = ALIGN_UP(rand);
  73. struct shim_vma_val vma;
  74. if (lookup_overlap_vma(brk_region + rand, brk_max_size, &vma)
  75. == -ENOENT) {
  76. brk_region += rand;
  77. break;
  78. }
  79. brk_region = vma.addr + vma.length;
  80. }
  81. /*
  82. * Create the bookkeeping before allocating the brk region.
  83. * The bookkeeping should never fail because we've already confirmed
  84. * the availability.
  85. */
  86. if (bkeep_mmap(brk_region, brk_max_size, PROT_READ|PROT_WRITE,
  87. flags|VMA_UNMAPPED, NULL, 0, "brk") < 0)
  88. bug();
  89. } else {
  90. brk_region = bkeep_unmapped_heap(brk_max_size, PROT_READ|PROT_WRITE,
  91. flags|VMA_UNMAPPED, NULL, 0, "brk");
  92. if (!brk_region)
  93. return -ENOMEM;
  94. }
  95. void * end_brk_region = NULL;
  96. /* Allocate the whole brk region */
  97. void * ret = (void *) DkVirtualMemoryAlloc(brk_region, brk_max_size, 0,
  98. PAL_PROT_READ|PAL_PROT_WRITE);
  99. /* Checking if the PAL call succeeds. */
  100. if (!ret) {
  101. bkeep_munmap(brk_region, brk_max_size, flags);
  102. return -ENOMEM;
  103. }
  104. ADD_PROFILE_OCCURENCE(brk, brk_max_size);
  105. INC_PROFILE_OCCURENCE(brk_count);
  106. end_brk_region = brk_region + BRK_SIZE;
  107. region.brk_start = brk_region;
  108. region.brk_end = end_brk_region;
  109. region.brk_current = brk_region;
  110. debug("brk area: %p - %p\n", brk_region, end_brk_region);
  111. debug("brk reserved area: %p - %p\n", end_brk_region,
  112. brk_region + brk_max_size);
  113. /*
  114. * Create another bookkeeping for the current brk region. The remaining
  115. * space will be marked as unmapped so that the library OS can reuse the
  116. * space for other purpose.
  117. */
  118. if (bkeep_mmap(brk_region, BRK_SIZE, PROT_READ|PROT_WRITE, flags,
  119. NULL, 0, "brk") < 0)
  120. bug();
  121. return 0;
  122. }
  123. int reset_brk (void)
  124. {
  125. master_lock();
  126. if (!region.brk_start) {
  127. master_unlock();
  128. return 0;
  129. }
  130. int ret = shim_do_munmap(region.brk_start,
  131. region.brk_end - region.brk_start);
  132. if (ret < 0) {
  133. master_unlock();
  134. return ret;
  135. }
  136. region.brk_start = region.brk_end = region.brk_current = NULL;
  137. master_unlock();
  138. return 0;
  139. }
  140. void * shim_do_brk (void * brk)
  141. {
  142. master_lock();
  143. if (init_brk_region(NULL) < 0) {
  144. debug("Failed to initialize brk!\n");
  145. brk = NULL;
  146. goto out;
  147. }
  148. if (!brk) {
  149. unchanged:
  150. brk = region.brk_current;
  151. goto out;
  152. }
  153. if (brk < region.brk_start)
  154. goto unchanged;
  155. if (brk > region.brk_end) {
  156. if (brk > region.brk_start + brk_max_size)
  157. goto unchanged;
  158. void * brk_end = region.brk_end;
  159. while (brk_end < brk)
  160. brk_end += BRK_SIZE;
  161. debug("brk area: %p - %p\n", region.brk_start, brk_end);
  162. debug("brk reserved area: %p - %p\n", brk_end,
  163. region.brk_start + brk_max_size);
  164. bkeep_mmap(region.brk_start, brk_end - region.brk_start,
  165. PROT_READ|PROT_WRITE,
  166. MAP_ANONYMOUS|MAP_PRIVATE, NULL, 0, "brk");
  167. region.brk_current = brk;
  168. region.brk_end = brk_end;
  169. goto out;
  170. }
  171. region.brk_current = brk;
  172. out:
  173. master_unlock();
  174. return brk;
  175. }
  176. BEGIN_CP_FUNC(brk)
  177. {
  178. if (region.brk_start) {
  179. ADD_CP_FUNC_ENTRY(region.brk_start);
  180. ADD_CP_ENTRY(ADDR, region.brk_current);
  181. ADD_CP_ENTRY(SIZE, region.brk_end - region.brk_start);
  182. assert(brk_max_size);
  183. ADD_CP_ENTRY(SIZE, brk_max_size);
  184. }
  185. }
  186. END_CP_FUNC(bek)
  187. BEGIN_RS_FUNC(brk)
  188. {
  189. region.brk_start = (void *) GET_CP_FUNC_ENTRY();
  190. region.brk_current = (void *) GET_CP_ENTRY(ADDR);
  191. region.brk_end = region.brk_start + GET_CP_ENTRY(SIZE);
  192. brk_max_size = GET_CP_ENTRY(SIZE);
  193. debug("brk area: %p - %p\n", region.brk_start, region.brk_end);
  194. size_t brk_size = region.brk_end - region.brk_start;
  195. if (brk_size < brk_max_size) {
  196. void * alloc_addr = region.brk_end;
  197. size_t alloc_size = brk_max_size - brk_size;
  198. struct shim_vma_val vma;
  199. if (!lookup_overlap_vma(alloc_addr, alloc_size, &vma)) {
  200. /* if memory are already allocated here, adjust brk_max_size */
  201. alloc_size = vma.addr - alloc_addr;
  202. brk_max_size = brk_size + alloc_size;
  203. }
  204. int ret = bkeep_mmap(alloc_addr, alloc_size,
  205. PROT_READ|PROT_WRITE,
  206. MAP_ANONYMOUS|MAP_PRIVATE|VMA_UNMAPPED,
  207. NULL, 0, "brk");
  208. if (ret < 0)
  209. return ret;
  210. void * ptr = DkVirtualMemoryAlloc(alloc_addr, alloc_size, 0,
  211. PAL_PROT_READ|PAL_PROT_WRITE);
  212. assert(ptr == alloc_addr);
  213. ADD_PROFILE_OCCURENCE(brk, alloc_size);
  214. INC_PROFILE_OCCURENCE(brk_migrate_count);
  215. debug("brk reserved area: %p - %p\n", alloc_addr,
  216. alloc_addr + alloc_size);
  217. }
  218. DEBUG_RS("current=%p,region=%p-%p", region.brk_current, region.brk_start,
  219. region.brk_end);
  220. }
  221. END_RS_FUNC(brk)