blob: 017049f8bf0b3021e07804ec28735f4d72b0e592 (
plain)
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
|
// Copyright 2013 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.
#ifndef COMPONENTS_BROWSER_CONTEXT_KEYED_SERVICE_DEPENDENCY_GRAPH_H_
#define COMPONENTS_BROWSER_CONTEXT_KEYED_SERVICE_DEPENDENCY_GRAPH_H_
#include <map>
#include <string>
#include <vector>
#include "base/callback.h"
#include "base/compiler_specific.h"
#include "components/browser_context_keyed_service/browser_context_keyed_service_export.h"
class DependencyNode;
// Dynamic graph of dependencies between nodes.
class BROWSER_CONTEXT_KEYED_SERVICE_EXPORT DependencyGraph {
public:
DependencyGraph();
~DependencyGraph();
// Adds/Removes a node from our list of live nodes. Removing will
// also remove live dependency links.
void AddNode(DependencyNode* node);
void RemoveNode(DependencyNode* node);
// Adds a dependency between two nodes.
void AddEdge(DependencyNode* depended, DependencyNode* dependee);
// Topologically sorts nodes to produce a safe construction order
// (all nodes after their dependees).
bool GetConstructionOrder(
std::vector<DependencyNode*>* order) WARN_UNUSED_RESULT;
// Topologically sorts nodes to produce a safe destruction order
// (all nodes before their dependees).
bool GetDestructionOrder(
std::vector<DependencyNode*>* order) WARN_UNUSED_RESULT;
// Returns representation of the dependency graph in graphviz format.
std::string DumpAsGraphviz(
const std::string& toplevel_name,
const base::Callback<std::string(DependencyNode*)>&
node_name_callback) const;
private:
typedef std::multimap<DependencyNode*, DependencyNode*> EdgeMap;
// Populates |construction_order_| with computed construction order.
// Returns true on success.
bool BuildConstructionOrder() WARN_UNUSED_RESULT;
// Keeps track of all live nodes (see AddNode, RemoveNode).
std::vector<DependencyNode*> all_nodes_;
// Keeps track of edges of the dependency graph.
EdgeMap edges_;
// Cached construction order (needs rebuild with BuildConstructionOrder
// when empty).
std::vector<DependencyNode*> construction_order_;
DISALLOW_COPY_AND_ASSIGN(DependencyGraph);
};
#endif // COMPONENTS_BROWSER_CONTEXT_KEYED_SERVICE_DEPENDENCY_GRAPH_H_
|
