-
Notifications
You must be signed in to change notification settings - Fork 2k
Expand file tree
/
Copy pathschema.py
More file actions
610 lines (413 loc) · 10.2 KB
/
schema.py
File metadata and controls
610 lines (413 loc) · 10.2 KB
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
"""
Schema description
This file should be kept simple:
* no flow control
* no aliases
* only class definitions with annotations and `include` calls
For how documentation of generated QL code works, please read `misc/codegen/schema_documentation.md`.
"""
from misc.codegen.lib.schemadefs import *
include("prefix.dbscheme")
@qltest.skip
class Element:
pass
@qltest.collapse_hierarchy
class File(Element):
name: string
@qltest.skip
@qltest.collapse_hierarchy
class Location(Element):
file: File
start_line: int
start_column: int
end_line: int
end_column: int
class DbFile(File):
pass
class DbLocation(Location):
pass
@synth.on_arguments()
class UnknownFile(File):
pass
@synth.on_arguments()
class UnknownLocation(Location):
pass
@qltest.skip
class Locatable(Element):
location: optional[Location]
@qltest.skip
class AstNode(Locatable):
pass
@qltest.skip
class Unimplemented(AstNode):
pass
class Declaration(AstNode):
pass
class Module(Declaration):
# TODO name
declarations: list[Declaration] | child
@qltest.collapse_hierarchy
class Expr(AstNode):
pass
@qltest.collapse_hierarchy
class Pat(AstNode):
pass
@qltest.skip
class Label(AstNode):
name: string
@qltest.collapse_hierarchy
class Stmt(AstNode):
pass
@qltest.collapse_hierarchy
class TypeRef(AstNode):
# TODO
pass
class Function(Declaration):
"""
A function declaration. For example
```
fn foo(x: u32) -> u64 { (x + 1).into() }
```
A function declaration within a trait might not have a body:
```
trait Trait {
fn bar();
}
```
"""
name: string
body: Expr | child
# Missing,
class MissingExpr(Expr):
pass
# Path(Path),
class PathExpr(Expr):
path: Unimplemented | child
# If {
# condition: ExprId,
# then_branch: ExprId,
# else_branch: Option<ExprId>,
# },
class IfExpr(Expr):
condition: Expr | child
then: Expr | child
else_: optional[Expr] | child
# Let {
# pat: PatId,
# expr: ExprId,
# },
class LetExpr(Expr):
pat: Pat | child
expr: Expr | child
# Block {
# id: Option<BlockId>,
# statements: Box<[Stmt]>,
# tail: Option<ExprId>,
# label: Option<LabelId>,
# },
class BlockExprBase(Expr):
statements: list[Stmt] | child
tail: optional[Expr] | child
class BlockExpr(BlockExprBase):
label: optional[Label] | child
# Async {
# id: Option<BlockId>,
# statements: Box<[Stmt]>,
# tail: Option<ExprId>,
# },
class AsyncBlockExpr(BlockExprBase):
pass
# Const(ConstBlockId),
class ConstExpr(Expr):
expr: Expr | child
# // FIXME: Fold this into Block with an unsafe flag?
# Unsafe {
# id: Option<BlockId>,
# statements: Box<[Stmt]>,
# tail: Option<ExprId>,
# },
class UnsafeBlockExpr(BlockExprBase):
pass
# Loop {
# body: ExprId,
# label: Option<LabelId>,
# },
class LoopExpr(Expr):
body: Expr | child
label: optional[Label] | child
# Call {
# callee: ExprId,
# args: Box<[ExprId]>,
# is_assignee_expr: bool,
# },
class CallExpr(Expr):
callee: Expr | child
args: list[Expr] | child
is_assignee_expr: predicate
# MethodCall {
# receiver: ExprId,
# method_name: Name,
# args: Box<[ExprId]>,
# generic_args: Option<Box<GenericArgs>>,
# },
class MethodCallExpr(Expr):
receiver: Expr | child
method_name: string
args: list[Expr] | child
generic_args: optional[Unimplemented] | child
# pub struct MatchArm {
# pub pat: PatId,
# pub guard: Option<ExprId>,
# pub expr: ExprId,
# }
@qltest.skip
class MatchArm(AstNode):
pat: Pat | child
guard: optional[Expr] | child
expr: Expr | child
# Match {
# expr: ExprId,
# arms: Box<[MatchArm]>,
# },
class MatchExpr(Expr):
expr: Expr | child
branches: list[MatchArm] | child
# Continue {
# label: Option<LabelId>,
# },
class ContinueExpr(Expr):
label: optional[Label] | child
# Break {
# expr: Option<ExprId>,
# label: Option<LabelId>,
# },
class BreakExpr(Expr):
expr: optional[Expr] | child
label: optional[Label] | child
# Return {
# expr: Option<ExprId>,
# },
class ReturnExpr(Expr):
expr: optional[Expr] | child
# Become {
# expr: ExprId,
# },
class BecomeExpr(Expr):
expr: Expr | child
# Yield {
# expr: Option<ExprId>,
# },
class YieldExpr(Expr):
expr: optional[Expr] | child
# Yeet {
# expr: Option<ExprId>,
# },
class YeetExpr(Expr):
expr: optional[Expr] | child
# RecordLit {
# path: Option<Box<Path>>,
# fields: Box<[RecordLitField]>,
# spread: Option<ExprId>,
# ellipsis: bool,
# is_assignee_expr: bool,
# },
class RecordFieldPat(AstNode):
name: string
pat: Pat | child
class RecordLitField(AstNode):
name: string
expr: Expr | child
class RecordLitExpr(Expr):
path: optional[Unimplemented] | child
fields: list[RecordLitField] | child
spread: optional[Expr] | child
has_ellipsis: predicate
is_assignee_expr: predicate
# Field {
# expr: ExprId,
# name: Name,
# },
class FieldExpr(Expr):
expr: Expr | child
name: string
# Await {
# expr: ExprId,
# },
class AwaitExpr(Expr):
expr: Expr | child
# Cast {
# expr: ExprId,
# type_ref: Interned<TypeRef>,
# },
class CastExpr(Expr):
expr: Expr | child
type_ref: TypeRef | child
# Ref {
# expr: ExprId,
# rawness: Rawness,
# mutability: Mutability,
# },
class RefExpr(Expr):
expr: Expr | child
is_raw: predicate
is_mut: predicate
# Box {
# expr: ExprId,
# },
class BoxExpr(Expr):
expr: Expr | child
# UnaryOp {
# expr: ExprId,
# op: UnaryOp,
# },
class UnaryOpExpr(Expr):
expr: Expr | child
op: string
# BinaryOp {
# lhs: ExprId,
# rhs: ExprId,
# op: Option<BinaryOp>,
# },
class BinaryOpExpr(Expr):
lhs: Expr | child
rhs: Expr | child
op: optional[string]
# Range {
# lhs: Option<ExprId>,
# rhs: Option<ExprId>,
# range_type: RangeOp,
# },
class RangeExpr(Expr):
lhs: optional[Expr] | child
rhs: optional[Expr] | child
is_inclusive: predicate
# Index {
# base: ExprId,
# index: ExprId,
# is_assignee_expr: bool,
# },
class IndexExpr(Expr):
base: Expr | child
index: Expr | child
is_assignee_expr: predicate
# Closure {
# args: Box<[PatId]>,
# arg_types: Box<[Option<Interned<TypeRef>>]>,
# ret_type: Option<Interned<TypeRef>>,
# body: ExprId,
# closure_kind: ClosureKind,
# capture_by: CaptureBy,
# },
class ClosureExpr(Expr):
args: list[Pat] | child
arg_types: list[optional[TypeRef]] | child
ret_type: optional[TypeRef] | child
body: Expr | child
closure_kind: string
is_move: predicate
# Tuple {
# exprs: Box<[ExprId]>,
# is_assignee_expr: bool,
# },
class TupleExpr(Expr):
exprs: list[Expr] | child
is_assignee_expr: predicate
# Array(Array),
class ArrayExpr(Expr):
pass
# Literal(Literal),
# ElementList { elements: Box<[ExprId]>, is_assignee_expr: bool },
class ElementListExpr(ArrayExpr):
elements: list[Expr] | child
is_assignee_expr: predicate
# Repeat { initializer: ExprId, repeat: ExprId },
class RepeatExpr(ArrayExpr):
initializer: Expr | child
repeat: Expr | child
class LiteralExpr(Expr):
pass
# Underscore,
class UnderscoreExpr(Expr):
pass
# OffsetOf(OffsetOf),
class OffsetOfExpr(Expr):
container: TypeRef | child
fields: list[string]
# InlineAsm(InlineAsm),
class InlineAsmExpr(Expr):
expr: Expr | child
# Let {
# pat: PatId,
# type_ref: Option<Interned<TypeRef>>,
# initializer: Option<ExprId>,
# else_branch: Option<ExprId>,
# },
class LetStmt(Stmt):
pat: Pat | child
type_ref: optional[TypeRef] | child
initializer: optional[Expr] | child
else_: optional[Expr] | child
# Expr {
# expr: ExprId,
# has_semi: bool,
# },
class ExprStmt(Stmt):
expr: Expr | child
has_semicolon: predicate
# // At the moment, we only use this to figure out if a return expression
# // is really the last statement of a block. See #16566
# Item,
class ItemStmt(Stmt):
pass
# Missing,
class MissingPat(Pat):
pass
# Wild,
class WildPat(Pat):
pass
# Tuple { args: Box<[PatId]>, ellipsis: Option<u32> },
class TuplePat(Pat):
args: list[Pat] | child
ellipsis_index: optional[int]
# Or(Box<[PatId]>),
class OrPat(Pat):
args: list[Pat] | child
# Record { path: Option<Box<Path>>, args: Box<[RecordFieldPat]>, ellipsis: bool },
class RecordPat(Pat):
path: optional[Unimplemented] | child
args: list[RecordFieldPat] | child
has_ellipsis: predicate
# Range { start: Option<Box<LiteralOrConst>>, end: Option<Box<LiteralOrConst>> },
class RangePat(Pat):
start: optional[Pat] | child
end: optional[Pat] | child
# Slice { prefix: Box<[PatId]>, slice: Option<PatId>, suffix: Box<[PatId]> },
class SlicePat(Pat):
prefix: list[Pat] | child
slice: optional[Pat] | child
suffix: list[Pat] | child
# Path(Box<Path>),
class PathPat(Pat):
path: Unimplemented | child
# Lit(ExprId),
class LitPat(Pat):
expr: Expr | child
# Bind { id: BindingId, subpat: Option<PatId> },
class BindPat(Pat):
binding_id: string
subpat: optional[Pat] | child
# TupleStruct { path: Option<Box<Path>>, args: Box<[PatId]>, ellipsis: Option<u32> },
class TupleStructPat(Pat):
path: optional[Unimplemented] | child
args: list[Pat] | child
ellipsis_index: optional[int]
# Ref { pat: PatId, mutability: Mutability },
class RefPat(Pat):
pat: Pat | child
is_mut: predicate
# Box { inner: PatId },
class BoxPat(Pat):
inner: Pat | child
# ConstBlock(ExprId),
class ConstBlockPat(Pat):
expr: Expr | child