lookup_one_len_unlocked – filesystem helper to lookup single pathname component Synopsis struct dentry *lookup_one_len_unlocked(const char *name, struct dentry *base, int len); Arguments name pathname component to lookup base base directory to lookup from len maximum length len should be interpreted to Description Note that this routine is purely a helper for filesystem usage and should not…
lookup_one_len – filesystem helper to lookup single pathname component Synopsis struct dentry *lookup_one_len(const char *name, struct dentry *base, int len); Arguments name pathname component to lookup base base directory to lookup from len maximum length len should be interpreted to Description Note that this routine is purely a helper for filesystem usage and should not…
lookup_bdev – lookup a struct block_device by name Synopsis struct block_device *lookup_bdev(const char *pathname); Arguments pathname special file representing the block device Description Get a reference to the blockdevice at pathname in the current namespace if possible and return it. Return ERR_PTR(error) otherwise. Copyright
locks_mandatory_locked – Check for an active lock Synopsis int locks_mandatory_locked(struct file *file); Arguments file the file to check Description Searches the inode’s list of locks to find any POSIX locks which conflict. This function is called from locks_verify_locked only. Copyright
locks_mandatory_area – Check for a conflicting lock Synopsis int locks_mandatory_area(struct inode *inode, struct file *filp, loff_t start, loff_t end, unsigned char type); Arguments inode the file to check filp how the file was opened (if it was) start first byte in the file to check end lastbyte in the file to check type F_WRLCK for…
locks_lock_inode_wait – Apply a lock to an inode Synopsis int locks_lock_inode_wait(struct inode *inode, struct file_lock *fl); Arguments inode inode of the file to apply to fl The lock to be applied Description Apply a POSIX or FLOCK style lock request to an inode. Copyright
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