linux-toradex.git/lib/prio_tree.c, branch v3.4.73

prio_tree: introduce prio_set_parent()

2012-03-23T23:58:36+00:00

Introduce prio_set_parent() to abstract the operation which is used to
attach the node to its parent.

Signed-off-by: Xiao Guangrong 
Signed-off-by: Andrew Morton 
Signed-off-by: Linus Torvalds

prio_tree: simplify prio_tree_expand()

2012-03-23T23:58:36+00:00

In current code, the deleted-node is recorded from first to last,
actually, we can directly attach these node on 'node' we will insert as
the left child, it can let the code more readable.

Signed-off-by: Xiao Guangrong 
Signed-off-by: Andrew Morton 
Signed-off-by: Linus Torvalds

prio_tree: cleanup prio_tree_left()/prio_tree_right()

2012-03-23T23:58:36+00:00

Introduce iter_walk_down()/iter_walk_up() to remove the common code
between prio_tree_left() and prio_tree_right().

Signed-off-by: Xiao Guangrong 
Signed-off-by: Andrew Morton 
Signed-off-by: Linus Torvalds

prio_tree: remove unnecessary code in prio_tree_replace

2012-03-23T23:58:36+00:00

Remove the code since 'node' has already been initialized in the begin of
the function

Signed-off-by: Xiao Guangrong 
Signed-off-by: Andrew Morton 
Signed-off-by: Linus Torvalds

Linux-2.6.12-rc2

2005-04-16T22:20:36+00:00

Initial git repository build. I'm not bothering with the full history,
even though we have it. We can create a separate "historical" git
archive of that later if we want to, and in the meantime it's about
3.2GB when imported into git - space that would just make the early
git days unnecessarily complicated, when we don't have a lot of good
infrastructure for it.

Let it rip!