fed3da9f03
The search algorithm does not work with the ctz approach at all, if there is a free range of granules that does not fit a specific allocation (i.e. the granule allocation is fragmented) it will cause an infinite loop as the algorithm will try to find free space from the same (free) starting granule, causing an infinite loop. The clz approach works for all cases, it will find the last used granule and the search will continue from the next free granule. Also, offsetting a full GAT must be sizeof(gat[0] - 1), which is 31 in this case. The reason is that the upper level search function increments the value by +1. |
||
|---|---|---|
| .. | ||
| iob | ||
| kasan | ||
| kmap | ||
| kmm_heap | ||
| map | ||
| mempool | ||
| mm_gran | ||
| mm_heap | ||
| shm | ||
| tlsf | ||
| ubsan | ||
| umm_heap | ||
| CMakeLists.txt | ||
| Kconfig | ||
| Makefile | ||