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
|
/* Machine-dependent ELF dynamic relocation inline functions. Alpha version.
Copyright (C) 1996 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by Richard Henderson <rht@tamu.edu>.
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public License as
published by the Free Software Foundation; either version 2 of the
License, or (at your option) any later version.
The GNU C Library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Library General Public License for more details.
You should have received a copy of the GNU Library General Public
License along with the GNU C Library; see the file COPYING.LIB. If
not, write to the Free Software Foundation, Inc., 675 Mass Ave,
Cambridge, MA 02139, USA. */
/* This was written in the absense of an ABI -- don't expect
it to remain unchanged. */
#define ELF_MACHINE_NAME "alpha"
#include <assert.h>
#include <string.h>
#include <link.h>
/* Return nonzero iff E_MACHINE is compatible with the running host. */
static inline int
elf_machine_matches_host (Elf64_Word e_machine)
{
return e_machine == EM_ALPHA;
}
/* Return the run-time address of the _GLOBAL_OFFSET_TABLE_.
Must be inlined in a function which uses global data. */
static inline Elf64_Addr *
elf_machine_got (void)
{
register Elf64_Addr gp __asm__("$29");
return (Elf64_Addr *)(gp - 0x8000);
}
/* Return the run-time load address of the shared object. */
static inline Elf64_Addr
elf_machine_load_address (void)
{
/* NOTE: While it is generally unfriendly to put data in the text
segment, it is only slightly less so when the "data" is an
instruction. While we don't have to worry about GLD just yet, an
optimizing linker might decide that our "data" is an unreachable
instruction and throw it away -- with the right switches, DEC's
linker will do this. What ought to happen is we should add
something to GAS to allow us access to the new GPREL_HI32/LO32
relocation types stolen from OSF/1 3.0. */
/* This code relies on the fact that BRADDR relocations do not
appear in dynamic relocation tables. Not that that would be very
useful anyway -- br/bsr has a 4MB range and the shared libraries
are usually many many terabytes away. */
Elf64_Addr dot;
long zero_disp;
asm("br %0, 1f\n\t"
".weak __load_address_undefined\n\t"
"br $0, __load_address_undefined\n"
"1:"
: "=r"(dot));
zero_disp = *(int *)dot;
zero_disp = (zero_disp << 43) >> 41;
return dot + 4 + zero_disp;
}
/* Fix up the instructions of a PLT entry to invoke the function
rather than the dynamic linker. */
static inline void
elf_alpha_fix_plt(struct link_map *l,
const Elf64_Rela *reloc,
Elf64_Addr value)
{
const Elf64_Rela *rela_plt;
Elf64_Word *plte;
long disp;
/* Recover the PLT entry address by calculating reloc's index into the
.rela.plt, and finding that entry in the .plt. */
rela_plt = (void *)(l->l_addr + l->l_info[DT_JMPREL]->d_un.d_ptr);
plte = (void *)(l->l_addr + l->l_info[DT_PLTGOT]->d_un.d_ptr);
plte += 2*(reloc - rela_plt) + 8;
/* Find the displacement from the plt entry to the function. */
disp = value - (Elf64_Addr)&plte[2];
/* Change "lda $27, ofs($31)" to "ldq $27, ofs($gp)" */
plte[0] = 0xa77d0000 | (plte[0] & 0xffff);
if (disp >= -0x100000 && disp < 0x100000)
{
/* If we are in range, use br to perfect branch prediction and
elide the dependancy on the address load. This case happens,
e.g., when a shared library call is resolved to the same library. */
/* Change "br $0, plt0" to "br $31,function" */
plte[1] = 0xc3e00000 | (disp & 0x1fffff);
}
else
{
/* Don't bother with the hint since we already know the hint is
wrong. Eliding it prevents the wrong page from getting pulled
into the cache. */
/* Change "br $0, plt0" to "jmp $31,($27)" */
plte[1] = 0x6bfb0000;
}
/* Flush the instruction cache now that we've diddled. Tag it as
modifying memory to checkpoint memory writes during optimization. */
asm volatile("call_pal 0x86" : : : "memory");
}
/* Perform the relocation specified by RELOC and SYM (which is fully resolved).
MAP is the object containing the reloc. */
static inline void
elf_machine_rela (struct link_map *map,
const Elf64_Rela *reloc,
const Elf64_Sym *sym,
Elf64_Addr (*resolve) (const Elf64_Sym **ref,
Elf64_Addr reloc_addr,
int noplt))
{
Elf64_Addr *const reloc_addr = (void *)(map->l_addr + reloc->r_offset);
unsigned long r_info = ELF64_R_TYPE (reloc->r_info);
/* We cannot use a switch here because we cannot locate the switch
jump table until we've self-relocated. */
if (r_info == R_ALPHA_RELATIVE)
{
/* Already done in dynamic linker. */
if (!resolve || map != &_dl_rtld_map)
*reloc_addr += map->l_addr;
}
else if (r_info == R_ALPHA_NONE)
;
else
{
Elf64_Addr loadbase, sym_value;
if (resolve)
{
loadbase = (*resolve)(&sym, (Elf64_Addr)reloc_addr,
r_info == R_ALPHA_JMP_SLOT);
}
else
loadbase = map->l_addr;
sym_value = sym ? loadbase + sym->st_value : 0;
if (r_info == R_ALPHA_GLOB_DAT)
{
*reloc_addr = sym_value;
}
else if (r_info == R_ALPHA_JMP_SLOT)
{
*reloc_addr = sym_value;
elf_alpha_fix_plt(map, reloc, sym_value);
}
else if (r_info == R_ALPHA_REFQUAD)
{
sym_value += *reloc_addr;
if (resolve && map == &_dl_rtld_map)
{
/* Undo the relocation done here during bootstrapping.
Now we will relocate anew, possibly using a binding
found in the user program or a loaded library rather
|