/* Copyright (c) 2016, Antonio SJ Musumeci 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 #include #include "errno.hpp" #include "fs.hpp" #include "fs_path.hpp" #include "policy.hpp" using std::string; using std::vector; static int _all_create(const vector &basepaths, const uint64_t minfreespace, vector &paths) { for(size_t i = 0, ei = basepaths.size(); i != ei; i++) { bool readonly; uint64_t spaceavail; uint64_t _spaceused; const string *basepath = &basepaths[i]; if(!fs::info(*basepath,readonly,spaceavail,_spaceused)) continue; if(readonly) continue; if(spaceavail < minfreespace) continue; paths.push_back(basepath); } if(paths.empty()) return POLICY_FAIL_ENOENT; return POLICY_SUCCESS; } static int _all_other(const vector &basepaths, const char *fusepath, vector &paths) { string fullpath; for(size_t i = 0, ei = basepaths.size(); i != ei; i++) { const string *basepath = &basepaths[i]; fs::path::make(basepath,fusepath,fullpath); if(!fs::exists(fullpath)) continue; paths.push_back(basepath); } if(paths.empty()) return POLICY_FAIL_ENOENT; return POLICY_SUCCESS; } namespace mergerfs { int Policy::Func::all(const Category::Enum::Type type, const vector &basepaths, const char *fusepath, const uint64_t minfreespace, vector &paths) { if(type == Category::Enum::create) return _all_create(basepaths,minfreespace,paths); return _all_other(basepaths,fusepath,paths); } }