case class BinaryExpr[+V <: Var[V]](pc: PC, cTpe: ComputationalType, op: BinaryArithmeticOperator, left: Expr[V], right: Expr[V]) extends Expr[V] with Product with Serializable
- cTpe
The computational type of the result of the binary expression if the expression succeeds.
- Source
- Expr.scala
- Alphabetic
- By Inheritance
- BinaryExpr
- Serializable
- Product
- Equals
- Expr
- ASTNode
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new BinaryExpr(pc: PC, cTpe: ComputationalType, op: BinaryArithmeticOperator, left: Expr[V], right: Expr[V])
- cTpe
The computational type of the result of the binary expression if the expression succeeds.
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def asArrayLength: ArrayLength[V]
- Definition Classes
- Expr
- def asArrayLoad: ArrayLoad[V]
- Definition Classes
- Expr
- final def asBinaryExpr: BinaryExpr.this.type
- Definition Classes
- BinaryExpr → Expr
- def asClassConst: ClassConst
- Definition Classes
- Expr
- def asCompare: Compare[V]
- Definition Classes
- Expr
- def asDoubleConst: DoubleConst
- Definition Classes
- Expr
- def asDynamicConst: DynamicConst
- Definition Classes
- Expr
- def asFieldRead: FieldRead[V]
- Definition Classes
- Expr
- def asFloatConst: FloatConst
- Definition Classes
- Expr
- def asFunctionCall: FunctionCall[V]
- Definition Classes
- Expr
- def asGetField: GetField[V]
- Definition Classes
- Expr
- def asGetStatic: GetStatic
- Definition Classes
- Expr
- def asInstanceFunctionCall: InstanceFunctionCall[V]
- Definition Classes
- Expr
- def asInstanceOf: InstanceOf[V]
- Definition Classes
- Expr
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def asIntConst: IntConst
- Definition Classes
- Expr
- def asInvokedynamicFunctionCall: InvokedynamicFunctionCall[V]
- Definition Classes
- Expr
- def asLongConst: LongConst
- Definition Classes
- Expr
- def asMethodHandleConst: MethodHandleConst
- Definition Classes
- Expr
- def asMethodTypeConst: MethodTypeConst
- Definition Classes
- Expr
- def asNew: New
- Definition Classes
- Expr
- def asNewArray: NewArray[V]
- Definition Classes
- Expr
- def asNonVirtualFunctionCall: NonVirtualFunctionCall[V]
- Definition Classes
- Expr
- def asNullExpr: NullExpr
- Definition Classes
- Expr
- def asParam: Param
- Definition Classes
- Expr
- def asPrefixExpr: PrefixExpr[V]
- Definition Classes
- Expr
- def asPrimitiveTypeCastExpr: PrimitiveTypecastExpr[V]
- Definition Classes
- Expr
- def asStaticFunctionCall: StaticFunctionCall[V]
- Definition Classes
- Expr
- def asStringConst: StringConst
- Definition Classes
- Expr
- def asVar: V
- Definition Classes
- Expr
- def asVirtualFunctionCall: VirtualFunctionCall[V]
- Definition Classes
- Expr
- final def astID: Int
Each type of node is assigned a different
idto make it easily possible to do a switch over all nodes.Each type of node is assigned a different
idto make it easily possible to do a switch over all nodes.- Definition Classes
- BinaryExpr → ASTNode
- val cTpe: ComputationalType
The computational type of the underlying value.
The computational type of the underlying value.
I.e., an approximation of the type of the underlying value. It is the best type information directly available. The precision of the type information depends on the number of pre-/post-processing steps that are done.
- Definition Classes
- BinaryExpr → Expr
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @IntrinsicCandidate()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def forallSubExpressions[W >: V <: Var[W]](p: (Expr[W]) => Boolean): Boolean
Returns
trueif the given predicate evaluates totruefor all direct subexpressions of this expression; if the evaluation should perform a recursive decent then it needs to be done by the predicate!Returns
trueif the given predicate evaluates totruefor all direct subexpressions of this expression; if the evaluation should perform a recursive decent then it needs to be done by the predicate!- Definition Classes
- BinaryExpr → Expr
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- def isArrayLoad: Boolean
- Definition Classes
- Expr
- def isClassConst: Boolean
- Definition Classes
- Expr
- def isCompare: Boolean
- Definition Classes
- Expr
- def isConst: Boolean
- Definition Classes
- Expr
- def isDoubleConst: Boolean
- Definition Classes
- Expr
- def isDynamicConst: Boolean
- Definition Classes
- Expr
- def isFieldRead: Boolean
- Definition Classes
- Expr
- def isFloatConst: Boolean
- Definition Classes
- Expr
- def isFunctionCall: Boolean
- Definition Classes
- Expr
- def isGetField: Boolean
- Definition Classes
- Expr
- def isGetStatic: Boolean
- Definition Classes
- Expr
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isIntConst: Boolean
- Definition Classes
- Expr
- def isLongConst: Boolean
- Definition Classes
- Expr
- def isMethodHandleConst: Boolean
- Definition Classes
- Expr
- def isMethodTypeConst: Boolean
- Definition Classes
- Expr
- def isNew: Boolean
- Definition Classes
- Expr
- def isNewArray: Boolean
- Definition Classes
- Expr
- def isNullExpr: Boolean
- Definition Classes
- Expr
- final def isSideEffectFree: Boolean
trueif the statement/expression is GUARANTEED to have no externally observable effect if it is not executed.trueif the statement/expression is GUARANTEED to have no externally observable effect if it is not executed. Sideeffect free instructions can be removed if the result of the evaluation of the expression/statement is not used. For those instructions, which may result in an exception, it has to be guaranteed that the exception is NEVER thrown. For example, a div instruction is sideeffect free if it is (statically) known that the divisor is always not equal to zero; otherwise, even if the result value is not used, the expression is not (potentially) side effect free. An array load is only side effect free if the array reference is non-null and if the index is valid.- returns
trueif the expression is GUARENTEED to have no side effect other than wasting some CPU cycles if it is not executed.
- Definition Classes
- BinaryExpr → ASTNode
- Note
Deeply nested expressions are not supported; i.e. an expression's sub-expressions have to be Var or Const expressions. Generally, a statements expressions have to to simple expressions too - except of the Assignment statement; in the latter case the right-expression can have references to simple expressions. Hence, in case of Assignment statements the side-effect freenes is determined by the referenced expression; in all other cases the side-effect freeness is determined directly by the statement/expression.
- def isStaticFunctionCall: Boolean
- Definition Classes
- Expr
- def isStringConst: Boolean
- Definition Classes
- Expr
- final def isValueExpression: Boolean
trueif this expression is a Var.trueif this expression is a Var.- Definition Classes
- BinaryExpr → Expr
- final def isVar: Boolean
- Definition Classes
- BinaryExpr → Expr
- def isVirtualFunctionCall: Boolean
- Definition Classes
- Expr
- val left: Expr[V]
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- val op: BinaryArithmeticOperator
- val pc: PC
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- val right: Expr[V]
- final def subExpr(index: Int): Expr[V]
Returns the sub expression with the given index; if the index is wrong the result is undefined!
Returns the sub expression with the given index; if the index is wrong the result is undefined!
- Definition Classes
- BinaryExpr → Expr
- final def subExprCount: Int
The number of sub expression directly referenced by this expression.
The number of sub expression directly referenced by this expression. A unary expression has one sub expression (the operand), a binary expression has two and a method has as many as explicit and implicit (
this) parameters exist.- Definition Classes
- BinaryExpr → Expr
- Note
Transitive dependencies are not counted.
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toCanonicalForm(implicit ev: <:<[V, DUVar[ValueInformation]]): Expr[DUVar[ValueInformation]]
See org.opalj.value.ValueInformation.toCanonicalForm for detail.
See org.opalj.value.ValueInformation.toCanonicalForm for detail.
- Definition Classes
- BinaryExpr → Expr → ASTNode
- def toString(): String
- Definition Classes
- BinaryExpr → AnyRef → Any
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated