generated from TBD54566975/tbd-project-template
-
Notifications
You must be signed in to change notification settings - Fork 7
/
extract.go
251 lines (233 loc) · 7.82 KB
/
extract.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
package schema
import (
"fmt"
"go/types"
"golang.org/x/exp/maps"
"github.com/TBD54566975/ftl/backend/schema"
"github.com/TBD54566975/ftl/go-runtime/schema/common"
"github.com/TBD54566975/ftl/go-runtime/schema/data"
"github.com/TBD54566975/ftl/go-runtime/schema/finalize"
"github.com/TBD54566975/ftl/go-runtime/schema/initialize"
"github.com/TBD54566975/ftl/go-runtime/schema/metadata"
"github.com/TBD54566975/ftl/go-runtime/schema/transitive"
"github.com/TBD54566975/ftl/go-runtime/schema/typealias"
"github.com/TBD54566975/ftl/go-runtime/schema/verb"
"github.com/TBD54566975/golang-tools/go/analysis"
"github.com/TBD54566975/golang-tools/go/analysis/passes/inspect"
checker "github.com/TBD54566975/golang-tools/go/analysis/programmaticchecker"
"github.com/TBD54566975/golang-tools/go/packages"
)
// Extractors contains all schema extractors that will run.
//
// It is a list of lists, where each list is a round of tasks dependent on the prior round's execution (e.g. an analyzer
// in Extractors[1] will only execute once all analyzers in Extractors[0] complete). Elements of the same list
// should be considered unordered and may run in parallel.
var Extractors = [][]*analysis.Analyzer{
{
initialize.Analyzer,
inspect.Analyzer,
},
{
metadata.Extractor,
},
{
typealias.Extractor,
verb.Extractor,
data.Extractor,
},
{
transitive.Extractor,
},
{
finalize.Analyzer,
},
}
// Result contains the final schema extraction result.
type Result struct {
// Module is the extracted module schema.
Module *schema.Module
// NativeNames maps schema nodes to their native Go names.
NativeNames map[schema.Node]string
// Errors is a list of errors encountered during schema extraction.
Errors []*schema.Error
}
// Extract statically parses Go FTL module source into a schema.Module
func Extract(moduleDir string) (Result, error) {
pkgConfig := packages.Config{
Dir: moduleDir,
Mode: packages.NeedName | packages.NeedFiles | packages.NeedSyntax | packages.NeedTypes | packages.NeedTypesInfo | packages.NeedImports,
}
cConfig := checker.Config{
LoadConfig: pkgConfig,
ReverseImportExecutionOrder: true,
Patterns: []string{"./..."},
}
results, diagnostics, err := checker.Run(cConfig, analyzersWithDependencies()...)
if err != nil {
return Result{}, err
}
return combineAllPackageResults(results, diagnostics)
}
func analyzersWithDependencies() []*analysis.Analyzer {
var as []*analysis.Analyzer
// observes dependencies as specified by tiered list ordering in Extractors and applies the dependency
// requirements to the analyzers
//
// flattens Extractors (a list of lists) into a single list to provide as input for the checker
for i, extractorRound := range Extractors {
for _, extractor := range extractorRound {
extractor.RunDespiteErrors = true
extractor.Requires = append(extractor.Requires, dependenciesBeforeIndex(i)...)
as = append(as, extractor)
}
}
return as
}
// the run will produce finalizer results for all packages it executes on, so we need to aggregate the results into a
// single schema
func combineAllPackageResults(results map[*analysis.Analyzer][]any, diagnostics []analysis.SimpleDiagnostic) (Result, error) {
fResults, ok := results[finalize.Analyzer]
if !ok {
return Result{}, fmt.Errorf("schema extraction finalizer result not found")
}
combined := Result{
NativeNames: make(map[schema.Node]string),
Errors: diagnosticsToSchemaErrors(diagnostics),
}
failedRefs := make(map[schema.RefKey]types.Object)
extractedDecls := make(map[schema.Decl]types.Object)
for _, r := range fResults {
fr, ok := r.(finalize.Result)
if !ok {
return Result{}, fmt.Errorf("unexpected schema extraction result type: %T", r)
}
if combined.Module == nil {
combined.Module = &schema.Module{Name: fr.ModuleName, Comments: fr.ModuleComments}
} else {
if combined.Module.Name != fr.ModuleName {
return Result{}, fmt.Errorf("unexpected schema extraction result module name: %s", fr.ModuleName)
}
if len(combined.Module.Comments) == 0 {
combined.Module.Comments = fr.ModuleComments
}
}
maps.Copy(failedRefs, fr.Failed)
maps.Copy(extractedDecls, fr.Extracted)
}
combined.Module.AddDecls(maps.Keys(extractedDecls))
for decl, obj := range extractedDecls {
combined.NativeNames[decl] = common.GetNativeName(obj)
}
combined.Errors = append(combined.Errors, propagateTypeErrors(combined.Module, failedRefs)...)
schema.SortErrorsByPosition(combined.Errors)
updateVisibility(combined.Module)
// TODO: validate schema once we have the full schema here
return combined, nil
}
// updateVisibility traverses the module schema via refs and updates visibility as needed.
func updateVisibility(module *schema.Module) {
for _, d := range module.Decls {
if d.IsExported() {
updateTransitiveVisibility(d, module)
}
}
}
// updateTransitiveVisibility updates any decls that are transitively visible from d.
func updateTransitiveVisibility(d schema.Decl, module *schema.Module) {
if !d.IsExported() {
return
}
_ = schema.Visit(d, func(n schema.Node, next func() error) error { //nolint:errcheck
ref, ok := n.(*schema.Ref)
if !ok {
return next()
}
resolved := module.Resolve(*ref)
if resolved == nil || resolved.Symbol == nil {
return next()
}
if decl, ok := resolved.Symbol.(schema.Decl); ok {
switch t := decl.(type) {
case *schema.Data:
t.Export = true
case *schema.Enum:
t.Export = true
case *schema.TypeAlias:
t.Export = true
case *schema.Topic:
t.Export = true
case *schema.Verb:
t.Export = true
case *schema.Database, *schema.Config, *schema.FSM, *schema.Secret, *schema.Subscription:
}
updateTransitiveVisibility(decl, module)
}
return next()
})
}
// propagateTypeErrors propagates type errors to referencing nodes. This improves error messaging for the LSP client by
// surfacing errors all the way up the schema chain.
func propagateTypeErrors(module *schema.Module, failedRefs map[schema.RefKey]types.Object) []*schema.Error {
var errs []*schema.Error
_ = schema.VisitWithParent(module, nil, func(n schema.Node, p schema.Node, next func() error) error { //nolint:errcheck
if p == nil {
return next()
}
ref, ok := n.(*schema.Ref)
if !ok {
return next()
}
if obj, ok := failedRefs[ref.ToRefKey()]; ok {
refNativeName := common.GetNativeName(obj)
switch pt := p.(type) {
case *schema.Verb:
if pt.Request == n {
errs = append(errs, schema.Errorf(pt.Request.Position(), pt.Request.Position().Column,
"unsupported request type %q", refNativeName))
}
if pt.Response == n {
errs = append(errs, schema.Errorf(pt.Response.Position(), pt.Response.Position().Column,
"unsupported response type %q", refNativeName))
}
case *schema.Field:
errs = append(errs, schema.Errorf(pt.Position(), pt.Position().Column, "unsupported type %q for "+
"field %q", refNativeName, pt.Name))
default:
errs = append(errs, schema.Errorf(p.Position(), p.Position().Column, "unsupported type %q",
refNativeName))
}
}
return next()
})
return errs
}
func diagnosticsToSchemaErrors(diagnostics []analysis.SimpleDiagnostic) []*schema.Error {
if len(diagnostics) == 0 {
return nil
}
errors := make([]*schema.Error, 0, len(diagnostics))
for _, d := range diagnostics {
errors = append(errors, &schema.Error{
Pos: simplePosToSchemaPos(d.Pos),
EndColumn: d.End.Column,
Msg: d.Message,
Level: common.DiagnosticCategory(d.Category).ToErrorLevel(),
})
}
return errors
}
func dependenciesBeforeIndex(idx int) []*analysis.Analyzer {
var deps []*analysis.Analyzer
for i := range idx {
deps = append(deps, Extractors[i]...)
}
return deps
}
func simplePosToSchemaPos(pos analysis.SimplePosition) schema.Position {
return schema.Position{
Filename: pos.Filename,
Offset: pos.Offset,
Line: pos.Line,
Column: pos.Column,
}
}