diff options
| author | Andy Shevchenko <andriy.shevchenko@linux.intel.com> | 2015-07-27 18:03:59 +0300 |
|---|---|---|
| committer | Lee Jones <lee.jones@linaro.org> | 2015-07-28 08:50:42 +0100 |
| commit | 2e0fed7f7cdc41679e209c5636ad7537dc6210a9 (patch) | |
| tree | b6b445d658a1c4f2d2e95f8afcb9402f5807216c /include/linux/klist.h | |
| parent | ddef08dd00f5548f943422c86e4ffe67dd040b6c (diff) | |
klist: implement klist_prev()
klist_prev() gets the previous element in the list. It is useful to traverse
through the list in reverse order, for example, to provide LIFO (last in first
out) variant of access.
Signed-off-by: Andy Shevchenko <andriy.shevchenko@linux.intel.com>
Acked-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Lee Jones <lee.jones@linaro.org>
Diffstat (limited to 'include/linux/klist.h')
| -rw-r--r-- | include/linux/klist.h | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/include/linux/klist.h b/include/linux/klist.h index 61e5b723ae73..953f283f8451 100644 --- a/include/linux/klist.h +++ b/include/linux/klist.h @@ -63,6 +63,7 @@ extern void klist_iter_init(struct klist *k, struct klist_iter *i); extern void klist_iter_init_node(struct klist *k, struct klist_iter *i, struct klist_node *n); extern void klist_iter_exit(struct klist_iter *i); +extern struct klist_node *klist_prev(struct klist_iter *i); extern struct klist_node *klist_next(struct klist_iter *i); #endif |