blob: 57e5c7063f7cea046d2287d6f6f6c4944769ddc1 (
plain)
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
|
//===- MipsGOT.cpp --------------------------------------------------------===//
//
// The MCLinker Project
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
#include <mcld/LD/ResolveInfo.h>
#include <mcld/Support/MemoryRegion.h>
#include <mcld/Support/MsgHandling.h>
#include "MipsGOT.h"
namespace {
const size_t MipsGOTEntrySize = 4;
const size_t MipsGOT0Num = 1;
}
using namespace mcld;
//===----------------------------------------------------------------------===//
// MipsGOT
MipsGOT::MipsGOT(LDSection& pSection, llvm::MCSectionData& pSectionData)
: GOT(pSection, pSectionData, MipsGOTEntrySize),
m_pLocalNum(0)
{
// Create GOT0 entries.
for (size_t i = 0; i < MipsGOT0Num; ++i) {
GOTEntry* entry =
new (std::nothrow) GOTEntry(0, MipsGOTEntrySize, &m_SectionData);
if (NULL == entry)
fatal(diag::fail_allocate_memory) << "GOT0";
m_Section.setSize(m_Section.size() + MipsGOTEntrySize);
}
// Skip GOT0 entries.
iterator it = m_SectionData.begin();
for (size_t i = 1; i < MipsGOT0Num; ++i) {
assert((it != m_SectionData.end()) &&
"Generation of GOT0 entries is incomplete!");
++it;
}
m_LocalGOTIterator = it;
m_GlobalGOTIterator = it;
m_pLocalNum = MipsGOT0Num;
}
MipsGOT::iterator MipsGOT::begin()
{
return m_SectionData.getFragmentList().begin();
}
MipsGOT::iterator MipsGOT::end()
{
return m_SectionData.getFragmentList().end();
}
MipsGOT::const_iterator MipsGOT::begin() const
{
return m_SectionData.getFragmentList().begin();
}
MipsGOT::const_iterator MipsGOT::end() const
{
return m_SectionData.getFragmentList().end();
}
uint64_t MipsGOT::emit(MemoryRegion& pRegion)
{
uint32_t* buffer = reinterpret_cast<uint32_t*>(pRegion.getBuffer());
size_t entry_size = getEntrySize();
uint64_t result = 0;
for (iterator it = begin(), ie = end();
it != ie; ++it, ++buffer) {
GOTEntry* got = &(llvm::cast<GOTEntry>((*it)));
*buffer = static_cast<uint32_t>(got->getContent());
result += entry_size;
}
return result;
}
void MipsGOT::reserveEntry(size_t pNum)
{
for (size_t i = 0; i < pNum; ++i) {
GOTEntry* entry =
new (std::nothrow) GOTEntry(0, MipsGOTEntrySize, &m_SectionData);
if (NULL == entry)
fatal(diag::fail_allocate_memory) << "GOTEntry";
m_Section.setSize(m_Section.size() + MipsGOTEntrySize);
}
}
void MipsGOT::reserveLocalEntry()
{
reserveEntry(1);
++m_pLocalNum;
// Move global entries iterator forward.
// We need to put global GOT entries after all local ones.
++m_GlobalGOTIterator;
}
void MipsGOT::reserveGlobalEntry()
{
reserveEntry(1);
}
GOTEntry* MipsGOT::getEntry(const ResolveInfo& pInfo, bool& pExist)
{
if (isLocal(&pInfo) && pInfo.type() == ResolveInfo::Section) {
pExist = false;
iterator& it = m_LocalGOTIterator;
++it;
assert(it != m_SectionData.getFragmentList().end() &&
"The number of GOT Entries and ResolveInfo doesn't match");
GOTEntry* entry = llvm::cast<GOTEntry>(&(*it));
return entry;
}
GOTEntry*& entry = m_GeneralGOTMap[&pInfo];
pExist = NULL != entry;
if (!pExist) {
iterator& it = isLocal(&pInfo) ? m_LocalGOTIterator : m_GlobalGOTIterator;
++it;
assert(it != m_SectionData.getFragmentList().end() &&
"The number of GOT Entries and ResolveInfo doesn't match");
entry = llvm::cast<GOTEntry>(&(*it));
}
return entry;
}
size_t MipsGOT::getTotalNum() const
{
return m_SectionData.getFragmentList().size();
}
size_t MipsGOT::getLocalNum() const
{
return m_pLocalNum;
}
|
