| .. | .. |
|---|
| 69 | 69 | continue; |
|---|
| 70 | 70 | } |
|---|
| 71 | 71 | } |
|---|
| 72 | | - radix_tree_delete(&root, 1); |
|---|
| 73 | | - |
|---|
| 74 | | - first = true; |
|---|
| 75 | | - radix_tree_for_each_contig(slot, &root, &iter, 0) { |
|---|
| 76 | | - printv(2, "contig %ld %p\n", iter.index, *slot); |
|---|
| 77 | | - if (first) { |
|---|
| 78 | | - radix_tree_insert(&root, 1, ptr); |
|---|
| 79 | | - first = false; |
|---|
| 80 | | - } |
|---|
| 81 | | - if (radix_tree_deref_retry(*slot)) { |
|---|
| 82 | | - printv(2, "retry at %ld\n", iter.index); |
|---|
| 83 | | - slot = radix_tree_iter_retry(&iter); |
|---|
| 84 | | - continue; |
|---|
| 85 | | - } |
|---|
| 86 | | - } |
|---|
| 87 | 72 | |
|---|
| 88 | 73 | radix_tree_for_each_slot(slot, &root, &iter, 0) { |
|---|
| 89 | 74 | printv(2, "slot %ld %p\n", iter.index, *slot); |
|---|
| 90 | | - if (!iter.index) { |
|---|
| 91 | | - printv(2, "next at %ld\n", iter.index); |
|---|
| 92 | | - slot = radix_tree_iter_resume(slot, &iter); |
|---|
| 93 | | - } |
|---|
| 94 | | - } |
|---|
| 95 | | - |
|---|
| 96 | | - radix_tree_for_each_contig(slot, &root, &iter, 0) { |
|---|
| 97 | | - printv(2, "contig %ld %p\n", iter.index, *slot); |
|---|
| 98 | 75 | if (!iter.index) { |
|---|
| 99 | 76 | printv(2, "next at %ld\n", iter.index); |
|---|
| 100 | 77 | slot = radix_tree_iter_resume(slot, &iter); |
|---|