diff options
| author | Xiao Guangrong <xiaoguangrong@linux.vnet.ibm.com> | 2012-03-23 15:02:14 -0700 |
|---|---|---|
| committer | Linus Torvalds <torvalds@linux-foundation.org> | 2012-03-23 16:58:36 -0700 |
| commit | f42240d729b97a01e863b8c24177ec4e54885357 (patch) | |
| tree | eca03750275e38cba74daa9f04a0523268bfca58 /lib | |
| parent | f43804bf5f9ae1e60077c5f22aee5fdfe4f09837 (diff) | |
prio_tree: remove unnecessary code in prio_tree_replace
Remove the code since 'node' has already been initialized in the begin of
the function
Signed-off-by: Xiao Guangrong <xiaoguangrong@linux.vnet.ibm.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Diffstat (limited to 'lib')
| -rw-r--r-- | lib/prio_tree.c | 1 |
1 files changed, 0 insertions, 1 deletions
diff --git a/lib/prio_tree.c b/lib/prio_tree.c index ccfd850b0dec..423eba80478b 100644 --- a/lib/prio_tree.c +++ b/lib/prio_tree.c @@ -151,7 +151,6 @@ struct prio_tree_node *prio_tree_replace(struct prio_tree_root *root, * We can reduce root->index_bits here. However, it is complex * and does not help much to improve performance (IMO). */ - node->parent = node; root->prio_tree_node = node; } else { node->parent = old->parent; |