Home | History | Annotate | Download | only in visitor
      1 /*
      2  * ProGuard -- shrinking, optimization, obfuscation, and preverification
      3  *             of Java bytecode.
      4  *
      5  * Copyright (c) 2002-2009 Eric Lafortune (eric (at) graphics.cornell.edu)
      6  *
      7  * This program is free software; you can redistribute it and/or modify it
      8  * under the terms of the GNU General Public License as published by the Free
      9  * Software Foundation; either version 2 of the License, or (at your option)
     10  * any later version.
     11  *
     12  * This program is distributed in the hope that it will be useful, but WITHOUT
     13  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
     14  * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
     15  * more details.
     16  *
     17  * You should have received a copy of the GNU General Public License along
     18  * with this program; if not, write to the Free Software Foundation, Inc.,
     19  * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
     20  */
     21 package proguard.classfile.visitor;
     22 
     23 import proguard.classfile.*;
     24 import proguard.classfile.attribute.*;
     25 import proguard.classfile.attribute.visitor.ExceptionInfoVisitor;
     26 
     27 /**
     28  * This ExceptionInfoVisitor counts the number of exceptions that has been visited.
     29  *
     30  * @author Eric Lafortune
     31  */
     32 public class ExceptionCounter implements ExceptionInfoVisitor
     33 {
     34     private int count;
     35 
     36 
     37     /**
     38      * Returns the number of exceptions that has been visited so far.
     39      */
     40     public int getCount()
     41     {
     42         return count;
     43     }
     44 
     45 
     46     // Implementations for ExceptionInfoVisitor.
     47 
     48     public void visitExceptionInfo(Clazz clazz, Method method, CodeAttribute codeAttribute, ExceptionInfo exceptionInfo)
     49     {
     50         count++;
     51     }
     52 }
     53