Lines Matching full:list

12 linked list in user space, where it can be updated efficiently as locks
17  1) a one time call, per thread, to tell the kernel where its list of
24 call, and handles contested locking by maintaining a list of waiting
31 necessary list elements exactly as the kernel expects them.  If it fails
53 setup that list.
56   pointer to a single linked list of 'lock entries', one per lock,
57   as described below.  If the list is empty, the pointer will point
69   the address of the 'lock entry', during list insertion and removal,
73 Each 'lock entry' on the single linked list starting at 'head' consists
87 'lock entry' on this list, with its associated 'lock word' at the
89 the kernel will walk this list, mark any such locks with a bit
109 linked list, but that doesn't matter to the kernel.
111 By keeping its locks linked this way, on a list starting with a 'head'
120 list 'head' is, and to walk the list on thread exit, handling locks
126 that thread's robust_futex linked lock list a given time.
133 When adding or removing a lock from its list of held locks, in order for
136 manipulating this list), the user code must observe the following
145     of the 'lock word', to the linked list starting at 'head', and
152  2) remove the lock entry for this lock from the 'head' list,
158 the list starting at 'head'.  For each such address, if the bottom 30
171 The kernel exit code will silently stop scanning the list further if at
174  1) the 'head' pointer or an subsequent linked list pointer
179  3) if the list contains more than 1 million (subject to
182 When the kernel sees a list entry whose 'lock word' doesn't have the