ruby: Ruby support for sparse memory
[gem5.git] / src / mem / slicc / symbols / Transition.py
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
28 from slicc.symbols.Symbol import Symbol
29
30 class Transition(Symbol):
31 def __init__(self, table, machine, state, event, nextState, actions,
32 location, pairs):
33 ident = "%s|%s" % (state, event)
34 super(Transition, self).__init__(table, ident, location, pairs)
35
36 self.state = machine.states[state]
37 self.event = machine.events[event]
38 self.nextState = machine.states[nextState]
39 self.actions = [ machine.actions[a] for a in actions ]
40 self.resources = {}
41
42 for action in self.actions:
43 for var,value in action.resources.iteritems():
44 if var.type.ident != "DNUCAStopTable":
45 num = int(value)
46 if var in self.resources:
47 num += int(value)
48 self.resources[var] = str(num)
49 else:
50 self.resources[var] = value
51
52 def __repr__(self):
53 return "[Transition: (%r, %r) -> %r, %r]" % \
54 (self.state, self.event, self.nextState, self.actions)
55
56 def getActionShorthands(self):
57 assert self.actions
58
59 return ''.join(a.short for a in self.actions)
60
61 __all__ = [ "Transition" ]