Home | History | Annotate | Download | only in LZMA

Lines Matching refs:cur

501 	int Backward(int cur)

503 		_optimumEndIndex = cur;

504 		int posMem = _optimum[cur].PosPrev;

505 		int backMem = _optimum[cur].BackPrev;

508 			if (_optimum[cur].Prev1IsChar)

512 				if (_optimum[cur].Prev2)

515 					_optimum[posMem - 1].PosPrev = _optimum[cur].PosPrev2;

516 					_optimum[posMem - 1].BackPrev = _optimum[cur].BackPrev2;

526 			_optimum[posPrev].PosPrev = cur;

527 			cur = posPrev;

529 		while (cur > 0);

695 		int cur = 0;

699 			cur++;

700 			if (cur == lenEnd)

701 				return Backward(cur);

709 				return Backward(cur);

712 			int posPrev = _optimum[cur].PosPrev;

714 			if (_optimum[cur].Prev1IsChar)

717 				if (_optimum[cur].Prev2)

719 					state = _optimum[_optimum[cur].PosPrev2].State;

720 					if (_optimum[cur].BackPrev2 < Base.kNumRepDistances)

731 			if (posPrev == cur - 1)

733 				if (_optimum[cur].IsShortRep())

741 				if (_optimum[cur].Prev1IsChar && _optimum[cur].Prev2)

743 					posPrev = _optimum[cur].PosPrev2;

744 					pos = _optimum[cur].BackPrev2;

749 					pos = _optimum[cur].BackPrev;

795 			_optimum[cur].State = state;

796 			_optimum[cur].Backs0 = reps[0];

797 			_optimum[cur].Backs1 = reps[1];

798 			_optimum[cur].Backs2 = reps[2];

799 			_optimum[cur].Backs3 = reps[3];

800 			int curPrice = _optimum[cur].Price;

812 			Optimal nextOptimum = _optimum[cur + 1];

818 				nextOptimum.PosPrev = cur;

827 				!(nextOptimum.PosPrev < cur && nextOptimum.BackPrev == 0))

833 					nextOptimum.PosPrev = cur;

840 			numAvailableBytesFull = Math.min(kNumOpts - 1 - cur, numAvailableBytesFull);

861 						int offset = cur + 1 + lenTest2;

870 							optimum.PosPrev = cur + 1;

889 					while (lenEnd < cur + lenTest)

892 					Optimal optimum = _optimum[cur + lenTest];

896 						optimum.PosPrev = cur;

932 							while (lenEnd < cur + offset)

935 							Optimal optimum = _optimum[cur + offset];

939 								optimum.PosPrev = cur + lenTest + 1;

943 								optimum.PosPrev2 = cur;

961 				while (lenEnd < cur + newLen)

972 					Optimal optimum = _optimum[cur + lenTest];

976 						optimum.PosPrev = cur;

1005 								while (lenEnd < cur + offset)

1008 								optimum = _optimum[cur + offset];

1012 									optimum.PosPrev = cur + lenTest + 1;

1016 									optimum.PosPrev2 = cur;