b76b48b887
CLOSED TREE Backed out changeset fd3615e7e0a3 (bug 1383880) Backed out changeset 8cceb6a82bfb (bug 1383880) Backed out changeset 571a6c9054a5 (bug 1383880) Backed out changeset ec2b8ba5a949 (bug 1383880) Backed out changeset 8e5847d9acda (bug 1383880) Backed out changeset b354fdf6e233 (bug 1383880) Backed out changeset ebdd6ccbcfca (bug 1383880) Backed out changeset ebcc9d20981a (bug 1383880) Backed out changeset 97eedc84d6e8 (bug 1383880) Backed out changeset a3116da52b4e (bug 1383880) Backed out changeset b3eb0c939720 (bug 1383880) Backed out changeset 7c07cb798530 (bug 1383880) MozReview-Commit-ID: EPDuQHr7w2y
250 lines
10 KiB
Python
250 lines
10 KiB
Python
# This Source Code Form is subject to the terms of the Mozilla Public
|
|
# License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
# file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
|
|
|
from __future__ import absolute_import, print_function, unicode_literals
|
|
|
|
import unittest
|
|
|
|
from taskgraph.optimize import optimize_task_graph, resolve_task_references, optimization
|
|
from taskgraph.optimize import annotate_task_graph, get_subgraph
|
|
from taskgraph.taskgraph import TaskGraph
|
|
from taskgraph import graph
|
|
from taskgraph.task import Task
|
|
from mozunit import main
|
|
|
|
|
|
class TestResolveTaskReferences(unittest.TestCase):
|
|
|
|
def do(self, input, output):
|
|
taskid_for_edge_name = {'edge%d' % n: 'tid%d' % n for n in range(1, 4)}
|
|
self.assertEqual(resolve_task_references('subject', input, taskid_for_edge_name), output)
|
|
|
|
def test_in_list(self):
|
|
"resolve_task_references resolves task references in a list"
|
|
self.do({'in-a-list': ['stuff', {'task-reference': '<edge1>'}]},
|
|
{'in-a-list': ['stuff', 'tid1']})
|
|
|
|
def test_in_dict(self):
|
|
"resolve_task_references resolves task references in a dict"
|
|
self.do({'in-a-dict': {'stuff': {'task-reference': '<edge2>'}}},
|
|
{'in-a-dict': {'stuff': 'tid2'}})
|
|
|
|
def test_multiple(self):
|
|
"resolve_task_references resolves multiple references in the same string"
|
|
self.do({'multiple': {'task-reference': 'stuff <edge1> stuff <edge2> after'}},
|
|
{'multiple': 'stuff tid1 stuff tid2 after'})
|
|
|
|
def test_embedded(self):
|
|
"resolve_task_references resolves ebmedded references"
|
|
self.do({'embedded': {'task-reference': 'stuff before <edge3> stuff after'}},
|
|
{'embedded': 'stuff before tid3 stuff after'})
|
|
|
|
def test_escaping(self):
|
|
"resolve_task_references resolves escapes in task references"
|
|
self.do({'escape': {'task-reference': '<<><edge3>>'}},
|
|
{'escape': '<tid3>'})
|
|
|
|
def test_invalid(self):
|
|
"resolve_task_references raises a KeyError on reference to an invalid task"
|
|
self.assertRaisesRegexp(
|
|
KeyError,
|
|
"task 'subject' has no dependency named 'no-such'",
|
|
lambda: resolve_task_references('subject', {'task-reference': '<no-such>'}, {})
|
|
)
|
|
|
|
|
|
class TestOptimize(unittest.TestCase):
|
|
|
|
kind = None
|
|
|
|
@classmethod
|
|
def setUpClass(cls):
|
|
# set up some simple optimization functions
|
|
optimization('no-optimize')(lambda self, params: False)
|
|
optimization('optimize-away')(lambda self, params: True)
|
|
optimization('optimize-to-task')(lambda self, params, task: task)
|
|
|
|
def make_task(self, label, optimization=None, task_def=None, optimized=None, task_id=None):
|
|
task_def = task_def or {'sample': 'task-def'}
|
|
task = Task(kind='test', label=label, attributes={}, task=task_def)
|
|
task.optimized = optimized
|
|
if optimization:
|
|
task.optimizations = [optimization]
|
|
else:
|
|
task.optimizations = []
|
|
task.task_id = task_id
|
|
return task
|
|
|
|
def make_graph(self, *tasks_and_edges):
|
|
tasks = {t.label: t for t in tasks_and_edges if isinstance(t, Task)}
|
|
edges = {e for e in tasks_and_edges if not isinstance(e, Task)}
|
|
return TaskGraph(tasks, graph.Graph(set(tasks), edges))
|
|
|
|
def assert_annotations(self, graph, **annotations):
|
|
def repl(task_id):
|
|
return 'SLUGID' if task_id and len(task_id) == 22 else task_id
|
|
got_annotations = {
|
|
t.label: repl(t.task_id) or t.optimized for t in graph.tasks.itervalues()
|
|
}
|
|
self.assertEqual(got_annotations, annotations)
|
|
|
|
def test_annotate_task_graph_no_optimize(self):
|
|
"annotating marks everything as un-optimized if the kind returns that"
|
|
graph = self.make_graph(
|
|
self.make_task('task1', ['no-optimize']),
|
|
self.make_task('task2', ['no-optimize']),
|
|
self.make_task('task3', ['no-optimize']),
|
|
('task2', 'task1', 'build'),
|
|
('task2', 'task3', 'image'),
|
|
)
|
|
annotate_task_graph(graph, {}, set(), graph.graph.named_links_dict(), {}, None)
|
|
self.assert_annotations(
|
|
graph,
|
|
task1=False,
|
|
task2=False,
|
|
task3=False
|
|
)
|
|
|
|
def test_annotate_task_graph_optimize_away_dependency(self):
|
|
"raises exception if kind optimizes away a task on which another depends"
|
|
graph = self.make_graph(
|
|
self.make_task('task1', ['optimize-away']),
|
|
self.make_task('task2', ['no-optimize']),
|
|
('task2', 'task1', 'build'),
|
|
)
|
|
self.assertRaises(
|
|
Exception,
|
|
lambda: annotate_task_graph(graph, {}, set(), graph.graph.named_links_dict(), {}, None)
|
|
)
|
|
|
|
def test_annotate_task_graph_do_not_optimize(self):
|
|
"annotating marks everything as un-optimized if in do_not_optimize"
|
|
graph = self.make_graph(
|
|
self.make_task('task1', ['optimize-away']),
|
|
self.make_task('task2', ['optimize-away']),
|
|
('task2', 'task1', 'build'),
|
|
)
|
|
label_to_taskid = {}
|
|
annotate_task_graph(graph, {}, {'task1', 'task2'},
|
|
graph.graph.named_links_dict(), label_to_taskid, None)
|
|
self.assert_annotations(
|
|
graph,
|
|
task1=False,
|
|
task2=False
|
|
)
|
|
self.assertEqual
|
|
|
|
def test_annotate_task_graph_nos_do_not_propagate(self):
|
|
"a task with a non-optimized dependency can be optimized"
|
|
graph = self.make_graph(
|
|
self.make_task('task1', ['no-optimize']),
|
|
self.make_task('task2', ['optimize-to-task', 'taskid']),
|
|
self.make_task('task3', ['optimize-to-task', 'taskid']),
|
|
('task2', 'task1', 'build'),
|
|
('task2', 'task3', 'image'),
|
|
)
|
|
annotate_task_graph(graph, {}, set(),
|
|
graph.graph.named_links_dict(), {}, None)
|
|
self.assert_annotations(
|
|
graph,
|
|
task1=False,
|
|
task2='taskid',
|
|
task3='taskid'
|
|
)
|
|
|
|
def test_get_subgraph_single_dep(self):
|
|
"when a single dependency is optimized, it is omitted from the graph"
|
|
graph = self.make_graph(
|
|
self.make_task('task1', optimized=True, task_id='dep1'),
|
|
self.make_task('task2', optimized=False),
|
|
self.make_task('task3', optimized=False),
|
|
('task2', 'task1', 'build'),
|
|
('task2', 'task3', 'image'),
|
|
)
|
|
label_to_taskid = {'task1': 'dep1'}
|
|
sub = get_subgraph(graph, graph.graph.named_links_dict(), label_to_taskid)
|
|
task2 = label_to_taskid['task2']
|
|
task3 = label_to_taskid['task3']
|
|
self.assertEqual(sub.graph.nodes, {task2, task3})
|
|
self.assertEqual(sub.graph.edges, {(task2, task3, 'image')})
|
|
self.assertEqual(sub.tasks[task2].task_id, task2)
|
|
self.assertEqual(sorted(sub.tasks[task2].task['dependencies']),
|
|
sorted([task3, 'dep1']))
|
|
self.assertEqual(sub.tasks[task3].task_id, task3)
|
|
self.assertEqual(sorted(sub.tasks[task3].task['dependencies']), [])
|
|
|
|
def test_get_subgraph_dep_chain(self):
|
|
"when a dependency chain is optimized, it is omitted from the graph"
|
|
graph = self.make_graph(
|
|
self.make_task('task1', optimized=True, task_id='dep1'),
|
|
self.make_task('task2', optimized=True, task_id='dep2'),
|
|
self.make_task('task3', optimized=False),
|
|
('task2', 'task1', 'build'),
|
|
('task3', 'task2', 'image'),
|
|
)
|
|
label_to_taskid = {'task1': 'dep1', 'task2': 'dep2'}
|
|
sub = get_subgraph(graph, graph.graph.named_links_dict(), label_to_taskid)
|
|
task3 = label_to_taskid['task3']
|
|
self.assertEqual(sub.graph.nodes, {task3})
|
|
self.assertEqual(sub.graph.edges, set())
|
|
self.assertEqual(sub.tasks[task3].task_id, task3)
|
|
self.assertEqual(sorted(sub.tasks[task3].task['dependencies']), ['dep2'])
|
|
|
|
def test_get_subgraph_opt_away(self):
|
|
"when a leaf task is optimized away, it is omitted from the graph"
|
|
graph = self.make_graph(
|
|
self.make_task('task1', optimized=False),
|
|
self.make_task('task2', optimized=True),
|
|
('task2', 'task1', 'build'),
|
|
)
|
|
label_to_taskid = {'task2': 'dep2'}
|
|
sub = get_subgraph(graph, graph.graph.named_links_dict(), label_to_taskid)
|
|
task1 = label_to_taskid['task1']
|
|
self.assertEqual(sub.graph.nodes, {task1})
|
|
self.assertEqual(sub.graph.edges, set())
|
|
self.assertEqual(sub.tasks[task1].task_id, task1)
|
|
self.assertEqual(sorted(sub.tasks[task1].task['dependencies']), [])
|
|
|
|
def test_get_subgraph_refs_resolved(self):
|
|
"get_subgraph resolves task references"
|
|
graph = self.make_graph(
|
|
self.make_task('task1', optimized=True, task_id='dep1'),
|
|
self.make_task(
|
|
'task2',
|
|
optimized=False,
|
|
task_def={'payload': {'task-reference': 'http://<build>/<test>'}}
|
|
),
|
|
('task2', 'task1', 'build'),
|
|
('task2', 'task3', 'test'),
|
|
self.make_task('task3', optimized=False),
|
|
)
|
|
label_to_taskid = {'task1': 'dep1'}
|
|
sub = get_subgraph(graph, graph.graph.named_links_dict(), label_to_taskid)
|
|
task2 = label_to_taskid['task2']
|
|
task3 = label_to_taskid['task3']
|
|
self.assertEqual(sub.graph.nodes, {task2, task3})
|
|
self.assertEqual(sub.graph.edges, {(task2, task3, 'test')})
|
|
self.assertEqual(sub.tasks[task2].task_id, task2)
|
|
self.assertEqual(sorted(sub.tasks[task2].task['dependencies']), sorted([task3, 'dep1']))
|
|
self.assertEqual(sub.tasks[task2].task['payload'], 'http://dep1/' + task3)
|
|
self.assertEqual(sub.tasks[task3].task_id, task3)
|
|
|
|
def test_optimize(self):
|
|
"optimize_task_graph annotates and extracts the subgraph from a simple graph"
|
|
input = self.make_graph(
|
|
self.make_task('task1', ['optimize-to-task', 'dep1']),
|
|
self.make_task('task2', ['no-optimize']),
|
|
self.make_task('task3', ['no-optimize']),
|
|
('task2', 'task1', 'build'),
|
|
('task2', 'task3', 'image'),
|
|
)
|
|
opt, label_to_taskid = optimize_task_graph(input, {}, set())
|
|
self.assertEqual(opt.graph, graph.Graph(
|
|
{label_to_taskid['task2'], label_to_taskid['task3']},
|
|
{(label_to_taskid['task2'], label_to_taskid['task3'], 'image')}))
|
|
|
|
|
|
if __name__ == '__main__':
|
|
main()
|