Lines Matching defs:pParent
18156 VdbeFrame *pParent; /* Parent of this frame, or NULL if parent is main */
64049 ** Page pParent is an internal (non-leaf) tree page. This function
64051 ** cell in page pParent. Or, if iIdx is equal to the total number of
64052 ** cells in pParent, that page number iChild is the right-child of
64055 static void assertParentIndex(MemPage *pParent, int iIdx, Pgno iChild){
64058 assert( iIdx<=pParent->nCell );
64059 if( iIdx==pParent->nCell ){
64060 assert( get4byte(&pParent->aData[pParent->hdrOffset+8])==iChild );
64062 assert( get4byte(findCell(pParent, iIdx))==iChild );
66062 ** pParent is its parent. pPage must have a single overflow entry
66066 ** cell that will be inserted into pParent. Such a cell consists of a 4
66071 static int balance_quick(MemPage *pParent, MemPage *pPage, u8 *pSpace){
66078 assert( sqlite3PagerIswriteable(pParent->pDbPage) );
66114 ptrmapPut(pBt, pgnoNew, PTRMAP_BTREE, pParent->pgno, &rc);
66120 /* Create a divider cell to insert into pParent. The divider cell
66139 /* Insert the new divider cell into pParent. */
66141 insertCell(pParent, pParent->nCell, pSpace, (int)(pOut-pSpace),
66145 /* Set the right-child pointer of pParent to point to the new page. */
66146 put4byte(&pParent->aData[pParent->hdrOffset+8], pgnoNew);
66257 ** This routine redistributes cells on the iParentIdx'th child of pParent
66275 ** inserted into or removed from the parent page (pParent). Doing so
66286 ** page (pParent) the parent page becomes overfull, this buffer is
66297 MemPage *pParent, /* Parent page of siblings being balanced */
66298 int iParentIdx, /* Index of "the page" in pParent */
66300 int isRoot, /* True if pParent is a root-page */
66308 int nxDiv; /* Next divider slot in pParent->aCell[] */
66320 u8 *apDiv[NB-1]; /* Divider cells in pParent */
66335 pBt = pParent->pBt;
66337 assert( sqlite3PagerIswriteable(pParent->pDbPage) );
66340 TRACE(("BALANCE: begin page %d child of %d\n", pPage->pgno, pParent->pgno));
66343 /* At this point pParent may have at most one overflow cell. And if
66348 assert( pParent->nOverflow==0 || pParent->nOverflow==1 );
66349 assert( pParent->nOverflow==0 || pParent->aiOvfl[0]==iParentIdx );
66355 /* Find the sibling pages to balance. Also locate the cells in pParent
66358 ** if there are fewer than NN siblings on the other side. If pParent
66359 ** has NB or fewer children then all children of pParent are taken.
66366 i = pParent->nOverflow + pParent->nCell;
66381 if( (i+nxDiv-pParent->nOverflow)==pParent->nCell ){
66382 pRight = &pParent->aData[pParent->hdrOffset+8];
66384 pRight = findCell(pParent, i+nxDiv-pParent->nOverflow);
66396 if( pParent->nOverflow && i+nxDiv==pParent->aiOvfl[0] ){
66397 apDiv[i] = pParent->apOvfl[0];
66399 szNew[i] = pParent->xCellSize(pParent, apDiv[i]);
66400 pParent->nOverflow = 0;
66402 apDiv[i] = findCell(pParent, i+nxDiv-pParent->nOverflow);
66404 szNew[i] = pParent->xCellSize(pParent, apDiv[i]);
66421 iOff = SQLITE_PTR_TO_INT(apDiv[i]) - SQLITE_PTR_TO_INT(pParent->aData);
66428 apDiv[i] = &aOvflSpace[apDiv[i]-pParent->aData];
66431 dropCell(pParent, i+nxDiv-pParent->nOverflow, szNew[i], &rc);
66463 ** been removed from pParent.
66473 ** leafData: 1 if pPage holds key+data and pParent holds only keys.
66686 assert( cntNew[0]>0 || (pParent->pgno==1 && pParent->nCell==0) || CORRUPT_DB);
66716 ptrmapPut(pBt, pNew->pgno, PTRMAP_BTREE, pParent->pgno, &rc);
66782 assert( sqlite3PagerIswriteable(pParent->pDbPage) );
66850 /* Insert new divider cells into pParent. */
66892 sz = pParent->xCellSize(pParent, pCell);
66898 insertCell(pParent, nxDiv+i, pCell, sz, pTemp, pNew->pgno, &rc);
66900 assert( sqlite3PagerIswriteable(pParent->pDbPage) );
66968 if( isRoot && pParent->nCell==0 && pParent->hdrOffset<=apNew[0]->nFree ){
66991 copyNodeContent(apNew[0], pParent, &rc);
67003 assert( pParent->isInit );
67020 ptrmapCheckPages(&pParent, 1);
67151 MemPage * const pParent = pCur->apPage[iPage-1];
67154 rc = sqlite3PagerWrite(pParent->pDbPage);
67160 && pParent->pgno!=1
67161 && pParent->nCell==iIdx
67165 ** into pParent, which may cause pParent overflow. If this
67166 ** happens, the next iteration of the do-loop will balance pParent
67178 rc = balance_quick(pParent, pPage, aBalanceQuickSpace);
67184 ** modifying the contents of pParent, which may cause pParent to
67200 rc = balance_nonroot(pParent, iIdx, pSpace, iPage==1,
70249 pFrame->pParent = pFrame->v->pDelFrame;
73704 for(pFrame=p->pFrame; pFrame->pParent; pFrame=pFrame->pParent);
73716 p->pDelFrame = pDel->pParent;
79413 p->pFrame = pFrame->pParent;
82803 for(pFrame=p->pFrame; pFrame->pParent; pFrame=pFrame->pParent);
84387 for(pFrame=p->pFrame; pFrame && pFrame->token!=t; pFrame=pFrame->pParent);
84451 pFrame->pParent = p->pFrame;
84559 for(pFrame=p->pFrame; pFrame->pParent; pFrame=pFrame->pParent);
90550 Expr *pParent = pItem->pExpr;
90551 assert( pParent->op==TK_COLLATE );
90552 while( pParent->pLeft->op==TK_COLLATE ) pParent = pParent->pLeft;
90553 assert( pParent->pLeft==pE );
90554 pParent->pLeft = pNew;
107745 ** Given that pParent is the parent table for foreign key constraint pFKey,
107784 Table *pParent, /* Parent table of FK constraint pFKey */
107800 ** maps to the INTEGER PRIMARY KEY of table pParent. If so, leave *ppIdx
107811 ** mapped to the primary key of table pParent, or
107815 if( pParent->iPKey>=0 ){
107817 if( !sqlite3StrICmp(pParent->aCol[pParent->iPKey].zName, zKey) ) return 0;
107826 for(pIdx=pParent->pIndex; pIdx; pIdx=pIdx->pNext){
107834 ** the PRIMARY KEY of table pParent. The PRIMARY KEY index may be
107845 ** map to an explicit list of columns in table pParent. Check if this
107859 zDfltColl = pParent->aCol[iCol].zColl;
107863 zIdxCol = pParent->aCol[iCol].zName;
114682 Table *pParent; /* Parent table that child points to */
114715 pParent = sqlite3FindTable(db, pFK->zTo, zDb);
114716 if( pParent==0 ) continue;
114718 sqlite3TableLock(pParse, iDb, pParent->tnum, 0, pParent->zName);
114719 x = sqlite3FkLocateIndex(pParse, pParent, pFK, &pIdx, 0);
114722 sqlite3OpenTable(pParse, i, iDb, pParent, OP_OpenRead);
114737 pParent = sqlite3FindTable(db, pFK->zTo, zDb);
114740 if( pParent ){
114741 x = sqlite3FkLocateIndex(pParse, pParent, pFK, &pIdx, &aiCols);
114763 }else if( pParent ){
120094 Select *pParent; /* Current UNION ALL term of the other query */
120358 for(pParent=p; pParent; pParent=pParent->pPrior, pSub=pSub->pPrior){
120363 pSrc = pParent->pSrc; /* FROM clause of the outer query */
120366 assert( pParent==p ); /* First time through the loop */
120369 assert( pParent!=p ); /* 2nd and subsequent times through the loop */
120370 pSrc = pParent->pSrc = sqlite3SrcListAppend(db, 0, 0, 0);
120393 pParent->pSrc = pSrc = sqlite3SrcListEnlarge(db, pSrc, nSubSrc-1,iFrom+1);
120427 ** do not necessarily correspond to columns in SELECT statement pParent,
120431 ** function attempts to flatten a compound sub-query into pParent
120438 assert( pParent->pOrderBy==0 );
120440 pParent->pOrderBy = pOrderBy;
120448 assert( pParent->pHaving==0 );
120449 pParent->pHaving = pParent->pWhere;
120450 pParent->pWhere = pWhere;
120451 pParent->pHaving = sqlite3ExprAnd(db,
120452 sqlite3ExprDup(db, pSub->pHaving, 0), pParent->pHaving
120454 assert( pParent->pGroupBy==0 );
120455 pParent->pGroupBy = sqlite3ExprListDup(db, pSub->pGroupBy, 0);
120457 pParent->pWhere = sqlite3ExprAnd(db, pWhere, pParent->pWhere);
120466 substSelect(&x, pParent, 0);
120472 pParent->selFlags |= pSub->selFlags & SF_Distinct;
120481 pParent->pLimit = pSub->pLimit;
146050 Fts3Expr *pParent; /* pParent->pLeft==this or pParent->pRight==this */
151255 && (pExpr->pParent==0 || pExpr->pParent->eType!=FTSQUERY_NEAR)
151275 for(p=p->pParent;res && p && p->eType==FTSQUERY_NEAR; p=p->pParent){
151286 assert( p->pParent && p->pParent->pLeft==p );
151287 nNear = p->pParent->nNear;
151345 && (pExpr->pParent==0 || pExpr->pParent->eType!=FTSQUERY_NEAR)
151598 while( pRoot->pParent && pRoot->pParent->eType==FTSQUERY_NEAR ){
151599 pRoot = pRoot->pParent;
151700 if( pExpr->bDeferred && pExpr->pParent->eType!=FTSQUERY_NEAR ){
151776 for(p=pExpr->pParent; p; p=p->pParent){
153055 while( pSplit->pParent && opPrecedence(pSplit->pParent)<=opPrecedence(pNew) ){
153056 pSplit = pSplit->pParent;
153059 if( pSplit->pParent ){
153060 assert( pSplit->pParent->pRight==pSplit );
153061 pSplit->pParent->pRight = pNew;
153062 pNew->pParent = pSplit->pParent;
153067 pSplit->pParent = pNew;
153116 p->pParent = pNot;
153119 pNotBranch->pParent = pNot;
153175 p->pParent = pPrev;
153208 pRet->pParent = pIter;
153258 Fts3Expr *pFree = 0; /* List of free nodes. Linked by pParent. */
153281 assert( p->pParent==0 || p->pParent->pLeft==p );
153288 Fts3Expr *pParent = p->pParent; /* Current parent of p */
153290 assert( pParent==0 || pParent->pLeft==p );
153291 pParent = 0;
153292 if( pParent ){
153293 pParent->pLeft = 0;
153308 pFree->pLeft->pParent = pFree;
153309 pFree->pRight->pParent = pFree;
153312 pFree = pFree->pParent;
153313 p->pParent = 0;
153324 if( pParent==0 ) break;
153327 for(p=pParent->pRight; p->eType==eType; p=p->pLeft);
153329 /* Remove pParent from the original tree. */
153330 assert( pParent->pParent==0 || pParent->pParent->pLeft==pParent );
153331 pParent->pRight->pParent = pParent->pParent;
153332 if( pParent->pParent ){
153333 pParent->pParent->pLeft = pParent->pRight;
153335 assert( pParent==pRoot );
153336 pRoot = pParent->pRight;
153339 /* Link pParent into the free node list. It will be used as an
153341 pParent->pParent = pFree;
153342 pFree = pParent;
153351 p->pParent = 0;
153356 pFree->pLeft->pParent = pFree;
153357 pFree->pRight->pParent = pFree;
153360 pFree = pFree->pParent;
153361 p->pParent = 0;
153375 pFree = pDel->pParent;
153389 pLeft->pParent = 0;
153390 pRight->pParent = 0;
153403 pLeft->pParent = pRoot;
153405 pRight->pParent = pRoot;
153552 assert( pDel==0 || pDel->pParent==0 );
153554 assert( p->pParent==0 || p==p->pParent->pRight || p==p->pParent->pLeft );
153557 Fts3Expr *pParent = p->pParent;
153559 if( pParent && p==pParent->pLeft && pParent->pRight ){
153560 p = pParent->pRight;
153562 assert( p==p->pParent->pRight || p==p->pParent->pLeft );
153566 p = pParent;
156263 SegmentNode *pParent; /* Parent node (or NULL for root node) */
158127 SegmentNode *pParent = pTree->pParent;
158128 rc = fts3NodeAddTerm(p, &pParent, isCopyTerm, zTerm, nTerm);
158129 if( pTree->pParent==0 ){
158130 pTree->pParent = pParent;
158134 pNew->pParent = pParent;
158188 if( !pTree->pParent ){
158209 p, pTree->pParent, iHeight+1, iFree, iNextFree, piLast, paRoot, pnRoot
158223 fts3NodeFree(p->pParent);
164502 RtreeNode *pParent; /* Parent node */
164795 static RtreeNode *nodeNew(Rtree *pRtree, RtreeNode *pParent){
164802 pNode->pParent = pParent;
164804 nodeReference(pParent);
164826 RtreeNode *pParent, /* Either the parent node or NULL */
164836 assert( !pParent || !pNode->pParent || pNode->pParent==pParent );
164837 if( pParent && !pNode->pParent ){
164838 nodeReference(pParent);
164839 pNode->pParent = pParent;
164874 pNode->pParent = pParent;
164882 nodeReference(pParent);
165018 if( pNode->pParent ){
165019 rc = nodeRelease(pRtree, pNode->pParent);
165469 RtreeNode *pParent = pNode->pParent;
165470 if( pParent ){
165471 return nodeRowidIndex(pRtree, pParent, pNode->iNode, piIndex);
165565 RtreeSearchPoint *pParent;
165567 pParent = pCur->aPoint + j;
165568 if( rtreeSearchPointCompare(pNew, pParent)>=0 ) break;
165571 pNew = pParent;
166312 while( p->pParent ){
166313 RtreeNode *pParent = p->pParent;
166321 nodeGetCell(pRtree, pParent, iCell, &cell);
166324 nodeOverwriteCell(pRtree, pParent, &cell, iCell);
166327 p = pParent;
166606 nodeRelease(pRtree, pChild->pParent);
166608 pChild->pParent = pNode;
166659 pRight = nodeNew(pRtree, pLeft->pParent);
166692 rc = rtreeInsertCell(pRtree, pLeft->pParent, &leftbbox, iHeight+1);
166697 RtreeNode *pParent = pLeft->pParent;
166701 nodeOverwriteCell(pRtree, pParent, &leftbbox, iCell);
166702 rc = AdjustTree(pRtree, pParent, &leftbbox);
166708 if( (rc = rtreeInsertCell(pRtree, pRight->pParent, &rightbbox, iHeight+1)) ){
166751 ** If node pLeaf is not the root of the r-tree and its pParent pointer is
166753 ** the pLeaf->pParent chain all the way up to the root node.
166764 while( rc==SQLITE_OK && pChild->iNode!=1 && pChild->pParent==0 ){
166772 /* Before setting pChild->pParent, test that we are not creating a
166773 ** loop of references (as we would if, say, pChild==pParent). We don't
166778 for(pTest=pLeaf; pTest && pTest->iNode!=iNode; pTest=pTest->pParent);
166780 rc2 = nodeAcquire(pRtree, iNode, 0, &pChild->pParent);
166785 if( rc==SQLITE_OK && !pChild->pParent ) rc = SQLITE_CORRUPT_VTAB;
166786 pChild = pChild->pParent;
166796 RtreeNode *pParent = 0;
166804 pParent = pNode->pParent;
166805 pNode->pParent = 0;
166806 rc = deleteCell(pRtree, pParent, iCell, iHeight+1);
166808 rc2 = nodeRelease(pRtree, pParent);
166843 RtreeNode *pParent = pNode->pParent;
166845 if( pParent ){
166858 nodeOverwriteCell(pRtree, pParent, &box, ii);
166859 rc = fixBoundingBox(pRtree, pParent);
166870 RtreeNode *pParent;
166887 pParent = pNode->pParent;
166888 assert( pParent || pNode->iNode==1 );
166889 if( pParent ){
167015 nodeRelease(pRtree, pChild->pParent);
167017 pChild->pParent = pNode;
174168 sqlite3_vfs *pParent; /* Parent VFS */
174170 pParent = sqlite3_vfs_find(zParent);
174171 if( pParent==0 ){
174176 pNew->base.mxPathname = pParent->mxPathname;
174177 pNew->base.szOsFile = sizeof(rbu_file) + pParent->szOsFile;
174178 pNew->pRealVfs = pParent;
