/
definition.go
814 lines (771 loc) · 27.2 KB
/
definition.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
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
/*
* Copyright © 2018-2022 Software AG, Darmstadt, Germany and/or its licensors
*
* SPDX-License-Identifier: Apache-2.0
*
* 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 adatypes
import (
"bytes"
"fmt"
"strings"
)
// Isn Adabas Internal ISN
type Isn uint64
// Definition struct defines main entry point for parser structure
type Definition struct {
FileTime IAdaValue
fileFields map[string]IAdaType
fileShortFields map[string]IAdaType
fileFieldTree *StructureType
activeFields map[string]IAdaType
activeFieldTree *StructureType
Values []IAdaValue
}
type parserBufferTr struct {
// contains the helper buffer pointer reading the data from the record buffer
helper *BufferHelper
// buffer options used to define second call and others
option *BufferOption
// Prefix defines the reference prefix used for @references
prefix string
definition *Definition
}
func parseBufferValues(adaValue IAdaValue, x interface{}) (result TraverseResult, err error) {
parameter := x.(*parserBufferTr)
if adaValue.Type().HasFlagSet(FlagOptionReference) {
if Central.IsDebugLevel() {
Central.Log.Debugf("Skip parsing value .... %s", adaValue.Type().Name())
}
name := adaValue.Type().Name()
if name[0] != '@' {
adaType := adaValue.Type().(*AdaType)
delete(parameter.definition.activeFields, adaType.name)
adaType.name = "@" + adaType.name
parameter.definition.activeFields[adaType.name] = adaType
} else {
name = name[1:]
}
err = adaValue.SetValue(parameter.prefix + name)
if err != nil {
return EndTraverser, err
}
return Continue, nil
}
if Central.IsDebugLevel() {
Central.Log.Debugf("Start parsing value .... %s offset=%d/%X type=%s", adaValue.Type().Name(),
parameter.helper.offset, parameter.helper.offset, adaValue.Type().Type().name())
Central.Log.Debugf("Parse value %s/%s .... second=%v need second=%v pe=%v", adaValue.Type().ShortName(), adaValue.Type().Name(),
parameter.option.SecondCall, parameter.option.NeedSecondCall, adaValue.Type().HasFlagSet(FlagOptionPE))
}
// On second call, to collect MU fields in an PE group, skip all other parser tasks
if !(adaValue.Type().HasFlagSet(FlagOptionPE) && adaValue.Type().Type() == FieldTypeMultiplefield) {
if parameter.option.SecondCall > 0 && !adaValue.Type().HasFlagSet(FlagOptionMUGhost) && adaValue.Type().Type() != FieldTypeLBString {
if Central.IsDebugLevel() {
Central.Log.Debugf("Second call skip parsing %s", adaValue.Type().Name())
}
return Continue, nil
}
}
result, err = adaValue.parseBuffer(parameter.helper, parameter.option)
if Central.IsDebugLevel() {
Central.Log.Debugf("End Parseing value .... %s pos=%d need second=%v",
adaValue.Type().Name(), parameter.helper.offset, parameter.option.NeedSecondCall)
}
return
}
// Register Register field types
func (def *Definition) Register(t IAdaType) {
def.fileFields[t.Name()] = t
def.fileShortFields[t.ShortName()] = t
}
// ParseBuffer method start parsing the record Buffer using the definition.
// This may be by using either types or values (if available) to parse the buffer.
// Values may be available if second call is done or other means.
func (def *Definition) ParseBuffer(helper *BufferHelper, option *BufferOption, prefix string) (res TraverseResult, err error) {
if def.Values == nil {
if Central.IsDebugLevel() {
Central.Log.Debugf("Parse buffer types...")
}
def.Values, err = parseBufferTypes(helper, option, def.activeFieldTree, 0)
} else {
if Central.IsDebugLevel() {
def.DumpTypes(true, true, "Parse buffer type tree")
def.DumpValues(true)
Central.Log.Debugf("Parse buffer values... avail.=%v", (def.Values != nil))
}
x := parserBufferTr{helper: helper, option: option, prefix: prefix, definition: def}
t := TraverserValuesMethods{EnterFunction: parseBufferValues}
res, err = def.TraverseValues(t, &x)
if err != nil {
Central.Log.Debugf("Error parsing buffer values... %v", err)
return
}
if Central.IsDebugLevel() {
Central.Log.Debugf("End parse buffer values... %p avail.=%v", def, (def.Values != nil))
}
}
return
}
// Parse buffer IAdaTypes, go through all structures and generate corresponding IAdaTypes
func parseBufferTypes(helper *BufferHelper, option *BufferOption, str interface{}, peIndex uint32) (adaValues []IAdaValue, err error) {
var parent *StructureType
var parentStructure *StructureValue
switch st := str.(type) {
case *StructureType:
Central.Log.Debugf("Parent structure value not available")
parent = st
default:
Central.Log.Debugf("Parent structure value available %T", str)
parentStructure = str.(*StructureValue)
parent = parentStructure.adatype.(*StructureType)
}
if Central.IsDebugLevel() {
Central.Log.Debugf("================== Parse Buffer for IAdaTypes of %s -> value avail.=%v index=%d need second=%v",
parent.Name(), (parentStructure != nil), peIndex, option.NeedSecondCall)
}
types := parent.SubTypes
var conditionMatrix []byte
// First get reference field index if index is needed for conditional parsing
if Central.IsDebugLevel() {
Central.Log.Debugf("Parent refField=%d length=%d", parent.condition.refField, len(types))
}
refField := func() int {
if parent.condition.refField != NoReferenceField {
return parent.condition.refField
}
return len(types) - 1
}()
// Check if length field of structure is defined
lengthFieldIndex := parent.condition.lengthFieldIndex
endOfBuffer := helper.offset
// Create IAdaTypes until reference index or the end of the types
// if no reference index available
if Central.IsDebugLevel() {
Central.Log.Debugf("Reference field index=%d length field index=%d need second=%v", refField,
lengthFieldIndex, option.NeedSecondCall)
}
for i := 0; i < refField+1; i++ {
if Central.IsDebugLevel() {
Central.Log.Debugf("Parse type -> %s offset=%d", types[i].Name(), helper.offset)
}
var value IAdaValue
if parentStructure != nil && len(parentStructure.Elements) > int(peIndex) {
value = parentStructure.Elements[peIndex].valueMap[types[i].Name()]
if Central.IsDebugLevel() {
Central.Log.Debugf("Got out of map -> ", value, " for index ", peIndex)
}
} else {
if parentStructure != nil {
Central.Log.Debugf("Len parent structure %d", len(parentStructure.Elements))
}
}
if value == nil {
if Central.IsDebugLevel() {
Central.Log.Debugf("Value nil, not in parent structure")
}
value, err = types[i].Value()
if err != nil {
if Central.IsDebugLevel() {
Central.Log.Debugf("Error create value for type ", types[i].String())
}
return
}
if Central.IsDebugLevel() {
Central.Log.Debugf("Append value to values : %v %p <- %p", parentStructure, parentStructure, value)
}
adaValues = append(adaValues, value)
if parentStructure != nil && peIndex == 0 {
if len(parentStructure.Elements) > 0 {
parentStructure.Elements[0].Values = append(parentStructure.Elements[0].Values, value)
parentStructure.Elements[0].valueMap[types[i].Name()] = value
} else {
x := &structureElement{valueMap: make(map[string]IAdaValue)}
x.Values = append(x.Values, value)
x.valueMap[types[i].Name()] = value
parentStructure.Elements = append(parentStructure.Elements, x)
}
}
}
// If part of multiple field or period group set index value
if value.Type().HasFlagSet(FlagOptionPE) {
if Central.IsDebugLevel() {
Central.Log.Debugf("Set PE index to %d", (peIndex + 1))
}
value.setPeriodIndex(peIndex + 1)
}
if value.Type().HasFlagSet(FlagOptionMUGhost) {
if Central.IsDebugLevel() {
Central.Log.Debugf("Set MU index to %d", (peIndex + 1))
}
value.setMultipleIndex(peIndex + 1)
}
if Central.IsDebugLevel() {
Central.Log.Debugf("Call parse buffer of field %s", types[i].Name())
}
_, err = value.parseBuffer(helper, option)
if err != nil {
Central.Log.Debugf("Error parse buffer %v", err)
return
}
//var at IAdaType
at := parent
// TODO Check why parent not used
types[i].SetParent(at)
// Found length field index, calculate end of buffer
if i == lengthFieldIndex {
lengthFieldValue := value.(*ubyteValue)
endOfBuffer += uint32(lengthFieldValue.ByteValue())
if Central.IsDebugLevel() {
Central.Log.Debugf("Found end of buffer at %d", endOfBuffer)
}
}
// If reference field found, get condition matrix
if parent != nil && i == parent.condition.refField {
refValue := value.(*ubyteValue)
if Central.IsDebugLevel() {
Central.Log.Debugf("Value : %v offset=%d", refValue.ByteValue(), helper.offset)
Central.Log.Debugf("Found reference field %d %v %s %v", i, refValue.ByteValue(),
parent.Name(), parent.condition)
}
conditionMatrix = parent.condition.conditionMatrix[refValue.ByteValue()]
if conditionMatrix == nil {
if Central.IsDebugLevel() {
Central.Log.Debugf("Allthough refernce value given, condition matrix missing offset=%d refField=%v",
helper.offset, parent.condition.refField, parent)
}
err = NewGenericError(120)
return
}
}
}
// If condition matrix is found, generate corresponding IAdaTypes for the structure
if conditionMatrix != nil {
Central.Log.Debugf("Condition matrix %v", conditionMatrix)
for _, ref := range conditionMatrix {
if Central.IsDebugLevel() {
Central.Log.Debugf("Get reference field %s %v %d offset=%d(%X)", types[ref].String(), ref, len(types), helper.offset, helper.offset)
}
value, subErr := types[ref].Value()
if subErr != nil {
if Central.IsDebugLevel() {
Central.Log.Debugf("Error creating field value for %s", types[ref].String())
}
err = subErr
return
}
value.setPeriodIndex(peIndex)
_, err := value.parseBuffer(helper, option)
if err != nil {
return nil, err
}
if int(ref) == lengthFieldIndex {
lengthFieldValue := value.(*ubyteValue)
endOfBuffer += uint32(lengthFieldValue.ByteValue())
Central.Log.Debugf("Found end of buffer at %d", endOfBuffer)
}
if Central.IsDebugLevel() {
Central.Log.Debugf("Got value for type %s: %p", types[ref].String(), value)
}
adaValues = append(adaValues, value)
}
} else {
Central.Log.Debugf("No condition matrix step")
}
if lengthFieldIndex > 0 {
pos, posErr := helper.position(endOfBuffer)
if posErr != nil {
err = posErr
Central.Log.Debugf("Position error %v", posErr)
return
}
if pos == -1 {
Central.Log.Debugf("Position error")
}
}
if Central.IsDebugLevel() {
Central.Log.Debugf("================== Ending Parse buffer for IAdaTypes of %v need second=%v", parent, option.NeedSecondCall)
}
return
}
// NewDefinition create new Definition instance
func NewDefinition() *Definition {
def := &Definition{fileFields: make(map[string]IAdaType),
fileShortFields: make(map[string]IAdaType),
activeFieldTree: NewStructure()}
def.fileFieldTree = def.activeFieldTree
return def
}
// NewDefinitionWithTypes create new Definition instance adding the given types into the tree
func NewDefinitionWithTypes(types []IAdaType) *Definition {
def := NewDefinition()
def.activeFieldTree.SubTypes = types
def.activeFieldTree.condition = NewFieldCondition()
def.fileFieldTree = def.activeFieldTree
def.InitReferences()
def.activeFields = make(map[string]IAdaType)
for _, v := range types {
v.SetParent(def.activeFieldTree)
}
initFieldHash(def, types)
Central.Log.Debugf("Ready creation of definition with types")
return def
}
// NewDefinitionClone clone new Definition instance using old definition and clone the
// active tree to the new one
func NewDefinitionClone(old *Definition) *Definition {
newDefinition := NewDefinition()
newDefinition.fileFieldTree = old.fileFieldTree
newDefinition.fileFields = old.fileFields
newDefinition.fileShortFields = old.fileShortFields
newDefinition.activeFieldTree = old.fileFieldTree
// initFieldHash(newDefinition, newDefinition.fileFieldTree.SubTypes)
return newDefinition
}
func initFieldHash(def *Definition, types []IAdaType) {
for _, v := range types {
def.fileFields[v.Name()] = v
def.fileShortFields[v.ShortName()] = v
def.activeFields[v.Name()] = v
if v.IsStructure() && v.Type() != FieldTypeMultiplefield {
sv := v.(*StructureType)
initFieldHash(def, sv.SubTypes)
}
}
}
// Adapt parent reference to inherit flags
func adaptParentReference(adaType IAdaType, parentType IAdaType, level int, x interface{}) error {
adaType.SetParent(parentType)
adaType.SetLevel(uint8(level))
if adaType.Type() == FieldTypeMultiplefield {
p := adaType.GetParent()
for p != nil {
p.AddFlag(FlagOptionAtomicFB)
p = p.GetParent()
}
}
return adaptFlags(adaType, parentType, level, x)
}
// InitReferences Temporary flag inherit on all tree nodes
func (def *Definition) InitReferences() {
t := TraverserMethods{EnterFunction: adaptParentReference}
_ = def.TraverseTypes(t, false, nil)
}
// Traverse traverse through the tree of definition calling a callback method
func adaptFlags(adaType IAdaType, parentType IAdaType, level int, x interface{}) error {
if parentType != nil {
if parentType.HasFlagSet(FlagOptionPE) {
if Central.IsDebugLevel() {
Central.Log.Debugf("%s: Set PE flag", adaType.Name())
}
adaType.AddFlag(FlagOptionPE)
}
if adaType.Type() == FieldTypeMultiplefield {
currentType := parentType
for currentType != nil {
if Central.IsDebugLevel() {
Central.Log.Debugf("%s: Set MU flag", currentType.Name())
Central.Log.Debugf("Adapt parent field flags for %s, need atomic FB", currentType.ShortName())
}
currentType.AddFlag(FlagOptionAtomicFB)
// TODO Adapt current type to adapt parent information
currentType = currentType.GetParent()
}
}
if adaType.HasFlagSet(FlagOptionAtomicFB) && adaType.IsStructure() {
structureType := adaType.(*StructureType)
if Central.IsDebugLevel() {
Central.Log.Debugf("Adapt sub field flags for %s, need atomic FB", adaType.ShortName())
}
for _, t := range structureType.SubTypes {
t.AddFlag(FlagOptionAtomicFB)
}
}
}
return nil
}
// String return the content of the definition
func (def *Definition) String() string {
var buffer bytes.Buffer
buffer.WriteString("Definition types:\n")
t := TraverserMethods{EnterFunction: func(adaType IAdaType, parentType IAdaType, level int, x interface{}) error {
output := fmt.Sprintf("%s\n", adaType.String())
buffer.WriteString(output)
return nil
}}
err := def.TraverseTypes(t, true, nil)
if err != nil {
buffer.WriteString(fmt.Sprintf("\nError evaluating types: %v", err))
}
return buffer.String()
}
// AppendType append the given type to the type list
func (def *Definition) AppendType(adaType IAdaType) {
def.activeFieldTree.SubTypes = append(def.activeFieldTree.SubTypes, adaType)
adaType.SetParent(def.activeFieldTree)
}
// Fieldnames list of fields part of the query
func (def *Definition) Fieldnames() []string {
typeList := make([]string, 0)
t := TraverserMethods{EnterFunction: func(adaType IAdaType, parentType IAdaType, level int, x interface{}) error {
typeList = append(typeList, adaType.Name())
return nil
}}
_ = def.TraverseTypes(t, true, typeList)
return typeList
}
// CheckField check field part of active fields
func (def *Definition) CheckField(name string) bool {
_, ok := def.activeFields[name]
if len(def.activeFields) == 0 && len(def.Values) > 0 {
return true
}
Central.Log.Debugf("returning %v %d %d", ok, len(def.activeFields), len(def.Values))
return ok
}
// AdaptName adapt new name to an definition entry
func (def *Definition) AdaptName(adaType IAdaType, newName string) error {
if Central.IsDebugLevel() {
Central.Log.Debugf("Adapt new name %s to %s/%s ", newName,
adaType.Name(), adaType.ShortName())
}
delete(def.fileFields, adaType.Name())
def.fileFields[newName] = adaType
if def.activeFields == nil {
def.activeFields = def.fileFields
} else {
if &def.fileFields != &def.activeFields {
delete(def.activeFields, adaType.Name())
def.activeFields[newName] = adaType
}
}
adaType.SetName(newName)
return nil
}
type stackParameter struct {
definition *Definition
forStoring bool
stack *Stack
structureValue *StructureValue
}
func addValueToStructure(parameter *stackParameter, value IAdaValue, peIndex, muIndex uint32) error {
if Central.IsDebugLevel() {
Central.Log.Debugf("Add sub value %s to structure for %s = %v %s[%d,%d]",
value.Type().Type().name(), value.Type().Name(), value.String(),
value.Type().Type().name(), peIndex, muIndex)
}
if parameter.structureValue == nil {
if Central.IsDebugLevel() {
Central.Log.Debugf("Add to main")
}
parameter.definition.Values = append(parameter.definition.Values, value)
} else {
if parameter.structureValue.Type().Type() == FieldTypePeriodGroup {
return parameter.structureValue.addValue(value, peIndex, 0)
}
if value.Type().HasFlagSet(FlagOptionPE) && parameter.structureValue.Type().Type() == FieldTypeMultiplefield {
return parameter.structureValue.addValue(value, peIndex, muIndex)
}
if parameter.structureValue.Type().Type() == FieldTypeMultiplefield {
return parameter.structureValue.addValue(value, peIndex, muIndex)
}
return parameter.structureValue.addValue(value, peIndex, muIndex)
}
return nil
}
// create value function used in traverser to create a tree per type element
func traverserCreateValue(adaType IAdaType, parentType IAdaType, level int, x interface{}) error {
parameter := x.(*stackParameter)
debug := Central.IsDebugLevel()
if parameter.structureValue != nil {
if debug {
Central.Log.Debugf("parent is %s level %d for level %d", parameter.structureValue.Type().Name(), parameter.structureValue.Type().Level(), adaType.Level())
}
for parameter.structureValue != nil && parameter.structureValue.Type().Level() != (adaType.Level()-1) {
element, _ := parameter.stack.Pop()
parameter.structureValue = element.(*StructureValue)
if debug {
if parameter.structureValue == nil {
Central.Log.Debugf("Top received")
} else {
Central.Log.Debugf("Check parent is %s %d", parameter.structureValue.Type().Name(), parameter.structureValue.Type().Level())
}
}
}
}
if parameter.forStoring && adaType.IsSpecialDescriptor() {
if debug {
Central.Log.Debugf("For storing or is descriptor, skip creating value")
}
return nil
}
if debug {
Central.Log.Debugf("Create value for level=%d %s -> %d", level, adaType.Name(), adaType.Level())
}
isDefaultPeRange := adaType.PeriodicRange() == nil || (adaType.PeriodicRange().from == 1 &&
adaType.PeriodicRange().to == LastEntry)
Central.Log.Debugf("Is PE range %v, PE flag %v", isDefaultPeRange, adaType.HasFlagSet(FlagOptionPE))
if adaType.IsStructure() && adaType.Type() != FieldTypeRedefinition {
if adaType.Type() != FieldTypePeriodGroup && adaType.HasFlagSet(FlagOptionPE) {
if isDefaultPeRange {
Central.Log.Debugf("No PE group for reading %#v", adaType.PeriodicRange())
return nil
}
Central.Log.Debugf("No PE group but PE Flag")
}
parameter.stack.Push(parameter.structureValue)
if debug {
Central.Log.Debugf("Create structure value for %s -> %s", adaType.Name(), adaType.PartialRange().FormatBuffer())
Central.Log.Debugf("Create structure value for %s -> %s", adaType.Name(), adaType.PeriodicRange().FormatBuffer())
Central.Log.Debugf("Create structure value for %s -> %s", adaType.Name(), adaType.MultipleRange().FormatBuffer())
}
value, subErr := adaType.Value()
if subErr != nil {
Central.Log.Debugf("Error %v", subErr)
return subErr
}
peIndex := uint32(0)
if value.Type().Type() != FieldTypePeriodGroup &&
(adaType.PeriodicRange().from > 0 || adaType.PeriodicRange().from == LastEntry) {
peIndex = uint32(adaType.PeriodicRange().from)
value.setPeriodIndex(peIndex)
}
muIndex := uint32(0)
if adaType.HasFlagSet(FlagOptionMUGhost) &&
(adaType.MultipleRange().from > 0 || adaType.MultipleRange().from == LastEntry) {
muIndex = uint32(adaType.MultipleRange().from)
value.setMultipleIndex(muIndex)
}
Central.Log.Debugf("Set PE index %d and MU index %d", peIndex, muIndex)
subErr = addValueToStructure(parameter, value, peIndex, muIndex)
if subErr != nil {
return subErr
}
parameter.structureValue = value.(*StructureValue)
} else {
if debug {
Central.Log.Debugf("Create no structure value %s %s", adaType.Name(), adaType.Type().name())
if isDefaultPeRange {
Central.Log.Debugf("PE default range")
} else {
Central.Log.Debugf("PE range %d:%d",
adaType.PeriodicRange().from,
adaType.PeriodicRange().to)
Central.Log.Debugf("MU range %d:%d",
adaType.MultipleRange().from,
adaType.MultipleRange().to)
}
}
// Don't create Period group field elements
if adaType.HasFlagSet(FlagOptionPE) && (isDefaultPeRange || adaType.PeriodicRange().from == 0) {
Central.Log.Debugf("No PE element, skip it")
return nil
}
// Don't create ghost nodes for MU fields
if adaType.HasFlagSet(FlagOptionMUGhost) && (isDefaultPeRange || adaType.MultipleRange().from == -1) {
Central.Log.Debugf("No MU ghost element, skip it")
return nil
}
if parameter.structureValue == nil {
if debug {
Central.Log.Debugf("Add node value %s to main %s", adaType.Name(), adaType.PeriodicRange().FormatBuffer())
}
value, subErr := adaType.Value()
if subErr != nil {
Central.Log.Debugf("Error %v", subErr)
return subErr
}
parameter.definition.Values = append(parameter.definition.Values, value)
} else {
// Check if value already exists
ok := false
if len(parameter.structureValue.Elements) > 0 {
_, ok = parameter.structureValue.Elements[0].valueMap[adaType.Name()]
}
if !ok {
if debug {
Central.Log.Debugf("Add node value %s to structure %s %s", adaType.Name(),
adaType.PartialRange().FormatBuffer(), adaType.MultipleRange().FormatBuffer())
}
value, subErr := adaType.Value()
if subErr != nil {
Central.Log.Debugf("Error %v", subErr)
return subErr
}
peIndex := uint32(0)
if adaType.PeriodicRange().from > 0 || adaType.PeriodicRange().from == LastEntry {
peIndex = uint32(adaType.PeriodicRange().from)
value.setPeriodIndex(peIndex)
}
muIndex := uint32(0)
if adaType.HasFlagSet(FlagOptionMUGhost) &&
(adaType.PeriodicRange().from > 0 || adaType.PeriodicRange().from == LastEntry) {
muIndex = uint32(adaType.MultipleRange().from)
value.setMultipleIndex(muIndex)
}
Central.Log.Debugf("Add index %d,%d", peIndex, muIndex)
subErr = addValueToStructure(parameter, value, peIndex, muIndex)
if subErr != nil {
return subErr
}
if !isDefaultPeRange &&
(adaType.PeriodicRange().from > 0 || adaType.PeriodicRange().from == LastEntry) {
value.setPeriodIndex(uint32(adaType.PeriodicRange().from))
}
if adaType.MultipleRange() != nil && adaType.MultipleRange().from > 0 {
value.setMultipleIndex(uint32(adaType.MultipleRange().from))
}
if debug {
Central.Log.Debugf("Added PE element %s[%d,%d]", value.Type().Name(), value.PeriodIndex(), value.MultipleIndex())
}
} else {
if debug {
Central.Log.Debugf("Skip because already added")
}
}
}
}
if debug {
Central.Log.Debugf("Finished creating value level=%d name=%s (%s)",
adaType.Level(), adaType.Name(), adaType.Type().name())
}
return nil
}
// CreateValues Create new value tree
func (def *Definition) CreateValues(forStoring bool) (err error) {
// Reset values
def.Values = nil
if Central.IsDebugLevel() {
Central.Log.Debugf("Create values from types for storing=%v -> %#v", forStoring, def.activeFieldTree)
}
parameter := &stackParameter{definition: def, forStoring: forStoring, stack: NewStack()}
t := TraverserMethods{EnterFunction: traverserCreateValue}
err = def.TraverseTypes(t, true, parameter)
if Central.IsDebugLevel() {
Central.Log.Debugf("Done creating values ... %v", err)
Central.Log.Debugf("Created %d values", len(def.Values))
def.DumpValues(true)
}
return
}
// SetValueWithIndex Add value to an node element
func (def *Definition) SetValueWithIndex(name string, index []uint32, x interface{}) error {
typ, err := def.SearchType(name)
if err != nil {
Central.Log.Debugf("Search type error: %v", err)
return err
}
if len(index) == 2 && typ.Type() != FieldTypeMultiplefield && index[1] > 0 {
return NewGenericError(62)
}
if Central.IsDebugLevel() {
Central.Log.Debugf("Set value %s with index=%#v value=%v", name, index, x)
}
var val IAdaValue
if !typ.HasFlagSet(FlagOptionPE) {
Central.Log.Debugf("Search name ....%s", name)
val = def.Search(name)
if val == nil {
return NewGenericError(63, name)
}
} else {
Central.Log.Debugf("Search indexed period group ....%s %d", name, index)
val, err = def.SearchByIndex(name, index, true)
if err != nil {
return err
}
if val == nil {
return NewGenericError(127, name)
}
}
if Central.IsDebugLevel() {
Central.Log.Debugf("Found value to add to %s[%d,%d] type=%v %T %T index=%#v", val.Type().Name(),
val.PeriodIndex(), val.MultipleIndex(), val.Type().Type().name(), val, val.Type(), index)
}
switch val.Type().Type() {
case FieldTypeMultiplefield:
sv := val.(*StructureValue)
st := sv.Type().(*StructureType)
//sv.Type().
// sv.Elements = append(sv.Elements, subValue)
// if len(sv.Elements) == 0 {
// e := &structureElement{}
// Central.Log.Debugf("Add empty element to %s",sv.Type().Name())
// sv.Elements = append(sv.Elements, e)
// }
// if len(sv.Elements[0].Values) >= int(index[0]) {
// Central.Log.Debugf("Adapt %#v", st.SubTypes)
// subValue := sv.Elements[0].Values[int(index[0]-1)]
// err = subValue.SetValue(x)
// } else {
subValue, serr := st.SubTypes[0].Value()
if serr != nil {
return serr
}
err = subValue.SetValue(x)
if err != nil {
return err
}
peIndex := uint32(0)
curIndex := 0
if typ.HasFlagSet(FlagOptionPE) {
if len(index) > 0 {
peIndex = index[curIndex]
curIndex++
} else {
return fmt.Errorf("XXX")
}
}
muIndex := uint32(0)
if typ.Type() == FieldTypeMultiplefield || typ.HasFlagSet(FlagOptionMUGhost) {
if len(index) > curIndex {
muIndex = index[curIndex]
} else {
return fmt.Errorf("XXX")
}
}
Central.Log.Debugf("Set indexes to PE=%d MU=%d current=%d", peIndex, muIndex, curIndex)
err = sv.addValue(subValue, peIndex, muIndex)
// subValue.setMultipleIndex(index[0])
// sv.Elements[0].Values = append(sv.Elements[0].Values, subValue)
// }
if Central.IsDebugLevel() {
Central.Log.Debugf("Add Multiple field, elements=%d", len(sv.Elements))
}
default:
err = val.SetValue(x)
}
return err
}
// Descriptors Return slice of descriptor field names given
func (def *Definition) Descriptors(descriptors string) (desc []string, err error) {
descFields := strings.Split(descriptors, ",")
for _, d := range descFields {
adaType, searchErr := def.SearchType(d)
if searchErr != nil {
err = searchErr
return
}
if adaType == nil {
err = NewGenericError(43, d)
return nil, err
}
desc = append(desc, adaType.ShortName())
}
if Central.IsDebugLevel() {
Central.Log.Debugf("Descriptors: %v", desc)
}
return
}