slabmgr.h 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392
  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 OSCAR lab, 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 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 General Public License for more details.
  13. You should have received a copy of the GNU General Public License
  14. along with this program. If not, see <http://www.gnu.org/licenses/>. */
  15. /*
  16. * slabmgr.h
  17. *
  18. * This file contains implementation of SLAB (variable-size) memory allocator.
  19. */
  20. #ifndef SLABMGR_H
  21. #define SLABMGR_H
  22. #include "linux_list.h"
  23. #include <sys/mman.h>
  24. #ifndef system_malloc
  25. #error "macro \"void * system_malloc(int size)\" not declared"
  26. #endif
  27. #ifndef system_free
  28. #error "macro \"void * system_free(void * ptr, int size)\" not declared"
  29. #endif
  30. #ifndef system_lock
  31. #define system_lock() ({})
  32. #endif
  33. #ifndef system_unlock
  34. #define system_unlock() ({})
  35. #endif
  36. #define SLAB_PADDING 7
  37. typedef struct __attribute__((packed)) slab_obj {
  38. unsigned char level;
  39. unsigned char padding[SLAB_PADDING];
  40. union {
  41. struct list_head __list;
  42. unsigned char *raw;
  43. };
  44. } SLAB_OBJ_TYPE, * SLAB_OBJ;
  45. typedef struct __attribute__((packed)) slab_area {
  46. struct list_head __list;
  47. unsigned int size;
  48. unsigned char raw[];
  49. } SLAB_AREA_TYPE, * SLAB_AREA;
  50. #ifdef SLAB_DEBUG
  51. struct slab_debug {
  52. struct {
  53. const char * file;
  54. int line;
  55. } alloc, free;
  56. };
  57. # define SLAB_DEBUG_SIZE sizeof(struct slab_debug)
  58. #else
  59. # define SLAB_DEBUG_SIZE 0
  60. #endif
  61. #ifdef SLAB_CANARY
  62. # define SLAB_CANARY_STRING 0xDEADBEEF
  63. # define SLAB_CANARY_SIZE sizeof(unsigned long)
  64. #else
  65. # define SLAB_CANARY_SIZE 0
  66. #endif
  67. #define SLAB_HDR_SIZE (sizeof(SLAB_OBJ_TYPE) - sizeof(struct list_head) + \
  68. SLAB_DEBUG_SIZE + SLAB_CANARY_SIZE)
  69. #ifndef SLAB_LEVEL
  70. #define SLAB_LEVEL 8
  71. #endif
  72. #ifndef SLAB_LEVEL_SIZES
  73. # define SLAB_LEVEL_SIZES 16, 32, 64, \
  74. 128 - SLAB_HDR_SIZE, \
  75. 256 - SLAB_HDR_SIZE, \
  76. 512 - SLAB_HDR_SIZE, \
  77. 1024 - SLAB_HDR_SIZE, \
  78. 2048 - SLAB_HDR_SIZE
  79. # define SLAB_LEVELS_SUM (4080 - SLAB_HDR_SIZE * 5)
  80. #else
  81. # ifndef SLAB_LEVELS_SUM
  82. # error "SALB_LEVELS_SUM not defined"
  83. # endif
  84. #endif
  85. static int slab_levels[SLAB_LEVEL] = { SLAB_LEVEL_SIZES };
  86. typedef struct slab_mgr {
  87. struct list_head area_list[SLAB_LEVEL];
  88. struct list_head free_list[SLAB_LEVEL];
  89. unsigned int size[SLAB_LEVEL];
  90. void * addr[SLAB_LEVEL], * addr_top[SLAB_LEVEL];
  91. } SLAB_MGR_TYPE, * SLAB_MGR;
  92. typedef struct __attribute__((packed)) large_mem_obj {
  93. unsigned long size;
  94. unsigned char level;
  95. unsigned char padding[SLAB_PADDING];
  96. unsigned char raw[];
  97. } LARGE_MEM_OBJ_TYPE, * LARGE_MEM_OBJ;
  98. #define OBJ_LEVEL(obj) ((obj)->level)
  99. #define OBJ_RAW(obj) (&(obj)->raw)
  100. #define RAW_TO_LEVEL(raw_ptr) \
  101. (*((unsigned char *) (raw_ptr) - SLAB_PADDING - 1))
  102. #define RAW_TO_OBJ(raw_ptr, type) container_of((raw_ptr), type, raw)
  103. #define __SUM_OBJ_SIZE(slab_size, size) \
  104. (((slab_size) + SLAB_HDR_SIZE) * (size))
  105. #define __MIN_MEM_SIZE() (sizeof(SLAB_AREA_TYPE))
  106. #define __MAX_MEM_SIZE(slab_size, size) \
  107. (__MIN_MEM_SIZE() + __SUM_OBJ_SIZE((slab_size), (size)))
  108. #define __INIT_SUM_OBJ_SIZE(size) \
  109. ((SLAB_LEVELS_SUM + SLAB_HDR_SIZE * SLAB_LEVEL) * (size))
  110. #define __INIT_MIN_MEM_SIZE() \
  111. (sizeof(SLAB_MGR_TYPE) + sizeof(SLAB_AREA_TYPE) * SLAB_LEVEL)
  112. #define __INIT_MAX_MEM_SIZE(size) \
  113. (__INIT_MIN_MEM_SIZE() + __INIT_SUM_OBJ_SIZE((size)))
  114. #ifdef PAGE_SIZE
  115. static inline int size_align_down(int slab_size, int size)
  116. {
  117. int s = __MAX_MEM_SIZE(slab_size, size);
  118. int p = s - (s & ~(PAGE_SIZE - 1));
  119. int o = __SUM_OBJ_SIZE(slab_size, 1);
  120. return size - p / o - (p % o ? 1 : 0);
  121. }
  122. static inline int size_align_up(int slab_size, int size)
  123. {
  124. int s = __MAX_MEM_SIZE(slab_size, size);
  125. int p = ((s + PAGE_SIZE - 1) & ~(PAGE_SIZE - 1)) - s;
  126. int o = __SUM_OBJ_SIZE(slab_size, 1);
  127. return size + p / o;
  128. }
  129. static inline int init_align_down(int size)
  130. {
  131. int s = __INIT_MAX_MEM_SIZE(size);
  132. int p = s - (s & ~(PAGE_SIZE - 1));
  133. int o = __INIT_SUM_OBJ_SIZE(1);
  134. return size - p /o - (p % o ? 1 : 0);
  135. }
  136. static inline int init_size_align_up(int size)
  137. {
  138. int s = __INIT_MAX_MEM_SIZE(size);
  139. int p = ((s + PAGE_SIZE - 1) & ~(PAGE_SIZE - 1)) - s;
  140. int o = __INIT_SUM_OBJ_SIZE(1);
  141. return size + p / o;
  142. }
  143. #endif /* PAGE_SIZE */
  144. #ifndef STARTUP_SIZE
  145. # define STARTUP_SIZE 16
  146. #endif
  147. static inline void __set_free_slab_area (SLAB_AREA area, SLAB_MGR mgr,
  148. int level)
  149. {
  150. int slab_size = slab_levels[level] + SLAB_HDR_SIZE;
  151. mgr->addr[level] = (void *) area->raw;
  152. mgr->addr_top[level] = (void *) area->raw + area->size * slab_size;
  153. mgr->size[level] += area->size;
  154. }
  155. static inline SLAB_MGR create_slab_mgr (void)
  156. {
  157. #ifdef PAGE_SIZE
  158. int size = init_size_align_up(STARTUP_SIZE);
  159. #else
  160. int size = STARTUP_SIZE;
  161. #endif
  162. unsigned long mem;
  163. SLAB_AREA area;
  164. SLAB_MGR mgr;
  165. mem = (unsigned long) system_malloc(__INIT_MAX_MEM_SIZE(size));
  166. if (mem <= 0)
  167. return NULL;
  168. mgr = (SLAB_MGR) mem;
  169. void * addr = (void *) mgr + sizeof(SLAB_MGR_TYPE);
  170. int i;
  171. for (i = 0 ; i < SLAB_LEVEL ; i++) {
  172. area = (SLAB_AREA) addr;
  173. area->size = STARTUP_SIZE;
  174. INIT_LIST_HEAD(&area->__list);
  175. INIT_LIST_HEAD(&mgr->area_list[i]);
  176. list_add_tail(&area->__list, &mgr->area_list[i]);
  177. INIT_LIST_HEAD(&mgr->free_list[i]);
  178. mgr->size[i] = 0;
  179. __set_free_slab_area(area, mgr, i);
  180. addr += __MAX_MEM_SIZE(slab_levels[i], STARTUP_SIZE);
  181. }
  182. return mgr;
  183. }
  184. static inline void destroy_slab_mgr (SLAB_MGR mgr)
  185. {
  186. void * addr = (void *) mgr + sizeof(SLAB_MGR_TYPE);
  187. SLAB_AREA area, tmp, n;
  188. int i;
  189. for (i = 0 ; i < SLAB_LEVEL; i++) {
  190. area = (SLAB_AREA) addr;
  191. list_for_each_entry_safe(tmp, n, &mgr->area_list[i], __list) {
  192. if (tmp != area)
  193. system_free(area,
  194. __MAX_MEM_SIZE(slab_levels[i], area->size));
  195. }
  196. addr += __MAX_MEM_SIZE(slab_levels[i], STARTUP_SIZE);
  197. }
  198. system_free(mgr, addr - (void *) mgr);
  199. }
  200. static inline SLAB_MGR enlarge_slab_mgr (SLAB_MGR mgr, int level)
  201. {
  202. SLAB_AREA area;
  203. int size;
  204. if (level >= SLAB_LEVEL) {
  205. system_lock();
  206. goto out;
  207. }
  208. size = mgr->size[level];
  209. area = (SLAB_AREA) system_malloc(__MAX_MEM_SIZE(slab_levels[level], size));
  210. if (area <= 0)
  211. return NULL;
  212. system_lock();
  213. area->size = size;
  214. INIT_LIST_HEAD(&area->__list);
  215. list_add(&area->__list, &mgr->area_list[level]);
  216. __set_free_slab_area(area, mgr, level);
  217. system_unlock();
  218. out:
  219. return mgr;
  220. }
  221. static inline void * slab_alloc (SLAB_MGR mgr, int size)
  222. {
  223. SLAB_OBJ mobj;
  224. int i;
  225. int level = -1;
  226. for (i = 0 ; i < SLAB_LEVEL ; i++)
  227. if (size <= slab_levels[i]) {
  228. level = i;
  229. break;
  230. }
  231. if (level == -1) {
  232. LARGE_MEM_OBJ mem = (LARGE_MEM_OBJ)
  233. system_malloc(sizeof(LARGE_MEM_OBJ_TYPE) + size);
  234. if (!mem)
  235. return NULL;
  236. mem->size = size;
  237. OBJ_LEVEL(mem) = (unsigned char) -1;
  238. return OBJ_RAW(mem);
  239. }
  240. system_lock();
  241. if (mgr->addr[level] == mgr->addr_top[level] &&
  242. list_empty(&mgr->free_list[level])) {
  243. system_unlock();
  244. enlarge_slab_mgr(mgr, level);
  245. system_lock();
  246. }
  247. if (!list_empty(&mgr->free_list[level])) {
  248. mobj = list_first_entry(&mgr->free_list[level], SLAB_OBJ_TYPE, __list);
  249. list_del(&mobj->__list);
  250. } else {
  251. mobj = (void *) mgr->addr[level];
  252. mgr->addr[level] += slab_levels[level] + SLAB_HDR_SIZE;
  253. }
  254. OBJ_LEVEL(mobj) = level;
  255. system_unlock();
  256. #ifdef SLAB_CANARY
  257. unsigned long * m =
  258. (unsigned long *) ((void *) OBJ_RAW(mobj) + slab_levels[level]);
  259. *m = SLAB_CANARY_STRING;
  260. #endif
  261. return OBJ_RAW(mobj);
  262. }
  263. #ifdef SLAB_DEBUG
  264. static inline void * slab_alloc_debug (SLAB_MGR mgr, int size,
  265. const char * file, int line)
  266. {
  267. void * mem = slab_alloc(mgr, size);
  268. int i;
  269. int level = -1;
  270. for (i = 0 ; i < SLAB_LEVEL ; i++)
  271. if (size <= slab_levels[i]) {
  272. level = i;
  273. break;
  274. }
  275. if (level != -1) {
  276. struct slab_debug * debug =
  277. (struct slab_debug *) (mem + slab_levels[level] +
  278. SLAB_CANARY_SIZE);
  279. debug->alloc.file = file;
  280. debug->alloc.line = line;
  281. }
  282. return mem;
  283. }
  284. #endif
  285. static inline void slab_free (SLAB_MGR mgr, void * obj)
  286. {
  287. unsigned char level = RAW_TO_LEVEL(obj);
  288. if (level == (unsigned char) -1) {
  289. LARGE_MEM_OBJ mem = RAW_TO_OBJ(obj, LARGE_MEM_OBJ_TYPE);
  290. system_free(mem, mem->size + sizeof(LARGE_MEM_OBJ_TYPE));
  291. return;
  292. }
  293. if (level >= SLAB_LEVEL)
  294. return;
  295. #ifdef SLAB_CANARY
  296. unsigned long * m = (unsigned long *) (obj + slab_levels[level]);
  297. assert((*m) == SLAB_CANARY_STRING);
  298. #endif
  299. SLAB_OBJ mobj = RAW_TO_OBJ(obj, SLAB_OBJ_TYPE);
  300. system_lock();
  301. INIT_LIST_HEAD(&mobj->__list);
  302. list_add_tail(&mobj->__list, &mgr->free_list[level]);
  303. system_unlock();
  304. }
  305. #ifdef SLAB_DEBUG
  306. static inline void slab_free_debug (SLAB_MGR mgr, void * obj,
  307. const char * file, int line)
  308. {
  309. unsigned char level = RAW_TO_LEVEL(obj);
  310. if (level < SLAB_LEVEL) {
  311. struct slab_debug * debug =
  312. (struct slab_debug *) (obj + slab_levels[level] +
  313. SLAB_CANARY_SIZE);
  314. debug->free.file = file;
  315. debug->free.line = line;
  316. }
  317. slab_free(mgr, obj);
  318. }
  319. #endif
  320. #endif /* SLABMGR_H */