drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 1 | /* |
| 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 |
drh | 4c5514d | 2009-08-18 01:54:19 +0000 | [diff] [blame] | 16 | ** use of malloc(). The application gives SQLite a block of memory |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 17 | ** 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. |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 22 | ** |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 23 | ** This version of the memory allocation subsystem is included |
| 24 | ** in the build only if SQLITE_ENABLE_MEMSYS5 is defined. |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 25 | ** |
drh | 4c5514d | 2009-08-18 01:54:19 +0000 | [diff] [blame] | 26 | ** This memory allocator uses the following algorithm: |
| 27 | ** |
| 28 | ** 1. All memory allocations sizes are rounded up to a power of 2. |
| 29 | ** |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 30 | ** 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. |
drh | 4c5514d | 2009-08-18 01:54:19 +0000 | [diff] [blame] | 32 | ** |
| 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. |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 50 | */ |
| 51 | #include "sqliteInt.h" |
| 52 | |
| 53 | /* |
| 54 | ** This version of the memory allocator is used only when |
drh | d1370b6 | 2008-10-28 18:58:20 +0000 | [diff] [blame] | 55 | ** SQLITE_ENABLE_MEMSYS5 is defined. |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 56 | */ |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 57 | #ifdef SQLITE_ENABLE_MEMSYS5 |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 58 | |
| 59 | /* |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 60 | ** 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. |
drh | 4c5514d | 2009-08-18 01:54:19 +0000 | [diff] [blame] | 63 | ** |
| 64 | ** The size of this object must be a power of two. That fact is |
| 65 | ** verified in memsys5Init(). |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 66 | */ |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 67 | typedef struct Mem5Link Mem5Link; |
| 68 | struct Mem5Link { |
| 69 | int next; /* Index of next free chunk */ |
| 70 | int prev; /* Index of previous free chunk */ |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 71 | }; |
| 72 | |
| 73 | /* |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 74 | ** 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, |
drh | 4c5514d | 2009-08-18 01:54:19 +0000 | [diff] [blame] | 76 | ** it is not actually possible to reach this limit. |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 77 | */ |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 78 | #define LOGMAX 30 |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 79 | |
| 80 | /* |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 81 | ** Masks used for mem5.aCtrl[] elements. |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 82 | */ |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 83 | #define CTRL_LOGSIZE 0x1f /* Log2 Size of this block */ |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 84 | #define CTRL_FREE 0x20 /* True if not checked out */ |
| 85 | |
| 86 | /* |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 87 | ** All of the static variables used by this module are collected |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 88 | ** into a single structure named "mem5". This is to keep the |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 89 | ** static variables organized and to reduce namespace pollution |
| 90 | ** when this module is combined with other in the amalgamation. |
| 91 | */ |
danielk1977 | 5c8f858 | 2008-09-02 10:22:00 +0000 | [diff] [blame] | 92 | static SQLITE_WSD struct Mem5Global { |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 93 | /* |
danielk1977 | 23bf0f4 | 2008-09-02 17:52:51 +0000 | [diff] [blame] | 94 | ** Memory available for allocation |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 95 | */ |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 96 | int szAtom; /* Smallest possible allocation in bytes */ |
| 97 | int nBlock; /* Number of szAtom sized blocks in zPool */ |
drh | 4c5514d | 2009-08-18 01:54:19 +0000 | [diff] [blame] | 98 | u8 *zPool; /* Memory available to be allocated */ |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 99 | |
| 100 | /* |
| 101 | ** Mutex to control access to the memory allocation subsystem. |
| 102 | */ |
| 103 | sqlite3_mutex *mutex; |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 104 | |
| 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) */ |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 116 | |
| 117 | /* |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 118 | ** 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. |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 121 | */ |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 122 | int aiFreelist[LOGMAX+1]; |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 123 | |
| 124 | /* |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 125 | ** Space for tracking which blocks are checked out and the size |
| 126 | ** of each block. One byte per block. |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 127 | */ |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 128 | u8 *aCtrl; |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 129 | |
drh | fcd71b6 | 2011-04-05 22:08:24 +0000 | [diff] [blame] | 130 | } mem5; |
danielk1977 | 5c8f858 | 2008-09-02 10:22:00 +0000 | [diff] [blame] | 131 | |
drh | 4c5514d | 2009-08-18 01:54:19 +0000 | [diff] [blame] | 132 | /* |
| 133 | ** Access the static variable through a macro for SQLITE_OMIT_WSD |
| 134 | */ |
danielk1977 | 5c8f858 | 2008-09-02 10:22:00 +0000 | [diff] [blame] | 135 | #define mem5 GLOBAL(struct Mem5Global, mem5) |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 136 | |
drh | 4c5514d | 2009-08-18 01:54:19 +0000 | [diff] [blame] | 137 | /* |
| 138 | ** Assuming mem5.zPool is divided up into an array of Mem5Link |
| 139 | ** structures, return a pointer to the idx-th such lik. |
| 140 | */ |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 141 | #define MEM5LINK(idx) ((Mem5Link *)(&mem5.zPool[(idx)*mem5.szAtom])) |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 142 | |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 143 | /* |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 144 | ** Unlink the chunk at mem5.aPool[i] from list it is currently |
| 145 | ** on. It should be found on mem5.aiFreelist[iLogsize]. |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 146 | */ |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 147 | static void memsys5Unlink(int i, int iLogsize){ |
| 148 | int next, prev; |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 149 | assert( i>=0 && i<mem5.nBlock ); |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 150 | assert( iLogsize>=0 && iLogsize<=LOGMAX ); |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 151 | assert( (mem5.aCtrl[i] & CTRL_LOGSIZE)==iLogsize ); |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 152 | |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 153 | next = MEM5LINK(i)->next; |
| 154 | prev = MEM5LINK(i)->prev; |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 155 | if( prev<0 ){ |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 156 | mem5.aiFreelist[iLogsize] = next; |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 157 | }else{ |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 158 | MEM5LINK(prev)->next = next; |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 159 | } |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 160 | if( next>=0 ){ |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 161 | MEM5LINK(next)->prev = prev; |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 162 | } |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 163 | } |
| 164 | |
| 165 | /* |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 166 | ** Link the chunk at mem5.aPool[i] so that is on the iLogsize |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 167 | ** free list. |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 168 | */ |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 169 | static void memsys5Link(int i, int iLogsize){ |
| 170 | int x; |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 171 | assert( sqlite3_mutex_held(mem5.mutex) ); |
| 172 | assert( i>=0 && i<mem5.nBlock ); |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 173 | assert( iLogsize>=0 && iLogsize<=LOGMAX ); |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 174 | assert( (mem5.aCtrl[i] & CTRL_LOGSIZE)==iLogsize ); |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 175 | |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 176 | x = MEM5LINK(i)->next = mem5.aiFreelist[iLogsize]; |
| 177 | MEM5LINK(i)->prev = -1; |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 178 | if( x>=0 ){ |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 179 | assert( x<mem5.nBlock ); |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 180 | MEM5LINK(x)->prev = i; |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 181 | } |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 182 | mem5.aiFreelist[iLogsize] = i; |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 183 | } |
| 184 | |
| 185 | /* |
danielk1977 | 6b39c2e | 2008-06-25 14:57:53 +0000 | [diff] [blame] | 186 | ** 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 |
danielk1977 | 075c23a | 2008-09-01 18:34:20 +0000 | [diff] [blame] | 188 | ** sqlite3GlobalConfig.bMemStat is true. |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 189 | */ |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 190 | static void memsys5Enter(void){ |
danielk1977 | 6b39c2e | 2008-06-25 14:57:53 +0000 | [diff] [blame] | 191 | sqlite3_mutex_enter(mem5.mutex); |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 192 | } |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 193 | static void memsys5Leave(void){ |
danielk1977 | 6b39c2e | 2008-06-25 14:57:53 +0000 | [diff] [blame] | 194 | sqlite3_mutex_leave(mem5.mutex); |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 195 | } |
| 196 | |
| 197 | /* |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 198 | ** 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 | */ |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 202 | static int memsys5Size(void *p){ |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 203 | int iSize = 0; |
| 204 | if( p ){ |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 205 | int i = ((u8 *)p-mem5.zPool)/mem5.szAtom; |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 206 | assert( i>=0 && i<mem5.nBlock ); |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 207 | iSize = mem5.szAtom * (1 << (mem5.aCtrl[i]&CTRL_LOGSIZE)); |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 208 | } |
| 209 | return iSize; |
| 210 | } |
| 211 | |
| 212 | /* |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 213 | ** Find the first entry on the freelist iLogsize. Unlink that |
| 214 | ** entry and return its index. |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 215 | */ |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 216 | static int memsys5UnlinkFirst(int iLogsize){ |
| 217 | int i; |
| 218 | int iFirst; |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 219 | |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 220 | assert( iLogsize>=0 && iLogsize<=LOGMAX ); |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 221 | i = iFirst = mem5.aiFreelist[iLogsize]; |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 222 | assert( iFirst>=0 ); |
| 223 | while( i>0 ){ |
| 224 | if( i<iFirst ) iFirst = i; |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 225 | i = MEM5LINK(i)->next; |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 226 | } |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 227 | memsys5Unlink(iFirst, iLogsize); |
| 228 | return iFirst; |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 229 | } |
| 230 | |
| 231 | /* |
| 232 | ** Return a block of memory of at least nBytes in size. |
drh | 4c5514d | 2009-08-18 01:54:19 +0000 | [diff] [blame] | 233 | ** 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. |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 240 | */ |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 241 | static void *memsys5MallocUnsafe(int nByte){ |
| 242 | int i; /* Index of a mem5.aPool[] slot */ |
| 243 | int iBin; /* Index into mem5.aiFreelist[] */ |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 244 | int iFullSz; /* Size of allocation rounded up to power of 2 */ |
| 245 | int iLogsize; /* Log2 of iFullSz/POW2_MIN */ |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 246 | |
drh | 4c5514d | 2009-08-18 01:54:19 +0000 | [diff] [blame] | 247 | /* nByte must be a positive */ |
| 248 | assert( nByte>0 ); |
| 249 | |
drh | eee4c8c | 2008-02-18 22:24:57 +0000 | [diff] [blame] | 250 | /* Keep track of the maximum allocation request. Even unfulfilled |
| 251 | ** requests are counted */ |
danielk1977 | 00e1361 | 2008-11-17 19:18:54 +0000 | [diff] [blame] | 252 | if( (u32)nByte>mem5.maxRequest ){ |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 253 | mem5.maxRequest = nByte; |
drh | eee4c8c | 2008-02-18 22:24:57 +0000 | [diff] [blame] | 254 | } |
| 255 | |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 256 | /* 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 | */ |
drh | 4c5514d | 2009-08-18 01:54:19 +0000 | [diff] [blame] | 259 | if( nByte > 0x40000000 ){ |
| 260 | return 0; |
| 261 | } |
| 262 | |
drh | eee4c8c | 2008-02-18 22:24:57 +0000 | [diff] [blame] | 263 | /* Round nByte up to the next valid power of two */ |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 264 | for(iFullSz=mem5.szAtom, iLogsize=0; iFullSz<nByte; iFullSz *= 2, iLogsize++){} |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 265 | |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 266 | /* Make sure mem5.aiFreelist[iLogsize] contains at least one free |
drh | eee4c8c | 2008-02-18 22:24:57 +0000 | [diff] [blame] | 267 | ** 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 | */ |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 270 | for(iBin=iLogsize; mem5.aiFreelist[iBin]<0 && iBin<=LOGMAX; iBin++){} |
drh | 413c3d3 | 2010-02-23 20:11:56 +0000 | [diff] [blame] | 271 | if( iBin>LOGMAX ){ |
drh | af46dc1 | 2010-02-24 21:44:07 +0000 | [diff] [blame] | 272 | testcase( sqlite3GlobalConfig.xLog!=0 ); |
drh | 413c3d3 | 2010-02-23 20:11:56 +0000 | [diff] [blame] | 273 | sqlite3_log(SQLITE_NOMEM, "failed to allocate %u bytes", nByte); |
| 274 | return 0; |
| 275 | } |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 276 | i = memsys5UnlinkFirst(iBin); |
| 277 | while( iBin>iLogsize ){ |
| 278 | int newSize; |
| 279 | |
| 280 | iBin--; |
| 281 | newSize = 1 << iBin; |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 282 | mem5.aCtrl[i+newSize] = CTRL_FREE | iBin; |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 283 | memsys5Link(i+newSize, iBin); |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 284 | } |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 285 | mem5.aCtrl[i] = iLogsize; |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 286 | |
drh | eee4c8c | 2008-02-18 22:24:57 +0000 | [diff] [blame] | 287 | /* Update allocator performance statistics. */ |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 288 | 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; |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 295 | |
drh | eee4c8c | 2008-02-18 22:24:57 +0000 | [diff] [blame] | 296 | /* Return a pointer to the allocated memory. */ |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 297 | return (void*)&mem5.zPool[i*mem5.szAtom]; |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 298 | } |
| 299 | |
| 300 | /* |
| 301 | ** Free an outstanding memory allocation. |
| 302 | */ |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 303 | static void memsys5FreeUnsafe(void *pOld){ |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 304 | u32 size, iLogsize; |
drh | 4c5514d | 2009-08-18 01:54:19 +0000 | [diff] [blame] | 305 | int iBlock; |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 306 | |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 307 | /* Set iBlock to the index of the block pointed to by pOld in |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 308 | ** the array of mem5.szAtom byte blocks pointed to by mem5.zPool. |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 309 | */ |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 310 | iBlock = ((u8 *)pOld-mem5.zPool)/mem5.szAtom; |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 311 | |
| 312 | /* Check that the pointer pOld points to a valid, non-free block. */ |
| 313 | assert( iBlock>=0 && iBlock<mem5.nBlock ); |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 314 | assert( ((u8 *)pOld-mem5.zPool)%mem5.szAtom==0 ); |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 315 | assert( (mem5.aCtrl[iBlock] & CTRL_FREE)==0 ); |
| 316 | |
| 317 | iLogsize = mem5.aCtrl[iBlock] & CTRL_LOGSIZE; |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 318 | size = 1<<iLogsize; |
danielk1977 | 00e1361 | 2008-11-17 19:18:54 +0000 | [diff] [blame] | 319 | assert( iBlock+size-1<(u32)mem5.nBlock ); |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 320 | |
| 321 | mem5.aCtrl[iBlock] |= CTRL_FREE; |
| 322 | mem5.aCtrl[iBlock+size-1] |= CTRL_FREE; |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 323 | assert( mem5.currentCount>0 ); |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 324 | assert( mem5.currentOut>=(size*mem5.szAtom) ); |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 325 | mem5.currentCount--; |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 326 | mem5.currentOut -= size*mem5.szAtom; |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 327 | assert( mem5.currentOut>0 || mem5.currentCount==0 ); |
| 328 | assert( mem5.currentCount>0 || mem5.currentOut==0 ); |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 329 | |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 330 | mem5.aCtrl[iBlock] = CTRL_FREE | iLogsize; |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 331 | while( ALWAYS(iLogsize<LOGMAX) ){ |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 332 | int iBuddy; |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 333 | if( (iBlock>>iLogsize) & 1 ){ |
| 334 | iBuddy = iBlock - size; |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 335 | }else{ |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 336 | iBuddy = iBlock + size; |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 337 | } |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 338 | assert( iBuddy>=0 ); |
| 339 | if( (iBuddy+(1<<iLogsize))>mem5.nBlock ) break; |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 340 | if( mem5.aCtrl[iBuddy]!=(CTRL_FREE | iLogsize) ) break; |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 341 | memsys5Unlink(iBuddy, iLogsize); |
| 342 | iLogsize++; |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 343 | if( iBuddy<iBlock ){ |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 344 | mem5.aCtrl[iBuddy] = CTRL_FREE | iLogsize; |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 345 | mem5.aCtrl[iBlock] = 0; |
| 346 | iBlock = iBuddy; |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 347 | }else{ |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 348 | mem5.aCtrl[iBlock] = CTRL_FREE | iLogsize; |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 349 | mem5.aCtrl[iBuddy] = 0; |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 350 | } |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 351 | size *= 2; |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 352 | } |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 353 | memsys5Link(iBlock, iLogsize); |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 354 | } |
| 355 | |
| 356 | /* |
| 357 | ** Allocate nBytes of memory |
| 358 | */ |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 359 | static void *memsys5Malloc(int nBytes){ |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 360 | sqlite3_int64 *p = 0; |
| 361 | if( nBytes>0 ){ |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 362 | memsys5Enter(); |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 363 | p = memsys5MallocUnsafe(nBytes); |
| 364 | memsys5Leave(); |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 365 | } |
| 366 | return (void*)p; |
| 367 | } |
| 368 | |
| 369 | /* |
| 370 | ** Free memory. |
drh | 4c5514d | 2009-08-18 01:54:19 +0000 | [diff] [blame] | 371 | ** |
| 372 | ** The outer layer memory allocator prevents this routine from |
| 373 | ** being called with pPrior==0. |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 374 | */ |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 375 | static void memsys5Free(void *pPrior){ |
drh | 4c5514d | 2009-08-18 01:54:19 +0000 | [diff] [blame] | 376 | assert( pPrior!=0 ); |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 377 | memsys5Enter(); |
| 378 | memsys5FreeUnsafe(pPrior); |
| 379 | memsys5Leave(); |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 380 | } |
| 381 | |
| 382 | /* |
drh | 4c5514d | 2009-08-18 01:54:19 +0000 | [diff] [blame] | 383 | ** Change the size of an existing memory allocation. |
| 384 | ** |
| 385 | ** The outer layer memory allocator prevents this routine from |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 386 | ** 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. |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 393 | */ |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 394 | static void *memsys5Realloc(void *pPrior, int nBytes){ |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 395 | int nOld; |
| 396 | void *p; |
drh | 4c5514d | 2009-08-18 01:54:19 +0000 | [diff] [blame] | 397 | assert( pPrior!=0 ); |
drh | 9f129f4 | 2010-08-31 15:27:32 +0000 | [diff] [blame] | 398 | assert( (nBytes&(nBytes-1))==0 ); /* EV: R-46199-30249 */ |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 399 | assert( nBytes>=0 ); |
| 400 | if( nBytes==0 ){ |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 401 | return 0; |
| 402 | } |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 403 | nOld = memsys5Size(pPrior); |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 404 | if( nBytes<=nOld ){ |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 405 | return pPrior; |
| 406 | } |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 407 | memsys5Enter(); |
| 408 | p = memsys5MallocUnsafe(nBytes); |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 409 | if( p ){ |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 410 | memcpy(p, pPrior, nOld); |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 411 | memsys5FreeUnsafe(pPrior); |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 412 | } |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 413 | memsys5Leave(); |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 414 | return p; |
| 415 | } |
| 416 | |
| 417 | /* |
drh | 4c5514d | 2009-08-18 01:54:19 +0000 | [diff] [blame] | 418 | ** 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. |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 421 | ** |
| 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. |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 425 | */ |
| 426 | static int memsys5Roundup(int n){ |
| 427 | int iFullSz; |
drh | 4c5514d | 2009-08-18 01:54:19 +0000 | [diff] [blame] | 428 | if( n > 0x40000000 ) return 0; |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 429 | for(iFullSz=mem5.szAtom; iFullSz<n; iFullSz *= 2); |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 430 | return iFullSz; |
| 431 | } |
| 432 | |
drh | 4c5514d | 2009-08-18 01:54:19 +0000 | [diff] [blame] | 433 | /* |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 434 | ** 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 |
drh | 4c5514d | 2009-08-18 01:54:19 +0000 | [diff] [blame] | 442 | */ |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 443 | static int memsys5Log(int iValue){ |
| 444 | int iLog; |
drh | fcd71b6 | 2011-04-05 22:08:24 +0000 | [diff] [blame] | 445 | for(iLog=0; (iLog<(int)((sizeof(int)*8)-1)) && (1<<iLog)<iValue; iLog++); |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 446 | return iLog; |
| 447 | } |
| 448 | |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 449 | /* |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 450 | ** Initialize the memory allocator. |
drh | 1b25753 | 2009-08-18 15:33:44 +0000 | [diff] [blame] | 451 | ** |
| 452 | ** This routine is not threadsafe. The caller must be holding a mutex |
| 453 | ** to prevent multiple threads from entering at the same time. |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 454 | */ |
| 455 | static int memsys5Init(void *NotUsed){ |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 456 | 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[] */ |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 461 | |
danielk1977 | a03396a | 2008-11-19 14:35:46 +0000 | [diff] [blame] | 462 | UNUSED_PARAMETER(NotUsed); |
| 463 | |
drh | 1b25753 | 2009-08-18 15:33:44 +0000 | [diff] [blame] | 464 | /* For the purposes of this routine, disable the mutex */ |
| 465 | mem5.mutex = 0; |
| 466 | |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 467 | /* 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 */ |
danielk1977 | 0d84e5b | 2008-06-27 14:05:24 +0000 | [diff] [blame] | 475 | |
shaneh | a6ec892 | 2011-03-09 21:36:17 +0000 | [diff] [blame] | 476 | /* boundaries on sqlite3GlobalConfig.mnReq are enforced in sqlite3_config() */ |
shaneh | 9324794 | 2011-03-10 03:54:55 +0000 | [diff] [blame] | 477 | nMinLog = memsys5Log(sqlite3GlobalConfig.mnReq); |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 478 | mem5.szAtom = (1<<nMinLog); |
| 479 | while( (int)sizeof(Mem5Link)>mem5.szAtom ){ |
| 480 | mem5.szAtom = mem5.szAtom << 1; |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 481 | } |
| 482 | |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 483 | mem5.nBlock = (nByte / (mem5.szAtom+sizeof(u8))); |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 484 | mem5.zPool = zByte; |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 485 | mem5.aCtrl = (u8 *)&mem5.zPool[mem5.nBlock*mem5.szAtom]; |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 486 | |
| 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 | |
drh | 1b25753 | 2009-08-18 15:33:44 +0000 | [diff] [blame] | 502 | /* If a mutex is required for normal operation, allocate one */ |
drh | daf4a9f | 2009-08-20 20:05:55 +0000 | [diff] [blame] | 503 | if( sqlite3GlobalConfig.bMemstat==0 ){ |
drh | 1b25753 | 2009-08-18 15:33:44 +0000 | [diff] [blame] | 504 | mem5.mutex = sqlite3MutexAlloc(SQLITE_MUTEX_STATIC_MEM); |
| 505 | } |
| 506 | |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 507 | return SQLITE_OK; |
| 508 | } |
| 509 | |
| 510 | /* |
| 511 | ** Deinitialize this module. |
| 512 | */ |
| 513 | static void memsys5Shutdown(void *NotUsed){ |
danielk1977 | a03396a | 2008-11-19 14:35:46 +0000 | [diff] [blame] | 514 | UNUSED_PARAMETER(NotUsed); |
drh | 15385ad | 2009-08-18 12:16:03 +0000 | [diff] [blame] | 515 | mem5.mutex = 0; |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 516 | return; |
| 517 | } |
| 518 | |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 519 | #ifdef SQLITE_TEST |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 520 | /* |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 521 | ** Open the file indicated and write a log of all unfreed memory |
| 522 | ** allocations into that log. |
| 523 | */ |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 524 | void sqlite3Memsys5Dump(const char *zFilename){ |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 525 | FILE *out; |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 526 | int i, j, n; |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 527 | int nMinLog; |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 528 | |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 529 | 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 | } |
drh | 2d7636e | 2008-02-16 16:21:45 +0000 | [diff] [blame] | 539 | memsys5Enter(); |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 540 | nMinLog = memsys5Log(mem5.szAtom); |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 541 | for(i=0; i<=LOGMAX && i+nMinLog<32; i++){ |
| 542 | for(n=0, j=mem5.aiFreelist[i]; j>=0; j = MEM5LINK(j)->next, n++){} |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 543 | fprintf(out, "freelist items of size %d: %d\n", mem5.szAtom << i, n); |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 544 | } |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 545 | 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(); |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 554 | if( out==stdout ){ |
| 555 | fflush(stdout); |
| 556 | }else{ |
| 557 | fclose(out); |
| 558 | } |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 559 | } |
drh | 7c6791c | 2009-08-18 14:48:53 +0000 | [diff] [blame] | 560 | #endif |
drh | 0d18020 | 2008-02-14 23:26:56 +0000 | [diff] [blame] | 561 | |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 562 | /* |
| 563 | ** This routine is the only routine in this file with external |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 564 | ** linkage. It returns a pointer to a static sqlite3_mem_methods |
| 565 | ** struct populated with the memsys5 methods. |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 566 | */ |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 567 | const sqlite3_mem_methods *sqlite3MemGetMemsys5(void){ |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 568 | static const sqlite3_mem_methods memsys5Methods = { |
| 569 | memsys5Malloc, |
| 570 | memsys5Free, |
| 571 | memsys5Realloc, |
| 572 | memsys5Size, |
| 573 | memsys5Roundup, |
| 574 | memsys5Init, |
| 575 | memsys5Shutdown, |
| 576 | 0 |
| 577 | }; |
danielk1977 | 5099be5 | 2008-06-27 13:27:03 +0000 | [diff] [blame] | 578 | return &memsys5Methods; |
danielk1977 | c66c0e1 | 2008-06-25 14:26:07 +0000 | [diff] [blame] | 579 | } |
| 580 | |
| 581 | #endif /* SQLITE_ENABLE_MEMSYS5 */ |