Home
last modified time | relevance | path

Searched refs:xfarray (Results 1 – 21 of 21) sorted by relevance

/linux/fs/xfs/scrub/
H A Dxfarray.h20 struct xfarray { struct
41 size_t obj_size, struct xfarray **arrayp); argument
42 void xfarray_destroy(struct xfarray *array);
43 int xfarray_load(struct xfarray *array, xfarray_idx_t idx, void *ptr);
44 int xfarray_unset(struct xfarray *array, xfarray_idx_t idx);
45 int xfarray_store(struct xfarray *array, xfarray_idx_t idx, const void *ptr);
46 int xfarray_store_anywhere(struct xfarray *array, const void *ptr);
47 bool xfarray_element_is_null(struct xfarray *array, const void *ptr);
48 void xfarray_truncate(struct xfarray *array);
49 unsigned long long xfarray_bytes(struct xfarray *array);
[all …]
H A Dxfarray.c36 static inline void *xfarray_scratch(struct xfarray *array) in xfarray_scratch()
44 struct xfarray *array, in xfarray_idx()
54 static inline loff_t xfarray_pos(struct xfarray *array, xfarray_idx_t idx) in xfarray_pos()
74 struct xfarray **arrayp) in xfarray_create()
76 struct xfarray *array; in xfarray_create()
87 array = kzalloc(sizeof(struct xfarray) + obj_size, XCHK_GFP_FLAGS); in xfarray_create()
123 struct xfarray *array) in xfarray_destroy()
132 struct xfarray *array, in xfarray_load()
146 struct xfarray *array, in xfarray_is_unset()
168 struct xfarray *array, in xfarray_unset()
[all …]
H A Dquotacheck.h41 struct xfarray *ucounts;
42 struct xfarray *gcounts;
43 struct xfarray *pcounts;
58 static inline struct xfarray *
H A Dquotacheck_repair.c50 struct xfarray *counts = xqcheck_counters_for(xqc, dqtype); in xqcheck_commit_dquot()
135 struct xfarray *counts = xqcheck_counters_for(xqc, dqtype); in xqcheck_commit_dqtype()
H A Dquotacheck.c130 struct xfarray *counts, in xqcheck_update_incore_counts()
322 struct xfarray *counts; in xqcheck_apply_live_dqtrx()
558 struct xfarray *counts = xqcheck_counters_for(xqc, dqtype); in xqcheck_compare_dquot()
616 struct xfarray *counts = xqcheck_counters_for(xqc, dqtype); in xqcheck_walk_observations()
H A Dnlinks.h14 struct xfarray *nlinks;
H A Ddirtree.h132 struct xfarray *path_steps;
H A Dparent_repair.c110 struct xfarray *pptr_recs;
116 struct xfarray *xattr_records;
H A Drefcount_repair.c104 struct xfarray *refcount_records;
H A Drtrefcount_repair.c109 struct xfarray *refcount_records;
H A Dattr_repair.c92 struct xfarray *xattr_records;
110 struct xfarray *pptr_recs;
H A Dalloc_repair.c107 struct xfarray *free_records;
H A Dialloc_repair.c110 struct xfarray *inode_records;
H A Dparent.c253 struct xfarray *pptr_entries;
H A Dagheader_repair.c828 struct xfarray *iunlink_next;
831 struct xfarray *iunlink_prev;
H A Dbmap_repair.c70 struct xfarray *bmap_records;
H A Ddir.c70 struct xfarray *dir_entries;
H A Ddir_repair.c122 struct xfarray *dir_entries;
H A Dtrace.h23 struct xfarray;
1042 TP_PROTO(struct xfarray *xfa, unsigned long long required_capacity),
/linux/Documentation/filesystems/xfs/
H A Dxfs-online-fsck-design.rst1904 The only code to use these folio lease functions are the xfarray
1953 The ``xfarray`` abstraction presents a linear array for fixed-size records atop
2001 Most users of the xfarray require the ability to iterate the records stored in
2017 For xfarray users that want to iterate a sparse array, the ``xfarray_iter``
2018 function ignores indices in the xfarray that have never been written to by
2040 of the records, so naturally the xfarray must also support sorting the record
2046 The sorting algorithm used in the xfarray is actually a combination of adaptive
2051 To sort records in a reasonably short amount of time, ``xfarray`` takes
2060 There are two key places where the xfarray uses it:
2064 * Loading a small number of xfarray records from potentially disparate parts
[all …]
/linux/fs/xfs/
H A DMakefile195 xfarray.o \