All Downloads are FREE. Search and download functionalities are using the official Maven repository.

scouter.repack.net.bytebuddy.jar.asm.util.CheckMethodAdapter Maven / Gradle / Ivy

There is a newer version: 2.20.0
Show newest version
/***
 * ASM: a very small and fast Java bytecode manipulation framework
 * Copyright (c) 2000-2011 INRIA, France Telecom
 * 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. Neither the name of the copyright holders nor the names of its
 *    contributors may be used to endorse or promote products derived from
 *    this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS 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 COPYRIGHT OWNER OR 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.
 */
package scouter.repack.net.bytebuddy.jar.asm.util;

import java.io.PrintWriter;
import java.io.StringWriter;
import java.lang.reflect.Field;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;

import scouter.repack.net.bytebuddy.jar.asm.AnnotationVisitor;
import scouter.repack.net.bytebuddy.jar.asm.Attribute;
import scouter.repack.net.bytebuddy.jar.asm.Handle;
import scouter.repack.net.bytebuddy.jar.asm.Label;
import scouter.repack.net.bytebuddy.jar.asm.MethodVisitor;
import scouter.repack.net.bytebuddy.jar.asm.Opcodes;
import scouter.repack.net.bytebuddy.jar.asm.Type;
import scouter.repack.net.bytebuddy.jar.asm.TypePath;
import scouter.repack.net.bytebuddy.jar.asm.TypeReference;
import scouter.repack.net.bytebuddy.jar.asm.tree.MethodNode;
import scouter.repack.net.bytebuddy.jar.asm.tree.analysis.Analyzer;
import scouter.repack.net.bytebuddy.jar.asm.tree.analysis.BasicValue;
import scouter.repack.net.bytebuddy.jar.asm.tree.analysis.BasicVerifier;

/**
 * A {@link MethodVisitor} that checks that its methods are properly used. More
 * precisely this method adapter checks each instruction individually, i.e.,
 * each visit method checks some preconditions based only on its
 * arguments - such as the fact that the given opcode is correct for a given
 * visit method. This adapter can also perform some basic data flow checks (more
 * precisely those that can be performed without the full class hierarchy - see
 * {@link scouter.repack.net.bytebuddy.jar.asm.tree.analysis.BasicVerifier}). For instance in a
 * method whose signature is void m (), the invalid instruction
 * IRETURN, or the invalid sequence IADD L2I will be detected if the data flow
 * checks are enabled. These checks are enabled by using the
 * {@link #CheckMethodAdapter(int,String,String,MethodVisitor,Map)} constructor.
 * They are not performed if any other constructor is used.
 * 
 * @author Eric Bruneton
 */
public class CheckMethodAdapter extends MethodVisitor {

    /**
     * The class version number.
     */
    public int version;

    /**
     * The access flags of the method.
     */
    private int access;

    /**
     * true if the visitCode method has been called.
     */
    private boolean startCode;

    /**
     * true if the visitMaxs method has been called.
     */
    private boolean endCode;

    /**
     * true if the visitEnd method has been called.
     */
    private boolean endMethod;

    /**
     * Number of visited instructions.
     */
    private int insnCount;

    /**
     * The already visited labels. This map associate Integer values to pseudo
     * code offsets.
     */
    private final Map labels;

    /**
     * The labels used in this method. Every used label must be visited with
     * visitLabel before the end of the method (i.e. should be in #labels).
     */
    private Set




© 2015 - 2024 Weber Informatics LLC | Privacy Policy