Lines Matching refs:segment

24 The folio_queue struct forms a single segment in a segmented list of folios
37 segments on either side of the segment being accessed.  Whilst this is a
41 Each segment in the list also stores:
62 A segment should be initialised by calling::
66 with a pointer to the segment to be initialised.  Note that this will not
74 Folios can be set in the next unused slot in a segment struct by calling one
123 Information may be retrieved about a particular segment with the following
132 The first function returns the maximum capacity of a segment.  It must not be
135 segment has been filled to capacity.
138 segment.  These are more about indicating how many slots in the array have been
139 initialised, and it assumed that slots won't get reused, but rather the segment
183 This may be told to start at a particular segment, slot and offset within a
197 last segment is reached and the folios it refers to are entirely consumed by
198 the IOV iterators, an iov_iter struct will be left pointing to the last segment
199 with a slot number equal to the capacity of that segment.  The iterator will
200 try to continue on from this if there's another segment available when it is
201 used again, but care must be taken lest the segment got removed and freed by
204 It is recommended that the queue always contain at least one segment, even if
205 that segment has never been filled or is entirely spent.  This prevents the