Class depgraph

Load installed package metadata if appropriate. This used to be called from the constructor, but that wasn't very nice since this procedure is slow and it generates spinner output. So, now it's called on-demand by various methods when necessary.

Show an informational message advising the user to mask one of the the packages. In some cases it may be possible to resolve this automatically, but support for backtracking (removal nodes that have already been selected) will be required in order to handle all possible cases.

Process slot conflict data to identify specific atoms which lead to conflict. These atoms only match a subset of the packages that have been pulled into a given slot.

If one or more conflict atoms have a slot/sub-slot dep that can be resolved by rebuilding the parent package, then schedule the rebuild via backtracking, and return True. Otherwise, return False.

Returns: bool

True if dep.child should be rebuilt due to a change in sub-slot (without revbump, as in bug #456208).

slot/sub-slot := operators tend to prevent updates from getting pulled in,
since installed packages pull in packages with the slot/sub-slot that they
were built against. Detect this case so that we can schedule rebuilds
and reinstalls when appropriate.
NOTE: This function only searches for updates that involve upgrades
        to higher versions, since the logic required to detect when a
        downgrade would be desirable is not implemented.

Given a package that's in the graph, do a rough check to see if a similar package is available to install. The given graph_pkg itself may be yielded only if it's not installed.

Given an installed package, generate an atom suitable for slot_operator_replace_installed backtracking info. The replacement SLOT may differ from the installed SLOT, so first search by cpv.

Iterate over a list of DependencyArg instances and yield all instances given in the input together with additional SetArg instances that are generated from nested sets.

Parameters:

• input_args (Iterable) - An iterable of DependencyArg instances
• add_to_digraph (Boolean) - If True then add SetArg instances to the digraph, in order to record parent -> child relationships from nested sets

Returns: Iterable

All args given in the input together with additional SetArg instances that are generated from nested sets

Selects packages to satisfy the given atoms, and minimizes the number of selected packages. This serves to identify and eliminate redundant package selections when multiple atoms happen to specify a version range.

Queue disjunctive (virtual and ||) deps in self._dynamic_config._dep_disjunctive_stack. Yields non-disjunctive deps. Raises InvalidDependString when necessary.

Parameters:

• root_config (RootConfig) - a root config instance
• atom_without_category (String) - an atom without a category component

Returns: list

a list of atoms containing categories (possibly empty)

Create the "__non_set_args__" package set from atoms and packages given as arguments. This method can be called multiple times if necessary. The package selection cache is automatically invalidated, since arguments influence package selections.

Return a list of slot atoms corresponding to installed slots that differ from the slot of the highest visible match. When blocker_lookahead is True, slot atoms that would trigger a blocker conflict are automatically discarded, potentially allowing automatic uninstallation of older slots when appropriate.

This will raise InvalidDependString if necessary. If trees is None then self._dynamic_config._filtered_trees is used.

Assumes pkg is a virtual package. Traverses virtual deps recursively and returns True if all deps are visible, False otherwise. This is useful for checking if it will be necessary to expand virtual slots, for cases like bug #382557.

Returns a list of (atom, node_type) pairs that represent a dep chain. If target_atom is None, the first package shown is pkg's parent. If target_atom is not None the first package shown is pkg. If unsatisfied_dependency is True, the first parent is select who's dependency is not satisfied by 'pkg'. This is need for USE changes. (Does not support target_atom.)

Iterate over Package instances of pkg_type matching the given atom. This does not check visibility and it also does not match USE for unbuilt ebuilds since USE are lazily calculated after visibility checks (to avoid the expense when possible).

Iterate over the different allowed things to unmask.

0. USE
1. USE + license
2. USE + ~arch + license
3. USE + ~arch + license + missing keywords
4. USE + license + masks
5. USE + ~arch + license + masks
6. USE + ~arch + license + missing keywords + masks

Some thoughts:
        * Do least invasive changes first.
        * Try unmasking alone before unmasking + missing keywords
                to avoid -9999 versions if possible

If target_use is None, returns pkg.use.enabled + changes in _needed_use_config_changes. If target_use is given, the need changes are computed to make the package useable. Example: target_use = { "foo": True, "bar": False } The flags target_use must be in the pkg's IUSE.

Add any deep dependencies of required sets (args, system, world) that have not been pulled into the graph yet. This ensures that the graph is consistent such that initially satisfied deep dependencies are not broken in the new graph. Initially unsatisfied dependencies are irrelevant since we only want to avoid breaking dependencies that are initially satisfied.

Since this method can consume enough time to disturb users, it is currently only enabled by the --complete-graph option.

Parameters:

• required_sets (dict) - contains required sets (currently only used for depclean and prune removal operations)

Get a package instance from the cache, or create a new one if necessary. Raises PackageNotFound from aux_get if it failures for some reason (package does not exist or is corrupt).

Remove any blockers from the digraph that do not match any of the packages within the graph. If necessary, create hard deps to ensure correct merge order such that mutually blocking packages are never installed simultaneously. Also add runtime blockers from all installed packages if any of them haven't been added already (bug 128809).

Display --autounmask message and optionally write it to config files (using CONFIG_PROTECT). The message includes the comments and the changes.

Add a resume command to the graph and validate it in the process. This will raise a PackageNotFound exception if a package is not available.

Use a list of favorites to resume state from a previous select_files() call. This creates similar DependencyArg instances to those that would have been created by the original select_files() call. This allows Package instances to be matched with DependencyArg instances during graph creation.