| /lib/ |
| D | decompress_unxz.c | 158 #define kfree(ptr) free(ptr)
160 #define vfree(ptr) do { if (ptr != NULL) free(ptr); } while (0)
340 free(in); in unxz()
343 free(b.out); in unxz()
383 free(b.out); in unxz()
|
| D | decompress_inflate.c | 186 free(strm->workspace); in __gunzip()
188 free(strm); in __gunzip()
191 free(zbuf); in __gunzip()
194 free(out_buf); in __gunzip()
|
| D | lru_cache.c | 121 INIT_LIST_HEAD(&lc->free); in lc_create()
143 list_add(&e->list, &lc->free); in lc_create()
200 INIT_LIST_HEAD(&lc->free); in lc_reset()
221 list_add(&e->list, &lc->free); in lc_reset()
318 list_move(&e->list, &lc->free); in lc_del()
327 if (!list_empty(&lc->free)) in lc_prepare_for_change()
328 n = lc->free.next; in lc_prepare_for_change()
348 if (!list_empty(&lc->free)) in lc_unused_element_available()
622 lh = &lc->free; in lc_set()
|
| D | inflate.c | 266 static void free(void *where) in free() function
274 #define free(a) kfree(a) macro
561 free(stk); in huft_build()
582 free((char*)p); in huft_free()
794 free(l); in inflate_fixed()
805 free(l); in inflate_fixed()
814 free(l); in inflate_fixed()
819 free(l); in inflate_fixed()
1024 free(ll);
|
| D | test_overflow.c | 495 #define free0(free, arg, ptr) free(ptr) argument
496 #define free1(free, arg, ptr) free(arg, ptr) argument
514 free ## want_arg (free_func, arg, ptr); \
523 free ## want_arg (free_func, arg, ptr); \
530 free ## want_arg (free_func, arg, ptr); \
|
| D | decompress_unlzo.c | 268 free(in_buf_save); in unlzo()
271 free(out_buf); in unlzo()
|
| D | Kconfig.kfence | 13 access, use-after-free, and invalid-free errors. KFENCE is designed
|
| D | decompress_bunzip2.c | 736 free(bd); in bunzip2()
739 free(inbuf); in bunzip2()
742 free(outbuf); in bunzip2()
|
| D | Kconfig.kasan | 44 error detector designed to find out-of-bounds and use-after-free bugs.
188 out-of-bounds and use-after-free accesses. Useful for testing whether
|
| D | debugobjects.c | 1299 goto free; in debug_objects_replace_static_objects()
1334 free: in debug_objects_replace_static_objects()
|
| D | radix-tree.c | 854 bool free = node_tag_get(root, node, IDR_FREE, offset); in calculate_count() local
855 if (!free) in calculate_count()
|
| D | decompress_unlzma.c | 664 free(inbuf); in unlzma()
|
| D | Kconfig.debug | 642 This enables checks whether a k/v free operation frees an area
690 allocation as well as poisoning memory on free to catch use of freed
792 Enables the display of the minimum amount of free stack which each
969 option will show detailed messages if free stack space drops
|
| /lib/kunit/ |
| D | test.c | 599 kunit_resource_free_t free, in kunit_add_resource() argument
606 res->free = free; in kunit_add_resource()
628 kunit_resource_free_t free, in kunit_add_named_resource() argument
646 return kunit_add_resource(test, init, free, res, data); in kunit_add_named_resource()
652 kunit_resource_free_t free, in kunit_alloc_and_get_resource() argument
663 ret = kunit_add_resource(test, init, free, res, data); in kunit_alloc_and_get_resource()
|
| D | kunit-test.c | 146 kunit_resource_free_t free = fake_resource_free; in kunit_resource_test_alloc_resource() local
159 KUNIT_EXPECT_PTR_EQ(test, free, res->free); in kunit_resource_test_alloc_resource()
|
| /lib/raid6/ |
| D | vpermxor.uc | 4 * This program is free software; you can redistribute it and/or
|
| D | altivec.uc | 5 * This program is free software; you can redistribute it and/or modify
|
| D | int.uc | 5 * This program is free software; you can redistribute it and/or modify
|
| D | neon.uc | 11 * This program is free software; you can redistribute it and/or modify
|