Leak reports collect information about the last uptrend

components/metrics/leak_detector/call_stack_table.cc

 // Copyright 2015 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "components/metrics/leak_detector/call_stack_table.h"
 
 #include <algorithm>
 
 #include "components/metrics/leak_detector/call_stack_manager.h"
 
@@ skipping 24 matching lines @@
 CallStackTable::CallStackTable(int call_stack_suspicion_threshold)
     : num_allocs_(0),
       num_frees_(0),
       entry_map_(kInitialHashTableSize),
       leak_analyzer_(kMaxCountOfSuspciousStacks,
                      call_stack_suspicion_threshold) {}
 
 CallStackTable::~CallStackTable() {}
 
 void CallStackTable::Add(const CallStack* call_stack) {
-  ++entry_map_[call_stack];
+  ++(entry_map_[call_stack].count);

[Simon Que, 2016/10/11 01:11:05]

The parentheses are not necessary. [] and . have higher precedence than prefix
++.

http://en.cppreference.com/w/cpp/language/operator_precedence

[mwlodar, 2016/10/11 07:13:23]

Done.

   ++num_allocs_;
 }
 
 void CallStackTable::Remove(const CallStack* call_stack) {
   auto iter = entry_map_.find(call_stack);
   if (iter == entry_map_.end())
     return;
-  uint32_t& count_for_call_stack = iter->second;
+  uint32_t& count_for_call_stack = iter->second.count;
   --count_for_call_stack;
   ++num_frees_;
 
   // Delete zero-alloc entries to free up space.
   if (count_for_call_stack == 0)
     entry_map_.erase(iter);
 }
 
 void CallStackTable::TestForLeaks() {
   // Add all entries to the ranked list.
   RankedSet ranked_entries(kMaxCountOfSuspciousStacks);
   GetTopCallStacks(&ranked_entries);
   leak_analyzer_.AddSample(std::move(ranked_entries));
 }
 
 void CallStackTable::GetTopCallStacks(RankedSet* top_entries) const {
-  for (const auto& call_stack_and_count : entry_map_) {
-    top_entries->AddCallStack(call_stack_and_count.first,
-                              call_stack_and_count.second);
+  for (const auto& call_stack_count_info : entry_map_) {
+    top_entries->AddCallStack(call_stack_count_info.first,
+                              call_stack_count_info.second.count);
   }
 }
 
+void CallStackTable::UpdateLastDropInfo(size_t timestamp) {
+  for (auto& call_stack_and_info : entry_map_) {
+    auto& call_stack_count_info = call_stack_and_info.second;

[Simon Que, 2016/10/11 01:11:05]

Nit: Easier to just call this "count_info". Also in GetLastUptrendInfo.

[mwlodar, 2016/10/11 07:13:23]

Done.

+
+    // If the |previous_count| is 0 then we need to initialize info.

[Simon Que, 2016/10/11 01:11:05]

Where is each CallStackCountInfo initialized? They are created in Add() but it
seems with the assumption that they are already zero-initialized.

[mwlodar, 2016/10/11 07:13:23]

I have defined a constructor for CallStackCountInfo in the header file.

+    if (call_stack_count_info.previous_count == 0 ||
+        call_stack_count_info.count < call_stack_count_info.previous_count) {
+      call_stack_count_info.last_drop_timestamp = timestamp;
+      call_stack_count_info.last_drop_count = call_stack_count_info.count;
+    }
+    call_stack_count_info.previous_count = call_stack_count_info.count;
+  }
+}
+
+void CallStackTable::GetLastUptrendInfo(
+    const CallStack* call_stack, size_t timestamp, size_t* timestamp_delta,
+    uint32_t* count_delta) const {
+  const auto& call_stack_count_info_iter = entry_map_.find(call_stack);
+
+  if (call_stack_count_info_iter != entry_map_.end()) {
+    const auto& call_stack_count_info = call_stack_count_info_iter->second;
+    *timestamp_delta = timestamp - call_stack_count_info.last_drop_timestamp;
+    *count_delta = call_stack_count_info.count -
+        call_stack_count_info.last_drop_count;
+  } else {
+    LOG(WARNING) << "Accessing information about a call stack that has not " <<
+                 "been recorded";
+    *timestamp_delta = timestamp;
+    *count_delta = 0;
+  }
+}
+
 }  // namespace leak_detector
 }  // namespace metrics