| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-5.10/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.
413 * removing free space to reach into this state, but to get there in test_steal_space_from_bitmap_to_extent()
414 * we need to reach a point where marking new free space doesn't in test_steal_space_from_bitmap_to_extent()
[all …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-5.10/tools/perf/util/ |
| D | parse-events.y | 49 free(list_evsel); in free_list_evsel()
92 %destructor { free ($$); } <str>
117 %destructor { free ($$.sys); free ($$.event); } <tracepoint_name>
121 %destructor { free ($$.ranges); } <array>
183 free($3);
200 free($1);
240 free($2);
256 free($1);
287 free(list); \
288 free($1); \
[all …]
|
| /kernel/linux/linux-6.6/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()
539 * FUNCTION: Free allocated space for special inode
807 * FUNCTION: free a specified inode from the inode working map
811 * free inode within the iag, the iag will be placed on
812 * the ag free inode list.
818 * will be placed on the ag extent free list if the extent
[all …]
|
| /kernel/linux/linux-5.10/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.
146 /* allocate and init iag free list lock */ in diMount()
175 * -ENOMEM - insufficient free virtual memory.
195 * free in-memory control structure in diUnmount()
541 * FUNCTION: Free allocated space for special inode
809 * FUNCTION: free a specified inode from the inode working map
813 * free inode within the iag, the iag will be placed on
814 * the ag free inode list.
820 * will be placed on the ag extent free list if the extent
[all …]
|
| /kernel/linux/linux-6.6/tools/net/ynl/generated/ |
| D | devlink-user.c | 156 free(obj->info_version_name); in devlink_dl_info_version_free()
157 free(obj->info_version_value); in devlink_dl_info_version_free()
233 free(obj->reload_stats_entry); in devlink_dl_reload_act_stats_free()
282 free(obj->reload_action_stats); in devlink_dl_reload_act_info_free()
336 free(obj->reload_action_info); in devlink_dl_reload_stats_free()
425 free(req->bus_name); in devlink_get_req_free()
426 free(req->dev_name); in devlink_get_req_free()
427 free(req); in devlink_get_req_free()
432 free(rsp->bus_name); in devlink_get_rsp_free()
433 free(rsp->dev_name); in devlink_get_rsp_free()
[all …]
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-6.6/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()
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 …]
|
| /kernel/linux/linux-6.6/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()
101 * has_enough_free_count - whether ubi has enough free pebs to fill fm pools
105 * This helper function checks whether there are enough free pebs (deducted
[all …]
|
| /kernel/linux/linux-6.6/tools/perf/util/ |
| D | parse-events.y | 53 free(list_evsel); in free_list_evsel()
83 %destructor { free ($$); } <str>
107 %destructor { free ($$.sys); free ($$.event); } <tracepoint_name>
109 %destructor { free ($$.str); } <hardware_term>
174 free($3);
234 free($2);
255 free($1);
284 free(list); \
285 free($1); \
286 free(pattern); \
[all …]
|
| /kernel/linux/linux-6.6/tools/perf/arch/riscv/util/ |
| D | header.c | 55 goto free; in _get_cpuid()
59 goto free; in _get_cpuid()
63 goto free; in _get_cpuid()
70 goto free; in _get_cpuid()
75 free: in _get_cpuid()
77 free(mvendorid); in _get_cpuid()
78 free(marchid); in _get_cpuid()
79 free(mimpid); in _get_cpuid()
91 goto free; in get_cpuid()
95 free: in get_cpuid()
[all …]
|
| /kernel/linux/linux-5.10/drivers/staging/android/ion/ |
| D | ion.h | 73 * @free: free memory
80 * error. @free will be called with ION_PRIV_FLAG_SHRINKER_FREE set in
82 * case, the pages being free'd must be truly free'd back to the
89 void (*free)(struct ion_buffer *buffer); member
125 * @free_list: free list head if deferred free is used
126 * @free_list_size size of the deferred free list in bytes
127 * @lock: protects the free list
128 * @waitqueue: queue to wait on from deferred free thread
129 * @task: task struct of deferred free thread
148 /* deferred free support */
[all …]
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-6.6/drivers/net/ethernet/mellanox/mlx5/core/esw/ |
| D | ipsec.c | 29 goto free; in esw_ipsec_vf_query_generic()
33 free: in esw_ipsec_vf_query_generic()
69 goto free; in mlx5_esw_ipsec_vf_offload_get()
76 free: in mlx5_esw_ipsec_vf_offload_get()
95 goto free; in esw_ipsec_vf_set_generic()
100 goto free; in esw_ipsec_vf_set_generic()
114 free: in esw_ipsec_vf_set_generic()
135 goto free; in esw_ipsec_vf_set_bytype()
140 goto free; in esw_ipsec_vf_set_bytype()
155 goto free; in esw_ipsec_vf_set_bytype()
[all …]
|
| /kernel/linux/linux-6.6/include/kunit/ |
| 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 …]
|
| /kernel/linux/linux-5.10/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()
101 * has_enough_free_count - whether ubi has enough free pebs to fill fm pools
105 * This helper function checks whether there are enough free pebs (deducted
[all …]
|