lock_two_nondirectories – take two i_mutexes on non-directory objects Synopsis void lock_two_nondirectories(struct inode *inode1, struct inode *inode2); Arguments inode1 first inode to lock inode2 second inode to lock Description Lock any non-NULL argument that is not a directory. Zero, one or two objects may be locked by this function. Copyright
lock_sock_fast – fast version of lock_sock Synopsis bool lock_sock_fast(struct sock * sk); Arguments sk socket Description This version should be used for very small section, where process wont block return false if fast path is taken sk_lock.slock locked, owned = 0, BH disabled return true if slow path is taken sk_lock.slock unlocked, owned = 1, BH enabled…
ll_rw_block – level access to block devices (DEPRECATED) Synopsis void ll_rw_block(int op, int op_flags, int nr, struct buffer_head *bhs[]); Arguments op whether to READ or WRITE op_flags rq_flag_bits nr number of struct buffer_heads in the array bhs[] array of pointers to struct buffer_head Description ll_rw_block takes an array of pointers to struct buffer_heads, and requests…
list_splice_tail_init – join two lists and reinitialise the emptied list Synopsis void list_splice_tail_init(struct list_head *list, struct list_head *head); Arguments list the new list to add. head the place to add it in the first list. Description Each of the lists is a queue. The list at list is reinitialised Copyright
list_splice_tail – join two lists, each list being a queue Synopsis void list_splice_tail(struct list_head *list, struct list_head *head); Arguments list the new list to add. head the place to add it in the first list. Copyright
list_splice_init – join two lists and reinitialise the emptied list. Synopsis void list_splice_init(struct list_head *list, struct list_head *head); Arguments list the new list to add. head the place to add it in the first list. Description The list at list is reinitialised Copyright
list_splice – join two lists, this is designed for stacks Synopsis void list_splice(const struct list_head *list, struct list_head *head); Arguments list the new list to add. head the place to add it in the first list. Copyright
list_safe_reset_next – reset a stale list_for_each_entry_safe loop Synopsis list_safe_reset_next(pos, n, member); Arguments pos the loop cursor used in the list_for_each_entry_safe loop n temporary storage used in list_for_each_entry_safe member the name of the list_head within the struct. Description list_safe_reset_next is not safe to use in general if the list may be modified concurrently (eg. the lock…
list_rotate_left – rotate the list to the left Synopsis void list_rotate_left(struct list_head *head); Arguments head the head of the list Copyright
list_replace – replace old entry by new one Synopsis void list_replace(struct list_head *old, struct list_head *new); Arguments old the element to be replaced new the new element to insert Description If old was empty, it will be overwritten. Copyright
list_prev_entry – get the prev element in list Synopsis list_prev_entry(pos, member); Arguments pos the type * to cursor member the name of the list_head within the struct. Copyright
list_prepare_entry – prepare a pos entry for use in list_for_each_entry_continue Synopsis list_prepare_entry(pos, head, member); Arguments pos the type * to use as a start point head the head of the list member the name of the list_head within the struct. Description Prepares a pos entry for use as a start point in list_for_each_entry_continue. Copyright
list_next_entry – get the next element in list Synopsis list_next_entry(pos, member); Arguments pos the type * to cursor member the name of the list_head within the struct. Copyright
list_move_tail – delete from one list and add as another’s tail Synopsis void list_move_tail(struct list_head *list, struct list_head *head); Arguments list the entry to move head the head that will follow our entry Copyright
list_move – delete from one list and add as another’s head Synopsis void list_move(struct list_head *list, struct list_head *head); Arguments list the entry to move head the head that will precede our entry Copyright
list_last_entry – get the last element from a list Synopsis list_last_entry(ptr, type, member); Arguments ptr the list head to take the element from. type the type of the struct this is embedded in. member the name of the list_head within the struct. Description Note, that list is expected to be not empty. Copyright
list_is_singular – tests whether a list has just one entry. Synopsis int list_is_singular(const struct list_head *head); Arguments head the list to test. Copyright
list_is_last – tests whether list is the last entry in list head Synopsis int list_is_last(const struct list_head *list, const struct list_head *head); Arguments list the entry to test head the head of the list Copyright
list_for_each_safe – iterate over a list safe against removal of list entry Synopsis list_for_each_safe(pos, n, head); Arguments pos the struct list_head to use as a loop cursor. n another struct list_head to use as temporary storage head the head for your list. Copyright
list_for_each_prev_safe – iterate over a list backwards safe against removal of list entry Synopsis list_for_each_prev_safe(pos, n, head); Arguments pos the struct list_head to use as a loop cursor. n another struct list_head to use as temporary storage head the head for your list. Copyright