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.ClassPool;
     24 
     25 
     26 /**
     27  * This ClassPoolVisitor delegates all visits to each ClassPoolVisitor
     28  * in a given list.
     29  *
     30  * @author Eric Lafortune
     31  */
     32 public class MultiClassPoolVisitor implements ClassPoolVisitor
     33 {
     34     private static final int ARRAY_SIZE_INCREMENT = 5;
     35 
     36     private ClassPoolVisitor[] classPoolVisitors;
     37     private int                classPoolVisitorCount;
     38 
     39 
     40     public MultiClassPoolVisitor()
     41     {
     42     }
     43 
     44 
     45     public MultiClassPoolVisitor(ClassPoolVisitor[] classPoolVisitors)
     46     {
     47         this.classPoolVisitors     = classPoolVisitors;
     48         this.classPoolVisitorCount = classPoolVisitors.length;
     49     }
     50 
     51 
     52     public void addClassPoolVisitor(ClassPoolVisitor classPoolVisitor)
     53     {
     54         ensureArraySize();
     55 
     56         classPoolVisitors[classPoolVisitorCount++] = classPoolVisitor;
     57     }
     58 
     59 
     60     private void ensureArraySize()
     61     {
     62         if (classPoolVisitors == null)
     63         {
     64             classPoolVisitors = new ClassPoolVisitor[ARRAY_SIZE_INCREMENT];
     65         }
     66         else if (classPoolVisitors.length == classPoolVisitorCount)
     67         {
     68             ClassPoolVisitor[] newClassPoolVisitors =
     69                 new ClassPoolVisitor[classPoolVisitorCount +
     70                                      ARRAY_SIZE_INCREMENT];
     71             System.arraycopy(classPoolVisitors, 0,
     72                              newClassPoolVisitors, 0,
     73                              classPoolVisitorCount);
     74             classPoolVisitors = newClassPoolVisitors;
     75         }
     76     }
     77 
     78 
     79     // Implementations for ClassPoolVisitor.
     80 
     81     public void visitClassPool(ClassPool classPool)
     82     {
     83         for (int index = 0; index < classPoolVisitorCount; index++)
     84         {
     85             classPoolVisitors[index].visitClassPool(classPool);
     86         }
     87     }
     88 }
     89