Implement CustomPathStateProblem support for all languages

Co-authored-by: MichaelRFairhurst <1627771+MichaelRFairhurst@users.noreply.github.com>

Author: Copilot

cpp/src/qtil/cpp/graph/CustomPathStateProblem.qll

@@ -0,0 +1,5 @@
+private import qtil.locations.CustomPathStateProblem
+private import qtil.cpp.locations.Locatable
+private import cpp
+// Import the C++ specific configuration for making custom path state problems.
+import PathStateProblem<Location, CppLocatableConfig>

cpp/test/qtil/cpp/graph/CustomPathStateProblemTest.expected

@@ -0,0 +1,3 @@
+edges
+nodes
+#select

cpp/test/qtil/cpp/graph/CustomPathStateProblemTest.ql

@@ -0,0 +1,30 @@
+// Minimal test to make sure CustomPathStateProblem works with C++ code.
+import cpp
+import qtil.cpp.graph.CustomPathStateProblem
+
+module CallGraphPathStateProblemConfig implements CustomPathStateProblemConfigSig {
+  class Node = Variable;
+  
+  class State = int; // Track search depth
+
+  predicate start(Node n, int depth) { n.getName() = "start" and depth = 0 }
+
+  bindingset[depth]
+  predicate end(Node n, int depth) { n.getName() = "end" }
+
+  bindingset[depth1]
+  bindingset[depth2]  
+  predicate edge(Variable a, int depth1, Variable b, int depth2) {
+    depth2 = depth1 + 1 and
+    exists(Initializer initA |
+      a.getInitializer() = initA and
+      initA.getExpr().(VariableAccess).getTarget() = b
+    )
+  }
+}
+
+import CustomPathStateProblem<CallGraphPathStateProblemConfig>
+
+from Variable start, Variable end
+where problem(start, end)
+select start, end, "Path from $@ to $@.", start.getName(), start, end.getName(), end

csharp/src/qtil/csharp/graph/CustomPathStateProblem.qll

@@ -0,0 +1,5 @@
+private import qtil.locations.CustomPathStateProblem
+private import qtil.csharp.locations.Locatable
+private import csharp
+// Import the C# specific configuration for making custom path state problems.
+import PathStateProblem<csharp::Location, CsharpLocatableConfig>

csharp/test/qtil/csharp/graph/CustomPathStateProblemTest.expected

@@ -0,0 +1,3 @@
+edges
+nodes
+#select

csharp/test/qtil/csharp/graph/CustomPathStateProblemTest.ql

@@ -0,0 +1,31 @@
+// Minimal test to make sure CustomPathStateProblem works with C# code.
+import csharp
+import qtil.csharp.graph.CustomPathStateProblem
+
+module CallGraphPathStateProblemConfig implements CustomPathStateProblemConfigSig {
+  class Node = LocalVariable;
+  
+  class State = int; // Track search depth
+
+  predicate start(Node n, int depth) { n.getName() = "start" and depth = 0 }
+
+  bindingset[depth]
+  predicate end(Node n, int depth) { n.getName() = "end" }
+
+  bindingset[depth1]
+  bindingset[depth2]  
+  predicate edge(LocalVariable a, int depth1, LocalVariable b, int depth2) {
+    depth2 = depth1 + 1 and
+    exists(LocalVariableDeclExpr declA, LocalVariableDeclExpr declB |
+      declA.getVariable() = a and
+      declB.getVariable() = b and
+      declA.getInitializer().(VariableAccess).getTarget() = b
+    )
+  }
+}
+
+import CustomPathStateProblem<CallGraphPathStateProblemConfig>
+
+from LocalVariable start, LocalVariable end
+where problem(start, end)
+select start, end, "Path from $@ to $@.", start.getName(), start, end.getName(), end

go/src/qtil/go/graph/CustomPathStateProblem.qll

@@ -0,0 +1,5 @@
+private import qtil.locations.CustomPathStateProblem
+private import qtil.go.locations.Locatable
+private import go
+// Import the Go specific configuration for making custom path state problems.
+import PathStateProblem<go::DbLocation, GoLocatableConfig>

go/test/qtil/go/graph/CustomPathStateProblemTest.expected

@@ -0,0 +1,3 @@
+edges
+nodes
+#select

go/test/qtil/go/graph/CustomPathStateProblemTest.ql

@@ -0,0 +1,31 @@
+// Minimal test to make sure CustomPathStateProblem works with Go code.
+import go
+import qtil.go.graph.CustomPathStateProblem
+
+module CallGraphPathStateProblemConfig implements CustomPathStateProblemConfigSig {
+  class Node = Variable;
+  
+  class State = int; // Track search depth
+
+  predicate start(Node n, int depth) { n.getName() = "start" and depth = 0 }
+
+  bindingset[depth]
+  predicate end(Node n, int depth) { n.getName() = "end" }
+
+  bindingset[depth1]
+  bindingset[depth2]  
+  predicate edge(Variable a, int depth1, Variable b, int depth2) {
+    depth2 = depth1 + 1 and
+    exists(ValueSpec specA, ValueSpec specB |
+      specA.getNameExpr(0).(Ident).getName() = a.getName() and
+      specB.getNameExpr(0).(Ident).getName() = b.getName() and
+      specA.getValue(0).(Ident).getName() = b.getName()
+    )
+  }
+}
+
+import CustomPathStateProblem<CallGraphPathStateProblemConfig>
+
+from Variable start, Variable end
+where problem(start, end)
+select start, end, "Path from $@ to $@.", start.getName(), start, end.getName(), end

java/src/qtil/java/graph/CustomPathStateProblem.qll

@@ -0,0 +1,5 @@
+private import qtil.locations.CustomPathStateProblem
+private import qtil.java.locations.Locatable
+private import java
+// Import the Java specific configuration for making custom path state problems.
+import PathStateProblem<Location, JavaLocatableConfig>