Data_Namespace::anonymous_namespace{DataMgr.cpp}::BuddyinfoBlocks Struct Reference

Classes
struct	Horner

Public Member Functions
	BuddyinfoBlocks ()=default
	BuddyinfoBlocks (std::string_view const *const tokens, size_t const num_blocks)
void	addBlocks (BuddyinfoBlocks const &rhs)
double	fragPercent () const
size_t	highestBlock () const
size_t	sumAvailPages () const

Public Attributes
small_vector< size_t, kMaxBuddyinfoBlocks >	blocks

Detailed Description

Definition at line 774 of file DataMgr.cpp.

Constructor & Destructor Documentation

Data_Namespace::anonymous_namespace{DataMgr.cpp}::BuddyinfoBlocks::BuddyinfoBlocks ( )

default

Data_Namespace::anonymous_namespace{DataMgr.cpp}::BuddyinfoBlocks::BuddyinfoBlocks ( std::string_view const *const  tokens, size_t const  num_blocks  )

inline

Definition at line 785 of file DataMgr.cpp.

                                                                               {
    for (size_t i = 0; i < num_blocks; ++i) {
      size_t block;
      std::from_chars(tokens[i].data(), tokens[i].data() + tokens[i].size(), block);
      blocks.push_back(block);
    }
  }

Member Function Documentation

void Data_Namespace::anonymous_namespace{DataMgr.cpp}::BuddyinfoBlocks::addBlocks ( BuddyinfoBlocks const &  rhs )

inline

Definition at line 793 of file DataMgr.cpp.

References blocks.

                                             {
    if (blocks.size() < rhs.blocks.size()) {
      blocks.resize(rhs.blocks.size(), 0u);
    }
    for (size_t i = 0; i < rhs.blocks.size(); ++i) {
      blocks[i] += rhs.blocks[i];
    }
  }

double Data_Namespace::anonymous_namespace{DataMgr.cpp}::BuddyinfoBlocks::fragPercent ( ) const

inline

Definition at line 802 of file DataMgr.cpp.

References Data_Namespace::anonymous_namespace{DataMgr.cpp}::kErrorCodeOutOfMemory.

                             {
    if (blocks.size() < 2u) {
      return 0.0;  // No fragmentation is possible with only one block column.
    }
    size_t scaled = 0;
    size_t total = 0;
    for (size_t order = 0; order < blocks.size(); ++order) {
      size_t const pages = blocks[order] << order;
      scaled += pages * (blocks.size() - 1 - order) / (blocks.size() - 1);
      total += pages;
    }
    return total ? scaled * 100.0 / total : kErrorCodeOutOfMemory;
  }

size_t Data_Namespace::anonymous_namespace{DataMgr.cpp}::BuddyinfoBlocks::highestBlock ( ) const

inline

Definition at line 816 of file DataMgr.cpp.

{ return blocks.empty() ? 0 : blocks.back(); }

size_t Data_Namespace::anonymous_namespace{DataMgr.cpp}::BuddyinfoBlocks::sumAvailPages ( ) const

inline

Definition at line 818 of file DataMgr.cpp.

References gpu_enabled::accumulate().

                               {
    return std::accumulate(blocks.rbegin(), blocks.rend(), size_t(0), Horner{});
  }

Here is the call graph for this function:

Member Data Documentation

small_vector<size_t, kMaxBuddyinfoBlocks> Data_Namespace::anonymous_namespace{DataMgr.cpp}::BuddyinfoBlocks::blocks

Definition at line 775 of file DataMgr.cpp.

Referenced by addBlocks().

---

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

• /home/jenkins-slave/workspace/core-os-doxygen/DataMgr/DataMgr.cpp