You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
92 lines
3.2 KiB
92 lines
3.2 KiB
/*============================================================================
|
|
CMake - Cross Platform Makefile Generator
|
|
Copyright 2000-2009 Kitware, Inc., Insight Software Consortium
|
|
|
|
Distributed under the OSI-approved BSD License (the "License");
|
|
see accompanying file Copyright.txt for details.
|
|
|
|
This software is distributed WITHOUT ANY WARRANTY; without even the
|
|
implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
|
See the License for more information.
|
|
============================================================================*/
|
|
#ifndef cmComputeTargetDepends_h
|
|
#define cmComputeTargetDepends_h
|
|
|
|
#include "cmStandardIncludes.h"
|
|
|
|
#include "cmGraphAdjacencyList.h"
|
|
|
|
#include <stack>
|
|
|
|
class cmComputeComponentGraph;
|
|
class cmGlobalGenerator;
|
|
class cmLinkItem;
|
|
class cmTarget;
|
|
class cmTargetDependSet;
|
|
|
|
/** \class cmComputeTargetDepends
|
|
* \brief Compute global interdependencies among targets.
|
|
*
|
|
* Static libraries may form cycles in the target dependency graph.
|
|
* This class evaluates target dependencies globally and adjusts them
|
|
* to remove cycles while preserving a safe build order.
|
|
*/
|
|
class cmComputeTargetDepends
|
|
{
|
|
public:
|
|
cmComputeTargetDepends(cmGlobalGenerator* gg);
|
|
~cmComputeTargetDepends();
|
|
|
|
bool Compute();
|
|
|
|
std::vector<cmTarget const*> const&
|
|
GetTargets() const { return this->Targets; }
|
|
void GetTargetDirectDepends(cmTarget const* t, cmTargetDependSet& deps);
|
|
private:
|
|
void CollectTargets();
|
|
void CollectDepends();
|
|
void CollectTargetDepends(int depender_index);
|
|
void AddTargetDepend(int depender_index,
|
|
cmLinkItem const& dependee_name,
|
|
bool linking);
|
|
void AddTargetDepend(int depender_index, cmTarget const* dependee,
|
|
bool linking);
|
|
bool ComputeFinalDepends(cmComputeComponentGraph const& ccg);
|
|
void AddInterfaceDepends(int depender_index,
|
|
cmLinkItem const& dependee_name,
|
|
std::set<std::string> &emitted);
|
|
void AddInterfaceDepends(int depender_index, cmTarget const* dependee,
|
|
const std::string& config,
|
|
std::set<std::string> &emitted);
|
|
cmGlobalGenerator* GlobalGenerator;
|
|
bool DebugMode;
|
|
bool NoCycles;
|
|
|
|
// Collect all targets.
|
|
std::vector<cmTarget const*> Targets;
|
|
std::map<cmTarget const*, int> TargetIndex;
|
|
|
|
// Represent the target dependency graph. The entry at each
|
|
// top-level index corresponds to a depender whose dependencies are
|
|
// listed.
|
|
typedef cmGraphNodeList NodeList;
|
|
typedef cmGraphEdgeList EdgeList;
|
|
typedef cmGraphAdjacencyList Graph;
|
|
Graph InitialGraph;
|
|
Graph FinalGraph;
|
|
void DisplayGraph(Graph const& graph, const std::string& name);
|
|
|
|
// Deal with connected components.
|
|
void DisplayComponents(cmComputeComponentGraph const& ccg);
|
|
bool CheckComponents(cmComputeComponentGraph const& ccg);
|
|
void ComplainAboutBadComponent(cmComputeComponentGraph const& ccg, int c,
|
|
bool strong = false);
|
|
|
|
std::vector<int> ComponentHead;
|
|
std::vector<int> ComponentTail;
|
|
bool IntraComponent(std::vector<int> const& cmap, int c, int i, int* head,
|
|
std::set<int>& emitted, std::set<int>& visited);
|
|
};
|
|
|
|
#endif
|