43730982c3
So that building other browser based on structures linked via a linked list can be as easy as it is already for the ones linked via an rb_tree. Cc: Frederic Weisbecker <fweisbec@gmail.com> Cc: Mike Galbraith <efault@gmx.de> Cc: Peter Zijlstra <peterz@infradead.org> Cc: Stephane Eranian <eranian@google.com> LKML-Reference: <new-submission> Signed-off-by: Arnaldo Carvalho de Melo <acme@redhat.com>
26 lines
840 B
C
26 lines
840 B
C
#include "../../../../include/linux/list.h"
|
|
|
|
#ifndef PERF_LIST_H
|
|
#define PERF_LIST_H
|
|
/**
|
|
* list_del_range - deletes range of entries from list.
|
|
* @begin: first element in the range to delete from the list.
|
|
* @end: last element in the range to delete from the list.
|
|
* Note: list_empty on the range of entries does not return true after this,
|
|
* the entries is in an undefined state.
|
|
*/
|
|
static inline void list_del_range(struct list_head *begin,
|
|
struct list_head *end)
|
|
{
|
|
begin->prev->next = end->next;
|
|
end->next->prev = begin->prev;
|
|
}
|
|
|
|
/**
|
|
* list_for_each_from - iterate over a list from one of its nodes
|
|
* @pos: the &struct list_head to use as a loop cursor, from where to start
|
|
* @head: the head for your list.
|
|
*/
|
|
#define list_for_each_from(pos, head) \
|
|
for (; prefetch(pos->next), pos != (head); pos = pos->next)
|
|
#endif
|