UpdatePair.cpp 5.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166
  1. // UpdatePair.cpp
  2. #include "StdAfx.h"
  3. #include <time.h>
  4. #include "Common/Defs.h"
  5. #include "Common/Wildcard.h"
  6. #include "Windows/Time.h"
  7. #include "UpdatePair.h"
  8. #include "SortUtils.h"
  9. using namespace NWindows;
  10. using namespace NTime;
  11. static int MyCompareTime(NFileTimeType::EEnum fileTimeType,
  12. const FILETIME &time1, const FILETIME &time2)
  13. {
  14. switch(fileTimeType)
  15. {
  16. case NFileTimeType::kWindows:
  17. return ::CompareFileTime(&time1, &time2);
  18. case NFileTimeType::kUnix:
  19. {
  20. UInt32 unixTime1, unixTime2;
  21. if (!FileTimeToUnixTime(time1, unixTime1))
  22. {
  23. unixTime1 = 0;
  24. // throw 4191614;
  25. }
  26. if (!FileTimeToUnixTime(time2, unixTime2))
  27. {
  28. unixTime2 = 0;
  29. // throw 4191615;
  30. }
  31. return MyCompare(unixTime1, unixTime2);
  32. }
  33. case NFileTimeType::kDOS:
  34. {
  35. UInt32 dosTime1, dosTime2;
  36. FileTimeToDosTime(time1, dosTime1);
  37. FileTimeToDosTime(time2, dosTime2);
  38. /*
  39. if (!FileTimeToDosTime(time1, dosTime1))
  40. throw 4191616;
  41. if (!FileTimeToDosTime(time2, dosTime2))
  42. throw 4191617;
  43. */
  44. return MyCompare(dosTime1, dosTime2);
  45. }
  46. }
  47. throw 4191618;
  48. }
  49. static const wchar_t *kDuplicateFileNameMessage = L"Duplicate filename:";
  50. /*
  51. static const char *kNotCensoredCollisionMessaged = "Internal file name collision:\n";
  52. static const char *kSameTimeChangedSizeCollisionMessaged =
  53. "Collision between files with same date/time and different sizes:\n";
  54. */
  55. static void TestDuplicateString(const UStringVector &strings, const CIntVector &indices)
  56. {
  57. for(int i = 0; i + 1 < indices.Size(); i++)
  58. if (CompareFileNames(strings[indices[i]], strings[indices[i + 1]]) == 0)
  59. {
  60. UString message = kDuplicateFileNameMessage;
  61. message += L"\n";
  62. message += strings[indices[i]];
  63. message += L"\n";
  64. message += strings[indices[i + 1]];
  65. throw message;
  66. }
  67. }
  68. void GetUpdatePairInfoList(
  69. const CObjectVector<CDirItem> &dirItems,
  70. const CObjectVector<CArchiveItem> &archiveItems,
  71. NFileTimeType::EEnum fileTimeType,
  72. CObjectVector<CUpdatePair> &updatePairs)
  73. {
  74. CIntVector dirIndices, archiveIndices;
  75. UStringVector dirNames, archiveNames;
  76. int numDirItems = dirItems.Size();
  77. int i;
  78. for(i = 0; i < numDirItems; i++)
  79. dirNames.Add(dirItems[i].Name);
  80. SortFileNames(dirNames, dirIndices);
  81. TestDuplicateString(dirNames, dirIndices);
  82. int numArchiveItems = archiveItems.Size();
  83. for(i = 0; i < numArchiveItems; i++)
  84. archiveNames.Add(archiveItems[i].Name);
  85. SortFileNames(archiveNames, archiveIndices);
  86. TestDuplicateString(archiveNames, archiveIndices);
  87. int dirItemIndex = 0, archiveItemIndex = 0;
  88. CUpdatePair pair;
  89. while(dirItemIndex < numDirItems && archiveItemIndex < numArchiveItems)
  90. {
  91. int dirItemIndex2 = dirIndices[dirItemIndex],
  92. archiveItemIndex2 = archiveIndices[archiveItemIndex];
  93. const CDirItem &dirItem = dirItems[dirItemIndex2];
  94. const CArchiveItem &archiveItem = archiveItems[archiveItemIndex2];
  95. int compareResult = CompareFileNames(dirItem.Name, archiveItem.Name);
  96. if (compareResult < 0)
  97. {
  98. pair.State = NUpdateArchive::NPairState::kOnlyOnDisk;
  99. pair.DirItemIndex = dirItemIndex2;
  100. dirItemIndex++;
  101. }
  102. else if (compareResult > 0)
  103. {
  104. pair.State = archiveItem.Censored ?
  105. NUpdateArchive::NPairState::kOnlyInArchive: NUpdateArchive::NPairState::kNotMasked;
  106. pair.ArchiveItemIndex = archiveItemIndex2;
  107. archiveItemIndex++;
  108. }
  109. else
  110. {
  111. if (!archiveItem.Censored)
  112. throw 1082022;; // TTString(kNotCensoredCollisionMessaged + dirItem.Name);
  113. pair.DirItemIndex = dirItemIndex2;
  114. pair.ArchiveItemIndex = archiveItemIndex2;
  115. switch (MyCompareTime(fileTimeType, dirItem.LastWriteTime, archiveItem.LastWriteTime))
  116. {
  117. case -1:
  118. pair.State = NUpdateArchive::NPairState::kNewInArchive;
  119. break;
  120. case 1:
  121. pair.State = NUpdateArchive::NPairState::kOldInArchive;
  122. break;
  123. default:
  124. if (archiveItem.SizeIsDefined)
  125. if (dirItem.Size != archiveItem.Size)
  126. // throw 1082034; // kSameTimeChangedSizeCollisionMessaged;
  127. pair.State = NUpdateArchive::NPairState::kUnknowNewerFiles;
  128. else
  129. pair.State = NUpdateArchive::NPairState::kSameFiles;
  130. else
  131. pair.State = NUpdateArchive::NPairState::kUnknowNewerFiles;
  132. }
  133. dirItemIndex++;
  134. archiveItemIndex++;
  135. }
  136. updatePairs.Add(pair);
  137. }
  138. for(;dirItemIndex < numDirItems; dirItemIndex++)
  139. {
  140. pair.State = NUpdateArchive::NPairState::kOnlyOnDisk;
  141. pair.DirItemIndex = dirIndices[dirItemIndex];
  142. updatePairs.Add(pair);
  143. }
  144. for(;archiveItemIndex < numArchiveItems; archiveItemIndex++)
  145. {
  146. int archiveItemIndex2 = archiveIndices[archiveItemIndex];
  147. const CArchiveItem &archiveItem = archiveItems[archiveItemIndex2];
  148. pair.State = archiveItem.Censored ?
  149. NUpdateArchive::NPairState::kOnlyInArchive: NUpdateArchive::NPairState::kNotMasked;
  150. pair.ArchiveItemIndex = archiveItemIndex2;
  151. updatePairs.Add(pair);
  152. }
  153. }