Searched refs:pNext (Results 1 - 25 of 25) sorted by relevance

/PHP_5_3/ext/sqlite/libsqlite/src/
H A Dattach.c308 pStep = pStep->pNext;
H A Dbtree.c366 BtCursor *pNext, *pPrev; /* Forms a linked list of all cursors */ member in struct:BtCursor
524 FreeBlk *pNext; local
539 pNext = (FreeBlk*)&pPage->u.aDisk[idx + iSize + size];
541 pFBlk->iSize = swab16((u16)swab16(pNext->iSize)+iSize+size);
543 pFBlk->iSize += pNext->iSize;
545 pFBlk->iNext = pNext->iNext;
558 pNext = (FreeBlk*)&pPage->u.aDisk[idx];
559 pNew->iSize = SWAB16(pBt, size + SWAB16(pBt, pNext->iSize));
560 pNew->iNext = pNext->iNext;
929 for(pCur=pBt->pCursor; pCur; pCur=pCur->pNext){
1916 Pgno *pNext; local
2726 Cell *pNext; local
[all...]
H A Dbtree_rb.c62 BtRollbackOp *pNext; member in struct:BtRollbackOp
600 pRollbackOp->pNext = pRbtree->pTransRollback;
607 pRollbackOp->pNext = pRbtree->pCheckRollback;
1279 BtRollbackOp *pTmp = pOp->pNext;
1355 pTmp = pList->pNext;
1388 tree->pCheckRollbackTail->pNext = tree->pTransRollback;
H A Dbuild.c197 pIndex->pTable->pIndex = pIndex->pNext;
200 for(p=pIndex->pTable->pIndex; p && p->pNext!=pIndex; p=p->pNext){}
201 if( p && p->pNext==pIndex ){
202 p->pNext = pIndex->pNext;
320 Index *pIndex, *pNext; local
327 for(pIndex = pTable->pIndex; pIndex; pIndex=pNext){
328 pNext = pIndex->pNext;
[all...]
H A Ddelete.c185 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
273 for(i=1, pIdx=pTab->pIndex; pIdx; i++, pIdx=pIdx->pNext){
290 for(i=1, pIdx=pTab->pIndex; pIdx; i++, pIdx=pIdx->pNext){
377 for(i=1, pIdx=pTab->pIndex; pIdx; i++, pIdx=pIdx->pNext){
H A Dinsert.c489 for(idx=1, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, idx++){
517 for(idx=1, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, idx++){
761 for(iCur=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, iCur++){
880 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){}
914 for(i=1, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, i++){
H A Dmain.c588 FuncDef *pFunc, *pNext; local
589 for(pFunc = (FuncDef*)sqliteHashData(i); pFunc; pFunc=pNext){
590 pNext = pFunc->pNext;
1046 p = p->pNext;
H A Dpager.c442 PgHdr *pPg, *pNext; local
443 for(pPg=pPager->pAll; pPg; pPg=pNext){
444 pNext = pPg->pNextAll;
1068 PgHdr *pPg, *pNext; local
1085 for(pPg=pPager->pAll; pPg; pPg=pNext){
1086 pNext = pPg->pNextAll;
2155 PgHdr *pPg, *pNext; local
2162 for(pPg=pPager->pCkpt; pPg; pPg=pNext){
2163 pNext = pPg->pNextCkpt;
H A Dparse.c2970 yymsp[-2].minor.yy19->pNext = yymsp[0].minor.yy19;
H A Dparse.y830 X->pNext = Y;
H A Dpragma.c442 pIdx = pIdx->pNext;
640 for(j=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, j++){
649 for(j=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, j++){
678 for(j=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, j++){
H A Dselect.c1894 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
H A DsqliteInt.h435 FuncDef *pNext; /* Next function with same name */ member in struct:FuncDef
628 Index *pNext; /* The next index associated with the same table */ member in struct:Index
960 * pNext member of struct Trigger. A pointer to the first element of the
981 Trigger *pNext; /* Next trigger associated with the table */ member in struct:Trigger
989 * using the "pNext" member) referenced by the "step_list" member of the
1035 TriggerStep * pNext; /* Next in the link-list */ member in struct:TriggerStep
1054 * struct TriggerStack has a "pNext" member, to allow linked lists to be
1056 * each nested trigger stores its parent trigger's TriggerStack as the "pNext"
1057 * pointer. Once the nested trigger has been coded, the pNext value is restored
1072 TriggerStack *pNext; /* Nex member in struct:TriggerStack
[all...]
H A Dtrigger.c21 pTriggerStep = pTriggerStep->pNext;
174 pStepList = pStepList->pNext;
220 nt->pNext = pTab->pTrigger;
483 pTable->pTrigger = pTrigger->pNext;
487 if( cc->pNext == pTrigger ){
488 cc->pNext = cc->pNext->pNext;
491 cc = cc->pNext;
556 ss = ss->pNext;
[all...]
H A Dupdate.c105 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
161 for(nIdx=nIdxTotal=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdxTotal++){
176 for(nIdx=j=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, j++){
323 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
330 for(i=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, i++){
406 for(i=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, i++){
428 for(i=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, i++){
H A Dvdbe.c359 pTail->pNext = 0;
363 pTail->pNext = pLeft;
364 pLeft = pLeft->pNext;
366 pTail->pNext = pRight;
367 pRight = pRight->pNext;
369 pTail = pTail->pNext;
372 pTail->pNext = pLeft;
374 pTail->pNext = pRight;
376 return sHead.pNext;
3768 pKeylist->pNext
[all...]
H A DvdbeInt.h93 Sorter *pNext; /* Next in the list */ member in struct:Sorter
206 Keylist *pNext; /* Next block of keys */ member in struct:Keylist
232 Vdbe *pPrev,*pNext; /* Linked list of VDBEs with the same Vdbe.db */ member in struct:Vdbe
H A Dvdbeaux.c44 p->pNext = db->pVdbe;
662 p->pSort = pSorter->pNext;
720 Keylist *pNext = p->pNext; local
722 p = pNext;
987 p->pPrev->pNext = p->pNext;
990 p->db->pVdbe = p->pNext;
992 if( p->pNext ){
993 p->pNext
[all...]
H A Dwhere.c252 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
557 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
/PHP_5_3/ext/sqlite3/libsqlite/
H A Dsqlite3.c1334 ** the pNext pointer. The [sqlite3_vfs_register()]
1338 ** implementation should use the pNext pointer.
1340 ** The pNext field is the only field in the sqlite3_vfs
1477 sqlite3_vfs *pNext; /* Next registered VFS */ member in struct:sqlite3_vfs
8217 SubProgram *pNext; /* Next sub-program already visited */ member in struct:SubProgram
9370 LookasideSlot *pNext; /* Next buffer in the list of free buffers */ member in struct:LookasideSlot
9591 FuncDef *pNext; /* Next function with same name */ member in struct:FuncDef
9677 Savepoint *pNext; /* Parent savepoint (if any) */ member in struct:Savepoint
9848 VTable *pNext; /* Next in linked list (see above) */ member in struct:VTable
10094 Index *pNext; /* Th member in struct:Index
10620 NameContext *pNext; /* Next outer name context. NULL for outermost */ member in struct:NameContext
10654 Select *pNext; /* Next select to the left in a compound */ member in struct:Select
10717 AutoincInfo *pNext; /* Next info block in a list of them all */ member in struct:AutoincInfo
10753 TriggerPrg *pNext; /* Next entry in Parse.pTriggerPrg list */ member in struct:TriggerPrg
10922 Trigger *pNext; /* Next trigger associated with the table */ member in struct:Trigger
10982 TriggerStep *pNext; /* Next in the link-list */ member in struct:TriggerStep
12773 Vdbe *pPrev,*pNext; /* Linked list of VDBEs with the same Vdbe.db */ member in struct:Vdbe
14939 struct MemBlockHdr *pNext, *pPrev; /* Linked list of all unfreed memory */ member in struct:MemBlockHdr
18049 struct ScratchFreeslot *pNext; /* Next unused scratch buffer */ member in struct:ScratchFreeslot
23107 os2ShmNode *pNext; /* Next in list of all os2ShmNode objects */ member in struct:os2ShmNode
23137 os2ShmLink *pNext; /* Next os2Shm with the same os2ShmNode */ member in struct:os2ShmLink
24464 UnixUnusedFd *pNext; /* Next unused file descriptor on same file */ member in struct:UnixUnusedFd
25179 struct vxworksFileId *pNext; /* Next in a list of them all */ member in struct:vxworksFileId
25420 unixInodeInfo *pNext; /* List of all unixInodeInfo objects */ member in struct:unixInodeInfo
25532 UnixUnusedFd *pNext; local
28043 unixShm *pNext; /* Next unixShm with the same unixShmNode */ member in struct:unixShm
32824 winShmNode *pNext; /* Next in list of all winShmNode objects */ member in struct:winShmNode
32852 winShm *pNext; /* Next winShm with the same winShmNode */ member in struct:winShm
35103 PgHdr *pNext; local
35377 PgHdr1 *pNext; /* Next in hash table chain */ member in struct:PgHdr1
35388 PgFreeslot *pNext; /* Next free slot */ member in struct:PgFreeslot
35671 PgHdr1 *pNext = p->apHash[i]; local
39733 PgHdr *pNext = pList->pDirty; local
46912 BtLock *pNext; /* Next in BtShared.pLock list */ member in struct:BtLock
46948 Btree *pNext; /* List of other sharable Btrees from the same db */ member in struct:Btree
47031 BtShared *pNext; /* Next on a list of sharable BtShared structs */ member in struct:BtShared
47085 BtCursor *pNext, *pPrev; /* Forms a linked list of all cursors */ member in struct:BtCursor
55732 sqlite3_backup *pNext; /* Next backup associated with source pager */ member in struct:sqlite3_backup
59978 SubProgram *pSub, *pNext; local
62081 sqlite3_stmt *pNext; local
69665 FileChunk *pNext; /* Next chunk in the journal */ member in struct:FileChunk
77847 Index *pIndex, *pNext; local
84980 FKey *pNext; /* Copy of pFKey->pNextFrom */ local
97430 VTable *pNext = pVTable->pNext; local
97478 VTable *pNext = p->pNext; local
108671 FuncDef *pNext, *pHash, *p; local
115414 char *pNext = 0; local
119707 Fts3DeferredToken *pNext; /* Next in list of deferred tokens */ member in struct:Fts3DeferredToken
120698 char *pNext; /* Cursor variable */ local
122581 Fts3DeferredToken *pNext; local
124646 RtreeNode *pNext; /* Next node in this hash chain */ member in struct:RtreeNode
126504 RtreeCell *pNext; local
[all...]
H A Dsqlite3.h787 ** the pNext pointer. The [sqlite3_vfs_register()]
791 ** implementation should use the pNext pointer.
793 ** The pNext field is the only field in the sqlite3_vfs
930 sqlite3_vfs *pNext; /* Next registered VFS */ member in struct:sqlite3_vfs
/PHP_5_3/ext/standard/
H A Ddns_win32.c71 for (pRec = pResult; pRec; pRec = pRec->pNext) {
434 for (pRec = pResult; pRec; pRec = pRec->pNext) {
/PHP_5_3/Zend/
H A Dzend_hash.c25 (element)->pNext = (list_head); \
27 if ((element)->pNext) { \
28 (element)->pNext->pLast = (element); \
247 p = p->pNext;
312 p = p->pNext;
389 p = p->pNext;
478 ht->arBuckets[nIndex] = p->pNext;
480 p->pLast->pNext = p->pNext;
482 if (p->pNext) {
[all...]
H A Dzend_hash.h61 struct bucket *pNext; member in struct:bucket
/PHP_5_3/ext/spl/
H A Dspl_array.c124 p = p->pNext;

Completed in 197 milliseconds