| /* |
| * ProGuard -- shrinking, optimization, obfuscation, and preverification |
| * of Java bytecode. |
| * |
| * Copyright (c) 2002-2014 Eric Lafortune (eric@graphics.cornell.edu) |
| * |
| * This program is free software; you can redistribute it and/or modify it |
| * under the terms of the GNU General Public License as published by the Free |
| * Software Foundation; either version 2 of the License, or (at your option) |
| * any later version. |
| * |
| * This program is distributed in the hope that it will be useful, but WITHOUT |
| * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for |
| * more details. |
| * |
| * You should have received a copy of the GNU General Public License along |
| * with this program; if not, write to the Free Software Foundation, Inc., |
| * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
| */ |
| package proguard.classfile.visitor; |
| |
| import proguard.classfile.ClassPool; |
| |
| |
| /** |
| * This ClassPoolVisitor delegates all visits to each ClassPoolVisitor |
| * in a given list. |
| * |
| * @author Eric Lafortune |
| */ |
| public class MultiClassPoolVisitor implements ClassPoolVisitor |
| { |
| private static final int ARRAY_SIZE_INCREMENT = 5; |
| |
| private ClassPoolVisitor[] classPoolVisitors; |
| private int classPoolVisitorCount; |
| |
| |
| public MultiClassPoolVisitor() |
| { |
| } |
| |
| |
| public MultiClassPoolVisitor(ClassPoolVisitor[] classPoolVisitors) |
| { |
| this.classPoolVisitors = classPoolVisitors; |
| this.classPoolVisitorCount = classPoolVisitors.length; |
| } |
| |
| |
| public void addClassPoolVisitor(ClassPoolVisitor classPoolVisitor) |
| { |
| ensureArraySize(); |
| |
| classPoolVisitors[classPoolVisitorCount++] = classPoolVisitor; |
| } |
| |
| |
| private void ensureArraySize() |
| { |
| if (classPoolVisitors == null) |
| { |
| classPoolVisitors = new ClassPoolVisitor[ARRAY_SIZE_INCREMENT]; |
| } |
| else if (classPoolVisitors.length == classPoolVisitorCount) |
| { |
| ClassPoolVisitor[] newClassPoolVisitors = |
| new ClassPoolVisitor[classPoolVisitorCount + |
| ARRAY_SIZE_INCREMENT]; |
| System.arraycopy(classPoolVisitors, 0, |
| newClassPoolVisitors, 0, |
| classPoolVisitorCount); |
| classPoolVisitors = newClassPoolVisitors; |
| } |
| } |
| |
| |
| // Implementations for ClassPoolVisitor. |
| |
| public void visitClassPool(ClassPool classPool) |
| { |
| for (int index = 0; index < classPoolVisitorCount; index++) |
| { |
| classPoolVisitors[index].visitClassPool(classPool); |
| } |
| } |
| } |