Home
last modified time | relevance | path

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

12345678910>>...318

/openbmc/linux/include/linux/
H A 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 …]
/openbmc/linux/fs/btrfs/tests/
H A 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 …]
/openbmc/linux/fs/jfs/
H A 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 …]
H A 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 …]
/openbmc/linux/tools/net/ynl/generated/
H A Ddevlink-user.c156 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 …]
/openbmc/u-boot/fs/ubifs/
H A Dlprops.c33 return lprops->free; in get_heap_comp_val()
35 return lprops->free + lprops->dirty; in get_heap_comp_val()
50 * is either the amount of free space or the amount of dirty space, depending
88 * of free space or the amount of dirty space, depending on the category.
407 if (lprops->free == c->leb_size) { in ubifs_categorize_lprops()
412 if (lprops->free + lprops->dirty == c->leb_size) { in ubifs_categorize_lprops()
420 if (lprops->dirty + lprops->free >= c->min_idx_node_sz) in ubifs_categorize_lprops()
424 lprops->dirty > lprops->free) in ubifs_categorize_lprops()
426 if (lprops->free > 0) in ubifs_categorize_lprops()
463 * @spc: amount of free and dirty space in the LEB
[all …]
H A Dbudget.c67 * This function runs garbage collector to make some more free space. Returns
68 * zero if a free LEB has been produced, %-EAGAIN if commit is required, and a
75 /* Make some free space by garbage-collecting dirty space */ in run_gc()
108 * make_free_space - make more free space on the file-system.
112 * is supposedly no free space. But in most cases there is some free space:
114 * needed, so shrinking the liability is one way to make free space - the
116 * o GC may turn some dark space into free space (budgeting treats dark space
118 * o commit may free some LEB, i.e., turn freeable LEBs into free LEBs.
120 * So this function tries to do the above. Returns %-EAGAIN if some free space
122 * Returns %-ENOSPC if it couldn't do more free space, and other negative error
[all …]
/openbmc/linux/fs/ubifs/
H A 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 …]
H A Dfind.c54 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 …]
H A 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 …]
/openbmc/linux/drivers/mtd/ubi/
H A 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 || (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 …]
/openbmc/linux/tools/perf/util/
H A Dparse-events.y53 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 …]
/openbmc/openbmc/meta-openembedded/meta-networking/recipes-connectivity/rdist/rdist-6.1.5/
H A Drdist-6.1.5-stat64.patch25 -static long min_freespace = 0; /* Minimium free space on a filesystem */
26 -static long min_freefiles = 0; /* Minimium free # files on a filesystem */
27 +static fsblkcnt_t min_freespace = 0; /* Minimium free space on a filesystem */
28 +static fsfilcnt_t min_freefiles = 0; /* Minimium free # files on a filesystem */
40 case SC_FREEFILES: /* Minimium free files */
73 - "%s: Not enough free space on filesystem: min %d free %d",
74 + "%s: Not enough free space on filesystem: min %lld free %lld",
81 - "%s: Not enough free files on filesystem: min %d free %d",
82 + "%s: Not enough free files on filesystem: min %lld free %lld",
/openbmc/linux/tools/perf/arch/riscv/util/
H A 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 …]
/openbmc/ipmitool/lib/
H A Dipmi_kontronoem.c274 free(sn); in ipmi_kontron_set_serial_number()
280 free(sn); in ipmi_kontron_set_serial_number()
289 free(sn); in ipmi_kontron_set_serial_number()
307 free(sn); in ipmi_kontron_set_serial_number()
313 free(sn); in ipmi_kontron_set_serial_number()
324 free(sn); in ipmi_kontron_set_serial_number()
333 free(sn); in ipmi_kontron_set_serial_number()
340 free(sn); in ipmi_kontron_set_serial_number()
342 free(fru_data); in ipmi_kontron_set_serial_number()
350 free(fru_area); in ipmi_kontron_set_serial_number()
[all …]
/openbmc/openbmc/poky/meta/files/common-licenses/
H A DGPL-1.0-only7 Copyright (C) 1989 Free Software Foundation, Inc.
16 License is intended to guarantee your freedom to share and change free
17 software--to make sure the software is free for all its users. The
18 General Public License applies to the Free Software Foundation`s
22 When we speak of free software, we are referring to freedom, not
24 sure that you have the freedom to give away or sell copies of free
26 that you can change the software or use pieces of it in new free
44 that everyone understands that there is no warranty for this free
113 years, to give any third party free (except for a nominal charge
150 7. The Free Software Foundation may publish revised and/or new versions
[all …]
H A DGPL-1.0-or-later5 Copyright (C) 1989 Free Software Foundation, Inc. 51 Franklin St, Fifth Floor,
15 to guarantee your freedom to share and change free software--to make sure
16 the software is free for all its users. The General Public License applies
17 to the Free Software Foundation's software and to any other program whose
20 When we speak of free software, we are referring to freedom, not price. Specifically,
22 to give away or sell copies of free software, that you receive source code
24 of it in new free programs; and that you know you can do these things.
41 everyone understands that there is no warranty for this free software. If
103 any third party free (except for a nominal charge for the cost of distribution)
137 7. The Free Software Foundation may publish revised and/or new versions of
[all …]
H A DGPL-2.0-only6 Copyright (C) 1989, 1991 Free Software Foundation, Inc.
13 …free software--to make sure the software is free for all its users. This General Public License ap…
15 …free software, we are referring to freedom, not price. Our General Public Licenses are designed to…
23 …make certain that everyone understands that there is no warranty for this free software. If the so…
25 …free program is threatened constantly by software patents. We wish to avoid the danger that redist…
65 …Program at all. For example, if a patent license would not permit royalty-free redistribution of t…
69 …ims; this section has the sole purpose of protecting the integrity of the free software distributi…
75 9. The Free Software Foundation may publish revised and/or new versions of the General Public Licen…
77 …the Free Software Foundation. If the Program does not specify a version number of this License, yo…
79 …free programs whose distribution conditions are different, write to the author to ask for permissi…
[all …]
H A DGPL-2.0-with-Linux-syscall-note5 Copyright (C) 1989, 1991 Free Software Foundation, Inc.
14 License is intended to guarantee your freedom to share and change free
15 software--to make sure the software is free for all its users. This
16 General Public License applies to most of the Free Software
18 using it. (Some other Free Software Foundation software is covered by
22 When we speak of free software, we are referring to freedom, not
24 have the freedom to distribute copies of free software (and charge for
27 in new free programs; and that you know you can do these things.
45 that everyone understands that there is no warranty for this free
51 Finally, any free program is threatened constantly by software
[all …]
/openbmc/linux/LICENSES/deprecated/
H A 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 …]
/openbmc/qemu/tests/qtest/libqos/
H A Dlibqos-malloc.c139 QTAILQ_REMOVE(s->free, freenode, MLIST_ENTNAME); in mlist_fulfill()
142 /* adjust the free node and create a new used node */ in mlist_fulfill()
160 QTAILQ_FOREACH(node, s->free, MLIST_ENTNAME) { in mlist_check()
181 node = mlist_find_space(s->free, size); in mlist_alloc()
205 /* Rip it out of the used list and re-insert back into the free list. */ in mlist_free()
207 mlist_sort_insert(s->free, node); in mlist_free()
208 mlist_coalesce(s->free, node); in mlist_free()
237 QTAILQ_FOREACH_SAFE(node, allocator->free, MLIST_ENTNAME, tmp) { in alloc_destroy()
241 fprintf(stderr, "Free list is corrupted.\n"); in alloc_destroy()
250 g_free(allocator->free); in alloc_destroy()
[all …]
/openbmc/linux/drivers/net/ethernet/mellanox/mlx5/core/esw/
H A 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 …]
/openbmc/linux/include/kunit/
H A 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 …]
/openbmc/linux/scripts/coccinelle/free/
H A 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)
/openbmc/phosphor-mboxd/test/
H A Dcopy_flash.c44 goto free; in main()
50 goto free; in main()
55 goto free; in main()
60 goto free; in main()
66 goto free; in main()
74 free: in main()
75 free(src); in main()
76 free(dst); in main()

12345678910>>...318