| Index: net/base/registry_controlled_domains/effective_tld_names_unittest2.cc
|
| diff --git a/net/base/registry_controlled_domains/effective_tld_names_unittest2.cc b/net/base/registry_controlled_domains/effective_tld_names_unittest2.cc
|
| index a57151e0c23ec4ee3fdbb9ac6e25cdb828615a3b..1a939343c9bd92bf5d486611550c9c547e7e03e8 100644
|
| --- a/net/base/registry_controlled_domains/effective_tld_names_unittest2.cc
|
| +++ b/net/base/registry_controlled_domains/effective_tld_names_unittest2.cc
|
| @@ -1,31 +1,33 @@
|
| /* C++ code produced by gperf version 3.0.3 */
|
| -/* Command-line: gperf -a -L C++ -C -c -o -t -k '*' -NFindDomain -ZPerfect_Hash_Test2 -P -K name_offset -Q stringpool2 -D -T effective_tld_names_unittest2.gperf */
|
| +/* Command-line: gperf -a -L C++ -C -c -o -t -k '*' -NFindDomain
|
| + * -ZPerfect_Hash_Test2 -P -K name_offset -Q stringpool2 -D -T
|
| + * effective_tld_names_unittest2.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) \
|
| - && ('=' == 61) && ('>' == 62) && ('?' == 63) && ('A' == 65) \
|
| - && ('B' == 66) && ('C' == 67) && ('D' == 68) && ('E' == 69) \
|
| - && ('F' == 70) && ('G' == 71) && ('H' == 72) && ('I' == 73) \
|
| - && ('J' == 74) && ('K' == 75) && ('L' == 76) && ('M' == 77) \
|
| - && ('N' == 78) && ('O' == 79) && ('P' == 80) && ('Q' == 81) \
|
| - && ('R' == 82) && ('S' == 83) && ('T' == 84) && ('U' == 85) \
|
| - && ('V' == 86) && ('W' == 87) && ('X' == 88) && ('Y' == 89) \
|
| - && ('Z' == 90) && ('[' == 91) && ('\\' == 92) && (']' == 93) \
|
| - && ('^' == 94) && ('_' == 95) && ('a' == 97) && ('b' == 98) \
|
| - && ('c' == 99) && ('d' == 100) && ('e' == 101) && ('f' == 102) \
|
| - && ('g' == 103) && ('h' == 104) && ('i' == 105) && ('j' == 106) \
|
| - && ('k' == 107) && ('l' == 108) && ('m' == 109) && ('n' == 110) \
|
| - && ('o' == 111) && ('p' == 112) && ('q' == 113) && ('r' == 114) \
|
| - && ('s' == 115) && ('t' == 116) && ('u' == 117) && ('v' == 118) \
|
| - && ('w' == 119) && ('x' == 120) && ('y' == 121) && ('z' == 122) \
|
| - && ('{' == 123) && ('|' == 124) && ('}' == 125) && ('~' == 126))
|
| +#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) && ('=' == 61) && \
|
| + ('>' == 62) && ('?' == 63) && ('A' == 65) && ('B' == 66) && ('C' == 67) && \
|
| + ('D' == 68) && ('E' == 69) && ('F' == 70) && ('G' == 71) && ('H' == 72) && \
|
| + ('I' == 73) && ('J' == 74) && ('K' == 75) && ('L' == 76) && ('M' == 77) && \
|
| + ('N' == 78) && ('O' == 79) && ('P' == 80) && ('Q' == 81) && ('R' == 82) && \
|
| + ('S' == 83) && ('T' == 84) && ('U' == 85) && ('V' == 86) && ('W' == 87) && \
|
| + ('X' == 88) && ('Y' == 89) && ('Z' == 90) && ('[' == 91) && \
|
| + ('\\' == 92) && (']' == 93) && ('^' == 94) && ('_' == 95) && \
|
| + ('a' == 97) && ('b' == 98) && ('c' == 99) && ('d' == 100) && \
|
| + ('e' == 101) && ('f' == 102) && ('g' == 103) && ('h' == 104) && \
|
| + ('i' == 105) && ('j' == 106) && ('k' == 107) && ('l' == 108) && \
|
| + ('m' == 109) && ('n' == 110) && ('o' == 111) && ('p' == 112) && \
|
| + ('q' == 113) && ('r' == 114) && ('s' == 115) && ('t' == 116) && \
|
| + ('u' == 117) && ('v' == 118) && ('w' == 119) && ('x' == 120) && \
|
| + ('y' == 121) && ('z' == 122) && ('{' == 123) && ('|' == 124) && \
|
| + ('}' == 125) && ('~' == 126))
|
| /* The character set is not based on ISO-646. */
|
| -#error "gperf generated tables don't work with this execution character set. Please report a bug to <bug-gnu-gperf@gnu.org>."
|
| +#error \
|
| + "gperf generated tables don't work with this execution character set. Please report a bug to <bug-gnu-gperf@gnu.org>."
|
| #endif
|
|
|
| #line 1 "effective_tld_names_unittest2.gperf"
|
| @@ -35,7 +37,9 @@
|
| // 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_Test2 -P -K name_offset -Q stringpool2 -D -T effective_tld_names_unittest2.gperf > effective_tld_names_unittest2.cc
|
| +// gperf -a -L "C++" -C -c -o -t -k '*' -NFindDomain -ZPerfect_Hash_Test2 -P -K
|
| +// name_offset -Q stringpool2 -D -T effective_tld_names_unittest2.gperf >
|
| +// effective_tld_names_unittest2.cc
|
| // to generate the perfect hashmap.
|
|
|
| #define TOTAL_KEYWORDS 2
|
| @@ -45,117 +49,84 @@
|
| #define MAX_HASH_VALUE 6
|
| /* maximum key range = 5, duplicates = 0 */
|
|
|
| -class Perfect_Hash_Test2
|
| -{
|
| -private:
|
| - static inline unsigned int hash (const char *str, unsigned int len);
|
| -public:
|
| - static const struct DomainRule *FindDomain (const char *str, unsigned int len);
|
| +class Perfect_Hash_Test2 {
|
| + 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_Test2::hash (register const char *str, register unsigned int len)
|
| -{
|
| - static const unsigned char asso_values[] =
|
| - {
|
| - 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| - 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| - 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| - 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| - 7, 7, 7, 7, 7, 7, 0, 7, 7, 7,
|
| - 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| - 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| - 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| - 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| - 7, 7, 7, 7, 7, 7, 7, 0, 0, 7,
|
| - 7, 7, 7, 7, 7, 7, 0, 7, 7, 7,
|
| - 7, 7, 0, 7, 0, 7, 7, 7, 7, 7,
|
| - 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| - 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| - 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| - 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| - 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| - 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| - 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| - 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| - 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| - 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| - 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| - 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| - 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| - 7, 7, 7, 7, 7, 7
|
| - };
|
| +inline unsigned int Perfect_Hash_Test2::hash(register const char* str,
|
| + register unsigned int len) {
|
| + static const unsigned char asso_values[] = {
|
| + 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| + 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 0, 7,
|
| + 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| + 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| + 7, 0, 0, 7, 7, 7, 7, 7, 7, 7, 0, 7, 7, 7, 7, 7, 0, 7, 0, 7, 7, 7, 7, 7,
|
| + 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| + 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| + 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| + 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| + 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
|
| + 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7};
|
| register int hval = len;
|
|
|
| - switch (hval)
|
| - {
|
| - default:
|
| - hval += asso_values[(unsigned char)str[5]];
|
| - /*FALLTHROUGH*/
|
| - case 5:
|
| - hval += asso_values[(unsigned char)str[4]];
|
| - /*FALLTHROUGH*/
|
| - case 4:
|
| - hval += asso_values[(unsigned char)str[3]];
|
| - /*FALLTHROUGH*/
|
| - case 3:
|
| - hval += asso_values[(unsigned char)str[2]];
|
| - /*FALLTHROUGH*/
|
| - case 2:
|
| - hval += asso_values[(unsigned char)str[1]];
|
| - /*FALLTHROUGH*/
|
| - case 1:
|
| - hval += asso_values[(unsigned char)str[0]];
|
| - break;
|
| - }
|
| + switch (hval) {
|
| + default:
|
| + hval += asso_values[(unsigned char)str[5]];
|
| + /*FALLTHROUGH*/
|
| + case 5:
|
| + hval += asso_values[(unsigned char)str[4]];
|
| + /*FALLTHROUGH*/
|
| + case 4:
|
| + hval += asso_values[(unsigned char)str[3]];
|
| + /*FALLTHROUGH*/
|
| + case 3:
|
| + hval += asso_values[(unsigned char)str[2]];
|
| + /*FALLTHROUGH*/
|
| + case 2:
|
| + hval += asso_values[(unsigned char)str[1]];
|
| + /*FALLTHROUGH*/
|
| + case 1:
|
| + hval += asso_values[(unsigned char)str[0]];
|
| + break;
|
| + }
|
| return hval;
|
| }
|
|
|
| -struct stringpool2_t
|
| - {
|
| - char stringpool2_str0[sizeof("jp")];
|
| - char stringpool2_str1[sizeof("bar.jp")];
|
| - };
|
| -static const struct stringpool2_t stringpool2_contents =
|
| - {
|
| - "jp",
|
| - "bar.jp"
|
| - };
|
| -#define stringpool2 ((const char *) &stringpool2_contents)
|
| -const struct DomainRule *
|
| -Perfect_Hash_Test2::FindDomain (register const char *str, register unsigned int len)
|
| -{
|
| - static const struct DomainRule wordlist[] =
|
| - {
|
| +struct stringpool2_t {
|
| + char stringpool2_str0[sizeof("jp")];
|
| + char stringpool2_str1[sizeof("bar.jp")];
|
| +};
|
| +static const struct stringpool2_t stringpool2_contents = {"jp", "bar.jp"};
|
| +#define stringpool2 ((const char*)&stringpool2_contents)
|
| +const struct DomainRule* Perfect_Hash_Test2::FindDomain(
|
| + register const char* str,
|
| + register unsigned int len) {
|
| + static const struct DomainRule wordlist[] = {
|
| #line 15 "effective_tld_names_unittest2.gperf"
|
| - {(int)(long)&((struct stringpool2_t *)0)->stringpool2_str0, 0},
|
| + {(int)(long)&((struct stringpool2_t*)0)->stringpool2_str0, 0},
|
| #line 16 "effective_tld_names_unittest2.gperf"
|
| - {(int)(long)&((struct stringpool2_t *)0)->stringpool2_str1, 0}
|
| - };
|
| + {(int)(long)&((struct stringpool2_t*)0)->stringpool2_str1, 0}};
|
|
|
| - static const signed char lookup[] =
|
| - {
|
| - -1, -1, 0, -1, -1, -1, 1
|
| - };
|
| + static const signed char lookup[] = {-1, -1, 0, -1, -1, -1, 1};
|
|
|
| - if (len <= MAX_WORD_LENGTH && len >= MIN_WORD_LENGTH)
|
| - {
|
| - register int key = hash (str, len);
|
| + 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 (key <= MAX_HASH_VALUE && key >= 0) {
|
| + register int index = lookup[key];
|
|
|
| - if (index >= 0)
|
| - {
|
| - register const char *s = wordlist[index].name_offset + stringpool2;
|
| + if (index >= 0) {
|
| + register const char* s = wordlist[index].name_offset + stringpool2;
|
|
|
| - if (*str == *s && !strncmp (str + 1, s + 1, len - 1) && s[len] == '\0')
|
| - return &wordlist[index];
|
| - }
|
| - }
|
| + if (*str == *s && !strncmp(str + 1, s + 1, len - 1) && s[len] == '\0')
|
| + return &wordlist[index];
|
| + }
|
| }
|
| + }
|
| return 0;
|
| }
|
| #line 17 "effective_tld_names_unittest2.gperf"
|
| -
|
|
|
Chromium Code Reviews
