Many hyperlinks are disabled.
Use anonymous login
to enable hyperlinks.
Overview
| Comment: | remove unnecessary code when NDEBUG is defined (CVS 163) |
|---|---|
| Downloads: | Tarball | ZIP archive | SQL archive |
| Timelines: | family | ancestors | descendants | both | trunk |
| Files: | files | file ages | folders |
| SHA1: |
738e3e49f6d45e4393e35f7f5f65a41d |
| User & Date: | drh 2000-10-23 01:08:00 |
Context
|
2000-10-23
| ||
| 13:16 | documentation and speed updates (CVS 164) check-in: 356cdd64 user: drh tags: trunk | |
| 01:08 | remove unnecessary code when NDEBUG is defined (CVS 163) check-in: 738e3e49 user: drh tags: trunk | |
|
2000-10-22
| ||
| 20:39 | fix a debugging issue (CVS 162) check-in: f0a5255d user: drh tags: trunk | |
Changes
Changes to src/vdbe.c.
37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 ... 902 903 904 905 906 907 908 909 910 911 912 913 914 915 ... 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 .... 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 .... 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 .... 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 .... 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 .... 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 .... 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 .... 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 .... 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 .... 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 .... 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 .... 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 .... 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 .... 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 .... 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 .... 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 .... 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 .... 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 .... 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 .... 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 .... 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 .... 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 .... 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 .... 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 .... 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 .... 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 .... 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 .... 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 .... 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 .... 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 .... 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 .... 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 .... 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 .... 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 .... 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 .... 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 .... 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 .... 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 .... 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 .... 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 .... 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 .... 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 .... 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 .... 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 .... 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 .... 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 .... 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 .... 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 .... 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 .... 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 .... 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 .... 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 .... 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 .... 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 .... 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 .... 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 .... 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 .... 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 .... 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 .... 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 .... 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 .... 3137 3138 3139 3140 3141 3142 3143 3144 3145 3146 3147 3148 3149 3150 3151 3152 3153 .... 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165 3166 3167 3168 3169 3170 3171 .... 3172 3173 3174 3175 3176 3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 .... 3208 3209 3210 3211 3212 3213 3214 3215 3216 3217 3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 |
** inplicit conversion from one type to the other occurs as necessary. ** ** Most of the code in this file is taken up by the sqliteVdbeExec() ** function which does the work of interpreting a VDBE program. ** But other routines are also provided to help in building up ** a program instruction by instruction. ** ** $Id: vdbe.c,v 1.45 2000/10/19 14:42:05 drh Exp $ */ #include "sqliteInt.h" #include <unistd.h> #include <ctype.h> /* ** SQL is translated into a sequence of instructions to be ................................................................................ pTail->pNext = pLeft; }else if( pRight ){ pTail->pNext = pRight; } return sHead.pNext; } /* ** Execute the program in the VDBE. ** ** If an error occurs, an error message is written to memory obtained ** from sqliteMalloc() and *pzErrMsg is made to point to that memory. ** The return parameter is the number of errors. ** ................................................................................ void *pBusyArg, /* 1st argument to the busy callback */ int (*xBusy)(void*,const char*,int) /* Called when a file is busy */ ){ int pc; /* The program counter */ Op *pOp; /* Current operation */ int rc; /* Value to return */ Dbbe *pBe = p->pBe; /* The backend driver */ char zBuf[100]; /* Space to sprintf() and integer */ p->tos = -1; rc = SQLITE_OK; #ifdef MEMORY_DEBUG if( access("vdbe_trace",0)==0 ){ p->trace = stderr; } #endif /* if( pzErrMsg ){ *pzErrMsg = 0; } */ for(pc=0; rc==SQLITE_OK && pc<p->nOp && pc>=0; pc++){ pOp = &p->aOp[pc]; /* Interrupt processing if requested. */ if( p->db->flags & SQLITE_Interrupt ){ p->db->flags &= ~SQLITE_Interrupt; rc = SQLITE_INTERRUPT; sqliteSetString(pzErrMsg, "interrupted", 0); break; } /* Only allow tracing if NDEBUG is not defined. */ ................................................................................ /* Opcode: Integer P1 * * ** ** The integer value P1 is pushed onto the stack. */ case OP_Integer: { int i = ++p->tos; if( NeedStack(p, p->tos) ) goto no_mem; p->aStack[i].i = pOp->p1; p->aStack[i].flags = STK_Int; break; } /* Opcode: String * * P3 ** ** The string value P3 is pushed onto the stack. */ case OP_String: { int i = ++p->tos; char *z; if( NeedStack(p, p->tos) ) goto no_mem; z = pOp->p3; if( z==0 ) z = ""; p->zStack[i] = z; p->aStack[i].n = strlen(z) + 1; p->aStack[i].flags = STK_Str; break; } ................................................................................ /* Opcode: Null * * * ** ** Push a NULL value onto the stack. */ case OP_Null: { int i = ++p->tos; if( NeedStack(p, p->tos) ) goto no_mem; p->zStack[i] = 0; p->aStack[i].flags = STK_Null; break; } /* Opcode: Pop P1 * * ** ................................................................................ ** The top of the stack is element 0. So the ** instruction "Dup 0 0 0" will make a copy of the ** top of the stack. */ case OP_Dup: { int i = p->tos - pOp->p1; int j = ++p->tos; if( i<0 ) goto not_enough_stack; if( NeedStack(p, p->tos) ) goto no_mem; p->aStack[j] = p->aStack[i]; if( p->aStack[i].flags & STK_Dyn ){ p->zStack[j] = sqliteMalloc( p->aStack[j].n ); if( p->zStack[j]==0 ) goto no_mem; memcpy(p->zStack[j], p->zStack[i], p->aStack[j].n); }else{ p->zStack[j] = p->zStack[i]; ................................................................................ */ case OP_Pull: { int from = p->tos - pOp->p1; int to = p->tos; int i; Stack ts; char *tz; if( from<0 ) goto not_enough_stack; ts = p->aStack[from]; tz = p->zStack[from]; for(i=from; i<to; i++){ p->aStack[i] = p->aStack[i+1]; p->zStack[i] = p->zStack[i+1]; } p->aStack[to] = ts; ................................................................................ ** Pop P1 values off the stack and form them into an array. Then ** invoke the callback function using the newly formed array as the ** 3rd parameter. */ case OP_Callback: { int i = p->tos - pOp->p1 + 1; int j; if( i<0 ) goto not_enough_stack; if( NeedStack(p, p->tos+2) ) goto no_mem; for(j=i; j<=p->tos; j++){ if( (p->aStack[j].flags & STK_Null)==0 ){ if( Stringify(p, j) ) goto no_mem; } } p->zStack[p->tos+1] = 0; if( xCallback!=0 ){ ................................................................................ char *zSep; int nSep; nField = pOp->p1; zSep = pOp->p3; if( zSep==0 ) zSep = ""; nSep = strlen(zSep); if( p->tos+1<nField ) goto not_enough_stack; nByte = 1 - nSep; for(i=p->tos-nField+1; i<=p->tos; i++){ if( p->aStack[i].flags & STK_Null ){ nByte += nSep; }else{ if( Stringify(p, i) ) goto no_mem; nByte += p->aStack[i].n - 1 + nSep; ................................................................................ if( nSep>0 && i<p->tos ){ memcpy(&zNew[j], zSep, nSep); j += nSep; } } zNew[j] = 0; if( pOp->p2==0 ) PopStack(p, nField); NeedStack(p, p->tos+1); p->tos++; p->aStack[p->tos].n = nByte; p->aStack[p->tos].flags = STK_Str|STK_Dyn; p->zStack[p->tos] = zNew; break; } ................................................................................ */ case OP_Add: case OP_Subtract: case OP_Multiply: case OP_Divide: { int tos = p->tos; int nos = tos - 1; if( nos<0 ) goto not_enough_stack; if( (p->aStack[tos].flags & p->aStack[nos].flags & STK_Int)==STK_Int ){ int a, b; a = p->aStack[tos].i; b = p->aStack[nos].i; switch( pOp->opcode ){ case OP_Add: b += a; break; case OP_Subtract: b -= a; break; ................................................................................ ** largest of the two. */ case OP_Max: { int tos = p->tos; int nos = tos - 1; int ft, fn; int copy = 0; if( nos<0 ) goto not_enough_stack; ft = p->aStack[tos].flags; fn = p->aStack[nos].flags; if( fn & STK_Null ){ copy = 1; }else if( (ft & fn & STK_Int)==STK_Int ){ copy = p->aStack[nos].i<p->aStack[tos].i; }else if( ( (ft|fn) & (STK_Int|STK_Real) ) !=0 ){ ................................................................................ ** smaller of the two. */ case OP_Min: { int tos = p->tos; int nos = tos - 1; int ft, fn; int copy = 0; if( nos<0 ) goto not_enough_stack; ft = p->aStack[tos].flags; fn = p->aStack[nos].flags; if( fn & STK_Null ){ copy = 1; }else if( ft & STK_Null ){ copy = 0; }else if( (ft & fn & STK_Int)==STK_Int ){ ................................................................................ /* Opcode: AddImm P1 * * ** ** Add the value P1 to whatever is on top of the stack. */ case OP_AddImm: { int tos = p->tos; if( tos<0 ) goto not_enough_stack; Integerify(p, tos); p->aStack[tos].i += pOp->p1; break; } /* Opcode: Eq * P2 * ** ................................................................................ case OP_Le: case OP_Gt: case OP_Ge: { int tos = p->tos; int nos = tos - 1; int c; int ft, fn; if( nos<0 ) goto not_enough_stack; ft = p->aStack[tos].flags; fn = p->aStack[nos].flags; if( (ft & fn)==STK_Int ){ c = p->aStack[nos].i - p->aStack[tos].i; }else{ Stringify(p, tos); Stringify(p, nos); ................................................................................ ** have a "NOT LIKE" operator. The jump is made if the two values ** are different. */ case OP_Like: { int tos = p->tos; int nos = tos - 1; int c; if( nos<0 ) goto not_enough_stack; Stringify(p, tos); Stringify(p, nos); c = sqliteLikeCompare(p->zStack[tos], p->zStack[nos]); PopStack(p, 2); if( pOp->p1 ) c = !c; if( c ) pc = pOp->p2-1; break; ................................................................................ ** have a "NOT GLOB" operator. The jump is made if the two values ** are different. */ case OP_Glob: { int tos = p->tos; int nos = tos - 1; int c; if( nos<0 ) goto not_enough_stack; Stringify(p, tos); Stringify(p, nos); c = sqliteGlobCompare(p->zStack[tos], p->zStack[nos]); PopStack(p, 2); if( pOp->p1 ) c = !c; if( c ) pc = pOp->p2-1; break; ................................................................................ ** stack. */ case OP_And: case OP_Or: { int tos = p->tos; int nos = tos - 1; int c; if( nos<0 ) goto not_enough_stack; Integerify(p, tos); Integerify(p, nos); if( pOp->opcode==OP_And ){ c = p->aStack[tos].i && p->aStack[nos].i; }else{ c = p->aStack[tos].i || p->aStack[nos].i; } ................................................................................ /* Opcode: Negative * * * ** ** Treat the top of the stack as a numeric quantity. Replace it ** with its additive inverse. */ case OP_Negative: { int tos; if( (tos = p->tos)<0 ) goto not_enough_stack; if( p->aStack[tos].flags & STK_Real ){ Release(p, tos); p->aStack[tos].r = -p->aStack[tos].r; p->aStack[tos].flags = STK_Real; }else if( p->aStack[tos].flags & STK_Int ){ Release(p, tos); p->aStack[tos].i = -p->aStack[tos].i; ................................................................................ /* Opcode: Not * * * ** ** Interpret the top of the stack as a boolean value. Replace it ** with its complement. */ case OP_Not: { int tos = p->tos; if( p->tos<0 ) goto not_enough_stack; Integerify(p, tos); Release(p, tos); p->aStack[tos].i = !p->aStack[tos].i; p->aStack[tos].flags = STK_Int; break; } ................................................................................ ** Pop a single boolean from the stack. If the boolean popped is ** true, then jump to p2. Otherwise continue to the next instruction. ** An integer is false if zero and true otherwise. A string is ** false if it has zero length and true otherwise. */ case OP_If: { int c; if( p->tos<0 ) goto not_enough_stack; Integerify(p, p->tos); c = p->aStack[p->tos].i; PopStack(p, 1); if( c ) pc = pOp->p2-1; break; } ................................................................................ ** ** Pop a single value from the stack. If the value popped is NULL ** then jump to p2. Otherwise continue to the next ** instruction. */ case OP_IsNull: { int c; if( p->tos<0 ) goto not_enough_stack; c = (p->aStack[p->tos].flags & STK_Null)!=0; PopStack(p, 1); if( c ) pc = pOp->p2-1; break; } /* Opcode: NotNull * P2 * ................................................................................ ** ** Pop a single value from the stack. If the value popped is not an ** empty string, then jump to p2. Otherwise continue to the next ** instruction. */ case OP_NotNull: { int c; if( p->tos<0 ) goto not_enough_stack; c = (p->aStack[p->tos].flags & STK_Null)==0; PopStack(p, 1); if( c ) pc = pOp->p2-1; break; } /* Opcode: MakeRecord P1 * * ................................................................................ char *zNewRecord; int nByte; int nField; int i, j; int addr; nField = pOp->p1; if( p->tos+1<nField ) goto not_enough_stack; nByte = 0; for(i=p->tos-nField+1; i<=p->tos; i++){ if( (p->aStack[i].flags & STK_Null)==0 ){ if( Stringify(p, i) ) goto no_mem; nByte += p->aStack[i].n; } } ................................................................................ for(i=p->tos-nField+1; i<=p->tos; i++){ if( (p->aStack[i].flags & STK_Null)==0 ){ memcpy(&zNewRecord[j], p->zStack[i], p->aStack[i].n); j += p->aStack[i].n; } } PopStack(p, nField); NeedStack(p, p->tos+1); p->tos++; p->aStack[p->tos].n = nByte; p->aStack[p->tos].flags = STK_Str | STK_Dyn; p->zStack[p->tos] = zNewRecord; break; } ................................................................................ case OP_MakeKey: { char *zNewKey; int nByte; int nField; int i, j; nField = pOp->p1; if( p->tos+1<nField ) goto not_enough_stack; nByte = 0; for(i=p->tos-nField+1; i<=p->tos; i++){ if( p->aStack[i].flags & STK_Null ){ nByte++; }else{ if( Stringify(p, i) ) goto no_mem; nByte += p->aStack[i].n; ................................................................................ memcpy(&zNewKey[j], p->zStack[i], p->aStack[i].n-1); j += p->aStack[i].n-1; } if( i<p->tos ) zNewKey[j++] = '\t'; } zNewKey[j] = 0; if( pOp->p2==0 ) PopStack(p, nField); NeedStack(p, p->tos+1); p->tos++; p->aStack[p->tos].n = nByte; p->aStack[p->tos].flags = STK_Str|STK_Dyn; p->zStack[p->tos] = zNewKey; break; } ................................................................................ ** If P3 is null or an empty string, a temporary database file ** is created. This temporary database file is automatically ** deleted when the cursor is closed. */ case OP_Open: { int busy = 0; int i = pOp->p1; if( i<0 ) goto bad_instruction; if( i>=p->nCursor ){ int j; p->aCsr = sqliteRealloc( p->aCsr, (i+1)*sizeof(Cursor) ); if( p->aCsr==0 ){ p->nCursor = 0; goto no_mem; } for(j=p->nCursor; j<=i; j++) p->aCsr[j].pCursor = 0; p->nCursor = i+1; }else if( p->aCsr[i].pCursor ){ ................................................................................ ** Pop the top of the stack and use its value as a key to fetch ** a record from cursor P1. The key/data pair is held ** in the P1 cursor until needed. */ case OP_Fetch: { int i = pOp->p1; int tos = p->tos; if( tos<0 ) goto not_enough_stack; if( i>=0 && i<p->nCursor && p->aCsr[i].pCursor ){ if( p->aStack[tos].flags & STK_Int ){ pBe->Fetch(p->aCsr[i].pCursor, sizeof(int), (char*)&p->aStack[tos].i); }else{ if( Stringify(p, tos) ) goto no_mem; pBe->Fetch(p->aCsr[i].pCursor, p->aStack[tos].n, ................................................................................ ** ** This instruction is used to implement the special fcnt() function ** in the SQL dialect that SQLite understands. fcnt() is used for ** testing purposes. */ case OP_Fcnt: { int i = ++p->tos; if( NeedStack(p, p->tos) ) goto no_mem; p->aStack[i].i = p->nFetch; p->aStack[i].flags = STK_Int; break; } /* Opcode: Distinct P1 P2 * ** ................................................................................ */ case OP_Distinct: case OP_NotFound: case OP_Found: { int i = pOp->p1; int tos = p->tos; int alreadyExists = 0; if( tos<0 ) goto not_enough_stack; if( i>=0 && i<p->nCursor && p->aCsr[i].pCursor ){ if( p->aStack[tos].flags & STK_Int ){ alreadyExists = pBe->Test(p->aCsr[i].pCursor, sizeof(int), (char*)&p->aStack[tos].i); }else{ if( Stringify(p, tos) ) goto no_mem; alreadyExists = pBe->Test(p->aCsr[i].pCursor,p->aStack[tos].n, p->zStack[tos]); ................................................................................ ** ** Get a new integer key not previous used by the database file ** associated with cursor P1 and push it onto the stack. */ case OP_New: { int i = pOp->p1; int v; if( i<0 || i>=p->nCursor || p->aCsr[i].pCursor==0 ){ v = 0; }else{ v = pBe->New(p->aCsr[i].pCursor); } NeedStack(p, p->tos+1); p->tos++; p->aStack[p->tos].i = v; p->aStack[p->tos].flags = STK_Int; break; } /* Opcode: Put P1 * * ................................................................................ ** stack. The key is the next value down on the stack. The stack ** is popped twice by this instruction. */ case OP_Put: { int tos = p->tos; int nos = p->tos-1; int i = pOp->p1; if( nos<0 ) goto not_enough_stack; if( i>=0 && i<p->nCursor && p->aCsr[i].pCursor!=0 ){ char *zKey; int nKey; if( (p->aStack[nos].flags & STK_Int)==0 ){ if( Stringify(p, nos) ) goto no_mem; nKey = p->aStack[nos].n; zKey = p->zStack[nos]; }else{ ................................................................................ ** ** The top of the stack is a key. Remove this key and its data ** from database file P1. Then pop the stack to discard the key. */ case OP_Delete: { int tos = p->tos; int i = pOp->p1; if( tos<0 ) goto not_enough_stack; if( i>=0 && i<p->nCursor && p->aCsr[i].pCursor!=0 ){ char *zKey; int nKey; if( p->aStack[tos].flags & STK_Int ){ nKey = sizeof(int); zKey = (char*)&p->aStack[tos].i; }else{ if( Stringify(p, tos) ) goto no_mem; ................................................................................ ** Turn the key-as-data mode for cursor P1 either on (if P2==1) or ** off (if P2==0). In key-as-data mode, the OP_Field opcode pulls ** data off of the key rather than the data. This is useful for ** processing compound selects. */ case OP_KeyAsData: { int i = pOp->p1; if( i>=0 && i<p->nCursor && p->aCsr[i].pCursor!=0 ){ p->aCsr[i].keyAsData = pOp->p2; } break; } /* Opcode: Field P1 P2 * ** ................................................................................ int amt; int i = pOp->p1; int p2 = pOp->p2; int tos = ++p->tos; DbbeCursor *pCrsr; char *z; if( NeedStack(p, tos) ) goto no_mem; if( i>=0 && i<p->nCursor && (pCrsr = p->aCsr[i].pCursor)!=0 ){ if( p->aCsr[i].keyAsData ){ amt = pBe->KeyLength(pCrsr); if( amt<=sizeof(int)*(p2+1) ){ p->aStack[tos].flags = STK_Null; break; } pAddr = (int*)pBe->ReadKey(pCrsr, sizeof(int)*p2); ................................................................................ ** Next opcode. */ case OP_Key: { int i = pOp->p1; int tos = ++p->tos; DbbeCursor *pCrsr; if( NeedStack(p, p->tos) ) goto no_mem; if( i>=0 && i<p->nCursor && (pCrsr = p->aCsr[i].pCursor)!=0 ){ char *z = pBe->ReadKey(pCrsr, 0); if( p->aCsr[i].keyAsData ){ p->zStack[tos] = z; p->aStack[tos].flags = STK_Str; p->aStack[tos].n = pBe->KeyLength(pCrsr); }else{ memcpy(&p->aStack[tos].i, z, sizeof(int)); ................................................................................ /* Opcode: Rewind P1 * * ** ** The next use of the Key or Field or Next instruction for P1 ** will refer to the first entry in the database file. */ case OP_Rewind: { int i = pOp->p1; if( i>=0 && i<p->nCursor && p->aCsr[i].pCursor!=0 ){ pBe->Rewind(p->aCsr[i].pCursor); } break; } /* Opcode: Next P1 P2 * ** ** Advance P1 to the next key/data pair in the file. Or, if there are no ** more key/data pairs, rewind P1 and jump to location P2. */ case OP_Next: { int i = pOp->p1; if( i>=0 && i<p->nCursor && p->aCsr[i].pCursor!=0 ){ if( pBe->NextKey(p->aCsr[i].pCursor)==0 ){ pc = pOp->p2 - 1; }else{ p->nFetch++; } } break; ................................................................................ ** there is an immediate jump to instruction P2. */ case OP_NextIdx: { int i = pOp->p1; int tos = ++p->tos; DbbeCursor *pCrsr; if( NeedStack(p, p->tos) ) goto no_mem; p->zStack[tos] = 0; if( i>=0 && i<p->nCursor && (pCrsr = p->aCsr[i].pCursor)!=0 ){ int *aIdx; int nIdx; int j, k; nIdx = pBe->DataLength(pCrsr)/sizeof(int); aIdx = (int*)pBe->ReadData(pCrsr, 0); if( nIdx>1 ){ k = *(aIdx++); ................................................................................ ** record and write it back to the P1 file. */ case OP_PutIdx: { int i = pOp->p1; int tos = p->tos; int nos = tos - 1; DbbeCursor *pCrsr; if( nos<0 ) goto not_enough_stack; if( i>=0 && i<p->nCursor && (pCrsr = p->aCsr[i].pCursor)!=0 ){ int r; int newVal; Integerify(p, nos); newVal = p->aStack[nos].i; if( Stringify(p, tos) ) goto no_mem; r = pBe->Fetch(pCrsr, p->aStack[tos].n, p->zStack[tos]); if( r==0 ){ ................................................................................ ** the P1 data, then the corresponding P1 record is deleted. */ case OP_DeleteIdx: { int i = pOp->p1; int tos = p->tos; int nos = tos - 1; DbbeCursor *pCrsr; if( nos<0 ) goto not_enough_stack; if( i>=0 && i<p->nCursor && (pCrsr = p->aCsr[i].pCursor)!=0 ){ int *aIdx; int nIdx; int j, k; int r; int oldVal; Integerify(p, nos); oldVal = p->aStack[nos].i; ................................................................................ ** will server as a handle to this temporary file for future ** interactions. If another temporary file with the P1 handle is ** already opened, the prior file is closed and a new one opened ** in its place. */ case OP_ListOpen: { int i = pOp->p1; if( i<0 ) goto bad_instruction; if( i>=p->nList ){ int j; p->apList = sqliteRealloc( p->apList, (i+1)*sizeof(FILE*) ); if( p->apList==0 ){ p->nList = 0; goto no_mem; } for(j=p->nList; j<=i; j++) p->apList[j] = 0; p->nList = i+1; }else if( p->apList[i] ){ ................................................................................ /* Opcode: ListWrite P1 * * ** ** Write the integer on the top of the stack ** into the temporary storage file P1. */ case OP_ListWrite: { int i = pOp->p1; if( i<0 ) goto bad_instruction; if( p->tos<0 ) goto not_enough_stack; if( i<p->nList && p->apList[i]!=0 ){ int val; Integerify(p, p->tos); val = p->aStack[p->tos].i; PopStack(p, 1); fwrite(&val, sizeof(int), 1, p->apList[i]); } break; ................................................................................ /* Opcode: ListRewind P1 * * ** ** Rewind the temporary buffer P1 back to the beginning. */ case OP_ListRewind: { int i = pOp->p1; if( i<0 ) goto bad_instruction; if( i<p->nList && p->apList[i]!=0 ){ rewind(p->apList[i]); } break; } /* Opcode: ListRead P1 P2 * ** ................................................................................ ** Attempt to read an integer from temporary storage buffer P1 ** and push it onto the stack. If the storage buffer is empty, ** push nothing but instead jump to P2. */ case OP_ListRead: { int i = pOp->p1; int val, amt; if( i<0 || i>=p->nList || p->apList[i]==0 ) goto bad_instruction; amt = fread(&val, sizeof(int), 1, p->apList[i]); if( amt==1 ){ p->tos++; if( NeedStack(p, p->tos) ) goto no_mem; p->aStack[p->tos].i = val; p->aStack[p->tos].flags = STK_Int; p->zStack[p->tos] = 0; ................................................................................ /* Opcode: ListClose P1 * * ** ** Close the temporary storage buffer and discard its contents. */ case OP_ListClose: { int i = pOp->p1; if( i<0 ) goto bad_instruction; if( i<p->nList && p->apList[i]!=0 ){ pBe->CloseTempFile(pBe, p->apList[i]); p->apList[i] = 0; } break; } /* Opcode: SortOpen P1 * * ** ** Create a new sorter with index P1 */ case OP_SortOpen: { int i = pOp->p1; if( i<0 ) goto bad_instruction; if( i>=p->nSort ){ int j; p->apSort = sqliteRealloc( p->apSort, (i+1)*sizeof(Sorter*) ); if( p->apSort==0 ){ p->nSort = 0; goto no_mem; } for(j=p->nSort; j<=i; j++) p->apSort[j] = 0; p->nSort = i+1; } ................................................................................ ** and put them on the sorter. */ case OP_SortPut: { int i = pOp->p1; int tos = p->tos; int nos = tos - 1; Sorter *pSorter; if( i<0 || i>=p->nSort ) goto bad_instruction; if( tos<1 ) goto not_enough_stack; if( Stringify(p, tos) || Stringify(p, nos) ) goto no_mem; pSorter = sqliteMalloc( sizeof(Sorter) ); if( pSorter==0 ) goto no_mem; pSorter->pNext = p->apSort[i]; p->apSort[i] = pSorter; pSorter->nKey = p->aStack[tos].n; pSorter->zKey = p->zStack[tos]; ................................................................................ char *z; char **azArg; int nByte; int nField; int i, j; nField = pOp->p1; if( p->tos+1<nField ) goto not_enough_stack; nByte = 0; for(i=p->tos-nField+1; i<=p->tos; i++){ if( (p->aStack[i].flags & STK_Null)==0 ){ if( Stringify(p, i) ) goto no_mem; nByte += p->aStack[i].n; } } ................................................................................ }else{ azArg[j] = z; strcpy(z, p->zStack[i]); z += p->aStack[i].n; } } PopStack(p, nField); NeedStack(p, p->tos+1); p->tos++; p->aStack[p->tos].n = nByte; p->zStack[p->tos] = (char*)azArg; p->aStack[p->tos].flags = STK_Str|STK_Dyn; break; } ................................................................................ case OP_SortMakeKey: { char *zNewKey; int nByte; int nField; int i, j, k; nField = strlen(pOp->p3); if( p->tos+1<nField ) goto not_enough_stack; nByte = 1; for(i=p->tos-nField+1; i<=p->tos; i++){ if( Stringify(p, i) ) goto no_mem; nByte += p->aStack[i].n+2; } zNewKey = sqliteMalloc( nByte ); if( zNewKey==0 ) goto no_mem; ................................................................................ zNewKey[j++] = pOp->p3[k++]; memcpy(&zNewKey[j], p->zStack[i], p->aStack[i].n-1); j += p->aStack[i].n-1; zNewKey[j++] = 0; } zNewKey[j] = 0; PopStack(p, nField); NeedStack(p, p->tos+1); p->tos++; p->aStack[p->tos].n = nByte; p->aStack[p->tos].flags = STK_Str|STK_Dyn; p->zStack[p->tos] = zNewKey; break; } ................................................................................ ** ** Sort all elements on the given sorter. The algorithm is a ** mergesort. */ case OP_Sort: { int j; j = pOp->p1; if( j<0 ) goto bad_instruction; if( j<p->nSort ){ int i; Sorter *pElem; Sorter *apSorter[NSORT]; for(i=0; i<NSORT; i++){ apSorter[i] = 0; } ................................................................................ /* Opcode: SortNext P1 P2 * ** ** Push the data for the topmost element in the given sorter onto the ** stack, then remove the element from the sorter. */ case OP_SortNext: { int i = pOp->p1; if( i<0 ) goto bad_instruction; if( i<p->nSort && p->apSort[i]!=0 ){ Sorter *pSorter = p->apSort[i]; p->apSort[i] = pSorter->pNext; p->tos++; NeedStack(p, p->tos); p->zStack[p->tos] = pSorter->pData; p->aStack[p->tos].n = pSorter->nData; p->aStack[p->tos].flags = STK_Str|STK_Dyn; sqliteFree(pSorter->zKey); sqliteFree(pSorter); }else{ pc = pOp->p2 - 1; ................................................................................ /* Opcode: SortKey P1 * * ** ** Push the key for the topmost element of the sorter onto the stack. ** But don't change the sorter an any other way. */ case OP_SortKey: { int i = pOp->p1; if( i<0 ) goto bad_instruction; if( i<p->nSort && p->apSort[i]!=0 ){ Sorter *pSorter = p->apSort[i]; p->tos++; NeedStack(p, p->tos); sqliteSetString(&p->zStack[p->tos], pSorter->zKey, 0); p->aStack[p->tos].n = pSorter->nKey; p->aStack[p->tos].flags = STK_Str|STK_Dyn; } break; } ................................................................................ ** The top of the stack contains a callback record built using ** the SortMakeRec operation with the same P1 value as this ** instruction. Pop this record from the stack and invoke the ** callback on it. */ case OP_SortCallback: { int i = p->tos; if( i<0 ) goto not_enough_stack; if( xCallback!=0 ){ if( xCallback(pArg, pOp->p1, (char**)p->zStack[i], p->azColName) ){ rc = SQLITE_ABORT; } } PopStack(p, 1); break; ................................................................................ /* Opcode: SortClose P1 * * ** ** Close the given sorter and remove all its elements. */ case OP_SortClose: { Sorter *pSorter; int i = pOp->p1; if( i<0 ) goto bad_instruction; if( i<p->nSort ){ while( (pSorter = p->apSort[i])!=0 ){ p->apSort[i] = pSorter->pNext; sqliteFree(pSorter->zKey); sqliteFree(pSorter->pData); sqliteFree(pSorter); } ................................................................................ /* Opcode: FileOpen * * P3 ** ** Open the file named by P3 for reading using the FileRead opcode. ** If P3 is "stdin" then open standard input for reading. */ case OP_FileOpen: { if( pOp->p3==0 ) goto bad_instruction; if( p->pFile ){ if( p->pFile!=stdin ) fclose(p->pFile); p->pFile = 0; } if( sqliteStrICmp(pOp->p3,"stdin")==0 ){ p->pFile = stdin; }else{ ................................................................................ ** ** Push onto the stack the P1-th field of the most recently read line ** from the input file. */ case OP_FileField: { int i = pOp->p1; char *z; if( NeedStack(p, p->tos+1) ) goto no_mem; if( i>=0 && i<p->nField && p->azField ){ z = p->azField[i]; }else{ z = 0; } if( z==0 ) z = ""; p->tos++; p->aStack[p->tos].n = strlen(z) + 1; ................................................................................ ** for all memory locations between 0 and P1 inclusive. */ case OP_MemStore: { int i = pOp->p1; int tos = p->tos; Mem *pMem; char *zOld; if( tos<0 ) goto not_enough_stack; if( i>=p->nMem ){ int nOld = p->nMem; p->nMem = i + 5; p->aMem = sqliteRealloc(p->aMem, p->nMem*sizeof(p->aMem[0])); if( p->aMem==0 ) goto no_mem; if( nOld<p->nMem ){ memset(&p->aMem[nOld], 0, sizeof(p->aMem[0])*(p->nMem-nOld)); ................................................................................ /* Opcode: MemLoad P1 * * ** ** Push a copy of the value in memory location P1 onto the stack. */ case OP_MemLoad: { int tos = ++p->tos; int i = pOp->p1; if( NeedStack(p, tos) ) goto no_mem; if( i<0 || i>=p->nMem ){ p->aStack[tos].flags = STK_Null; p->zStack[tos] = 0; }else{ p->aStack[tos] = p->aMem[i].s; if( p->aStack[tos].flags & STK_Str ){ char *z = sqliteMalloc(p->aStack[tos].n); ................................................................................ */ case OP_AggFocus: { int tos = p->tos; AggElem *pElem; char *zKey; int nKey; if( tos<0 ) goto not_enough_stack; Stringify(p, tos); zKey = p->zStack[tos]; nKey = p->aStack[tos].n; if( p->agg.nHash<=0 ){ pElem = 0; }else{ int h = sqliteHashNoCase(zKey, nKey-1) % p->agg.nHash; ................................................................................ ** Move the top of the stack into the P2-th field of the current ** aggregate. String values are duplicated into new memory. */ case OP_AggSet: { AggElem *pFocus = AggInFocus(p->agg); int i = pOp->p2; int tos = p->tos; if( tos<0 ) goto not_enough_stack; if( pFocus==0 ) goto no_mem; if( i>=0 && i<p->agg.nMem ){ Mem *pMem = &pFocus->aMem[i]; char *zOld; if( pMem->s.flags & STK_Dyn ){ zOld = pMem->z; }else{ zOld = 0; } ................................................................................ ** of the current aggregate. Strings are not duplicated so ** string values will be ephemeral. */ case OP_AggGet: { AggElem *pFocus = AggInFocus(p->agg); int i = pOp->p2; int tos = ++p->tos; if( NeedStack(p, tos) ) goto no_mem; if( pFocus==0 ) goto no_mem; if( i>=0 && i<p->agg.nMem ){ Mem *pMem = &pFocus->aMem[i]; p->aStack[tos] = pMem->s; p->zStack[tos] = pMem->z; p->aStack[tos].flags &= ~STK_Dyn; } break; } ................................................................................ ** Pop the stack once and compare the value popped off with the ** contents of set P1. If the element popped exists in set P1, ** then jump to P2. Otherwise fall through. */ case OP_SetFound: { int i = pOp->p1; int tos = p->tos; if( tos<0 ) goto not_enough_stack; Stringify(p, tos); if( i>=0 && i<p->nSet && SetTest(&p->aSet[i], p->zStack[tos]) ){ pc = pOp->p2 - 1; } PopStack(p, 1); break; } /* Opcode: SetNotFound P1 P2 * ................................................................................ ** Pop the stack once and compare the value popped off with the ** contents of set P1. If the element popped does not exists in ** set P1, then jump to P2. Otherwise fall through. */ case OP_SetNotFound: { int i = pOp->p1; int tos = p->tos; if( tos<0 ) goto not_enough_stack; Stringify(p, tos); if( i>=0 && i<p->nSet && !SetTest(&p->aSet[i], p->zStack[tos]) ){ pc = pOp->p2 - 1; } PopStack(p, 1); break; } /* Opcode: Length * * * ................................................................................ ** ** Interpret the top of the stack as a string. Replace the top of ** stack with an integer which is the length of the string. */ case OP_Strlen: { int tos = p->tos; int len; if( tos<0 ) goto not_enough_stack; Stringify(p, tos); len = p->aStack[tos].n-1; PopStack(p, 1); p->tos++; p->aStack[tos].i = len; p->aStack[tos].flags = STK_Int; break; ................................................................................ case OP_Substr: { int cnt; int start; int n; char *z; if( pOp->p2==0 ){ if( p->tos<0 ) goto not_enough_stack; Integerify(p, p->tos); cnt = p->aStack[p->tos].i; PopStack(p, 1); }else{ cnt = pOp->p2; } if( pOp->p1==0 ){ if( p->tos<0 ) goto not_enough_stack; Integerify(p, p->tos); start = p->aStack[p->tos].i - 1; PopStack(p, 1); }else{ start = pOp->p1 - 1; } if( p->tos<0 ) goto not_enough_stack; Stringify(p, p->tos); n = p->aStack[p->tos].n - 1; if( start<0 ){ start += n + 1; if( start<0 ){ cnt += start; start = 0; |
| > > > > > > > > > > > > > > > > > > > > > > | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 ... 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 ... 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 .... 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 .... 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 .... 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 .... 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 .... 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 .... 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 .... 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 .... 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 .... 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 .... 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 .... 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 .... 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 .... 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 .... 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 .... 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 .... 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 .... 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 .... 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 .... 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 .... 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 .... 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 .... 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 .... 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 .... 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 .... 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 .... 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 .... 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 .... 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 .... 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 .... 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 .... 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 .... 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 .... 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 .... 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 .... 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 .... 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 .... 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 .... 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 .... 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 .... 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 .... 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 .... 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 .... 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 .... 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 .... 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 .... 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 .... 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 .... 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 .... 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 .... 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 .... 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 .... 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 .... 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 .... 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 .... 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 .... 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 .... 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 .... 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 .... 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 .... 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 .... 3159 3160 3161 3162 3163 3164 3165 3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 .... 3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 3187 3188 3189 3190 3191 3192 3193 .... 3194 3195 3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 .... 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256 3257 3258 3259 |
** inplicit conversion from one type to the other occurs as necessary. ** ** Most of the code in this file is taken up by the sqliteVdbeExec() ** function which does the work of interpreting a VDBE program. ** But other routines are also provided to help in building up ** a program instruction by instruction. ** ** $Id: vdbe.c,v 1.46 2000/10/23 01:08:00 drh Exp $ */ #include "sqliteInt.h" #include <unistd.h> #include <ctype.h> /* ** SQL is translated into a sequence of instructions to be ................................................................................ pTail->pNext = pLeft; }else if( pRight ){ pTail->pNext = pRight; } return sHead.pNext; } /* ** Code contained within the VERIFY() macro is not needed for correct ** execution. It is there only to catch errors. So when we compile ** with NDEBUG=1, the VERIFY() code is omitted. */ #ifdef NDEBUG # define VERIFY(X) #else # define VERIFY(X) X #endif /* ** Execute the program in the VDBE. ** ** If an error occurs, an error message is written to memory obtained ** from sqliteMalloc() and *pzErrMsg is made to point to that memory. ** The return parameter is the number of errors. ** ................................................................................ void *pBusyArg, /* 1st argument to the busy callback */ int (*xBusy)(void*,const char*,int) /* Called when a file is busy */ ){ int pc; /* The program counter */ Op *pOp; /* Current operation */ int rc; /* Value to return */ Dbbe *pBe = p->pBe; /* The backend driver */ sqlite *db = p->db; /* The database */ char zBuf[100]; /* Space to sprintf() and integer */ /* No instruction ever pushes more than a single element onto the ** stack. And the stack never grows on successive executions of the ** same loop. So the total number of instructions is an upper bound ** on the maximum stack depth required. ** ** Allocation all the stack space we will ever need. */ NeedStack(p, p->nOp); p->tos = -1; rc = SQLITE_OK; #ifdef MEMORY_DEBUG if( access("vdbe_trace",0)==0 ){ p->trace = stderr; } #endif /* if( pzErrMsg ){ *pzErrMsg = 0; } */ for(pc=0; rc==SQLITE_OK && pc<p->nOp VERIFY(&& pc>=0); pc++){ pOp = &p->aOp[pc]; /* Interrupt processing if requested. */ if( db->flags & SQLITE_Interrupt ){ db->flags &= ~SQLITE_Interrupt; rc = SQLITE_INTERRUPT; sqliteSetString(pzErrMsg, "interrupted", 0); break; } /* Only allow tracing if NDEBUG is not defined. */ ................................................................................ /* Opcode: Integer P1 * * ** ** The integer value P1 is pushed onto the stack. */ case OP_Integer: { int i = ++p->tos; VERIFY( if( NeedStack(p, p->tos) ) goto no_mem; ) p->aStack[i].i = pOp->p1; p->aStack[i].flags = STK_Int; break; } /* Opcode: String * * P3 ** ** The string value P3 is pushed onto the stack. */ case OP_String: { int i = ++p->tos; char *z; VERIFY( if( NeedStack(p, p->tos) ) goto no_mem; ) z = pOp->p3; if( z==0 ) z = ""; p->zStack[i] = z; p->aStack[i].n = strlen(z) + 1; p->aStack[i].flags = STK_Str; break; } ................................................................................ /* Opcode: Null * * * ** ** Push a NULL value onto the stack. */ case OP_Null: { int i = ++p->tos; VERIFY( if( NeedStack(p, p->tos) ) goto no_mem; ) p->zStack[i] = 0; p->aStack[i].flags = STK_Null; break; } /* Opcode: Pop P1 * * ** ................................................................................ ** The top of the stack is element 0. So the ** instruction "Dup 0 0 0" will make a copy of the ** top of the stack. */ case OP_Dup: { int i = p->tos - pOp->p1; int j = ++p->tos; VERIFY( if( i<0 ) goto not_enough_stack; ) VERIFY( if( NeedStack(p, p->tos) ) goto no_mem; ) p->aStack[j] = p->aStack[i]; if( p->aStack[i].flags & STK_Dyn ){ p->zStack[j] = sqliteMalloc( p->aStack[j].n ); if( p->zStack[j]==0 ) goto no_mem; memcpy(p->zStack[j], p->zStack[i], p->aStack[j].n); }else{ p->zStack[j] = p->zStack[i]; ................................................................................ */ case OP_Pull: { int from = p->tos - pOp->p1; int to = p->tos; int i; Stack ts; char *tz; VERIFY( if( from<0 ) goto not_enough_stack; ) ts = p->aStack[from]; tz = p->zStack[from]; for(i=from; i<to; i++){ p->aStack[i] = p->aStack[i+1]; p->zStack[i] = p->zStack[i+1]; } p->aStack[to] = ts; ................................................................................ ** Pop P1 values off the stack and form them into an array. Then ** invoke the callback function using the newly formed array as the ** 3rd parameter. */ case OP_Callback: { int i = p->tos - pOp->p1 + 1; int j; VERIFY( if( i<0 ) goto not_enough_stack; ) VERIFY( if( NeedStack(p, p->tos+2) ) goto no_mem; ) for(j=i; j<=p->tos; j++){ if( (p->aStack[j].flags & STK_Null)==0 ){ if( Stringify(p, j) ) goto no_mem; } } p->zStack[p->tos+1] = 0; if( xCallback!=0 ){ ................................................................................ char *zSep; int nSep; nField = pOp->p1; zSep = pOp->p3; if( zSep==0 ) zSep = ""; nSep = strlen(zSep); VERIFY( if( p->tos+1<nField ) goto not_enough_stack; ) nByte = 1 - nSep; for(i=p->tos-nField+1; i<=p->tos; i++){ if( p->aStack[i].flags & STK_Null ){ nByte += nSep; }else{ if( Stringify(p, i) ) goto no_mem; nByte += p->aStack[i].n - 1 + nSep; ................................................................................ if( nSep>0 && i<p->tos ){ memcpy(&zNew[j], zSep, nSep); j += nSep; } } zNew[j] = 0; if( pOp->p2==0 ) PopStack(p, nField); VERIFY( NeedStack(p, p->tos+1); ) p->tos++; p->aStack[p->tos].n = nByte; p->aStack[p->tos].flags = STK_Str|STK_Dyn; p->zStack[p->tos] = zNew; break; } ................................................................................ */ case OP_Add: case OP_Subtract: case OP_Multiply: case OP_Divide: { int tos = p->tos; int nos = tos - 1; VERIFY( if( nos<0 ) goto not_enough_stack; ) if( (p->aStack[tos].flags & p->aStack[nos].flags & STK_Int)==STK_Int ){ int a, b; a = p->aStack[tos].i; b = p->aStack[nos].i; switch( pOp->opcode ){ case OP_Add: b += a; break; case OP_Subtract: b -= a; break; ................................................................................ ** largest of the two. */ case OP_Max: { int tos = p->tos; int nos = tos - 1; int ft, fn; int copy = 0; VERIFY( if( nos<0 ) goto not_enough_stack; ) ft = p->aStack[tos].flags; fn = p->aStack[nos].flags; if( fn & STK_Null ){ copy = 1; }else if( (ft & fn & STK_Int)==STK_Int ){ copy = p->aStack[nos].i<p->aStack[tos].i; }else if( ( (ft|fn) & (STK_Int|STK_Real) ) !=0 ){ ................................................................................ ** smaller of the two. */ case OP_Min: { int tos = p->tos; int nos = tos - 1; int ft, fn; int copy = 0; VERIFY( if( nos<0 ) goto not_enough_stack; ) ft = p->aStack[tos].flags; fn = p->aStack[nos].flags; if( fn & STK_Null ){ copy = 1; }else if( ft & STK_Null ){ copy = 0; }else if( (ft & fn & STK_Int)==STK_Int ){ ................................................................................ /* Opcode: AddImm P1 * * ** ** Add the value P1 to whatever is on top of the stack. */ case OP_AddImm: { int tos = p->tos; VERIFY( if( tos<0 ) goto not_enough_stack; ) Integerify(p, tos); p->aStack[tos].i += pOp->p1; break; } /* Opcode: Eq * P2 * ** ................................................................................ case OP_Le: case OP_Gt: case OP_Ge: { int tos = p->tos; int nos = tos - 1; int c; int ft, fn; VERIFY( if( nos<0 ) goto not_enough_stack; ) ft = p->aStack[tos].flags; fn = p->aStack[nos].flags; if( (ft & fn)==STK_Int ){ c = p->aStack[nos].i - p->aStack[tos].i; }else{ Stringify(p, tos); Stringify(p, nos); ................................................................................ ** have a "NOT LIKE" operator. The jump is made if the two values ** are different. */ case OP_Like: { int tos = p->tos; int nos = tos - 1; int c; VERIFY( if( nos<0 ) goto not_enough_stack; ) Stringify(p, tos); Stringify(p, nos); c = sqliteLikeCompare(p->zStack[tos], p->zStack[nos]); PopStack(p, 2); if( pOp->p1 ) c = !c; if( c ) pc = pOp->p2-1; break; ................................................................................ ** have a "NOT GLOB" operator. The jump is made if the two values ** are different. */ case OP_Glob: { int tos = p->tos; int nos = tos - 1; int c; VERIFY( if( nos<0 ) goto not_enough_stack; ) Stringify(p, tos); Stringify(p, nos); c = sqliteGlobCompare(p->zStack[tos], p->zStack[nos]); PopStack(p, 2); if( pOp->p1 ) c = !c; if( c ) pc = pOp->p2-1; break; ................................................................................ ** stack. */ case OP_And: case OP_Or: { int tos = p->tos; int nos = tos - 1; int c; VERIFY( if( nos<0 ) goto not_enough_stack; ) Integerify(p, tos); Integerify(p, nos); if( pOp->opcode==OP_And ){ c = p->aStack[tos].i && p->aStack[nos].i; }else{ c = p->aStack[tos].i || p->aStack[nos].i; } ................................................................................ /* Opcode: Negative * * * ** ** Treat the top of the stack as a numeric quantity. Replace it ** with its additive inverse. */ case OP_Negative: { int tos = p->tos; VERIFY( if( tos<0 ) goto not_enough_stack; ) if( p->aStack[tos].flags & STK_Real ){ Release(p, tos); p->aStack[tos].r = -p->aStack[tos].r; p->aStack[tos].flags = STK_Real; }else if( p->aStack[tos].flags & STK_Int ){ Release(p, tos); p->aStack[tos].i = -p->aStack[tos].i; ................................................................................ /* Opcode: Not * * * ** ** Interpret the top of the stack as a boolean value. Replace it ** with its complement. */ case OP_Not: { int tos = p->tos; VERIFY( if( p->tos<0 ) goto not_enough_stack; ) Integerify(p, tos); Release(p, tos); p->aStack[tos].i = !p->aStack[tos].i; p->aStack[tos].flags = STK_Int; break; } ................................................................................ ** Pop a single boolean from the stack. If the boolean popped is ** true, then jump to p2. Otherwise continue to the next instruction. ** An integer is false if zero and true otherwise. A string is ** false if it has zero length and true otherwise. */ case OP_If: { int c; VERIFY( if( p->tos<0 ) goto not_enough_stack; ) Integerify(p, p->tos); c = p->aStack[p->tos].i; PopStack(p, 1); if( c ) pc = pOp->p2-1; break; } ................................................................................ ** ** Pop a single value from the stack. If the value popped is NULL ** then jump to p2. Otherwise continue to the next ** instruction. */ case OP_IsNull: { int c; VERIFY( if( p->tos<0 ) goto not_enough_stack; ) c = (p->aStack[p->tos].flags & STK_Null)!=0; PopStack(p, 1); if( c ) pc = pOp->p2-1; break; } /* Opcode: NotNull * P2 * ................................................................................ ** ** Pop a single value from the stack. If the value popped is not an ** empty string, then jump to p2. Otherwise continue to the next ** instruction. */ case OP_NotNull: { int c; VERIFY( if( p->tos<0 ) goto not_enough_stack; ) c = (p->aStack[p->tos].flags & STK_Null)==0; PopStack(p, 1); if( c ) pc = pOp->p2-1; break; } /* Opcode: MakeRecord P1 * * ................................................................................ char *zNewRecord; int nByte; int nField; int i, j; int addr; nField = pOp->p1; VERIFY( if( p->tos+1<nField ) goto not_enough_stack; ) nByte = 0; for(i=p->tos-nField+1; i<=p->tos; i++){ if( (p->aStack[i].flags & STK_Null)==0 ){ if( Stringify(p, i) ) goto no_mem; nByte += p->aStack[i].n; } } ................................................................................ for(i=p->tos-nField+1; i<=p->tos; i++){ if( (p->aStack[i].flags & STK_Null)==0 ){ memcpy(&zNewRecord[j], p->zStack[i], p->aStack[i].n); j += p->aStack[i].n; } } PopStack(p, nField); VERIFY( NeedStack(p, p->tos+1); ) p->tos++; p->aStack[p->tos].n = nByte; p->aStack[p->tos].flags = STK_Str | STK_Dyn; p->zStack[p->tos] = zNewRecord; break; } ................................................................................ case OP_MakeKey: { char *zNewKey; int nByte; int nField; int i, j; nField = pOp->p1; VERIFY( if( p->tos+1<nField ) goto not_enough_stack; ) nByte = 0; for(i=p->tos-nField+1; i<=p->tos; i++){ if( p->aStack[i].flags & STK_Null ){ nByte++; }else{ if( Stringify(p, i) ) goto no_mem; nByte += p->aStack[i].n; ................................................................................ memcpy(&zNewKey[j], p->zStack[i], p->aStack[i].n-1); j += p->aStack[i].n-1; } if( i<p->tos ) zNewKey[j++] = '\t'; } zNewKey[j] = 0; if( pOp->p2==0 ) PopStack(p, nField); VERIFY( NeedStack(p, p->tos+1); ) p->tos++; p->aStack[p->tos].n = nByte; p->aStack[p->tos].flags = STK_Str|STK_Dyn; p->zStack[p->tos] = zNewKey; break; } ................................................................................ ** If P3 is null or an empty string, a temporary database file ** is created. This temporary database file is automatically ** deleted when the cursor is closed. */ case OP_Open: { int busy = 0; int i = pOp->p1; VERIFY( if( i<0 ) goto bad_instruction; ) if( i>=p->nCursor ){ int j; p->aCsr = sqliteRealloc( p->aCsr, (i+1)*sizeof(Cursor) ); if( p->aCsr==0 ){ p->nCursor = 0; goto no_mem; } for(j=p->nCursor; j<=i; j++) p->aCsr[j].pCursor = 0; p->nCursor = i+1; }else if( p->aCsr[i].pCursor ){ ................................................................................ ** Pop the top of the stack and use its value as a key to fetch ** a record from cursor P1. The key/data pair is held ** in the P1 cursor until needed. */ case OP_Fetch: { int i = pOp->p1; int tos = p->tos; VERIFY( if( tos<0 ) goto not_enough_stack; ) if( i>=0 && i<p->nCursor && p->aCsr[i].pCursor ){ if( p->aStack[tos].flags & STK_Int ){ pBe->Fetch(p->aCsr[i].pCursor, sizeof(int), (char*)&p->aStack[tos].i); }else{ if( Stringify(p, tos) ) goto no_mem; pBe->Fetch(p->aCsr[i].pCursor, p->aStack[tos].n, ................................................................................ ** ** This instruction is used to implement the special fcnt() function ** in the SQL dialect that SQLite understands. fcnt() is used for ** testing purposes. */ case OP_Fcnt: { int i = ++p->tos; VERIFY( if( NeedStack(p, p->tos) ) goto no_mem; ) p->aStack[i].i = p->nFetch; p->aStack[i].flags = STK_Int; break; } /* Opcode: Distinct P1 P2 * ** ................................................................................ */ case OP_Distinct: case OP_NotFound: case OP_Found: { int i = pOp->p1; int tos = p->tos; int alreadyExists = 0; VERIFY( if( tos<0 ) goto not_enough_stack; ) if( VERIFY( i>=0 && i<p->nCursor && ) p->aCsr[i].pCursor ){ if( p->aStack[tos].flags & STK_Int ){ alreadyExists = pBe->Test(p->aCsr[i].pCursor, sizeof(int), (char*)&p->aStack[tos].i); }else{ if( Stringify(p, tos) ) goto no_mem; alreadyExists = pBe->Test(p->aCsr[i].pCursor,p->aStack[tos].n, p->zStack[tos]); ................................................................................ ** ** Get a new integer key not previous used by the database file ** associated with cursor P1 and push it onto the stack. */ case OP_New: { int i = pOp->p1; int v; if( VERIFY( i<0 || i>=p->nCursor || ) p->aCsr[i].pCursor==0 ){ v = 0; }else{ v = pBe->New(p->aCsr[i].pCursor); } VERIFY( NeedStack(p, p->tos+1); ) p->tos++; p->aStack[p->tos].i = v; p->aStack[p->tos].flags = STK_Int; break; } /* Opcode: Put P1 * * ................................................................................ ** stack. The key is the next value down on the stack. The stack ** is popped twice by this instruction. */ case OP_Put: { int tos = p->tos; int nos = p->tos-1; int i = pOp->p1; VERIFY( if( nos<0 ) goto not_enough_stack; ) if( VERIFY( i>=0 && i<p->nCursor && ) p->aCsr[i].pCursor!=0 ){ char *zKey; int nKey; if( (p->aStack[nos].flags & STK_Int)==0 ){ if( Stringify(p, nos) ) goto no_mem; nKey = p->aStack[nos].n; zKey = p->zStack[nos]; }else{ ................................................................................ ** ** The top of the stack is a key. Remove this key and its data ** from database file P1. Then pop the stack to discard the key. */ case OP_Delete: { int tos = p->tos; int i = pOp->p1; VERIFY( if( tos<0 ) goto not_enough_stack; ) if( VERIFY( i>=0 && i<p->nCursor && ) p->aCsr[i].pCursor!=0 ){ char *zKey; int nKey; if( p->aStack[tos].flags & STK_Int ){ nKey = sizeof(int); zKey = (char*)&p->aStack[tos].i; }else{ if( Stringify(p, tos) ) goto no_mem; ................................................................................ ** Turn the key-as-data mode for cursor P1 either on (if P2==1) or ** off (if P2==0). In key-as-data mode, the OP_Field opcode pulls ** data off of the key rather than the data. This is useful for ** processing compound selects. */ case OP_KeyAsData: { int i = pOp->p1; if( VERIFY( i>=0 && i<p->nCursor && ) p->aCsr[i].pCursor!=0 ){ p->aCsr[i].keyAsData = pOp->p2; } break; } /* Opcode: Field P1 P2 * ** ................................................................................ int amt; int i = pOp->p1; int p2 = pOp->p2; int tos = ++p->tos; DbbeCursor *pCrsr; char *z; VERIFY( if( NeedStack(p, tos) ) goto no_mem; ) if( VERIFY( i>=0 && i<p->nCursor && ) (pCrsr = p->aCsr[i].pCursor)!=0 ){ if( p->aCsr[i].keyAsData ){ amt = pBe->KeyLength(pCrsr); if( amt<=sizeof(int)*(p2+1) ){ p->aStack[tos].flags = STK_Null; break; } pAddr = (int*)pBe->ReadKey(pCrsr, sizeof(int)*p2); ................................................................................ ** Next opcode. */ case OP_Key: { int i = pOp->p1; int tos = ++p->tos; DbbeCursor *pCrsr; VERIFY( if( NeedStack(p, p->tos) ) goto no_mem; ) if( VERIFY( i>=0 && i<p->nCursor && ) (pCrsr = p->aCsr[i].pCursor)!=0 ){ char *z = pBe->ReadKey(pCrsr, 0); if( p->aCsr[i].keyAsData ){ p->zStack[tos] = z; p->aStack[tos].flags = STK_Str; p->aStack[tos].n = pBe->KeyLength(pCrsr); }else{ memcpy(&p->aStack[tos].i, z, sizeof(int)); ................................................................................ /* Opcode: Rewind P1 * * ** ** The next use of the Key or Field or Next instruction for P1 ** will refer to the first entry in the database file. */ case OP_Rewind: { int i = pOp->p1; if( VERIFY( i>=0 && i<p->nCursor && ) p->aCsr[i].pCursor!=0 ){ pBe->Rewind(p->aCsr[i].pCursor); } break; } /* Opcode: Next P1 P2 * ** ** Advance P1 to the next key/data pair in the file. Or, if there are no ** more key/data pairs, rewind P1 and jump to location P2. */ case OP_Next: { int i = pOp->p1; if( VERIFY( i>=0 && i<p->nCursor && ) p->aCsr[i].pCursor!=0 ){ if( pBe->NextKey(p->aCsr[i].pCursor)==0 ){ pc = pOp->p2 - 1; }else{ p->nFetch++; } } break; ................................................................................ ** there is an immediate jump to instruction P2. */ case OP_NextIdx: { int i = pOp->p1; int tos = ++p->tos; DbbeCursor *pCrsr; VERIFY( if( NeedStack(p, p->tos) ) goto no_mem; ) p->zStack[tos] = 0; if( VERIFY( i>=0 && i<p->nCursor && ) (pCrsr = p->aCsr[i].pCursor)!=0 ){ int *aIdx; int nIdx; int j, k; nIdx = pBe->DataLength(pCrsr)/sizeof(int); aIdx = (int*)pBe->ReadData(pCrsr, 0); if( nIdx>1 ){ k = *(aIdx++); ................................................................................ ** record and write it back to the P1 file. */ case OP_PutIdx: { int i = pOp->p1; int tos = p->tos; int nos = tos - 1; DbbeCursor *pCrsr; VERIFY( if( nos<0 ) goto not_enough_stack; ) if( VERIFY( i>=0 && i<p->nCursor && ) (pCrsr = p->aCsr[i].pCursor)!=0 ){ int r; int newVal; Integerify(p, nos); newVal = p->aStack[nos].i; if( Stringify(p, tos) ) goto no_mem; r = pBe->Fetch(pCrsr, p->aStack[tos].n, p->zStack[tos]); if( r==0 ){ ................................................................................ ** the P1 data, then the corresponding P1 record is deleted. */ case OP_DeleteIdx: { int i = pOp->p1; int tos = p->tos; int nos = tos - 1; DbbeCursor *pCrsr; VERIFY( if( nos<0 ) goto not_enough_stack; ) if( VERIFY( i>=0 && i<p->nCursor && ) (pCrsr = p->aCsr[i].pCursor)!=0 ){ int *aIdx; int nIdx; int j, k; int r; int oldVal; Integerify(p, nos); oldVal = p->aStack[nos].i; ................................................................................ ** will server as a handle to this temporary file for future ** interactions. If another temporary file with the P1 handle is ** already opened, the prior file is closed and a new one opened ** in its place. */ case OP_ListOpen: { int i = pOp->p1; VERIFY( if( i<0 ) goto bad_instruction; ) if( i>=p->nList ){ int j; p->apList = sqliteRealloc( p->apList, (i+1)*sizeof(FILE*) ); if( p->apList==0 ){ p->nList = 0; goto no_mem; } for(j=p->nList; j<=i; j++) p->apList[j] = 0; p->nList = i+1; }else if( p->apList[i] ){ ................................................................................ /* Opcode: ListWrite P1 * * ** ** Write the integer on the top of the stack ** into the temporary storage file P1. */ case OP_ListWrite: { int i = pOp->p1; VERIFY( if( i<0 ) goto bad_instruction; ) VERIFY( if( p->tos<0 ) goto not_enough_stack; ) if( VERIFY( i<p->nList && ) p->apList[i]!=0 ){ int val; Integerify(p, p->tos); val = p->aStack[p->tos].i; PopStack(p, 1); fwrite(&val, sizeof(int), 1, p->apList[i]); } break; ................................................................................ /* Opcode: ListRewind P1 * * ** ** Rewind the temporary buffer P1 back to the beginning. */ case OP_ListRewind: { int i = pOp->p1; VERIFY( if( i<0 ) goto bad_instruction; ) if( VERIFY( i<p->nList && ) p->apList[i]!=0 ){ rewind(p->apList[i]); } break; } /* Opcode: ListRead P1 P2 * ** ................................................................................ ** Attempt to read an integer from temporary storage buffer P1 ** and push it onto the stack. If the storage buffer is empty, ** push nothing but instead jump to P2. */ case OP_ListRead: { int i = pOp->p1; int val, amt; VERIFY(if( i<0 || i>=p->nList || p->apList[i]==0 )goto bad_instruction;) amt = fread(&val, sizeof(int), 1, p->apList[i]); if( amt==1 ){ p->tos++; if( NeedStack(p, p->tos) ) goto no_mem; p->aStack[p->tos].i = val; p->aStack[p->tos].flags = STK_Int; p->zStack[p->tos] = 0; ................................................................................ /* Opcode: ListClose P1 * * ** ** Close the temporary storage buffer and discard its contents. */ case OP_ListClose: { int i = pOp->p1; VERIFY( if( i<0 ) goto bad_instruction; ) if( VERIFY( i<p->nList && ) p->apList[i]!=0 ){ pBe->CloseTempFile(pBe, p->apList[i]); p->apList[i] = 0; } break; } /* Opcode: SortOpen P1 * * ** ** Create a new sorter with index P1 */ case OP_SortOpen: { int i = pOp->p1; VERIFY( if( i<0 ) goto bad_instruction; ) if( i>=p->nSort ){ int j; p->apSort = sqliteRealloc( p->apSort, (i+1)*sizeof(Sorter*) ); if( p->apSort==0 ){ p->nSort = 0; goto no_mem; } for(j=p->nSort; j<=i; j++) p->apSort[j] = 0; p->nSort = i+1; } ................................................................................ ** and put them on the sorter. */ case OP_SortPut: { int i = pOp->p1; int tos = p->tos; int nos = tos - 1; Sorter *pSorter; VERIFY( if( i<0 || i>=p->nSort ) goto bad_instruction; ) VERIFY( if( tos<1 ) goto not_enough_stack; ) if( Stringify(p, tos) || Stringify(p, nos) ) goto no_mem; pSorter = sqliteMalloc( sizeof(Sorter) ); if( pSorter==0 ) goto no_mem; pSorter->pNext = p->apSort[i]; p->apSort[i] = pSorter; pSorter->nKey = p->aStack[tos].n; pSorter->zKey = p->zStack[tos]; ................................................................................ char *z; char **azArg; int nByte; int nField; int i, j; nField = pOp->p1; VERIFY( if( p->tos+1<nField ) goto not_enough_stack; ) nByte = 0; for(i=p->tos-nField+1; i<=p->tos; i++){ if( (p->aStack[i].flags & STK_Null)==0 ){ if( Stringify(p, i) ) goto no_mem; nByte += p->aStack[i].n; } } ................................................................................ }else{ azArg[j] = z; strcpy(z, p->zStack[i]); z += p->aStack[i].n; } } PopStack(p, nField); VERIFY( NeedStack(p, p->tos+1); ) p->tos++; p->aStack[p->tos].n = nByte; p->zStack[p->tos] = (char*)azArg; p->aStack[p->tos].flags = STK_Str|STK_Dyn; break; } ................................................................................ case OP_SortMakeKey: { char *zNewKey; int nByte; int nField; int i, j, k; nField = strlen(pOp->p3); VERIFY( if( p->tos+1<nField ) goto not_enough_stack; ) nByte = 1; for(i=p->tos-nField+1; i<=p->tos; i++){ if( Stringify(p, i) ) goto no_mem; nByte += p->aStack[i].n+2; } zNewKey = sqliteMalloc( nByte ); if( zNewKey==0 ) goto no_mem; ................................................................................ zNewKey[j++] = pOp->p3[k++]; memcpy(&zNewKey[j], p->zStack[i], p->aStack[i].n-1); j += p->aStack[i].n-1; zNewKey[j++] = 0; } zNewKey[j] = 0; PopStack(p, nField); VERIFY( NeedStack(p, p->tos+1); ) p->tos++; p->aStack[p->tos].n = nByte; p->aStack[p->tos].flags = STK_Str|STK_Dyn; p->zStack[p->tos] = zNewKey; break; } ................................................................................ ** ** Sort all elements on the given sorter. The algorithm is a ** mergesort. */ case OP_Sort: { int j; j = pOp->p1; VERIFY( if( j<0 ) goto bad_instruction; ) if( j<p->nSort ){ int i; Sorter *pElem; Sorter *apSorter[NSORT]; for(i=0; i<NSORT; i++){ apSorter[i] = 0; } ................................................................................ /* Opcode: SortNext P1 P2 * ** ** Push the data for the topmost element in the given sorter onto the ** stack, then remove the element from the sorter. */ case OP_SortNext: { int i = pOp->p1; VERIFY( if( i<0 ) goto bad_instruction; ) if( VERIFY( i<p->nSort && ) p->apSort[i]!=0 ){ Sorter *pSorter = p->apSort[i]; p->apSort[i] = pSorter->pNext; p->tos++; VERIFY( NeedStack(p, p->tos); ) p->zStack[p->tos] = pSorter->pData; p->aStack[p->tos].n = pSorter->nData; p->aStack[p->tos].flags = STK_Str|STK_Dyn; sqliteFree(pSorter->zKey); sqliteFree(pSorter); }else{ pc = pOp->p2 - 1; ................................................................................ /* Opcode: SortKey P1 * * ** ** Push the key for the topmost element of the sorter onto the stack. ** But don't change the sorter an any other way. */ case OP_SortKey: { int i = pOp->p1; VERIFY( if( i<0 ) goto bad_instruction; ) if( i<p->nSort && p->apSort[i]!=0 ){ Sorter *pSorter = p->apSort[i]; p->tos++; VERIFY( NeedStack(p, p->tos); ) sqliteSetString(&p->zStack[p->tos], pSorter->zKey, 0); p->aStack[p->tos].n = pSorter->nKey; p->aStack[p->tos].flags = STK_Str|STK_Dyn; } break; } ................................................................................ ** The top of the stack contains a callback record built using ** the SortMakeRec operation with the same P1 value as this ** instruction. Pop this record from the stack and invoke the ** callback on it. */ case OP_SortCallback: { int i = p->tos; VERIFY( if( i<0 ) goto not_enough_stack; ) if( xCallback!=0 ){ if( xCallback(pArg, pOp->p1, (char**)p->zStack[i], p->azColName) ){ rc = SQLITE_ABORT; } } PopStack(p, 1); break; ................................................................................ /* Opcode: SortClose P1 * * ** ** Close the given sorter and remove all its elements. */ case OP_SortClose: { Sorter *pSorter; int i = pOp->p1; VERIFY( if( i<0 ) goto bad_instruction; ) if( i<p->nSort ){ while( (pSorter = p->apSort[i])!=0 ){ p->apSort[i] = pSorter->pNext; sqliteFree(pSorter->zKey); sqliteFree(pSorter->pData); sqliteFree(pSorter); } ................................................................................ /* Opcode: FileOpen * * P3 ** ** Open the file named by P3 for reading using the FileRead opcode. ** If P3 is "stdin" then open standard input for reading. */ case OP_FileOpen: { VERIFY( if( pOp->p3==0 ) goto bad_instruction; ) if( p->pFile ){ if( p->pFile!=stdin ) fclose(p->pFile); p->pFile = 0; } if( sqliteStrICmp(pOp->p3,"stdin")==0 ){ p->pFile = stdin; }else{ ................................................................................ ** ** Push onto the stack the P1-th field of the most recently read line ** from the input file. */ case OP_FileField: { int i = pOp->p1; char *z; VERIFY( if( NeedStack(p, p->tos+1) ) goto no_mem; ) if( VERIFY( i>=0 && i<p->nField && ) p->azField ){ z = p->azField[i]; }else{ z = 0; } if( z==0 ) z = ""; p->tos++; p->aStack[p->tos].n = strlen(z) + 1; ................................................................................ ** for all memory locations between 0 and P1 inclusive. */ case OP_MemStore: { int i = pOp->p1; int tos = p->tos; Mem *pMem; char *zOld; VERIFY( if( tos<0 ) goto not_enough_stack; ) if( i>=p->nMem ){ int nOld = p->nMem; p->nMem = i + 5; p->aMem = sqliteRealloc(p->aMem, p->nMem*sizeof(p->aMem[0])); if( p->aMem==0 ) goto no_mem; if( nOld<p->nMem ){ memset(&p->aMem[nOld], 0, sizeof(p->aMem[0])*(p->nMem-nOld)); ................................................................................ /* Opcode: MemLoad P1 * * ** ** Push a copy of the value in memory location P1 onto the stack. */ case OP_MemLoad: { int tos = ++p->tos; int i = pOp->p1; VERIFY( if( NeedStack(p, tos) ) goto no_mem; ) if( i<0 || i>=p->nMem ){ p->aStack[tos].flags = STK_Null; p->zStack[tos] = 0; }else{ p->aStack[tos] = p->aMem[i].s; if( p->aStack[tos].flags & STK_Str ){ char *z = sqliteMalloc(p->aStack[tos].n); ................................................................................ */ case OP_AggFocus: { int tos = p->tos; AggElem *pElem; char *zKey; int nKey; VERIFY( if( tos<0 ) goto not_enough_stack; ) Stringify(p, tos); zKey = p->zStack[tos]; nKey = p->aStack[tos].n; if( p->agg.nHash<=0 ){ pElem = 0; }else{ int h = sqliteHashNoCase(zKey, nKey-1) % p->agg.nHash; ................................................................................ ** Move the top of the stack into the P2-th field of the current ** aggregate. String values are duplicated into new memory. */ case OP_AggSet: { AggElem *pFocus = AggInFocus(p->agg); int i = pOp->p2; int tos = p->tos; VERIFY( if( tos<0 ) goto not_enough_stack; ) if( pFocus==0 ) goto no_mem; if( VERIFY( i>=0 && ) i<p->agg.nMem ){ Mem *pMem = &pFocus->aMem[i]; char *zOld; if( pMem->s.flags & STK_Dyn ){ zOld = pMem->z; }else{ zOld = 0; } ................................................................................ ** of the current aggregate. Strings are not duplicated so ** string values will be ephemeral. */ case OP_AggGet: { AggElem *pFocus = AggInFocus(p->agg); int i = pOp->p2; int tos = ++p->tos; VERIFY( if( NeedStack(p, tos) ) goto no_mem; ) if( pFocus==0 ) goto no_mem; if( VERIFY( i>=0 && ) i<p->agg.nMem ){ Mem *pMem = &pFocus->aMem[i]; p->aStack[tos] = pMem->s; p->zStack[tos] = pMem->z; p->aStack[tos].flags &= ~STK_Dyn; } break; } ................................................................................ ** Pop the stack once and compare the value popped off with the ** contents of set P1. If the element popped exists in set P1, ** then jump to P2. Otherwise fall through. */ case OP_SetFound: { int i = pOp->p1; int tos = p->tos; VERIFY( if( tos<0 ) goto not_enough_stack; ) Stringify(p, tos); if( VERIFY( i>=0 && i<p->nSet &&) SetTest(&p->aSet[i], p->zStack[tos])){ pc = pOp->p2 - 1; } PopStack(p, 1); break; } /* Opcode: SetNotFound P1 P2 * ................................................................................ ** Pop the stack once and compare the value popped off with the ** contents of set P1. If the element popped does not exists in ** set P1, then jump to P2. Otherwise fall through. */ case OP_SetNotFound: { int i = pOp->p1; int tos = p->tos; VERIFY( if( tos<0 ) goto not_enough_stack; ) Stringify(p, tos); if(VERIFY( i>=0 && i<p->nSet &&) !SetTest(&p->aSet[i], p->zStack[tos])){ pc = pOp->p2 - 1; } PopStack(p, 1); break; } /* Opcode: Length * * * ................................................................................ ** ** Interpret the top of the stack as a string. Replace the top of ** stack with an integer which is the length of the string. */ case OP_Strlen: { int tos = p->tos; int len; VERIFY( if( tos<0 ) goto not_enough_stack; ) Stringify(p, tos); len = p->aStack[tos].n-1; PopStack(p, 1); p->tos++; p->aStack[tos].i = len; p->aStack[tos].flags = STK_Int; break; ................................................................................ case OP_Substr: { int cnt; int start; int n; char *z; if( pOp->p2==0 ){ VERIFY( if( p->tos<0 ) goto not_enough_stack; ) Integerify(p, p->tos); cnt = p->aStack[p->tos].i; PopStack(p, 1); }else{ cnt = pOp->p2; } if( pOp->p1==0 ){ VERIFY( if( p->tos<0 ) goto not_enough_stack; ) Integerify(p, p->tos); start = p->aStack[p->tos].i - 1; PopStack(p, 1); }else{ start = pOp->p1 - 1; } VERIFY( if( p->tos<0 ) goto not_enough_stack; ) Stringify(p, p->tos); n = p->aStack[p->tos].n - 1; if( start<0 ){ start += n + 1; if( start<0 ){ cnt += start; start = 0; |