Merge "Pagetable-friendly shared library address randomization."

This commit is contained in:
Evgenii Stepanov 2020-07-21 19:50:55 +00:00 committed by Gerrit Code Review
commit 67406dced7
5 changed files with 90 additions and 5 deletions

View file

@ -311,6 +311,10 @@ static void soinfo_free(soinfo* si) {
} }
} }
if (si->has_min_version(6) && si->get_gap_size()) {
munmap(reinterpret_cast<void*>(si->get_gap_start()), si->get_gap_size());
}
TRACE("name %s: freeing soinfo @ %p", si->get_realpath(), si); TRACE("name %s: freeing soinfo @ %p", si->get_realpath(), si);
if (!solist_remove_soinfo(si)) { if (!solist_remove_soinfo(si)) {
@ -599,6 +603,8 @@ class LoadTask {
si_->load_bias = elf_reader.load_bias(); si_->load_bias = elf_reader.load_bias();
si_->phnum = elf_reader.phdr_count(); si_->phnum = elf_reader.phdr_count();
si_->phdr = elf_reader.loaded_phdr(); si_->phdr = elf_reader.loaded_phdr();
si_->set_gap_start(elf_reader.gap_start());
si_->set_gap_size(elf_reader.gap_size());
return true; return true;
} }

View file

@ -520,7 +520,8 @@ size_t phdr_table_get_load_size(const ElfW(Phdr)* phdr_table, size_t phdr_count,
// Reserve a virtual address range such that if it's limits were extended to the next 2**align // Reserve a virtual address range such that if it's limits were extended to the next 2**align
// boundary, it would not overlap with any existing mappings. // boundary, it would not overlap with any existing mappings.
static void* ReserveAligned(size_t size, size_t align) { static void* ReserveWithAlignmentPadding(size_t size, size_t align, void** out_gap_start,
size_t* out_gap_size) {
int mmap_flags = MAP_PRIVATE | MAP_ANONYMOUS; int mmap_flags = MAP_PRIVATE | MAP_ANONYMOUS;
if (align == PAGE_SIZE) { if (align == PAGE_SIZE) {
void* mmap_ptr = mmap(nullptr, size, PROT_NONE, mmap_flags, -1, 0); void* mmap_ptr = mmap(nullptr, size, PROT_NONE, mmap_flags, -1, 0);
@ -530,6 +531,15 @@ static void* ReserveAligned(size_t size, size_t align) {
return mmap_ptr; return mmap_ptr;
} }
// Minimum alignment of shared library gap. For efficiency, this should match the second level
// page size of the platform.
#if defined(__LP64__)
constexpr size_t kGapAlignment = 1ul << 21; // 2MB
#else
constexpr size_t kGapAlignment = 0;
#endif
// Maximum gap size, in the units of kGapAlignment.
constexpr size_t kMaxGapUnits = 32;
// Allocate enough space so that the end of the desired region aligned up is still inside the // Allocate enough space so that the end of the desired region aligned up is still inside the
// mapping. // mapping.
size_t mmap_size = align_up(size, align) + align - PAGE_SIZE; size_t mmap_size = align_up(size, align) + align - PAGE_SIZE;
@ -538,16 +548,49 @@ static void* ReserveAligned(size_t size, size_t align) {
if (mmap_ptr == MAP_FAILED) { if (mmap_ptr == MAP_FAILED) {
return nullptr; return nullptr;
} }
size_t gap_size = 0;
size_t first_byte = reinterpret_cast<size_t>(align_up(mmap_ptr, align));
size_t last_byte = reinterpret_cast<size_t>(align_down(mmap_ptr + mmap_size, align) - 1);
if (kGapAlignment && first_byte / kGapAlignment != last_byte / kGapAlignment) {
// This library crosses a 2MB boundary and will fragment a new huge page.
// Lets take advantage of that and insert a random number of inaccessible huge pages before that
// to improve address randomization and make it harder to locate this library code by probing.
munmap(mmap_ptr, mmap_size);
align = std::max(align, kGapAlignment);
gap_size =
kGapAlignment * (is_first_stage_init() ? 1 : arc4random_uniform(kMaxGapUnits - 1) + 1);
mmap_size = align_up(size + gap_size, align) + align - PAGE_SIZE;
mmap_ptr = reinterpret_cast<uint8_t*>(mmap(nullptr, mmap_size, PROT_NONE, mmap_flags, -1, 0));
if (mmap_ptr == MAP_FAILED) {
return nullptr;
}
}
uint8_t *gap_end, *gap_start;
if (gap_size) {
gap_end = align_down(mmap_ptr + mmap_size, kGapAlignment);
gap_start = gap_end - gap_size;
} else {
gap_start = gap_end = mmap_ptr + mmap_size;
}
uint8_t* first = align_up(mmap_ptr, align); uint8_t* first = align_up(mmap_ptr, align);
uint8_t* last = align_down(mmap_ptr + mmap_size, align) - size; uint8_t* last = align_down(gap_start, align) - size;
// arc4random* is not available in first stage init because /dev/urandom hasn't yet been // arc4random* is not available in first stage init because /dev/urandom hasn't yet been
// created. Don't randomize then. // created. Don't randomize then.
size_t n = is_first_stage_init() ? 0 : arc4random_uniform((last - first) / PAGE_SIZE + 1); size_t n = is_first_stage_init() ? 0 : arc4random_uniform((last - first) / PAGE_SIZE + 1);
uint8_t* start = first + n * PAGE_SIZE; uint8_t* start = first + n * PAGE_SIZE;
// Unmap the extra space around the allocation.
// Keep it mapped PROT_NONE on 64-bit targets where address space is plentiful to make it harder
// to defeat ASLR by probing for readable memory mappings.
munmap(mmap_ptr, start - mmap_ptr); munmap(mmap_ptr, start - mmap_ptr);
munmap(start + size, mmap_ptr + mmap_size - (start + size)); munmap(start + size, gap_start - (start + size));
if (gap_end != mmap_ptr + mmap_size) {
munmap(gap_end, mmap_ptr + mmap_size - gap_end);
}
*out_gap_start = gap_start;
*out_gap_size = gap_size;
return start; return start;
} }
@ -571,13 +614,15 @@ bool ElfReader::ReserveAddressSpace(address_space_params* address_space) {
load_size_ - address_space->reserved_size, load_size_, name_.c_str()); load_size_ - address_space->reserved_size, load_size_, name_.c_str());
return false; return false;
} }
start = ReserveAligned(load_size_, kLibraryAlignment); start = ReserveWithAlignmentPadding(load_size_, kLibraryAlignment, &gap_start_, &gap_size_);
if (start == nullptr) { if (start == nullptr) {
DL_ERR("couldn't reserve %zd bytes of address space for \"%s\"", load_size_, name_.c_str()); DL_ERR("couldn't reserve %zd bytes of address space for \"%s\"", load_size_, name_.c_str());
return false; return false;
} }
} else { } else {
start = address_space->start_addr; start = address_space->start_addr;
gap_start_ = nullptr;
gap_size_ = 0;
mapped_by_caller_ = true; mapped_by_caller_ = true;
// Update the reserved address space to subtract the space used by this library. // Update the reserved address space to subtract the space used by this library.

View file

@ -49,6 +49,8 @@ class ElfReader {
size_t phdr_count() const { return phdr_num_; } size_t phdr_count() const { return phdr_num_; }
ElfW(Addr) load_start() const { return reinterpret_cast<ElfW(Addr)>(load_start_); } ElfW(Addr) load_start() const { return reinterpret_cast<ElfW(Addr)>(load_start_); }
size_t load_size() const { return load_size_; } size_t load_size() const { return load_size_; }
ElfW(Addr) gap_start() const { return reinterpret_cast<ElfW(Addr)>(gap_start_); }
size_t gap_size() const { return gap_size_; }
ElfW(Addr) load_bias() const { return load_bias_; } ElfW(Addr) load_bias() const { return load_bias_; }
const ElfW(Phdr)* loaded_phdr() const { return loaded_phdr_; } const ElfW(Phdr)* loaded_phdr() const { return loaded_phdr_; }
const ElfW(Dyn)* dynamic() const { return dynamic_; } const ElfW(Dyn)* dynamic() const { return dynamic_; }
@ -96,6 +98,10 @@ class ElfReader {
void* load_start_; void* load_start_;
// Size in bytes of reserved address space. // Size in bytes of reserved address space.
size_t load_size_; size_t load_size_;
// First page of inaccessible gap mapping reserved for this DSO.
void* gap_start_;
// Size in bytes of the gap mapping.
size_t gap_size_;
// Load bias. // Load bias.
ElfW(Addr) load_bias_; ElfW(Addr) load_bias_;

View file

@ -900,6 +900,24 @@ void soinfo::generate_handle() {
g_soinfo_handles_map[handle_] = this; g_soinfo_handles_map[handle_] = this;
} }
void soinfo::set_gap_start(ElfW(Addr) gap_start) {
CHECK(has_min_version(6));
gap_start_ = gap_start;
}
ElfW(Addr) soinfo::get_gap_start() const {
CHECK(has_min_version(6));
return gap_start_;
}
void soinfo::set_gap_size(size_t gap_size) {
CHECK(has_min_version(6));
gap_size_ = gap_size;
}
size_t soinfo::get_gap_size() const {
CHECK(has_min_version(6));
return gap_size_;
}
// TODO(dimitry): Move SymbolName methods to a separate file. // TODO(dimitry): Move SymbolName methods to a separate file.
uint32_t calculate_elf_hash(const char* name) { uint32_t calculate_elf_hash(const char* name) {

View file

@ -66,7 +66,7 @@
#define FLAG_PRELINKED 0x00000400 // prelink_image has successfully processed this soinfo #define FLAG_PRELINKED 0x00000400 // prelink_image has successfully processed this soinfo
#define FLAG_NEW_SOINFO 0x40000000 // new soinfo format #define FLAG_NEW_SOINFO 0x40000000 // new soinfo format
#define SOINFO_VERSION 5 #define SOINFO_VERSION 6
ElfW(Addr) call_ifunc_resolver(ElfW(Addr) resolver_addr); ElfW(Addr) call_ifunc_resolver(ElfW(Addr) resolver_addr);
@ -345,6 +345,12 @@ struct soinfo {
SymbolLookupLib get_lookup_lib(); SymbolLookupLib get_lookup_lib();
void set_gap_start(ElfW(Addr) gap_start);
ElfW(Addr) get_gap_start() const;
void set_gap_size(size_t gap_size);
size_t get_gap_size() const;
private: private:
bool is_image_linked() const; bool is_image_linked() const;
void set_image_linked(); void set_image_linked();
@ -423,6 +429,10 @@ struct soinfo {
// version >= 5 // version >= 5
std::unique_ptr<soinfo_tls> tls_; std::unique_ptr<soinfo_tls> tls_;
std::vector<TlsDynamicResolverArg> tlsdesc_args_; std::vector<TlsDynamicResolverArg> tlsdesc_args_;
// version >= 6
ElfW(Addr) gap_start_;
size_t gap_size_;
}; };
// This function is used by dlvsym() to calculate hash of sym_ver // This function is used by dlvsym() to calculate hash of sym_ver