Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:fs\eventpoll.c Create Date:2022-07-28 20:19:06
Last Modify:2020-03-12 14:18:49 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

Name:p_call_nested - Perform a bound (possibly) nested call, by checking* that the recursion limit is not exceeded, and that* the same nested call (by the meaning of same cookie) is* no re-entered.

Proto:static int ep_call_nested(struct nested_calls *ncalls, int (*nproc)(void *, void *, int ), void *priv, void *cookie, void *ctx)

Type:int

Parameter:

TypeParameterName
struct nested_calls *ncalls
int (*nproc
void *priv
void *cookie
void *ctx
483  call_nests = 0
485  lsthead = tasks_call_list
489  spin_lock_irqsave( & lock, flags)
497  If ctx == ctx && ( cookie == cookie || ++call_nests > Maximum number of nesting allowed inside epoll sets ) Then
503  error = -1
504  Go to out_unlock
509  ctx = ctx
510  cookie = cookie
511  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.
513  spin_unlock_irqrestore( & lock, flags)
516  error = ( * nproc)(priv, cookie, call_nests)
519  spin_lock_irqsave( & lock, flags)
520  deletes entry from list
521  out_unlock :
522  spin_unlock_irqrestore( & lock, flags)
524  Return error
Caller
NameDescribe
reverse_path_check_proc
reverse_path_checkverse_path_check - The tfile_check_list is list of file *, which have* links that are proposed to be newly added
ep_loop_check_procp_loop_check_proc - Callback function to be passed to the @ep_call_nested()* API, to verify that adding an epoll file inside another* epoll structure, does not violate the constraints, in* terms of closed loops, or too deep chains (which can
ep_loop_checkp_loop_check - Performs a check to verify that adding an epoll file (@file)* another epoll file (represented by @ep) does not create* closed loops or too deep chains.*@ep: Pointer to the epoll private data structure.