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.
201 lines
5.4 KiB
201 lines
5.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.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include "branch.hpp"
|
|
#include "category.hpp"
|
|
#include "fs.hpp"
|
|
|
|
#include <map>
|
|
#include <string>
|
|
#include <vector>
|
|
|
|
class Policy
|
|
{
|
|
public:
|
|
struct Enum
|
|
{
|
|
enum Type
|
|
{
|
|
invalid = -1,
|
|
BEGIN = 0,
|
|
all = BEGIN,
|
|
epall,
|
|
epff,
|
|
eplfs,
|
|
eplus,
|
|
epmfs,
|
|
eprand,
|
|
erofs,
|
|
ff,
|
|
lfs,
|
|
lus,
|
|
mfs,
|
|
newest,
|
|
rand,
|
|
END
|
|
};
|
|
|
|
static size_t begin() { return BEGIN; }
|
|
static size_t end() { return END; }
|
|
};
|
|
|
|
struct Func
|
|
{
|
|
typedef std::string string;
|
|
typedef std::vector<string> strvec;
|
|
typedef std::vector<const string*> cstrptrvec;
|
|
typedef const string cstring;
|
|
typedef const uint64_t cuint64_t;
|
|
typedef const strvec cstrvec;
|
|
typedef const Category::Enum::Type CType;
|
|
|
|
typedef int (*Ptr)(CType,const Branches &,const char *,cuint64_t,cstrptrvec &);
|
|
|
|
template <CType T>
|
|
class Base
|
|
{
|
|
public:
|
|
Base(const Policy *p)
|
|
: func(p->_func)
|
|
{}
|
|
|
|
int
|
|
operator()(const Branches &b,const char *c,cuint64_t d,cstrptrvec &e)
|
|
{
|
|
return func(T,b,c,d,e);
|
|
}
|
|
|
|
int
|
|
operator()(const Branches &b,const string &c,cuint64_t d,cstrptrvec &e)
|
|
{
|
|
return func(T,b,c.c_str(),d,e);
|
|
}
|
|
|
|
int
|
|
operator()(const Branches &b,const char *c,cuint64_t d,string *e)
|
|
{
|
|
int rv;
|
|
cstrptrvec v;
|
|
|
|
rv = func(T,b,c,d,v);
|
|
if(!v.empty())
|
|
*e = *v[0];
|
|
|
|
return rv;
|
|
}
|
|
|
|
private:
|
|
const Ptr func;
|
|
};
|
|
|
|
typedef Base<Category::Enum::action> Action;
|
|
typedef Base<Category::Enum::create> Create;
|
|
typedef Base<Category::Enum::search> Search;
|
|
|
|
static int invalid(CType,const Branches&,const char *,cuint64_t,cstrptrvec&);
|
|
static int all(CType,const Branches&,const char*,cuint64_t,cstrptrvec&);
|
|
static int epall(CType,const Branches&,const char*,cuint64_t,cstrptrvec&);
|
|
static int epff(CType,const Branches&,const char *,cuint64_t,cstrptrvec&);
|
|
static int eplfs(CType,const Branches&,const char *,cuint64_t,cstrptrvec&);
|
|
static int eplus(CType,const Branches&,const char *,cuint64_t,cstrptrvec&);
|
|
static int epmfs(CType,const Branches&,const char *,cuint64_t,cstrptrvec&);
|
|
static int eprand(CType,const Branches&,const char *,cuint64_t,cstrptrvec&);
|
|
static int erofs(CType,const Branches&,const char *,cuint64_t,cstrptrvec&);
|
|
static int ff(CType,const Branches&,const char *,cuint64_t,cstrptrvec&);
|
|
static int lfs(CType,const Branches&,const char *,cuint64_t,cstrptrvec&);
|
|
static int lus(CType,const Branches&,const char *,cuint64_t,cstrptrvec&);
|
|
static int mfs(CType,const Branches&,const char *,cuint64_t,cstrptrvec&);
|
|
static int newest(CType,const Branches&,const char *,cuint64_t,cstrptrvec&);
|
|
static int rand(CType,const Branches&,const char *,cuint64_t,cstrptrvec&);
|
|
};
|
|
|
|
private:
|
|
Enum::Type _enum;
|
|
std::string _str;
|
|
Func::Ptr _func;
|
|
bool _path_preserving;
|
|
|
|
public:
|
|
Policy()
|
|
: _enum(invalid),
|
|
_str(invalid),
|
|
_func(invalid),
|
|
_path_preserving(false)
|
|
{
|
|
}
|
|
|
|
Policy(const Enum::Type enum_,
|
|
const std::string &str_,
|
|
const Func::Ptr func_,
|
|
const bool path_preserving_)
|
|
: _enum(enum_),
|
|
_str(str_),
|
|
_func(func_),
|
|
_path_preserving(path_preserving_)
|
|
{
|
|
}
|
|
|
|
bool
|
|
path_preserving() const
|
|
{
|
|
return _path_preserving;
|
|
}
|
|
|
|
public:
|
|
operator const Enum::Type() const { return _enum; }
|
|
operator const std::string&() const { return _str; }
|
|
operator const Func::Ptr() const { return _func; }
|
|
operator const Policy*() const { return this; }
|
|
|
|
bool operator==(const Enum::Type enum_) const
|
|
{ return _enum == enum_; }
|
|
bool operator==(const std::string &str_) const
|
|
{ return _str == str_; }
|
|
bool operator==(const Func::Ptr func_) const
|
|
{ return _func == func_; }
|
|
|
|
bool operator!=(const Policy &r) const
|
|
{ return _enum != r._enum; }
|
|
|
|
bool operator<(const Policy &r) const
|
|
{ return _enum < r._enum; }
|
|
|
|
public:
|
|
static const Policy &find(const std::string&);
|
|
static const Policy &find(const Enum::Type);
|
|
|
|
public:
|
|
static const std::vector<Policy> _policies_;
|
|
static const Policy * const policies;
|
|
|
|
static const Policy &invalid;
|
|
static const Policy &all;
|
|
static const Policy &epall;
|
|
static const Policy &epff;
|
|
static const Policy &eplfs;
|
|
static const Policy ⩱
|
|
static const Policy &epmfs;
|
|
static const Policy &eprand;
|
|
static const Policy &erofs;
|
|
static const Policy &ff;
|
|
static const Policy &lfs;
|
|
static const Policy &lus;
|
|
static const Policy &mfs;
|
|
static const Policy &newest;
|
|
static const Policy &rand;
|
|
};
|