Lines Matching refs:pParent
23291 VdbeFrame *pParent; /* Parent of this frame, or NULL if parent is main */ member
75961 static void assertParentIndex(MemPage *pParent, int iIdx, Pgno iChild){
75964 assert( iIdx<=pParent->nCell );
75965 if( iIdx==pParent->nCell ){
75966 assert( get4byte(&pParent->aData[pParent->hdrOffset+8])==iChild );
75968 assert( get4byte(findCell(pParent, iIdx))==iChild );
78444 static int balance_quick(MemPage *pParent, MemPage *pPage, u8 *pSpace){
78451 assert( sqlite3PagerIswriteable(pParent->pDbPage) );
78456 assert( pParent->nFree>=0 );
78498 ptrmapPut(pBt, pgnoNew, PTRMAP_BTREE, pParent->pgno, &rc);
78525 rc = insertCell(pParent, pParent->nCell, pSpace, (int)(pOut-pSpace),
78530 put4byte(&pParent->aData[pParent->hdrOffset+8], pgnoNew);
78682 MemPage *pParent, /* Parent page of siblings being balanced */
78717 pBt = pParent->pBt;
78719 assert( sqlite3PagerIswriteable(pParent->pDbPage) );
78726 assert( pParent->nOverflow==0 || pParent->nOverflow==1 );
78727 assert( pParent->nOverflow==0 || pParent->aiOvfl[0]==iParentIdx );
78732 assert( pParent->nFree>=0 );
78745 i = pParent->nOverflow + pParent->nCell;
78760 if( (i+nxDiv-pParent->nOverflow)==pParent->nCell ){
78761 pRight = &pParent->aData[pParent->hdrOffset+8];
78763 pRight = findCell(pParent, i+nxDiv-pParent->nOverflow);
78781 nMaxCells += apOld[i]->nCell + ArraySize(pParent->apOvfl);
78784 if( pParent->nOverflow && i+nxDiv==pParent->aiOvfl[0] ){
78785 apDiv[i] = pParent->apOvfl[0];
78787 szNew[i] = pParent->xCellSize(pParent, apDiv[i]);
78788 pParent->nOverflow = 0;
78790 apDiv[i] = findCell(pParent, i+nxDiv-pParent->nOverflow);
78792 szNew[i] = pParent->xCellSize(pParent, apDiv[i]);
78811 iOff = SQLITE_PTR_TO_INT(apDiv[i]) - SQLITE_PTR_TO_INT(pParent->aData);
78814 apDiv[i] = &aOvflSpace[apDiv[i]-pParent->aData];
78817 dropCell(pParent, i+nxDiv-pParent->nOverflow, szNew[i], &rc);
78984 b.apEnd[k] = pParent->aDataEnd;
79089 assert( cntNew[0]>0 || (pParent->pgno==1 && pParent->nCell==0) || CORRUPT_DB);
79124 ptrmapPut(pBt, pNew->pgno, PTRMAP_BTREE, pParent->pgno, &rc);
79187 assert( sqlite3PagerIswriteable(pParent->pDbPage) );
79301 sz = pParent->xCellSize(pParent, pCell);
79313 rc = insertCell(pParent, nxDiv+i, pCell, sz, pTemp, pNew->pgno);
79315 assert( sqlite3PagerIswriteable(pParent->pDbPage) );
79385 if( isRoot && pParent->nCell==0 && pParent->hdrOffset<=apNew[0]->nFree ){
79409 copyNodeContent(apNew[0], pParent, &rc);
79421 assert( pParent->isInit );
79438 ptrmapCheckPages(&pParent, 1);
79604 MemPage * const pParent = pCur->apPage[iPage-1];
79607 rc = sqlite3PagerWrite(pParent->pDbPage);
79608 if( rc==SQLITE_OK && pParent->nFree<0 ){
79609 rc = btreeComputeFreeSpace(pParent);
79616 && pParent->pgno!=1
79617 && pParent->nCell==iIdx
79634 rc = balance_quick(pParent, pPage, aBalanceQuickSpace);
79656 rc = balance_nonroot(pParent, iIdx, pSpace, iPage==1,
87064 pFrame->pParent = pFrame->v->pDelFrame;
87651 for(pFrame=p->pFrame; pFrame->pParent; pFrame=pFrame->pParent);
87661 p->pDelFrame = pDel->pParent;
92764 for(pFrame=p->pFrame; pFrame->pParent; pFrame=pFrame->pParent);
94376 p->pFrame = pFrame->pParent;
98676 for(pFrame=p->pFrame; pFrame->pParent; pFrame=pFrame->pParent);
100436 for(pFrame=p->pFrame; pFrame && pFrame->token!=t; pFrame=pFrame->pParent);
100503 pFrame->pParent = p->pFrame;
100618 for(pFrame=p->pFrame; pFrame->pParent; pFrame=pFrame->pParent);
108372 Expr *pParent = pItem->pExpr;
108373 assert( pParent->op==TK_COLLATE );
108374 while( pParent->pLeft->op==TK_COLLATE ) pParent = pParent->pLeft;
108375 assert( pParent->pLeft==pE );
108376 pParent->pLeft = pNew;
131593 Table *pParent, /* Parent table of FK constraint pFKey */
131624 if( pParent->iPKey>=0 ){
131626 if( !sqlite3StrICmp(pParent->aCol[pParent->iPKey].zCnName, zKey) ){
131637 for(pIdx=pParent->pIndex; pIdx; pIdx=pIdx->pNext){
131670 zDfltColl = sqlite3ColumnColl(&pParent->aCol[iCol]);
131674 zIdxCol = pParent->aCol[iCol].zCnName;
140254 Table *pParent; /* Parent table that child points to */
140288 pParent = sqlite3FindTable(db, pFK->zTo, zDb);
140289 if( pParent==0 ) continue;
140291 sqlite3TableLock(pParse, iDb, pParent->tnum, 0, pParent->zName);
140292 x = sqlite3FkLocateIndex(pParse, pParent, pFK, &pIdx, 0);
140295 sqlite3OpenTable(pParse, i, iDb, pParent, OP_OpenRead);
140311 pParent = sqlite3FindTable(db, pFK->zTo, zDb);
140314 if( pParent ){
140315 x = sqlite3FkLocateIndex(pParse, pParent, pFK, &pIdx, &aiCols);
140338 }else if( pParent ){
147225 Select *pParent; /* Current UNION ALL term of the other query */
147501 for(pParent=p; pParent; pParent=pParent->pPrior, pSub=pSub->pPrior){
147508 pSrc = pParent->pSrc; /* FROM clause of the outer query */
147510 if( pParent==p ){
147532 pParent->pSrc = pSrc;
147562 if( pSub->pOrderBy && (pParent->selFlags & SF_NoopOrderBy)==0 ){
147577 assert( pParent->pOrderBy==0 );
147578 pParent->pOrderBy = pOrderBy;
147587 if( pParent->pWhere ){
147588 pParent->pWhere = sqlite3PExpr(pParse, TK_AND, pWhere, pParent->pWhere);
147590 pParent->pWhere = pWhere;
147601 substSelect(&x, pParent, 0);
147606 pParent->selFlags |= pSub->selFlags & SF_Compound;
147616 pParent->pLimit = pSub->pLimit;
147623 recomputeColumnsUsed(pParent, &pSrc->a[i+iFrom]);
186240 Fts3Expr *pParent; /* pParent->pLeft==this or pParent->pRight==this */
191659 && (pExpr->pParent==0 || pExpr->pParent->eType!=FTSQUERY_NEAR)
191679 for(p=p->pParent;res && p && p->eType==FTSQUERY_NEAR; p=p->pParent){
191690 assert( p->pParent && p->pParent->pLeft==p );
191691 nNear = p->pParent->nNear;
191749 && (pExpr->pParent==0 || pExpr->pParent->eType!=FTSQUERY_NEAR)
192018 while( pRoot->pParent
192019 && (pRoot->pParent->eType==FTSQUERY_NEAR || pRoot->bDeferred)
192021 pRoot = pRoot->pParent;
192117 if( pExpr->bDeferred && pExpr->pParent->eType!=FTSQUERY_NEAR ){
192194 for(p=pExpr->pParent; p; p=p->pParent){
192202 assert( pRun->pParent );
192203 pRun = pRun->pParent;
193489 while( pSplit->pParent && opPrecedence(pSplit->pParent)<=opPrecedence(pNew) ){
193490 pSplit = pSplit->pParent;
193493 if( pSplit->pParent ){
193494 assert( pSplit->pParent->pRight==pSplit );
193495 pSplit->pParent->pRight = pNew;
193496 pNew->pParent = pSplit->pParent;
193501 pSplit->pParent = pNew;
193550 p->pParent = pNot;
193553 pNotBranch->pParent = pNot;
193609 p->pParent = pPrev;
193642 pRet->pParent = pIter;
193715 assert( p->pParent==0 || p->pParent->pLeft==p );
193722 Fts3Expr *pParent = p->pParent; /* Current parent of p */
193724 assert( pParent==0 || pParent->pLeft==p );
193725 p->pParent = 0;
193726 if( pParent ){
193727 pParent->pLeft = 0;
193742 pFree->pLeft->pParent = pFree;
193743 pFree->pRight->pParent = pFree;
193746 pFree = pFree->pParent;
193747 p->pParent = 0;
193758 if( pParent==0 ) break;
193761 for(p=pParent->pRight; p->eType==eType; p=p->pLeft);
193764 assert( pParent->pParent==0 || pParent->pParent->pLeft==pParent );
193765 pParent->pRight->pParent = pParent->pParent;
193766 if( pParent->pParent ){
193767 pParent->pParent->pLeft = pParent->pRight;
193769 assert( pParent==pRoot );
193770 pRoot = pParent->pRight;
193775 pParent->pParent = pFree;
193776 pFree = pParent;
193785 p->pParent = 0;
193790 pFree->pLeft->pParent = pFree;
193791 pFree->pRight->pParent = pFree;
193794 pFree = pFree->pParent;
193795 p->pParent = 0;
193809 pFree = pDel->pParent;
193823 pLeft->pParent = 0;
193824 pRight->pParent = 0;
193837 pLeft->pParent = pRoot;
193839 pRight->pParent = pRoot;
193986 assert( pDel==0 || pDel->pParent==0 );
193988 assert( p->pParent==0 || p==p->pParent->pRight || p==p->pParent->pLeft );
193991 Fts3Expr *pParent = p->pParent;
193993 if( pParent && p==pParent->pLeft && pParent->pRight ){
193994 p = pParent->pRight;
193996 assert( p==p->pParent->pRight || p==p->pParent->pLeft );
194000 p = pParent;
196689 SegmentNode *pParent; /* Parent node (or NULL for root node) */
198587 SegmentNode *pParent = pTree->pParent;
198588 rc = fts3NodeAddTerm(p, &pParent, isCopyTerm, zTerm, nTerm);
198589 if( pTree->pParent==0 ){
198590 pTree->pParent = pParent;
198594 pNew->pParent = pParent;
198648 if( !pTree->pParent ){
198669 p, pTree->pParent, iHeight+1, iFree, iNextFree, piLast, paRoot, pnRoot
198683 fts3NodeFree(p->pParent);
209817 JsonParent *pParent;
209828 pParent = &p->aParent[p->nParent];
209829 pParent->iHead = p->i;
209830 pParent->iValue = i;
209831 pParent->iEnd = i + n + sz;
209832 pParent->iKey = -1;
209833 pParent->nPath = (u32)p->path.nUsed;
209850 JsonParent *pParent = &p->aParent[p->nParent-1];
209851 u32 iVal = pParent->iValue;
210678 RtreeNode *pParent; /* Parent node */
210991 static RtreeNode *nodeNew(Rtree *pRtree, RtreeNode *pParent){
210999 pNode->pParent = pParent;
211001 nodeReference(pParent);
211021 RtreeNode *pParent, /* Either the parent node or NULL */
211031 if( pParent && ALWAYS(pParent!=pNode->pParent) ){
211068 pNode->pParent = pParent;
211107 nodeReference(pParent);
211223 if( pNode->pParent ){
211224 rc = nodeRelease(pRtree, pNode->pParent);
211704 RtreeNode *pParent = pNode->pParent;
211705 if( ALWAYS(pParent) ){
211706 return nodeRowidIndex(pRtree, pParent, pNode->iNode, piIndex);
211801 RtreeSearchPoint *pParent;
211803 pParent = pCur->aPoint + j;
211804 if( rtreeSearchPointCompare(pNew, pParent)>=0 ) break;
211807 pNew = pParent;
212619 while( p->pParent ){
212620 RtreeNode *pParent = p->pParent;
212635 nodeGetCell(pRtree, pParent, iCell, &cell);
212638 nodeOverwriteCell(pRtree, pParent, &cell, iCell);
212641 p = pParent;
212849 for(p=pNode; p; p=p->pParent){
212853 nodeRelease(pRtree, pChild->pParent);
212855 pChild->pParent = pNode;
212907 pRight = nodeNew(pRtree, pLeft->pParent);
212940 rc = rtreeInsertCell(pRtree, pLeft->pParent, &leftbbox, iHeight+1);
212945 RtreeNode *pParent = pLeft->pParent;
212949 nodeOverwriteCell(pRtree, pParent, &leftbbox, iCell);
212950 rc = AdjustTree(pRtree, pParent, &leftbbox);
212957 if( (rc = rtreeInsertCell(pRtree, pRight->pParent, &rightbbox, iHeight+1)) ){
213013 while( rc==SQLITE_OK && pChild->iNode!=1 && pChild->pParent==0 ){
213027 for(pTest=pLeaf; pTest && pTest->iNode!=iNode; pTest=pTest->pParent);
213029 rc2 = nodeAcquire(pRtree, iNode, 0, &pChild->pParent);
213034 if( rc==SQLITE_OK && !pChild->pParent ){
213038 pChild = pChild->pParent;
213048 RtreeNode *pParent = 0;
213056 pParent = pNode->pParent;
213057 pNode->pParent = 0;
213058 rc = deleteCell(pRtree, pParent, iCell, iHeight+1);
213061 rc2 = nodeRelease(pRtree, pParent);
213096 RtreeNode *pParent = pNode->pParent;
213098 if( pParent ){
213111 nodeOverwriteCell(pRtree, pParent, &box, ii);
213112 rc = fixBoundingBox(pRtree, pParent);
213123 RtreeNode *pParent;
213140 pParent = pNode->pParent;
213141 assert( pParent || pNode->iNode==1 );
213142 if( pParent ){
213167 nodeRelease(pRtree, pChild->pParent);
213169 pChild->pParent = pNode;
214324 u8 *pParent /* Pointer to parent coordinates */
214341 if( pParent ){
214342 readCoord(&pParent[4*2*i], &p1);
214343 readCoord(&pParent[4*(2*i + 1)], &p2);
223487 sqlite3_vfs *pParent; /* Parent VFS */
223489 pParent = sqlite3_vfs_find(zParent);
223490 if( pParent==0 ){
223495 pNew->base.mxPathname = pParent->mxPathname;
223496 pNew->base.szOsFile = sizeof(rbu_file) + pParent->szOsFile;
223497 pNew->pRealVfs = pParent;