| /linux/fs/jfs/ |
| H A D | jfs_imap.h | 52 __le32 inofreefwd; /* 4: ag inode free list forward */ 53 __le32 inofreeback; /* 4: ag inode free list back */ 54 __le32 extfreefwd; /* 4: ag inode extent free list forward */ 55 __le32 extfreeback; /* 4: ag inode extent free list back */ 56 __le32 iagfree; /* 4: iag free list */ 59 __le32 inosmap[SMAPSZ]; /* 16: sum map of mapwords w/ free inodes; 60 * note: this indicates free and backed 66 * free the value will be 0. 68 __le32 extsmap[SMAPSZ]; /* 16: sum map of mapwords w/ free extents */ 69 __le32 nfreeinos; /* 4: number of free inodes */ [all …]
|
| /linux/fs/ubifs/ |
| H A D | lprops.c | 30 return lprops->free; in get_heap_comp_val() 32 return lprops->free + lprops->dirty; in get_heap_comp_val() 47 * is either the amount of free space or the amount of dirty space, depending 85 * of free space or the amount of dirty space, depending on the category. 402 if (lprops->free == c->leb_size) { in ubifs_categorize_lprops() 407 if (lprops->free + lprops->dirty == c->leb_size) { in ubifs_categorize_lprops() 415 if (lprops->dirty + lprops->free >= c->min_idx_node_sz) in ubifs_categorize_lprops() 419 lprops->dirty > lprops->free) in ubifs_categorize_lprops() 421 if (lprops->free > 0) in ubifs_categorize_lprops() 458 * @spc: amount of free and dirty space in the LEB [all …]
|
| H A D | find.c | 54 if (lprops->free + lprops->dirty >= c->dark_wm) in valuable() 97 if (lprops->free + lprops->dirty < data->min_space) in scan_for_dirty_cb() 103 if (lprops->free + lprops->dirty == c->leb_size) { in scan_for_dirty_cb() 115 * scan_for_dirty - find a data LEB with free space. 117 * @min_space: minimum amount free plus dirty space the returned LEB has to 119 * @pick_free: if it is OK to return a free or freeable LEB 134 /* There may be an LEB with enough dirty space on the free heap */ in scan_for_dirty() 138 if (lprops->free + lprops->dirty < min_space) in scan_for_dirty() 154 if (lprops->free + lprops->dirty < min_space) in scan_for_dirty() 180 ubifs_assert(c, lprops->free + lprops->dirty >= min_space); in scan_for_dirty() [all …]
|
| H A D | budget.c | 62 * This function runs garbage collector to make some more free space. Returns 63 * zero if a free LEB has been produced, %-EAGAIN if commit is required, and a 70 /* Make some free space by garbage-collecting dirty space */ in run_gc() 100 * make_free_space - make more free space on the file-system. 104 * is supposedly no free space. But in most cases there is some free space: 106 * needed, so shrinking the liability is one way to make free space - the 108 * o GC may turn some dark space into free space (budgeting treats dark space 110 * o commit may free some LEB, i.e., turn freeable LEBs into free LEBs. 112 * So this function tries to do the above. Returns %-EAGAIN if some free space 114 * Returns %-ENOSPC if it couldn't do more free space, and other negative error [all …]
|
| /linux/include/linux/ |
| H A D | devcoredump.h | 19 * _devcd_free_sgtable - free all the memory of the given scatterlist table 23 * @table: pointer to sg_table to free 32 /* free pages */ in _devcd_free_sgtable() 40 /* then free all chained tables */ in _devcd_free_sgtable() 52 /* free the last table */ in _devcd_free_sgtable() 65 void (*free)(void *data), 85 void (*free)(void *data), in dev_coredumpm_timeout() 88 free(data); in dev_coredumpm_timeout() 102 * dev_coredumpm - create device coredump with read/free methods 104 * @owner: the module that contains the read/free functions, use %THIS_MODULE [all …]
|
| /linux/drivers/gpu/drm/imagination/ |
| H A D | pvr_free_list.h | 27 * struct pvr_free_list_node - structure representing an allocation in the free 34 /** @free_list: Pointer to owning free list. */ 45 * struct pvr_free_list - structure representing a free list 54 /** @obj: GEM object representing the free list. */ 64 * @lock: Mutex protecting modification of the free list. Must be held when accessing any 72 /** @current_pages: Current number of pages in free list. */ 75 /** @max_pages: Maximum number of pages in free list. */ 78 /** @grow_pages: Pages to grow free list by per request. */ 93 /** @mem_block_list: List of memory blocks in this free list. */ 96 /** @hwrt_list: List of HWRTs using this free list. */ [all …]
|
| /linux/tools/perf/util/ |
| H A D | parse-events.y | 52 free(list_evsel); in free_list_evsel() 74 %destructor { free ($$); } <str> 96 %destructor { free ($$.sys); free ($$.event); } <tracepoint_name> 130 free(groups); 141 free(group); 153 free(event); 205 free(event); 266 free($1); 286 free( [all...] |
| H A D | expr.c | 101 free(data_ptr); in ids__insert() 102 free(old_key); in ids__insert() 103 free(old_data); in ids__insert() 129 free(old_key); in ids__union() 130 free(old_data); in ids__union() 172 free(data_ptr); in expr__add_id_val_source_count() 178 free(old_key); in expr__add_id_val_source_count() 179 free(old_data); 203 free(data_ptr); in expr__add_ref() 219 free(data_pt [all...] |
| /linux/fs/xfs/scrub/ |
| H A D | alloc_repair.c | 44 * Free Space Btree Repair 48 * AG. Therefore, we can recreate the free extent records in an AG by looking 53 * Because the final step of building a new index is to free the space used by 55 * structures that live in the free space (bnobt, cntbt, rmapbt, agfl) share 86 * We use the prefix 'xrep_abt' here because we regenerate both free space 106 /* Free space extents. */ 114 /* get_records()'s position in the free space record array. */ 123 /* Number of free blocks in this AG. */ 126 /* Longest free extent we found in the AG. */ 130 /* Set up to repair AG free space btrees. */ [all …]
|
| /linux/LICENSES/deprecated/ |
| H A D | GPL-1.0 | 16 Copyright (C) 1989 Free Software Foundation, Inc. 26 License is intended to guarantee your freedom to share and change free 27 software--to make sure the software is free for all its users. The 28 General Public License applies to the Free Software Foundation's 32 When we speak of free software, we are referring to freedom, not 34 sure that you have the freedom to give away or sell copies of free 36 that you can change the software or use pieces of it in new free 54 that everyone understands that there is no warranty for this free 123 years, to give any third party free (except for a nominal charge 160 7. The Free Software Foundation may publish revised and/or new versions [all …]
|
| /linux/drivers/gpu/drm/nouveau/nvif/ |
| H A D | chan.c | 80 while (chan->gpfifo.free < gpfifo_nr) { in nvif_chan_gpfifo_wait() 81 chan->gpfifo.free = chan->func->gpfifo.read_get(chan) - chan->gpfifo.cur - 1; in nvif_chan_gpfifo_wait() 82 if (chan->gpfifo.free < 0) in nvif_chan_gpfifo_wait() 83 chan->gpfifo.free += chan->gpfifo.max + 1; in nvif_chan_gpfifo_wait() 85 if (chan->gpfifo.free < gpfifo_nr) { in nvif_chan_gpfifo_wait() 105 chan->gpfifo.free = chan->gpfifo.max; in nvif_chan_gpfifo_ctor() 120 u32 free, time = 1000000; in nvif_chan_dma_wait() local 128 free = push->hw.max - cur; in nvif_chan_dma_wait() 129 if (free >= nr) in nvif_chan_dma_wait() 146 free = get - cur - 1; in nvif_chan_dma_wait() [all …]
|
| /linux/tools/usb/usbip/ |
| H A D | COPYING | 4 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 13 License is intended to guarantee your freedom to share and change free 14 software--to make sure the software is free for all its users. This 15 General Public License applies to most of the Free Software 17 using it. (Some other Free Software Foundation software is covered by 21 When we speak of free software, we are referring to freedom, not 23 have the freedom to distribute copies of free software (and charge for 26 in new free programs; and that you know you can do these things. 44 that everyone understands that there is no warranty for this free 50 Finally, any free program is threatened constantly by software [all …]
|
| /linux/include/kunit/ |
| H A D | resource.h | 28 * @free: a user supplied function to free the resource. 31 * cleaned up at the end of a test case. This cleanup is performed by the 'free' 86 kunit_resource_free_t free; member 114 if (res->free) in kunit_release_resource() 115 res->free(res); in kunit_release_resource() 117 /* 'res' is valid here, as if should_kfree is set, res->free may not free in kunit_release_resource() 131 * associated free function (if any). Only 149 * @free: a user-supplied function to free the resource (if needed). 155 kunit_resource_free_t free, 165 * @free: a user-supplied function to free the resource (if needed). [all …]
|
| /linux/scripts/coccinelle/free/ |
| H A D | kfree.cocci | 2 /// Find a use after free. 19 @free@ 32 expression free.E,E2; 55 expression free.E; 79 expression free.E, subE<=free.E, E2; 83 position free.p1!=loop.ok,p2!={print.p,sz.p}; 121 p1 << free.p1; 129 p1 << free.p1; 133 msg = "ERROR: reference preceded by free on line %s" % (p1[0].line)
|
| /linux/tools/testing/selftests/namespaces/ |
| H A D | file_handle_test.c | 47 SKIP(free(handle); close(ns_fd); in TEST() 56 SKIP(free(handle); close(ns_fd); in TEST() 61 SKIP(free(handle); close(ns_fd); in TEST() 75 free(handle); in TEST() 102 SKIP(free(handle); close(ns_fd); in TEST() 111 SKIP(free(handle); close(ns_fd); in TEST() 125 free(handle); in TEST() 152 SKIP(free(handle); close(ns_fd); in TEST() 161 SKIP(free(handle); close(ns_fd); in TEST() 175 free(handle); in TEST() [all …]
|
| /linux/LICENSES/preferred/ |
| H A D | GPL-2.0 | 23 Copyright (C) 1989, 1991 Free Software Foundation, Inc., 32 License is intended to guarantee your freedom to share and change free 33 software--to make sure the software is free for all its users. This 34 General Public License applies to most of the Free Software 36 using it. (Some other Free Software Foundation software is covered by 40 When we speak of free software, we are referring to freedom, not 42 have the freedom to distribute copies of free software (and charge for 45 in new free programs; and that you know you can do these things. 63 that everyone understands that there is no warranty for this free 69 Finally, any free program is threatened constantly by software [all …]
|
| H A D | LGPL-2.1 | 24 Copyright (C) 1991, 1999 Free Software Foundation, Inc. 38 intended to guarantee your freedom to share and change free software--to 39 make sure the software is free for all its users. 42 designated software packages--typically libraries--of the Free Software 48 When we speak of free software, we are referring to freedom of use, not 50 the freedom to distribute copies of free software (and charge for this 52 want it; that you can change the software and use pieces of it in new free 73 warranty for the free library. Also, if the library is modified by someone 79 free program. We wish to make sure that a company cannot effectively 80 restrict the users of a free program by obtaining a restrictive license [all …]
|
| H A D | LGPL-2.0 | 18 Copyright (C) 1991 Free Software Foundation, Inc. 31 intended to guarantee your freedom to share and change free software--to 32 make sure the software is free for all its users. 35 designated Free Software Foundation software, and to any other libraries 38 When we speak of free software, we are referring to freedom, not price. Our 40 to distribute copies of free software (and charge for this service if you 42 can change the software or use pieces of it in new free programs; and that 63 everyone understands that there is no warranty for this free library. If 69 Finally, any free program is threatened constantly by software patents. We 70 wish to avoid the danger that companies distributing free software will [all …]
|
| /linux/drivers/scsi/lpfc/ |
| H A D | lpfc_mem.c | 11 * This program is free software; you can redistribute it and/or * 13 * Public License as published by the Free Software Foundation. * 53 * @phba: HBA to free memory for 54 * @mbox: mailbox command to free 57 * free routine to fully release all associated memory. 228 * @phba: HBA to free memory for 230 * Description: Free the memory allocated by lpfc_mem_alloc routine. This 242 /* Free HBQ pools */ in lpfc_mem_free() 259 /* Free NLP memory pool */ in lpfc_mem_free() 267 /* Free mbox memory pool */ in lpfc_mem_free() [all …]
|
| /linux/tools/testing/selftests/cgroup/ |
| H A D | test_core.c | 133 free(cg_test); in test_cgcore_destroy() 243 free(cg_test_d); in test_cgcore_populated() 267 free(cg_test_d); in test_cgcore_populated() 268 free(cg_test_c); in test_cgcore_populated() 269 free(cg_test_b); in test_cgcore_populated() 270 free(cg_test_a); in test_cgcore_populated() 339 free(child); in test_cgcore_invalid_domain() 340 free(parent); in test_cgcore_invalid_domain() 341 free(grandparent); in test_cgcore_invalid_domain() 381 free(child); in test_cgcore_parent_becomes_threaded() [all …]
|
| /linux/kernel/trace/ |
| H A D | synth_event_gen_test.c | 70 goto free; in test_gen_synth_cmd() 76 goto free; in test_gen_synth_cmd() 80 goto free; in test_gen_synth_cmd() 84 goto free; in test_gen_synth_cmd() 88 goto free; in test_gen_synth_cmd() 123 free: in test_gen_synth_cmd() 129 goto free; in test_gen_synth_cmd() 156 goto free; in test_empty_synth_event() 162 goto free; in test_empty_synth_event() 166 goto free; in test_empty_synth_event() [all …]
|
| /linux/drivers/hid/intel-ish-hid/ishtp/ |
| H A D | dma-if.c | 59 * ishtp_cl_free_dma_buf() - Free DMA RX and TX buffer 62 * Free DMA buffer when all clients are released. This is 93 * Find and return free address of "size" bytes in dma tx buffer. 96 * Return: NULL when no free buffer else a buffer to copy 102 int i, j, free; in ishtp_cl_get_dma_send_buf() local 114 free = 1; in ishtp_cl_get_dma_send_buf() 117 free = 0; in ishtp_cl_get_dma_send_buf() 121 if (free) { in ishtp_cl_get_dma_send_buf() 131 dev_err(dev->devc, "No free DMA buffer to send msg\n"); in ishtp_cl_get_dma_send_buf() 141 * Release_dma_acked_mem - returnes the acked memory to free list. [all …]
|
| /linux/drivers/nvdimm/ |
| H A D | label.c | 101 * written to free slots. in __nd_label_validate() 323 * @free: on return set to the free label bitmap in the index 328 unsigned long **free, u32 *nslot) in preamble_index() argument 336 *free = (unsigned long *) nsindex->free; in preamble_index() 354 unsigned long **free, u32 *nslot) in preamble_current() argument 357 free, nslot); in preamble_current() 362 unsigned long **free, u32 *nslot) in preamble_next() argument 365 free, nslot); in preamble_next() 412 unsigned long *free; in nd_label_reserve_dpa() local 415 if (!preamble_current(ndd, &nsindex, &free, &nslot)) in nd_label_reserve_dpa() [all …]
|
| /linux/drivers/scsi/arm/ |
| H A D | msgqueue.c | 26 if ((mq = msgq->free) != NULL) in mqe_alloc() 27 msgq->free = mq->next; in mqe_alloc() 34 * Purpose : free a message queue entry 35 * Params : msgq - message queue to free entry from 36 * mq - message queue entry to free 41 mq->next = msgq->free; in mqe_free() 42 msgq->free = mq; in mqe_free() 56 msgq->free = &msgq->entries[0]; in msgqueue_initialise() 67 * Purpose : free a queue 68 * Params : msgq - queue to free
|
| /linux/tools/testing/selftests/mm/ |
| H A D | map_fixed_noreplace.c | 52 /* let's find a base addr that is free before we start the tests */ in main() 85 * base | free | new in main() 89 * +4 | free | new in main() 104 * base | free | in main() 108 * +4 | free | in main() 122 * base | free | in main() 126 * +4 | free | new in main() 140 * base | free | new in main() 144 * +4 | free | in main() 158 * base | free | new in main() [all …]
|