Mitigate spoofing attempt using Latin letters.

base/lookup_string_in_fixed_set.h

 // 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.
 
-#ifndef NET_BASE_LOOKUP_STRING_IN_FIXED_SET_H_
-#define NET_BASE_LOOKUP_STRING_IN_FIXED_SET_H_
+#ifndef BASE_LOOKUP_STRING_IN_FIXED_SET_H_
+#define BASE_LOOKUP_STRING_IN_FIXED_SET_H_
 
 #include <stddef.h>
 
-#include "net/base/net_export.h"
+#include "base/base_export.h"
 
-namespace net {
+namespace base {
 
 enum {
   kDafsaNotFound = -1,  // key is not in set
   kDafsaFound = 0,      // key is in set
   // The following return values are used by the implementation of
   // GetDomainAndRegistry() and are probably not generally useful.
   kDafsaExceptionRule = 1,  // key excluded from set via exception
   kDafsaWildcardRule = 2,   // key matched a wildcard rule
   kDafsaPrivateRule = 4,    // key matched a private rule
 };
 
 // Looks up the string |key| with length |key_length| in a fixed set of
 // strings. The set of strings must be known at compile time. It is converted to
 // a graph structure named a DAFSA (Deterministic Acyclic Finite State
 // Automaton) by the script make_dafsa.py during compilation. This permits
 // efficient (in time and space) lookup. The graph generated by make_dafsa.py
 // takes the form of a constant byte array which should be supplied via the
 // |graph| and |length| parameters.  The return value is kDafsaNotFound,
 // kDafsaFound, or a bitmap consisting of one or more of kDafsaExceptionRule,
 // kDafsaWildcardRule and kDafsaPrivateRule ORed together.
 //
 // TODO(nick): Replace this with FixedSetIncrementalLookup everywhere.
-NET_EXPORT int LookupStringInFixedSet(const unsigned char* graph,
+BASE_EXPORT int LookupStringInFixedSet(const unsigned char* graph,
                                       size_t length,
                                       const char* key,
                                       size_t key_length);
 
 // FixedSetIncrementalLookup provides efficient membership and prefix queries
 // against a fixed set of strings. The set of strings must be known at compile
 // time. The set is converted to a graph structure named a DAFSA (Deterministic
 // Acyclic Finite State Automaton) by the script //net/tools/dafsa/make_dafsa.py
 // during compilation. The conversion generates a C++ header file defining the
 // encoded graph as a constant byte array. This class provides a fast, constant-
@@ skipping 23 matching lines @@
 //    FixedSetIncrementalLookup prefix_lookup(kDafsa, sizeof(kDafsa));
 //    size_t longest_match_end = 0;
 //    for (size_t i = 0; i < input.length(); ++i) {
 //      if (!prefix_lookup.Advance(input[i]))
 //         break;
 //      if (prefix_lookup.GetResultForCurrentSequence() == 3)
 //        longest_match_end = (i + 1);
 //    }
 //    return input.substr(0, longest_match_end);
 //
-class NET_EXPORT FixedSetIncrementalLookup {
+class BASE_EXPORT FixedSetIncrementalLookup {
  public:
   // Begin a lookup against the provided fixed set. |graph| and |length|
   // describe a byte buffer generated by the make_dafsa.py script, as described
   // in the class comment.
   //
   // FixedSetIncrementalLookup is initialized to a state corresponding to the
   // empty input sequence. Calling GetResultForCurrentSequence() in the initial
   // state would indicate whether the empty string appears in the fixed set.
   // Characters can be added to the sequence by calling Advance(), and the
   // lookup result can be checked after each addition by calling
@@ skipping 45 matching lines @@
   // Pointer just past the end of the graph. |pos_| should never get here. This
   // is used only in DCHECKs.
   const unsigned char* end_;
 
   // Contains the current decoder state. If true, |pos_| points to a label
   // character or a return code. If false, |pos_| points to a sequence of
   // offsets that indicate the child nodes of the current state.
   bool pos_is_label_character_;
 };
 
-}  // namespace net
+}  // namespace base
 
-#endif  // NET_BASE_LOOKUP_STRING_IN_FIXED_SET_H_
+#endif  // BASE_LOOKUP_STRING_IN_FIXED_SET_H_