Query: page_cache_prev_hole
OS: centos
Section: 9
Format: Original Unix Latex Style Formatted with HTML and a Horizontal Scroll Bar
PAGE_CACHE_PREV_HOLE(9) Memory Management in Linux PAGE_CACHE_PREV_HOLE(9)NAMEpage_cache_prev_hole - find the prev hole (not-present entry)SYNOPSISpgoff_t page_cache_prev_hole(struct address_space * mapping, pgoff_t index, unsigned long max_scan);ARGUMENTSmapping mapping index index max_scan maximum range to searchDESCRIPTIONSearch backwards in the range [max(index-max_scan+1, 0), index] for the first hole.RETURNSthe index of the hole if found, otherwise returns an index outside of the set specified (in which case 'index - return >= max_scan' will be true). In rare cases of wrap-around, ULONG_MAX will be returned. page_cache_prev_hole may be called under rcu_read_lock. However, like radix_tree_gang_lookup, this will not atomically search a snapshot of the tree at a single point in time. For example, if a hole is created at index 10, then subsequently a hole is created at index 5, page_cache_prev_hole covering both indexes may return 5 if called under rcu_read_lock.COPYRIGHTKernel Hackers Manual 3.10 June 2014 PAGE_CACHE_PREV_HOLE(9)
Related Man Pages |
---|
mpage_readpages(9) - centos |
xpc_array_apply(3) - osx |
xpc_array_get_date(3) - osx |
xpc_array_get_string(3) - osx |
xpc_array_get_uint64(3) - osx |
Similar Topics in the Unix Linux Community |
---|
Is UNIX an open source OS ? |
How to increment version inside a file? |
DB2 convert digits to binary format |
CentOS7 restoring file capabilities |
Please Welcome Dave Munro to the Moderator Team! |