Searched refs:eSkip (Results 1 – 2 of 2) sorted by relevance
106 u8 eSkip; /* Determines if next step operation is a no-op */ member903 pCur->eSkip = SKIP_NONE; in memRbtreeMoveto()965 pCur->eSkip = SKIP_NONE; in memRbtreeDelete()979 pCur->eSkip = SKIP_NEXT; in memRbtreeDelete()982 pCur->eSkip = SKIP_NONE; in memRbtreeDelete()984 pCur->eSkip = SKIP_NEXT; in memRbtreeDelete()988 pCur->eSkip = SKIP_PREV; in memRbtreeDelete()1087 pCur->eSkip = SKIP_NONE; in memRbtreeFirst()1104 pCur->eSkip = SKIP_NONE; in memRbtreeLast()1116 if( pCur->pNode && pCur->eSkip != SKIP_NEXT ){ in memRbtreeNext()[all …]
379 u8 eSkip; /* Determines if next step operation is a no-op */ member1075 pCur->eSkip = SKIP_INVALID; in fileBtreeCursor()1544 pCur->eSkip = SKIP_NONE; in fileBtreeFirst()1564 pCur->eSkip = SKIP_NONE; in fileBtreeLast()1595 pCur->eSkip = SKIP_NONE; in fileBtreeMoveto()1654 assert( pCur->eSkip!=SKIP_INVALID ); in fileBtreeNext()1660 if( pCur->eSkip==SKIP_NEXT ){ in fileBtreeNext()1661 pCur->eSkip = SKIP_NONE; in fileBtreeNext()1665 pCur->eSkip = SKIP_NONE; in fileBtreeNext()1710 assert( pCur->eSkip!=SKIP_INVALID ); in fileBtreePrevious()[all …]