llfio_v2_xxx::algorithm::traversal_summary Struct Reference

A summary of a directory tree. More...

#include "summarize.hpp"

Inheritance diagram for llfio_v2_xxx::algorithm::traversal_summary:

Public Types
template<class T >
using	map_type = std::unordered_map< T, size_t >

Public Member Functions
	traversal_summary (const traversal_summary &o)
	traversal_summary (traversal_summary &&o) noexcept
traversal_summary &	operator= (const traversal_summary &o)
traversal_summary &	operator= (traversal_summary &&o) noexcept
traversal_summary &	operator+= (const traversal_summary &o)
	Adds another summary to this.

Static Public Member Functions
static constexpr stat_t::want	default_metadata ()
	The default metadata summarised.

Public Attributes
spinlock	_lock
size_t	stats_failed {0}
	The number of handle stat's which failed.
size_t	directory_opens_failed {0}
	The number of directories which could not be opened.
stat_t::want	want {stat_t::want::none}
	The summary items desired.
map_type< uint64_t >	devs
	The number of items with the given device id.
map_type< filesystem::file_type >	types
	The number of items with the given type.
handle::extent_type	size {0}
	The sum of maximum extents. On Windows, is for file content only.
handle::extent_type	allocated {0}
	The sum of allocated extents. On Windows, is for file content only.
handle::extent_type	file_blocks {0}
	The sum of file allocated blocks.
handle::extent_type	directory_blocks {0}
	The sum of directory allocated blocks.
size_t	max_depth {0}
	The maximum depth of the hierarchy.

Detailed Description

A summary of a directory tree.

Constructor & Destructor Documentation

traversal_summary() [1/3]

llfio_v2_xxx::algorithm::traversal_summary::traversal_summary ( )

inline

{}

traversal_summary() [2/3]

llfio_v2_xxx::algorithm::traversal_summary::traversal_summary ( const traversal_summary &  o )

inline

        : directory_opens_failed(o.directory_opens_failed)
        , want(o.want)
        , devs(o.devs)
        , types(o.types)
        , size(o.size)
        , allocated(o.allocated)
        , file_blocks(o.file_blocks)
        , directory_blocks(o.directory_blocks)
        , max_depth(o.max_depth)
    {
      assert(!is_lockable_locked(o._lock));
    }

traversal_summary() [3/3]

llfio_v2_xxx::algorithm::traversal_summary::traversal_summary ( traversal_summary &&  o )

inlinenoexcept

        : directory_opens_failed(o.directory_opens_failed)
        , want(o.want)
        , devs(std::move(o.devs))
        , types(std::move(o.types))
        , size(o.size)
        , allocated(o.allocated)
        , file_blocks(o.file_blocks)
        , directory_blocks(o.directory_blocks)
        , max_depth(o.max_depth)
    {
      assert(!is_lockable_locked(o._lock));
    }

Member Function Documentation

default_metadata()

static constexpr stat_t::want llfio_v2_xxx::algorithm::traversal_summary::default_metadata ( )

inlinestaticconstexpr

The default metadata summarised.

    {
      return stat_t::want::dev | stat_t::want::type | stat_t::want::size | stat_t::want::allocated | stat_t::want::blocks;
    }

operator+=()

traversal_summary & llfio_v2_xxx::algorithm::traversal_summary::operator+= ( const traversal_summary &  o )

inline

Adds another summary to this.

    {
      lock_guard<spinlock> g(_lock);
      directory_opens_failed += o.directory_opens_failed;
      for(auto &i : o.devs)
      {
        devs[i.first] += i.second;
      }
      for(auto &i : o.types)
      {
        types[i.first] += i.second;
      }
      size += o.size;
      allocated += o.allocated;
      file_blocks += o.file_blocks;
      directory_blocks += o.directory_blocks;
      max_depth = std::max(max_depth, o.max_depth);
      return *this;
    }

operator=() [1/2]

traversal_summary & llfio_v2_xxx::algorithm::traversal_summary::operator= ( const traversal_summary &  o )

inline

    {
      if(this != &o)
      {
        directory_opens_failed = o.directory_opens_failed;
        want = o.want;
        devs = o.devs;
        types = o.types;
        size = o.size;
        allocated = o.allocated;
        file_blocks = o.file_blocks;
        directory_blocks = o.directory_blocks;
        max_depth = o.max_depth;
      }
      return *this;
    }

operator=() [2/2]

traversal_summary & llfio_v2_xxx::algorithm::traversal_summary::operator= ( traversal_summary &&  o )

inlinenoexcept

    {
      if(this != &o)
      {
        directory_opens_failed = o.directory_opens_failed;
        want = o.want;
        devs = std::move(o.devs);
        types = std::move(o.types);
        size = o.size;
        allocated = o.allocated;
        file_blocks = o.file_blocks;
        directory_blocks = o.directory_blocks;
        max_depth = o.max_depth;
      }
      return *this;
    }

Member Data Documentation

allocated

handle::extent_type llfio_v2_xxx::algorithm::traversal_summary::allocated {0}

The sum of allocated extents. On Windows, is for file content only.

{0};         //!< The sum of allocated extents. On Windows, is for file content only.

directory_blocks

handle::extent_type llfio_v2_xxx::algorithm::traversal_summary::directory_blocks {0}

The sum of directory allocated blocks.

{0};  //!< The sum of directory allocated blocks.

directory_opens_failed

size_t llfio_v2_xxx::algorithm::traversal_summary::directory_opens_failed {0}

The number of directories which could not be opened.

{0};  //!< The number of directories which could not be opened.

file_blocks

handle::extent_type llfio_v2_xxx::algorithm::traversal_summary::file_blocks {0}

The sum of file allocated blocks.

{0};       //!< The sum of file allocated blocks.

max_depth

size_t llfio_v2_xxx::algorithm::traversal_summary::max_depth {0}

The maximum depth of the hierarchy.

{0};                      //!< The maximum depth of the hierarchy

size

handle::extent_type llfio_v2_xxx::algorithm::traversal_summary::size {0}

The sum of maximum extents. On Windows, is for file content only.

{0};              //!< The sum of maximum extents. On Windows, is for file content only.

stats_failed

size_t llfio_v2_xxx::algorithm::traversal_summary::stats_failed {0}

The number of handle stat's which failed.

{0};            //!< The number of handle stat's which failed.

want

stat_t::want llfio_v2_xxx::algorithm::traversal_summary::want {stat_t::want::none}

The summary items desired.

{stat_t::want::none};    //!< The summary items desired

---

The documentation for this struct was generated from the following file:

• include/llfio/v2.0/algorithm/summarize.hpp