CMS 3D CMS Logo

StorageAccount.cc
Go to the documentation of this file.
2 #include <cassert>
3 #include <mutex>
4 #include <sstream>
5 #include <unistd.h>
6 #include <sys/time.h>
7 
8 namespace {
9  char const * const kOperationNames[] = {
10  "check",
11  "close",
12  "construct",
13  "destruct",
14  "flush",
15  "open",
16  "position",
17  "prefetch",
18  "read",
19  "readActual",
20  "readAsync",
21  "readPrefetchToCache",
22  "readViaCache",
23  "readv",
24  "resize",
25  "seek",
26  "stagein",
27  "stat",
28  "write",
29  "writeActual",
30  "writeViaCache",
31  "writev"
32  };
33 
34  //Storage class names to the value of the token to which they are assigned
35  tbb::concurrent_unordered_map<std::string, int> s_nameToToken;
36  std::atomic<int> s_nextTokenValue{0};
37 }
38 
40 
41 static std::string i2str(int i) {
42  std::ostringstream t;
43  t << i;
44  return t.str();
45 }
46 
47 static std::string d2str(double d) {
48  std::ostringstream t;
49  t << d;
50  return t.str();
51 }
52 
53 inline char const* StorageAccount::operationName(Operation operation) {
54  return kOperationNames[static_cast<int>(operation)];
55 }
56 
58  auto itFound = s_nameToToken.find(iName);
59  if( itFound != s_nameToToken.end()) {
60  return StorageClassToken(itFound->second);
61  }
62  int value = s_nextTokenValue++;
63 
64  s_nameToToken.insert(std::make_pair(iName, value));
65 
66  return StorageClassToken(value);
67 }
68 
70  for( auto it = s_nameToToken.begin(), itEnd = s_nameToToken.end(); it != itEnd; ++it) {
71  if (it->second == iToken.value()) {
72  return it->first;
73  }
74  }
75  assert(false);
76 }
77 
78 
80 StorageAccount::summaryText (bool banner /*=false*/) {
81  bool first = true;
82  std::ostringstream os;
83  if (banner)
84  os << "stats: class/operation/attempts/successes/amount/time-total/time-min/time-max\n";
85  for (auto i = s_nameToToken.begin (); i != s_nameToToken.end(); ++i) {
86  auto const& opStats = m_stats[i->second];
87  for (auto j = opStats.begin (); j != opStats.end (); ++j, first = false)
88  os << (first ? "" : "; ")
89  << (i->first) << '/'
90  << kOperationNames[j->first] << '='
91  << j->second.attempts << '/'
92  << j->second.successes << '/'
93  << (static_cast<double>(j->second.amount) / 1024 / 1024) << "MB/"
94  << (static_cast<double>(j->second.timeTotal) / 1000 / 1000) << "ms/"
95  << (static_cast<double>(j->second.timeMin) / 1000 / 1000) << "ms/"
96  << (static_cast<double>(j->second.timeMax) / 1000 / 1000) << "ms";
97  }
98  return os.str ();
99 }
100 
101 void
102 StorageAccount::fillSummary(std::map<std::string, std::string>& summary) {
103  int const oneM = 1000 * 1000;
104  int const oneMeg = 1024 * 1024;
105  for (auto i = s_nameToToken.begin (); i != s_nameToToken.end(); ++i) {
106  auto const& opStats = m_stats[i->second];
107  for (auto j = opStats.begin(); j != opStats.end(); ++j) {
108  std::ostringstream os;
109  os << "Timing-" << i->first << "-" << kOperationNames[j->first] << "-";
110  summary.insert(std::make_pair(os.str() + "numOperations", i2str(j->second.attempts)));
111  summary.insert(std::make_pair(os.str() + "numSuccessfulOperations", i2str(j->second.successes)));
112  summary.insert(std::make_pair(os.str() + "totalMegabytes", d2str(static_cast<double>(j->second.amount) / oneMeg)));
113  summary.insert(std::make_pair(os.str() + "totalMsecs", d2str(static_cast<double>(j->second.timeTotal) / oneM)));
114  summary.insert(std::make_pair(os.str() + "minMsecs", d2str(static_cast<double>(j->second.timeMin) / oneM)));
115  summary.insert(std::make_pair(os.str() + "maxMsecs", d2str(static_cast<double>(j->second.timeMax) / oneM)));
116  }
117  }
118 }
119 
122 { return m_stats; }
123 
126  auto &opstats = m_stats [token.value()];
127 
128  return opstats[static_cast<int>(operation)];
129 }
130 
132  : m_counter (counter),
133  m_start (std::chrono::high_resolution_clock::now())
134 {
136 }
137 
138 void
140 {
142  uint64_t elapsed = elapsed_ns.count();
144 
146  m_counter.vector_square += count*count;
147  m_counter.amount += amount;
148  Counter::addTo(m_counter.amount_square, amount*amount);
149 
151  if (elapsed < m_counter.timeMin || m_counter.successes == 1)
152  m_counter.timeMin = elapsed;
153  if (elapsed > m_counter.timeMax)
154  m_counter.timeMax = elapsed;
155 }
static StorageStats m_stats
static void fillSummary(std::map< std::string, std::string > &summary)
static char const * operationName(Operation operation)
std::atomic< double > timeMax
static const StorageStats & summary(void)
std::atomic< uint64_t > attempts
std::atomic< int64_t > vector_square
std::atomic< int64_t > vector_count
static std::string d2str(double d)
tbb::concurrent_unordered_map< int, OperationStats > StorageStats
std::atomic< double > timeMin
std::chrono::time_point< std::chrono::high_resolution_clock > m_start
static StorageClassToken tokenForStorageClassName(std::string const &iName)
std::atomic< uint64_t > successes
static void addTo(std::atomic< double > &iAtomic, double iToAdd)
Definition: value.py:1
static const std::string & nameForToken(StorageClassToken)
std::atomic< double > amount_square
static std::string i2str(int i)
std::atomic< uint64_t > amount
static Counter & counter(StorageClassToken token, Operation operation)
unsigned long long uint64_t
Definition: Time.h:15
void tick(uint64_t amount=0, int64_t tick=0) const
Stamp(Counter &counter)
static std::string summaryText(bool banner=false)
std::atomic< double > timeTotal
boost::date_time::subsecond_duration< boost::posix_time::time_duration, 1000000000 > nanoseconds