Lines Matching refs:linesLeft
834 int linesLeft;
837 linesLeft = line;
849 nodePtr->numLines <= linesLeft;
854 linesLeft -= nodePtr->numLines;
862 for (linePtr = nodePtr->children.linePtr; linesLeft > 0;
867 linesLeft -= 1;
1695 searchPtr->linesLeft = 0;
1718 searchPtr->linesLeft = TkBTreeLineIndex(index2Ptr->linePtr) + 1
1721 if (searchPtr->linesLeft == 1) {
1732 searchPtr->linesLeft = 0;
1794 searchPtr->linesLeft = 0;
1830 searchPtr->linesLeft = TkBTreeLineIndex(index1Ptr->linePtr) + 1
1833 if (searchPtr->linesLeft == 1) {
1841 searchPtr->linesLeft = 0;
1882 if (searchPtr->linesLeft <= 0) {
1922 searchPtr->linesLeft--;
1923 if (searchPtr->linesLeft <= 0) {
1938 * its subtree. Be sure to update linesLeft as we skip over large
1958 searchPtr->linesLeft -= nodePtr->numLines;
1978 searchPtr->linesLeft -= nodePtr->numLines;
1996 if (searchPtr->linesLeft <= 0) {
2003 searchPtr->linesLeft = 0;
2049 if (searchPtr->linesLeft <= 0) {
2090 if (searchPtr->linesLeft == 1 && !pastLast) {
2103 searchPtr->linesLeft--;
2104 if (searchPtr->linesLeft <= 0) {
2159 searchPtr->linesLeft -= linesSkipped;
2197 searchPtr->linesLeft -= linesSkipped;
2215 if (searchPtr->linesLeft <= 0) {
2222 searchPtr->linesLeft = 0;