File: MemoryTree.cpp

package info (click to toggle)
llvm-toolchain-15 1%3A15.0.6-4
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,554,644 kB
  • sloc: cpp: 5,922,452; ansic: 1,012,136; asm: 674,362; python: 191,568; objc: 73,855; f90: 42,327; lisp: 31,913; pascal: 11,973; javascript: 10,144; sh: 9,421; perl: 7,447; ml: 5,527; awk: 3,523; makefile: 2,520; xml: 885; cs: 573; fortran: 567
file content (58 lines) | stat: -rw-r--r-- 1,659 bytes parent folder | download | duplicates (13)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
//===--- MemoryTree.h - A special tree for components and sizes -----------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//

#include "support/MemoryTree.h"
#include "Trace.h"
#include "llvm/ADT/StringRef.h"
#include <cstddef>

namespace clang {
namespace clangd {

namespace {

size_t traverseTree(const MemoryTree &MT, std::string &ComponentName,
                    const trace::Metric &Out) {
  size_t OriginalLen = ComponentName.size();
  if (!ComponentName.empty())
    ComponentName += '.';
  size_t Total = MT.self();
  for (const auto &Entry : MT.children()) {
    ComponentName += Entry.first;
    Total += traverseTree(Entry.getSecond(), ComponentName, Out);
    ComponentName.resize(OriginalLen + 1);
  }
  ComponentName.resize(OriginalLen);
  Out.record(Total, ComponentName);
  return Total;
}
} // namespace

MemoryTree &MemoryTree::createChild(llvm::StringRef Name) {
  auto &Child = Children.try_emplace(Name, DetailAlloc).first->getSecond();
  return Child;
}

const llvm::DenseMap<llvm::StringRef, MemoryTree> &
MemoryTree::children() const {
  return Children;
}

size_t MemoryTree::total() const {
  size_t Total = Size;
  for (const auto &Entry : Children)
    Total += Entry.getSecond().total();
  return Total;
}

void record(const MemoryTree &MT, std::string RootName,
            const trace::Metric &Out) {
  traverseTree(MT, RootName, Out);
}
} // namespace clangd
} // namespace clang