|
|
@ -148,12 +148,7 @@ struct DirTree
|
|
|
|
fs::remove_all(path);
|
|
|
|
fs::remove_all(path);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
Path& operator &()
|
|
|
|
const Path& operator &()
|
|
|
|
{
|
|
|
|
|
|
|
|
return path;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
operator Path()
|
|
|
|
|
|
|
|
{
|
|
|
|
{
|
|
|
|
return path;
|
|
|
|
return path;
|
|
|
|
}
|
|
|
|
}
|
|
|
@ -180,7 +175,7 @@ int main(int argc,char** argv)
|
|
|
|
{
|
|
|
|
{
|
|
|
|
auto data = get_data(i);
|
|
|
|
auto data = get_data(i);
|
|
|
|
#ifndef SILENT
|
|
|
|
#ifndef SILENT
|
|
|
|
cout << " <- " << DATA_NAMES[i] << " (" << DATA_LENGTHS[i] << ")";
|
|
|
|
cout << " <- " << DATA_NAMES[i] << " (" << DATA_LENGTHS[i] << ")" << flush;
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
if(!verify_hash(i, data, DATA_LENGTHS[i])) {
|
|
|
|
if(!verify_hash(i, data, DATA_LENGTHS[i])) {
|
|
|
|
#ifndef SILENT
|
|
|
|
#ifndef SILENT
|
|
|
@ -189,11 +184,11 @@ int main(int argc,char** argv)
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
return 1;
|
|
|
|
return 1;
|
|
|
|
} else {
|
|
|
|
} else {
|
|
|
|
|
|
|
|
write_to_file(&tree / DATA_NAMES[i], data, DATA_LENGTHS[i]);
|
|
|
|
#ifndef SILENT
|
|
|
|
#ifndef SILENT
|
|
|
|
cout << " OK\n";
|
|
|
|
cout << " OK\n";
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
}
|
|
|
|
write_to_file(path / DATA_NAMES[i], data, DATA_LENGTHS[i]);
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if(DATA_EXEC_AFTER) {
|
|
|
|
if(DATA_EXEC_AFTER) {
|
|
|
|