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

com.oracle.graal.python.nodes.argument.ReadIndexedArgumentNodeGen Maven / Gradle / Ivy

There is a newer version: 24.1.1
Show newest version
// CheckStyle: start generated
package com.oracle.graal.python.nodes.argument;

import com.oracle.truffle.api.CompilerDirectives;
import com.oracle.truffle.api.CompilerDirectives.CompilationFinal;
import com.oracle.truffle.api.dsl.GeneratedBy;
import com.oracle.truffle.api.dsl.NeverDefault;
import com.oracle.truffle.api.frame.VirtualFrame;
import com.oracle.truffle.api.nodes.InvalidAssumptionException;
import com.oracle.truffle.api.nodes.NodeCost;

/**
 * Debug Info: 
 *   Specialization {@link ReadIndexedArgumentNode#readArg}
 *     Activation probability: 0.65000
 *     With/without class size: 11/0 bytes
 *   Specialization {@link ReadIndexedArgumentNode#readArgOffBounds}
 *     Activation probability: 0.35000
 *     With/without class size: 8/0 bytes
 * 
*/ @GeneratedBy(ReadIndexedArgumentNode.class) @SuppressWarnings("javadoc") public final class ReadIndexedArgumentNodeGen extends ReadIndexedArgumentNode { /** * State Info:
     *   0: SpecializationActive {@link ReadIndexedArgumentNode#readArg}
     *   1: SpecializationExcluded {@link ReadIndexedArgumentNode#readArg}
     *   2: SpecializationActive {@link ReadIndexedArgumentNode#readArgOffBounds}
     * 
*/ @CompilationFinal private int state_0_; private ReadIndexedArgumentNodeGen(int index) { super(index); } @Override public Object execute(VirtualFrame frameValue) { int state_0 = this.state_0_; if ((state_0 & 0b101) != 0 /* is SpecializationActive[ReadIndexedArgumentNode.readArg(VirtualFrame)] || SpecializationActive[ReadIndexedArgumentNode.readArgOffBounds(VirtualFrame)] */) { if ((state_0 & 0b1) != 0 /* is SpecializationActive[ReadIndexedArgumentNode.readArg(VirtualFrame)] */) { try { return readArg(frameValue); } catch (InvalidAssumptionException ex) { CompilerDirectives.transferToInterpreterAndInvalidate(); state_0 = this.state_0_; state_0 = state_0 & 0xfffffffe /* remove SpecializationActive[ReadIndexedArgumentNode.readArg(VirtualFrame)] */; state_0 = state_0 | 0b10 /* add SpecializationExcluded */; this.state_0_ = state_0; return executeAndSpecialize(frameValue); } } if ((state_0 & 0b100) != 0 /* is SpecializationActive[ReadIndexedArgumentNode.readArgOffBounds(VirtualFrame)] */) { return readArgOffBounds(frameValue); } } CompilerDirectives.transferToInterpreterAndInvalidate(); return executeAndSpecialize(frameValue); } private Object executeAndSpecialize(VirtualFrame frameValue) { int state_0 = this.state_0_; if (((state_0 & 0b100)) == 0 /* is-not SpecializationActive[ReadIndexedArgumentNode.readArgOffBounds(VirtualFrame)] */ && ((state_0 & 0b10)) == 0 /* is-not SpecializationExcluded */) { state_0 = state_0 | 0b1 /* add SpecializationActive[ReadIndexedArgumentNode.readArg(VirtualFrame)] */; this.state_0_ = state_0; try { return readArg(frameValue); } catch (InvalidAssumptionException ex) { CompilerDirectives.transferToInterpreterAndInvalidate(); state_0 = this.state_0_; state_0 = state_0 & 0xfffffffe /* remove SpecializationActive[ReadIndexedArgumentNode.readArg(VirtualFrame)] */; state_0 = state_0 | 0b10 /* add SpecializationExcluded */; this.state_0_ = state_0; return executeAndSpecialize(frameValue); } } state_0 = state_0 & 0xfffffffe /* remove SpecializationActive[ReadIndexedArgumentNode.readArg(VirtualFrame)] */; state_0 = state_0 | 0b100 /* add SpecializationActive[ReadIndexedArgumentNode.readArgOffBounds(VirtualFrame)] */; this.state_0_ = state_0; return readArgOffBounds(frameValue); } @Override public NodeCost getCost() { int state_0 = this.state_0_; if ((state_0 & 0b101) == 0) { return NodeCost.UNINITIALIZED; } else { if (((state_0 & 0b101) & ((state_0 & 0b101) - 1)) == 0 /* is-single */) { return NodeCost.MONOMORPHIC; } } return NodeCost.POLYMORPHIC; } @NeverDefault public static ReadIndexedArgumentNode create(int index) { return new ReadIndexedArgumentNodeGen(index); } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy