diff options
| author | figo.zhang <figo.zhang@kolorific.com> | 2009-04-17 06:58:48 +0400 |
|---|---|---|
| committer | Jiri Kosina <jkosina@suse.cz> | 2009-06-12 20:01:47 +0400 |
| commit | 27af1da4b58675d5c6bacf9b7de9c2746687d272 (patch) | |
| tree | 04ba17bbf2799812e018dcadbb7c38bcf0c6c653 /Documentation/rbtree.txt | |
| parent | 19f594600110377ec4037fdf7fb93a25ec516212 (diff) | |
| download | linux-27af1da4b58675d5c6bacf9b7de9c2746687d272.tar.xz | |
trivial: Documentation/rbtree.txt: cleanup kerneldoc of rbtree.txt
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>
Diffstat (limited to 'Documentation/rbtree.txt')
| -rw-r--r-- | Documentation/rbtree.txt | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/Documentation/rbtree.txt b/Documentation/rbtree.txt index 7224459b469e..77102148e67b 100644 --- a/Documentation/rbtree.txt +++ b/Documentation/rbtree.txt @@ -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); } |