Packages

case class Param(cTpe: ComputationalType, name: String) extends NoVariableExpr with Product with Serializable

Explicit initialization of a parameter. Parameter statements are only used by the naive representation (TACNaive) where it is necessary to perform an initial initialization of the register values. In case of TACAI, usage of parameters are implicitly encoded using parameter origins (see DUVar).

Source
Expr.scala
Linear Supertypes
Serializable, Product, Equals, NoVariableExpr, ValueExpr[Nothing], Expr[Nothing], ASTNode[Nothing], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Param
  2. Serializable
  3. Product
  4. Equals
  5. NoVariableExpr
  6. ValueExpr
  7. Expr
  8. ASTNode
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new Param(cTpe: ComputationalType, name: String)

Value Members

  1. def asArrayLength: ArrayLength[Nothing]
    Definition Classes
    Expr
  2. def asArrayLoad: ArrayLoad[Nothing]
    Definition Classes
    Expr
  3. def asBinaryExpr: BinaryExpr[Nothing]
    Definition Classes
    Expr
  4. def asClassConst: ClassConst
    Definition Classes
    Expr
  5. def asCompare: Compare[Nothing]
    Definition Classes
    Expr
  6. def asDoubleConst: DoubleConst
    Definition Classes
    Expr
  7. def asDynamicConst: DynamicConst
    Definition Classes
    Expr
  8. def asFieldRead: FieldRead[Nothing]
    Definition Classes
    Expr
  9. def asFloatConst: FloatConst
    Definition Classes
    Expr
  10. def asFunctionCall: FunctionCall[Nothing]
    Definition Classes
    Expr
  11. def asGetField: GetField[Nothing]
    Definition Classes
    Expr
  12. def asGetStatic: GetStatic
    Definition Classes
    Expr
  13. def asInstanceFunctionCall: InstanceFunctionCall[Nothing]
    Definition Classes
    Expr
  14. def asInstanceOf: InstanceOf[Nothing]
    Definition Classes
    Expr
  15. def asIntConst: IntConst
    Definition Classes
    Expr
  16. def asInvokedynamicFunctionCall: InvokedynamicFunctionCall[Nothing]
    Definition Classes
    Expr
  17. def asLongConst: LongConst
    Definition Classes
    Expr
  18. def asMethodHandleConst: MethodHandleConst
    Definition Classes
    Expr
  19. def asMethodTypeConst: MethodTypeConst
    Definition Classes
    Expr
  20. def asNew: New
    Definition Classes
    Expr
  21. def asNewArray: NewArray[Nothing]
    Definition Classes
    Expr
  22. def asNonVirtualFunctionCall: NonVirtualFunctionCall[Nothing]
    Definition Classes
    Expr
  23. def asNullExpr: NullExpr
    Definition Classes
    Expr
  24. final def asParam: Param.this.type
    Definition Classes
    Param → Expr
  25. def asPrefixExpr: PrefixExpr[Nothing]
    Definition Classes
    Expr
  26. def asPrimitiveTypeCastExpr: PrimitiveTypecastExpr[Nothing]
    Definition Classes
    Expr
  27. def asStaticFunctionCall: StaticFunctionCall[Nothing]
    Definition Classes
    Expr
  28. def asStringConst: StringConst
    Definition Classes
    Expr
  29. def asVar: Nothing
    Definition Classes
    Expr
  30. def asVirtualFunctionCall: VirtualFunctionCall[Nothing]
    Definition Classes
    Expr
  31. final def astID: Int

    Each type of node is assigned a different id to make it easily possible to do a switch over all nodes.

    Each type of node is assigned a different id to make it easily possible to do a switch over all nodes.

    Definition Classes
    Param → ASTNode
  32. 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
    Param → Expr
  33. final def forallSubExpressions[W >: Nothing <: Var[W]](p: (Expr[W]) => Boolean): Boolean

    Returns true if the given predicate evaluates to true for all direct subexpressions of this expression; if the evaluation should perform a recursive decent then it needs to be done by the predicate!

    Returns true if the given predicate evaluates to true for 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
    ValueExpr → Expr
  34. def isArrayLoad: Boolean
    Definition Classes
    Expr
  35. def isClassConst: Boolean
    Definition Classes
    Expr
  36. def isCompare: Boolean
    Definition Classes
    Expr
  37. def isConst: Boolean
    Definition Classes
    Expr
  38. def isDoubleConst: Boolean
    Definition Classes
    Expr
  39. def isDynamicConst: Boolean
    Definition Classes
    Expr
  40. def isFieldRead: Boolean
    Definition Classes
    Expr
  41. def isFloatConst: Boolean
    Definition Classes
    Expr
  42. def isFunctionCall: Boolean
    Definition Classes
    Expr
  43. def isGetField: Boolean
    Definition Classes
    Expr
  44. def isGetStatic: Boolean
    Definition Classes
    Expr
  45. def isIntConst: Boolean
    Definition Classes
    Expr
  46. def isLongConst: Boolean
    Definition Classes
    Expr
  47. def isMethodHandleConst: Boolean
    Definition Classes
    Expr
  48. def isMethodTypeConst: Boolean
    Definition Classes
    Expr
  49. def isNew: Boolean
    Definition Classes
    Expr
  50. def isNewArray: Boolean
    Definition Classes
    Expr
  51. def isNullExpr: Boolean
    Definition Classes
    Expr
  52. final def isSideEffectFree: Boolean

    true if the statement/expression is GUARANTEED to have no externally observable effect if it is not executed.

    true if 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

    true if the expression is GUARENTEED to have no side effect other than wasting some CPU cycles if it is not executed.

    Definition Classes
    Param → 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.

  53. def isStaticFunctionCall: Boolean
    Definition Classes
    Expr
  54. def isStringConst: Boolean
    Definition Classes
    Expr
  55. final def isValueExpression: Boolean

    true if this expression is a Var.

    true if this expression is a Var.

    Definition Classes
    ValueExpr → Expr
  56. final def isVar: Boolean
    Definition Classes
    Param → Expr
  57. def isVirtualFunctionCall: Boolean
    Definition Classes
    Expr
  58. val name: String
  59. def productElementNames: Iterator[String]
    Definition Classes
    Product
  60. final def subExpr(index: Int): Expr[Nothing]

    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
    ValueExpr → Expr
  61. 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
    ValueExpr → Expr
    Note

    Transitive dependencies are not counted.

  62. final def toCanonicalForm(implicit ev: <:<[Nothing, DUVar[ValueInformation]]): Expr[DUVar[ValueInformation]]

    See org.opalj.value.ValueInformation.toCanonicalForm for detail.

    See org.opalj.value.ValueInformation.toCanonicalForm for detail.

    Definition Classes
    NoVariableExpr → Expr → ASTNode