5072f2733a
This was needed at the time before e66eed651f ("list: remove
prefetching from regular list iterators") where the list iterators did
prefetch elements. This turned out to be counter-productive and hurt
performance and they were removed. Which makes the prefetch.h header
unused so drop it.
Signed-off-by: Borislav Petkov <bp@suse.de>
Cc: David Ahern <dsahern@gmail.com>
Cc: Ingo Molnar <mingo@kernel.org>
Cc: Jiri Olsa <jolsa@redhat.com>
Cc: Namhyung Kim <namhyung@gmail.com>
Cc: Peter Zijlstra <peterz@infradead.org>
Cc: Robert Richter <rric@kernel.org>
Link: http://lkml.kernel.org/r/1391611914-26054-4-git-send-email-bp@alien8.de
Signed-off-by: Arnaldo Carvalho de Melo <acme@redhat.com>
28 lines
846 B
C
28 lines
846 B
C
#include <linux/kernel.h>
|
|
|
|
#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 (; pos != (head); pos = pos->next)
|
|
#endif
|