vfs_concat.cpp 5.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192
  1. // SPDX-FileCopyrightText: Copyright 2018 yuzu Emulator Project
  2. // SPDX-License-Identifier: GPL-2.0-or-later
  3. #include <algorithm>
  4. #include <utility>
  5. #include "common/assert.h"
  6. #include "core/file_sys/vfs_concat.h"
  7. #include "core/file_sys/vfs_static.h"
  8. namespace FileSys {
  9. ConcatenatedVfsFile::ConcatenatedVfsFile(std::string&& name_, ConcatenationMap&& concatenation_map_)
  10. : concatenation_map(std::move(concatenation_map_)), name(std::move(name_)) {
  11. DEBUG_ASSERT(this->VerifyContinuity());
  12. }
  13. bool ConcatenatedVfsFile::VerifyContinuity() const {
  14. u64 last_offset = 0;
  15. for (auto& entry : concatenation_map) {
  16. if (entry.offset != last_offset) {
  17. return false;
  18. }
  19. last_offset = entry.offset + entry.file->GetSize();
  20. }
  21. return true;
  22. }
  23. ConcatenatedVfsFile::~ConcatenatedVfsFile() = default;
  24. VirtualFile ConcatenatedVfsFile::MakeConcatenatedFile(std::string&& name,
  25. std::vector<VirtualFile>&& files) {
  26. // Fold trivial cases.
  27. if (files.empty()) {
  28. return nullptr;
  29. }
  30. if (files.size() == 1) {
  31. return files.front();
  32. }
  33. // Make the concatenation map from the input.
  34. std::vector<ConcatenationEntry> concatenation_map;
  35. concatenation_map.reserve(files.size());
  36. u64 last_offset = 0;
  37. for (auto& file : files) {
  38. const auto size = file->GetSize();
  39. concatenation_map.emplace_back(ConcatenationEntry{
  40. .offset = last_offset,
  41. .file = std::move(file),
  42. });
  43. last_offset += size;
  44. }
  45. return VirtualFile(new ConcatenatedVfsFile(std::move(name), std::move(concatenation_map)));
  46. }
  47. VirtualFile ConcatenatedVfsFile::MakeConcatenatedFile(u8 filler_byte, std::string&& name,
  48. std::multimap<u64, VirtualFile>&& files) {
  49. // Fold trivial cases.
  50. if (files.empty()) {
  51. return nullptr;
  52. }
  53. if (files.size() == 1) {
  54. return files.begin()->second;
  55. }
  56. // Make the concatenation map from the input.
  57. std::vector<ConcatenationEntry> concatenation_map;
  58. concatenation_map.reserve(files.size());
  59. u64 last_offset = 0;
  60. // Iteration of a multimap is ordered, so offset will be strictly non-decreasing.
  61. for (auto& [offset, file] : files) {
  62. const auto size = file->GetSize();
  63. if (offset > last_offset) {
  64. concatenation_map.emplace_back(ConcatenationEntry{
  65. .offset = last_offset,
  66. .file = std::make_shared<StaticVfsFile>(filler_byte, offset - last_offset),
  67. });
  68. }
  69. concatenation_map.emplace_back(ConcatenationEntry{
  70. .offset = offset,
  71. .file = std::move(file),
  72. });
  73. last_offset = offset + size;
  74. }
  75. return VirtualFile(new ConcatenatedVfsFile(std::move(name), std::move(concatenation_map)));
  76. }
  77. std::string ConcatenatedVfsFile::GetName() const {
  78. if (concatenation_map.empty()) {
  79. return "";
  80. }
  81. if (!name.empty()) {
  82. return name;
  83. }
  84. return concatenation_map.front().file->GetName();
  85. }
  86. std::size_t ConcatenatedVfsFile::GetSize() const {
  87. if (concatenation_map.empty()) {
  88. return 0;
  89. }
  90. return concatenation_map.back().offset + concatenation_map.back().file->GetSize();
  91. }
  92. bool ConcatenatedVfsFile::Resize(std::size_t new_size) {
  93. return false;
  94. }
  95. VirtualDir ConcatenatedVfsFile::GetContainingDirectory() const {
  96. if (concatenation_map.empty()) {
  97. return nullptr;
  98. }
  99. return concatenation_map.front().file->GetContainingDirectory();
  100. }
  101. bool ConcatenatedVfsFile::IsWritable() const {
  102. return false;
  103. }
  104. bool ConcatenatedVfsFile::IsReadable() const {
  105. return true;
  106. }
  107. std::size_t ConcatenatedVfsFile::Read(u8* data, std::size_t length, std::size_t offset) const {
  108. const ConcatenationEntry key{
  109. .offset = offset,
  110. .file = nullptr,
  111. };
  112. // Read nothing if the map is empty.
  113. if (concatenation_map.empty()) {
  114. return 0;
  115. }
  116. // Binary search to find the iterator to the first position we can check.
  117. // It must exist, since we are not empty and are comparing unsigned integers.
  118. auto it = std::prev(std::upper_bound(concatenation_map.begin(), concatenation_map.end(), key));
  119. u64 cur_length = length;
  120. u64 cur_offset = offset;
  121. while (cur_length > 0 && it != concatenation_map.end()) {
  122. // Check if we can read the file at this position.
  123. const auto& file = it->file;
  124. const u64 map_offset = it->offset;
  125. const u64 file_size = file->GetSize();
  126. if (cur_offset > map_offset + file_size) {
  127. // Entirely out of bounds read.
  128. break;
  129. }
  130. // Read the file at this position.
  131. const u64 file_seek = cur_offset - map_offset;
  132. const u64 intended_read_size = std::min<u64>(cur_length, file_size - file_seek);
  133. const u64 actual_read_size =
  134. file->Read(data + (cur_offset - offset), intended_read_size, file_seek);
  135. // Update tracking.
  136. cur_offset += actual_read_size;
  137. cur_length -= actual_read_size;
  138. it++;
  139. // If we encountered a short read, we're done.
  140. if (actual_read_size < intended_read_size) {
  141. break;
  142. }
  143. }
  144. return cur_offset - offset;
  145. }
  146. std::size_t ConcatenatedVfsFile::Write(const u8* data, std::size_t length, std::size_t offset) {
  147. return 0;
  148. }
  149. bool ConcatenatedVfsFile::Rename(std::string_view new_name) {
  150. return false;
  151. }
  152. } // namespace FileSys