| __init__.py |
|
729 |
| actions |
|
|
| config.py |
Schema for GraphConfig |
5108 |
| create.py |
|
5185 |
| decision.py |
Run the decision task. This function implements `mach taskgraph decision`,
and is responsible for
* processing decision task command-line options into parameters
* running task-graph generation exactly the same way the other `mach
taskgraph` commands do
* generating a set of artifacts to memorialize the graph
* calling TaskCluster APIs to create the graph
|
12880 |
| docker.py |
Build a context.tar for image with specified name. |
8016 |
| files_changed.py |
Support for optimizing tasks based on the set of files that have changed.
|
2829 |
| filter_tasks.py |
Generator to declare a task filter function. |
866 |
| generator.py |
Raised when trying to load kind from a directory without a kind.yml.
|
15703 |
| graph.py |
Generic representation of a directed acyclic graph with labeled edges
connecting the nodes. Graph operations are implemented in a functional
manner, so the data structure is immutable.
It permits at most one edge of a given name between any set of nodes. The
graph is not checked for cycles, and methods may hang or otherwise fail if
given a cyclic graph.
The `nodes` and `edges` attributes may be accessed in a read-only fashion.
The `nodes` attribute is a set of node names, while `edges` is a set of
`(left, right, name)` tuples representing an edge named `name` going from
node `left` to node `right`..
|
4680 |
| loader |
|
|
| main.py |
Filter all the tasks on basis of a regular expression
and returns a new TaskGraph object
|
28293 |
| morph.py |
Graph morphs are modifications to task-graphs that take place *after* the
optimization phase.
These graph morphs are largely invisible to developers running `./mach`
locally, so they should be limited to changes that do not modify the meaning of
the graph.
|
9208 |
| optimize |
|
|
| parameters.py |
Raised when a parameters.yml has extra or missing parameters. |
12126 |
| run-task |
|
|
| target_tasks.py |
Get a target_task_method to pass to a TaskGraphGenerator. |
3356 |
| task.py |
Representation of a task in a TaskGraph. Each Task has, at creation:
- kind: the name of the task kind
- label; the label for this task
- attributes: a dictionary of attributes for this task (used for filtering)
- task: the task definition (JSON-able dictionary)
- optimization: optimization to apply to the task (see taskgraph.optimize)
- dependencies: tasks this one depends on, in the form {name: label}, for example
{'build': 'build-linux64/opt', 'docker-image': 'build-docker-image-desktop-test'}
- soft_dependencies: tasks this one may depend on if they are available post
optimisation. They are set as a list of tasks label.
- if_dependencies: only run this task if at least one of these dependencies
are present.
And later, as the task-graph processing proceeds:
- task_id -- TaskCluster taskId under which this task will be created
This class is just a convenience wrapper for the data type and managing
display, comparison, serialization, etc. It has no functionality of its own.
|
3240 |
| taskgraph.py |
Representation of a task graph.
A task graph is a combination of a Graph and a dictionary of tasks indexed
by label. TaskGraph instances should be treated as immutable.
In the graph, tasks are said to "link to" their dependencies. Whereas
tasks are "linked from" their dependents.
|
2434 |
| transforms |
|
|
| util |
|
|