mirror of https://github.com/AxioDL/nod.git
278 lines
8.6 KiB
C++
278 lines
8.6 KiB
C++
#ifdef _WIN32
|
|
#include <windows.h>
|
|
#else
|
|
#include <sys/stat.h>
|
|
#include <dirent.h>
|
|
#endif
|
|
|
|
#include <map>
|
|
|
|
#include "nod/DirectoryEnumerator.hpp"
|
|
|
|
namespace nod
|
|
{
|
|
|
|
DirectoryEnumerator::DirectoryEnumerator(const SystemChar* path, Mode mode,
|
|
bool sizeSort, bool reverse, bool noHidden)
|
|
{
|
|
Sstat theStat;
|
|
if (Stat(path, &theStat) || !S_ISDIR(theStat.st_mode))
|
|
return;
|
|
|
|
#if _WIN32
|
|
SystemString wc(path);
|
|
wc += _S("/*");
|
|
WIN32_FIND_DATAW d;
|
|
HANDLE dir = FindFirstFileW(wc.c_str(), &d);
|
|
if (dir == INVALID_HANDLE_VALUE)
|
|
return;
|
|
switch (mode)
|
|
{
|
|
case Mode::Native:
|
|
do
|
|
{
|
|
if (!wcscmp(d.cFileName, _S(".")) || !wcscmp(d.cFileName, _S("..")))
|
|
continue;
|
|
if (noHidden && (d.cFileName[0] == L'.' || (d.dwFileAttributes & FILE_ATTRIBUTE_HIDDEN) != 0))
|
|
continue;
|
|
SystemString fp(path);
|
|
fp += _S('/');
|
|
fp += d.cFileName;
|
|
Sstat st;
|
|
if (Stat(fp.c_str(), &st))
|
|
continue;
|
|
|
|
size_t sz = 0;
|
|
bool isDir = false;
|
|
if (S_ISDIR(st.st_mode))
|
|
isDir = true;
|
|
else if (S_ISREG(st.st_mode))
|
|
sz = st.st_size;
|
|
else
|
|
continue;
|
|
|
|
m_entries.push_back(std::move(Entry(std::move(fp), d.cFileName, sz, isDir)));
|
|
} while (FindNextFileW(dir, &d));
|
|
break;
|
|
case Mode::DirsThenFilesSorted:
|
|
case Mode::DirsSorted:
|
|
{
|
|
std::map<SystemString, Entry, CaseInsensitiveCompare> sort;
|
|
do
|
|
{
|
|
if (!wcscmp(d.cFileName, _S(".")) || !wcscmp(d.cFileName, _S("..")))
|
|
continue;
|
|
if (noHidden && (d.cFileName[0] == L'.' || (d.dwFileAttributes & FILE_ATTRIBUTE_HIDDEN) != 0))
|
|
continue;
|
|
SystemString fp(path);
|
|
fp +=_S('/');
|
|
fp += d.cFileName;
|
|
Sstat st;
|
|
if (Stat(fp.c_str(), &st) || !S_ISDIR(st.st_mode))
|
|
continue;
|
|
sort.emplace(std::make_pair(d.cFileName, Entry(std::move(fp), d.cFileName, 0, true)));
|
|
} while (FindNextFileW(dir, &d));
|
|
|
|
if (reverse)
|
|
for (auto it=sort.crbegin() ; it != sort.crend() ; ++it)
|
|
m_entries.push_back(std::move(it->second));
|
|
else
|
|
for (auto& e : sort)
|
|
m_entries.push_back(std::move(e.second));
|
|
|
|
if (mode == Mode::DirsSorted)
|
|
break;
|
|
FindClose(dir);
|
|
dir = FindFirstFileW(wc.c_str(), &d);
|
|
}
|
|
case Mode::FilesSorted:
|
|
{
|
|
if (mode == Mode::FilesSorted)
|
|
m_entries.clear();
|
|
|
|
if (sizeSort)
|
|
{
|
|
std::multimap<size_t, Entry> sort;
|
|
do
|
|
{
|
|
if (!wcscmp(d.cFileName, _S(".")) || !wcscmp(d.cFileName, _S("..")))
|
|
continue;
|
|
if (noHidden && (d.cFileName[0] == L'.' || (d.dwFileAttributes & FILE_ATTRIBUTE_HIDDEN) != 0))
|
|
continue;
|
|
SystemString fp(path);
|
|
fp += _S('/');
|
|
fp += d.cFileName;
|
|
Sstat st;
|
|
if (Stat(fp.c_str(), &st) || !S_ISREG(st.st_mode))
|
|
continue;
|
|
sort.emplace(std::make_pair(st.st_size, Entry(std::move(fp), d.cFileName, st.st_size, false)));
|
|
} while (FindNextFileW(dir, &d));
|
|
|
|
if (reverse)
|
|
for (auto it=sort.crbegin() ; it != sort.crend() ; ++it)
|
|
m_entries.push_back(std::move(it->second));
|
|
else
|
|
for (auto& e : sort)
|
|
m_entries.push_back(std::move(e.second));
|
|
}
|
|
else
|
|
{
|
|
std::map<SystemString, Entry, CaseInsensitiveCompare> sort;
|
|
do
|
|
{
|
|
if (!wcscmp(d.cFileName, _S(".")) || !wcscmp(d.cFileName, _S("..")))
|
|
continue;
|
|
if (noHidden && (d.cFileName[0] == L'.' || (d.dwFileAttributes & FILE_ATTRIBUTE_HIDDEN) != 0))
|
|
continue;
|
|
SystemString fp(path);
|
|
fp += _S('/');
|
|
fp += d.cFileName;
|
|
Sstat st;
|
|
if (Stat(fp.c_str(), &st) || !S_ISREG(st.st_mode))
|
|
continue;
|
|
sort.emplace(std::make_pair(d.cFileName, Entry(std::move(fp), d.cFileName, st.st_size, false)));
|
|
} while (FindNextFileW(dir, &d));
|
|
|
|
if (reverse)
|
|
for (auto it=sort.crbegin() ; it != sort.crend() ; ++it)
|
|
m_entries.push_back(std::move(it->second));
|
|
else
|
|
for (auto& e : sort)
|
|
m_entries.push_back(std::move(e.second));
|
|
}
|
|
|
|
break;
|
|
}
|
|
}
|
|
FindClose(dir);
|
|
|
|
#else
|
|
|
|
DIR* dir = opendir(path);
|
|
if (!dir)
|
|
return;
|
|
const dirent* d;
|
|
switch (mode)
|
|
{
|
|
case Mode::Native:
|
|
while ((d = readdir(dir)))
|
|
{
|
|
if (!strcmp(d->d_name, ".") || !strcmp(d->d_name, ".."))
|
|
continue;
|
|
if (noHidden && d->d_name[0] == '.')
|
|
continue;
|
|
SystemString fp(path);
|
|
fp += '/';
|
|
fp += d->d_name;
|
|
Sstat st;
|
|
if (Stat(fp.c_str(), &st))
|
|
continue;
|
|
|
|
size_t sz = 0;
|
|
bool isDir = false;
|
|
if (S_ISDIR(st.st_mode))
|
|
isDir = true;
|
|
else if (S_ISREG(st.st_mode))
|
|
sz = st.st_size;
|
|
else
|
|
continue;
|
|
|
|
m_entries.push_back(std::move(Entry(std::move(fp), d->d_name, sz, isDir)));
|
|
}
|
|
break;
|
|
case Mode::DirsThenFilesSorted:
|
|
case Mode::DirsSorted:
|
|
{
|
|
std::map<SystemString, Entry, CaseInsensitiveCompare> sort;
|
|
while ((d = readdir(dir)))
|
|
{
|
|
if (!strcmp(d->d_name, ".") || !strcmp(d->d_name, ".."))
|
|
continue;
|
|
if (noHidden && d->d_name[0] == '.')
|
|
continue;
|
|
SystemString fp(path);
|
|
fp += '/';
|
|
fp += d->d_name;
|
|
Sstat st;
|
|
if (Stat(fp.c_str(), &st) || !S_ISDIR(st.st_mode))
|
|
continue;
|
|
sort.emplace(std::make_pair(d->d_name, Entry(std::move(fp), d->d_name, 0, true)));
|
|
}
|
|
|
|
if (reverse)
|
|
for (auto it=sort.crbegin() ; it != sort.crend() ; ++it)
|
|
m_entries.push_back(std::move(it->second));
|
|
else
|
|
for (auto& e : sort)
|
|
m_entries.push_back(std::move(e.second));
|
|
|
|
if (mode == Mode::DirsSorted)
|
|
break;
|
|
rewinddir(dir);
|
|
}
|
|
case Mode::FilesSorted:
|
|
{
|
|
if (mode == Mode::FilesSorted)
|
|
m_entries.clear();
|
|
|
|
if (sizeSort)
|
|
{
|
|
std::multimap<size_t, Entry> sort;
|
|
while ((d = readdir(dir)))
|
|
{
|
|
if (!strcmp(d->d_name, ".") || !strcmp(d->d_name, ".."))
|
|
continue;
|
|
if (noHidden && d->d_name[0] == '.')
|
|
continue;
|
|
SystemString fp(path);
|
|
fp += '/';
|
|
fp += d->d_name;
|
|
Sstat st;
|
|
if (Stat(fp.c_str(), &st) || !S_ISREG(st.st_mode))
|
|
continue;
|
|
sort.emplace(std::make_pair(st.st_size, Entry(std::move(fp), d->d_name, st.st_size, false)));
|
|
}
|
|
|
|
if (reverse)
|
|
for (auto it=sort.crbegin() ; it != sort.crend() ; ++it)
|
|
m_entries.push_back(std::move(it->second));
|
|
else
|
|
for (auto& e : sort)
|
|
m_entries.push_back(std::move(e.second));
|
|
}
|
|
else
|
|
{
|
|
std::map<SystemString, Entry, CaseInsensitiveCompare> sort;
|
|
while ((d = readdir(dir)))
|
|
{
|
|
if (!strcmp(d->d_name, ".") || !strcmp(d->d_name, ".."))
|
|
continue;
|
|
if (noHidden && d->d_name[0] == '.')
|
|
continue;
|
|
SystemString fp(path);
|
|
fp += '/';
|
|
fp += d->d_name;
|
|
Sstat st;
|
|
if (Stat(fp.c_str(), &st) || !S_ISREG(st.st_mode))
|
|
continue;
|
|
sort.emplace(std::make_pair(d->d_name, Entry(std::move(fp), d->d_name, st.st_size, false)));
|
|
}
|
|
|
|
if (reverse)
|
|
for (auto it=sort.crbegin() ; it != sort.crend() ; ++it)
|
|
m_entries.push_back(std::move(it->second));
|
|
else
|
|
for (auto& e : sort)
|
|
m_entries.push_back(std::move(e.second));
|
|
}
|
|
|
|
break;
|
|
}
|
|
}
|
|
closedir(dir);
|
|
|
|
#endif
|
|
}
|
|
|
|
}
|