InterproceduralControlFlowGraph

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. val BRANCH_PROPERTY_KEY: String

   

5. final val EDGE_TYPE: String("EdgeType")

   

6. def addEdge(source: Node, target: Node, typ: String): Edge

   

7. def addEdge(e: Edge): Boolean

   

   Definition Classes

   AlirEdgeAccesses

8. def addEdge(source: Node, target: Node): Edge

   

   Definition Classes

   AlirEdgeAccesses

9. def addEntryNode(en: ICFGEntryNode): Unit

   

10. def addExitNode(en: ICFGExitNode): Unit

    

11. def addICFGCallNode(context: Context): Node

    

12. def addICFGCenterNode(context: Context): Node

    

13. def addICFGEntryNode(context: Context): Node

    

14. def addICFGExitNode(context: Context): Node

    

15. def addICFGNormalNode(context: Context): Node

    

16. def addICFGReturnNode(context: Context): Node

    

17. def addNode(node: Node): Node

    

    Definition Classes

    InterproceduralGraph → AlirEdgeAccesses

18. def addProcessed(jp: Signature, c: Context, nodes: ISet[Node]): MMap[(Signature, Context), ISet[Node]]

    

19. final def asInstanceOf[T0]: T0

    

    Definition Classes

    Any

20. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

21. def collectCfgToBaseGraph[VirtualLabel](calleeProc: JawaMethod, callerContext: Context, isFirst: Boolean = false): ISet[Node]

    

22. def compressByDelNode(n: Node): Unit

    

    (We ASSUME that predecessors ???? and successors of n are within the same method as of n) So, this algorithm is only for an internal node of a method NOT for a method's Entry node or Exit node The algorithm is obvious from the following code

23. def deleteEdge(e: Edge): Boolean

    

    Definition Classes

    InterproceduralGraph

24. def deleteEdge(source: Node, target: Node): Edge

    

    Definition Classes

    InterproceduralGraph

25. def deleteNode(node: Node): Boolean

    

    Definition Classes

    InterproceduralGraph

26. val eIDProvider: EdgeNameProvider[Edge] { def filterLabel(uri: String): String }

    

    Attributes

    protected

    Definition Classes

    InterproceduralGraph

27. def edgeSource(edge: AlirEdge[Node]): Node

    

    Attributes

    protected

    Definition Classes

    AlirSuccPredAccesses

28. def edgeTarget(edge: AlirEdge[Node]): Node

    

    Attributes

    protected

    Definition Classes

    AlirSuccPredAccesses

29. def edges: Iterable[Edge]

    

    Definition Classes

    AlirGraph

30. var entryN: ICFGNode

    

    Attributes

    protected

31. def entryNode(proc: Signature, callerContext: Context): Node

    

32. def entryNode: Node

    

33. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

34. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

35. var exitN: ICFGNode

    

    Attributes

    protected

36. def exitNode: Node

    

37. def extendGraph(calleeSig: Signature, callerContext: Context): Node

    

38. def extendGraphOneWay(calleeSig: Signature, callerContext: Context, typ: String = null): Node

    

39. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

40. def findPath(srcNode: Node, tarNode: Node): IList[Edge]

    

    Definition Classes

    InterproceduralGraph

41. def getCallGraph: CallGraph

    

42. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

43. def getEdges(n1: Node, n2: Node): CSet[Edge]

    

    Definition Classes

    AlirGraph

44. def getICFGCallNode(context: Context): Node

    

45. def getICFGCenterNode(context: Context): Node

    

46. def getICFGEntryNode(context: Context): Node

    

47. def getICFGExitNode(context: Context): Node

    

48. def getICFGNormalNode(context: Context): Node

    

49. def getICFGReturnNode(context: Context): Node

    

50. def getNode(n: Node): Node

    

    Definition Classes

    InterproceduralGraph → AlirGraph

51. def getProcessed: MMap[(Signature, Context), ISet[Node]]

    

52. val graph: DirectedPseudograph[Node, Edge]

    

    Attributes

    protected

    Definition Classes

    InterproceduralGraph → AlirGraph

53. def hasEdge(n1: Node, n2: Node): Boolean

    

    Definition Classes

    AlirGraph

54. def hasNode(n: Node): Boolean

    

    Definition Classes

    AlirGraph

55. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

56. def icfgCallNodeExists(context: Context): Boolean

    

57. def icfgEntryNodeExists(context: Context): Boolean

    

58. def icfgExitNodeExists(context: Context): Boolean

    

59. def icfgICFGCenterNodeExists(context: Context): Boolean

    

60. def icfgNormalNodeExists(context: Context): Boolean

    

61. def icfgReturnNodeExists(context: Context): Boolean

    

62. def isCall(l: LocationDecl): Boolean

    

63. def isEdgeType(e: Edge, typ: String): Boolean

    

64. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

65. def isProcessed(proc: Signature, callerContext: Context): Boolean

    

66. def merge(icfg: InterproceduralControlFlowGraph[Node]): Any

    

67. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

68. def newICFGCallNode(context: Context): ICFGCallNode

    

    Attributes

    protected

69. def newICFGCenterNode(context: Context): ICFGCenterNode

    

    Attributes

    protected

70. def newICFGEntryNode(context: Context): ICFGEntryNode

    

    Attributes

    protected

71. def newICFGExitNode(context: Context): ICFGExitNode

    

    Attributes

    protected

72. def newICFGNormalNode(context: Context): ICFGNormalNode

    

    Attributes

    protected

73. def newICFGReturnNode(context: Context): ICFGReturnNode

    

    Attributes

    protected

74. def nodes: Iterable[Node]

    

    Definition Classes

    AlirGraph

75. final def notify(): Unit

    

    Definition Classes

    AnyRef

76. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

77. def numOfEdges: Int

    

    Definition Classes

    AlirGraph

78. def numOfNodes: Int

    

    Definition Classes

    AlirGraph

79. val pl: MMap[InterproceduralNode, Node]

    

    Attributes

    protected

    Definition Classes

    InterproceduralGraph

80. def pool: MMap[InterproceduralNode, Node]

    

    Definition Classes

    InterproceduralGraph

81. def prePostNodeOrder(n: Node): MMap[Node, (Int, Int)]

    

    Definition Classes

    AlirGraph

82. def predecessor(node: Node, branch: Option[Branch]): Node

    

83. def predecessor(edge: Edge): Node

    

    Definition Classes

    AlirSuccPredAccesses

84. def predecessorEdges(node: Node): CSet[Edge]

    

    Definition Classes

    AlirSuccPredAccesses

85. def predecessors(node: Node): CSet[Node]

    

    Definition Classes

    AlirSuccPredAccesses

86. def reverse: InterproceduralControlFlowGraph[Node]

    

87. def stronglyConnectedSets: Iterable[CSet[Node]]

    

    Definition Classes

    AlirGraph

88. def successor(node: Node, branch: Option[Branch]): Node

    

89. def successor(edge: Edge): Node

    

    Definition Classes

    AlirSuccPredAccesses

90. def successorEdges(node: Node): CSet[Edge]

    

    Definition Classes

    AlirSuccPredAccesses

91. def successors(node: Node): CSet[Node]

    

    Definition Classes

    AlirSuccPredAccesses

92. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

93. def toApiGraph(global: Global): InterproceduralControlFlowGraph[Node]

    

94. def toDot(w: Writer, vlp: VertexNameProvider[Node] = vIDProvider): Unit

    

    Definition Classes

    InterproceduralGraph

95. def toGML(w: Writer, vip: VertexNameProvider[Node] = vIDProvider, vlp: VertexNameProvider[Node] = vLDProvider, eip: EdgeNameProvider[Edge] = eIDProvider, elp: EdgeNameProvider[Edge] = null): Unit

    

    Definition Classes

    InterproceduralGraph

96. def toGraphML(w: Writer, vip: VertexNameProvider[Node] = vIDProvider, vlp: VertexNameProvider[Node] = vLDProvider, eip: EdgeNameProvider[Edge] = eIDProvider, elp: EdgeNameProvider[Edge] = null): Unit

    

    Definition Classes

    InterproceduralGraph

97. def toString(): String

    

    Definition Classes

    InterproceduralControlFlowGraph → AnyRef → Any

98. def useBranch[T](pst: ProcedureSymbolTable)(f: ⇒ T): T

    

99. val vIDProvider: VertexNameProvider[Node] { def filterLabel(uri: String): String }

    

    Attributes

    protected

    Definition Classes

    InterproceduralGraph

100. val vLDProvider: VertexNameProvider[Node] { def filterLabel(uri: String): String }

     

     Attributes

     protected

     Definition Classes

     InterproceduralGraph

101. final def wait(): Unit

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

102. final def wait(arg0: Long, arg1: Int): Unit

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

103. final def wait(arg0: Long): Unit

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )