blob: 60e5e1cdc6be598baabff8cfe27cb09827569906 [file] [log] [blame]
Dmitriy Ivanovd597d262014-05-05 16:49:04 -07001/*
2 * Copyright (C) 2014 The Android Open Source Project
Dimitry Ivanovbcc4da92017-02-15 15:31:13 -08003 * All rights reserved.
Dmitriy Ivanovd597d262014-05-05 16:49:04 -07004 *
Dimitry Ivanovbcc4da92017-02-15 15:31:13 -08005 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * * Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * * Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in
12 * the documentation and/or other materials provided with the
13 * distribution.
Dmitriy Ivanovd597d262014-05-05 16:49:04 -070014 *
Dimitry Ivanovbcc4da92017-02-15 15:31:13 -080015 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
16 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
17 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
18 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
19 * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
20 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
21 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
22 * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
23 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
24 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
25 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26 * SUCH DAMAGE.
Dmitriy Ivanovd597d262014-05-05 16:49:04 -070027 */
Elliott Hughes05fc1d72015-01-28 18:02:33 -080028
Dmitriy Ivanovc9ce70d2015-03-10 15:30:26 -070029#include "linker_block_allocator.h"
Elliott Hughes3205cdd2020-06-10 14:48:06 -070030
Dmitriy Ivanovd597d262014-05-05 16:49:04 -070031#include <inttypes.h>
Elliott Hughes05fc1d72015-01-28 18:02:33 -080032#include <string.h>
Dmitriy Ivanovd597d262014-05-05 16:49:04 -070033#include <sys/mman.h>
Eric Miao08cf9492021-11-18 18:48:47 +000034#include <sys/param.h>
Elliott Hughes99d54652018-08-22 10:36:23 -070035#include <sys/prctl.h>
Dmitriy Ivanovd597d262014-05-05 16:49:04 -070036#include <unistd.h>
37
Elliott Hughes3205cdd2020-06-10 14:48:06 -070038#include "linker_debug.h"
39
Vic Yangdac328a2019-01-23 14:21:58 -080040static constexpr size_t kAllocateSize = PAGE_SIZE * 100;
41static_assert(kAllocateSize % PAGE_SIZE == 0, "Invalid kAllocateSize.");
42
Dmitriy Ivanov600bc3c2015-03-10 15:43:50 -070043struct LinkerBlockAllocatorPage {
44 LinkerBlockAllocatorPage* next;
Vic Yangdac328a2019-01-23 14:21:58 -080045 uint8_t bytes[kAllocateSize - 16] __attribute__((aligned(16)));
Dmitriy Ivanovd597d262014-05-05 16:49:04 -070046};
47
48struct FreeBlockInfo {
49 void* next_block;
50 size_t num_free_blocks;
51};
52
Eric Miao08cf9492021-11-18 18:48:47 +000053static_assert(kBlockSizeAlign >= alignof(FreeBlockInfo));
54static_assert(kBlockSizeMin == sizeof(FreeBlockInfo));
55
Dmitriy Ivanov4151ea72014-07-24 15:33:25 -070056LinkerBlockAllocator::LinkerBlockAllocator(size_t block_size)
Eric Miao08cf9492021-11-18 18:48:47 +000057 : block_size_(__BIONIC_ALIGN(MAX(block_size, kBlockSizeMin), kBlockSizeAlign)),
58 page_list_(nullptr),
59 free_block_list_(nullptr),
60 allocated_(0) {}
Dmitriy Ivanovd597d262014-05-05 16:49:04 -070061
Dmitriy Ivanovd597d262014-05-05 16:49:04 -070062void* LinkerBlockAllocator::alloc() {
63 if (free_block_list_ == nullptr) {
64 create_new_page();
Dmitriy Ivanovd597d262014-05-05 16:49:04 -070065 }
66
67 FreeBlockInfo* block_info = reinterpret_cast<FreeBlockInfo*>(free_block_list_);
68 if (block_info->num_free_blocks > 1) {
69 FreeBlockInfo* next_block_info = reinterpret_cast<FreeBlockInfo*>(
70 reinterpret_cast<char*>(free_block_list_) + block_size_);
71 next_block_info->next_block = block_info->next_block;
72 next_block_info->num_free_blocks = block_info->num_free_blocks - 1;
73 free_block_list_ = next_block_info;
74 } else {
75 free_block_list_ = block_info->next_block;
76 }
77
Dmitriy Ivanovd59e5002014-05-09 09:10:14 -070078 memset(block_info, 0, block_size_);
Dmitriy Ivanovd597d262014-05-05 16:49:04 -070079
Vic Yangbb7e1232019-01-29 20:23:16 -080080 ++allocated_;
81
Dmitriy Ivanovd597d262014-05-05 16:49:04 -070082 return block_info;
83}
84
85void LinkerBlockAllocator::free(void* block) {
86 if (block == nullptr) {
87 return;
88 }
89
Dmitriy Ivanov600bc3c2015-03-10 15:43:50 -070090 LinkerBlockAllocatorPage* page = find_page(block);
Elliott Hughes3205cdd2020-06-10 14:48:06 -070091 CHECK(page != nullptr);
Dmitriy Ivanovd597d262014-05-05 16:49:04 -070092
93 ssize_t offset = reinterpret_cast<uint8_t*>(block) - page->bytes;
Elliott Hughes3205cdd2020-06-10 14:48:06 -070094 CHECK((offset % block_size_) == 0);
Dmitriy Ivanovd597d262014-05-05 16:49:04 -070095
Dmitriy Ivanovd59e5002014-05-09 09:10:14 -070096 memset(block, 0, block_size_);
97
Dmitriy Ivanovd597d262014-05-05 16:49:04 -070098 FreeBlockInfo* block_info = reinterpret_cast<FreeBlockInfo*>(block);
99
Dmitriy Ivanovd597d262014-05-05 16:49:04 -0700100 block_info->next_block = free_block_list_;
101 block_info->num_free_blocks = 1;
Dmitriy Ivanovd597d262014-05-05 16:49:04 -0700102
103 free_block_list_ = block_info;
Vic Yangbb7e1232019-01-29 20:23:16 -0800104
105 --allocated_;
Dmitriy Ivanovd597d262014-05-05 16:49:04 -0700106}
107
108void LinkerBlockAllocator::protect_all(int prot) {
Dmitriy Ivanov600bc3c2015-03-10 15:43:50 -0700109 for (LinkerBlockAllocatorPage* page = page_list_; page != nullptr; page = page->next) {
Vic Yangdac328a2019-01-23 14:21:58 -0800110 if (mprotect(page, kAllocateSize, prot) == -1) {
Elliott Hughes3205cdd2020-06-10 14:48:06 -0700111 async_safe_fatal("mprotect(%p, %zu, %d) failed: %m", page, kAllocateSize, prot);
Dmitriy Ivanovd597d262014-05-05 16:49:04 -0700112 }
113 }
114}
115
Dmitriy Ivanovd597d262014-05-05 16:49:04 -0700116void LinkerBlockAllocator::create_new_page() {
Vic Yangdac328a2019-01-23 14:21:58 -0800117 static_assert(sizeof(LinkerBlockAllocatorPage) == kAllocateSize,
Dimitry Ivanov3edc5c42016-01-21 10:55:40 -0800118 "Invalid sizeof(LinkerBlockAllocatorPage)");
119
Dmitriy Ivanov600bc3c2015-03-10 15:43:50 -0700120 LinkerBlockAllocatorPage* page = reinterpret_cast<LinkerBlockAllocatorPage*>(
Vic Yangdac328a2019-01-23 14:21:58 -0800121 mmap(nullptr, kAllocateSize, PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, -1, 0));
Elliott Hughes3205cdd2020-06-10 14:48:06 -0700122 CHECK(page != MAP_FAILED);
Dmitriy Ivanov51a22a12014-08-08 16:57:15 -0700123
Vic Yangdac328a2019-01-23 14:21:58 -0800124 prctl(PR_SET_VMA, PR_SET_VMA_ANON_NAME, page, kAllocateSize, "linker_alloc");
Dmitriy Ivanov51a22a12014-08-08 16:57:15 -0700125
Dmitriy Ivanovd597d262014-05-05 16:49:04 -0700126 FreeBlockInfo* first_block = reinterpret_cast<FreeBlockInfo*>(page->bytes);
127 first_block->next_block = free_block_list_;
Ryan Prichard92b3e1b2019-03-11 17:27:52 -0700128 first_block->num_free_blocks = sizeof(page->bytes) / block_size_;
Dmitriy Ivanovd597d262014-05-05 16:49:04 -0700129
130 free_block_list_ = first_block;
131
132 page->next = page_list_;
133 page_list_ = page;
134}
135
Dmitriy Ivanov600bc3c2015-03-10 15:43:50 -0700136LinkerBlockAllocatorPage* LinkerBlockAllocator::find_page(void* block) {
Elliott Hughes3205cdd2020-06-10 14:48:06 -0700137 CHECK(block != nullptr);
Dmitriy Ivanovd597d262014-05-05 16:49:04 -0700138
Dmitriy Ivanov600bc3c2015-03-10 15:43:50 -0700139 LinkerBlockAllocatorPage* page = page_list_;
Dmitriy Ivanovd597d262014-05-05 16:49:04 -0700140 while (page != nullptr) {
Dmitriy Ivanov10794062014-05-14 12:52:57 -0700141 const uint8_t* page_ptr = reinterpret_cast<const uint8_t*>(page);
Vic Yangdac328a2019-01-23 14:21:58 -0800142 if (block >= (page_ptr + sizeof(page->next)) && block < (page_ptr + kAllocateSize)) {
Dmitriy Ivanovd597d262014-05-05 16:49:04 -0700143 return page;
144 }
145
146 page = page->next;
147 }
148
Elliott Hughes3205cdd2020-06-10 14:48:06 -0700149 async_safe_fatal("couldn't find page for %p", block);
Dmitriy Ivanovd597d262014-05-05 16:49:04 -0700150}
Vic Yangbb7e1232019-01-29 20:23:16 -0800151
152void LinkerBlockAllocator::purge() {
153 if (allocated_) {
154 return;
155 }
156
157 LinkerBlockAllocatorPage* page = page_list_;
158 while (page) {
159 LinkerBlockAllocatorPage* next = page->next;
160 munmap(page, kAllocateSize);
161 page = next;
162 }
163 page_list_ = nullptr;
164 free_block_list_ = nullptr;
165}