From 53a72efef4946ceda3cbf7e86c014ac36f5fd1db Mon Sep 17 00:00:00 2001 From: Nikanth Karthikesan Date: Thu, 25 Feb 2010 14:44:56 +0530 Subject: [PATCH] --- yaml --- r: 187779 b: refs/heads/master c: 3e58974027b04e84f68b964ef368a6cd758e2f84 h: refs/heads/master i: 187777: df49014d4eb67915bf92fec4fb87276d85615c90 187775: ef71e1eddfdd3322af862b79181f38f966a5cf38 v: v3 --- [refs] | 2 +- trunk/include/linux/rbtree.h | 8 ++++---- 2 files changed, 5 insertions(+), 5 deletions(-) diff --git a/[refs] b/[refs] index 56b09cf88a57..20c4136554f6 100644 --- a/[refs] +++ b/[refs] @@ -1,2 +1,2 @@ --- -refs/heads/master: 7c821a179f91c3ad52588400ce52a7fb48b9868c +refs/heads/master: 3e58974027b04e84f68b964ef368a6cd758e2f84 diff --git a/trunk/include/linux/rbtree.h b/trunk/include/linux/rbtree.h index 9c295411d01f..5210a5c60877 100644 --- a/trunk/include/linux/rbtree.h +++ b/trunk/include/linux/rbtree.h @@ -25,10 +25,10 @@ Some example of insert and search follows here. The search is a plain normal search over an ordered tree. The insert instead must be implemented - int two steps: as first thing the code must insert the element in - order as a red leaf in the tree, then the support library function - rb_insert_color() must be called. Such function will do the - not trivial work to rebalance the rbtree if necessary. + in two steps: First, the code must insert the element in order as a red leaf + in the tree, and then the support library function rb_insert_color() must + be called. Such function will do the not trivial work to rebalance the + rbtree, if necessary. ----------------------------------------------------------------------- static inline struct page * rb_search_page_cache(struct inode * inode,