forked from pingcap/tidb
/
builtin_ilike.go
120 lines (104 loc) · 3.53 KB
/
builtin_ilike.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
// Copyright 2023 PingCAP, Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package expression
import (
"sync"
"github.com/pingcap/tipb/go-tipb"
"github.com/twotigers93/tidb/sessionctx"
"github.com/twotigers93/tidb/types"
"github.com/twotigers93/tidb/util/chunk"
"github.com/twotigers93/tidb/util/collate"
"github.com/twotigers93/tidb/util/stringutil"
)
var (
_ functionClass = &ilikeFunctionClass{}
)
var (
_ builtinFunc = &builtinIlikeSig{}
)
type ilikeFunctionClass struct {
baseFunctionClass
}
func (c *ilikeFunctionClass) getFunction(ctx sessionctx.Context, args []Expression) (builtinFunc, error) {
if err := c.verifyArgs(args); err != nil {
return nil, err
}
argTp := []types.EvalType{types.ETString, types.ETString, types.ETInt}
bf, err := newBaseBuiltinFuncWithTp(ctx, c.funcName, args, types.ETInt, argTp...)
if err != nil {
return nil, err
}
bf.tp.SetFlen(1)
sig := &builtinIlikeSig{bf, nil, false, sync.Once{}}
sig.setPbCode(tipb.ScalarFuncSig_IlikeSig)
return sig, nil
}
type builtinIlikeSig struct {
baseBuiltinFunc
// pattern and isMemorizedPattern is not serialized with builtinIlikeSig, treat them as a cache to accelerate
// the evaluation of builtinIlikeSig.
pattern collate.WildcardPattern
isMemorizedPattern bool
once sync.Once
}
func (b *builtinIlikeSig) Clone() builtinFunc {
newSig := &builtinIlikeSig{}
newSig.cloneFrom(&b.baseBuiltinFunc)
newSig.pattern = b.pattern
newSig.isMemorizedPattern = b.isMemorizedPattern
return newSig
}
// evalInt evals a builtinIlikeSig.
func (b *builtinIlikeSig) evalInt(row chunk.Row) (int64, bool, error) {
valStr, isNull, err := b.args[0].EvalString(b.ctx, row)
if isNull || err != nil {
return 0, isNull, err
}
patternStr, isNull, err := b.args[1].EvalString(b.ctx, row)
if isNull || err != nil {
return 0, isNull, err
}
escape, isNull, err := b.args[2].EvalInt(b.ctx, row)
if isNull || err != nil {
return 0, isNull, err
}
valStrBytes := []byte(valStr)
patternStrBytes := []byte(patternStr)
stringutil.LowerOneString(valStrBytes)
if stringutil.IsUpperASCII(byte(escape)) || stringutil.IsLowerASCII(byte(escape)) {
escape = int64(stringutil.LowerOneStringExcludeEscapeChar(patternStrBytes, byte(escape)))
} else {
stringutil.LowerOneString(patternStrBytes)
}
valStr = string(valStrBytes)
patternStr = string(patternStrBytes)
memorization := func() {
if b.pattern == nil {
b.pattern = collate.ConvertAndGetBinCollation(b.collation).Pattern()
if b.args[1].ConstItem(b.ctx.GetSessionVars().StmtCtx) && b.args[2].ConstItem(b.ctx.GetSessionVars().StmtCtx) {
b.pattern.Compile(patternStr, byte(escape))
b.isMemorizedPattern = true
}
}
}
// Only be executed once to achieve thread-safe
b.once.Do(memorization)
if !b.isMemorizedPattern {
// Must not use b.pattern to avoid data race
pattern := collate.ConvertAndGetBinCollation(b.collation).Pattern()
pattern.Compile(patternStr, byte(escape))
return boolToInt64(pattern.DoMatch(valStr)), false, nil
}
return boolToInt64(b.pattern.DoMatch(valStr)), false, nil
}