quarantine.c 9.6 KB
Newer Older
1
// SPDX-License-Identifier: GPL-2.0
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
/*
 * KASAN quarantine.
 *
 * Author: Alexander Potapenko <glider@google.com>
 * Copyright (C) 2016 Google, Inc.
 *
 * Based on code by Dmitry Chernenkov.
 */

#include <linux/gfp.h>
#include <linux/hash.h>
#include <linux/kernel.h>
#include <linux/mm.h>
#include <linux/percpu.h>
#include <linux/printk.h>
#include <linux/shrinker.h>
#include <linux/slab.h>
19
#include <linux/srcu.h>
20 21
#include <linux/string.h>
#include <linux/types.h>
22
#include <linux/cpuhotplug.h>
23 24 25 26 27 28 29

#include "../slab.h"
#include "kasan.h"

/* Data structure and operations for quarantine queues. */

/*
I
Ingo Molnar 已提交
30
 * Each queue is a single-linked list, which also stores the total size of
31 32 33 34 35 36
 * objects inside of it.
 */
struct qlist_head {
	struct qlist_node *head;
	struct qlist_node *tail;
	size_t bytes;
37
	bool offline;
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
};

#define QLIST_INIT { NULL, NULL, 0 }

static bool qlist_empty(struct qlist_head *q)
{
	return !q->head;
}

static void qlist_init(struct qlist_head *q)
{
	q->head = q->tail = NULL;
	q->bytes = 0;
}

static void qlist_put(struct qlist_head *q, struct qlist_node *qlink,
		size_t size)
{
	if (unlikely(qlist_empty(q)))
		q->head = qlink;
	else
		q->tail->next = qlink;
	q->tail = qlink;
	qlink->next = NULL;
	q->bytes += size;
}

static void qlist_move_all(struct qlist_head *from, struct qlist_head *to)
{
	if (unlikely(qlist_empty(from)))
		return;

	if (qlist_empty(to)) {
		*to = *from;
		qlist_init(from);
		return;
	}

	to->tail->next = from->head;
	to->tail = from->tail;
	to->bytes += from->bytes;

	qlist_init(from);
}

83 84 85
#define QUARANTINE_PERCPU_SIZE (1 << 20)
#define QUARANTINE_BATCHES \
	(1024 > 4 * CONFIG_NR_CPUS ? 1024 : 4 * CONFIG_NR_CPUS)
86 87 88 89 90 91 92

/*
 * The object quarantine consists of per-cpu queues and a global queue,
 * guarded by quarantine_lock.
 */
static DEFINE_PER_CPU(struct qlist_head, cpu_quarantine);

93 94 95 96 97 98
/* Round-robin FIFO array of batches. */
static struct qlist_head global_quarantine[QUARANTINE_BATCHES];
static int quarantine_head;
static int quarantine_tail;
/* Total size of all objects in global_quarantine across all batches. */
static unsigned long quarantine_size;
99
static DEFINE_RAW_SPINLOCK(quarantine_lock);
100
DEFINE_STATIC_SRCU(remove_cache_srcu);
101 102

/* Maximum size of the global queue. */
103 104 105 106 107 108 109
static unsigned long quarantine_max_size;

/*
 * Target size of a batch in global_quarantine.
 * Usually equal to QUARANTINE_PERCPU_SIZE unless we have too much RAM.
 */
static unsigned long quarantine_batch_size;
110 111 112 113 114 115 116 117 118 119

/*
 * The fraction of physical memory the quarantine is allowed to occupy.
 * Quarantine doesn't support memory shrinker with SLAB allocator, so we keep
 * the ratio low to avoid OOM.
 */
#define QUARANTINE_FRACTION 32

static struct kmem_cache *qlink_to_cache(struct qlist_node *qlink)
{
120
	return virt_to_slab(qlink)->slab_cache;
121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136
}

static void *qlink_to_object(struct qlist_node *qlink, struct kmem_cache *cache)
{
	struct kasan_free_meta *free_info =
		container_of(qlink, struct kasan_free_meta,
			     quarantine_link);

	return ((void *)free_info) - cache->kasan_info.free_meta_offset;
}

static void qlink_free(struct qlist_node *qlink, struct kmem_cache *cache)
{
	void *object = qlink_to_object(qlink, cache);
	unsigned long flags;

137 138 139
	if (IS_ENABLED(CONFIG_SLAB))
		local_irq_save(flags);

140
	/*
I
Ingo Molnar 已提交
141
	 * As the object now gets freed from the quarantine, assume that its
142 143
	 * free track is no longer valid.
	 */
144
	*(u8 *)kasan_mem_to_shadow(object) = KASAN_KMALLOC_FREE;
145

146
	___cache_free(cache, object, _THIS_IP_);
147 148 149

	if (IS_ENABLED(CONFIG_SLAB))
		local_irq_restore(flags);
150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170
}

static void qlist_free_all(struct qlist_head *q, struct kmem_cache *cache)
{
	struct qlist_node *qlink;

	if (unlikely(qlist_empty(q)))
		return;

	qlink = q->head;
	while (qlink) {
		struct kmem_cache *obj_cache =
			cache ? cache :	qlink_to_cache(qlink);
		struct qlist_node *next = qlink->next;

		qlink_free(qlink, obj_cache);
		qlink = next;
	}
	qlist_init(q);
}

171
bool kasan_quarantine_put(struct kmem_cache *cache, void *object)
172 173 174 175
{
	unsigned long flags;
	struct qlist_head *q;
	struct qlist_head temp = QLIST_INIT;
176
	struct kasan_free_meta *meta = kasan_get_free_meta(cache, object);
177

178 179 180 181 182 183 184
	/*
	 * If there's no metadata for this object, don't put it into
	 * quarantine.
	 */
	if (!meta)
		return false;

185 186
	/*
	 * Note: irq must be disabled until after we move the batch to the
187 188 189 190 191
	 * global quarantine. Otherwise kasan_quarantine_remove_cache() can
	 * miss some objects belonging to the cache if they are in our local
	 * temp list. kasan_quarantine_remove_cache() executes on_each_cpu()
	 * at the beginning which ensures that it either sees the objects in
	 * per-cpu lists or in the global quarantine.
192
	 */
193 194 195
	local_irq_save(flags);

	q = this_cpu_ptr(&cpu_quarantine);
196 197
	if (q->offline) {
		local_irq_restore(flags);
198
		return false;
199
	}
200
	qlist_put(q, &meta->quarantine_link, cache->size);
201
	if (unlikely(q->bytes > QUARANTINE_PERCPU_SIZE)) {
202 203
		qlist_move_all(q, &temp);

204
		raw_spin_lock(&quarantine_lock);
205 206 207 208 209 210 211 212 213 214 215 216
		WRITE_ONCE(quarantine_size, quarantine_size + temp.bytes);
		qlist_move_all(&temp, &global_quarantine[quarantine_tail]);
		if (global_quarantine[quarantine_tail].bytes >=
				READ_ONCE(quarantine_batch_size)) {
			int new_tail;

			new_tail = quarantine_tail + 1;
			if (new_tail == QUARANTINE_BATCHES)
				new_tail = 0;
			if (new_tail != quarantine_head)
				quarantine_tail = new_tail;
		}
217
		raw_spin_unlock(&quarantine_lock);
218
	}
219 220

	local_irq_restore(flags);
221 222

	return true;
223 224
}

225
void kasan_quarantine_reduce(void)
226
{
227
	size_t total_size, new_quarantine_size, percpu_quarantines;
228
	unsigned long flags;
229
	int srcu_idx;
230 231
	struct qlist_head to_free = QLIST_INIT;

232 233
	if (likely(READ_ONCE(quarantine_size) <=
		   READ_ONCE(quarantine_max_size)))
234 235
		return;

236
	/*
237
	 * srcu critical section ensures that kasan_quarantine_remove_cache()
238 239 240 241 242 243 244 245
	 * will not miss objects belonging to the cache while they are in our
	 * local to_free list. srcu is chosen because (1) it gives us private
	 * grace period domain that does not interfere with anything else,
	 * and (2) it allows synchronize_srcu() to return without waiting
	 * if there are no pending read critical sections (which is the
	 * expected case).
	 */
	srcu_idx = srcu_read_lock(&remove_cache_srcu);
246
	raw_spin_lock_irqsave(&quarantine_lock, flags);
247 248 249 250 251

	/*
	 * Update quarantine size in case of hotplug. Allocate a fraction of
	 * the installed memory to quarantine minus per-cpu queue limits.
	 */
252
	total_size = (totalram_pages() << PAGE_SHIFT) /
253
		QUARANTINE_FRACTION;
254
	percpu_quarantines = QUARANTINE_PERCPU_SIZE * num_online_cpus();
255 256 257 258 259 260 261 262 263 264 265 266 267
	new_quarantine_size = (total_size < percpu_quarantines) ?
		0 : total_size - percpu_quarantines;
	WRITE_ONCE(quarantine_max_size, new_quarantine_size);
	/* Aim at consuming at most 1/2 of slots in quarantine. */
	WRITE_ONCE(quarantine_batch_size, max((size_t)QUARANTINE_PERCPU_SIZE,
		2 * total_size / QUARANTINE_BATCHES));

	if (likely(quarantine_size > quarantine_max_size)) {
		qlist_move_all(&global_quarantine[quarantine_head], &to_free);
		WRITE_ONCE(quarantine_size, quarantine_size - to_free.bytes);
		quarantine_head++;
		if (quarantine_head == QUARANTINE_BATCHES)
			quarantine_head = 0;
268 269
	}

270
	raw_spin_unlock_irqrestore(&quarantine_lock, flags);
271 272

	qlist_free_all(&to_free, NULL);
273
	srcu_read_unlock(&remove_cache_srcu, srcu_idx);
274 275 276 277 278 279
}

static void qlist_move_cache(struct qlist_head *from,
				   struct qlist_head *to,
				   struct kmem_cache *cache)
{
280
	struct qlist_node *curr;
281 282 283 284 285

	if (unlikely(qlist_empty(from)))
		return;

	curr = from->head;
286
	qlist_init(from);
287
	while (curr) {
288 289 290 291 292 293 294 295 296
		struct qlist_node *next = curr->next;
		struct kmem_cache *obj_cache = qlink_to_cache(curr);

		if (obj_cache == cache)
			qlist_put(to, curr, obj_cache->size);
		else
			qlist_put(from, curr, obj_cache->size);

		curr = next;
297 298 299 300 301 302 303 304 305 306 307 308 309 310
	}
}

static void per_cpu_remove_cache(void *arg)
{
	struct kmem_cache *cache = arg;
	struct qlist_head to_free = QLIST_INIT;
	struct qlist_head *q;

	q = this_cpu_ptr(&cpu_quarantine);
	qlist_move_cache(q, &to_free, cache);
	qlist_free_all(&to_free, cache);
}

311
/* Free all quarantined objects belonging to cache. */
312
void kasan_quarantine_remove_cache(struct kmem_cache *cache)
313
{
314
	unsigned long flags, i;
315 316
	struct qlist_head to_free = QLIST_INIT;

317 318
	/*
	 * Must be careful to not miss any objects that are being moved from
319 320
	 * per-cpu list to the global quarantine in kasan_quarantine_put(),
	 * nor objects being freed in kasan_quarantine_reduce(). on_each_cpu()
321 322 323
	 * achieves the first goal, while synchronize_srcu() achieves the
	 * second.
	 */
324 325
	on_each_cpu(per_cpu_remove_cache, cache, 1);

326
	raw_spin_lock_irqsave(&quarantine_lock, flags);
327 328 329
	for (i = 0; i < QUARANTINE_BATCHES; i++) {
		if (qlist_empty(&global_quarantine[i]))
			continue;
330
		qlist_move_cache(&global_quarantine[i], &to_free, cache);
331
		/* Scanning whole quarantine can take a while. */
332
		raw_spin_unlock_irqrestore(&quarantine_lock, flags);
333
		cond_resched();
334
		raw_spin_lock_irqsave(&quarantine_lock, flags);
335
	}
336
	raw_spin_unlock_irqrestore(&quarantine_lock, flags);
337 338

	qlist_free_all(&to_free, cache);
339 340

	synchronize_srcu(&remove_cache_srcu);
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

static int kasan_cpu_online(unsigned int cpu)
{
	this_cpu_ptr(&cpu_quarantine)->offline = false;
	return 0;
}

static int kasan_cpu_offline(unsigned int cpu)
{
	struct qlist_head *q;

	q = this_cpu_ptr(&cpu_quarantine);
	/* Ensure the ordering between the writing to q->offline and
	 * qlist_free_all. Otherwise, cpu_quarantine may be corrupted
	 * by interrupt.
	 */
	WRITE_ONCE(q->offline, true);
	barrier();
	qlist_free_all(q, NULL);
	return 0;
}

static int __init kasan_cpu_quarantine_init(void)
{
	int ret = 0;

	ret = cpuhp_setup_state(CPUHP_AP_ONLINE_DYN, "mm/kasan:online",
				kasan_cpu_online, kasan_cpu_offline);
	if (ret < 0)
		pr_err("kasan cpu quarantine register failed [%d]\n", ret);
	return ret;
}
late_initcall(kasan_cpu_quarantine_init);