|
Veritable Lasagna
An Allocator & Data Structure Library for C.
|
Include dependency graph for vl_memory.c:Macros | |
| #define | VL_MEMORY_ORIGIN_INLINE(headerPtr) (void*)(((vl_uint8_t*)(headerPtr) - ((headerPtr)->headOffset))) |
| Returns the original result of the malloc system call. | |
| #define | VL_MEMORY_HEADER_INLINE(memPtr) ((vl_memory_header*)(memPtr) - 1) |
| Returns a pointer to the specified block of memory Assumes header is stored immediately adjacent to the memory. | |
| #define | vl_MemSortSwap(temp, a, b, memSize) |
Functions | |
| vl_memory * | vlMemAlloc (vl_memsize_t allocSize) |
| Attempts to allocate a block of memory. | |
| vl_memory * | vlMemAllocAligned (vl_memsize_t size, vl_uint_t align) |
| Allocates a block of memory with an alignment. | |
| vl_memory * | vlMemRealloc (vl_memory *mem, vl_memsize_t allocSize) |
| Reallocates the specified block of memory to hold the specified total number of bytes. | |
| vl_memory * | vlMemClone (vl_memory *mem) |
| Clones the specified block of memory, returning a pointer to its new clone. | |
| vl_int_t | vl_MemSortPartition (vl_usmall_t *buffer, void *pivot, void *swap, vl_int_t low, vl_int_t high, vl_memsize_t elementSize, vl_compare_function comparator) |
| void | vl_MemSortQuicksort (vl_int_t *stack, void *buffer, void *pivot, void *swap, vl_memsize_t elementSize, vl_dsidx_t numElements, vl_compare_function comparator) |
| void | vlMemSort (void *buffer, vl_memsize_t elementSize, vl_dsidx_t numElements, vl_compare_function comparator) |
| Sorts the specified buffer in-place according to the specified element and comparator function. | |
| void | vlMemCopyStride (const void *src, vl_dsoffs_t srcStride, void *dest, vl_dsoffs_t dstStride, vl_memsize_t elementSize, vl_dsidx_t numElements) |
| Copies data from one buffer to another, with a stride applied to both. | |
| void | vlMemReverseSubArraysStride (void *src, vl_dsoffs_t srcStride, vl_memsize_t elementSize, vl_dsidx_t numElements) |
| Reverses the bytes in a series of elements of a defined length and stride between them. | |
| vl_uint_t | vlMemAlignment (vl_memory *mem) |
| Returns the alignment of the specified block of memory. | |
| vl_memsize_t | vlMemSize (vl_memory *mem) |
| Returns the size (in total number of bytes) of the specified block of vl_memory. | |
| void | vlMemFree (vl_memory *mem) |
| Frees the specified block of memory. | |
| #define VL_MEMORY_HEADER_INLINE | ( | memPtr | ) | ((vl_memory_header*)(memPtr) - 1) |
Returns a pointer to the specified block of memory Assumes header is stored immediately adjacent to the memory.
| #define VL_MEMORY_ORIGIN_INLINE | ( | headerPtr | ) | (void*)(((vl_uint8_t*)(headerPtr) - ((headerPtr)->headOffset))) |
Returns the original result of the malloc system call.
| #define vl_MemSortSwap | ( | temp, | |
| a, | |||
| b, | |||
| memSize | |||
| ) |
| vl_int_t vl_MemSortPartition | ( | vl_usmall_t * | buffer, |
| void * | pivot, | ||
| void * | swap, | ||
| vl_int_t | low, | ||
| vl_int_t | high, | ||
| vl_memsize_t | elementSize, | ||
| vl_compare_function | comparator | ||
| ) |
Here is the caller graph for this function:| void vl_MemSortQuicksort | ( | vl_int_t * | stack, |
| void * | buffer, | ||
| void * | pivot, | ||
| void * | swap, | ||
| vl_memsize_t | elementSize, | ||
| vl_dsidx_t | numElements, | ||
| vl_compare_function | comparator | ||
| ) |
Here is the call graph for this function:
Here is the caller graph for this function:Returns the alignment of the specified block of memory.
Minimum alignment is defined as VL_DEFAULT_MEMORY_ALIGN, or the largest available word size.
mem pointer must be valid at the time of the call.VL_DEFAULT_MEMORY_ALIGN if mem is NULL.vlMemAlloc or vlMemAllocAligned.| mem | pointer to memory block |
Here is the caller graph for this function:| vl_memory * vlMemAlloc | ( | vl_memsize_t | allocSize | ) |
Attempts to allocate a block of memory.
Returns NULL on failure.
vlMemFree.vlMemFree or vlMemRealloc.malloc.NULL on allocation failure. allocSize is not checked for zero, but malloc(0) is implementation-defined.NULL if the underlying malloc fails.free function instead of vlMemFree.allocSize plus the size of an internal header (vl_memory_header).NULL if allocation failed.| allocSize | size of the allocation, in bytes. |
Here is the caller graph for this function:Allocates a block of memory with an alignment.
Guarantees that the returned pointer will have a value that is a multiple of the specified alignment.
The VL_MEMORY_PAD_UP macro may be used to ensure that the actual length of the memory block is also a multiple of the alignment.
vlMemFree.vlMemFree or vlMemRealloc.malloc.NULL on allocation failure.NULL if the underlying malloc fails.align is not a power of 2.allocSize + align + sizeof(vl_memory_header) to guarantee alignment.NULL if allocation failed.| allocSize | size of the allocation, in bytes. |
| align |
Here is the call graph for this function:
Here is the caller graph for this function:Clones the specified block of memory, returning a pointer to its new clone.
Returns NULL on failure.
If the source block has an alignment, the result will also have an alignment.
vlMemFree.vlMemFree or vlMemRealloc.NULL if mem is NULL or if allocation fails.NULL on allocation failure.vlMemAlloc or vlMemAllocAligned.NULL if cloning failed.| mem | pointer |
Here is the call graph for this function:
Here is the caller graph for this function:| void vlMemCopyStride | ( | const void * | src, |
| vl_dsoffs_t | srcStride, | ||
| void * | dest, | ||
| vl_dsoffs_t | dstStride, | ||
| vl_memsize_t | elementSize, | ||
| vl_dsidx_t | numElements | ||
| ) |
Copies data from one buffer to another, with a stride applied to both.
Stride is the amount of space (in bytes) between each element.
src and dest buffers must remain valid for the duration of the copy.src or dest concurrently where at least one thread is writing.src and dest should not be NULL.srcStride or dstStride allow it, as memcpy is used for individual elements.| src | memory block pointer |
| srcStride | total number of bytes between each element in "src" |
| dest | memory block pointer |
| dstStride | total number of bytes between each element in "dest" |
| elementSize | total number of bytes wide of each element |
| numElements | total number of elements |
| void vlMemFree | ( | vl_memory * | mem | ) |
Frees the specified block of memory.
free.NULL (no-op).vlMemAlloc or vlMemAllocAligned, or double-freeing the same pointer.| mem | pointer to block. |
Here is the caller graph for this function:Reallocates the specified block of memory to hold the specified total number of bytes.
If the specified memory block is explicitly aligned, its alignment is preserved.
mem pointer may become invalid upon success.vlMemFree or another vlMemRealloc.realloc.mem is NULL, this function behaves like vlMemAlloc. If allocSize is zero, behavior is realloc-dependent.NULL if the underlying realloc fails. In this case, the original mem pointer remains valid and its memory is not leaked.vlMemAlloc or vlMemAllocAligned.NULL if reallocation failed.| mem | pointer to block |
| allocSize | new size of the allocation. |
Here is the call graph for this function:
Here is the caller graph for this function:| void vlMemReverseSubArraysStride | ( | void * | src, |
| vl_dsoffs_t | srcStride, | ||
| vl_memsize_t | elementSize, | ||
| vl_dsidx_t | numElements | ||
| ) |
Reverses the bytes in a series of elements of a defined length and stride between them.
This function operates on a sequence of elements (or sub-arrays) within a memory block, where each element is separated by a defined stride. It reverses the bytes of each individual element but does not alter the overall structure of the memory. The elements are processed sequentially, one by one, with each element's bytes reversed in-place.
This is useful when you need to reverse the bytes in each element of a collection of data structures that are tightly packed but may have a varying stride (i.e., distance between consecutive elements in memory).
Example: Suppose we have an array of 32-bit integers, each 4 bytes, with a stride of 8 bytes:
Input (elements of size 4 bytes, stride of 8 bytes): [0xAABBCCDD, 0x11223344, 0x55667788] Memory block: [0xAABBCCDD, pad, 0x11223344, pad, 0x55667788, pad] (Where 'pad' represents the unused memory between elements, i.e., stride.)
Output (each element reversed): [0xDDCCBBAA, 0x44332211, 0x88776655] Memory block: [0xDDCCBBAA, pad, 0x44332211, pad, 0x88776655, pad]
The bytes within each element are reversed, but the stride between elements is respected.
src.src buffer must remain valid for the duration of the operation.src concurrently.src should not be NULL.srcStride or elementSize that leads to out-of-bounds memory access.| src | memory block pointer. The base address of the memory containing the elements to be reversed. |
| srcStride | total number of bytes between each sub-array (or element). This defines the gap between consecutive elements. |
| elementSize | size of each sub-array (or element) in bytes. This is the number of bytes that constitute one element. |
| numElements | total number of sub-arrays (or elements). This is the number of individual elements to process. |
| vl_memsize_t vlMemSize | ( | vl_memory * | mem | ) |
Returns the size (in total number of bytes) of the specified block of vl_memory.
mem pointer must be valid at the time of the call.mem is NULL.vlMemAlloc or vlMemAllocAligned.
Here is the caller graph for this function:| void vlMemSort | ( | void * | buffer, |
| vl_memsize_t | elementSize, | ||
| vl_dsidx_t | numElements, | ||
| vl_compare_function | comparator | ||
| ) |
Sorts the specified buffer in-place according to the specified element and comparator function.
This function implements an iterative Quicksort.
buffer.buffer must remain valid for the duration of the sort.buffer concurrently.buffer must not be NULL. comparator must not be NULL.NULL buffer or comparator. Overlapping memory regions during sort operations.numElements and elementSize.| buffer | |
| elementSize | |
| numElements | |
| comparator |
Here is the call graph for this function: