mirror of
https://github.com/trapexit/mergerfs.git
synced 2024-04-21 12:31:43 +00:00
Antonio SJ Musumeci
4ecf3c5797
Used statvfs to also check for existance vs lstat. On dead symlinks this resulted in ENOENT making certain functions fail. closes #239
123 lines
3.0 KiB
C++
123 lines
3.0 KiB
C++
/*
|
|
Copyright (c) 2016, Antonio SJ Musumeci <trapexit@spawn.link>
|
|
|
|
Permission to use, copy, modify, and/or distribute this software for any
|
|
purpose with or without fee is hereby granted, provided that the above
|
|
copyright notice and this permission notice appear in all copies.
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
|
WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
|
MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
|
|
ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
|
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
|
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
|
|
OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
|
*/
|
|
|
|
#include <errno.h>
|
|
#include <sys/stat.h>
|
|
|
|
#include <string>
|
|
#include <vector>
|
|
#include <limits>
|
|
|
|
#include "fs.hpp"
|
|
#include "fs_path.hpp"
|
|
#include "policy.hpp"
|
|
#include "success_fail.hpp"
|
|
|
|
using std::string;
|
|
using std::vector;
|
|
using std::size_t;
|
|
|
|
static
|
|
int
|
|
_newest_create(const vector<string> &basepaths,
|
|
const char *fusepath,
|
|
vector<const string*> &paths)
|
|
{
|
|
time_t newest;
|
|
string fullpath;
|
|
const string *newestbasepath;
|
|
|
|
newest = std::numeric_limits<time_t>::min();
|
|
newestbasepath = NULL;
|
|
for(size_t i = 0, ei = basepaths.size(); i != ei; i++)
|
|
{
|
|
|
|
struct stat st;
|
|
const string *basepath = &basepaths[i];
|
|
|
|
fs::path::make(basepath,fusepath,fullpath);
|
|
|
|
if(!fs::exists(fullpath,st))
|
|
continue;
|
|
if(st.st_mtime < newest)
|
|
continue;
|
|
if(fs::readonly(*basepath))
|
|
continue;
|
|
|
|
newest = st.st_mtime;
|
|
newestbasepath = basepath;
|
|
}
|
|
|
|
if(newestbasepath == NULL)
|
|
return POLICY_FAIL_ENOENT;
|
|
|
|
paths.push_back(newestbasepath);
|
|
|
|
return POLICY_SUCCESS;
|
|
}
|
|
|
|
static
|
|
int
|
|
_newest_other(const vector<string> &basepaths,
|
|
const char *fusepath,
|
|
vector<const string*> &paths)
|
|
{
|
|
time_t newest;
|
|
string fullpath;
|
|
const string *newestbasepath;
|
|
|
|
newest = std::numeric_limits<time_t>::min();
|
|
newestbasepath = NULL;
|
|
for(size_t i = 0, ei = basepaths.size(); i != ei; i++)
|
|
{
|
|
struct stat st;
|
|
const string *basepath = &basepaths[i];
|
|
|
|
fs::path::make(basepath,fusepath,fullpath);
|
|
|
|
if(!fs::exists(fullpath,st))
|
|
continue;
|
|
if(st.st_mtime < newest)
|
|
continue;
|
|
|
|
newest = st.st_mtime;
|
|
newestbasepath = basepath;
|
|
}
|
|
|
|
if(newestbasepath == NULL)
|
|
return POLICY_FAIL_ENOENT;
|
|
|
|
paths.push_back(newestbasepath);
|
|
|
|
return POLICY_SUCCESS;
|
|
}
|
|
|
|
namespace mergerfs
|
|
{
|
|
int
|
|
Policy::Func::newest(const Category::Enum::Type type,
|
|
const vector<string> &basepaths,
|
|
const char *fusepath,
|
|
const size_t minfreespace,
|
|
vector<const string*> &paths)
|
|
{
|
|
if(type == Category::Enum::create)
|
|
return _newest_create(basepaths,fusepath,paths);
|
|
|
|
return _newest_other(basepaths,fusepath,paths);
|
|
}
|
|
}
|