2dc03b7333
Reasons are useful for later analysis when running as to why the edge between two nodes was created so when linking items in the graph it would be nice to assign a reason. Change-Id: I2185cf5fb3c2c07c0f5536d3b210080c6f61d5dd
164 lines
6.7 KiB
Python
164 lines
6.7 KiB
Python
# -*- coding: utf-8 -*-
|
|
|
|
# vim: tabstop=4 shiftwidth=4 softtabstop=4
|
|
|
|
# Copyright (C) 2012 Yahoo! Inc. All Rights Reserved.
|
|
#
|
|
# Licensed under the Apache License, Version 2.0 (the "License"); you may
|
|
# not use this file except in compliance with the License. You may obtain
|
|
# a copy of the License at
|
|
#
|
|
# http://www.apache.org/licenses/LICENSE-2.0
|
|
#
|
|
# Unless required by applicable law or agreed to in writing, software
|
|
# distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
|
|
# WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
|
|
# License for the specific language governing permissions and limitations
|
|
# under the License.
|
|
|
|
import collections
|
|
|
|
import taskflow.engines
|
|
|
|
from taskflow import exceptions as exc
|
|
from taskflow.patterns import graph_flow as gw
|
|
from taskflow import states
|
|
from taskflow.utils import flow_utils as fu
|
|
from taskflow.utils import graph_utils as gu
|
|
|
|
from taskflow import test
|
|
from taskflow.tests import utils
|
|
|
|
|
|
class GraphFlowTest(test.TestCase):
|
|
def _make_engine(self, flow):
|
|
return taskflow.engines.load(flow, store={'context': {}})
|
|
|
|
def _capture_states(self):
|
|
# TODO(harlowja): move function to shared helper
|
|
capture_where = collections.defaultdict(list)
|
|
|
|
def do_capture(state, details):
|
|
task_uuid = details.get('task_uuid')
|
|
if not task_uuid:
|
|
return
|
|
capture_where[task_uuid].append(state)
|
|
|
|
return (do_capture, capture_where)
|
|
|
|
def test_ordering(self):
|
|
wf = gw.Flow("the-test-action")
|
|
test_1 = utils.ProvidesRequiresTask('test-1',
|
|
requires=[],
|
|
provides=set(['a', 'b']))
|
|
test_2 = utils.ProvidesRequiresTask('test-2',
|
|
provides=['c'],
|
|
requires=['a', 'b'])
|
|
test_3 = utils.ProvidesRequiresTask('test-3',
|
|
provides=[],
|
|
requires=['c'])
|
|
wf.add(test_1, test_2, test_3)
|
|
self.assertTrue(wf.graph.has_edge(test_1, test_2))
|
|
self.assertTrue(wf.graph.has_edge(test_2, test_3))
|
|
self.assertEquals(3, len(wf.graph))
|
|
self.assertEquals([test_1], list(gu.get_no_predecessors(wf.graph)))
|
|
self.assertEquals([test_3], list(gu.get_no_successors(wf.graph)))
|
|
|
|
def test_invalid_add_simple(self):
|
|
wf = gw.Flow("the-test-action")
|
|
test_1 = utils.ProvidesRequiresTask('test-1',
|
|
requires=['a'],
|
|
provides=set(['a', 'b']))
|
|
self.assertRaises(exc.DependencyFailure, wf.add, test_1)
|
|
self.assertEquals(0, len(wf))
|
|
|
|
def test_invalid_add_loop(self):
|
|
wf = gw.Flow("the-test-action")
|
|
test_1 = utils.ProvidesRequiresTask('test-1',
|
|
requires=['c'],
|
|
provides=set(['a', 'b']))
|
|
test_2 = utils.ProvidesRequiresTask('test-2',
|
|
requires=['a', 'b'],
|
|
provides=set(['c']))
|
|
wf.add(test_1)
|
|
self.assertRaises(exc.DependencyFailure, wf.add, test_2)
|
|
self.assertEquals(1, len(wf))
|
|
|
|
def test_basic_edge_reasons(self):
|
|
wf = gw.Flow("the-test-action")
|
|
test_1 = utils.ProvidesRequiresTask('test-1',
|
|
requires=[],
|
|
provides=set(['a', 'b']))
|
|
test_2 = utils.ProvidesRequiresTask('test-2',
|
|
provides=['c'],
|
|
requires=['a', 'b'])
|
|
wf.add(test_1, test_2)
|
|
self.assertTrue(wf.graph.has_edge(test_1, test_2))
|
|
|
|
edge_attrs = gu.get_edge_attrs(wf.graph, test_1, test_2)
|
|
self.assertTrue(len(edge_attrs) > 0)
|
|
self.assertIn('reasons', edge_attrs)
|
|
self.assertEquals(set(['a', 'b']), edge_attrs['reasons'])
|
|
|
|
# 2 -> 1 should not be linked, and therefore have no attrs
|
|
no_edge_attrs = gu.get_edge_attrs(wf.graph, test_2, test_1)
|
|
self.assertFalse(no_edge_attrs)
|
|
|
|
def test_linked_edge_reasons(self):
|
|
wf = gw.Flow("the-test-action")
|
|
test_1 = utils.ProvidesRequiresTask('test-1',
|
|
requires=[],
|
|
provides=[])
|
|
test_2 = utils.ProvidesRequiresTask('test-2',
|
|
provides=[],
|
|
requires=[])
|
|
wf.add(test_1, test_2)
|
|
self.assertFalse(wf.graph.has_edge(test_1, test_2))
|
|
wf.link(test_1, test_2)
|
|
self.assertTrue(wf.graph.has_edge(test_1, test_2))
|
|
|
|
edge_attrs = gu.get_edge_attrs(wf.graph, test_1, test_2)
|
|
self.assertTrue(len(edge_attrs) > 0)
|
|
self.assertTrue(edge_attrs.get('manual'))
|
|
|
|
def test_flatten_attribute(self):
|
|
wf = gw.Flow("the-test-action")
|
|
test_1 = utils.ProvidesRequiresTask('test-1',
|
|
requires=[],
|
|
provides=[])
|
|
test_2 = utils.ProvidesRequiresTask('test-2',
|
|
provides=[],
|
|
requires=[])
|
|
wf.add(test_1, test_2)
|
|
wf.link(test_1, test_2)
|
|
g = fu.flatten(wf)
|
|
self.assertEquals(2, len(g))
|
|
edge_attrs = gu.get_edge_attrs(g, test_1, test_2)
|
|
self.assertTrue(edge_attrs.get('manual'))
|
|
self.assertTrue(edge_attrs.get('flatten'))
|
|
|
|
def test_graph_run(self):
|
|
wf = gw.Flow("the-test-action")
|
|
test_1 = utils.ProvidesRequiresTask('test-1',
|
|
requires=[],
|
|
provides=[])
|
|
test_2 = utils.ProvidesRequiresTask('test-2',
|
|
provides=[],
|
|
requires=[])
|
|
wf.add(test_1, test_2)
|
|
wf.link(test_1, test_2)
|
|
self.assertEquals(2, len(wf))
|
|
|
|
e = self._make_engine(wf)
|
|
capture_func, captured = self._capture_states()
|
|
e.task_notifier.register('*', capture_func)
|
|
e.run()
|
|
|
|
self.assertEquals(2, len(captured))
|
|
for (_uuid, t_states) in captured.items():
|
|
self.assertEquals([states.RUNNING, states.SUCCESS], t_states)
|
|
|
|
run_context = e.storage.fetch('context')
|
|
ordering = [o['name'] for o in run_context[utils.ORDER_KEY]]
|
|
self.assertEquals(['test-1', 'test-2'], ordering)
|