chromium/v8/src/snapshot/sort-builtins.cc

// Copyright 2023 the V8 project 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 "sort-builtins.h"

#include <algorithm>
#include <fstream>

#include "src/snapshot/embedded/embedded-data-inl.h"
#include "src/snapshot/embedded/embedded-data.h"

namespace v8 {
namespace internal {

Cluster::Cluster(uint32_t density, uint32_t size, Builtin target,
                 BuiltinsSorter* sorter)
    :{}

BuiltinsSorter::BuiltinsSorter() {}

BuiltinsSorter::~BuiltinsSorter() {}

void Cluster::Merge(Cluster* other) {}

uint64_t Cluster::time_approximation() {}

void BuiltinsSorter::InitializeClusters() {}

Builtin BuiltinsSorter::FindBestPredecessorOf(Builtin callee) {}

void BuiltinsSorter::MergeBestPredecessors() {}

void BuiltinsSorter::SortClusters() {}

bool AddBuiltinIfNotProcessed(Builtin builtin, std::vector<Builtin>& order,
                              std::unordered_set<Builtin>& processed_builtins) {}

void BuiltinsSorter::ProcessBlockCountLineInfo(
    std::istringstream& line_stream,
    std::unordered_map<std::string, Builtin>& name2id) {}

void BuiltinsSorter::ProcessBuiltinDensityLineInfo(
    std::istringstream& line_stream,
    std::unordered_map<std::string, Builtin>& name2id) {}

void BuiltinsSorter::InitializeCallGraph(const char* profiling_file,
                                         const std::vector<uint32_t>& size) {}

std::vector<Builtin> BuiltinsSorter::SortBuiltins(
    const char* profiling_file, const std::vector<uint32_t>& builtin_size) {}

}  // namespace internal
}  // namespace v8