PageRenderTime 40ms CodeModel.GetById 16ms RepoModel.GetById 1ms app.codeStats 0ms

/jEdit/tags/jedit-4-5-pre1/org/gjt/sp/jedit/bsh/BSHBlock.java

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