deps: update v8_inspector

To add a LICENSE file along with the v8_inspector code, we need to
pick up v8_inspector from an intermediate repository:
https://github.com/pavelfeldman/v8_inspector. This repo still tracks
upstream code in Blink.

This roll also picks up the latest v8_inspector from upstream fixing
a few issues.

* Pickup commit id bc60957 from pavelfeldman/v8_inspector
* Update node.gyp to adapt to the new file paths
* Update the DevTools hash for the devtools frontend.

Fixes: https://github.com/nodejs/node/issues/7123
Fixes: https://github.com/nodejs/node/issues/7736
Fixes: https://github.com/nodejs/node/issues/7734
PR-URL: https://github.com/nodejs/node/pull/7796
Reviewed-By: bnoordhuis - Ben Noordhuis <info@bnoordhuis.nl>
Reviewed-By: jasnell - James M Snell <jasnell@gmail.com>

deps/v8_inspector/.gitignore

@@ -1 +0,0 @@
-platform/v8_inspector/build/rjsmin.pyc

deps/v8_inspector/README.md

@@ -1,10 +1,10 @@
 V8 Inspector support for Node.js
 ================================
 
-This directory is a gathering of dependencies for Node.js support for the
-[Chrome Debug Protocol][https://developer.chrome.com/devtools/docs/debugger-protocol].
+This repository is an intermediate repository that gathers the dependencies for
+Node.js support for the [Chrome Debug Protocol][https://developer.chrome.com/devtools/docs/debugger-protocol].
 
-* platform/v8_inspector: vendored from https://chromium.googlesource.com/chromium/src/third_party/WebKit/Source/platform/v8_inspector
-* platform/inspector_protocol: vendored from https://chromium.googlesource.com/chromium/src/third_party/WebKit/Source/platform/inspector_protocol
-* deps/jinja2: vendored from https://github.com/mitsuhiko/jinja2
-* deps/markupsafe: vendored from https://github.com/mitsuhiko/markupsafe
+* third_party/v8_inspector/platform/v8_inspector: vendored from https://chromium.googlesource.com/chromium/src/third_party/WebKit/Source/platform/v8_inspector
+* third_party/v8_inspector/platform/inspector_protocol: vendored from https://chromium.googlesource.com/chromium/src/third_party/WebKit/Source/platform/inspector_protocol
+* third_party/jinja2: vendored from https://github.com/mitsuhiko/jinja2
+* third_party/markupsafe: vendored from https://github.com/mitsuhiko/markupsafe

deps/v8_inspector/platform/inspector_protocol/Collections.h

@@ -1,23 +0,0 @@
-// Copyright 2016 The Chromium Authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#ifndef Collections_h
-#define Collections_h
-
-#if V8_INSPECTOR_USE_STL
-#include "platform/inspector_protocol/CollectionsSTL.h"
-#else
-#include "platform/inspector_protocol/CollectionsWTF.h"
-#endif // V8_INSPECTOR_USE_STL
-
-
-// Macro that returns a compile time constant with the length of an array, but gives an error if passed a non-array.
-template<typename T, size_t Size> char (&ArrayLengthHelperFunction(T (&)[Size]))[Size];
-// GCC needs some help to deduce a 0 length array.
-#if defined(__GNUC__)
-template<typename T> char (&ArrayLengthHelperFunction(T (&)[0]))[0];
-#endif
-#define PROTOCOL_ARRAY_LENGTH(array) sizeof(::ArrayLengthHelperFunction(array))
-
-#endif // !defined(Collections_h)

deps/v8_inspector/platform/inspector_protocol/CollectionsSTL.h

@@ -1,244 +0,0 @@
-// Copyright 2016 The Chromium Authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#ifndef CollectionsSTL_h
-#define CollectionsSTL_h
-
-#include "platform/inspector_protocol/Platform.h"
-#include "platform/inspector_protocol/String16.h"
-
-#include <algorithm>
-#include <map>
-#include <vector>
-
-namespace blink {
-namespace protocol {
-
-template <typename T>
-class Vector {
-public:
-    Vector() { }
-    Vector(size_t capacity) : m_impl(capacity) { }
-    typedef typename std::vector<T>::iterator iterator;
-    typedef typename std::vector<T>::const_iterator const_iterator;
-
-    iterator begin() { return m_impl.begin(); }
-    iterator end() { return m_impl.end(); }
-    const_iterator begin() const { return m_impl.begin(); }
-    const_iterator end() const { return m_impl.end(); }
-
-    void resize(size_t s) { m_impl.resize(s); }
-    size_t size() const { return m_impl.size(); }
-    bool isEmpty() const { return !m_impl.size(); }
-    T& operator[](size_t i) { return at(i); }
-    const T& operator[](size_t i) const { return at(i); }
-    T& at(size_t i) { return m_impl[i]; }
-    const T& at(size_t i) const { return m_impl.at(i); }
-    T& last() { return m_impl[m_impl.size() - 1]; }
-    const T& last() const { return m_impl[m_impl.size() - 1]; }
-    void append(const T& t) { m_impl.push_back(t); }
-    void prepend(const T& t) { m_impl.insert(m_impl.begin(), t); }
-    void remove(size_t i) { m_impl.erase(m_impl.begin() + i); }
-    void clear() { m_impl.clear(); }
-    void swap(Vector& other) { m_impl.swap(other.m_impl); }
-    void removeLast() { m_impl.pop_back(); }
-
-private:
-    std::vector<T> m_impl;
-};
-
-template <typename T>
-class Vector<std::unique_ptr<T>> {
-public:
-    Vector() { }
-    Vector(size_t capacity) : m_impl(capacity) { }
-    Vector(Vector&& other) { m_impl.swap(other.m_impl); }
-    ~Vector() { clear(); }
-
-    typedef typename std::vector<T*>::iterator iterator;
-    typedef typename std::vector<T*>::const_iterator const_iterator;
-
-    iterator begin() { return m_impl.begin(); }
-    iterator end() { return m_impl.end(); }
-    const_iterator begin() const { return m_impl.begin(); }
-    const_iterator end() const { return m_impl.end(); }
-
-    void resize(size_t s) { m_impl.resize(s); }
-    size_t size() const { return m_impl.size(); }
-    bool isEmpty() const { return !m_impl.size(); }
-    T* operator[](size_t i) { return at(i); }
-    const T* operator[](size_t i) const { return at(i); }
-    T* at(size_t i) { return m_impl[i]; }
-    const T* at(size_t i) const { return m_impl.at(i); }
-    T* last() { return m_impl[m_impl.size() - 1]; }
-    const T* last() const { return m_impl[m_impl.size() - 1]; }
-    void append(std::unique_ptr<T> t) { m_impl.push_back(t.release()); }
-    void prepend(std::unique_ptr<T> t) { m_impl.insert(m_impl.begin(), t.release()); }
-
-    void remove(size_t i)
-    {
-        delete m_impl[i];
-        m_impl.erase(m_impl.begin() + i);
-    }
-
-    void clear()
-    {
-        for (auto t : m_impl)
-            delete t;
-        m_impl.clear();
-    }
-
-    void swap(Vector& other) { m_impl.swap(other.m_impl); }
-    void swap(Vector&& other) { m_impl.swap(other.m_impl); }
-    void removeLast()
-    {
-        delete last();
-        m_impl.pop_back();
-    }
-
-private:
-    Vector(const Vector&) = delete;
-    Vector& operator=(const Vector&) = delete;
-    std::vector<T*> m_impl;
-};
-
-template <typename K, typename V, typename I>
-class HashMapIterator {
-public:
-    HashMapIterator(const I& impl) : m_impl(impl) { }
-    std::pair<K, V*>* get() const { m_pair.first = m_impl->first; m_pair.second = &m_impl->second; return &m_pair; }
-    std::pair<K, V*>& operator*() const { return *get(); }
-    std::pair<K, V*>* operator->() const { return get(); }
-
-    bool operator==(const HashMapIterator<K, V, I>& other) const { return m_impl == other.m_impl; }
-    bool operator!=(const HashMapIterator<K, V, I>& other) const { return m_impl != other.m_impl; }
-
-    HashMapIterator<K, V, I>& operator++() { ++m_impl; return *this; }
-
-private:
-    mutable std::pair<K, V*> m_pair;
-    I m_impl;
-};
-
-template <typename K, typename V, typename I>
-class HashMapIterator<K, std::unique_ptr<V>, I> {
-public:
-    HashMapIterator(const I& impl) : m_impl(impl) { }
-    std::pair<K, V*>* get() const { m_pair.first = m_impl->first; m_pair.second = m_impl->second; return &m_pair; }
-    std::pair<K, V*>& operator*() const { return *get(); }
-    std::pair<K, V*>* operator->() const { return get(); }
-
-    bool operator==(const HashMapIterator<K, std::unique_ptr<V>, I>& other) const { return m_impl == other.m_impl; }
-    bool operator!=(const HashMapIterator<K, std::unique_ptr<V>, I>& other) const { return m_impl != other.m_impl; }
-
-    HashMapIterator<K, std::unique_ptr<V>, I>& operator++() { ++m_impl; return *this; }
-
-private:
-    mutable std::pair<K, V*> m_pair;
-    I m_impl;
-};
-
-template <typename K, typename V>
-class HashMap {
-public:
-    HashMap() { }
-    ~HashMap() { }
-
-    using iterator = HashMapIterator<K, V, typename std::map<K, V>::iterator>;
-    using const_iterator = HashMapIterator<K, const V, typename std::map<K, V>::const_iterator>;
-
-    iterator begin() { return iterator(m_impl.begin()); }
-    iterator end() { return iterator(m_impl.end()); }
-    iterator find(const K& k) { return iterator(m_impl.find(k)); }
-    const_iterator begin() const { return const_iterator(m_impl.begin()); }
-    const_iterator end() const { return const_iterator(m_impl.end()); }
-    const_iterator find(const K& k) const { return const_iterator(m_impl.find(k)); }
-
-    size_t size() const { return m_impl.size(); }
-    bool isEmpty() const { return !m_impl.size(); }
-    bool set(const K& k, const V& v)
-    {
-        bool isNew = m_impl.find(k) == m_impl.end();
-        m_impl[k] = v;
-        return isNew;
-    }
-    bool contains(const K& k) const { return m_impl.find(k) != m_impl.end(); }
-    V get(const K& k) const { auto it = m_impl.find(k); return it == m_impl.end() ? V() : it->second; }
-    void remove(const K& k) { m_impl.erase(k); }
-    void clear() { m_impl.clear(); }
-    V take(const K& k)
-    {
-        V result = m_impl[k];
-        m_impl.erase(k);
-        return result;
-    }
-
-private:
-    std::map<K, V> m_impl;
-};
-
-template <typename K, typename V>
-class HashMap<K, std::unique_ptr<V>> {
-public:
-    HashMap() { }
-    ~HashMap() { clear(); }
-
-    using iterator = HashMapIterator<K, std::unique_ptr<V>, typename std::map<K, V*>::iterator>;
-    using const_iterator = HashMapIterator<K, std::unique_ptr<V>, typename std::map<K, V*>::const_iterator>;
-
-    iterator begin() { return iterator(m_impl.begin()); }
-    iterator end() { return iterator(m_impl.end()); }
-    iterator find(const K& k) { return iterator(m_impl.find(k)); }
-    const_iterator begin() const { return const_iterator(m_impl.begin()); }
-    const_iterator end() const { return const_iterator(m_impl.end()); }
-    const_iterator find(const K& k) const { return const_iterator(m_impl.find(k)); }
-
-    size_t size() const { return m_impl.size(); }
-    bool isEmpty() const { return !m_impl.size(); }
-    bool set(const K& k, std::unique_ptr<V> v)
-    {
-        bool isNew = m_impl.find(k) == m_impl.end();
-        if (!isNew)
-            delete m_impl[k];
-        m_impl[k] = v.release();
-        return isNew;
-    }
-    bool contains(const K& k) const { return m_impl.find(k) != m_impl.end(); }
-    V* get(const K& k) const { auto it = m_impl.find(k); return it == m_impl.end() ? nullptr : it->second; }
-    std::unique_ptr<V> take(const K& k)
-    {
-        if (!contains(k))
-            return nullptr;
-        std::unique_ptr<V> result(m_impl[k]);
-        delete m_impl[k];
-        m_impl.erase(k);
-        return result;
-    }
-    void remove(const K& k)
-    {
-        delete m_impl[k];
-        m_impl.erase(k);
-    }
-
-    void clear()
-    {
-        for (auto pair : m_impl)
-            delete pair.second;
-        m_impl.clear();
-    }
-
-private:
-    std::map<K, V*> m_impl;
-};
-
-template <typename K>
-class HashSet : public protocol::HashMap<K, K> {
-public:
-    void add(const K& k) { this->set(k, k); }
-};
-
-} // namespace platform
-} // namespace blink
-
-#endif // !defined(CollectionsSTL_h)

deps/v8_inspector/platform/inspector_protocol/CollectionsWTF.h

@@ -1,193 +0,0 @@
-// Copyright 2016 The Chromium Authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#ifndef CollectionsWTF_h
-#define CollectionsWTF_h
-
-#include "wtf/Allocator.h"
-#include "wtf/HashMap.h"
-#include "wtf/PtrUtil.h"
-#include "wtf/Vector.h"
-#include "wtf/VectorTraits.h"
-
-namespace blink {
-namespace protocol {
-
-template <typename T>
-class Vector {
-public:
-    Vector() { }
-    Vector(size_t capacity) : m_impl(capacity) { }
-    typedef T* iterator;
-    typedef const T* const_iterator;
-
-    iterator begin() { return m_impl.begin(); }
-    iterator end() { return m_impl.end(); }
-    const_iterator begin() const { return m_impl.begin(); }
-    const_iterator end() const { return m_impl.end(); }
-
-    void resize(size_t s) { m_impl.resize(s); }
-    size_t size() const { return m_impl.size(); }
-    bool isEmpty() const { return m_impl.isEmpty(); }
-    T& operator[](size_t i) { return at(i); }
-    const T& operator[](size_t i) const { return at(i); }
-    T& at(size_t i) { return m_impl.at(i); }
-    const T& at(size_t i) const { return m_impl.at(i); }
-    T& last() { return m_impl.last(); }
-    const T& last() const { return m_impl.last(); }
-    void append(const T& t) { m_impl.append(t); }
-    void prepend(const T& t) { m_impl.prepend(t); }
-    void remove(size_t i) { m_impl.remove(i); }
-    void clear() { m_impl.clear(); }
-    void swap(Vector<T>& other) { m_impl.swap(other.m_impl); }
-    void removeLast() { m_impl.removeLast(); }
-
-private:
-    WTF::Vector<T> m_impl;
-};
-
-template <typename T>
-class Vector<std::unique_ptr<T>> {
-    WTF_MAKE_NONCOPYABLE(Vector);
-public:
-    Vector() { }
-    Vector(size_t capacity) : m_impl(capacity) { }
-    Vector(Vector<std::unique_ptr<T>>&& other) : m_impl(std::move(other.m_impl)) { }
-    ~Vector() { }
-
-    typedef std::unique_ptr<T>* iterator;
-    typedef const std::unique_ptr<T>* const_iterator;
-
-    iterator begin() { return m_impl.begin(); }
-    iterator end() { return m_impl.end(); }
-    const_iterator begin() const { return m_impl.begin(); }
-    const_iterator end() const { return m_impl.end(); }
-
-    void resize(size_t s) { m_impl.resize(s); }
-    size_t size() const { return m_impl.size(); }
-    bool isEmpty() const { return m_impl.isEmpty(); }
-    T* operator[](size_t i) { return m_impl.at(i).get(); }
-    const T* operator[](size_t i) const { return m_impl.at(i).get(); }
-    T* at(size_t i) { return m_impl.at(i).get(); }
-    const T* at(size_t i) const { return m_impl.at(i).get(); }
-    T* last() { return m_impl.last().get(); }
-    const T* last() const { return m_impl.last(); }
-    void append(std::unique_ptr<T> t) { m_impl.append(std::move(t)); }
-    void prepend(std::unique_ptr<T> t) { m_impl.prepend(std::move(t)); }
-    void remove(size_t i) { m_impl.remove(i); }
-    void clear() { m_impl.clear(); }
-    void swap(Vector<std::unique_ptr<T>>& other) { m_impl.swap(other.m_impl); }
-    void swap(Vector<std::unique_ptr<T>>&& other) { m_impl.swap(other.m_impl); }
-    void removeLast() { m_impl.removeLast(); }
-
-private:
-    WTF::Vector<std::unique_ptr<T>> m_impl;
-};
-
-template <typename K, typename V, typename I>
-class HashMapIterator {
-    STACK_ALLOCATED();
-public:
-    HashMapIterator(const I& impl) : m_impl(impl) { }
-    std::pair<K, V*>* get() const { m_pair = std::make_pair(m_impl->key, &m_impl->value); return &m_pair; }
-    std::pair<K, V*>& operator*() const { return *get(); }
-    std::pair<K, V*>* operator->() const { return get(); }
-
-    bool operator==(const HashMapIterator<K, V, I>& other) const { return m_impl == other.m_impl; }
-    bool operator!=(const HashMapIterator<K, V, I>& other) const { return m_impl != other.m_impl; }
-
-    HashMapIterator<K, V, I>& operator++() { ++m_impl; return *this; }
-
-private:
-    mutable std::pair<K, V*> m_pair;
-    I m_impl;
-};
-
-template <typename K, typename V, typename I>
-class HashMapIterator<K, std::unique_ptr<V>, I> {
-    STACK_ALLOCATED();
-public:
-    HashMapIterator(const I& impl) : m_impl(impl) { }
-    std::pair<K, V*>* get() const { m_pair = std::make_pair(m_impl->key, m_impl->value.get()); return &m_pair; }
-    std::pair<K, V*>& operator*() const { return *get(); }
-    std::pair<K, V*>* operator->() const { return get(); }
-
-    bool operator==(const HashMapIterator<K, std::unique_ptr<V>, I>& other) const { return m_impl == other.m_impl; }
-    bool operator!=(const HashMapIterator<K, std::unique_ptr<V>, I>& other) const { return m_impl != other.m_impl; }
-
-    HashMapIterator<K, std::unique_ptr<V>, I>& operator++() { ++m_impl; return *this; }
-
-private:
-    mutable std::pair<K, V*> m_pair;
-    I m_impl;
-};
-
-template <typename K, typename V>
-class HashMap {
-public:
-    HashMap() { }
-    ~HashMap() { }
-
-    using iterator = HashMapIterator<K, V, typename WTF::HashMap<K, V>::iterator>;
-    using const_iterator = HashMapIterator<K, const V, typename WTF::HashMap<K, V>::const_iterator>;
-
-    iterator begin() { return iterator(m_impl.begin()); }
-    iterator end() { return iterator(m_impl.end()); }
-    iterator find(const K& k) { return iterator(m_impl.find(k)); }
-    const_iterator begin() const { return const_iterator(m_impl.begin()); }
-    const_iterator end() const { return const_iterator(m_impl.end()); }
-    const_iterator find(const K& k) const { return const_iterator(m_impl.find(k)); }
-
-    size_t size() const { return m_impl.size(); }
-    bool isEmpty() const { return m_impl.isEmpty(); }
-    bool set(const K& k, const V& v) { return m_impl.set(k, v).isNewEntry; }
-    bool contains(const K& k) const { return m_impl.contains(k); }
-    V get(const K& k) const { return m_impl.get(k); }
-    void remove(const K& k) { m_impl.remove(k); }
-    void clear() { m_impl.clear(); }
-    V take(const K& k) { return m_impl.take(k); }
-
-private:
-    WTF::HashMap<K, V> m_impl;
-};
-
-template <typename K, typename V>
-class HashMap<K, std::unique_ptr<V>> {
-public:
-    HashMap() { }
-    ~HashMap() { }
-
-    using iterator = HashMapIterator<K, std::unique_ptr<V>, typename WTF::HashMap<K, std::unique_ptr<V>>::iterator>;
-    using const_iterator = HashMapIterator<K, std::unique_ptr<V>, typename WTF::HashMap<K, std::unique_ptr<V>>::const_iterator>;
-
-    iterator begin() { return iterator(m_impl.begin()); }
-    iterator end() { return iterator(m_impl.end()); }
-    iterator find(const K& k) { return iterator(m_impl.find(k)); }
-    const_iterator begin() const { return const_iterator(m_impl.begin()); }
-    const_iterator end() const { return const_iterator(m_impl.end()); }
-    const_iterator find(const K& k) const { return const_iterator(m_impl.find(k)); }
-
-    size_t size() const { return m_impl.size(); }
-    bool isEmpty() const { return m_impl.isEmpty(); }
-    bool set(const K& k, std::unique_ptr<V> v) { return m_impl.set(k, std::move(v)).isNewEntry; }
-    bool contains(const K& k) const { return m_impl.contains(k); }
-    V* get(const K& k) const { return m_impl.get(k); }
-    std::unique_ptr<V> take(const K& k) { return m_impl.take(k); }
-    void remove(const K& k) { m_impl.remove(k); }
-    void clear() { m_impl.clear(); }
-
-private:
-    WTF::HashMap<K, std::unique_ptr<V>> m_impl;
-};
-
-template <typename K>
-class HashSet : public protocol::HashMap<K, K> {
-public:
-    void add(const K& k) { this->set(k, k); }
-};
-
-} // namespace platform
-} // namespace blink
-
-#endif // !defined(CollectionsWTF_h)

deps/v8_inspector/platform/v8_inspector/V8DebuggerScript.cpp

@@ -1,104 +0,0 @@
-// Copyright 2014 The Chromium Authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include "platform/v8_inspector/V8DebuggerScript.h"
-
-namespace blink {
-
-V8DebuggerScript::V8DebuggerScript()
-    : m_startLine(0)
-    , m_startColumn(0)
-    , m_endLine(0)
-    , m_endColumn(0)
-    , m_executionContextId(0)
-    , m_isContentScript(false)
-    , m_isInternalScript(false)
-    , m_isLiveEdit(false)
-{
-}
-
-String16 V8DebuggerScript::sourceURL() const
-{
-    return m_sourceURL.isEmpty() ? m_url : m_sourceURL;
-}
-
-V8DebuggerScript& V8DebuggerScript::setURL(const String16& url)
-{
-    m_url = url;
-    return *this;
-}
-
-V8DebuggerScript& V8DebuggerScript::setSourceURL(const String16& sourceURL)
-{
-    m_sourceURL = sourceURL;
-    return *this;
-}
-
-V8DebuggerScript& V8DebuggerScript::setSourceMappingURL(const String16& sourceMappingURL)
-{
-    m_sourceMappingURL = sourceMappingURL;
-    return *this;
-}
-
-V8DebuggerScript& V8DebuggerScript::setSource(const String16& source)
-{
-    m_source = source;
-    return *this;
-}
-
-V8DebuggerScript& V8DebuggerScript::setHash(const String16& hash)
-{
-    m_hash = hash;
-    return *this;
-}
-
-V8DebuggerScript& V8DebuggerScript::setStartLine(int startLine)
-{
-    m_startLine = startLine;
-    return *this;
-}
-
-V8DebuggerScript& V8DebuggerScript::setStartColumn(int startColumn)
-{
-    m_startColumn = startColumn;
-    return *this;
-}
-
-V8DebuggerScript& V8DebuggerScript::setEndLine(int endLine)
-{
-    m_endLine = endLine;
-    return *this;
-}
-
-V8DebuggerScript& V8DebuggerScript::setEndColumn(int endColumn)
-{
-    m_endColumn = endColumn;
-    return *this;
-}
-
-V8DebuggerScript& V8DebuggerScript::setExecutionContextId(int executionContextId)
-{
-    m_executionContextId = executionContextId;
-    return *this;
-}
-
-V8DebuggerScript& V8DebuggerScript::setIsContentScript(bool isContentScript)
-{
-    m_isContentScript = isContentScript;
-    return *this;
-}
-
-V8DebuggerScript& V8DebuggerScript::setIsInternalScript(bool isInternalScript)
-{
-    m_isInternalScript = isInternalScript;
-    return *this;
-}
-
-V8DebuggerScript& V8DebuggerScript::setIsLiveEdit(bool isLiveEdit)
-{
-    m_isLiveEdit = isLiveEdit;
-    return *this;
-}
-
-} // namespace blink

deps/v8_inspector/platform/v8_inspector/public/ConsoleAPITypes.h

@@ -1,47 +0,0 @@
-/*
- * Copyright (C) 2012 Google Inc. All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1.  Redistributions of source code must retain the above copyright
- *     notice, this list of conditions and the following disclaimer.
- * 2.  Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND ANY
- * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
- * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
- * DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR ANY
- * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
- * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
- * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef ConsoleAPITypes_h
-#define ConsoleAPITypes_h
-
-namespace blink {
-
-enum MessageType {
-    LogMessageType = 1,
-    DirMessageType,
-    DirXMLMessageType,
-    TableMessageType,
-    TraceMessageType,
-    StartGroupMessageType,
-    StartGroupCollapsedMessageType,
-    EndGroupMessageType,
-    ClearMessageType,
-    AssertMessageType,
-    TimeEndMessageType,
-    CountMessageType
-};
-
-} // namespace blink
-
-#endif // ConsoleAPITypes_h

deps/v8_inspector/platform/v8_inspector/public/ConsoleTypes.h

@@ -1,55 +0,0 @@
-/*
- * Copyright (C) 2011 Apple Inc. All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
- * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
- * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
- * THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef ConsoleTypes_h
-#define ConsoleTypes_h
-
-namespace blink {
-
-enum MessageSource {
-    XMLMessageSource,
-    JSMessageSource,
-    NetworkMessageSource,
-    ConsoleAPIMessageSource,
-    StorageMessageSource,
-    AppCacheMessageSource,
-    RenderingMessageSource,
-    SecurityMessageSource,
-    OtherMessageSource,
-    DeprecationMessageSource,
-};
-
-enum MessageLevel {
-    DebugMessageLevel = 4,
-    LogMessageLevel = 1,
-    InfoMessageLevel = 5,
-    WarningMessageLevel = 2,
-    ErrorMessageLevel = 3,
-    RevokedErrorMessageLevel = 6
-};
-
-} // namespace blink
-
-#endif // ConsoleTypes_h

deps/v8_inspector/platform/v8_inspector/public/V8ToProtocolValue.h

@@ -1,17 +0,0 @@
-// Copyright 2016 The Chromium Authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#ifndef V8ToProtocolValue_h
-#define V8ToProtocolValue_h
-
-#include "platform/inspector_protocol/Values.h"
-#include <v8.h>
-
-namespace blink {
-
-PLATFORM_EXPORT std::unique_ptr<protocol::Value> toProtocolValue(v8::Local<v8::Context>, v8::Local<v8::Value>, int maxDepth = protocol::Value::maxDepth);
-
-} // namespace blink
-
-#endif // V8ToProtocolValue_h

deps/v8_inspector/deps/jinja2/LICENSE → deps/v8_inspector/third_party/jinja2/LICENSE

@@ -1,31 +1,31 @@
-Copyright (c) 2009 by the Jinja Team, see AUTHORS for more details.
-
-Some rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are
-met:
-
-    * Redistributions of source code must retain the above copyright
-      notice, this list of conditions and the following disclaimer.
-
-    * Redistributions in binary form must reproduce the above
-      copyright notice, this list of conditions and the following
-      disclaimer in the documentation and/or other materials provided
-      with the distribution.
-
-    * The names of the contributors may not be used to endorse or
-      promote products derived from this software without specific
-      prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+Copyright (c) 2009 by the Jinja Team, see AUTHORS for more details.
+
+Some rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+    * Redistributions of source code must retain the above copyright
+      notice, this list of conditions and the following disclaimer.
+
+    * Redistributions in binary form must reproduce the above
+      copyright notice, this list of conditions and the following
+      disclaimer in the documentation and/or other materials provided
+      with the distribution.
+
+    * The names of the contributors may not be used to endorse or
+      promote products derived from this software without specific
+      prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

deps/v8_inspector/deps/jinja2/docs/_themes/jinja/static/jinja.css_t → deps/v8_inspector/third_party/jinja2/docs/_themes/jinja/static/jinja.css_t

@@ -12,11 +12,11 @@
 {% set sidebar_width = '220px' %}
 {% set font_family = 'Georgia, serif' %}
 {% set header_font_family = 'Crimson Text, ' ~ font_family %}
-
+ 
 @import url("basic.css");
-
+ 
 /* -- page layout ----------------------------------------------------------- */
-
+ 
 body {
     font-family: {{ font_family }};
     font-size: 17px;
@@ -47,7 +47,7 @@ div.sphinxsidebar {
 hr {
     border: 1px solid #B1B4B6;
 }
-
+ 
 div.body {
     background-color: #ffffff;
     color: #3E4349;
@@ -58,7 +58,7 @@ img.floatingflask {
     padding: 0 0 10px 10px;
     float: right;
 }
-
+ 
 div.footer {
     width: {{ page_width }};
     margin: 20px auto 30px auto;
@@ -74,7 +74,7 @@ div.footer a {
 div.related {
     display: none;
 }
-
+ 
 div.sphinxsidebar a {
     color: #444;
     text-decoration: none;
@@ -84,7 +84,7 @@ div.sphinxsidebar a {
 div.sphinxsidebar a:hover {
     border-bottom: 1px solid #999;
 }
-
+ 
 div.sphinxsidebar {
     font-size: 15px;
     line-height: 1.5;
@@ -99,7 +99,7 @@ div.sphinxsidebarwrapper p.logo {
     margin: 0;
     text-align: center;
 }
-
+ 
 div.sphinxsidebar h3,
 div.sphinxsidebar h4 {
     font-family: {{ font_family }};
@@ -113,7 +113,7 @@ div.sphinxsidebar h4 {
 div.sphinxsidebar h4 {
     font-size: 20px;
 }
-
+ 
 div.sphinxsidebar h3 a {
     color: #444;
 }
@@ -124,7 +124,7 @@ div.sphinxsidebar p.logo a:hover,
 div.sphinxsidebar h3 a:hover {
     border: none;
 }
-
+ 
 div.sphinxsidebar p {
     color: #555;
     margin: 10px 0;
@@ -135,7 +135,7 @@ div.sphinxsidebar ul {
     padding: 0;
     color: #000;
 }
-
+ 
 div.sphinxsidebar input {
     border: 1px solid #ccc;
     font-family: {{ font_family }};
@@ -145,19 +145,19 @@ div.sphinxsidebar input {
 div.sphinxsidebar form.search input[name="q"] {
     width: 130px;
 }
-
+ 
 /* -- body styles ----------------------------------------------------------- */
-
+ 
 a {
     color: #aa0000;
     text-decoration: underline;
 }
-
+ 
 a:hover {
     color: #dd0000;
     text-decoration: underline;
 }
-
+ 
 div.body h1,
 div.body h2,
 div.body h3,
@@ -170,25 +170,25 @@ div.body h6 {
     padding: 0;
     color: black;
 }
-
+ 
 div.body h1 { margin-top: 0; padding-top: 0; font-size: 240%; }
 div.body h2 { font-size: 180%; }
 div.body h3 { font-size: 150%; }
 div.body h4 { font-size: 130%; }
 div.body h5 { font-size: 100%; }
 div.body h6 { font-size: 100%; }
-
+ 
 a.headerlink {
     color: #ddd;
     padding: 0 4px;
     text-decoration: none;
 }
-
+ 
 a.headerlink:hover {
     color: #444;
     background: #eaeaea;
 }
-
+ 
 div.body p, div.body dd, div.body li {
     line-height: 1.4em;
 }
@@ -235,20 +235,20 @@ div.note {
     background-color: #eee;
     border: 1px solid #ccc;
 }
-
+ 
 div.seealso {
     background-color: #ffc;
     border: 1px solid #ff6;
 }
-
+ 
 div.topic {
     background-color: #eee;
 }
-
+ 
 p.admonition-title {
     display: inline;
 }
-
+ 
 p.admonition-title:after {
     content: ":";
 }
@@ -342,7 +342,7 @@ ul, ol {
     margin: 10px 0 10px 30px;
     padding: 0;
 }
-
+ 
 pre {
     background: #eee;
     padding: 7px 30px;
@@ -359,7 +359,7 @@ dl dl pre {
     margin-left: -90px;
     padding-left: 90px;
 }
-
+ 
 tt {
     background-color: #E8EFF0;
     color: #222;

deps/v8_inspector/deps/jinja2/docs/api.rst → deps/v8_inspector/third_party/jinja2/docs/api.rst

@@ -197,7 +197,7 @@ useful if you want to dig deeper into Jinja2 or :ref:`develop extensions
         For a more complex example you can provide a hint.  For example
         the :func:`first` filter creates an undefined object that way::
 
-            return environment.undefined('no first item, sequence was empty')
+            return environment.undefined('no first item, sequence was empty')            
 
         If it the `name` or `obj` is known (for example because an attribute
         was accessed) it should be passed to the undefined object, even if
@@ -714,7 +714,7 @@ Here a simple test that checks if a variable is a prime number::
             if n % i == 0:
                 return False
         return True
-
+        
 
 You can register it on the template environment by updating the
 :attr:`~Environment.tests` dict on the environment::

deps/v8_inspector/deps/jinja2/docs/extensions.rst → deps/v8_inspector/third_party/jinja2/docs/extensions.rst

@@ -27,8 +27,8 @@ i18n Extension
 
 **Import name:** `jinja2.ext.i18n`
 
-The i18n extension can be used in combination with `gettext`_ or `babel`_.  If
-the i18n extension is enabled Jinja2 provides a `trans` statement that marks
+The i18n extension can be used in combination with `gettext`_ or `babel`_.  If 
+the i18n extension is enabled Jinja2 provides a `trans` statement that marks 
 the wrapped string as translatable and calls `gettext`.
 
 After enabling, dummy `_` function that forwards calls to `gettext` is added

deps/v8_inspector/deps/jinja2/docs/intro.rst → deps/v8_inspector/third_party/jinja2/docs/intro.rst

@@ -64,7 +64,7 @@ which will install the package via `distribute` in development mode.  This also
 has the advantage that the C extensions are compiled.
 
 .. _download page: http://pypi.python.org/pypi/Jinja2
-.. _distribute: http://pypi.python.org/pypi/distribute
+.. _distribute: http://pypi.python.org/pypi/distribute 
 .. _setuptools: http://peak.telecommunity.com/DevCenter/setuptools
 .. _easy_install: http://peak.telecommunity.com/DevCenter/EasyInstall
 .. _pip: http://pypi.python.org/pypi/pip

deps/v8_inspector/deps/jinja2/docs/jinjastyle.sty → deps/v8_inspector/third_party/jinja2/docs/jinjastyle.sty

@@ -22,7 +22,7 @@
       %\sphinxlogo%
       {\center
         \vspace*{3cm}
-	\includegraphics{logo.pdf}
+      	\includegraphics{logo.pdf}
         \vspace{3cm}
 	\par
         {\rm\Huge \@title \par}%

deps/v8_inspector/deps/jinja2/docs/templates.rst → deps/v8_inspector/third_party/jinja2/docs/templates.rst

@@ -197,14 +197,14 @@ without the `trim_blocks` and `lstrip_blocks` options, this template::
 gets rendered with blank lines inside the div::
 
     <div>
-
+    
             yay
-
+    
     </div>
 
 But with both `trim_blocks` and `lstrip_blocks` enabled, the template block
 lines are removed and other whitespace is preserved::
-
+    
     <div>
             yay
     </div>
@@ -522,12 +522,12 @@ Working with Automatic Escaping
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 
 When automatic escaping is enabled, everything is escaped by default except
-for values explicitly marked as safe.  Variables and expressions
+for values explicitly marked as safe.  Variables and expressions 
 can be marked as safe either in:
 
 a. the context dictionary by the application with `MarkupSafe.Markup`, or
 b. the template, with the `|safe` filter
-
+   
 The main problem with this approach is that Python itself doesn't have the
 concept of tainted values; so whether a value is safe or unsafe can get lost.
 

deps/v8_inspector/deps/jinja2/ext/django2jinja/django2jinja.py → deps/v8_inspector/third_party/jinja2/ext/django2jinja/django2jinja.py

@@ -33,13 +33,13 @@
         writer = Writer()
         writer.node_handlers[MyNode] = write_my_node
         convert_templates('/path/to/output/folder', writer=writer)
-
+    
     Here is an example hos to automatically translate your django
     variables to jinja2::
-
+        
         import re
         # List of tuple (Match pattern, Replace pattern, Exclusion pattern)
-
+        
         var_re  = ((re.compile(r"(u|user)\.is_authenticated"), r"\1.is_authenticated()", None),
                   (re.compile(r"\.non_field_errors"), r".non_field_errors()", None),
                   (re.compile(r"\.label_tag"), r".label_tag()", None),
@@ -47,7 +47,7 @@
                   (re.compile(r"\.as_table"), r".as_table()", None),
                   (re.compile(r"\.as_widget"), r".as_widget()", None),
                   (re.compile(r"\.as_hidden"), r".as_hidden()", None),
-
+                  
                   (re.compile(r"\.get_([0-9_\w]+)_url"), r".get_\1_url()", None),
                   (re.compile(r"\.url"), r".url()", re.compile(r"(form|calendar).url")),
                   (re.compile(r"\.get_([0-9_\w]+)_display"), r".get_\1_display()", None),
@@ -55,14 +55,14 @@
                   (re.compile(r"loop\.revcounter"), r"loop.revindex", None),
                   (re.compile(r"request\.GET\.([0-9_\w]+)"), r"request.GET.get('\1', '')", None),
                   (re.compile(r"request\.get_host"), r"request.get_host()", None),
-
+                  
                   (re.compile(r"\.all(?!_)"), r".all()", None),
                   (re.compile(r"\.all\.0"), r".all()[0]", None),
                   (re.compile(r"\.([0-9])($|\s+)"), r"[\1]\2", None),
                   (re.compile(r"\.items"), r".items()", None),
         )
         writer = Writer(var_re=var_re)
-
+        
     For details about the writing process have a look at the module code.
 
     :copyright: (c) 2009 by the Jinja Team.
@@ -314,7 +314,7 @@ class Writer(object):
         """Performs variable name translation."""
         if self.in_loop and var == 'forloop' or var.startswith('forloop.'):
             var = var[3:]
-
+        
         for reg, rep, unless in self.var_re:
             no_unless = unless and unless.search(var) or True
             if reg.search(var) and no_unless:
@@ -425,7 +425,7 @@ def if_condition(writer, node):
     join_with = 'and'
     if node.link_type == core_tags.IfNode.LinkTypes.or_:
         join_with = 'or'
-
+    
     for idx, (ifnot, expr) in enumerate(node.bool_exprs):
         if idx:
             writer.write(' %s ' % join_with)
@@ -734,22 +734,22 @@ def simple_tag(writer, node):
         writer._filters_warned.add(name)
         writer.warn('Filter %s probably doesn\'t exist in Jinja' %
                     name)
-
+        
     if not node.vars_to_resolve:
         # No argument, pass the request
         writer.start_variable()
         writer.write('request|')
         writer.write(name)
         writer.end_variable()
-        return
-
+        return 
+    
     first_var =  node.vars_to_resolve[0]
     args = node.vars_to_resolve[1:]
     writer.start_variable()
-
+    
     # Copied from Writer.filters()
     writer.node(first_var)
-
+    
     writer.write('|')
     writer.write(name)
     if args:
@@ -762,7 +762,7 @@ def simple_tag(writer, node):
             else:
                 writer.literal(var.literal)
         writer.write(')')
-    writer.end_variable()
+    writer.end_variable()   
 
 # get rid of node now, it shouldn't be used normally
 del node