main

cpg-core/de.fraunhofer.aisec.cpg.passes/PrevEOGState

PrevEOGState

class PrevEOGState : State<Node, IdentityHashMap<Node, IdentitySet<Node>>>

A state which actually holds a state for all Edges. It maps the node to its BranchingNode-parent and the path through which it is reached.

Constructors

constructor()

Properties

open override val entries: MutableSet<MutableMap.MutableEntry<Node, LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>>>

open override val keys: MutableSet<Node>

open override val size: Int

open override val values: MutableCollection<LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>>

Functions

open override fun clear()

open override fun clone(): Any

open override fun compute(p0: Node, p1: BiFunction<in Node, in LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>?, out LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>?>): LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>?

computeIfAbsent

open override fun computeIfAbsent(p0: Node, p1: Function<in Node, out LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>>): LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>

computeIfPresent

open override fun computeIfPresent(p0: Node, p1: BiFunction<in Node, in LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>, out LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>?>): LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>?

open override fun containsKey(key: Node): Boolean

open override fun containsValue(value: LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>): Boolean

open fun duplicate(): State<Node, IdentityHashMap<Node, IdentitySet<Node>>>

Deep copies this object.

open operator override fun equals(other: Any?): Boolean

open override fun forEach(p0: BiConsumer<in Node, in LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>>)

open operator override fun get(key: Node): LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>?

open override fun getOrDefault(key: Node, defaultValue: LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>): LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>

open override fun hashCode(): Int

open override fun isEmpty(): Boolean

open fun lub(other: State<Node, IdentityHashMap<Node, IdentitySet<Node>>>): Pair<State<Node, IdentityHashMap<Node, IdentitySet<Node>>>, Boolean>

It updates this state by adding all new nodes in other to this and by computing the least upper bound for each entry.

open override fun merge(p0: Node, p1: LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>, p2: BiFunction<in LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>, in LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>, out LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>?>): LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>?

fun SymbolMap.mergeFrom(symbolMap: SymbolMap)

This function merges in all entries from the symbolMap into the current SymbolMap.

open fun needsUpdate(other: State<Node, IdentityHashMap<Node, IdentitySet<Node>>>): Boolean

Checks if an update is necessary, i.e., if other contains nodes which are not present in this and if the lattice element of a node in other "is bigger" than the respective lattice element in this. It does not modify anything.

open fun push(newNode: Node, newLatticeElement: LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>?): Boolean

Adds a new mapping from newNode to (a copy of) newLatticeElement to this object if newNode does not exist in this state yet. If it already exists, it computes the least upper bound of newLatticeElement and the current one for newNode. It returns if the state has changed.

open override fun put(key: Node, value: LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>): LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>?

open override fun putAll(from: Map<out Node, LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>>)

open override fun putIfAbsent(p0: Node, p1: LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>): LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>?

open override fun remove(key: Node): LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>?

open override fun remove(key: Node, value: LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>): Boolean

open override fun replace(p0: Node, p1: LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>): LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>?

open override fun replace(p0: Node, p1: LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>, p2: LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>): Boolean

open override fun replaceAll(p0: BiFunction<in Node, in LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>, out LatticeElement<IdentityHashMap<Node, IdentitySet<Node>>>>)

open override fun toString(): String