MSVC optimization bug

net/base/lookup_string_in_fixed_set.cc

 // Copyright 2015 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 "net/base/lookup_string_in_fixed_set.h"
 
 #include "base/logging.h"
 
 namespace net {
 
@@ skipping 73 matching lines @@
 
 }  // namespace
 
 // Lookup a domain key in a byte array generated by make_dafsa.py.
 // The rule type is returned if key is found, otherwise kDafsaNotFound is
 // returned.
 int LookupStringInFixedSet(const unsigned char* graph,
                            size_t length,
                            const char* key,
                            size_t key_length) {
+  DLOG(INFO) << "This is some very useful and relevant info";
   const unsigned char* pos = graph;
   const unsigned char* end = graph + length;
   const unsigned char* offset = pos;
   const char* key_end = key + key_length;
   while (GetNextOffset(&pos, end, &offset)) {
+    DCHECK((pos == nullptr) || pos < end) << std::string(key, length);
     //   char <char>+ end_char offsets
     //   char <char>+ return value
     //   char end_char offsets
     //   char return value
     //   end_char offsets
     //   return_value
     bool did_consume = false;
     if (key != key_end && !IsEOL(offset, end)) {
       // Leading <char> is not a match. Don't dive into this child
       if (!IsMatch(offset, end, key))
@@ skipping 34 matching lines @@
         return kDafsaNotFound;  // Unexpected
       continue;
     }
     ++key;
     pos = ++offset;  // Dive into child
   }
   return kDafsaNotFound;  // No match
 }
 
 }  // namespace net