@eagleoutice/flowr 2.8.10 → 2.8.11

package/README.md

@@ -24,7 +24,7 @@ It offers a wide variety of features, for example:
     
     ```shell
     $ docker run -it --rm eagleoutice/flowr # or npm run flowr 
-    flowR repl using flowR v2.8.9, R grammar v14 (tree-sitter engine)
+    flowR repl using flowR v2.8.10, R grammar v14 (tree-sitter engine)
     R> :query @linter "read.csv(\"/root/x.txt\")"
     ```
     
@@ -51,9 +51,9 @@ It offers a wide variety of features, for example:
        ╰ Naming Convention (naming-convention):
            ╰ Metadata: numMatches: 0, numBreak: 0, searchTimeMs: 0, processTimeMs: 0
        ╰ Network Functions (network-functions):
-           ╰ Metadata: totalCalls: 0, totalFunctionDefinitions: 0, searchTimeMs: 1, processTimeMs: 0
+           ╰ Metadata: totalCalls: 0, totalFunctionDefinitions: 0, searchTimeMs: 0, processTimeMs: 0
        ╰ Dataframe Access Validation (dataframe-access-validation):
-           ╰ Metadata: numOperations: 0, numAccesses: 0, totalAccessed: 0, searchTimeMs: 0, processTimeMs: 0
+           ╰ Metadata: numOperations: 0, numAccesses: 0, totalAccessed: 0, searchTimeMs: 0, processTimeMs: 1
        ╰ Dead Code (dead-code):
            ╰ Metadata: consideredNodes: 5, searchTimeMs: 0, processTimeMs: 0
        ╰ Useless Loops (useless-loop):
@@ -92,13 +92,13 @@ It offers a wide variety of features, for example:
        ╰ **Absolute Paths** (absolute-file-paths):\
            ╰ certain:\
                ╰ Path `/root/x.txt` at 1.1-23\
-    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>totalConsidered: 1, totalUnknown: 0, searchTimeMs: 1, processTimeMs: 0</code>\
+    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>totalConsidered: 1, totalUnknown: 0, searchTimeMs: 0, processTimeMs: 0</code>\
     &nbsp;&nbsp;&nbsp;╰ **Unused Definitions** (unused-definitions):\
     &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>totalConsidered: 0, searchTimeMs: 0, processTimeMs: 0</code>\
     &nbsp;&nbsp;&nbsp;╰ **Naming Convention** (naming-convention):\
     &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>numMatches: 0, numBreak: 0, searchTimeMs: 0, processTimeMs: 0</code>\
     &nbsp;&nbsp;&nbsp;╰ **Network Functions** (network-functions):\
-    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>totalCalls: 0, totalFunctionDefinitions: 0, searchTimeMs: 0, processTimeMs: 0</code>\
+    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>totalCalls: 0, totalFunctionDefinitions: 0, searchTimeMs: 1, processTimeMs: 0</code>\
     &nbsp;&nbsp;&nbsp;╰ **Dataframe Access Validation** (dataframe-access-validation):\
     &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>numOperations: 0, numAccesses: 0, totalAccessed: 0, searchTimeMs: 0, processTimeMs: 0</code>\
     &nbsp;&nbsp;&nbsp;╰ **Dead Code** (dead-code):\
@@ -109,7 +109,7 @@ It offers a wide variety of features, for example:
     
     <details> <summary style="color:gray">Show Detailed Results as Json</summary>
     
-    The analysis required _2.2 ms_ (including parsing and normalization and the query) within the generation environment.
+    The analysis required _2.3 ms_ (including parsing and normalization and the query) within the generation environment.
     
     In general, the JSON contains the Ids of the nodes in question as they are present in the normalized AST or the dataflow graph of flowR.
     Please consult the [Interface](https://github.com/flowr-analysis/flowr/wiki/Interface) wiki page for more information on how to get those.
@@ -181,7 +181,7 @@ It offers a wide variety of features, for example:
             ".meta": {
               "totalConsidered": 1,
               "totalUnknown": 0,
-              "searchTimeMs": 1,
+              "searchTimeMs": 0,
               "processTimeMs": 0
             }
           },
@@ -207,7 +207,7 @@ It offers a wide variety of features, for example:
             ".meta": {
               "totalCalls": 0,
               "totalFunctionDefinitions": 0,
-              "searchTimeMs": 0,
+              "searchTimeMs": 1,
               "processTimeMs": 0
             }
           },
@@ -308,7 +308,7 @@ It offers a wide variety of features, for example:
     
     ```shell
     $ docker run -it --rm eagleoutice/flowr # or npm run flowr 
-    flowR repl using flowR v2.8.9, R grammar v14 (tree-sitter engine)
+    flowR repl using flowR v2.8.10, R grammar v14 (tree-sitter engine)
     R> :query @static-slice (11@sum) file://test/testfiles/example.R
     ```
     
@@ -322,7 +322,7 @@ It offers a wide variety of features, for example:
     N <- 10
     for(i in 1:(N-1)) sum <- sum + i + w
     sum
-    All queries together required ≈3 ms (1ms accuracy, total 3 ms)
+    All queries together required ≈3 ms (1ms accuracy, total 4 ms)
     ```
     
     
@@ -356,7 +356,7 @@ It offers a wide variety of features, for example:
          
 
 * 🚀 **fast call-graph, data-, and control-flow graphs**\
-  Within just [<i><span title="This measurement is automatically fetched from the latest benchmark!">117 ms</span></i> (as of Jan 18, 2026)](https://flowr-analysis.github.io/flowr/wiki/stats/benchmark), 
+  Within just [<i><span title="This measurement is automatically fetched from the latest benchmark!">119.8 ms</span></i> (as of Jan 27, 2026)](https://flowr-analysis.github.io/flowr/wiki/stats/benchmark), 
   _flowR_ can analyze the data- and control-flow of the average real-world R script. See the [benchmarks](https://flowr-analysis.github.io/flowr/wiki/stats/benchmark) for more information,
   and consult the [wiki pages](https://github.com/flowr-analysis/flowr/wiki/dataflow-graph) for more details on the dataflow graphs as well as call graphs.
 
@@ -392,7 +392,7 @@ It offers a wide variety of features, for example:
     
     ```shell
     $ docker run -it --rm eagleoutice/flowr # or npm run flowr 
-    flowR repl using flowR v2.8.9, R grammar v14 (tree-sitter engine)
+    flowR repl using flowR v2.8.10, R grammar v14 (tree-sitter engine)
     R> :dataflow* test/testfiles/example.R
     ```
     
@@ -697,7 +697,7 @@ It offers a wide variety of features, for example:
     ```
     
     	
-    (The analysis required _2.0 ms_ (including parse and normalize, using the [tree-sitter](https://github.com/flowr-analysis/flowr/wiki/Engines) engine) within the generation environment.)
+    (The analysis required _4.5 ms_ (including parse and normalize, using the [tree-sitter](https://github.com/flowr-analysis/flowr/wiki/Engines) engine) within the generation environment.)
     
     
     

package/control-flow/cfg-simplification.js

@@ -62,10 +62,8 @@ function toBasicBlocks(cfg, _info) {
  * @param cfg - The control flow graph whose reachable nodes to find.
  */
 function cfgFindAllReachable(cfg) {
-    const reachable = new Set();
-    (0, simple_visitor_1.visitCfgInOrder)(cfg.graph, cfg.entryPoints, node => {
-        reachable.add(node);
+    return (0, simple_visitor_1.visitCfgInOrder)(cfg.graph, cfg.entryPoints, () => {
+        /* do nothing */
     });
-    return reachable;
 }
 //# sourceMappingURL=cfg-simplification.js.map

package/control-flow/invert-cfg.d.ts

@@ -0,0 +1,5 @@
+import { ControlFlowGraph } from './control-flow-graph';
+/**
+ * Inverts the given dataflow graph by reversing all edges.
+ */
+export declare function invertCfg(graph: ControlFlowGraph): ControlFlowGraph;

package/control-flow/invert-cfg.js

@@ -0,0 +1,20 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.invertCfg = invertCfg;
+const control_flow_graph_1 = require("./control-flow-graph");
+/**
+ * Inverts the given dataflow graph by reversing all edges.
+ */
+function invertCfg(graph) {
+    const invertedGraph = new control_flow_graph_1.ControlFlowGraph();
+    for (const [, v] of graph.vertices(true)) {
+        invertedGraph.addVertex(v);
+    }
+    for (const [from, targets] of graph.edges()) {
+        for (const [to, t] of targets) {
+            invertedGraph.addEdge(to, from, t);
+        }
+    }
+    return invertedGraph;
+}
+//# sourceMappingURL=invert-cfg.js.map

package/control-flow/simple-visitor.d.ts

@@ -20,7 +20,7 @@ export declare function visitCfgInReverseOrder(graph: ControlFlowGraph, startNod
  * This function is of type {@link SimpleCfgVisitor}.
  * @see {@link visitCfgInReverseOrder} for a traversal in reversed order
  */
-export declare function visitCfgInOrder(graph: ControlFlowGraph, startNodes: readonly NodeId[], visitor: (node: NodeId) => boolean | void): void;
+export declare function visitCfgInOrder(graph: ControlFlowGraph, startNodes: readonly NodeId[], visitor: (node: NodeId) => boolean | void): Set<NodeId>;
 /**
  * Check if a node can reach another node in the control flow graph.
  */

package/control-flow/simple-visitor.js

@@ -4,6 +4,7 @@ exports.visitCfgInReverseOrder = visitCfgInReverseOrder;
 exports.visitCfgInOrder = visitCfgInOrder;
 exports.canReach = canReach;
 const control_flow_graph_1 = require("./control-flow-graph");
+const invert_cfg_1 = require("./invert-cfg");
 /**
  * Visit all nodes reachable from the start node in the control flow graph, traversing the dependencies but ignoring cycles.
  * @param graph     - The control flow graph.
@@ -55,6 +56,7 @@ visitor) {
     const visited = new Set();
     let queue = startNodes.slice();
     const hasBb = graph.mayHaveBasicBlocks();
+    const g = (0, invert_cfg_1.invertCfg)(graph);
     while (queue.length > 0) {
         const current = queue.shift();
         if (visited.has(current)) {
@@ -65,16 +67,17 @@ visitor) {
             continue;
         }
         else if (hasBb) {
-            const get = graph.getVertex(current);
+            const get = g.getVertex(current);
             if (get?.type === control_flow_graph_1.CfgVertexType.Block) {
                 queue = queue.concat(get.elems.map(e => e.id));
             }
         }
-        const outgoing = graph.ingoingEdges(current) ?? [];
+        const outgoing = g.outgoingEdges(current) ?? [];
         for (const [to] of outgoing) {
             queue.push(to);
         }
     }
+    return visited;
 }
 /**
  * Check if a node can reach another node in the control flow graph.

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@eagleoutice/flowr",
-  "version": "2.8.10",
+  "version": "2.8.11",
   "description": "Static Dataflow Analyzer and Program Slicer for the R Programming Language",
   "types": "dist/src/index.d.ts",
   "repository": {

package/util/version.js

@@ -6,7 +6,7 @@ exports.printVersionInformation = printVersionInformation;
 const semver_1 = require("semver");
 const assert_1 = require("./assert");
 // this is automatically replaced with the current version by release-it
-const version = '2.8.10';
+const version = '2.8.11';
 /**
  * Retrieves the current flowR version as a new {@link SemVer} object.
  */