-
Notifications
You must be signed in to change notification settings - Fork 10
/
source_locations.go
142 lines (125 loc) · 3.38 KB
/
source_locations.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
// © 2022-2023 Snyk Limited All rights reserved.
//
// 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 hcl_interpreter
import (
"fmt"
"github.com/hashicorp/hcl/v2"
)
func (v *Evaluation) Location(
resourceId string,
path []interface{},
) []hcl.Range {
// Find resource location.
resource, ok := v.Analysis.Resources[resourceId]
name, _ := StringToFullName(resourceId)
if !ok || name == nil {
return nil
}
location := resource.Location
// Find attribute location, if appropriate.
if len(path) > 0 {
resourceNode := &hclSourceNode{
Object: resource.Body,
Range: resource.Location,
}
loc, _ := resourceNode.getDescendant(path)
if loc != nil {
location = loc.Range
}
}
// Construct stack with modules.
ranges := []hcl.Range{location}
for i := len(name.Module); i >= 1; i-- {
moduleKey := ModuleNameToString(name.Module[:i])
if module, ok := v.Analysis.Modules[moduleKey]; ok && module.Location != nil {
ranges = append(ranges, *module.Location)
}
}
return ranges
}
// An `hclSourceNode` represents a syntax tree in the HCL config.
type hclSourceNode struct {
// Exactly one of the next three fields will be set.
Object hcl.Body
Array hcl.Blocks
Attribute *hcl.Attribute
// This will always be set.
Range hcl.Range
}
func (node *hclSourceNode) getKey(key string) (*hclSourceNode, error) {
child := hclSourceNode{}
if node.Object != nil {
bodyContent, _, diags := node.Object.PartialContent(&hcl.BodySchema{
Attributes: []hcl.AttributeSchema{
{
Name: key,
Required: false,
},
},
Blocks: []hcl.BlockHeaderSchema{
{
Type: key,
},
},
})
if diags.HasErrors() {
return nil, fmt.Errorf(diags.Error())
}
blocks := bodyContent.Blocks.OfType(key)
if len(blocks) > 0 {
child.Array = blocks
child.Range = blocks[0].DefRange
return &child, nil
}
if attribute, ok := bodyContent.Attributes[key]; ok {
child.Attribute = attribute
child.Range = attribute.Range
return &child, nil
}
}
return nil, fmt.Errorf("Expected object")
}
func (node *hclSourceNode) getIndex(index int) (*hclSourceNode, error) {
child := hclSourceNode{}
if node.Array != nil {
if index < 0 || index >= len(node.Array) {
return nil, fmt.Errorf("hclSourceNode.Get: out of bounds: %d", index)
}
child.Object = node.Array[index].Body
child.Range = node.Array[index].DefRange
return &child, nil
}
return nil, fmt.Errorf("Expected array")
}
func (node *hclSourceNode) getDescendant(path []interface{}) (*hclSourceNode, error) {
if len(path) == 0 {
return node, nil
}
var child *hclSourceNode
var err error
switch k := path[0].(type) {
case string:
child, err = node.getKey(k)
case int:
child, err = node.getIndex(k)
case int64:
child, err = node.getIndex(int(k))
case float64:
child, err = node.getIndex(int(k))
}
if child == nil {
return node, err
}
return child.getDescendant(path[1:])
}