Home
last modified time | relevance | path

Searched full:free (Results 1 – 25 of 9113) sorted by relevance

12345678910>>...365

/linux-6.12.1/include/linux/
Dsysv_fs.h28 #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 …]
Ddevcoredump.h19 * _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-6.12.1/fs/btrfs/tests/
Dfree-space-tests.c10 #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 …]
Dfree-space-tree-tests.c10 #include "../free-space-tree.h"
37 test_err("could not find free space info"); in __check_free_space_extents()
102 test_err("free space tree is invalid"); in __check_free_space_extents()
120 test_err("could not find free space info"); in check_free_space_extents()
177 test_err("could not remove free space"); in test_remove_all()
199 test_err("could not remove free space"); in test_remove_beginning()
223 test_err("could not remove free space"); in test_remove_end()
247 test_err("could not remove free space"); in test_remove_middle()
269 test_err("could not remove free space"); in test_merge_left()
276 test_err("could not add free space"); in test_merge_left()
[all …]
/linux-6.12.1/fs/jfs/
Djfs_imap.h52 __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 …]
Djfs_imap.c50 /* 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()
542 * FUNCTION: Free allocated space for special inode
810 * FUNCTION: free a specified inode from the inode working map
814 * free inode within the iag, the iag will be placed on
815 * the ag free inode list.
821 * will be placed on the ag extent free list if the extent
[all …]
Djfs_dmap.c24 * 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.
277 /* free the memory for the in-memory bmap. */ in dbUnmount()
340 * FUNCTION: free the specified block range from the working block
343 * the blocks will be free from the working map one dmap
385 * free the blocks a dmap at a time. in dbFree()
408 /* free the blocks. */ in dbFree()
430 * FUNCTION: update the allocation state (free or allocate) of the
438 * free - 'true' if block range is to be freed from the persistent
[all …]
/linux-6.12.1/drivers/mtd/ubi/
Dfastmap-wl.c45 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) 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 * wait_free_pebs_for_pool - wait until there enough free pebs
104 * Wait and execute do_work until there are enough free pebs, fill pool
[all …]
/linux-6.12.1/fs/ubifs/
Dlprops.c30 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 …]
Dfind.c54 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 …]
Dbudget.c62 * 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-6.12.1/drivers/gpu/drm/imagination/
Dpvr_free_list.h27 * 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-6.12.1/tools/perf/util/
Dparse-events.y52 free(list_evsel); in free_list_evsel()
82 %destructor { free ($$); } <str>
106 %destructor { free ($$.sys); free ($$.event); } <tracepoint_name>
108 %destructor { free ($$.str); } <hardware_term>
146 free(groups);
157 free(group);
169 free(event);
221 free(event);
284 free($1);
304 free($1);
[all …]
/linux-6.12.1/tools/perf/arch/riscv/util/
Dheader.c55 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 …]
/linux-6.12.1/LICENSES/deprecated/
DGPL-1.016 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-6.12.1/drivers/net/ethernet/mellanox/mlx5/core/esw/
Dipsec.c29 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 …]
/linux-6.12.1/fs/xfs/scrub/
Dalloc_repair.c44 * 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-6.12.1/include/kunit/
Dresource.h28 * @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-6.12.1/LICENSES/preferred/
DGPL-2.023 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 …]
DLGPL-2.120 Copyright (C) 1991, 1999 Free Software Foundation, Inc.
34 intended to guarantee your freedom to share and change free software--to
35 make sure the software is free for all its users.
38 designated software packages--typically libraries--of the Free Software
44 When we speak of free software, we are referring to freedom of use, not
46 the freedom to distribute copies of free software (and charge for this
48 want it; that you can change the software and use pieces of it in new free
69 warranty for the free library. Also, if the library is modified by someone
75 free program. We wish to make sure that a company cannot effectively
76 restrict the users of a free program by obtaining a restrictive license
[all …]
DLGPL-2.018 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-6.12.1/tools/usb/usbip/
DCOPYING4 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-6.12.1/scripts/coccinelle/free/
Dkfree.cocci2 /// 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-6.12.1/tools/testing/selftests/cgroup/
Dtest_core.c128 free(cg_test); in test_cgcore_destroy()
234 free(cg_test_d); in test_cgcore_populated()
258 free(cg_test_d); in test_cgcore_populated()
259 free(cg_test_c); in test_cgcore_populated()
260 free(cg_test_b); in test_cgcore_populated()
261 free(cg_test_a); in test_cgcore_populated()
327 free(child); in test_cgcore_invalid_domain()
328 free(parent); in test_cgcore_invalid_domain()
329 free(grandparent); in test_cgcore_invalid_domain()
366 free(child); in test_cgcore_parent_becomes_threaded()
[all …]
/linux-6.12.1/drivers/base/
Ddevcoredump.c69 void (*free)(void *data); member
83 devcd->free(devcd->data); in devcd_dev_release()
249 * This function takes ownership of the vmalloc'ed data and will free
267 * devcd_free_sgtable - free all the memory of the given scatterlist table
272 * @data: pointer to sg_table to free
309 * the file system and free its associated data otherwise, does nothing.
328 * dev_coredumpm_timeout - create device coredump with read/free methods with a
331 * @owner: the module that contains the read/free functions, use %THIS_MODULE
332 * @data: data cookie for the @read/@free functions
336 * @free: function to free the given buffer
[all …]

12345678910>>...365