Searched hist:cc5981b239d3f1d1ef4cffa3d8cdd407c4c7ef79 (Results 1 – 3 of 3) sorted by relevance
| /optee_os/lib/libutils/isoc/ |
| H A D | bget.h | cc5981b239d3f1d1ef4cffa3d8cdd407c4c7ef79 Mon Dec 28 20:52:33 UTC 2020 Jens Wiklander <jens.wiklander@linaro.org> libutil: add alignment parameter to bget
Adds alignment parameter to bget(), bgetz() and bgetr(). If alignment is
larger then 0 the returned buffer is guaranteed to have an address which
is a multiple of this value.
The algorithm is basically unchanged, in the way that the memory is
still allocated from the end of a free memory block. The difference is
in the core implementation in bget() where now alignment of the returned
memory is taken into account. If only allocating with the minimum
alignment the memory blocks are expected to be allocated in the same
pattern.
Acked-by: Etienne Carriere <etienne.carriere@linaro.org>
Signed-off-by: Jens Wiklander <jens.wiklander@linaro.org>
|
| H A D | bget.c | cc5981b239d3f1d1ef4cffa3d8cdd407c4c7ef79 Mon Dec 28 20:52:33 UTC 2020 Jens Wiklander <jens.wiklander@linaro.org> libutil: add alignment parameter to bget
Adds alignment parameter to bget(), bgetz() and bgetr(). If alignment is
larger then 0 the returned buffer is guaranteed to have an address which
is a multiple of this value.
The algorithm is basically unchanged, in the way that the memory is
still allocated from the end of a free memory block. The difference is
in the core implementation in bget() where now alignment of the returned
memory is taken into account. If only allocating with the minimum
alignment the memory blocks are expected to be allocated in the same
pattern.
Acked-by: Etienne Carriere <etienne.carriere@linaro.org>
Signed-off-by: Jens Wiklander <jens.wiklander@linaro.org>
|
| H A D | bget_malloc.c | cc5981b239d3f1d1ef4cffa3d8cdd407c4c7ef79 Mon Dec 28 20:52:33 UTC 2020 Jens Wiklander <jens.wiklander@linaro.org> libutil: add alignment parameter to bget
Adds alignment parameter to bget(), bgetz() and bgetr(). If alignment is
larger then 0 the returned buffer is guaranteed to have an address which
is a multiple of this value.
The algorithm is basically unchanged, in the way that the memory is
still allocated from the end of a free memory block. The difference is
in the core implementation in bget() where now alignment of the returned
memory is taken into account. If only allocating with the minimum
alignment the memory blocks are expected to be allocated in the same
pattern.
Acked-by: Etienne Carriere <etienne.carriere@linaro.org>
Signed-off-by: Jens Wiklander <jens.wiklander@linaro.org>
|