database/sqlite
1
0
Fork 0
mirror of https://github.com/sqlite/sqlite.git synced 2025-08-07 02:42:48 +03:00
Code Activity

Modify the memory allocation system in mem3.c so to fit in with the new sqlite3_mem_methods scheme. At this point it only "mostly" works. (CVS 5297)

Browse Source 
FossilOrigin-Name: 3febef548fb1c314336fe4bc359d72a4fe84e84e
This commit is contained in:
danielk1977
2008-06-24 19:02:55 +00:00
parent 6fb6444c3e
commit 57e5ea9327
7 changed files with 335 additions and 264 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
manifest
View File

@@ -1,5 +1,5 @@
C Add\sa\sfew\sextra\stests\sto\sselect9.test.\s(CVS\s5296) C Modify\sthe\smemory\sallocation\ssystem\sin\smem3.c\sso\sto\sfit\sin\swith\sthe\snew\ssqlite3_mem_methods\sscheme.\sAt\sthis\spoint\sit\sonly\s"mostly"\sworks.\s(CVS\s5297)
D 2008-06-24T15:39:44 D 2008-06-24T19:02:55
F Makefile.arm-wince-mingw32ce-gcc ac5f7b2cef0cd850d6f755ba6ee4ab961b1fadf7 F Makefile.arm-wince-mingw32ce-gcc ac5f7b2cef0cd850d6f755ba6ee4ab961b1fadf7
F Makefile.in ff6f90048555a0088f6a4b7406bed5e55a7c4eff F Makefile.in ff6f90048555a0088f6a4b7406bed5e55a7c4eff
F Makefile.linux-gcc d53183f4aa6a9192d249731c90dbdffbd2c68654 F Makefile.linux-gcc d53183f4aa6a9192d249731c90dbdffbd2c68654
@@ -114,12 +114,12 @@ F src/insert.c f8c7da31409ec19a769b960a4a2b9cca7bab80bd
F src/journal.c cffd2cd214e58c0e99c3ff632b3bee6c7cbb260e F src/journal.c cffd2cd214e58c0e99c3ff632b3bee6c7cbb260e
F src/legacy.c 3626c71fb70912abec9a4312beba753a9ce800df F src/legacy.c 3626c71fb70912abec9a4312beba753a9ce800df
F src/loadext.c 40024a0f476c1279494876b9a002001b29e5d3e3 F src/loadext.c 40024a0f476c1279494876b9a002001b29e5d3e3
F src/main.c c5a5b0d7826f9abeb16c75edfae72ec24594ce28 F src/main.c 3f7fd6edaa90bb8905e455156055a212ba77178b
F src/malloc.c f52166df8abd7ff6990dbee1a0ce3534addc8617 F src/malloc.c f52166df8abd7ff6990dbee1a0ce3534addc8617
F src/md5.c 008216bbb5d34c6fbab5357aa68575ad8a31516a F src/md5.c 008216bbb5d34c6fbab5357aa68575ad8a31516a
F src/mem1.c 8340fa5f969e9f9b9bdeb54106457a2003456d2b F src/mem1.c 8340fa5f969e9f9b9bdeb54106457a2003456d2b
F src/mem2.c 23f9538f35fbcd5665afe7056a56be0c7ed65aa7 F src/mem2.c 23f9538f35fbcd5665afe7056a56be0c7ed65aa7
F src/mem3.c 28b4812b87470a00b11821fb5850e7cabcce06c6 F src/mem3.c 62bb1344e648ca70e651f1e994733382e4fe9b4e
F src/mem4.c 6703adb1717b26d9d70a1c2586b4b7b7ffee7909 F src/mem4.c 6703adb1717b26d9d70a1c2586b4b7b7ffee7909
F src/mem5.c ad31a0a481b86b86f4ac0b6d952e69727d4e113a F src/mem5.c ad31a0a481b86b86f4ac0b6d952e69727d4e113a
F src/mutex.c a485a0eac8ee2cd95f66e565b4c6696c18db968f F src/mutex.c a485a0eac8ee2cd95f66e565b4c6696c18db968f
@@ -142,7 +142,7 @@ F src/printf.c 8b063da9dcde26b7c500a01444b718d86f21bc6e
F src/random.c 5c754319d38abdd6acd74601ee0105504adc508a F src/random.c 5c754319d38abdd6acd74601ee0105504adc508a
F src/select.c dfc7e6ba4c987105799372ab7c8b58a305237c01 F src/select.c dfc7e6ba4c987105799372ab7c8b58a305237c01
F src/shell.c 61fa61932ed52825720ebfd3f8381b8d550ef766 F src/shell.c 61fa61932ed52825720ebfd3f8381b8d550ef766
F src/sqlite.h.in 449e75d6c0c00c8f9f0325e2d665bc66a1e6fb83 F src/sqlite.h.in 6a187a16ddcd30590acc54f00dd3edd7dccfe22c
F src/sqlite3ext.h f162a72daef5ebf8b211fe8c0ec96e85d22fbf9b F src/sqlite3ext.h f162a72daef5ebf8b211fe8c0ec96e85d22fbf9b
F src/sqliteInt.h 5ed4ae2a9338533370517a361623e38a125724a4 F src/sqliteInt.h 5ed4ae2a9338533370517a361623e38a125724a4
F src/sqliteLimit.h f435e728c6b620ef7312814d660a81f9356eb5c8 F src/sqliteLimit.h f435e728c6b620ef7312814d660a81f9356eb5c8
@@ -166,7 +166,7 @@ F src/test_devsym.c 6012cb8e3acf812513511025a4fa5d626e0ba19b
F src/test_func.c f4aafa10f17d52c43a64b47717265802e6e552b3 F src/test_func.c f4aafa10f17d52c43a64b47717265802e6e552b3
F src/test_hexio.c 2f1122aa3f012fa0142ee3c36ce5c902a70cd12f F src/test_hexio.c 2f1122aa3f012fa0142ee3c36ce5c902a70cd12f
F src/test_loadext.c df8ab3a6481ddebbdf0d28ebac5d9e0790f7860f F src/test_loadext.c df8ab3a6481ddebbdf0d28ebac5d9e0790f7860f
F src/test_malloc.c 27d4a2c32d2518e106db7837a3d66b0ca8c26a63 F src/test_malloc.c e16aea435daf9e3645951656063bacb5f2ccfd5a
F src/test_md5.c 28209a4e2068711b5443c33104fe41f21d160071 F src/test_md5.c 28209a4e2068711b5443c33104fe41f21d160071
F src/test_mutex.c b1433eb96520656fb3e4a218253a94ac32bd5775 F src/test_mutex.c b1433eb96520656fb3e4a218253a94ac32bd5775
F src/test_onefile.c 1f87d4a21cbfb24a7c35e4333fa0bd34d641f68d F src/test_onefile.c 1f87d4a21cbfb24a7c35e4333fa0bd34d641f68d
@@ -422,7 +422,7 @@ F test/pager2.test c025f91b75fe65e85febda64d9416428b8a5cab5
F test/pager3.test 2323bf27fd5bd887b580247e5bce500ceee994b4 F test/pager3.test 2323bf27fd5bd887b580247e5bce500ceee994b4
F test/pageropt.test 6df72c441db0a037b7ec6990d16311c24fbea77b F test/pageropt.test 6df72c441db0a037b7ec6990d16311c24fbea77b
F test/pagesize.test e0a8b3fe80f8b8e808d94a00734c7a18c76c407e F test/pagesize.test e0a8b3fe80f8b8e808d94a00734c7a18c76c407e
F test/permutations.test eb7373f8dd450b99b8addfdabe820da0cc851e54 F test/permutations.test 794de3d1d3f97b6081f70f51ea26072d9f0b2e42
F test/pragma.test 44bc52afa72cabfeae82641e0033ca24919f3ce8 F test/pragma.test 44bc52afa72cabfeae82641e0033ca24919f3ce8
F test/pragma2.test 5364893491b9231dd170e3459bfc2e2342658b47 F test/pragma2.test 5364893491b9231dd170e3459bfc2e2342658b47
F test/printf.test c3405535b418d454e8a52196a0fc592ec9eec58d F test/printf.test c3405535b418d454e8a52196a0fc592ec9eec58d
@@ -593,7 +593,7 @@ F tool/speedtest16.c c8a9c793df96db7e4933f0852abb7a03d48f2e81
F tool/speedtest2.tcl ee2149167303ba8e95af97873c575c3e0fab58ff F tool/speedtest2.tcl ee2149167303ba8e95af97873c575c3e0fab58ff
F tool/speedtest8.c 1dbced29de5f59ba2ebf877edcadf171540374d1 F tool/speedtest8.c 1dbced29de5f59ba2ebf877edcadf171540374d1
F tool/speedtest8inst1.c 293327bc76823f473684d589a8160bde1f52c14e F tool/speedtest8inst1.c 293327bc76823f473684d589a8160bde1f52c14e
P 95037e6dbf4ed0ffd38790f3270dcaa4c1ae64ed P 37b084fd7d7ad7f13fc9454fc25ca5aed48d4a31
R 879d6fa70b53daac352e6369bd96ed5f R 465c685f9632ada3f1635a03ece5ad9c
U danielk1977 U danielk1977
Z 2e92c316b0879406df658fc531e7ea9a Z 585b6f7015b63e1eb50cf90d6b5f14fd

2
manifest.uuid
View File

@@ -1 +1 @@
37b084fd7d7ad7f13fc9454fc25ca5aed48d4a31 3febef548fb1c314336fe4bc359d72a4fe84e84e

12
src/main.c
View File

@@ -14,7 +14,7 @@
** other files are for internal use by SQLite and should not be ** other files are for internal use by SQLite and should not be
** accessed by users of the library. ** accessed by users of the library.
** **
** $Id: main.c,v 1.458 2008/06/23 14:15:53 danielk1977 Exp $ ** $Id: main.c,v 1.459 2008/06/24 19:02:55 danielk1977 Exp $
*/ */
#include "sqliteInt.h" #include "sqliteInt.h"
#include <ctype.h> #include <ctype.h>
@@ -149,13 +149,21 @@ int sqlite3_config(int op, ...){
sqlite3Config.bFullMutex = 1; sqlite3Config.bFullMutex = 1;
break; break;
} }
#ifdef SQLITE_ENABLE_MEMPOOL
case SQLITE_CONFIG_MEMPOOL: {
u8 *pMem = va_arg(ap, u8*);
int nMem = va_arg(ap, int);
rc = sqlite3MemSetMempool(pMem, nMem);
break;
}
#endif
case SQLITE_CONFIG_MALLOC: { case SQLITE_CONFIG_MALLOC: {
/* Specify an alternative malloc implementation */ /* Specify an alternative malloc implementation */
sqlite3Config.m = *va_arg(ap, sqlite3_mem_methods*); sqlite3Config.m = *va_arg(ap, sqlite3_mem_methods*);
break; break;
} }
case SQLITE_CONFIG_GETMALLOC: { case SQLITE_CONFIG_GETMALLOC: {
/* Specify an alternative malloc implementation */ /* Retrieve the current malloc() implementation */
if( sqlite3Config.m.xMalloc==0 ) sqlite3MemSetDefault(); if( sqlite3Config.m.xMalloc==0 ) sqlite3MemSetDefault();
*va_arg(ap, sqlite3_mem_methods*) = sqlite3Config.m; *va_arg(ap, sqlite3_mem_methods*) = sqlite3Config.m;
break; break;

508
src/mem3.c
View File

@@ -14,21 +14,24 @@
** **
** This version of the memory allocation subsystem omits all ** This version of the memory allocation subsystem omits all
** use of malloc(). All dynamically allocatable memory is ** use of malloc(). All dynamically allocatable memory is
** contained in a static array, mem.aPool[]. The size of this ** contained in a static array, mem3.aPool[]. The size of this
** fixed memory pool is SQLITE_MEMORY_SIZE bytes. ** fixed memory pool is SQLITE_MEMORY_SIZE bytes.
** **
** This version of the memory allocation subsystem is used if ** This version of the memory allocation subsystem is used if
** and only if SQLITE_MEMORY_SIZE is defined. ** and only if SQLITE_MEMORY_SIZE is defined.
** **
** $Id: mem3.c,v 1.14 2008/06/18 17:09:10 danielk1977 Exp $ ** $Id: mem3.c,v 1.15 2008/06/24 19:02:55 danielk1977 Exp $
*/ */
#include "sqliteInt.h" #include "sqliteInt.h"
/* /*
** This version of the memory allocator is used only when ** This version of the memory allocator is only built into the library
** SQLITE_MEMORY_SIZE is defined. ** SQLITE_ENABLE_MEMPOOL is defined. Defining this symbol does not
** mean that the library will use a memory-pool by default, just that
** it is available. The mempool allocator is activated by calling
** sqlite3_config().
*/ */
#ifdef SQLITE_MEMORY_SIZE #ifdef SQLITE_ENABLE_MEMPOOL
/* /*
** Maximum size (in Mem3Blocks) of a "small" chunk. ** Maximum size (in Mem3Blocks) of a "small" chunk.
@@ -58,7 +61,7 @@
** u.hdr.prevSize can be part of the data for that chunk and should ** u.hdr.prevSize can be part of the data for that chunk and should
** not be read or written. ** not be read or written.
** **
** We often identify a chunk by its index in mem.aPool[]. When ** We often identify a chunk by its index in mem3.aPool[]. When
** this is done, the chunk index refers to the second block of ** this is done, the chunk index refers to the second block of
** the chunk. In this way, the first chunk has an index of 1. ** the chunk. In this way, the first chunk has an index of 1.
** A chunk index of 0 means "no such chunk" and is the equivalent ** A chunk index of 0 means "no such chunk" and is the equivalent
@@ -66,8 +69,8 @@
** **
** The second block of free chunks is of the form u.list. The ** The second block of free chunks is of the form u.list. The
** two fields form a double-linked list of chunks of related sizes. ** two fields form a double-linked list of chunks of related sizes.
** Pointers to the head of the list are stored in mem.aiSmall[] ** Pointers to the head of the list are stored in mem3.aiSmall[]
** for smaller chunks and mem.aiHash[] for larger chunks. ** for smaller chunks and mem3.aiHash[] for larger chunks.
** **
** The second block of a chunk is user data if the chunk is checked ** The second block of a chunk is user data if the chunk is checked
** out. If a chunk is checked out, the user data may extend into ** out. If a chunk is checked out, the user data may extend into
@@ -81,15 +84,15 @@ struct Mem3Block {
u32 size4x; /* 4x the size of current chunk in Mem3Block elements */ u32 size4x; /* 4x the size of current chunk in Mem3Block elements */
} hdr; } hdr;
struct { struct {
u32 next; /* Index in mem.aPool[] of next free chunk */ u32 next; /* Index in mem3.aPool[] of next free chunk */
u32 prev; /* Index in mem.aPool[] of previous free chunk */ u32 prev; /* Index in mem3.aPool[] of previous free chunk */
} list; } list;
} u; } u;
}; };
/* /*
** All of the static variables used by this module are collected ** All of the static variables used by this module are collected
** into a single structure named "mem". This is to keep the ** into a single structure named "mem3". This is to keep the
** static variables organized and to reduce namespace pollution ** static variables organized and to reduce namespace pollution
** when this module is combined with other in the amalgamation. ** when this module is combined with other in the amalgamation.
*/ */
@@ -127,29 +130,32 @@ static struct {
u32 aiHash[N_HASH]; /* For sizes MX_SMALL+1 and larger */ u32 aiHash[N_HASH]; /* For sizes MX_SMALL+1 and larger */
/* /*
** Memory available for allocation ** Memory available for allocation. nPool is the size of the array
** (in Mem3Blocks) pointed to by aPool less 2.
*/ */
Mem3Block aPool[SQLITE_MEMORY_SIZE/sizeof(Mem3Block)+2]; u32 nPool;
} mem; Mem3Block *aPool;
/* Mem3Block aPool[SQLITE_MEMORY_SIZE/sizeof(Mem3Block)+2]; */
} mem3;
/* /*
** Unlink the chunk at mem.aPool[i] from list it is currently ** Unlink the chunk at mem3.aPool[i] from list it is currently
** on. *pRoot is the list that i is a member of. ** on. *pRoot is the list that i is a member of.
*/ */
static void memsys3UnlinkFromList(u32 i, u32 *pRoot){ static void memsys3UnlinkFromList(u32 i, u32 *pRoot){
u32 next = mem.aPool[i].u.list.next; u32 next = mem3.aPool[i].u.list.next;
u32 prev = mem.aPool[i].u.list.prev; u32 prev = mem3.aPool[i].u.list.prev;
assert( sqlite3_mutex_held(mem.mutex) ); assert( sqlite3_mutex_held(mem3.mutex) );
if( prev==0 ){ if( prev==0 ){
*pRoot = next; *pRoot = next;
}else{ }else{
mem.aPool[prev].u.list.next = next; mem3.aPool[prev].u.list.next = next;
} }
if( next ){ if( next ){
mem.aPool[next].u.list.prev = prev; mem3.aPool[next].u.list.prev = prev;
} }
mem.aPool[i].u.list.next = 0; mem3.aPool[i].u.list.next = 0;
mem.aPool[i].u.list.prev = 0; mem3.aPool[i].u.list.prev = 0;
} }
/* /*
@@ -158,30 +164,30 @@ static void memsys3UnlinkFromList(u32 i, u32 *pRoot){
*/ */
static void memsys3Unlink(u32 i){ static void memsys3Unlink(u32 i){
u32 size, hash; u32 size, hash;
assert( sqlite3_mutex_held(mem.mutex) ); assert( sqlite3_mutex_held(mem3.mutex) );
assert( (mem.aPool[i-1].u.hdr.size4x & 1)==0 ); assert( (mem3.aPool[i-1].u.hdr.size4x & 1)==0 );
assert( i>=1 ); assert( i>=1 );
size = mem.aPool[i-1].u.hdr.size4x/4; size = mem3.aPool[i-1].u.hdr.size4x/4;
assert( size==mem.aPool[i+size-1].u.hdr.prevSize ); assert( size==mem3.aPool[i+size-1].u.hdr.prevSize );
assert( size>=2 ); assert( size>=2 );
if( size <= MX_SMALL ){ if( size <= MX_SMALL ){
memsys3UnlinkFromList(i, &mem.aiSmall[size-2]); memsys3UnlinkFromList(i, &mem3.aiSmall[size-2]);
}else{ }else{
hash = size % N_HASH; hash = size % N_HASH;
memsys3UnlinkFromList(i, &mem.aiHash[hash]); memsys3UnlinkFromList(i, &mem3.aiHash[hash]);
} }
} }
/* /*
** Link the chunk at mem.aPool[i] so that is on the list rooted ** Link the chunk at mem3.aPool[i] so that is on the list rooted
** at *pRoot. ** at *pRoot.
*/ */
static void memsys3LinkIntoList(u32 i, u32 *pRoot){ static void memsys3LinkIntoList(u32 i, u32 *pRoot){
assert( sqlite3_mutex_held(mem.mutex) ); assert( sqlite3_mutex_held(mem3.mutex) );
mem.aPool[i].u.list.next = *pRoot; mem3.aPool[i].u.list.next = *pRoot;
mem.aPool[i].u.list.prev = 0; mem3.aPool[i].u.list.prev = 0;
if( *pRoot ){ if( *pRoot ){
mem.aPool[*pRoot].u.list.prev = i; mem3.aPool[*pRoot].u.list.prev = i;
} }
*pRoot = i; *pRoot = i;
} }
@@ -192,117 +198,51 @@ static void memsys3LinkIntoList(u32 i, u32 *pRoot){
*/ */
static void memsys3Link(u32 i){ static void memsys3Link(u32 i){
u32 size, hash; u32 size, hash;
assert( sqlite3_mutex_held(mem.mutex) ); assert( sqlite3_mutex_held(mem3.mutex) );
assert( i>=1 ); assert( i>=1 );
assert( (mem.aPool[i-1].u.hdr.size4x & 1)==0 ); assert( (mem3.aPool[i-1].u.hdr.size4x & 1)==0 );
size = mem.aPool[i-1].u.hdr.size4x/4; size = mem3.aPool[i-1].u.hdr.size4x/4;
assert( size==mem.aPool[i+size-1].u.hdr.prevSize ); assert( size==mem3.aPool[i+size-1].u.hdr.prevSize );
assert( size>=2 ); assert( size>=2 );
if( size <= MX_SMALL ){ if( size <= MX_SMALL ){
memsys3LinkIntoList(i, &mem.aiSmall[size-2]); memsys3LinkIntoList(i, &mem3.aiSmall[size-2]);
}else{ }else{
hash = size % N_HASH; hash = size % N_HASH;
memsys3LinkIntoList(i, &mem.aiHash[hash]); memsys3LinkIntoList(i, &mem3.aiHash[hash]);
} }
} }
/* /*
** Enter the mutex mem.mutex. Allocate it if it is not already allocated. ** Enter the mutex mem3.mutex. Allocate it if it is not already allocated.
** **
** Also: Initialize the memory allocation subsystem the first time ** Also: Initialize the memory allocation subsystem the first time
** this routine is called. ** this routine is called.
*/ */
static void memsys3Enter(void){ static void memsys3Enter(void){
if( mem.mutex==0 ){ #if 0
mem.mutex = sqlite3MutexAlloc(SQLITE_MUTEX_STATIC_MEM); if( mem3.mutex==0 ){
mem.aPool[0].u.hdr.size4x = SQLITE_MEMORY_SIZE/2 + 2; mem3.mutex = sqlite3MutexAlloc(SQLITE_MUTEX_STATIC_MEM);
mem.aPool[SQLITE_MEMORY_SIZE/8].u.hdr.prevSize = SQLITE_MEMORY_SIZE/8;
mem.aPool[SQLITE_MEMORY_SIZE/8].u.hdr.size4x = 1;
mem.iMaster = 1;
mem.szMaster = SQLITE_MEMORY_SIZE/8;
mem.mnMaster = mem.szMaster;
} }
sqlite3_mutex_enter(mem.mutex); sqlite3_mutex_enter(mem3.mutex);
#endif
} }
static void memsys3Leave(void){
/*
** Return the amount of memory currently checked out.
*/
sqlite3_int64 sqlite3_memory_used(void){
sqlite3_int64 n;
memsys3Enter();
n = SQLITE_MEMORY_SIZE - mem.szMaster*8;
sqlite3_mutex_leave(mem.mutex);
return n;
}
/*
** Return the maximum amount of memory that has ever been
** checked out since either the beginning of this process
** or since the most recent reset.
*/
sqlite3_int64 sqlite3_memory_highwater(int resetFlag){
sqlite3_int64 n;
memsys3Enter();
n = SQLITE_MEMORY_SIZE - mem.mnMaster*8;
if( resetFlag ){
mem.mnMaster = mem.szMaster;
}
sqlite3_mutex_leave(mem.mutex);
return n;
}
/*
** Change the alarm callback.
**
** This is a no-op for the static memory allocator. The purpose
** of the memory alarm is to support sqlite3_soft_heap_limit().
** But with this memory allocator, the soft_heap_limit is really
** a hard limit that is fixed at SQLITE_MEMORY_SIZE.
*/
int sqlite3_memory_alarm(
void(*xCallback)(void *pArg, sqlite3_int64 used,int N),
void *pArg,
sqlite3_int64 iThreshold
){
return SQLITE_OK;
} }
/* /*
** Called when we are unable to satisfy an allocation of nBytes. ** Called when we are unable to satisfy an allocation of nBytes.
*/ */
static void memsys3OutOfMemory(int nByte){ static void memsys3OutOfMemory(int nByte){
if( !mem.alarmBusy ){ if( !mem3.alarmBusy ){
mem.alarmBusy = 1; mem3.alarmBusy = 1;
assert( sqlite3_mutex_held(mem.mutex) ); assert( sqlite3_mutex_held(mem3.mutex) );
sqlite3_mutex_leave(mem.mutex); sqlite3_mutex_leave(mem3.mutex);
sqlite3_release_memory(nByte); sqlite3_release_memory(nByte);
sqlite3_mutex_enter(mem.mutex); sqlite3_mutex_enter(mem3.mutex);
mem.alarmBusy = 0; mem3.alarmBusy = 0;
} }
} }
/*
** Return the size of an outstanding allocation, in bytes. The
** size returned omits the 8-byte header overhead. This only
** works for chunks that are currently checked out.
*/
int sqlite3MallocSize(void *p){
int iSize = 0;
if( p ){
Mem3Block *pBlock = (Mem3Block*)p;
assert( (pBlock[-1].u.hdr.size4x&1)!=0 );
iSize = (pBlock[-1].u.hdr.size4x&~3)*2 - 4;
}
return iSize;
}
/*
** Initialize the memmory allocation subsystem.
*/
int sqlite3MallocInit(void){
return SQLITE_OK;
}
/* /*
** Chunk i is a free chunk that has been unlinked. Adjust its ** Chunk i is a free chunk that has been unlinked. Adjust its
@@ -311,62 +251,62 @@ int sqlite3MallocInit(void){
*/ */
static void *memsys3Checkout(u32 i, int nBlock){ static void *memsys3Checkout(u32 i, int nBlock){
u32 x; u32 x;
assert( sqlite3_mutex_held(mem.mutex) ); assert( sqlite3_mutex_held(mem3.mutex) );
assert( i>=1 ); assert( i>=1 );
assert( mem.aPool[i-1].u.hdr.size4x/4==nBlock ); assert( mem3.aPool[i-1].u.hdr.size4x/4==nBlock );
assert( mem.aPool[i+nBlock-1].u.hdr.prevSize==nBlock ); assert( mem3.aPool[i+nBlock-1].u.hdr.prevSize==nBlock );
x = mem.aPool[i-1].u.hdr.size4x; x = mem3.aPool[i-1].u.hdr.size4x;
mem.aPool[i-1].u.hdr.size4x = nBlock*4 | 1 | (x&2); mem3.aPool[i-1].u.hdr.size4x = nBlock*4 | 1 | (x&2);
mem.aPool[i+nBlock-1].u.hdr.prevSize = nBlock; mem3.aPool[i+nBlock-1].u.hdr.prevSize = nBlock;
mem.aPool[i+nBlock-1].u.hdr.size4x |= 2; mem3.aPool[i+nBlock-1].u.hdr.size4x |= 2;
return &mem.aPool[i]; return &mem3.aPool[i];
} }
/* /*
** Carve a piece off of the end of the mem.iMaster free chunk. ** Carve a piece off of the end of the mem3.iMaster free chunk.
** Return a pointer to the new allocation. Or, if the master chunk ** Return a pointer to the new allocation. Or, if the master chunk
** is not large enough, return 0. ** is not large enough, return 0.
*/ */
static void *memsys3FromMaster(int nBlock){ static void *memsys3FromMaster(int nBlock){
assert( sqlite3_mutex_held(mem.mutex) ); assert( sqlite3_mutex_held(mem3.mutex) );
assert( mem.szMaster>=nBlock ); assert( mem3.szMaster>=nBlock );
if( nBlock>=mem.szMaster-1 ){ if( nBlock>=mem3.szMaster-1 ){
/* Use the entire master */ /* Use the entire master */
void *p = memsys3Checkout(mem.iMaster, mem.szMaster); void *p = memsys3Checkout(mem3.iMaster, mem3.szMaster);
mem.iMaster = 0; mem3.iMaster = 0;
mem.szMaster = 0; mem3.szMaster = 0;
mem.mnMaster = 0; mem3.mnMaster = 0;
return p; return p;
}else{ }else{
/* Split the master block. Return the tail. */ /* Split the master block. Return the tail. */
u32 newi, x; u32 newi, x;
newi = mem.iMaster + mem.szMaster - nBlock; newi = mem3.iMaster + mem3.szMaster - nBlock;
assert( newi > mem.iMaster+1 ); assert( newi > mem3.iMaster+1 );
mem.aPool[mem.iMaster+mem.szMaster-1].u.hdr.prevSize = nBlock; mem3.aPool[mem3.iMaster+mem3.szMaster-1].u.hdr.prevSize = nBlock;
mem.aPool[mem.iMaster+mem.szMaster-1].u.hdr.size4x |= 2; mem3.aPool[mem3.iMaster+mem3.szMaster-1].u.hdr.size4x |= 2;
mem.aPool[newi-1].u.hdr.size4x = nBlock*4 + 1; mem3.aPool[newi-1].u.hdr.size4x = nBlock*4 + 1;
mem.szMaster -= nBlock; mem3.szMaster -= nBlock;
mem.aPool[newi-1].u.hdr.prevSize = mem.szMaster; mem3.aPool[newi-1].u.hdr.prevSize = mem3.szMaster;
x = mem.aPool[mem.iMaster-1].u.hdr.size4x & 2; x = mem3.aPool[mem3.iMaster-1].u.hdr.size4x & 2;
mem.aPool[mem.iMaster-1].u.hdr.size4x = mem.szMaster*4 | x; mem3.aPool[mem3.iMaster-1].u.hdr.size4x = mem3.szMaster*4 | x;
if( mem.szMaster < mem.mnMaster ){ if( mem3.szMaster < mem3.mnMaster ){
mem.mnMaster = mem.szMaster; mem3.mnMaster = mem3.szMaster;
} }
return (void*)&mem.aPool[newi]; return (void*)&mem3.aPool[newi];
} }
} }
/* /*
** *pRoot is the head of a list of free chunks of the same size ** *pRoot is the head of a list of free chunks of the same size
** or same size hash. In other words, *pRoot is an entry in either ** or same size hash. In other words, *pRoot is an entry in either
** mem.aiSmall[] or mem.aiHash[]. ** mem3.aiSmall[] or mem3.aiHash[].
** **
** This routine examines all entries on the given list and tries ** This routine examines all entries on the given list and tries
** to coalesce each entries with adjacent free chunks. ** to coalesce each entries with adjacent free chunks.
** **
** If it sees a chunk that is larger than mem.iMaster, it replaces ** If it sees a chunk that is larger than mem3.iMaster, it replaces
** the current mem.iMaster with the new larger chunk. In order for ** the current mem3.iMaster with the new larger chunk. In order for
** this mem.iMaster replacement to work, the master chunk must be ** this mem3.iMaster replacement to work, the master chunk must be
** linked into the hash tables. That is not the normal state of ** linked into the hash tables. That is not the normal state of
** affairs, of course. The calling routine must link the master ** affairs, of course. The calling routine must link the master
** chunk before invoking this routine, then must unlink the (possibly ** chunk before invoking this routine, then must unlink the (possibly
@@ -375,31 +315,31 @@ static void *memsys3FromMaster(int nBlock){
static void memsys3Merge(u32 *pRoot){ static void memsys3Merge(u32 *pRoot){
u32 iNext, prev, size, i, x; u32 iNext, prev, size, i, x;
assert( sqlite3_mutex_held(mem.mutex) ); assert( sqlite3_mutex_held(mem3.mutex) );
for(i=*pRoot; i>0; i=iNext){ for(i=*pRoot; i>0; i=iNext){
iNext = mem.aPool[i].u.list.next; iNext = mem3.aPool[i].u.list.next;
size = mem.aPool[i-1].u.hdr.size4x; size = mem3.aPool[i-1].u.hdr.size4x;
assert( (size&1)==0 ); assert( (size&1)==0 );
if( (size&2)==0 ){ if( (size&2)==0 ){
memsys3UnlinkFromList(i, pRoot); memsys3UnlinkFromList(i, pRoot);
assert( i > mem.aPool[i-1].u.hdr.prevSize ); assert( i > mem3.aPool[i-1].u.hdr.prevSize );
prev = i - mem.aPool[i-1].u.hdr.prevSize; prev = i - mem3.aPool[i-1].u.hdr.prevSize;
if( prev==iNext ){ if( prev==iNext ){
iNext = mem.aPool[prev].u.list.next; iNext = mem3.aPool[prev].u.list.next;
} }
memsys3Unlink(prev); memsys3Unlink(prev);
size = i + size/4 - prev; size = i + size/4 - prev;
x = mem.aPool[prev-1].u.hdr.size4x & 2; x = mem3.aPool[prev-1].u.hdr.size4x & 2;
mem.aPool[prev-1].u.hdr.size4x = size*4 | x; mem3.aPool[prev-1].u.hdr.size4x = size*4 | x;
mem.aPool[prev+size-1].u.hdr.prevSize = size; mem3.aPool[prev+size-1].u.hdr.prevSize = size;
memsys3Link(prev); memsys3Link(prev);
i = prev; i = prev;
}else{ }else{
size /= 4; size /= 4;
} }
if( size>mem.szMaster ){ if( size>mem3.szMaster ){
mem.iMaster = i; mem3.iMaster = i;
mem.szMaster = size; mem3.szMaster = size;
} }
} }
} }
@@ -413,14 +353,14 @@ static void *memsys3Malloc(int nByte){
int nBlock; int nBlock;
int toFree; int toFree;
assert( sqlite3_mutex_held(mem.mutex) ); assert( sqlite3_mutex_held(mem3.mutex) );
assert( sizeof(Mem3Block)==8 ); assert( sizeof(Mem3Block)==8 );
if( nByte<=12 ){ if( nByte<=12 ){
nBlock = 2; nBlock = 2;
}else{ }else{
nBlock = (nByte + 11)/8; nBlock = (nByte + 11)/8;
} }
assert( nBlock >= 2 ); assert( nBlock>=2 );
/* STEP 1: /* STEP 1:
** Look for an entry of the correct size in either the small ** Look for an entry of the correct size in either the small
@@ -428,16 +368,16 @@ static void *memsys3Malloc(int nByte){
** successful most of the time (about 9 times out of 10). ** successful most of the time (about 9 times out of 10).
*/ */
if( nBlock <= MX_SMALL ){ if( nBlock <= MX_SMALL ){
i = mem.aiSmall[nBlock-2]; i = mem3.aiSmall[nBlock-2];
if( i>0 ){ if( i>0 ){
memsys3UnlinkFromList(i, &mem.aiSmall[nBlock-2]); memsys3UnlinkFromList(i, &mem3.aiSmall[nBlock-2]);
return memsys3Checkout(i, nBlock); return memsys3Checkout(i, nBlock);
} }
}else{ }else{
int hash = nBlock % N_HASH; int hash = nBlock % N_HASH;
for(i=mem.aiHash[hash]; i>0; i=mem.aPool[i].u.list.next){ for(i=mem3.aiHash[hash]; i>0; i=mem3.aPool[i].u.list.next){
if( mem.aPool[i-1].u.hdr.size4x/4==nBlock ){ if( mem3.aPool[i-1].u.hdr.size4x/4==nBlock ){
memsys3UnlinkFromList(i, &mem.aiHash[hash]); memsys3UnlinkFromList(i, &mem3.aiHash[hash]);
return memsys3Checkout(i, nBlock); return memsys3Checkout(i, nBlock);
} }
} }
@@ -447,7 +387,7 @@ static void *memsys3Malloc(int nByte){
** Try to satisfy the allocation by carving a piece off of the end ** Try to satisfy the allocation by carving a piece off of the end
** of the master chunk. This step usually works if step 1 fails. ** of the master chunk. This step usually works if step 1 fails.
*/ */
if( mem.szMaster>=nBlock ){ if( mem3.szMaster>=nBlock ){
return memsys3FromMaster(nBlock); return memsys3FromMaster(nBlock);
} }
@@ -459,22 +399,22 @@ static void *memsys3Malloc(int nByte){
** of the end of the master chunk. This step happens very ** of the end of the master chunk. This step happens very
** rarely (we hope!) ** rarely (we hope!)
*/ */
for(toFree=nBlock*16; toFree<SQLITE_MEMORY_SIZE*2; toFree *= 2){ for(toFree=nBlock*16; toFree<(mem3.nPool*16); toFree *= 2){
memsys3OutOfMemory(toFree); memsys3OutOfMemory(toFree);
if( mem.iMaster ){ if( mem3.iMaster ){
memsys3Link(mem.iMaster); memsys3Link(mem3.iMaster);
mem.iMaster = 0; mem3.iMaster = 0;
mem.szMaster = 0; mem3.szMaster = 0;
} }
for(i=0; i<N_HASH; i++){ for(i=0; i<N_HASH; i++){
memsys3Merge(&mem.aiHash[i]); memsys3Merge(&mem3.aiHash[i]);
} }
for(i=0; i<MX_SMALL-1; i++){ for(i=0; i<MX_SMALL-1; i++){
memsys3Merge(&mem.aiSmall[i]); memsys3Merge(&mem3.aiSmall[i]);
} }
if( mem.szMaster ){ if( mem3.szMaster ){
memsys3Unlink(mem.iMaster); memsys3Unlink(mem3.iMaster);
if( mem.szMaster>=nBlock ){ if( mem3.szMaster>=nBlock ){
return memsys3FromMaster(nBlock); return memsys3FromMaster(nBlock);
} }
} }
@@ -491,68 +431,76 @@ void memsys3Free(void *pOld){
Mem3Block *p = (Mem3Block*)pOld; Mem3Block *p = (Mem3Block*)pOld;
int i; int i;
u32 size, x; u32 size, x;
assert( sqlite3_mutex_held(mem.mutex) ); assert( sqlite3_mutex_held(mem3.mutex) );
assert( p>mem.aPool && p<&mem.aPool[SQLITE_MEMORY_SIZE/8] ); assert( p>mem3.aPool && p<&mem3.aPool[mem3.nPool] );
i = p - mem.aPool; i = p - mem3.aPool;
assert( (mem.aPool[i-1].u.hdr.size4x&1)==1 ); assert( (mem3.aPool[i-1].u.hdr.size4x&1)==1 );
size = mem.aPool[i-1].u.hdr.size4x/4; size = mem3.aPool[i-1].u.hdr.size4x/4;
assert( i+size<=SQLITE_MEMORY_SIZE/8+1 ); assert( i+size<=mem3.nPool+1 );
mem.aPool[i-1].u.hdr.size4x &= ~1; mem3.aPool[i-1].u.hdr.size4x &= ~1;
mem.aPool[i+size-1].u.hdr.prevSize = size; mem3.aPool[i+size-1].u.hdr.prevSize = size;
mem.aPool[i+size-1].u.hdr.size4x &= ~2; mem3.aPool[i+size-1].u.hdr.size4x &= ~2;
memsys3Link(i); memsys3Link(i);
/* Try to expand the master using the newly freed chunk */ /* Try to expand the master using the newly freed chunk */
if( mem.iMaster ){ if( mem3.iMaster ){
while( (mem.aPool[mem.iMaster-1].u.hdr.size4x&2)==0 ){ while( (mem3.aPool[mem3.iMaster-1].u.hdr.size4x&2)==0 ){
size = mem.aPool[mem.iMaster-1].u.hdr.prevSize; size = mem3.aPool[mem3.iMaster-1].u.hdr.prevSize;
mem.iMaster -= size; mem3.iMaster -= size;
mem.szMaster += size; mem3.szMaster += size;
memsys3Unlink(mem.iMaster); memsys3Unlink(mem3.iMaster);
x = mem.aPool[mem.iMaster-1].u.hdr.size4x & 2; x = mem3.aPool[mem3.iMaster-1].u.hdr.size4x & 2;
mem.aPool[mem.iMaster-1].u.hdr.size4x = mem.szMaster*4 | x; mem3.aPool[mem3.iMaster-1].u.hdr.size4x = mem3.szMaster*4 | x;
mem.aPool[mem.iMaster+mem.szMaster-1].u.hdr.prevSize = mem.szMaster; mem3.aPool[mem3.iMaster+mem3.szMaster-1].u.hdr.prevSize = mem3.szMaster;
} }
x = mem.aPool[mem.iMaster-1].u.hdr.size4x & 2; x = mem3.aPool[mem3.iMaster-1].u.hdr.size4x & 2;
while( (mem.aPool[mem.iMaster+mem.szMaster-1].u.hdr.size4x&1)==0 ){ while( (mem3.aPool[mem3.iMaster+mem3.szMaster-1].u.hdr.size4x&1)==0 ){
memsys3Unlink(mem.iMaster+mem.szMaster); memsys3Unlink(mem3.iMaster+mem3.szMaster);
mem.szMaster += mem.aPool[mem.iMaster+mem.szMaster-1].u.hdr.size4x/4; mem3.szMaster += mem3.aPool[mem3.iMaster+mem3.szMaster-1].u.hdr.size4x/4;
mem.aPool[mem.iMaster-1].u.hdr.size4x = mem.szMaster*4 | x; mem3.aPool[mem3.iMaster-1].u.hdr.size4x = mem3.szMaster*4 | x;
mem.aPool[mem.iMaster+mem.szMaster-1].u.hdr.prevSize = mem.szMaster; mem3.aPool[mem3.iMaster+mem3.szMaster-1].u.hdr.prevSize = mem3.szMaster;
} }
} }
} }
/* /*
** Allocate nBytes of memory ** Allocate nBytes of memory.
*/ */
void *sqlite3_malloc(int nBytes){ static void *mempoolMalloc(int nBytes){
sqlite3_int64 *p = 0; sqlite3_int64 *p;
if( nBytes>0 ){ assert( nBytes>0 ); /* malloc.c filters out 0 byte requests */
memsys3Enter(); memsys3Enter();
p = memsys3Malloc(nBytes); p = memsys3Malloc(nBytes);
sqlite3_mutex_leave(mem.mutex); memsys3Leave();
}
return (void*)p; return (void*)p;
} }
/* /*
** Free memory. ** Free memory.
*/ */
void sqlite3_free(void *pPrior){ void mempoolFree(void *pPrior){
if( pPrior==0 ){ assert( pPrior );
return; memsys3Enter();
}
assert( mem.mutex!=0 );
sqlite3_mutex_enter(mem.mutex);
memsys3Free(pPrior); memsys3Free(pPrior);
sqlite3_mutex_leave(mem.mutex); memsys3Leave();
}
/*
** Return the size of an outstanding allocation, in bytes. The
** size returned omits the 8-byte header overhead. This only
** works for chunks that are currently checked out.
*/
static int mempoolSize(void *p){
Mem3Block *pBlock = (Mem3Block*)p;
assert( pBlock );
assert( (pBlock[-1].u.hdr.size4x&1)!=0 );
return (pBlock[-1].u.hdr.size4x&~3)*2 - 4;
} }
/* /*
** Change the size of an existing memory allocation ** Change the size of an existing memory allocation
*/ */
void *sqlite3_realloc(void *pPrior, int nBytes){ void *mempoolRealloc(void *pPrior, int nBytes){
int nOld; int nOld;
void *p; void *p;
if( pPrior==0 ){ if( pPrior==0 ){
@@ -562,29 +510,53 @@ void *sqlite3_realloc(void *pPrior, int nBytes){
sqlite3_free(pPrior); sqlite3_free(pPrior);
return 0; return 0;
} }
assert( mem.mutex!=0 ); nOld = mempoolSize(pPrior);
nOld = sqlite3MallocSize(pPrior);
if( nBytes<=nOld && nBytes>=nOld-128 ){ if( nBytes<=nOld && nBytes>=nOld-128 ){
return pPrior; return pPrior;
} }
sqlite3_mutex_enter(mem.mutex); memsys3Enter();
p = memsys3Malloc(nBytes); p = mempoolMalloc(nBytes);
if( p ){ if( p ){
if( nOld<nBytes ){ if( nOld<nBytes ){
memcpy(p, pPrior, nOld); memcpy(p, pPrior, nOld);
}else{ }else{
memcpy(p, pPrior, nBytes); memcpy(p, pPrior, nBytes);
} }
memsys3Free(pPrior); mempoolFree(pPrior);
} }
sqlite3_mutex_leave(mem.mutex); memsys3Leave();
return p; return p;
} }
/*
** Round up a request size to the next valid allocation size.
*/
static int mempoolRoundup(int n){
/* TODO: Fix me */
return n;
}
/*
** Initialize this module.
*/
static int mempoolInit(void *NotUsed){
return SQLITE_OK;
}
/*
** Deinitialize this module.
*/
static void mempoolShutdown(void *NotUsed){
return;
}
/* /*
** Open the file indicated and write a log of all unfreed memory ** Open the file indicated and write a log of all unfreed memory
** allocations into that log. ** allocations into that log.
*/ */
#if 0
void sqlite3MemdebugDump(const char *zFilename){ void sqlite3MemdebugDump(const char *zFilename){
#ifdef SQLITE_DEBUG #ifdef SQLITE_DEBUG
FILE *out; FILE *out;
@@ -603,51 +575,51 @@ void sqlite3MemdebugDump(const char *zFilename){
memsys3Enter(); memsys3Enter();
fprintf(out, "CHUNKS:\n"); fprintf(out, "CHUNKS:\n");
for(i=1; i<=SQLITE_MEMORY_SIZE/8; i+=size/4){ for(i=1; i<=SQLITE_MEMORY_SIZE/8; i+=size/4){
size = mem.aPool[i-1].u.hdr.size4x; size = mem3.aPool[i-1].u.hdr.size4x;
if( size/4<=1 ){ if( size/4<=1 ){
fprintf(out, "%p size error\n", &mem.aPool[i]); fprintf(out, "%p size error\n", &mem3.aPool[i]);
assert( 0 ); assert( 0 );
break; break;
} }
if( (size&1)==0 && mem.aPool[i+size/4-1].u.hdr.prevSize!=size/4 ){ if( (size&1)==0 && mem3.aPool[i+size/4-1].u.hdr.prevSize!=size/4 ){
fprintf(out, "%p tail size does not match\n", &mem.aPool[i]); fprintf(out, "%p tail size does not match\n", &mem3.aPool[i]);
assert( 0 ); assert( 0 );
break; break;
} }
if( ((mem.aPool[i+size/4-1].u.hdr.size4x&2)>>1)!=(size&1) ){ if( ((mem3.aPool[i+size/4-1].u.hdr.size4x&2)>>1)!=(size&1) ){
fprintf(out, "%p tail checkout bit is incorrect\n", &mem.aPool[i]); fprintf(out, "%p tail checkout bit is incorrect\n", &mem3.aPool[i]);
assert( 0 ); assert( 0 );
break; break;
} }
if( size&1 ){ if( size&1 ){
fprintf(out, "%p %6d bytes checked out\n", &mem.aPool[i], (size/4)*8-8); fprintf(out, "%p %6d bytes checked out\n", &mem3.aPool[i], (size/4)*8-8);
}else{ }else{
fprintf(out, "%p %6d bytes free%s\n", &mem.aPool[i], (size/4)*8-8, fprintf(out, "%p %6d bytes free%s\n", &mem3.aPool[i], (size/4)*8-8,
i==mem.iMaster ? " **master**" : ""); i==mem3.iMaster ? " **master**" : "");
} }
} }
for(i=0; i<MX_SMALL-1; i++){ for(i=0; i<MX_SMALL-1; i++){
if( mem.aiSmall[i]==0 ) continue; if( mem3.aiSmall[i]==0 ) continue;
fprintf(out, "small(%2d):", i); fprintf(out, "small(%2d):", i);
for(j = mem.aiSmall[i]; j>0; j=mem.aPool[j].u.list.next){ for(j = mem3.aiSmall[i]; j>0; j=mem3.aPool[j].u.list.next){
fprintf(out, " %p(%d)", &mem.aPool[j], fprintf(out, " %p(%d)", &mem3.aPool[j],
(mem.aPool[j-1].u.hdr.size4x/4)*8-8); (mem3.aPool[j-1].u.hdr.size4x/4)*8-8);
} }
fprintf(out, "\n"); fprintf(out, "\n");
} }
for(i=0; i<N_HASH; i++){ for(i=0; i<N_HASH; i++){
if( mem.aiHash[i]==0 ) continue; if( mem3.aiHash[i]==0 ) continue;
fprintf(out, "hash(%2d):", i); fprintf(out, "hash(%2d):", i);
for(j = mem.aiHash[i]; j>0; j=mem.aPool[j].u.list.next){ for(j = mem3.aiHash[i]; j>0; j=mem3.aPool[j].u.list.next){
fprintf(out, " %p(%d)", &mem.aPool[j], fprintf(out, " %p(%d)", &mem3.aPool[j],
(mem.aPool[j-1].u.hdr.size4x/4)*8-8); (mem3.aPool[j-1].u.hdr.size4x/4)*8-8);
} }
fprintf(out, "\n"); fprintf(out, "\n");
} }
fprintf(out, "master=%d\n", mem.iMaster); fprintf(out, "master=%d\n", mem3.iMaster);
fprintf(out, "nowUsed=%d\n", SQLITE_MEMORY_SIZE - mem.szMaster*8); fprintf(out, "nowUsed=%d\n", SQLITE_MEMORY_SIZE - mem3.szMaster*8);
fprintf(out, "mxUsed=%d\n", SQLITE_MEMORY_SIZE - mem.mnMaster*8); fprintf(out, "mxUsed=%d\n", SQLITE_MEMORY_SIZE - mem3.mnMaster*8);
sqlite3_mutex_leave(mem.mutex); sqlite3_mutex_leave(mem3.mutex);
if( out==stdout ){ if( out==stdout ){
fflush(stdout); fflush(stdout);
}else{ }else{
@@ -655,6 +627,46 @@ void sqlite3MemdebugDump(const char *zFilename){
} }
#endif #endif
} }
#endif
/*
** This routine is the only routine in this file with external
** linkage.
**
** Populate the low-level memory allocation function pointers in
** sqlite3Config.m with pointers to the routines in this file. The
** arguments specify the block of memory to manage.
**
** This routine is only called by sqlite3_config(), and therefore
** is not required to be threadsafe (it is not).
*/
void sqlite3MemSetMempool(u8 *pBlock, int nBlock){
static const sqlite3_mem_methods mempoolMethods = {
mempoolMalloc,
mempoolFree,
mempoolRealloc,
mempoolSize,
mempoolRoundup,
mempoolInit,
mempoolShutdown,
0
};
#endif /* !SQLITE_MEMORY_SIZE */ /* Configure the functions to call to allocate memory. */
sqlite3_config(SQLITE_CONFIG_MALLOC, &mempoolMethods);
/* Store a pointer to the memory block in global structure mem3. */
assert( sizeof(Mem3Block)==8 );
mem3.aPool = (Mem3Block *)pBlock;
mem3.nPool = (nBlock / sizeof(Mem3Block)) - 2;
/* Initialize the master block. */
mem3.szMaster = mem3.nPool;
mem3.mnMaster = mem3.szMaster;
mem3.iMaster = 1;
mem3.aPool[0].u.hdr.size4x = (mem3.szMaster<<2) + 2;
mem3.aPool[mem3.nPool].u.hdr.prevSize = mem3.nPool;
mem3.aPool[mem3.nPool].u.hdr.size4x = 1;
}
#endif /* SQLITE_MEMPOOL_MALLOC */

3
src/sqlite.h.in
View File

@@ -30,7 +30,7 @@
** the version number) and changes its name to "sqlite3.h" as ** the version number) and changes its name to "sqlite3.h" as
** part of the build process. ** part of the build process.
** **
** @(#) $Id: sqlite.h.in,v 1.354 2008/06/24 09:52:39 danielk1977 Exp $ ** @(#) $Id: sqlite.h.in,v 1.355 2008/06/24 19:02:55 danielk1977 Exp $
*/ */
#ifndef _SQLITE3_H_ #ifndef _SQLITE3_H_
#define _SQLITE3_H_ #define _SQLITE3_H_
@@ -1115,6 +1115,7 @@ struct sqlite3_mem_methods {
#define SQLITE_CONFIG_MEMSTATUS 9 /* boolean */ #define SQLITE_CONFIG_MEMSTATUS 9 /* boolean */
#define SQLITE_CONFIG_MUTEX 10 /* sqlite3_mutex_methods* */ #define SQLITE_CONFIG_MUTEX 10 /* sqlite3_mutex_methods* */
#define SQLITE_CONFIG_GETMUTEX 11 /* sqlite3_mutex_methods* */ #define SQLITE_CONFIG_GETMUTEX 11 /* sqlite3_mutex_methods* */
#define SQLITE_CONFIG_MEMPOOL 12 /* u8*, int */
/* /*
** CAPI3REF: Enable Or Disable Extended Result Codes {F12200} ** CAPI3REF: Enable Or Disable Extended Result Codes {F12200}

35
src/test_malloc.c
View File

@@ -13,7 +13,7 @@
** This file contains code used to implement test interfaces to the ** This file contains code used to implement test interfaces to the
** memory allocation subsystem. ** memory allocation subsystem.
** **
** $Id: test_malloc.c,v 1.28 2008/06/20 14:59:51 danielk1977 Exp $ ** $Id: test_malloc.c,v 1.29 2008/06/24 19:02:55 danielk1977 Exp $
*/ */
#include "sqliteInt.h" #include "sqliteInt.h"
#include "tcl.h" #include "tcl.h"
@@ -930,6 +930,38 @@ static int test_config_pagecache(
return TCL_OK; return TCL_OK;
} }
/*
** Usage: sqlite3_config_mempool NBYTE
**
*/
static int test_config_mempool(
void * clientData,
Tcl_Interp *interp,
int objc,
Tcl_Obj *CONST objv[]
){
int sz, rc;
Tcl_Obj *pResult;
static char buf[1000000];
if( objc!=2 ){
Tcl_WrongNumArgs(interp, 1, objv, "NBYTE");
return TCL_ERROR;
}
if( Tcl_GetIntFromObj(interp, objv[1], &sz) ) return TCL_ERROR;
if( sz<=0 ){
sqlite3_mem_methods m;
memset(&m, 0, sizeof(sqlite3_mem_methods));
rc = sqlite3_config(SQLITE_CONFIG_MALLOC, &m);
}else{
if( sz>sizeof(buf) ){
sz = sizeof(buf);
}
rc = sqlite3_config(SQLITE_CONFIG_MEMPOOL, buf, sz);
}
Tcl_SetResult(interp, (char *)sqlite3TestErrorName(rc), TCL_VOLATILE);
return TCL_OK;
}
/* /*
** Usage: sqlite3_status OPCODE RESETFLAG ** Usage: sqlite3_status OPCODE RESETFLAG
** **
@@ -1029,6 +1061,7 @@ int Sqlitetest_malloc_Init(Tcl_Interp *interp){
{ "sqlite3_memdebug_log", test_memdebug_log }, { "sqlite3_memdebug_log", test_memdebug_log },
{ "sqlite3_config_scratch", test_config_scratch }, { "sqlite3_config_scratch", test_config_scratch },
{ "sqlite3_config_pagecache", test_config_pagecache }, { "sqlite3_config_pagecache", test_config_pagecache },
{ "sqlite3_config_mempool", test_config_mempool },
{ "sqlite3_status", test_status }, { "sqlite3_status", test_status },
{ "install_malloc_faultsim", test_install_malloc_faultsim }, { "install_malloc_faultsim", test_install_malloc_faultsim },
}; };

19
test/permutations.test
View File

@@ -9,7 +9,7 @@
# #
#*********************************************************************** #***********************************************************************
# #
# $Id: permutations.test,v 1.3 2008/06/23 15:55:52 danielk1977 Exp $ # $Id: permutations.test,v 1.4 2008/06/24 19:02:55 danielk1977 Exp $
set testdir [file dirname $argv0] set testdir [file dirname $argv0]
source $testdir/tester.tcl source $testdir/tester.tcl
@@ -329,6 +329,23 @@ run_tests "autovacuum_ioerr" -description {
pragma auto_vacuum = 1 pragma auto_vacuum = 1
} -include ioerr.test } -include ioerr.test
run_tests "mempool" -description {
Run tests using the allocator in mem3.c.
} -initialize {
catch {db close}
sqlite3_reset_auto_extension
sqlite3_shutdown
sqlite3_config_mempool 1000000
sqlite3_initialize
autoinstall_test_functions
} -shutdown {
catch {db close}
sqlite3_reset_auto_extension
sqlite3_shutdown
sqlite3_config_mempool 0
sqlite3_initialize
}
# run_tests "crash_safe_append" -description { # run_tests "crash_safe_append" -description {
# Run crash.test with persistent journals on a SAFE_APPEND file-system. # Run crash.test with persistent journals on a SAFE_APPEND file-system.
# } -initialize { # } -initialize {