mirror of https://github.com/trapexit/mergerfs.git
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
139 lines
3.4 KiB
139 lines
3.4 KiB
/*
|
|
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 <limits>
|
|
#include <string>
|
|
#include <vector>
|
|
|
|
#include "errno.hpp"
|
|
#include "fs.hpp"
|
|
#include "fs_path.hpp"
|
|
#include "policy.hpp"
|
|
|
|
using std::string;
|
|
using std::vector;
|
|
using mergerfs::Category;
|
|
|
|
static
|
|
int
|
|
_lus_create(const vector<string> &basepaths,
|
|
const uint64_t minfreespace,
|
|
vector<const string*> &paths)
|
|
{
|
|
string fullpath;
|
|
uint64_t lus;
|
|
const string *lusbasepath;
|
|
|
|
lus = std::numeric_limits<uint64_t>::max();
|
|
lusbasepath = NULL;
|
|
for(size_t i = 0, ei = basepaths.size(); i != ei; i++)
|
|
{
|
|
bool readonly;
|
|
uint64_t spaceused;
|
|
uint64_t spaceavail;
|
|
const string *basepath = &basepaths[i];
|
|
|
|
if(!fs::info(*basepath,readonly,spaceavail,spaceused))
|
|
continue;
|
|
if(readonly)
|
|
continue;
|
|
if(spaceavail < minfreespace)
|
|
continue;
|
|
if(spaceused >= lus)
|
|
continue;
|
|
|
|
lus = spaceused;
|
|
lusbasepath = basepath;
|
|
}
|
|
|
|
if(lusbasepath == NULL)
|
|
return POLICY_FAIL_ENOENT;
|
|
|
|
paths.push_back(lusbasepath);
|
|
|
|
return POLICY_SUCCESS;
|
|
}
|
|
|
|
static
|
|
int
|
|
_lus_other(const vector<string> &basepaths,
|
|
const char *fusepath,
|
|
vector<const string*> &paths)
|
|
{
|
|
string fullpath;
|
|
uint64_t lus;
|
|
const string *lusbasepath;
|
|
|
|
lus = 0;
|
|
lusbasepath = NULL;
|
|
for(size_t i = 0, ei = basepaths.size(); i != ei; i++)
|
|
{
|
|
uint64_t spaceused;
|
|
const string *basepath = &basepaths[i];
|
|
|
|
fs::path::make(basepath,fusepath,fullpath);
|
|
|
|
if(!fs::exists(fullpath))
|
|
continue;
|
|
if(!fs::spaceused(*basepath,spaceused))
|
|
continue;
|
|
if(spaceused >= lus)
|
|
continue;
|
|
|
|
lus = spaceused;
|
|
lusbasepath = basepath;
|
|
}
|
|
|
|
if(lusbasepath == NULL)
|
|
return POLICY_FAIL_ENOENT;
|
|
|
|
paths.push_back(lusbasepath);
|
|
|
|
return POLICY_SUCCESS;
|
|
}
|
|
|
|
static
|
|
int
|
|
_lus(const Category::Enum::Type type,
|
|
const vector<string> &basepaths,
|
|
const char *fusepath,
|
|
const uint64_t minfreespace,
|
|
vector<const string*> &paths)
|
|
{
|
|
if(type == Category::Enum::create)
|
|
return _lus_create(basepaths,minfreespace,paths);
|
|
|
|
return _lus_other(basepaths,fusepath,paths);
|
|
}
|
|
|
|
namespace mergerfs
|
|
{
|
|
int
|
|
Policy::Func::lus(const Category::Enum::Type type,
|
|
const vector<string> &basepaths,
|
|
const char *fusepath,
|
|
const uint64_t minfreespace,
|
|
vector<const string*> &paths)
|
|
{
|
|
int rv;
|
|
|
|
rv = _lus(type,basepaths,fusepath,minfreespace,paths);
|
|
if(POLICY_FAILED(rv))
|
|
rv = Policy::Func::mfs(type,basepaths,fusepath,minfreespace,paths);
|
|
|
|
return rv;
|
|
}
|
|
}
|