cemu-vcpkg/toolsrc/src/vcpkg_Dependencies.cpp

569 lines
23 KiB
C++
Raw Normal View History

2017-01-27 12:49:09 -08:00
#include "pch.h"
2017-04-27 18:08:52 -07:00
2017-04-03 14:45:00 -07:00
#include "PackageSpec.h"
2017-04-27 18:08:52 -07:00
#include "Paragraphs.h"
#include "StatusParagraphs.h"
2017-04-27 18:08:52 -07:00
#include "VcpkgPaths.h"
#include "vcpkg_Dependencies.h"
#include "vcpkg_Files.h"
2017-04-27 18:08:52 -07:00
#include "vcpkg_Graphs.h"
#include "vcpkg_Util.h"
2017-04-12 18:55:37 -07:00
#include "vcpkglib.h"
2017-01-05 14:14:11 -08:00
namespace vcpkg::Dependencies
{
2017-04-12 21:28:49 -07:00
std::vector<PackageSpec> AnyParagraph::dependencies(const Triplet& triplet) const
{
2017-04-27 18:08:52 -07:00
auto to_package_specs = [&](const std::vector<std::string>& dependencies_as_string) {
return Util::fmap(dependencies_as_string, [&](const std::string s) {
return PackageSpec::from_name_and_triplet(s, triplet).value_or_exit(VCPKG_LINE_INFO);
});
};
if (auto p = this->status_paragraph.get())
{
return to_package_specs(p->package.depends);
}
if (auto p = this->binary_paragraph.get())
{
return to_package_specs(p->depends);
}
if (auto p = this->source_paragraph.get())
{
2017-04-12 21:28:49 -07:00
return to_package_specs(filter_dependencies(p->depends, triplet));
}
2017-04-27 18:08:52 -07:00
Checks::exit_with_message(VCPKG_LINE_INFO,
"Cannot get dependencies because there was none of: source/binary/status paragraphs");
}
std::string to_output_string(RequestType request_type, const CStringView s)
{
switch (request_type)
{
2017-04-27 18:08:52 -07:00
case RequestType::AUTO_SELECTED: return Strings::format(" * %s", s);
case RequestType::USER_REQUESTED: return Strings::format(" %s", s);
default: Checks::unreachable(VCPKG_LINE_INFO);
}
}
2017-04-27 18:08:52 -07:00
InstallPlanAction::InstallPlanAction()
: spec(), any_paragraph(), plan_type(InstallPlanType::UNKNOWN), request_type(RequestType::UNKNOWN)
{
}
2017-07-12 17:40:41 -07:00
InstallPlanAction::InstallPlanAction(const PackageSpec& spec,
const SourceControlFile& any_paragraph,
2017-07-19 14:19:11 -07:00
const std::unordered_set<std::string>& features,
2017-07-12 17:40:41 -07:00
const RequestType& request_type)
: InstallPlanAction()
{
this->spec = spec;
this->request_type = request_type;
this->plan_type = InstallPlanType::BUILD_AND_INSTALL;
this->any_paragraph.source_control_file = &any_paragraph;
this->feature_list = features;
}
2017-04-27 18:08:52 -07:00
InstallPlanAction::InstallPlanAction(const PackageSpec& spec,
const AnyParagraph& any_paragraph,
const RequestType& request_type)
: InstallPlanAction()
{
2017-04-12 21:28:49 -07:00
this->spec = spec;
this->request_type = request_type;
2017-04-12 21:28:49 -07:00
if (auto p = any_paragraph.status_paragraph.get())
{
this->plan_type = InstallPlanType::ALREADY_INSTALLED;
2017-04-12 21:28:49 -07:00
this->any_paragraph.status_paragraph = *p;
return;
}
if (auto p = any_paragraph.binary_paragraph.get())
{
this->plan_type = InstallPlanType::INSTALL;
2017-04-12 21:28:49 -07:00
this->any_paragraph.binary_paragraph = *p;
return;
}
if (auto p = any_paragraph.source_paragraph.get())
{
this->plan_type = InstallPlanType::BUILD_AND_INSTALL;
2017-04-12 21:28:49 -07:00
this->any_paragraph.source_paragraph = *p;
return;
}
this->plan_type = InstallPlanType::UNKNOWN;
}
2017-04-07 13:03:11 -07:00
2017-04-12 21:28:49 -07:00
bool InstallPlanAction::compare_by_name(const InstallPlanAction* left, const InstallPlanAction* right)
2017-04-07 13:02:50 -07:00
{
return left->spec.name() < right->spec.name();
}
2017-04-27 18:08:52 -07:00
RemovePlanAction::RemovePlanAction() : plan_type(RemovePlanType::UNKNOWN), request_type(RequestType::UNKNOWN) {}
2017-04-27 18:08:52 -07:00
RemovePlanAction::RemovePlanAction(const PackageSpec& spec,
const RemovePlanType& plan_type,
const RequestType& request_type)
: spec(spec), plan_type(plan_type), request_type(request_type)
{
}
2017-04-10 12:57:49 -07:00
bool ExportPlanAction::compare_by_name(const ExportPlanAction* left, const ExportPlanAction* right)
{
return left->spec.name() < right->spec.name();
}
2017-04-27 18:08:52 -07:00
ExportPlanAction::ExportPlanAction()
: spec(), any_paragraph(), plan_type(ExportPlanType::UNKNOWN), request_type(RequestType::UNKNOWN)
{
}
2017-04-10 12:57:49 -07:00
2017-04-27 18:08:52 -07:00
ExportPlanAction::ExportPlanAction(const PackageSpec& spec,
const AnyParagraph& any_paragraph,
const RequestType& request_type)
: ExportPlanAction()
2017-04-10 12:57:49 -07:00
{
this->spec = spec;
this->request_type = request_type;
if (auto p = any_paragraph.binary_paragraph.get())
{
this->plan_type = ExportPlanType::ALREADY_BUILT;
this->any_paragraph.binary_paragraph = *p;
return;
}
if (auto p = any_paragraph.source_paragraph.get())
{
this->plan_type = ExportPlanType::PORT_AVAILABLE_BUT_NOT_BUILT;
this->any_paragraph.source_paragraph = *p;
return;
}
this->plan_type = ExportPlanType::UNKNOWN;
}
2017-04-12 21:37:55 -07:00
bool RemovePlanAction::compare_by_name(const RemovePlanAction* left, const RemovePlanAction* right)
2017-04-06 17:37:19 -07:00
{
return left->spec.name() < right->spec.name();
}
2017-07-19 14:19:11 -07:00
MapPortFile::MapPortFile(const std::unordered_map<PackageSpec, SourceControlFile>& map) : ports(map) {}
2017-06-27 14:52:26 -07:00
const SourceControlFile& MapPortFile::get_control_file(const PackageSpec& spec) const
2017-06-26 13:48:04 -07:00
{
auto scf = ports.find(spec);
if (scf == ports.end())
{
Checks::exit_fail(VCPKG_LINE_INFO);
}
2017-06-27 14:52:26 -07:00
return scf->second;
2017-06-26 13:48:04 -07:00
}
2017-07-19 14:19:11 -07:00
PathsPortFile::PathsPortFile(const VcpkgPaths& paths) : ports(paths) {}
2017-06-27 14:52:26 -07:00
const SourceControlFile& PathsPortFile::get_control_file(const PackageSpec& spec) const
2017-06-26 13:48:04 -07:00
{
std::unordered_map<PackageSpec, SourceControlFile>::iterator cache_it = cache.find(spec);
if (cache_it != cache.end())
{
2017-06-27 14:52:26 -07:00
return cache_it->second;
2017-06-26 13:48:04 -07:00
}
Parse::ParseExpected<SourceControlFile> source_control_file =
2017-06-26 13:48:04 -07:00
Paragraphs::try_load_port(ports.get_filesystem(), ports.port_dir(spec));
if (auto scf = source_control_file.get())
{
auto it = cache.emplace(spec, std::move(*scf->get()));
2017-06-27 14:52:26 -07:00
return it.first->second;
2017-06-26 13:48:04 -07:00
}
2017-06-27 14:52:26 -07:00
print_error_message(source_control_file.error());
2017-06-26 13:48:04 -07:00
Checks::exit_fail(VCPKG_LINE_INFO);
}
std::vector<InstallPlanAction> create_install_plan(const PortFileProvider& port_file_provider,
2017-04-27 18:08:52 -07:00
const std::vector<PackageSpec>& specs,
const StatusParagraphs& status_db)
2017-06-26 13:48:04 -07:00
{
struct InstallAdjacencyProvider final : Graphs::AdjacencyProvider<PackageSpec, InstallPlanAction>
{
const PortFileProvider& port_file_provider;
const StatusParagraphs& status_db;
const std::unordered_set<PackageSpec>& specs_as_set;
InstallAdjacencyProvider(const PortFileProvider& port_file_provider,
const StatusParagraphs& s,
const std::unordered_set<PackageSpec>& specs_as_set)
: port_file_provider(port_file_provider), status_db(s), specs_as_set(specs_as_set)
{
}
std::vector<PackageSpec> adjacency_list(const InstallPlanAction& plan) const override
{
if (plan.any_paragraph.status_paragraph.get()) return std::vector<PackageSpec>{};
return plan.any_paragraph.dependencies(plan.spec.triplet());
}
InstallPlanAction load_vertex_data(const PackageSpec& spec) const override
{
const RequestType request_type = specs_as_set.find(spec) != specs_as_set.end()
? RequestType::USER_REQUESTED
: RequestType::AUTO_SELECTED;
auto it = status_db.find_installed(spec);
if (it != status_db.end()) return InstallPlanAction{spec, {*it->get(), nullopt, nullopt}, request_type};
return InstallPlanAction{
2017-06-27 14:52:26 -07:00
spec, {nullopt, nullopt, *port_file_provider.get_control_file(spec).core_paragraph}, request_type};
2017-06-26 13:48:04 -07:00
}
};
const std::unordered_set<PackageSpec> specs_as_set(specs.cbegin(), specs.cend());
std::vector<InstallPlanAction> toposort =
Graphs::topological_sort(specs, InstallAdjacencyProvider{port_file_provider, status_db, specs_as_set});
Util::erase_remove_if(toposort, [](const InstallPlanAction& plan) {
return plan.request_type == RequestType::AUTO_SELECTED &&
plan.plan_type == InstallPlanType::ALREADY_INSTALLED;
});
return toposort;
}
2017-04-27 18:08:52 -07:00
std::vector<RemovePlanAction> create_remove_plan(const std::vector<PackageSpec>& specs,
const StatusParagraphs& status_db)
2017-04-12 18:55:37 -07:00
{
2017-04-12 21:37:55 -07:00
struct RemoveAdjacencyProvider final : Graphs::AdjacencyProvider<PackageSpec, RemovePlanAction>
2017-01-26 17:53:45 -08:00
{
2017-04-12 18:55:37 -07:00
const StatusParagraphs& status_db;
const std::vector<StatusParagraph*>& installed_ports;
2017-04-12 21:37:55 -07:00
const std::unordered_set<PackageSpec>& specs_as_set;
2017-01-26 17:53:45 -08:00
2017-04-27 18:08:52 -07:00
RemoveAdjacencyProvider(const StatusParagraphs& status_db,
const std::vector<StatusParagraph*>& installed_ports,
const std::unordered_set<PackageSpec>& specs_as_set)
: status_db(status_db), installed_ports(installed_ports), specs_as_set(specs_as_set)
{
}
2017-01-26 17:53:45 -08:00
2017-04-13 16:02:10 -07:00
std::vector<PackageSpec> adjacency_list(const RemovePlanAction& plan) const override
2017-01-26 17:53:45 -08:00
{
2017-04-13 16:02:10 -07:00
if (plan.plan_type == RemovePlanType::NOT_INSTALLED)
2017-04-12 18:55:37 -07:00
{
return {};
}
2017-04-13 16:02:10 -07:00
const PackageSpec& spec = plan.spec;
2017-04-12 18:55:37 -07:00
std::vector<PackageSpec> dependents;
for (const StatusParagraph* an_installed_package : installed_ports)
{
2017-04-27 18:08:52 -07:00
if (an_installed_package->package.spec.triplet() != spec.triplet()) continue;
2017-04-12 18:55:37 -07:00
const std::vector<std::string>& deps = an_installed_package->package.depends;
2017-04-27 18:08:52 -07:00
if (std::find(deps.begin(), deps.end(), spec.name()) == deps.end()) continue;
2017-04-12 18:55:37 -07:00
dependents.push_back(an_installed_package->package.spec);
}
return dependents;
2017-01-26 17:53:45 -08:00
}
2017-04-12 21:37:55 -07:00
RemovePlanAction load_vertex_data(const PackageSpec& spec) const override
2017-01-26 17:53:45 -08:00
{
2017-04-27 18:08:52 -07:00
const RequestType request_type = specs_as_set.find(spec) != specs_as_set.end()
? RequestType::USER_REQUESTED
: RequestType::AUTO_SELECTED;
2017-04-12 18:55:37 -07:00
const StatusParagraphs::const_iterator it = status_db.find_installed(spec);
if (it == status_db.end())
2017-01-26 17:53:45 -08:00
{
return RemovePlanAction{spec, RemovePlanType::NOT_INSTALLED, request_type};
2017-01-26 17:53:45 -08:00
}
return RemovePlanAction{spec, RemovePlanType::REMOVE, request_type};
2017-01-26 17:53:45 -08:00
}
2017-04-12 18:55:37 -07:00
};
2017-01-26 17:53:45 -08:00
2017-04-12 18:55:37 -07:00
const std::vector<StatusParagraph*>& installed_ports = get_installed_ports(status_db);
const std::unordered_set<PackageSpec> specs_as_set(specs.cbegin(), specs.cend());
return Graphs::topological_sort(specs, RemoveAdjacencyProvider{status_db, installed_ports, specs_as_set});
2017-01-26 17:53:45 -08:00
}
2017-04-10 12:57:49 -07:00
2017-04-27 18:08:52 -07:00
std::vector<ExportPlanAction> create_export_plan(const VcpkgPaths& paths,
const std::vector<PackageSpec>& specs,
const StatusParagraphs& status_db)
2017-04-10 12:57:49 -07:00
{
struct ExportAdjacencyProvider final : Graphs::AdjacencyProvider<PackageSpec, ExportPlanAction>
{
const VcpkgPaths& paths;
const StatusParagraphs& status_db;
const std::unordered_set<PackageSpec>& specs_as_set;
2017-04-27 18:08:52 -07:00
ExportAdjacencyProvider(const VcpkgPaths& p,
const StatusParagraphs& s,
const std::unordered_set<PackageSpec>& specs_as_set)
: paths(p), status_db(s), specs_as_set(specs_as_set)
{
}
2017-04-10 12:57:49 -07:00
std::vector<PackageSpec> adjacency_list(const ExportPlanAction& plan) const override
{
return plan.any_paragraph.dependencies(plan.spec.triplet());
}
ExportPlanAction load_vertex_data(const PackageSpec& spec) const override
{
2017-04-27 18:08:52 -07:00
const RequestType request_type = specs_as_set.find(spec) != specs_as_set.end()
? RequestType::USER_REQUESTED
: RequestType::AUTO_SELECTED;
2017-04-10 12:57:49 -07:00
Expected<BinaryParagraph> maybe_bpgh = Paragraphs::try_load_cached_package(paths, spec);
if (auto bpgh = maybe_bpgh.get())
return ExportPlanAction{spec, {nullopt, *bpgh, nullopt}, request_type};
2017-04-10 12:57:49 -07:00
auto maybe_scf = Paragraphs::try_load_port(paths.get_filesystem(), paths.port_dir(spec));
if (auto scf = maybe_scf.get())
return ExportPlanAction{spec, {nullopt, nullopt, *scf->get()->core_paragraph}, request_type};
2017-06-05 15:58:47 -07:00
else
print_error_message(maybe_scf.error());
2017-06-05 15:58:47 -07:00
Checks::exit_with_message(VCPKG_LINE_INFO, "Could not find package %s", spec);
2017-04-10 12:57:49 -07:00
}
};
const std::unordered_set<PackageSpec> specs_as_set(specs.cbegin(), specs.cend());
2017-04-27 18:08:52 -07:00
std::vector<ExportPlanAction> toposort =
Graphs::topological_sort(specs, ExportAdjacencyProvider{paths, status_db, specs_as_set});
2017-04-10 12:57:49 -07:00
return toposort;
}
2017-07-12 17:40:41 -07:00
std::vector<FeatureSpec> to_feature_specs(const std::vector<std::string> depends,
const std::unordered_map<std::string, PackageSpec> str_to_spec)
{
std::vector<FeatureSpec> f_specs;
for (auto&& depend : depends)
{
int end = (int)depend.find(']');
if (end != std::string::npos)
{
int start = (int)depend.find('[');
auto feature_name = depend.substr(start + 1, end - start - 1);
auto package_name = depend.substr(0, start);
auto p_spec = str_to_spec.find(package_name);
if (p_spec != str_to_spec.end())
{
auto feature_spec = FeatureSpec{p_spec->second, feature_name};
f_specs.emplace_back(std::move(feature_spec));
}
}
else
{
auto p_spec = str_to_spec.find(depend);
if (p_spec != str_to_spec.end())
{
auto feature_spec = FeatureSpec{p_spec->second, ""};
f_specs.emplace_back(std::move(feature_spec));
}
}
}
return f_specs;
}
bool mark_plus(const std::string& feature,
Cluster& cluster,
std::unordered_map<PackageSpec, Cluster>& pkg_to_cluster,
GraphPlan& graph_plan)
{
auto it = cluster.edges.find(feature);
std::string updated_feature = feature;
if (updated_feature == "")
{
updated_feature = "core";
it = cluster.edges.find("core");
}
if (it == cluster.edges.end())
{
2017-07-19 14:19:11 -07:00
Checks::unreachable(VCPKG_LINE_INFO);
2017-07-12 17:40:41 -07:00
}
if (cluster.edges[updated_feature].plus) return true;
2017-07-19 14:19:11 -07:00
if (cluster.original_features.find(updated_feature) == cluster.original_features.end())
2017-07-12 17:40:41 -07:00
{
2017-07-19 14:19:11 -07:00
cluster.transient_uninstalled = true;
2017-07-12 17:40:41 -07:00
}
2017-07-19 14:19:11 -07:00
if (!cluster.transient_uninstalled)
2017-07-12 17:40:41 -07:00
{
return false;
}
cluster.edges[updated_feature].plus = true;
2017-07-19 14:19:11 -07:00
if (!cluster.original_features.empty())
2017-07-12 17:40:41 -07:00
{
mark_minus(cluster, pkg_to_cluster, graph_plan);
}
graph_plan.install_graph.add_vertex(&cluster);
2017-07-19 14:19:11 -07:00
auto& tracked = cluster.to_install_features;
2017-07-12 17:40:41 -07:00
tracked.insert(updated_feature);
if (tracked.find("core") == tracked.end() && tracked.find("") == tracked.end())
{
2017-07-19 14:19:11 -07:00
cluster.to_install_features.insert("core");
for (auto&& depend : cluster.edges["core"].build_edges)
2017-07-12 17:40:41 -07:00
{
auto& depend_cluster = pkg_to_cluster[depend.spec];
mark_plus(depend.feature_name, depend_cluster, pkg_to_cluster, graph_plan);
graph_plan.install_graph.add_edge(&cluster, &depend_cluster);
}
}
2017-07-19 14:19:11 -07:00
for (auto&& depend : cluster.edges[updated_feature].build_edges)
2017-07-12 17:40:41 -07:00
{
auto& depend_cluster = pkg_to_cluster[depend.spec];
mark_plus(depend.feature_name, depend_cluster, pkg_to_cluster, graph_plan);
if (&depend_cluster == &cluster) continue;
graph_plan.install_graph.add_edge(&cluster, &depend_cluster);
}
return true;
}
void mark_minus(Cluster& cluster, std::unordered_map<PackageSpec, Cluster>& pkg_to_cluster, GraphPlan& graph_plan)
{
2017-07-19 14:19:11 -07:00
if (cluster.will_remove) return;
cluster.will_remove = true;
2017-07-12 17:40:41 -07:00
graph_plan.remove_graph.add_vertex(&cluster);
for (auto&& pair : cluster.edges)
{
2017-07-19 14:19:11 -07:00
auto& remove_edges_edges = pair.second.remove_edges;
for (auto&& depend : remove_edges_edges)
2017-07-12 17:40:41 -07:00
{
auto& depend_cluster = pkg_to_cluster[depend.spec];
graph_plan.remove_graph.add_edge(&cluster, &depend_cluster);
2017-07-19 14:19:11 -07:00
depend_cluster.transient_uninstalled = true;
2017-07-12 17:40:41 -07:00
mark_minus(depend_cluster, pkg_to_cluster, graph_plan);
}
}
2017-07-19 14:19:11 -07:00
for (auto&& original_feature : cluster.original_features)
2017-07-12 17:40:41 -07:00
{
2017-07-19 14:19:11 -07:00
cluster.transient_uninstalled = true;
2017-07-12 17:40:41 -07:00
mark_plus(original_feature, cluster, pkg_to_cluster, graph_plan);
}
}
std::vector<AnyAction> create_feature_install_plan(const std::unordered_map<PackageSpec, SourceControlFile>& map,
const std::vector<FullPackageSpec>& specs,
const StatusParagraphs& status_db)
{
const auto triplet = Triplet::X86_WINDOWS;
std::unordered_map<PackageSpec, Cluster> pkg_spec_to_package_node;
std::unordered_map<std::string, PackageSpec> str_to_spec;
for (const auto& it : map)
{
str_to_spec.emplace(it.first.name(), it.first);
}
for (const auto& it : map)
{
Cluster& node = pkg_spec_to_package_node[it.first];
FeatureNodeEdges core_dependencies;
2017-07-19 14:19:11 -07:00
core_dependencies.build_edges =
2017-07-12 17:40:41 -07:00
to_feature_specs(filter_dependencies(it.second.core_paragraph->depends, triplet), str_to_spec);
node.edges["core"] = std::move(core_dependencies);
for (const auto& feature : it.second.feature_paragraphs)
{
FeatureNodeEdges added_edges;
2017-07-19 14:19:11 -07:00
added_edges.build_edges = to_feature_specs(filter_dependencies(feature->depends, triplet), str_to_spec);
2017-07-12 17:40:41 -07:00
node.edges.emplace(feature->name, std::move(added_edges));
}
2017-07-19 14:19:11 -07:00
node.cluster_data.source_paragraph = &it.second;
2017-07-12 17:40:41 -07:00
}
for (auto&& status_paragraph : status_db)
{
auto& spec = status_paragraph->package.spec;
auto& status_paragraph_feature = status_paragraph->package.feature;
Cluster& cluster = pkg_spec_to_package_node[spec];
2017-07-19 14:19:11 -07:00
cluster.transient_uninstalled = false;
2017-07-12 17:40:41 -07:00
auto reverse_edges = to_feature_specs(status_paragraph->package.depends, str_to_spec);
for (auto&& dependency : reverse_edges)
{
auto pkg_node = pkg_spec_to_package_node.find(dependency.spec);
auto depends_name = dependency.feature_name;
if (depends_name == "")
{
for (auto&& default_feature : status_paragraph->package.default_features)
{
auto& target_node = pkg_node->second.edges[default_feature];
2017-07-19 14:19:11 -07:00
target_node.remove_edges.emplace_back(FeatureSpec{spec, status_paragraph_feature});
2017-07-12 17:40:41 -07:00
}
depends_name = "core";
}
auto& target_node = pkg_node->second.edges[depends_name];
2017-07-19 14:19:11 -07:00
target_node.remove_edges.emplace_back(FeatureSpec{spec, status_paragraph_feature});
2017-07-12 17:40:41 -07:00
}
2017-07-19 14:19:11 -07:00
cluster.cluster_data.status_paragraphs.emplace_back(*status_paragraph);
2017-07-12 17:40:41 -07:00
if (status_paragraph_feature == "")
{
2017-07-19 14:19:11 -07:00
cluster.original_features.insert("core");
2017-07-12 17:40:41 -07:00
}
else
{
2017-07-19 14:19:11 -07:00
cluster.original_features.insert(status_paragraph_feature);
2017-07-12 17:40:41 -07:00
}
}
GraphPlan graph_plan;
for (auto&& spec : specs)
{
Cluster& spec_cluster = pkg_spec_to_package_node[spec.package_spec];
for (auto&& feature : spec.features)
{
mark_plus(feature, spec_cluster, pkg_spec_to_package_node, graph_plan);
}
}
Graphs::GraphAdjacencyProvider<Cluster*> adjacency_remove_graph(graph_plan.remove_graph.adjacency_list());
auto remove_vertex_list = graph_plan.remove_graph.vertex_list();
auto remove_toposort = Graphs::topological_sort(remove_vertex_list, adjacency_remove_graph);
Graphs::GraphAdjacencyProvider<Cluster*> adjacency_install_graph(graph_plan.install_graph.adjacency_list());
auto insert_vertex_list = graph_plan.install_graph.vertex_list();
auto insert_toposort = Graphs::topological_sort(insert_vertex_list, adjacency_install_graph);
std::vector<AnyAction> install_plan;
for (auto&& cluster : remove_toposort)
{
2017-07-19 14:19:11 -07:00
auto scf = *cluster->cluster_data.source_paragraph.get();
2017-07-12 17:40:41 -07:00
AnyAction any_plan;
any_plan.remove_plan = RemovePlanAction{
str_to_spec[scf->core_paragraph->name], RemovePlanType::REMOVE, RequestType::AUTO_SELECTED};
install_plan.emplace_back(std::move(any_plan));
}
for (auto&& cluster : insert_toposort)
{
2017-07-19 14:19:11 -07:00
if (!cluster->transient_uninstalled) continue;
2017-07-12 17:40:41 -07:00
2017-07-19 14:19:11 -07:00
auto scf = *cluster->cluster_data.source_paragraph.get();
2017-07-12 17:40:41 -07:00
auto& pkg_spec = str_to_spec[scf->core_paragraph->name];
auto action = InstallPlanAction{
2017-07-19 14:19:11 -07:00
pkg_spec, map.find(pkg_spec)->second, cluster->to_install_features, RequestType::AUTO_SELECTED};
2017-07-12 17:40:41 -07:00
AnyAction any_plan;
any_plan.install_plan = std::move(action);
install_plan.emplace_back(std::move(any_plan));
}
return install_plan;
}
2017-01-05 14:14:11 -08:00
}