1# Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
2# Copyright (c) 2009 The Hewlett-Packard Development Company
3# All rights reserved.
4#
5# Redistribution and use in source and binary forms, with or without
6# modification, are permitted provided that the following conditions are
7# met: redistributions of source code must retain the above copyright
8# notice, this list of conditions and the following disclaimer;
9# redistributions in binary form must reproduce the above copyright
10# notice, this list of conditions and the following disclaimer in the
11# documentation and/or other materials provided with the distribution;
12# neither the name of the copyright holders nor the names of its
13# contributors may be used to endorse or promote products derived from
14# this software without specific prior written permission.
15#
16# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
28from slicc.symbols.Symbol import Symbol
| 1# Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
2# Copyright (c) 2009 The Hewlett-Packard Development Company
3# All rights reserved.
4#
5# Redistribution and use in source and binary forms, with or without
6# modification, are permitted provided that the following conditions are
7# met: redistributions of source code must retain the above copyright
8# notice, this list of conditions and the following disclaimer;
9# redistributions in binary form must reproduce the above copyright
10# notice, this list of conditions and the following disclaimer in the
11# documentation and/or other materials provided with the distribution;
12# neither the name of the copyright holders nor the names of its
13# contributors may be used to endorse or promote products derived from
14# this software without specific prior written permission.
15#
16# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
28from slicc.symbols.Symbol import Symbol
|
| 29from slicc.symbols.State import WildcardState
|
29
30class Transition(Symbol):
31 def __init__(self, table, machine, state, event, nextState, actions,
32 request_types, location):
33 ident = "%s|%s" % (state, event)
34 super(Transition, self).__init__(table, ident, location)
35
36 self.state = machine.states[state]
37 self.event = machine.events[event]
| 30
31class Transition(Symbol):
32 def __init__(self, table, machine, state, event, nextState, actions,
33 request_types, location):
34 ident = "%s|%s" % (state, event)
35 super(Transition, self).__init__(table, ident, location)
36
37 self.state = machine.states[state]
38 self.event = machine.events[event]
|
38 self.nextState = machine.states[nextState]
| 39 if nextState == '*':
40 # check to make sure there is a getNextState function declared
41 found = False
42 for func in machine.functions:
43 if func.c_ident == 'getNextState':
44 found = True
45 break
46 if found == False:
47 fatal("Machine uses a wildcard transition without getNextState defined")
48 self.nextState = WildcardState(machine.symtab,
49 '*', location)
50 else:
51 self.nextState = machine.states[nextState]
|
39 self.actions = [ machine.actions[a] for a in actions ]
40 self.request_types = [ machine.request_types[s] for s in request_types ]
41 self.resources = {}
42
43 for action in self.actions:
44 for var,value in action.resources.iteritems():
45 num = int(value)
46 if var in self.resources:
47 num += int(value)
48 self.resources[var] = str(num)
49
50 def __repr__(self):
51 return "[Transition: (%r, %r) -> %r, %r]" % \
52 (self.state, self.event, self.nextState, self.actions)
53
54 def getActionShorthands(self):
55 assert self.actions
56
57 return ''.join(a.short for a in self.actions)
58
59__all__ = [ "Transition" ]
| 52 self.actions = [ machine.actions[a] for a in actions ]
53 self.request_types = [ machine.request_types[s] for s in request_types ]
54 self.resources = {}
55
56 for action in self.actions:
57 for var,value in action.resources.iteritems():
58 num = int(value)
59 if var in self.resources:
60 num += int(value)
61 self.resources[var] = str(num)
62
63 def __repr__(self):
64 return "[Transition: (%r, %r) -> %r, %r]" % \
65 (self.state, self.event, self.nextState, self.actions)
66
67 def getActionShorthands(self):
68 assert self.actions
69
70 return ''.join(a.short for a in self.actions)
71
72__all__ = [ "Transition" ]
|