mirror of https://github.com/trapexit/mergerfs.git
Browse Source
Merge pull request #784 from trapexit/policy-mspmfs
Merge pull request #784 from trapexit/policy-mspmfs
policy: add "most shared path" policiespull/786/head
trapexit
5 years ago
committed by
GitHub
GitHub
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
11 changed files with 696 additions and 69 deletions
-
147.cirrus.yml
-
57README.md
-
160man/mergerfs.1
-
12src/fs_exists.hpp
-
2src/fs_path.cpp
-
7src/policy.cpp
-
10src/policy.hpp
-
123src/policy_msplfs.cpp
-
123src/policy_msplus.cpp
-
123src/policy_mspmfs.cpp
-
1tools/git2debcl
@ -0,0 +1,123 @@ |
|||
/*
|
|||
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.hpp"
|
|||
#include "fs.hpp"
|
|||
#include "fs_exists.hpp"
|
|||
#include "fs_info.hpp"
|
|||
#include "fs_path.hpp"
|
|||
#include "fs_statvfs_cache.hpp"
|
|||
#include "policy.hpp"
|
|||
#include "policy_error.hpp"
|
|||
#include "rwlock.hpp"
|
|||
|
|||
#include <limits>
|
|||
#include <string>
|
|||
#include <vector>
|
|||
|
|||
using std::string; |
|||
using std::vector; |
|||
|
|||
|
|||
namespace msplfs |
|||
{ |
|||
static |
|||
const |
|||
string* |
|||
create_1(const Branches &branches_, |
|||
const string &fusepath_, |
|||
const uint64_t minfreespace_, |
|||
int *err_) |
|||
{ |
|||
int rv; |
|||
uint64_t lfs; |
|||
string fusepath; |
|||
fs::info_t info; |
|||
const Branch *branch; |
|||
const string *basepath; |
|||
|
|||
basepath = NULL; |
|||
lfs = std::numeric_limits<uint64_t>::max(); |
|||
for(size_t i = 0, ei = branches_.size(); i != ei; i++) |
|||
{ |
|||
branch = &branches_[i]; |
|||
|
|||
if(!fs::exists(branch->path,fusepath)) |
|||
error_and_continue(*err_,ENOENT); |
|||
if(branch->ro_or_nc()) |
|||
error_and_continue(*err_,EROFS); |
|||
rv = fs::info(&branch->path,&info); |
|||
if(rv == -1) |
|||
error_and_continue(*err_,ENOENT); |
|||
if(info.readonly) |
|||
error_and_continue(*err_,EROFS); |
|||
if(info.spaceavail < minfreespace_) |
|||
error_and_continue(*err_,ENOSPC); |
|||
if(info.spaceavail > lfs) |
|||
continue; |
|||
|
|||
lfs = info.spaceavail; |
|||
basepath = &branch->path; |
|||
} |
|||
|
|||
return basepath; |
|||
} |
|||
|
|||
static |
|||
int |
|||
create(const Branches &branches_, |
|||
const char *fusepath_, |
|||
const uint64_t minfreespace_, |
|||
vector<string> *paths_) |
|||
{ |
|||
int error; |
|||
string fusepath; |
|||
const string *basepath; |
|||
rwlock::ReadGuard guard(&branches_.lock); |
|||
|
|||
error = ENOENT; |
|||
fusepath = fusepath_; |
|||
do |
|||
{ |
|||
basepath = create_1(branches_,fusepath,minfreespace_,&error); |
|||
if(basepath) |
|||
break; |
|||
|
|||
fusepath = fs::path::dirname(fusepath); |
|||
} |
|||
while(!fusepath.empty()); |
|||
|
|||
if(basepath == NULL) |
|||
return (errno=error,-1); |
|||
|
|||
paths_->push_back(*basepath); |
|||
|
|||
return 0; |
|||
} |
|||
} |
|||
|
|||
int |
|||
Policy::Func::msplfs(const Category::Enum::Type type_, |
|||
const Branches &branches_, |
|||
const char *fusepath_, |
|||
const uint64_t minfreespace_, |
|||
vector<string> *paths_) |
|||
{ |
|||
if(type_ == Category::Enum::create) |
|||
return msplfs::create(branches_,fusepath_,minfreespace_,paths_); |
|||
|
|||
return Policy::Func::eplfs(type_,branches_,fusepath_,minfreespace_,paths_); |
|||
} |
|||
@ -0,0 +1,123 @@ |
|||
/*
|
|||
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.hpp"
|
|||
#include "fs.hpp"
|
|||
#include "fs_exists.hpp"
|
|||
#include "fs_info.hpp"
|
|||
#include "fs_path.hpp"
|
|||
#include "fs_statvfs_cache.hpp"
|
|||
#include "policy.hpp"
|
|||
#include "policy_error.hpp"
|
|||
#include "rwlock.hpp"
|
|||
|
|||
#include <limits>
|
|||
#include <string>
|
|||
#include <vector>
|
|||
|
|||
using std::string; |
|||
using std::vector; |
|||
|
|||
|
|||
namespace msplus |
|||
{ |
|||
static |
|||
const |
|||
string* |
|||
create_1(const Branches &branches_, |
|||
const string &fusepath_, |
|||
const uint64_t minfreespace_, |
|||
int *err_) |
|||
{ |
|||
int rv; |
|||
uint64_t lus; |
|||
string fusepath; |
|||
fs::info_t info; |
|||
const Branch *branch; |
|||
const string *basepath; |
|||
|
|||
basepath = NULL; |
|||
lus = std::numeric_limits<uint64_t>::max(); |
|||
for(size_t i = 0, ei = branches_.size(); i != ei; i++) |
|||
{ |
|||
branch = &branches_[i]; |
|||
|
|||
if(!fs::exists(branch->path,fusepath)) |
|||
error_and_continue(*err_,ENOENT); |
|||
if(branch->ro_or_nc()) |
|||
error_and_continue(*err_,EROFS); |
|||
rv = fs::info(&branch->path,&info); |
|||
if(rv == -1) |
|||
error_and_continue(*err_,ENOENT); |
|||
if(info.readonly) |
|||
error_and_continue(*err_,EROFS); |
|||
if(info.spaceavail < minfreespace_) |
|||
error_and_continue(*err_,ENOSPC); |
|||
if(info.spaceused >= lus) |
|||
continue; |
|||
|
|||
lus = info.spaceused;; |
|||
basepath = &branch->path; |
|||
} |
|||
|
|||
return basepath; |
|||
} |
|||
|
|||
static |
|||
int |
|||
create(const Branches &branches_, |
|||
const char *fusepath_, |
|||
const uint64_t minfreespace_, |
|||
vector<string> *paths_) |
|||
{ |
|||
int error; |
|||
string fusepath; |
|||
const string *basepath; |
|||
rwlock::ReadGuard guard(&branches_.lock); |
|||
|
|||
error = ENOENT; |
|||
fusepath = fusepath_; |
|||
do |
|||
{ |
|||
basepath = create_1(branches_,fusepath,minfreespace_,&error); |
|||
if(basepath) |
|||
break; |
|||
|
|||
fusepath = fs::path::dirname(fusepath); |
|||
} |
|||
while(!fusepath.empty()); |
|||
|
|||
if(basepath == NULL) |
|||
return (errno=error,-1); |
|||
|
|||
paths_->push_back(*basepath); |
|||
|
|||
return 0; |
|||
} |
|||
} |
|||
|
|||
int |
|||
Policy::Func::msplus(const Category::Enum::Type type_, |
|||
const Branches &branches_, |
|||
const char *fusepath_, |
|||
const uint64_t minfreespace_, |
|||
vector<string> *paths_) |
|||
{ |
|||
if(type_ == Category::Enum::create) |
|||
return msplus::create(branches_,fusepath_,minfreespace_,paths_); |
|||
|
|||
return Policy::Func::eplus(type_,branches_,fusepath_,minfreespace_,paths_); |
|||
} |
|||
@ -0,0 +1,123 @@ |
|||
/*
|
|||
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.hpp"
|
|||
#include "fs.hpp"
|
|||
#include "fs_exists.hpp"
|
|||
#include "fs_info.hpp"
|
|||
#include "fs_path.hpp"
|
|||
#include "fs_statvfs_cache.hpp"
|
|||
#include "policy.hpp"
|
|||
#include "policy_error.hpp"
|
|||
#include "rwlock.hpp"
|
|||
|
|||
#include <limits>
|
|||
#include <string>
|
|||
#include <vector>
|
|||
|
|||
using std::string; |
|||
using std::vector; |
|||
|
|||
|
|||
namespace mspmfs |
|||
{ |
|||
static |
|||
const |
|||
string* |
|||
create_1(const Branches &branches_, |
|||
const string &fusepath_, |
|||
const uint64_t minfreespace_, |
|||
int *err_) |
|||
{ |
|||
int rv; |
|||
uint64_t mfs; |
|||
string fusepath; |
|||
fs::info_t info; |
|||
const Branch *branch; |
|||
const string *basepath; |
|||
|
|||
basepath = NULL; |
|||
mfs = std::numeric_limits<uint64_t>::min(); |
|||
for(size_t i = 0, ei = branches_.size(); i != ei; i++) |
|||
{ |
|||
branch = &branches_[i]; |
|||
|
|||
if(!fs::exists(branch->path,fusepath)) |
|||
error_and_continue(*err_,ENOENT); |
|||
if(branch->ro_or_nc()) |
|||
error_and_continue(*err_,EROFS); |
|||
rv = fs::info(&branch->path,&info); |
|||
if(rv == -1) |
|||
error_and_continue(*err_,ENOENT); |
|||
if(info.readonly) |
|||
error_and_continue(*err_,EROFS); |
|||
if(info.spaceavail < minfreespace_) |
|||
error_and_continue(*err_,ENOSPC); |
|||
if(info.spaceavail < mfs) |
|||
continue; |
|||
|
|||
mfs = info.spaceavail; |
|||
basepath = &branch->path; |
|||
} |
|||
|
|||
return basepath; |
|||
} |
|||
|
|||
static |
|||
int |
|||
create(const Branches &branches_, |
|||
const char *fusepath_, |
|||
const uint64_t minfreespace_, |
|||
vector<string> *paths_) |
|||
{ |
|||
int error; |
|||
string fusepath; |
|||
const string *basepath; |
|||
rwlock::ReadGuard guard(&branches_.lock); |
|||
|
|||
error = ENOENT; |
|||
fusepath = fusepath_; |
|||
do |
|||
{ |
|||
basepath = create_1(branches_,fusepath,minfreespace_,&error); |
|||
if(basepath) |
|||
break; |
|||
|
|||
fusepath = fs::path::dirname(fusepath); |
|||
} |
|||
while(!fusepath.empty()); |
|||
|
|||
if(basepath == NULL) |
|||
return (errno=error,-1); |
|||
|
|||
paths_->push_back(*basepath); |
|||
|
|||
return 0; |
|||
} |
|||
} |
|||
|
|||
int |
|||
Policy::Func::mspmfs(const Category::Enum::Type type_, |
|||
const Branches &branches_, |
|||
const char *fusepath_, |
|||
const uint64_t minfreespace_, |
|||
vector<string> *paths_) |
|||
{ |
|||
if(type_ == Category::Enum::create) |
|||
return mspmfs::create(branches_,fusepath_,minfreespace_,paths_); |
|||
|
|||
return Policy::Func::epmfs(type_,branches_,fusepath_,minfreespace_,paths_); |
|||
} |
|||
Write
Preview
Loading…
Cancel
Save
Reference in new issue