quinn-os/my-basic
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

*fixed a memory pool sorting issue.

Browse Source
This commit is contained in:
Wang Renxin 2015-10-13 11:17:04 +08:00
parent 7c5dce6454
commit acb6298243
1 changed files with 10 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
shell/main.c
View File

@ -147,6 +147,15 @@ static long alloc_bytes = 0;
#define _POOL_NODE_SIZE(s) (*((_pool_chunk_size_t*)(s - sizeof(_pool_tag_t)))) #define _POOL_NODE_SIZE(s) (*((_pool_chunk_size_t*)(s - sizeof(_pool_tag_t))))
#define _POOL_NODE_FREE(s) free(_POOL_NODE_PTR(s)) #define _POOL_NODE_FREE(s) free(_POOL_NODE_PTR(s))
static int _cmp_size_t(const void* l, const void* r) {
size_t* pl = (size_t*)l;
size_t* pr = (size_t*)r;
if(*pl > *pr) return 1;
else if(*pl < *pr) return -1;
else return 0;
}
static void _open_mem_pool(void) { static void _open_mem_pool(void) {
#define N 19 #define N 19
size_t szs[N]; size_t szs[N];
@ -193,6 +202,7 @@ static void _open_mem_pool(void) {
} }
} }
} }
qsort(lst, pool_count, sizeof(lst[0]), _cmp_size_t);
pool = (_pool_t*)malloc(sizeof(_pool_t) * pool_count); pool = (_pool_t*)malloc(sizeof(_pool_t) * pool_count);
for(i = 0; i < pool_count; i++) { for(i = 0; i < pool_count; i++) {