gt:         StackMapEntry[] vars = table.getStackMap();
context: package org.apache.bcel.classfile;
  
  /* ====================================================================
   * The Apache Software License, Version 1.1
   *
   * Copyright (c) 2001 The Apache Software Foundation.  All rights
   * reserved.
   *
   * Redistribution and use in source and binary forms, with or without
   * modification, are permitted provided that the following conditions
   * are met:
   *
   * 1. Redistributions of source code must retain the above copyright
   *    notice, this list of conditions and the following disclaimer.
   *
   * 2. Redistributions in binary form must reproduce the above copyright
   *    notice, this list of conditions and the following disclaimer in
   *    the documentation and/or other materials provided with the
   *    distribution.
   *
   * 3. The end-user documentation included with the redistribution,
   *    if any, must include the following acknowledgment:
   *       "This product includes software developed by the
   *        Apache Software Foundation (http://www.apache.org/)."
   *    Alternately, this acknowledgment may appear in the software itself,
   *    if and wherever such third-party acknowledgments normally appear.
   *
   * 4. The names "Apache" and "Apache Software Foundation" and
   *    "Apache BCEL" must not be used to endorse or promote products
   *    derived from this software without prior written permission. For
   *    written permission, please contact apache@apache.org.
   *
   * 5. Products derived from this software may not be called "Apache",
   *    "Apache BCEL", nor may "Apache" appear in their name, without
   *    prior written permission of the Apache Software Foundation.
   *
   * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
   * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
   * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
   * DISCLAIMED.  IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
   * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
   * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
   * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
   * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
   * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
   * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
   * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
   * SUCH DAMAGE.
   * ====================================================================
   *
   * This software consists of voluntary contributions made by many
   * individuals on behalf of the Apache Software Foundation.  For more
   * information on the Apache Software Foundation, please see
   * <http://www.apache.org/>.
   */
  
  import java.util.Stack;
  
  /**
   * Traverses a JavaClass with another Visitor object 'piggy-backed'
   * that is applied to all components of a JavaClass object. I.e. this
   * class supplies the traversal strategy, other classes can make use
   * of it.
   *
   * @author <A HREF="mailto:markus.dahm@berlin.de">M. Dahm</A>
   * @version $Id: DescendingVisitor.java,v 1.2 2006/08/22 15:33:21 andos Exp $
   */
  public class DescendingVisitor implements Visitor {
      private JavaClass clazz;
      private Visitor visitor;
      private Stack<Object> stack = new Stack<Object>();
  
      /**
       * @return container of current entitity, i.e., predecessor during traversal
       */
      public Object predecessor() {
          return predecessor(0);
      }
  
      /**
       * @param level nesting level, i.e., 0 returns the direct predecessor
       * @return container of current entitity, i.e., predecessor during traversal
       */
      public Object predecessor(int level) {
          int size = stack.size();
  
          if ((size < 2) || (level < 0))
              return null;
          else
              return stack.elementAt(size - (level + 2)); // size - 1 == current
      }
  
      /**
       * @return current object
       */
      public Object current() {
          return stack.peek();
      }
  
      /**
       * @param clazz   Class to traverse
       * @param visitor visitor object to apply to all components
       */
      public DescendingVisitor(JavaClass clazz, Visitor visitor) {
          this.clazz = clazz;
          this.visitor = visitor;
      }
  
      /**
       * Start traversal.
       */
      public void visit() {
          clazz.accept(this);
      }
  
      public void visitJavaClass(JavaClass clazz) {
          stack.push(clazz);
          clazz.accept(visitor);
  
          Field[] fields = clazz.getFields();
          for (Field field : fields) field.accept(this);
  
          Method[] methods = clazz.getMethods();
          for (Method method : methods) method.accept(this);
  
          Attribute[] attributes = clazz.getAttributes();
          for (Attribute attribute : attributes) attribute.accept(this);
  
          clazz.getConstantPool().accept(this);
          stack.pop();
      }
  
      public void visitField(Field field) {
          stack.push(field);
          field.accept(visitor);
  
          Attribute[] attributes = field.getAttributes();
          for (Attribute attribute : attributes) attribute.accept(this);
          stack.pop();
      }
  
      public void visitConstantValue(ConstantValue cv) {
          stack.push(cv);
          cv.accept(visitor);
          stack.pop();
      }
  
      public void visitMethod(Method method) {
          stack.push(method);
          method.accept(visitor);
  
          Attribute[] attributes = method.getAttributes();
          for (Attribute attribute : attributes) attribute.accept(this);
  
          stack.pop();
      }
  
      public void visitExceptionTable(ExceptionTable table) {
          stack.push(table);
          table.accept(visitor);
          stack.pop();
      }
  
      public void visitCode(Code code) {
          stack.push(code);
          code.accept(visitor);
  
          CodeException[] table = code.getExceptionTable();
          for (CodeException aTable : table) aTable.accept(this);
  
          Attribute[] attributes = code.getAttributes();
          for (Attribute attribute : attributes) attribute.accept(this);
          stack.pop();
      }
  
      public void visitCodeException(CodeException ce) {
          stack.push(ce);
          ce.accept(visitor);
          stack.pop();
      }
  
      public void visitLineNumberTable(LineNumberTable table) {
          stack.push(table);
          table.accept(visitor);
  
          LineNumber[] numbers = table.getLineNumberTable();
          for (LineNumber number : numbers) number.accept(this);
          stack.pop();
      }
  
      public void visitLineNumber(LineNumber number) {
          stack.push(number);
          number.accept(visitor);
          stack.pop();
      }
  
      public void visitLocalVariableTable(LocalVariableTable table) {
          stack.push(table);
          table.accept(visitor);
  
          LocalVariable[] vars = table.getLocalVariableTable();
          for (LocalVariable var : vars) var.accept(this);
          stack.pop();
      }
  
      public void visitStackMap(StackMap table) {
          stack.push(table);
          table.accept(visitor);
  
  