Home
last modified time | relevance | path

Searched refs:next (Results 1 – 25 of 95) sorted by relevance

1234

/sqlite-3.40.0/src/
H A Dhash.c45 HashElem *next_elem = elem->next; in sqlite3HashClear()
86 pNew->next = pHead; in insertElement()
88 if( pHead->prev ){ pHead->prev->next = pNew; } in insertElement()
92 pNew->next = pH->first; in insertElement()
136 next_elem = elem->next; in rehash()
174 elem = elem->next; in findElementWithHash()
189 elem->prev->next = elem->next; in removeElementGivenHash()
191 pH->first = elem->next; in removeElementGivenHash()
193 if( elem->next ){ in removeElementGivenHash()
194 elem->next->prev = elem->prev; in removeElementGivenHash()
[all …]
H A Dmem3.c148 u32 next = mem3.aPool[i].u.list.next; in memsys3UnlinkFromList() local
152 *pRoot = next; in memsys3UnlinkFromList()
154 mem3.aPool[prev].u.list.next = next; in memsys3UnlinkFromList()
156 if( next ){ in memsys3UnlinkFromList()
157 mem3.aPool[next].u.list.prev = prev; in memsys3UnlinkFromList()
159 mem3.aPool[i].u.list.next = 0; in memsys3UnlinkFromList()
189 mem3.aPool[i].u.list.next = *pRoot; in memsys3LinkIntoList()
320 iNext = mem3.aPool[i].u.list.next; in memsys3Merge()
328 iNext = mem3.aPool[prev].u.list.next; in memsys3Merge()
381 for(i=mem3.aiHash[hash]; i>0; i=mem3.aPool[i].u.list.next){ in memsys3MallocUnsafe()
[all …]
H A Dmem5.c69 int next; /* Index of next free chunk */ member
150 int next, prev; in memsys5Unlink() local
155 next = MEM5LINK(i)->next; in memsys5Unlink()
158 mem5.aiFreelist[iLogsize] = next; in memsys5Unlink()
160 MEM5LINK(prev)->next = next; in memsys5Unlink()
162 if( next>=0 ){ in memsys5Unlink()
163 MEM5LINK(next)->prev = prev; in memsys5Unlink()
178 x = MEM5LINK(i)->next = mem5.aiFreelist[iLogsize]; in memsys5Link()
542 for(n=0, j=mem5.aiFreelist[i]; j>=0; j = MEM5LINK(j)->next, n++){} in sqlite3Memsys5Dump()
H A Dtest_windirent.c76 next: in opendir()
85 if( is_filtered(data) ) goto next; in opendir()
112 next: in readdir()
118 if( is_filtered(data) ) goto next; in readdir()
153 next: in readdir_r()
162 if( is_filtered(data) ) goto next; in readdir_r()
H A Dhash.h60 HashElem *next, *prev; /* Next and previous elements in the table */ member
86 #define sqliteHashNext(E) ((E)->next)
/sqlite-3.40.0/ext/fts3/
H A Dfts3_hash.c84 Fts3HashElem *next_elem = elem->next; in sqlite3Fts3HashClear()
174 pNew->next = pHead; in fts3HashInsertElement()
176 if( pHead->prev ){ pHead->prev->next = pNew; } in fts3HashInsertElement()
180 pNew->next = pH->first; in fts3HashInsertElement()
210 next_elem = elem->next; in fts3Rehash()
239 elem = elem->next; in fts3FindElementByHash()
255 elem->prev->next = elem->next; in fts3RemoveElementByHash()
257 pH->first = elem->next; in fts3RemoveElementByHash()
259 if( elem->next ){ in fts3RemoveElementByHash()
260 elem->next->prev = elem->prev; in fts3RemoveElementByHash()
[all …]
H A Dfts3_hash.h51 Fts3HashElem *next, *prev; /* Next and previous elements in the table */ member
102 #define fts3HashNext(E) ((E)->next)
/sqlite-3.40.0/ext/fts2/
H A Dfts2_hash.c86 fts2HashElem *next_elem = elem->next; in sqlite3Fts2HashClear()
176 pNew->next = pHead; in insertElement()
178 if( pHead->prev ){ pHead->prev->next = pNew; } in insertElement()
182 pNew->next = pH->first; in insertElement()
210 next_elem = elem->next; in rehash()
238 elem = elem->next; in findElementGivenHash()
254 elem->prev->next = elem->next; in removeElementGivenHash()
256 pH->first = elem->next; in removeElementGivenHash()
258 if( elem->next ){ in removeElementGivenHash()
259 elem->next->prev = elem->prev; in removeElementGivenHash()
[all …]
H A Dfts2_hash.h51 fts2HashElem *next, *prev; /* Next and previous elements in the table */ member
100 #define fts2HashNext(E) ((E)->next)
/sqlite-3.40.0/ext/fts1/
H A Dft_hash.c72 HashElem *next_elem = elem->next; in HashClear()
211 pNew->next = pHead; in insertElement()
213 if( pHead->prev ){ pHead->prev->next = pNew; } in insertElement()
217 pNew->next = pH->first; in insertElement()
245 next_elem = elem->next; in rehash()
273 elem = elem->next; in findElementGivenHash()
289 elem->prev->next = elem->next; in removeElementGivenHash()
291 pH->first = elem->next; in removeElementGivenHash()
293 if( elem->next ){ in removeElementGivenHash()
294 elem->next->prev = elem->prev; in removeElementGivenHash()
[all …]
H A Dfts1_hash.c79 fts1HashElem *next_elem = elem->next; in sqlite3Fts1HashClear()
169 pNew->next = pHead; in insertElement()
171 if( pHead->prev ){ pHead->prev->next = pNew; } in insertElement()
175 pNew->next = pH->first; in insertElement()
203 next_elem = elem->next; in rehash()
231 elem = elem->next; in findElementGivenHash()
247 elem->prev->next = elem->next; in removeElementGivenHash()
249 pH->first = elem->next; in removeElementGivenHash()
251 if( elem->next ){ in removeElementGivenHash()
252 elem->next->prev = elem->prev; in removeElementGivenHash()
[all …]
H A Dft_hash.h53 HashElem *next, *prev; /* Next and previous elements in the table */ member
101 #define HashNext(E) ((E)->next)
H A Dfts1_hash.h53 fts1HashElem *next, *prev; /* Next and previous elements in the table */ member
102 #define fts1HashNext(E) ((E)->next)
/sqlite-3.40.0/tool/
H A Dlemon.c1202 for(ap=stp->ap; ap && ap->next; ap=ap->next){ in FindActions()
1203 for(nap=ap->next; nap && nap->sp==ap->sp; nap=nap->next){ in FindActions()
1362 cfp->next = 0; in Configlist_add()
1388 cfp->next = 0; in Configlist_addbasis()
1598 rp->next = 0; in Rule_sort()
1896 char **next, in msort() argument
4889 for(rp2=rp->next; rp2; rp2=rp2->next){ in ReportTable()
5012 for(ap2=ap->next; ap2; ap2=ap2->next){ in CompressTables()
5037 for(ap=ap->next; ap; ap=ap->next){ in CompressTables()
5320 np = np->next; in Strsafe_insert()
[all …]
H A Dmkopcodeh.tcl222 set next $start
226 set op($name) $next
227 set used($next) 1
228 set def($next) $name
229 incr next
/sqlite-3.40.0/test/
H A Dasync5.test30 ATTACH 'test2.db' AS next;
32 CREATE TABLE next.t2(a, b);
H A Dbackup_ioerr.test111 # from the next call to backup_step() (in step 5 of this test
179 # a few things then skip to the next iteration of the loop.
242 # it is reported correctly and skip to the next iteration of the loop.
H A Dpragma3.test141 # The next block checks the behavior for separate processes.
169 # The next block checks that behavior is the same for shared-cache.
H A Dasync.test70 # the next test file will delete the database file on disk (using
H A Dtkt-f3e5abed55.test60 # Set up a testvfs so that the next time SQLite tries to delete the
H A Dfts4unicode.test103 will return SQLITE_ABORT upon next access after the ROLLBACK.
157 will return SQLITE_ABORT upon next access after the [ROLLBACK].
161 will return SQLITE_ABORT upon next access after the [ROLLBACK].
H A Dattach4.test54 ATTACH 'x.db' AS next;
H A Dtkt-fc62af4523.test65 # uncommitted data into the database file, the next reader will have
/sqlite-3.40.0/ext/rtree/
H A Drtreedoc3.test165 # node (a subtree), then the next child of that node is passed to the
219 foreach {rScore next} [pq_extract] {}
228 array set N $next
/sqlite-3.40.0/doc/
H A Dvdbesort-memory.md22 the temp file, the buffer is reused to accumulate the next batch of keys.

1234