ckernel_alloc.h File Reference

#include <stddef.h>
#include <stdint.h>

Go to the source code of this file.

Data Structures
struct	ck_bump_alloc_t

Enumerations
enum	ck_bump_mode_t { CK_BUMP_MODE_UNINITIALIZED = 0 , CK_BUMP_MODE_ANON = 1 , CK_BUMP_MODE_MIXED_FILE_BACKED = 2 }

Functions
void	ck_bump_alloc_free (ck_bump_alloc_t *alloc)
int	ck_bump_alloc_init (ck_bump_alloc_t *alloc, const char *weights_path, size_t total_size, size_t weights_base, size_t activations_base)
int	ck_bump_alloc_needs_weight_materialization (const ck_bump_alloc_t *alloc)
void *	ck_huge_alloc (size_t bytes)
void	ck_huge_free (void *ptr, size_t bytes)

Enumeration Type Documentation

ck_bump_mode_t

enum ck_bump_mode_t

Enumerator
CK_BUMP_MODE_UNINITIALIZED
CK_BUMP_MODE_ANON
CK_BUMP_MODE_MIXED_FILE_BACKED

Definition at line 26 of file ckernel_alloc.h.

             {
    CK_BUMP_MODE_UNINITIALIZED = 0,
    CK_BUMP_MODE_ANON = 1,
    CK_BUMP_MODE_MIXED_FILE_BACKED = 2,
} ck_bump_mode_t;

Function Documentation

ck_bump_alloc_free()

void ck_bump_alloc_free

(

ck_bump_alloc_t *

alloc

)

Definition at line 343 of file ckernel_alloc.c.

{
    if (!alloc || !alloc->base) {
        ck_bump_alloc_reset(alloc);
        return;
    }
 
    if (alloc->mode == CK_BUMP_MODE_MIXED_FILE_BACKED) {
        if (alloc->mapped_len > 0) {
            munmap(alloc->base, alloc->mapped_len);
        }
    } else if (alloc->mode == CK_BUMP_MODE_ANON) {
        ck_huge_free(alloc->base, alloc->total_size);
    }
 
    ck_bump_alloc_reset(alloc);
}

References ck_bump_alloc_t::base, ck_bump_alloc_reset(), CK_BUMP_MODE_ANON, CK_BUMP_MODE_MIXED_FILE_BACKED, ck_huge_free(), ck_bump_alloc_t::mapped_len, ck_bump_alloc_t::mode, and ck_bump_alloc_t::total_size.

ck_bump_alloc_init()

int ck_bump_alloc_init	(	ck_bump_alloc_t *	alloc,
		const char *	weights_path,
		size_t	total_size,
		size_t	weights_base,
		size_t	activations_base
	)

Definition at line 286 of file ckernel_alloc.c.

{
    int force_mixed = 0;
    int disable_mixed = 0;
 
    if (!alloc || total_size == 0 ||
        total_size > SIZE_MAX - (HUGE_PAGE_SIZE - 1)) {
        fprintf(stderr, "ck_bump_alloc_init: invalid arguments\n");
        return -1;
    }
 
    ck_bump_alloc_reset(alloc);
    alloc->total_size = total_size;
    alloc->weights_base = weights_base;
    alloc->activations_base = activations_base;
    force_mixed = env_flag_enabled("CK_BUMP_FORCE_MIXED");
    disable_mixed = env_flag_enabled("CK_BUMP_DISABLE_MIXED");
 
    if (weights_base > activations_base || activations_base > total_size) {
        fprintf(stderr,
                "ck_bump_alloc_init: invalid bump layout weights=%zu activations=%zu total=%zu\n",
                weights_base, activations_base, total_size);
        ck_bump_alloc_reset(alloc);
        return -1;
    }
 
    if (!force_mixed) {
        void *anon = ck_huge_alloc(total_size);
        if (anon) {
            alloc->base = (uint8_t *)anon;
            alloc->mapped_len = align_up_bytes(total_size, HUGE_PAGE_SIZE);
            alloc->mode = CK_BUMP_MODE_ANON;
            return 0;
        }
    }
 
#ifdef __linux__
    if (!disable_mixed) {
        if (ck_bump_alloc_try_mixed(alloc, weights_path) == 0) {
            return 0;
        }
    }
#else
    (void)weights_path;
#endif
 
    fprintf(stderr,
            "ck_bump_alloc_init: failed to allocate bump arena (%zu bytes, %.2f MiB)\n",
            total_size, (double)total_size / (1024.0 * 1024.0));
    ck_bump_alloc_reset(alloc);
    return -1;
}

References ck_bump_alloc_t::activations_base, align_up_bytes(), ck_bump_alloc_t::base, ck_bump_alloc_reset(), CK_BUMP_MODE_ANON, ck_huge_alloc(), env_flag_enabled(), HUGE_PAGE_SIZE, ck_bump_alloc_t::mapped_len, ck_bump_alloc_t::mode, ck_bump_alloc_t::total_size, and ck_bump_alloc_t::weights_base.

ck_bump_alloc_needs_weight_materialization()

int ck_bump_alloc_needs_weight_materialization

(

const ck_bump_alloc_t *

alloc

)

Definition at line 361 of file ckernel_alloc.c.

{
    if (!alloc) {
        return 1;
    }
    return alloc->mode != CK_BUMP_MODE_MIXED_FILE_BACKED;
}

References CK_BUMP_MODE_MIXED_FILE_BACKED, and ck_bump_alloc_t::mode.

ck_huge_alloc()

void * ck_huge_alloc

(

size_t

bytes

)

Allocate a large, contiguous memory region for model weights/activations.

Implementation strategy:

• Try to allocate 2MB-aligned memory backed by huge pages where possible.
• Fall back to aligned_alloc + madvise(MADV_HUGEPAGE) when explicit huge pages are not available.

Returns NULL on failure.

Definition at line 70 of file ckernel_alloc.c.

{
    if (bytes == 0 || bytes > SIZE_MAX - (HUGE_PAGE_SIZE - 1)) {
        errno = ENOMEM;
        return NULL;
    }
    size_t len = align_up_bytes(bytes, HUGE_PAGE_SIZE);
 
    /* First, try explicit huge pages via mmap + MAP_HUGETLB. */
    void *p = mmap(NULL, len,
                   PROT_READ | PROT_WRITE,
                   MAP_PRIVATE | MAP_ANONYMOUS | MAP_HUGETLB,
                   -1, 0);
    if (p != MAP_FAILED) {
        if (!record_allocation(p, len, 1)) {
            munmap(p, len);
            return NULL;
        }
        return p;
    }
 
    /* Fallback: aligned_alloc with transparent hugepage hint. */
    void *q = aligned_alloc(HUGE_PAGE_SIZE, len);
    if (!q) {
        fprintf(stderr, "ck_huge_alloc: aligned_alloc failed for %zu bytes: %s\n",
                len, strerror(errno));
        return NULL;
    }
 
    /* Best-effort hint; ignore errors. */
    (void)madvise(q, len, MADV_HUGEPAGE);
    if (!record_allocation(q, len, 0)) {
        free(q);
        return NULL;
    }
    return q;
}

References align_up_bytes(), align_up_bytes(), align_up_bytes(), align_up_bytes(), HUGE_PAGE_SIZE, record_allocation(), record_allocation(), record_allocation(), and record_allocation().

Referenced by ck_bump_alloc_init().

ck_huge_free()

void ck_huge_free	(	void *	ptr,
		size_t	bytes
	)

Free memory allocated by ck_huge_alloc.

The bytes parameter should be the same size passed to ck_huge_alloc.

Definition at line 108 of file ckernel_alloc.c.

{
    if (!ptr || bytes == 0) {
        return;
    }
 
    ck_huge_alloc_entry_t *entry = detach_allocation(ptr);
    if (!entry) {
        /* Fall back to malloc/free if the allocation wasn't tracked. */
        free(ptr);
        return;
    }
 
    if (entry->was_mmap) {
        munmap(ptr, entry->len);
    } else {
        free(ptr);
    }
 
    free(entry);
}

References detach_allocation(), detach_allocation(), detach_allocation(), and detach_allocation().

Referenced by ck_bump_alloc_free().