Merge branch 'perf/rbtree_copy' of git://git.kernel.org/pub/scm/linux/kernel/git/acme/linux into perf/urgent
Pull rbtree build fix from Arnaldo Carvalho de Melo. Signed-off-by: Ingo Molnar <mingo@kernel.org>
This commit is contained in:
Ingo Molnar
commit
d2d61ed55f
|
|
@ -41,4 +41,62 @@
|
||||||
|
|
||||||
#define ACCESS_ONCE(x) (*(volatile typeof(x) *)&(x))
|
#define ACCESS_ONCE(x) (*(volatile typeof(x) *)&(x))
|
||||||
|
|
||||||
|
#include <linux/types.h>
|
||||||
|
|
||||||
|
static __always_inline void __read_once_size(const volatile void *p, void *res, int size)
|
||||||
|
{
|
||||||
|
switch (size) {
|
||||||
|
case 1: *(__u8 *)res = *(volatile __u8 *)p; break;
|
||||||
|
case 2: *(__u16 *)res = *(volatile __u16 *)p; break;
|
||||||
|
case 4: *(__u32 *)res = *(volatile __u32 *)p; break;
|
||||||
|
case 8: *(__u64 *)res = *(volatile __u64 *)p; break;
|
||||||
|
default:
|
||||||
|
barrier();
|
||||||
|
__builtin_memcpy((void *)res, (const void *)p, size);
|
||||||
|
barrier();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
static __always_inline void __write_once_size(volatile void *p, void *res, int size)
|
||||||
|
{
|
||||||
|
switch (size) {
|
||||||
|
case 1: *(volatile __u8 *)p = *(__u8 *)res; break;
|
||||||
|
case 2: *(volatile __u16 *)p = *(__u16 *)res; break;
|
||||||
|
case 4: *(volatile __u32 *)p = *(__u32 *)res; break;
|
||||||
|
case 8: *(volatile __u64 *)p = *(__u64 *)res; break;
|
||||||
|
default:
|
||||||
|
barrier();
|
||||||
|
__builtin_memcpy((void *)p, (const void *)res, size);
|
||||||
|
barrier();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Prevent the compiler from merging or refetching reads or writes. The
|
||||||
|
* compiler is also forbidden from reordering successive instances of
|
||||||
|
* READ_ONCE, WRITE_ONCE and ACCESS_ONCE (see below), but only when the
|
||||||
|
* compiler is aware of some particular ordering. One way to make the
|
||||||
|
* compiler aware of ordering is to put the two invocations of READ_ONCE,
|
||||||
|
* WRITE_ONCE or ACCESS_ONCE() in different C statements.
|
||||||
|
*
|
||||||
|
* In contrast to ACCESS_ONCE these two macros will also work on aggregate
|
||||||
|
* data types like structs or unions. If the size of the accessed data
|
||||||
|
* type exceeds the word size of the machine (e.g., 32 bits or 64 bits)
|
||||||
|
* READ_ONCE() and WRITE_ONCE() will fall back to memcpy and print a
|
||||||
|
* compile-time warning.
|
||||||
|
*
|
||||||
|
* Their two major use cases are: (1) Mediating communication between
|
||||||
|
* process-level code and irq/NMI handlers, all running on the same CPU,
|
||||||
|
* and (2) Ensuring that the compiler does not fold, spindle, or otherwise
|
||||||
|
* mutilate accesses that either do not require ordering or that interact
|
||||||
|
* with an explicit memory barrier or atomic instruction that provides the
|
||||||
|
* required ordering.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#define READ_ONCE(x) \
|
||||||
|
({ union { typeof(x) __val; char __c[1]; } __u; __read_once_size(&(x), __u.__c, sizeof(x)); __u.__val; })
|
||||||
|
|
||||||
|
#define WRITE_ONCE(x, val) \
|
||||||
|
({ union { typeof(x) __val; char __c[1]; } __u = { .__val = (val) }; __write_once_size(&(x), __u.__c, sizeof(x)); __u.__val; })
|
||||||
|
|
||||||
#endif /* _TOOLS_LINUX_COMPILER_H */
|
#endif /* _TOOLS_LINUX_COMPILER_H */
|
||||||
|
|
|
||||||
|
|
@ -1,10 +0,0 @@
|
||||||
#ifndef _TOOLS_LINUX_EXPORT_H_
|
|
||||||
#define _TOOLS_LINUX_EXPORT_H_
|
|
||||||
|
|
||||||
#define EXPORT_SYMBOL(sym)
|
|
||||||
#define EXPORT_SYMBOL_GPL(sym)
|
|
||||||
#define EXPORT_SYMBOL_GPL_FUTURE(sym)
|
|
||||||
#define EXPORT_UNUSED_SYMBOL(sym)
|
|
||||||
#define EXPORT_UNUSED_SYMBOL_GPL(sym)
|
|
||||||
|
|
||||||
#endif
|
|
||||||
|
|
@ -0,0 +1,104 @@
|
||||||
|
/*
|
||||||
|
Red Black Trees
|
||||||
|
(C) 1999 Andrea Arcangeli <andrea@suse.de>
|
||||||
|
|
||||||
|
This program is free software; you can redistribute it and/or modify
|
||||||
|
it under the terms of the GNU General Public License as published by
|
||||||
|
the Free Software Foundation; either version 2 of the License, or
|
||||||
|
(at your option) any later version.
|
||||||
|
|
||||||
|
This program is distributed in the hope that it will be useful,
|
||||||
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||||
|
GNU General Public License for more details.
|
||||||
|
|
||||||
|
You should have received a copy of the GNU General Public License
|
||||||
|
along with this program; if not, write to the Free Software
|
||||||
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||||
|
|
||||||
|
linux/include/linux/rbtree.h
|
||||||
|
|
||||||
|
To use rbtrees you'll have to implement your own insert and search cores.
|
||||||
|
This will avoid us to use callbacks and to drop drammatically performances.
|
||||||
|
I know it's not the cleaner way, but in C (not in C++) to get
|
||||||
|
performances and genericity...
|
||||||
|
|
||||||
|
See Documentation/rbtree.txt for documentation and samples.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef __TOOLS_LINUX_PERF_RBTREE_H
|
||||||
|
#define __TOOLS_LINUX_PERF_RBTREE_H
|
||||||
|
|
||||||
|
#include <linux/kernel.h>
|
||||||
|
#include <linux/stddef.h>
|
||||||
|
|
||||||
|
struct rb_node {
|
||||||
|
unsigned long __rb_parent_color;
|
||||||
|
struct rb_node *rb_right;
|
||||||
|
struct rb_node *rb_left;
|
||||||
|
} __attribute__((aligned(sizeof(long))));
|
||||||
|
/* The alignment might seem pointless, but allegedly CRIS needs it */
|
||||||
|
|
||||||
|
struct rb_root {
|
||||||
|
struct rb_node *rb_node;
|
||||||
|
};
|
||||||
|
|
||||||
|
|
||||||
|
#define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3))
|
||||||
|
|
||||||
|
#define RB_ROOT (struct rb_root) { NULL, }
|
||||||
|
#define rb_entry(ptr, type, member) container_of(ptr, type, member)
|
||||||
|
|
||||||
|
#define RB_EMPTY_ROOT(root) ((root)->rb_node == NULL)
|
||||||
|
|
||||||
|
/* 'empty' nodes are nodes that are known not to be inserted in an rbtree */
|
||||||
|
#define RB_EMPTY_NODE(node) \
|
||||||
|
((node)->__rb_parent_color == (unsigned long)(node))
|
||||||
|
#define RB_CLEAR_NODE(node) \
|
||||||
|
((node)->__rb_parent_color = (unsigned long)(node))
|
||||||
|
|
||||||
|
|
||||||
|
extern void rb_insert_color(struct rb_node *, struct rb_root *);
|
||||||
|
extern void rb_erase(struct rb_node *, struct rb_root *);
|
||||||
|
|
||||||
|
|
||||||
|
/* Find logical next and previous nodes in a tree */
|
||||||
|
extern struct rb_node *rb_next(const struct rb_node *);
|
||||||
|
extern struct rb_node *rb_prev(const struct rb_node *);
|
||||||
|
extern struct rb_node *rb_first(const struct rb_root *);
|
||||||
|
extern struct rb_node *rb_last(const struct rb_root *);
|
||||||
|
|
||||||
|
/* Postorder iteration - always visit the parent after its children */
|
||||||
|
extern struct rb_node *rb_first_postorder(const struct rb_root *);
|
||||||
|
extern struct rb_node *rb_next_postorder(const struct rb_node *);
|
||||||
|
|
||||||
|
/* Fast replacement of a single node without remove/rebalance/add/rebalance */
|
||||||
|
extern void rb_replace_node(struct rb_node *victim, struct rb_node *new,
|
||||||
|
struct rb_root *root);
|
||||||
|
|
||||||
|
static inline void rb_link_node(struct rb_node *node, struct rb_node *parent,
|
||||||
|
struct rb_node **rb_link)
|
||||||
|
{
|
||||||
|
node->__rb_parent_color = (unsigned long)parent;
|
||||||
|
node->rb_left = node->rb_right = NULL;
|
||||||
|
|
||||||
|
*rb_link = node;
|
||||||
|
}
|
||||||
|
|
||||||
|
#define rb_entry_safe(ptr, type, member) \
|
||||||
|
({ typeof(ptr) ____ptr = (ptr); \
|
||||||
|
____ptr ? rb_entry(____ptr, type, member) : NULL; \
|
||||||
|
})
|
||||||
|
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Handy for checking that we are not deleting an entry that is
|
||||||
|
* already in a list, found in block/{blk-throttle,cfq-iosched}.c,
|
||||||
|
* probably should be moved to lib/rbtree.c...
|
||||||
|
*/
|
||||||
|
static inline void rb_erase_init(struct rb_node *n, struct rb_root *root)
|
||||||
|
{
|
||||||
|
rb_erase(n, root);
|
||||||
|
RB_CLEAR_NODE(n);
|
||||||
|
}
|
||||||
|
#endif /* __TOOLS_LINUX_PERF_RBTREE_H */
|
||||||
|
|
@ -0,0 +1,245 @@
|
||||||
|
/*
|
||||||
|
Red Black Trees
|
||||||
|
(C) 1999 Andrea Arcangeli <andrea@suse.de>
|
||||||
|
(C) 2002 David Woodhouse <dwmw2@infradead.org>
|
||||||
|
(C) 2012 Michel Lespinasse <walken@google.com>
|
||||||
|
|
||||||
|
This program is free software; you can redistribute it and/or modify
|
||||||
|
it under the terms of the GNU General Public License as published by
|
||||||
|
the Free Software Foundation; either version 2 of the License, or
|
||||||
|
(at your option) any later version.
|
||||||
|
|
||||||
|
This program is distributed in the hope that it will be useful,
|
||||||
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||||
|
GNU General Public License for more details.
|
||||||
|
|
||||||
|
You should have received a copy of the GNU General Public License
|
||||||
|
along with this program; if not, write to the Free Software
|
||||||
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||||
|
|
||||||
|
tools/linux/include/linux/rbtree_augmented.h
|
||||||
|
|
||||||
|
Copied from:
|
||||||
|
linux/include/linux/rbtree_augmented.h
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef _TOOLS_LINUX_RBTREE_AUGMENTED_H
|
||||||
|
#define _TOOLS_LINUX_RBTREE_AUGMENTED_H
|
||||||
|
|
||||||
|
#include <linux/compiler.h>
|
||||||
|
#include <linux/rbtree.h>
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Please note - only struct rb_augment_callbacks and the prototypes for
|
||||||
|
* rb_insert_augmented() and rb_erase_augmented() are intended to be public.
|
||||||
|
* The rest are implementation details you are not expected to depend on.
|
||||||
|
*
|
||||||
|
* See Documentation/rbtree.txt for documentation and samples.
|
||||||
|
*/
|
||||||
|
|
||||||
|
struct rb_augment_callbacks {
|
||||||
|
void (*propagate)(struct rb_node *node, struct rb_node *stop);
|
||||||
|
void (*copy)(struct rb_node *old, struct rb_node *new);
|
||||||
|
void (*rotate)(struct rb_node *old, struct rb_node *new);
|
||||||
|
};
|
||||||
|
|
||||||
|
extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
|
||||||
|
void (*augment_rotate)(struct rb_node *old, struct rb_node *new));
|
||||||
|
/*
|
||||||
|
* Fixup the rbtree and update the augmented information when rebalancing.
|
||||||
|
*
|
||||||
|
* On insertion, the user must update the augmented information on the path
|
||||||
|
* leading to the inserted node, then call rb_link_node() as usual and
|
||||||
|
* rb_augment_inserted() instead of the usual rb_insert_color() call.
|
||||||
|
* If rb_augment_inserted() rebalances the rbtree, it will callback into
|
||||||
|
* a user provided function to update the augmented information on the
|
||||||
|
* affected subtrees.
|
||||||
|
*/
|
||||||
|
static inline void
|
||||||
|
rb_insert_augmented(struct rb_node *node, struct rb_root *root,
|
||||||
|
const struct rb_augment_callbacks *augment)
|
||||||
|
{
|
||||||
|
__rb_insert_augmented(node, root, augment->rotate);
|
||||||
|
}
|
||||||
|
|
||||||
|
#define RB_DECLARE_CALLBACKS(rbstatic, rbname, rbstruct, rbfield, \
|
||||||
|
rbtype, rbaugmented, rbcompute) \
|
||||||
|
static inline void \
|
||||||
|
rbname ## _propagate(struct rb_node *rb, struct rb_node *stop) \
|
||||||
|
{ \
|
||||||
|
while (rb != stop) { \
|
||||||
|
rbstruct *node = rb_entry(rb, rbstruct, rbfield); \
|
||||||
|
rbtype augmented = rbcompute(node); \
|
||||||
|
if (node->rbaugmented == augmented) \
|
||||||
|
break; \
|
||||||
|
node->rbaugmented = augmented; \
|
||||||
|
rb = rb_parent(&node->rbfield); \
|
||||||
|
} \
|
||||||
|
} \
|
||||||
|
static inline void \
|
||||||
|
rbname ## _copy(struct rb_node *rb_old, struct rb_node *rb_new) \
|
||||||
|
{ \
|
||||||
|
rbstruct *old = rb_entry(rb_old, rbstruct, rbfield); \
|
||||||
|
rbstruct *new = rb_entry(rb_new, rbstruct, rbfield); \
|
||||||
|
new->rbaugmented = old->rbaugmented; \
|
||||||
|
} \
|
||||||
|
static void \
|
||||||
|
rbname ## _rotate(struct rb_node *rb_old, struct rb_node *rb_new) \
|
||||||
|
{ \
|
||||||
|
rbstruct *old = rb_entry(rb_old, rbstruct, rbfield); \
|
||||||
|
rbstruct *new = rb_entry(rb_new, rbstruct, rbfield); \
|
||||||
|
new->rbaugmented = old->rbaugmented; \
|
||||||
|
old->rbaugmented = rbcompute(old); \
|
||||||
|
} \
|
||||||
|
rbstatic const struct rb_augment_callbacks rbname = { \
|
||||||
|
rbname ## _propagate, rbname ## _copy, rbname ## _rotate \
|
||||||
|
};
|
||||||
|
|
||||||
|
|
||||||
|
#define RB_RED 0
|
||||||
|
#define RB_BLACK 1
|
||||||
|
|
||||||
|
#define __rb_parent(pc) ((struct rb_node *)(pc & ~3))
|
||||||
|
|
||||||
|
#define __rb_color(pc) ((pc) & 1)
|
||||||
|
#define __rb_is_black(pc) __rb_color(pc)
|
||||||
|
#define __rb_is_red(pc) (!__rb_color(pc))
|
||||||
|
#define rb_color(rb) __rb_color((rb)->__rb_parent_color)
|
||||||
|
#define rb_is_red(rb) __rb_is_red((rb)->__rb_parent_color)
|
||||||
|
#define rb_is_black(rb) __rb_is_black((rb)->__rb_parent_color)
|
||||||
|
|
||||||
|
static inline void rb_set_parent(struct rb_node *rb, struct rb_node *p)
|
||||||
|
{
|
||||||
|
rb->__rb_parent_color = rb_color(rb) | (unsigned long)p;
|
||||||
|
}
|
||||||
|
|
||||||
|
static inline void rb_set_parent_color(struct rb_node *rb,
|
||||||
|
struct rb_node *p, int color)
|
||||||
|
{
|
||||||
|
rb->__rb_parent_color = (unsigned long)p | color;
|
||||||
|
}
|
||||||
|
|
||||||
|
static inline void
|
||||||
|
__rb_change_child(struct rb_node *old, struct rb_node *new,
|
||||||
|
struct rb_node *parent, struct rb_root *root)
|
||||||
|
{
|
||||||
|
if (parent) {
|
||||||
|
if (parent->rb_left == old)
|
||||||
|
parent->rb_left = new;
|
||||||
|
else
|
||||||
|
parent->rb_right = new;
|
||||||
|
} else
|
||||||
|
root->rb_node = new;
|
||||||
|
}
|
||||||
|
|
||||||
|
extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root,
|
||||||
|
void (*augment_rotate)(struct rb_node *old, struct rb_node *new));
|
||||||
|
|
||||||
|
static __always_inline struct rb_node *
|
||||||
|
__rb_erase_augmented(struct rb_node *node, struct rb_root *root,
|
||||||
|
const struct rb_augment_callbacks *augment)
|
||||||
|
{
|
||||||
|
struct rb_node *child = node->rb_right, *tmp = node->rb_left;
|
||||||
|
struct rb_node *parent, *rebalance;
|
||||||
|
unsigned long pc;
|
||||||
|
|
||||||
|
if (!tmp) {
|
||||||
|
/*
|
||||||
|
* Case 1: node to erase has no more than 1 child (easy!)
|
||||||
|
*
|
||||||
|
* Note that if there is one child it must be red due to 5)
|
||||||
|
* and node must be black due to 4). We adjust colors locally
|
||||||
|
* so as to bypass __rb_erase_color() later on.
|
||||||
|
*/
|
||||||
|
pc = node->__rb_parent_color;
|
||||||
|
parent = __rb_parent(pc);
|
||||||
|
__rb_change_child(node, child, parent, root);
|
||||||
|
if (child) {
|
||||||
|
child->__rb_parent_color = pc;
|
||||||
|
rebalance = NULL;
|
||||||
|
} else
|
||||||
|
rebalance = __rb_is_black(pc) ? parent : NULL;
|
||||||
|
tmp = parent;
|
||||||
|
} else if (!child) {
|
||||||
|
/* Still case 1, but this time the child is node->rb_left */
|
||||||
|
tmp->__rb_parent_color = pc = node->__rb_parent_color;
|
||||||
|
parent = __rb_parent(pc);
|
||||||
|
__rb_change_child(node, tmp, parent, root);
|
||||||
|
rebalance = NULL;
|
||||||
|
tmp = parent;
|
||||||
|
} else {
|
||||||
|
struct rb_node *successor = child, *child2;
|
||||||
|
tmp = child->rb_left;
|
||||||
|
if (!tmp) {
|
||||||
|
/*
|
||||||
|
* Case 2: node's successor is its right child
|
||||||
|
*
|
||||||
|
* (n) (s)
|
||||||
|
* / \ / \
|
||||||
|
* (x) (s) -> (x) (c)
|
||||||
|
* \
|
||||||
|
* (c)
|
||||||
|
*/
|
||||||
|
parent = successor;
|
||||||
|
child2 = successor->rb_right;
|
||||||
|
augment->copy(node, successor);
|
||||||
|
} else {
|
||||||
|
/*
|
||||||
|
* Case 3: node's successor is leftmost under
|
||||||
|
* node's right child subtree
|
||||||
|
*
|
||||||
|
* (n) (s)
|
||||||
|
* / \ / \
|
||||||
|
* (x) (y) -> (x) (y)
|
||||||
|
* / /
|
||||||
|
* (p) (p)
|
||||||
|
* / /
|
||||||
|
* (s) (c)
|
||||||
|
* \
|
||||||
|
* (c)
|
||||||
|
*/
|
||||||
|
do {
|
||||||
|
parent = successor;
|
||||||
|
successor = tmp;
|
||||||
|
tmp = tmp->rb_left;
|
||||||
|
} while (tmp);
|
||||||
|
parent->rb_left = child2 = successor->rb_right;
|
||||||
|
successor->rb_right = child;
|
||||||
|
rb_set_parent(child, successor);
|
||||||
|
augment->copy(node, successor);
|
||||||
|
augment->propagate(parent, successor);
|
||||||
|
}
|
||||||
|
|
||||||
|
successor->rb_left = tmp = node->rb_left;
|
||||||
|
rb_set_parent(tmp, successor);
|
||||||
|
|
||||||
|
pc = node->__rb_parent_color;
|
||||||
|
tmp = __rb_parent(pc);
|
||||||
|
__rb_change_child(node, successor, tmp, root);
|
||||||
|
if (child2) {
|
||||||
|
successor->__rb_parent_color = pc;
|
||||||
|
rb_set_parent_color(child2, parent, RB_BLACK);
|
||||||
|
rebalance = NULL;
|
||||||
|
} else {
|
||||||
|
unsigned long pc2 = successor->__rb_parent_color;
|
||||||
|
successor->__rb_parent_color = pc;
|
||||||
|
rebalance = __rb_is_black(pc2) ? parent : NULL;
|
||||||
|
}
|
||||||
|
tmp = successor;
|
||||||
|
}
|
||||||
|
|
||||||
|
augment->propagate(tmp, NULL);
|
||||||
|
return rebalance;
|
||||||
|
}
|
||||||
|
|
||||||
|
static __always_inline void
|
||||||
|
rb_erase_augmented(struct rb_node *node, struct rb_root *root,
|
||||||
|
const struct rb_augment_callbacks *augment)
|
||||||
|
{
|
||||||
|
struct rb_node *rebalance = __rb_erase_augmented(node, root, augment);
|
||||||
|
if (rebalance)
|
||||||
|
__rb_erase_color(rebalance, root, augment->rotate);
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif /* _TOOLS_LINUX_RBTREE_AUGMENTED_H */
|
||||||
|
|
@ -0,0 +1,548 @@
|
||||||
|
/*
|
||||||
|
Red Black Trees
|
||||||
|
(C) 1999 Andrea Arcangeli <andrea@suse.de>
|
||||||
|
(C) 2002 David Woodhouse <dwmw2@infradead.org>
|
||||||
|
(C) 2012 Michel Lespinasse <walken@google.com>
|
||||||
|
|
||||||
|
This program is free software; you can redistribute it and/or modify
|
||||||
|
it under the terms of the GNU General Public License as published by
|
||||||
|
the Free Software Foundation; either version 2 of the License, or
|
||||||
|
(at your option) any later version.
|
||||||
|
|
||||||
|
This program is distributed in the hope that it will be useful,
|
||||||
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||||
|
GNU General Public License for more details.
|
||||||
|
|
||||||
|
You should have received a copy of the GNU General Public License
|
||||||
|
along with this program; if not, write to the Free Software
|
||||||
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||||
|
|
||||||
|
linux/lib/rbtree.c
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <linux/rbtree_augmented.h>
|
||||||
|
|
||||||
|
/*
|
||||||
|
* red-black trees properties: http://en.wikipedia.org/wiki/Rbtree
|
||||||
|
*
|
||||||
|
* 1) A node is either red or black
|
||||||
|
* 2) The root is black
|
||||||
|
* 3) All leaves (NULL) are black
|
||||||
|
* 4) Both children of every red node are black
|
||||||
|
* 5) Every simple path from root to leaves contains the same number
|
||||||
|
* of black nodes.
|
||||||
|
*
|
||||||
|
* 4 and 5 give the O(log n) guarantee, since 4 implies you cannot have two
|
||||||
|
* consecutive red nodes in a path and every red node is therefore followed by
|
||||||
|
* a black. So if B is the number of black nodes on every simple path (as per
|
||||||
|
* 5), then the longest possible path due to 4 is 2B.
|
||||||
|
*
|
||||||
|
* We shall indicate color with case, where black nodes are uppercase and red
|
||||||
|
* nodes will be lowercase. Unknown color nodes shall be drawn as red within
|
||||||
|
* parentheses and have some accompanying text comment.
|
||||||
|
*/
|
||||||
|
|
||||||
|
static inline void rb_set_black(struct rb_node *rb)
|
||||||
|
{
|
||||||
|
rb->__rb_parent_color |= RB_BLACK;
|
||||||
|
}
|
||||||
|
|
||||||
|
static inline struct rb_node *rb_red_parent(struct rb_node *red)
|
||||||
|
{
|
||||||
|
return (struct rb_node *)red->__rb_parent_color;
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Helper function for rotations:
|
||||||
|
* - old's parent and color get assigned to new
|
||||||
|
* - old gets assigned new as a parent and 'color' as a color.
|
||||||
|
*/
|
||||||
|
static inline void
|
||||||
|
__rb_rotate_set_parents(struct rb_node *old, struct rb_node *new,
|
||||||
|
struct rb_root *root, int color)
|
||||||
|
{
|
||||||
|
struct rb_node *parent = rb_parent(old);
|
||||||
|
new->__rb_parent_color = old->__rb_parent_color;
|
||||||
|
rb_set_parent_color(old, new, color);
|
||||||
|
__rb_change_child(old, new, parent, root);
|
||||||
|
}
|
||||||
|
|
||||||
|
static __always_inline void
|
||||||
|
__rb_insert(struct rb_node *node, struct rb_root *root,
|
||||||
|
void (*augment_rotate)(struct rb_node *old, struct rb_node *new))
|
||||||
|
{
|
||||||
|
struct rb_node *parent = rb_red_parent(node), *gparent, *tmp;
|
||||||
|
|
||||||
|
while (true) {
|
||||||
|
/*
|
||||||
|
* Loop invariant: node is red
|
||||||
|
*
|
||||||
|
* If there is a black parent, we are done.
|
||||||
|
* Otherwise, take some corrective action as we don't
|
||||||
|
* want a red root or two consecutive red nodes.
|
||||||
|
*/
|
||||||
|
if (!parent) {
|
||||||
|
rb_set_parent_color(node, NULL, RB_BLACK);
|
||||||
|
break;
|
||||||
|
} else if (rb_is_black(parent))
|
||||||
|
break;
|
||||||
|
|
||||||
|
gparent = rb_red_parent(parent);
|
||||||
|
|
||||||
|
tmp = gparent->rb_right;
|
||||||
|
if (parent != tmp) { /* parent == gparent->rb_left */
|
||||||
|
if (tmp && rb_is_red(tmp)) {
|
||||||
|
/*
|
||||||
|
* Case 1 - color flips
|
||||||
|
*
|
||||||
|
* G g
|
||||||
|
* / \ / \
|
||||||
|
* p u --> P U
|
||||||
|
* / /
|
||||||
|
* n n
|
||||||
|
*
|
||||||
|
* However, since g's parent might be red, and
|
||||||
|
* 4) does not allow this, we need to recurse
|
||||||
|
* at g.
|
||||||
|
*/
|
||||||
|
rb_set_parent_color(tmp, gparent, RB_BLACK);
|
||||||
|
rb_set_parent_color(parent, gparent, RB_BLACK);
|
||||||
|
node = gparent;
|
||||||
|
parent = rb_parent(node);
|
||||||
|
rb_set_parent_color(node, parent, RB_RED);
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
tmp = parent->rb_right;
|
||||||
|
if (node == tmp) {
|
||||||
|
/*
|
||||||
|
* Case 2 - left rotate at parent
|
||||||
|
*
|
||||||
|
* G G
|
||||||
|
* / \ / \
|
||||||
|
* p U --> n U
|
||||||
|
* \ /
|
||||||
|
* n p
|
||||||
|
*
|
||||||
|
* This still leaves us in violation of 4), the
|
||||||
|
* continuation into Case 3 will fix that.
|
||||||
|
*/
|
||||||
|
parent->rb_right = tmp = node->rb_left;
|
||||||
|
node->rb_left = parent;
|
||||||
|
if (tmp)
|
||||||
|
rb_set_parent_color(tmp, parent,
|
||||||
|
RB_BLACK);
|
||||||
|
rb_set_parent_color(parent, node, RB_RED);
|
||||||
|
augment_rotate(parent, node);
|
||||||
|
parent = node;
|
||||||
|
tmp = node->rb_right;
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Case 3 - right rotate at gparent
|
||||||
|
*
|
||||||
|
* G P
|
||||||
|
* / \ / \
|
||||||
|
* p U --> n g
|
||||||
|
* / \
|
||||||
|
* n U
|
||||||
|
*/
|
||||||
|
gparent->rb_left = tmp; /* == parent->rb_right */
|
||||||
|
parent->rb_right = gparent;
|
||||||
|
if (tmp)
|
||||||
|
rb_set_parent_color(tmp, gparent, RB_BLACK);
|
||||||
|
__rb_rotate_set_parents(gparent, parent, root, RB_RED);
|
||||||
|
augment_rotate(gparent, parent);
|
||||||
|
break;
|
||||||
|
} else {
|
||||||
|
tmp = gparent->rb_left;
|
||||||
|
if (tmp && rb_is_red(tmp)) {
|
||||||
|
/* Case 1 - color flips */
|
||||||
|
rb_set_parent_color(tmp, gparent, RB_BLACK);
|
||||||
|
rb_set_parent_color(parent, gparent, RB_BLACK);
|
||||||
|
node = gparent;
|
||||||
|
parent = rb_parent(node);
|
||||||
|
rb_set_parent_color(node, parent, RB_RED);
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
tmp = parent->rb_left;
|
||||||
|
if (node == tmp) {
|
||||||
|
/* Case 2 - right rotate at parent */
|
||||||
|
parent->rb_left = tmp = node->rb_right;
|
||||||
|
node->rb_right = parent;
|
||||||
|
if (tmp)
|
||||||
|
rb_set_parent_color(tmp, parent,
|
||||||
|
RB_BLACK);
|
||||||
|
rb_set_parent_color(parent, node, RB_RED);
|
||||||
|
augment_rotate(parent, node);
|
||||||
|
parent = node;
|
||||||
|
tmp = node->rb_left;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Case 3 - left rotate at gparent */
|
||||||
|
gparent->rb_right = tmp; /* == parent->rb_left */
|
||||||
|
parent->rb_left = gparent;
|
||||||
|
if (tmp)
|
||||||
|
rb_set_parent_color(tmp, gparent, RB_BLACK);
|
||||||
|
__rb_rotate_set_parents(gparent, parent, root, RB_RED);
|
||||||
|
augment_rotate(gparent, parent);
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Inline version for rb_erase() use - we want to be able to inline
|
||||||
|
* and eliminate the dummy_rotate callback there
|
||||||
|
*/
|
||||||
|
static __always_inline void
|
||||||
|
____rb_erase_color(struct rb_node *parent, struct rb_root *root,
|
||||||
|
void (*augment_rotate)(struct rb_node *old, struct rb_node *new))
|
||||||
|
{
|
||||||
|
struct rb_node *node = NULL, *sibling, *tmp1, *tmp2;
|
||||||
|
|
||||||
|
while (true) {
|
||||||
|
/*
|
||||||
|
* Loop invariants:
|
||||||
|
* - node is black (or NULL on first iteration)
|
||||||
|
* - node is not the root (parent is not NULL)
|
||||||
|
* - All leaf paths going through parent and node have a
|
||||||
|
* black node count that is 1 lower than other leaf paths.
|
||||||
|
*/
|
||||||
|
sibling = parent->rb_right;
|
||||||
|
if (node != sibling) { /* node == parent->rb_left */
|
||||||
|
if (rb_is_red(sibling)) {
|
||||||
|
/*
|
||||||
|
* Case 1 - left rotate at parent
|
||||||
|
*
|
||||||
|
* P S
|
||||||
|
* / \ / \
|
||||||
|
* N s --> p Sr
|
||||||
|
* / \ / \
|
||||||
|
* Sl Sr N Sl
|
||||||
|
*/
|
||||||
|
parent->rb_right = tmp1 = sibling->rb_left;
|
||||||
|
sibling->rb_left = parent;
|
||||||
|
rb_set_parent_color(tmp1, parent, RB_BLACK);
|
||||||
|
__rb_rotate_set_parents(parent, sibling, root,
|
||||||
|
RB_RED);
|
||||||
|
augment_rotate(parent, sibling);
|
||||||
|
sibling = tmp1;
|
||||||
|
}
|
||||||
|
tmp1 = sibling->rb_right;
|
||||||
|
if (!tmp1 || rb_is_black(tmp1)) {
|
||||||
|
tmp2 = sibling->rb_left;
|
||||||
|
if (!tmp2 || rb_is_black(tmp2)) {
|
||||||
|
/*
|
||||||
|
* Case 2 - sibling color flip
|
||||||
|
* (p could be either color here)
|
||||||
|
*
|
||||||
|
* (p) (p)
|
||||||
|
* / \ / \
|
||||||
|
* N S --> N s
|
||||||
|
* / \ / \
|
||||||
|
* Sl Sr Sl Sr
|
||||||
|
*
|
||||||
|
* This leaves us violating 5) which
|
||||||
|
* can be fixed by flipping p to black
|
||||||
|
* if it was red, or by recursing at p.
|
||||||
|
* p is red when coming from Case 1.
|
||||||
|
*/
|
||||||
|
rb_set_parent_color(sibling, parent,
|
||||||
|
RB_RED);
|
||||||
|
if (rb_is_red(parent))
|
||||||
|
rb_set_black(parent);
|
||||||
|
else {
|
||||||
|
node = parent;
|
||||||
|
parent = rb_parent(node);
|
||||||
|
if (parent)
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
/*
|
||||||
|
* Case 3 - right rotate at sibling
|
||||||
|
* (p could be either color here)
|
||||||
|
*
|
||||||
|
* (p) (p)
|
||||||
|
* / \ / \
|
||||||
|
* N S --> N Sl
|
||||||
|
* / \ \
|
||||||
|
* sl Sr s
|
||||||
|
* \
|
||||||
|
* Sr
|
||||||
|
*/
|
||||||
|
sibling->rb_left = tmp1 = tmp2->rb_right;
|
||||||
|
tmp2->rb_right = sibling;
|
||||||
|
parent->rb_right = tmp2;
|
||||||
|
if (tmp1)
|
||||||
|
rb_set_parent_color(tmp1, sibling,
|
||||||
|
RB_BLACK);
|
||||||
|
augment_rotate(sibling, tmp2);
|
||||||
|
tmp1 = sibling;
|
||||||
|
sibling = tmp2;
|
||||||
|
}
|
||||||
|
/*
|
||||||
|
* Case 4 - left rotate at parent + color flips
|
||||||
|
* (p and sl could be either color here.
|
||||||
|
* After rotation, p becomes black, s acquires
|
||||||
|
* p's color, and sl keeps its color)
|
||||||
|
*
|
||||||
|
* (p) (s)
|
||||||
|
* / \ / \
|
||||||
|
* N S --> P Sr
|
||||||
|
* / \ / \
|
||||||
|
* (sl) sr N (sl)
|
||||||
|
*/
|
||||||
|
parent->rb_right = tmp2 = sibling->rb_left;
|
||||||
|
sibling->rb_left = parent;
|
||||||
|
rb_set_parent_color(tmp1, sibling, RB_BLACK);
|
||||||
|
if (tmp2)
|
||||||
|
rb_set_parent(tmp2, parent);
|
||||||
|
__rb_rotate_set_parents(parent, sibling, root,
|
||||||
|
RB_BLACK);
|
||||||
|
augment_rotate(parent, sibling);
|
||||||
|
break;
|
||||||
|
} else {
|
||||||
|
sibling = parent->rb_left;
|
||||||
|
if (rb_is_red(sibling)) {
|
||||||
|
/* Case 1 - right rotate at parent */
|
||||||
|
parent->rb_left = tmp1 = sibling->rb_right;
|
||||||
|
sibling->rb_right = parent;
|
||||||
|
rb_set_parent_color(tmp1, parent, RB_BLACK);
|
||||||
|
__rb_rotate_set_parents(parent, sibling, root,
|
||||||
|
RB_RED);
|
||||||
|
augment_rotate(parent, sibling);
|
||||||
|
sibling = tmp1;
|
||||||
|
}
|
||||||
|
tmp1 = sibling->rb_left;
|
||||||
|
if (!tmp1 || rb_is_black(tmp1)) {
|
||||||
|
tmp2 = sibling->rb_right;
|
||||||
|
if (!tmp2 || rb_is_black(tmp2)) {
|
||||||
|
/* Case 2 - sibling color flip */
|
||||||
|
rb_set_parent_color(sibling, parent,
|
||||||
|
RB_RED);
|
||||||
|
if (rb_is_red(parent))
|
||||||
|
rb_set_black(parent);
|
||||||
|
else {
|
||||||
|
node = parent;
|
||||||
|
parent = rb_parent(node);
|
||||||
|
if (parent)
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
/* Case 3 - right rotate at sibling */
|
||||||
|
sibling->rb_right = tmp1 = tmp2->rb_left;
|
||||||
|
tmp2->rb_left = sibling;
|
||||||
|
parent->rb_left = tmp2;
|
||||||
|
if (tmp1)
|
||||||
|
rb_set_parent_color(tmp1, sibling,
|
||||||
|
RB_BLACK);
|
||||||
|
augment_rotate(sibling, tmp2);
|
||||||
|
tmp1 = sibling;
|
||||||
|
sibling = tmp2;
|
||||||
|
}
|
||||||
|
/* Case 4 - left rotate at parent + color flips */
|
||||||
|
parent->rb_left = tmp2 = sibling->rb_right;
|
||||||
|
sibling->rb_right = parent;
|
||||||
|
rb_set_parent_color(tmp1, sibling, RB_BLACK);
|
||||||
|
if (tmp2)
|
||||||
|
rb_set_parent(tmp2, parent);
|
||||||
|
__rb_rotate_set_parents(parent, sibling, root,
|
||||||
|
RB_BLACK);
|
||||||
|
augment_rotate(parent, sibling);
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Non-inline version for rb_erase_augmented() use */
|
||||||
|
void __rb_erase_color(struct rb_node *parent, struct rb_root *root,
|
||||||
|
void (*augment_rotate)(struct rb_node *old, struct rb_node *new))
|
||||||
|
{
|
||||||
|
____rb_erase_color(parent, root, augment_rotate);
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Non-augmented rbtree manipulation functions.
|
||||||
|
*
|
||||||
|
* We use dummy augmented callbacks here, and have the compiler optimize them
|
||||||
|
* out of the rb_insert_color() and rb_erase() function definitions.
|
||||||
|
*/
|
||||||
|
|
||||||
|
static inline void dummy_propagate(struct rb_node *node, struct rb_node *stop) {}
|
||||||
|
static inline void dummy_copy(struct rb_node *old, struct rb_node *new) {}
|
||||||
|
static inline void dummy_rotate(struct rb_node *old, struct rb_node *new) {}
|
||||||
|
|
||||||
|
static const struct rb_augment_callbacks dummy_callbacks = {
|
||||||
|
dummy_propagate, dummy_copy, dummy_rotate
|
||||||
|
};
|
||||||
|
|
||||||
|
void rb_insert_color(struct rb_node *node, struct rb_root *root)
|
||||||
|
{
|
||||||
|
__rb_insert(node, root, dummy_rotate);
|
||||||
|
}
|
||||||
|
|
||||||
|
void rb_erase(struct rb_node *node, struct rb_root *root)
|
||||||
|
{
|
||||||
|
struct rb_node *rebalance;
|
||||||
|
rebalance = __rb_erase_augmented(node, root, &dummy_callbacks);
|
||||||
|
if (rebalance)
|
||||||
|
____rb_erase_color(rebalance, root, dummy_rotate);
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Augmented rbtree manipulation functions.
|
||||||
|
*
|
||||||
|
* This instantiates the same __always_inline functions as in the non-augmented
|
||||||
|
* case, but this time with user-defined callbacks.
|
||||||
|
*/
|
||||||
|
|
||||||
|
void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
|
||||||
|
void (*augment_rotate)(struct rb_node *old, struct rb_node *new))
|
||||||
|
{
|
||||||
|
__rb_insert(node, root, augment_rotate);
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* This function returns the first node (in sort order) of the tree.
|
||||||
|
*/
|
||||||
|
struct rb_node *rb_first(const struct rb_root *root)
|
||||||
|
{
|
||||||
|
struct rb_node *n;
|
||||||
|
|
||||||
|
n = root->rb_node;
|
||||||
|
if (!n)
|
||||||
|
return NULL;
|
||||||
|
while (n->rb_left)
|
||||||
|
n = n->rb_left;
|
||||||
|
return n;
|
||||||
|
}
|
||||||
|
|
||||||
|
struct rb_node *rb_last(const struct rb_root *root)
|
||||||
|
{
|
||||||
|
struct rb_node *n;
|
||||||
|
|
||||||
|
n = root->rb_node;
|
||||||
|
if (!n)
|
||||||
|
return NULL;
|
||||||
|
while (n->rb_right)
|
||||||
|
n = n->rb_right;
|
||||||
|
return n;
|
||||||
|
}
|
||||||
|
|
||||||
|
struct rb_node *rb_next(const struct rb_node *node)
|
||||||
|
{
|
||||||
|
struct rb_node *parent;
|
||||||
|
|
||||||
|
if (RB_EMPTY_NODE(node))
|
||||||
|
return NULL;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* If we have a right-hand child, go down and then left as far
|
||||||
|
* as we can.
|
||||||
|
*/
|
||||||
|
if (node->rb_right) {
|
||||||
|
node = node->rb_right;
|
||||||
|
while (node->rb_left)
|
||||||
|
node=node->rb_left;
|
||||||
|
return (struct rb_node *)node;
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* No right-hand children. Everything down and left is smaller than us,
|
||||||
|
* so any 'next' node must be in the general direction of our parent.
|
||||||
|
* Go up the tree; any time the ancestor is a right-hand child of its
|
||||||
|
* parent, keep going up. First time it's a left-hand child of its
|
||||||
|
* parent, said parent is our 'next' node.
|
||||||
|
*/
|
||||||
|
while ((parent = rb_parent(node)) && node == parent->rb_right)
|
||||||
|
node = parent;
|
||||||
|
|
||||||
|
return parent;
|
||||||
|
}
|
||||||
|
|
||||||
|
struct rb_node *rb_prev(const struct rb_node *node)
|
||||||
|
{
|
||||||
|
struct rb_node *parent;
|
||||||
|
|
||||||
|
if (RB_EMPTY_NODE(node))
|
||||||
|
return NULL;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* If we have a left-hand child, go down and then right as far
|
||||||
|
* as we can.
|
||||||
|
*/
|
||||||
|
if (node->rb_left) {
|
||||||
|
node = node->rb_left;
|
||||||
|
while (node->rb_right)
|
||||||
|
node=node->rb_right;
|
||||||
|
return (struct rb_node *)node;
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* No left-hand children. Go up till we find an ancestor which
|
||||||
|
* is a right-hand child of its parent.
|
||||||
|
*/
|
||||||
|
while ((parent = rb_parent(node)) && node == parent->rb_left)
|
||||||
|
node = parent;
|
||||||
|
|
||||||
|
return parent;
|
||||||
|
}
|
||||||
|
|
||||||
|
void rb_replace_node(struct rb_node *victim, struct rb_node *new,
|
||||||
|
struct rb_root *root)
|
||||||
|
{
|
||||||
|
struct rb_node *parent = rb_parent(victim);
|
||||||
|
|
||||||
|
/* Set the surrounding nodes to point to the replacement */
|
||||||
|
__rb_change_child(victim, new, parent, root);
|
||||||
|
if (victim->rb_left)
|
||||||
|
rb_set_parent(victim->rb_left, new);
|
||||||
|
if (victim->rb_right)
|
||||||
|
rb_set_parent(victim->rb_right, new);
|
||||||
|
|
||||||
|
/* Copy the pointers/colour from the victim to the replacement */
|
||||||
|
*new = *victim;
|
||||||
|
}
|
||||||
|
|
||||||
|
static struct rb_node *rb_left_deepest_node(const struct rb_node *node)
|
||||||
|
{
|
||||||
|
for (;;) {
|
||||||
|
if (node->rb_left)
|
||||||
|
node = node->rb_left;
|
||||||
|
else if (node->rb_right)
|
||||||
|
node = node->rb_right;
|
||||||
|
else
|
||||||
|
return (struct rb_node *)node;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
struct rb_node *rb_next_postorder(const struct rb_node *node)
|
||||||
|
{
|
||||||
|
const struct rb_node *parent;
|
||||||
|
if (!node)
|
||||||
|
return NULL;
|
||||||
|
parent = rb_parent(node);
|
||||||
|
|
||||||
|
/* If we're sitting on node, we've already seen our children */
|
||||||
|
if (parent && node == parent->rb_left && parent->rb_right) {
|
||||||
|
/* If we are the parent's left node, go to the parent's right
|
||||||
|
* node then all the way down to the left */
|
||||||
|
return rb_left_deepest_node(parent->rb_right);
|
||||||
|
} else
|
||||||
|
/* Otherwise we are the parent's right node, and the parent
|
||||||
|
* should be next */
|
||||||
|
return (struct rb_node *)parent;
|
||||||
|
}
|
||||||
|
|
||||||
|
struct rb_node *rb_first_postorder(const struct rb_root *root)
|
||||||
|
{
|
||||||
|
if (!root->rb_node)
|
||||||
|
return NULL;
|
||||||
|
|
||||||
|
return rb_left_deepest_node(root->rb_node);
|
||||||
|
}
|
||||||
|
|
@ -18,6 +18,7 @@ tools/arch/x86/include/asm/atomic.h
|
||||||
tools/arch/x86/include/asm/rmwcc.h
|
tools/arch/x86/include/asm/rmwcc.h
|
||||||
tools/lib/traceevent
|
tools/lib/traceevent
|
||||||
tools/lib/api
|
tools/lib/api
|
||||||
|
tools/lib/rbtree.c
|
||||||
tools/lib/symbol/kallsyms.c
|
tools/lib/symbol/kallsyms.c
|
||||||
tools/lib/symbol/kallsyms.h
|
tools/lib/symbol/kallsyms.h
|
||||||
tools/lib/util/find_next_bit.c
|
tools/lib/util/find_next_bit.c
|
||||||
|
|
@ -44,6 +45,8 @@ tools/include/linux/kernel.h
|
||||||
tools/include/linux/list.h
|
tools/include/linux/list.h
|
||||||
tools/include/linux/log2.h
|
tools/include/linux/log2.h
|
||||||
tools/include/linux/poison.h
|
tools/include/linux/poison.h
|
||||||
|
tools/include/linux/rbtree.h
|
||||||
|
tools/include/linux/rbtree_augmented.h
|
||||||
tools/include/linux/types.h
|
tools/include/linux/types.h
|
||||||
include/asm-generic/bitops/arch_hweight.h
|
include/asm-generic/bitops/arch_hweight.h
|
||||||
include/asm-generic/bitops/const_hweight.h
|
include/asm-generic/bitops/const_hweight.h
|
||||||
|
|
@ -51,12 +54,10 @@ include/asm-generic/bitops/fls64.h
|
||||||
include/asm-generic/bitops/__fls.h
|
include/asm-generic/bitops/__fls.h
|
||||||
include/asm-generic/bitops/fls.h
|
include/asm-generic/bitops/fls.h
|
||||||
include/linux/perf_event.h
|
include/linux/perf_event.h
|
||||||
include/linux/rbtree.h
|
|
||||||
include/linux/list.h
|
include/linux/list.h
|
||||||
include/linux/hash.h
|
include/linux/hash.h
|
||||||
include/linux/stringify.h
|
include/linux/stringify.h
|
||||||
lib/hweight.c
|
lib/hweight.c
|
||||||
lib/rbtree.c
|
|
||||||
include/linux/swab.h
|
include/linux/swab.h
|
||||||
arch/*/include/asm/unistd*.h
|
arch/*/include/asm/unistd*.h
|
||||||
arch/*/include/uapi/asm/unistd*.h
|
arch/*/include/uapi/asm/unistd*.h
|
||||||
|
|
@ -65,7 +66,6 @@ arch/*/lib/memcpy*.S
|
||||||
arch/*/lib/memset*.S
|
arch/*/lib/memset*.S
|
||||||
include/linux/poison.h
|
include/linux/poison.h
|
||||||
include/linux/hw_breakpoint.h
|
include/linux/hw_breakpoint.h
|
||||||
include/linux/rbtree_augmented.h
|
|
||||||
include/uapi/linux/perf_event.h
|
include/uapi/linux/perf_event.h
|
||||||
include/uapi/linux/const.h
|
include/uapi/linux/const.h
|
||||||
include/uapi/linux/swab.h
|
include/uapi/linux/swab.h
|
||||||
|
|
|
||||||
|
|
@ -139,7 +139,7 @@ $(OUTPUT)util/find_next_bit.o: ../lib/util/find_next_bit.c FORCE
|
||||||
$(call rule_mkdir)
|
$(call rule_mkdir)
|
||||||
$(call if_changed_dep,cc_o_c)
|
$(call if_changed_dep,cc_o_c)
|
||||||
|
|
||||||
$(OUTPUT)util/rbtree.o: ../../lib/rbtree.c FORCE
|
$(OUTPUT)util/rbtree.o: ../lib/rbtree.c FORCE
|
||||||
$(call rule_mkdir)
|
$(call rule_mkdir)
|
||||||
$(call if_changed_dep,cc_o_c)
|
$(call if_changed_dep,cc_o_c)
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -1,16 +0,0 @@
|
||||||
#ifndef __TOOLS_LINUX_PERF_RBTREE_H
|
|
||||||
#define __TOOLS_LINUX_PERF_RBTREE_H
|
|
||||||
#include <stdbool.h>
|
|
||||||
#include "../../../../include/linux/rbtree.h"
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Handy for checking that we are not deleting an entry that is
|
|
||||||
* already in a list, found in block/{blk-throttle,cfq-iosched}.c,
|
|
||||||
* probably should be moved to lib/rbtree.c...
|
|
||||||
*/
|
|
||||||
static inline void rb_erase_init(struct rb_node *n, struct rb_root *root)
|
|
||||||
{
|
|
||||||
rb_erase(n, root);
|
|
||||||
RB_CLEAR_NODE(n);
|
|
||||||
}
|
|
||||||
#endif /* __TOOLS_LINUX_PERF_RBTREE_H */
|
|
||||||
|
|
@ -1,2 +0,0 @@
|
||||||
#include <stdbool.h>
|
|
||||||
#include "../../../../include/linux/rbtree_augmented.h"
|
|
||||||
Loading…
Reference in New Issue