Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:mm\z3fold.c Create Date:2022-07-28 16:30:22
Last Modify:2020-03-12 14:18:49 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

Name:z3fold_reclaim_page() - evicts allocations from a pool page and frees it*@pool: pool from which a page will attempt to be evicted*@retries: number of pages on the LRU list for which eviction will* be attempted before failing* z3fold reclaim is different

Proto:static int z3fold_reclaim_page(struct z3fold_pool *pool, unsigned int retries)

Type:int

Parameter:

TypeParameterName
struct z3fold_pool *pool
unsigned intretries
1341  ret = -1
1342  struct z3fold_header * zhdr = NULL
1343  struct page * page = NULL
1345  first_handle = 0 , middle_handle = 0 , last_handle = 0
1347  spin_lock( & lock)
1348  If Not ops || Not evict || retries == 0 Then
1349  spin_unlock( & lock)
1350  Return -EINVAL
1352  When i < retries cycle
1353  If list_empty - tests whether a list is empty*@head: the list to test. Then
1354  spin_unlock( & lock)
1355  Return -EINVAL
1358  page = list_entry - get the struct for this entry*@ptr: the &struct list_head pointer.*@type: the type of the struct this is embedded in.*@member: the name of the list_head within the struct.(pos, structpage, lru)
1363  If st_and_set_bit - Set a bit and return its old value*@nr: Bit to set*@addr: Address to count from* This is an atomic fully-ordered operation (implied full memory barrier). Then
1364  page = NULL
1365  Continue
1368  If Value for the false possibility is greater at compile time(PageIsolated(page)) Then
1373  zhdr = page_address(page)
1374  If st_bit - Determine whether a bit is set*@nr: bit number to test*@addr: Address to start counting from Then Break
1377  If Not Try to lock a z3fold page Then
1382  If foreign_handles Then
1388  kref_get - increment refcount for object.*@kref: object.
1389  list_del_init - deletes entry from list and reinitialize it.*@entry: the element to delete from the list.
1390  cpu = -1
1391  Break
1394  If Not zhdr Then Break
1397  list_del_init - deletes entry from list and reinitialize it.*@entry: the element to delete from the list.
1398  spin_unlock( & lock)
1400  If Not st_bit - Determine whether a bit is set*@nr: bit number to test*@addr: Address to start counting from Then
1407  first_handle = 0
1408  last_handle = 0
1409  middle_handle = 0
1410  If first_chunks Then first_handle = encode_handle(zhdr, FIRST)
1412  If middle_chunks Then middle_handle = encode_handle(zhdr, MIDDLE)
1414  If last_chunks Then last_handle = encode_handle(zhdr, LAST)
1420  Unlock a z3fold page
1421  Else
1422  first_handle = encode_handle(zhdr, HEADLESS)
1423  last_handle = middle_handle = 0
1426  If middle_handle Then
1427  ret = evict(pool, middle_handle)
1428  If ret Then Go to next
1430  free_handle(middle_handle)
1432  If first_handle Then
1433  ret = evict(pool, first_handle)
1434  If ret Then Go to next
1436  free_handle(first_handle)
1438  If last_handle Then
1439  ret = evict(pool, last_handle)
1440  If ret Then Go to next
1442  free_handle(last_handle)
1444  :
1445  If st_bit - Determine whether a bit is set*@nr: bit number to test*@addr: Address to start counting from Then
1446  If ret == 0 Then
1451  spin_lock( & lock)
1452  list_add - add a new entry*@new: new entry to be added*@head: list head to add it after* Insert a new entry after the specified head.* This is good for implementing stacks.
1453  spin_unlock( & lock)
1454  lear_bit - Clears a bit in memory*@nr: Bit to clear*@addr: Address to start counting from* This is a relaxed atomic operation (no implied memory barriers).
1455  Else
1456  Lock a z3fold page
1457  If kref_put - decrement refcount for object.*@kref: object.*@release: pointer to the function that will clean up the object when the* last reference to the object is released.* This pointer is required, and it is not acceptable to pass kfree Then
1459  atomic64_dec( & pages_nr)
1460  Return 0
1467  spin_lock( & lock)
1468  list_add - add a new entry*@new: new entry to be added*@head: list head to add it after* Insert a new entry after the specified head.* This is good for implementing stacks.
1469  spin_unlock( & lock)
1470  Unlock a z3fold page
1471  lear_bit - Clears a bit in memory*@nr: Bit to clear*@addr: Address to start counting from* This is a relaxed atomic operation (no implied memory barriers).
1475  spin_lock( & lock)
1477  spin_unlock( & lock)
1478  Return -EAGAIN
Caller
NameDescribe
z3fold_zpool_shrink