file_access_pack.cpp 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505
  1. /*************************************************************************/
  2. /* file_access_pack.cpp */
  3. /*************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* https://godotengine.org */
  7. /*************************************************************************/
  8. /* Copyright (c) 2007-2019 Juan Linietsky, Ariel Manzur. */
  9. /* Copyright (c) 2014-2019 Godot Engine contributors (cf. AUTHORS.md) */
  10. /* */
  11. /* Permission is hereby granted, free of charge, to any person obtaining */
  12. /* a copy of this software and associated documentation files (the */
  13. /* "Software"), to deal in the Software without restriction, including */
  14. /* without limitation the rights to use, copy, modify, merge, publish, */
  15. /* distribute, sublicense, and/or sell copies of the Software, and to */
  16. /* permit persons to whom the Software is furnished to do so, subject to */
  17. /* the following conditions: */
  18. /* */
  19. /* The above copyright notice and this permission notice shall be */
  20. /* included in all copies or substantial portions of the Software. */
  21. /* */
  22. /* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
  23. /* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
  24. /* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*/
  25. /* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
  26. /* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
  27. /* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
  28. /* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
  29. /*************************************************************************/
  30. #include "file_access_pack.h"
  31. #include "core/version.h"
  32. #include <stdio.h>
  33. #define PACK_VERSION 1
  34. Error PackedData::add_pack(const String &p_path) {
  35. for (int i = 0; i < sources.size(); i++) {
  36. if (sources[i]->try_open_pack(p_path)) {
  37. return OK;
  38. };
  39. };
  40. return ERR_FILE_UNRECOGNIZED;
  41. };
  42. void PackedData::add_path(const String &pkg_path, const String &path, uint64_t ofs, uint64_t size, const uint8_t *p_md5, PackSource *p_src) {
  43. PathMD5 pmd5(path.md5_buffer());
  44. //printf("adding path %ls, %lli, %lli\n", path.c_str(), pmd5.a, pmd5.b);
  45. bool exists = files.has(pmd5);
  46. PackedFile pf;
  47. pf.pack = pkg_path;
  48. pf.offset = ofs;
  49. pf.size = size;
  50. for (int i = 0; i < 16; i++)
  51. pf.md5[i] = p_md5[i];
  52. pf.src = p_src;
  53. files[pmd5] = pf;
  54. if (!exists) {
  55. //search for dir
  56. String p = path.replace_first("res://", "");
  57. PackedDir *cd = root;
  58. if (p.find("/") != -1) { //in a subdir
  59. Vector<String> ds = p.get_base_dir().split("/");
  60. for (int j = 0; j < ds.size(); j++) {
  61. if (!cd->subdirs.has(ds[j])) {
  62. PackedDir *pd = memnew(PackedDir);
  63. pd->name = ds[j];
  64. pd->parent = cd;
  65. cd->subdirs[pd->name] = pd;
  66. cd = pd;
  67. } else {
  68. cd = cd->subdirs[ds[j]];
  69. }
  70. }
  71. }
  72. String filename = path.get_file();
  73. // Don't add as a file if the path points to a directory
  74. if (!filename.empty()) {
  75. cd->files.insert(filename);
  76. }
  77. }
  78. }
  79. void PackedData::add_pack_source(PackSource *p_source) {
  80. if (p_source != NULL) {
  81. sources.push_back(p_source);
  82. }
  83. };
  84. PackedData *PackedData::singleton = NULL;
  85. PackedData::PackedData() {
  86. singleton = this;
  87. root = memnew(PackedDir);
  88. root->parent = NULL;
  89. disabled = false;
  90. add_pack_source(memnew(PackedSourcePCK));
  91. }
  92. void PackedData::_free_packed_dirs(PackedDir *p_dir) {
  93. for (Map<String, PackedDir *>::Element *E = p_dir->subdirs.front(); E; E = E->next())
  94. _free_packed_dirs(E->get());
  95. memdelete(p_dir);
  96. }
  97. PackedData::~PackedData() {
  98. for (int i = 0; i < sources.size(); i++) {
  99. memdelete(sources[i]);
  100. }
  101. _free_packed_dirs(root);
  102. }
  103. //////////////////////////////////////////////////////////////////
  104. bool PackedSourcePCK::try_open_pack(const String &p_path) {
  105. FileAccess *f = FileAccess::open(p_path, FileAccess::READ);
  106. if (!f)
  107. return false;
  108. //printf("try open %ls!\n", p_path.c_str());
  109. uint32_t magic = f->get_32();
  110. if (magic != 0x43504447) {
  111. //maybe at the end.... self contained exe
  112. f->seek_end();
  113. f->seek(f->get_position() - 4);
  114. magic = f->get_32();
  115. if (magic != 0x43504447) {
  116. memdelete(f);
  117. return false;
  118. }
  119. f->seek(f->get_position() - 12);
  120. uint64_t ds = f->get_64();
  121. f->seek(f->get_position() - ds - 8);
  122. magic = f->get_32();
  123. if (magic != 0x43504447) {
  124. memdelete(f);
  125. return false;
  126. }
  127. }
  128. uint32_t version = f->get_32();
  129. uint32_t ver_major = f->get_32();
  130. uint32_t ver_minor = f->get_32();
  131. f->get_32(); // ver_rev
  132. ERR_FAIL_COND_V_MSG(version != PACK_VERSION, false, "Pack version unsupported: " + itos(version) + ".");
  133. ERR_FAIL_COND_V_MSG(ver_major > VERSION_MAJOR || (ver_major == VERSION_MAJOR && ver_minor > VERSION_MINOR), false, "Pack created with a newer version of the engine: " + itos(ver_major) + "." + itos(ver_minor) + ".");
  134. for (int i = 0; i < 16; i++) {
  135. //reserved
  136. f->get_32();
  137. }
  138. int file_count = f->get_32();
  139. for (int i = 0; i < file_count; i++) {
  140. uint32_t sl = f->get_32();
  141. CharString cs;
  142. cs.resize(sl + 1);
  143. f->get_buffer((uint8_t *)cs.ptr(), sl);
  144. cs[sl] = 0;
  145. String path;
  146. path.parse_utf8(cs.ptr());
  147. uint64_t ofs = f->get_64();
  148. uint64_t size = f->get_64();
  149. uint8_t md5[16];
  150. f->get_buffer(md5, 16);
  151. PackedData::get_singleton()->add_path(p_path, path, ofs, size, md5, this);
  152. };
  153. return true;
  154. };
  155. FileAccess *PackedSourcePCK::get_file(const String &p_path, PackedData::PackedFile *p_file) {
  156. return memnew(FileAccessPack(p_path, *p_file));
  157. };
  158. //////////////////////////////////////////////////////////////////
  159. Error FileAccessPack::_open(const String &p_path, int p_mode_flags) {
  160. ERR_FAIL_V(ERR_UNAVAILABLE);
  161. return ERR_UNAVAILABLE;
  162. }
  163. void FileAccessPack::close() {
  164. f->close();
  165. }
  166. bool FileAccessPack::is_open() const {
  167. return f->is_open();
  168. }
  169. void FileAccessPack::seek(size_t p_position) {
  170. if (p_position > pf.size) {
  171. eof = true;
  172. } else {
  173. eof = false;
  174. }
  175. f->seek(pf.offset + p_position);
  176. pos = p_position;
  177. }
  178. void FileAccessPack::seek_end(int64_t p_position) {
  179. seek(pf.size + p_position);
  180. }
  181. size_t FileAccessPack::get_position() const {
  182. return pos;
  183. }
  184. size_t FileAccessPack::get_len() const {
  185. return pf.size;
  186. }
  187. bool FileAccessPack::eof_reached() const {
  188. return eof;
  189. }
  190. uint8_t FileAccessPack::get_8() const {
  191. if (pos >= pf.size) {
  192. eof = true;
  193. return 0;
  194. }
  195. pos++;
  196. return f->get_8();
  197. }
  198. int FileAccessPack::get_buffer(uint8_t *p_dst, int p_length) const {
  199. if (eof)
  200. return 0;
  201. uint64_t to_read = p_length;
  202. if (to_read + pos > pf.size) {
  203. eof = true;
  204. to_read = int64_t(pf.size) - int64_t(pos);
  205. }
  206. pos += p_length;
  207. if (to_read <= 0)
  208. return 0;
  209. f->get_buffer(p_dst, to_read);
  210. return to_read;
  211. }
  212. void FileAccessPack::set_endian_swap(bool p_swap) {
  213. FileAccess::set_endian_swap(p_swap);
  214. f->set_endian_swap(p_swap);
  215. }
  216. Error FileAccessPack::get_error() const {
  217. if (eof)
  218. return ERR_FILE_EOF;
  219. return OK;
  220. }
  221. void FileAccessPack::flush() {
  222. ERR_FAIL();
  223. }
  224. void FileAccessPack::store_8(uint8_t p_dest) {
  225. ERR_FAIL();
  226. }
  227. void FileAccessPack::store_buffer(const uint8_t *p_src, int p_length) {
  228. ERR_FAIL();
  229. }
  230. bool FileAccessPack::file_exists(const String &p_name) {
  231. return false;
  232. }
  233. FileAccessPack::FileAccessPack(const String &p_path, const PackedData::PackedFile &p_file) :
  234. pf(p_file),
  235. f(FileAccess::open(pf.pack, FileAccess::READ)) {
  236. ERR_FAIL_COND_MSG(!f, "Can't open pack-referenced file '" + String(pf.pack) + "'.");
  237. f->seek(pf.offset);
  238. pos = 0;
  239. eof = false;
  240. }
  241. FileAccessPack::~FileAccessPack() {
  242. if (f)
  243. memdelete(f);
  244. }
  245. //////////////////////////////////////////////////////////////////////////////////
  246. // DIR ACCESS
  247. //////////////////////////////////////////////////////////////////////////////////
  248. Error DirAccessPack::list_dir_begin() {
  249. list_dirs.clear();
  250. list_files.clear();
  251. for (Map<String, PackedData::PackedDir *>::Element *E = current->subdirs.front(); E; E = E->next()) {
  252. list_dirs.push_back(E->key());
  253. }
  254. for (Set<String>::Element *E = current->files.front(); E; E = E->next()) {
  255. list_files.push_back(E->get());
  256. }
  257. return OK;
  258. }
  259. String DirAccessPack::get_next() {
  260. if (list_dirs.size()) {
  261. cdir = true;
  262. String d = list_dirs.front()->get();
  263. list_dirs.pop_front();
  264. return d;
  265. } else if (list_files.size()) {
  266. cdir = false;
  267. String f = list_files.front()->get();
  268. list_files.pop_front();
  269. return f;
  270. } else {
  271. return String();
  272. }
  273. }
  274. bool DirAccessPack::current_is_dir() const {
  275. return cdir;
  276. }
  277. bool DirAccessPack::current_is_hidden() const {
  278. return false;
  279. }
  280. void DirAccessPack::list_dir_end() {
  281. list_dirs.clear();
  282. list_files.clear();
  283. }
  284. int DirAccessPack::get_drive_count() {
  285. return 0;
  286. }
  287. String DirAccessPack::get_drive(int p_drive) {
  288. return "";
  289. }
  290. Error DirAccessPack::change_dir(String p_dir) {
  291. String nd = p_dir.replace("\\", "/");
  292. bool absolute = false;
  293. if (nd.begins_with("res://")) {
  294. nd = nd.replace_first("res://", "");
  295. absolute = true;
  296. }
  297. nd = nd.simplify_path();
  298. if (nd == "") nd = ".";
  299. if (nd.begins_with("/")) {
  300. nd = nd.replace_first("/", "");
  301. absolute = true;
  302. }
  303. Vector<String> paths = nd.split("/");
  304. PackedData::PackedDir *pd;
  305. if (absolute)
  306. pd = PackedData::get_singleton()->root;
  307. else
  308. pd = current;
  309. for (int i = 0; i < paths.size(); i++) {
  310. String p = paths[i];
  311. if (p == ".") {
  312. continue;
  313. } else if (p == "..") {
  314. if (pd->parent) {
  315. pd = pd->parent;
  316. }
  317. } else if (pd->subdirs.has(p)) {
  318. pd = pd->subdirs[p];
  319. } else {
  320. return ERR_INVALID_PARAMETER;
  321. }
  322. }
  323. current = pd;
  324. return OK;
  325. }
  326. String DirAccessPack::get_current_dir() {
  327. PackedData::PackedDir *pd = current;
  328. String p = current->name;
  329. while (pd->parent) {
  330. pd = pd->parent;
  331. p = pd->name.plus_file(p);
  332. }
  333. return "res://" + p;
  334. }
  335. bool DirAccessPack::file_exists(String p_file) {
  336. p_file = fix_path(p_file);
  337. return current->files.has(p_file);
  338. }
  339. bool DirAccessPack::dir_exists(String p_dir) {
  340. p_dir = fix_path(p_dir);
  341. return current->subdirs.has(p_dir);
  342. }
  343. Error DirAccessPack::make_dir(String p_dir) {
  344. return ERR_UNAVAILABLE;
  345. }
  346. Error DirAccessPack::rename(String p_from, String p_to) {
  347. return ERR_UNAVAILABLE;
  348. }
  349. Error DirAccessPack::remove(String p_name) {
  350. return ERR_UNAVAILABLE;
  351. }
  352. size_t DirAccessPack::get_space_left() {
  353. return 0;
  354. }
  355. String DirAccessPack::get_filesystem_type() const {
  356. return "PCK";
  357. }
  358. DirAccessPack::DirAccessPack() {
  359. current = PackedData::get_singleton()->root;
  360. cdir = false;
  361. }
  362. DirAccessPack::~DirAccessPack() {
  363. }