Lines Matching refs:pCursor
884 ** Cursor pCursor currently points to a cell in a non-leaf page.
886 ** (excluded) by the constraints in the pCursor->aConstraint[]
892 static int testRtreeCell(Rtree *pRtree, RtreeCursor *pCursor, int *pbEof){
898 nodeGetCell(pRtree, pCursor->pNode, pCursor->iCell, &cell);
899 for(ii=0; bRes==0 && ii<pCursor->nConstraint; ii++){
900 RtreeConstraint *p = &pCursor->aConstraint[ii];
935 ** Test if the cell that cursor pCursor currently points to
937 ** pCursor->aConstraint[] array. If so, set *pbEof to true before
946 static int testRtreeEntry(Rtree *pRtree, RtreeCursor *pCursor, int *pbEof){
951 nodeGetCell(pRtree, pCursor->pNode, pCursor->iCell, &cell);
952 for(ii=0; ii<pCursor->nConstraint; ii++){
953 RtreeConstraint *p = &pCursor->aConstraint[ii];
986 ** Cursor pCursor currently points at a node that heads a sub-tree of
993 RtreeCursor *pCursor,
1003 RtreeNode *pSavedNode = pCursor->pNode;
1004 int iSavedCell = pCursor->iCell;
1009 rc = testRtreeEntry(pRtree, pCursor, &isEof);
1011 rc = testRtreeCell(pRtree, pCursor, &isEof);
1017 iRowid = nodeGetRowid(pRtree, pCursor->pNode, pCursor->iCell);
1018 rc = nodeAcquire(pRtree, iRowid, pCursor->pNode, &pChild);
1023 nodeRelease(pRtree, pCursor->pNode);
1024 pCursor->pNode = pChild;
1027 pCursor->iCell = ii;
1028 rc = descendToCell(pRtree, pCursor, iHeight-1, &isEof);
1035 assert( pCursor->pNode==pChild );
1038 pCursor->pNode = pSavedNode;
1039 pCursor->iCell = iSavedCell;