Lines Matching refs:pRoot
16132 ** on. *pRoot is the list that i is a member of.
16134 static void memsys3UnlinkFromList(u32 i, u32 *pRoot){
16139 *pRoot = next;
16172 ** at *pRoot.
16174 static void memsys3LinkIntoList(u32 i, u32 *pRoot){
16176 mem3.aPool[i].u.list.next = *pRoot;
16178 if( *pRoot ){
16179 mem3.aPool[*pRoot].u.list.prev = i;
16181 *pRoot = i;
16287 ** *pRoot is the head of a list of free chunks of the same size
16288 ** or same size hash. In other words, *pRoot is an entry in either
16302 static void memsys3Merge(u32 *pRoot){
16306 for(i=*pRoot; i>0; i=iNext){
16311 memsys3UnlinkFromList(i, pRoot);
53653 MemPage *pRoot;
53703 pRoot = pCur->apPage[0];
53704 assert( pRoot->pgno==pCur->pgnoRoot );
53705 assert( pRoot->isInit && (pCur->pKeyInfo==0)==pRoot->intKey );
53712 if( pRoot->nCell==0 && !pRoot->leaf ){
53714 if( pRoot->pgno!=1 ) return SQLITE_CORRUPT_BKPT;
53715 subpage = get4byte(&pRoot->aData[pRoot->hdrOffset+8]);
53719 pCur->eState = ((pRoot->nCell>0)?CURSOR_VALID:CURSOR_INVALID);
55957 static int balance_deeper(MemPage *pRoot, MemPage **ppChild){
55961 BtShared *pBt = pRoot->pBt; /* The BTree */
55963 assert( pRoot->nOverflow>0 );
55966 /* Make pRoot, the root page of the b-tree, writable. Allocate a new
55968 ** of the node stored on pRoot into the new child page.
55970 rc = sqlite3PagerWrite(pRoot->pDbPage);
55972 rc = allocateBtreePage(pBt,&pChild,&pgnoChild,pRoot->pgno,0);
55973 copyNodeContent(pRoot, pChild, &rc);
55975 ptrmapPut(pBt, pgnoChild, PTRMAP_BTREE, pRoot->pgno, &rc);
55984 assert( sqlite3PagerIswriteable(pRoot->pDbPage) );
55985 assert( pChild->nCell==pRoot->nCell );
55987 TRACE(("BALANCE: copy root %d into %d\n", pRoot->pgno, pChild->pgno));
55989 /* Copy the overflow cells from pRoot to pChild */
55990 memcpy(pChild->aiOvfl, pRoot->aiOvfl,
55991 pRoot->nOverflow*sizeof(pRoot->aiOvfl[0]));
55992 memcpy(pChild->apOvfl, pRoot->apOvfl,
55993 pRoot->nOverflow*sizeof(pRoot->apOvfl[0]));
55994 pChild->nOverflow = pRoot->nOverflow;
55996 /* Zero the contents of pRoot. Then install pChild as the right-child. */
55997 zeroPage(pRoot, pChild->aData[0] & ~PTF_LEAF);
55998 put4byte(&pRoot->aData[pRoot->hdrOffset+8], pgnoChild);
56417 MemPage *pRoot;
56427 rc = allocateBtreePage(pBt, &pRoot, &pgnoRoot, 1, 0);
56481 rc = btreeGetPage(pBt, pgnoRoot, &pRoot, 0);
56490 releasePage(pRoot);
56495 rc = relocatePage(pBt, pRoot, eType, iPtrPage, pgnoMove, 0);
56496 releasePage(pRoot);
56502 rc = btreeGetPage(pBt, pgnoRoot, &pRoot, 0);
56506 rc = sqlite3PagerWrite(pRoot->pDbPage);
56508 releasePage(pRoot);
56512 pRoot = pPageMove;
56518 releasePage(pRoot);
56529 releasePage(pRoot);
56534 rc = allocateBtreePage(pBt, &pRoot, &pgnoRoot, 1, 0);
56538 assert( sqlite3PagerIswriteable(pRoot->pDbPage) );
56544 zeroPage(pRoot, ptfFlags);
56545 sqlite3PagerUnref(pRoot->pDbPage);
74866 ** Attach subtrees pLeft and pRight to the Expr node pRoot.
74868 ** If pRoot==NULL that means that a memory allocation error has occurred.
74873 Expr *pRoot,
74877 if( pRoot==0 ){
74883 pRoot->pRight = pRight;
74885 pRoot->flags |= EP_ExpCollate;
74886 pRoot->pColl = pRight->pColl;
74890 pRoot->pLeft = pLeft;
74892 pRoot->flags |= EP_ExpCollate;
74893 pRoot->pColl = pLeft->pColl;
74896 exprSetHeight(pRoot);
100283 Parse *pRoot = sqlite3ParseToplevel(pParse);
100292 for(pPrg=pRoot->pTriggerPrg;
120742 ** Fts3TokenAndCost.pRoot.
120749 Fts3Expr *pRoot; /* Root of NEAR/AND cluster */
120763 Fts3Expr *pRoot, /* Root of current AND/NEAR cluster */
120777 pTC->pRoot = pRoot;
120789 pRoot = pExpr->pLeft;
120790 **ppOr = pRoot;
120793 fts3EvalTokenCosts(pCsr, pRoot, pExpr->pLeft, ppTC, ppOr, pRc);
120795 pRoot = pExpr->pRight;
120796 **ppOr = pRoot;
120799 fts3EvalTokenCosts(pCsr, pRoot, pExpr->pRight, ppTC, ppOr, pRc);
120869 ** the cluster with root node pRoot. See comments above the definition
120878 Fts3Expr *pRoot, /* Consider tokens with this root node */
120905 if( aTC[ii].pRoot==pRoot ){
120945 if( aTC[iTC].pToken && aTC[iTC].pRoot==pRoot
121624 Fts3Expr *pRoot; /* Root of NEAR expression */
121632 pRoot = pExpr;
121633 while( pRoot->pParent && pRoot->pParent->eType==FTSQUERY_NEAR ){
121634 pRoot = pRoot->pParent;
121636 iDocid = pRoot->iDocid;
121637 bEof = pRoot->bEof;
121638 assert( pRoot->bStart );
121641 for(p=pRoot; p; p=p->pLeft){
121649 fts3EvalRestart(pCsr, pRoot, &rc);
121659 fts3EvalNextRow(pCsr, pRoot, &rc);
121660 pCsr->isEof = pRoot->bEof;
121663 pCsr->iPrevId = pRoot->iDocid;
121665 && pRoot->eType==FTSQUERY_NEAR
121670 fts3EvalUpdateCounts(pRoot);
121678 pRoot->bEof = bEof;
121680 /* Caution: pRoot may iterate through docids in ascending or descending
121684 ** do {...} while( pRoot->iDocid<iDocid && rc==SQLITE_OK );
121686 fts3EvalRestart(pCsr, pRoot, &rc);
121688 fts3EvalNextRow(pCsr, pRoot, &rc);
121689 assert( pRoot->bEof==0 );
121690 }while( pRoot->iDocid!=iDocid && rc==SQLITE_OK );
131400 RtreeNode *pRoot = 0;
131454 rc = nodeAcquire(pRtree, 1, 0, &pRoot);
131458 int nCell = NCELL(pRoot);
131459 pCsr->pNode = pRoot;
131461 assert( pCsr->pNode==pRoot );
131468 assert( pCsr->pNode==pRoot );
131469 nodeRelease(pRtree, pRoot);
132799 RtreeNode *pRoot; /* Root node of rtree structure */
132803 rc = nodeAcquire(pRtree, 1, 0, &pRoot);
132840 if( rc==SQLITE_OK && pRtree->iDepth>0 && NCELL(pRoot)==1 ){
132843 i64 iChild = nodeGetRowid(pRtree, pRoot, 0);
132844 rc = nodeAcquire(pRtree, iChild, pRoot, &pChild);
132852 writeInt16(pRoot->zData, pRtree->iDepth);
132853 pRoot->isDirty = 1;
132868 rc = nodeRelease(pRtree, pRoot);
132870 nodeRelease(pRtree, pRoot);
