blob: 783cef6176c59cbf30914631095a1a54f4e42e08 [file] [log] [blame]
drh0d180202008-02-14 23:26:56 +00001/*
2** 2007 October 14
3**
4** The author disclaims copyright to this source code. In place of
5** a legal notice, here is a blessing:
6**
7** May you do good and not evil.
8** May you find forgiveness for yourself and forgive others.
9** May you share freely, never taking more than you give.
10**
11*************************************************************************
12** This file contains the C functions that implement a memory
13** allocation subsystem for use by SQLite.
14**
15** This version of the memory allocation subsystem omits all
drh4c5514d2009-08-18 01:54:19 +000016** use of malloc(). The application gives SQLite a block of memory
danielk1977c66c0e12008-06-25 14:26:07 +000017** before calling sqlite3_initialize() from which allocations
18** are made and returned by the xMalloc() and xRealloc()
19** implementations. Once sqlite3_initialize() has been called,
20** the amount of memory available to SQLite is fixed and cannot
21** be changed.
drh0d180202008-02-14 23:26:56 +000022**
danielk1977c66c0e12008-06-25 14:26:07 +000023** This version of the memory allocation subsystem is included
24** in the build only if SQLITE_ENABLE_MEMSYS5 is defined.
drh0d180202008-02-14 23:26:56 +000025**
drh4c5514d2009-08-18 01:54:19 +000026** This memory allocator uses the following algorithm:
27**
28** 1. All memory allocations sizes are rounded up to a power of 2.
29**
drh7c6791c2009-08-18 14:48:53 +000030** 2. If two adjacent free blocks are the halves of a larger block,
31** then the two blocks are coalesed into the single larger block.
drh4c5514d2009-08-18 01:54:19 +000032**
33** 3. New memory is allocated from the first available free block.
34**
35** This algorithm is described in: J. M. Robson. "Bounds for Some Functions
36** Concerning Dynamic Storage Allocation". Journal of the Association for
37** Computing Machinery, Volume 21, Number 8, July 1974, pages 491-499.
38**
39** Let n be the size of the largest allocation divided by the minimum
40** allocation size (after rounding all sizes up to a power of 2.) Let M
41** be the maximum amount of memory ever outstanding at one time. Let
42** N be the total amount of memory available for allocation. Robson
43** proved that this memory allocator will never breakdown due to
44** fragmentation as long as the following constraint holds:
45**
46** N >= M*(1 + log2(n)/2) - n + 1
47**
48** The sqlite3_status() logic tracks the maximum values of n and M so
49** that an application can, at any time, verify this constraint.
drh0d180202008-02-14 23:26:56 +000050*/
51#include "sqliteInt.h"
52
53/*
54** This version of the memory allocator is used only when
drhd1370b62008-10-28 18:58:20 +000055** SQLITE_ENABLE_MEMSYS5 is defined.
drh0d180202008-02-14 23:26:56 +000056*/
danielk1977c66c0e12008-06-25 14:26:07 +000057#ifdef SQLITE_ENABLE_MEMSYS5
drh0d180202008-02-14 23:26:56 +000058
59/*
drh2d7636e2008-02-16 16:21:45 +000060** A minimum allocation is an instance of the following structure.
61** Larger allocations are an array of these structures where the
62** size of the array is a power of 2.
drh4c5514d2009-08-18 01:54:19 +000063**
64** The size of this object must be a power of two. That fact is
65** verified in memsys5Init().
drh2d7636e2008-02-16 16:21:45 +000066*/
danielk19775099be52008-06-27 13:27:03 +000067typedef struct Mem5Link Mem5Link;
68struct Mem5Link {
69 int next; /* Index of next free chunk */
70 int prev; /* Index of previous free chunk */
drh0d180202008-02-14 23:26:56 +000071};
72
73/*
drh7c6791c2009-08-18 14:48:53 +000074** Maximum size of any allocation is ((1<<LOGMAX)*mem5.szAtom). Since
75** mem5.szAtom is always at least 8 and 32-bit integers are used,
drh4c5514d2009-08-18 01:54:19 +000076** it is not actually possible to reach this limit.
drh2d7636e2008-02-16 16:21:45 +000077*/
danielk19775099be52008-06-27 13:27:03 +000078#define LOGMAX 30
drh2d7636e2008-02-16 16:21:45 +000079
80/*
danielk1977c66c0e12008-06-25 14:26:07 +000081** Masks used for mem5.aCtrl[] elements.
drh2d7636e2008-02-16 16:21:45 +000082*/
drh7c6791c2009-08-18 14:48:53 +000083#define CTRL_LOGSIZE 0x1f /* Log2 Size of this block */
drh2d7636e2008-02-16 16:21:45 +000084#define CTRL_FREE 0x20 /* True if not checked out */
85
86/*
drh0d180202008-02-14 23:26:56 +000087** All of the static variables used by this module are collected
danielk1977c66c0e12008-06-25 14:26:07 +000088** into a single structure named "mem5". This is to keep the
drh0d180202008-02-14 23:26:56 +000089** static variables organized and to reduce namespace pollution
90** when this module is combined with other in the amalgamation.
91*/
danielk19775c8f8582008-09-02 10:22:00 +000092static SQLITE_WSD struct Mem5Global {
drh0d180202008-02-14 23:26:56 +000093 /*
danielk197723bf0f42008-09-02 17:52:51 +000094 ** Memory available for allocation
drh0d180202008-02-14 23:26:56 +000095 */
drh7c6791c2009-08-18 14:48:53 +000096 int szAtom; /* Smallest possible allocation in bytes */
97 int nBlock; /* Number of szAtom sized blocks in zPool */
drh4c5514d2009-08-18 01:54:19 +000098 u8 *zPool; /* Memory available to be allocated */
drh0d180202008-02-14 23:26:56 +000099
100 /*
101 ** Mutex to control access to the memory allocation subsystem.
102 */
103 sqlite3_mutex *mutex;
drh2d7636e2008-02-16 16:21:45 +0000104
105 /*
106 ** Performance statistics
107 */
108 u64 nAlloc; /* Total number of calls to malloc */
109 u64 totalAlloc; /* Total of all malloc calls - includes internal frag */
110 u64 totalExcess; /* Total internal fragmentation */
111 u32 currentOut; /* Current checkout, including internal fragmentation */
112 u32 currentCount; /* Current number of distinct checkouts */
113 u32 maxOut; /* Maximum instantaneous currentOut */
114 u32 maxCount; /* Maximum instantaneous currentCount */
115 u32 maxRequest; /* Largest allocation (exclusive of internal frag) */
drh0d180202008-02-14 23:26:56 +0000116
117 /*
drh7c6791c2009-08-18 14:48:53 +0000118 ** Lists of free blocks. aiFreelist[0] is a list of free blocks of
119 ** size mem5.szAtom. aiFreelist[1] holds blocks of size szAtom*2.
120 ** and so forth.
drh0d180202008-02-14 23:26:56 +0000121 */
danielk19775099be52008-06-27 13:27:03 +0000122 int aiFreelist[LOGMAX+1];
drh0d180202008-02-14 23:26:56 +0000123
124 /*
drh2d7636e2008-02-16 16:21:45 +0000125 ** Space for tracking which blocks are checked out and the size
126 ** of each block. One byte per block.
drh0d180202008-02-14 23:26:56 +0000127 */
danielk1977c66c0e12008-06-25 14:26:07 +0000128 u8 *aCtrl;
drh0d180202008-02-14 23:26:56 +0000129
drhfcd71b62011-04-05 22:08:24 +0000130} mem5;
danielk19775c8f8582008-09-02 10:22:00 +0000131
drh4c5514d2009-08-18 01:54:19 +0000132/*
133** Access the static variable through a macro for SQLITE_OMIT_WSD
134*/
danielk19775c8f8582008-09-02 10:22:00 +0000135#define mem5 GLOBAL(struct Mem5Global, mem5)
drh0d180202008-02-14 23:26:56 +0000136
drh4c5514d2009-08-18 01:54:19 +0000137/*
138** Assuming mem5.zPool is divided up into an array of Mem5Link
139** structures, return a pointer to the idx-th such lik.
140*/
drh7c6791c2009-08-18 14:48:53 +0000141#define MEM5LINK(idx) ((Mem5Link *)(&mem5.zPool[(idx)*mem5.szAtom]))
danielk19775099be52008-06-27 13:27:03 +0000142
drh0d180202008-02-14 23:26:56 +0000143/*
danielk1977c66c0e12008-06-25 14:26:07 +0000144** Unlink the chunk at mem5.aPool[i] from list it is currently
145** on. It should be found on mem5.aiFreelist[iLogsize].
drh0d180202008-02-14 23:26:56 +0000146*/
drh2d7636e2008-02-16 16:21:45 +0000147static void memsys5Unlink(int i, int iLogsize){
148 int next, prev;
danielk1977c66c0e12008-06-25 14:26:07 +0000149 assert( i>=0 && i<mem5.nBlock );
danielk19775099be52008-06-27 13:27:03 +0000150 assert( iLogsize>=0 && iLogsize<=LOGMAX );
danielk1977c66c0e12008-06-25 14:26:07 +0000151 assert( (mem5.aCtrl[i] & CTRL_LOGSIZE)==iLogsize );
drh2d7636e2008-02-16 16:21:45 +0000152
danielk19775099be52008-06-27 13:27:03 +0000153 next = MEM5LINK(i)->next;
154 prev = MEM5LINK(i)->prev;
drh2d7636e2008-02-16 16:21:45 +0000155 if( prev<0 ){
danielk1977c66c0e12008-06-25 14:26:07 +0000156 mem5.aiFreelist[iLogsize] = next;
drh0d180202008-02-14 23:26:56 +0000157 }else{
danielk19775099be52008-06-27 13:27:03 +0000158 MEM5LINK(prev)->next = next;
drh0d180202008-02-14 23:26:56 +0000159 }
drh2d7636e2008-02-16 16:21:45 +0000160 if( next>=0 ){
danielk19775099be52008-06-27 13:27:03 +0000161 MEM5LINK(next)->prev = prev;
drh0d180202008-02-14 23:26:56 +0000162 }
drh0d180202008-02-14 23:26:56 +0000163}
164
165/*
danielk1977c66c0e12008-06-25 14:26:07 +0000166** Link the chunk at mem5.aPool[i] so that is on the iLogsize
drh2d7636e2008-02-16 16:21:45 +0000167** free list.
drh0d180202008-02-14 23:26:56 +0000168*/
drh2d7636e2008-02-16 16:21:45 +0000169static void memsys5Link(int i, int iLogsize){
170 int x;
danielk1977c66c0e12008-06-25 14:26:07 +0000171 assert( sqlite3_mutex_held(mem5.mutex) );
172 assert( i>=0 && i<mem5.nBlock );
danielk19775099be52008-06-27 13:27:03 +0000173 assert( iLogsize>=0 && iLogsize<=LOGMAX );
danielk1977c66c0e12008-06-25 14:26:07 +0000174 assert( (mem5.aCtrl[i] & CTRL_LOGSIZE)==iLogsize );
drh0d180202008-02-14 23:26:56 +0000175
danielk19775099be52008-06-27 13:27:03 +0000176 x = MEM5LINK(i)->next = mem5.aiFreelist[iLogsize];
177 MEM5LINK(i)->prev = -1;
drh2d7636e2008-02-16 16:21:45 +0000178 if( x>=0 ){
danielk1977c66c0e12008-06-25 14:26:07 +0000179 assert( x<mem5.nBlock );
danielk19775099be52008-06-27 13:27:03 +0000180 MEM5LINK(x)->prev = i;
drh0d180202008-02-14 23:26:56 +0000181 }
danielk1977c66c0e12008-06-25 14:26:07 +0000182 mem5.aiFreelist[iLogsize] = i;
drh0d180202008-02-14 23:26:56 +0000183}
184
185/*
danielk19776b39c2e2008-06-25 14:57:53 +0000186** If the STATIC_MEM mutex is not already held, obtain it now. The mutex
187** will already be held (obtained by code in malloc.c) if
danielk1977075c23a2008-09-01 18:34:20 +0000188** sqlite3GlobalConfig.bMemStat is true.
drh0d180202008-02-14 23:26:56 +0000189*/
drh2d7636e2008-02-16 16:21:45 +0000190static void memsys5Enter(void){
danielk19776b39c2e2008-06-25 14:57:53 +0000191 sqlite3_mutex_enter(mem5.mutex);
drh0d180202008-02-14 23:26:56 +0000192}
danielk1977c66c0e12008-06-25 14:26:07 +0000193static void memsys5Leave(void){
danielk19776b39c2e2008-06-25 14:57:53 +0000194 sqlite3_mutex_leave(mem5.mutex);
drh0d180202008-02-14 23:26:56 +0000195}
196
197/*
drh0d180202008-02-14 23:26:56 +0000198** Return the size of an outstanding allocation, in bytes. The
199** size returned omits the 8-byte header overhead. This only
200** works for chunks that are currently checked out.
201*/
danielk1977c66c0e12008-06-25 14:26:07 +0000202static int memsys5Size(void *p){
drh0d180202008-02-14 23:26:56 +0000203 int iSize = 0;
204 if( p ){
drh7c6791c2009-08-18 14:48:53 +0000205 int i = ((u8 *)p-mem5.zPool)/mem5.szAtom;
danielk1977c66c0e12008-06-25 14:26:07 +0000206 assert( i>=0 && i<mem5.nBlock );
drh7c6791c2009-08-18 14:48:53 +0000207 iSize = mem5.szAtom * (1 << (mem5.aCtrl[i]&CTRL_LOGSIZE));
drh0d180202008-02-14 23:26:56 +0000208 }
209 return iSize;
210}
211
212/*
drh2d7636e2008-02-16 16:21:45 +0000213** Find the first entry on the freelist iLogsize. Unlink that
214** entry and return its index.
drh0d180202008-02-14 23:26:56 +0000215*/
drh2d7636e2008-02-16 16:21:45 +0000216static int memsys5UnlinkFirst(int iLogsize){
217 int i;
218 int iFirst;
drh0d180202008-02-14 23:26:56 +0000219
danielk19775099be52008-06-27 13:27:03 +0000220 assert( iLogsize>=0 && iLogsize<=LOGMAX );
danielk1977c66c0e12008-06-25 14:26:07 +0000221 i = iFirst = mem5.aiFreelist[iLogsize];
drh2d7636e2008-02-16 16:21:45 +0000222 assert( iFirst>=0 );
223 while( i>0 ){
224 if( i<iFirst ) iFirst = i;
danielk19775099be52008-06-27 13:27:03 +0000225 i = MEM5LINK(i)->next;
drh0d180202008-02-14 23:26:56 +0000226 }
drh2d7636e2008-02-16 16:21:45 +0000227 memsys5Unlink(iFirst, iLogsize);
228 return iFirst;
drh0d180202008-02-14 23:26:56 +0000229}
230
231/*
232** Return a block of memory of at least nBytes in size.
drh4c5514d2009-08-18 01:54:19 +0000233** Return NULL if unable. Return NULL if nBytes==0.
234**
235** The caller guarantees that nByte positive.
236**
237** The caller has obtained a mutex prior to invoking this
238** routine so there is never any chance that two or more
239** threads can be in this routine at the same time.
drh0d180202008-02-14 23:26:56 +0000240*/
danielk1977c66c0e12008-06-25 14:26:07 +0000241static void *memsys5MallocUnsafe(int nByte){
242 int i; /* Index of a mem5.aPool[] slot */
243 int iBin; /* Index into mem5.aiFreelist[] */
drh2d7636e2008-02-16 16:21:45 +0000244 int iFullSz; /* Size of allocation rounded up to power of 2 */
245 int iLogsize; /* Log2 of iFullSz/POW2_MIN */
drh0d180202008-02-14 23:26:56 +0000246
drh4c5514d2009-08-18 01:54:19 +0000247 /* nByte must be a positive */
248 assert( nByte>0 );
249
drheee4c8c2008-02-18 22:24:57 +0000250 /* Keep track of the maximum allocation request. Even unfulfilled
251 ** requests are counted */
danielk197700e13612008-11-17 19:18:54 +0000252 if( (u32)nByte>mem5.maxRequest ){
danielk1977c66c0e12008-06-25 14:26:07 +0000253 mem5.maxRequest = nByte;
drheee4c8c2008-02-18 22:24:57 +0000254 }
255
drh7c6791c2009-08-18 14:48:53 +0000256 /* Abort if the requested allocation size is larger than the largest
257 ** power of two that we can represent using 32-bit signed integers.
258 */
drh4c5514d2009-08-18 01:54:19 +0000259 if( nByte > 0x40000000 ){
260 return 0;
261 }
262
drheee4c8c2008-02-18 22:24:57 +0000263 /* Round nByte up to the next valid power of two */
drh7c6791c2009-08-18 14:48:53 +0000264 for(iFullSz=mem5.szAtom, iLogsize=0; iFullSz<nByte; iFullSz *= 2, iLogsize++){}
drh0d180202008-02-14 23:26:56 +0000265
danielk1977c66c0e12008-06-25 14:26:07 +0000266 /* Make sure mem5.aiFreelist[iLogsize] contains at least one free
drheee4c8c2008-02-18 22:24:57 +0000267 ** block. If not, then split a block of the next larger power of
268 ** two in order to create a new free block of size iLogsize.
269 */
danielk19775099be52008-06-27 13:27:03 +0000270 for(iBin=iLogsize; mem5.aiFreelist[iBin]<0 && iBin<=LOGMAX; iBin++){}
drh413c3d32010-02-23 20:11:56 +0000271 if( iBin>LOGMAX ){
drhaf46dc12010-02-24 21:44:07 +0000272 testcase( sqlite3GlobalConfig.xLog!=0 );
drh413c3d32010-02-23 20:11:56 +0000273 sqlite3_log(SQLITE_NOMEM, "failed to allocate %u bytes", nByte);
274 return 0;
275 }
drh2d7636e2008-02-16 16:21:45 +0000276 i = memsys5UnlinkFirst(iBin);
277 while( iBin>iLogsize ){
278 int newSize;
279
280 iBin--;
281 newSize = 1 << iBin;
danielk1977c66c0e12008-06-25 14:26:07 +0000282 mem5.aCtrl[i+newSize] = CTRL_FREE | iBin;
drh2d7636e2008-02-16 16:21:45 +0000283 memsys5Link(i+newSize, iBin);
drh0d180202008-02-14 23:26:56 +0000284 }
danielk1977c66c0e12008-06-25 14:26:07 +0000285 mem5.aCtrl[i] = iLogsize;
drh0d180202008-02-14 23:26:56 +0000286
drheee4c8c2008-02-18 22:24:57 +0000287 /* Update allocator performance statistics. */
danielk1977c66c0e12008-06-25 14:26:07 +0000288 mem5.nAlloc++;
289 mem5.totalAlloc += iFullSz;
290 mem5.totalExcess += iFullSz - nByte;
291 mem5.currentCount++;
292 mem5.currentOut += iFullSz;
293 if( mem5.maxCount<mem5.currentCount ) mem5.maxCount = mem5.currentCount;
294 if( mem5.maxOut<mem5.currentOut ) mem5.maxOut = mem5.currentOut;
drh0d180202008-02-14 23:26:56 +0000295
drheee4c8c2008-02-18 22:24:57 +0000296 /* Return a pointer to the allocated memory. */
drh7c6791c2009-08-18 14:48:53 +0000297 return (void*)&mem5.zPool[i*mem5.szAtom];
drh0d180202008-02-14 23:26:56 +0000298}
299
300/*
301** Free an outstanding memory allocation.
302*/
danielk1977c66c0e12008-06-25 14:26:07 +0000303static void memsys5FreeUnsafe(void *pOld){
drh2d7636e2008-02-16 16:21:45 +0000304 u32 size, iLogsize;
drh4c5514d2009-08-18 01:54:19 +0000305 int iBlock;
drh0d180202008-02-14 23:26:56 +0000306
danielk19775099be52008-06-27 13:27:03 +0000307 /* Set iBlock to the index of the block pointed to by pOld in
drh7c6791c2009-08-18 14:48:53 +0000308 ** the array of mem5.szAtom byte blocks pointed to by mem5.zPool.
danielk19775099be52008-06-27 13:27:03 +0000309 */
drh7c6791c2009-08-18 14:48:53 +0000310 iBlock = ((u8 *)pOld-mem5.zPool)/mem5.szAtom;
danielk19775099be52008-06-27 13:27:03 +0000311
312 /* Check that the pointer pOld points to a valid, non-free block. */
313 assert( iBlock>=0 && iBlock<mem5.nBlock );
drh7c6791c2009-08-18 14:48:53 +0000314 assert( ((u8 *)pOld-mem5.zPool)%mem5.szAtom==0 );
danielk19775099be52008-06-27 13:27:03 +0000315 assert( (mem5.aCtrl[iBlock] & CTRL_FREE)==0 );
316
317 iLogsize = mem5.aCtrl[iBlock] & CTRL_LOGSIZE;
drh2d7636e2008-02-16 16:21:45 +0000318 size = 1<<iLogsize;
danielk197700e13612008-11-17 19:18:54 +0000319 assert( iBlock+size-1<(u32)mem5.nBlock );
danielk19775099be52008-06-27 13:27:03 +0000320
321 mem5.aCtrl[iBlock] |= CTRL_FREE;
322 mem5.aCtrl[iBlock+size-1] |= CTRL_FREE;
danielk1977c66c0e12008-06-25 14:26:07 +0000323 assert( mem5.currentCount>0 );
drh7c6791c2009-08-18 14:48:53 +0000324 assert( mem5.currentOut>=(size*mem5.szAtom) );
danielk1977c66c0e12008-06-25 14:26:07 +0000325 mem5.currentCount--;
drh7c6791c2009-08-18 14:48:53 +0000326 mem5.currentOut -= size*mem5.szAtom;
danielk1977c66c0e12008-06-25 14:26:07 +0000327 assert( mem5.currentOut>0 || mem5.currentCount==0 );
328 assert( mem5.currentCount>0 || mem5.currentOut==0 );
drh2d7636e2008-02-16 16:21:45 +0000329
danielk19775099be52008-06-27 13:27:03 +0000330 mem5.aCtrl[iBlock] = CTRL_FREE | iLogsize;
drh7c6791c2009-08-18 14:48:53 +0000331 while( ALWAYS(iLogsize<LOGMAX) ){
drh2d7636e2008-02-16 16:21:45 +0000332 int iBuddy;
danielk19775099be52008-06-27 13:27:03 +0000333 if( (iBlock>>iLogsize) & 1 ){
334 iBuddy = iBlock - size;
drh2d7636e2008-02-16 16:21:45 +0000335 }else{
danielk19775099be52008-06-27 13:27:03 +0000336 iBuddy = iBlock + size;
drh0d180202008-02-14 23:26:56 +0000337 }
danielk19775099be52008-06-27 13:27:03 +0000338 assert( iBuddy>=0 );
339 if( (iBuddy+(1<<iLogsize))>mem5.nBlock ) break;
danielk1977c66c0e12008-06-25 14:26:07 +0000340 if( mem5.aCtrl[iBuddy]!=(CTRL_FREE | iLogsize) ) break;
drh2d7636e2008-02-16 16:21:45 +0000341 memsys5Unlink(iBuddy, iLogsize);
342 iLogsize++;
danielk19775099be52008-06-27 13:27:03 +0000343 if( iBuddy<iBlock ){
danielk1977c66c0e12008-06-25 14:26:07 +0000344 mem5.aCtrl[iBuddy] = CTRL_FREE | iLogsize;
danielk19775099be52008-06-27 13:27:03 +0000345 mem5.aCtrl[iBlock] = 0;
346 iBlock = iBuddy;
drh2d7636e2008-02-16 16:21:45 +0000347 }else{
danielk19775099be52008-06-27 13:27:03 +0000348 mem5.aCtrl[iBlock] = CTRL_FREE | iLogsize;
danielk1977c66c0e12008-06-25 14:26:07 +0000349 mem5.aCtrl[iBuddy] = 0;
drh0d180202008-02-14 23:26:56 +0000350 }
drh2d7636e2008-02-16 16:21:45 +0000351 size *= 2;
drh0d180202008-02-14 23:26:56 +0000352 }
danielk19775099be52008-06-27 13:27:03 +0000353 memsys5Link(iBlock, iLogsize);
drh0d180202008-02-14 23:26:56 +0000354}
355
356/*
357** Allocate nBytes of memory
358*/
danielk1977c66c0e12008-06-25 14:26:07 +0000359static void *memsys5Malloc(int nBytes){
drh0d180202008-02-14 23:26:56 +0000360 sqlite3_int64 *p = 0;
361 if( nBytes>0 ){
drh2d7636e2008-02-16 16:21:45 +0000362 memsys5Enter();
danielk1977c66c0e12008-06-25 14:26:07 +0000363 p = memsys5MallocUnsafe(nBytes);
364 memsys5Leave();
drh0d180202008-02-14 23:26:56 +0000365 }
366 return (void*)p;
367}
368
369/*
370** Free memory.
drh4c5514d2009-08-18 01:54:19 +0000371**
372** The outer layer memory allocator prevents this routine from
373** being called with pPrior==0.
drh0d180202008-02-14 23:26:56 +0000374*/
danielk1977c66c0e12008-06-25 14:26:07 +0000375static void memsys5Free(void *pPrior){
drh4c5514d2009-08-18 01:54:19 +0000376 assert( pPrior!=0 );
danielk1977c66c0e12008-06-25 14:26:07 +0000377 memsys5Enter();
378 memsys5FreeUnsafe(pPrior);
379 memsys5Leave();
drh0d180202008-02-14 23:26:56 +0000380}
381
382/*
drh4c5514d2009-08-18 01:54:19 +0000383** Change the size of an existing memory allocation.
384**
385** The outer layer memory allocator prevents this routine from
drh7c6791c2009-08-18 14:48:53 +0000386** being called with pPrior==0.
387**
388** nBytes is always a value obtained from a prior call to
389** memsys5Round(). Hence nBytes is always a non-negative power
390** of two. If nBytes==0 that means that an oversize allocation
391** (an allocation larger than 0x40000000) was requested and this
392** routine should return 0 without freeing pPrior.
drh0d180202008-02-14 23:26:56 +0000393*/
danielk1977c66c0e12008-06-25 14:26:07 +0000394static void *memsys5Realloc(void *pPrior, int nBytes){
drh0d180202008-02-14 23:26:56 +0000395 int nOld;
396 void *p;
drh4c5514d2009-08-18 01:54:19 +0000397 assert( pPrior!=0 );
drh9f129f42010-08-31 15:27:32 +0000398 assert( (nBytes&(nBytes-1))==0 ); /* EV: R-46199-30249 */
drh7c6791c2009-08-18 14:48:53 +0000399 assert( nBytes>=0 );
400 if( nBytes==0 ){
drh0d180202008-02-14 23:26:56 +0000401 return 0;
402 }
danielk1977c66c0e12008-06-25 14:26:07 +0000403 nOld = memsys5Size(pPrior);
drh2d7636e2008-02-16 16:21:45 +0000404 if( nBytes<=nOld ){
drh0d180202008-02-14 23:26:56 +0000405 return pPrior;
406 }
danielk1977c66c0e12008-06-25 14:26:07 +0000407 memsys5Enter();
408 p = memsys5MallocUnsafe(nBytes);
drh0d180202008-02-14 23:26:56 +0000409 if( p ){
drh2d7636e2008-02-16 16:21:45 +0000410 memcpy(p, pPrior, nOld);
danielk1977c66c0e12008-06-25 14:26:07 +0000411 memsys5FreeUnsafe(pPrior);
drh0d180202008-02-14 23:26:56 +0000412 }
danielk1977c66c0e12008-06-25 14:26:07 +0000413 memsys5Leave();
drh0d180202008-02-14 23:26:56 +0000414 return p;
415}
416
417/*
drh4c5514d2009-08-18 01:54:19 +0000418** Round up a request size to the next valid allocation size. If
419** the allocation is too large to be handled by this allocation system,
420** return 0.
drh7c6791c2009-08-18 14:48:53 +0000421**
422** All allocations must be a power of two and must be expressed by a
423** 32-bit signed integer. Hence the largest allocation is 0x40000000
424** or 1073741824 bytes.
danielk1977c66c0e12008-06-25 14:26:07 +0000425*/
426static int memsys5Roundup(int n){
427 int iFullSz;
drh4c5514d2009-08-18 01:54:19 +0000428 if( n > 0x40000000 ) return 0;
drh7c6791c2009-08-18 14:48:53 +0000429 for(iFullSz=mem5.szAtom; iFullSz<n; iFullSz *= 2);
danielk1977c66c0e12008-06-25 14:26:07 +0000430 return iFullSz;
431}
432
drh4c5514d2009-08-18 01:54:19 +0000433/*
drh7c6791c2009-08-18 14:48:53 +0000434** Return the ceiling of the logarithm base 2 of iValue.
435**
436** Examples: memsys5Log(1) -> 0
437** memsys5Log(2) -> 1
438** memsys5Log(4) -> 2
439** memsys5Log(5) -> 3
440** memsys5Log(8) -> 3
441** memsys5Log(9) -> 4
drh4c5514d2009-08-18 01:54:19 +0000442*/
danielk19775099be52008-06-27 13:27:03 +0000443static int memsys5Log(int iValue){
444 int iLog;
drhfcd71b62011-04-05 22:08:24 +0000445 for(iLog=0; (iLog<(int)((sizeof(int)*8)-1)) && (1<<iLog)<iValue; iLog++);
danielk19775099be52008-06-27 13:27:03 +0000446 return iLog;
447}
448
danielk1977c66c0e12008-06-25 14:26:07 +0000449/*
drh7c6791c2009-08-18 14:48:53 +0000450** Initialize the memory allocator.
drh1b257532009-08-18 15:33:44 +0000451**
452** This routine is not threadsafe. The caller must be holding a mutex
453** to prevent multiple threads from entering at the same time.
danielk1977c66c0e12008-06-25 14:26:07 +0000454*/
455static int memsys5Init(void *NotUsed){
drh7c6791c2009-08-18 14:48:53 +0000456 int ii; /* Loop counter */
457 int nByte; /* Number of bytes of memory available to this allocator */
458 u8 *zByte; /* Memory usable by this allocator */
459 int nMinLog; /* Log base 2 of minimum allocation size in bytes */
460 int iOffset; /* An offset into mem5.aCtrl[] */
danielk19775099be52008-06-27 13:27:03 +0000461
danielk1977a03396a2008-11-19 14:35:46 +0000462 UNUSED_PARAMETER(NotUsed);
463
drh1b257532009-08-18 15:33:44 +0000464 /* For the purposes of this routine, disable the mutex */
465 mem5.mutex = 0;
466
drh7c6791c2009-08-18 14:48:53 +0000467 /* The size of a Mem5Link object must be a power of two. Verify that
468 ** this is case.
469 */
470 assert( (sizeof(Mem5Link)&(sizeof(Mem5Link)-1))==0 );
471
472 nByte = sqlite3GlobalConfig.nHeap;
473 zByte = (u8*)sqlite3GlobalConfig.pHeap;
474 assert( zByte!=0 ); /* sqlite3_config() does not allow otherwise */
danielk19770d84e5b2008-06-27 14:05:24 +0000475
shaneha6ec8922011-03-09 21:36:17 +0000476 /* boundaries on sqlite3GlobalConfig.mnReq are enforced in sqlite3_config() */
shaneh93247942011-03-10 03:54:55 +0000477 nMinLog = memsys5Log(sqlite3GlobalConfig.mnReq);
drh7c6791c2009-08-18 14:48:53 +0000478 mem5.szAtom = (1<<nMinLog);
479 while( (int)sizeof(Mem5Link)>mem5.szAtom ){
480 mem5.szAtom = mem5.szAtom << 1;
danielk19775099be52008-06-27 13:27:03 +0000481 }
482
drh7c6791c2009-08-18 14:48:53 +0000483 mem5.nBlock = (nByte / (mem5.szAtom+sizeof(u8)));
danielk19775099be52008-06-27 13:27:03 +0000484 mem5.zPool = zByte;
drh7c6791c2009-08-18 14:48:53 +0000485 mem5.aCtrl = (u8 *)&mem5.zPool[mem5.nBlock*mem5.szAtom];
danielk19775099be52008-06-27 13:27:03 +0000486
487 for(ii=0; ii<=LOGMAX; ii++){
488 mem5.aiFreelist[ii] = -1;
489 }
490
491 iOffset = 0;
492 for(ii=LOGMAX; ii>=0; ii--){
493 int nAlloc = (1<<ii);
494 if( (iOffset+nAlloc)<=mem5.nBlock ){
495 mem5.aCtrl[iOffset] = ii | CTRL_FREE;
496 memsys5Link(iOffset, ii);
497 iOffset += nAlloc;
498 }
499 assert((iOffset+nAlloc)>mem5.nBlock);
500 }
501
drh1b257532009-08-18 15:33:44 +0000502 /* If a mutex is required for normal operation, allocate one */
drhdaf4a9f2009-08-20 20:05:55 +0000503 if( sqlite3GlobalConfig.bMemstat==0 ){
drh1b257532009-08-18 15:33:44 +0000504 mem5.mutex = sqlite3MutexAlloc(SQLITE_MUTEX_STATIC_MEM);
505 }
506
danielk1977c66c0e12008-06-25 14:26:07 +0000507 return SQLITE_OK;
508}
509
510/*
511** Deinitialize this module.
512*/
513static void memsys5Shutdown(void *NotUsed){
danielk1977a03396a2008-11-19 14:35:46 +0000514 UNUSED_PARAMETER(NotUsed);
drh15385ad2009-08-18 12:16:03 +0000515 mem5.mutex = 0;
danielk1977c66c0e12008-06-25 14:26:07 +0000516 return;
517}
518
drh7c6791c2009-08-18 14:48:53 +0000519#ifdef SQLITE_TEST
danielk1977c66c0e12008-06-25 14:26:07 +0000520/*
drh0d180202008-02-14 23:26:56 +0000521** Open the file indicated and write a log of all unfreed memory
522** allocations into that log.
523*/
danielk1977c66c0e12008-06-25 14:26:07 +0000524void sqlite3Memsys5Dump(const char *zFilename){
drh0d180202008-02-14 23:26:56 +0000525 FILE *out;
drh2d7636e2008-02-16 16:21:45 +0000526 int i, j, n;
danielk19775099be52008-06-27 13:27:03 +0000527 int nMinLog;
drh2d7636e2008-02-16 16:21:45 +0000528
drh0d180202008-02-14 23:26:56 +0000529 if( zFilename==0 || zFilename[0]==0 ){
530 out = stdout;
531 }else{
532 out = fopen(zFilename, "w");
533 if( out==0 ){
534 fprintf(stderr, "** Unable to output memory debug output log: %s **\n",
535 zFilename);
536 return;
537 }
538 }
drh2d7636e2008-02-16 16:21:45 +0000539 memsys5Enter();
drh7c6791c2009-08-18 14:48:53 +0000540 nMinLog = memsys5Log(mem5.szAtom);
danielk19775099be52008-06-27 13:27:03 +0000541 for(i=0; i<=LOGMAX && i+nMinLog<32; i++){
542 for(n=0, j=mem5.aiFreelist[i]; j>=0; j = MEM5LINK(j)->next, n++){}
drh7c6791c2009-08-18 14:48:53 +0000543 fprintf(out, "freelist items of size %d: %d\n", mem5.szAtom << i, n);
drh0d180202008-02-14 23:26:56 +0000544 }
danielk1977c66c0e12008-06-25 14:26:07 +0000545 fprintf(out, "mem5.nAlloc = %llu\n", mem5.nAlloc);
546 fprintf(out, "mem5.totalAlloc = %llu\n", mem5.totalAlloc);
547 fprintf(out, "mem5.totalExcess = %llu\n", mem5.totalExcess);
548 fprintf(out, "mem5.currentOut = %u\n", mem5.currentOut);
549 fprintf(out, "mem5.currentCount = %u\n", mem5.currentCount);
550 fprintf(out, "mem5.maxOut = %u\n", mem5.maxOut);
551 fprintf(out, "mem5.maxCount = %u\n", mem5.maxCount);
552 fprintf(out, "mem5.maxRequest = %u\n", mem5.maxRequest);
553 memsys5Leave();
drh0d180202008-02-14 23:26:56 +0000554 if( out==stdout ){
555 fflush(stdout);
556 }else{
557 fclose(out);
558 }
drh0d180202008-02-14 23:26:56 +0000559}
drh7c6791c2009-08-18 14:48:53 +0000560#endif
drh0d180202008-02-14 23:26:56 +0000561
danielk1977c66c0e12008-06-25 14:26:07 +0000562/*
563** This routine is the only routine in this file with external
danielk19775099be52008-06-27 13:27:03 +0000564** linkage. It returns a pointer to a static sqlite3_mem_methods
565** struct populated with the memsys5 methods.
danielk1977c66c0e12008-06-25 14:26:07 +0000566*/
danielk19775099be52008-06-27 13:27:03 +0000567const sqlite3_mem_methods *sqlite3MemGetMemsys5(void){
danielk1977c66c0e12008-06-25 14:26:07 +0000568 static const sqlite3_mem_methods memsys5Methods = {
569 memsys5Malloc,
570 memsys5Free,
571 memsys5Realloc,
572 memsys5Size,
573 memsys5Roundup,
574 memsys5Init,
575 memsys5Shutdown,
576 0
577 };
danielk19775099be52008-06-27 13:27:03 +0000578 return &memsys5Methods;
danielk1977c66c0e12008-06-25 14:26:07 +0000579}
580
581#endif /* SQLITE_ENABLE_MEMSYS5 */