1 # Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
2 # Copyright (c) 2009 The Hewlett-Packard Development Company
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.
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.
28 from slicc
.ast
.StatementAST
import StatementAST
29 from slicc
.symbols
import Var
31 class PeekStatementAST(StatementAST
):
32 def __init__(self
, slicc
, queue_name
, type_ast
, pairs
, statements
, method
):
33 super(PeekStatementAST
, self
).__init
__(slicc
, pairs
)
35 self
.queue_name
= queue_name
36 self
.type_ast
= type_ast
37 self
.statements
= statements
41 return "[PeekStatementAST: %r queue_name: %r type: %r %r]" % \
42 (self
.method
, self
.queue_name
, self
.type_ast
, self
.statements
)
44 def generate(self
, code
, return_type
):
45 self
.symtab
.pushFrame()
47 msg_type
= self
.type_ast
.type
49 # Add new local var to symbol table
50 var
= Var(self
.symtab
, "in_msg", self
.location
, msg_type
, "(*in_msg_ptr)",
52 self
.symtab
.newSymbol(var
)
54 # Check the queue type
55 self
.queue_name
.assertType("InPort")
57 # Declare the new "in_msg_ptr" variable
59 qcode
= self
.queue_name
.var
.code
63 const $mtid* in_msg_ptr;
64 in_msg_ptr = dynamic_cast<const $mtid *>(($qcode).${{self.method}}());
65 assert(in_msg_ptr != NULL); // Check the cast result
68 if self
.pairs
.has_key("block_on"):
69 address_field
= self
.pairs
['block_on']
71 if ( (m_is_blocking == true) &&
72 (m_block_map.count(in_msg_ptr->m_$address_field) == 1) ) {
73 if (m_block_map[in_msg_ptr->m_$address_field] != &$qcode) {
80 if self
.pairs
.has_key("wake_up"):
81 address_field
= self
.pairs
['wake_up']
83 if (m_waiting_buffers.count(in_msg_ptr->m_$address_field) > 0) {
84 wakeUpBuffers(in_msg_ptr->m_$address_field);
88 # The other statements
89 self
.statements
.generate(code
, return_type
)
90 self
.symtab
.popFrame()
93 def findResources(self
, resources
):
94 self
.statements
.findResources(resources
)