[tracing] Display the locked size of discardable memory segment.

content/common/discardable_shared_memory_heap.cc

 // Copyright 2014 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 "content/common/discardable_shared_memory_heap.h"
 
 #include <algorithm>
 
 #include "base/format_macros.h"
 #include "base/memory/discardable_shared_memory.h"
 #include "base/strings/stringprintf.h"
 #include "base/trace_event/memory_dump_manager.h"
 
 namespace content {
 namespace {
 
 bool IsPowerOfTwo(size_t x) {
   return (x & (x - 1)) == 0;
 }
 
 bool IsInFreeList(DiscardableSharedMemoryHeap::Span* span) {
   return span->previous() || span->next();
 }
 
 }  // namespace
 
 DiscardableSharedMemoryHeap::Span::Span(
     base::DiscardableSharedMemory* shared_memory,
     size_t start,
-    size_t length)
-    : shared_memory_(shared_memory), start_(start), length_(length) {
+    size_t length,
+    bool is_locked)
+    : shared_memory_(shared_memory),
+      start_(start),
+      length_(length),
+      is_locked_(is_locked) {}
+
+DiscardableSharedMemoryHeap::Span::~Span() {
 }
 
-DiscardableSharedMemoryHeap::Span::~Span() {
+base::DiscardableSharedMemory::LockResult
+DiscardableSharedMemoryHeap::Span::Lock(size_t page_size) {
+  const size_t offset =
+      start_ * page_size - reinterpret_cast<size_t>(shared_memory_->memory());
+  const size_t length = length_ * page_size;
+  base::DiscardableSharedMemory::LockResult result =
+      shared_memory_->Lock(offset, length);
+  is_locked_ = result == base::DiscardableSharedMemory::SUCCESS;
+  return result;
+}
+
+void DiscardableSharedMemoryHeap::Span::Unlock(size_t page_size) {
+  const size_t offset =
+      start_ * page_size - reinterpret_cast<size_t>(shared_memory_->memory());
+  const size_t length = length_ * page_size;
+  shared_memory_->Unlock(offset, length);
+  is_locked_ = false;
+}
+
+bool DiscardableSharedMemoryHeap::Span::IsMemoryResident() const {
+  return shared_memory_->IsMemoryResident();
 }
 
 DiscardableSharedMemoryHeap::ScopedMemorySegment::ScopedMemorySegment(
     DiscardableSharedMemoryHeap* heap,
     scoped_ptr<base::DiscardableSharedMemory> shared_memory,
     size_t size,
     int32_t id,
     const base::Closure& deleted_callback)
     : heap_(heap),
       shared_memory_(shared_memory.Pass()),
@@ skipping 10 matching lines @@
 bool DiscardableSharedMemoryHeap::ScopedMemorySegment::IsUsed() const {
   return heap_->IsMemoryUsed(shared_memory_.get(), size_);
 }
 
 bool DiscardableSharedMemoryHeap::ScopedMemorySegment::IsResident() const {
   return heap_->IsMemoryResident(shared_memory_.get());
 }
 
 bool DiscardableSharedMemoryHeap::ScopedMemorySegment::ContainsSpan(
     Span* span) const {
-  return shared_memory_ == span->shared_memory();
+  return shared_memory_ == span->shared_memory_;
 }
 
 base::trace_event::MemoryAllocatorDump*
 DiscardableSharedMemoryHeap::ScopedMemorySegment::CreateMemoryAllocatorDump(
     Span* span,
     size_t block_size,
     const char* name,
     base::trace_event::ProcessMemoryDump* pmd) const {
-  DCHECK_EQ(shared_memory_, span->shared_memory());
+  DCHECK_EQ(shared_memory_, span->shared_memory_);
   base::trace_event::MemoryAllocatorDump* dump = pmd->CreateAllocatorDump(name);
   dump->AddScalar(base::trace_event::MemoryAllocatorDump::kNameSize,
                   base::trace_event::MemoryAllocatorDump::kUnitsBytes,
                   static_cast<uint64_t>(span->length() * block_size));
 
   pmd->AddSuballocation(
       dump->guid(),
       base::StringPrintf("discardable/segment_%d/allocated_objects", id_));
   return dump;
 }
@@ skipping 27 matching lines @@
     const base::Closure& deleted_callback) {
   // Memory must be aligned to block size.
   DCHECK_EQ(
       reinterpret_cast<size_t>(shared_memory->memory()) & (block_size_ - 1),
       0u);
   DCHECK_EQ(size & (block_size_ - 1), 0u);
 
   scoped_ptr<Span> span(
       new Span(shared_memory.get(),
                reinterpret_cast<size_t>(shared_memory->memory()) / block_size_,
-               size / block_size_));
+               size / block_size_, true /* is_locked */));
   DCHECK(spans_.find(span->start_) == spans_.end());
   DCHECK(spans_.find(span->start_ + span->length_ - 1) == spans_.end());
   RegisterSpan(span.get());
 
   num_blocks_ += span->length_;
 
   // Start tracking if segment is resident by adding it to |memory_segments_|.
   memory_segments_.push_back(new ScopedMemorySegment(
       this, shared_memory.Pass(), size, id, deleted_callback));
 
@@ skipping 32 matching lines @@
   }
 
   InsertIntoFreeList(span.Pass());
 }
 
 scoped_ptr<DiscardableSharedMemoryHeap::Span>
 DiscardableSharedMemoryHeap::Split(Span* span, size_t blocks) {
   DCHECK(blocks);
   DCHECK_LT(blocks, span->length_);
 
-  scoped_ptr<Span> leftover(new Span(
-      span->shared_memory_, span->start_ + blocks, span->length_ - blocks));
+  scoped_ptr<Span> leftover(
+      new Span(span->shared_memory_, span->start_ + blocks,
+               span->length_ - blocks, true /* is_locked */));
   DCHECK_IMPLIES(leftover->length_ > 1,
                  spans_.find(leftover->start_) == spans_.end());
   RegisterSpan(leftover.get());
   spans_[span->start_ + blocks - 1] = span;
   span->length_ = blocks;
   return leftover.Pass();
 }
 
 scoped_ptr<DiscardableSharedMemoryHeap::Span>
 DiscardableSharedMemoryHeap::SearchFreeLists(size_t blocks, size_t slack) {
@@ skipping 82 matching lines @@
   span->RemoveFromList();
   return make_scoped_ptr(span);
 }
 
 scoped_ptr<DiscardableSharedMemoryHeap::Span>
 DiscardableSharedMemoryHeap::Carve(Span* span, size_t blocks) {
   scoped_ptr<Span> serving = RemoveFromFreeList(span);
 
   const int extra = serving->length_ - blocks;
   if (extra) {
-    scoped_ptr<Span> leftover(
-        new Span(serving->shared_memory_, serving->start_ + blocks, extra));
+    scoped_ptr<Span> leftover(new Span(serving->shared_memory_,
+                                       serving->start_ + blocks, extra,
+                                       false /* is_locked */));
     DCHECK_IMPLIES(extra > 1, spans_.find(leftover->start_) == spans_.end());
     RegisterSpan(leftover.get());
 
     // No need to coalesce as the previous span of |leftover| was just split
     // and the next span of |leftover| was not previously coalesced with
     // |span|.
     InsertIntoFreeList(leftover.Pass());
 
     serving->length_ = blocks;
     spans_[serving->start_ + blocks - 1] = serving.get();
@@ skipping 69 matching lines @@
   }
 }
 
 void DiscardableSharedMemoryHeap::OnMemoryDump(
     const base::DiscardableSharedMemory* shared_memory,
     size_t size,
     int32_t segment_id,
     base::trace_event::ProcessMemoryDump* pmd) {
   size_t allocated_objects_count = 0;
   size_t allocated_objects_size_in_bytes = 0;
+  size_t locked_size_in_bytes = 0;
   size_t offset =
       reinterpret_cast<size_t>(shared_memory->memory()) / block_size_;
   size_t end = offset + size / block_size_;
   while (offset < end) {
     Span* span = spans_[offset];
     if (!IsInFreeList(span)) {
       allocated_objects_count++;
-      allocated_objects_size_in_bytes += span->length_ * block_size_;
+      const size_t span_size = span->length_ * block_size_;
+      allocated_objects_size_in_bytes += span_size;
+      locked_size_in_bytes = span->is_locked_ ? span_size : 0;
     }
     offset += span->length_;
   }
 
   std::string segment_dump_name =
       base::StringPrintf("discardable/segment_%d", segment_id);
   base::trace_event::MemoryAllocatorDump* segment_dump =
       pmd->CreateAllocatorDump(segment_dump_name);
   segment_dump->AddScalar(base::trace_event::MemoryAllocatorDump::kNameSize,
                           base::trace_event::MemoryAllocatorDump::kUnitsBytes,
                           static_cast<uint64_t>(size));
 
   base::trace_event::MemoryAllocatorDump* obj_dump =
       pmd->CreateAllocatorDump(segment_dump_name + "/allocated_objects");
   obj_dump->AddScalar(base::trace_event::MemoryAllocatorDump::kNameObjectCount,
                       base::trace_event::MemoryAllocatorDump::kUnitsObjects,
                       static_cast<uint64_t>(allocated_objects_count));
   obj_dump->AddScalar(base::trace_event::MemoryAllocatorDump::kNameSize,
                       base::trace_event::MemoryAllocatorDump::kUnitsBytes,
                       static_cast<uint64_t>(allocated_objects_size_in_bytes));
+  obj_dump->AddScalar("locked_size",
+                      base::trace_event::MemoryAllocatorDump::kUnitsBytes,
+                      locked_size_in_bytes);
 
   // Emit an ownership edge towards a global allocator dump node. This allows
   // to avoid double-counting segments when both browser and child process emit
   // them. In the special case of single-process-mode, this will be the only
   // dumper active and the single ownership edge will become a no-op in the UI.
   const uint64 tracing_process_id =
       base::trace_event::MemoryDumpManager::GetInstance()
           ->GetTracingProcessId();
   base::trace_event::MemoryAllocatorDumpGuid shared_segment_guid =
       GetSegmentGUIDForTracing(tracing_process_id, segment_id);
@@ skipping 29 matching lines @@
   ScopedVector<ScopedMemorySegment>::const_iterator it =
       std::find_if(memory_segments_.begin(), memory_segments_.end(),
                    [span](const ScopedMemorySegment* segment) {
                      return segment->ContainsSpan(span);
                    });
   DCHECK(it != memory_segments_.end());
   return (*it)->CreateMemoryAllocatorDump(span, block_size_, name, pmd);
 }
 
 }  // namespace content