-
Notifications
You must be signed in to change notification settings - Fork 3k
/
type-structure.cpp
874 lines (792 loc) · 27.9 KB
/
type-structure.cpp
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
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
/*
+----------------------------------------------------------------------+
| HipHop for PHP |
+----------------------------------------------------------------------+
| Copyright (c) 2010-present Facebook, Inc. (http://www.facebook.com) |
+----------------------------------------------------------------------+
| This source file is subject to version 3.01 of the PHP license, |
| that is bundled with this package in the file LICENSE, and is |
| available through the world-wide-web at the following url: |
| http://www.php.net/license/3_01.txt |
| If you did not receive a copy of the PHP license and are unable to |
| obtain it through the world-wide-web, please send a note to |
| license@php.net so we can mail you a copy immediately. |
+----------------------------------------------------------------------+
*/
#include "hphp/runtime/base/type-structure.h"
#include "hphp/runtime/base/array-data.h"
#include "hphp/runtime/base/array-data-defs.h"
#include "hphp/runtime/base/array-init.h"
#include "hphp/runtime/base/exceptions.h"
#include "hphp/runtime/base/string-data.h"
#include "hphp/runtime/base/typed-value.h"
#include "hphp/runtime/base/type-array.h"
#include "hphp/runtime/base/type-variant.h"
#include "hphp/runtime/vm/named-entity.h"
#include "hphp/runtime/vm/unit.h"
#include "hphp/util/text-util.h"
namespace HPHP {
struct String;
struct StaticString;
namespace {
struct TSEnv {
bool allow_partial{};
// Passed in by ref variables from the caller
// Initial value true since something can only lose persistence
bool persistent{true};
// Initial value false since unless we have to resort to partial
// evaluation, nothing is partial
bool partial{};
// Initial value false since unless proven there are no invalid types
bool invalidType{};
};
/*
* These static strings are the same as the ones in
* hphp/compiler/type_annotation.cpp, where the typeAnnotArrays are
* originally generated. See TypeAnnotation::getScalarArrayRep().
*/
const StaticString
s_nullable("nullable"),
s_name("name"),
s_classname("classname"),
s_kind("kind"),
s_elem_types("elem_types"),
s_return_type("return_type"),
s_param_types("param_types"),
s_generic_types("generic_types"),
s_root_name("root_name"),
s_access_list("access_list"),
s_fields("fields"),
s_allows_unknown_fields("allows_unknown_fields"),
s_is_cls_cns("is_cls_cns"),
s_optional_shape_field("optional_shape_field"),
s_value("value"),
s_this("HH\\this"),
s_self("self"),
s_parent("parent"),
s_callable("callable"),
s_alias("alias"),
s_typevars("typevars"),
s_typevar_types("typevar_types")
;
const std::string
s_void("void"),
s_int("int"),
s_bool("bool"),
s_float("float"),
s_string("string"),
s_resource("resource"),
s_num("num"),
s_arraykey("arraykey"),
s_noreturn("noreturn"),
s_mixed("mixed"),
s_nonnull("nonnull"),
s_array("array"),
s_darray("HH\\darray"),
s_varray("HH\\varray"),
s_varray_or_darray("HH\\varray_or_darray"),
s_shape("shape"),
s_hh_vec("HH\\vec"),
s_hh_dict("HH\\dict"),
s_hh_keyset("HH\\keyset"),
s_hh_vec_or_dict("HH\\vec_or_dict"),
s_hh_arraylike("HH\\arraylike"),
s_hh("HH\\")
;
std::string fullName(const Array& arr, bool forDisplay);
void functionTypeName(const Array& arr, std::string& name, bool forDisplay) {
name += "(function (";
assertx(arr.exists(s_return_type));
auto const retType = arr[s_return_type].toCArrRef();
assertx(arr.exists(s_param_types));
auto const params = arr[s_param_types].toCArrRef();
auto sep = "";
auto const sz = params.size();
for (auto i = 0; i < sz; i++) {
auto const param = params[i].toCArrRef();
folly::toAppend(sep, fullName(param, forDisplay), &name);
sep = ", ";
}
// add funciton return type
folly::toAppend("): ", fullName(retType, forDisplay), ")", &name);
}
void accessTypeName(const Array& arr, std::string& name) {
assertx(arr.exists(s_root_name));
auto const rootName = arr[s_root_name].toCStrRef();
name += rootName.toCppString();
assertx(arr.exists(s_access_list));
auto const accessList = arr[s_access_list].toCArrRef();
auto const sz = accessList.size();
for (auto i = 0; i < sz; i++) {
folly::toAppend("::",
accessList[i].toCStrRef().toCppString(),
&name);
}
}
// xhp names are mangled so we get them back to their original definition
// see the mangling in ScannerToken::xhpLabel
void xhpTypeName(const Array& arr, std::string& name) {
assertx(arr.exists(s_classname));
std::string clsName = arr[s_classname].toCStrRef().toCppString();
// remove prefix if any
if (clsName.compare(0, sizeof("xhp_") - 1, "xhp_") == 0) {
name += clsName.replace(0, sizeof("xhp_") - 1, ":");
} else {
name += clsName;
}
// un-mangle back
replaceAll(name, "__", ":");
replaceAll(name, "_", "-");
}
void tupleTypeName(const Array& arr, std::string& name, bool forDisplay) {
name += "(";
assertx(arr.exists(s_elem_types));
auto const elems = arr[s_elem_types].toCArrRef();
auto const sz = elems.size();
auto sep = "";
for (auto i = 0; i < sz; i++) {
auto const elem = elems[i].toCArrRef();
folly::toAppend(sep, fullName(elem, forDisplay), &name);
sep = ", ";
}
name += ")";
}
void genericTypeName(const Array& arr, std::string& name, bool forDisplay) {
name += "<";
assertx(arr.exists(s_generic_types));
auto const args = arr[s_generic_types].toCArrRef();
auto const sz = args.size();
auto sep = "";
for (auto i = 0; i < sz; i++) {
auto const arg = args[i].toCArrRef();
folly::toAppend(sep, fullName(arg, forDisplay), &name);
sep = ", ";
}
name += ">";
}
void shapeTypeName(const Array& arr, std::string& name, bool forDisplay) {
// works for both resolved and unresolved TypeStructures
name += "(";
assertx(arr.exists(s_fields));
auto const fields = arr[s_fields].toCArrRef();
auto const sz = fields.size();
auto sep = "";
for (auto i = 0; i < sz; i++) {
name += sep;
auto const field = fields->getKey(i);
auto value = fields->getValue(i).toCArrRef();
auto quote = "'";
if (value.exists(s_optional_shape_field)) {
name += "?";
}
if (value.exists(s_value)) {
// if unresolved, ignore wrapper
if (value.exists(s_is_cls_cns)) quote = "";
value = value[s_value].toCArrRef();
}
auto const fieldType = field.getType();
if (isStringType(fieldType)) {
folly::toAppend(quote, field.toCStrRef().data(), quote, &name);
} else if (isIntType(fieldType)) {
folly::toAppend(field.toInt64Val(), &name);
}
folly::toAppend(
forDisplay ? " => " : "=>",
fullName(value, forDisplay),
&name
);
sep = ", ";
}
if (arr.exists(s_allows_unknown_fields)) {
folly::toAppend(sep, "...", &name);
}
name += ")";
}
std::string fullName(const Array& arr, bool forDisplay) {
std::string name;
if (arr.exists(s_nullable)) {
assertx(arr[s_nullable].toBoolean());
name += '?';
}
assertx(arr.exists(s_kind));
TypeStructure::Kind kind =
TypeStructure::Kind(arr[s_kind].toInt64Val());
switch (kind) {
case TypeStructure::Kind::T_void:
name += forDisplay ? s_void : s_hh + s_void;
break;
case TypeStructure::Kind::T_int:
name += forDisplay ? s_int : s_hh + s_int;
break;
case TypeStructure::Kind::T_bool:
name += forDisplay ? s_bool : s_hh + s_bool;
break;
case TypeStructure::Kind::T_float:
name += forDisplay ? s_float : s_hh + s_float;
break;
case TypeStructure::Kind::T_string:
name += forDisplay ? s_string : s_hh + s_string;
break;
case TypeStructure::Kind::T_resource:
name += forDisplay ? s_resource : s_hh + s_resource;
break;
case TypeStructure::Kind::T_num:
name += forDisplay ? s_num : s_hh + s_num;
break;
case TypeStructure::Kind::T_arraykey:
name += forDisplay ? s_arraykey : s_hh + s_arraykey;
break;
case TypeStructure::Kind::T_noreturn:
name += forDisplay ? s_noreturn : s_hh + s_noreturn;
break;
case TypeStructure::Kind::T_mixed:
name += forDisplay ? s_mixed : s_hh + s_mixed;
break;
case TypeStructure::Kind::T_nonnull:
name += forDisplay ? s_nonnull : s_hh + s_nonnull;
break;
case TypeStructure::Kind::T_tuple:
tupleTypeName(arr, name, forDisplay);
break;
case TypeStructure::Kind::T_fun:
functionTypeName(arr, name, forDisplay);
break;
case TypeStructure::Kind::T_array:
name += s_array;
if (arr.exists(s_generic_types)) {
genericTypeName(arr, name, forDisplay);
}
break;
case TypeStructure::Kind::T_darray:
name += s_darray;
if (arr.exists(s_generic_types)) {
genericTypeName(arr, name, forDisplay);
}
break;
case TypeStructure::Kind::T_varray:
name += s_varray;
if (arr.exists(s_generic_types)) {
genericTypeName(arr, name, forDisplay);
}
break;
case TypeStructure::Kind::T_varray_or_darray:
name += s_varray_or_darray;
if (arr.exists(s_generic_types)) {
genericTypeName(arr, name, forDisplay);
}
break;
case TypeStructure::Kind::T_shape:
name += forDisplay ? s_shape : s_hh + s_shape;
shapeTypeName(arr, name, forDisplay);
break;
case TypeStructure::Kind::T_dict:
name += s_hh_dict;
if (arr.exists(s_generic_types)) {
genericTypeName(arr, name, forDisplay);
}
break;
case TypeStructure::Kind::T_vec:
name += s_hh_vec;
if (arr.exists(s_generic_types)) {
genericTypeName(arr, name, forDisplay);
}
break;
case TypeStructure::Kind::T_keyset:
name += s_hh_keyset;
if (arr.exists(s_generic_types)) {
genericTypeName(arr, name, forDisplay);
}
break;
case TypeStructure::Kind::T_vec_or_dict:
name += s_hh_vec_or_dict;
if (arr.exists(s_generic_types)) {
genericTypeName(arr, name, forDisplay);
}
break;
case TypeStructure::Kind::T_arraylike:
name += s_hh_arraylike;
if (arr.exists(s_generic_types)) {
genericTypeName(arr, name, forDisplay);
}
break;
case TypeStructure::Kind::T_typevar:
assertx(arr.exists(s_name));
name += arr[s_name].toCStrRef().toCppString();
break;
case TypeStructure::Kind::T_typeaccess:
accessTypeName(arr, name);
break;
case TypeStructure::Kind::T_xhp:
xhpTypeName(arr, name);
break;
case TypeStructure::Kind::T_class:
case TypeStructure::Kind::T_interface:
case TypeStructure::Kind::T_trait:
case TypeStructure::Kind::T_enum:
case TypeStructure::Kind::T_unresolved:
assertx(arr.exists(s_classname));
name += arr[s_classname].toCStrRef().toCppString();
if (arr.exists(s_generic_types)) genericTypeName(arr, name, forDisplay);
break;
}
return name;
}
Array resolveTS(TSEnv& env,
const Array& arr,
const Class::Const& typeCns,
const Class* typeCnsCls,
const Array& generics);
Array resolveList(TSEnv& env,
const Array& arr,
const Class::Const& typeCns,
const Class* typeCnsCls,
const Array& generics) {
auto const sz = arr.size();
VArrayInit newarr(sz);
for (auto i = 0; i < sz; i++) {
auto elemArr = arr[i].toArray();
auto elem = resolveTS(env, elemArr, typeCns, typeCnsCls, generics);
newarr.append(Variant(elem));
}
return newarr.toArray();
}
std::string resolveContextMsg(const Class::Const& typeCns,
const Class* typeCnsCls) {
std::string msg("when resolving ");
if (!typeCns.name) {
folly::toAppend("anonymous type structure", &msg);
} else if (typeCnsCls) {
folly::toAppend("type constant ", typeCnsCls->name()->data(),
"::", typeCns.name->data(),
&msg);
} else {
folly::toAppend("type alias ", typeCns.name->data(), &msg);
}
return msg;
}
/* returns the unresolved TypeStructure; if aliasName is not an alias,
* return an empty Array. */
Array getAlias(TSEnv& env, const String& aliasName) {
if (aliasName.same(s_this) || Unit::lookupClass(aliasName.get())) {
return Array::CreateDArray();
}
auto persistentTA = true;
auto typeAliasReq = env.allow_partial
? Unit::lookupTypeAlias(aliasName.get(), &persistentTA)
: Unit::loadTypeAlias(aliasName.get(), &persistentTA);
if (!typeAliasReq) {
env.partial = true;
return Array::CreateDArray();
}
// this returned type structure is unresolved.
assertx(typeAliasReq->typeStructure.isDictOrDArray());
env.persistent &= persistentTA;
return typeAliasReq->typeStructure;
}
const Class* getClass(TSEnv& env,
const String& clsName,
const Class::Const& typeCns,
const Class* typeCnsCls) {
auto checkPersistent = [&](const Class* cls) {
env.persistent &= classHasPersistentRDS(cls);
return cls;
};
// the original unresolved type structure came from a type constant
// (instead of a type alias), and may have this/self/parent.
if (typeCnsCls) {
// HH\this: late static binding
if (clsName.same(s_this)) {
return checkPersistent(typeCnsCls);
}
auto declCls = typeCns.cls;
// self
if (clsName.same(s_self)) {
return checkPersistent(declCls);
}
// parent
if (clsName.same(s_parent)) {
auto parent = declCls->parent();
if (!parent) {
throw Exception(
"%s, class %s does not have a parent",
resolveContextMsg(typeCns, typeCnsCls).c_str(),
declCls->name()->data());
}
return checkPersistent(parent);
}
}
auto name = clsName;
auto ts = getAlias(env, name);
while (!ts.empty()) {
assertx(ts.exists(s_kind));
if (!ts.exists(s_classname)) {
// not a class, interface, trait, enum, or alias
throw Exception(
"%s, alias %s does not resolve to a class",
resolveContextMsg(typeCns, typeCnsCls).c_str(),
name.data());
}
name = ts[s_classname].toCStrRef();
ts = getAlias(env, name);
}
auto const cls = env.allow_partial ? Unit::lookupClass(name.get())
: Unit::loadClass(name.get());
if (!cls) {
env.partial = true;
if (env.allow_partial) return nullptr;
throw Exception(
"%s, class %s not found",
resolveContextMsg(typeCns, typeCnsCls).c_str(),
name.data());
}
return checkPersistent(cls);
}
/* Given an unresolved T_shape TypeStructure, returns the __fields__
* portion of the array with all the field names resolved to string
* literals. */
Array resolveShape(TSEnv& env,
const Array& arr,
const Class::Const& typeCns,
const Class* typeCnsCls,
const Array& generics) {
assertx(arr.exists(s_kind));
assertx(static_cast<TypeStructure::Kind>(arr[s_kind].toInt64Val())
== TypeStructure::Kind::T_shape);
assertx(arr.exists(s_fields));
auto newfields = Array::CreateDArray();
auto const fields = arr[s_fields].toCArrRef();
auto const sz = fields.size();
for (auto i = 0; i < sz; i++) {
Variant key = fields->getKey(i);
auto const wrapper = fields->getValue(i).toCArrRef();
if (wrapper.exists(s_is_cls_cns)) {
// if the shape field name is a class constant, its name is
// double colon delimited clsName::cnsName
auto const clsCns = key.toCStrRef().toCppString();
std::string clsName, cnsName;
folly::split("::", clsCns, clsName, cnsName);
// look up clsName::cnsName
auto cls = getClass(env, String(clsName), typeCns, typeCnsCls);
if (!cls) throw Exception("failed to resolve shape classname");
auto cnsValue = cls->clsCnsGet(String(cnsName).get());
if (isStringType(cnsValue.m_type) || isIntType(cnsValue.m_type)) {
key = tvAsVariant(&cnsValue);
} else {
throw Exception(
"class constant %s::%s is not a string or an int "
"and cannot be used as shape field names",
clsName.c_str(), cnsName.c_str());
}
}
assertx(wrapper.exists(s_value));
auto valueArr = wrapper[s_value].toArray();
auto value = resolveTS(env, valueArr, typeCns, typeCnsCls, generics);
if (wrapper.exists(s_optional_shape_field)) {
value.add(s_optional_shape_field, true_varNR.tv());
}
newfields.add(key, Variant(value));
}
return newfields;
}
bool resolveClass(TSEnv& env,
Array& ret,
const String& clsName,
const Class::Const& typeCns,
const Class* typeCnsCls) {
auto const cls = getClass(env, clsName, typeCns, typeCnsCls);
if (!cls) return false;
TypeStructure::Kind resolvedKind;
if (isNormalClass(cls)) {
resolvedKind = TypeStructure::Kind::T_class;
} else if (isInterface(cls)) {
resolvedKind = TypeStructure::Kind::T_interface;
} else if (isTrait(cls)) {
resolvedKind = TypeStructure::Kind::T_trait;
env.invalidType = true;
} else if (isEnum(cls)) {
resolvedKind = TypeStructure::Kind::T_enum;
} else {
not_reached();
}
ret.set(s_kind, Variant(static_cast<uint8_t>(resolvedKind)));
ret.add(s_classname, Variant(makeStaticString(cls->name())));
return true;
}
Array resolveGenerics(TSEnv& env,
const Array& arr,
const Class::Const& typeCns,
const Class* typeCnsCls,
const Array& generics) {
auto genericsArr = arr[s_generic_types].toArray();
return resolveList(env, genericsArr, typeCns, typeCnsCls, generics);
}
Array resolveTS(TSEnv& env,
const Array& arr,
const Class::Const& typeCns,
const Class* typeCnsCls,
const Array& generics) {
assertx(arr.exists(s_kind));
auto const kind = static_cast<TypeStructure::Kind>(
arr[s_kind].toInt64Val());
auto newarr = Array::CreateDArray();
if (arr.exists(s_nullable)) newarr.add(s_nullable, true_varNR.tv());
newarr.add(s_kind, Variant(static_cast<uint8_t>(kind)));
if (arr.exists(s_allows_unknown_fields)) {
newarr.add(s_allows_unknown_fields, true_varNR.tv());
}
switch (kind) {
case TypeStructure::Kind::T_tuple: {
assertx(arr.exists(s_elem_types));
auto const elemsArr = arr[s_elem_types].toCArrRef();
auto const elemTypes =
resolveList(env, elemsArr, typeCns, typeCnsCls, generics);
newarr.add(s_elem_types, Variant(elemTypes));
break;
}
case TypeStructure::Kind::T_fun: {
env.invalidType = true;
assertx(arr.exists(s_return_type));
auto const returnArr = arr[s_return_type].toCArrRef();
auto const returnType =
resolveTS(env, returnArr, typeCns, typeCnsCls, generics);
newarr.add(s_return_type, Variant(returnType));
assertx(arr.exists(s_param_types));
auto const paramsArr = arr[s_param_types].toCArrRef();
auto const paramTypes =
resolveList(env, paramsArr, typeCns, typeCnsCls, generics);
newarr.add(s_param_types, Variant(paramTypes));
break;
}
case TypeStructure::Kind::T_array:
case TypeStructure::Kind::T_darray:
case TypeStructure::Kind::T_varray:
case TypeStructure::Kind::T_varray_or_darray:
case TypeStructure::Kind::T_dict:
case TypeStructure::Kind::T_vec:
case TypeStructure::Kind::T_keyset:
case TypeStructure::Kind::T_vec_or_dict:
case TypeStructure::Kind::T_arraylike: {
if (kind == TypeStructure::Kind::T_array ||
kind == TypeStructure::Kind::T_darray ||
kind == TypeStructure::Kind::T_varray ||
kind == TypeStructure::Kind::T_varray_or_darray
) {
env.invalidType = true;
}
if (arr.exists(s_generic_types)) {
newarr.add(s_generic_types,
Variant(resolveGenerics(env, arr, typeCns, typeCnsCls,
generics)));
}
break;
}
case TypeStructure::Kind::T_shape: {
auto const fields = resolveShape(env, arr, typeCns, typeCnsCls, generics);
newarr.add(s_fields, Variant(fields));
break;
}
case TypeStructure::Kind::T_unresolved: {
assertx(arr.exists(s_classname));
auto const clsName = arr[s_classname].toCStrRef();
auto ts = getAlias(env, clsName);
auto resolve = [&] (const Array& generics = Array()) {
Class::Const typeCns;
typeCns.name = clsName.get();
auto resolved = resolveTS(env, ts, typeCns, nullptr, generics);
resolved.add(s_alias, Variant(clsName));
return resolved;
};
if (!ts.empty()) {
if (ts.exists(s_typevars) && arr.exists(s_generic_types)) {
std::vector<std::string> typevars;
folly::split(",", ts[s_typevars].toCStrRef().data(), typevars);
ts.remove(s_typevars);
auto generic_types =
resolveGenerics(env, arr, typeCns, typeCnsCls, generics);
auto const sz = std::min(static_cast<ssize_t>(typevars.size()),
generic_types.size());
DArrayInit newarr(sz);
for (auto i = 0; i < sz; i++) {
newarr.add(String(typevars[i]), generic_types[i]);
}
auto generics = newarr.toArray();
ts = resolve(generics);
ts.add(s_typevar_types, Variant(generics));
} else {
ts = resolve();
}
if (arr.exists(s_nullable)) {
ts.add(s_nullable, true_varNR.tv());
}
return ts;
}
/* Special cases for 'callable': Hack typechecker throws a naming error
* (unbound name), however, hhvm still supports this type hint to be
* compatible with php. We simply return as a OF_CLASS with class name
* set to 'callable'. */
if (clsName.same(s_callable)) {
newarr.add(s_kind,
Variant(static_cast<uint8_t>(TypeStructure::Kind::T_class)));
newarr.add(s_classname, Variant(clsName));
break;
}
if (!resolveClass(env, newarr, clsName, typeCns, typeCnsCls) &&
env.allow_partial) {
env.partial = true;
newarr.add(s_kind,
Variant(static_cast<uint8_t>(
TypeStructure::Kind::T_unresolved)));
newarr.add(s_classname, Variant(clsName));
break;
}
if (arr.exists(s_generic_types)) {
newarr.add(s_generic_types,
Variant(resolveGenerics(env, arr, typeCns, typeCnsCls,
generics)));
}
break;
}
case TypeStructure::Kind::T_typeaccess: {
/* type access is a root class (may be HH\this) followed by a series of
* type constants, i.e., cls::TC1::TC2::TC3. Each type constant other
* than the last one in the chain must refer to a class or an
* interface. */
assertx(arr.exists(s_root_name));
auto clsName = arr[s_root_name].toCStrRef();
assertx(arr.exists(s_access_list));
auto const accList = arr[s_access_list].toCArrRef();
auto const sz = accList.size();
Array typeCnsVal;
for (auto i = 0; i < sz; i++) {
auto const cls = getClass(env, clsName, typeCns, typeCnsCls);
if (!cls) throw Exception("failed to resolve type access");
auto const cnsName = accList[i].toCStrRef();
if (!cls->hasTypeConstant(cnsName.get())) {
throw Exception(
"%s, class %s does not have non-abstract "
"type constant %s",
resolveContextMsg(typeCns, typeCnsCls).c_str(),
clsName.data(),
cnsName.data());
}
auto tv = cls->clsCnsGet(cnsName.get(), /* includeTypeCns = */ true);
assertx(isArrayLikeType(tv.m_type));
typeCnsVal = Array(tv.m_data.parr);
assertx(typeCnsVal.isDictOrDArray());
if (i == sz - 1) break;
// if there are more accesses, keep resolving
assertx(typeCnsVal.exists(s_kind));
auto kind = static_cast<TypeStructure::Kind>
(typeCnsVal[s_kind].toInt64Val());
if (kind != TypeStructure::Kind::T_class
&& kind != TypeStructure::Kind::T_interface) {
throw Exception(
"%s, %s::%s does not resolve to a class or "
"an interface and cannot contain type constant %s",
resolveContextMsg(typeCns, typeCnsCls).c_str(),
clsName.data(),
cnsName.data(),
accList[i+1].toCStrRef().data());
}
assertx(typeCnsVal.exists(s_classname));
clsName = typeCnsVal[s_classname].toCStrRef();
}
if (arr.exists(s_nullable)) {
typeCnsVal.add(s_nullable, true_varNR.tv());
}
return typeCnsVal;
}
case TypeStructure::Kind::T_typevar: {
env.invalidType = true;
assertx(arr.exists(s_name));
auto const name = arr[s_name].toCStrRef();
return generics.exists(name) ? generics[name].toDArray() : arr.toDArray();
}
case TypeStructure::Kind::T_xhp:
default:
return arr.toDArray();
}
if(arr.exists(s_typevars)) newarr.add(s_typevars, arr[s_typevars]);
return newarr;
}
} // anonymous namespace
String TypeStructure::toString(const Array& arr) {
if (arr.empty()) return String();
return String(fullName(arr, false));
}
String TypeStructure::toStringForDisplay(const Array& arr) {
if (arr.empty()) return String();
return String(fullName(arr, true));
}
/*
* Constructs a scalar array with all the shape field names, this/self/parent,
* classes, type accesses, and type aliases resolved.
*/
Array TypeStructure::resolve(const Class::Const& typeCns,
const Class* typeCnsCls,
bool& persistent) {
assertx(typeCns.isType());
assertx(isArrayLikeType(typeCns.val.m_type));
assertx(typeCns.name);
assertx(typeCnsCls);
TSEnv env;
Array arr(typeCns.val.m_data.parr);
auto resolved = resolveTS(env, arr, typeCns, typeCnsCls, Array());
persistent = env.persistent;
return resolved;
}
/*
* Called by TypeAliasReq to get resolved TypeStructure for type aliases.
*/
Array TypeStructure::resolve(const String& aliasName,
const Array& arr,
bool& persistent,
const Array& generics) {
// use a bogus constant to store the name
Class::Const typeCns;
typeCns.name = aliasName.get();
TSEnv env;
auto resolved = resolveTS(env, arr, typeCns, nullptr, generics);
resolved.add(s_alias, Variant(aliasName));
persistent = env.persistent;
return resolved;
}
/*
* Called when resolving anonymous type structures, e.g. from `is` expressions.
*/
Array TypeStructure::resolve(const Array& ts,
const Class* typeCnsCls,
const Class* declCls,
bool& persistent) {
// Use a bogus constant, because the type structure is anonymous.
Class::Const typeCns;
typeCns.name = nullptr;
typeCns.cls = declCls;
TSEnv env;
auto resolved = resolveTS(env, ts, typeCns, typeCnsCls, Array());
persistent = env.persistent;
return resolved;
}
/*
* Called when resolving anonymous type structures, e.g. from `is` expressions
* while allowing partial resolution.
*/
Array TypeStructure::resolvePartial(const Array& ts,
const Class* typeCnsCls,
const Class* declCls,
bool& persistent,
bool& partial,
bool& invalidType) {
// Use a bogus constant, because the type structure is anonymous.
Class::Const typeCns;
typeCns.name = nullptr;
typeCns.cls = declCls;
TSEnv env;
env.allow_partial = true;
auto resolved = resolveTS(env, ts, typeCns, typeCnsCls, Array());
persistent = env.persistent;
partial = env.partial;
invalidType = env.invalidType;
return resolved;
}
} // namespace HPHP