├── assets ├── img-color.jpg ├── styles.css └── loading.css ├── client ├── components │ ├── textInfo.jsx │ ├── wrapper.jsx │ ├── loading.jsx │ ├── lineGraph.jsx │ └── barGraph.jsx ├── index.js └── App.jsx ├── server ├── controllers │ ├── cdp data samples │ │ ├── Runtime.getHeapUsage.json │ │ ├── HeapProfiler.getObjectByHeapObjectId.json │ │ ├── HeapProfiler.takeHeapSnapshot.json │ │ └── Runtime.getProperties.json │ ├── scriptController.js │ └── heapController.js ├── userscripts.js ├── runScript.js ├── models │ └── models.js └── createScript.js ├── index.html ├── webpack.config.js ├── README.md ├── package.json └── LICENSE /assets/img-color.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/oslabs-beta/kondo/HEAD/assets/img-color.jpg -------------------------------------------------------------------------------- /client/components/textInfo.jsx: -------------------------------------------------------------------------------- 1 | import React from 'react'; 2 | 3 | export default TextInfo; 4 | -------------------------------------------------------------------------------- /server/controllers/cdp data samples/Runtime.getHeapUsage.json: -------------------------------------------------------------------------------- 1 | { "usedSize": 2572184, "totalSize": 5017600 } 2 | -------------------------------------------------------------------------------- /server/userscripts.js: -------------------------------------------------------------------------------- 1 | 2 | exports.start = { 3 | url: 'http://localhost:8080', 4 | func: async (page) => { 5 | await page.waitForSelector('body > #leak-button'); await page.click('body > #leak-button'); 6 | } 7 | } 8 | 9 | -------------------------------------------------------------------------------- /server/controllers/cdp data samples/HeapProfiler.getObjectByHeapObjectId.json: -------------------------------------------------------------------------------- 1 | { 2 | "result": { 3 | "type": "object", 4 | "subtype": "array", 5 | "className": "Array", 6 | "description": "Array(27)", 7 | "objectId": "{"injectedScriptId":3,"id":48}" 8 | } 9 | } 10 | -------------------------------------------------------------------------------- /client/index.js: -------------------------------------------------------------------------------- 1 | import React from 'react'; 2 | import { render } from 'react-dom'; 3 | import { BrowserRouter } from 'react-router-dom'; 4 | import App from './App'; 5 | 6 | render( 7 | 8 | 9 | , 10 | document.getElementById('app'), 11 | ); 12 | -------------------------------------------------------------------------------- /assets/styles.css: -------------------------------------------------------------------------------- 1 | #wrapper { 2 | width: 100%; 3 | height: 100%; 4 | display: inline-block; 5 | text-align: center; 6 | } 7 | 8 | .lineGraph { 9 | width: 40%; 10 | display: inline-block; 11 | margin-right: 10px; 12 | } 13 | 14 | .barGraph { 15 | width: 40%; 16 | display: inline-block; 17 | margin-left: 10px; 18 | } 19 | 20 | .modal-content { 21 | display: inline-block; 22 | width: 50%; 23 | height: 550px; 24 | overflow: scroll; 25 | } 26 | -------------------------------------------------------------------------------- /client/components/wrapper.jsx: -------------------------------------------------------------------------------- 1 | import React from 'react'; 2 | import LineGraph from './lineGraph'; 3 | import BarGraph from './barGraph'; 4 | 5 | //props are being drilled from App.jsx 6 | const Wrapper = props => { 7 | return ( 8 |
9 |

Heap Analysis

10 | 15 | 20 |
21 | ); 22 | }; 23 | export default Wrapper; 24 | -------------------------------------------------------------------------------- /assets/loading.css: -------------------------------------------------------------------------------- 1 | h1 { 2 | text-align: center; 3 | color: rgb(0, 0, 0); 4 | } 5 | 6 | h2 { 7 | text-align: center; 8 | color: rgba(255, 255, 255, 0.5); 9 | } 10 | 11 | body { 12 | width: 100%; 13 | height: 100vh; 14 | background: url(img-color.jpg) no-repeat center; 15 | background-size: cover; 16 | } 17 | 18 | .ml9 { 19 | position: relative; 20 | font-weight: 200; 21 | font-size: 4em; 22 | } 23 | 24 | .ml9 .text-wrapper { 25 | position: relative; 26 | display: inline-block; 27 | padding-top: 0.2em; 28 | padding-right: 0.05em; 29 | padding-bottom: 0.1em; 30 | overflow: hidden; 31 | } 32 | 33 | .ml9 .letter { 34 | transform-origin: 50% 100%; 35 | display: inline-block; 36 | line-height: 1em; 37 | } 38 | -------------------------------------------------------------------------------- /index.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 16 | 17 | 18 | 19 | Kondo 20 | 21 | 22 | 23 |
24 | 25 | 26 | -------------------------------------------------------------------------------- /server/runScript.js: -------------------------------------------------------------------------------- 1 | const express = require('express'); 2 | const path = require('path'); 3 | const scriptController = require('./controllers/scriptController'); 4 | const heapController = require('./controllers/heapController'); 5 | const app = express(); 6 | const PORT = 8000; 7 | 8 | // *** ERROR HANDLING *** // 9 | function logErrors(err, req, res, next) { 10 | const defaultErr = { 11 | log: 'Express error handler caught unknown middleware error', 12 | status: 400, 13 | message: { err: 'An error occurred' }, 14 | }; 15 | const errorObj = Object.assign({}, defaultErr); 16 | console.log(errorObj.log); 17 | res.status(errorObj.status).json(errorObj.message); 18 | } 19 | 20 | // *** SERVER ROUTES *** // 21 | app.use(express.json()); 22 | 23 | app.use('/assets', express.static(path.join(__dirname, '../assets'))); 24 | 25 | app.get('/data', heapController.getData, (req, res) => { 26 | res.json(res.locals); 27 | process.exit(0); 28 | }); 29 | 30 | app.get('/*', (req, res) => { 31 | res.sendFile(path.join(__dirname, '../index.html')); 32 | }); 33 | 34 | app.listen(PORT, () => { 35 | console.log(`Kondo is listening on port ${PORT}`); 36 | }); 37 | // app.post; 38 | -------------------------------------------------------------------------------- /webpack.config.js: -------------------------------------------------------------------------------- 1 | const webpack = require('webpack'); 2 | const path = require('path'); 3 | 4 | module.exports = { 5 | entry: ['./client/index.js'], 6 | output: { 7 | path: path.join(__dirname, './assets'), 8 | publicPath: '/', 9 | filename: 'bundle.js', 10 | }, 11 | mode: process.env.NODE_ENV, 12 | devServer: { 13 | publicPath: '/assets/', 14 | proxy: { 15 | '/': 'http://localhost:8000', 16 | }, 17 | }, 18 | module: { 19 | rules: [ 20 | { 21 | test: /\.js.*/, 22 | exclude: /node_modules/, 23 | use: { 24 | loader: 'babel-loader', 25 | options: { 26 | presets: [ 27 | [ 28 | '@babel/preset-env', 29 | { 30 | targets: { 31 | node: '10', 32 | }, 33 | }, 34 | ], 35 | '@babel/preset-react', 36 | ], 37 | plugins: ['@babel/plugin-proposal-class-properties'], 38 | }, 39 | }, 40 | resolve: { 41 | extensions: ['.js', '.jsx', '.json'], 42 | }, 43 | }, 44 | { 45 | test: /\.(s*)css$/, 46 | exclude: /node_modules/, 47 | use: ['style-loader', 'css-loader', 'sass-loader'], 48 | }, 49 | { 50 | test: /\.(png|jpe?g|gif)$/i, 51 | loader: 'file-loader', 52 | options: { 53 | outputPath: 'images', 54 | }, 55 | }, 56 | ], 57 | }, 58 | }; 59 | -------------------------------------------------------------------------------- /server/models/models.js: -------------------------------------------------------------------------------- 1 | const mongoose = require("mongoose"); 2 | const dotenv = require("dotenv").config(); 3 | const Schema = mongoose.Schema; 4 | const kondoURI = `mongodb+srv://${process.env.PASSWORD}@cluster0-donuw.mongodb.net/test?retryWrites=true&w=majority`; 5 | 6 | const myURI = process.env.MONGO_URI || kondoURI; 7 | 8 | mongoose 9 | .connect(myURI, { 10 | useNewUrlParser: true, 11 | useUnifiedTopology: true, 12 | dbName: "kondo", 13 | }) 14 | .then(() => { 15 | console.log("connected to kondo database"); 16 | }) 17 | .catch((err) => { 18 | console.log(err); 19 | }); 20 | 21 | /** FOR FUTURE USE, ONCE AUTHENTICATION MEASURES HAVE BEEN IMPLEMENTED */ 22 | 23 | // const usersSchema = new Schema({ 24 | // username: String, 25 | // password: String, 26 | // //sites: ARRAY of Objects 27 | // }); 28 | 29 | // const Users = mongoose.model("users", usersSchema); 30 | 31 | /* SITES SCHEMA */ 32 | const sitesSchema = new Schema({ 33 | url: String, 34 | siteName: String, 35 | scripts: [String], 36 | runs: [{ type: Schema.Types.ObjectId, ref: "Runs" }], 37 | }); 38 | 39 | const Sites = mongoose.model("Sites", sitesSchema); 40 | 41 | /* RUNS SCHEMA */ 42 | const runsSchema = new Schema({ 43 | heapUsageOverTime: Object, 44 | memoryLeaks: Object, 45 | }); 46 | 47 | const Runs = mongoose.model("Runs", runsSchema); 48 | 49 | /* SCRIPTS SCHEMA -- NOT CURRENTLY IN USE */ 50 | const scriptsSchema = new Schema({ 51 | name: String, 52 | script: String 53 | }); 54 | 55 | const Scripts = mongoose.model("Scripts", scriptsSchema); 56 | 57 | module.exports = { Sites, Runs, Scripts }; 58 | -------------------------------------------------------------------------------- /client/components/loading.jsx: -------------------------------------------------------------------------------- 1 | import React, { useState, useEffect } from 'react'; 2 | import { Redirect } from 'react-router-dom'; 3 | 4 | const Loading = props => { 5 | const [analysisComplete, setLoadingStatus] = useState(false); 6 | const [statusMessage, updateStatus] = useState('Loading...'); 7 | 8 | useEffect(() => { 9 | if (!analysisComplete) { 10 | $('body').ripples({ resolution: 256, refraction: 10, dropRadius: 60 }); 11 | 12 | anime 13 | .timeline({ loop: true }) 14 | .add({ 15 | targets: '.ml9 .letter', 16 | scale: [0, 1], 17 | duration: 1500, 18 | elasticity: 600, 19 | delay: (el, i) => 45 * (i + 1), 20 | }) 21 | .add({ 22 | targets: '.ml9', 23 | opacity: 0, 24 | duration: 1000, 25 | easing: 'easeOutExpo', 26 | delay: 1000, 27 | }); 28 | } 29 | fetch('/data') 30 | .then(res => res.json()) 31 | .then(data => { 32 | props.updateState(data); 33 | $('body').ripples('hide'); 34 | document.body.style.backgroundImage = 'none'; 35 | setLoadingStatus(true); 36 | }); 37 | }); 38 | 39 | if (analysisComplete) { 40 | console.log('redirecting'); 41 | return ; 42 | } 43 | 44 | let status = statusMessage.split(''); 45 | status = status.map(letter => { 46 | return {letter}; 47 | }); 48 | 49 | return ( 50 |
51 |

52 | {status} 53 |

54 |
55 | ); 56 | }; 57 | 58 | export default Loading; 59 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # kondo (BETA) 2 | 3 | Identify potential memory leaks in your Javascript applications. 4 | 5 | View useful memory metrics and changes over time. 6 | 7 | Save all of your browser actions and state changes so you only have to do them once. 8 | 9 | ## Getting Started 10 | 11 | Install our npm package 12 | 13 | `npm install kondo` 14 | 15 | To create a script to be reproduced within Puppeteer and analyzed for memory leaks, run: 16 | 17 | `npm run record ` 18 | 19 | This will load your site into a browser with a customized version of the Puppeteer Recorder Chrome extension (https://github.com/checkly/puppeteer-recorder). 20 | Click on the extension and press 'Start' to begin recording. 21 | Begin toggling visual states and performing any actions within your site that don't trigger a reload of the page. 22 | Press 'Stop' in the extension when finished to end recording and store a Puppeteer script to your local userscripts.js file automatically. 23 | 24 | To run an existing script and analyze your page for memory leaks, run: 25 | 26 | `npm run script ` 27 | 28 | Open http://localhost:8000 to view your results. It can take 30-60 seconds to finish loading. 29 | 30 | ## Built with: 31 | 32 | * [React](https://reactjs.org/) 33 | * [Node](https://nodejs.org/) 34 | * [Express](https://expressjs.com/) 35 | * [Chart.js](https://www.chartjs.org/) 36 | * [Puppeteer](https://developers.google.com/web/tools/puppeteer) 37 | 38 | ## Contributors: 39 | 40 | * **Dakota Gilbreath** - [GitHub](https://github.com/dgilbrea92) 41 | * **Yena Choi** - [GitHub](http://github.com/cychoi00) 42 | * **Andie Ritter** - [GitHub](https://github.com/andieritter) 43 | * **Ashley Austin** - [GitHub](https://github.com/mraustin2u) 44 | * **Elizabeth Soto** - [GitHub](https://github.com/elizabeth87) 45 | 46 | -------------------------------------------------------------------------------- /server/controllers/cdp data samples/HeapProfiler.takeHeapSnapshot.json: -------------------------------------------------------------------------------- 1 | // When parsed with heap-snapshot parser, HeapProfiler.takeHeapSnapshot returns an array of nodes - 2 | // below is an example of a single node that would be returned in the array 3 | 4 | [ 5 | Node { 6 | type: 'synthetic', 7 | name: '(Internalized strings)', 8 | id: 5, 9 | self_size: 0, 10 | edge_count: 1, 11 | trace_node_id: 0, 12 | references: [ 13 | Edge { 14 | type: 'internal', 15 | name_or_index: '1', 16 | name: '1', 17 | toNodeIndex: 6209, 18 | toNode: Node { 19 | type: 'array', 20 | name: '', 21 | id: 53251, 22 | self_size: 65556, 23 | edge_count: 6673, 24 | trace_node_id: 0, 25 | references: [Array], 26 | referrers: [Array] 27 | }, 28 | fromNode: Node { 29 | type: 'synthetic', 30 | name: '(Internalized strings)', 31 | id: 5, 32 | self_size: 0, 33 | edge_count: 1, 34 | trace_node_id: 0, 35 | references: [Circular], 36 | referrers: [Array] 37 | } 38 | } 39 | ], 40 | referrers: [ 41 | Edge { 42 | type: 'element', 43 | name_or_index: '', 44 | name: '', 45 | toNodeIndex: 2, 46 | toNode: Node { 47 | type: 'synthetic', 48 | name: '(Internalized strings)', 49 | id: 5, 50 | self_size: 0, 51 | edge_count: 1, 52 | trace_node_id: 0, 53 | references: [Array], 54 | referrers: [Circular] 55 | }, 56 | fromNode: Node { 57 | type: 'synthetic', 58 | name: '(GC roots)', 59 | id: 3, 60 | self_size: 0, 61 | edge_count: 23, 62 | trace_node_id: 0, 63 | references: [Array], 64 | referrers: [Array] 65 | } 66 | } 67 | ] 68 | } 69 | ] -------------------------------------------------------------------------------- /server/controllers/scriptController.js: -------------------------------------------------------------------------------- 1 | const fs = require("fs"); 2 | const path = require("path"); 3 | const scriptName = process.argv[2]; 4 | const inputURL = process.argv[3]; 5 | // const { Runs, Scripts } = require("../models/models"); 6 | 7 | const trimScript = (input) => { 8 | // remove first two lines containing URL and viewport info, replace blank lines with semicolons 9 | let newString = input.slice(input.indexOf(`}`) + 3).replace(/\)\n/g, ");"); 10 | // build an object containing the url and sanitized puppeteer script 11 | return `exports.${scriptName} = { 12 | url: '${inputURL}', 13 | func: async (page) => {${newString} } 14 | } 15 | 16 | `; 17 | }; 18 | 19 | const scriptController = {}; 20 | 21 | /* MIDDLEWARE TO WRITE NEW SCRIPTS TO DB -- 22 | for future implementation to migrate to db instead of storing new scripts in userscripts.js 23 | */ 24 | // scriptController.postScript = (req, res, next) => { 25 | // Scripts.create( 26 | // { 27 | // name: scriptName, 28 | // script: `${req.body.code}`, 29 | // }, 30 | // (err, scriptData) => { 31 | // if (err) return next(err); 32 | // console.log( 33 | // `Saved successfully! You can run this test by entering "npm -- run ${scriptName}"` 34 | // ); 35 | // return next(); 36 | // } 37 | // ) 38 | // } 39 | 40 | /* MIDDLEWARE TO WRITE NEW SCRIPT TO USERSCRIPTS.JS */ 41 | scriptController.storeScript = (req, res, next) => { 42 | // call helper function to process and return new script string 43 | let newScript = trimScript(req.body.code); 44 | // add the object locally to the userscripts file 45 | fs.appendFile( 46 | path.join(__dirname, "../userscripts.js"), 47 | newScript, 48 | "utf-8", 49 | function (err) { 50 | if (err) next(err); 51 | console.log( 52 | `Saved successfully! You can run this test by entering "npm run script ${scriptName}"` 53 | ); 54 | next(); 55 | } 56 | ); 57 | }; 58 | 59 | module.exports = scriptController; 60 | -------------------------------------------------------------------------------- /client/App.jsx: -------------------------------------------------------------------------------- 1 | import React, { Component } from 'react'; 2 | import { Switch, Route } from 'react-router-dom'; 3 | 4 | import Loading from './components/loading'; 5 | import Wrapper from './components/wrapper'; 6 | 7 | class App extends Component { 8 | constructor(props) { 9 | super(props); 10 | this.state = { 11 | lineGraphLabels: [], 12 | lineGraphData: [], 13 | heapTotalSize: 0, 14 | barGraphLabels: [], 15 | barGraphData: [], 16 | barGraphDetails: [], 17 | }; 18 | this.updateState = this.updateState.bind(this); 19 | } 20 | 21 | updateState(data) { 22 | const newState = { 23 | lineGraphLabels: data.heapUsageOverTime.time, 24 | lineGraphData: data.heapUsageOverTime.heapUsage, 25 | heapTotalSize: data.heapUsageOverTime.totalHeapSize, 26 | barGraphLabels: data.memoryLeaks.labels, 27 | barGraphData: data.memoryLeaks.data, 28 | barGraphDetails: data.memoryLeaks.values, 29 | }; 30 | this.setState(newState); 31 | } 32 | 33 | render() { 34 | return ( 35 |
36 |
37 | 38 | } 42 | /> 43 | ( 47 | 55 | )} 56 | /> 57 | 58 |
59 |
60 | ); 61 | } 62 | } 63 | 64 | export default App; 65 | -------------------------------------------------------------------------------- /package.json: -------------------------------------------------------------------------------- 1 | { 2 | "name": "kondo", 3 | "version": "1.0.0", 4 | "description": "", 5 | "main": "index.js", 6 | "scripts": { 7 | "script": "npm run open && cross-env NODE_ENV=production node server/runScript.js", 8 | "record": "cross-env NODE_ENV=production node server/createScript.js", 9 | "open": "opener http://localhost:8000", 10 | "build": "cross-env NODE_ENV=production webpack", 11 | "dev": "concurrently \"cross-env NODE_ENV=development webpack-dev-server --open\" \"nodemon --inspect=9222 server/server.js\"", 12 | "test": "echo \"Error: no test specified\" && exit 1" 13 | }, 14 | "dependencies": { 15 | "bootstrap": "^4.4.1", 16 | "chart.js": "^2.9.3", 17 | "dotenv": "^8.2.0", 18 | "ejs": "^3.0.2", 19 | "express": "^4.17.1", 20 | "fs": "0.0.1-security", 21 | "heapsnapshot-parser": "^0.1.0", 22 | "kondo-recorder": "^0.7.4", 23 | "loaders.css": "^0.1.2", 24 | "mongoose": "^5.9.7", 25 | "opener": "^1.5.1", 26 | "pg": "^7.18.1", 27 | "puppeteer": "^2.1.1", 28 | "react": "^16.12.0", 29 | "react-bootstrap": "^1.0.0", 30 | "react-chartjs-2": "^2.9.0", 31 | "react-dom": "^16.12.0", 32 | "react-router-dom": "^5.1.2", 33 | "readline": "^1.3.0", 34 | "webpack": "^4.41.6" 35 | }, 36 | "devDependencies": { 37 | "@babel/core": "^7.8.4", 38 | "@babel/plugin-proposal-class-properties": "^7.8.3", 39 | "@babel/preset-env": "^7.8.4", 40 | "@babel/preset-react": "^7.8.3", 41 | "babel-eslint": "^10.0.3", 42 | "babel-loader": "^8.0.6", 43 | "body-parser": "^1.19.0", 44 | "concurrently": "^5.1.0", 45 | "cross-env": "^7.0.2", 46 | "css-loader": "^3.4.2", 47 | "eslint": "^6.8.0", 48 | "eslint-config-airbnb": "^18.0.1", 49 | "eslint-config-prettier": "^6.10.0", 50 | "eslint-plugin-import": "^2.20.1", 51 | "eslint-plugin-jsx-a11y": "^6.2.3", 52 | "eslint-plugin-prettier": "^3.1.2", 53 | "eslint-plugin-react": "^7.18.3", 54 | "file-loader": "^5.1.0", 55 | "nodemon": "^2.0.2", 56 | "prettier": "^1.19.1", 57 | "style-loader": "^1.1.3", 58 | "webpack-cli": "^3.3.11", 59 | "webpack-dev-server": "^3.10.3" 60 | }, 61 | "author": "", 62 | "license": "ISC" 63 | } 64 | -------------------------------------------------------------------------------- /server/createScript.js: -------------------------------------------------------------------------------- 1 | const puppeteer = require("puppeteer"); 2 | const express = require('express'); 3 | const pathToExtension = require("path").join(__dirname, "../node_modules/kondo-recorder/build"); 4 | const scripts = require("./userscripts.js"); 5 | const scriptController = require('./controllers/scriptController'); 6 | 7 | const app = express(); 8 | const PORT = 8000; 9 | 10 | app.use(express.json()); 11 | 12 | // RECORD USER ACTIONS FROM BROWSER AND CREATE PUPPET SCRIPT 13 | const createScript = async (name, inputURL) => { 14 | if (!inputURL) { 15 | console.log("Please provide a URL to connect to."); 16 | process.exit(0); 17 | } 18 | if (scripts[name]) { 19 | console.log("That script name already exists. Please try a new one."); 20 | process.exit(0); 21 | } else { 22 | const browser = await puppeteer.launch({ 23 | headless: false, 24 | args: [ 25 | `--disable-extensions-except=${pathToExtension}`, 26 | `--load-extension=${pathToExtension}`, 27 | ], 28 | }); 29 | const page = (await browser.pages())[0]; 30 | await page.goto(inputURL); 31 | await page.content(); 32 | } 33 | }; 34 | 35 | app.post("/code", scriptController.storeScript, /*heapController.postHeap,*/(req, res) => { 36 | res.status(200).send("OK"); 37 | process.exit(0); 38 | } 39 | ); 40 | 41 | // determines whether to save a new script or run an existing one in headless mode 42 | const scriptName = process.argv[2]; 43 | 44 | // take the URL to open in Puppeteer from the input script parameter 45 | let inputURL; 46 | if (process.argv[3]) { 47 | inputURL = process.argv[3]; 48 | } 49 | 50 | // handle input parameters 51 | // if (!runMode) { 52 | // console.log( 53 | // 'Please enter "npm start -- create scriptName url" to create a new script, or "npm start -- run scriptName" to run an existing one.' 54 | // ); 55 | // } else { 56 | app.listen(PORT, () => { console.log('Kondo is listening on port ' + PORT) }); 57 | // expects 'npm start -- create scriptName URL' or 'npm start -- run scriptName' 58 | // if (runMode == 'create') { 59 | createScript(scriptName, inputURL); 60 | // } else if (runMode != 'run') { 61 | // console.log( 62 | // 'Please enter "npm start -- create scriptName url" to create a new script, or "npm start -- run scriptName" to run an existing one.', 63 | // ); 64 | // process.exit(0); 65 | // } 66 | // } 67 | 68 | 69 | 70 | -------------------------------------------------------------------------------- /client/components/lineGraph.jsx: -------------------------------------------------------------------------------- 1 | import React from 'react'; 2 | //Type of chart imported from react chartjs 3 | import { Line } from 'react-chartjs-2'; 4 | 5 | //props are being drilled from wrapper 6 | const LineGraph = props => { 7 | return ( 8 |
9 | 19 | ((el / props.heapSize) * 100).toFixed(2), 20 | ), 21 | // 22 | heapUsageTotal: props.data, 23 | backgroundColor: 'rgba(75, 192, 192, 1)', 24 | borderColor: 'rgba(54, 145, 235, 1)', 25 | lineTension: 0, 26 | fill: false, 27 | }, 28 | ], 29 | }} 30 | options={{ 31 | legend: { 32 | display: false, 33 | position: 'right', 34 | labels: { 35 | borderWidth: 1, 36 | fontColor: 'black', 37 | }, 38 | }, 39 | pointStyle: 'star', 40 | scales: { 41 | xAxes: [ 42 | { 43 | ticks: { 44 | suggestedMax: 60000, 45 | }, 46 | scaleLabel: { 47 | display: true, 48 | labelString: 'Time (ms)', 49 | }, 50 | gridLines: { 51 | display: true, 52 | drawBorder: true, 53 | }, 54 | }, 55 | ], 56 | yAxes: [ 57 | { 58 | ticks: { 59 | suggestedMin: 40, 60 | suggestedMax: 60, 61 | }, 62 | scaleLabel: { 63 | display: true, 64 | labelString: 'Heap Usage(%)', 65 | }, 66 | gridLines: { 67 | display: true, 68 | drawBorder: true, 69 | }, 70 | }, 71 | ], 72 | }, 73 | tooltips: { 74 | mode: 'label', 75 | //tooltip callbacks allow for multiple labels 76 | callbacks: { 77 | title: function(tooltipItem, data) { 78 | return ( 79 | ' Total Heap Usage At ' + 80 | data.labels[tooltipItem[0].index] / 1000 + 81 | ' seconds' 82 | ); 83 | }, 84 | label: function(tooltipItem, data) { 85 | return ( 86 | 'Total Heap Percentage Usage: ' + 87 | data.datasets[tooltipItem.datasetIndex].data[ 88 | tooltipItem.index 89 | ] + 90 | '%' 91 | ); 92 | }, 93 | afterLabel: function(tooltipItem, data) { 94 | return ( 95 | 'Total Heap Used: ' + 96 | ( 97 | data.datasets[tooltipItem.datasetIndex].heapUsageTotal[ 98 | tooltipItem.index 99 | ] / 1048576 100 | ).toFixed(2) + 101 | ' MB' 102 | ); 103 | }, 104 | }, 105 | titleFontSize: 16, 106 | bodyFontSize: 16, 107 | }, 108 | elements: { 109 | point: { 110 | pointStyle: 'rectRounded', 111 | radius: 5, 112 | }, 113 | }, 114 | }} 115 | /> 116 |
117 | ); 118 | }; 119 | export default LineGraph; 120 | -------------------------------------------------------------------------------- /client/components/barGraph.jsx: -------------------------------------------------------------------------------- 1 | import React, { Component } from 'react'; 2 | import { Bar } from 'react-chartjs-2'; 3 | import { ListGroup, Modal } from 'react-bootstrap'; 4 | 5 | class BarGraph extends Component { 6 | constructor(props) { 7 | super(props); 8 | this.state = { 9 | showModal: false, 10 | idx: undefined, 11 | element: '', 12 | details: [], 13 | }; 14 | 15 | this.toggleModal = this.toggleModal.bind(this); 16 | } 17 | toggleModal(event, item) { 18 | const index = item[0]._index; 19 | this.setState({ 20 | showModal: true, 21 | idx: index, 22 | element: this.props.labels[index], 23 | details: this.props.details[index], 24 | }); 25 | } 26 | render() { 27 | const { details } = this.state; 28 | const properties = details.map((property, i) => { 29 | return ( 30 | 31 | Name: {property.name} 32 |
33 | Type: {property.type}
34 | Value: {property.value} 35 |
36 | ); 37 | }); 38 | 39 | return ( 40 |
41 | { 44 | this.setState({ showModal: false }); 45 | }} 46 | > 47 | 48 | {this.state.element} Properties 49 | 50 | {properties} 51 | 52 | 125 |
126 | ); 127 | } 128 | } 129 | 130 | export default BarGraph; 131 | -------------------------------------------------------------------------------- /server/controllers/heapController.js: -------------------------------------------------------------------------------- 1 | const puppeteer = require('puppeteer'); 2 | const scripts = require('../userscripts.js'); 3 | const parser = require('heapsnapshot-parser'); 4 | // const { Runs } = require('../models/models'); 5 | 6 | const scriptName = process.argv[2]; 7 | 8 | const heapController = {}; 9 | 10 | heapController.getData = async (req, res, next) => { 11 | // launch puppeteer browser, create CDP session, and navigate to inputted url 12 | const browser = await puppeteer.launch({ headless: true, devtools: true }); 13 | const page = (await browser.pages())[0]; 14 | const client = await page.target().createCDPSession(); 15 | await client.send('Page.navigate', { url: scripts[scriptName].url }); 16 | 17 | // enable CDP domains necessary for data collection 18 | await client.send('Page.enable'); 19 | await client.send('HeapProfiler.enable'); 20 | await client.send('Runtime.enable'); 21 | await client.send('HeapProfiler.startTrackingHeapObjects'); 22 | 23 | // wait for page to load before running code 24 | client.on('Page.loadEventFired', async ({ timestamp }) => { 25 | console.log('page loaded at ', timestamp); 26 | // variables for data collection 27 | let snap = ''; 28 | const snapshots = []; 29 | let count = 1; 30 | let ms = 0; 31 | const time = []; 32 | const heapUsage = []; 33 | 34 | // listener for incoming heap snapshot chunks 35 | client.on('HeapProfiler.addHeapSnapshotChunk', ({ chunk }) => { 36 | snap += chunk; 37 | }); 38 | 39 | let i = 0; 40 | while (i < 2) { 41 | await scripts[scriptName].func(page); 42 | i += 1; 43 | } 44 | 45 | // collect initial heap usage data 46 | let runtime = await client.send('Runtime.getHeapUsage'); 47 | heapUsage.push(runtime.usedSize); 48 | time.push(ms); 49 | 50 | // collect data every 1000ms for 7 intervals 51 | function collect() { 52 | return new Promise(resolve => { 53 | console.log('collecting data'); 54 | const interval = setInterval(async () => { 55 | runtime = await client.send('Runtime.getHeapUsage'); 56 | heapUsage.push(runtime.usedSize); 57 | ms += 2000; 58 | time.push(ms); 59 | await client.send('HeapProfiler.takeHeapSnapshot'); 60 | snapshots.push(parser.parse(snap).nodes); 61 | snap = ''; 62 | count += 1; 63 | 64 | // break after 7 intervals 65 | if (count > 7) { 66 | clearInterval(interval); 67 | res.locals.heapUsageOverTime = { 68 | time: time, 69 | heapUsage: heapUsage, 70 | totalHeapSize: runtime.totalSize, 71 | }; 72 | console.log('completed data collection'); 73 | resolve(); 74 | } 75 | }, 2000); 76 | }); 77 | } 78 | 79 | // analyze data collected 80 | function analyze() { 81 | return new Promise(async resolve => { 82 | console.log('analyzing data'); 83 | // set initial growth status of nodes in snapshot 1 to true 84 | // set intial growth status of nodes in all other snapshots to false 85 | for (let i = 0; i < snapshots.length; i++) { 86 | for (let node of snapshots[i]) { 87 | if (i === 0) node.growing = true; 88 | else node.growing = false; 89 | } 90 | } 91 | // compare each snapshot to previous snapshot and update growth status of nodes 92 | for (let i = 0; i < snapshots.length - 1; i++) { 93 | updateGrowthStatus(snapshots[i][0], snapshots[i + 1][0]); 94 | } 95 | 96 | // filter growing nodes 97 | console.log('findGrowing'); 98 | const growing = findGrowing(snapshots[snapshots.length - 1]); 99 | console.log('findGrowing completed'); 100 | res.locals.memoryLeaks = { 101 | labels: [], 102 | data: { 103 | snapshot0: [], 104 | snapshot1: [], 105 | snapshot2: [], 106 | snapshot3: [], 107 | snapshot4: [], 108 | snapshot5: [], 109 | snapshot6: [], 110 | }, 111 | values: [], 112 | }; 113 | for (let growingNode of growing) { 114 | try { 115 | // get node description 116 | const nodeDescription = await client.send( 117 | 'HeapProfiler.getObjectByHeapObjectId', 118 | { objectId: growingNode.id.toString() }, 119 | ); 120 | res.locals.memoryLeaks.labels.push( 121 | nodeDescription.result.description, 122 | ); 123 | 124 | // get properties of node 125 | const nodeProperties = await client.send('Runtime.getProperties', { 126 | objectId: nodeDescription.result.objectId, 127 | }); 128 | res.locals.memoryLeaks.values.push([]); 129 | const len = res.locals.memoryLeaks.values.length - 1; 130 | for (let property of nodeProperties.result) { 131 | if (property.isOwn) { 132 | res.locals.memoryLeaks.values[len].push({ 133 | name: property.name, 134 | type: property.value.type, 135 | value: property.value.value.toString().slice(0, 20), 136 | }); 137 | } 138 | } 139 | 140 | // get edge deltas for snapshots 141 | let sum; 142 | for (let i = 0; i < snapshots.length; i++) { 143 | for (let node of snapshots[i]) { 144 | if (node.id === growingNode.id) { 145 | if (i === 0) { 146 | res.locals.memoryLeaks.data[`snapshot${i}`].push( 147 | node.references.length, 148 | ); 149 | } else { 150 | res.locals.memoryLeaks.data[`snapshot${i}`].push( 151 | node.references.length - sum, 152 | ); 153 | } 154 | sum = node.references.length; 155 | } 156 | } 157 | } 158 | } catch (err) {} 159 | } 160 | resolve(); 161 | }); 162 | } 163 | const updateGrowthStatus = function(root1, root2) { 164 | // using a breadth-first traversal, trace the shortest path to each node by edges 165 | const heapgraph1 = [root1]; 166 | const heapgraph2 = [root2]; 167 | const visit = new Set(); 168 | visit.add(root1.id); 169 | 170 | while (heapgraph1.length > 0) { 171 | const node1 = heapgraph1.shift(); 172 | const node2 = heapgraph2.shift(); 173 | 174 | // if a node was previously marked as growing and the number of edges increased 175 | // from the previous snapshot, mark the node as growing 176 | if ( 177 | node1.growing === true && 178 | node1.references.length < node2.references.length 179 | ) { 180 | node2.growing = true; 181 | } 182 | 183 | // add nodes referenced out by the edges of the current node (breadth-first traversal) if 184 | // they follow same paths from the previous snapshot's heapgraph 185 | for (let i = 0; i < node1.references.length; i++) { 186 | try { 187 | const edge1 = node1.references[i]; 188 | const edge2 = node2.references[i]; 189 | if ( 190 | edge1.name === edge2.name && 191 | edge1.toNode.id === edge2.toNode.id && 192 | !visit.has(edge1.toNode.id) 193 | ) { 194 | heapgraph1.push(edge1.toNode); 195 | heapgraph2.push(edge2.toNode); 196 | visit.add(edge1.toNode.id); 197 | } 198 | } catch (err) {} 199 | } 200 | } 201 | }; 202 | 203 | const findGrowing = function(arr) { 204 | const growing = []; 205 | for (let node of arr) { 206 | if (node.growing) { 207 | growing.push(node); 208 | } 209 | } 210 | return growing; 211 | }; 212 | 213 | await collect(); 214 | await analyze(); 215 | console.log(res.locals); 216 | 217 | // close CDP domains and puppeteer browser 218 | await client.send('HeapProfiler.stopTrackingHeapObjects'); 219 | await client.send('Runtime.disable'); 220 | await client.send('HeapProfiler.disable'); 221 | await client.send('Page.disable'); 222 | await browser.close(); 223 | next(); 224 | }); 225 | }; 226 | 227 | /* MIDDLEWARE TO POST HEAP DATA TO DB */ 228 | // heapController.postHeap = (req, res, next) => { 229 | // Runs.create( 230 | // { 231 | // heapUsageOverTime: req.body.heapUsageOverTime, 232 | // memoryLeaks: req.body.memoryLeaks, 233 | // }, 234 | // (err, postHeap) => { 235 | // if (err) { 236 | // console.log(`Error in databaseController.postHeaps`); 237 | // res.sendStatus(418); 238 | // return next(); 239 | // } else { 240 | // res.locals.heapUsageOverTime = postHeap.heapUsageOverTime; 241 | // res.locals.memoryLeaks = postHeap.memoryLeaks; 242 | // return next(); 243 | // } 244 | // } 245 | // ); 246 | // }; 247 | 248 | module.exports = heapController; 249 | -------------------------------------------------------------------------------- /server/controllers/cdp data samples/Runtime.getProperties.json: -------------------------------------------------------------------------------- 1 | // result.value is an object of the following format: 2 | // {"type":"string","value":"foofoofoofoofoofoofoofoofoo...} 3 | 4 | { 5 | "result": [ 6 | { 7 | "name": "0", 8 | "value": [Object], 9 | "writable": true, 10 | "configurable": true, 11 | "enumerable": true, 12 | "isOwn": true 13 | }, 14 | { 15 | "name": "1", 16 | "value": [Object], 17 | "writable": true, 18 | "configurable": true, 19 | "enumerable": true, 20 | "isOwn": true 21 | }, 22 | { 23 | "name": "2", 24 | "value": [Object], 25 | "writable": true, 26 | "configurable": true, 27 | "enumerable": true, 28 | "isOwn": true 29 | }, 30 | { 31 | "name": "3", 32 | "value": [Object], 33 | "writable": true, 34 | "configurable": true, 35 | "enumerable": true, 36 | "isOwn": true 37 | }, 38 | { 39 | "name": "4", 40 | "value": [Object], 41 | "writable": true, 42 | "configurable": true, 43 | "enumerable": true, 44 | "isOwn": true 45 | }, 46 | { 47 | "name": "5", 48 | "value": [Object], 49 | "writable": true, 50 | "configurable": true, 51 | "enumerable": true, 52 | "isOwn": true 53 | }, 54 | { 55 | "name": "6", 56 | "value": [Object], 57 | "writable": true, 58 | "configurable": true, 59 | "enumerable": true, 60 | "isOwn": true 61 | }, 62 | { 63 | "name": "7", 64 | "value": [Object], 65 | "writable": true, 66 | "configurable": true, 67 | "enumerable": true, 68 | "isOwn": true 69 | }, 70 | { 71 | "name": "8", 72 | "value": [Object], 73 | "writable": true, 74 | "configurable": true, 75 | "enumerable": true, 76 | "isOwn": true 77 | }, 78 | { 79 | "name": "9", 80 | "value": [Object], 81 | "writable": true, 82 | "configurable": true, 83 | "enumerable": true, 84 | "isOwn": true 85 | }, 86 | { 87 | "name": "10", 88 | "value": [Object], 89 | "writable": true, 90 | "configurable": true, 91 | "enumerable": true, 92 | "isOwn": true 93 | }, 94 | { 95 | "name": "11", 96 | "value": [Object], 97 | "writable": true, 98 | "configurable": true, 99 | "enumerable": true, 100 | "isOwn": true 101 | }, 102 | { 103 | "name": "12", 104 | "value": [Object], 105 | "writable": true, 106 | "configurable": true, 107 | "enumerable": true, 108 | "isOwn": true 109 | }, 110 | { 111 | "name": "13", 112 | "value": [Object], 113 | "writable": true, 114 | "configurable": true, 115 | "enumerable": true, 116 | "isOwn": true 117 | }, 118 | { 119 | "name": "14", 120 | "value": [Object], 121 | "writable": true, 122 | "configurable": true, 123 | "enumerable": true, 124 | "isOwn": true 125 | }, 126 | { 127 | "name": "15", 128 | "value": [Object], 129 | "writable": true, 130 | "configurable": true, 131 | "enumerable": true, 132 | "isOwn": true 133 | }, 134 | { 135 | "name": "16", 136 | "value": [Object], 137 | "writable": true, 138 | "configurable": true, 139 | "enumerable": true, 140 | "isOwn": true 141 | }, 142 | { 143 | "name": "17", 144 | "value": [Object], 145 | "writable": true, 146 | "configurable": true, 147 | "enumerable": true, 148 | "isOwn": true 149 | }, 150 | { 151 | "name": "18", 152 | "value": [Object], 153 | "writable": true, 154 | "configurable": true, 155 | "enumerable": true, 156 | "isOwn": true 157 | }, 158 | { 159 | "name": "19", 160 | "value": [Object], 161 | "writable": true, 162 | "configurable": true, 163 | "enumerable": true, 164 | "isOwn": true 165 | }, 166 | { 167 | "name": "20", 168 | "value": [Object], 169 | "writable": true, 170 | "configurable": true, 171 | "enumerable": true, 172 | "isOwn": true 173 | }, 174 | { 175 | "name": "21", 176 | "value": [Object], 177 | "writable": true, 178 | "configurable": true, 179 | "enumerable": true, 180 | "isOwn": true 181 | }, 182 | { 183 | "name": "22", 184 | "value": [Object], 185 | "writable": true, 186 | "configurable": true, 187 | "enumerable": true, 188 | "isOwn": true 189 | }, 190 | { 191 | "name": "23", 192 | "value": [Object], 193 | "writable": true, 194 | "configurable": true, 195 | "enumerable": true, 196 | "isOwn": true 197 | }, 198 | { 199 | "name": "24", 200 | "value": [Object], 201 | "writable": true, 202 | "configurable": true, 203 | "enumerable": true, 204 | "isOwn": true 205 | }, 206 | { 207 | "name": "25", 208 | "value": [Object], 209 | "writable": true, 210 | "configurable": true, 211 | "enumerable": true, 212 | "isOwn": true 213 | }, 214 | { 215 | "name": "26", 216 | "value": [Object], 217 | "writable": true, 218 | "configurable": true, 219 | "enumerable": true, 220 | "isOwn": true 221 | }, 222 | { 223 | "name": "length", 224 | "value": [Object], 225 | "writable": true, 226 | "configurable": false, 227 | "enumerable": false, 228 | "isOwn": true 229 | }, 230 | { 231 | "name": "constructor", 232 | "value": [Object], 233 | "writable": true, 234 | "configurable": true, 235 | "enumerable": false, 236 | "isOwn": false 237 | }, 238 | { 239 | "name": "concat", 240 | "value": [Object], 241 | "writable": true, 242 | "configurable": true, 243 | "enumerable": false, 244 | "isOwn": false 245 | }, 246 | { 247 | "name": "copyWithin", 248 | "value": [Object], 249 | "writable": true, 250 | "configurable": true, 251 | "enumerable": false, 252 | "isOwn": false 253 | }, 254 | { 255 | "name": "fill", 256 | "value": [Object], 257 | "writable": true, 258 | "configurable": true, 259 | "enumerable": false, 260 | "isOwn": false 261 | }, 262 | { 263 | "name": "find", 264 | "value": [Object], 265 | "writable": true, 266 | "configurable": true, 267 | "enumerable": false, 268 | "isOwn": false 269 | }, 270 | { 271 | "name": "findIndex", 272 | "value": [Object], 273 | "writable": true, 274 | "configurable": true, 275 | "enumerable": false, 276 | "isOwn": false 277 | }, 278 | { 279 | "name": "lastIndexOf", 280 | "value": [Object], 281 | "writable": true, 282 | "configurable": true, 283 | "enumerable": false, 284 | "isOwn": false 285 | }, 286 | { 287 | "name": "pop", 288 | "value": [Object], 289 | "writable": true, 290 | "configurable": true, 291 | "enumerable": false, 292 | "isOwn": false 293 | }, 294 | { 295 | "name": "push", 296 | "value": [Object], 297 | "writable": true, 298 | "configurable": true, 299 | "enumerable": false, 300 | "isOwn": false 301 | }, 302 | { 303 | "name": "reverse", 304 | "value": [Object], 305 | "writable": true, 306 | "configurable": true, 307 | "enumerable": false, 308 | "isOwn": false 309 | }, 310 | { 311 | "name": "shift", 312 | "value": [Object], 313 | "writable": true, 314 | "configurable": true, 315 | "enumerable": false, 316 | "isOwn": false 317 | }, 318 | { 319 | "name": "unshift", 320 | "value": [Object], 321 | "writable": true, 322 | "configurable": true, 323 | "enumerable": false, 324 | "isOwn": false 325 | }, 326 | { 327 | "name": "slice", 328 | "value": [Object], 329 | "writable": true, 330 | "configurable": true, 331 | "enumerable": false, 332 | "isOwn": false 333 | }, 334 | { 335 | "name": "sort", 336 | "value": [Object], 337 | "writable": true, 338 | "configurable": true, 339 | "enumerable": false, 340 | "isOwn": false 341 | }, 342 | { 343 | "name": "splice", 344 | "value": [Object], 345 | "writable": true, 346 | "configurable": true, 347 | "enumerable": false, 348 | "isOwn": false 349 | }, 350 | { 351 | "name": "includes", 352 | "value": [Object], 353 | "writable": true, 354 | "configurable": true, 355 | "enumerable": false, 356 | "isOwn": false 357 | }, 358 | { 359 | "name": "indexOf", 360 | "value": [Object], 361 | "writable": true, 362 | "configurable": true, 363 | "enumerable": false, 364 | "isOwn": false 365 | }, 366 | { 367 | "name": "join", 368 | "value": [Object], 369 | "writable": true, 370 | "configurable": true, 371 | "enumerable": false, 372 | "isOwn": false 373 | }, 374 | { 375 | "name": "keys", 376 | "value": [Object], 377 | "writable": true, 378 | "configurable": true, 379 | "enumerable": false, 380 | "isOwn": false 381 | }, 382 | { 383 | "name": "entries", 384 | "value": [Object], 385 | "writable": true, 386 | "configurable": true, 387 | "enumerable": false, 388 | "isOwn": false 389 | }, 390 | { 391 | "name": "values", 392 | "value": [Object], 393 | "writable": true, 394 | "configurable": true, 395 | "enumerable": false, 396 | "isOwn": false 397 | }, 398 | { 399 | "name": "forEach", 400 | "value": [Object], 401 | "writable": true, 402 | "configurable": true, 403 | "enumerable": false, 404 | "isOwn": false 405 | }, 406 | { 407 | "name": "filter", 408 | "value": [Object], 409 | "writable": true, 410 | "configurable": true, 411 | "enumerable": false, 412 | "isOwn": false 413 | }, 414 | { 415 | "name": "flat", 416 | "value": [Object], 417 | "writable": true, 418 | "configurable": true, 419 | "enumerable": false, 420 | "isOwn": false 421 | }, 422 | { 423 | "name": "flatMap", 424 | "value": [Object], 425 | "writable": true, 426 | "configurable": true, 427 | "enumerable": false, 428 | "isOwn": false 429 | }, 430 | { 431 | "name": "map", 432 | "value": [Object], 433 | "writable": true, 434 | "configurable": true, 435 | "enumerable": false, 436 | "isOwn": false 437 | }, 438 | { 439 | "name": "every", 440 | "value": [Object], 441 | "writable": true, 442 | "configurable": true, 443 | "enumerable": false, 444 | "isOwn": false 445 | }, 446 | { 447 | "name": "some", 448 | "value": [Object], 449 | "writable": true, 450 | "configurable": true, 451 | "enumerable": false, 452 | "isOwn": false 453 | }, 454 | { 455 | "name": "reduce", 456 | "value": [Object], 457 | "writable": true, 458 | "configurable": true, 459 | "enumerable": false, 460 | "isOwn": false 461 | }, 462 | { 463 | "name": "reduceRight", 464 | "value": [Object], 465 | "writable": true, 466 | "configurable": true, 467 | "enumerable": false, 468 | "isOwn": false 469 | }, 470 | { 471 | "name": "toLocaleString", 472 | "value": [Object], 473 | "writable": true, 474 | "configurable": true, 475 | "enumerable": false, 476 | "isOwn": false 477 | }, 478 | { 479 | "name": "toString", 480 | "value": [Object], 481 | "writable": true, 482 | "configurable": true, 483 | "enumerable": false, 484 | "isOwn": false 485 | }, 486 | { 487 | "name": "Symbol(Symbol.iterator)", 488 | "value": [Object], 489 | "writable": true, 490 | "configurable": true, 491 | "enumerable": false, 492 | "isOwn": false, 493 | "symbol": [Object] 494 | }, 495 | { 496 | "name": "Symbol(Symbol.unscopables)", 497 | "value": [Object], 498 | "writable": false, 499 | "configurable": true, 500 | "enumerable": false, 501 | "isOwn": false, 502 | "symbol": [Object] 503 | }, 504 | { 505 | "name": "__defineGetter__", 506 | "value": [Object], 507 | "writable": true, 508 | "configurable": true, 509 | "enumerable": false, 510 | "isOwn": false 511 | }, 512 | { 513 | "name": "__defineSetter__", 514 | "value": [Object], 515 | "writable": true, 516 | "configurable": true, 517 | "enumerable": false, 518 | "isOwn": false 519 | }, 520 | { 521 | "name": "hasOwnProperty", 522 | "value": [Object], 523 | "writable": true, 524 | "configurable": true, 525 | "enumerable": false, 526 | "isOwn": false 527 | }, 528 | { 529 | "name": "__lookupGetter__", 530 | "value": [Object], 531 | "writable": true, 532 | "configurable": true, 533 | "enumerable": false, 534 | "isOwn": false 535 | }, 536 | { 537 | "name": "__lookupSetter__", 538 | "value": [Object], 539 | "writable": true, 540 | "configurable": true, 541 | "enumerable": false, 542 | "isOwn": false 543 | }, 544 | { 545 | "name": "isPrototypeOf", 546 | "value": [Object], 547 | "writable": true, 548 | "configurable": true, 549 | "enumerable": false, 550 | "isOwn": false 551 | }, 552 | { 553 | "name": "propertyIsEnumerable", 554 | "value": [Object], 555 | "writable": true, 556 | "configurable": true, 557 | "enumerable": false, 558 | "isOwn": false 559 | }, 560 | { 561 | "name": "valueOf", 562 | "value": [Object], 563 | "writable": true, 564 | "configurable": true, 565 | "enumerable": false, 566 | "isOwn": false 567 | }, 568 | { 569 | "name": "__proto__", 570 | "get": [Object], 571 | "set": [Object], 572 | "configurable": true, 573 | "enumerable": false, 574 | "isOwn": false 575 | } 576 | ] 577 | } 578 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | --------------------------------------------------------------------------------