forked from mirror/brotli
664 lines
17 KiB
Go
664 lines
17 KiB
Go
|
package brotli
|
||
|
|
|
||
|
|
/* Copyright 2013 Google Inc. All Rights Reserved.
|
||
|
|
|
||
|
|
Distributed under MIT license.
|
||
|
|
See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
|
||
|
|
*/
|
||
|
|
|
||
|
|
/* Class to model the static dictionary. */
|
||
|
|
const BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN = 37
|
||
|
|
|
||
|
|
var kInvalidMatch uint32 = 0xFFFFFFF
|
||
|
|
|
||
|
|
/* Copyright 2013 Google Inc. All Rights Reserved.
|
||
|
|
|
||
|
|
Distributed under MIT license.
|
||
|
|
See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
|
||
|
|
*/
|
||
|
|
func Hash(data []byte) uint32 {
|
||
|
|
var h uint32 = BROTLI_UNALIGNED_LOAD32LE(data) * kDictHashMul32
|
||
|
|
|
||
|
|
/* The higher bits contain more mixture from the multiplication,
|
||
|
|
so we take our results from there. */
|
||
|
|
return h >> uint(32-kDictNumBits)
|
||
|
|
}
|
||
|
|
|
||
|
|
func AddMatch(distance uint, len uint, len_code uint, matches []uint32) {
|
||
|
|
var match uint32 = uint32((distance << 5) + len_code)
|
||
|
|
matches[len] = brotli_min_uint32_t(matches[len], match)
|
||
|
|
}
|
||
|
|
|
||
|
|
func DictMatchLength(dictionary *BrotliDictionary, data []byte, id uint, len uint, maxlen uint) uint {
|
||
|
|
var offset uint = uint(dictionary.offsets_by_length[len]) + len*id
|
||
|
|
return FindMatchLengthWithLimit(dictionary.data[offset:], data, brotli_min_size_t(uint(len), maxlen))
|
||
|
|
}
|
||
|
|
|
||
|
|
func IsMatch(dictionary *BrotliDictionary, w DictWord, data []byte, max_length uint) bool {
|
||
|
|
if uint(w.len) > max_length {
|
||
|
|
return false
|
||
|
|
} else {
|
||
|
|
var offset uint = uint(dictionary.offsets_by_length[w.len]) + uint(w.len)*uint(w.idx)
|
||
|
|
var dict []byte = dictionary.data[offset:]
|
||
|
|
if w.transform == 0 {
|
||
|
|
/* Match against base dictionary word. */
|
||
|
|
return FindMatchLengthWithLimit(dict, data, uint(w.len)) == uint(w.len)
|
||
|
|
} else if w.transform == 10 {
|
||
|
|
/* Match against uppercase first transform.
|
||
|
|
Note that there are only ASCII uppercase words in the lookup table. */
|
||
|
|
return dict[0] >= 'a' && dict[0] <= 'z' && (dict[0]^32) == data[0] && FindMatchLengthWithLimit(dict[1:], data[1:], uint(w.len)-1) == uint(w.len-1)
|
||
|
|
} else {
|
||
|
|
/* Match against uppercase all transform.
|
||
|
|
Note that there are only ASCII uppercase words in the lookup table. */
|
||
|
|
var i uint
|
||
|
|
for i = 0; i < uint(w.len); i++ {
|
||
|
|
if dict[i] >= 'a' && dict[i] <= 'z' {
|
||
|
|
if (dict[i] ^ 32) != data[i] {
|
||
|
|
return false
|
||
|
|
}
|
||
|
|
} else {
|
||
|
|
if dict[i] != data[i] {
|
||
|
|
return false
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
return true
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
func BrotliFindAllStaticDictionaryMatches(dictionary *BrotliEncoderDictionary, data []byte, min_length uint, max_length uint, matches []uint32) bool {
|
||
|
|
var has_found_match bool = false
|
||
|
|
{
|
||
|
|
var offset uint = uint(dictionary.buckets[Hash(data)])
|
||
|
|
var end bool = offset == 0
|
||
|
|
for !end {
|
||
|
|
var w DictWord
|
||
|
|
w = dictionary.dict_words[offset]
|
||
|
|
offset++
|
||
|
|
var l uint = uint(w.len) & 0x1F
|
||
|
|
var n uint = uint(1) << dictionary.words.size_bits_by_length[l]
|
||
|
|
var id uint = uint(w.idx)
|
||
|
|
end = !(w.len&0x80 == 0)
|
||
|
|
w.len = byte(l)
|
||
|
|
if w.transform == 0 {
|
||
|
|
var matchlen uint = DictMatchLength(dictionary.words, data, id, l, max_length)
|
||
|
|
var s []byte
|
||
|
|
var minlen uint
|
||
|
|
var maxlen uint
|
||
|
|
var len uint
|
||
|
|
|
||
|
|
/* Transform "" + BROTLI_TRANSFORM_IDENTITY + "" */
|
||
|
|
if matchlen == l {
|
||
|
|
AddMatch(id, l, l, matches)
|
||
|
|
has_found_match = true
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Transforms "" + BROTLI_TRANSFORM_OMIT_LAST_1 + "" and
|
||
|
|
"" + BROTLI_TRANSFORM_OMIT_LAST_1 + "ing " */
|
||
|
|
if matchlen >= l-1 {
|
||
|
|
AddMatch(id+12*n, l-1, l, matches)
|
||
|
|
if l+2 < max_length && data[l-1] == 'i' && data[l] == 'n' && data[l+1] == 'g' && data[l+2] == ' ' {
|
||
|
|
AddMatch(id+49*n, l+3, l, matches)
|
||
|
|
}
|
||
|
|
|
||
|
|
has_found_match = true
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Transform "" + BROTLI_TRANSFORM_OMIT_LAST_# + "" (# = 2 .. 9) */
|
||
|
|
minlen = min_length
|
||
|
|
|
||
|
|
if l > 9 {
|
||
|
|
minlen = brotli_max_size_t(minlen, l-9)
|
||
|
|
}
|
||
|
|
maxlen = brotli_min_size_t(matchlen, l-2)
|
||
|
|
for len = minlen; len <= maxlen; len++ {
|
||
|
|
var cut uint = l - len
|
||
|
|
var transform_id uint = (cut << 2) + uint((dictionary.cutoffTransforms>>(cut*6))&0x3F)
|
||
|
|
AddMatch(id+transform_id*n, uint(len), l, matches)
|
||
|
|
has_found_match = true
|
||
|
|
}
|
||
|
|
|
||
|
|
if matchlen < l || l+6 >= max_length {
|
||
|
|
continue
|
||
|
|
}
|
||
|
|
|
||
|
|
s = data[l:]
|
||
|
|
|
||
|
|
/* Transforms "" + BROTLI_TRANSFORM_IDENTITY + <suffix> */
|
||
|
|
if s[0] == ' ' {
|
||
|
|
AddMatch(id+n, l+1, l, matches)
|
||
|
|
if s[1] == 'a' {
|
||
|
|
if s[2] == ' ' {
|
||
|
|
AddMatch(id+28*n, l+3, l, matches)
|
||
|
|
} else if s[2] == 's' {
|
||
|
|
if s[3] == ' ' {
|
||
|
|
AddMatch(id+46*n, l+4, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[2] == 't' {
|
||
|
|
if s[3] == ' ' {
|
||
|
|
AddMatch(id+60*n, l+4, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[2] == 'n' {
|
||
|
|
if s[3] == 'd' && s[4] == ' ' {
|
||
|
|
AddMatch(id+10*n, l+5, l, matches)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} else if s[1] == 'b' {
|
||
|
|
if s[2] == 'y' && s[3] == ' ' {
|
||
|
|
AddMatch(id+38*n, l+4, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[1] == 'i' {
|
||
|
|
if s[2] == 'n' {
|
||
|
|
if s[3] == ' ' {
|
||
|
|
AddMatch(id+16*n, l+4, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[2] == 's' {
|
||
|
|
if s[3] == ' ' {
|
||
|
|
AddMatch(id+47*n, l+4, l, matches)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} else if s[1] == 'f' {
|
||
|
|
if s[2] == 'o' {
|
||
|
|
if s[3] == 'r' && s[4] == ' ' {
|
||
|
|
AddMatch(id+25*n, l+5, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[2] == 'r' {
|
||
|
|
if s[3] == 'o' && s[4] == 'm' && s[5] == ' ' {
|
||
|
|
AddMatch(id+37*n, l+6, l, matches)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} else if s[1] == 'o' {
|
||
|
|
if s[2] == 'f' {
|
||
|
|
if s[3] == ' ' {
|
||
|
|
AddMatch(id+8*n, l+4, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[2] == 'n' {
|
||
|
|
if s[3] == ' ' {
|
||
|
|
AddMatch(id+45*n, l+4, l, matches)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} else if s[1] == 'n' {
|
||
|
|
if s[2] == 'o' && s[3] == 't' && s[4] == ' ' {
|
||
|
|
AddMatch(id+80*n, l+5, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[1] == 't' {
|
||
|
|
if s[2] == 'h' {
|
||
|
|
if s[3] == 'e' {
|
||
|
|
if s[4] == ' ' {
|
||
|
|
AddMatch(id+5*n, l+5, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[3] == 'a' {
|
||
|
|
if s[4] == 't' && s[5] == ' ' {
|
||
|
|
AddMatch(id+29*n, l+6, l, matches)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} else if s[2] == 'o' {
|
||
|
|
if s[3] == ' ' {
|
||
|
|
AddMatch(id+17*n, l+4, l, matches)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} else if s[1] == 'w' {
|
||
|
|
if s[2] == 'i' && s[3] == 't' && s[4] == 'h' && s[5] == ' ' {
|
||
|
|
AddMatch(id+35*n, l+6, l, matches)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} else if s[0] == '"' {
|
||
|
|
AddMatch(id+19*n, l+1, l, matches)
|
||
|
|
if s[1] == '>' {
|
||
|
|
AddMatch(id+21*n, l+2, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[0] == '.' {
|
||
|
|
AddMatch(id+20*n, l+1, l, matches)
|
||
|
|
if s[1] == ' ' {
|
||
|
|
AddMatch(id+31*n, l+2, l, matches)
|
||
|
|
if s[2] == 'T' && s[3] == 'h' {
|
||
|
|
if s[4] == 'e' {
|
||
|
|
if s[5] == ' ' {
|
||
|
|
AddMatch(id+43*n, l+6, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[4] == 'i' {
|
||
|
|
if s[5] == 's' && s[6] == ' ' {
|
||
|
|
AddMatch(id+75*n, l+7, l, matches)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} else if s[0] == ',' {
|
||
|
|
AddMatch(id+76*n, l+1, l, matches)
|
||
|
|
if s[1] == ' ' {
|
||
|
|
AddMatch(id+14*n, l+2, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[0] == '\n' {
|
||
|
|
AddMatch(id+22*n, l+1, l, matches)
|
||
|
|
if s[1] == '\t' {
|
||
|
|
AddMatch(id+50*n, l+2, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[0] == ']' {
|
||
|
|
AddMatch(id+24*n, l+1, l, matches)
|
||
|
|
} else if s[0] == '\'' {
|
||
|
|
AddMatch(id+36*n, l+1, l, matches)
|
||
|
|
} else if s[0] == ':' {
|
||
|
|
AddMatch(id+51*n, l+1, l, matches)
|
||
|
|
} else if s[0] == '(' {
|
||
|
|
AddMatch(id+57*n, l+1, l, matches)
|
||
|
|
} else if s[0] == '=' {
|
||
|
|
if s[1] == '"' {
|
||
|
|
AddMatch(id+70*n, l+2, l, matches)
|
||
|
|
} else if s[1] == '\'' {
|
||
|
|
AddMatch(id+86*n, l+2, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[0] == 'a' {
|
||
|
|
if s[1] == 'l' && s[2] == ' ' {
|
||
|
|
AddMatch(id+84*n, l+3, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[0] == 'e' {
|
||
|
|
if s[1] == 'd' {
|
||
|
|
if s[2] == ' ' {
|
||
|
|
AddMatch(id+53*n, l+3, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[1] == 'r' {
|
||
|
|
if s[2] == ' ' {
|
||
|
|
AddMatch(id+82*n, l+3, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[1] == 's' {
|
||
|
|
if s[2] == 't' && s[3] == ' ' {
|
||
|
|
AddMatch(id+95*n, l+4, l, matches)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} else if s[0] == 'f' {
|
||
|
|
if s[1] == 'u' && s[2] == 'l' && s[3] == ' ' {
|
||
|
|
AddMatch(id+90*n, l+4, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[0] == 'i' {
|
||
|
|
if s[1] == 'v' {
|
||
|
|
if s[2] == 'e' && s[3] == ' ' {
|
||
|
|
AddMatch(id+92*n, l+4, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[1] == 'z' {
|
||
|
|
if s[2] == 'e' && s[3] == ' ' {
|
||
|
|
AddMatch(id+100*n, l+4, l, matches)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} else if s[0] == 'l' {
|
||
|
|
if s[1] == 'e' {
|
||
|
|
if s[2] == 's' && s[3] == 's' && s[4] == ' ' {
|
||
|
|
AddMatch(id+93*n, l+5, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[1] == 'y' {
|
||
|
|
if s[2] == ' ' {
|
||
|
|
AddMatch(id+61*n, l+3, l, matches)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} else if s[0] == 'o' {
|
||
|
|
if s[1] == 'u' && s[2] == 's' && s[3] == ' ' {
|
||
|
|
AddMatch(id+106*n, l+4, l, matches)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} else {
|
||
|
|
var is_all_caps bool = (w.transform != BROTLI_TRANSFORM_UPPERCASE_FIRST)
|
||
|
|
/* Set is_all_caps=0 for BROTLI_TRANSFORM_UPPERCASE_FIRST and
|
||
|
|
is_all_caps=1 otherwise (BROTLI_TRANSFORM_UPPERCASE_ALL)
|
||
|
|
transform. */
|
||
|
|
|
||
|
|
var s []byte
|
||
|
|
if !IsMatch(dictionary.words, w, data, max_length) {
|
||
|
|
continue
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Transform "" + kUppercase{First,All} + "" */
|
||
|
|
var tmp int
|
||
|
|
if is_all_caps {
|
||
|
|
tmp = 44
|
||
|
|
} else {
|
||
|
|
tmp = 9
|
||
|
|
}
|
||
|
|
AddMatch(id+uint(tmp)*n, l, l, matches)
|
||
|
|
|
||
|
|
has_found_match = true
|
||
|
|
if l+1 >= max_length {
|
||
|
|
continue
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Transforms "" + kUppercase{First,All} + <suffix> */
|
||
|
|
s = data[l:]
|
||
|
|
|
||
|
|
if s[0] == ' ' {
|
||
|
|
var tmp int
|
||
|
|
if is_all_caps {
|
||
|
|
tmp = 68
|
||
|
|
} else {
|
||
|
|
tmp = 4
|
||
|
|
}
|
||
|
|
AddMatch(id+uint(tmp)*n, l+1, l, matches)
|
||
|
|
} else if s[0] == '"' {
|
||
|
|
var tmp int
|
||
|
|
if is_all_caps {
|
||
|
|
tmp = 87
|
||
|
|
} else {
|
||
|
|
tmp = 66
|
||
|
|
}
|
||
|
|
AddMatch(id+uint(tmp)*n, l+1, l, matches)
|
||
|
|
if s[1] == '>' {
|
||
|
|
var tmp int
|
||
|
|
if is_all_caps {
|
||
|
|
tmp = 97
|
||
|
|
} else {
|
||
|
|
tmp = 69
|
||
|
|
}
|
||
|
|
AddMatch(id+uint(tmp)*n, l+2, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[0] == '.' {
|
||
|
|
var tmp int
|
||
|
|
if is_all_caps {
|
||
|
|
tmp = 101
|
||
|
|
} else {
|
||
|
|
tmp = 79
|
||
|
|
}
|
||
|
|
AddMatch(id+uint(tmp)*n, l+1, l, matches)
|
||
|
|
if s[1] == ' ' {
|
||
|
|
var tmp int
|
||
|
|
if is_all_caps {
|
||
|
|
tmp = 114
|
||
|
|
} else {
|
||
|
|
tmp = 88
|
||
|
|
}
|
||
|
|
AddMatch(id+uint(tmp)*n, l+2, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[0] == ',' {
|
||
|
|
var tmp int
|
||
|
|
if is_all_caps {
|
||
|
|
tmp = 112
|
||
|
|
} else {
|
||
|
|
tmp = 99
|
||
|
|
}
|
||
|
|
AddMatch(id+uint(tmp)*n, l+1, l, matches)
|
||
|
|
if s[1] == ' ' {
|
||
|
|
var tmp int
|
||
|
|
if is_all_caps {
|
||
|
|
tmp = 107
|
||
|
|
} else {
|
||
|
|
tmp = 58
|
||
|
|
}
|
||
|
|
AddMatch(id+uint(tmp)*n, l+2, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[0] == '\'' {
|
||
|
|
var tmp int
|
||
|
|
if is_all_caps {
|
||
|
|
tmp = 94
|
||
|
|
} else {
|
||
|
|
tmp = 74
|
||
|
|
}
|
||
|
|
AddMatch(id+uint(tmp)*n, l+1, l, matches)
|
||
|
|
} else if s[0] == '(' {
|
||
|
|
var tmp int
|
||
|
|
if is_all_caps {
|
||
|
|
tmp = 113
|
||
|
|
} else {
|
||
|
|
tmp = 78
|
||
|
|
}
|
||
|
|
AddMatch(id+uint(tmp)*n, l+1, l, matches)
|
||
|
|
} else if s[0] == '=' {
|
||
|
|
if s[1] == '"' {
|
||
|
|
var tmp int
|
||
|
|
if is_all_caps {
|
||
|
|
tmp = 105
|
||
|
|
} else {
|
||
|
|
tmp = 104
|
||
|
|
}
|
||
|
|
AddMatch(id+uint(tmp)*n, l+2, l, matches)
|
||
|
|
} else if s[1] == '\'' {
|
||
|
|
var tmp int
|
||
|
|
if is_all_caps {
|
||
|
|
tmp = 116
|
||
|
|
} else {
|
||
|
|
tmp = 108
|
||
|
|
}
|
||
|
|
AddMatch(id+uint(tmp)*n, l+2, l, matches)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Transforms with prefixes " " and "." */
|
||
|
|
if max_length >= 5 && (data[0] == ' ' || data[0] == '.') {
|
||
|
|
var is_space bool = (data[0] == ' ')
|
||
|
|
var offset uint = uint(dictionary.buckets[Hash(data[1:])])
|
||
|
|
var end bool = offset == 0
|
||
|
|
for !end {
|
||
|
|
var w DictWord
|
||
|
|
w = dictionary.dict_words[offset]
|
||
|
|
offset++
|
||
|
|
var l uint = uint(w.len) & 0x1F
|
||
|
|
var n uint = uint(1) << dictionary.words.size_bits_by_length[l]
|
||
|
|
var id uint = uint(w.idx)
|
||
|
|
end = !(w.len&0x80 == 0)
|
||
|
|
w.len = byte(l)
|
||
|
|
if w.transform == 0 {
|
||
|
|
var s []byte
|
||
|
|
if !IsMatch(dictionary.words, w, data[1:], max_length-1) {
|
||
|
|
continue
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Transforms " " + BROTLI_TRANSFORM_IDENTITY + "" and
|
||
|
|
"." + BROTLI_TRANSFORM_IDENTITY + "" */
|
||
|
|
var tmp int
|
||
|
|
if is_space {
|
||
|
|
tmp = 6
|
||
|
|
} else {
|
||
|
|
tmp = 32
|
||
|
|
}
|
||
|
|
AddMatch(id+uint(tmp)*n, l+1, l, matches)
|
||
|
|
|
||
|
|
has_found_match = true
|
||
|
|
if l+2 >= max_length {
|
||
|
|
continue
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Transforms " " + BROTLI_TRANSFORM_IDENTITY + <suffix> and
|
||
|
|
"." + BROTLI_TRANSFORM_IDENTITY + <suffix>
|
||
|
|
*/
|
||
|
|
s = data[l+1:]
|
||
|
|
|
||
|
|
if s[0] == ' ' {
|
||
|
|
var tmp int
|
||
|
|
if is_space {
|
||
|
|
tmp = 2
|
||
|
|
} else {
|
||
|
|
tmp = 77
|
||
|
|
}
|
||
|
|
AddMatch(id+uint(tmp)*n, l+2, l, matches)
|
||
|
|
} else if s[0] == '(' {
|
||
|
|
var tmp int
|
||
|
|
if is_space {
|
||
|
|
tmp = 89
|
||
|
|
} else {
|
||
|
|
tmp = 67
|
||
|
|
}
|
||
|
|
AddMatch(id+uint(tmp)*n, l+2, l, matches)
|
||
|
|
} else if is_space {
|
||
|
|
if s[0] == ',' {
|
||
|
|
AddMatch(id+103*n, l+2, l, matches)
|
||
|
|
if s[1] == ' ' {
|
||
|
|
AddMatch(id+33*n, l+3, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[0] == '.' {
|
||
|
|
AddMatch(id+71*n, l+2, l, matches)
|
||
|
|
if s[1] == ' ' {
|
||
|
|
AddMatch(id+52*n, l+3, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[0] == '=' {
|
||
|
|
if s[1] == '"' {
|
||
|
|
AddMatch(id+81*n, l+3, l, matches)
|
||
|
|
} else if s[1] == '\'' {
|
||
|
|
AddMatch(id+98*n, l+3, l, matches)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} else if is_space {
|
||
|
|
var is_all_caps bool = (w.transform != BROTLI_TRANSFORM_UPPERCASE_FIRST)
|
||
|
|
/* Set is_all_caps=0 for BROTLI_TRANSFORM_UPPERCASE_FIRST and
|
||
|
|
is_all_caps=1 otherwise (BROTLI_TRANSFORM_UPPERCASE_ALL)
|
||
|
|
transform. */
|
||
|
|
|
||
|
|
var s []byte
|
||
|
|
if !IsMatch(dictionary.words, w, data[1:], max_length-1) {
|
||
|
|
continue
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Transforms " " + kUppercase{First,All} + "" */
|
||
|
|
var tmp int
|
||
|
|
if is_all_caps {
|
||
|
|
tmp = 85
|
||
|
|
} else {
|
||
|
|
tmp = 30
|
||
|
|
}
|
||
|
|
AddMatch(id+uint(tmp)*n, l+1, l, matches)
|
||
|
|
|
||
|
|
has_found_match = true
|
||
|
|
if l+2 >= max_length {
|
||
|
|
continue
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Transforms " " + kUppercase{First,All} + <suffix> */
|
||
|
|
s = data[l+1:]
|
||
|
|
|
||
|
|
if s[0] == ' ' {
|
||
|
|
var tmp int
|
||
|
|
if is_all_caps {
|
||
|
|
tmp = 83
|
||
|
|
} else {
|
||
|
|
tmp = 15
|
||
|
|
}
|
||
|
|
AddMatch(id+uint(tmp)*n, l+2, l, matches)
|
||
|
|
} else if s[0] == ',' {
|
||
|
|
if !is_all_caps {
|
||
|
|
AddMatch(id+109*n, l+2, l, matches)
|
||
|
|
}
|
||
|
|
|
||
|
|
if s[1] == ' ' {
|
||
|
|
var tmp int
|
||
|
|
if is_all_caps {
|
||
|
|
tmp = 111
|
||
|
|
} else {
|
||
|
|
tmp = 65
|
||
|
|
}
|
||
|
|
AddMatch(id+uint(tmp)*n, l+3, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[0] == '.' {
|
||
|
|
var tmp int
|
||
|
|
if is_all_caps {
|
||
|
|
tmp = 115
|
||
|
|
} else {
|
||
|
|
tmp = 96
|
||
|
|
}
|
||
|
|
AddMatch(id+uint(tmp)*n, l+2, l, matches)
|
||
|
|
if s[1] == ' ' {
|
||
|
|
var tmp int
|
||
|
|
if is_all_caps {
|
||
|
|
tmp = 117
|
||
|
|
} else {
|
||
|
|
tmp = 91
|
||
|
|
}
|
||
|
|
AddMatch(id+uint(tmp)*n, l+3, l, matches)
|
||
|
|
}
|
||
|
|
} else if s[0] == '=' {
|
||
|
|
if s[1] == '"' {
|
||
|
|
var tmp int
|
||
|
|
if is_all_caps {
|
||
|
|
tmp = 110
|
||
|
|
} else {
|
||
|
|
tmp = 118
|
||
|
|
}
|
||
|
|
AddMatch(id+uint(tmp)*n, l+3, l, matches)
|
||
|
|
} else if s[1] == '\'' {
|
||
|
|
var tmp int
|
||
|
|
if is_all_caps {
|
||
|
|
tmp = 119
|
||
|
|
} else {
|
||
|
|
tmp = 120
|
||
|
|
}
|
||
|
|
AddMatch(id+uint(tmp)*n, l+3, l, matches)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
if max_length >= 6 {
|
||
|
|
/* Transforms with prefixes "e ", "s ", ", " and "\xC2\xA0" */
|
||
|
|
if (data[1] == ' ' && (data[0] == 'e' || data[0] == 's' || data[0] == ',')) || (data[0] == 0xC2 && data[1] == 0xA0) {
|
||
|
|
var offset uint = uint(dictionary.buckets[Hash(data[2:])])
|
||
|
|
var end bool = offset == 0
|
||
|
|
for !end {
|
||
|
|
var w DictWord
|
||
|
|
w = dictionary.dict_words[offset]
|
||
|
|
offset++
|
||
|
|
var l uint = uint(w.len) & 0x1F
|
||
|
|
var n uint = uint(1) << dictionary.words.size_bits_by_length[l]
|
||
|
|
var id uint = uint(w.idx)
|
||
|
|
end = !(w.len&0x80 == 0)
|
||
|
|
w.len = byte(l)
|
||
|
|
if w.transform == 0 && IsMatch(dictionary.words, w, data[2:], max_length-2) {
|
||
|
|
if data[0] == 0xC2 {
|
||
|
|
AddMatch(id+102*n, l+2, l, matches)
|
||
|
|
has_found_match = true
|
||
|
|
} else if l+2 < max_length && data[l+2] == ' ' {
|
||
|
|
var t uint = 13
|
||
|
|
if data[0] == 'e' {
|
||
|
|
t = 18
|
||
|
|
} else if data[0] == 's' {
|
||
|
|
t = 7
|
||
|
|
}
|
||
|
|
AddMatch(id+t*n, l+3, l, matches)
|
||
|
|
has_found_match = true
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
if max_length >= 9 {
|
||
|
|
/* Transforms with prefixes " the " and ".com/" */
|
||
|
|
if (data[0] == ' ' && data[1] == 't' && data[2] == 'h' && data[3] == 'e' && data[4] == ' ') || (data[0] == '.' && data[1] == 'c' && data[2] == 'o' && data[3] == 'm' && data[4] == '/') {
|
||
|
|
var offset uint = uint(dictionary.buckets[Hash(data[5:])])
|
||
|
|
var end bool = offset == 0
|
||
|
|
for !end {
|
||
|
|
var w DictWord
|
||
|
|
w = dictionary.dict_words[offset]
|
||
|
|
offset++
|
||
|
|
var l uint = uint(w.len) & 0x1F
|
||
|
|
var n uint = uint(1) << dictionary.words.size_bits_by_length[l]
|
||
|
|
var id uint = uint(w.idx)
|
||
|
|
end = !(w.len&0x80 == 0)
|
||
|
|
w.len = byte(l)
|
||
|
|
if w.transform == 0 && IsMatch(dictionary.words, w, data[5:], max_length-5) {
|
||
|
|
var tmp int
|
||
|
|
if data[0] == ' ' {
|
||
|
|
tmp = 41
|
||
|
|
} else {
|
||
|
|
tmp = 72
|
||
|
|
}
|
||
|
|
AddMatch(id+uint(tmp)*n, l+5, l, matches)
|
||
|
|
has_found_match = true
|
||
|
|
if l+5 < max_length {
|
||
|
|
var s []byte = data[l+5:]
|
||
|
|
if data[0] == ' ' {
|
||
|
|
if l+8 < max_length && s[0] == ' ' && s[1] == 'o' && s[2] == 'f' && s[3] == ' ' {
|
||
|
|
AddMatch(id+62*n, l+9, l, matches)
|
||
|
|
if l+12 < max_length && s[4] == 't' && s[5] == 'h' && s[6] == 'e' && s[7] == ' ' {
|
||
|
|
AddMatch(id+73*n, l+13, l, matches)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
return has_found_match
|
||
|
|
}
|