Skip to content

Instantly share code, notes, and snippets.

@kevinkreiser
Last active March 5, 2024 15:39
Show Gist options
  • Star 2 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save kevinkreiser/ab938517c0568ceff52bc793048aa575 to your computer and use it in GitHub Desktop.
Save kevinkreiser/ab938517c0568ceff52bc793048aa575 to your computer and use it in GitHub Desktop.
a replacement for std::filesystem when its not available to your compiler
#include <functional>
#include <iostream>
#ifdef use_std_filesystem
#include <experimental/filesystem>
namespace filesystem = std::experimental::filesystem;
#else
#include <cstring>
#include <memory>
#include <string>
#include <sys/stat.h>
#include <vector>
#ifdef _WIN32
#include "dirent.h"
#else
#include <dirent.h>
#endif
/**
* NOTE: This is a slim version of std::filesystem (boost::filesytem) containing just
* the parts that we need for recursive directory listing, file types and exists check
* we've just stubbed out the interface such that its basically a subset of the official
* version missing the stuff we dont make use of. it should work on posix and windows
*/
namespace filesystem {
class path {
public:
#if defined(_WIN32) || defined(__CYGWIN__)
static constexpr char preferred_separator = L'\\';
#else
static constexpr char preferred_separator = L'/';
#endif
path(const char* path_name) : path(std::string(path_name)) {
}
path(const std::string& path_name) : path_name_(path_name) {
// TODO: squash repeated separators
// delineate the path
for (size_t npos = path_name_.find_first_of(preferred_separator); npos != std::string::npos;
npos = path_name_.find_first_of(preferred_separator, npos + 1))
separators_.push_back(npos);
}
path filename() const {
if (separators_.empty())
return *this;
return path(path_name_.substr(separators_.back() + 1));
}
const char* c_str() const {
return path_name_.c_str();
}
const std::string& string() const {
return path_name_;
}
path& replace_filename(const path& filename) {
// empty or just a file name then copy
if (separators_.empty())
return *this = filename;
// TODO: if its just the root_name we replace that
// take everything from the last separator
path_name_.erase(separators_.back());
separators_.pop_back();
return *this /= filename;
}
bool operator==(const path& rhs) const {
return path_name_ == rhs.path_name_;
}
path& operator/=(const path& rhs) {
if (!rhs.path_name_.empty()) {
// update the path
auto len = path_name_.size();
if (!path_name_.empty() && path_name_.back() != preferred_separator &&
rhs.path_name_.front() != preferred_separator) {
separators_.push_back(path_name_.size());
path_name_.push_back(preferred_separator);
++len;
}
path_name_ += rhs.path_name_;
// update the parts bookkeeping
auto sep_len = separators_.size();
separators_.insert(separators_.end(), rhs.separators_.begin(), rhs.separators_.end());
for (auto i = separators_.begin() + sep_len; i != separators_.end(); ++i)
(*i) += len;
}
return *this;
}
private:
std::string path_name_;
std::vector<size_t> separators_;
};
class recursive_directory_iterator;
class directory_entry {
public:
directory_entry(const filesystem::path& path) : directory_entry(path, false) {
}
bool exists() const {
return entry_ != nullptr;
}
bool is_directory() const {
return exists() && entry_->d_type == DT_DIR;
}
bool is_regular_file() const {
return exists() && entry_->d_type == DT_REG;
}
bool is_symlink() const {
return exists() && entry_->d_type == DT_LNK;
}
const filesystem::path& path() const {
return path_;
}
bool operator==(const directory_entry& rhs) const {
return (!entry_ && !rhs.entry_) || memcmp(entry_.get(), rhs.entry_.get(), sizeof(dirent)) == 0;
}
private:
friend recursive_directory_iterator;
directory_entry(const filesystem::path& path, bool iterate)
: dir_(nullptr), entry_(nullptr), path_(path) {
// stat it first in case its not a directory
struct stat s;
if (stat(path_.c_str(), &s) == 0) {
// if it is a directory and we are going to iterate over it
if (S_ISDIR(s.st_mode) && iterate) {
dir_.reset(opendir(path_.c_str()), [](DIR* d) { closedir(d); });
return;
}
// make a dirent from stat info for starting out
auto filename = path_.filename();
entry_.reset(new dirent);
// entry_->d_reclen =
// entry_->d_off =
entry_->d_ino = s.st_ino;
strcpy(entry_->d_name, filename.c_str());
#ifdef _DIRENT_HAVE_D_NAMLEN
entry_->d_namlen = filename.string().size();
#endif
entry_->d_type = mode_to_type(s.st_mode);
}
}
int mode_to_type(decltype(stat::st_mode) mode) {
if (S_ISREG(mode))
return DT_REG;
else if (S_ISDIR(mode))
return DT_DIR;
else if (S_ISFIFO(mode))
return DT_FIFO;
else if (S_ISSOCK(mode))
return DT_SOCK;
else if (S_ISCHR(mode))
return DT_CHR;
else if (S_ISBLK(mode))
return DT_BLK;
else if (S_ISLNK(mode))
return DT_LNK;
else
return DT_UNKNOWN;
}
dirent* next() {
// if we can scan
if (dir_) {
bool first_entry = entry_ == nullptr;
// we have to skip . and ..
do {
entry_.reset(readdir(dir_.get()), [](dirent*) {});
} while (entry_ && (strcmp(entry_->d_name, ".") == 0 || strcmp(entry_->d_name, "..") == 0));
// update the path
if (entry_) {
if (first_entry)
path_ /= entry_->d_name;
else
path_.replace_filename(entry_->d_name);
// fix the type if its unknown
struct stat s;
if (entry_->d_type == DT_UNKNOWN && stat(path_.c_str(), &s) == 0)
entry_->d_type = mode_to_type(s.st_mode);
}
}
return entry_.get();
}
std::shared_ptr<DIR> dir_;
std::shared_ptr<dirent> entry_;
filesystem::path path_;
};
// NOTE: follows links by default..
class recursive_directory_iterator {
public:
recursive_directory_iterator(const filesystem::path& path) {
stack_.emplace_back(new directory_entry(path, true));
// if this was an iteratable directory go to the first entry
if (stack_.back()->dir_)
stack_.back()->next();
// if we cant iterate then its an end itr
else
stack_.clear();
}
recursive_directory_iterator() {
}
const directory_entry& operator*() const {
return *stack_.back();
}
const directory_entry* operator->() const {
return stack_.back().get();
}
recursive_directory_iterator& operator++() {
// if we have something to iterate
if (!stack_.empty()) {
// if its a directory we deepen our depth first search
if (stack_.back()->is_directory())
stack_.emplace_back(new directory_entry(stack_.back()->path_, true));
// try to go horizontally and if not go up
while (!stack_.empty() && !stack_.back()->next())
stack_.pop_back();
}
return *this;
}
private:
std::vector<std::shared_ptr<directory_entry>> stack_;
friend bool operator==(const recursive_directory_iterator& lhs,
const recursive_directory_iterator& rhs);
};
inline bool operator==(const recursive_directory_iterator& lhs,
const recursive_directory_iterator& rhs) {
// somewhat weak check but for practical purposes should be fine given inode is unique
return lhs.stack_.size() == rhs.stack_.size() &&
(lhs.stack_.empty() || *lhs.stack_.back() == *rhs.stack_.back());
}
inline bool operator!=(const recursive_directory_iterator& lhs,
const recursive_directory_iterator& rhs) {
return !(lhs == rhs);
}
inline bool exists(const path& p) {
return directory_entry(p).exists();
}
inline bool is_directory(const path& p) {
return directory_entry(p).is_directory();
}
} // namespace filesystem
#endif
/**
* Recursively runs the supplied functor on any files that are found (normal or
* otherwise)
*
* @param root_path the directory in which to start the recursion
* @param file_name_handler the functor which will receive the file name of
* each file found
*/
void recurse_files(const char* root_path, const std::function<void(const char*)>& file_name_handler) {
// if its a directory that exists
filesystem::path root(root_path);
if (filesystem::exists(root) && filesystem::is_directory(root)) {
// iterate over all the things in it
for (filesystem::recursive_directory_iterator i(root), end; i != end; ++i) {
// if this thing is a file
// if (i->is_regular_file() || i->is_symlink()) {
// give it to the functor
file_name_handler(i->path().c_str());
//}
}
}
}
int main(int argc, char** argv) {
recurse_files(argv[1], [](const char* path_name) { std::cout << path_name << std::endl; });
return 0;
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment