Searched refs:free (Results 1 – 16 of 16) sorted by relevance
/lib/ |
D | decompress_inflate.c | 173 free(strm->workspace); in __gunzip() 175 free(strm); in __gunzip() 178 free(zbuf); in __gunzip() 181 free(out_buf); in __gunzip()
|
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 | lru_cache.c | 120 INIT_LIST_HEAD(&lc->free); in lc_create() 142 list_add(&e->list, &lc->free); in lc_create() 199 INIT_LIST_HEAD(&lc->free); in lc_reset() 220 list_add(&e->list, &lc->free); in lc_reset() 317 list_move(&e->list, &lc->free); in lc_del() 326 if (!list_empty(&lc->free)) in lc_prepare_for_change() 327 n = lc->free.next; in lc_prepare_for_change() 347 if (!list_empty(&lc->free)) in lc_unused_element_available() 621 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 | 269 free(in_buf_save); in unlzo() 272 free(out_buf); in unlzo()
|
D | Kconfig.kasan | 22 designed to find out-of-bounds accesses and use-after-free bugs. 142 (use-after-free or out-of-bounds) at the cost of increased 150 out of bounds accesses, use after free. It is useful for testing
|
D | decompress_bunzip2.c | 736 free(bd); in bunzip2() 739 free(inbuf); in bunzip2() 742 free(outbuf); in bunzip2()
|
D | debugobjects.c | 1302 goto free; in debug_objects_replace_static_objects() 1335 free: in debug_objects_replace_static_objects()
|
D | radix-tree.c | 865 bool free = node_tag_get(root, node, IDR_FREE, offset); in calculate_count() local 866 if (!free) in calculate_count()
|
D | decompress_unlzma.c | 664 free(inbuf); in unlzma()
|
D | Kconfig.debug | 474 This enables checks whether a k/v free operation frees an area 522 allocation as well as poisoning memory on free to catch use of freed 624 Enables the display of the minimum amount of free stack which each 745 option will show detailed messages if free stack space drops
|
/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 | neon.uc | 11 * 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
|