Searched refs:eSkip (Results 1 – 2 of 2) sorted by relevance
103 u8 eSkip; /* Determines if next step operation is a no-op */ member900 pCur->eSkip = SKIP_NONE; in memRbtreeMoveto()962 pCur->eSkip = SKIP_NONE; in memRbtreeDelete()976 pCur->eSkip = SKIP_NEXT; in memRbtreeDelete()979 pCur->eSkip = SKIP_NONE; in memRbtreeDelete()981 pCur->eSkip = SKIP_NEXT; in memRbtreeDelete()985 pCur->eSkip = SKIP_PREV; in memRbtreeDelete()1084 pCur->eSkip = SKIP_NONE; in memRbtreeFirst()1101 pCur->eSkip = SKIP_NONE; in memRbtreeLast()1113 if( pCur->pNode && pCur->eSkip != SKIP_NEXT ){ in memRbtreeNext()[all …]
377 u8 eSkip; /* Determines if next step operation is a no-op */ member1073 pCur->eSkip = SKIP_INVALID; in fileBtreeCursor()1542 pCur->eSkip = SKIP_NONE; in fileBtreeFirst()1562 pCur->eSkip = SKIP_NONE; in fileBtreeLast()1593 pCur->eSkip = SKIP_NONE; in fileBtreeMoveto()1652 assert( pCur->eSkip!=SKIP_INVALID ); in fileBtreeNext()1658 if( pCur->eSkip==SKIP_NEXT ){ in fileBtreeNext()1659 pCur->eSkip = SKIP_NONE; in fileBtreeNext()1663 pCur->eSkip = SKIP_NONE; in fileBtreeNext()1708 assert( pCur->eSkip!=SKIP_INVALID ); in fileBtreePrevious()[all …]