Lines Matching refs:xfarray
1945 The only code to use these folio lease functions are the xfarray
1994 The ``xfarray`` abstraction presents a linear array for fixed-size records atop
2046 Most users of the xfarray require the ability to iterate the records stored in
2062 For xfarray users that want to iterate a sparse array, the ``xfarray_iter``
2063 function ignores indices in the xfarray that have never been written to by
2085 of the records, so naturally the xfarray must also support sorting the record
2091 The sorting algorithm used in the xfarray is actually a combination of adaptive
2096 To sort records in a reasonably short amount of time, ``xfarray`` takes
2105 There are two key places where the xfarray uses it:
2109 * Loading a small number of xfarray records from potentially disparate parts
2110 of the xfarray into a memory buffer, and sorting the buffer.
2112 In other words, ``xfarray`` uses heapsort to constrain the nested recursion of
2120 The xfarray sort routine tries to avoid picking a bad pivot by sampling nine
2576 2. Append the records to an xfarray in inode order.
2585 5. Use ``xfs_btree_bload`` to write the xfarray records to btree blocks and
2618 ``xfarray_append`` to add the inode btree record to the xfarray.
2619 This xfarray is walked twice during the btree creation step -- once to populate
2622 The number of records for the inode btree is the number of xfarray records,
2624 records are stored in the xfarray.
2662 the xfarray.
2663 Any records owned by ``XFS_RMAP_OWN_COW`` are also added to the xfarray
2671 at the end of the xfarray.
2679 5. Use ``xfs_btree_bload`` to write the xfarray records to btree blocks and
2713 The bag-like structure in this case is a type 2 xfarray as discussed in the
2714 :ref:`xfarray access patterns<xfarray_access_patterns>` section.
2731 Append these records to an xfarray.
2745 6. Use ``xfs_btree_bload`` to write the xfarray records to btree blocks and
2885 2. Append the records to an xfarray.
2893 5. Use ``xfs_btree_bload`` to write the xfarray records to btree blocks and
3629 index implemented with a sparse ``xfarray``, and only writes to the real dquots
3701 filesystem, and per-file link count records are stored in a sparse ``xfarray``
3759 and use an :ref:`in-memory array <xfarray>` to store the gathered observations.
4359 If that succeeds, add the name and value to the staging xfarray and
4362 2. If the memory usage of the xfarray and xfblob exceed a certain amount of
4417 staging xfarray and xblob.
4419 3. If the memory usage of the xfarray and xfblob exceed a certain amount of
4579 an xfblob for storing entry names, and an xfarray for stashing the fixed
4591 xfblob and xfarray, respectively.
4601 dirent update in the xfblob and xfarray for later.
4604 Instead, we stash updates in the xfarray and rely on the scanner thread
4607 5. When the scan is complete, replay any stashed entries in the xfarray.
4627 an xfblob for storing parent pointer names, and an xfarray for stashing the
4639 xfblob and xfarray, respectively.
4649 update in the xfblob and xfarray for later.
4652 Instead, we stash updates in the xfarray and rely on the scanner thread
4655 5. When the scan is complete, replay any stashed entries in the xfarray.