Repository navigation
Expand file tree
/
Copy pathMangler.cpp
More file actions
101 lines (89 loc) · 3.57 KB
/
Copy pathMangler.cpp
File metadata and controls
101 lines (89 loc) · 3.57 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
//===-- Mangler.cpp - Self-contained c/asm llvm name mangler --------------===//
//
// The LLVM Compiler Infrastructure
//
// This file was developed by the LLVM research group and is distributed under
// the University of Illinois Open Source License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// Unified name mangler for CWriter and assembly backends.
//
//===----------------------------------------------------------------------===//
#include "llvm/Support/Mangler.h"
#include "llvm/Module.h"
#include "llvm/Type.h"
#include "Support/StringExtras.h"
static char HexDigit(int V) {
return V < 10 ? V+'0' : V+'A'-10;
}
static std::string MangleLetter(unsigned char C) {
return std::string("_")+HexDigit(C >> 4) + HexDigit(C & 15) + "_";
}
/// makeNameProper - We don't want identifier names non-C-identifier characters
/// in them, so mangle them as appropriate.
///
std::string Mangler::makeNameProper(const std::string &X) {
std::string Result;
// Mangle the first letter specially, don't allow numbers...
if ((X[0] < 'a' || X[0] > 'z') && (X[0] < 'A' || X[0] > 'Z') && X[0] != '_')
Result += MangleLetter(X[0]);
else
Result += X[0];
for (std::string::const_iterator I = X.begin()+1, E = X.end(); I != E; ++I)
if ((*I < 'a' || *I > 'z') && (*I < 'A' || *I > 'Z') &&
(*I < '0' || *I > '9') && *I != '_')
Result += MangleLetter(*I);
else
Result += *I;
return Result;
}
std::string Mangler::getValueName(const Value *V) {
// Check to see whether we've already named V.
ValueMap::iterator VI = Memo.find(V);
if (VI != Memo.end()) {
return VI->second; // Return the old name for V.
}
std::string name;
if (V->hasName()) { // Print out the label if it exists...
// Name mangling occurs as follows:
// - If V is not a global, mangling always occurs.
// - Otherwise, mangling occurs when any of the following are true:
// 1) V has internal linkage
// 2) V's name would collide if it is not mangled.
//
const GlobalValue* gv = dyn_cast<GlobalValue>(V);
if (gv && !gv->hasInternalLinkage() && !MangledGlobals.count(gv)) {
name = makeNameProper(gv->getName());
if (AddUnderscorePrefix) name = "_" + name;
} else {
// Non-global, or global with internal linkage / colliding name
// -> mangle.
name = "l" + utostr(V->getType()->getUniqueID()) + "_" +
makeNameProper(V->getName());
}
} else {
name = "ltmp_" + utostr(Count++) + "_"
+ utostr(V->getType()->getUniqueID());
}
Memo[V] = name;
return name;
}
Mangler::Mangler(Module &m, bool addUnderscorePrefix)
: M(m), AddUnderscorePrefix(addUnderscorePrefix) {
// Calculate which global values have names that will collide when we throw
// away type information.
std::set<std::string> FoundNames;
for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
if (I->hasName()) // If the global has a name...
if (FoundNames.count(I->getName())) // And the name is already used
MangledGlobals.insert(I); // Mangle the name
else
FoundNames.insert(I->getName()); // Otherwise, keep track of name
for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I)
if (I->hasName()) // If the global has a name...
if (FoundNames.count(I->getName())) // And the name is already used
MangledGlobals.insert(I); // Mangle the name
else
FoundNames.insert(I->getName()); // Otherwise, keep track of name
}