1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051
|
#include "StdAfx.h"
#include <list>
#include <algorithm>
#include <stdio.h>
#include <sys/types.h>
#include <sys/stat.h>
#include "mmgr.h"
#include "ArchiveScanner.h"
#include "Lua/LuaParser.h"
#include "LogOutput.h"
#include "ArchiveFactory.h"
#include "ArchiveBuffered.h"
#include "CRC.h"
#include "FileFilter.h"
#include "FileHandler.h"
#include "FileSystem/FileSystem.h"
#include "FileSystem/FileSystemHandler.h"
#include "Util.h"
#include "Exceptions.h"
using std::string;
using std::vector;
CLogSubsystem LOG_ARCHIVESCANNER("ArchiveScanner");
// fix for windows
#ifndef S_ISDIR
#define S_ISDIR(x) (((x) & 0170000) == 0040000) /* directory */
#endif
/*
* The archive scanner is used to find stuff in archives that are needed before building the virtual
* filesystem. This currently includes maps and mods. It uses caching to speed up the process.
*
* It only retrieves info that is used in an initial listing.. For detailed info when selecting a map
* for example the more specialised parsers will be used. (mapping one archive when selecting a map
* is not slow, but mapping them all every time to make the list is)
*/
#define INTERNAL_VER 7
CArchiveScanner* archiveScanner = NULL;
CArchiveScanner::CArchiveScanner(void)
: isDirty(false)
{
FileSystemHandler& fsh = FileSystemHandler::GetInstance();
ReadCacheData(fsh.GetWriteDir() + GetFilename());
const std::vector<std::string>& datadirs = fsh.GetDataDirectories();
std::vector<std::string> scanDirs;
for (std::vector<std::string>::const_reverse_iterator d = datadirs.rbegin(); d != datadirs.rend(); ++d)
{
scanDirs.push_back(*d + "maps");
scanDirs.push_back(*d + "base");
scanDirs.push_back(*d + "mods");
scanDirs.push_back(*d + "packages");
}
ScanDirs(scanDirs, true);
WriteCacheData(fsh.GetWriteDir() + GetFilename());
}
CArchiveScanner::~CArchiveScanner(void)
{
if (isDirty) {
WriteCacheData(filesystem.LocateFile(GetFilename(), FileSystem::WRITE));
}
}
string CArchiveScanner::GetFilename()
{
char buf[32];
sprintf(buf, "ArchiveCacheV%i.lua", INTERNAL_VER);
return string(buf);
}
CArchiveScanner::ModData CArchiveScanner::GetModData(const LuaTable& modTable)
{
ModData md;
md.name = "";
if (!modTable.IsValid()) {
return md;
}
md.name = modTable.GetString("name", "");
md.shortName = modTable.GetString("shortName", "");
md.version = modTable.GetString("version", "");
md.mutator = modTable.GetString("mutator", "");
md.game = modTable.GetString("game", "");
md.shortGame = modTable.GetString("shortGame", "");
md.description = modTable.GetString("description", "");
md.modType = modTable.GetInt("modType", 0);
const LuaTable dependencies = modTable.SubTable("depend");
for (int dep = 1; dependencies.KeyExists(dep); ++dep) {
md.dependencies.push_back(dependencies.GetString(dep, ""));
}
const LuaTable replaces = modTable.SubTable("replace");
for (int rep = 1; replaces.KeyExists(rep); ++rep) {
md.replaces.push_back(replaces.GetString(rep, ""));
}
// append "springcontent.sdz" for primary mods that haven't already added it
if (md.modType == 1) {
bool found = false;
for (size_t dep = 0; dep < md.dependencies.size(); dep++) {
if (StringToLower(md.dependencies[dep]) == "springcontent.sdz") {
found = true;
break;
}
}
if (!found) {
md.dependencies.push_back("springcontent.sdz");
}
}
// HACK needed until lobbies, lobbyserver and unitsync are sorted out
// so they can uniquely identify different versions of the same mod.
// (at time of this writing they use name only)
// NOTE when changing this, this function is used both by the code that
// reads ArchiveCacheV#.lua and the code that reads modinfo.lua from the mod.
// so make sure it doesn't keep adding stuff to the name everytime
// Spring/unitsync is loaded.
if (md.name.find(md.version) == string::npos) {
md.name += " " + md.version;
}
return md;
}
void CArchiveScanner::PreScan(const string& curPath)
{
const int flags = (FileSystem::INCLUDE_DIRS | FileSystem::RECURSE);
vector<string> found = filesystem.FindFiles(curPath, "springcontent.sdz", flags);
if (found.empty()) {
return;
}
CArchiveBase* ar = CArchiveFactory::OpenArchive(found[0]);
if (ar == NULL) {
return;
}
string name;
int size;
for (int cur = 0; (cur = ar->FindFiles(cur, &name, &size)); /* no-op */) {
if (name == "gamedata/parse_tdf.lua") {
const int fh = ar->OpenFile(name);
if (fh != 0) {
parse_tdf_path = found[0];
ar->CloseFile(fh);
}
}
else if (name == "gamedata/scanutils.lua") {
const int fh = ar->OpenFile(name);
if (fh != 0) {
scanutils_path = found[0];
ar->CloseFile(fh);
}
}
}
delete ar;
}
static bool LoadSourceFile(const string& archive,
const string& fileName, string& source)
{
CArchiveBase* ar = CArchiveFactory::OpenArchive(archive);
if (ar == NULL) {
return false;
}
const int fh = ar->OpenFile(fileName);
if (!fh) {
delete ar;
return false;
}
const int fsize = ar->FileSize(fh);
char* buf = new char[fsize];
ar->ReadFile(fh, buf, fsize);
ar->CloseFile(fh);
source.assign(buf, fsize);
delete [] buf;
delete ar;
return true;
}
void CArchiveScanner::ScanDirs(const vector<string>& scanDirs, bool doChecksum)
{
// pre-scan for the modinfo utils
for (unsigned int d = 0; d < scanDirs.size(); d++) {
PreScan(scanDirs[d]);
}
LoadSourceFile(parse_tdf_path, "gamedata/parse_tdf.lua", parse_tdf_code);
if (parse_tdf_code.empty()) {
throw content_error("could not find 'gamedata/parse_tdf.lua' code");
}
LoadSourceFile(scanutils_path, "gamedata/scanutils.lua", scanutils_code);
if (scanutils_code.empty()) {
throw content_error("could not find 'gamedata/scanutils.lua' code");
}
// we don't want to return the parse_tdf table
parse_tdf_code.erase(parse_tdf_code.find_last_of("}") + 1);
// NOTE: this is a dangerous game to play,
// better to use a tag in the source file
// add the archives
for (vector<string>::const_iterator it = scanDirs.begin(); it != scanDirs.end(); ++it)
{
if (FileSystemHandler::DirExists(*it))
{
logOutput.Print("Scanning: %s\n", it->c_str());
Scan(*it, doChecksum);
}
}
}
void CArchiveScanner::Scan(const string& curPath, bool doChecksum)
{
isDirty = true;
const int flags = (FileSystem::INCLUDE_DIRS | FileSystem::RECURSE);
vector<string> found = filesystem.FindFiles(curPath, "*", flags);
for (vector<string>::iterator it = found.begin(); it != found.end(); ++it) {
string fullName = *it;
// Strip
const char lastFullChar = fullName[fullName.size() - 1];
if ((lastFullChar == '/') || (lastFullChar == '\\')) {
fullName = fullName.substr(0, fullName.size() - 1);
}
const string fn = filesystem.GetFilename(fullName);
const string fpath = filesystem.GetDirectory(fullName);
const string lcfn = StringToLower(fn);
const string lcfpath = StringToLower(fpath);
// Exclude archivefiles found inside directory archives (.sdd)
if (lcfpath.find(".sdd") != string::npos) {
continue;
}
// Exclude archivefiles found inside hidden directories
if ((lcfpath.find("/hidden/") != string::npos) ||
(lcfpath.find("\\hidden\\") != string::npos)) {
continue;
}
// Is this an archive we should look into?
if (CArchiveFactory::IsScanArchive(fullName)) {
ScanArchive(fullName, doChecksum);
}
}
// Now we'll have to parse the replaces-stuff found in the mods
for (std::map<string, ArchiveInfo>::iterator aii = archiveInfo.begin(); aii != archiveInfo.end(); ++aii) {
for (vector<string>::iterator i = aii->second.modData.replaces.begin(); i != aii->second.modData.replaces.end(); ++i) {
const string lcname = StringToLower(*i);
std::map<string, ArchiveInfo>::iterator ar = archiveInfo.find(lcname);
// If it's not there, we will create a new entry
if (ar == archiveInfo.end()) {
ArchiveInfo tmp;
archiveInfo[lcname] = tmp;
ar = archiveInfo.find(lcname);
}
// Overwrite the info for this archive with a replaced pointer
ar->second.path = "";
ar->second.origName = lcname;
ar->second.modified = 1;
ar->second.mapData.clear();
ar->second.modData.name = "";
ar->second.modData.replaces.clear();
ar->second.updated = true;
ar->second.replaced = aii->first;
}
}
}
void CArchiveScanner::ScanArchive(const string& fullName, bool doChecksum)
{
struct stat info;
stat(fullName.c_str(), &info);
const string fn = filesystem.GetFilename(fullName);
const string fpath = filesystem.GetDirectory(fullName);
const string lcfn = StringToLower(fn);
const string lcfpath = StringToLower(fpath);
// Determine whether to rely on the cached info or not
bool cached = false;
std::map<string, ArchiveInfo>::iterator aii = archiveInfo.find(lcfn);
if (aii != archiveInfo.end()) {
// This archive may have been obsoleted, do not process it if so
if (aii->second.replaced.length() > 0) {
return;
}
/*
For truely correct updating of .sdd archives, this code should
be enabled. Unfortunately it has as side effect that all files
in all .sdd's always need to be stat()'ed, which really slows
down program startup.
An update can be forced anyway by removing ArchiveCacheV*.lua
or renaming the archive.
*/
/*if (S_ISDIR(info.st_mode)) {
struct stat info2;
vector<string> sddfiles = filesystem.FindFiles(fpath, "*", FileSystem::RECURSE | FileSystem::INCLUDE_DIRS);
for (vector<string>::iterator sddit = found.begin(); sddit != found.end(); ++sddit) {
stat(sddit->c_str(), &info2);
if (info.st_mtime < info2.st_mtime) {
info.st_mtime = info2.st_mtime;
}
}
}*/
if ((unsigned)info.st_mtime == aii->second.modified && fpath == aii->second.path) {
cached = true;
aii->second.updated = true;
}
// If we are here, we could have invalid info in the cache
// Force a reread if it's a directory archive, as st_mtime only
// reflects changes to the directory itself, not the contents.
if (!cached) {
archiveInfo.erase(aii);
}
}
// Time to parse the info we are interested in
if (cached) {
// If cached is true, aii will point to the archive
if (doChecksum && (aii->second.checksum == 0)) {
aii->second.checksum = GetCRC(fullName);
}
}
else {
CArchiveBase* ar = CArchiveFactory::OpenArchive(fullName);
if (ar) {
ArchiveInfo ai;
string name;
int size;
for (int cur = 0; (cur = ar->FindFiles(cur, &name, &size)); /* no-op */) {
const string lowerName = StringToLower(name);
const string ext = lowerName.substr(lowerName.find_last_of('.') + 1);
// only accept new format maps
if ((ext == "smf") || (ext == "sm3")) {
ScanMap(ar, name, ai);
}
else if (lowerName == "modinfo.lua") {
ScanModLua(ar, name, ai);
}
else if (lowerName == "modinfo.tdf") {
ScanModTdf(ar, name, ai);
}
}
ai.path = fpath;
ai.modified = info.st_mtime;
ai.origName = fn;
ai.updated = true;
delete ar;
// Optionally calculate a checksum for the file
// To prevent reading all files in all directory (.sdd) archives
// every time this function is called, directory archive checksums
// are calculated on the fly.
if (doChecksum) {
ai.checksum = GetCRC(fullName);
} else {
ai.checksum = 0;
}
archiveInfo[lcfn] = ai;
}
}
}
bool CArchiveScanner::ScanMap(CArchiveBase* ar, const string& fileName,
ArchiveInfo& ai)
{
MapData md;
if ((fileName.find_last_of('\\') == string::npos) &&
(fileName.find_last_of('/') == string::npos)) {
md.name = fileName;
md.virtualPath = "/";
}
else {
if (fileName.find_last_of('\\') == string::npos) {
md.name = fileName.substr(fileName.find_last_of('/') + 1);
// include the backslash
md.virtualPath = fileName.substr(0, fileName.find_last_of('/') + 1);
}
else {
md.name = fileName.substr(fileName.find_last_of('\\') + 1);
// include the backslash
md.virtualPath = fileName.substr(0, fileName.find_last_of('\\') + 1);
}
}
ai.mapData.push_back(md);
return true;
}
bool CArchiveScanner::ScanModLua(CArchiveBase* ar, const string& fileName,
ArchiveInfo& ai)
{
const int fh = ar->OpenFile(fileName);
if (fh == 0) {
return false;
}
const int fsize = ar->FileSize(fh);
char* buf = new char[fsize];
ar->ReadFile(fh, buf, fsize);
ar->CloseFile(fh);
const string cleanbuf(buf, fsize);
delete [] buf;
LuaParser p(cleanbuf, SPRING_VFS_MOD);
if (!p.Execute()) {
logOutput.Print("ERROR in " + fileName + ": " + p.GetErrorLog());
return false;
}
const LuaTable modTable = p.GetRoot();
ai.modData = GetModData(modTable);
return true;
}
bool CArchiveScanner::ScanModTdf(CArchiveBase* ar, const string& fileName,
ArchiveInfo& ai)
{
const int fh = ar->OpenFile(fileName);
if (fh == 0) {
return false;
}
const int fsize = ar->FileSize(fh);
char* buf = new char[fsize];
ar->ReadFile(fh, buf, fsize);
ar->CloseFile(fh);
const string cleanbuf(buf, fsize);
delete [] buf;
const string luaCode =
parse_tdf_code + "\n\n"
+ scanutils_code + "\n\n"
+ "local tdfModinfo, err = TDFparser.ParseText([[\n"
+ cleanbuf + "]])\n\n"
+ "if (tdfModinfo == nil) then\n"
+ " error('Error parsing modinfo.tdf: ' .. err)\n"
+ "end\n\n"
+ "tdfModinfo.mod.depend = MakeArray(tdfModinfo.mod, 'depend')\n"
+ "tdfModinfo.mod.replace = MakeArray(tdfModinfo.mod, 'replace')\n\n"
+ "return tdfModinfo.mod\n";
LuaParser p(luaCode, SPRING_VFS_MOD);
if (!p.Execute()) {
logOutput.Print("ERROR in " + fileName + ": " + p.GetErrorLog());
return false;
}
const LuaTable modTable = p.GetRoot();
ai.modData = GetModData(modTable);
return true;
}
IFileFilter* CArchiveScanner::CreateIgnoreFilter(CArchiveBase* ar)
{
IFileFilter* ignore = IFileFilter::Create();
int fh = ar->OpenFile("springignore.txt");
if (fh) {
const int fsize = ar->FileSize(fh);
char* buf = new char[fsize];
const int read = ar->ReadFile(fh, buf, fsize);
ar->CloseFile(fh);
// this automatically splits lines
if (read > 0)
ignore->AddRule(string(buf, read));
//TODO: figure out why read != fsize sometimes
delete[] buf;
}
return ignore;
}
/** Get CRC of the data in the specified archive.
Returns 0 if file could not be opened. */
unsigned int CArchiveScanner::GetCRC(const string& arcName)
{
CRC crc;
CArchiveBase* ar;
std::list<string> files;
// Try to open an archive
ar = CArchiveFactory::OpenArchive(arcName);
if (!ar) {
return 0; // It wasn't an archive
}
// Load ignore list.
IFileFilter* ignore = CreateIgnoreFilter(ar);
string name;
int size;
// Sort all file paths for deterministic behaviour
for (int cur = 0; (cur = ar->FindFiles(cur, &name, &size)); /* no-op */) {
if (ignore->Match(name)) {
continue;
}
const string lower = StringToLower(name); // case insensitive hash
files.push_back(lower);
}
files.sort();
// Add all files in sorted order
for (std::list<string>::iterator i = files.begin(); i != files.end(); i++ ) {
const unsigned int nameCRC = CRC().Update(i->data(), i->size()).GetDigest();
const unsigned int dataCRC = ar->GetCrc32(*i);
crc.Update(nameCRC);
crc.Update(dataCRC);
}
delete ignore;
delete ar;
unsigned int digest = crc.GetDigest();
// A value of 0 is used to indicate no crc.. so never return that
// Shouldn't happen all that often
if (digest == 0) {
return 4711;
} else {
return digest;
}
}
void CArchiveScanner::ReadCacheData(const string& filename)
{
LuaParser p(filename, SPRING_VFS_RAW, SPRING_VFS_BASE);
if (!p.Execute()) {
logOutput.Print("ERROR in " + filename + ": " + p.GetErrorLog());
}
const LuaTable archiveCache = p.GetRoot();
const LuaTable archives = archiveCache.SubTable("archives");
// Do not load old version caches
const int ver = archiveCache.GetInt("internalVer", (INTERNAL_VER + 1));
if (ver != INTERNAL_VER) {
return;
}
for (int i = 1; archives.KeyExists(i); ++i) {
const LuaTable curArchive = archives.SubTable(i);
const LuaTable maps = curArchive.SubTable("maps");
const LuaTable mod = curArchive.SubTable("modData");
ArchiveInfo ai;
ai.origName = curArchive.GetString("name", "");
ai.path = curArchive.GetString("path", "");
// do not use LuaTable.GetInt() for 32-bit integers, the Spring lua
// library uses 32-bit floats to represent numbers, which can only
// represent 2^24 consecutive integers
ai.modified = strtoul(curArchive.GetString("modified", "0").c_str(), 0, 10);
ai.checksum = strtoul(curArchive.GetString("checksum", "0").c_str(), 0, 10);
ai.updated = false;
for (int m = 1; maps.KeyExists(m); ++m) {
const LuaTable curMap = maps.SubTable(m);
MapData md;
md.name = curMap.GetString("name", "");
md.virtualPath = curMap.GetString("virtualPath", "");
ai.mapData.push_back(md);
}
ai.modData = GetModData(mod);
string lcname = StringToLower(ai.origName);
archiveInfo[lcname] = ai;
}
isDirty = false;
}
static inline void SafeStr(FILE* out, const char* prefix, const string& str)
{
if (str.empty()) {
return;
}
if (str.find_first_of("\\\"") == string::npos) {
fprintf(out, "%s\"%s\",\n", prefix, str.c_str());
} else {
fprintf(out, "%s[[%s]],\n", prefix, str.c_str());
}
}
void CArchiveScanner::WriteCacheData(const string& filename)
{
if (!isDirty) {
return;
}
FILE* out = fopen(filename.c_str(), "wt");
if (!out) {
return;
}
// First delete all outdated information
for (std::map<string, ArchiveInfo>::iterator i = archiveInfo.begin(); i != archiveInfo.end(); ) {
if (!i->second.updated) {
#ifdef _MSC_VER
i = archiveInfo.erase(i);
#else
archiveInfo.erase(i++);
#endif
}
else
++i;
}
fprintf(out, "local archiveCache = {\n\n");
fprintf(out, "\tinternalver = %i,\n\n", INTERNAL_VER);
fprintf(out, "\tarchives = { -- count = "_STPF_"\n", archiveInfo.size());
std::map<string, ArchiveInfo>::const_iterator arcIt;
for (arcIt = archiveInfo.begin(); arcIt != archiveInfo.end(); ++arcIt) {
const ArchiveInfo& arcInfo = arcIt->second;
fprintf(out, "\t\t{\n");
SafeStr(out, "\t\t\tname = ", arcInfo.origName);
SafeStr(out, "\t\t\tpath = ", arcInfo.path);
fprintf(out, "\t\t\tmodified = \"%u\",\n", arcInfo.modified);
fprintf(out, "\t\t\tchecksum = \"%u\",\n", arcInfo.checksum);
SafeStr(out, "\t\t\treplaced = ", arcInfo.replaced);
// map info?
const vector<MapData>& mapData = arcInfo.mapData;
if (!mapData.empty()) {
fprintf(out, "\t\t\tmaps = {\n");
vector<MapData>::const_iterator mapIt;
for (mapIt = mapData.begin(); mapIt != mapData.end(); ++mapIt) {
fprintf(out, "\t\t\t\t{\n");
SafeStr(out, "\t\t\t\t\tname = ", mapIt->name);
SafeStr(out, "\t\t\t\t\tvirtualpath = ", mapIt->virtualPath);
fprintf(out, "\t\t\t\t},\n");
}
fprintf(out, "\t\t\t},\n");
}
// mod info?
const ModData& modData = arcInfo.modData;
if (modData.name != "") {
fprintf(out, "\t\t\tmoddata = {\n");
SafeStr(out, "\t\t\t\tname = ", modData.name);
SafeStr(out, "\t\t\t\tshortname = ", modData.shortName);
SafeStr(out, "\t\t\t\tversion = ", modData.version);
SafeStr(out, "\t\t\t\tmutator = ", modData.mutator);
SafeStr(out, "\t\t\t\tgame = ", modData.game);
SafeStr(out, "\t\t\t\tshortgame = ", modData.shortGame);
SafeStr(out, "\t\t\t\tdescription = ", modData.description);
fprintf(out, "\t\t\t\tmodtype = %d,\n", modData.modType);
const vector<string>& modDeps = modData.dependencies;
const int depCount = (int)modDeps.size();
bool foundCustomDep = false;
for (int d = 0; d < depCount; d++) {
if (modDeps[d] != "springcontent.sdz") {
foundCustomDep = true;
break;
}
}
if (foundCustomDep) {
fprintf(out, "\t\t\t\tdepend = {\n");
for (int d = 0; d < depCount; d++) {
if ((d != (depCount - 1)) || (modDeps[d] != "springcontent.sdz")) {
SafeStr(out, "\t\t\t\t\t", modDeps[d]);
}
}
fprintf(out, "\t\t\t\t},\n");
}
const vector<string>& modReps = modData.replaces;
const int repCount = (int)modReps.size();
if (repCount > 0) {
fprintf(out, "\t\t\t\treplace = {\n");
for (int r = 0; r < repCount; r++) {
SafeStr(out, "\t\t\t\t\t", modReps[r]);
}
fprintf(out, "\t\t\t\t},\n");
}
fprintf(out, "\t\t\t},\n");
}
fprintf(out, "\t\t},\n");
}
fprintf(out, "\t},\n"); // close 'archives'
fprintf(out, "}\n\n"); // close 'archiveCache'
fprintf(out, "return archiveCache\n");
fclose(out);
isDirty = false;
}
vector<CArchiveScanner::ModData> CArchiveScanner::GetPrimaryMods() const
{
vector<ModData> ret;
for (std::map<string, ArchiveInfo>::const_iterator i = archiveInfo.begin(); i != archiveInfo.end(); ++i) {
if (i->second.modData.name != "") {
if (i->second.modData.modType != 1) {
continue;
}
// Add the archive the mod is in as the first dependency
ModData md = i->second.modData;
md.dependencies.insert(md.dependencies.begin(), i->second.origName);
ret.push_back(md);
}
}
return ret;
}
vector<CArchiveScanner::ModData> CArchiveScanner::GetAllMods() const
{
vector<ModData> ret;
for (std::map<string, ArchiveInfo>::const_iterator i = archiveInfo.begin(); i != archiveInfo.end(); ++i) {
if (i->second.modData.name != "") {
// Add the archive the mod is in as the first dependency
ModData md = i->second.modData;
md.dependencies.insert(md.dependencies.begin(), i->second.origName);
ret.push_back(md);
}
}
return ret;
}
vector<string> CArchiveScanner::GetArchives(const string& root, int depth) const
{
logOutput.Print(LOG_ARCHIVESCANNER, "GetArchives: %s (depth %u)\n", root.c_str(), depth);
// Protect against circular dependencies
// (worst case depth is if all archives form one huge dependency chain)
if ((unsigned)depth > archiveInfo.size()) {
throw content_error("Circular dependency");
}
vector<string> ret;
string lcname = StringToLower(ModNameToModArchive(root));
std::map<string, ArchiveInfo>::const_iterator aii = archiveInfo.find(lcname);
if (aii == archiveInfo.end())
{ // unresolved dep, add anyway so we get propper errorhandling
ret.push_back(lcname);
return ret;
}
// Check if this archive has been replaced
while (aii->second.replaced.length() > 0) {
aii = archiveInfo.find(aii->second.replaced);
if (aii == archiveInfo.end())
{
throw content_error("Unknown error parsing archive replacements");
}
}
ret.push_back(aii->second.path + aii->second.origName);
// add depth-first
for (vector<string>::const_iterator i = aii->second.modData.dependencies.begin(); i != aii->second.modData.dependencies.end(); ++i) {
vector<string> dep = GetArchives(*i, depth + 1);
for (vector<string>::const_iterator j = dep.begin(); j != dep.end(); ++j) {
if (std::find(ret.begin(), ret.end(), *j) == ret.end()) {
// add only if this dependency is not already somewhere
// in the chain (which can happen if ArchiveCacheV* has
// not been written yet) so its checksum is not XOR'ed
// with the running one multiple times (Get*Checksum())
ret.push_back(*j);
}
}
}
return ret;
}
vector<string> CArchiveScanner::GetMaps()
{
vector<string> ret;
for (std::map<string, ArchiveInfo>::iterator aii = archiveInfo.begin(); aii != archiveInfo.end(); ++aii) {
for (vector<MapData>::iterator i = aii->second.mapData.begin(); i != aii->second.mapData.end(); ++i) {
ret.push_back((*i).name);
}
}
return ret;
}
vector<string> CArchiveScanner::GetArchivesForMap(const string& mapName) const
{
vector<string> ret;
for (std::map<string, ArchiveInfo>::const_iterator aii = archiveInfo.begin(); aii != archiveInfo.end(); ++aii) {
for (vector<MapData>::const_iterator i = aii->second.mapData.begin(); i != aii->second.mapData.end(); ++i) {
if (mapName == (*i).name) {
ret = GetArchives(aii->first);
const string mapHelperPath = GetArchivePath("maphelper.sdz");
if (mapHelperPath.empty()) {
throw content_error("missing maphelper.sdz");
} else {
ret.push_back(mapHelperPath + "maphelper.sdz");
}
break;
}
}
}
return ret;
}
unsigned int CArchiveScanner::GetArchiveChecksum(const string& name)
{
string lcname = name;
// Strip path-info if present
if (lcname.find_last_of('\\') != string::npos) {
lcname = lcname.substr(lcname.find_last_of('\\') + 1);
}
if (lcname.find_last_of('/') != string::npos) {
lcname = lcname.substr(lcname.find_last_of('/') + 1);
}
StringToLowerInPlace(lcname);
std::map<string, ArchiveInfo>::const_iterator aii = archiveInfo.find(lcname);
if (aii == archiveInfo.end()) {
logOutput.Print(LOG_ARCHIVESCANNER, "%s checksum: not found (0)\n", name.c_str());
return 0;
}
logOutput.Print(LOG_ARCHIVESCANNER, "%s checksum: %d/%u\n", name.c_str(), aii->second.checksum, aii->second.checksum);
return aii->second.checksum;
}
string CArchiveScanner::GetArchivePath(const string& name) const
{
string lcname = name;
// Strip path-info if present
if (lcname.find_last_of('\\') != string::npos) {
lcname = lcname.substr(lcname.find_last_of('\\') + 1);
}
if (lcname.find_last_of('/') != string::npos) {
lcname = lcname.substr(lcname.find_last_of('/') + 1);
}
StringToLowerInPlace(lcname);
std::map<string, ArchiveInfo>::const_iterator aii = archiveInfo.find(lcname);
if (aii == archiveInfo.end()) {
return "";
}
return aii->second.path;
}
/** Get checksum of all required archives depending on selected mod. */
unsigned int CArchiveScanner::GetModChecksum(const string& root)
{
const vector<string> ars = GetArchives(root);
unsigned int checksum = 0;
for (unsigned int a = 0; a < ars.size(); a++) {
checksum ^= GetArchiveChecksum(ars[a]);
}
logOutput.Print(LOG_ARCHIVESCANNER, "mod checksum %s: %d/%u\n", root.c_str(), checksum, checksum);
return checksum;
}
/** Get checksum of all required archives depending on selected map. */
unsigned int CArchiveScanner::GetMapChecksum(const string& mapName)
{
const vector<string> ars = GetArchivesForMap(mapName);
unsigned int checksum = 0;
for (unsigned int a = 0; a < ars.size(); a++) {
checksum ^= GetArchiveChecksum(ars[a]);
}
logOutput.Print(LOG_ARCHIVESCANNER, "map checksum %s: %d/%u\n", mapName.c_str(), checksum, checksum);
return checksum;
}
/** Check if calculated mod checksum equals given checksum. Throws content_error if not equal. */
void CArchiveScanner::CheckMod(const string& root, unsigned checksum)
{
unsigned localChecksum = GetModChecksum(root);
if (localChecksum != checksum) {
char msg[1024];
sprintf(
msg,
"Your mod (checksum 0x%x) differs from the host's mod (checksum 0x%x). "
"This may be caused by a missing archive, a corrupted download, or there may even "
"be 2 different versions in circulation. Make sure you and the host have installed "
"the chosen mod and its dependencies and consider redownloading the mod.",
localChecksum, checksum);
throw content_error(msg);
}
}
/** Check if calculated map checksum equals given checksum. Throws content_error if not equal. */
void CArchiveScanner::CheckMap(const string& mapName, unsigned checksum)
{
unsigned localChecksum = GetMapChecksum(mapName);
if (localChecksum != checksum) {
char msg[1024];
sprintf(
msg,
"Your map (checksum 0x%x) differs from the host's map (checksum 0x%x). "
"This may be caused by a missing archive, a corrupted download, or there may even "
"be 2 different versions in circulation. Make sure you and the host have installed "
"the chosen map and its dependencies and consider redownloading the mod.\n",
localChecksum, checksum);
throw content_error(msg);
}
}
/** Convert mod name to mod primary archive, e.g. ModNameToModArchive("XTA v8.1") returns "xtape.sd7". */
string CArchiveScanner::ModNameToModArchive(const string& s) const
{
// Convert mod name to mod archive
vector<ModData> found = GetAllMods();
for (vector<ModData>::iterator it = found.begin(); it != found.end(); ++it) {
if (it->name == s) {
return it->dependencies.front();
}
}
return s;
}
/** The reverse of ModNameToModArchive() */
string CArchiveScanner::ModArchiveToModName(const string& s) const
{
// Convert mod archive to mod name
vector<ModData> found = GetAllMods();
for (vector<ModData>::iterator it = found.begin(); it != found.end(); ++it) {
if (it->dependencies.front() == s) {
return it->name;
}
}
return s;
}
/** Convert mod name to mod data struct, can return empty ModData */
CArchiveScanner::ModData CArchiveScanner::ModNameToModData(const string& s) const
{
// Convert mod name to mod archive
vector<ModData> found = GetAllMods();
for (vector<ModData>::iterator it = found.begin(); it != found.end(); ++it) {
const ModData& md = *it;
if (md.name == s) {
return md;
}
}
return ModData();
}
/** Convert mod archive to mod data struct, can return empty ModData */
CArchiveScanner::ModData CArchiveScanner::ModArchiveToModData(const string& s) const
{
// Convert mod archive to mod name
vector<ModData> found = GetAllMods();
for (vector<ModData>::iterator it = found.begin(); it != found.end(); ++it) {
const ModData& md = *it;
if (md.dependencies.front() == s) {
return md;
}
}
return ModData();
}
|