[DevTools] Generate separate copies of inspector_protocol.

third_party/WebKit/Source/platform/v8_inspector/V8DebuggerScript.cpp

 // 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"
 
-#include "platform/v8_inspector/V8StringUtil.h"
+#include "platform/v8_inspector/ProtocolPlatform.h"
+#include "platform/v8_inspector/StringUtil.h"
 
 namespace v8_inspector {
 
 static const char hexDigits[17] = "0123456789ABCDEF";
 
 static void appendUnsignedAsHex(unsigned number, String16Builder* destination)
 {
     for (size_t i = 0; i < 8; ++i) {
         UChar c = hexDigits[number & 0xF];
         destination->append(c);
         number >>= 4;
     }
 }
 
 // Hash algorithm for substrings is described in "Über die Komplexität der Multiplikation in
 // eingeschränkten Branchingprogrammmodellen" by Woelfe.
 // http://opendatastructures.org/versions/edition-0.1d/ods-java/node33.html#SECTION00832000000000000000
 static String16 calculateHash(const String16& str)
 {
     static uint64_t prime[] = { 0x3FB75161, 0xAB1F4E4F, 0x82675BC5, 0xCD924D35, 0x81ABE279 };
     static uint64_t random[] = { 0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0 };
     static uint32_t randomOdd[] = { 0xB4663807, 0xCC322BF5, 0xD4F91BBD, 0xA7BEA11D, 0x8F462907 };
 
     uint64_t hashes[] = { 0, 0, 0, 0, 0 };
     uint64_t zi[] = { 1, 1, 1, 1, 1 };
 
-    const size_t hashesSize = PROTOCOL_ARRAY_LENGTH(hashes);
+    const size_t hashesSize = V8_INSPECTOR_ARRAY_LENGTH(hashes);
 
     size_t current = 0;
     const uint32_t* data = nullptr;
     size_t sizeInBytes = sizeof(UChar) * str.length();
     data = reinterpret_cast<const uint32_t*>(str.characters16());
     for (size_t i = 0; i < sizeInBytes / 4; i += 4) {
         uint32_t v = data[i];
         uint64_t xi = v * randomOdd[current] & 0x7FFFFFFF;
         hashes[current] = (hashes[current] + zi[current] * xi) % prime[current];
         zi[current] = (zi[current] * random[current]) % prime[current];
@@ skipping 66 matching lines @@
     m_sourceMappingURL = sourceMappingURL;
 }
 
 void V8DebuggerScript::setSource(v8::Isolate* isolate, v8::Local<v8::String> source)
 {
     m_source.Reset(isolate, source);
     m_hash = calculateHash(toProtocolString(source));
 }
 
 } // namespace v8_inspector