1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
|
/*****************************************************************************
* *
* This file is part of the BeanShell Java Scripting distribution. *
* Documentation and updates may be found at http://www.beanshell.org/ *
* *
* Sun Public License Notice: *
* *
* The contents of this file are subject to the Sun Public License Version *
* 1.0 (the "License"); you may not use this file except in compliance with *
* the License. A copy of the License is available at http://www.sun.com *
* *
* The Original Code is BeanShell. The Initial Developer of the Original *
* Code is Pat Niemeyer. Portions created by Pat Niemeyer are Copyright *
* (C) 2000. All Rights Reserved. *
* *
* GNU Public License Notice: *
* *
* Alternatively, the contents of this file may be used under the terms of *
* the GNU Lesser General Public License (the "LGPL"), in which case the *
* provisions of LGPL are applicable instead of those above. If you wish to *
* allow use of your version of this file only under the terms of the LGPL *
* and not to allow others to use your version of this file under the SPL, *
* indicate your decision by deleting the provisions above and replace *
* them with the notice and other provisions required by the LGPL. If you *
* do not delete the provisions above, a recipient may use your version of *
* this file under either the SPL or the LGPL. *
* *
* Patrick Niemeyer (pat@pat.net) *
* Author of Learning Java, O'Reilly & Associates *
* http://www.pat.net/~pat/ *
* *
*****************************************************************************/
package bsh;
class BSHBlock extends SimpleNode
{
public boolean isSynchronized = false;
BSHBlock(int id) { super(id); }
public Object eval( CallStack callstack, Interpreter interpreter)
throws EvalError
{
return eval( callstack, interpreter, false );
}
/**
@param overrideNamespace if set to true the block will be executed
in the current namespace (not a subordinate one).
<p>
If true *no* new BlockNamespace will be swapped onto the stack and
the eval will happen in the current
top namespace. This is used by BshMethod, TryStatement, etc.
which must intialize the block first and also for those that perform
multiple passes in the same block.
*/
public Object eval(
CallStack callstack, Interpreter interpreter,
boolean overrideNamespace )
throws EvalError
{
Object syncValue = null;
if ( isSynchronized )
{
// First node is the expression on which to sync
SimpleNode exp = ((SimpleNode)jjtGetChild(0));
syncValue = exp.eval(callstack, interpreter);
}
Object ret;
if ( isSynchronized ) // Do the actual synchronization
synchronized( syncValue )
{
ret = evalBlock(
callstack, interpreter, overrideNamespace, null/*filter*/);
}
else
ret = evalBlock(
callstack, interpreter, overrideNamespace, null/*filter*/ );
return ret;
}
Object evalBlock(
CallStack callstack, Interpreter interpreter,
boolean overrideNamespace, NodeFilter nodeFilter )
throws EvalError
{
Object ret = Primitive.VOID;
NameSpace enclosingNameSpace = null;
if ( !overrideNamespace )
{
enclosingNameSpace= callstack.top();
BlockNameSpace bodyNameSpace =
new BlockNameSpace( enclosingNameSpace );
callstack.swap( bodyNameSpace );
}
int startChild = isSynchronized ? 1 : 0;
int numChildren = jjtGetNumChildren();
try {
/*
Evaluate block in two passes:
First do class declarations then do everything else.
*/
for(int i=startChild; i<numChildren; i++)
{
SimpleNode node = ((SimpleNode)jjtGetChild(i));
if ( nodeFilter != null && !nodeFilter.isVisible( node ) )
continue;
if ( node instanceof BSHClassDeclaration )
node.eval( callstack, interpreter );
}
for(int i=startChild; i<numChildren; i++)
{
SimpleNode node = ((SimpleNode)jjtGetChild(i));
if ( node instanceof BSHClassDeclaration )
continue;
// filter nodes
if ( nodeFilter != null && !nodeFilter.isVisible( node ) )
continue;
ret = node.eval( callstack, interpreter );
// statement or embedded block evaluated a return statement
if ( ret instanceof ReturnControl )
break;
}
} finally {
// make sure we put the namespace back when we leave.
if ( !overrideNamespace )
callstack.swap( enclosingNameSpace );
}
return ret;
}
public interface NodeFilter {
public boolean isVisible( SimpleNode node );
}
}
|
