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
|
#
#
# The Nimrod Compiler
# (c) Copyright 2011 Andreas Rumpf
#
# See the file "copying.txt", included in this
# distribution, for details about the copyright.
#
## This file implements features required for IDE support.
import
lexer, idents, ast, astalgo, semdata, msgs, types, sigmatch, options
const
sep = '\t'
sectionSuggest = "sug"
sectionDef = "def"
sectionContext = "con"
proc SymToStr(s: PSym, isLocal: bool, section: string): string =
result = section
result.add(sep)
result.add($s.kind)
result.add(sep)
if not isLocal:
if s.kind != skModule and s.owner != nil:
result.add(s.owner.name.s)
result.add('.')
result.add(s.name.s)
result.add(sep)
if s.typ != nil:
result.add(typeToString(s.typ))
result.add(sep)
result.add(toFilename(s.info))
result.add(sep)
result.add($ToLinenumber(s.info))
result.add(sep)
result.add($ToColumn(s.info))
proc filterSym(s: PSym): bool {.inline.} =
result = s.name.s[0] in lexer.SymChars
proc suggestField(s: PSym) =
if filterSym(s):
OutWriteln(SymToStr(s, isLocal=true, sectionSuggest))
template wholeSymTab(cond, section: expr) =
for i in countdown(c.tab.tos-1, 0):
for it in items(c.tab.stack[i]):
if cond:
OutWriteln(SymToStr(it, isLocal = i > ModuleTablePos, section))
proc suggestSymList(list: PNode) =
for i in countup(0, sonsLen(list) - 1):
if list.sons[i].kind != nkSym: InternalError(list.info, "getSymFromList")
suggestField(list.sons[i].sym)
proc suggestObject(n: PNode) =
case n.kind
of nkRecList:
for i in countup(0, sonsLen(n)-1): suggestObject(n.sons[i])
of nkRecCase:
var L = sonsLen(n)
if L > 0:
suggestObject(n.sons[0])
for i in countup(1, L-1): suggestObject(lastSon(n.sons[i]))
of nkSym: suggestField(n.sym)
else: nil
proc nameFits(c: PContext, s: PSym, n: PNode): bool =
var op = n.sons[0]
if op.kind == nkSymChoice: op = op.sons[0]
var opr: PIdent
case op.kind
of nkSym: opr = op.sym.name
of nkIdent: opr = op.ident
else: return false
result = opr.id == s.name.id
proc argsFit(c: PContext, candidate: PSym, n: PNode): bool =
case candidate.kind
of skProc, skIterator, skMethod:
var m: TCandidate
initCandidate(m, candidate, nil)
sigmatch.partialMatch(c, n, m)
result = m.state != csNoMatch
of skTemplate, skMacro:
result = true
else:
result = false
proc suggestCall(c: PContext, n: PNode) =
wholeSymTab(filterSym(it) and nameFits(c, it, n) and argsFit(c, it, n),
sectionContext)
proc typeFits(c: PContext, s: PSym, firstArg: PType): bool {.inline.} =
if s.typ != nil and sonsLen(s.typ) > 1 and s.typ.sons[1] != nil:
result = sigmatch.argtypeMatches(c, s.typ.sons[1], firstArg)
proc suggestOperations(c: PContext, n: PNode, typ: PType) =
assert typ != nil
wholeSymTab(filterSym(it) and typeFits(c, it, typ), sectionSuggest)
proc suggestEverything(c: PContext, n: PNode) =
# do not produce too many symbols:
for i in countdown(c.tab.tos-1, 1):
for it in items(c.tab.stack[i]):
if filterSym(it):
OutWriteln(SymToStr(it, isLocal = i > ModuleTablePos, sectionSuggest))
proc suggestFieldAccess(c: PContext, n: PNode) =
# special code that deals with ``myObj.``. `n` is NOT the nkDotExpr-node, but
# ``myObj``.
var typ = n.Typ
if typ == nil:
# a module symbol has no type for example:
if n.kind == nkSym and n.sym.kind == skModule:
if n.sym == c.module:
# all symbols accessible, because we are in the current module:
for it in items(c.tab.stack[ModuleTablePos]):
if filterSym(it):
OutWriteln(SymToStr(it, isLocal=false, sectionSuggest))
else:
for it in items(n.sym.tab):
if filterSym(it):
OutWriteln(SymToStr(it, isLocal=false, sectionSuggest))
else:
# fallback:
suggestEverything(c, n)
elif typ.kind == tyEnum and n.kind == nkSym and n.sym.kind == skType:
# look up if the identifier belongs to the enum:
var t = typ
while t != nil:
suggestSymList(t.n)
t = t.sons[0]
suggestOperations(c, n, typ)
else:
typ = skipTypes(typ, {tyGenericInst, tyVar, tyPtr, tyRef})
if typ.kind == tyObject:
var t = typ
while true:
suggestObject(t.n)
if t.sons[0] == nil: break
t = skipTypes(t.sons[0], {tyGenericInst})
suggestOperations(c, n, typ)
elif typ.kind == tyTuple and typ.n != nil:
suggestSymList(typ.n)
suggestOperations(c, n, typ)
else:
suggestOperations(c, n, typ)
proc findClosestDot(n: PNode): PNode =
if msgs.inCheckpoint(n.info) == cpExact:
result = n
elif n.kind notin {nkNone..nkNilLit}:
for i in 0.. <sonsLen(n):
if n.sons[i].kind == nkDotExpr:
result = findClosestDot(n.sons[i])
if result != nil: return
const
CallNodes = {nkCall, nkInfix, nkPrefix, nkPostfix, nkCommand, nkCallStrLit,
nkMacroStmt}
proc findClosestCall(n: PNode): PNode =
if msgs.inCheckpoint(n.info) == cpExact:
result = n
elif n.kind notin {nkNone..nkNilLit}:
for i in 0.. <sonsLen(n):
if n.sons[i].kind in callNodes:
result = findClosestCall(n.sons[i])
if result != nil: return
proc findClosestSym(n: PNode): PNode =
if n.kind == nkSym and msgs.inCheckpoint(n.info) == cpExact:
result = n
elif n.kind notin {nkNone..nkNilLit}:
for i in 0.. <sonsLen(n):
result = findClosestSym(n.sons[i])
if result != nil: return
var recursiveCheck = 0
proc safeSemExpr(c: PContext, n: PNode): PNode =
try:
result = c.semExpr(c, n)
except ERecoverableError:
result = ast.emptyNode
proc fuzzySemCheck(c: PContext, n: PNode): PNode =
result = safeSemExpr(c, n)
if result == nil or result.kind == nkEmpty:
result = newNodeI(n.kind, n.info)
if n.kind notin {nkNone..nkNilLit}:
for i in 0 .. < sonsLen(n): result.addSon(fuzzySemCheck(c, n.sons[i]))
proc suggestExpr*(c: PContext, node: PNode) =
var cp = msgs.inCheckpoint(node.info)
if cp == cpNone: return
# HACK: This keeps semExpr() from coming here recursively:
if recursiveCheck > 0: return
inc(recursiveCheck)
if optSuggest in gGlobalOptions:
var n = findClosestDot(node)
if n == nil: n = node
else: cp = cpExact
if n.kind == nkDotExpr and cp == cpExact:
var obj = safeSemExpr(c, n.sons[0])
suggestFieldAccess(c, obj)
else:
suggestEverything(c, n)
if optContext in gGlobalOptions:
var n = findClosestCall(node)
if n == nil: n = node
else: cp = cpExact
if n.kind in CallNodes:
var a = copyNode(n)
var x = safeSemExpr(c, n.sons[0])
if x.kind == nkEmpty or x.typ == nil: x = n.sons[0]
addSon(a, x)
for i in 1..sonsLen(n)-1:
# use as many typed arguments as possible:
var x = safeSemExpr(c, n.sons[i])
if x.kind == nkEmpty or x.typ == nil: break
addSon(a, x)
suggestCall(c, a)
if optDef in gGlobalOptions:
var n = findClosestSym(fuzzySemCheck(c, node))
if n != nil: OutWriteln(SymToStr(n.sym, isLocal=false, sectionDef))
quit(0)
proc suggestStmt*(c: PContext, n: PNode) =
suggestExpr(c, n)
|