File: node_inline_data_impl.h

package info (click to toggle)
chromium 139.0.7258.127-1
  • links: PTS, VCS
  • area: main
  • in suites:
  • size: 6,122,068 kB
  • sloc: cpp: 35,100,771; ansic: 7,163,530; javascript: 4,103,002; python: 1,436,920; asm: 946,517; xml: 746,709; pascal: 187,653; perl: 88,691; sh: 88,436; objc: 79,953; sql: 51,488; cs: 44,583; fortran: 24,137; makefile: 22,147; tcl: 15,277; php: 13,980; yacc: 8,984; ruby: 7,485; awk: 3,720; lisp: 3,096; lex: 1,327; ada: 727; jsp: 228; sed: 36
file content (99 lines) | stat: -rw-r--r-- 2,046 bytes parent folder | download | duplicates (6)
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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
// Copyright 2024 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#ifndef COMPONENTS_PERFORMANCE_MANAGER_GRAPH_NODE_INLINE_DATA_IMPL_H_
#define COMPONENTS_PERFORMANCE_MANAGER_GRAPH_NODE_INLINE_DATA_IMPL_H_

#include <concepts>
#include <memory>
#include <optional>
#include <type_traits>
#include <utility>

#include "base/check.h"

namespace performance_manager {

template <class T>
class SparseNodeInlineData;

namespace internal {

// Store the element as a std::optional<T>. Used for non-sparse
// NodeInlineData<T>.
template <class T>
class OptionalStorage {
 public:
  bool Exists() { return data_.has_value(); }

  template <class... Args>
  T& Create(Args&&... args) {
    CHECK(!data_);
    return data_.emplace(std::forward<Args>(args)...);
  }

  void Destroy() {
    CHECK(data_);
    data_.reset();
  }

  T& Get() {
    CHECK(data_);
    return *data_;
  }

  const T& Get() const {
    CHECK(data_);
    return *data_;
  }

 private:
  std::optional<T> data_;
};

// Store the element in a std::unique_ptr<T>. Used for SparseNodeInlineData<T>.
template <class T>
class SparseStorage {
 public:
  bool Exists() { return data_.get(); }

  template <class... Args>
  T& Create(Args&&... args) {
    CHECK(!data_);
    data_ = std::make_unique<T>(std::forward<Args>(args)...);
    return *data_;
  }

  void Destroy() {
    CHECK(data_);
    data_.reset();
  }

  T& Get() {
    CHECK(data_);
    return *data_;
  }

  const T& Get() const {
    CHECK(data_);
    return *data_;
  }

 private:
  std::unique_ptr<T> data_;
};

template <typename T>
concept IsSparseNodeInlineData = std::derived_from<T, SparseNodeInlineData<T>>;

template <class T>
using Storage = std::conditional_t<IsSparseNodeInlineData<T>,
                                   SparseStorage<T>,
                                   OptionalStorage<T>>;

}  // namespace internal

}  // namespace performance_manager

#endif  // COMPONENTS_PERFORMANCE_MANAGER_GRAPH_NODE_INLINE_DATA_IMPL_H_