/usr/lib/python3/dist-packages/plainbox/impl/depmgr.py is in python3-plainbox 0.5.3-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 | # This file is part of Checkbox.
#
# Copyright 2012, 2013 Canonical Ltd.
# Written by:
# Zygmunt Krynicki <zygmunt.krynicki@canonical.com>
#
# Checkbox is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License version 3,
# as published by the Free Software Foundation.
#
# Checkbox is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with Checkbox. If not, see <http://www.gnu.org/licenses/>.
"""
:mod:`plainbox.impl.depmgr` -- dependency solver
================================================
.. warning::
THIS MODULE DOES NOT HAVE STABLE PUBLIC API
"""
from abc import ABCMeta
from abc import abstractproperty
from logging import getLogger
from plainbox.i18n import gettext as _
logger = getLogger("plainbox.depmgr")
class DependencyError(Exception, metaclass=ABCMeta):
"""
Exception raised when a dependency error is detected
"""
@abstractproperty
def affected_job(self):
"""
JobDefinition instance that is affected by the dependency error.
"""
@abstractproperty
def affecting_job(self):
"""
JobDefinition instance that is affecting
:attr:`affected_job`
This may be None in certain cases (eg, when the job does not exist and
is merely referred to by id). If this job exists removing it SHOULD
fix this problem from occurring.
This may be the same as :attr:`affected_job`
"""
class DependencyCycleError(DependencyError):
"""
Exception raised when a cyclic dependency is detected
"""
def __init__(self, job_list):
"""
Initialize with a list of jobs that form a dependency loop.
The dependencies satisfy the given expression:
job_list[n - 1] depends-on job_list[n]
The error exists because job_list[0] is job_list[-1].
Each item is a JobDefinition instance.
"""
assert len(job_list) > 1
assert job_list[0] is job_list[-1]
self.job_list = job_list
@property
def affected_job(self):
"""
the job that has a cyclic dependency on itself
"""
return self.job_list[0]
@property
def affecting_job(self):
"""
same as :attr:`~DependencyCycleError.affected_job`
"""
return self.affected_job
def __str__(self):
return _("dependency cycle detected: {}").format(
" -> ".join([job.id for job in self.job_list]))
def __repr__(self):
return "<{} job_list:{!r}>".format(
self.__class__.__name__, self.job_list)
class DependencyMissingError(DependencyError):
"""
Exception raised when a job has an unsatisfied dependency
"""
DEP_TYPE_RESOURCE = "resource"
DEP_TYPE_DIRECT = "direct"
def __init__(self, job, missing_job_id, dep_type):
self.job = job
self.missing_job_id = missing_job_id
self.dep_type = dep_type
@property
def affected_job(self):
"""
the job that has a missing dependency
"""
return self.job
@property
def affecting_job(self):
"""
the job that is affecting :attr:`~DependencyMissingError.affected_job`
This is always None as we have not seen this job at all and that's
what's causing the problem in the first place.
"""
return None
def __str__(self):
return _("missing dependency: {!r} ({})").format(
self.missing_job_id, self.dep_type)
def __repr__(self):
return "<{} job:{!r} missing_job_id:{!r} dep_type:{!r}>".format(
self.__class__.__name__,
self.job, self.missing_job_id, self.dep_type)
class DependencyDuplicateError(DependencyError):
"""
Exception raised when two jobs have identical id
"""
def __init__(self, job, duplicate_job):
assert job.id == duplicate_job.id
self.job = job
self.duplicate_job = duplicate_job
@property
def affected_job(self):
"""
the job that already known by the system
"""
return self.job
@property
def affecting_job(self):
"""
the job that is clashing with the job already in the system
"""
return self.duplicate_job
def __str__(self):
return _("duplicate job id: {!r}").format(self.affected_job.id)
def __repr__(self):
return "<{} job:{!r} duplicate_job:{!r}>".format(
self.__class__.__name__, self.job, self.duplicate_job)
class DependencySolver:
"""
Dependency solver for Jobs
Uses a simple depth-first search to discover the sequence of jobs that can
run. Use the resolve_dependencies() class method to get the solution.
"""
# Node colors:
#
# white nodes have not been visited yet
# gray nodes are currently being visited and are incomplete
# black nodes have been visited and are complete
COLOR_WHITE, COLOR_GRAY, COLOR_BLACK = range(3)
@classmethod
def resolve_dependencies(cls, job_list, visit_list=None):
"""
Solve the dependency graph expressed as a list of job definitions.
:param list job_list: list of known jobs
:param list visit_list: (optional) list of jobs to solve
The visit_list, if specified, allows to consider only a part of the
graph while still having access and knowledge of all jobs.
:returns list: the solution (a list of jobs to execute in order)
:raises DependencyDuplicateError:
if a duplicate job definition is present
:raises DependencyCycleError:
if a cyclic dependency is present.
:raises DependencyMissingErorr:
if a required job does not exist.
"""
return cls(job_list)._solve(visit_list)
def __init__(self, job_list):
"""
Instantiate a new dependency solver with the specified list of jobs
:raises DependencyDuplicateError:
if the initial job_list has any duplicate jobs
"""
# Remember the jobs that were passed
self._job_list = job_list
# Build a map of jobs (by id)
self._job_map = self._get_job_map(job_list)
# Job colors, maps from job.id to COLOR_xxx
self._job_color_map = {job.id: self.COLOR_WHITE for job in job_list}
# The computed solution, made out of job instances. This is not
# necessarily the only solution but the algorithm computes the same
# value each time, given the same input.
self._solution = []
def _solve(self, visit_list=None):
"""
Internal method of DependencySolver.
Solves the dependency graph and returns the solution.
Calls _visit() on each of the initial nodes/jobs
"""
# Visit the visit list
logger.debug(_("Starting solve"))
if visit_list is None:
visit_list = self._job_list
for job in visit_list:
self._visit(job)
logger.debug(_("Done solving"))
# Return the solution
return self._solution
def _visit(self, job, trail=None):
"""
Internal method of DependencySolver
Called each time a node is visited. Nodes already seen in _visited are
skipped. Attempts to enumerate all dependencies (both direct and
resource) and resolve them. Missing jobs cause DependencyMissingError
to be raised. Calls _visit recursively on all dependencies.
"""
color = self._job_color_map[job.id]
logger.debug(_("Visiting job %s (color %s)"), job, color)
if color == self.COLOR_WHITE:
# This node has not been visited yet. Let's mark it as GRAY (being
# visited) and iterate through the list of dependencies
self._job_color_map[job.id] = self.COLOR_GRAY
# If the trail was not specified start a trail for this node
if trail is None:
trail = [job]
for dep_type, job_id in job.controller.get_dependency_set(job):
# Dependency is just an id, we need to resolve it
# to a job instance. This can fail (missing dependencies)
# so let's guard against that.
try:
next_job = self._job_map[job_id]
except KeyError:
raise DependencyMissingError(job, job_id, dep_type)
else:
# For each dependency that we visit let's reuse the trail
# to give proper error messages if a dependency loop exists
logger.debug(_("Visiting dependency: %r"), next_job)
# Update the trail as we visit that node
trail.append(next_job)
self._visit(next_job, trail)
trail.pop()
# We've visited (recursively) all dependencies of this node,
# let's color it black and append it to the solution list.
logger.debug(_("Appending %r to solution"), job)
self._job_color_map[job.id] = self.COLOR_BLACK
self._solution.append(job)
elif color == self.COLOR_GRAY:
# This node is not fully traced yet but has been visited already
# so we've found a dependency loop. We need to cut the initial
# part of the trail so that we only report the part that actually
# forms a loop
raise DependencyCycleError(trail[trail.index(job):])
else:
assert color == self.COLOR_BLACK
# This node has been visited and is fully traced.
# We can just skip it and go back
@staticmethod
def _get_job_map(job_list):
"""
Internal method of DependencySolver.
Computes a map of job.id => job
Raises DependencyDuplicateError if a collision is found
"""
job_map = {}
for job in job_list:
if job.id in job_map:
raise DependencyDuplicateError(job_map[job.id], job)
else:
job_map[job.id] = job
return job_map
|