Lines Matching refs:m_pHashTree
460 : m_pHashTree(0, true, PARTSIZE)
478 if (m_pHashTree.m_nDataSize <= EMBLOCKSIZE) {
493 m_pHashTree.FindHash(nPartStartPos, nPartSize,&nLevel);
503 if (m_pHashTree.CreatePartRecoveryData(nPartStartPos, nPartSize, fileDataOut, 0, bUse32BitIdentifier)) {
548 m_pHashTree.FindHash(nPartStartPos, nPartSize,&nLevel);
563 || !m_pHashTree.SetHash(fileDataIn, wHashIdent,(-1), false))
588 || !m_pHashTree.SetHash(fileDataIn, wHashIdent,(-1), false))
606 CAICHHashTree* phtToCheck = m_pHashTree.FindHash(nPartStartPos+nPartPos, min<uint64>(EMBLOCKSIZE, nPartSize-nPartPos));
632 if ( !m_pHashTree.m_bHashValid || m_pHashTree.m_nDataSize != m_pOwner->GetFileSize()) {
667 if (m_pHashTree.m_Hash == CurrentHash) {
681 m_pHashTree.m_Hash.Write(&file);
682 uint32 nHashCount = (PARTSIZE/EMBLOCKSIZE + ((PARTSIZE % EMBLOCKSIZE != 0)? 1 : 0)) * (m_pHashTree.m_nDataSize/PARTSIZE);
683 if (m_pHashTree.m_nDataSize % PARTSIZE != 0) {
684 nHashCount += (m_pHashTree.m_nDataSize % PARTSIZE)/EMBLOCKSIZE + (((m_pHashTree.m_nDataSize % PARTSIZE) % EMBLOCKSIZE != 0)? 1 : 0);
687 if (!m_pHashTree.WriteLowestLevelHashs(&file, 0, true, true)) {
716 if ( !m_pHashTree.m_bHashValid || m_pHashTree.m_nDataSize != m_pOwner->GetFileSize() || m_pHashTree.m_nDataSize == 0) {
742 if (m_pHashTree.m_Hash == CurrentHash) {
744 uint32 nExpectedCount = (PARTSIZE/EMBLOCKSIZE + ((PARTSIZE % EMBLOCKSIZE != 0)? 1 : 0)) * (m_pHashTree.m_nDataSize/PARTSIZE);
745 if (m_pHashTree.m_nDataSize % PARTSIZE != 0) {
746 nExpectedCount += (m_pHashTree.m_nDataSize % PARTSIZE)/EMBLOCKSIZE + (((m_pHashTree.m_nDataSize % PARTSIZE) % EMBLOCKSIZE != 0)? 1 : 0);
753 if (!m_pHashTree.LoadLowestLevelHashs(&file)) {
761 if (CurrentHash != m_pHashTree.m_Hash) {
786 if (m_pHashTree.m_pLeftTree) {
787 delete m_pHashTree.m_pLeftTree;
788 m_pHashTree.m_pLeftTree = NULL;
790 if (m_pHashTree.m_pRightTree) {
791 delete m_pHashTree.m_pRightTree;
792 m_pHashTree.m_pRightTree = NULL;
798 m_pHashTree.m_Hash = Hash;
799 m_pHashTree.m_bHashValid = true;
811 bool bResult = m_pHashTree.ReCalculateHash(hashalg, bDontReplace);
819 bool bResult = m_pHashTree.VerifyHashTree(hashalg, bDeleteBadTrees);
827 m_pHashTree.m_nDataSize = nSize;
828 m_pHashTree.m_nBaseSize = (nSize <= PARTSIZE) ? EMBLOCKSIZE : PARTSIZE;
974 CAICHHashTree* phtToCheck = m_pHashTree.FindHash(nPartStartPos+nPartPos, min<uint64>(EMBLOCKSIZE, nPartSize-nPartPos));
1005 #define TESTSIZE m_pHashTree.m_nDataSize
1006 if (m_pHashTree.m_nDataSize <= EMBLOCKSIZE) {
1027 VERIFY( m_pHashTree.FindHash(i+j, EMBLOCKSIZE, &curLevel) );
1028 //TRACE(wxT("%u - %s\r\n"), cHash, m_pHashTree.FindHash(i+j, EMBLOCKSIZE, &curLevel)->m_Hash.GetString());
1033 VERIFY( m_pHashTree.FindHash(i+j, 9728000-j, &curLevel) );
1034 //TRACE(wxT("%u - %s\r\n"), cHash, m_pHashTree.FindHash(i+j, 9728000-j, &curLevel)->m_Hash.GetString());
1046 VERIFY( m_pHashTree.FindHash(i+j, EMBLOCKSIZE, &curLevel) );
1047 //TRACE(wxT("%u - %s\r\n"), cHash,m_pHashTree.FindHash(i+j, EMBLOCKSIZE, &curLevel)->m_Hash.GetString());
1052 //VERIFY( m_pHashTree.FindHash(i+j, (TESTSIZE-i)-j, &curLevel) );
1053 //TRACE(wxT("%u - %s\r\n"), cHash,m_pHashTree.FindHash(i+j, (TESTSIZE-i)-j, &curLevel)->m_Hash.GetString());