janwas
359f55700a
vfs_tree: move bucket allocator to allocators.cpp allocators: add matrix self-test zip: remove redundant timing code and add CHECK_ZFILE everywhere ogl_tex: implement app hook for overriding gl upload caps tex: add CHECK_TEX everywhere TextureManager: only call LoadTextures once (instead of for each file type) debug: add hook for translating error messages; add filtering mechanism to only show interesting debug_printfs (WIP). restructured code: debug_puts is the sysdep part, while debug_printf does filtering and then calls that This was SVN commit r2990.
124 lines
2.8 KiB
C++
Executable File
124 lines
2.8 KiB
C++
Executable File
#include "precompiled.h"
|
|
|
|
#include "VFSUtil.h"
|
|
#include "lib/res/file/vfs.h"
|
|
|
|
#include "CLogger.h"
|
|
#define LOG_CATEGORY "vfs"
|
|
|
|
#include <deque>
|
|
|
|
using namespace VFSUtil;
|
|
|
|
// Because I'm lazy, and it saves a few lines of code in other places:
|
|
bool VFSUtil::FindFiles (const CStr& dirname, const char* filter, FileList& files)
|
|
{
|
|
files.clear();
|
|
|
|
Handle dir = vfs_dir_open(dirname);
|
|
if (dir <= 0)
|
|
{
|
|
LOG(ERROR, LOG_CATEGORY, "Error opening directory '%s' (%lld)", dirname.c_str(), dir);
|
|
return false;
|
|
}
|
|
|
|
int err;
|
|
DirEnt entry;
|
|
while ((err = vfs_dir_next_ent(dir, &entry, filter)) == 0)
|
|
{
|
|
files.push_back(dirname+"/"+entry.name);
|
|
}
|
|
|
|
if (err != ERR_DIR_END)
|
|
{
|
|
LOG(ERROR, LOG_CATEGORY, "Error reading files from directory '%s' (%d)", dirname.c_str(), err);
|
|
return false;
|
|
}
|
|
|
|
vfs_dir_close(dir);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
// call <cb> for each entry matching <user_filter> (see vfs_next_dirent) in
|
|
// directory <path>; if <recursive>, entries in subdirectories are
|
|
// also returned.
|
|
//
|
|
// note: EnumDirEntsCB path and ent are only valid during the callback.
|
|
int VFSUtil::EnumDirEnts(const CStr start_path, int flags, const char* user_filter,
|
|
EnumDirEntsCB cb, void* context)
|
|
{
|
|
debug_assert((flags & ~(RECURSIVE)) == 0);
|
|
const bool recursive = (flags & RECURSIVE) != 0;
|
|
|
|
char filter_buf[VFS_MAX_PATH];
|
|
const char* filter = user_filter;
|
|
bool want_dir = true;
|
|
if(user_filter)
|
|
{
|
|
if(user_filter[0] != '/')
|
|
want_dir = false;
|
|
|
|
// we need subdirectories and the caller hasn't already requested them
|
|
if(recursive && !want_dir)
|
|
{
|
|
snprintf(filter_buf, sizeof(filter_buf), "/|%s", user_filter);
|
|
filter = filter_buf;
|
|
}
|
|
}
|
|
|
|
|
|
// note: FIFO queue instead of recursion is much more efficient
|
|
// (less stack usage; avoids seeks by reading all entries in a
|
|
// directory consecutively)
|
|
|
|
std::deque<CStr> dir_queue;
|
|
dir_queue.push_back(start_path);
|
|
|
|
// for each directory:
|
|
do
|
|
{
|
|
// get current directory path from queue
|
|
// note: can't refer to the queue contents - those are invalidated
|
|
// as soon as a directory is pushed onto it.
|
|
char path[VFS_MAX_PATH];
|
|
vfs_path_append(path, dir_queue.front().c_str(), "");
|
|
// vfs_open_dir checks this, so ignore failure
|
|
const size_t path_len = strlen(path);
|
|
dir_queue.pop_front();
|
|
|
|
Handle hdir = vfs_dir_open(path);
|
|
if(hdir <= 0)
|
|
{
|
|
debug_warn("vfs_open_dir failed");
|
|
continue;
|
|
}
|
|
|
|
// for each entry (file, subdir) in directory:
|
|
DirEnt ent;
|
|
while(vfs_dir_next_ent(hdir, &ent, filter) == 0)
|
|
{
|
|
// build complete path (DirEnt only stores entry name)
|
|
strcpy_s(path+path_len, VFS_MAX_PATH-path_len, ent.name);
|
|
|
|
if(DIRENT_IS_DIR(&ent))
|
|
{
|
|
if(recursive)
|
|
dir_queue.push_back(path);
|
|
|
|
if(want_dir)
|
|
cb(path, &ent, context);
|
|
}
|
|
else
|
|
cb(path, &ent, context);
|
|
}
|
|
|
|
vfs_dir_close(hdir);
|
|
}
|
|
while(!dir_queue.empty());
|
|
|
|
return 0;
|
|
}
|