forked from mirrors/gecko-dev
d46264d259
Note that the to_json method prefers the taskgraph's dependencies information (edges) to that from the task.dependencies entries. At a few points in task-graph generation, these values differ, although that is expected (for example, the full task set contains no edges, but that information is still in task.dependencies). Unifying that representation leads to some difficulty with task transforms that reach into the dependency tree (beetmover), so the different representations are left as-is. MozReview-Commit-ID: GeW8HNwFA9Z --HG-- extra : rebase_source : 549773e05e18371a399612d9bceccffc29be8cf2
78 lines
2.5 KiB
Python
78 lines
2.5 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 ..graph import Graph
|
|
from ..task.base import Task
|
|
from ..taskgraph import TaskGraph
|
|
from mozunit import main
|
|
|
|
|
|
class TestTaskGraph(unittest.TestCase):
|
|
|
|
maxDiff = None
|
|
|
|
def test_taskgraph_to_json(self):
|
|
tasks = {
|
|
'a': Task(kind='test', label='a',
|
|
attributes={'attr': 'a-task'},
|
|
task={'taskdef': True}),
|
|
'b': Task(kind='test', label='b',
|
|
attributes={},
|
|
task={'task': 'def'},
|
|
optimizations=[['seta']],
|
|
# note that this dep is ignored, superseded by that
|
|
# from the taskgraph's edges
|
|
dependencies={'first': 'a'}),
|
|
}
|
|
graph = Graph(nodes=set('ab'), edges={('a', 'b', 'edgelabel')})
|
|
taskgraph = TaskGraph(tasks, graph)
|
|
|
|
res = taskgraph.to_json()
|
|
|
|
self.assertEqual(res, {
|
|
'a': {
|
|
'kind': 'test',
|
|
'label': 'a',
|
|
'attributes': {'attr': 'a-task', 'kind': 'test'},
|
|
'task': {'taskdef': True},
|
|
'dependencies': {'edgelabel': 'b'},
|
|
'optimizations': [],
|
|
},
|
|
'b': {
|
|
'kind': 'test',
|
|
'label': 'b',
|
|
'attributes': {'kind': 'test'},
|
|
'task': {'task': 'def'},
|
|
'dependencies': {},
|
|
'optimizations': [['seta']],
|
|
}
|
|
})
|
|
|
|
def test_round_trip(self):
|
|
graph = TaskGraph(tasks={
|
|
'a': Task(
|
|
kind='fancy',
|
|
label='a',
|
|
attributes={},
|
|
dependencies={'prereq': 'b'}, # must match edges, below
|
|
optimizations=[['seta']],
|
|
task={'task': 'def'}),
|
|
'b': Task(
|
|
kind='pre',
|
|
label='b',
|
|
attributes={},
|
|
dependencies={},
|
|
optimizations=[['seta']],
|
|
task={'task': 'def2'}),
|
|
}, graph=Graph(nodes={'a', 'b'}, edges={('a', 'b', 'prereq')}))
|
|
|
|
tasks, new_graph = TaskGraph.from_json(graph.to_json())
|
|
self.assertEqual(graph, new_graph)
|
|
|
|
if __name__ == '__main__':
|
|
main()
|