svf-lib 1.0.1291 → 1.0.1292

package/SVF-linux/include/Graphs/DOTGraphTraits.h

@@ -0,0 +1,188 @@
+//===-- Graphs/DOTGraphTraits.h - Customize .dot output ---*- 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 a template class that can be used to customize dot output
+// graphs generated by the GraphWriter.h file.  The default implementation of
+// this file will produce a simple, but not very polished graph.  By
+// specializing this template, lots of customization opportunities are possible.
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef LLVM_SUPPORT_DOTGRAPHTRAITS_H
+#define LLVM_SUPPORT_DOTGRAPHTRAITS_H
+
+#include <string>
+
+namespace llvm
+{
+
+/// DefaultDOTGraphTraits - This class provides the default implementations of
+/// all of the DOTGraphTraits methods.  If a specialization does not need to
+/// override all methods here it should inherit so that it can get the default
+/// implementations.
+///
+struct DefaultDOTGraphTraits
+{
+private:
+    bool IsSimple;
+
+protected:
+    bool isSimple()
+    {
+        return IsSimple;
+    }
+
+public:
+    explicit DefaultDOTGraphTraits(bool simple=false) : IsSimple (simple) {}
+
+    /// getGraphName - Return the label for the graph as a whole.  Printed at the
+    /// top of the graph.
+    ///
+    template<typename GraphType>
+    static std::string getGraphName(const GraphType &)
+    {
+        return "";
+    }
+
+    /// getGraphProperties - Return any custom properties that should be included
+    /// in the top level graph structure for dot.
+    ///
+    template<typename GraphType>
+    static std::string getGraphProperties(const GraphType &)
+    {
+        return "";
+    }
+
+    /// renderGraphFromBottomUp - If this function returns true, the graph is
+    /// emitted bottom-up instead of top-down.  This requires graphviz 2.0 to work
+    /// though.
+    static bool renderGraphFromBottomUp()
+    {
+        return false;
+    }
+
+    /// isNodeHidden - If the function returns true, the given node is not
+    /// displayed in the graph.
+    template <typename GraphType>
+    static bool isNodeHidden(const void *, const GraphType &)
+    {
+        return false;
+    }
+
+    /// getNodeLabel - Given a node and a pointer to the top level graph, return
+    /// the label to print in the node.
+    template<typename GraphType>
+    std::string getNodeLabel(const void *, const GraphType &)
+    {
+        return "";
+    }
+
+    // getNodeIdentifierLabel - Returns a string representing the
+    // address or other unique identifier of the node. (Only used if
+    // non-empty.)
+    template <typename GraphType>
+    static std::string getNodeIdentifierLabel(const void *, const GraphType &)
+    {
+        return "";
+    }
+
+    template<typename GraphType>
+    static std::string getNodeDescription(const void *, const GraphType &)
+    {
+        return "";
+    }
+
+    /// If you want to specify custom node attributes, this is the place to do so
+    ///
+    template<typename GraphType>
+    static std::string getNodeAttributes(const void *,
+                                         const GraphType &)
+    {
+        return "";
+    }
+
+    /// If you want to override the dot attributes printed for a particular edge,
+    /// override this method.
+    template<typename EdgeIter, typename GraphType>
+    static std::string getEdgeAttributes(const void *, EdgeIter,
+                                         const GraphType &)
+    {
+        return "";
+    }
+
+    /// getEdgeSourceLabel - If you want to label the edge source itself,
+    /// implement this method.
+    template<typename EdgeIter>
+    static std::string getEdgeSourceLabel(const void *, EdgeIter)
+    {
+        return "";
+    }
+
+    /// edgeTargetsEdgeSource - This method returns true if this outgoing edge
+    /// should actually target another edge source, not a node.  If this method is
+    /// implemented, getEdgeTarget should be implemented.
+    template<typename EdgeIter>
+    static bool edgeTargetsEdgeSource(const void *, EdgeIter)
+    {
+        return false;
+    }
+
+    /// getEdgeTarget - If edgeTargetsEdgeSource returns true, this method is
+    /// called to determine which outgoing edge of Node is the target of this
+    /// edge.
+    template<typename EdgeIter>
+    static EdgeIter getEdgeTarget(const void *, EdgeIter I)
+    {
+        return I;
+    }
+
+    /// hasEdgeDestLabels - If this function returns true, the graph is able
+    /// to provide labels for edge destinations.
+    static bool hasEdgeDestLabels()
+    {
+        return false;
+    }
+
+    /// numEdgeDestLabels - If hasEdgeDestLabels, this function returns the
+    /// number of incoming edge labels the given node has.
+    static unsigned numEdgeDestLabels(const void *)
+    {
+        return 0;
+    }
+
+    /// getEdgeDestLabel - If hasEdgeDestLabels, this function returns the
+    /// incoming edge label with the given index in the given node.
+    static std::string getEdgeDestLabel(const void *, unsigned)
+    {
+        return "";
+    }
+
+    /// addCustomGraphFeatures - If a graph is made up of more than just
+    /// straight-forward nodes and edges, this is the place to put all of the
+    /// custom stuff necessary.  The GraphWriter object, instantiated with your
+    /// GraphType is passed in as an argument.  You may call arbitrary methods on
+    /// it to add things to the output graph.
+    ///
+    template<typename GraphType, typename GraphWriter>
+    static void addCustomGraphFeatures(const GraphType &, GraphWriter &) {}
+};
+
+
+/// DOTGraphTraits - Template class that can be specialized to customize how
+/// graphs are converted to 'dot' graphs.  When specializing, you may inherit
+/// from DefaultDOTGraphTraits if you don't need to override everything.
+///
+template <typename Ty>
+struct DOTGraphTraits : public DefaultDOTGraphTraits
+{
+    DOTGraphTraits (bool simple=false) : DefaultDOTGraphTraits (simple) {}
+};
+
+} // End llvm namespace
+
+#endif

package/SVF-linux/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-linux/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-linux/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

package/SVF-linux/include/Graphs/GraphWriter.h

@@ -0,0 +1,380 @@
+//===- Graphs/GraphWriter.h - Write graph to a .dot file --*- 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 a simple interface that can be used to print out generic
+// LLVM graphs to ".dot" files.  "dot" is a tool that is part of the AT&T
+// graphviz package (http://www.research.att.com/sw/tools/graphviz/) which can
+// be used to turn the files output by this interface into a variety of
+// different graphics formats.
+//
+// Graphs do not need to implement any interface past what is already required
+// by the GraphTraits template, but they can choose to implement specializations
+// of the DOTGraphTraits template if they want to customize the graphs output in
+// any way.
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef LLVM_SUPPORT_GRAPHWRITER_H
+#define LLVM_SUPPORT_GRAPHWRITER_H
+
+#include "Graphs/GraphTraits.h"
+#include "Graphs/DOTGraphTraits.h"
+#include <algorithm>
+#include <cstddef>
+#include <iterator>
+#include <string>
+#include <type_traits>
+#include <vector>
+#include <fstream>
+#include <sstream>
+#include <iostream>
+
+namespace llvm
+{
+
+namespace DOT    // Private functions...
+{
+
+std::string EscapeStr(const std::string &Label);
+
+} // end namespace DOT
+
+namespace GraphProgram
+{
+
+enum Name
+{
+    DOT,
+    FDP,
+    NEATO,
+    TWOPI,
+    CIRCO
+};
+
+} // end namespace GraphProgram
+
+template<typename GraphType>
+class GraphWriter
+{
+    std::ofstream &O;
+    const GraphType &G;
+
+    using DOTTraits = DOTGraphTraits<GraphType>;
+    using GTraits = GraphTraits<GraphType>;
+    using NodeRef = typename GTraits::NodeRef;
+    using node_iterator = typename GTraits::nodes_iterator;
+    using child_iterator = typename GTraits::ChildIteratorType;
+    DOTTraits DTraits;
+
+    static_assert(std::is_pointer<NodeRef>::value,
+                  "FIXME: Currently GraphWriter requires the NodeRef type to be "
+                  "a pointer.\nThe pointer usage should be moved to "
+                  "DOTGraphTraits, and removed from GraphWriter itself.");
+
+    // Writes the edge labels of the node to O and returns true if there are any
+    // edge labels not equal to the empty string "".
+    bool getEdgeSourceLabels(std::stringstream &O2, NodeRef Node)
+    {
+        child_iterator EI = GTraits::child_begin(Node);
+        child_iterator EE = GTraits::child_end(Node);
+        bool hasEdgeSourceLabels = false;
+
+        for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i)
+        {
+            std::string label = DTraits.getEdgeSourceLabel(Node, EI);
+
+            if (label.empty())
+                continue;
+
+            hasEdgeSourceLabels = true;
+
+            if (i)
+                O2 << "|";
+
+            O2 << "<s" << i << ">" << DOT::EscapeStr(label);
+        }
+
+        if (EI != EE && hasEdgeSourceLabels)
+            O2 << "|<s64>truncated...";
+
+        return hasEdgeSourceLabels;
+    }
+
+public:
+    GraphWriter(std::ofstream &o, const GraphType &g, bool SN) : O(o), G(g)
+    {
+        DTraits = DOTTraits(SN);
+    }
+
+    void writeGraph(const std::string &Title = "")
+    {
+        // Output the header for the graph...
+        writeHeader(Title);
+
+        // Emit all of the nodes in the graph...
+        writeNodes();
+
+        // Output any customizations on the graph
+        DOTGraphTraits<GraphType>::addCustomGraphFeatures(G, *this);
+
+        // Output the end of the graph
+        writeFooter();
+    }
+
+    void writeHeader(const std::string &Title)
+    {
+        std::string GraphName(DTraits.getGraphName(G));
+
+        if (!Title.empty())
+            O << "digraph \"" << DOT::EscapeStr(Title) << "\" {\n";
+        else if (!GraphName.empty())
+            O << "digraph \"" << DOT::EscapeStr(GraphName) << "\" {\n";
+        else
+            O << "digraph unnamed {\n";
+
+        if (DTraits.renderGraphFromBottomUp())
+            O << "\trankdir=\"BT\";\n";
+
+        if (!Title.empty())
+            O << "\tlabel=\"" << DOT::EscapeStr(Title) << "\";\n";
+        else if (!GraphName.empty())
+            O << "\tlabel=\"" << DOT::EscapeStr(GraphName) << "\";\n";
+        O << DTraits.getGraphProperties(G);
+        O << "\n";
+    }
+
+    void writeFooter()
+    {
+        // Finish off the graph
+        O << "}\n";
+    }
+
+    void writeNodes()
+    {
+        // Loop over the graph, printing it out...
+        for (const auto Node : nodes<GraphType>(G))
+            if (!isNodeHidden(Node))
+                writeNode(Node);
+    }
+
+    bool isNodeHidden(NodeRef Node)
+    {
+        return DTraits.isNodeHidden(Node, G);
+    }
+
+    void writeNode(NodeRef Node)
+    {
+        std::string NodeAttributes = DTraits.getNodeAttributes(Node, G);
+
+        O << "\tNode" << static_cast<const void*>(Node) << " [shape=record,";
+        if (!NodeAttributes.empty()) O << NodeAttributes << ",";
+        O << "label=\"{";
+
+        if (!DTraits.renderGraphFromBottomUp())
+        {
+            O << DOT::EscapeStr(DTraits.getNodeLabel(Node, G));
+
+            // If we should include the address of the node in the label, do so now.
+            std::string Id = DTraits.getNodeIdentifierLabel(Node, G);
+            if (!Id.empty())
+                O << "|" << DOT::EscapeStr(Id);
+
+            std::string NodeDesc = DTraits.getNodeDescription(Node, G);
+            if (!NodeDesc.empty())
+                O << "|" << DOT::EscapeStr(NodeDesc);
+        }
+
+        std::string edgeSourceLabels;
+        std::stringstream EdgeSourceLabels(edgeSourceLabels);
+        bool hasEdgeSourceLabels = getEdgeSourceLabels(EdgeSourceLabels, Node);
+
+        if (hasEdgeSourceLabels)
+        {
+            if (!DTraits.renderGraphFromBottomUp()) O << "|";
+
+            O << "{" << EdgeSourceLabels.str() << "}";
+
+            if (DTraits.renderGraphFromBottomUp()) O << "|";
+        }
+
+        if (DTraits.renderGraphFromBottomUp())
+        {
+            O << DOT::EscapeStr(DTraits.getNodeLabel(Node, G));
+
+            // If we should include the address of the node in the label, do so now.
+            std::string Id = DTraits.getNodeIdentifierLabel(Node, G);
+            if (!Id.empty())
+                O << "|" << DOT::EscapeStr(Id);
+
+            std::string NodeDesc = DTraits.getNodeDescription(Node, G);
+            if (!NodeDesc.empty())
+                O << "|" << DOT::EscapeStr(NodeDesc);
+        }
+
+        if (DTraits.hasEdgeDestLabels())
+        {
+            O << "|{";
+
+            unsigned i = 0, e = DTraits.numEdgeDestLabels(Node);
+            for (; i != e && i != 64; ++i)
+            {
+                if (i) O << "|";
+                O << "<d" << i << ">"
+                  << DOT::EscapeStr(DTraits.getEdgeDestLabel(Node, i));
+            }
+
+            if (i != e)
+                O << "|<d64>truncated...";
+            O << "}";
+        }
+
+        O << "}\"];\n";   // Finish printing the "node" line
+
+        // Output all of the edges now
+        child_iterator EI = GTraits::child_begin(Node);
+        child_iterator EE = GTraits::child_end(Node);
+        for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i)
+            if (!DTraits.isNodeHidden(*EI, G))
+                writeEdge(Node, i, EI);
+        for (; EI != EE; ++EI)
+            if (!DTraits.isNodeHidden(*EI, G))
+                writeEdge(Node, 64, EI);
+    }
+
+    void writeEdge(NodeRef Node, unsigned edgeidx, child_iterator EI)
+    {
+        if (NodeRef TargetNode = *EI)
+        {
+            int DestPort = -1;
+            if (DTraits.edgeTargetsEdgeSource(Node, EI))
+            {
+                child_iterator TargetIt = DTraits.getEdgeTarget(Node, EI);
+
+                // Figure out which edge this targets...
+                unsigned Offset =
+                    (unsigned)std::distance(GTraits::child_begin(TargetNode), TargetIt);
+                DestPort = static_cast<int>(Offset);
+            }
+
+            if (DTraits.getEdgeSourceLabel(Node, EI).empty())
+                edgeidx = -1;
+
+            emitEdge(static_cast<const void*>(Node), edgeidx,
+                     static_cast<const void*>(TargetNode), DestPort,
+                     DTraits.getEdgeAttributes(Node, EI, G));
+        }
+    }
+
+    /// emitSimpleNode - Outputs a simple (non-record) node
+    void emitSimpleNode(const void *ID, const std::string &Attr,
+                        const std::string &Label, unsigned NumEdgeSources = 0,
+                        const std::vector<std::string> *EdgeSourceLabels = nullptr)
+    {
+        O << "\tNode" << ID << "[ ";
+        if (!Attr.empty())
+            O << Attr << ",";
+        O << " label =\"";
+        if (NumEdgeSources) O << "{";
+        O << DOT::EscapeStr(Label);
+        if (NumEdgeSources)
+        {
+            O << "|{";
+
+            for (unsigned i = 0; i != NumEdgeSources; ++i)
+            {
+                if (i) O << "|";
+                O << "<s" << i << ">";
+                if (EdgeSourceLabels) O << DOT::EscapeStr((*EdgeSourceLabels)[i]);
+            }
+            O << "}}";
+        }
+        O << "\"];\n";
+    }
+
+    /// emitEdge - Output an edge from a simple node into the graph...
+    void emitEdge(const void *SrcNodeID, int SrcNodePort,
+                  const void *DestNodeID, int DestNodePort,
+                  const std::string &Attrs)
+    {
+        if (SrcNodePort  > 64) return;             // Eminating from truncated part?
+        if (DestNodePort > 64) DestNodePort = 64;  // Targeting the truncated part?
+
+        O << "\tNode" << SrcNodeID;
+        if (SrcNodePort >= 0)
+            O << ":s" << SrcNodePort;
+        O << " -> Node" << DestNodeID;
+        if (DestNodePort >= 0 && DTraits.hasEdgeDestLabels())
+            O << ":d" << DestNodePort;
+
+        if (!Attrs.empty())
+            O << "[" << Attrs << "]";
+        O << ";\n";
+    }
+
+    /// getOStream - Get the raw output stream into the graph file. Useful to
+    /// write fancy things using addCustomGraphFeatures().
+    std::ofstream &getOStream()
+    {
+        return O;
+    }
+};
+
+template<typename GraphType>
+std::ofstream &WriteGraph(std::ofstream &O, const GraphType &G,
+                          bool ShortNames = false)
+{
+    // Start the graph emission process...
+    GraphWriter<GraphType> W(O, G, ShortNames);
+
+    // Emit the graph.
+    W.writeGraph("");
+
+    return O;
+}
+
+/// Writes graph into a provided @c Filename.
+/// If @c Filename is empty, generates a random one.
+/// \return The resulting filename, or an empty string if writing
+/// failed.
+template <typename GraphType>
+std::string WriteGraph(const GraphType &G,
+                       bool ShortNames = false,
+                       std::string Filename = "")
+{
+
+    std::ofstream O(Filename);
+
+    if (O.fail())
+    {
+        std::cerr << "error opening file '" << Filename << "' for writing!\n";
+        O.close();
+        return "";
+    }
+
+    llvm::WriteGraph(O, G, ShortNames);
+    O.close();
+
+    std::cerr << " done. \n";
+
+    return Filename;
+}
+
+/// ViewGraph - Emit a dot graph, run 'dot', run gv on the postscript file,
+/// then cleanup.  For use from the debugger.
+///
+template<typename GraphType>
+void ViewGraph(const GraphType &G,const std::string& name,
+               bool ShortNames = false,
+               GraphProgram::Name Program = GraphProgram::DOT)
+{
+    llvm::WriteGraph(G, ShortNames);
+}
+
+} // end namespace llvm
+
+#endif // LLVM_SUPPORT_GRAPHWRITER_H

package/SVF-linux/include/Util/iterator.h

@@ -0,0 +1,407 @@
+//===- iterator.h - Utilities for using and defining iterators --*- C++ -*-===//
+//
+// Part of the LLVM Project, 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
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef LLVM_ADT_ITERATOR_H
+#define LLVM_ADT_ITERATOR_H
+
+#include "Util/iterator_range.h"
+#include <cstddef>
+#include <iterator>
+#include <type_traits>
+#include <utility>
+
+namespace llvm
+{
+
+/// CRTP base class which implements the entire standard iterator facade
+/// in terms of a minimal subset of the interface.
+///
+/// Use this when it is reasonable to implement most of the iterator
+/// functionality in terms of a core subset. If you need special behavior or
+/// there are performance implications for this, you may want to override the
+/// relevant members instead.
+///
+/// Note, one abstraction that this does *not* provide is implementing
+/// subtraction in terms of addition by negating the difference. Negation isn't
+/// always information preserving, and I can see very reasonable iterator
+/// designs where this doesn't work well. It doesn't really force much added
+/// boilerplate anyways.
+///
+/// Another abstraction that this doesn't provide is implementing increment in
+/// terms of addition of one. These aren't equivalent for all iterator
+/// categories, and respecting that adds a lot of complexity for little gain.
+///
+/// Classes wishing to use `iterator_facade_base` should implement the following
+/// methods:
+///
+/// Forward Iterators:
+///   (All of the following methods)
+///   - DerivedT &operator=(const DerivedT &R);
+///   - bool operator==(const DerivedT &R) const;
+///   - const T &operator*() const;
+///   - T &operator*();
+///   - DerivedT &operator++();
+///
+/// Bidirectional Iterators:
+///   (All methods of forward iterators, plus the following)
+///   - DerivedT &operator--();
+///
+/// Random-access Iterators:
+///   (All methods of bidirectional iterators excluding the following)
+///   - DerivedT &operator++();
+///   - DerivedT &operator--();
+///   (and plus the following)
+///   - bool operator<(const DerivedT &RHS) const;
+///   - DifferenceTypeT operator-(const DerivedT &R) const;
+///   - DerivedT &operator+=(DifferenceTypeT N);
+///   - DerivedT &operator-=(DifferenceTypeT N);
+///
+template <typename DerivedT, typename IteratorCategoryT, typename T,
+          typename DifferenceTypeT = std::ptrdiff_t, typename PointerT = T *,
+          typename ReferenceT = T &>
+class iterator_facade_base
+{
+public:
+    using iterator_category = IteratorCategoryT;
+    using value_type = T;
+    using difference_type = DifferenceTypeT;
+    using pointer = PointerT;
+    using reference = ReferenceT;
+
+protected:
+    enum
+    {
+        IsRandomAccess = std::is_base_of<std::random_access_iterator_tag,
+        IteratorCategoryT>::value,
+        IsBidirectional = std::is_base_of<std::bidirectional_iterator_tag,
+        IteratorCategoryT>::value,
+    };
+
+    /// A proxy object for computing a reference via indirecting a copy of an
+    /// iterator. This is used in APIs which need to produce a reference via
+    /// indirection but for which the iterator object might be a temporary. The
+    /// proxy preserves the iterator internally and exposes the indirected
+    /// reference via a conversion operator.
+    class ReferenceProxy
+    {
+        friend iterator_facade_base;
+
+        DerivedT I;
+
+        ReferenceProxy(DerivedT I) : I(std::move(I)) {}
+
+    public:
+        operator ReferenceT() const
+        {
+            return *I;
+        }
+    };
+
+public:
+    DerivedT operator+(DifferenceTypeT n) const
+    {
+        static_assert(std::is_base_of<iterator_facade_base, DerivedT>::value,
+                      "Must pass the derived type to this template!");
+        static_assert(
+            IsRandomAccess,
+            "The '+' operator is only defined for random access iterators.");
+        DerivedT tmp = *static_cast<const DerivedT *>(this);
+        tmp += n;
+        return tmp;
+    }
+    friend DerivedT operator+(DifferenceTypeT n, const DerivedT &i)
+    {
+        static_assert(
+            IsRandomAccess,
+            "The '+' operator is only defined for random access iterators.");
+        return i + n;
+    }
+    DerivedT operator-(DifferenceTypeT n) const
+    {
+        static_assert(
+            IsRandomAccess,
+            "The '-' operator is only defined for random access iterators.");
+        DerivedT tmp = *static_cast<const DerivedT *>(this);
+        tmp -= n;
+        return tmp;
+    }
+
+    DerivedT &operator++()
+    {
+        static_assert(std::is_base_of<iterator_facade_base, DerivedT>::value,
+                      "Must pass the derived type to this template!");
+        return static_cast<DerivedT *>(this)->operator+=(1);
+    }
+    DerivedT operator++(int)
+    {
+        DerivedT tmp = *static_cast<DerivedT *>(this);
+        ++*static_cast<DerivedT *>(this);
+        return tmp;
+    }
+    DerivedT &operator--()
+    {
+        static_assert(
+            IsBidirectional,
+            "The decrement operator is only defined for bidirectional iterators.");
+        return static_cast<DerivedT *>(this)->operator-=(1);
+    }
+    DerivedT operator--(int)
+    {
+        static_assert(
+            IsBidirectional,
+            "The decrement operator is only defined for bidirectional iterators.");
+        DerivedT tmp = *static_cast<DerivedT *>(this);
+        --*static_cast<DerivedT *>(this);
+        return tmp;
+    }
+
+#ifndef __cpp_impl_three_way_comparison
+    bool operator!=(const DerivedT &RHS) const
+    {
+        return !(static_cast<const DerivedT &>(*this) == RHS);
+    }
+#endif
+
+    bool operator>(const DerivedT &RHS) const
+    {
+        static_assert(
+            IsRandomAccess,
+            "Relational operators are only defined for random access iterators.");
+        return !(static_cast<const DerivedT &>(*this) < RHS) &&
+               !(static_cast<const DerivedT &>(*this) == RHS);
+    }
+    bool operator<=(const DerivedT &RHS) const
+    {
+        static_assert(
+            IsRandomAccess,
+            "Relational operators are only defined for random access iterators.");
+        return !(static_cast<const DerivedT &>(*this) > RHS);
+    }
+    bool operator>=(const DerivedT &RHS) const
+    {
+        static_assert(
+            IsRandomAccess,
+            "Relational operators are only defined for random access iterators.");
+        return !(static_cast<const DerivedT &>(*this) < RHS);
+    }
+
+    PointerT operator->()
+    {
+        return &static_cast<DerivedT *>(this)->operator*();
+    }
+    PointerT operator->() const
+    {
+        return &static_cast<const DerivedT *>(this)->operator*();
+    }
+    ReferenceProxy operator[](DifferenceTypeT n)
+    {
+        static_assert(IsRandomAccess,
+                      "Subscripting is only defined for random access iterators.");
+        return ReferenceProxy(static_cast<DerivedT *>(this)->operator+(n));
+    }
+    ReferenceProxy operator[](DifferenceTypeT n) const
+    {
+        static_assert(IsRandomAccess,
+                      "Subscripting is only defined for random access iterators.");
+        return ReferenceProxy(static_cast<const DerivedT *>(this)->operator+(n));
+    }
+};
+
+/// CRTP base class for adapting an iterator to a different type.
+///
+/// This class can be used through CRTP to adapt one iterator into another.
+/// Typically this is done through providing in the derived class a custom \c
+/// operator* implementation. Other methods can be overridden as well.
+template <
+    typename DerivedT, typename WrappedIteratorT,
+    typename IteratorCategoryT =
+    typename std::iterator_traits<WrappedIteratorT>::iterator_category,
+    typename T = typename std::iterator_traits<WrappedIteratorT>::value_type,
+    typename DifferenceTypeT =
+    typename std::iterator_traits<WrappedIteratorT>::difference_type,
+    typename PointerT = std::conditional_t<
+        std::is_same<T, typename std::iterator_traits<
+                         WrappedIteratorT>::value_type>::value,
+        typename std::iterator_traits<WrappedIteratorT>::pointer, T *>,
+    typename ReferenceT = std::conditional_t<
+        std::is_same<T, typename std::iterator_traits<
+                         WrappedIteratorT>::value_type>::value,
+        typename std::iterator_traits<WrappedIteratorT>::reference, T &>>
+class iterator_adaptor_base
+    : public iterator_facade_base<DerivedT, IteratorCategoryT, T,
+      DifferenceTypeT, PointerT, ReferenceT>
+{
+    using BaseT = typename iterator_adaptor_base::iterator_facade_base;
+
+protected:
+    WrappedIteratorT I;
+
+    iterator_adaptor_base() = default;
+
+    explicit iterator_adaptor_base(WrappedIteratorT u) : I(std::move(u))
+    {
+        static_assert(std::is_base_of<iterator_adaptor_base, DerivedT>::value,
+                      "Must pass the derived type to this template!");
+    }
+
+    const WrappedIteratorT &wrapped() const
+    {
+        return I;
+    }
+
+public:
+    using difference_type = DifferenceTypeT;
+
+    DerivedT &operator+=(difference_type n)
+    {
+        static_assert(
+            BaseT::IsRandomAccess,
+            "The '+=' operator is only defined for random access iterators.");
+        I += n;
+        return *static_cast<DerivedT *>(this);
+    }
+    DerivedT &operator-=(difference_type n)
+    {
+        static_assert(
+            BaseT::IsRandomAccess,
+            "The '-=' operator is only defined for random access iterators.");
+        I -= n;
+        return *static_cast<DerivedT *>(this);
+    }
+    using BaseT::operator-;
+    difference_type operator-(const DerivedT &RHS) const
+    {
+        static_assert(
+            BaseT::IsRandomAccess,
+            "The '-' operator is only defined for random access iterators.");
+        return I - RHS.I;
+    }
+
+    // We have to explicitly provide ++ and -- rather than letting the facade
+    // forward to += because WrappedIteratorT might not support +=.
+    using BaseT::operator++;
+    DerivedT &operator++()
+    {
+        ++I;
+        return *static_cast<DerivedT *>(this);
+    }
+    using BaseT::operator--;
+    DerivedT &operator--()
+    {
+        static_assert(
+            BaseT::IsBidirectional,
+            "The decrement operator is only defined for bidirectional iterators.");
+        --I;
+        return *static_cast<DerivedT *>(this);
+    }
+
+    friend bool operator==(const iterator_adaptor_base &LHS,
+                           const iterator_adaptor_base &RHS)
+    {
+        return LHS.I == RHS.I;
+    }
+    friend bool operator<(const iterator_adaptor_base &LHS,
+                          const iterator_adaptor_base &RHS)
+    {
+        static_assert(
+            BaseT::IsRandomAccess,
+            "Relational operators are only defined for random access iterators.");
+        return LHS.I < RHS.I;
+    }
+
+    ReferenceT operator*() const
+    {
+        return *I;
+    }
+};
+
+/// An iterator type that allows iterating over the pointees via some
+/// other iterator.
+///
+/// The typical usage of this is to expose a type that iterates over Ts, but
+/// which is implemented with some iterator over T*s:
+///
+/// \code
+///   using iterator = pointee_iterator<SmallVectorImpl<T *>::iterator>;
+/// \endcode
+template <typename WrappedIteratorT,
+          typename T = std::remove_reference_t<decltype(
+                      **std::declval<WrappedIteratorT>())>>
+struct pointee_iterator
+    : iterator_adaptor_base<
+      pointee_iterator<WrappedIteratorT, T>, WrappedIteratorT,
+      typename std::iterator_traits<WrappedIteratorT>::iterator_category,
+      T>
+{
+    pointee_iterator() = default;
+    template <typename U>
+    pointee_iterator(U &&u)
+        : pointee_iterator::iterator_adaptor_base(std::forward<U &&>(u)) {}
+
+    T &operator*() const
+    {
+        return **this->I;
+    }
+};
+
+template <typename RangeT, typename WrappedIteratorT =
+          decltype(std::begin(std::declval<RangeT>()))>
+iterator_range<pointee_iterator<WrappedIteratorT>>
+        make_pointee_range(RangeT &&Range)
+{
+    using PointeeIteratorT = pointee_iterator<WrappedIteratorT>;
+    return make_range(PointeeIteratorT(std::begin(std::forward<RangeT>(Range))),
+                      PointeeIteratorT(std::end(std::forward<RangeT>(Range))));
+}
+
+template <typename WrappedIteratorT,
+          typename T = decltype(&*std::declval<WrappedIteratorT>())>
+class pointer_iterator
+    : public iterator_adaptor_base<
+      pointer_iterator<WrappedIteratorT, T>, WrappedIteratorT,
+      typename std::iterator_traits<WrappedIteratorT>::iterator_category,
+      T>
+{
+    mutable T Ptr;
+
+public:
+    pointer_iterator() = default;
+
+    explicit pointer_iterator(WrappedIteratorT u)
+        : pointer_iterator::iterator_adaptor_base(std::move(u)) {}
+
+    T &operator*()
+    {
+        return Ptr = &*this->I;
+    }
+    const T &operator*() const
+    {
+        return Ptr = &*this->I;
+    }
+};
+
+template <typename RangeT, typename WrappedIteratorT =
+          decltype(std::begin(std::declval<RangeT>()))>
+iterator_range<pointer_iterator<WrappedIteratorT>>
+        make_pointer_range(RangeT &&Range)
+{
+    using PointerIteratorT = pointer_iterator<WrappedIteratorT>;
+    return make_range(PointerIteratorT(std::begin(std::forward<RangeT>(Range))),
+                      PointerIteratorT(std::end(std::forward<RangeT>(Range))));
+}
+
+template <typename WrappedIteratorT,
+          typename T1 = std::remove_reference_t<decltype(
+                      **std::declval<WrappedIteratorT>())>,
+          typename T2 = std::add_pointer_t<T1>>
+using raw_pointer_iterator =
+    pointer_iterator<pointee_iterator<WrappedIteratorT, T1>, T2>;
+
+} // end namespace llvm
+
+#endif // LLVM_ADT_ITERATOR_H

package/SVF-linux/include/Util/iterator_range.h

@@ -0,0 +1,76 @@
+//===- iterator_range.h - A range adaptor for iterators ---------*- 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
+//
+//===----------------------------------------------------------------------===//
+/// \file
+/// This provides a very simple, boring adaptor for a begin and end iterator
+/// into a range type. This should be used to build range views that work well
+/// with range based for loops and range based constructors.
+///
+/// Note that code here follows more standards-based coding conventions as it
+/// is mirroring proposed interfaces for standardization.
+///
+//===----------------------------------------------------------------------===//
+
+#ifndef LLVM_ADT_ITERATOR_RANGE_H
+#define LLVM_ADT_ITERATOR_RANGE_H
+
+#include <utility>
+
+namespace llvm
+{
+
+/// A range adaptor for a pair of iterators.
+///
+/// This just wraps two iterators into a range-compatible interface. Nothing
+/// fancy at all.
+template <typename IteratorT>
+class iterator_range
+{
+    IteratorT begin_iterator, end_iterator;
+
+public:
+    //TODO: Add SFINAE to test that the Container's iterators match the range's
+    //      iterators.
+    template <typename Container>
+    iterator_range(Container &&c)
+    //TODO: Consider ADL/non-member begin/end calls.
+        : begin_iterator(c.begin()), end_iterator(c.end()) {}
+    iterator_range(IteratorT begin_iterator, IteratorT end_iterator)
+        : begin_iterator(std::move(begin_iterator)),
+          end_iterator(std::move(end_iterator)) {}
+
+    IteratorT begin() const
+    {
+        return begin_iterator;
+    }
+    IteratorT end() const
+    {
+        return end_iterator;
+    }
+    bool empty() const
+    {
+        return begin_iterator == end_iterator;
+    }
+};
+
+/// Convenience function for iterating over sub-ranges.
+///
+/// This provides a bit of syntactic sugar to make using sub-ranges
+/// in for loops a bit easier. Analogous to std::make_pair().
+template <class T> iterator_range<T> make_range(T x, T y)
+{
+    return iterator_range<T>(std::move(x), std::move(y));
+}
+
+template <typename T> iterator_range<T> make_range(std::pair<T, T> p)
+{
+    return iterator_range<T>(std::move(p.first), std::move(p.second));
+}
+
+}
+
+#endif

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "svf-lib",
-  "version": "1.0.1291",
+  "version": "1.0.1292",
   "description": "SVF's npm support",
   "main": "index.js",
   "scripts": {