-
Notifications
You must be signed in to change notification settings - Fork 10.7k
Expand file tree
/
Copy pathDemangler.cpp
More file actions
4683 lines (4271 loc) · 154 KB
/
Demangler.cpp
File metadata and controls
4683 lines (4271 loc) · 154 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
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
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
//===--- Demangler.cpp - String to Node-Tree Demangling -------------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2017 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/LICENSE.txt for license information
// See https://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
//
//===----------------------------------------------------------------------===//
//
// This file implements new Swift de-mangler.
//
//===----------------------------------------------------------------------===//
#include "swift/Demangling/Demangler.h"
#include "DemanglerAssert.h"
#include "swift/Demangling/ManglingMacros.h"
#include "swift/Demangling/ManglingUtils.h"
#include "swift/Demangling/Punycode.h"
#include "swift/Strings.h"
#include <stdio.h>
#include <stdlib.h>
using namespace swift;
using namespace Mangle;
using swift::Demangle::FunctionSigSpecializationParamKind;
//////////////////////////////////
// Private utility functions //
//////////////////////////////////
namespace {
static bool isDeclName(Node::Kind kind) {
switch (kind) {
case Node::Kind::Identifier:
case Node::Kind::LocalDeclName:
case Node::Kind::PrivateDeclName:
case Node::Kind::RelatedEntityDeclName:
case Node::Kind::PrefixOperator:
case Node::Kind::PostfixOperator:
case Node::Kind::InfixOperator:
case Node::Kind::TypeSymbolicReference:
case Node::Kind::ProtocolSymbolicReference:
case Node::Kind::ObjectiveCProtocolSymbolicReference:
return true;
default:
return false;
}
}
static bool isAnyGeneric(Node::Kind kind) {
switch (kind) {
case Node::Kind::Structure:
case Node::Kind::Class:
case Node::Kind::Enum:
case Node::Kind::Protocol:
case Node::Kind::ProtocolSymbolicReference:
case Node::Kind::ObjectiveCProtocolSymbolicReference:
case Node::Kind::OtherNominalType:
case Node::Kind::TypeAlias:
case Node::Kind::TypeSymbolicReference:
case Node::Kind::BuiltinTupleType:
return true;
default:
return false;
}
}
static bool isEntity(Node::Kind kind) {
// Also accepts some kind which are not entities.
if (kind == Node::Kind::Type)
return true;
return isContext(kind);
}
static bool isRequirement(Node::Kind kind) {
switch (kind) {
case Node::Kind::DependentGenericParamPackMarker:
case Node::Kind::DependentGenericParamValueMarker:
case Node::Kind::DependentGenericSameTypeRequirement:
case Node::Kind::DependentGenericSameShapeRequirement:
case Node::Kind::DependentGenericLayoutRequirement:
case Node::Kind::DependentGenericConformanceRequirement:
case Node::Kind::DependentGenericInverseConformanceRequirement:
return true;
default:
return false;
}
}
} // anonymous namespace
//////////////////////////////////
// Public utility functions //
//////////////////////////////////
void swift::Demangle::failAssert(const char *file, unsigned line,
NodePointer node, const char *expr) {
std::string treeStr = getNodeTreeAsString(node);
fatal(0,
"%s:%u: assertion failed for Node %p: %s\n"
"%s:%u: Node %p is:\n%s\n",
file, line, node, expr, file, line, node, treeStr.c_str());
}
bool swift::Demangle::isContext(Node::Kind kind) {
switch (kind) {
#define NODE(ID)
#define CONTEXT_NODE(ID) \
case Node::Kind::ID:
#include "swift/Demangling/DemangleNodes.def"
return true;
case Node::Kind::BuiltinTupleType:
return true;
default:
return false;
}
}
bool swift::Demangle::isFunctionAttr(Node::Kind kind) {
switch (kind) {
case Node::Kind::FunctionSignatureSpecialization:
case Node::Kind::GenericSpecialization:
case Node::Kind::GenericSpecializationPrespecialized:
case Node::Kind::InlinedGenericFunction:
case Node::Kind::GenericSpecializationNotReAbstracted:
case Node::Kind::GenericPartialSpecialization:
case Node::Kind::GenericPartialSpecializationNotReAbstracted:
case Node::Kind::GenericSpecializationInResilienceDomain:
case Node::Kind::ObjCAttribute:
case Node::Kind::NonObjCAttribute:
case Node::Kind::DynamicAttribute:
case Node::Kind::DirectMethodReferenceAttribute:
case Node::Kind::VTableAttribute:
case Node::Kind::PartialApplyForwarder:
case Node::Kind::PartialApplyObjCForwarder:
case Node::Kind::OutlinedVariable:
case Node::Kind::OutlinedReadOnlyObject:
case Node::Kind::OutlinedBridgedMethod:
case Node::Kind::MergedFunction:
case Node::Kind::DistributedThunk:
case Node::Kind::DistributedAccessor:
case Node::Kind::DynamicallyReplaceableFunctionImpl:
case Node::Kind::DynamicallyReplaceableFunctionKey:
case Node::Kind::DynamicallyReplaceableFunctionVar:
case Node::Kind::AsyncFunctionPointer:
case Node::Kind::AsyncAwaitResumePartialFunction:
case Node::Kind::AsyncSuspendResumePartialFunction:
case Node::Kind::AccessibleFunctionRecord:
case Node::Kind::BackDeploymentThunk:
case Node::Kind::BackDeploymentFallback:
case Node::Kind::HasSymbolQuery:
case Node::Kind::CoroFunctionPointer:
case Node::Kind::DefaultOverride:
return true;
default:
return false;
}
}
llvm::StringRef
swift::Demangle::makeSymbolicMangledNameStringRef(const char *base) {
if (!base)
return {};
auto end = base;
while (*end != '\0') {
// Skip over symbolic references.
if (*end >= '\x01' && *end <= '\x17')
end += sizeof(uint32_t);
else if (*end >= '\x18' && *end <= '\x1F')
end += sizeof(void*);
++end;
}
return StringRef(base, end - base);
}
int swift::Demangle::getManglingPrefixLength(llvm::StringRef mangledName) {
if (mangledName.empty()) return 0;
llvm::StringRef prefixes[] = {
/*Swift 4*/ "_T0",
/*Swift 4.x*/ "$S", "_$S",
/*Swift 5+*/ "$s", "_$s",
/*Swift 5+ Embedded Swift*/ "$e", "_$e",
/*Swift 5+ for filenames*/ "@__swiftmacro_",
};
// Look for any of the known prefixes
for (auto prefix : prefixes) {
if (mangledName.starts_with(prefix))
return prefix.size();
}
return 0;
}
bool swift::Demangle::isSwiftSymbol(llvm::StringRef mangledName) {
if (isOldFunctionTypeMangling(mangledName))
return true;
return getManglingPrefixLength(mangledName) != 0;
}
bool swift::Demangle::isSwiftSymbol(const char *mangledName) {
StringRef mangledNameRef(mangledName);
return isSwiftSymbol(mangledNameRef);
}
bool swift::Demangle::isObjCSymbol(llvm::StringRef mangledName) {
StringRef nameWithoutPrefix = dropSwiftManglingPrefix(mangledName);
return nameWithoutPrefix.starts_with("So") ||
nameWithoutPrefix.starts_with("SC");
}
bool swift::Demangle::isOldFunctionTypeMangling(llvm::StringRef mangledName) {
return mangledName.starts_with("_T");
}
llvm::StringRef swift::Demangle::dropSwiftManglingPrefix(StringRef mangledName){
return mangledName.drop_front(getManglingPrefixLength(mangledName));
}
static bool isAliasNode(Demangle::NodePointer Node) {
if (!Node)
return false;
switch (Node->getKind()) {
case Demangle::Node::Kind::Type:
return isAliasNode(Node->getChild(0));
case Demangle::Node::Kind::TypeAlias:
return true;
default:
return false;
}
assert(0 && "unknown node kind");
}
bool swift::Demangle::isAlias(llvm::StringRef mangledName) {
Demangle::Demangler Dem;
return isAliasNode(Dem.demangleType(mangledName));
}
static bool isClassNode(Demangle::NodePointer Node) {
if (!Node)
return false;
switch (Node->getKind()) {
case Demangle::Node::Kind::Type:
return isClassNode(Node->getChild(0));
case Demangle::Node::Kind::Class:
case Demangle::Node::Kind::BoundGenericClass:
return true;
default:
return false;
}
assert(0 && "unknown node kind");
}
bool swift::Demangle::isClass(llvm::StringRef mangledName) {
Demangle::Demangler Dem;
return isClassNode(Dem.demangleType(mangledName));
}
static bool isEnumNode(Demangle::NodePointer Node) {
if (!Node)
return false;
switch (Node->getKind()) {
case Demangle::Node::Kind::Type:
return isEnumNode(Node->getChild(0));
case Demangle::Node::Kind::Enum:
case Demangle::Node::Kind::BoundGenericEnum:
return true;
default:
return false;
}
assert(0 && "unknown node kind");
}
bool swift::Demangle::isEnum(llvm::StringRef mangledName) {
Demangle::Demangler Dem;
return isEnumNode(Dem.demangleType(mangledName));
}
static bool isProtocolNode(Demangle::NodePointer Node) {
if (!Node)
return false;
switch (Node->getKind()) {
case Demangle::Node::Kind::Type:
return isProtocolNode(Node->getChild(0));
case Demangle::Node::Kind::Protocol:
case Demangle::Node::Kind::ProtocolSymbolicReference:
case Demangle::Node::Kind::ObjectiveCProtocolSymbolicReference:
return true;
default:
return false;
}
assert(0 && "unknown node kind");
}
static bool isGenericParamType(Demangle::NodePointer Node) {
if (!Node)
return false;
switch (Node->getKind()) {
case Demangle::Node::Kind::Type:
return isGenericParamType(Node->getChild(0));
case Demangle::Node::Kind::DependentGenericParamType:
return true;
default:
return false;
}
assert(0 && "unknown node kind");
}
bool swift::Demangle::isProtocol(llvm::StringRef mangledName) {
Demangle::Demangler Dem;
return isProtocolNode(Dem.demangleType(dropSwiftManglingPrefix(mangledName)));
}
static bool isStructNode(Demangle::NodePointer Node) {
if (!Node)
return false;
switch (Node->getKind()) {
case Demangle::Node::Kind::Type:
return isStructNode(Node->getChild(0));
case Demangle::Node::Kind::Structure:
case Demangle::Node::Kind::BoundGenericStructure:
return true;
default:
return false;
}
assert(0 && "unknown node kind");
}
bool swift::Demangle::isStruct(llvm::StringRef mangledName) {
Demangle::Demangler Dem;
return isStructNode(Dem.demangleType(mangledName));
}
std::string swift::Demangle::mangledNameForTypeMetadataAccessor(
StringRef moduleName, StringRef typeName, Node::Kind typeKind,
Mangle::ManglingFlavor Flavor) {
using namespace Demangle;
// kind=Global
// kind=NominalTypeDescriptor
// kind=Type
// kind=Structure|Enum|Class
// kind=Module, text=moduleName
// kind=Identifier, text=typeName
Demangle::Demangler D;
auto *global = D.createNode(Node::Kind::Global);
{
auto *nominalDescriptor =
D.createNode(Node::Kind::TypeMetadataAccessFunction);
{
auto *type = D.createNode(Node::Kind::Type);
{
auto *module = D.createNode(Node::Kind::Module, moduleName);
auto *identifier = D.createNode(Node::Kind::Identifier, typeName);
auto *structNode = D.createNode(typeKind);
structNode->addChild(module, D);
structNode->addChild(identifier, D);
type->addChild(structNode, D);
}
nominalDescriptor->addChild(type, D);
}
global->addChild(nominalDescriptor, D);
}
auto mangleResult = mangleNode(global, Flavor);
assert(mangleResult.isSuccess());
return mangleResult.result();
}
using namespace swift;
using namespace Demangle;
//////////////////////////////////
// Node member functions //
//////////////////////////////////
void Node::addChild(NodePointer Child, NodeFactory &Factory) {
DEMANGLER_ALWAYS_ASSERT(Child, this);
switch (NodePayloadKind) {
case PayloadKind::None:
InlineChildren[0] = Child;
InlineChildren[1] = nullptr;
NodePayloadKind = PayloadKind::OneChild;
break;
case PayloadKind::OneChild:
assert(!InlineChildren[1]);
InlineChildren[1] = Child;
NodePayloadKind = PayloadKind::TwoChildren;
break;
case PayloadKind::TwoChildren: {
NodePointer Child0 = InlineChildren[0];
NodePointer Child1 = InlineChildren[1];
Children.Nodes = nullptr;
Children.Number = 0;
Children.Capacity = 0;
Factory.Reallocate(Children.Nodes, Children.Capacity, 3);
assert(Children.Capacity >= 3);
Children.Nodes[0] = Child0;
Children.Nodes[1] = Child1;
Children.Nodes[2] = Child;
Children.Number = 3;
NodePayloadKind = PayloadKind::ManyChildren;
break;
}
case PayloadKind::ManyChildren:
if (Children.Number >= Children.Capacity) {
Factory.Reallocate(Children.Nodes, Children.Capacity, 1);
}
assert(Children.Number < Children.Capacity);
Children.Nodes[Children.Number++] = Child;
break;
default:
assert(false && "cannot add child");
}
}
void Node::removeChildAt(unsigned Pos) {
switch (NodePayloadKind) {
case PayloadKind::OneChild:
assert(Pos == 0);
NodePayloadKind = PayloadKind::None;
break;
case PayloadKind::TwoChildren: {
assert(Pos < 2);
if (Pos == 0)
InlineChildren[0] = InlineChildren[1];
NodePayloadKind = PayloadKind::OneChild;
break;
}
case PayloadKind::ManyChildren:
for (unsigned i = Pos, n = Children.Number - 1; i != n; ++i) {
Children.Nodes[i] = Children.Nodes[i + 1];
}
--Children.Number;
break;
default:
assert(false && "cannot remove child");
}
}
void Node::replaceChild(unsigned Pos, NodePointer Child) {
switch (NodePayloadKind) {
case PayloadKind::OneChild:
assert(Pos == 0);
InlineChildren[0] = Child;
break;
case PayloadKind::TwoChildren:
assert(Pos < 2);
InlineChildren[Pos] = Child;
break;
case PayloadKind::ManyChildren:
Children.Nodes[Pos] = Child;
break;
default:
assert(false && "cannot remove child");
}
}
void Node::reverseChildren(size_t StartingAt) {
assert(StartingAt <= getNumChildren());
switch (NodePayloadKind) {
case PayloadKind::TwoChildren:
if (StartingAt == 0)
std::swap(InlineChildren[0], InlineChildren[1]);
break;
case PayloadKind::ManyChildren:
std::reverse(Children.Nodes + StartingAt,
Children.Nodes + Children.Number);
break;
default:
break;
}
}
Node* Node::findByKind(Node::Kind kind, int maxDepth) {
if (getKind() == kind)
return this;
if (maxDepth <= 0)
return nullptr;
for (auto node : *this)
if (auto matchingChild = node->findByKind(kind, maxDepth - 1))
return matchingChild;
return nullptr;
}
//////////////////////////////////
// NodeFactory member functions //
//////////////////////////////////
void NodeFactory::freeSlabs(AllocatedSlab *slab) {
while (slab) {
AllocatedSlab *prev = slab->Previous;
free(slab);
slab = prev;
}
}
void NodeFactory::clear() {
assert(!isBorrowed);
if (CurrentSlab) {
#ifdef NODE_FACTORY_DEBUGGING
fprintf(stderr, "%s## clear: allocated memory = %zu\n", indent().c_str(), allocatedMemory);
#endif
freeSlabs(CurrentSlab->Previous);
// Recycle the last allocated slab.
// Note that the size of the last slab is at least as big as all previous
// slabs combined. Therefore it's not worth the effort of reusing all slabs.
// The slab size also stays the same. So at some point the demangling
// process converges to a single large slab across repeated demangle-clear
// cycles.
CurrentSlab->Previous = nullptr;
CurPtr = (char *)(CurrentSlab + 1);
#ifdef NODE_FACTORY_DEBUGGING
allocatedMemory = 0;
#endif
}
}
NodeFactory::Checkpoint NodeFactory::pushCheckpoint() const {
return {CurrentSlab, CurPtr, End};
}
void NodeFactory::popCheckpoint(NodeFactory::Checkpoint checkpoint) {
if (checkpoint.Slab == CurrentSlab) {
if (checkpoint.CurPtr > CurPtr) {
fatal(0,
"Popping checkpoint {%p, %p, %p} that is after the current "
"pointer.\n",
checkpoint.Slab, checkpoint.CurPtr, checkpoint.End);
}
if (checkpoint.End != End) {
fatal(0,
"Popping checkpoint {%p, %p, %p} with End that does not match "
"current End %p.\n",
checkpoint.Slab, checkpoint.CurPtr, checkpoint.End, End);
}
#ifndef NDEBUG
// Scribble the newly freed area.
memset(checkpoint.CurPtr, 0xaa, CurPtr - checkpoint.CurPtr);
#endif
CurPtr = checkpoint.CurPtr;
} else {
// We may want to keep using the current slab rather than destroying
// it, since over time this allows us to converge on a steady state
// with no allocation activity (see the comment above in
// NodeFactory::clear). Keep using the current slab if the free space in the
// checkpoint's slab is less than 1/16th of the current slab's space. We
// won't repeatedly allocate and deallocate the current slab. The size
// doubles each time so we'll quickly pass the threshold.
AllocatedSlab *savedSlab = nullptr;
if (CurrentSlab) {
size_t checkpointSlabFreeSpace = checkpoint.End - checkpoint.CurPtr;
size_t currentSlabSize = End - (char *)(CurrentSlab + 1);
if (currentSlabSize / 16 > checkpointSlabFreeSpace) {
savedSlab = CurrentSlab;
CurrentSlab = CurrentSlab->Previous;
// No need to save End, as it will still be in place later.
}
}
// Free all slabs (possibly except the one we saved) until we find the end
// or we find the checkpoint.
while (CurrentSlab && checkpoint.Slab != CurrentSlab) {
auto Slab = CurrentSlab;
CurrentSlab = CurrentSlab->Previous;
free(Slab);
}
// If we ran to the end and the checkpoint actually has a slab pointer, then
// the checkpoint is invalid.
if (!CurrentSlab && checkpoint.Slab) {
fatal(0,
"Popping checkpoint {%p, %p, %p} with slab that is not within "
"the allocator's slab chain.\n",
checkpoint.Slab, checkpoint.CurPtr, checkpoint.End);
}
if (savedSlab) {
// Reinstall the saved slab.
savedSlab->Previous = CurrentSlab;
CurrentSlab = savedSlab;
CurPtr = (char *)(CurrentSlab + 1);
// End is still valid from before.
} else {
// Set CurPtr and End to match the checkpoint's position.
CurPtr = checkpoint.CurPtr;
End = checkpoint.End;
}
#ifndef NDEBUG
// Scribble the now freed end of the slab.
if (CurPtr)
memset(CurPtr, 0xaa, End - CurPtr);
#endif
}
}
NodePointer NodeFactory::createNode(Node::Kind K) {
return new (Allocate<Node>()) Node(K);
}
NodePointer NodeFactory::createNode(Node::Kind K, Node::IndexType Index) {
return new (Allocate<Node>()) Node(K, Index);
}
NodePointer NodeFactory::createNode(Node::Kind K, uint64_t RemoteAddress,
uint8_t AddressSpace) {
return new (Allocate<Node>()) Node(K, RemoteAddress, AddressSpace);
}
NodePointer NodeFactory::createNodeWithAllocatedText(Node::Kind K,
llvm::StringRef Text) {
return new (Allocate<Node>()) Node(K, Text);
}
NodePointer NodeFactory::createNode(Node::Kind K, const CharVector &Text) {
return createNodeWithAllocatedText(K, Text.str());
}
NodePointer NodeFactory::createNode(Node::Kind K, const char *Text) {
return new (Allocate<Node>()) Node(K, llvm::StringRef(Text));
}
#ifdef NODE_FACTORY_DEBUGGING
int NodeFactory::nestingLevel = 0;
#endif
// Fast integer formatting
namespace {
// Format an unsigned integer into a buffer
template <typename U,
typename std::enable_if<std::is_unsigned<U>::value, bool>::type = true>
size_t int2str(U n, char *buf) {
// The easy case is zero
if (n == 0) {
*buf++ = '0';
*buf++ = '\0';
return 1;
}
// Do the digits one a time (for really high speed we could do these in
// chunks, but that's probably not necessary here.)
char *ptr = buf;
while (n) {
char digit = '0' + (n % 10);
n /= 10;
*ptr++ = digit;
}
size_t len = ptr - buf;
// Terminate the string
*ptr = '\0';
// Now reverse the digits
while (buf < ptr) {
char tmp = *--ptr;
*ptr = *buf;
*buf++ = tmp;
}
return len;
}
// Deal with negative numbers
template <typename S,
typename std::enable_if<std::is_signed<S>::value, bool>::type = true>
size_t int2str(S n, char *buf) {
using U = typename std::make_unsigned<S>::type;
if (n < 0) {
*buf++ = '-';
return int2str(static_cast<U>(-n), buf);
}
return int2str(static_cast<U>(n), buf);
}
} // namespace
//////////////////////////////////
// CharVector member functions //
//////////////////////////////////
void CharVector::append(StringRef Rhs, NodeFactory &Factory) {
if (NumElems + Rhs.size() > Capacity)
Factory.Reallocate(Elems, Capacity, /*Growth*/ Rhs.size());
memcpy(Elems + NumElems, Rhs.data(), Rhs.size());
NumElems += Rhs.size();
assert(NumElems <= Capacity);
}
void CharVector::append(int Number, NodeFactory &Factory) {
const int MaxIntPrintSize = 11;
if (NumElems + MaxIntPrintSize > Capacity)
Factory.Reallocate(Elems, Capacity, /*Growth*/ MaxIntPrintSize);
int Length = int2str(Number, Elems + NumElems);
assert(Length > 0 && Length < MaxIntPrintSize);
NumElems += Length;
}
void CharVector::append(unsigned long long Number, NodeFactory &Factory) {
const int MaxPrintSize = 21;
if (NumElems + MaxPrintSize > Capacity)
Factory.Reallocate(Elems, Capacity, /*Growth*/ MaxPrintSize);
int Length = int2str(Number, Elems + NumElems);
assert(Length > 0 && Length < MaxPrintSize);
NumElems += Length;
}
//////////////////////////////////
// Demangler member functions //
//////////////////////////////////
void Demangler::clear() {
NodeStack.free();
Substitutions.free();
NodeFactory::clear();
}
Demangler::DemangleInitRAII::DemangleInitRAII(Demangler &Dem,
StringRef MangledName,
std::function<SymbolicReferenceResolver_t> TheSymbolicReferenceResolver)
// Save the current demangler state so we can restore it.
: Dem(Dem),
NodeStack(Dem.NodeStack), Substitutions(Dem.Substitutions),
NumWords(Dem.NumWords), Text(Dem.Text), Pos(Dem.Pos),
SymbolicReferenceResolver(std::move(Dem.SymbolicReferenceResolver))
{
std::copy(Dem.Words, Dem.Words + MaxNumWords, Words);
// Reset the demangler state for a nested job.
Dem.NodeStack.init(Dem, 16);
Dem.Substitutions.init(Dem, 16);
Dem.NumWords = 0;
Dem.Text = MangledName;
Dem.Pos = 0;
Dem.SymbolicReferenceResolver = std::move(TheSymbolicReferenceResolver);
}
Demangler::DemangleInitRAII::~DemangleInitRAII() {
// Restore the saved state.
Dem.NodeStack = NodeStack;
Dem.Substitutions = Substitutions;
Dem.NumWords = NumWords;
std::copy(Words, Words + MaxNumWords, Dem.Words);
Dem.Text = Text;
Dem.Pos = Pos;
Dem.SymbolicReferenceResolver = std::move(SymbolicReferenceResolver);
}
NodePointer Demangler::demangleSymbol(StringRef MangledName,
std::function<SymbolicReferenceResolver_t> Resolver) {
DemangleInitRAII state(*this, MangledName, std::move(Resolver));
#if SWIFT_SUPPORT_OLD_MANGLING
// Demangle old-style class and protocol names, which are still used in the
// ObjC metadata.
if (nextIf("_Tt"))
return demangleOldSymbolAsNode(Text, *this);
#endif
unsigned PrefixLength = getManglingPrefixLength(MangledName);
if (PrefixLength == 0)
return nullptr;
if (MangledName.starts_with(MANGLING_PREFIX_EMBEDDED_STR))
Flavor = ManglingFlavor::Embedded;
IsOldFunctionTypeMangling = isOldFunctionTypeMangling(MangledName);
Pos += PrefixLength;
// If any other prefixes are accepted, please update Mangler::verify.
if (!parseAndPushNodes())
return nullptr;
NodePointer topLevel = createNode(Node::Kind::Global);
NodePointer suffix = popNode(Node::Kind::Suffix);
NodePointer Parent = topLevel;
while (NodePointer FuncAttr = popNode(isFunctionAttr)) {
Parent->addChild(FuncAttr, *this);
if (FuncAttr->getKind() == Node::Kind::PartialApplyForwarder ||
FuncAttr->getKind() == Node::Kind::PartialApplyObjCForwarder)
Parent = FuncAttr;
}
for (Node *Nd : NodeStack) {
switch (Nd->getKind()) {
case Node::Kind::Type:
Parent->addChild(Nd->getFirstChild(), *this);
break;
default:
Parent->addChild(Nd, *this);
break;
}
}
if (suffix)
topLevel->addChild(suffix, *this);
if (topLevel->getNumChildren() == 0)
return nullptr;
return topLevel;
}
NodePointer Demangler::demangleType(StringRef MangledName,
std::function<SymbolicReferenceResolver_t> Resolver) {
DemangleInitRAII state(*this, MangledName, std::move(Resolver));
if (!parseAndPushNodes())
return nullptr;
NodePointer Result = popNode();
// The result is only valid if it was the only node on the stack.
if (popNode())
return nullptr;
return Result;
}
bool Demangler::parseAndPushNodes() {
const auto textSize = Text.size();
while (Pos < textSize) {
// Programs may look up a type by NUL-terminated name with an excessive
// length. Keep them working by returning success if we encounter a NUL in
// the middle of the string where an operator is expected.
if (peekChar() == '\0')
return true;
NodePointer Node = demangleOperator();
if (!Node)
return false;
pushNode(Node);
}
return true;
}
NodePointer Demangler::addChild(NodePointer Parent, NodePointer Child) {
if (!Parent || !Child)
return nullptr;
Parent->addChild(Child, *this);
return Parent;
}
NodePointer Demangler::createWithChild(Node::Kind kind,
NodePointer Child) {
if (!Child)
return nullptr;
NodePointer Nd = createNode(kind);
Nd->addChild(Child, *this);
return Nd;
}
NodePointer Demangler::createType(NodePointer Child) {
return createWithChild(Node::Kind::Type, Child);
}
NodePointer Demangler::Demangler::createWithChildren(Node::Kind kind,
NodePointer Child1, NodePointer Child2) {
if (!Child1 || !Child2)
return nullptr;
NodePointer Nd = createNode(kind);
Nd->addChild(Child1, *this);
Nd->addChild(Child2, *this);
return Nd;
}
NodePointer Demangler::createWithChildren(Node::Kind kind,
NodePointer Child1,
NodePointer Child2,
NodePointer Child3) {
if (!Child1 || !Child2 || !Child3)
return nullptr;
NodePointer Nd = createNode(kind);
Nd->addChild(Child1, *this);
Nd->addChild(Child2, *this);
Nd->addChild(Child3, *this);
return Nd;
}
NodePointer Demangler::createWithChildren(Node::Kind kind, NodePointer Child1,
NodePointer Child2,
NodePointer Child3,
NodePointer Child4) {
if (!Child1 || !Child2 || !Child3 || !Child4)
return nullptr;
NodePointer Nd = createNode(kind);
Nd->addChild(Child1, *this);
Nd->addChild(Child2, *this);
Nd->addChild(Child3, *this);
Nd->addChild(Child4, *this);
return Nd;
}
NodePointer Demangler::changeKind(NodePointer Node, Node::Kind NewKind) {
if (!Node)
return nullptr;
NodePointer NewNode = nullptr;
if (Node->hasText()) {
NewNode = createNodeWithAllocatedText(NewKind, Node->getText());
} else if (Node->hasIndex()) {
NewNode = createNode(NewKind, Node->getIndex());
} else {
NewNode = createNode(NewKind);
}
for (NodePointer Child : *Node) {
NewNode->addChild(Child, *this);
}
return NewNode;
}
NodePointer Demangler::demangleTypeMangling() {
auto Type = popNode(Node::Kind::Type);
auto LabelList = popFunctionParamLabels(Type);
auto TypeMangling = createNode(Node::Kind::TypeMangling);
addChild(TypeMangling, LabelList);
TypeMangling = addChild(TypeMangling, Type);
return TypeMangling;
}
NodePointer Demangler::demangleSymbolicReference(unsigned char rawKind) {
// The symbolic reference is a 4-byte machine integer encoded in the following
// four bytes.
if (Pos + 4 > Text.size())
return nullptr;
const void *at = Text.data() + Pos;
int32_t value;
memcpy(&value, at, 4);
Pos += 4;
// Map the encoded kind to a specific kind and directness.
SymbolicReferenceKind kind;
Directness direct;
switch (rawKind) {
case 0x01:
kind = SymbolicReferenceKind::Context;
direct = Directness::Direct;
break;
case 0x02:
kind = SymbolicReferenceKind::Context;
direct = Directness::Indirect;
break;
case 0x09:
kind = SymbolicReferenceKind::AccessorFunctionReference;
direct = Directness::Direct;
break;
case 0x0a:
kind = SymbolicReferenceKind::UniqueExtendedExistentialTypeShape;
direct = Directness::Direct;
break;
case 0x0b:
kind = SymbolicReferenceKind::NonUniqueExtendedExistentialTypeShape;
direct = Directness::Direct;
break;
case 0x0c:
kind = SymbolicReferenceKind::ObjectiveCProtocol;
direct = Directness::Direct;
break;
// These are all currently reserved but unused.
case 0x03: // direct to protocol conformance descriptor
case 0x04: // indirect to protocol conformance descriptor
case 0x05: // direct to associated conformance descriptor
case 0x06: // indirect to associated conformance descriptor
case 0x07: // direct to associated conformance access function
case 0x08: // indirect to associated conformance access function
default:
return nullptr;
}
// Use the resolver, if any, to produce the demangling tree the symbolic
// reference represents.
NodePointer resolved = nullptr;
if (SymbolicReferenceResolver)
resolved = SymbolicReferenceResolver(kind, direct, value, at);
// With no resolver, or a resolver that failed, refuse to demangle further.
if (!resolved)
return nullptr;
// Types register as substitutions even when symbolically referenced.
// OOPS: Except for opaque type references!
if ((kind == SymbolicReferenceKind::Context ||
kind == SymbolicReferenceKind::ObjectiveCProtocol) &&
resolved->getKind() !=
Node::Kind::OpaqueTypeDescriptorSymbolicReference &&
resolved->getKind() != Node::Kind::OpaqueReturnTypeOf)
addSubstitution(resolved);
return resolved;
}