aboutsummaryrefslogtreecommitdiffstats
path: root/lib
diff options
context:
space:
mode:
authorXiao Guangrong <xiaoguangrong@linux.vnet.ibm.com>2012-03-23 18:02:14 -0400
committerLinus Torvalds <torvalds@linux-foundation.org>2012-03-23 19:58:36 -0400
commitf42240d729b97a01e863b8c24177ec4e54885357 (patch)
treeeca03750275e38cba74daa9f04a0523268bfca58 /lib
parentf43804bf5f9ae1e60077c5f22aee5fdfe4f09837 (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.c1
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,
151 * We can reduce root->index_bits here. However, it is complex 151 * We can reduce root->index_bits here. However, it is complex
152 * and does not help much to improve performance (IMO). 152 * and does not help much to improve performance (IMO).
153 */ 153 */
154 node->parent = node;
155 root->prio_tree_node = node; 154 root->prio_tree_node = node;
156 } else { 155 } else {
157 node->parent = old->parent; 156 node->parent = old->parent;