svf-lib 1.0.1291 → 1.0.1293

package/SVF-osx/include/Graphs/GenericGraph.h

@@ -31,6 +31,7 @@
 #define GENERICGRAPH_H_
 
 #include "SVFIR/SVFValue.h"
+#include "Util/iterator.h"
 
 namespace SVF
 {
@@ -452,6 +453,44 @@ public:
 namespace llvm
 {
 
+// mapped_iter - This is a simple iterator adapter that causes a function to
+// be applied whenever operator* is invoked on the iterator.
+
+template <typename ItTy, typename FuncTy,
+          typename FuncReturnTy =
+          decltype(std::declval<FuncTy>()(*std::declval<ItTy>()))>
+class mapped_iter
+    : public iterator_adaptor_base<
+      mapped_iter<ItTy, FuncTy>, ItTy,
+      typename std::iterator_traits<ItTy>::iterator_category,
+      typename std::remove_reference<FuncReturnTy>::type>
+{
+public:
+    mapped_iter(ItTy U, FuncTy F)
+        : mapped_iter::iterator_adaptor_base(std::move(U)), F(std::move(F)) {}
+
+    ItTy getCurrent()
+    {
+        return this->I;
+    }
+
+    FuncReturnTy operator*() const
+    {
+        return F(*this->I);
+    }
+
+private:
+    FuncTy F;
+};
+
+// map_iter - Provide a convenient way to create mapped_iters, just like
+// make_pair is useful for creating pairs...
+template <class ItTy, class FuncTy>
+inline mapped_iter<ItTy, FuncTy> map_iter(ItTy I, FuncTy F)
+{
+    return mapped_iter<ItTy, FuncTy>(std::move(I), std::move(F));
+}
+
 /*!
  * GraphTraits for nodes
  */
@@ -466,7 +505,7 @@ template<class NodeTy,class EdgeTy> struct GraphTraits<SVF::GenericNode<NodeTy,E
     }
 
     // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
-    typedef mapped_iterator<typename SVF::GenericNode<NodeTy,EdgeTy>::iterator, decltype(&edge_dest)> ChildIteratorType;
+    typedef mapped_iter<typename SVF::GenericNode<NodeTy,EdgeTy>::iterator, decltype(&edge_dest)> ChildIteratorType;
 
     static NodeType* getEntryNode(NodeType* pagN)
     {
@@ -475,19 +514,19 @@ template<class NodeTy,class EdgeTy> struct GraphTraits<SVF::GenericNode<NodeTy,E
 
     static inline ChildIteratorType child_begin(const NodeType* N)
     {
-        return map_iterator(N->OutEdgeBegin(), &edge_dest);
+        return map_iter(N->OutEdgeBegin(), &edge_dest);
     }
     static inline ChildIteratorType child_end(const NodeType* N)
     {
-        return map_iterator(N->OutEdgeEnd(), &edge_dest);
+        return map_iter(N->OutEdgeEnd(), &edge_dest);
     }
     static inline ChildIteratorType direct_child_begin(const NodeType *N)
     {
-        return map_iterator(N->directOutEdgeBegin(), &edge_dest);
+        return map_iter(N->directOutEdgeBegin(), &edge_dest);
     }
     static inline ChildIteratorType direct_child_end(const NodeType *N)
     {
-        return map_iterator(N->directOutEdgeEnd(), &edge_dest);
+        return map_iter(N->directOutEdgeEnd(), &edge_dest);
     }
 };
 
@@ -506,7 +545,7 @@ struct GraphTraits<Inverse<SVF::GenericNode<NodeTy,EdgeTy>* > >
     }
 
     // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
-    typedef mapped_iterator<typename SVF::GenericNode<NodeTy,EdgeTy>::iterator, decltype(&edge_dest)> ChildIteratorType;
+    typedef mapped_iter<typename SVF::GenericNode<NodeTy,EdgeTy>::iterator, decltype(&edge_dest)> ChildIteratorType;
 
     static inline NodeType* getEntryNode(Inverse<NodeType* > G)
     {
@@ -515,11 +554,11 @@ struct GraphTraits<Inverse<SVF::GenericNode<NodeTy,EdgeTy>* > >
 
     static inline ChildIteratorType child_begin(const NodeType* N)
     {
-        return map_iterator(N->InEdgeBegin(), &edge_dest);
+        return map_iter(N->InEdgeBegin(), &edge_dest);
     }
     static inline ChildIteratorType child_end(const NodeType* N)
     {
-        return map_iterator(N->InEdgeEnd(), &edge_dest);
+        return map_iter(N->InEdgeEnd(), &edge_dest);
     }
 
     static inline unsigned getNodeID(const NodeType* N)
@@ -549,15 +588,15 @@ template<class NodeTy,class EdgeTy> struct GraphTraits<SVF::GenericGraph<NodeTy,
     }
 
     // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
-    typedef mapped_iterator<typename GenericGraphTy::iterator, decltype(&deref_val)> nodes_iterator;
+    typedef mapped_iter<typename GenericGraphTy::iterator, decltype(&deref_val)> nodes_iterator;
 
     static nodes_iterator nodes_begin(GenericGraphTy *G)
     {
-        return map_iterator(G->begin(), &deref_val);
+        return map_iter(G->begin(), &deref_val);
     }
     static nodes_iterator nodes_end(GenericGraphTy *G)
     {
-        return map_iterator(G->end(), &deref_val);
+        return map_iter(G->end(), &deref_val);
     }
 
     static unsigned graphSize(GenericGraphTy* G)

package/SVF-osx/include/Graphs/GraphPrinter.h

@@ -32,10 +32,8 @@
 #define INCLUDE_GRAPHS_GRAPHPRINTER_H_
 
 #include <system_error>
-#include <llvm/Support/ToolOutputFile.h>
-#include <llvm/Support/GraphWriter.h>		// for graph write
-#include <llvm/Support/FileSystem.h>		// for file open flag
-#include <llvm/ADT/GraphTraits.h>
+#include "Graphs/GraphWriter.h"	// for graph write
+#include <fstream>
 
 namespace llvm
 {
@@ -60,24 +58,18 @@ public:
     {
         // Filename of the output dot file
         std::string Filename = GraphName + ".dot";
-        O << "Writing '" << Filename << "'...";
-        std::error_code ErrInfo;
-        llvm::ToolOutputFile F(Filename.c_str(), ErrInfo, llvm::sys::fs::OF_None);
-
-        if (!ErrInfo)
+        std::ofstream outFile(Filename);
+        if (outFile.fail())
         {
-            // dump the ValueFlowGraph here
-            WriteGraph(F.os(), GT, simple);
-            F.os().close();
-            if (!F.os().has_error())
-            {
-                O << "\n";
-                F.keep();
-                return;
-            }
+            O << "  error opening file for writing!\n";
+            outFile.close();
+            return;
         }
-        O << "  error opening file for writing!\n";
-        F.os().clear_error();
+
+        O << "Writing '" << Filename << "'...";
+
+        WriteGraph(outFile, GT, simple);
+        outFile.close();
     }
 
     /*!

package/SVF-osx/include/Graphs/GraphTraits.h

@@ -0,0 +1,150 @@
+//===- llvm/ADT/GraphTraits.h - Graph traits template -----------*- C++ -*-===//
+//
+// From the LLVM Project with some modifications, under the Apache License v2.0
+// with LLVM Exceptions. See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+//
+// This file defines the little GraphTraits<X> template class that should be
+// specialized by classes that want to be iteratable by generic graph iterators.
+//
+// This file also defines the marker class Inverse that is used to iterate over
+// graphs in a graph defined, inverse ordering...
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef LLVM_ADT_GRAPHTRAITS_H
+#define LLVM_ADT_GRAPHTRAITS_H
+
+#include "Util/iterator_range.h"
+
+namespace llvm
+{
+
+// GraphTraits - This class should be specialized by different graph types...
+// which is why the default version is empty.
+//
+// This template evolved from supporting `BasicBlock` to also later supporting
+// more complex types (e.g. CFG and DomTree).
+//
+// GraphTraits can be used to create a view over a graph interpreting it
+// differently without requiring a copy of the original graph. This could
+// be achieved by carrying more data in NodeRef. See LoopBodyTraits for one
+// example.
+template<class GraphType>
+struct GraphTraits
+{
+    // Elements to provide:
+
+    // typedef NodeRef           - Type of Node token in the graph, which should
+    //                             be cheap to copy.
+    // typedef ChildIteratorType - Type used to iterate over children in graph,
+    //                             dereference to a NodeRef.
+
+    // static NodeRef getEntryNode(const GraphType &)
+    //    Return the entry node of the graph
+
+    // static ChildIteratorType child_begin(NodeRef)
+    // static ChildIteratorType child_end  (NodeRef)
+    //    Return iterators that point to the beginning and ending of the child
+    //    node list for the specified node.
+
+    // typedef  ...iterator nodes_iterator; - dereference to a NodeRef
+    // static nodes_iterator nodes_begin(GraphType *G)
+    // static nodes_iterator nodes_end  (GraphType *G)
+    //    nodes_iterator/begin/end - Allow iteration over all nodes in the graph
+
+    // typedef EdgeRef           - Type of Edge token in the graph, which should
+    //                             be cheap to copy.
+    // typedef ChildEdgeIteratorType - Type used to iterate over children edges in
+    //                             graph, dereference to a EdgeRef.
+
+    // static ChildEdgeIteratorType child_edge_begin(NodeRef)
+    // static ChildEdgeIteratorType child_edge_end(NodeRef)
+    //     Return iterators that point to the beginning and ending of the
+    //     edge list for the given callgraph node.
+    //
+    // static NodeRef edge_dest(EdgeRef)
+    //     Return the destination node of an edge.
+
+    // static unsigned       size       (GraphType *G)
+    //    Return total number of nodes in the graph
+
+    // If anyone tries to use this class without having an appropriate
+    // specialization, make an error.  If you get this error, it's because you
+    // need to include the appropriate specialization of GraphTraits<> for your
+    // graph, or you need to define it for a new graph type. Either that or
+    // your argument to XXX_begin(...) is unknown or needs to have the proper .h
+    // file #include'd.
+    using NodeRef = typename GraphType::UnknownGraphTypeError;
+};
+
+// Inverse - This class is used as a little marker class to tell the graph
+// iterator to iterate over the graph in a graph defined "Inverse" ordering.
+// Not all graphs define an inverse ordering, and if they do, it depends on
+// the graph exactly what that is.  Here's an example of usage with the
+// df_iterator:
+//
+// idf_iterator<Method*> I = idf_begin(M), E = idf_end(M);
+// for (; I != E; ++I) { ... }
+//
+// Which is equivalent to:
+// df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
+// for (; I != E; ++I) { ... }
+//
+template <class GraphType>
+struct Inverse
+{
+    const GraphType &Graph;
+
+    inline Inverse(const GraphType &G) : Graph(G) {}
+};
+
+// Provide a partial specialization of GraphTraits so that the inverse of an
+// inverse falls back to the original graph.
+template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
+
+// Provide iterator ranges for the graph traits nodes and children
+template <class GraphType>
+iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
+nodes(const GraphType &G)
+{
+    return make_range(GraphTraits<GraphType>::nodes_begin(G),
+                      GraphTraits<GraphType>::nodes_end(G));
+}
+template <class GraphType>
+iterator_range<typename GraphTraits<Inverse<GraphType>>::nodes_iterator>
+        inverse_nodes(const GraphType &G)
+{
+    return make_range(GraphTraits<Inverse<GraphType>>::nodes_begin(G),
+                      GraphTraits<Inverse<GraphType>>::nodes_end(G));
+}
+
+template <class GraphType>
+iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
+children(const typename GraphTraits<GraphType>::NodeRef &G)
+{
+    return make_range(GraphTraits<GraphType>::child_begin(G),
+                      GraphTraits<GraphType>::child_end(G));
+}
+
+template <class GraphType>
+iterator_range<typename GraphTraits<Inverse<GraphType>>::ChildIteratorType>
+        inverse_children(const typename GraphTraits<GraphType>::NodeRef &G)
+{
+    return make_range(GraphTraits<Inverse<GraphType>>::child_begin(G),
+                      GraphTraits<Inverse<GraphType>>::child_end(G));
+}
+
+template <class GraphType>
+iterator_range<typename GraphTraits<GraphType>::ChildEdgeIteratorType>
+children_edges(const typename GraphTraits<GraphType>::NodeRef &G)
+{
+    return make_range(GraphTraits<GraphType>::child_edge_begin(G),
+                      GraphTraits<GraphType>::child_edge_end(G));
+}
+
+} // end namespace llvm
+
+#endif // LLVM_ADT_GRAPHTRAITS_H