169 lines
5.0 KiB
Python
169 lines
5.0 KiB
Python
# Copyright 2015 Mirantis, Inc.
|
|
#
|
|
# 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.
|
|
|
|
from mock import Mock
|
|
import networkx as nx
|
|
from pytest import fixture
|
|
|
|
from solar.dblayer.model import clear_cache
|
|
from solar.orchestration import graph
|
|
from solar.orchestration.traversal import states
|
|
|
|
|
|
def test_simple_plan_plan_created_and_loaded(simple_plan):
|
|
plan = graph.get_plan(simple_plan.graph['uid'])
|
|
expected_names = {n.name for n in plan.nodes()}
|
|
assert expected_names == {'just_fail', 'echo_stuff'}
|
|
|
|
|
|
def test_reset_all_states(simple_plan):
|
|
for n in simple_plan:
|
|
n.status == states.ERROR.name
|
|
graph.reset(simple_plan)
|
|
|
|
for n in simple_plan:
|
|
assert n.status == states.PENDING.name
|
|
|
|
|
|
def test_reset_only_provided(simple_plan):
|
|
for n in simple_plan.nodes():
|
|
if n.name == 'just_fail':
|
|
n.status = states.ERROR.name
|
|
elif n.name == 'echo_stuff':
|
|
n.status = states.SUCCESS.name
|
|
|
|
graph.reset(simple_plan, [states.ERROR.name])
|
|
|
|
for n in simple_plan.nodes():
|
|
if n.name == 'just_fail':
|
|
assert n.status == states.PENDING.name
|
|
elif n.name == 'echo_stuff':
|
|
assert n.status == states.SUCCESS.name
|
|
|
|
|
|
def test_wait_finish(simple_plan):
|
|
for n in simple_plan:
|
|
n.status = states.SUCCESS.name
|
|
n.save()
|
|
assert next(graph.wait_finish(simple_plan.graph['uid'], 10)) == {
|
|
'SKIPPED': 0,
|
|
'SUCCESS': 2,
|
|
'NOOP': 0,
|
|
'ERROR': 0,
|
|
'INPROGRESS': 0,
|
|
'PENDING': 0,
|
|
'ERROR_RETRY': 0,
|
|
}
|
|
|
|
|
|
def test_several_updates(simple_plan):
|
|
just_fail_task = next(t for t in simple_plan.nodes()
|
|
if t.name == 'just_fail')
|
|
just_fail_task.status = states.ERROR.name
|
|
just_fail_task.save()
|
|
|
|
assert next(graph.wait_finish(simple_plan.graph['uid'], 10)) == {
|
|
'SKIPPED': 0,
|
|
'SUCCESS': 0,
|
|
'NOOP': 0,
|
|
'ERROR': 1,
|
|
'INPROGRESS': 0,
|
|
'PENDING': 1,
|
|
'ERROR_RETRY': 0,
|
|
}
|
|
|
|
echo_task = next(t for t in simple_plan.nodes()
|
|
if t.name == 'echo_stuff')
|
|
echo_task.status = states.ERROR.name
|
|
echo_task.save()
|
|
clear_cache()
|
|
assert next(graph.wait_finish(simple_plan.graph['uid'], 10)) == {
|
|
'SKIPPED': 0,
|
|
'SUCCESS': 0,
|
|
'NOOP': 0,
|
|
'ERROR': 2,
|
|
'INPROGRESS': 0,
|
|
'PENDING': 0,
|
|
'ERROR_RETRY': 0,
|
|
}
|
|
|
|
|
|
@fixture
|
|
def times():
|
|
rst = nx.DiGraph()
|
|
t1 = Mock(name='t1', start_time=1.0, end_time=12.0,
|
|
status='', errmsg='', weight=0)
|
|
t2 = Mock(name='t2', start_time=1.0, end_time=3.0,
|
|
status='', errmsg='', weight=0)
|
|
t3 = Mock(name='t3', start_time=3.0, end_time=7.0,
|
|
status='', errmsg='', weight=0)
|
|
t4 = Mock(name='t4', start_time=7.0, end_time=13.0,
|
|
status='', errmsg='', weight=0)
|
|
t5 = Mock(name='t5', start_time=12.0, end_time=14.0,
|
|
status='', errmsg='', weight=0)
|
|
rst.add_nodes_from([t1, t2, t3, t4, t5])
|
|
rst.add_path([t1, t5])
|
|
rst.add_path([t2, t3, t4])
|
|
return rst
|
|
|
|
|
|
def test_report_progress(times):
|
|
report = graph.report_progress_graph(times)
|
|
assert report['total_time'] == 13.0
|
|
assert report['total_delta'] == 25.0
|
|
assert len(report['tasks']) == 5
|
|
|
|
|
|
def test_assigned_weights_simple_sequence():
|
|
dg = nx.DiGraph()
|
|
t1 = Mock(name='t1', weight=0)
|
|
t2 = Mock(name='t2', weight=0)
|
|
t3 = Mock(name='t3', weight=0)
|
|
dg.add_nodes_from([t1, t2, t3])
|
|
dg.add_path([t1, t2, t3])
|
|
graph.assign_weights_nested(dg)
|
|
assert t1.weight == 2
|
|
assert t2.weight == 1
|
|
assert t3.weight == 0
|
|
|
|
|
|
def test_weights_strictly_decreasing():
|
|
dg = nx.DiGraph()
|
|
tasks = [Mock(name='t%s' % i, weight=0) for i in range(10)]
|
|
dg.add_nodes_from(tasks)
|
|
for i in range(10):
|
|
first, rest = tasks[i], tasks[i + 1:]
|
|
dg.add_edges_from([(first, n) for n in rest])
|
|
graph.assign_weights_nested(dg)
|
|
weights = iter(t.weight for t in tasks)
|
|
previous = next(weights)
|
|
for item in weights:
|
|
assert previous > item
|
|
previous = item
|
|
|
|
|
|
def test_weights_multi_path():
|
|
dg = nx.DiGraph()
|
|
tasks = [Mock(name='t%s' % i, weight=0) for i in range(11)]
|
|
first = tasks[0]
|
|
half = (len(tasks) / 2) + 1
|
|
dg.add_nodes_from(tasks)
|
|
dg.add_path([first] + tasks[1:half])
|
|
dg.add_path([first] + tasks[half:])
|
|
graph.assign_weights_nested(dg)
|
|
assert first.weight == len(tasks) - 1
|
|
# two subtree are equal
|
|
for s1, s2 in zip(tasks[1:half], tasks[half:]):
|
|
assert s1.weight == s2.weight
|