Lines Matching refs:pRoot

15646 static void memsys3UnlinkFromList(u32 i, u32 *pRoot){  in memsys3UnlinkFromList()  argument
15651 *pRoot = next; in memsys3UnlinkFromList()
15686 static void memsys3LinkIntoList(u32 i, u32 *pRoot){ in memsys3LinkIntoList() argument
15688 mem3.aPool[i].u.list.next = *pRoot; in memsys3LinkIntoList()
15690 if( *pRoot ){ in memsys3LinkIntoList()
15691 mem3.aPool[*pRoot].u.list.prev = i; in memsys3LinkIntoList()
15693 *pRoot = i; in memsys3LinkIntoList()
15814 static void memsys3Merge(u32 *pRoot){ in memsys3Merge() argument
15818 for(i=*pRoot; i>0; i=iNext){ in memsys3Merge()
15823 memsys3UnlinkFromList(i, pRoot); in memsys3Merge()
52466 MemPage *pRoot;
52516 pRoot = pCur->apPage[0];
52517 assert( pRoot->pgno==pCur->pgnoRoot );
52518 assert( pRoot->isInit && (pCur->pKeyInfo==0)==pRoot->intKey );
52525 if( pRoot->nCell==0 && !pRoot->leaf ){
52527 if( pRoot->pgno!=1 ) return SQLITE_CORRUPT_BKPT;
52528 subpage = get4byte(&pRoot->aData[pRoot->hdrOffset+8]);
52532 pCur->eState = ((pRoot->nCell>0)?CURSOR_VALID:CURSOR_INVALID);
54748 static int balance_deeper(MemPage *pRoot, MemPage **ppChild){
54752 BtShared *pBt = pRoot->pBt; /* The BTree */
54754 assert( pRoot->nOverflow>0 );
54761 rc = sqlite3PagerWrite(pRoot->pDbPage);
54763 rc = allocateBtreePage(pBt,&pChild,&pgnoChild,pRoot->pgno,0);
54764 copyNodeContent(pRoot, pChild, &rc);
54766 ptrmapPut(pBt, pgnoChild, PTRMAP_BTREE, pRoot->pgno, &rc);
54775 assert( sqlite3PagerIswriteable(pRoot->pDbPage) );
54776 assert( pChild->nCell==pRoot->nCell );
54778 TRACE(("BALANCE: copy root %d into %d\n", pRoot->pgno, pChild->pgno));
54781 memcpy(pChild->aOvfl, pRoot->aOvfl, pRoot->nOverflow*sizeof(pRoot->aOvfl[0]));
54782 pChild->nOverflow = pRoot->nOverflow;
54785 zeroPage(pRoot, pChild->aData[0] & ~PTF_LEAF);
54786 put4byte(&pRoot->aData[pRoot->hdrOffset+8], pgnoChild);
55204 MemPage *pRoot;
55214 rc = allocateBtreePage(pBt, &pRoot, &pgnoRoot, 1, 0);
55268 rc = btreeGetPage(pBt, pgnoRoot, &pRoot, 0);
55277 releasePage(pRoot);
55282 rc = relocatePage(pBt, pRoot, eType, iPtrPage, pgnoMove, 0);
55283 releasePage(pRoot);
55289 rc = btreeGetPage(pBt, pgnoRoot, &pRoot, 0);
55293 rc = sqlite3PagerWrite(pRoot->pDbPage);
55295 releasePage(pRoot);
55299 pRoot = pPageMove;
55305 releasePage(pRoot);
55316 releasePage(pRoot);
55321 rc = allocateBtreePage(pBt, &pRoot, &pgnoRoot, 1, 0);
55325 assert( sqlite3PagerIswriteable(pRoot->pDbPage) );
55331 zeroPage(pRoot, ptfFlags);
55332 sqlite3PagerUnref(pRoot->pDbPage);
73465 Expr *pRoot,
73469 if( pRoot==0 ){
73475 pRoot->pRight = pRight;
73477 pRoot->flags |= EP_ExpCollate;
73478 pRoot->pColl = pRight->pColl;
73482 pRoot->pLeft = pLeft;
73484 pRoot->flags |= EP_ExpCollate;
73485 pRoot->pColl = pLeft->pColl;
73488 exprSetHeight(pRoot);
98066 Parse *pRoot = sqlite3ParseToplevel(pParse);
98075 for(pPrg=pRoot->pTriggerPrg;
117985 Fts3Expr *pRoot; /* Root of NEAR/AND cluster */
117999 Fts3Expr *pRoot, /* Root of current AND/NEAR cluster */
118013 pTC->pRoot = pRoot;
118020 pRoot = pExpr->pLeft;
118021 **ppOr = pRoot;
118024 fts3EvalTokenCosts(pCsr, pRoot, pExpr->pLeft, ppTC, ppOr, pRc);
118026 pRoot = pExpr->pRight;
118027 **ppOr = pRoot;
118030 fts3EvalTokenCosts(pCsr, pRoot, pExpr->pRight, ppTC, ppOr, pRc);
118109 Fts3Expr *pRoot, /* Consider tokens with this root node */
118127 if( aTC[ii].pRoot==pRoot ){
118167 if( aTC[iTC].pToken && aTC[iTC].pRoot==pRoot
118839 Fts3Expr *pRoot; /* Root of NEAR expression */
118847 pRoot = pExpr;
118848 while( pRoot->pParent && pRoot->pParent->eType==FTSQUERY_NEAR ){
118849 pRoot = pRoot->pParent;
118851 iDocid = pRoot->iDocid;
118852 bEof = pRoot->bEof;
118853 assert( pRoot->bStart );
118856 for(p=pRoot; p; p=p->pLeft){
118864 fts3EvalRestart(pCsr, pRoot, &rc);
118874 fts3EvalNextRow(pCsr, pRoot, &rc);
118875 pCsr->isEof = pRoot->bEof;
118878 pCsr->iPrevId = pRoot->iDocid;
118880 && pRoot->eType==FTSQUERY_NEAR
118885 fts3EvalUpdateCounts(pRoot);
118893 pRoot->bEof = bEof;
118901 fts3EvalRestart(pCsr, pRoot, &rc);
118903 fts3EvalNextRow(pCsr, pRoot, &rc);
118904 assert( pRoot->bEof==0 );
118905 }while( pRoot->iDocid!=iDocid && rc==SQLITE_OK );
128270 RtreeNode *pRoot = 0;
128323 rc = nodeAcquire(pRtree, 1, 0, &pRoot);
128327 int nCell = NCELL(pRoot);
128328 pCsr->pNode = pRoot;
128330 assert( pCsr->pNode==pRoot );
128337 assert( pCsr->pNode==pRoot );
128338 nodeRelease(pRtree, pRoot);
129664 RtreeNode *pRoot; /* Root node of rtree structure */
129668 rc = nodeAcquire(pRtree, 1, 0, &pRoot);
129705 if( rc==SQLITE_OK && pRtree->iDepth>0 && NCELL(pRoot)==1 ){
129708 i64 iChild = nodeGetRowid(pRtree, pRoot, 0);
129709 rc = nodeAcquire(pRtree, iChild, pRoot, &pChild);
129717 writeInt16(pRoot->zData, pRtree->iDepth);
129718 pRoot->isDirty = 1;
129733 rc = nodeRelease(pRtree, pRoot);
129735 nodeRelease(pRtree, pRoot);