-
-
Notifications
You must be signed in to change notification settings - Fork 409
/
lookup.c
570 lines (476 loc) · 14.6 KB
/
lookup.c
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
#include "lookup.h"
#include "assemble.h"
#include "cap.h"
#include "reify.h"
#include "viewpoint.h"
#include "subtype.h"
#include "../ast/token.h"
#include "../ast/id.h"
#include "../pass/pass.h"
#include "../pass/expr.h"
#include "../expr/literal.h"
#include "ponyassert.h"
#include <string.h>
static deferred_reification_t* lookup_base(pass_opt_t* opt, ast_t* from,
ast_t* orig, ast_t* type, const char* name, bool errors, bool allow_private);
// If a box method is being called with an iso/trn receiver, we mustn't replace
// this-> by iso/trn as this would be unsound, but by ref. See #1887
//
// This method (recursively) replaces occurences of iso and trn in `receiver` by
// ref. If a modification was required then a copy is returned, otherwise the
// original pointer is.
static ast_t* downcast_iso_trn_receiver_to_ref(ast_t* receiver) {
switch (ast_id(receiver))
{
case TK_NOMINAL:
case TK_TYPEPARAMREF:
switch (cap_single(receiver))
{
case TK_TRN:
case TK_ISO:
return set_cap_and_ephemeral(receiver, TK_REF, TK_NONE);
default:
return receiver;
}
case TK_ARROW:
{
AST_GET_CHILDREN(receiver, left, right);
ast_t* downcasted_right = downcast_iso_trn_receiver_to_ref(right);
if(right != downcasted_right)
return viewpoint_type(left, downcasted_right);
else
return receiver;
}
default:
pony_assert(0);
return NULL;
}
}
static deferred_reification_t* lookup_nominal(pass_opt_t* opt, ast_t* from,
ast_t* orig, ast_t* type, const char* name, bool errors, bool allow_private)
{
pony_assert(ast_id(type) == TK_NOMINAL);
typecheck_t* t = &opt->check;
ast_t* def = (ast_t*)ast_data(type);
AST_GET_CHILDREN(def, type_id, typeparams);
const char* type_name = ast_name(type_id);
if(is_name_private(type_name) && (from != NULL) && (opt != NULL)
&& !allow_private)
{
if(ast_nearest(def, TK_PACKAGE) != t->frame->package)
{
if(errors)
{
ast_error(opt->check.errors, from, "can't lookup fields or methods "
"on private types from other packages");
}
return NULL;
}
}
ast_t* find = ast_get(def, name, NULL);
if(find != NULL)
{
switch(ast_id(find))
{
case TK_FVAR:
case TK_FLET:
case TK_EMBED:
break;
case TK_NEW:
case TK_BE:
case TK_FUN:
{
// Typecheck default args immediately.
if(opt != NULL)
{
AST_GET_CHILDREN(find, cap, id, typeparams, params);
ast_t* param = ast_child(params);
while(param != NULL)
{
AST_GET_CHILDREN(param, name, type, def_arg);
if((ast_id(def_arg) != TK_NONE) && (ast_type(def_arg) == NULL))
{
ast_t* child = ast_child(def_arg);
if(ast_id(child) == TK_CALL)
ast_settype(child, ast_from(child, TK_INFERTYPE));
if(ast_visit_scope(¶m, pass_pre_expr, pass_expr, opt,
PASS_EXPR) != AST_OK)
return NULL;
def_arg = ast_childidx(param, 2);
if(!coerce_literals(&def_arg, type, opt))
return NULL;
}
param = ast_sibling(param);
}
}
break;
}
default:
find = NULL;
}
}
if(find == NULL)
{
if(errors)
ast_error(opt->check.errors, from, "couldn't find '%s' in '%s'", name,
type_name);
return NULL;
}
if(is_name_private(name) && (from != NULL) && (opt != NULL) && !allow_private)
{
switch(ast_id(find))
{
case TK_FVAR:
case TK_FLET:
case TK_EMBED:
if(t->frame->type != def)
{
if(errors)
{
ast_error(opt->check.errors, from,
"can't lookup private fields from outside the type");
}
return NULL;
}
break;
case TK_NEW:
case TK_BE:
case TK_FUN:
{
if(ast_nearest(def, TK_PACKAGE) != t->frame->package)
{
if(errors)
{
ast_error(opt->check.errors, from,
"can't lookup private methods from outside the package");
}
return NULL;
}
break;
}
default:
pony_assert(0);
return NULL;
}
if(name == stringtab("_final"))
{
switch(ast_id(find))
{
case TK_NEW:
case TK_BE:
case TK_FUN:
if(errors)
ast_error(opt->check.errors, from,
"can't lookup a _final function");
return NULL;
default: {}
}
} else if((name == stringtab("_init")) && (ast_id(def) == TK_PRIMITIVE)) {
switch(ast_id(find))
{
case TK_NEW:
case TK_BE:
case TK_FUN:
break;
default:
pony_assert(0);
}
if(errors)
ast_error(opt->check.errors, from,
"can't lookup an _init function on a primitive");
return NULL;
}
}
ast_t* typeargs = ast_childidx(type, 2);
ast_t* orig_initial = orig;
if(ast_id(find) == TK_FUN && ast_id(ast_child(find)) == TK_BOX)
orig = downcast_iso_trn_receiver_to_ref(orig);
deferred_reification_t* reified = deferred_reify_new(find, typeparams,
typeargs, orig);
// free if we made a copy of orig
if(orig != orig_initial)
ast_free(orig);
return reified;
}
static deferred_reification_t* lookup_typeparam(pass_opt_t* opt, ast_t* from,
ast_t* orig, ast_t* type, const char* name, bool errors, bool allow_private)
{
ast_t* def = (ast_t*)ast_data(type);
ast_t* constraint = ast_childidx(def, 1);
ast_t* constraint_def = (ast_t*)ast_data(constraint);
if(def == constraint_def)
{
if(errors)
{
ast_t* type_id = ast_child(def);
const char* type_name = ast_name(type_id);
ast_error(opt->check.errors, from, "couldn't find '%s' in '%s'",
name, type_name);
}
return NULL;
}
// Lookup on the constraint instead.
return lookup_base(opt, from, orig, constraint, name, errors, allow_private);
}
static bool param_names_match(ast_t* from, ast_t* prev_fun, ast_t* cur_fun,
const char* name, errorframe_t* pframe, pass_opt_t* opt)
{
ast_t* parent = from != NULL ? ast_parent(from) : NULL;
if(parent != NULL && ast_id(parent) == TK_CALL)
{
AST_GET_CHILDREN(parent, receiver, positional, namedargs);
if(namedargs != NULL && ast_id(namedargs) == TK_NAMEDARGS)
{
AST_GET_CHILDREN(prev_fun, prev_cap, prev_name, prev_tparams,
prev_params);
AST_GET_CHILDREN(cur_fun, cur_cap, cur_name, cur_tparams, cur_params);
ast_t* prev_param = ast_child(prev_params);
ast_t* cur_param = ast_child(cur_params);
while(prev_param != NULL && cur_param != NULL)
{
AST_GET_CHILDREN(prev_param, prev_id);
AST_GET_CHILDREN(cur_param, cur_id);
if(ast_name(prev_id) != ast_name(cur_id))
{
if(pframe != NULL)
{
errorframe_t frame = NULL;
ast_error_frame(&frame, from, "the '%s' methods of this union"
" type have different parameter names; this prevents their"
" use as named arguments", name);
errorframe_append(&frame, pframe);
errorframe_report(&frame, opt->check.errors);
}
return false;
}
prev_param = ast_sibling(prev_param);
cur_param = ast_sibling(cur_param);
}
}
}
return true;
}
static deferred_reification_t* lookup_union(pass_opt_t* opt, ast_t* from,
ast_t* type, const char* name, bool errors, bool allow_private)
{
ast_t* child = ast_child(type);
deferred_reification_t* result = NULL;
ast_t* reified_result = NULL;
bool ok = true;
while(child != NULL)
{
deferred_reification_t* r = lookup_base(opt, from, child, child, name,
errors, allow_private);
if(r == NULL)
{
// All possible types in the union must have this.
if(errors)
{
ast_error(opt->check.errors, from, "couldn't find %s in %s",
name, ast_print_type(child));
}
ok = false;
} else {
switch(ast_id(r->ast))
{
case TK_FVAR:
case TK_FLET:
case TK_EMBED:
if(errors)
{
ast_error(opt->check.errors, from,
"can't lookup field %s in %s in a union type",
name, ast_print_type(child));
}
deferred_reify_free(r);
ok = false;
break;
default:
{
errorframe_t frame = NULL;
errorframe_t* pframe = errors ? &frame : NULL;
if(result == NULL)
{
// If we don't have a result yet, use this one.
result = r;
} else {
if(reified_result == NULL)
reified_result = deferred_reify_method_def(result, result->ast,
opt);
ast_t* reified_r = deferred_reify_method_def(r, r->ast, opt);
if(!is_subtype_fun(reified_r, reified_result, pframe, opt))
{
if(is_subtype_fun(reified_result, reified_r, pframe, opt))
{
// Use the supertype function. Require the most specific
// arguments and return the least specific result.
if(!param_names_match(from, reified_result, reified_r, name,
pframe, opt))
{
ast_free_unattached(reified_r);
deferred_reify_free(r);
ok = false;
} else {
if(errors)
errorframe_discard(pframe);
ast_free_unattached(reified_result);
deferred_reify_free(result);
reified_result = reified_r;
result = r;
}
} else {
if(errors)
{
errorframe_t frame = NULL;
ast_error_frame(&frame, from,
"a member of the union type has an incompatible method "
"signature");
errorframe_append(&frame, pframe);
errorframe_report(&frame, opt->check.errors);
}
ast_free_unattached(reified_r);
deferred_reify_free(r);
ok = false;
}
} else {
if(!param_names_match(from, reified_result, reified_r, name,
pframe, opt))
ok = false;
ast_free_unattached(reified_r);
deferred_reify_free(r);
}
}
break;
}
}
}
child = ast_sibling(child);
}
if(reified_result != NULL)
ast_free_unattached(reified_result);
if(!ok)
{
deferred_reify_free(result);
result = NULL;
}
return result;
}
static deferred_reification_t* lookup_isect(pass_opt_t* opt, ast_t* from,
ast_t* type, const char* name, bool errors, bool allow_private)
{
ast_t* child = ast_child(type);
deferred_reification_t* result = NULL;
ast_t* reified_result = NULL;
bool ok = true;
while(child != NULL)
{
deferred_reification_t* r = lookup_base(opt, from, child, child, name,
false, allow_private);
if(r != NULL)
{
switch(ast_id(r->ast))
{
case TK_FVAR:
case TK_FLET:
case TK_EMBED:
// Ignore fields.
deferred_reify_free(r);
break;
default:
if(result == NULL)
{
// If we don't have a result yet, use this one.
result = r;
} else {
if(reified_result == NULL)
reified_result = deferred_reify_method_def(result, result->ast,
opt);
ast_t* reified_r = deferred_reify_method_def(r, r->ast, opt);
bool changed = false;
if(!is_subtype_fun(reified_result, reified_r, NULL, opt))
{
if(is_subtype_fun(reified_r, reified_result, NULL, opt))
{
// Use the subtype function. Require the least specific
// arguments and return the most specific result.
ast_free_unattached(reified_result);
deferred_reify_free(result);
reified_result = reified_r;
result = r;
changed = true;
}
// TODO: isect the signatures, to handle arg names and
// default arguments. This is done even when the functions have
// no subtype relationship.
}
if(!changed)
{
ast_free_unattached(reified_r);
deferred_reify_free(r);
}
}
break;
}
}
child = ast_sibling(child);
}
if(errors && (result == NULL))
ast_error(opt->check.errors, from, "couldn't find '%s'", name);
if(reified_result != NULL)
ast_free_unattached(reified_result);
if(!ok)
{
deferred_reify_free(result);
result = NULL;
}
return result;
}
static deferred_reification_t* lookup_base(pass_opt_t* opt, ast_t* from,
ast_t* orig, ast_t* type, const char* name, bool errors, bool allow_private)
{
switch(ast_id(type))
{
case TK_UNIONTYPE:
return lookup_union(opt, from, type, name, errors, allow_private);
case TK_ISECTTYPE:
return lookup_isect(opt, from, type, name, errors, allow_private);
case TK_TUPLETYPE:
if(errors)
ast_error(opt->check.errors, from, "can't lookup by name on a tuple");
return NULL;
case TK_DONTCARETYPE:
if(errors)
ast_error(opt->check.errors, from, "can't lookup by name on '_'");
return NULL;
case TK_NOMINAL:
return lookup_nominal(opt, from, orig, type, name, errors, allow_private);
case TK_ARROW:
return lookup_base(opt, from, orig, ast_childidx(type, 1), name, errors,
allow_private);
case TK_TYPEPARAMREF:
return lookup_typeparam(opt, from, orig, type, name, errors,
allow_private);
case TK_FUNTYPE:
if(errors)
ast_error(opt->check.errors, from,
"can't lookup by name on a function type");
return NULL;
case TK_INFERTYPE:
case TK_ERRORTYPE:
// Can only happen due to a local inference fail earlier
return NULL;
default: {}
}
pony_assert(0);
return NULL;
}
deferred_reification_t* lookup(pass_opt_t* opt, ast_t* from, ast_t* type,
const char* name)
{
return lookup_base(opt, from, type, type, name, true, false);
}
deferred_reification_t* lookup_try(pass_opt_t* opt, ast_t* from, ast_t* type,
const char* name, bool allow_private)
{
return lookup_base(opt, from, type, type, name, false, allow_private);
}