renegade-project/linux-next
2
0
Fork 0
mirror of https://github.com/edk2-porting/linux-next.git synced 2024-12-15 08:44:14 +08:00
Code

trivial: Documentation/rbtree.txt: cleanup kerneldoc of rbtree.txt

Browse Source 
The first formal parameter of the rb_link_node() is a pointer, and the
 "node" is define a data struct (pls see line 67 and line 73 in the
 doc), so the actual parameter should use "&data->node".

Signed-off-by: Figo.zhang <figo.zhang@kolorific.com>
Signed-off-by: Jiri Kosina <jkosina@suse.cz>
This commit is contained in:
figo.zhang 2009-04-17 10:58:48 +08:00 committed by Jiri Kosina
parent 19f5946001
commit 27af1da4b5
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
Documentation/rbtree.txt
View File

@ -131,8 +131,8 @@ Example:
}
/* Add new node and rebalance tree. */
rb_link_node(data->node, parent, new);
rb_insert_color(data->node, root);
rb_link_node(&data->node, parent, new);
rb_insert_color(&data->node, root);
return TRUE;
}
@ -146,10 +146,10 @@ To remove an existing node from a tree, call:
Example:
struct mytype *data = mysearch(mytree, "walrus");
struct mytype *data = mysearch(&mytree, "walrus");
if (data) {
rb_erase(data->node, mytree);
rb_erase(&data->node, &mytree);
myfree(data);
}