mm/kasan/generic.c

42  * depending on memory access size X.
58 						unsigned long size)
63 	 * Access crosses 8(shadow size)-byte boundary. Such access maps
66 	if (unlikely((((unsigned long)addr + size - 1) & KASAN_GRANULE_MASK) < size - 1))
67 		return *shadow_addr || memory_is_poisoned_1(addr + size - 1);
69 	return memory_is_poisoned_1(addr + size - 1);
84 					size_t size)
86 	while (size) {
90 		size--;
125 static __always_inline bool memory_is_poisoned_n(const void *addr, size_t size)
130 			kasan_mem_to_shadow(addr + size - 1) + 1);
133 		const void *last_byte = addr + size - 1;
144 static __always_inline bool memory_is_poisoned(const void *addr, size_t size)
146 	if (__builtin_constant_p(size)) {
147 		switch (size) {
153 			return memory_is_poisoned_2_4_8(addr, size);
161 	return memory_is_poisoned_n(addr, size);
165 						size_t size, bool write,
171 	if (unlikely(size == 0))
174 	if (unlikely(addr + size < addr))
175 		return !kasan_report(addr, size, write, ret_ip);
178 		return !kasan_report(addr, size, write, ret_ip);
180 	if (likely(!memory_is_poisoned(addr, size)))
183 	return !kasan_report(addr, size, write, ret_ip);
186 bool kasan_check_range(const void *addr, size_t size, bool write,
189 	return check_region_inline(addr, size, write, ret_ip);
217 	size_t aligned_size = round_up(global->size, KASAN_GRANULE_SIZE);
219 	kasan_unpoison(global->beg, global->size, false);
226 void __asan_register_globals(void *ptr, ssize_t size)
231 	for (i = 0; i < size; i++)
236 void __asan_unregister_globals(void *ptr, ssize_t size)
241 #define DEFINE_ASAN_LOAD_STORE(size)					\
242 	void __asan_load##size(void *addr)				\
244 		check_region_inline(addr, size, false, _RET_IP_);	\
246 	EXPORT_SYMBOL(__asan_load##size);				\
247 	__alias(__asan_load##size)					\
248 	void __asan_load##size##_noabort(void *);			\
249 	EXPORT_SYMBOL(__asan_load##size##_noabort);			\
250 	void __asan_store##size(void *addr)				\
252 		check_region_inline(addr, size, true, _RET_IP_);	\
254 	EXPORT_SYMBOL(__asan_store##size);				\
255 	__alias(__asan_store##size)					\
256 	void __asan_store##size##_noabort(void *);			\
257 	EXPORT_SYMBOL(__asan_store##size##_noabort)
265 void __asan_loadN(void *addr, ssize_t size)
267 	kasan_check_range(addr, size, false, _RET_IP_);
275 void __asan_storeN(void *addr, ssize_t size)
277 	kasan_check_range(addr, size, true, _RET_IP_);
290 void __asan_alloca_poison(void *addr, ssize_t size)
292 	size_t rounded_up_size = round_up(size, KASAN_GRANULE_SIZE);
293 	size_t padding_size = round_up(size, KASAN_ALLOCA_REDZONE_SIZE) -
295 	size_t rounded_down_size = round_down(size, KASAN_GRANULE_SIZE);
304 			size - rounded_down_size, false);
324 	void __asan_set_shadow_##byte(const void *addr, ssize_t size)	\
326 		__memset((void *)addr, 0x##byte, size);			\
353 void kasan_cache_create(struct kmem_cache *cache, unsigned int *size,
368 	 * size of the accessible memory within the object. Additionally, we use
373 	ok_size = *size;
376 	cache->kasan_info.alloc_meta_offset = *size;
377 	*size += sizeof(struct kasan_alloc_meta);
380 	if (*size > KMALLOC_MAX_SIZE) {
382 		*size = ok_size;
386 	ok_size = *size;
398 		cache->kasan_info.free_meta_offset = *size;
399 		*size += sizeof(struct kasan_free_meta);
422 		*size += rem_free_meta_size;
432 	cache->kasan_info.free_meta_offset = *size;
433 	*size += sizeof(struct kasan_free_meta);
437 	if (*size > KMALLOC_MAX_SIZE) {
440 		*size = ok_size;
443 	/* Calculate size with optimal redzone. */
448 	/* Use optimal size if the size with added metas is not large enough. */
449 	if (*size < optimal_size)
450 		*size = optimal_size;