|
| 1 | +// Copyright 2013 The Rust Project Developers. See the COPYRIGHT |
| 2 | +// file at the top-level directory of this distribution and at |
| 3 | +// http://rust-lang.org/COPYRIGHT. |
| 4 | +// |
| 5 | +// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or |
| 6 | +// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license |
| 7 | +// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your |
| 8 | +// option. This file may not be copied, modified, or distributed |
| 9 | +// except according to those terms. |
| 10 | + |
| 11 | + |
| 12 | +use libc::{c_void, c_char}; |
| 13 | +use ptr; |
| 14 | +use ptr::RawPtr; |
| 15 | +use vec; |
| 16 | +use hashmap::HashSet; |
| 17 | +use container::MutableSet; |
| 18 | + |
| 19 | +pub struct ModEntry{ |
| 20 | + name: *c_char, |
| 21 | + log_level: *mut u32 |
| 22 | +} |
| 23 | +struct CrateMapV0 { |
| 24 | + entries: *ModEntry, |
| 25 | + children: [*CrateMap, ..1] |
| 26 | +} |
| 27 | + |
| 28 | +struct CrateMap { |
| 29 | + version: i32, |
| 30 | + annihilate_fn: *c_void, |
| 31 | + entries: *ModEntry, |
| 32 | + /// a dynamically sized struct, where all pointers to children are listed adjacent |
| 33 | + /// to the struct, terminated with NULL |
| 34 | + children: [*CrateMap, ..1] |
| 35 | +} |
| 36 | + |
| 37 | +unsafe fn version(crate_map: *CrateMap) -> i32 { |
| 38 | + match (*crate_map).version { |
| 39 | + 1 => return 1, |
| 40 | + _ => return 0 |
| 41 | + } |
| 42 | +} |
| 43 | + |
| 44 | +/// Returns a pointer to the annihilate function of the CrateMap |
| 45 | +pub unsafe fn annihilate_fn(crate_map: *CrateMap) -> *c_void { |
| 46 | + match version(crate_map) { |
| 47 | + 0 => return ptr::null(), |
| 48 | + 1 => return (*crate_map).annihilate_fn, |
| 49 | + _ => fail!("Unknown crate map version!") |
| 50 | + } |
| 51 | +} |
| 52 | + |
| 53 | +unsafe fn entries(crate_map: *CrateMap) -> *ModEntry { |
| 54 | + match version(crate_map) { |
| 55 | + 0 => { |
| 56 | + let v0 = crate_map as (*CrateMapV0); |
| 57 | + return (*v0).entries; |
| 58 | + } |
| 59 | + 1 => return (*crate_map).entries, |
| 60 | + _ => fail!("Unknown crate map version!") |
| 61 | + } |
| 62 | +} |
| 63 | + |
| 64 | +unsafe fn iterator(crate_map: *CrateMap) -> **CrateMap { |
| 65 | + match version(crate_map) { |
| 66 | + 0 => { |
| 67 | + let v0 = crate_map as (*CrateMapV0); |
| 68 | + return vec::raw::to_ptr((*v0).children); |
| 69 | + } |
| 70 | + 1 => return vec::raw::to_ptr((*crate_map).children), |
| 71 | + _ => fail!("Unknown crate map version!") |
| 72 | + } |
| 73 | +} |
| 74 | + |
| 75 | +unsafe fn iter_module_map(mod_entries: *ModEntry, f: &fn(*mut ModEntry)) { |
| 76 | + let mut curr = mod_entries; |
| 77 | + |
| 78 | + while !(*curr).name.is_null() { |
| 79 | + f(curr as *mut ModEntry); |
| 80 | + curr = curr.offset(1); |
| 81 | + } |
| 82 | +} |
| 83 | + |
| 84 | +unsafe fn do_iter_crate_map(crate_map: *CrateMap, f: &fn(*mut ModEntry), |
| 85 | + visited: &mut HashSet<*CrateMap>) { |
| 86 | + if visited.insert(crate_map) { |
| 87 | + iter_module_map(entries(crate_map), |x| f(x)); |
| 88 | + let child_crates = iterator(crate_map); |
| 89 | + do ptr::array_each(child_crates) |child| { |
| 90 | + do_iter_crate_map(child, |x| f(x), visited); |
| 91 | + } |
| 92 | + } |
| 93 | +} |
| 94 | + |
| 95 | +/// Iterates recursively over `crate_map` and all child crate maps |
| 96 | +pub unsafe fn iter_crate_map(crate_map: *CrateMap, f: &fn(*mut ModEntry)) { |
| 97 | + // XXX: use random numbers as keys from the OS-level RNG when there is a nice |
| 98 | + // way to do this |
| 99 | + let mut v: HashSet<*CrateMap> = HashSet::with_capacity_and_keys(0, 0, 32); |
| 100 | + do_iter_crate_map(crate_map, f, &mut v); |
| 101 | +} |
| 102 | + |
| 103 | +#[test] |
| 104 | +fn iter_crate_map_duplicates() { |
| 105 | + use c_str::ToCStr; |
| 106 | + use cast::transmute; |
| 107 | + |
| 108 | + struct CrateMapT3 { |
| 109 | + version: i32, |
| 110 | + annihilate_fn: *c_void, |
| 111 | + entries: *ModEntry, |
| 112 | + children: [*CrateMap, ..3] |
| 113 | + } |
| 114 | + |
| 115 | + unsafe { |
| 116 | + let mod_name1 = "c::m1".to_c_str(); |
| 117 | + let mut level3: u32 = 3; |
| 118 | + |
| 119 | + let entries: ~[ModEntry] = ~[ |
| 120 | + ModEntry { name: mod_name1.with_ref(|buf| buf), log_level: &mut level3}, |
| 121 | + ModEntry { name: ptr::null(), log_level: ptr::mut_null()} |
| 122 | + ]; |
| 123 | + let child_crate = CrateMap { |
| 124 | + version: 1, |
| 125 | + annihilate_fn: ptr::null(), |
| 126 | + entries: vec::raw::to_ptr(entries), |
| 127 | + children: [ptr::null()] |
| 128 | + }; |
| 129 | + |
| 130 | + let root_crate = CrateMapT3 { |
| 131 | + version: 1, annihilate_fn: ptr::null(), |
| 132 | + entries: vec::raw::to_ptr([ModEntry { name: ptr::null(), log_level: ptr::mut_null()}]), |
| 133 | + children: [&child_crate as *CrateMap, &child_crate as *CrateMap, ptr::null()] |
| 134 | + }; |
| 135 | + |
| 136 | + let mut cnt = 0; |
| 137 | + do iter_crate_map(transmute(&root_crate)) |entry| { |
| 138 | + assert!(*(*entry).log_level == 3); |
| 139 | + cnt += 1; |
| 140 | + } |
| 141 | + assert!(cnt == 1); |
| 142 | + } |
| 143 | +} |
| 144 | + |
| 145 | +#[test] |
| 146 | +fn iter_crate_map_follow_children() { |
| 147 | + use c_str::ToCStr; |
| 148 | + use cast::transmute; |
| 149 | + |
| 150 | + struct CrateMapT2 { |
| 151 | + version: i32, |
| 152 | + annihilate_fn: *c_void, |
| 153 | + entries: *ModEntry, |
| 154 | + children: [*CrateMap, ..2] |
| 155 | + } |
| 156 | + |
| 157 | + unsafe { |
| 158 | + let mod_name1 = "c::m1".to_c_str(); |
| 159 | + let mod_name2 = "c::m2".to_c_str(); |
| 160 | + let mut level2: u32 = 2; |
| 161 | + let mut level3: u32 = 3; |
| 162 | + let child_crate2 = CrateMap { |
| 163 | + version: 1, |
| 164 | + annihilate_fn: ptr::null(), |
| 165 | + entries: vec::raw::to_ptr([ |
| 166 | + ModEntry { name: mod_name1.with_ref(|buf| buf), log_level: &mut level2}, |
| 167 | + ModEntry { name: mod_name2.with_ref(|buf| buf), log_level: &mut level3}, |
| 168 | + ModEntry { name: ptr::null(), log_level: ptr::mut_null()} |
| 169 | + ]), |
| 170 | + children: [ptr::null()] |
| 171 | + }; |
| 172 | + |
| 173 | + let child_crate1 = CrateMapT2 { |
| 174 | + version: 1, |
| 175 | + annihilate_fn: ptr::null(), |
| 176 | + entries: vec::raw::to_ptr([ |
| 177 | + ModEntry { name: "t::f1".to_c_str().with_ref(|buf| buf), log_level: &mut 1}, |
| 178 | + ModEntry { name: ptr::null(), log_level: ptr::mut_null()} |
| 179 | + ]), |
| 180 | + children: [&child_crate2 as *CrateMap, ptr::null()] |
| 181 | + }; |
| 182 | + |
| 183 | + let child_crate1_ptr: *CrateMap = transmute(&child_crate1); |
| 184 | + let root_crate = CrateMapT2 { |
| 185 | + version: 1, annihilate_fn: ptr::null(), |
| 186 | + entries: vec::raw::to_ptr([ |
| 187 | + ModEntry { name: "t::f1".to_c_str().with_ref(|buf| buf), log_level: &mut 0}, |
| 188 | + ModEntry { name: ptr::null(), log_level: ptr::mut_null()} |
| 189 | + ]), |
| 190 | + children: [child_crate1_ptr, ptr::null()] |
| 191 | + }; |
| 192 | + |
| 193 | + let mut cnt = 0; |
| 194 | + do iter_crate_map(transmute(&root_crate)) |entry| { |
| 195 | + assert!(*(*entry).log_level == cnt); |
| 196 | + cnt += 1; |
| 197 | + } |
| 198 | + assert!(cnt == 4); |
| 199 | + } |
| 200 | +} |
0 commit comments