Hi all,
I am going through the function
int
rn_walktree (register struct radix_node *rn,
rn_walk_function f, ...)
defined in radix.c file. I have doubt about following
while loop in that function.
/* If at right child go back up, otherwise, go right
*/
while (rn->rn_p->rn_r == rn && (rn->rn_flags &
RNF_ROOT) == 0)
rn = rn->rn_p;
Looking at the complete function, I think
(rn->rn_flags & RNF_ROOT) == 0
check in above while loop is unnecessary. I say this
because of following lines down below in the function.
if (rn->rn_flags & RNF_ROOT) {
return (0);
}
Am I missing anything? Any insight...?
TIA,
Rathi
__________________________________________________
Do You Yahoo!?
Listen to your Yahoo! Mail messages from any phone.
http://phone.yahoo.com
To Unsubscribe: send mail to [EMAIL PROTECTED]
with "unsubscribe freebsd-net" in the body of the message
