mirror of
https://github.com/Fishwaldo/Star64_linux.git
synced 2025-04-04 13:34:39 +00:00
21ef533931
This enables the macros radix_tree_for_each_slot() and friends to be used with multi-order entries. The way that this works is that we treat all entries in a given slots[] array as a single chunk. If the index given to radix_tree_next_chunk() happens to point us to a sibling entry, we will back up iter->index so that it points to the canonical entry, and that will be the place where we start our iteration. As we're processing a chunk in radix_tree_next_slot(), we process canonical entries, skip over sibling entries, and restart the chunk lookup if we find a non-sibling indirect pointer. This drops back to the radix_tree_next_chunk() code, which will re-walk the tree and look for another chunk. This allows us to properly handle multi-order entries mixed with other entries that are at various heights in the radix tree. Signed-off-by: Ross Zwisler <ross.zwisler@linux.intel.com> Signed-off-by: Matthew Wilcox <willy@linux.intel.com> Cc: Konstantin Khlebnikov <koct9i@gmail.com> Cc: Kirill Shutemov <kirill.shutemov@linux.intel.com> Cc: Jan Kara <jack@suse.com> Cc: Neil Brown <neilb@suse.de> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
46 lines
1,018 B
C
46 lines
1,018 B
C
#ifndef _KERNEL_H
|
|
#define _KERNEL_H
|
|
|
|
#include <assert.h>
|
|
#include <string.h>
|
|
#include <stdio.h>
|
|
#include <stddef.h>
|
|
#include <limits.h>
|
|
|
|
#include "../../include/linux/compiler.h"
|
|
#include "../../../include/linux/kconfig.h"
|
|
|
|
#define RADIX_TREE_MAP_SHIFT 3
|
|
|
|
#ifndef NULL
|
|
#define NULL 0
|
|
#endif
|
|
|
|
#define BUG_ON(expr) assert(!(expr))
|
|
#define WARN_ON(expr) assert(!(expr))
|
|
#define __init
|
|
#define __must_check
|
|
#define panic(expr)
|
|
#define printk printf
|
|
#define __force
|
|
#define DIV_ROUND_UP(n,d) (((n) + (d) - 1) / (d))
|
|
#define pr_debug printk
|
|
|
|
#define smp_rmb() barrier()
|
|
#define smp_wmb() barrier()
|
|
#define cpu_relax() barrier()
|
|
|
|
#define ARRAY_SIZE(arr) (sizeof(arr) / sizeof((arr)[0]))
|
|
|
|
#define container_of(ptr, type, member) ({ \
|
|
const typeof( ((type *)0)->member ) *__mptr = (ptr); \
|
|
(type *)( (char *)__mptr - offsetof(type, member) );})
|
|
#define min(a, b) ((a) < (b) ? (a) : (b))
|
|
|
|
#define cond_resched() sched_yield()
|
|
|
|
static inline int in_interrupt(void)
|
|
{
|
|
return 0;
|
|
}
|
|
#endif /* _KERNEL_H */
|