Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Change DFG to use PropertyEdges #1233

Merged
merged 5 commits into from
Jul 27, 2023
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
81 changes: 59 additions & 22 deletions cpg-core/src/main/kotlin/de/fraunhofer/aisec/cpg/graph/Node.kt
Original file line number Diff line number Diff line change
Expand Up @@ -39,6 +39,7 @@ import de.fraunhofer.aisec.cpg.graph.edge.Properties
import de.fraunhofer.aisec.cpg.graph.edge.PropertyEdge
import de.fraunhofer.aisec.cpg.graph.edge.PropertyEdge.Companion.unwrap
import de.fraunhofer.aisec.cpg.graph.edge.PropertyEdgeDelegate
import de.fraunhofer.aisec.cpg.graph.edge.PropertyEdgeSetDelegate
import de.fraunhofer.aisec.cpg.graph.scopes.GlobalScope
import de.fraunhofer.aisec.cpg.graph.scopes.RecordScope
import de.fraunhofer.aisec.cpg.graph.scopes.Scope
Expand Down Expand Up @@ -187,13 +188,25 @@ open class Node : IVisitable<Node>, Persistable, LanguageProvider, ScopeProvider
this.nextEOGEdges = PropertyEdge.transformIntoOutgoingPropertyEdgeList(value, this)
}

/** Incoming data flow edges */
@Relationship(value = "DFG", direction = Relationship.Direction.INCOMING)
@PopulatedByPass(DFGPass::class, ControlFlowSensitiveDFGPass::class)
var prevDFG: MutableSet<Node> = HashSet()
var prevDFGEdges: MutableList<PropertyEdge<Node>> = mutableListOf()
internal set

/** Virtual property for accessing [prevDFGEdges] without property edges. */
@PopulatedByPass(DFGPass::class, ControlFlowSensitiveDFGPass::class)
@Relationship(value = "DFG")
var nextDFG: MutableSet<Node> = HashSet()
var prevDFG: MutableSet<Node> by PropertyEdgeSetDelegate(Node::prevDFGEdges, false)
oxisto marked this conversation as resolved.
Show resolved Hide resolved

/** Outgoing data flow edges */
@PopulatedByPass(DFGPass::class, ControlFlowSensitiveDFGPass::class)
@Relationship(value = "DFG", direction = Relationship.Direction.OUTGOING)
var nextDFGEdges: MutableList<PropertyEdge<Node>> = mutableListOf()
internal set

/** Virtual property for accessing [nextDFGEdges] without property edges. */
@PopulatedByPass(DFGPass::class, ControlFlowSensitiveDFGPass::class)
var nextDFG: MutableSet<Node> by PropertyEdgeSetDelegate(Node::nextDFGEdges, true)

var typedefs: MutableSet<TypedefDeclaration> = HashSet()

Expand Down Expand Up @@ -244,21 +257,34 @@ open class Node : IVisitable<Node>, Persistable, LanguageProvider, ScopeProvider
nextEOGEdges.clear()
}

fun addNextDFG(next: Node) {
nextDFG.add(next)
next.prevDFG.add(this)
fun addNextDFG(
next: Node,
properties: MutableMap<Properties, Any?> = EnumMap(Properties::class.java)
) {
val edge = PropertyEdge(this, next, properties)
nextDFGEdges.add(edge)
next.prevDFGEdges.add(edge)
}

fun removeNextDFG(next: Node?) {
if (next != null) {
nextDFG.remove(next)
next.prevDFG.remove(this)
val thisRemove =
PropertyEdge.findPropertyEdgesByPredicate(nextDFGEdges) { it.end === next }
nextDFGEdges.removeAll(thisRemove)

val nextRemove =
PropertyEdge.findPropertyEdgesByPredicate(next.prevDFGEdges) { it.start == this }
next.prevDFGEdges.removeAll(nextRemove)
}
}

fun addPrevDFG(prev: Node) {
prevDFG.add(prev)
prev.nextDFG.add(this)
fun addPrevDFG(
prev: Node,
properties: MutableMap<Properties, Any?> = EnumMap(Properties::class.java)
) {
val edge = PropertyEdge(prev, this, properties)
prevDFGEdges.add(edge)
prev.nextDFGEdges.add(edge)
}

fun addPrevCDG(prev: Node) {
Expand All @@ -267,15 +293,22 @@ open class Node : IVisitable<Node>, Persistable, LanguageProvider, ScopeProvider
prev.nextCDGEdges.add(edge)
}

fun addAllPrevDFG(prev: Collection<Node>) {
prevDFG.addAll(prev)
prev.forEach { it.nextDFG.add(this) }
fun addAllPrevDFG(
prev: Collection<Node>,
properties: MutableMap<Properties, Any?> = EnumMap(Properties::class.java)
) {
prev.forEach { addPrevDFG(it, properties.toMutableMap()) }
}

fun removePrevDFG(prev: Node?) {
if (prev != null) {
prevDFG.remove(prev)
prev.nextDFG.remove(this)
val thisRemove =
PropertyEdge.findPropertyEdgesByPredicate(prevDFGEdges) { it.start === prev }
prevDFGEdges.removeAll(thisRemove)

val prevRemove =
PropertyEdge.findPropertyEdgesByPredicate(prev.nextDFGEdges) { it.end === this }
prev.nextDFGEdges.removeAll(prevRemove)
}
}

Expand Down Expand Up @@ -309,15 +342,19 @@ open class Node : IVisitable<Node>, Persistable, LanguageProvider, ScopeProvider
* further children that have no alternative connection paths to the rest of the graph.
*/
fun disconnectFromGraph() {
for (n in nextDFG) {
n.prevDFG.remove(this)
for (n in nextDFGEdges) {
val remove =
PropertyEdge.findPropertyEdgesByPredicate(n.end.prevDFGEdges) { it.start == this }
n.end.prevDFGEdges.removeAll(remove)
}
nextDFG.clear()
nextDFGEdges.clear()

for (n in prevDFG) {
n.nextDFG.remove(this)
for (n in prevDFGEdges) {
val remove =
PropertyEdge.findPropertyEdgesByPredicate(n.start.nextDFGEdges) { it.end == this }
n.start.nextDFGEdges.removeAll(remove)
}
prevDFG.clear()
prevDFGEdges.clear()

for (n in nextEOGEdges) {
val remove =
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -168,7 +168,7 @@ open class PropertyEdge<T : Node> : Persistable {
): MutableList<PropertyEdge<T>> {
val propertyEdges: MutableList<PropertyEdge<T>> = ArrayList()
for (n in nodes) {
var propertyEdge = PropertyEdge(commonRelationshipNode, n)
val propertyEdge = PropertyEdge(commonRelationshipNode, n)
propertyEdge.addProperty(Properties.INDEX, propertyEdges.size)
propertyEdges.add(propertyEdge)
}
Expand Down Expand Up @@ -373,3 +373,23 @@ class PropertyEdgeDelegate<T : Node, S : Node>(
}
}
}

/** Similar to a [PropertyEdgeDelegate], but with a [Set] instead of [List]. */
@Transient
class PropertyEdgeSetDelegate<T : Node, S : Node>(
val edge: KProperty1<S, List<PropertyEdge<T>>>,
val outgoing: Boolean = true
) {
operator fun getValue(thisRef: S, property: KProperty<*>): MutableSet<T> {
return PropertyEdge.unwrap(edge.get(thisRef), outgoing).toMutableSet()
}

operator fun setValue(thisRef: S, property: KProperty<*>, value: MutableSet<T>) {
if (edge is KMutableProperty1) {
edge.setter.call(
thisRef,
PropertyEdge.transformIntoOutgoingPropertyEdgeList(value.toList(), thisRef as Node)
)
}
}
}
Original file line number Diff line number Diff line change
Expand Up @@ -378,10 +378,7 @@ fun applyTemplateInstantiation(
// Template.
for ((declaration) in initializationSignature) {
if (declaration is ParamVariableDeclaration) {
initializationSignature[declaration]?.let {
declaration.addPrevDFG(it)
it.addNextDFG(declaration) // TODO: This should be unnecessary
}
initializationSignature[declaration]?.let { declaration.addPrevDFG(it) }
}
}

Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -293,8 +293,6 @@ class Inference(val start: Node, override val ctx: TranslationContext) :
node
.startInference(ctx)
.inferNonTypeTemplateParameter(inferredNonTypeIdentifier)

paramVariableDeclaration.addPrevDFG(node)
node.addNextDFG(paramVariableDeclaration)
nonTypeCounter++
inferred.addParameter(paramVariableDeclaration)
Expand Down
Loading