cpp_dependency_graph 0.1.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 7a18d32a9e2c0577def09a6698f9bb67804f981a5ec0320cb38357f847b92ac7
+  data.tar.gz: 6573a7087e4e3119db162ad532cd18602cb2fafca5ae00e5d806134edffc9016
+SHA512:
+  metadata.gz: a3f8fc5ba2c535832df85b7857d4e62b9b24c522dff5f47085f10b4c4839ab9f89f000ea9798ac8e9c4e6dd596098a1f2fa6dbf13471e3462019fc0a7b0197bb
+  data.tar.gz: 60a92bf02b6ed53d3ee740355f0efe8d8acfae33f05c521da2d38b4c04951b6f74d0323172025dd080c6c7c770c95db712fc351869ae768a012919717355e75a

data/.gitignore

@@ -0,0 +1,20 @@
+/.bundle/
+/Gemfile.lock
+/.yardoc
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+
+# rspec failure tracking
+.rspec_status
+deps.png
+deps.dot
+deps.html
+deps.json
+deps.graphml
+deps.svg
+index.html
+cpp_dependency_graph.callgrind.out*

data/.rspec

@@ -0,0 +1,3 @@
+--format documentation
+--color
+--require spec_helper

data/.vscode/launch.json

@@ -0,0 +1,79 @@
+{
+  // Use IntelliSense to learn about possible attributes.
+  // Hover to view descriptions of existing attributes.
+  // For more information, visit: https://go.microsoft.com/fwlink/?linkid=830387
+  "version": "0.2.0",
+  "configurations": [
+    {
+      "name": "Launch index.html",
+      "type": "chrome",
+      "request": "launch",
+      "breakOnLoad": true,
+      "sourceMapPathOverrides": {
+        "webRoot": "${workspaceRoot}"
+      },
+      "file": "${workspaceRoot}/index.html"
+    },
+    {
+      "name": "Debug Local File",
+      "type": "Ruby",
+      "request": "launch",
+      "cwd": "${workspaceRoot}",
+      "program": "${workspaceRoot}/exe/cpp_dependency_graph",
+      "useBundler": true,
+      "pathToBundler": "C:/tools/ruby25/bin/bundle.bat",
+      "pathToRDebugIDE": "C:/tools/ruby25/bin/rdebug-ide.bat",
+      "showDebuggerOutput": true,
+      "args": ["generate_graph", "--root_dir", "../protobuf/src", "--output_file", "deps.dot"]
+    },
+    {
+      "name": "Listen for rdebug-ide",
+      "type": "Ruby",
+      "request": "attach",
+      "cwd": "${workspaceRoot}",
+      "remoteHost": "127.0.0.1",
+      "remotePort": "1234",
+      "remoteWorkspaceRoot": "${workspaceRoot}"
+    },
+    {
+      "name": "Rails server",
+      "type": "Ruby",
+      "request": "launch",
+      "cwd": "${workspaceRoot}",
+      "program": "${workspaceRoot}/bin/rails",
+      "args": [
+        "server"
+      ]
+    },
+    {
+      "name": "RSpec - all",
+      "type": "Ruby",
+      "request": "launch",
+      "cwd": "${workspaceRoot}",
+      "program": "C:/tools/ruby25/bin/rspec",
+      "args": [
+        "-I",
+        "${workspaceRoot}"
+      ]
+    },
+    {
+      "name": "RSpec - active spec file only",
+      "type": "Ruby",
+      "request": "launch",
+      "cwd": "${workspaceRoot}",
+      "program": "C:/tools/ruby25/bin/rspec",
+      "args": [
+        "-I",
+        "${workspaceRoot}",
+        "${file}"
+      ]
+    },
+    {
+      "name": "Cucumber",
+      "type": "Ruby",
+      "request": "launch",
+      "cwd": "${workspaceRoot}",
+      "program": "${workspaceRoot}/bin/cucumber"
+    }
+  ]
+}

data/.vscode/tasks.json

@@ -0,0 +1,12 @@
+{
+  // See https://go.microsoft.com/fwlink/?LinkId=733558
+  // for the documentation about the tasks.json format
+  "version": "2.0.0",
+  "tasks": [
+    {
+      "label": "echo",
+      "type": "shell",
+      "command": "echo Hello"
+    }
+  ]
+}

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,46 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+In the interest of fostering an open and welcoming environment, we as contributors and maintainers pledge to making participation in our project and our community a harassment-free experience for everyone, regardless of age, body size, disability, ethnicity, gender identity and expression, level of experience, nationality, personal appearance, race, religion, or sexual identity and orientation.
+
+## Our Standards
+
+Examples of behavior that contributes to creating a positive environment include:
+
+* Using welcoming and inclusive language
+* Being respectful of differing viewpoints and experiences
+* Gracefully accepting constructive criticism
+* Focusing on what is best for the community
+* Showing empathy towards other community members
+
+Examples of unacceptable behavior by participants include:
+
+* The use of sexualized language or imagery and unwelcome sexual attention or advances
+* Trolling, insulting/derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or electronic address, without explicit permission
+* Other conduct which could reasonably be considered inappropriate in a professional setting
+
+## Our Responsibilities
+
+Project maintainers are responsible for clarifying the standards of acceptable behavior and are expected to take appropriate and fair corrective action in response to any instances of unacceptable behavior.
+
+Project maintainers have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct, or to ban temporarily or permanently any contributor for other behaviors that they deem inappropriate, threatening, offensive, or harmful.
+
+## Scope
+
+This Code of Conduct applies both within project spaces and in public spaces when an individual is representing the project or its community. Examples of representing a project or community include using an official project e-mail address, posting via an official social media account, or acting as an appointed representative at an online or offline event. Representation of a project may be further defined and clarified by project maintainers.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be reported by contacting the project team at shreyasbharath@gmail.com. The project team will review and investigate all complaints, and will respond in a way that it deems appropriate to the circumstances. The project team is obligated to maintain confidentiality with regard to the reporter of an incident. Further details of specific enforcement policies may be posted separately.
+
+Project maintainers who do not follow or enforce the Code of Conduct in good faith may face temporary or permanent repercussions as determined by other members of the project's leadership.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4, available at [http://contributor-covenant.org/version/1/4][version]
+
+[homepage]: http://contributor-covenant.org
+[version]: http://contributor-covenant.org/version/1/4/

data/Gemfile

@@ -0,0 +1,7 @@
+# frozen_string_literal: true
+
+source 'https://rubygems.org'
+
+git_source(:github) { |repo_name| 'https://github.com/shreyasbharath/cpp_dependency_graph' }
+
+gemspec

data/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2018 Shreyas Balakrishna
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

data/README.md

@@ -0,0 +1,84 @@
+# Cpp Dependency Graph
+
+<!-- [![Gem Version] -->
+
+[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT) [![Build Status](https://travis-ci.org/shreyasbharath/cpp_dependency_graph.svg?branch=master)](https://travis-ci.org/shreyasbharath/cpp_dependency_graph) [![Maintainability](https://api.codeclimate.com/v1/badges/2a07b587ca6fc8b1b3db/maintainability)](https://codeclimate.com/github/shreyasbharath/cpp_dependency_graph/maintainability) [![Codacy](https://api.codacy.com/project/badge/Grade/9439dbb7fde44b5380401acba5325e62)](https://www.codacy.com/app/shreyasbharath/cpp_dependency_graph?utm_source=github.com&amp;utm_medium=referral&amp;utm_content=shreyasbharath/cpp_dependency_graph&amp;utm_campaign=Badge_Grade) [![Test Coverage](https://api.codeclimate.com/v1/badges/2a07b587ca6fc8b1b3db/test_coverage)](https://codeclimate.com/github/shreyasbharath/cpp_dependency_graph/test_coverage) [![Release](https://img.shields.io/github/release/shreyasbharath/cpp_dependency_graph.svg?maxAge=3600)](https://github.com/shreyasbharath/cpp_dependency_graph/releases)
+
+Generates useful component dependency visualisations (in `dot` or `d3.js`) to study the architecture of C/C++ projects.
+
+Why do all the other languages have awesome tools to analyse codebases but C/C++ codebases do not?
+
+It's time to change that.
+
+This tool aims to -
+
+- provide multiple views into the architecture of a codebase
+- generate views at multiple levels of the architecture
+
+## Inspiration
+
+This tool is inspired by a number of projects [rubrowser](http://www.emadelsaid.com/rubrowser/), [cpp-dependencies](https://github.com/tomtom-international/cpp-dependencies) and [objc-dependency-visualizer](https://github.com/PaulTaykalo/objc-dependency-visualizer).
+
+The pretty `d3` visualisations are directly copied from `objc-dependency-visualiser`.
+
+A huge shout out to the people behind these projects.
+
+## Usage
+
+### Installation
+
+`gem install cpp_dependency_graph`
+
+### Overall component dependency graph
+
+To generate the overall component depenency graph for a project, use it like so -
+
+`cpp_dependency_graph visualise -r spec\test\example_project\ -o deps.dot -f dot`
+
+Below is the overall `dot` and `d3` component dependency visualisations for [leveldb](https://github.com/google/leveldb)
+
+![Dot](examples/leveldb_overall.svg)
+
+![d3.js visualisation of leveldb](examples/leveldb_overall_d3.svg)
+
+![d3.js visualisation of rocksdb](examples/rocksdb_overall_d3.svg)
+
+**NOTE** - If your project has a large number of components (> 100 and lots of connections between them), then generation (and subsequent rendering) may take some time.
+
+### Individual component dependency graph
+
+This will highlight the dependencies coming in and going out of a specific component. This allows you to filter out extraneous detail and study individual components in more detail.
+
+`cpp_dependency_graph visualise -r spec\test\example_project\ -c Engine -o deps.dot -f dot`
+
+Here's a component dependency visualisation generated for the `queue` component in [rethinkdb](https://github.com/rethinkdb/rethinkdb)
+
+![Queue component dot visualisation](examples/rethinkdb_queue_component.svg)
+
+![Queue component d3 visualisation](examples/rethinkdb_queue_component_d3.svg)
+
+### Component include dependency graph
+
+This will highlight dependencies of includes within a specific component
+
+`cpp_dependency_graph visualise_includes -r spec\test\example_project\ -c Engine`
+
+Here's a component include dependency visualisation generated for the `queue` component in [rethinkdb](https://github.com/rethinkdb/rethinkdb)
+
+![Queue include graph dot](examples/rethinkdb_queue_include.svg)
+
+![Queue include graph d3](examples/rethinkdb_queue_include_d3.svg)
+
+## Development
+
+`bundle exec cpp_dependency_graph visualise -r <dir>`
+
+## License
+
+cpp_dependency_graph is available under the MIT license.
+
+## Warranty
+
+This software is provided "as is" and without any express or implied
+warranties, including, without limitation, the implied warranties of
+merchantability and fitness for a particular purpose.

data/Rakefile

@@ -0,0 +1,9 @@
+require 'bundler/gem_tasks'
+require 'rspec/core/rake_task'
+require 'rubocop/rake_task'
+
+RSpec::Core::RakeTask.new(:spec)
+
+# task default: spec
+
+RuboCop::RakeTask.new

data/TODO.md

@@ -0,0 +1,38 @@
+# TODO Items
+
+- [ ] Documentation
+  - [ ] Screencast of how to use tool on projects
+  - [ ] Create a github.io homepage
+  - [ ] Add a [CONTRIBUTING.md](https://github.com/nayafia/contributing-template/blob/master/CONTRIBUTING-template.md)
+  - [ ] Add interactive `html` or `svg` examples into README, is this possible?
+- [ ] Progress messages
+  - [ ] Progress bar?
+- [x] Allow user to specify a single component and the tool should print only that component
+- [x] Print out dependency graphs for all components by default if no single component is specified
+- [ ] Use a compiler to get the includes for a file rather than manually scanning the contents
+  - [ ] Manual scanning does not work when #includes are #ifdefed out for example
+  - [ ] <system> include vs "project" include (how will this work for third party sources that are not part of the codebase?)
+  - [ ] Work with any type of include relative includes ('blah.h') vs absolute includes ('/path/blah.h') vs relative with path includes ('blah/blah.h')
+- [ ] Parallelise dependency scanning as much as possible to get the best possible performance
+- [ ] Open up the graph automatically after generating an individual graph
+- [ ] Work with any sort of project structure
+  - [ ] Header only projects
+  - [x] source and header files for component in same directory
+  - [ ] source files in same directory but header files in a separate `inc` directory
+  - [x] source files in same directory but header files in a global `inc` directory (all project header files in one place)
+  - [ ] source files and header files don't have matching names (i.e. there's an `api.h` header file and various source files implement them)
+  - [ ] Try it out on various small/large C/C++ open source projects
+- [ ] Provide coupling/cohesion metrics, lookup metrics from Clean Architecture and [this](https://softwareengineering.stackexchange.com/questions/151004/are-there-metrics-for-cohesion-and-coupling)
+- [ ] Ignore list? Some components may not want to be seen
+- [ ] Use a yaml config file? A pain to pass a whole heap of arguments every time
+- [ ] Make the tool incremental? Only generate parts of the new graph if something has changed. Something to think about
+- [ ] Handling `duplicate` component names? Use a unique identifier (perhaps the path?)
+- [ ] Visualisation
+  - [ ] Highlight strongly coupled components (i.e. have lots of outgoing/incoming dependencies). How to visualise strongly coupled components?
+  - [ ] Interface vs implementation coupling (interface is worse!). Highlighting interface vs implementation coupling between components on graph?
+  - [ ] Look at using subgraphs of the dot/svg language to cluster component dependencies in the graph
+  - [ ] Create a d3 donut graph with relative sizes of components in project? This'll probably show which components need to be further split up (something like this https://blog.kathyreid.id.au/2016/12/29/linux-australia-expense-breakdown-a-data-visualisation-in-d3-js/)
+  - [ ] Node size - base it on how many source files (or lines of code) or how many connections going in/out of node?
+  - [ ] Provide a 'zoom' slider on the visualisation to zoom in/out of the view (high level dependencies to low-level dependencies)
+  - [ ] Visualise components matching user provided regex only
+  - [ ] 3D visualisation using something like https://github.com/ggeoffrey/cljs-gravity

data/bin/console

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+
+require 'bundler/setup'
+require 'cpp_dependency_graph'
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+# (If you use this, don't forget to add pry to your Gemfile!)
+# require "pry"
+# Pry.start
+
+require 'irb'
+IRB.start(__FILE__)

data/bin/setup

@@ -0,0 +1,8 @@
+#!/usr/bin/env bash
+set -euo pipefail
+IFS=$'\n\t'
+set -vx
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/cpp_dependency_graph.gemspec

@@ -0,0 +1,44 @@
+# frozen_string_literal: true
+
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+
+require 'cpp_dependency_graph/version'
+
+Gem::Specification.new do |s|
+  s.name = 'cpp_dependency_graph'
+  s.version = CppDependencyGraph::VERSION
+  s.authors = ['Shreyas Balakrishna']
+  s.email = ['shreyasbharath@users.noreply.github.com>']
+  s.summary = <<-SUMMARY
+  CppDependencyGraph is a program that generates dependency visualisations (dot, d3.js) to study the architecture of C/C++ projects
+  SUMMARY
+  s.description = <<-DESCRIPTION
+  Generates interactive dependency visualisations (dot, d3.js) to study the architecture of C/C++ projects in detail
+  DESCRIPTION
+  s.homepage = 'https://github.com/shreyasbharath/cpp_dependency_graph'
+  s.licenses = ['MIT']
+
+  s.files = %x[git ls-files -z].split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) } -
+            %w[.rubocop.yml .travis.yml appveyor.yml]
+  s.bindir = 'exe'
+  s.executables = s.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  s.require_paths = ['lib']
+
+  s.required_ruby_version = Gem::Requirement.new('>= 2.4.0')
+  s.rubygems_version = '2.7.6'
+
+  s.add_runtime_dependency 'docopt', '~> 0.6'
+  s.add_runtime_dependency 'graphviz', '~> 1.0'
+  s.add_runtime_dependency 'json', '~> 2.1'
+  s.add_runtime_dependency 'parallel', '~> 1.12'
+
+  s.add_development_dependency 'bundler', '~> 1.16'
+  s.add_development_dependency 'coveralls', '~> 0.8'
+  s.add_development_dependency 'debase', '~> 0.2'
+  s.add_development_dependency 'rake', '~> 12.3'
+  s.add_development_dependency 'rspec', '~> 3.7'
+  s.add_development_dependency 'rubocop', '~> 0.54'
+  s.add_development_dependency 'ruby-prof', '~> 0.17'
+  s.add_development_dependency 'ruby-debug-ide', '~> 0.6'
+end

data/examples/leveldb_overall.svg

@@ -0,0 +1,215 @@
+<?xml version="1.0" encoding="UTF-8" standalone="no"?>
+<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
+ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
+<!-- Generated by graphviz version 2.38.0 (20140413.2041)
+ -->
+<!-- Title: dependency_graph Pages: 1 -->
+<svg width="389pt" height="476pt"
+ viewBox="0.00 0.00 389.18 476.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 472)">
+<title>dependency_graph</title>
+<polygon fill="white" stroke="none" points="-4,4 -4,-472 385.182,-472 385.182,4 -4,4"/>
+<!-- db -->
+<g id="node1" class="node"><title>db</title>
+<polygon fill="none" stroke="black" points="165,-396 115,-396 111,-392 111,-360 161,-360 165,-364 165,-396"/>
+<polyline fill="none" stroke="black" points="161,-392 111,-392 "/>
+<polyline fill="none" stroke="black" points="161,-392 161,-360 "/>
+<polyline fill="none" stroke="black" points="161,-392 165,-396 "/>
+<text text-anchor="middle" x="138" y="-374.3" font-family="Times New Roman,serif" font-size="14.00">db</text>
+</g>
+<!-- util -->
+<g id="node2" class="node"><title>util</title>
+<polygon fill="none" stroke="black" points="328,-324 278,-324 274,-320 274,-288 324,-288 328,-292 328,-324"/>
+<polyline fill="none" stroke="black" points="324,-320 274,-320 "/>
+<polyline fill="none" stroke="black" points="324,-320 324,-288 "/>
+<polyline fill="none" stroke="black" points="324,-320 328,-324 "/>
+<text text-anchor="middle" x="301" y="-302.3" font-family="Times New Roman,serif" font-size="14.00">util</text>
+</g>
+<!-- db&#45;&gt;util -->
+<g id="edge1" class="edge"><title>db&#45;&gt;util</title>
+<path fill="none" stroke="black" d="M165.283,-365.284C192.515,-353.589 234.527,-335.547 264.592,-322.635"/>
+<polygon fill="black" stroke="black" points="266.093,-325.8 273.9,-318.638 263.331,-319.368 266.093,-325.8"/>
+</g>
+<!-- leveldb -->
+<g id="node3" class="node"><title>leveldb</title>
+<polygon fill="none" stroke="black" points="221,-252 169,-252 165,-248 165,-216 217,-216 221,-220 221,-252"/>
+<polyline fill="none" stroke="black" points="217,-248 165,-248 "/>
+<polyline fill="none" stroke="black" points="217,-248 217,-216 "/>
+<polyline fill="none" stroke="black" points="217,-248 221,-252 "/>
+<text text-anchor="middle" x="193" y="-230.3" font-family="Times New Roman,serif" font-size="14.00">leveldb</text>
+</g>
+<!-- db&#45;&gt;leveldb -->
+<g id="edge2" class="edge"><title>db&#45;&gt;leveldb</title>
+<path fill="none" stroke="black" d="M144.634,-359.871C154.091,-335.457 171.532,-290.426 182.684,-261.635"/>
+<polygon fill="black" stroke="black" points="185.994,-262.778 186.342,-252.189 179.467,-260.25 185.994,-262.778"/>
+</g>
+<!-- table -->
+<g id="node4" class="node"><title>table</title>
+<polygon fill="none" stroke="black" points="220,-180 170,-180 166,-176 166,-144 216,-144 220,-148 220,-180"/>
+<polyline fill="none" stroke="black" points="216,-176 166,-176 "/>
+<polyline fill="none" stroke="black" points="216,-176 216,-144 "/>
+<polyline fill="none" stroke="black" points="216,-176 220,-180 "/>
+<text text-anchor="middle" x="193" y="-158.3" font-family="Times New Roman,serif" font-size="14.00">table</text>
+</g>
+<!-- db&#45;&gt;table -->
+<g id="edge3" class="edge"><title>db&#45;&gt;table</title>
+<path fill="none" stroke="red" d="M131.823,-359.91C127.377,-329.791 128.254,-265.742 147,-216 150.68,-206.234 156.57,-196.569 163.009,-188.221"/>
+<polygon fill="red" stroke="red" points="165.851,-190.277 169.57,-180.356 160.476,-185.793 165.851,-190.277"/>
+</g>
+<!-- port -->
+<g id="node5" class="node"><title>port</title>
+<polygon fill="none" stroke="black" points="275,-108 225,-108 221,-104 221,-72 271,-72 275,-76 275,-108"/>
+<polyline fill="none" stroke="black" points="271,-104 221,-104 "/>
+<polyline fill="none" stroke="black" points="271,-104 271,-72 "/>
+<polyline fill="none" stroke="black" points="271,-104 275,-108 "/>
+<text text-anchor="middle" x="248" y="-86.3" font-family="Times New Roman,serif" font-size="14.00">port</text>
+</g>
+<!-- db&#45;&gt;port -->
+<g id="edge4" class="edge"><title>db&#45;&gt;port</title>
+<path fill="none" stroke="black" d="M133.97,-359.811C125.294,-318.32 109.282,-211.163 157,-144 170.226,-125.385 192.207,-112.318 211.252,-103.817"/>
+<polygon fill="black" stroke="black" points="212.732,-106.992 220.598,-99.8943 210.022,-100.537 212.732,-106.992"/>
+</g>
+<!-- win -->
+<g id="node6" class="node"><title>win</title>
+<polygon fill="none" stroke="black" points="275,-36 225,-36 221,-32 221,-0 271,-0 275,-4 275,-36"/>
+<polyline fill="none" stroke="black" points="271,-32 221,-32 "/>
+<polyline fill="none" stroke="black" points="271,-32 271,-0 "/>
+<polyline fill="none" stroke="black" points="271,-32 275,-36 "/>
+<text text-anchor="middle" x="248" y="-14.3" font-family="Times New Roman,serif" font-size="14.00">win</text>
+</g>
+<!-- db&#45;&gt;win -->
+<g id="edge5" class="edge"><title>db&#45;&gt;win</title>
+<path fill="none" stroke="black" d="M114.807,-359.613C85.2656,-335.285 38,-288.068 38,-235 38,-235 38,-235 38,-161 38,-78.4157 150.827,-40.6055 211.079,-26.3018"/>
+<polygon fill="black" stroke="black" points="212.001,-29.6816 220.976,-24.0513 210.449,-22.8558 212.001,-29.6816"/>
+</g>
+<!-- util&#45;&gt;leveldb -->
+<g id="edge26" class="edge"><title>util&#45;&gt;leveldb</title>
+<path fill="none" stroke="red" d="M273.878,-291.003C258.075,-281.577 238.269,-268.926 222.15,-258.033"/>
+<polygon fill="red" stroke="red" points="223.852,-254.956 213.623,-252.194 219.897,-260.732 223.852,-254.956"/>
+</g>
+<!-- util&#45;&gt;port -->
+<g id="edge25" class="edge"><title>util&#45;&gt;port</title>
+<path fill="none" stroke="red" d="M292.875,-287.849C280.144,-250.753 258.099,-162.81 250.039,-118.103"/>
+<polygon fill="red" stroke="red" points="253.49,-117.515 248.383,-108.232 246.586,-118.674 253.49,-117.515"/>
+</g>
+<!-- util&#45;&gt;win -->
+<g id="edge24" class="edge"><title>util&#45;&gt;win</title>
+<path fill="none" stroke="black" d="M305.324,-287.97C314.524,-248.151 332.657,-146.682 300,-72 295.247,-61.1295 287.19,-51.2247 278.819,-42.9964"/>
+<polygon fill="black" stroke="black" points="281.184,-40.416 271.457,-36.2148 276.441,-45.5644 281.184,-40.416"/>
+</g>
+<!-- leveldb&#45;&gt;util -->
+<g id="edge13" class="edge"><title>leveldb&#45;&gt;util</title>
+<path fill="none" stroke="red" d="M221.1,-249.582C236.819,-258.991 256.266,-271.428 272.099,-282.136"/>
+<polygon fill="red" stroke="red" points="270.25,-285.111 280.477,-287.876 274.206,-279.337 270.25,-285.111"/>
+</g>
+<!-- leveldb&#45;&gt;table -->
+<g id="edge12" class="edge"><title>leveldb&#45;&gt;table</title>
+<path fill="none" stroke="red" d="M187.084,-215.697C186.289,-207.983 186.062,-198.712 186.405,-190.112"/>
+<polygon fill="red" stroke="red" points="189.898,-190.324 187.105,-180.104 182.915,-189.836 189.898,-190.324"/>
+</g>
+<!-- leveldb&#45;&gt;win -->
+<g id="edge11" class="edge"><title>leveldb&#45;&gt;win</title>
+<path fill="none" stroke="black" d="M211.348,-215.638C233.544,-193.239 269.712,-151.903 284,-108 288.952,-92.7855 288.703,-87.2933 284,-72 280.991,-62.2153 275.493,-52.6161 269.684,-44.3336"/>
+<polygon fill="black" stroke="black" points="272.407,-42.1306 263.61,-36.2264 266.805,-46.3279 272.407,-42.1306"/>
+</g>
+<!-- table&#45;&gt;db -->
+<g id="edge23" class="edge"><title>table&#45;&gt;db</title>
+<path fill="none" stroke="red" d="M185.524,-180.356C178.741,-190.137 169.907,-202.979 165,-216 148.158,-260.69 145.739,-316.929 143.393,-349.734"/>
+<polygon fill="red" stroke="red" points="139.888,-349.663 142.58,-359.91 146.866,-350.221 139.888,-349.663"/>
+</g>
+<!-- table&#45;&gt;util -->
+<g id="edge21" class="edge"><title>table&#45;&gt;util</title>
+<path fill="none" stroke="black" d="M206.074,-180.189C224.912,-204.958 259.82,-250.856 281.65,-279.558"/>
+<polygon fill="black" stroke="black" points="279.133,-282.031 287.973,-287.871 284.705,-277.793 279.133,-282.031"/>
+</g>
+<!-- table&#45;&gt;leveldb -->
+<g id="edge20" class="edge"><title>table&#45;&gt;leveldb</title>
+<path fill="none" stroke="red" d="M198.895,-180.104C199.701,-187.791 199.937,-197.054 199.604,-205.665"/>
+<polygon fill="red" stroke="red" points="196.109,-205.48 198.916,-215.697 203.092,-205.96 196.109,-205.48"/>
+</g>
+<!-- table&#45;&gt;port -->
+<g id="edge22" class="edge"><title>table&#45;&gt;port</title>
+<path fill="none" stroke="black" d="M206.596,-143.697C213.123,-135.389 221.068,-125.277 228.247,-116.141"/>
+<polygon fill="black" stroke="black" points="231.135,-118.13 234.561,-108.104 225.631,-113.805 231.135,-118.13"/>
+</g>
+<!-- table&#45;&gt;win -->
+<g id="edge19" class="edge"><title>table&#45;&gt;win</title>
+<path fill="none" stroke="black" d="M194.697,-143.674C196.95,-125.29 201.888,-95.6852 212,-72 216.084,-62.4333 221.988,-52.7836 227.838,-44.3881"/>
+<polygon fill="black" stroke="black" points="230.78,-46.2938 233.835,-36.1492 225.12,-42.1741 230.78,-46.2938"/>
+</g>
+<!-- port&#45;&gt;util -->
+<g id="edge18" class="edge"><title>port&#45;&gt;util</title>
+<path fill="none" stroke="red" d="M256.153,-108.232C268.871,-145.324 290.847,-232.981 298.927,-277.712"/>
+<polygon fill="red" stroke="red" points="295.522,-278.567 300.63,-287.849 302.425,-277.408 295.522,-278.567"/>
+</g>
+<!-- port&#45;&gt;win -->
+<g id="edge17" class="edge"><title>port&#45;&gt;win</title>
+<path fill="none" stroke="black" d="M248,-71.6966C248,-63.9827 248,-54.7125 248,-46.1124"/>
+<polygon fill="black" stroke="black" points="251.5,-46.1043 248,-36.1043 244.5,-46.1044 251.5,-46.1043"/>
+</g>
+<!-- bench -->
+<g id="node7" class="node"><title>bench</title>
+<polygon fill="none" stroke="black" points="366,-396 316,-396 312,-392 312,-360 362,-360 366,-364 366,-396"/>
+<polyline fill="none" stroke="black" points="362,-392 312,-392 "/>
+<polyline fill="none" stroke="black" points="362,-392 362,-360 "/>
+<polyline fill="none" stroke="black" points="362,-392 366,-396 "/>
+<text text-anchor="middle" x="339" y="-374.3" font-family="Times New Roman,serif" font-size="14.00">bench</text>
+</g>
+<!-- bench&#45;&gt;util -->
+<g id="edge6" class="edge"><title>bench&#45;&gt;util</title>
+<path fill="none" stroke="black" d="M329.607,-359.697C325.235,-351.644 319.943,-341.894 315.105,-332.982"/>
+<polygon fill="black" stroke="black" points="318.132,-331.223 310.285,-324.104 311.98,-334.563 318.132,-331.223"/>
+</g>
+<!-- memenv -->
+<g id="node8" class="node"><title>memenv</title>
+<polygon fill="none" stroke="black" points="184.5,-468 125.5,-468 121.5,-464 121.5,-432 180.5,-432 184.5,-436 184.5,-468"/>
+<polyline fill="none" stroke="black" points="180.5,-464 121.5,-464 "/>
+<polyline fill="none" stroke="black" points="180.5,-464 180.5,-432 "/>
+<polyline fill="none" stroke="black" points="180.5,-464 184.5,-468 "/>
+<text text-anchor="middle" x="153" y="-446.3" font-family="Times New Roman,serif" font-size="14.00">memenv</text>
+</g>
+<!-- memenv&#45;&gt;db -->
+<g id="edge10" class="edge"><title>memenv&#45;&gt;db</title>
+<path fill="none" stroke="black" d="M149.292,-431.697C147.639,-423.983 145.653,-414.712 143.81,-406.112"/>
+<polygon fill="black" stroke="black" points="147.183,-405.149 141.665,-396.104 140.338,-406.616 147.183,-405.149"/>
+</g>
+<!-- memenv&#45;&gt;util -->
+<g id="edge8" class="edge"><title>memenv&#45;&gt;util</title>
+<path fill="none" stroke="black" d="M177.534,-431.915C191.14,-422.014 208.073,-408.972 222,-396 243.501,-375.973 265.494,-350.73 280.797,-332.247"/>
+<polygon fill="black" stroke="black" points="283.699,-334.227 287.331,-324.274 278.285,-329.79 283.699,-334.227"/>
+</g>
+<!-- memenv&#45;&gt;leveldb -->
+<g id="edge7" class="edge"><title>memenv&#45;&gt;leveldb</title>
+<path fill="none" stroke="black" d="M161.174,-431.712C165.648,-421.533 170.898,-408.283 174,-396 185.64,-349.908 190.191,-294.551 191.941,-262.22"/>
+<polygon fill="black" stroke="black" points="195.439,-262.344 192.433,-252.185 188.447,-262.001 195.439,-262.344"/>
+</g>
+<!-- memenv&#45;&gt;port -->
+<g id="edge9" class="edge"><title>memenv&#45;&gt;port</title>
+<path fill="none" stroke="black" d="M121.298,-436.467C76.4837,-416.419 0,-372.594 0,-307 0,-307 0,-307 0,-233 0,-136.966 141.781,-104.975 210.94,-95.0824"/>
+<polygon fill="black" stroke="black" points="211.545,-98.5327 220.988,-93.728 210.61,-91.5954 211.545,-98.5327"/>
+</g>
+<!-- issues -->
+<g id="node9" class="node"><title>issues</title>
+<polygon fill="none" stroke="black" points="273,-468 223,-468 219,-464 219,-432 269,-432 273,-436 273,-468"/>
+<polyline fill="none" stroke="black" points="269,-464 219,-464 "/>
+<polyline fill="none" stroke="black" points="269,-464 269,-432 "/>
+<polyline fill="none" stroke="black" points="269,-464 273,-468 "/>
+<text text-anchor="middle" x="246" y="-446.3" font-family="Times New Roman,serif" font-size="14.00">issues</text>
+</g>
+<!-- issues&#45;&gt;db -->
+<g id="edge15" class="edge"><title>issues&#45;&gt;db</title>
+<path fill="none" stroke="black" d="M219.58,-431.876C205.59,-422.808 188.224,-411.552 173.114,-401.759"/>
+<polygon fill="black" stroke="black" points="174.817,-398.692 164.521,-396.19 171.009,-404.566 174.817,-398.692"/>
+</g>
+<!-- issues&#45;&gt;util -->
+<g id="edge16" class="edge"><title>issues&#45;&gt;util</title>
+<path fill="none" stroke="black" d="M273.222,-446.495C303.874,-442.055 352.353,-429.789 375,-396 383.908,-382.709 382.312,-374.231 375,-360 366.866,-344.17 351.567,-332.01 336.981,-323.356"/>
+<polygon fill="black" stroke="black" points="338.506,-320.199 328.061,-318.418 335.115,-326.324 338.506,-320.199"/>
+</g>
+<!-- issues&#45;&gt;leveldb -->
+<g id="edge14" class="edge"><title>issues&#45;&gt;leveldb</title>
+<path fill="none" stroke="black" d="M241.752,-431.849C232.565,-394.753 210.785,-306.81 199.712,-262.103"/>
+<polygon fill="black" stroke="black" points="203.069,-261.098 197.268,-252.232 196.275,-262.781 203.069,-261.098"/>
+</g>
+</g>
+</svg>