@corellium/corellium-cli 1.2.0 → 1.2.1

package/node_modules/formidable/lib/multipart_parser.js

@@ -1,332 +0,0 @@
-var Buffer = require('buffer').Buffer,
-    s = 0,
-    S =
-    { PARSER_UNINITIALIZED: s++,
-      START: s++,
-      START_BOUNDARY: s++,
-      HEADER_FIELD_START: s++,
-      HEADER_FIELD: s++,
-      HEADER_VALUE_START: s++,
-      HEADER_VALUE: s++,
-      HEADER_VALUE_ALMOST_DONE: s++,
-      HEADERS_ALMOST_DONE: s++,
-      PART_DATA_START: s++,
-      PART_DATA: s++,
-      PART_END: s++,
-      END: s++
-    },
-
-    f = 1,
-    F =
-    { PART_BOUNDARY: f,
-      LAST_BOUNDARY: f *= 2
-    },
-
-    LF = 10,
-    CR = 13,
-    SPACE = 32,
-    HYPHEN = 45,
-    COLON = 58,
-    A = 97,
-    Z = 122,
-
-    lower = function(c) {
-      return c | 0x20;
-    };
-
-for (s in S) {
-  exports[s] = S[s];
-}
-
-function MultipartParser() {
-  this.boundary = null;
-  this.boundaryChars = null;
-  this.lookbehind = null;
-  this.state = S.PARSER_UNINITIALIZED;
-
-  this.index = null;
-  this.flags = 0;
-}
-exports.MultipartParser = MultipartParser;
-
-MultipartParser.stateToString = function(stateNumber) {
-  for (var state in S) {
-    var number = S[state];
-    if (number === stateNumber) return state;
-  }
-};
-
-MultipartParser.prototype.initWithBoundary = function(str) {
-  this.boundary = new Buffer(str.length+4);
-  this.boundary.write('\r\n--', 0);
-  this.boundary.write(str, 4);
-  this.lookbehind = new Buffer(this.boundary.length+8);
-  this.state = S.START;
-
-  this.boundaryChars = {};
-  for (var i = 0; i < this.boundary.length; i++) {
-    this.boundaryChars[this.boundary[i]] = true;
-  }
-};
-
-MultipartParser.prototype.write = function(buffer) {
-  var self = this,
-      i = 0,
-      len = buffer.length,
-      prevIndex = this.index,
-      index = this.index,
-      state = this.state,
-      flags = this.flags,
-      lookbehind = this.lookbehind,
-      boundary = this.boundary,
-      boundaryChars = this.boundaryChars,
-      boundaryLength = this.boundary.length,
-      boundaryEnd = boundaryLength - 1,
-      bufferLength = buffer.length,
-      c,
-      cl,
-
-      mark = function(name) {
-        self[name+'Mark'] = i;
-      },
-      clear = function(name) {
-        delete self[name+'Mark'];
-      },
-      callback = function(name, buffer, start, end) {
-        if (start !== undefined && start === end) {
-          return;
-        }
-
-        var callbackSymbol = 'on'+name.substr(0, 1).toUpperCase()+name.substr(1);
-        if (callbackSymbol in self) {
-          self[callbackSymbol](buffer, start, end);
-        }
-      },
-      dataCallback = function(name, clear) {
-        var markSymbol = name+'Mark';
-        if (!(markSymbol in self)) {
-          return;
-        }
-
-        if (!clear) {
-          callback(name, buffer, self[markSymbol], buffer.length);
-          self[markSymbol] = 0;
-        } else {
-          callback(name, buffer, self[markSymbol], i);
-          delete self[markSymbol];
-        }
-      };
-
-  for (i = 0; i < len; i++) {
-    c = buffer[i];
-    switch (state) {
-      case S.PARSER_UNINITIALIZED:
-        return i;
-      case S.START:
-        index = 0;
-        state = S.START_BOUNDARY;
-      case S.START_BOUNDARY:
-        if (index == boundary.length - 2) {
-          if (c == HYPHEN) {
-            flags |= F.LAST_BOUNDARY;
-          } else if (c != CR) {
-            return i;
-          }
-          index++;
-          break;
-        } else if (index - 1 == boundary.length - 2) {
-          if (flags & F.LAST_BOUNDARY && c == HYPHEN){
-            callback('end');
-            state = S.END;
-            flags = 0;
-          } else if (!(flags & F.LAST_BOUNDARY) && c == LF) {
-            index = 0;
-            callback('partBegin');
-            state = S.HEADER_FIELD_START;
-          } else {
-            return i;
-          }
-          break;
-        }
-
-        if (c != boundary[index+2]) {
-          index = -2;
-        }
-        if (c == boundary[index+2]) {
-          index++;
-        }
-        break;
-      case S.HEADER_FIELD_START:
-        state = S.HEADER_FIELD;
-        mark('headerField');
-        index = 0;
-      case S.HEADER_FIELD:
-        if (c == CR) {
-          clear('headerField');
-          state = S.HEADERS_ALMOST_DONE;
-          break;
-        }
-
-        index++;
-        if (c == HYPHEN) {
-          break;
-        }
-
-        if (c == COLON) {
-          if (index == 1) {
-            // empty header field
-            return i;
-          }
-          dataCallback('headerField', true);
-          state = S.HEADER_VALUE_START;
-          break;
-        }
-
-        cl = lower(c);
-        if (cl < A || cl > Z) {
-          return i;
-        }
-        break;
-      case S.HEADER_VALUE_START:
-        if (c == SPACE) {
-          break;
-        }
-
-        mark('headerValue');
-        state = S.HEADER_VALUE;
-      case S.HEADER_VALUE:
-        if (c == CR) {
-          dataCallback('headerValue', true);
-          callback('headerEnd');
-          state = S.HEADER_VALUE_ALMOST_DONE;
-        }
-        break;
-      case S.HEADER_VALUE_ALMOST_DONE:
-        if (c != LF) {
-          return i;
-        }
-        state = S.HEADER_FIELD_START;
-        break;
-      case S.HEADERS_ALMOST_DONE:
-        if (c != LF) {
-          return i;
-        }
-
-        callback('headersEnd');
-        state = S.PART_DATA_START;
-        break;
-      case S.PART_DATA_START:
-        state = S.PART_DATA;
-        mark('partData');
-      case S.PART_DATA:
-        prevIndex = index;
-
-        if (index === 0) {
-          // boyer-moore derrived algorithm to safely skip non-boundary data
-          i += boundaryEnd;
-          while (i < bufferLength && !(buffer[i] in boundaryChars)) {
-            i += boundaryLength;
-          }
-          i -= boundaryEnd;
-          c = buffer[i];
-        }
-
-        if (index < boundary.length) {
-          if (boundary[index] == c) {
-            if (index === 0) {
-              dataCallback('partData', true);
-            }
-            index++;
-          } else {
-            index = 0;
-          }
-        } else if (index == boundary.length) {
-          index++;
-          if (c == CR) {
-            // CR = part boundary
-            flags |= F.PART_BOUNDARY;
-          } else if (c == HYPHEN) {
-            // HYPHEN = end boundary
-            flags |= F.LAST_BOUNDARY;
-          } else {
-            index = 0;
-          }
-        } else if (index - 1 == boundary.length)  {
-          if (flags & F.PART_BOUNDARY) {
-            index = 0;
-            if (c == LF) {
-              // unset the PART_BOUNDARY flag
-              flags &= ~F.PART_BOUNDARY;
-              callback('partEnd');
-              callback('partBegin');
-              state = S.HEADER_FIELD_START;
-              break;
-            }
-          } else if (flags & F.LAST_BOUNDARY) {
-            if (c == HYPHEN) {
-              callback('partEnd');
-              callback('end');
-              state = S.END;
-              flags = 0;
-            } else {
-              index = 0;
-            }
-          } else {
-            index = 0;
-          }
-        }
-
-        if (index > 0) {
-          // when matching a possible boundary, keep a lookbehind reference
-          // in case it turns out to be a false lead
-          lookbehind[index-1] = c;
-        } else if (prevIndex > 0) {
-          // if our boundary turned out to be rubbish, the captured lookbehind
-          // belongs to partData
-          callback('partData', lookbehind, 0, prevIndex);
-          prevIndex = 0;
-          mark('partData');
-
-          // reconsider the current character even so it interrupted the sequence
-          // it could be the beginning of a new sequence
-          i--;
-        }
-
-        break;
-      case S.END:
-        break;
-      default:
-        return i;
-    }
-  }
-
-  dataCallback('headerField');
-  dataCallback('headerValue');
-  dataCallback('partData');
-
-  this.index = index;
-  this.state = state;
-  this.flags = flags;
-
-  return len;
-};
-
-MultipartParser.prototype.end = function() {
-  var callback = function(self, name) {
-    var callbackSymbol = 'on'+name.substr(0, 1).toUpperCase()+name.substr(1);
-    if (callbackSymbol in self) {
-      self[callbackSymbol]();
-    }
-  };
-  if ((this.state == S.HEADER_FIELD_START && this.index === 0) ||
-      (this.state == S.PART_DATA && this.index == this.boundary.length)) {
-    callback(this, 'partEnd');
-    callback(this, 'end');
-  } else if (this.state != S.END) {
-    return new Error('MultipartParser.end(): stream ended unexpectedly: ' + this.explain());
-  }
-};
-
-MultipartParser.prototype.explain = function() {
-  return 'state = ' + MultipartParser.stateToString(this.state);
-};

package/node_modules/formidable/lib/octet_parser.js

@@ -1,20 +0,0 @@
-var EventEmitter = require('events').EventEmitter
-	, util = require('util');
-
-function OctetParser(options){
-	if(!(this instanceof OctetParser)) return new OctetParser(options);
-	EventEmitter.call(this);
-}
-
-util.inherits(OctetParser, EventEmitter);
-
-exports.OctetParser = OctetParser;
-
-OctetParser.prototype.write = function(buffer) {
-    this.emit('data', buffer);
-	return buffer.length;
-};
-
-OctetParser.prototype.end = function() {
-	this.emit('end');
-};

package/node_modules/formidable/lib/querystring_parser.js

@@ -1,27 +0,0 @@
-if (global.GENTLY) require = GENTLY.hijack(require);
-
-// This is a buffering parser, not quite as nice as the multipart one.
-// If I find time I'll rewrite this to be fully streaming as well
-var querystring = require('querystring');
-
-function QuerystringParser(maxKeys) {
-  this.maxKeys = maxKeys;
-  this.buffer = '';
-}
-exports.QuerystringParser = QuerystringParser;
-
-QuerystringParser.prototype.write = function(buffer) {
-  this.buffer += buffer.toString('ascii');
-  return buffer.length;
-};
-
-QuerystringParser.prototype.end = function() {
-  var fields = querystring.parse(this.buffer, '&', '=', { maxKeys: this.maxKeys });
-  for (var field in fields) {
-    this.onField(field, fields[field]);
-  }
-  this.buffer = '';
-
-  this.onEnd();
-};
-

package/node_modules/formidable/package.json

@@ -1,63 +0,0 @@
-{
-  "_args": [
-    [
-      "formidable@1.2.6",
-      "/home/sam/source/corellium/corellium-cli"
-    ]
-  ],
-  "_from": "formidable@1.2.6",
-  "_id": "formidable@1.2.6",
-  "_inBundle": false,
-  "_integrity": "sha512-KcpbcpuLNOwrEjnbpMC0gS+X8ciDoZE1kkqzat4a8vrprf+s9pKNQ/QIwWfbfs4ltgmFl3MD177SNTkve3BwGQ==",
-  "_location": "/formidable",
-  "_phantomChildren": {},
-  "_requested": {
-    "type": "version",
-    "registry": true,
-    "raw": "formidable@1.2.6",
-    "name": "formidable",
-    "escapedName": "formidable",
-    "rawSpec": "1.2.6",
-    "saveSpec": null,
-    "fetchSpec": "1.2.6"
-  },
-  "_requiredBy": [
-    "/superagent"
-  ],
-  "_resolved": "https://registry.npmjs.org/formidable/-/formidable-1.2.6.tgz",
-  "_spec": "1.2.6",
-  "_where": "/home/sam/source/corellium/corellium-cli",
-  "bugs": {
-    "url": "https://github.com/node-formidable/formidable/issues"
-  },
-  "description": "(DEPRECATED! Install formidable@v2) A node.js module for parsing form data, especially file uploads.",
-  "devDependencies": {
-    "findit": "^0.1.2",
-    "gently": "^0.8.0",
-    "hashish": "^0.0.4",
-    "request": "^2.11.4",
-    "urun": "^0.0.6",
-    "utest": "^0.0.8"
-  },
-  "files": [
-    "lib"
-  ],
-  "funding": "https://ko-fi.com/tunnckoCore/commissions",
-  "homepage": "https://github.com/node-formidable/formidable",
-  "license": "MIT",
-  "main": "./lib/index.js",
-  "name": "formidable",
-  "publishConfig": {
-    "access": "public",
-    "tag": "v1"
-  },
-  "repository": {
-    "type": "git",
-    "url": "git+https://github.com/node-formidable/formidable.git"
-  },
-  "scripts": {
-    "clean": "rm test/tmp/*",
-    "test": "node test/run.js"
-  },
-  "version": "1.2.6"
-}

package/node_modules/fs-readdir-recursive/LICENSE

@@ -1,22 +0,0 @@
-
-The MIT License (MIT)
-
-Copyright (c) 2014 Jonathan Ong me@jongleberry.com
-
-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.

package/node_modules/fs-readdir-recursive/README.md

@@ -1,61 +0,0 @@
-# fs.readdirSyncRecursive
-
-[![NPM version][npm-image]][npm-url]
-[![Build status][travis-image]][travis-url]
-[![Test coverage][coveralls-image]][coveralls-url]
-[![Dependency Status][david-image]][david-url]
-[![License][license-image]][license-url]
-[![Downloads][downloads-image]][downloads-url]
-[![Gittip][gittip-image]][gittip-url]
-
-Read a directory recursively.
-
-## Install
-
-```bash
-npm install fs-readdir-recursive
-```
-
-## Example
-
-```js
-var read = require('fs-readdir-recursive')
-read(__dirname) === [
-  'test/test.js',
-  'index.js',
-  'LICENSE',
-  'package.json',
-  'README.md'
-]
-```
-
-## API
-
-### read(root [, filter])
-
-`root` is the directory you wish to scan. `filter` is an optional filter for the files with three params(name, index, dir). By default, filter is:
-
-```js
-function (name) {
-  return name[0] !== '.'
-}
-```
-
-Which basically just ignores `.` files.
-
-[npm-image]: https://img.shields.io/npm/v/fs-readdir-recursive.svg?style=flat-square
-[npm-url]: https://npmjs.org/package/fs-readdir-recursive
-[github-tag]: http://img.shields.io/github/tag/fs-utils/fs-readdir-recursive.svg?style=flat-square
-[github-url]: https://github.com/fs-utils/fs-readdir-recursive/tags
-[travis-image]: https://img.shields.io/travis/fs-utils/fs-readdir-recursive.svg?style=flat-square
-[travis-url]: https://travis-ci.org/fs-utils/fs-readdir-recursive
-[coveralls-image]: https://img.shields.io/coveralls/fs-utils/fs-readdir-recursive.svg?style=flat-square
-[coveralls-url]: https://coveralls.io/r/fs-utils/fs-readdir-recursive
-[david-image]: http://img.shields.io/david/fs-utils/fs-readdir-recursive.svg?style=flat-square
-[david-url]: https://david-dm.org/fs-utils/fs-readdir-recursive
-[license-image]: http://img.shields.io/npm/l/fs-readdir-recursive.svg?style=flat-square
-[license-url]: LICENSE
-[downloads-image]: http://img.shields.io/npm/dm/fs-readdir-recursive.svg?style=flat-square
-[downloads-url]: https://npmjs.org/package/fs-readdir-recursive
-[gittip-image]: https://img.shields.io/gratipay/jonathanong.svg?style=flat-square
-[gittip-url]: https://gratipay.com/jonathanong/

package/node_modules/fs-readdir-recursive/index.js

@@ -1,29 +0,0 @@
-var fs = require('fs')
-var path = require('path')
-
-module.exports = read
-
-function read(root, filter, files, prefix) {
-  prefix = prefix || ''
-  files = files || []
-  filter = filter || noDotFiles
-
-  var dir = path.join(root, prefix)
-  if (!fs.existsSync(dir)) return files
-  if (fs.statSync(dir).isDirectory())
-    fs.readdirSync(dir)
-    .filter(function (name, index) {
-      return filter(name, index, dir)
-    })
-    .forEach(function (name) {
-      read(root, filter, files, path.join(prefix, name))
-    })
-  else
-    files.push(prefix)
-
-  return files
-}
-
-function noDotFiles(x) {
-  return x[0] !== '.'
-}

package/node_modules/fs-readdir-recursive/package.json

@@ -1,60 +0,0 @@
-{
-  "_args": [
-    [
-      "fs-readdir-recursive@1.1.0",
-      "/home/sam/source/corellium/corellium-cli"
-    ]
-  ],
-  "_from": "fs-readdir-recursive@1.1.0",
-  "_id": "fs-readdir-recursive@1.1.0",
-  "_inBundle": false,
-  "_integrity": "sha512-GNanXlVr2pf02+sPN40XN8HG+ePaNcvM0q5mZBd668Obwb0yD5GiUbZOFgwn8kGMY6I3mdyDJzieUy3PTYyTRA==",
-  "_location": "/fs-readdir-recursive",
-  "_phantomChildren": {},
-  "_requested": {
-    "type": "version",
-    "registry": true,
-    "raw": "fs-readdir-recursive@1.1.0",
-    "name": "fs-readdir-recursive",
-    "escapedName": "fs-readdir-recursive",
-    "rawSpec": "1.1.0",
-    "saveSpec": null,
-    "fetchSpec": "1.1.0"
-  },
-  "_requiredBy": [
-    "/@babel/cli"
-  ],
-  "_resolved": "https://registry.npmjs.org/fs-readdir-recursive/-/fs-readdir-recursive-1.1.0.tgz",
-  "_spec": "1.1.0",
-  "_where": "/home/sam/source/corellium/corellium-cli",
-  "author": {
-    "name": "Jonathan Ong",
-    "email": "me@jongleberry.com",
-    "url": "http://jongleberry.com"
-  },
-  "bugs": {
-    "url": "https://github.com/fs-utils/fs-readdir-recursive/issues"
-  },
-  "description": "Recursively read a directory",
-  "devDependencies": {
-    "istanbul": "0",
-    "mocha": "3",
-    "should": "*"
-  },
-  "files": [
-    "index.js"
-  ],
-  "homepage": "https://github.com/fs-utils/fs-readdir-recursive#readme",
-  "license": "MIT",
-  "name": "fs-readdir-recursive",
-  "repository": {
-    "type": "git",
-    "url": "git+https://github.com/fs-utils/fs-readdir-recursive.git"
-  },
-  "scripts": {
-    "test": "mocha --reporter spec",
-    "test-cov": "istanbul cover node_modules/mocha/bin/_mocha -- --reporter dot",
-    "test-travis": "istanbul cover node_modules/mocha/bin/_mocha --report lcovonly -- --reporter dot"
-  },
-  "version": "1.1.0"
-}

package/node_modules/fs.realpath/LICENSE

@@ -1,43 +0,0 @@
-The ISC License
-
-Copyright (c) Isaac Z. Schlueter and Contributors
-
-Permission to use, copy, modify, and/or distribute this software for any
-purpose with or without fee is hereby granted, provided that the above
-copyright notice and this permission notice appear in all copies.
-
-THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
-MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
-ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR
-IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
-
-----
-
-This library bundles a version of the `fs.realpath` and `fs.realpathSync`
-methods from Node.js v0.10 under the terms of the Node.js MIT license.
-
-Node's license follows, also included at the header of `old.js` which contains
-the licensed code:
-
-  Copyright Joyent, Inc. and other Node contributors.
-
-  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.

package/node_modules/fs.realpath/README.md

@@ -1,33 +0,0 @@
-# fs.realpath
-
-A backwards-compatible fs.realpath for Node v6 and above
-
-In Node v6, the JavaScript implementation of fs.realpath was replaced
-with a faster (but less resilient) native implementation.  That raises
-new and platform-specific errors and cannot handle long or excessively
-symlink-looping paths.
-
-This module handles those cases by detecting the new errors and
-falling back to the JavaScript implementation.  On versions of Node
-prior to v6, it has no effect.
-
-## USAGE
-
-```js
-var rp = require('fs.realpath')
-
-// async version
-rp.realpath(someLongAndLoopingPath, function (er, real) {
-  // the ELOOP was handled, but it was a bit slower
-})
-
-// sync version
-var real = rp.realpathSync(someLongAndLoopingPath)
-
-// monkeypatch at your own risk!
-// This replaces the fs.realpath/fs.realpathSync builtins
-rp.monkeypatch()
-
-// un-do the monkeypatching
-rp.unmonkeypatch()
-```