mirror of
https://github.com/Combodo/iTop.git
synced 2026-02-12 23:14:18 +01:00
code style last test cleanup review + enhance UI output and display only failed module dependencies real life test cleanup review: add more tests + refacto code review: enhance algo and APIs review: renaming enhance test coverage refactoring renaming + reorder functions/tests compute GetDependencyResolutionFeedback in Module class review2 : renaming things fix rebase + code formatting fix code formatting review changes refactoring: code cleanup/standardization/remove all prototype stuffs refactoring: code cleanup/standardization/remove all prototype stuffs add deps validation to extension ci job fix ci fix ci: test broken when dir to scan did not exist like production-modules fix tests module dependency validation moved in a core folder + cleanup dedicated unit/integration tests forget dependency computation optimization seen as too risky + keep only user friendly sort in case of setup error rebase on develop + split new sort computation apart from modulediscovery revert to previous legacy order + gather new module computation classes in a dedicated folder make validation work (dirty way) + cleanup make setup deterministic: complete dependency order with alphabetical one when 2 module elements are at same position final deps validation bases on DM and PHP classes init in beforeclass + read defined classes/interfaces by module module discovery classes renaming to avoid collision with customer DM definitions read module file data apart from ModuleDiscovery cleanup cleanup fix inconsistent module dependencies fix integration check save tmp work before trying to fetch other wml deps fix module dependencies fix DM filename typo rename ModuleXXX classes by iTopCoreModuleXXX to reduce collisions with extensions add phpdoc + add more tests module dependency optimization - refacto + dependency new sort order module dependency optimization - stop computation when no new dependency is resolved enhance module dependency computation for optimization and admin feedback
199 lines
6.3 KiB
PHP
199 lines
6.3 KiB
PHP
<?php
|
|
|
|
namespace Combodo\iTop\Setup\ModuleDependency;
|
|
|
|
require_once(__DIR__.'/module.class.inc.php');
|
|
|
|
use MissingDependencyException;
|
|
|
|
/**
|
|
* Class that sorts module dependencies
|
|
*/
|
|
class ModuleDependencySort
|
|
{
|
|
private static ModuleDependencySort $oInstance;
|
|
|
|
protected function __construct()
|
|
{
|
|
}
|
|
|
|
final public static function GetInstance(): ModuleDependencySort
|
|
{
|
|
if (!isset(static::$oInstance)) {
|
|
static::$oInstance = new static();
|
|
}
|
|
|
|
return static::$oInstance;
|
|
}
|
|
|
|
final public static function SetInstance(?ModuleDependencySort $oInstance): void
|
|
{
|
|
static::$oInstance = $oInstance;
|
|
}
|
|
|
|
/**
|
|
* Sort a list of modules, based on their (inter) dependencies
|
|
* @param array $aModules The list of modules to process: 'id' => $aModuleInfo
|
|
* @param bool $bAbortOnMissingDependency ...
|
|
* @return array
|
|
* @throws \MissingDependencyException
|
|
*/
|
|
public function GetModulesOrderedForInstallation($aModules, $bAbortOnMissingDependency = false)
|
|
{
|
|
// Filter modules to compute
|
|
$aUnresolvedDependencyModules = [];
|
|
$aModuleNames = [];
|
|
foreach ($aModules as $sModuleId => $aModule) {
|
|
$oModule = new Module($sModuleId);
|
|
$sModuleName = $oModule->GetModuleName();
|
|
$oModule->SetDependencies($aModule['dependencies']);
|
|
$aUnresolvedDependencyModules[$sModuleId] = $oModule;
|
|
$aModuleNames[$sModuleName] = true;
|
|
}
|
|
|
|
// Make sure order is deterministic (alphabtical order)
|
|
ksort($aUnresolvedDependencyModules);
|
|
|
|
//Attempt to resolve module dependencies
|
|
$aOrderedModules = [];
|
|
$aModuleVersions = [];
|
|
$iPreviousUnresolvedCount = -1;
|
|
//loop until no dependency is resolved
|
|
while ($iPreviousUnresolvedCount !== count($aUnresolvedDependencyModules)) {
|
|
$iPreviousUnresolvedCount = count($aUnresolvedDependencyModules);
|
|
if ($iPreviousUnresolvedCount === 0) {
|
|
break;
|
|
}
|
|
|
|
foreach ($aUnresolvedDependencyModules as $sModuleId => $oModule) {
|
|
/** @var Module $oModule */
|
|
$oModule->UpdateModuleResolutionState($aModuleVersions, $aModuleNames);
|
|
if ($oModule->IsResolved()) {
|
|
$aOrderedModules[] = $sModuleId;
|
|
$aModuleVersions[$oModule->GetModuleName()] = $oModule->GetVersion();
|
|
unset($aUnresolvedDependencyModules[$sModuleId]);
|
|
}
|
|
}
|
|
}
|
|
|
|
// Report unresolved dependencies
|
|
if ($bAbortOnMissingDependency && count($aUnresolvedDependencyModules) > 0) {
|
|
$this->SortModulesByCountOfDepencenciesDescending($aUnresolvedDependencyModules);
|
|
|
|
$aUnresolvedModulesInfo = [];
|
|
$aModuleDeps = [];
|
|
foreach ($aUnresolvedDependencyModules as $sModuleId => $oModule) {
|
|
$aModule = $aModules[$sModuleId];
|
|
$aDepsWithIcons = $oModule->GetDependencyResolutionFeedback();
|
|
|
|
$aModuleDeps[] = "{$aModule['label']} (id: $sModuleId) depends on: ".implode(' + ', $aDepsWithIcons);
|
|
$aUnresolvedModulesInfo[$sModuleId] = ['module' => $aModule, 'dependencies' => $aDepsWithIcons];
|
|
}
|
|
$sMessage = "The following modules have unmet dependencies:\n".implode(",\n", $aModuleDeps);
|
|
$oException = new MissingDependencyException($sMessage);
|
|
$oException->aModulesInfo = $aUnresolvedModulesInfo;
|
|
throw $oException;
|
|
}
|
|
|
|
// Return the ordered list, so that the dependencies are met...
|
|
$aResult = [];
|
|
foreach ($aOrderedModules as $sId) {
|
|
$aResult[$sId] = $aModules[$sId];
|
|
}
|
|
return $aResult;
|
|
}
|
|
|
|
/**
|
|
* This method is key as it sorts modules by their dependencies (topological sort).
|
|
* Modules with less dependencies are first.
|
|
* When module A depends from module B with same amount of dependencies, moduleB is first.
|
|
* This order can deal with
|
|
* - cyclic dependencies
|
|
* - further versions of same module (name)
|
|
*
|
|
* @param array $aUnresolvedDependencyModules: dict of Module objects by moduleId key
|
|
*
|
|
* @return void
|
|
*/
|
|
protected function SortModulesByCountOfDepencenciesDescending(array &$aUnresolvedDependencyModules): void
|
|
{
|
|
$aCountDepsByModuleId = [];
|
|
$aDependsOnModuleName = [];
|
|
|
|
foreach ($aUnresolvedDependencyModules as $sModuleId => $oModule) {
|
|
/** @var Module $oModule */
|
|
$aDependsOnModuleName[$oModule->GetModuleName()] = [];
|
|
}
|
|
|
|
foreach ($aUnresolvedDependencyModules as $sModuleId => $oModule) {
|
|
$iInDegreeCounter = 0;
|
|
/** @var Module $oModule */
|
|
$aUnresolvedDependencyModuleNames = $oModule->GetUnresolvedDependencyModuleNames();
|
|
foreach ($aUnresolvedDependencyModuleNames as $sModuleName) {
|
|
if (array_key_exists($sModuleName, $aDependsOnModuleName)) {
|
|
$aDependsOnModuleName[$sModuleName][] = $sModuleId;
|
|
$iInDegreeCounter++;
|
|
}
|
|
}
|
|
//include all modules
|
|
$iInDegreeCounterIncludingOutsideModules = count($oModule->GetUnresolvedDependencyModuleNames());
|
|
$aCountDepsByModuleId[$sModuleId] = [$iInDegreeCounter, $iInDegreeCounterIncludingOutsideModules, $sModuleId];
|
|
}
|
|
|
|
$aRes = [];
|
|
while (count($aUnresolvedDependencyModules) > 0) {
|
|
asort($aCountDepsByModuleId);
|
|
|
|
uasort($aCountDepsByModuleId, function (array $aDeps1, array $aDeps2) {
|
|
//compare $iInDegreeCounter
|
|
$res = $aDeps1[0] - $aDeps2[0];
|
|
if ($res != 0) {
|
|
return $res;
|
|
}
|
|
|
|
//compare $iInDegreeCounterIncludingOutsideModules
|
|
$res = $aDeps1[1] - $aDeps2[1];
|
|
if ($res != 0) {
|
|
return $res;
|
|
}
|
|
|
|
//alphabetical order at least
|
|
return strcmp($aDeps1[2], $aDeps2[2]);
|
|
});
|
|
|
|
$bOneLoopAtLeast = false;
|
|
foreach ($aCountDepsByModuleId as $sModuleId => $iInDegreeCounter) {
|
|
$oModule = $aUnresolvedDependencyModules[$sModuleId];
|
|
|
|
if ($bOneLoopAtLeast && $iInDegreeCounter > 0) {
|
|
break;
|
|
}
|
|
|
|
unset($aUnresolvedDependencyModules[$sModuleId]);
|
|
unset($aCountDepsByModuleId[$sModuleId]);
|
|
|
|
$aRes[$sModuleId] = $oModule;
|
|
|
|
//when 2 versions of the same module (name) below array has been removed already
|
|
if (array_key_exists($oModule->GetModuleName(), $aDependsOnModuleName)) {
|
|
foreach ($aDependsOnModuleName[$oModule->GetModuleName()] as $sModuleId2) {
|
|
if (! array_key_exists($sModuleId2, $aCountDepsByModuleId)) {
|
|
continue;
|
|
}
|
|
$aDepCount = $aCountDepsByModuleId[$sModuleId2];
|
|
$iInDegreeCounter = $aDepCount[0] - 1;
|
|
$iInDegreeCounterIncludingOutsideModules = $aDepCount[1];
|
|
$aCountDepsByModuleId[$sModuleId2] = [$iInDegreeCounter, $iInDegreeCounterIncludingOutsideModules, $sModuleId2];
|
|
}
|
|
|
|
unset($aDependsOnModuleName[$oModule->GetModuleName()]);
|
|
}
|
|
|
|
$bOneLoopAtLeast = true;
|
|
}
|
|
}
|
|
|
|
$aUnresolvedDependencyModules = $aRes;
|
|
}
|
|
}
|