Lines Matching refs:nStartPos
97 CAICHHashTree* CAICHHashTree::FindHash(uint64 nStartPos, uint64 nSize, uint8* nLevel)
102 wxCHECK(nStartPos + nSize <= m_nDataSize, NULL);
105 if (nStartPos == 0 && nSize == m_nDataSize) {
116 if (nStartPos < nLeft) {
117 if (nStartPos + nSize > nLeft) { // sanity
128 return m_pLeftTree->FindHash(nStartPos, nSize, nLevel);
130 nStartPos -= nLeft;
131 if (nStartPos + nSize > nRight) { // sanity
142 return m_pRightTree->FindHash(nStartPos, nSize, nLevel);
250 void CAICHHashTree::SetBlockHash(uint64 nSize, uint64 nStartPos, CAICHHashAlgo* pHashAlg)
253 CAICHHashTree* pToInsert = FindHash(nStartPos, nSize);
272 bool CAICHHashTree::CreatePartRecoveryData(uint64 nStartPos, uint64 nSize, CFileDataIO* fileDataOut, uint32 wHashIdent, bool b32BitIdent)
274 wxCHECK(nStartPos + nSize <= m_nDataSize, false);
277 if (nStartPos == 0 && nSize == m_nDataSize) {
296 if (nStartPos < nLeft) {
297 if (nStartPos + nSize > nLeft || !m_pRightTree->m_bHashValid) { // sanity
302 return m_pLeftTree->CreatePartRecoveryData(nStartPos, nSize, fileDataOut, wHashIdent, b32BitIdent);
304 nStartPos -= nLeft;
305 if (nStartPos + nSize > nRight || !m_pLeftTree->m_bHashValid) { // sanity
310 return m_pRightTree->CreatePartRecoveryData(nStartPos, nSize, fileDataOut, wHashIdent, b32BitIdent);