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
|
// Copyright (c) 2008, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
// ---
// Author: Paul Pluzhnikov
//
// Allow dynamic symbol lookup in the kernel VDSO page.
//
// VDSOSupport -- a class representing kernel VDSO (if present).
//
#include "base/vdso_support.h"
#ifdef HAVE_VDSO_SUPPORT // defined in vdso_support.h
#include <fcntl.h>
#include "base/atomicops.h" // for MemoryBarrier
#include "base/logging.h"
#include "base/linux_syscall_support.h"
#include "base/dynamic_annotations.h"
#include "base/basictypes.h" // for COMPILE_ASSERT
using base::subtle::MemoryBarrier;
#ifndef AT_SYSINFO_EHDR
#define AT_SYSINFO_EHDR 33
#endif
namespace base {
namespace {
template <int N> class ElfClass {
public:
static const int kElfClass = -1;
static int ElfBind(const ElfW(Sym) *) {
CHECK(false); // << "Unexpected word size";
return 0;
}
static int ElfType(const ElfW(Sym) *) {
CHECK(false); // << "Unexpected word size";
return 0;
}
};
template <> class ElfClass<32> {
public:
static const int kElfClass = ELFCLASS32;
static int ElfBind(const ElfW(Sym) *symbol) {
return ELF32_ST_BIND(symbol->st_info);
}
static int ElfType(const ElfW(Sym) *symbol) {
return ELF32_ST_TYPE(symbol->st_info);
}
};
template <> class ElfClass<64> {
public:
static const int kElfClass = ELFCLASS64;
static int ElfBind(const ElfW(Sym) *symbol) {
return ELF64_ST_BIND(symbol->st_info);
}
static int ElfType(const ElfW(Sym) *symbol) {
return ELF64_ST_TYPE(symbol->st_info);
}
};
typedef ElfClass<__WORDSIZE> CurrentElfClass;
// Extract an element from one of the ELF tables, cast it to desired type.
// This is just a simple arithmetic and a glorified cast.
// Callers are responsible for bounds checking.
template <class T>
const T* GetTableElement(const ElfW(Ehdr) *ehdr,
ElfW(Off) table_offset,
ElfW(Word) element_size,
size_t index) {
return reinterpret_cast<const T*>(reinterpret_cast<const char *>(ehdr)
+ table_offset
+ index * element_size);
}
} // namespace
const void *const VDSOSupport::kInvalidBase =
reinterpret_cast<const void *>(~0L);
const void *VDSOSupport::vdso_base_ = kInvalidBase;
VDSOSupport::GetCpuFn VDSOSupport::getcpu_fn_ = &InitAndGetCPU;
VDSOSupport::ElfMemImage::ElfMemImage(const void *base) {
Init(base);
}
int VDSOSupport::ElfMemImage::GetNumSymbols() const {
if (!dynsym_) {
return 0;
}
return dynsym_->sh_size / dynsym_->sh_entsize;
}
const ElfW(Sym) *VDSOSupport::ElfMemImage::GetDynsym(int index) const {
CHECK_LT(index, GetNumSymbols());
return GetTableElement<ElfW(Sym)>(ehdr_,
dynsym_->sh_offset,
dynsym_->sh_entsize,
index);
}
const ElfW(Versym) *VDSOSupport::ElfMemImage::GetVersym(int index) const {
CHECK_LT(index, GetNumSymbols());
return GetTableElement<ElfW(Versym)>(ehdr_,
versym_->sh_offset,
versym_->sh_entsize,
index);
}
const ElfW(Phdr) *VDSOSupport::ElfMemImage::GetPhdr(int index) const {
CHECK_LT(index, ehdr_->e_phnum);
return GetTableElement<ElfW(Phdr)>(ehdr_,
ehdr_->e_phoff,
ehdr_->e_phentsize,
index);
}
const ElfW(Shdr) *VDSOSupport::ElfMemImage::GetSection(int index) const {
CHECK_LT(index, ehdr_->e_shnum);
return GetTableElement<ElfW(Shdr)>(ehdr_,
ehdr_->e_shoff,
ehdr_->e_shentsize,
index);
}
const char *VDSOSupport::ElfMemImage::GetSectionData(
const ElfW(Shdr) *section,
ElfW(Word) offset) const {
CHECK_LT(offset, section->sh_size);
return GetTableElement<char>(ehdr_, section->sh_offset, 1, offset);
}
const char *VDSOSupport::ElfMemImage::GetDynstr(ElfW(Word) offset) const {
CHECK_LT(offset, dynstr_->sh_size);
return GetTableElement<char>(ehdr_, dynstr_->sh_offset, 1, offset);
}
const void *VDSOSupport::ElfMemImage::GetSymAddr(const ElfW(Sym) *sym) const {
if (sym->st_shndx == SHN_UNDEF || sym->st_shndx >= SHN_LORESERVE) {
// Symbol corresponds to "special" (e.g. SHN_ABS) section.
return reinterpret_cast<const void *>(sym->st_value);
}
CHECK_LT(link_base_, sym->st_value);
return GetTableElement<char>(ehdr_, 0, 1, sym->st_value) - link_base_;
}
const ElfW(Verdef) *VDSOSupport::ElfMemImage::GetVerdef(int index) const {
size_t offset = 0;
const ElfW(Verdef) *version_definition =
GetTableElement<ElfW(Verdef)>(ehdr_, verdef_->sh_offset, 1, offset);
while (version_definition->vd_ndx < index && version_definition->vd_next) {
offset += version_definition->vd_next;
CHECK_LT(offset, verdef_->sh_size);
version_definition =
GetTableElement<ElfW(Verdef)>(ehdr_, verdef_->sh_offset, 1, offset);
}
return version_definition->vd_ndx == index ? version_definition : NULL;
}
const ElfW(Verdaux) *VDSOSupport::ElfMemImage::GetVerdefAux(
const ElfW(Verdef) *verdef) const {
return reinterpret_cast<const ElfW(Verdaux) *>(verdef+1);
}
const char *VDSOSupport::ElfMemImage::GetVerstr(ElfW(Word) offset) const {
return GetSectionData(GetSection(verdef_->sh_link), offset);
}
void VDSOSupport::ElfMemImage::Init(const void *base) {
ehdr_ = NULL;
dynsym_ = NULL;
dynstr_ = NULL;
versym_ = NULL;
verdef_ = NULL;
link_base_ = ~0L; // Sentinel: PT_LOAD .p_vaddr can't possibly be this.
if (!base) {
return;
}
if (memcmp(base, ELFMAG, SELFMAG)) {
RAW_DCHECK(false, "no ELF magic"); // at %p", base);
return;
}
const char *const base_as_char = reinterpret_cast<const char *>(base);
int elf_class = base_as_char[EI_CLASS];
if (elf_class != CurrentElfClass::kElfClass) {
DCHECK_EQ(elf_class, CurrentElfClass::kElfClass);
return;
}
switch (base_as_char[EI_DATA]) {
case ELFDATA2LSB: {
if (__LITTLE_ENDIAN != __BYTE_ORDER) {
DCHECK_EQ(__LITTLE_ENDIAN, __BYTE_ORDER); // << ": wrong byte order";
return;
}
break;
}
case ELFDATA2MSB: {
if (__BIG_ENDIAN != __BYTE_ORDER) {
DCHECK_EQ(__BIG_ENDIAN, __BYTE_ORDER); // << ": wrong byte order";
return;
}
break;
}
default: {
RAW_DCHECK(false, "unexpected data encoding"); // << base_as_char[EI_DATA];
return;
}
}
ehdr_ = reinterpret_cast<const ElfW(Ehdr) *>(base);
for (int i = 0; i < ehdr_->e_phnum; ++i) {
const ElfW(Phdr) *const program_header = GetPhdr(i);
if (program_header->p_type == PT_LOAD) {
link_base_ = program_header->p_vaddr;
break;
}
}
if (link_base_ == ~0L) {
// Didn't find a PT_LOAD.
RAW_DCHECK(false, "no PT_LOADs in VDSO");
// Mark this image as not present. Can not recur infinitely.
Init(0);
return;
}
for (int i = 0; i < ehdr_->e_shnum; ++i) {
const ElfW(Shdr) *section = GetSection(i);
switch (section->sh_type) {
case SHT_DYNSYM: {
dynsym_ = section;
break;
}
case SHT_STRTAB: {
const char *const section_name =
GetSectionData(GetSection(ehdr_->e_shstrndx), section->sh_name);
if (strcmp(".dynstr", section_name) == 0) {
dynstr_ = section;
break;
}
break;
}
case SHT_GNU_versym: {
versym_ = section;
break;
}
case SHT_GNU_verdef: {
verdef_ = section;
break;
}
default: {
// Unrecognized sections explicitly ignored.
break;
}
}
}
if (!dynsym_ || !dynstr_ || !versym_ || !verdef_ ||
((dynsym_->sh_size / dynsym_->sh_entsize) !=
(versym_->sh_size / versym_->sh_entsize))) {
RAW_DCHECK(dynsym_, "invalid VDSO (no dynsym)");
RAW_DCHECK(dynstr_, "invalid VDSO (no dynstr)");
RAW_DCHECK(versym_, "invalid VDSO (no versym)");
RAW_DCHECK(verdef_, "invalid VDSO (no verdef)");
DCHECK_EQ(dynsym_->sh_size / dynsym_->sh_entsize,
versym_->sh_size / versym_->sh_entsize);
// Mark this image as not present. Can not recur infinitely.
Init(0);
return;
}
}
VDSOSupport::VDSOSupport() : image_(vdso_base_) {
}
// NOTE: we can't use GoogleOnceInit() below, because we can be
// called by tcmalloc, and none of the *once* stuff may be functional yet.
//
// In addition, we hope that attribute constructor (which this function has)
// causes this code to run before there are any threads.
//
// Finally, even if there is a race here, it is harmless, because
// the operation should be idempotent.
void VDSOSupport::Init() {
if (vdso_base_ == kInvalidBase) {
// Valgrind zaps AT_SYSINFO_EHDR and friends from the auxv[]
// on stack, and so glibc works as if VDSO was not present.
// But going directly to kernel via /proc/self/auxv below bypasses
// Valgrind zapping. So we check for Valgrind separately.
if (RunningOnValgrind()) {
vdso_base_ = NULL;
getcpu_fn_ = &GetCPUViaSyscall;
return;
}
int fd = open("/proc/self/auxv", O_RDONLY);
if (fd == -1) {
// Kernel too old to have a VDSO.
vdso_base_ = NULL;
getcpu_fn_ = &GetCPUViaSyscall;
return;
}
ElfW(auxv_t) aux;
while (read(fd, &aux, sizeof(aux)) == sizeof(aux)) {
if (aux.a_type == AT_SYSINFO_EHDR) {
COMPILE_ASSERT(sizeof(vdso_base_) == sizeof(aux.a_un.a_val),
unexpected_sizeof_pointer_NE_sizeof_a_val);
vdso_base_ = reinterpret_cast<void *>(aux.a_un.a_val);
break;
}
}
close(fd);
if (vdso_base_ == kInvalidBase) {
// Didn't find AT_SYSINFO_EHDR in auxv[].
vdso_base_ = NULL;
}
}
GetCpuFn fn = &GetCPUViaSyscall; // default if VDSO not present.
if (vdso_base_) {
VDSOSupport vdso;
SymbolInfo info;
if (vdso.LookupSymbol("__vdso_getcpu", "LINUX_2.6", STT_FUNC, &info)) {
// Casting from an int to a pointer is not legal C++. To emphasize
// this, we use a C-style cast rather than a C++-style cast.
fn = (GetCpuFn)(info.address);
}
}
// Subtle: this code runs outside of any locks; prevent compiler
// from assigning to getcpu_fn_ more than once.
MemoryBarrier();
getcpu_fn_ = fn;
}
const void *VDSOSupport::SetBase(const void *base) {
const void *old_base = vdso_base_;
vdso_base_ = base;
image_.Init(base);
// Also reset getcpu_fn_, so GetCPU could be tested with simulated VDSO.
getcpu_fn_ = &InitAndGetCPU;
return old_base;
}
bool VDSOSupport::LookupSymbol(const char *name,
const char *version,
int type,
SymbolInfo *info) const {
for (SymbolIterator it = begin(); it != end(); ++it) {
if (strcmp(it->name, name) == 0 && strcmp(it->version, version) == 0 &&
CurrentElfClass::ElfType(it->symbol) == type) {
if (info) {
*info = *it;
}
return true;
}
}
return false;
}
bool VDSOSupport::LookupSymbolByAddress(const void *address,
SymbolInfo *info_out) const {
for (SymbolIterator it = begin(); it != end(); ++it) {
const char *const symbol_start =
reinterpret_cast<const char *>(it->address);
const char *const symbol_end = symbol_start + it->symbol->st_size;
if (symbol_start <= address && address < symbol_end) {
if (info_out) {
// Client wants to know details for that symbol (the usual case).
if (CurrentElfClass::ElfBind(it->symbol) == STB_GLOBAL) {
// Strong symbol; just return it.
*info_out = *it;
return true;
} else {
// Weak or local. Record it, but keep looking for a strong one.
*info_out = *it;
}
} else {
// Client only cares if there is an overlapping symbol.
return true;
}
}
}
return false;
}
VDSOSupport::SymbolIterator::SymbolIterator(const void *const image, int index)
: index_(index), image_(image) {
}
const VDSOSupport::SymbolInfo *VDSOSupport::SymbolIterator::operator->() const {
return &info_;
}
const VDSOSupport::SymbolInfo& VDSOSupport::SymbolIterator::operator*() const {
return info_;
}
bool VDSOSupport::SymbolIterator::operator==(const SymbolIterator &rhs) const {
return this->image_ == rhs.image_ && this->index_ == rhs.index_;
}
bool VDSOSupport::SymbolIterator::operator!=(const SymbolIterator &rhs) const {
return !(*this == rhs);
}
VDSOSupport::SymbolIterator &VDSOSupport::SymbolIterator::operator++() {
this->Update(1);
return *this;
}
VDSOSupport::SymbolIterator VDSOSupport::begin() const {
SymbolIterator it(&image_, 0);
it.Update(0);
return it;
}
VDSOSupport::SymbolIterator VDSOSupport::end() const {
return SymbolIterator(&image_, image_.GetNumSymbols());
}
void VDSOSupport::SymbolIterator::Update(int increment) {
const ElfMemImage *image = reinterpret_cast<const ElfMemImage *>(image_);
CHECK(image->IsPresent() || increment == 0);
if (!image->IsPresent()) {
return;
}
index_ += increment;
if (index_ >= image->GetNumSymbols()) {
index_ = image->GetNumSymbols();
return;
}
const ElfW(Sym) *symbol = image->GetDynsym(index_);
const ElfW(Versym) *version_symbol = image->GetVersym(index_);
CHECK(symbol && version_symbol);
const char *const symbol_name = image->GetDynstr(symbol->st_name);
const ElfW(Versym) version_index = version_symbol[0];
const ElfW(Verdef) *version_definition = image->GetVerdef(version_index);
const char *version_name = "";
if (version_definition) {
// I am expecting 1 or 2 auxiliary entries: 1 for the version itself,
// optional 2nd if the version has a parent.
CHECK_LE(1, version_definition->vd_cnt);
CHECK_LE(version_definition->vd_cnt, 2);
const ElfW(Verdaux) *version_aux = image->GetVerdefAux(version_definition);
version_name = image->GetVerstr(version_aux->vda_name);
}
info_.name = symbol_name;
info_.version = version_name;
info_.address = image->GetSymAddr(symbol);
info_.symbol = symbol;
}
// NOLINT on 'long' because this routine mimics kernel api.
long VDSOSupport::GetCPUViaSyscall(unsigned *cpu, void *, void *) { // NOLINT
#if defined(__NR_getcpu)
return sys_getcpu(cpu, NULL, NULL);
#else
// x86_64 never implemented sys_getcpu(), except as a VDSO call.
errno = ENOSYS;
return -1;
#endif
}
// Use fast __vdso_getcpu if available.
long VDSOSupport::InitAndGetCPU(unsigned *cpu, void *x, void *y) { // NOLINT
Init();
CHECK_NE(getcpu_fn_, &InitAndGetCPU); // << "Init() did not set getcpu_fn_";
return (*getcpu_fn_)(cpu, x, y);
}
// This function must be very fast, and may be called from very
// low level (e.g. tcmalloc). Hence I avoid things like
// GoogleOnceInit() and ::operator new.
int GetCPU(void) {
unsigned cpu;
int ret_code = (*VDSOSupport::getcpu_fn_)(&cpu, NULL, NULL);
return ret_code == 0 ? cpu : ret_code;
}
}
#endif // HAVE_VDSO_SUPPORT
|