diff options
| author | Wang Shilong <[email protected]> | 2014-01-29 00:25:34 +0800 |
|---|---|---|
| committer | Chris Mason <[email protected]> | 2014-01-29 07:06:27 -0800 |
| commit | 4c7a6f74ceeafd738b55d1c57349327f7ea8e895 (patch) | |
| tree | eb3d4c6e6406490e6c31ee4da3512506daddc4b8 /net/lapb/lapb_out.c | |
| parent | f05c474688762f186b16a26366755b6ef0bfed0c (diff) | |
Btrfs: rework ulist with list+rb_tree
We are really suffering from now ulist's implementation, some developers
gave their try, and i just gave some of my ideas for things:
1. use list+rb_tree instead of arrary+rb_tree
2. add cur_list to iterator rather than ulist structure.
3. add seqnum into every node when they are added, this is
used to do selfcheck when iterating node.
I noticed Zach Brown's comments before, long term is to kick off
ulist implementation, however, for now, we need at least avoid
arrary from ulist.
Cc: Liu Bo <[email protected]>
Cc: Josef Bacik <[email protected]>
Cc: Zach Brown <[email protected]>
Signed-off-by: Wang Shilong <[email protected]>
Signed-off-by: Josef Bacik <[email protected]>
Signed-off-by: Chris Mason <[email protected]>
Diffstat (limited to 'net/lapb/lapb_out.c')
0 files changed, 0 insertions, 0 deletions