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 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257
| #include "moduledependancies.h"
#include <unordered_map>
#include <stack>
#include <unordered_set>
#include <algorithm>
#include <LastEngine/Algorithms.h>
namespace std
{
template<>
class hash<LE::Module::ModuleDependancies::ModuleInfo> {
public:
std::size_t operator()(const LE::Module::ModuleDependancies::ModuleInfo & info) const
{
return (std::size_t) & info.file.modules[info.module];
}
};
template<>
class equal_to<LE::Module::ModuleDependancies::ModuleInfo> {
public:
bool operator()(const LE::Module::ModuleDependancies::ModuleInfo & infoA, const LE::Module::ModuleDependancies::ModuleInfo & infoB) const
{
return &infoA.file.modules[infoA.module] == &infoB.file.modules[infoB.module];
}
};
}
namespace LE
{
namespace Module
{
namespace {
typedef std::unordered_multimap<std::string, const ModuleDependancies::ModuleInfo *> APIList;
typedef std::unordered_multimap<ModuleDependancies::ModuleInfo, std::string> ExcludeList;
typedef std::unordered_map<const ModuleDependancies::ModuleInfo *, std::size_t> NbDependancies;
typedef std::unordered_multimap<std::string, const ModuleDependancies::ModuleInfo *> Users;
typedef std::unordered_set<ModuleDependancies::ModuleInfo> Modules;
const Info::Module & mod(const ModuleDependancies::ModuleInfo & m)
{
return m.file.modules[m.module];
}
// get alls modules from modulesFiles
void fillModules( Modules & modules, const Range<const std::pair<std::string, Info::File> > &modulesFiles )
{
for( const std::pair<std::string, Info::File> & file : modulesFiles )
{
ModuleDependancies::ModuleInfo info = { file.first, file.second };
std::size_t i = 0;
for( const Info::Module & m : file.second.modules )
{
info.module = i;
modules.insert( info );
++i;
}
}
}
// fill all informations about modules
void fillInformations( Modules & modules,
NbDependancies & nbDependancies,
APIList & apis,
Users & users)
{
for( const ModuleDependancies::ModuleInfo & module : modules )
{
const Info::Module & moduleInfo = module.file.modules[module.module];
const auto & dependancies = moduleInfo.dependancies;
nbDependancies[&module] = dependancies.size();
for( const Info::API & api : dependancies )
users.insert( std::make_pair( api.name, &module) );
apis.insert( std::make_pair(moduleInfo.api.name, &module) );
}
}
bool isApiHere(const Info::API & api, APIList & apis) {
auto range = apis.equal_range(api.name);
if( range.first == range.second )
return false;
for( ; range.first != range.second; ++range.first)
{
const ModuleDependancies::ModuleInfo * moduleInfo = range.first->second;
const Info::Module & mod = moduleInfo->file.modules[ moduleInfo->module ];
if( mod.api.version >= api.version)
return true;
}
return false;
}
bool isAllDependanciesHere( const ModuleDependancies::ModuleInfo & module, APIList & apis)
{
const Info::Module & moduleInfo = module.file.modules[module.module];
const auto & dependancies = moduleInfo.dependancies;
for( const Info::API & api : dependancies )
if( ! isApiHere(api, apis) )
return false;
return true;
}
Info::Version versionNeeded(const ModuleDependancies::ModuleInfo & module, const std::string & api_name)
{
for( const Info::API & api : mod(module).dependancies )
if( api.name == api_name )
return api.version;
return Info::Version();
}
void excludeModule(const ModuleDependancies::ModuleInfo & module, ExcludeList & exclus, const std::string & reason,
APIList & apis, Users & users, NbDependancies & nbDependancies)
{
typedef std::pair<const std::string, const ModuleDependancies::ModuleInfo *> Element;
exclus.insert( std::make_pair(module, reason) );
const Info::Module & moduleInfo = mod(module);
for( const Info::API & api : moduleInfo.dependancies )
multimap_erase(users, api.name, &module); // not an user anymore
multimap_erase( apis, moduleInfo.api.name, &module); // give no api anymore
auto range = apis.equal_range( moduleInfo.api.name );
Info::Version version;
if( range.first != range.second)
{
auto max = std::max_element(range.first, range.second,
[](const Element & a, const Element & b){ return mod(*a.second).api.version < mod(*b.second).api.version; } );
version = mod(*max->second).api.version;
}
if( moduleInfo.api.version > version) // search modules which need a version > version
{
auto range = apis.equal_range( moduleInfo.api.name );
for( ; range.first != range.second ; ++ range.first )
{
const ModuleDependancies::ModuleInfo & user = * range.first->second;
if( versionNeeded(user, moduleInfo.api.name) > version)
excludeModule(user, exclus, "A dependancy can't be loaded", apis, users, nbDependancies);
}
}
nbDependancies.erase( nbDependancies.find(&module) );
}
void acceptModule(const ModuleDependancies::ModuleInfo & module, std::vector<ModuleDependancies::ModuleInfo> & toLoad,
Users & users, NbDependancies & nbDependancies, std::stack<const ModuleDependancies::ModuleInfo *> & noDependancies)
{
toLoad.push_back(module);
nbDependancies.erase(&module);
auto range = users.equal_range( mod(module).api.name );
for( ; range.first != range.second; range.first)
if( --nbDependancies[range.first->second] )
noDependancies.push(range.first->second);
//users.erase( range.first, range.second);
}
void excludeOldestAPI(APIList & apis, ExcludeList & exclus,
Users & users, NbDependancies & nbDependancies)
{
auto last = apis.begin();
auto end = apis.end();
auto it = ++last;
while(it != end)
{
if(last->first != it->first)
{
last = ++it;
continue;
}
if( mod(*last->second).api.version != mod(*it->second).api.version)
{
const ModuleDependancies::ModuleInfo & module = *it->second;
it = apis.erase(it);
excludeModule(module, exclus, "newer api available",
apis, users, nbDependancies);
}
else
{
excludeModule(*last->second, exclus, "newer api available",
apis, users, nbDependancies);
++it;
}
}
}
}
void ModuleDependancies::loadOrder(const Range<const std::pair<std::string, Info::File> > &modulesFiles)
{
Modules modules;
NbDependancies nbDependancies;
APIList apis; // api_name, module which implements the API.
Users users; // api_name, module which use the API.
fillModules(modules, modulesFiles);
fillInformations(modules, nbDependancies, apis, users);
ExcludeList exclus;
for( const ModuleInfo & module : modules)
if( ! isAllDependanciesHere(module, apis) )
excludeModule(module, exclus, "A dependancy is missing", apis, users, nbDependancies);
excludeOldestAPI(apis, exclus, users, nbDependancies);
// get all modules with no dependancies.
std::stack<const ModuleInfo *> noDependancies;
for( const auto & dep : nbDependancies)
if( ! dep.second )
noDependancies.push(dep.first);
// get all module to load
std::vector<ModuleInfo> toLoad; // to return
while( ! noDependancies.empty() )
{
auto dep = noDependancies.top();
noDependancies.pop();
acceptModule(*dep, toLoad, users, nbDependancies, noDependancies);
}
// unloaded modules are exclued.
for( const auto & dep : nbDependancies)
excludeModule(*dep.first, exclus, "Dependancy circle", apis, users, nbDependancies);
// TODO return exclus & toLoad.
}
}
} |
Partager