chromium/components/keyed_service/core/dependency_graph.cc

// Copyright 2014 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#ifdef UNSAFE_BUFFERS_BUILD
// TODO(crbug.com/40285824): Remove this and convert code to safer constructs.
#pragma allow_unsafe_buffers
#endif

#include "components/keyed_service/core/dependency_graph.h"

#include <stddef.h>

#include <algorithm>
#include <iterator>
#include <map>
#include <string_view>
#include <vector>

#include "base/containers/circular_deque.h"
#include "base/memory/raw_ptr.h"
#include "base/ranges/algorithm.h"

namespace {

// Escapes |id| to be a valid ID in the DOT format [1]. This is implemented as
// enclosing the string in quotation marks, and escaping any quotation marks
// found with backslashes.
// [1] http://www.graphviz.org/content/dot-language
std::string Escape(std::string_view id) { … }

}  // namespace

DependencyGraph::DependencyGraph() = default;

DependencyGraph::~DependencyGraph() = default;

void DependencyGraph::AddNode(DependencyNode* node) { … }

void DependencyGraph::RemoveNode(DependencyNode* node) { … }

void DependencyGraph::AddEdge(DependencyNode* depended,
                              DependencyNode* dependee) { … }

bool DependencyGraph::GetConstructionOrder(
    std::vector<raw_ptr<DependencyNode, VectorExperimental>>* order) { … }

bool DependencyGraph::GetDestructionOrder(
    std::vector<raw_ptr<DependencyNode, VectorExperimental>>* order) { … }

bool DependencyGraph::BuildConstructionOrder() { … }

std::string DependencyGraph::DumpAsGraphviz(
    const std::string& toplevel_name,
    const base::RepeatingCallback<std::string(DependencyNode*)>&
        node_name_callback) const { … }