-
Notifications
You must be signed in to change notification settings - Fork 9
/
registry.go
322 lines (269 loc) · 6.92 KB
/
registry.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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
package registry
import (
"encoding/json"
"log"
"reflect"
"strconv"
"strings"
"sync"
pcre "github.com/gijsbers/go-pcre"
"github.com/pkg/errors"
)
var languagesMu = struct {
sync.RWMutex
defs map[string]*unparsedLanguage
cache map[string]Contains
names []string
}{
defs: map[string]*unparsedLanguage{},
cache: map[string]Contains{},
}
// Register registers a specific language with the highlighter.
func Register(names []string, json string) {
lang := &unparsedLanguage{
name: names[0],
aliases: names[1:],
body: json,
}
languagesMu.Lock()
defer languagesMu.Unlock()
languagesMu.names = append(languagesMu.names, lang.name)
for _, name := range names {
languagesMu.defs[name] = lang
}
}
// Languages returns an slice of all the language names.
func Languages() []string {
languagesMu.RLock()
defer languagesMu.RUnlock()
return languagesMu.names
}
type unparsedLanguage struct {
name string
aliases []string
body string
}
type keywordsJSON struct {
Keyword string `json:"keyword"`
Literal string `json:"literal"`
BuiltIn string `json:"built_in"`
}
// arrayToUpper capitalizes all elements in the array.
func arrayToUpper(parts []string) []string {
for i, part := range parts {
parts[i] = strings.ToUpper(part[0:1]) + part[1:]
}
return parts
}
type containsJSON struct {
CaseInsensitive bool `json:"case_insensitive"`
Aliases []string `json:"aliases"`
Illegal string `json:"illegal"`
ClassName string `json:"className"`
Contains []*Contains `json:"contains"`
Variants []*Contains `json:"variants"`
Starts *Contains `json:"starts"`
SubLanguage []string `json:"subLanguage"`
Begin string `json:"begin"`
BeginLookahead string `json:"beginLookahead"`
End string `json:"end"`
BeginKeywords string `json:"beginKeywords"`
Keywords *Keywords `json:"keywords"`
ExcludeEnd bool `json:"excludeEnd"`
Relevance float64 `json:"relevance"`
// Ref and IsArray are used for resolving circular references within the
// definitions.
Ref []string
IsArray bool
}
// Keywords represents a set of keywords that should be matched and highlighted.
type Keywords struct {
Keyword []string
Literal []string
BuiltIn []string
}
func parseWords(words string) []string {
if len(words) == 0 {
return nil
}
// Avoid empty strings.
var final []string
for _, s := range strings.Split(words, " ") {
if len(s) == 0 {
continue
}
final = append(final, s)
}
return final
}
// UnmarshalJSON unmarshals.
func (k *Keywords) UnmarshalJSON(b []byte) error {
var kw keywordsJSON
if err := json.Unmarshal(b, &kw); err != nil {
// Unmarshalling failed. Try unmarshalling into string.
if err := json.Unmarshal(b, &kw.Keyword); err != nil {
return errors.Wrap(err, "Keywords UnmarshalJSON")
}
}
k.Keyword = parseWords(kw.Keyword)
k.Literal = parseWords(kw.Literal)
k.BuiltIn = parseWords(kw.BuiltIn)
return nil
}
// Contains represents a subsection that can match different parts of the code.
type Contains struct {
CaseInsensitive bool
Aliases []string
Illegal string
ClassName string
Contains []*Contains
Variants []*Contains
Starts *Contains
SubLanguage []string
Begin *pcre.Regexp
End *pcre.Regexp
BeginKeywords []string
Keywords *Keywords
ExcludeEnd bool
Relevance float64
// Ref and IsArray are used for resolving circular references within the
// definitions.
Ref []string
IsArray bool
}
func compileRegex(regex string, flags int) (*pcre.Regexp, error) {
if len(regex) == 0 {
return nil, nil
}
r, err := pcre.Compile(regex, flags)
if err != nil {
return nil, err
}
if err := r.Study(0); err != nil {
log.Printf("WARN: failed to JIT regex %q: %s", regex, err)
}
return &r, nil
}
// UnmarshalJSON unmarshals.
func (c *Contains) UnmarshalJSON(b []byte) error {
con := containsJSON{
Relevance: 1,
}
err := json.Unmarshal(b, &con)
if err != nil {
return errors.Wrapf(err, "Contains UnmarshalJSON(%s)", b)
}
c.CaseInsensitive = con.CaseInsensitive
c.Aliases = con.Aliases
c.Illegal = con.Illegal
c.ClassName = con.ClassName
c.Contains = con.Contains
c.Variants = con.Variants
c.Starts = con.Starts
c.SubLanguage = con.SubLanguage
c.Begin, err = compileRegex(con.Begin, 0)
if err != nil {
return err
}
// Regex needs to be in multi line mode and match starting at the
// beginning of the string.
c.End, err = compileRegex(con.End, pcre.MULTILINE)
if err != nil {
return err
}
c.BeginKeywords = parseWords(con.BeginKeywords)
c.Keywords = con.Keywords
c.ExcludeEnd = con.ExcludeEnd
c.Relevance = con.Relevance
c.Ref = arrayToUpper(con.Ref)
c.IsArray = con.IsArray
return nil
}
func parseLang(def string) (Contains, error) {
lang := &Contains{}
if err := json.Unmarshal([]byte(def), &lang); err != nil {
return Contains{}, err
}
visited := map[*Contains]struct{}{}
if err := lang.resolveReferences(visited, lang); err != nil {
return Contains{}, err
}
return *lang, nil
}
func (c *Contains) resolveReferences(visited map[*Contains]struct{}, n *Contains) error {
// Detect circular references.
if _, ok := visited[n]; ok {
return nil
}
visited[n] = struct{}{}
for _, nc := range []*[]*Contains{&n.Contains, &n.Variants} {
if err := c.resolveReferencesArr(visited, nc); err != nil {
return err
}
}
return nil
}
func (c *Contains) resolveReferencesArr(visited map[*Contains]struct{}, n *[]*Contains) error {
for i, inner := range *n {
if inner.Ref == nil {
if err := c.resolveReferences(visited, inner); err != nil {
return err
}
continue
}
v, err := c.resolveReferencePath(inner.Ref)
if err != nil {
return err
}
if inner.IsArray {
*n = v.([]*Contains)
} else {
(*n)[i] = v.(*Contains)
}
}
return nil
}
func (c *Contains) resolveReferencePath(ref []string) (interface{}, error) {
v := reflect.ValueOf(c)
for len(ref) > 0 {
r := ref[0]
kind := v.Type().Kind()
if kind == reflect.Slice || kind == reflect.Array {
n, err := strconv.Atoi(r)
if err != nil {
return nil, err
}
v = v.Index(n)
} else {
v = v.Elem().FieldByName(r)
}
ref = ref[1:]
}
return v.Interface(), nil
}
// ErrLanguageNotFound is returned when a requested language is not present in
// the registry.
var ErrLanguageNotFound = errors.New("can't find language in registry")
// Lookup finds and returns the parsed Language that has been saved in the
// registry.
func Lookup(name string) (Contains, error) {
languagesMu.RLock()
lang, ok := languagesMu.cache[name]
if ok {
languagesMu.RUnlock()
return lang, nil
}
langDef, ok := languagesMu.defs[name]
languagesMu.RUnlock()
if !ok {
return Contains{}, errors.Wrap(ErrLanguageNotFound, name)
}
lang, err := parseLang(langDef.body)
if err != nil {
return Contains{}, errors.Wrapf(err, "failed to parse %s", name)
}
languagesMu.Lock()
defer languagesMu.Unlock()
languagesMu.cache[name] = lang
return lang, nil
}