Update from https://crrev.com/311076

base/i18n/build_utf8_validator_tables.cc

 // 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.
 
 // Create a state machine for validating UTF-8. The algorithm in brief:
 // 1. Convert the complete unicode range of code points, except for the
 //    surrogate code points, to an ordered array of sequences of bytes in
 //    UTF-8.
 // 2. Convert individual bytes to ranges, starting from the right of each byte
 //    sequence. For each range, ensure the bytes on the left and the ranges
@@ skipping 230 matching lines @@
   ConstructPairAndAppend(unconverted_bytes, new_range, converted, &new_pairs);
   new_pairs.swap(*pairs);
 }
 
 void MoveAllCharsToSets(PairVector* pairs) {
   // Since each pass of the function moves one character, and UTF-8 sequences
   // are at most 4 characters long, this simply runs the algorithm four times.
   for (int i = 0; i < 4; ++i) {
     MoveRightMostCharToSet(pairs);
   }
-#if DCHECK_IS_ON
+#if DCHECK_IS_ON()
   for (PairVector::const_iterator it = pairs->begin(); it != pairs->end();
        ++it) {
     DCHECK(it->character.empty());
   }
 #endif
 }
 
 // Logs the generated string sets in regular-expression style, ie. [\x00-\x7f],
 // [\xc2-\xdf][\x80-\xbf], etc. This can be a useful sanity-check that the
 // algorithm is working. Use the command-line option
@@ skipping 195 matching lines @@
   PrintStates(states, output);
 
   if (!filename.empty()) {
     if (!base::CloseFile(output))
       PLOG(FATAL) << "Couldn't finish writing '" << filename.AsUTF8Unsafe()
                   << "'";
   }
 
   return EXIT_SUCCESS;
 }