Lines Matching refs:be
17 the eviction algorithm is invoked to select a data page to be paged out,
18 thus freeing up a page frame for new data to be paged in. If this data
19 page has been modified after it is first paged in, the data will be
28 There are functions where paging in and out can be invoked manually
30 :c:func:`k_mem_page_in()` can be used to page in data pages
33 memory, and thus minimizing latency. :c:func:`k_mem_page_out()` can be
34 used to page out data pages where they are not going to be accessed for
36 page in can be executed faster as the paging code does not need to invoke
44 or be paged out to some backing store. Its location can always be looked
46 The data type will always be ``void *`` or in some cases ``uint8_t *``
51 container where a data page may be placed. It is always referred to by
58 meaningful and they must not be modified.
61 and should never be paged out.
64 and should not be used at all.
80 scratch needs to be mapped read/write for backing store code to access.
81 However the data page itself may only be mapped as read-only in virtual
83 the data page must be re-mapped as read/write which has security
90 Paging statistics can be obtained via various function calls when
98 * Execution time histogram can be obtained when
105 be defined for a particular application.
120 corresponding page frame can be paged out to free up a page frame
132 pinned, gets unmapped or is about to be evicted.
160 and :c:func:`k_mem_paging_eviction_select()` must be implemented.
162 these additional functions must also be implemented,
171 which must be implemented:
177 reserve a backing store location so a data page can be paged out.
184 then be used for subsequent page out operation.
187 the ``location`` token corresponding to storage content to be virtually
201 struct may be updated for internal accounting. This can be
205 must be implemented.
206 :c:func:`k_mem_paging_backing_store_page_finalize()` can be an empty