#define CLASS_LEN(class) (sizeof(class) / sizeof(class[0]))
-static char piles_names[][PILE_NAME_MAXLEN] = {
- "valloc_8", "valloc_16", "valloc_32", "valloc_64",
- "valloc_128", "valloc_256", "valloc_512", "valloc_1k",
- "valloc_2k", "valloc_4k", "valloc_8k"
-};
-
-static char piles_names_dma[][PILE_NAME_MAXLEN] = {
- "valloc_dma_128", "valloc_dma_256", "valloc_dma_512",
- "valloc_dma_1k", "valloc_dma_2k", "valloc_dma_4k"
-};
+static char piles_names[][PILE_NAME_MAXLEN] = {"valloc_8",
+ "valloc_16",
+ "valloc_32",
+ "valloc_64",
+ "valloc_128",
+ "valloc_256",
+ "valloc_512",
+ "valloc_1k",
+ "valloc_2k",
+ "valloc_4k",
+ "valloc_8k"};
+
+static char piles_names_dma[][PILE_NAME_MAXLEN] = {"valloc_dma_128",
+ "valloc_dma_256",
+ "valloc_dma_512",
+ "valloc_dma_1k",
+ "valloc_dma_2k",
+ "valloc_dma_4k"};
static struct cake_pile* piles[CLASS_LEN(piles_names)];
static struct cake_pile* piles_dma[CLASS_LEN(piles_names_dma)];
for (size_t i = 0; i < CLASS_LEN(piles_names_dma); i++) {
int size = 1 << (i + 7);
piles_dma[i] = cake_new_pile(
- piles_names_dma[i], size, size > 1024 ? 4 : 1, PILE_CACHELINE);
+ piles_names_dma[i], size, size > 1024 ? 4 : 1, PILE_ALIGN_CACHE);
}
}
i -= boffset;
if (i >= len)
- return NULL;
+ i = 0;
return cake_grab(segregate_list[i]);
}
vcalloc(unsigned int size, unsigned int count)
{
unsigned int alloc_size;
- if (__builtin_umul_overflow(size, count, &alloc_size)) {
+ if (umul_overflow(size, count, &alloc_size)) {
return 0;
}
__vfree(ptr, piles, CLASS_LEN(piles_names));
}
+void
+vfree_safe(void* ptr)
+{
+ if (!ptr) {
+ return;
+ }
+
+ __vfree(ptr, piles, CLASS_LEN(piles_names));
+}
+
void*
valloc_dma(unsigned int size)
{
vfree_dma(void* ptr)
{
__vfree(ptr, piles_dma, CLASS_LEN(piles_names_dma));
+}
+
+inline void must_inline
+valloc_ensure_valid(void* ptr) {
+ cake_ensure_valid(ptr);
}
\ No newline at end of file