Lines Matching refs:list

10 linked list in user space, where it can be updated efficiently as locks
15  1) a one time call, per thread, to tell the kernel where its list of
22 call, and handles contested locking by maintaining a list of waiting
29 necessary list elements exactly as the kernel expects them.  If it fails
51 setup that list.
54   pointer to a single linked list of 'lock entries', one per lock,
55   as described below.  If the list is empty, the pointer will point
67   the address of the 'lock entry', during list insertion and removal,
71 Each 'lock entry' on the single linked list starting at 'head' consists
85 'lock entry' on this list, with its associated 'lock word' at the
87 the kernel will walk this list, mark any such locks with a bit
107 linked list, but that doesn't matter to the kernel.
109 By keeping its locks linked this way, on a list starting with a 'head'
118 list 'head' is, and to walk the list on thread exit, handling locks
124 that thread's robust_futex linked lock list a given time.
131 When adding or removing a lock from its list of held locks, in order for
134 manipulating this list), the user code must observe the following
142     of the 'lock word', to the linked list starting at 'head', and
148  2) remove the lock entry for this lock from the 'head' list,
154 the list starting at 'head'.  For each such address, if the bottom 29
167 The kernel exit code will silently stop scanning the list further if at
170  1) the 'head' pointer or an subsequent linked list pointer
175  3) if the list contains more than 1 million (subject to
178 When the kernel sees a list entry whose 'lock word' doesn't have the