blob: b2bcf92bb574de761bb7693c07b6be30e8daf2fb [file] [log] [blame]
drh75897232000-05-29 14:26:00 +00001/*
drhb19a2bc2001-09-16 00:13:26 +00002** 2001 September 15
drh75897232000-05-29 14:26:00 +00003**
drhb19a2bc2001-09-16 00:13:26 +00004** The author disclaims copyright to this source code. In place of
5** a legal notice, here is a blessing:
drh75897232000-05-29 14:26:00 +00006**
drhb19a2bc2001-09-16 00:13:26 +00007** 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.
drh75897232000-05-29 14:26:00 +000010**
11*************************************************************************
12** Utility functions used throughout sqlite.
13**
14** This file contains functions for allocating memory, comparing
15** strings, and stuff like that.
16**
danielk19776622cce2004-05-20 11:00:52 +000017** $Id: util.c,v 1.87 2004/05/20 11:00:52 danielk1977 Exp $
drh75897232000-05-29 14:26:00 +000018*/
19#include "sqliteInt.h"
20#include <stdarg.h>
21#include <ctype.h>
22
drh7c68d602000-10-11 19:28:51 +000023/*
drhdaffd0e2001-04-11 14:28:42 +000024** If malloc() ever fails, this global variable gets set to 1.
25** This causes the library to abort and never again function.
26*/
danielk19776f8a5032004-05-10 10:34:51 +000027int sqlite3_malloc_failed = 0;
drhdaffd0e2001-04-11 14:28:42 +000028
29/*
drh7c68d602000-10-11 19:28:51 +000030** If MEMORY_DEBUG is defined, then use versions of malloc() and
31** free() that track memory usage and check for buffer overruns.
32*/
drhdcc581c2000-05-30 13:44:19 +000033#ifdef MEMORY_DEBUG
34
drhdcc581c2000-05-30 13:44:19 +000035/*
drh8c82b352000-12-10 18:23:50 +000036** For keeping track of the number of mallocs and frees. This
37** is used to check for memory leaks.
38*/
danielk19776f8a5032004-05-10 10:34:51 +000039int sqlite3_nMalloc; /* Number of sqliteMalloc() calls */
40int sqlite3_nFree; /* Number of sqliteFree() calls */
41int sqlite3_iMallocFail; /* Fail sqliteMalloc() after this many calls */
drhd94a6692002-08-25 18:29:11 +000042#if MEMORY_DEBUG>1
43static int memcnt = 0;
44#endif
drh8c82b352000-12-10 18:23:50 +000045
drh4305d102003-07-30 12:34:12 +000046/*
47** Number of 32-bit guard words
48*/
49#define N_GUARD 1
drh8c82b352000-12-10 18:23:50 +000050
51/*
drhdcc581c2000-05-30 13:44:19 +000052** Allocate new memory and set it to zero. Return NULL if
53** no memory is available.
54*/
danielk19774adee202004-05-08 08:23:19 +000055void *sqlite3Malloc_(int n, int bZero, char *zFile, int line){
drhdcc581c2000-05-30 13:44:19 +000056 void *p;
57 int *pi;
drh4305d102003-07-30 12:34:12 +000058 int i, k;
danielk19776f8a5032004-05-10 10:34:51 +000059 if( sqlite3_iMallocFail>=0 ){
60 sqlite3_iMallocFail--;
61 if( sqlite3_iMallocFail==0 ){
62 sqlite3_malloc_failed++;
drh6d4abfb2001-10-22 02:58:08 +000063#if MEMORY_DEBUG>1
64 fprintf(stderr,"**** failed to allocate %d bytes at %s:%d\n",
65 n, zFile,line);
66#endif
danielk19776f8a5032004-05-10 10:34:51 +000067 sqlite3_iMallocFail--;
drhdaffd0e2001-04-11 14:28:42 +000068 return 0;
69 }
drh6e142f52000-06-08 13:36:40 +000070 }
drhb0729502001-03-14 12:35:57 +000071 if( n==0 ) return 0;
drhdcc581c2000-05-30 13:44:19 +000072 k = (n+sizeof(int)-1)/sizeof(int);
drh4305d102003-07-30 12:34:12 +000073 pi = malloc( (N_GUARD*2+1+k)*sizeof(int));
drhdaffd0e2001-04-11 14:28:42 +000074 if( pi==0 ){
danielk19776f8a5032004-05-10 10:34:51 +000075 sqlite3_malloc_failed++;
drhdaffd0e2001-04-11 14:28:42 +000076 return 0;
77 }
danielk19776f8a5032004-05-10 10:34:51 +000078 sqlite3_nMalloc++;
drh4305d102003-07-30 12:34:12 +000079 for(i=0; i<N_GUARD; i++) pi[i] = 0xdead1122;
80 pi[N_GUARD] = n;
81 for(i=0; i<N_GUARD; i++) pi[k+1+N_GUARD+i] = 0xdead3344;
82 p = &pi[N_GUARD+1];
drh8c1238a2003-01-02 14:43:55 +000083 memset(p, bZero==0, n);
drhc3c2fc92000-05-31 22:58:39 +000084#if MEMORY_DEBUG>1
drhd94a6692002-08-25 18:29:11 +000085 fprintf(stderr,"%06d malloc %d bytes at 0x%x from %s:%d\n",
86 ++memcnt, n, (int)p, zFile,line);
drhc3c2fc92000-05-31 22:58:39 +000087#endif
drhdcc581c2000-05-30 13:44:19 +000088 return p;
89}
90
91/*
drhed6c8672003-01-12 18:02:16 +000092** Check to see if the given pointer was obtained from sqliteMalloc()
93** and is able to hold at least N bytes. Raise an exception if this
94** is not the case.
95**
96** This routine is used for testing purposes only.
97*/
danielk19774adee202004-05-08 08:23:19 +000098void sqlite3CheckMemory(void *p, int N){
drhed6c8672003-01-12 18:02:16 +000099 int *pi = p;
drh4305d102003-07-30 12:34:12 +0000100 int n, i, k;
101 pi -= N_GUARD+1;
102 for(i=0; i<N_GUARD; i++){
103 assert( pi[i]==0xdead1122 );
104 }
105 n = pi[N_GUARD];
drhed6c8672003-01-12 18:02:16 +0000106 assert( N>=0 && N<n );
107 k = (n+sizeof(int)-1)/sizeof(int);
drh4305d102003-07-30 12:34:12 +0000108 for(i=0; i<N_GUARD; i++){
109 assert( pi[k+N_GUARD+1+i]==0xdead3344 );
110 }
drhed6c8672003-01-12 18:02:16 +0000111}
112
113/*
drhdcc581c2000-05-30 13:44:19 +0000114** Free memory previously obtained from sqliteMalloc()
115*/
danielk19774adee202004-05-08 08:23:19 +0000116void sqlite3Free_(void *p, char *zFile, int line){
drhdcc581c2000-05-30 13:44:19 +0000117 if( p ){
drh4305d102003-07-30 12:34:12 +0000118 int *pi, i, k, n;
drhdcc581c2000-05-30 13:44:19 +0000119 pi = p;
drh4305d102003-07-30 12:34:12 +0000120 pi -= N_GUARD+1;
danielk19776f8a5032004-05-10 10:34:51 +0000121 sqlite3_nFree++;
drh4305d102003-07-30 12:34:12 +0000122 for(i=0; i<N_GUARD; i++){
123 if( pi[i]!=0xdead1122 ){
124 fprintf(stderr,"Low-end memory corruption at 0x%x\n", (int)p);
125 return;
126 }
drhdcc581c2000-05-30 13:44:19 +0000127 }
drh4305d102003-07-30 12:34:12 +0000128 n = pi[N_GUARD];
drhdcc581c2000-05-30 13:44:19 +0000129 k = (n+sizeof(int)-1)/sizeof(int);
drh4305d102003-07-30 12:34:12 +0000130 for(i=0; i<N_GUARD; i++){
131 if( pi[k+N_GUARD+1+i]!=0xdead3344 ){
132 fprintf(stderr,"High-end memory corruption at 0x%x\n", (int)p);
133 return;
134 }
drhdcc581c2000-05-30 13:44:19 +0000135 }
drh4305d102003-07-30 12:34:12 +0000136 memset(pi, 0xff, (k+N_GUARD*2+1)*sizeof(int));
drhc3c2fc92000-05-31 22:58:39 +0000137#if MEMORY_DEBUG>1
drhd94a6692002-08-25 18:29:11 +0000138 fprintf(stderr,"%06d free %d bytes at 0x%x from %s:%d\n",
139 ++memcnt, n, (int)p, zFile,line);
drhc3c2fc92000-05-31 22:58:39 +0000140#endif
drhdcc581c2000-05-30 13:44:19 +0000141 free(pi);
142 }
143}
144
145/*
146** Resize a prior allocation. If p==0, then this routine
147** works just like sqliteMalloc(). If n==0, then this routine
148** works just like sqliteFree().
149*/
danielk19774adee202004-05-08 08:23:19 +0000150void *sqlite3Realloc_(void *oldP, int n, char *zFile, int line){
drh4305d102003-07-30 12:34:12 +0000151 int *oldPi, *pi, i, k, oldN, oldK;
drhdcc581c2000-05-30 13:44:19 +0000152 void *p;
153 if( oldP==0 ){
danielk19774adee202004-05-08 08:23:19 +0000154 return sqlite3Malloc_(n,1,zFile,line);
drhdcc581c2000-05-30 13:44:19 +0000155 }
156 if( n==0 ){
danielk19774adee202004-05-08 08:23:19 +0000157 sqlite3Free_(oldP,zFile,line);
drhdcc581c2000-05-30 13:44:19 +0000158 return 0;
159 }
160 oldPi = oldP;
drh4305d102003-07-30 12:34:12 +0000161 oldPi -= N_GUARD+1;
drhdcc581c2000-05-30 13:44:19 +0000162 if( oldPi[0]!=0xdead1122 ){
drh03ab7332003-08-26 11:29:07 +0000163 fprintf(stderr,"Low-end memory corruption in realloc at 0x%x\n", (int)oldP);
drh9bb61fe2000-06-05 16:01:39 +0000164 return 0;
drhdcc581c2000-05-30 13:44:19 +0000165 }
drh4305d102003-07-30 12:34:12 +0000166 oldN = oldPi[N_GUARD];
drhdcc581c2000-05-30 13:44:19 +0000167 oldK = (oldN+sizeof(int)-1)/sizeof(int);
drh4305d102003-07-30 12:34:12 +0000168 for(i=0; i<N_GUARD; i++){
169 if( oldPi[oldK+N_GUARD+1+i]!=0xdead3344 ){
drh03ab7332003-08-26 11:29:07 +0000170 fprintf(stderr,"High-end memory corruption in realloc at 0x%x\n",
171 (int)oldP);
drh4305d102003-07-30 12:34:12 +0000172 return 0;
173 }
drhdcc581c2000-05-30 13:44:19 +0000174 }
175 k = (n + sizeof(int) - 1)/sizeof(int);
drh4305d102003-07-30 12:34:12 +0000176 pi = malloc( (k+N_GUARD*2+1)*sizeof(int) );
drhdaffd0e2001-04-11 14:28:42 +0000177 if( pi==0 ){
danielk19776f8a5032004-05-10 10:34:51 +0000178 sqlite3_malloc_failed++;
drhdaffd0e2001-04-11 14:28:42 +0000179 return 0;
180 }
drh4305d102003-07-30 12:34:12 +0000181 for(i=0; i<N_GUARD; i++) pi[i] = 0xdead1122;
182 pi[N_GUARD] = n;
183 for(i=0; i<N_GUARD; i++) pi[k+N_GUARD+1+i] = 0xdead3344;
184 p = &pi[N_GUARD+1];
drhdcc581c2000-05-30 13:44:19 +0000185 memcpy(p, oldP, n>oldN ? oldN : n);
186 if( n>oldN ){
187 memset(&((char*)p)[oldN], 0, n-oldN);
188 }
drh4305d102003-07-30 12:34:12 +0000189 memset(oldPi, 0xab, (oldK+N_GUARD+2)*sizeof(int));
drhdcc581c2000-05-30 13:44:19 +0000190 free(oldPi);
drhc3c2fc92000-05-31 22:58:39 +0000191#if MEMORY_DEBUG>1
drhd94a6692002-08-25 18:29:11 +0000192 fprintf(stderr,"%06d realloc %d to %d bytes at 0x%x to 0x%x at %s:%d\n",
193 ++memcnt, oldN, n, (int)oldP, (int)p, zFile, line);
drhc3c2fc92000-05-31 22:58:39 +0000194#endif
drhdcc581c2000-05-30 13:44:19 +0000195 return p;
196}
drhc3c2fc92000-05-31 22:58:39 +0000197
198/*
199** Make a duplicate of a string into memory obtained from malloc()
200** Free the original string using sqliteFree().
drhdaffd0e2001-04-11 14:28:42 +0000201**
202** This routine is called on all strings that are passed outside of
203** the SQLite library. That way clients can free the string using free()
204** rather than having to call sqliteFree().
drhc3c2fc92000-05-31 22:58:39 +0000205*/
danielk19774adee202004-05-08 08:23:19 +0000206void sqlite3StrRealloc(char **pz){
drhc3c2fc92000-05-31 22:58:39 +0000207 char *zNew;
208 if( pz==0 || *pz==0 ) return;
209 zNew = malloc( strlen(*pz) + 1 );
drhdaffd0e2001-04-11 14:28:42 +0000210 if( zNew==0 ){
danielk19776f8a5032004-05-10 10:34:51 +0000211 sqlite3_malloc_failed++;
drhdaffd0e2001-04-11 14:28:42 +0000212 sqliteFree(*pz);
213 *pz = 0;
214 }
215 strcpy(zNew, *pz);
drhc3c2fc92000-05-31 22:58:39 +0000216 sqliteFree(*pz);
217 *pz = zNew;
218}
219
drh6e142f52000-06-08 13:36:40 +0000220/*
221** Make a copy of a string in memory obtained from sqliteMalloc()
222*/
danielk19774adee202004-05-08 08:23:19 +0000223char *sqlite3StrDup_(const char *z, char *zFile, int line){
drhff78bd22002-02-27 01:47:11 +0000224 char *zNew;
225 if( z==0 ) return 0;
danielk19774adee202004-05-08 08:23:19 +0000226 zNew = sqlite3Malloc_(strlen(z)+1, 0, zFile, line);
drh6e142f52000-06-08 13:36:40 +0000227 if( zNew ) strcpy(zNew, z);
228 return zNew;
229}
danielk19774adee202004-05-08 08:23:19 +0000230char *sqlite3StrNDup_(const char *z, int n, char *zFile, int line){
drhff78bd22002-02-27 01:47:11 +0000231 char *zNew;
232 if( z==0 ) return 0;
danielk19774adee202004-05-08 08:23:19 +0000233 zNew = sqlite3Malloc_(n+1, 0, zFile, line);
drh6e142f52000-06-08 13:36:40 +0000234 if( zNew ){
235 memcpy(zNew, z, n);
236 zNew[n] = 0;
237 }
238 return zNew;
239}
drh7c68d602000-10-11 19:28:51 +0000240#endif /* MEMORY_DEBUG */
drh6e142f52000-06-08 13:36:40 +0000241
drh7c68d602000-10-11 19:28:51 +0000242/*
243** The following versions of malloc() and free() are for use in a
244** normal build.
245*/
246#if !defined(MEMORY_DEBUG)
drh6e142f52000-06-08 13:36:40 +0000247
drh75897232000-05-29 14:26:00 +0000248/*
249** Allocate new memory and set it to zero. Return NULL if
drh8c1238a2003-01-02 14:43:55 +0000250** no memory is available. See also sqliteMallocRaw().
drh75897232000-05-29 14:26:00 +0000251*/
252void *sqliteMalloc(int n){
drh26780582002-10-20 15:46:22 +0000253 void *p;
drh8548a052003-10-22 22:15:27 +0000254 if( (p = malloc(n))==0 ){
danielk19776f8a5032004-05-10 10:34:51 +0000255 if( n>0 ) sqlite3_malloc_failed++;
drh8548a052003-10-22 22:15:27 +0000256 }else{
257 memset(p, 0, n);
drhdaffd0e2001-04-11 14:28:42 +0000258 }
drh75897232000-05-29 14:26:00 +0000259 return p;
260}
261
262/*
drh8c1238a2003-01-02 14:43:55 +0000263** Allocate new memory but do not set it to zero. Return NULL if
264** no memory is available. See also sqliteMalloc().
265*/
266void *sqliteMallocRaw(int n){
267 void *p;
drh8548a052003-10-22 22:15:27 +0000268 if( (p = malloc(n))==0 ){
danielk19776f8a5032004-05-10 10:34:51 +0000269 if( n>0 ) sqlite3_malloc_failed++;
drh8c1238a2003-01-02 14:43:55 +0000270 }
271 return p;
272}
273
274/*
drh75897232000-05-29 14:26:00 +0000275** Free memory previously obtained from sqliteMalloc()
276*/
277void sqliteFree(void *p){
drh305cea62000-05-29 17:44:25 +0000278 if( p ){
drh305cea62000-05-29 17:44:25 +0000279 free(p);
280 }
drh75897232000-05-29 14:26:00 +0000281}
282
283/*
284** Resize a prior allocation. If p==0, then this routine
285** works just like sqliteMalloc(). If n==0, then this routine
286** works just like sqliteFree().
287*/
288void *sqliteRealloc(void *p, int n){
drh6d4abfb2001-10-22 02:58:08 +0000289 void *p2;
drh75897232000-05-29 14:26:00 +0000290 if( p==0 ){
291 return sqliteMalloc(n);
292 }
293 if( n==0 ){
294 sqliteFree(p);
295 return 0;
296 }
drh6d4abfb2001-10-22 02:58:08 +0000297 p2 = realloc(p, n);
298 if( p2==0 ){
danielk19776f8a5032004-05-10 10:34:51 +0000299 sqlite3_malloc_failed++;
drhdaffd0e2001-04-11 14:28:42 +0000300 }
drh6d4abfb2001-10-22 02:58:08 +0000301 return p2;
drh75897232000-05-29 14:26:00 +0000302}
drh6e142f52000-06-08 13:36:40 +0000303
304/*
305** Make a copy of a string in memory obtained from sqliteMalloc()
306*/
307char *sqliteStrDup(const char *z){
drh567c6042002-02-28 04:10:29 +0000308 char *zNew;
309 if( z==0 ) return 0;
drh8c1238a2003-01-02 14:43:55 +0000310 zNew = sqliteMallocRaw(strlen(z)+1);
drh6e142f52000-06-08 13:36:40 +0000311 if( zNew ) strcpy(zNew, z);
312 return zNew;
313}
314char *sqliteStrNDup(const char *z, int n){
drh567c6042002-02-28 04:10:29 +0000315 char *zNew;
316 if( z==0 ) return 0;
drh8c1238a2003-01-02 14:43:55 +0000317 zNew = sqliteMallocRaw(n+1);
drh6e142f52000-06-08 13:36:40 +0000318 if( zNew ){
319 memcpy(zNew, z, n);
320 zNew[n] = 0;
321 }
322 return zNew;
323}
drh7c68d602000-10-11 19:28:51 +0000324#endif /* !defined(MEMORY_DEBUG) */
drh75897232000-05-29 14:26:00 +0000325
326/*
327** Create a string from the 2nd and subsequent arguments (up to the
328** first NULL argument), store the string in memory obtained from
329** sqliteMalloc() and make the pointer indicated by the 1st argument
jplyon02be20d2003-06-02 06:17:10 +0000330** point to that string. The 1st argument must either be NULL or
331** point to memory obtained from sqliteMalloc().
drh75897232000-05-29 14:26:00 +0000332*/
danielk19774adee202004-05-08 08:23:19 +0000333void sqlite3SetString(char **pz, const char *zFirst, ...){
drh75897232000-05-29 14:26:00 +0000334 va_list ap;
335 int nByte;
336 const char *z;
337 char *zResult;
338
339 if( pz==0 ) return;
340 nByte = strlen(zFirst) + 1;
341 va_start(ap, zFirst);
342 while( (z = va_arg(ap, const char*))!=0 ){
343 nByte += strlen(z);
344 }
345 va_end(ap);
346 sqliteFree(*pz);
drh8c1238a2003-01-02 14:43:55 +0000347 *pz = zResult = sqliteMallocRaw( nByte );
drh6d4abfb2001-10-22 02:58:08 +0000348 if( zResult==0 ){
349 return;
350 }
drh75897232000-05-29 14:26:00 +0000351 strcpy(zResult, zFirst);
352 zResult += strlen(zResult);
353 va_start(ap, zFirst);
354 while( (z = va_arg(ap, const char*))!=0 ){
355 strcpy(zResult, z);
356 zResult += strlen(zResult);
357 }
358 va_end(ap);
drh6e142f52000-06-08 13:36:40 +0000359#ifdef MEMORY_DEBUG
360#if MEMORY_DEBUG>1
361 fprintf(stderr,"string at 0x%x is %s\n", (int)*pz, *pz);
362#endif
363#endif
drh75897232000-05-29 14:26:00 +0000364}
365
366/*
danielk19774adee202004-05-08 08:23:19 +0000367** Works like sqlite3SetString, but each string is now followed by
drhe17a7e32001-04-04 21:10:18 +0000368** a length integer which specifies how much of the source string
jplyon02be20d2003-06-02 06:17:10 +0000369** to copy (in bytes). -1 means use the whole string. The 1st
370** argument must either be NULL or point to memory obtained from
371** sqliteMalloc().
drh75897232000-05-29 14:26:00 +0000372*/
danielk19774adee202004-05-08 08:23:19 +0000373void sqlite3SetNString(char **pz, ...){
drh75897232000-05-29 14:26:00 +0000374 va_list ap;
375 int nByte;
376 const char *z;
377 char *zResult;
378 int n;
379
380 if( pz==0 ) return;
381 nByte = 0;
382 va_start(ap, pz);
383 while( (z = va_arg(ap, const char*))!=0 ){
384 n = va_arg(ap, int);
385 if( n<=0 ) n = strlen(z);
386 nByte += n;
387 }
388 va_end(ap);
389 sqliteFree(*pz);
drh8c1238a2003-01-02 14:43:55 +0000390 *pz = zResult = sqliteMallocRaw( nByte + 1 );
drh75897232000-05-29 14:26:00 +0000391 if( zResult==0 ) return;
392 va_start(ap, pz);
393 while( (z = va_arg(ap, const char*))!=0 ){
394 n = va_arg(ap, int);
395 if( n<=0 ) n = strlen(z);
396 strncpy(zResult, z, n);
397 zResult += n;
398 }
399 *zResult = 0;
drh6e142f52000-06-08 13:36:40 +0000400#ifdef MEMORY_DEBUG
401#if MEMORY_DEBUG>1
402 fprintf(stderr,"string at 0x%x is %s\n", (int)*pz, *pz);
403#endif
404#endif
drh75897232000-05-29 14:26:00 +0000405 va_end(ap);
406}
407
drh982cef72000-05-30 16:27:03 +0000408/*
danielk19776622cce2004-05-20 11:00:52 +0000409** Set the most recent error code and error string for the sqlite
410** handle "db". The error code is set to "err_code".
411**
412** If it is not NULL, string zFormat specifies the format of the
413** error string in the style of the printf functions: The following
414** format characters are allowed:
415**
416** %s Insert a string
417** %z A string that should be freed after use
418** %d Insert an integer
419** %T Insert a token
420** %S Insert the first element of a SrcList
421**
422** zFormat and any string tokens that follow it are assumed to be
423** encoded in UTF-8.
424**
425** To clear the most recent error for slqite handle "db", sqlite3Error
426** should be called with err_code set to SQLITE_OK and zFormat set
427** to NULL.
428*/
429void sqlite3Error(sqlite *db, int err_code, const char *zFormat, ...){
430 /* Free any existing error message. */
431 if( db->zErrMsg ){
432 sqliteFree(db->zErrMsg);
433 db->zErrMsg = 0;
434 }
435 if( db->zErrMsg16 ){
436 sqliteFree(db->zErrMsg16);
437 db->zErrMsg16 = 0;
438 }
439
440 /* Set the new error code and error message. */
441 db->errCode = err_code;
442 if( zFormat ){
443 va_list ap;
444 va_start(ap, zFormat);
445 db->zErrMsg = sqlite3VMPrintf(zFormat, ap);
446 va_end(ap);
447 }
448}
449
450/*
drhda93d232003-03-31 02:12:46 +0000451** Add an error message to pParse->zErrMsg and increment pParse->nErr.
452** The following formatting characters are allowed:
453**
454** %s Insert a string
455** %z A string that should be freed after use
456** %d Insert an integer
457** %T Insert a token
458** %S Insert the first element of a SrcList
459*/
danielk19774adee202004-05-08 08:23:19 +0000460void sqlite3ErrorMsg(Parse *pParse, const char *zFormat, ...){
drhda93d232003-03-31 02:12:46 +0000461 va_list ap;
drhda93d232003-03-31 02:12:46 +0000462 pParse->nErr++;
drhda93d232003-03-31 02:12:46 +0000463 sqliteFree(pParse->zErrMsg);
drhda93d232003-03-31 02:12:46 +0000464 va_start(ap, zFormat);
danielk19774adee202004-05-08 08:23:19 +0000465 pParse->zErrMsg = sqlite3VMPrintf(zFormat, ap);
drhda93d232003-03-31 02:12:46 +0000466 va_end(ap);
drhda93d232003-03-31 02:12:46 +0000467}
468
469/*
drh982cef72000-05-30 16:27:03 +0000470** Convert an SQL-style quoted string into a normal string by removing
471** the quote characters. The conversion is done in-place. If the
472** input does not begin with a quote character, then this routine
473** is a no-op.
drh2f4392f2002-02-14 21:42:51 +0000474**
475** 2002-Feb-14: This routine is extended to remove MS-Access style
476** brackets from around identifers. For example: "[a-b-c]" becomes
477** "a-b-c".
drh982cef72000-05-30 16:27:03 +0000478*/
danielk19774adee202004-05-08 08:23:19 +0000479void sqlite3Dequote(char *z){
drh982cef72000-05-30 16:27:03 +0000480 int quote;
481 int i, j;
drhdaffd0e2001-04-11 14:28:42 +0000482 if( z==0 ) return;
drh982cef72000-05-30 16:27:03 +0000483 quote = z[0];
drh2f4392f2002-02-14 21:42:51 +0000484 switch( quote ){
485 case '\'': break;
486 case '"': break;
487 case '[': quote = ']'; break;
488 default: return;
489 }
drh982cef72000-05-30 16:27:03 +0000490 for(i=1, j=0; z[i]; i++){
491 if( z[i]==quote ){
492 if( z[i+1]==quote ){
493 z[j++] = quote;
494 i++;
495 }else{
496 z[j++] = 0;
497 break;
498 }
499 }else{
500 z[j++] = z[i];
501 }
502 }
503}
504
drh75897232000-05-29 14:26:00 +0000505/* An array to map all upper-case characters into their corresponding
506** lower-case character.
507*/
508static unsigned char UpperToLower[] = {
509 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,
510 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35,
511 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53,
512 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 97, 98, 99,100,101,102,103,
513 104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,
514 122, 91, 92, 93, 94, 95, 96, 97, 98, 99,100,101,102,103,104,105,106,107,
515 108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,
516 126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,
517 144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,
518 162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,
519 180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,
520 198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,
521 216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,
522 234,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,251,
523 252,253,254,255
524};
525
526/*
527** This function computes a hash on the name of a keyword.
528** Case is not significant.
529*/
danielk19774adee202004-05-08 08:23:19 +0000530int sqlite3HashNoCase(const char *z, int n){
drh75897232000-05-29 14:26:00 +0000531 int h = 0;
drh75897232000-05-29 14:26:00 +0000532 if( n<=0 ) n = strlen(z);
drhdb5ed6d2001-09-18 22:17:44 +0000533 while( n > 0 ){
drh8cfbf082001-09-19 13:22:39 +0000534 h = (h<<3) ^ h ^ UpperToLower[(unsigned char)*z++];
drhdb5ed6d2001-09-18 22:17:44 +0000535 n--;
drh75897232000-05-29 14:26:00 +0000536 }
drh5364f602003-05-12 23:06:52 +0000537 return h & 0x7fffffff;
drh75897232000-05-29 14:26:00 +0000538}
539
540/*
drh967e8b72000-06-21 13:59:10 +0000541** Some systems have stricmp(). Others have strcasecmp(). Because
drh75897232000-05-29 14:26:00 +0000542** there is no consistency, we will define our own.
543*/
danielk19774adee202004-05-08 08:23:19 +0000544int sqlite3StrICmp(const char *zLeft, const char *zRight){
drh75897232000-05-29 14:26:00 +0000545 register unsigned char *a, *b;
546 a = (unsigned char *)zLeft;
547 b = (unsigned char *)zRight;
548 while( *a!=0 && UpperToLower[*a]==UpperToLower[*b]){ a++; b++; }
549 return *a - *b;
550}
danielk19774adee202004-05-08 08:23:19 +0000551int sqlite3StrNICmp(const char *zLeft, const char *zRight, int N){
drh75897232000-05-29 14:26:00 +0000552 register unsigned char *a, *b;
553 a = (unsigned char *)zLeft;
554 b = (unsigned char *)zRight;
555 while( N-- > 0 && *a!=0 && UpperToLower[*a]==UpperToLower[*b]){ a++; b++; }
drhbec2bf42000-05-29 23:48:22 +0000556 return N<0 ? 0 : *a - *b;
drh75897232000-05-29 14:26:00 +0000557}
558
drha5c2ad02000-09-14 01:21:10 +0000559/*
drh7a7c7392001-11-24 00:31:46 +0000560** Return TRUE if z is a pure numeric string. Return FALSE if the
danielk19773d1bfea2004-05-14 11:00:53 +0000561** string contains any character which is not part of a number. If
562** the string is numeric and contains the '.' character, set *realnum
563** to TRUE (otherwise FALSE).
drh7a7c7392001-11-24 00:31:46 +0000564**
drhbb07e9a2003-04-16 02:17:35 +0000565** Am empty string is considered non-numeric.
drha5c2ad02000-09-14 01:21:10 +0000566*/
danielk19773d1bfea2004-05-14 11:00:53 +0000567int sqlite3IsNumber(const char *z, int *realnum){
drh7a7c7392001-11-24 00:31:46 +0000568 if( *z=='-' || *z=='+' ) z++;
569 if( !isdigit(*z) ){
drhbb07e9a2003-04-16 02:17:35 +0000570 return 0;
drha5c2ad02000-09-14 01:21:10 +0000571 }
drh7a7c7392001-11-24 00:31:46 +0000572 z++;
danielk19773d1bfea2004-05-14 11:00:53 +0000573 if( realnum ) *realnum = 0;
drh7a7c7392001-11-24 00:31:46 +0000574 while( isdigit(*z) ){ z++; }
575 if( *z=='.' ){
576 z++;
577 if( !isdigit(*z) ) return 0;
578 while( isdigit(*z) ){ z++; }
danielk19773d1bfea2004-05-14 11:00:53 +0000579 if( realnum ) *realnum = 1;
drhbb07e9a2003-04-16 02:17:35 +0000580 }
581 if( *z=='e' || *z=='E' ){
582 z++;
583 if( *z=='+' || *z=='-' ) z++;
584 if( !isdigit(*z) ) return 0;
585 while( isdigit(*z) ){ z++; }
danielk19773d1bfea2004-05-14 11:00:53 +0000586 if( realnum ) *realnum = 1;
drha5c2ad02000-09-14 01:21:10 +0000587 }
drh7a7c7392001-11-24 00:31:46 +0000588 return *z==0;
drha5c2ad02000-09-14 01:21:10 +0000589}
590
drh93a5c6b2003-12-23 02:17:35 +0000591/*
592** The string z[] is an ascii representation of a real number.
593** Convert this string to a double.
594**
595** This routine assumes that z[] really is a valid number. If it
596** is not, the result is undefined.
597**
598** This routine is used instead of the library atof() function because
599** the library atof() might want to use "," as the decimal point instead
600** of "." depending on how locale is set. But that would cause problems
601** for SQL. So this routine always uses "." regardless of locale.
602*/
danielk19774adee202004-05-08 08:23:19 +0000603double sqlite3AtoF(const char *z, const char **pzEnd){
drh93a5c6b2003-12-23 02:17:35 +0000604 int sign = 1;
drh384eef32004-01-07 03:04:27 +0000605 LONGDOUBLE_TYPE v1 = 0.0;
drh93a5c6b2003-12-23 02:17:35 +0000606 if( *z=='-' ){
607 sign = -1;
608 z++;
609 }else if( *z=='+' ){
610 z++;
611 }
612 while( isdigit(*z) ){
613 v1 = v1*10.0 + (*z - '0');
614 z++;
615 }
616 if( *z=='.' ){
drh384eef32004-01-07 03:04:27 +0000617 LONGDOUBLE_TYPE divisor = 1.0;
drh93a5c6b2003-12-23 02:17:35 +0000618 z++;
619 while( isdigit(*z) ){
620 v1 = v1*10.0 + (*z - '0');
621 divisor *= 10.0;
622 z++;
623 }
624 v1 /= divisor;
625 }
626 if( *z=='e' || *z=='E' ){
627 int esign = 1;
628 int eval = 0;
drh384eef32004-01-07 03:04:27 +0000629 LONGDOUBLE_TYPE scale = 1.0;
drh93a5c6b2003-12-23 02:17:35 +0000630 z++;
631 if( *z=='-' ){
632 esign = -1;
633 z++;
634 }else if( *z=='+' ){
635 z++;
636 }
637 while( isdigit(*z) ){
638 eval = eval*10 + *z - '0';
639 z++;
640 }
641 while( eval>=64 ){ scale *= 1.0e+64; eval -= 64; }
642 while( eval>=16 ){ scale *= 1.0e+16; eval -= 16; }
643 while( eval>=4 ){ scale *= 1.0e+4; eval -= 4; }
644 while( eval>=1 ){ scale *= 1.0e+1; eval -= 1; }
645 if( esign<0 ){
646 v1 /= scale;
647 }else{
648 v1 *= scale;
649 }
650 }
drheb9a9e82004-02-22 17:49:32 +0000651 if( pzEnd ) *pzEnd = z;
drh93a5c6b2003-12-23 02:17:35 +0000652 return sign<0 ? -v1 : v1;
653}
654
drh202b2df2004-01-06 01:13:46 +0000655/*
drhfec19aa2004-05-19 20:41:03 +0000656** Return TRUE if zNum is a 64-bit signed integer and write
657** the value of the integer into *pNum. If zNum is not an integer
658** or is an integer that is too large to be expressed with 64 bits,
659** then return false. If n>0 and the integer is string is not
660** exactly n bytes long, return false.
661**
662** When this routine was originally written it dealt with only
663** 32-bit numbers. At that time, it was much faster than the
664** atoi() library routine in RedHat 7.2.
665*/
666int sqlite3atoi64(const char *zNum, i64 *pNum){
667 i64 v = 0;
668 int neg;
669 int i, c;
670 if( *zNum=='-' ){
671 neg = 1;
672 zNum++;
673 }else if( *zNum=='+' ){
674 neg = 0;
675 zNum++;
676 }else{
677 neg = 0;
678 }
679 for(i=0; (c=zNum[i])>='0' && c<='9'; i++){
680 v = v*10 + c - '0';
681 }
682 *pNum = neg ? -v : v;
683 return c==0 && i>0 &&
684 (i<19 || (i==19 && memcmp(zNum,"9223372036854775807",19)<=0));
685}
686
687/*
drh202b2df2004-01-06 01:13:46 +0000688** The string zNum represents an integer. There might be some other
689** information following the integer too, but that part is ignored.
690** If the integer that the prefix of zNum represents will fit in a
691** 32-bit signed integer, return TRUE. Otherwise return FALSE.
692**
693** This routine returns FALSE for the string -2147483648 even that
694** that number will, in theory fit in a 32-bit integer. But positive
695** 2147483648 will not fit in 32 bits. So it seems safer to return
696** false.
697*/
drhfec19aa2004-05-19 20:41:03 +0000698static int sqlite3FitsIn32Bits(const char *zNum){
drh202b2df2004-01-06 01:13:46 +0000699 int i, c;
700 if( *zNum=='-' || *zNum=='+' ) zNum++;
701 for(i=0; (c=zNum[i])>='0' && c<='9'; i++){}
702 return i<10 || (i==10 && memcmp(zNum,"2147483647",10)<=0);
703}
704
drhfec19aa2004-05-19 20:41:03 +0000705/*
706** If zNum represents an integer that will fit in 32-bits, then set
707** *pValue to that integer and return true. Otherwise return false.
708*/
709int sqlite3GetInt32(const char *zNum, int *pValue){
710 if( sqlite3FitsIn32Bits(zNum) ){
711 *pValue = atoi(zNum);
712 return 1;
713 }
714 return 0;
715}
716
717/*
718** The string zNum represents an integer. There might be some other
719** information following the integer too, but that part is ignored.
720** If the integer that the prefix of zNum represents will fit in a
721** 64-bit signed integer, return TRUE. Otherwise return FALSE.
722**
723** This routine returns FALSE for the string -9223372036854775808 even that
724** that number will, in theory fit in a 64-bit integer. Positive
725** 9223373036854775808 will not fit in 64 bits. So it seems safer to return
726** false.
727*/
728int sqlite3FitsIn64Bits(const char *zNum){
729 int i, c;
730 if( *zNum=='-' || *zNum=='+' ) zNum++;
731 for(i=0; (c=zNum[i])>='0' && c<='9'; i++){}
732 return i<19 || (i==19 && memcmp(zNum,"9223372036854775807",19)<=0);
733}
734
735/*
736** If zNum represents an integer that will fit in 64-bits, then set
737** *pValue to that integer and return true. Otherwise return false.
738*/
739int sqlite3GetInt64(const char *zNum, i64 *pValue){
740 if( sqlite3FitsIn64Bits(zNum) ){
741 sqlite3atoi64(zNum, pValue);
742 return 1;
743 }
744 return 0;
745}
746
drh75897232000-05-29 14:26:00 +0000747/* This comparison routine is what we use for comparison operations
drha9e99ae2002-08-13 23:02:57 +0000748** between numeric values in an SQL expression. "Numeric" is a little
749** bit misleading here. What we mean is that the strings have a
750** type of "numeric" from the point of view of SQL. The strings
751** do not necessarily contain numbers. They could contain text.
drh7a7c7392001-11-24 00:31:46 +0000752**
drha9e99ae2002-08-13 23:02:57 +0000753** If the input strings both look like actual numbers then they
754** compare in numerical order. Numerical strings are always less
755** than non-numeric strings so if one input string looks like a
756** number and the other does not, then the one that looks like
757** a number is the smaller. Non-numeric strings compare in
758** lexigraphical order (the same order as strcmp()).
drh75897232000-05-29 14:26:00 +0000759*/
danielk19774adee202004-05-08 08:23:19 +0000760int sqlite3Compare(const char *atext, const char *btext){
drh75897232000-05-29 14:26:00 +0000761 int result;
drh0bce8352002-02-28 00:41:10 +0000762 int isNumA, isNumB;
763 if( atext==0 ){
drh8912d102002-05-26 21:34:58 +0000764 return -1;
drh0bce8352002-02-28 00:41:10 +0000765 }else if( btext==0 ){
766 return 1;
767 }
danielk19773d1bfea2004-05-14 11:00:53 +0000768 isNumA = sqlite3IsNumber(atext, 0);
769 isNumB = sqlite3IsNumber(btext, 0);
drh7a7c7392001-11-24 00:31:46 +0000770 if( isNumA ){
771 if( !isNumB ){
772 result = -1;
773 }else{
774 double rA, rB;
danielk19774adee202004-05-08 08:23:19 +0000775 rA = sqlite3AtoF(atext, 0);
776 rB = sqlite3AtoF(btext, 0);
drh7a7c7392001-11-24 00:31:46 +0000777 if( rA<rB ){
778 result = -1;
779 }else if( rA>rB ){
780 result = +1;
781 }else{
782 result = 0;
drha5c2ad02000-09-14 01:21:10 +0000783 }
784 }
drh7a7c7392001-11-24 00:31:46 +0000785 }else if( isNumB ){
786 result = +1;
787 }else {
788 result = strcmp(atext, btext);
drha5c2ad02000-09-14 01:21:10 +0000789 }
drh7a7c7392001-11-24 00:31:46 +0000790 return result;
drh75897232000-05-29 14:26:00 +0000791}
drh75897232000-05-29 14:26:00 +0000792
793/*
drh16e59552000-07-31 11:57:37 +0000794** This routine is used for sorting. Each key is a list of one or more
drha9e99ae2002-08-13 23:02:57 +0000795** null-terminated elements. The list is terminated by two nulls in
796** a row. For example, the following text is a key with three elements
drh75897232000-05-29 14:26:00 +0000797**
drha9e99ae2002-08-13 23:02:57 +0000798** Aone\000Dtwo\000Athree\000\000
drh75897232000-05-29 14:26:00 +0000799**
drhda30d362002-08-26 19:55:07 +0000800** All elements begin with one of the characters "+-AD" and end with "\000"
801** with zero or more text elements in between. Except, NULL elements
802** consist of the special two-character sequence "N\000".
803**
drha9e99ae2002-08-13 23:02:57 +0000804** Both arguments will have the same number of elements. This routine
drh75897232000-05-29 14:26:00 +0000805** returns negative, zero, or positive if the first argument is less
806** than, equal to, or greater than the first. (Result is a-b).
807**
drha9e99ae2002-08-13 23:02:57 +0000808** Each element begins with one of the characters "+", "-", "A", "D".
drh38640e12002-07-05 21:42:36 +0000809** This character determines the sort order and collating sequence:
drh7a7c7392001-11-24 00:31:46 +0000810**
drh38640e12002-07-05 21:42:36 +0000811** + Sort numerically in ascending order
812** - Sort numerically in descending order
813** A Sort as strings in ascending order
814** D Sort as strings in descending order.
815**
816** For the "+" and "-" sorting, pure numeric strings (strings for which the
drh7a7c7392001-11-24 00:31:46 +0000817** isNum() function above returns TRUE) always compare less than strings
drha9e99ae2002-08-13 23:02:57 +0000818** that are not pure numerics. Non-numeric strings compare in memcmp()
danielk19774adee202004-05-08 08:23:19 +0000819** order. This is the same sort order as the sqlite3Compare() function
drha9e99ae2002-08-13 23:02:57 +0000820** above generates.
drh7a7c7392001-11-24 00:31:46 +0000821**
drha9e99ae2002-08-13 23:02:57 +0000822** The last point is a change from version 2.6.3 to version 2.7.0. In
823** version 2.6.3 and earlier, substrings of digits compare in numerical
824** and case was used only to break a tie.
825**
826** Elements that begin with 'A' or 'D' compare in memcmp() order regardless
827** of whether or not they look like a number.
828**
829** Note that the sort order imposed by the rules above is the same
drh7a7c7392001-11-24 00:31:46 +0000830** from the ordering defined by the "<", "<=", ">", and ">=" operators
drha9e99ae2002-08-13 23:02:57 +0000831** of expressions and for indices. This was not the case for version
832** 2.6.3 and earlier.
drh75897232000-05-29 14:26:00 +0000833*/
danielk19774adee202004-05-08 08:23:19 +0000834int sqlite3SortCompare(const char *a, const char *b){
drh75897232000-05-29 14:26:00 +0000835 int res = 0;
drh7a7c7392001-11-24 00:31:46 +0000836 int isNumA, isNumB;
drh294fb922002-09-30 01:31:21 +0000837 int dir = 0;
drh75897232000-05-29 14:26:00 +0000838
839 while( res==0 && *a && *b ){
drhda30d362002-08-26 19:55:07 +0000840 if( a[0]=='N' || b[0]=='N' ){
841 if( a[0]==b[0] ){
842 a += 2;
843 b += 2;
844 continue;
845 }
846 if( a[0]=='N' ){
847 dir = b[0];
848 res = -1;
849 }else{
850 dir = a[0];
851 res = +1;
852 }
drhf570f012002-05-31 15:51:25 +0000853 break;
854 }
drhda30d362002-08-26 19:55:07 +0000855 assert( a[0]==b[0] );
856 if( (dir=a[0])=='A' || a[0]=='D' ){
drh38640e12002-07-05 21:42:36 +0000857 res = strcmp(&a[1],&b[1]);
858 if( res ) break;
859 }else{
danielk19773d1bfea2004-05-14 11:00:53 +0000860 isNumA = sqlite3IsNumber(&a[1], 0);
861 isNumB = sqlite3IsNumber(&b[1], 0);
drh38640e12002-07-05 21:42:36 +0000862 if( isNumA ){
863 double rA, rB;
864 if( !isNumB ){
865 res = -1;
866 break;
867 }
danielk19774adee202004-05-08 08:23:19 +0000868 rA = sqlite3AtoF(&a[1], 0);
869 rB = sqlite3AtoF(&b[1], 0);
drh38640e12002-07-05 21:42:36 +0000870 if( rA<rB ){
871 res = -1;
872 break;
873 }
874 if( rA>rB ){
875 res = +1;
876 break;
877 }
878 }else if( isNumB ){
drh7a7c7392001-11-24 00:31:46 +0000879 res = +1;
880 break;
drh38640e12002-07-05 21:42:36 +0000881 }else{
drha9e99ae2002-08-13 23:02:57 +0000882 res = strcmp(&a[1],&b[1]);
883 if( res ) break;
drh7a7c7392001-11-24 00:31:46 +0000884 }
drh75897232000-05-29 14:26:00 +0000885 }
drhcab20052003-04-18 17:45:14 +0000886 a += strlen(&a[1]) + 2;
887 b += strlen(&b[1]) + 2;
drh75897232000-05-29 14:26:00 +0000888 }
drhda30d362002-08-26 19:55:07 +0000889 if( dir=='-' || dir=='D' ) res = -res;
drh75897232000-05-29 14:26:00 +0000890 return res;
891}
drhdce2cbe2000-05-31 02:27:49 +0000892
drh297ecf12001-04-05 15:57:13 +0000893#ifdef SQLITE_UTF8
drhdce2cbe2000-05-31 02:27:49 +0000894/*
drh297ecf12001-04-05 15:57:13 +0000895** X is a pointer to the first byte of a UTF-8 character. Increment
896** X so that it points to the next character. This only works right
897** if X points to a well-formed UTF-8 string.
drhe17a7e32001-04-04 21:10:18 +0000898*/
drh297ecf12001-04-05 15:57:13 +0000899#define sqliteNextChar(X) while( (0xc0&*++(X))==0x80 ){}
900#define sqliteCharVal(X) sqlite_utf8_to_int(X)
drhe17a7e32001-04-04 21:10:18 +0000901
drh297ecf12001-04-05 15:57:13 +0000902#else /* !defined(SQLITE_UTF8) */
drhe17a7e32001-04-04 21:10:18 +0000903/*
drh297ecf12001-04-05 15:57:13 +0000904** For iso8859 encoding, the next character is just the next byte.
drhe17a7e32001-04-04 21:10:18 +0000905*/
drh297ecf12001-04-05 15:57:13 +0000906#define sqliteNextChar(X) (++(X));
907#define sqliteCharVal(X) ((int)*(X))
drhe17a7e32001-04-04 21:10:18 +0000908
drh297ecf12001-04-05 15:57:13 +0000909#endif /* defined(SQLITE_UTF8) */
910
911
912#ifdef SQLITE_UTF8
drhe17a7e32001-04-04 21:10:18 +0000913/*
drh297ecf12001-04-05 15:57:13 +0000914** Convert the UTF-8 character to which z points into a 31-bit
915** UCS character. This only works right if z points to a well-formed
916** UTF-8 string.
drhe17a7e32001-04-04 21:10:18 +0000917*/
drh297ecf12001-04-05 15:57:13 +0000918static int sqlite_utf8_to_int(const unsigned char *z){
drhe17a7e32001-04-04 21:10:18 +0000919 int c;
drh297ecf12001-04-05 15:57:13 +0000920 static const int initVal[] = {
921 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
922 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,
923 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44,
924 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59,
925 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74,
926 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89,
927 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
928 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119,
929 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134,
930 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149,
931 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164,
932 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179,
933 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 0, 1, 2,
934 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,
935 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 0,
936 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
937 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 0, 1, 254,
938 255,
939 };
940 c = initVal[*(z++)];
941 while( (0xc0&*z)==0x80 ){
942 c = (c<<6) | (0x3f&*(z++));
drhe17a7e32001-04-04 21:10:18 +0000943 }
944 return c;
945}
drh297ecf12001-04-05 15:57:13 +0000946#endif
drhe17a7e32001-04-04 21:10:18 +0000947
948/*
949** Compare two UTF-8 strings for equality where the first string can
drhdce2cbe2000-05-31 02:27:49 +0000950** potentially be a "glob" expression. Return true (1) if they
951** are the same and false (0) if they are different.
952**
953** Globbing rules:
954**
955** '*' Matches any sequence of zero or more characters.
956**
957** '?' Matches exactly one character.
958**
959** [...] Matches one character from the enclosed list of
960** characters.
961**
962** [^...] Matches one character not in the enclosed list.
963**
964** With the [...] and [^...] matching, a ']' character can be included
965** in the list by making it the first character after '[' or '^'. A
966** range of characters can be specified using '-'. Example:
967** "[a-z]" matches any single lower-case letter. To match a '-', make
968** it the last character in the list.
969**
970** This routine is usually quick, but can be N**2 in the worst case.
971**
972** Hints: to match '*' or '?', put them in "[]". Like this:
973**
974** abc[*]xyz Matches "abc*xyz" only
975*/
drhe17a7e32001-04-04 21:10:18 +0000976int
danielk19774adee202004-05-08 08:23:19 +0000977sqlite3GlobCompare(const unsigned char *zPattern, const unsigned char *zString){
drhe17a7e32001-04-04 21:10:18 +0000978 register int c;
drhdce2cbe2000-05-31 02:27:49 +0000979 int invert;
980 int seen;
drhe17a7e32001-04-04 21:10:18 +0000981 int c2;
drhdce2cbe2000-05-31 02:27:49 +0000982
983 while( (c = *zPattern)!=0 ){
984 switch( c ){
985 case '*':
drhe17a7e32001-04-04 21:10:18 +0000986 while( (c=zPattern[1]) == '*' || c == '?' ){
987 if( c=='?' ){
988 if( *zString==0 ) return 0;
drh297ecf12001-04-05 15:57:13 +0000989 sqliteNextChar(zString);
drhe17a7e32001-04-04 21:10:18 +0000990 }
991 zPattern++;
992 }
993 if( c==0 ) return 1;
drhe17a7e32001-04-04 21:10:18 +0000994 if( c=='[' ){
danielk19774adee202004-05-08 08:23:19 +0000995 while( *zString && sqlite3GlobCompare(&zPattern[1],zString)==0 ){
drh297ecf12001-04-05 15:57:13 +0000996 sqliteNextChar(zString);
drhdce2cbe2000-05-31 02:27:49 +0000997 }
998 return *zString!=0;
999 }else{
1000 while( (c2 = *zString)!=0 ){
1001 while( c2 != 0 && c2 != c ){ c2 = *++zString; }
drhc61053b2000-06-04 12:58:36 +00001002 if( c2==0 ) return 0;
danielk19774adee202004-05-08 08:23:19 +00001003 if( sqlite3GlobCompare(&zPattern[1],zString) ) return 1;
drh297ecf12001-04-05 15:57:13 +00001004 sqliteNextChar(zString);
drhdce2cbe2000-05-31 02:27:49 +00001005 }
1006 return 0;
1007 }
drhe17a7e32001-04-04 21:10:18 +00001008 case '?': {
drhdce2cbe2000-05-31 02:27:49 +00001009 if( *zString==0 ) return 0;
drh297ecf12001-04-05 15:57:13 +00001010 sqliteNextChar(zString);
drhe17a7e32001-04-04 21:10:18 +00001011 zPattern++;
drhdce2cbe2000-05-31 02:27:49 +00001012 break;
drhe17a7e32001-04-04 21:10:18 +00001013 }
1014 case '[': {
1015 int prior_c = 0;
drhdce2cbe2000-05-31 02:27:49 +00001016 seen = 0;
1017 invert = 0;
drh297ecf12001-04-05 15:57:13 +00001018 c = sqliteCharVal(zString);
drhdce2cbe2000-05-31 02:27:49 +00001019 if( c==0 ) return 0;
1020 c2 = *++zPattern;
1021 if( c2=='^' ){ invert = 1; c2 = *++zPattern; }
1022 if( c2==']' ){
1023 if( c==']' ) seen = 1;
1024 c2 = *++zPattern;
1025 }
drh297ecf12001-04-05 15:57:13 +00001026 while( (c2 = sqliteCharVal(zPattern))!=0 && c2!=']' ){
drhe17a7e32001-04-04 21:10:18 +00001027 if( c2=='-' && zPattern[1]!=']' && zPattern[1]!=0 && prior_c>0 ){
1028 zPattern++;
drh297ecf12001-04-05 15:57:13 +00001029 c2 = sqliteCharVal(zPattern);
drhe17a7e32001-04-04 21:10:18 +00001030 if( c>=prior_c && c<=c2 ) seen = 1;
1031 prior_c = 0;
drhdce2cbe2000-05-31 02:27:49 +00001032 }else if( c==c2 ){
1033 seen = 1;
drhe17a7e32001-04-04 21:10:18 +00001034 prior_c = c2;
1035 }else{
1036 prior_c = c2;
drhdce2cbe2000-05-31 02:27:49 +00001037 }
drh297ecf12001-04-05 15:57:13 +00001038 sqliteNextChar(zPattern);
drhdce2cbe2000-05-31 02:27:49 +00001039 }
1040 if( c2==0 || (seen ^ invert)==0 ) return 0;
drh297ecf12001-04-05 15:57:13 +00001041 sqliteNextChar(zString);
drhe17a7e32001-04-04 21:10:18 +00001042 zPattern++;
drhdce2cbe2000-05-31 02:27:49 +00001043 break;
drhe17a7e32001-04-04 21:10:18 +00001044 }
1045 default: {
drhdce2cbe2000-05-31 02:27:49 +00001046 if( c != *zString ) return 0;
drhe17a7e32001-04-04 21:10:18 +00001047 zPattern++;
1048 zString++;
drhdce2cbe2000-05-31 02:27:49 +00001049 break;
drhe17a7e32001-04-04 21:10:18 +00001050 }
drhdce2cbe2000-05-31 02:27:49 +00001051 }
drhdce2cbe2000-05-31 02:27:49 +00001052 }
1053 return *zString==0;
1054}
1055
1056/*
drhe17a7e32001-04-04 21:10:18 +00001057** Compare two UTF-8 strings for equality using the "LIKE" operator of
drhdce2cbe2000-05-31 02:27:49 +00001058** SQL. The '%' character matches any sequence of 0 or more
1059** characters and '_' matches any single character. Case is
1060** not significant.
1061**
danielk19774adee202004-05-08 08:23:19 +00001062** This routine is just an adaptation of the sqlite3GlobCompare()
drhdce2cbe2000-05-31 02:27:49 +00001063** routine above.
1064*/
1065int
danielk19774adee202004-05-08 08:23:19 +00001066sqlite3LikeCompare(const unsigned char *zPattern, const unsigned char *zString){
drhe17a7e32001-04-04 21:10:18 +00001067 register int c;
1068 int c2;
drhdce2cbe2000-05-31 02:27:49 +00001069
1070 while( (c = UpperToLower[*zPattern])!=0 ){
1071 switch( c ){
drhe17a7e32001-04-04 21:10:18 +00001072 case '%': {
1073 while( (c=zPattern[1]) == '%' || c == '_' ){
1074 if( c=='_' ){
1075 if( *zString==0 ) return 0;
drh297ecf12001-04-05 15:57:13 +00001076 sqliteNextChar(zString);
drhdce2cbe2000-05-31 02:27:49 +00001077 }
drhe17a7e32001-04-04 21:10:18 +00001078 zPattern++;
drhdce2cbe2000-05-31 02:27:49 +00001079 }
drhe17a7e32001-04-04 21:10:18 +00001080 if( c==0 ) return 1;
1081 c = UpperToLower[c];
1082 while( (c2=UpperToLower[*zString])!=0 ){
1083 while( c2 != 0 && c2 != c ){ c2 = UpperToLower[*++zString]; }
1084 if( c2==0 ) return 0;
danielk19774adee202004-05-08 08:23:19 +00001085 if( sqlite3LikeCompare(&zPattern[1],zString) ) return 1;
drh297ecf12001-04-05 15:57:13 +00001086 sqliteNextChar(zString);
drhe17a7e32001-04-04 21:10:18 +00001087 }
1088 return 0;
1089 }
1090 case '_': {
drhdce2cbe2000-05-31 02:27:49 +00001091 if( *zString==0 ) return 0;
drh297ecf12001-04-05 15:57:13 +00001092 sqliteNextChar(zString);
drhe17a7e32001-04-04 21:10:18 +00001093 zPattern++;
drhdce2cbe2000-05-31 02:27:49 +00001094 break;
drhe17a7e32001-04-04 21:10:18 +00001095 }
1096 default: {
drhdce2cbe2000-05-31 02:27:49 +00001097 if( c != UpperToLower[*zString] ) return 0;
drhe17a7e32001-04-04 21:10:18 +00001098 zPattern++;
1099 zString++;
drhdce2cbe2000-05-31 02:27:49 +00001100 break;
drhe17a7e32001-04-04 21:10:18 +00001101 }
drhdce2cbe2000-05-31 02:27:49 +00001102 }
drhdce2cbe2000-05-31 02:27:49 +00001103 }
1104 return *zString==0;
1105}
drh5e00f6c2001-09-13 13:46:56 +00001106
1107/*
drhc22bd472002-05-10 13:14:07 +00001108** Change the sqlite.magic from SQLITE_MAGIC_OPEN to SQLITE_MAGIC_BUSY.
1109** Return an error (non-zero) if the magic was not SQLITE_MAGIC_OPEN
1110** when this routine is called.
1111**
1112** This routine is a attempt to detect if two threads use the
1113** same sqlite* pointer at the same time. There is a race
1114** condition so it is possible that the error is not detected.
1115** But usually the problem will be seen. The result will be an
drhc27a1ce2002-06-14 20:58:45 +00001116** error which can be used to debug the application that is
drhc22bd472002-05-10 13:14:07 +00001117** using SQLite incorrectly.
drhe7e8bc72002-12-17 13:05:25 +00001118**
1119** Ticket #202: If db->magic is not a valid open value, take care not
1120** to modify the db structure at all. It could be that db is a stale
1121** pointer. In other words, it could be that there has been a prior
danielk19776f8a5032004-05-10 10:34:51 +00001122** call to sqlite3_close(db) and db has been deallocated. And we do
drhe7e8bc72002-12-17 13:05:25 +00001123** not want to write into deallocated memory.
drh5e00f6c2001-09-13 13:46:56 +00001124*/
danielk19774adee202004-05-08 08:23:19 +00001125int sqlite3SafetyOn(sqlite *db){
drhc22bd472002-05-10 13:14:07 +00001126 if( db->magic==SQLITE_MAGIC_OPEN ){
1127 db->magic = SQLITE_MAGIC_BUSY;
1128 return 0;
drh94e92032003-02-16 22:21:32 +00001129 }else if( db->magic==SQLITE_MAGIC_BUSY || db->magic==SQLITE_MAGIC_ERROR
1130 || db->want_to_close ){
drhc22bd472002-05-10 13:14:07 +00001131 db->magic = SQLITE_MAGIC_ERROR;
1132 db->flags |= SQLITE_Interrupt;
drh5e00f6c2001-09-13 13:46:56 +00001133 }
drhe7e8bc72002-12-17 13:05:25 +00001134 return 1;
drhc22bd472002-05-10 13:14:07 +00001135}
1136
1137/*
1138** Change the magic from SQLITE_MAGIC_BUSY to SQLITE_MAGIC_OPEN.
1139** Return an error (non-zero) if the magic was not SQLITE_MAGIC_BUSY
1140** when this routine is called.
1141*/
danielk19774adee202004-05-08 08:23:19 +00001142int sqlite3SafetyOff(sqlite *db){
drhc22bd472002-05-10 13:14:07 +00001143 if( db->magic==SQLITE_MAGIC_BUSY ){
1144 db->magic = SQLITE_MAGIC_OPEN;
1145 return 0;
drh94e92032003-02-16 22:21:32 +00001146 }else if( db->magic==SQLITE_MAGIC_OPEN || db->magic==SQLITE_MAGIC_ERROR
1147 || db->want_to_close ){
drhc22bd472002-05-10 13:14:07 +00001148 db->magic = SQLITE_MAGIC_ERROR;
1149 db->flags |= SQLITE_Interrupt;
drhc22bd472002-05-10 13:14:07 +00001150 }
drhe7e8bc72002-12-17 13:05:25 +00001151 return 1;
drhc22bd472002-05-10 13:14:07 +00001152}
1153
1154/*
danielk19776f8a5032004-05-10 10:34:51 +00001155** Check to make sure we are not currently executing an sqlite3_exec().
1156** If we are currently in an sqlite3_exec(), return true and set
drhc22bd472002-05-10 13:14:07 +00001157** sqlite.magic to SQLITE_MAGIC_ERROR. This will cause a complete
1158** shutdown of the database.
1159**
1160** This routine is used to try to detect when API routines are called
1161** at the wrong time or in the wrong sequence.
1162*/
danielk19774adee202004-05-08 08:23:19 +00001163int sqlite3SafetyCheck(sqlite *db){
drh326dce72003-01-29 14:06:07 +00001164 if( db->pVdbe!=0 ){
drhc22bd472002-05-10 13:14:07 +00001165 db->magic = SQLITE_MAGIC_ERROR;
1166 return 1;
1167 }
1168 return 0;
drh5e00f6c2001-09-13 13:46:56 +00001169}
danielk19774adee202004-05-08 08:23:19 +00001170
drh6d2fb152004-05-14 16:50:06 +00001171/*
drhd8820e82004-05-18 15:57:42 +00001172** The variable-length integer encoding is as follows:
1173**
1174** KEY:
1175** A = 0xxxxxxx 7 bits of data and one flag bit
1176** B = 1xxxxxxx 7 bits of data and one flag bit
1177** C = xxxxxxxx 8 bits of data
1178**
1179** 7 bits - A
1180** 14 bits - BA
1181** 21 bits - BBA
1182** 28 bits - BBBA
1183** 35 bits - BBBBA
1184** 42 bits - BBBBBA
1185** 49 bits - BBBBBBA
1186** 56 bits - BBBBBBBA
1187** 64 bits - BBBBBBBBC
1188*/
1189
1190/*
drh6d2fb152004-05-14 16:50:06 +00001191** Write a 64-bit variable-length integer to memory starting at p[0].
1192** The length of data write will be between 1 and 9 bytes. The number
1193** of bytes written is returned.
1194**
1195** A variable-length integer consists of the lower 7 bits of each byte
1196** for all bytes that have the 8th bit set and one byte with the 8th
drhd8820e82004-05-18 15:57:42 +00001197** bit clear. Except, if we get to the 9th byte, it stores the full
1198** 8 bits and is the last byte.
drh6d2fb152004-05-14 16:50:06 +00001199*/
danielk1977192ac1d2004-05-10 07:17:30 +00001200int sqlite3PutVarint(unsigned char *p, u64 v){
drh6d2fb152004-05-14 16:50:06 +00001201 int i, j, n;
1202 u8 buf[10];
drhd8820e82004-05-18 15:57:42 +00001203 if( v & 0xff00000000000000 ){
1204 p[8] = v;
1205 v >>= 8;
1206 for(i=7; i>=0; i--){
1207 p[i] = (v & 0x7f) | 0x80;
1208 v >>= 7;
1209 }
1210 return 9;
1211 }
drh6d2fb152004-05-14 16:50:06 +00001212 n = 0;
danielk1977192ac1d2004-05-10 07:17:30 +00001213 do{
drh6d2fb152004-05-14 16:50:06 +00001214 buf[n++] = (v & 0x7f) | 0x80;
danielk1977192ac1d2004-05-10 07:17:30 +00001215 v >>= 7;
1216 }while( v!=0 );
drh6d2fb152004-05-14 16:50:06 +00001217 buf[0] &= 0x7f;
drhd8820e82004-05-18 15:57:42 +00001218 assert( n<=9 );
drh6d2fb152004-05-14 16:50:06 +00001219 for(i=0, j=n-1; j>=0; j--, i++){
1220 p[i] = buf[j];
1221 }
1222 return n;
danielk1977192ac1d2004-05-10 07:17:30 +00001223}
danielk19774adee202004-05-08 08:23:19 +00001224
drh6d2fb152004-05-14 16:50:06 +00001225/*
1226** Read a 64-bit variable-length integer from memory starting at p[0].
1227** Return the number of bytes read. The value is stored in *v.
1228*/
danielk197790e4d952004-05-10 10:05:53 +00001229int sqlite3GetVarint(const unsigned char *p, u64 *v){
drh6d2fb152004-05-14 16:50:06 +00001230 u32 x;
1231 u64 x64;
1232 int n;
1233 unsigned char c;
1234 c = p[0];
1235 if( (c & 0x80)==0 ){
1236 *v = c;
1237 return 1;
1238 }
1239 x = c & 0x7f;
1240 c = p[1];
1241 if( (c & 0x80)==0 ){
1242 *v = (x<<7) | c;
1243 return 2;
1244 }
1245 x = (x<<7) | (c&0x7f);
1246 c = p[2];
1247 if( (c & 0x80)==0 ){
1248 *v = (x<<7) | c;
1249 return 3;
1250 }
1251 x = (x<<7) | (c&0x7f);
1252 c = p[3];
1253 if( (c & 0x80)==0 ){
1254 *v = (x<<7) | c;
1255 return 4;
1256 }
1257 x64 = (x<<7) | (c&0x7f);
1258 n = 4;
1259 do{
1260 c = p[n++];
drhd8820e82004-05-18 15:57:42 +00001261 if( n==9 ){
1262 x64 = (x64<<8) | c;
1263 break;
1264 }
drh6d2fb152004-05-14 16:50:06 +00001265 x64 = (x64<<7) | (c&0x7f);
1266 }while( (c & 0x80)!=0 );
1267 *v = x64;
1268 return n;
1269}
1270
1271/*
1272** Read a 32-bit variable-length integer from memory starting at p[0].
1273** Return the number of bytes read. The value is stored in *v.
1274*/
1275int sqlite3GetVarint32(const unsigned char *p, u32 *v){
1276 int n = 1;
1277 unsigned char c = p[0];
1278 u32 x = c & 0x7f;
drhd8820e82004-05-18 15:57:42 +00001279 while( (c & 0x80)!=0 && n<9 ){
drh6d2fb152004-05-14 16:50:06 +00001280 c = p[n++];
1281 x = (x<<7) | (c & 0x7f);
danielk1977192ac1d2004-05-10 07:17:30 +00001282 }
1283 *v = x;
1284 return n;
1285}
1286
drh6d2fb152004-05-14 16:50:06 +00001287/*
1288** Return the number of bytes that will be needed to store the given
1289** 64-bit integer.
1290*/
danielk1977192ac1d2004-05-10 07:17:30 +00001291int sqlite3VarintLen(u64 v){
1292 int i = 0;
1293 do{
1294 i++;
1295 v >>= 7;
drhd8820e82004-05-18 15:57:42 +00001296 }while( v!=0 && i<9 );
danielk1977192ac1d2004-05-10 07:17:30 +00001297 return i;
1298}