polyfile-weave 0.5.5__py3-none-any.whl

polyfile_weave-0.5.5.dist-info/licenses/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   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.

polyfile_weave-0.5.5.dist-info/top_level.txt

@@ -0,0 +1,2 @@
+polyfile
+polymerge

polymerge/__init__.py

@@ -0,0 +1 @@
+from .polymerge import merge

polymerge/__main__.py

@@ -0,0 +1,296 @@
+import argparse
+import json
+import logging
+import shutil
+import sys
+
+from argparse import RawTextHelpFormatter
+from functools import reduce
+
+try:
+    import cxxfilt
+except ModuleNotFoundError:
+    cxxfilt = None
+
+from intervaltree import IntervalTree
+
+from polyfile import logger, __version__
+
+from .polymerge import merge, polyfile_type_graph
+from . import polytracker
+
+log = logger.getStatusLogger("PolyMerge")
+
+
+def parse_dataflow_ranges(dataflow):
+    dataflow_ranges = None
+
+    dataflow_from_start = None
+    dataflow_to_end = None
+
+    if dataflow is None:
+        return dataflow_from_start, dataflow_to_end, dataflow_ranges
+
+    for dataflow_range in dataflow:
+        parts = dataflow_range.split(':')
+        if len(parts) > 2:
+            raise ValueError(f"Error: Invalid dataflow range {dataflow_range!r}")
+        elif len(parts) == 1:
+            start = parts[0]
+            end = None
+        else:
+            start, end = parts
+        if start:
+            try:
+                start = int(start)
+            except ValueError:
+                raise ValueError(f"Error: Invalid dataflow range start {dataflow_range!r}")
+        else:
+            start = None
+        had_end = False
+        if end is not None:
+            if end:
+                try:
+                    end = int(end)
+                except ValueError:
+                    raise ValueError(f"Error: Invalid dataflow range end {dataflow_range!r}")
+            else:
+                had_end = True
+                end = None
+        if start is not None and end is not None:
+            # "start:end"
+            if start >= end:
+                raise ValueError(f"Error: Dataflow range start must be less than end in {dataflow_range}")
+            if dataflow_ranges is None:
+                dataflow_ranges = IntervalTree()
+            dataflow_ranges[start:end] = True
+        elif start is not None:
+            if had_end:
+                # "start:"
+                if dataflow_to_end is None:
+                    dataflow_to_end = start
+                else:
+                    dataflow_to_end = min(dataflow_to_end, start)
+            else:
+                # "offset"
+                if dataflow_ranges is None:
+                    dataflow_ranges = IntervalTree()
+                dataflow_ranges[start:start+1] = True
+        elif end is not None:
+            # ":end"
+            if dataflow_from_start is None:
+                dataflow_from_start = end
+            else:
+                dataflow_from_start = max(dataflow_from_start, end)
+        elif had_end:
+            # ":"
+            dataflow_to_end = 0
+
+    return dataflow_from_start, dataflow_to_end, dataflow_ranges
+
+
+def main(argv=None):
+    parser = argparse.ArgumentParser(description='''A utility to merge the JSON output of `polyfile`
+with a polytracker.json file from PolyTracker.
+
+https://github.com/trailofbits/polyfile/
+https://github.com/trailofbits/polytracker/
+''', formatter_class=RawTextHelpFormatter)
+    parser.add_argument('FILES', type=argparse.FileType('r'), nargs='+', help='Path to the PolyFile JSON output and/or the PolyTracker JSON output. Merging will only occur if both files are provided. The `--cfg` and `--type-hierarchy` options can be used if only a single file is provided, but no merging will occur.')
+    parser.add_argument('--cfg', '-c', type=str, default=None, help='Optional path to output a Graphviz .dot file representing the control flow graph of the program trace')
+    parser.add_argument('--cfg-pdf', '-p', type=str, default=None, help='Similar to --cfg, but renders the graph to a PDF instead of outputting the .dot source')
+    parser.add_argument('--dataflow', type=str, nargs='*', help='For the CFG generation options, only render functions that participated in dataflow. `--dataflow 10` means that only functions in the dataflow related to byte 10 should be included. `--dataflow 10:30` means that only functions operating on bytes 10 through 29 should be included. The beginning or end of a range can be omitted and will default to the beginning and end of the file, respectively. Multiple `--dataflow` ranges can be specified. `--dataflow :` will render the CFG only with functions that operated on tainted bytes. Omitting `--dataflow` will produce a CFG containing all functions.')
+    parser.add_argument('--no-intermediate-functions', action='store_true', help='To be used in conjunction with `--dataflow`. If enabled, only functions in the dataflow graph if they operated on the tainted bytes. This can result in a disjoint dataflow graph.')
+    parser.add_argument('--demangle', action='store_true', help='Demangle C++ function names in the CFG (requires that PolyFile was installed with the `demangle` option, or that the `cxxfilt` Python module is installed.)')
+    parser.add_argument('--type-hierarchy', '-t', type=str, default=None, help='Optional path to output a Graphviz .dot file representing the type hierarchy extracted from PolyFile')
+    parser.add_argument('--type-hierarchy-pdf', '-y', type=str, default=None, help='Similar to --type-hierarchy, but renders the graph to a PDF instead of outputting the .dot source')
+    parser.add_argument('--diff', type=argparse.FileType('r'), nargs='*', help='Diff an arbitrary number of input polytracker.json files, all treated as the same class, against one or more polytracker.json provided after `--diff` arguments')
+    parser.add_argument('--debug', '-d', action='store_true', help='Print debug information')
+    parser.add_argument('--quiet', '-q', action='store_true', help='Suppress all log output (overrides --debug)')
+    parser.add_argument('--version', '-v',
+                        action='version',
+                        version=f"PolyMerge version {__version__}\n",
+                        help='Print PolyMerge\'s version information and exit'
+    )
+    parser.add_argument('-dumpversion',
+                        action='version',
+                        version=__version__,
+                        help='Print PolyMerge\'s raw version information and exit'
+    )
+
+    if argv is None:
+        argv = sys.argv
+
+    args = parser.parse_args(argv[1:])
+
+    if args.debug:
+        logger.setLevel(logging.DEBUG)
+    elif args.quiet:
+        logger.setLevel(logging.CRITICAL)
+    else:
+        logger.setLevel(logger.STATUS)
+
+    build_cfg = args.cfg is not None or args.cfg_pdf is not None
+    built_type_hierarchy = args.type_hierarchy is not None or args.type_hierarchy_pdf is not None
+
+    if len(args.diff) > 0:
+        input_program_traces = [polytracker.parse(json.load(diff_file)) for diff_file in args.FILES]
+        program_traces_to_diff = [polytracker.parse(json.load(diff_file)) for diff_file in args.diff]
+
+        def labeler(funcname):
+            if args.demangle:
+                if funcname.startswith('dfs$'):
+                    funcname = funcname[4:]
+                return cxxfilt.demangle(funcname)
+            else:
+                return funcname
+
+        first_funcs = None
+        for f in input_program_traces:
+            fnames = set(labeler(fname) for fname in f.functions.keys())
+            if first_funcs is None:
+                first_funcs = fnames
+            else:
+                first_funcs &= fnames
+
+        second_funcs = None
+        for f in input_program_traces:
+            fnames = set(labeler(fname) for fname in f.functions.keys())
+            if second_funcs is None:
+                second_funcs = fnames
+            else:
+                second_funcs &= fnames
+
+        print('\n'.join(second_funcs ^ first_funcs))
+        exit(0)
+
+    if len(args.FILES) == 1:
+        if build_cfg and built_type_hierarchy:
+            parser.print_help()
+            sys.stderr.write('\n')
+            log.critical("Error: Two input files (PolyFile, PolyTracker) are required when both `--cfg` and `--type-hierarchy` options are enabled.")
+            parser.exit()
+        elif build_cfg:
+            polyfile_json_file = None
+            polytracker_json_file = args.FILES[0]
+        elif built_type_hierarchy:
+            polyfile_json_file = args.FILES[0]
+            polytracker_json_file = None
+        else:
+            return 0
+    elif len(args.FILES) != 2:
+        parser.print_help()
+        sys.stderr.write('\n')
+        log.critical("Error: Expected at most two input files")
+        parser.exit()
+    else:
+        polyfile_json_file = args.FILES[0]
+        polytracker_json_file = args.FILES[1]
+
+    if build_cfg and args.demangle and cxxfilt is None:
+        log.critical("Error: The `cxxfilt` package is not installed. Either reinstall PolyFile with the `demangle` option enabled, or run `pip3 install cxxfilt`.")
+        parser.exit()
+
+    try:
+        dataflow_from_start, dataflow_to_end, dataflow_ranges = parse_dataflow_ranges(args.dataflow)
+    except ValueError as e:
+        parser.print_help()
+        sys.stderr.write('\n')
+        log.critical(f"Error: {e!s}")
+        parser.exit()
+
+    if polyfile_json_file is not None:
+        polyfile_json = json.load(polyfile_json_file)
+        polyfile_json_file.close()
+    else:
+        polyfile_json = None
+    if polytracker_json_file is not None:
+        program_trace = polytracker.parse(json.load(polytracker_json_file))
+        polytracker_json_file.close()
+    else:
+        program_trace = None
+
+    if polyfile_json is not None and program_trace is not None:
+        merged = merge(polyfile_json, program_trace)
+        print(json.dumps(merged))
+
+    if build_cfg:
+        log.status("Reconstructing the runtime control flow graph...")
+        cfg = program_trace.cfg
+
+        def labeler(f):
+            if args.demangle:
+                funcname = f.name
+                if funcname.startswith('dfs$'):
+                    funcname = funcname[4:]
+                return cxxfilt.demangle(funcname)
+            else:
+                return f.name
+
+        if dataflow_from_start is not None or dataflow_to_end is not None or dataflow_ranges is not None:
+            dataflow_functions = set()
+            for f in program_trace.functions.values():
+                check_more = False
+                for offsets in f.input_bytes.values():
+                    for offset in offsets:
+                        if (dataflow_to_end is not None and offset >= dataflow_to_end) \
+                                or (dataflow_from_start is not None and offset < dataflow_from_start) \
+                                or (dataflow_ranges is not None and dataflow_ranges[offset]):
+                            dataflow_functions.add(f)
+                            break
+                    else:
+                        check_more = True
+                    if not check_more:
+                        break
+                else:
+                    log.debug(f"Function {f!r} did not operate on any tainted bytes")
+            if not args.no_intermediate_functions:
+                # add all functions that have both an ancestor and descendant
+                # in the dominator tree that's also in in dataflow_functions
+                doms = program_trace.cfg.dominator_forest
+                orig_functions = frozenset(dataflow_functions)
+                for f in program_trace.functions.values():
+                    if f in orig_functions:
+                        continue
+                    if doms.ancestors(f).intersection(orig_functions) \
+                            and doms.descendants(f).intersection(orig_functions):
+                        log.debug(f"Adding intermediate function {f.name} to the dataflow graph")
+                        dataflow_functions.add(f)
+
+            node_filter = lambda func: func in dataflow_functions
+        else:
+            node_filter = None
+
+        dot = cfg.to_dot(labeler=labeler, node_filter=node_filter)#(merged_json_obj=merged)
+        log.clear_status()
+        if args.cfg is not None:
+            with open(args.cfg, 'w') as cfg_file:
+                cfg_file.write(dot.source)
+            log.info(f"Saved CFG .dot graph to {args.cfg}")
+        if args.cfg_pdf is not None:
+            log.status("Rendering the runtime CFG to a PDF...")
+            rendered_path = dot.render(args.cfg_pdf, cleanup=True)
+            log.clear_status()
+            if rendered_path != args.cfg_pdf:
+                shutil.move(rendered_path, args.cfg_pdf)
+            log.info(f"Saved CFG graph PDF to {args.cfg_pdf}")
+
+    if built_type_hierarchy:
+        log.status("Building the input file type hierarchy...")
+        type_dominators: cfg.DAG = polyfile_type_graph(polyfile_json).dominator_forest
+        dot = type_dominators.to_dot()
+        if args.type_hierarchy:
+            with open(args.type_hierarchy, 'w') as dot_file:
+                dot_file.write(dot.source)
+            log.info(f"Saved type hierarchy .dot graph to {args.type_hierarchy}")
+        if args.type_hierarchy_pdf is not None:
+            log.status("Rendering the type hierarchy to a PDF...")
+            rendered_path = dot.render(args.type_hierarchy_pdf, cleanup=True)
+            log.clear_status()
+            if rendered_path != args.type_hierarchy_pdf:
+                shutil.move(rendered_path, args.type_hierarchy_pdf)
+            log.info(f"Saved type hierarchy PDF to {args.type_hierarchy_pdf}")
+
+
+if __name__ == '__main__':
+    main()

polymerge/cfg.py

@@ -0,0 +1,127 @@
+import math
+
+import graphviz
+import networkx as nx
+
+from . import polymerge, polytracker
+
+
+def roots(graph):
+    return (n for n, d in graph.in_degree() if d == 0)
+
+
+class DiGraph(nx.DiGraph):
+    def __init__(self, *args, **kwargs):
+        super().__init__(*args, **kwargs)
+        self._dominator_forest: DiGraph = None
+        self._roots = None
+        self._path_lengths = None
+
+    def path_length(self, from_node, to_node):
+        if self._path_lengths is None:
+            self._path_lengths = dict(nx.all_pairs_shortest_path_length(self, cutoff=None))
+        if from_node not in self._path_lengths or to_node not in self._path_lengths[from_node]:
+            return math.inf
+        else:
+            return self._path_lengths[from_node][to_node]
+
+    def set_roots(self, roots):
+        self._roots = roots
+
+    @property
+    def roots(self):
+        if self._roots is None:
+            self._roots = tuple(roots(self))
+        return self._roots
+
+    def depth(self, node):
+        return min(self.path_length(root, node) for root in self.roots)
+
+    def ancestors(self, node) -> set:
+        return nx.ancestors(self, node)
+
+    def descendants(self, node) -> frozenset:
+        return frozenset(nx.dfs_successors(self, node).keys())
+
+    @property
+    def dominator_forest(self):
+        if self._dominator_forest is not None:
+            return self._dominator_forest
+        self._dominator_forest = DAG()
+        for root in self.roots:
+            for node, dominated_by in nx.immediate_dominators(self, root).items():
+                if node != dominated_by:
+                    self._dominator_forest.add_edge(dominated_by, node)
+        return self._dominator_forest
+
+    def to_dot(self, comment: str = None, labeler=str, node_filter=None) -> graphviz.Digraph:
+        if comment is not None:
+            dot = graphviz.Digraph(comment=comment)
+        else:
+            dot = graphviz.Digraph()
+        node_ids = {node: i for i, node in enumerate(self.nodes)}
+        for node in self.nodes:
+            if node_filter is None or node_filter(node):
+                dot.node(f'func{node_ids[node]}', label=labeler(node))
+        for caller, callee in self.edges:
+            if node_filter is None or (node_filter(caller) and node_filter(callee)):
+                dot.edge(f'func{node_ids[caller]}', f'func{node_ids[callee]}')
+        return dot
+
+
+class DAG(DiGraph):
+    def vertex_induced_subgraph(self, vertices):
+        vertices = frozenset(vertices)
+        subgraph = self.copy()
+        to_remove = set(self.nodes) - vertices
+        for v in vertices:
+            node = v
+            parent = None
+            while True:
+                parents = tuple(subgraph.predecessors(node))
+                if not parents:
+                    if parent is not None:
+                        subgraph.remove_edge(parent, v)
+                        subgraph.add_edge(node, v)
+                    break
+                assert len(parents) == 1
+                ancestor = parents[0]
+                if parent is None:
+                    parent = ancestor
+                if ancestor in vertices:
+                    to_remove.add(v)
+                    break
+                node = ancestor
+        subgraph.remove_nodes_from(to_remove)
+        return subgraph
+
+
+class CFG(DiGraph):
+    def __init__(self, trace):
+        super().__init__()
+        self.trace: polytracker.ProgramTrace = trace
+
+    def to_dot(self,
+               comment='PolyTracker Program Trace',
+               merged_json_obj=None,
+               only_labeled_functions=False,
+               labeler=None,
+               **kwargs
+               ) -> graphviz.Digraph:
+        if merged_json_obj is not None:
+            function_labels = {
+                func_name: ', '.join(['::'.join(label) for label in labels])
+                for func_name, labels in polymerge.function_labels(merged_json_obj).items()
+            }
+        else:
+            function_labels = {}
+
+        def func_labeler(f):
+            if labeler is not None:
+                return labeler(f)
+            elif f.name in function_labels:
+                return f"{f.name} ({function_labels[f.name]})"
+            else:
+                return f.name
+
+        return super().to_dot(comment, labeler=func_labeler, **kwargs)