1 #include <klibc/string.h>
2 #include <lunaix/mm/cake.h>
3 #include <lunaix/mm/valloc.h>
7 static char piles_names[MAX_CLASS][PILE_NAME_MAXLEN] = {
8 "valloc_16", "valloc_32", "valloc_64",
9 "valloc_128", "valloc_256", "valloc_512"
12 static char piles_names_dma[MAX_CLASS][PILE_NAME_MAXLEN] = {
13 "valloc_dma_128", "valloc_dma_256", "valloc_dma_512",
14 "valloc_dma_1k", "valloc_dma_2k", "valloc_dma_4k"
17 static struct cake_pile* piles[MAX_CLASS];
18 static struct cake_pile* piles_dma[MAX_CLASS];
23 for (size_t i = 0; i < MAX_CLASS; i++) {
24 int size = 1 << (i + 4);
25 piles[i] = cake_new_pile(&piles_names[i], size, 1, 0);
29 for (size_t i = 0; i < MAX_CLASS; i++) {
30 int size = 1 << (i + 7);
31 piles_dma[i] = cake_new_pile(
32 &piles_names_dma[i], size, size > 1024 ? 8 : 1, PILE_CACHELINE);
37 __valloc(unsigned int size, struct cake_pile** segregate_list)
40 for (; i < MAX_CLASS; i++) {
41 if (segregate_list[i]->piece_size >= size) {
49 return cake_grab(segregate_list[i]);
53 __vfree(void* ptr, struct cake_pile** segregate_list)
56 for (; i < MAX_CLASS; i++) {
57 if (cake_release(segregate_list[i], ptr)) {
64 valloc(unsigned int size)
66 return __valloc(size, &piles);
70 vzalloc(unsigned int size)
72 void* ptr = __valloc(size, &piles);
78 vcalloc(unsigned int size, unsigned int count)
80 unsigned int alloc_size;
81 if (__builtin_umul_overflow(size, count, &alloc_size)) {
85 void* ptr = __valloc(alloc_size, &piles);
86 memset(ptr, 0, alloc_size);
97 valloc_dma(unsigned int size)
99 return __valloc(size, &piles_dma);
103 vzalloc_dma(unsigned int size)
105 void* ptr = __valloc(size, &piles_dma);
106 memset(ptr, 0, size);
113 __vfree(ptr, &piles_dma);