Add support for split PSL list distinctions.

net/base/registry_controlled_domains/effective_tld_names_unittest1.cc

 /* C++ code produced by gperf version 3.0.3 */
 /* Command-line: gperf -a -L C++ -C -c -o -t -k '*' -NFindDomain -ZPerfect_Hash_Test1 -D effective_tld_names_unittest1.gperf  */
 
 #if !((' ' == 32) && ('!' == 33) && ('"' == 34) && ('#' == 35) \
       && ('%' == 37) && ('&' == 38) && ('\'' == 39) && ('(' == 40) \
       && (')' == 41) && ('*' == 42) && ('+' == 43) && (',' == 44) \
       && ('-' == 45) && ('.' == 46) && ('/' == 47) && ('0' == 48) \
       && ('1' == 49) && ('2' == 50) && ('3' == 51) && ('4' == 52) \
       && ('5' == 53) && ('6' == 54) && ('7' == 55) && ('8' == 56) \
       && ('9' == 57) && (':' == 58) && (';' == 59) && ('<' == 60) \
@@ skipping 23 matching lines @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 // Test file used by registry_controlled_domain_unittest.
 // We edit this file manually, then run
 // gperf -a -L "C++" -C -c -o -t -k '*' -NFindDomain -ZPerfect_Hash_Test1 -D effective_tld_names_unittest1.gperf >  effective_tld_names_unittest1.cc
 // to generate the perfect hashmap.
 #line 10 "effective_tld_names_unittest1.gperf"
 struct DomainRule {
   const char *name;
   int type;  // 1: exception, 2: wildcard
+  bool is_private;
 };
 
-#define TOTAL_KEYWORDS 8
+#define TOTAL_KEYWORDS 11
 #define MIN_WORD_LENGTH 1
 #define MAX_WORD_LENGTH 11
 #define MIN_HASH_VALUE 1
-#define MAX_HASH_VALUE 16
-/* maximum key range = 16, duplicates = 0 */
+#define MAX_HASH_VALUE 17
+/* maximum key range = 17, duplicates = 0 */
 
 class Perfect_Hash_Test1
 {
 private:
   static inline unsigned int hash (const char *str, unsigned int len);
 public:
   static const struct DomainRule *FindDomain (const char *str, unsigned int len);
 };
 
 inline unsigned int
 Perfect_Hash_Test1::hash (register const char *str, register unsigned int len)
 {
   static const unsigned char asso_values[] =
     {
-      17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
-      17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
-      17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
-      17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
-      17, 17, 17, 17, 17, 17,  0, 17, 17, 17,
-      17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
-      17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
-      17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
-      17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
-      17, 17, 17, 17, 17, 17, 17,  0,  0,  0,
-      17,  5,  0, 17, 17, 17,  0, 17, 17,  0,
-      17,  0,  0, 17,  0, 17, 17, 17, 17, 17,
-      17, 17,  0, 17, 17, 17, 17, 17, 17, 17,
-      17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
-      17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
-      17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
-      17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
-      17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
-      17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
-      17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
-      17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
-      17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
-      17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
-      17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
-      17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
-      17, 17, 17, 17, 17, 17
+      18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+      18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+      18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+      18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+      18, 18, 18, 18, 18, 18,  0, 18, 18, 18,
+      18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+      18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+      18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+      18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+      18, 18, 18, 18, 18, 18, 18,  0,  0,  0,
+      18,  5,  0, 18, 18,  0,  0, 18, 18,  0,
+       5,  0,  0, 18,  0, 18,  5, 18,  0, 18,
+      18, 18,  0, 18, 18, 18, 18, 18, 18, 18,
+      18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+      18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+      18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+      18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+      18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+      18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+      18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+      18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+      18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+      18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+      18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+      18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
+      18, 18, 18, 18, 18, 18
     };
   register int hval = len;
 
   switch (hval)
     {
       default:
         hval += asso_values[(unsigned char)str[10]];
       /*FALLTHROUGH*/
       case 10:
         hval += asso_values[(unsigned char)str[9]];
@@ skipping 27 matching lines @@
         break;
     }
   return hval;
 }
 
 const struct DomainRule *
 Perfect_Hash_Test1::FindDomain (register const char *str, register unsigned int len)
 {
   static const struct DomainRule wordlist[] =
     {
+#line 22 "effective_tld_names_unittest1.gperf"
+      {"c", 2, false},
+#line 16 "effective_tld_names_unittest1.gperf"
+      {"jp", 0, false},
+#line 23 "effective_tld_names_unittest1.gperf"
+      {"b.c", 1, false},
+#line 17 "effective_tld_names_unittest1.gperf"
+      {"ac.jp", 0, false},
+#line 18 "effective_tld_names_unittest1.gperf"
+      {"bar.jp", 2, false},
+#line 24 "effective_tld_names_unittest1.gperf"
+      {"no", 0, false},
+#line 19 "effective_tld_names_unittest1.gperf"
+      {"baz.bar.jp", 2, false},
 #line 21 "effective_tld_names_unittest1.gperf"
-      {"c", 2},
-#line 15 "effective_tld_names_unittest1.gperf"
-      {"jp", 0},
-#line 22 "effective_tld_names_unittest1.gperf"
-      {"b.c", 1},
-#line 16 "effective_tld_names_unittest1.gperf"
-      {"ac.jp", 0},
-#line 17 "effective_tld_names_unittest1.gperf"
-      {"bar.jp", 2},
-#line 18 "effective_tld_names_unittest1.gperf"
-      {"baz.bar.jp", 2},
+      {"bar.baz.com", 0, false},
+#line 25 "effective_tld_names_unittest1.gperf"
+      {"priv.no", 0, true},
 #line 20 "effective_tld_names_unittest1.gperf"
-      {"bar.baz.com", 0},
-#line 19 "effective_tld_names_unittest1.gperf"
-      {"pref.bar.jp", 1}
+      {"pref.bar.jp", 1, false},
+#line 26 "effective_tld_names_unittest1.gperf"
+      {"private", 0, true}
     };
 
   static const signed char lookup[] =
     {
-      -1,  0,  1,  2, -1,  3,  4, -1, -1, -1,  5,  6, -1, -1,
-      -1, -1,  7
+      -1,  0,  1,  2, -1,  3,  4,  5, -1, -1,  6,  7,  8, -1,
+      -1, -1,  9, 10
     };
 
   if (len <= MAX_WORD_LENGTH && len >= MIN_WORD_LENGTH)
     {
       register int key = hash (str, len);
 
       if (key <= MAX_HASH_VALUE && key >= 0)
         {
           register int index = lookup[key];
 
           if (index >= 0)
             {
               register const char *s = wordlist[index].name;
 
               if (*str == *s && !strncmp (str + 1, s + 1, len - 1) && s[len] == '\0')
                 return &wordlist[index];
             }
         }
     }
   return 0;
 }
-#line 23 "effective_tld_names_unittest1.gperf"
+#line 27 "effective_tld_names_unittest1.gperf"