This repository has been archived by the owner on Dec 1, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathschema.go
441 lines (381 loc) · 10.1 KB
/
schema.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
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
package antlr4512
/*
Schema contains slices of RFC 4512 Section 4.1 contexts.
*/
type Schema struct {
DN string
OM Macros
LS LDAPSyntaxes
MR MatchingRules
MU MatchingRuleUses
AT AttributeTypes
OC ObjectClasses
DC DITContentRules
NF NameForms
DS DITStructureRules
}
/*
NewSchema initializes and returns a new empty instance of *Schema.
*/
func NewSchema() Schema {
return Schema{
LS: make(LDAPSyntaxes, 0),
OM: make(Macros, 0),
MR: make(MatchingRules, 0),
MU: make(MatchingRuleUses, 0),
AT: make(AttributeTypes, 0),
OC: make(ObjectClasses, 0),
DC: make(DITContentRules, 0),
NF: make(NameForms, 0),
DS: make(DITStructureRules, 0),
}
}
/*
Macros contains a manifest of name to oid/name pairs, each describing
a resolution path for oid/name into a distinct OID reference.
*/
type Macros map[string]string
/*
IsZero returns a Boolean value indicative of receiver nilness.
*/
func (r *Schema) IsZero() bool {
return r == nil
}
/*
UpdateMatchingRuleUses updates the underlying [MatchingRuleUses]
instance within the receiver instance.
*/
func (r *Schema) UpdateMatchingRuleUses() {
if len(r.MU) == 0 {
r.MU = make(MatchingRuleUses, 0)
}
for i := 0; i < len(r.MR); i++ {
var (
mr MatchingRule = r.MR[i]
mu MatchingRuleUse = MatchingRuleUse{
OID: mr.OID,
Name: mr.Name,
Desc: mr.Desc,
Applies: make([]string, 0),
}
)
for j := 0; j < len(r.AT); j++ {
var at AttributeType = r.AT[j]
for _, amr := range []string{
at.Equality,
at.Substring,
at.Ordering,
} {
if eq(amr, mr.OID) || strInSlice(amr, mr.Name) {
if !strInSlice(amr, mu.Applies) {
mu.Applies = append(mu.Applies, at.OID)
}
}
}
}
if len(mu.Applies) > 0 {
var found bool
for j := 0; j < len(r.MU); j++ {
if found = r.MU[j].OID == mu.OID; found {
for a := 0; a < len(mu.Applies); a++ {
o := mu.Applies[a]
if !strInSlice(o, r.MU[j].Applies) {
r.MU[j].Applies = append(r.MU[j].Applies, o)
}
}
break
}
}
if !found {
r.MU = append(r.MU, mu)
}
}
}
}
/*
ParseRaw returns an error following an attempt to parse the input raw
bytes into the receiver instance. Both the [Schema.ParseFile] method
and the [Schema.ParseDirectory] method are dependents of this method.
The raw input value must be non-nil, and must contain valid schema
definitions with optional bash comments.
*/
func (r *Schema) ParseRaw(raw []byte) (err error) {
if r.IsZero() {
err = errorf("%T instance is not initialized", r)
return
} else if len(raw) == 0 {
err = errorf("No raw content to parse")
return
}
var i Instance
if i, err = ParseInstance(string(raw)); err != nil {
return
}
fp := i.P.Fileparse()
defs := fp.Definitions()
if defs == nil {
err = errorf("No definitions found in %T", defs)
return
}
r.processObjectIdentifiers(defs.AllObjectIdentifier())
if dn := fp.SchemaDN(); dn != nil && len(r.DN) == 0 {
r.DN = trimS(trimL(dn.GetText(), `dn:`))
}
if err = r.processSchemaDefinitions(defs); err == nil {
r.UpdateMatchingRuleUses()
}
return
}
/*
ParseFile returns an error following an attempt to parse file. Only
files ending in ".schema" will be considered, however submission of
non-qualifying files shall not produce an error.
*/
func (r *Schema) ParseFile(file string) (err error) {
if r.IsZero() {
err = errorf("%T instance is not initialized", r)
return
}
var content []byte
if content, err = readFile(file); err != nil {
return
}
err = r.ParseRaw(content)
return
}
/*
ParseDirectory returns an error following an attempt to parse the
directory found at dir. Sub-directories encountered are traversed
indefinitely. Files encountered will only be read if their name
ends in ".schema", at which point their contents are read into
bytes, processed using ANTLR and written to the receiver instance.
*/
func (r *Schema) ParseDirectory(dir string) (err error) {
if r.IsZero() {
err = errorf("%T instance is not initialized", r)
return
}
var content []byte
if content, err = readDirectory(dir); err != nil {
return
}
err = r.ParseRaw(content)
return
}
/*
processSchemaDefinitions returns an error instance following an
attempt to parse all schema definitions found within the defs
IDefinitionsContext instance.
*/
func (r *Schema) processSchemaDefinitions(defs IDefinitionsContext) (err error) {
ct := defs.GetChildCount()
for i := 0; i < ct && err == nil; i++ {
switch tv := defs.GetChild(i).(type) {
case *LDAPSyntaxDescriptionsContext:
err = r.processLSs(tv)
case *MatchingRuleDescriptionsContext:
err = r.processMRs(tv)
case *MatchingRuleUseDescriptionsContext:
err = r.processMUs(tv)
case *AttributeTypeDescriptionsContext:
err = r.processATs(tv)
case *ObjectClassDescriptionsContext:
err = r.processOCs(tv)
case *DITContentRuleDescriptionsContext:
err = r.processDCs(tv)
case *NameFormDescriptionsContext:
err = r.processNFs(tv)
case *DITStructureRuleDescriptionsContext:
err = r.processDSs(tv)
}
}
return
}
/*
processATs returns an error instance following an attempt to parse all AttributeType
definitions found within the input at *AttributeTypeDescriptionsContext.
*/
func (r *Schema) processATs(x *AttributeTypeDescriptionsContext) (err error) {
_z := x.AllAttributeTypeDescription()
if len(r.AT) == 0 {
r.AT = make(AttributeTypes, 0)
}
for j := 0; j < len(_z); j++ {
var def AttributeType
if err = def.process(_z[j]); err != nil {
break
}
if len(def.Macro) == 2 && len(def.OID) == 0 {
resl, found := r.OM[def.Macro[0]]
if !found {
err = errorf("Unresolvable macro for attributeType")
break
}
def.OID = resl + def.Macro[1]
} else if len(def.Macro) < 2 && len(def.OID) == 0 {
err = errorf("Incomplete or missing macro for OID resolution")
break
}
r.AT = append(r.AT, def)
}
return
}
/*
processLSs returns an error instance following an attempt to parse all LDAPSyntax
definitions found within the input at *LDAPSyntaxDescriptionsContext.
*/
func (r *Schema) processLSs(x *LDAPSyntaxDescriptionsContext) (err error) {
_z := x.AllLDAPSyntaxDescription()
if len(r.LS) == 0 {
r.LS = make(LDAPSyntaxes, 0)
}
for j := 0; j < len(_z); j++ {
var def LDAPSyntax
if err = def.process(_z[j]); err != nil {
break
}
r.LS = append(r.LS, def)
}
return
}
/*
processMRs returns an error instance following an attempt to parse all MatchingRule
definitions found within the input at *MatchingRuleDescriptionsContext.
*/
func (r *Schema) processMRs(x *MatchingRuleDescriptionsContext) (err error) {
_z := x.AllMatchingRuleDescription()
if len(r.MR) == 0 {
r.MR = make(MatchingRules, 0)
}
for j := 0; j < len(_z); j++ {
var def MatchingRule
if err = def.process(_z[j]); err != nil {
break
}
r.MR = append(r.MR, def)
}
return
}
/*
processMUs returns an error instance following an attempt to parse all [MatchingRuleUse]
definitions found within the input at [MatchingRuleUseDescriptionsContext].
*/
func (r *Schema) processMUs(x *MatchingRuleUseDescriptionsContext) (err error) {
_z := x.AllMatchingRuleUseDescription()
if len(r.MU) == 0 {
r.MU = make(MatchingRuleUses, 0)
}
for j := 0; j < len(_z); j++ {
var def MatchingRuleUse
if err = def.process(_z[j]); err != nil {
break
}
r.MU = append(r.MU, def)
}
return
}
/*
processDCs returns an error instance following an attempt to parse all DITContentRule
definitions found within the input at *DITContentRuleDescriptionsContext.
*/
func (r *Schema) processDCs(x *DITContentRuleDescriptionsContext) (err error) {
_z := x.AllDITContentRuleDescription()
if len(r.DC) == 0 {
r.DC = make(DITContentRules, 0)
}
for j := 0; j < len(_z); j++ {
var def DITContentRule
if err = def.process(_z[j]); err != nil {
break
}
if len(def.Macro) == 2 && len(def.OID) == 0 {
resl, found := r.OM[def.Macro[0]]
if !found {
err = errorf("Unresolvable macro for matchingRule")
break
}
def.OID = resl + `.` + def.Macro[1]
} else if len(def.Macro) < 2 && len(def.OID) == 0 {
err = errorf("Incomplete or missing macro for OID resolution")
break
}
r.DC = append(r.DC, def)
}
return
}
/*
processDSs returns an error instance following an attempt to parse all DITStructureRule
definitions found within the input at *DITStructureRuleDescriptionsContext.
*/
func (r *Schema) processDSs(x *DITStructureRuleDescriptionsContext) (err error) {
_z := x.AllDITStructureRuleDescription()
if len(r.DS) == 0 {
r.DS = make(DITStructureRules, 0)
}
for j := 0; j < len(_z); j++ {
var def DITStructureRule
if err = def.process(_z[j]); err != nil {
break
}
r.DS = append(r.DS, def)
}
return
}
/*
processOCs returns an error instance following an attempt to parse all ObjectClass
definitions found within the input at *ObjectClassDescriptionsContext.
*/
func (r *Schema) processOCs(x *ObjectClassDescriptionsContext) (err error) {
_z := x.AllObjectClassDescription()
if len(r.OC) == 0 {
r.OC = make(ObjectClasses, 0)
}
for j := 0; j < len(_z); j++ {
var def ObjectClass
if err = def.process(_z[j]); err != nil {
break
}
if len(def.Macro) == 2 && len(def.OID) == 0 {
resl, found := r.OM[def.Macro[0]]
if !found {
err = errorf("Unresolvable macro for objectClass")
break
}
def.OID = resl + `.` + def.Macro[1]
} else if len(def.Macro) < 2 && len(def.OID) == 0 {
err = errorf("Incomplete or missing macro for OID resolution")
break
}
r.OC = append(r.OC, def)
}
return
}
/*
processNFs returns an error instance following an attempt to parse all NameForm
definitions found within the input at *NameFormDescriptionsContext.
*/
func (r *Schema) processNFs(x *NameFormDescriptionsContext) (err error) {
_z := x.AllNameFormDescription()
if len(r.NF) == 0 {
r.NF = make(NameForms, 0)
}
for j := 0; j < len(_z); j++ {
var def NameForm
if err = def.process(_z[j]); err != nil {
break
}
if len(def.Macro) == 2 && len(def.OID) == 0 {
resl, found := r.OM[def.Macro[0]]
if !found {
err = errorf("Unresolvable macro for nameForm")
break
}
def.OID = resl + `.` + def.Macro[1]
} else if len(def.Macro) < 2 && len(def.OID) == 0 {
err = errorf("Incomplete or missing macro for OID resolution")
break
}
r.NF = append(r.NF, def)
}
return
}