| /Linux-v5.15/include/linux/ |
| D | sysv_fs.h | 28 #define XENIX_NICFREE 100 /* number of free block list chunk entries */
32 /* the start of the free block list: */
33 __fs16 s_nfree; /* number of free blocks in s_free, <= XENIX_NICFREE */
34 sysv_zone_t s_free[XENIX_NICFREE]; /* first free block list chunk */
35 /* the cache of free inodes: */
36 __fs16 s_ninode; /* number of free inodes in s_inode, <= XENIX_NICINOD */
37 sysv_ino_t s_inode[XENIX_NICINOD]; /* some free inodes */
39 char s_flock; /* lock during free block list manipulation */
44 __fs32 s_tfree __packed2__; /* total number of free zones */
45 __fs16 s_tinode; /* total number of free inodes */
[all …]
|
| D | devcoredump.h | 16 * _devcd_free_sgtable - free all the memory of the given scatterlist table
20 * @table: pointer to sg_table to free
29 /* free pages */ in _devcd_free_sgtable()
37 /* then free all chained tables */ in _devcd_free_sgtable()
49 /* free the last table */ in _devcd_free_sgtable()
62 void (*free)(void *data));
78 void (*free)(void *data)) in dev_coredumpm()
80 free(data); in dev_coredumpm()
|
| /Linux-v5.15/fs/btrfs/tests/ |
| D | free-space-tests.c | 10 #include "../free-space-cache.h"
168 * bitmap, but the free space completely in the extent and then in test_bitmaps_and_extents()
285 test_err("failed to free our space %d", ret); in test_bitmaps_and_extents()
297 * This blew up before, we have part of the free space in a bitmap and in test_bitmaps_and_extents()
359 * Now lets confirm that there's absolutely no free space left to in check_cache_empty()
363 test_err("cache free space is not 0"); in check_cache_empty()
381 * Before we were able to steal free space from a bitmap entry to an extent
382 * entry, we could end up with 2 entries representing a contiguous free space.
412 * removing free space to reach into this state, but to get there in test_steal_space_from_bitmap_to_extent()
413 * we need to reach a point where marking new free space doesn't in test_steal_space_from_bitmap_to_extent()
[all …]
|
| D | free-space-tree-tests.c | 10 #include "../free-space-tree.h"
36 test_err("could not find free space info"); in __check_free_space_extents()
101 test_err("free space tree is invalid"); in __check_free_space_extents()
119 test_err("could not find free space info"); in check_free_space_extents()
176 test_err("could not remove free space"); in test_remove_all()
198 test_err("could not remove free space"); in test_remove_beginning()
222 test_err("could not remove free space"); in test_remove_end()
246 test_err("could not remove free space"); in test_remove_middle()
268 test_err("could not remove free space"); in test_merge_left()
275 test_err("could not add free space"); in test_merge_left()
[all …]
|
| /Linux-v5.15/tools/perf/util/ |
| D | parse-events.y | 49 free(list_evsel); in free_list_evsel()
93 %destructor { free ($$); } <str>
118 %destructor { free ($$.sys); free ($$.event); } <tracepoint_name>
122 %destructor { free ($$.ranges); } <array>
184 free($3);
201 free($1);
241 free($2);
257 free($1);
291 free(list); \
292 free($1); \
[all …]
|
| D | expr.c | 79 free(data_ptr); in expr__add_id()
80 free(old_key); in expr__add_id()
81 free(old_data); in expr__add_id()
101 free(data_ptr); in expr__add_id_val()
102 free(old_key); in expr__add_id_val()
103 free(old_data); in expr__add_id_val()
120 free(data_ptr); in expr__add_ref()
146 free(data_ptr); in expr__add_ref()
151 free(old_key); in expr__add_ref()
152 free(old_data); in expr__add_ref()
[all …]
|
| /Linux-v5.15/fs/jfs/ |
| 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 …]
|
| D | jfs_imap.c | 50 /* iag free list lock */
91 * -ENOMEM - insufficient free virtual memory.
144 /* allocate and init iag free list lock */ in diMount()
173 * -ENOMEM - insufficient free virtual memory.
193 * free in-memory control structure in diUnmount()
538 * FUNCTION: Free allocated space for special inode
806 * FUNCTION: free a specified inode from the inode working map
810 * free inode within the iag, the iag will be placed on
811 * the ag free inode list.
817 * will be placed on the ag extent free list if the extent
[all …]
|
| D | jfs_dmap.c | 24 * 1) allocation and free requests that start at the dmap
48 * free block count, allocation group level free block counts).
115 * binary buddy of free bits within the character.
241 /* free the memory for the in-memory bmap. */ in dbUnmount()
303 * FUNCTION: free the specified block range from the working block
306 * the blocks will be free from the working map one dmap
348 * free the blocks a dmap at a time. in dbFree()
371 /* free the blocks. */ in dbFree()
392 * FUNCTION: update the allocation state (free or allocate) of the
400 * free - 'true' if block range is to be freed from the persistent
[all …]
|
| /Linux-v5.15/fs/ubifs/ |
| 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 …]
|
| D | find.c | 54 if (lprops->free + lprops->dirty >= c->dark_wm) in valuable()
96 if (lprops->free + lprops->dirty < data->min_space) in scan_for_dirty_cb()
102 if (lprops->free + lprops->dirty == c->leb_size) { in scan_for_dirty_cb()
114 * scan_for_dirty - find a data LEB with free space.
116 * @min_space: minimum amount free plus dirty space the returned LEB has to
118 * @pick_free: if it is OK to return a free or freeable LEB
133 /* There may be an LEB with enough dirty space on the free heap */ in scan_for_dirty()
137 if (lprops->free + lprops->dirty < min_space) in scan_for_dirty()
153 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 …]
|
| 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()
103 * make_free_space - make more free space on the file-system.
107 * is supposedly no free space. But in most cases there is some free space:
109 * needed, so shrinking the liability is one way to make free space - the
111 * o GC may turn some dark space into free space (budgeting treats dark space
113 * o commit may free some LEB, i.e., turn freeable LEBs into free LEBs.
115 * So this function tries to do the above. Returns %-EAGAIN if some free space
117 * Returns %-ENOSPC if it couldn't do more free space, and other negative error
[all …]
|
| /Linux-v5.15/fs/xfs/ |
| D | xfs_extfree_item.c | 137 * constructed and thus we free the EFI here directly.
297 * the transaction is cancelled, drop our reference to the EFI and free the EFD.
317 * Allocate an "extent free done" log item that will hold nextents worth of
351 * Free an extent and log it to the EFD. Note that the transaction is marked
352 * dirty regardless of whether the extent free succeeds or fails to support the
413 /* Log a free extent to the intent item. */
418 struct xfs_extent_free_item *free) in xfs_extent_free_log_item() argument
434 extp->ext_start = free->xefi_startblock; in xfs_extent_free_log_item()
435 extp->ext_len = free->xefi_blockcount; in xfs_extent_free_log_item()
447 struct xfs_extent_free_item *free; in xfs_extent_free_create_intent() local
[all …]
|
| /Linux-v5.15/drivers/base/ |
| D | devcoredump.c | 31 void (*free)(void *data); member
45 devcd->free(devcd->data); in devcd_dev_release()
178 * This function takes ownership of the vmalloc'ed data and will free
196 * devcd_free_sgtable - free all the memory of the given scatterlist table
201 * @data: pointer to sg_table to free
234 * dev_coredumpm - create device coredump with read/free methods
236 * @owner: the module that contains the read/free functions, use %THIS_MODULE
237 * @data: data cookie for the @read/@free functions
241 * @free: function to free the given buffer
245 * by the device coredump framework and when it is no longer needed the @free
[all …]
|
| /Linux-v5.15/LICENSES/deprecated/ |
| D | GPL-1.0 | 16 Copyright (C) 1989 Free Software Foundation, Inc.
25 License is intended to guarantee your freedom to share and change free
26 software--to make sure the software is free for all its users. The
27 General Public License applies to the Free Software Foundation's
31 When we speak of free software, we are referring to freedom, not
33 sure that you have the freedom to give away or sell copies of free
35 that you can change the software or use pieces of it in new free
53 that everyone understands that there is no warranty for this free
122 years, to give any third party free (except for a nominal charge
159 7. The Free Software Foundation may publish revised and/or new versions
[all …]
|
| /Linux-v5.15/scripts/coccinelle/free/ |
| 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-v5.15/LICENSES/preferred/ |
| 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 …]
|
| D | LGPL-2.1 | 18 Copyright (C) 1991, 1999 Free Software Foundation, Inc.
32 intended to guarantee your freedom to share and change free software--to
33 make sure the software is free for all its users.
36 designated software packages--typically libraries--of the Free Software
42 When we speak of free software, we are referring to freedom of use, not
44 the freedom to distribute copies of free software (and charge for this
46 want it; that you can change the software and use pieces of it in new free
67 warranty for the free library. Also, if the library is modified by someone
73 free program. We wish to make sure that a company cannot effectively
74 restrict the users of a free program by obtaining a restrictive license
[all …]
|
| 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-v5.15/tools/usb/usbip/ |
| 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-v5.15/tools/iio/ |
| D | iio_utils.c | 49 free(current); in iioutils_break_up_name()
66 free(current); in iioutils_break_up_name()
174 free(filename); in iioutils_get_type()
192 free(filename); in iioutils_get_type()
199 free(builtname_generic); in iioutils_get_type()
201 free(builtname); in iioutils_get_type()
203 free(scan_el_dir); in iioutils_get_type()
271 free(filename); in iioutils_get_param_float()
278 free(builtname_generic); in iioutils_get_param_float()
280 free(builtname); in iioutils_get_param_float()
[all …]
|
| /Linux-v5.15/drivers/mtd/ubi/ |
| D | fastmap-wl.c | 45 wl_tree_add(e, &ubi->free); in return_unused_peb()
50 * return_unused_pool_pebs - returns unused PEB to the free tree.
79 if (!ubi->free.rb_node || (ubi->free_count - ubi->beb_rsvd_pebs < 1)) in ubi_wl_get_fm_peb()
83 e = find_anchor_wl_entry(&ubi->free); in ubi_wl_get_fm_peb()
85 e = find_mean_wl_entry(ubi, &ubi->free); in ubi_wl_get_fm_peb()
90 self_check_in_wl_tree(ubi, e, &ubi->free); in ubi_wl_get_fm_peb()
92 /* remove it from the free list, in ubi_wl_get_fm_peb()
94 rb_erase(&e->u.rb, &ubi->free); in ubi_wl_get_fm_peb()
120 wl_tree_add(ubi->fm_anchor, &ubi->free); in ubi_refill_pools()
124 wl_tree_add(ubi->fm_next_anchor, &ubi->free); in ubi_refill_pools()
[all …]
|
| /Linux-v5.15/Documentation/driver-api/nvdimm/ |
| D | btt.rst | 110 nfree The number of free blocks that are maintained at any given time.
127 i.e. Every write goes to a "free" block. A running list of free blocks is
129 "free list" and "log". The flog contains 'nfree' entries, and an entry contains:
134 free block.
173 writes. We can hit a condition where the writer thread grabs a free block to do
179 into the list of free blocks. If another write comes in for the same LBA, it can
180 grab this free block, and start writing to it, causing the reader to read
185 read is complete. Every writer thread, after grabbing a free block, checks the
186 RTT for its presence. If the postmap free block is in the RTT, it waits till the
196 free[lane] = map[premap_aba]
[all …]
|
| /Linux-v5.15/Documentation/vm/ |
| D | balance.rst | 23 is, only when needed (aka zone free memory is 0), instead of making it
30 OTOH, if there is a lot of free dma pages, it is preferable to satisfy
35 _total_ number of free pages fell below 1/64 th of total memory. With the
44 at init time how many free pages we should aim for while balancing any
51 Another possible solution is that we balance only when the free memory
57 fancy, we could assign different weights to free pages in different
61 it becomes less significant to consider the free dma pages while
89 low_on_memory gets set. This stays set till the number of free pages becomes
91 try to free some pages in the zone (providing GFP_WAIT is set in the request).
92 Orthogonal to this, is the decision to poke kswapd to free some zone pages.
[all …]
|
| /Linux-v5.15/drivers/hid/intel-ish-hid/ishtp/ |
| 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
109 free = 1; in ishtp_cl_get_dma_send_buf()
112 free = 0; in ishtp_cl_get_dma_send_buf()
116 if (free) { in ishtp_cl_get_dma_send_buf()
126 dev_err(dev->devc, "No free DMA buffer to send msg\n"); in ishtp_cl_get_dma_send_buf()
136 * Release_dma_acked_mem - returnes the acked memory to free list.
[all …]
|
