mergerfs/src/policy_newest.cpp

/*
  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 <string>
#include <vector>
#include <limits>

#include <sys/stat.h>

using std::string;
using std::vector;

namespace newest
{
  static
  int
  create(const Branches &branches_,
         const char     *fusepath,
         const uint64_t  minfreespace,
         vector<string> *paths)
  {
    rwlock::ReadGuard guard(&branches_.lock);

    int rv;
    int error;
    time_t newest;
    struct stat st;
    fs::info_t info;
    const Branch *branch;
    const string *newestbasepath;

    error = ENOENT;
    newest = std::numeric_limits<time_t>::min();
    newestbasepath = NULL;
    for(size_t i = 0, ei = branches_.size(); i != ei; i++)
      {
        branch = &branches_[i];

        if(!fs::exists(branch->path,fusepath,&st))
          error_and_continue(error,ENOENT);
        if(branch->ro_or_nc())
          error_and_continue(error,EROFS);
        if(st.st_mtime < newest)
          continue;
        rv = fs::info(&branch->path,&info);
        if(rv == -1)
          error_and_continue(error,ENOENT);
        if(info.readonly)
          error_and_continue(error,EROFS);
        if(info.spaceavail < minfreespace)
          error_and_continue(error,ENOSPC);

        newest = st.st_mtime;
        newestbasepath = &branch->path;
      }

    if(newestbasepath == NULL)
      return (errno=error,-1);

    paths->push_back(*newestbasepath);

    return 0;
  }

  static
  int
  action(const Branches &branches_,
         const char     *fusepath,
         vector<string> *paths)
  {
    rwlock::ReadGuard guard(&branches_.lock);

    int rv;
    int error;
    bool readonly;
    time_t newest;
    struct stat st;
    const Branch *branch;
    const string *newestbasepath;

    error = ENOENT;
    newest = std::numeric_limits<time_t>::min();
    newestbasepath = NULL;
    for(size_t i = 0, ei = branches_.size(); i != ei; i++)
      {
        branch = &branches_[i];

        if(!fs::exists(branch->path,fusepath,&st))
          error_and_continue(error,ENOENT);
        if(branch->ro())
          error_and_continue(error,EROFS);
        if(st.st_mtime < newest)
          continue;
        rv = fs::statvfs_cache_readonly(branch->path,&readonly);
        if(rv == -1)
          error_and_continue(error,ENOENT);
        if(readonly)
          error_and_continue(error,EROFS);

        newest = st.st_mtime;
        newestbasepath = &branch->path;
      }

    if(newestbasepath == NULL)
      return (errno=error,-1);

    paths->push_back(*newestbasepath);

    return 0;
  }

  static
  int
  search(const Branches &branches_,
         const char     *fusepath,
         vector<string> *paths)
  {
    rwlock::ReadGuard guard(&branches_.lock);

    time_t newest;
    struct stat st;
    const Branch *branch;
    const string *newestbasepath;

    newest = std::numeric_limits<time_t>::min();
    newestbasepath = NULL;
    for(size_t i = 0, ei = branches_.size(); i != ei; i++)
      {
        branch = &branches_[i];

        if(!fs::exists(branch->path,fusepath,&st))
          continue;
        if(st.st_mtime < newest)
          continue;

        newest = st.st_mtime;
        newestbasepath = &branch->path;
      }

    if(newestbasepath == NULL)
      return (errno=ENOENT,-1);

    paths->push_back(*newestbasepath);

    return 0;
  }
}

int
Policy::Func::newest(const Category::Enum::Type  type,
                     const Branches             &branches_,
                     const char                 *fusepath,
                     const uint64_t              minfreespace,
                     vector<string>             *paths)
{
  switch(type)
    {
    case Category::Enum::create:
      return newest::create(branches_,fusepath,minfreespace,paths);
    case Category::Enum::action:
      return newest::action(branches_,fusepath,paths);
    case Category::Enum::search:
    default:
      return newest::search(branches_,fusepath,paths);
    }
}