Linux preempt-rt

Check our new training course

Real-Time Linux with PREEMPT_RT

Check our new training course
with Creative Commons CC-BY-SA
lecture and lab materials

## Elixir Cross Referencer

 ``` 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51``` ```/* * Copyright (c) 2016 Nordic Semiconductor ASA * Copyright (c) 2016 Vinayak Kariappa Chettimada * * SPDX-License-Identifier: Apache-2.0 */ #ifndef MALIGN /** * @brief Force compiler to place memory at-least on a x-byte boundary * @details Compiler extension. Supported by GCC and Clang */ #define MALIGN(x) __attribute__((aligned(x))) #endif #ifndef MROUND /** * @brief Round up to nearest multiple of 4, for unsigned integers * @details * The addition of 3 forces x into the next multiple of 4. This is responsible * for the rounding in the the next step, to be Up. * For ANDing of ~3: We observe y & (~3) == (y>>2)<<2, and we recognize * (y>>2) as a floored division, which is almost undone by the left-shift. The * flooring can't be undone so have achieved a rounding. * * Examples: * MROUND( 0) = 0 * MROUND( 1) = 4 * MROUND( 2) = 4 * MROUND( 3) = 4 * MROUND( 4) = 4 * MROUND( 5) = 8 * MROUND( 8) = 8 * MROUND( 9) = 12 * MROUND(13) = 16 */ #define MROUND(x) (((u32_t)(x)+3) & (~((u32_t)3))) #endif void mem_init(void *mem_pool, u16_t mem_size, u16_t mem_count, void **mem_head); void *mem_acquire(void **mem_head); void mem_release(void *mem, void **mem_head); u16_t mem_free_count_get(void *mem_head); void *mem_get(void *mem_pool, u16_t mem_size, u16_t index); u16_t mem_index_get(void *mem, void *mem_pool, u16_t mem_size); void mem_rcopy(u8_t *dst, u8_t const *src, u16_t len); u8_t mem_nz(u8_t *src, u16_t len); u32_t mem_ut(void); ```