-
Notifications
You must be signed in to change notification settings - Fork 62
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
7 changed files
with
114 additions
and
87 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
93 changes: 93 additions & 0 deletions
93
cpg-core/src/main/kotlin/de/fraunhofer/aisec/cpg/passes/MagicFixItPass.kt
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,93 @@ | ||
| /* | ||
| * Copyright (c) 2023, Fraunhofer AISEC. All rights reserved. | ||
| * | ||
| * Licensed under the Apache License, Version 2.0 (the "License"); | ||
| * you may not use this file except in compliance with the License. | ||
| * You may obtain a copy of the License at | ||
| * | ||
| * http://www.apache.org/licenses/LICENSE-2.0 | ||
| * | ||
| * Unless required by applicable law or agreed to in writing, software | ||
| * distributed under the License is distributed on an "AS IS" BASIS, | ||
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
| * See the License for the specific language governing permissions and | ||
| * limitations under the License. | ||
| * | ||
| * $$$$$$\ $$$$$$$\ $$$$$$\ | ||
| * $$ __$$\ $$ __$$\ $$ __$$\ | ||
| * $$ / \__|$$ | $$ |$$ / \__| | ||
| * $$ | $$$$$$$ |$$ |$$$$\ | ||
| * $$ | $$ ____/ $$ |\_$$ | | ||
| * $$ | $$\ $$ | $$ | $$ | | ||
| * \$$$$$ |$$ | \$$$$$ | | ||
| * \______/ \__| \______/ | ||
| * | ||
| */ | ||
| package de.fraunhofer.aisec.cpg.passes | ||
|
|
||
| import de.fraunhofer.aisec.cpg.TranslationContext | ||
| import de.fraunhofer.aisec.cpg.graph.Component | ||
| import de.fraunhofer.aisec.cpg.graph.Node | ||
| import de.fraunhofer.aisec.cpg.graph.declarations.RecordDeclaration | ||
| import de.fraunhofer.aisec.cpg.graph.declarations.VariableDeclaration | ||
| import de.fraunhofer.aisec.cpg.graph.newConstructExpression | ||
| import de.fraunhofer.aisec.cpg.graph.statements.expressions.CallExpression | ||
| import de.fraunhofer.aisec.cpg.graph.statements.expressions.ConstructExpression | ||
| import de.fraunhofer.aisec.cpg.graph.types.recordDeclaration | ||
| import de.fraunhofer.aisec.cpg.helpers.SubgraphWalker | ||
| import de.fraunhofer.aisec.cpg.passes.order.ExecuteBefore | ||
|
|
||
| /** | ||
| * This [Pass] is magic. I think it's mostly used by C++, so we could make it specific. However, it | ||
| * also does certain things that the Go Extra Pass also does, so we could merge some aspects of it. | ||
| */ | ||
| @ExecuteBefore(EvaluationOrderGraphPass::class) | ||
| class MagicFixItPass(ctx: TranslationContext) : ComponentPass(ctx) { | ||
| override fun accept(component: Component) { | ||
| val walker = SubgraphWalker.ScopedWalker(ctx.scopeManager) | ||
|
|
||
| walker.registerHandler(::fixInitializers) | ||
| for (tu in component.translationUnits) { | ||
| walker.iterate(tu) | ||
| } | ||
| } | ||
|
|
||
| protected fun fixInitializers(node: Node?, currClass: RecordDeclaration?) { | ||
| if (node is VariableDeclaration) { | ||
| // check if we have the corresponding class for this type | ||
| val record = node.type.root.recordDeclaration | ||
| val typeString = node.type.root.name | ||
| if (record != null) { | ||
| val currInitializer = node.initializer | ||
| if (currInitializer == null && node.isImplicitInitializerAllowed) { | ||
| val initializer = node.newConstructExpression(typeString, "$typeString()") | ||
| initializer.type = node.type | ||
| initializer.isImplicit = true | ||
| node.initializer = initializer | ||
| node.templateParameters?.let { | ||
| SymbolResolver.addImplicitTemplateParametersToCall(it, initializer) | ||
| } | ||
| } else if ( | ||
| currInitializer !is ConstructExpression && | ||
| currInitializer is CallExpression && | ||
| currInitializer.name.localName == node.type.root.name.localName | ||
| ) { | ||
| // This should actually be a construct expression, not a call! | ||
| val arguments = currInitializer.arguments | ||
| val signature = arguments.map(Node::code).joinToString(", ") | ||
| val initializer = | ||
| node.newConstructExpression(typeString, "$typeString($signature)") | ||
| initializer.type = node.type | ||
| initializer.arguments = mutableListOf(*arguments.toTypedArray()) | ||
| initializer.isImplicit = true | ||
| node.initializer = initializer | ||
| currInitializer.disconnectFromGraph() | ||
| } | ||
| } | ||
| } | ||
| } | ||
|
|
||
| override fun cleanup() { | ||
| // Nothing to do | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters