Commit 9a86e2ba authored by Ben Hutchings's avatar Ben Hutchings Committed by Linus Torvalds

lib: fix first line of kernel-doc for a few functions

The function name must be followed by a space, hypen, space, and a short
description.
Signed-off-by: default avatarBen Hutchings <ben@decadent.org.uk>
Signed-off-by: default avatarAndrew Morton <akpm@linux-foundation.org>
Signed-off-by: default avatarLinus Torvalds <torvalds@linux-foundation.org>
parent a069c266
...@@ -498,7 +498,7 @@ static inline void list_splice_tail_init(struct list_head *list, ...@@ -498,7 +498,7 @@ static inline void list_splice_tail_init(struct list_head *list,
pos = n, n = list_entry(n->member.next, typeof(*n), member)) pos = n, n = list_entry(n->member.next, typeof(*n), member))
/** /**
* list_for_each_entry_safe_continue * list_for_each_entry_safe_continue - continue list iteration safe against removal
* @pos: the type * to use as a loop cursor. * @pos: the type * to use as a loop cursor.
* @n: another type * to use as temporary storage * @n: another type * to use as temporary storage
* @head: the head for your list. * @head: the head for your list.
...@@ -514,7 +514,7 @@ static inline void list_splice_tail_init(struct list_head *list, ...@@ -514,7 +514,7 @@ static inline void list_splice_tail_init(struct list_head *list,
pos = n, n = list_entry(n->member.next, typeof(*n), member)) pos = n, n = list_entry(n->member.next, typeof(*n), member))
/** /**
* list_for_each_entry_safe_from * list_for_each_entry_safe_from - iterate over list from current point safe against removal
* @pos: the type * to use as a loop cursor. * @pos: the type * to use as a loop cursor.
* @n: another type * to use as temporary storage * @n: another type * to use as temporary storage
* @head: the head for your list. * @head: the head for your list.
...@@ -529,7 +529,7 @@ static inline void list_splice_tail_init(struct list_head *list, ...@@ -529,7 +529,7 @@ static inline void list_splice_tail_init(struct list_head *list,
pos = n, n = list_entry(n->member.next, typeof(*n), member)) pos = n, n = list_entry(n->member.next, typeof(*n), member))
/** /**
* list_for_each_entry_safe_reverse * list_for_each_entry_safe_reverse - iterate backwards over list safe against removal
* @pos: the type * to use as a loop cursor. * @pos: the type * to use as a loop cursor.
* @n: another type * to use as temporary storage * @n: another type * to use as temporary storage
* @head: the head for your list. * @head: the head for your list.
......
...@@ -487,7 +487,7 @@ int __bitmap_parse(const char *buf, unsigned int buflen, ...@@ -487,7 +487,7 @@ int __bitmap_parse(const char *buf, unsigned int buflen,
EXPORT_SYMBOL(__bitmap_parse); EXPORT_SYMBOL(__bitmap_parse);
/** /**
* bitmap_parse_user() * bitmap_parse_user - convert an ASCII hex string in a user buffer into a bitmap
* *
* @ubuf: pointer to user buffer containing string. * @ubuf: pointer to user buffer containing string.
* @ulen: buffer size in bytes. If string is smaller than this * @ulen: buffer size in bytes. If string is smaller than this
...@@ -619,7 +619,7 @@ int bitmap_parselist(const char *bp, unsigned long *maskp, int nmaskbits) ...@@ -619,7 +619,7 @@ int bitmap_parselist(const char *bp, unsigned long *maskp, int nmaskbits)
EXPORT_SYMBOL(bitmap_parselist); EXPORT_SYMBOL(bitmap_parselist);
/** /**
* bitmap_pos_to_ord(buf, pos, bits) * bitmap_pos_to_ord - find ordinal of set bit at given position in bitmap
* @buf: pointer to a bitmap * @buf: pointer to a bitmap
* @pos: a bit position in @buf (0 <= @pos < @bits) * @pos: a bit position in @buf (0 <= @pos < @bits)
* @bits: number of valid bit positions in @buf * @bits: number of valid bit positions in @buf
...@@ -655,7 +655,7 @@ static int bitmap_pos_to_ord(const unsigned long *buf, int pos, int bits) ...@@ -655,7 +655,7 @@ static int bitmap_pos_to_ord(const unsigned long *buf, int pos, int bits)
} }
/** /**
* bitmap_ord_to_pos(buf, ord, bits) * bitmap_ord_to_pos - find position of n-th set bit in bitmap
* @buf: pointer to bitmap * @buf: pointer to bitmap
* @ord: ordinal bit position (n-th set bit, n >= 0) * @ord: ordinal bit position (n-th set bit, n >= 0)
* @bits: number of valid bit positions in @buf * @bits: number of valid bit positions in @buf
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment