Skip to content

Latest commit

 

History

History
37 lines (24 loc) · 875 Bytes

File metadata and controls

37 lines (24 loc) · 875 Bytes

list

table of content

1 list allocation

allows to organize sequential access to underlying memory (FIFO/LIFO)

^

1.1 metadata-free allocation

allocation without metadata being written to the data memory pool except for some static data structures or pointers.

^

1.2 in-place metadata allocation

allocation where sensitive allocation metadata is placed in the same memory pool where allocated data reside. list metadata and data constructs a recurrent data structure. i.e.

^

struct stack_element {
    /* points to next node */
    stack_ptr next;
    /* data */
    void* data;
};