Home
last modified time | relevance | path

Searched refs:btree (Results 1 – 25 of 32) sorted by relevance

12

/sqlite-3.40.0/src/
H A Dwhere.c925 pLoop->u.btree.pIndex = pIdx; in constructAutomaticIndex()
2153 if( p->u.btree.pIndex && (zName = p->u.btree.pIndex->zName)!=0 ){ in sqlite3WhereLoopPrint()
2212 p->u.btree.pIndex = 0; in whereLoopClearUnion()
2264 pFrom->u.btree.pIndex = 0; in whereLoopXfer()
2586 p->u.btree.pIndex = 0; in whereLoopInsert()
3156 pNew->u.btree.nEq++; in whereLoopAddBtreeIndex()
3503 pNew->u.btree.nEq = 0; in whereLoopAddBtree()
3504 pNew->u.btree.nBtm = 0; in whereLoopAddBtree()
3505 pNew->u.btree.nTop = 0; in whereLoopAddBtree()
5213 pLoop->u.btree.nEq = 1; in whereShortCut()
[all …]
H A Dwherecode.c88 Index *pIndex = pLoop->u.btree.pIndex; in explainIndexRange()
89 u16 nEq = pLoop->u.btree.nEq; in explainIndexRange()
157 assert( pLoop->u.btree.pIndex!=0 ); in sqlite3WhereExplainOneScan()
158 pIdx = pLoop->u.btree.pIndex; in sqlite3WhereExplainOneScan()
589 && pLoop->u.btree.pIndex!=0 in codeEqualityTerm()
783 nEq = pLoop->u.btree.nEq; in codeAllEqualityTerms()
785 pIdx = pLoop->u.btree.pIndex; in codeAllEqualityTerms()
1041 sHint.pIdx = pLoop->u.btree.pIndex; in codeCursorHint()
1294 u16 nEq = pLoop->u.btree.nEq; in filterPullDown()
1541 assert( pLoop->u.btree.nEq==1 ); in sqlite3WhereCodeOneLoopStart()
[all …]
H A DwhereInt.h146 } btree; member
/sqlite-3.40.0/ext/rtree/
H A Drtree_perf.tcl25 set sql1 {CREATE TABLE btree(ii INTEGER PRIMARY KEY, x1, x2, y1, y2)}
40 db eval {INSERT INTO btree VALUES($ii, $x1, $x2, $y1, $y2)}
62 db eval {SELECT * FROM btree WHERE x1<$x1 AND x2>$x2 AND y1<$y1 AND y2>$y2}
H A Drtree4.test87 # Construct an rtree virtual table and an ordinary btree table
/sqlite-3.40.0/test/
H A Dcorrupt7.test15 # on corrupt cell offsets in a btree page.
65 # Deliberately corrupt some of the cell offsets in the btree page
H A Ddistinct.test57 lappend ret btree
164 4 "a, b, c FROM t1 ORDER BY a, b, c" {btree} {A B C a b c}
166 6 "b FROM t1 ORDER BY +b COLLATE binary" {btree hash} {B b}
H A Dschema2.test263 # btree cursors open on the same database file it does not corrupt
266 # 2007-05-02: These tests have been overcome by events. Open btree
H A Dschema.test274 # btree cursors open on the same database file it does not corrupt
277 # 2007-05-02: These tests have been overcome by events. Open btree
H A Dbtreefault.test12 # This file contains fault injection tests designed to test the btree.c
H A Dtkt35xx.test15 # in the btree layer.
H A Dtempdb2.test34 # free-list and causes the btree layer to call PagerDontWrite() on
H A Dmemsubsys2.test22 # rebalance operations in the btree-layer and to require a large
H A DmallocC.test109 -- allocatePage() routine in btree.c).
H A Dmemsubsys1.test32 # rebalance operations in the btree-layer and to require a large
H A Dmalloc3.test105 # Non-transient mallocs in btree.c:
121 # transient malloc() calls in btree.c, which can occur during the tree-balance
260 # TABLE statement didn't test. A few of the transient malloc()s in btree.c
H A Dtable.test662 # auto-vacuum mode the btree-layer may need to move the root-pages of
665 # 2007-05-02: A open btree cursor no longer blocks CREATE TABLE.
714 # been executed, and btree root-pages may not move after this (which a
H A DcorruptD.test67 # one of the above fields, then exercise each part of the code in btree.c
H A Dinsert3.test178 # sequence was found to cause an assert() in btree.c to fail. These
H A Dshared4.test12 # Test the btree mutex protocol for shared cache mode.
H A Dthread005.test201 # There is a race-condition in btree.c that means that if two threads
/sqlite-3.40.0/
H A DMakefile.in173 backup.lo bitvec.lo btmutex.lo btree.lo build.lo \
217 $(TOP)/src/btree.c \
218 $(TOP)/src/btree.h \
485 $(TOP)/src/btree.c \
539 $(TOP)/src/btree.h \
844 btree.lo: $(TOP)/src/btree.c $(HDR) $(TOP)/src/pager.h
845 $(LTCOMPILE) $(TEMP_STORE) -c $(TOP)/src/btree.c
H A Dmain.mk58 backup.o bitvec.o btmutex.o btree.o build.o \
94 $(TOP)/src/btree.c \
95 $(TOP)/src/btree.h \
405 $(TOP)/src/btree.c \
457 $(TOP)/src/btree.h \
H A DMakefile.msc1241 backup.lo bitvec.lo btmutex.lo btree.lo build.lo \
1301 $(TOP)\src\btree.c \
1388 $(TOP)\src\btree.h \
1616 $(TOP)\src\btree.h \
1959 btree.lo: $(TOP)\src\btree.c $(HDR) $(TOP)\src\pager.h
1960 $(LTCOMPILE) $(CORE_COMPILE_OPTS) -c $(TOP)\src\btree.c
H A DREADME.md271 * **btree.c** - This file contains the implementation of the B-Tree
273 is defined by "btree.h". The "btreeInt.h" header defines objects
274 used internally by btree.c and not published to the rest of the system.

12