forked from trapexit/mergerfs
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request trapexit#274 from trapexit/lus
add least used space and existing path, least used space policies
- Loading branch information
Showing
14 changed files
with
341 additions
and
8 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,146 @@ | ||
| /* | ||
| 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 <limits> | ||
| #include <string> | ||
| #include <vector> | ||
|
|
||
| #include "fs.hpp" | ||
| #include "fs_path.hpp" | ||
| #include "policy.hpp" | ||
|
|
||
| using std::string; | ||
| using std::vector; | ||
| using std::size_t; | ||
| using mergerfs::Category; | ||
|
|
||
| static | ||
| int | ||
| _eplus_create(const vector<string> &basepaths, | ||
| const char *fusepath, | ||
| const size_t minfreespace, | ||
| vector<const string*> &paths) | ||
| { | ||
| string fullpath; | ||
| size_t eplus; | ||
| const string *eplusbasepath; | ||
|
|
||
| eplus = std::numeric_limits<size_t>::max(); | ||
| eplusbasepath = NULL; | ||
| for(size_t i = 0, ei = basepaths.size(); i != ei; i++) | ||
| { | ||
| bool readonly; | ||
| size_t spaceavail; | ||
| size_t spaceused; | ||
| const string *basepath = &basepaths[i]; | ||
|
|
||
| fs::path::make(basepath,fusepath,fullpath); | ||
|
|
||
| if(!fs::exists(fullpath)) | ||
| continue; | ||
| if(!fs::info(*basepath,readonly,spaceavail,spaceused)) | ||
| continue; | ||
| if(readonly) | ||
| continue; | ||
| if(spaceavail < minfreespace) | ||
| continue; | ||
| if(spaceused >= eplus) | ||
| continue; | ||
|
|
||
| eplus = spaceused; | ||
| eplusbasepath = basepath; | ||
| } | ||
|
|
||
| if(eplusbasepath == NULL) | ||
| return POLICY_FAIL_ENOENT; | ||
|
|
||
| paths.push_back(eplusbasepath); | ||
|
|
||
| return POLICY_SUCCESS; | ||
| } | ||
|
|
||
| static | ||
| int | ||
| _eplus_other(const vector<string> &basepaths, | ||
| const char *fusepath, | ||
| vector<const string*> &paths) | ||
| { | ||
| string fullpath; | ||
| size_t eplus; | ||
| const string *eplusbasepath; | ||
|
|
||
| eplus = 0; | ||
| eplusbasepath = NULL; | ||
| for(size_t i = 0, ei = basepaths.size(); i != ei; i++) | ||
| { | ||
| size_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 >= eplus) | ||
| continue; | ||
|
|
||
| eplus = spaceused; | ||
| eplusbasepath = basepath; | ||
| } | ||
|
|
||
| if(eplusbasepath == NULL) | ||
| return POLICY_FAIL_ENOENT; | ||
|
|
||
| paths.push_back(eplusbasepath); | ||
|
|
||
| return POLICY_SUCCESS; | ||
| } | ||
|
|
||
| static | ||
| int | ||
| _eplus(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 _eplus_create(basepaths,fusepath,minfreespace,paths); | ||
|
|
||
| return _eplus_other(basepaths,fusepath,paths); | ||
| } | ||
|
|
||
| namespace mergerfs | ||
| { | ||
| int | ||
| Policy::Func::eplus(const Category::Enum::Type type, | ||
| const vector<string> &basepaths, | ||
| const char *fusepath, | ||
| const size_t minfreespace, | ||
| vector<const string*> &paths) | ||
| { | ||
| int rv; | ||
|
|
||
| rv = _eplus(type,basepaths,fusepath,minfreespace,paths); | ||
| if(POLICY_FAILED(rv)) | ||
| rv = Policy::Func::lus(type,basepaths,fusepath,minfreespace,paths); | ||
|
|
||
| return rv; | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.