mirror of
https://github.com/Ai-Thinker-Open/Ai-Thinker-Open_RTL8710BX_ALIOS_SDK.git
synced 2025-07-31 19:31:05 +00:00
rel_1.6.0 init
This commit is contained in:
commit
27b3e2883d
19359 changed files with 8093121 additions and 0 deletions
92
Living_SDK/kernel/modules/mm/tlsf/README.md
Normal file
92
Living_SDK/kernel/modules/mm/tlsf/README.md
Normal file
|
|
@ -0,0 +1,92 @@
|
|||
# tlsf
|
||||
Two-Level Segregated Fit memory allocator implementation.
|
||||
Written by Matthew Conte (matt@baisoku.org).
|
||||
Released under the BSD license.
|
||||
|
||||
Features
|
||||
--------
|
||||
* O(1) cost for malloc, free, realloc, memalign
|
||||
* Extremely low overhead per allocation (4 bytes)
|
||||
* Low overhead per TLSF management of pools (~3kB)
|
||||
* Low fragmentation
|
||||
* Compiles to only a few kB of code and data
|
||||
* Support for adding and removing memory pool regions on the fly
|
||||
|
||||
Caveats
|
||||
-------
|
||||
* Currently, assumes architecture can make 4-byte aligned accesses
|
||||
* Not designed to be thread safe; the user must provide this
|
||||
|
||||
Notes
|
||||
-----
|
||||
This code was based on the TLSF 1.4 spec and documentation found at:
|
||||
|
||||
http://www.gii.upv.es/tlsf/main/docs
|
||||
|
||||
It also leverages the TLSF 2.0 improvement to shrink the per-block overhead from 8 to 4 bytes.
|
||||
|
||||
History
|
||||
-------
|
||||
2016/04/10 - v3.1
|
||||
* Code moved to github
|
||||
* tlsfbits.h rolled into tlsf.c
|
||||
* License changed to BSD
|
||||
|
||||
2014/02/08 - v3.0
|
||||
* This version is based on improvements from 3DInteractive GmbH
|
||||
* Interface changed to allow more than one memory pool
|
||||
* Separated pool handling from control structure (adding, removing, debugging)
|
||||
* Control structure and pools can still be constructed in the same memory block
|
||||
* Memory blocks for control structure and pools are checked for alignment
|
||||
* Added functions to retrieve control structure size, alignment size, min and max block size, overhead of pool structure, and overhead of a single allocation
|
||||
* Minimal Pool size is tlsf_block_size_min() + tlsf_pool_overhead()
|
||||
* Pool must be empty when it is removed, in order to allow O(1) removal
|
||||
|
||||
2011/10/20 - v2.0
|
||||
* 64-bit support
|
||||
* More compiler intrinsics for ffs/fls
|
||||
* ffs/fls verification during TLSF creation in debug builds
|
||||
|
||||
2008/04/04 - v1.9
|
||||
* Add tlsf_heap_check, a heap integrity check
|
||||
* Support a predefined tlsf_assert macro
|
||||
* Fix realloc case where block should shrink; if adjacent block is in use, execution would go down the slow path
|
||||
|
||||
2007/02/08 - v1.8
|
||||
* Fix for unnecessary reallocation in tlsf_realloc
|
||||
|
||||
2007/02/03 - v1.7
|
||||
* tlsf_heap_walk takes a callback
|
||||
* tlsf_realloc now returns NULL on failure
|
||||
* tlsf_memalign optimization for 4-byte alignment
|
||||
* Usage of size_t where appropriate
|
||||
|
||||
2006/11/21 - v1.6
|
||||
* ffs/fls broken out into tlsfbits.h
|
||||
* tlsf_overhead queries per-pool overhead
|
||||
|
||||
2006/11/07 - v1.5
|
||||
* Smart realloc implementation
|
||||
* Smart memalign implementation
|
||||
|
||||
2006/10/11 - v1.4
|
||||
* Add some ffs/fls implementations
|
||||
* Minor code footprint reduction
|
||||
|
||||
2006/09/14 - v1.3
|
||||
* Profiling indicates heavy use of blocks of size 1-128, so implement small block handling
|
||||
* Reduce pool overhead by about 1kb
|
||||
* Reduce minimum block size from 32 to 12 bytes
|
||||
* Realloc bug fix
|
||||
|
||||
2006/09/09 - v1.2
|
||||
* Add tlsf_block_size
|
||||
* Static assertion mechanism for invariants
|
||||
* Minor bugfixes
|
||||
|
||||
2006/09/01 - v1.1
|
||||
* Add tlsf_realloc
|
||||
* Add tlsf_walk_heap
|
||||
|
||||
2006/08/25 - v1.0
|
||||
* First release
|
||||
1265
Living_SDK/kernel/modules/mm/tlsf/tlsf.c
Normal file
1265
Living_SDK/kernel/modules/mm/tlsf/tlsf.c
Normal file
File diff suppressed because it is too large
Load diff
90
Living_SDK/kernel/modules/mm/tlsf/tlsf.h
Normal file
90
Living_SDK/kernel/modules/mm/tlsf/tlsf.h
Normal file
|
|
@ -0,0 +1,90 @@
|
|||
#ifndef INCLUDED_tlsf
|
||||
#define INCLUDED_tlsf
|
||||
|
||||
/*
|
||||
** Two Level Segregated Fit memory allocator, version 3.1.
|
||||
** Written by Matthew Conte
|
||||
** http://tlsf.baisoku.org
|
||||
**
|
||||
** Based on the original documentation by Miguel Masmano:
|
||||
** http://www.gii.upv.es/tlsf/main/docs
|
||||
**
|
||||
** This implementation was written to the specification
|
||||
** of the document, therefore no GPL restrictions apply.
|
||||
**
|
||||
** Copyright (c) 2006-2016, Matthew Conte
|
||||
** All rights reserved.
|
||||
**
|
||||
** Redistribution and use in source and binary forms, with or without
|
||||
** modification, are permitted provided that the following conditions are met:
|
||||
** * Redistributions of source code must retain the above copyright
|
||||
** notice, this list of conditions and the following disclaimer.
|
||||
** * Redistributions in binary form must reproduce the above copyright
|
||||
** notice, this list of conditions and the following disclaimer in the
|
||||
** documentation and/or other materials provided with the distribution.
|
||||
** * Neither the name of the copyright holder nor the
|
||||
** names of its contributors may be used to endorse or promote products
|
||||
** derived from this software without specific prior written permission.
|
||||
**
|
||||
** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
||||
** ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
||||
** WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||||
** DISCLAIMED. IN NO EVENT SHALL MATTHEW CONTE BE LIABLE FOR ANY
|
||||
** DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
||||
** (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
||||
** LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
||||
** ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
||||
** SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
#include <stddef.h>
|
||||
|
||||
#if defined(__cplusplus)
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
/* tlsf_t: a TLSF structure. Can contain 1 to N pools. */
|
||||
/* pool_t: a block of memory that TLSF can manage. */
|
||||
typedef void* tlsf_t;
|
||||
typedef void* pool_t;
|
||||
|
||||
/* Create/destroy a memory pool. */
|
||||
tlsf_t tlsf_create(void* mem);
|
||||
tlsf_t tlsf_create_with_pool(void* mem, size_t bytes);
|
||||
void tlsf_destroy(tlsf_t tlsf);
|
||||
pool_t tlsf_get_pool(tlsf_t tlsf);
|
||||
|
||||
/* Add/remove memory pools. */
|
||||
pool_t tlsf_add_pool(tlsf_t tlsf, void* mem, size_t bytes);
|
||||
void tlsf_remove_pool(tlsf_t tlsf, pool_t pool);
|
||||
|
||||
/* malloc/memalign/realloc/free replacements. */
|
||||
void* tlsf_malloc(tlsf_t tlsf, size_t bytes);
|
||||
void* tlsf_memalign(tlsf_t tlsf, size_t align, size_t bytes);
|
||||
void* tlsf_realloc(tlsf_t tlsf, void* ptr, size_t size);
|
||||
void tlsf_free(tlsf_t tlsf, void* ptr);
|
||||
|
||||
/* Returns internal block size, not original request size */
|
||||
size_t tlsf_block_size(void* ptr);
|
||||
|
||||
/* Overheads/limits of internal structures. */
|
||||
size_t tlsf_size(void);
|
||||
size_t tlsf_align_size(void);
|
||||
size_t tlsf_block_size_min(void);
|
||||
size_t tlsf_block_size_max(void);
|
||||
size_t tlsf_pool_overhead(void);
|
||||
size_t tlsf_alloc_overhead(void);
|
||||
|
||||
/* Debugging. */
|
||||
typedef void (*tlsf_walker)(void* ptr, size_t size, int used, void* user);
|
||||
void tlsf_walk_pool(pool_t pool, tlsf_walker walker, void* user);
|
||||
/* Returns nonzero if any internal consistency check fails. */
|
||||
int tlsf_check(tlsf_t tlsf);
|
||||
int tlsf_check_pool(pool_t pool);
|
||||
|
||||
#if defined(__cplusplus)
|
||||
};
|
||||
#endif
|
||||
|
||||
#endif
|
||||
Loading…
Add table
Add a link
Reference in a new issue