Searched refs:slabs (Results 1 - 6 of 6) sorted by relevance

/linux-master/tools/mm/
H A Dslabinfo.c3 * Slabinfo: Tool to get reports about slabs
36 unsigned long partial, objects, slabs, objects_partial, objects_total; member in struct:slabinfo
57 int slabs; variable
116 "-A|--activity Most active slabs first\n"
119 "-e|--empty Show empty slabs\n"
123 "-l|--slabs Show slabs\n"
126 "-N|--lines=K Show the first K slabs\n"
128 "-P|--partial Sort by number of partial slabs\n"
129 "-r|--report Detailed report on single slabs\
[all...]
H A Dslabinfo-gnuplot.sh14 # and generate graphs (totals, slabs sorted by size, slabs sorted
36 echo "-l - plot slabs stats for FILE(s)"
151 out=`basename "$in"`"-slabs-by-loss"
160 out=`basename "$in"`"-slabs-by-size"
187 mode=slabs
232 slabs)
258 slabs)
/linux-master/drivers/md/dm-vdo/
H A Dslab-depot.h28 * A slab_depot is responsible for managing all of the slabs and block allocators of a VDO. It has
29 * a single array of slabs in order to eliminate the need for additional math in order to compute
33 * slabs assigned to that zone. The concurrency guarantees of this single-threaded model allow the
275 /* The queue of slabs to scrub first */
277 /* The queue of slabs to scrub once there are no high_priority_slabs */
278 struct list_head slabs; member in struct:slab_scrubber
283 * The number of slabs that are unrecovered or being scrubbed. This field is modified by
290 /* Whether to only scrub high-priority slabs */
298 /* A sub-structure for applying actions in parallel to all an allocator's slabs. */
300 /* The number of slabs performin
308 struct vdo_slab **slabs; member in struct:slab_iterator
475 struct vdo_slab **slabs; member in struct:slab_depot
[all...]
H A Dslab-depot.c207 * theoretically slabs could contain precisely 2^23 blocks; there is an assumption that at least
1340 * Wholly full slabs must be the only ones with lowest priority, 0.
1343 * have lower priority than previously opened slabs that have a significant number of free
1351 * For all other slabs, the priority is derived from the logarithm of the number of free
1369 * so slabs with lots of free blocks will be opened for allocation before slabs that have few free
1897 /* Unit tests have slabs with only one reference block (and it's a runt). */
2540 list_add_tail(&slab->allocq_entry, &scrubber->slabs);
2640 return list_first_entry_or_null(&scrubber->slabs, struct vdo_slab,
2645 * has_slabs_to_scrub() - Check whether a scrubber has slabs t
3022 struct vdo_slab **slabs = depot->slabs; local
[all...]
/linux-master/mm/
H A Dslub.c7 * and only uses a centralized lock to manage a pool of partial slabs.
61 * The role of the slab_mutex is to protect the list of all the slabs
78 * Frozen slabs
88 * CPU partial slabs
90 * The partially empty slabs cached on the CPU partial list are used
92 * These slabs are not frozen, but are also exempt from list management,
105 * the partial slab counter. If taken then no new slabs may be added or
106 * removed from the lists nor make the number of partial slabs be modified.
107 * (Note that the total number of slabs is an atomic value that may be
112 * slabs, operation
1621 parse_slub_debug_flags(char *str, slab_flags_t *flags, char **slabs, bool init) argument
2951 int slabs = 0; local
6233 int slabs = 0; local
6310 SLAB_ATTR_RO(slabs); variable
[all...]
H A Dslab.h63 int slabs; /* Nr of slabs left */ member in struct:slab::__anon2916::__anon2917::__anon2918::__anon2919
255 /* Used for retrieving partial slabs, etc. */
265 /* Number of per cpu partial slabs to keep around */
270 /* Allocation and freeing of slabs */

Completed in 382 milliseconds