LDCSearch.java

package the.bytecode.club.bytecodeviewer.searching;

import org.objectweb.asm.Type;
import org.objectweb.asm.tree.*;

import javax.swing.*;
import java.awt.*;
import java.util.Iterator;
import java.util.ListIterator;

/***************************************************************************
 * Bytecode Viewer (BCV) - Java & Android Reverse Engineering Suite        *
 * Copyright (C) 2014 Kalen 'Konloch' Kinloch - http://bytecodeviewer.com  *
 *                                                                         *
 * 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 3 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, see <http://www.gnu.org/licenses/>. *
 ***************************************************************************/

/**
 * LDC Searching
 * 
 * @author Konloch
 * @author WaterWolf
 * 
 */

public class LDCSearch implements SearchTypeDetails {

	JTextField searchText = new JTextField("");
	JPanel myPanel = null;

	@Override
	public JPanel getPanel() {
		if (myPanel == null) {
			myPanel = new JPanel(new GridLayout(1, 2));
			myPanel.add(new JLabel("Search String: "));
			myPanel.add(searchText);
		}

		return myPanel;
	}

	@Override
	public void search(final ClassNode node, final SearchResultNotifier srn,
			boolean exact) {
		final Iterator<MethodNode> methods = node.methods.iterator();
		final String srchText = searchText.getText();
		if (srchText.isEmpty())
			return;
		while (methods.hasNext()) {
			final MethodNode method = methods.next();

			final InsnList insnlist = method.instructions;
			final ListIterator<AbstractInsnNode> instructions = insnlist
					.iterator();
			while (instructions.hasNext()) {
				final AbstractInsnNode insnNode = instructions.next();
				if (insnNode instanceof LdcInsnNode) {
					final LdcInsnNode ldcObject = ((LdcInsnNode) insnNode);
					final String ldcString = ldcObject.cst.toString();
					String desc2 = method.desc;
					try {
						desc2 = Type.getType(method.desc).toString();
						if(desc2 == null || desc2.equals("null"))
							desc2 = method.desc;
					} catch(java.lang.ArrayIndexOutOfBoundsException e) {
						
					}
					if ((exact && ldcString.equals(srchText))
							|| (!exact && ldcString.contains(srchText))) {
						srn.notifyOfResult(node.name + "." + method.name
								+ desc2
								+ " -> \"" + ldcString + "\" > "
								+ ldcObject.cst.getClass().getCanonicalName());
					}
				}
			}

		}
		final Iterator<FieldNode> fields = node.fields.iterator();
		while (methods.hasNext()) {
			final FieldNode field = fields.next();
			String desc2 = field.desc;
			try {
				desc2 = Type.getType(field.desc).toString();
				if(desc2 == null || desc2.equals("null"))
					desc2 = field.desc;
			} catch(java.lang.ArrayIndexOutOfBoundsException e) {
				
			}
			if (field.value instanceof String) {
				srn.notifyOfResult(node.name + "." + field.name + desc2
						+ " -> \"" + field.value + "\" > field");
			}
		}

	}
}