diff options
| author | Patrick Walton <pcwalton@mimiga.net> | 2012-09-21 11:42:47 -0700 |
|---|---|---|
| committer | Patrick Walton <pcwalton@mimiga.net> | 2012-09-21 11:42:57 -0700 |
| commit | 3c2b6110ddb99e3d4b67c15321b957bdd4b37671 (patch) | |
| tree | e6283c89d5e82dc2e855ae51fb513637ac556121 /src/rt/rust_crate_map.cpp | |
| parent | a51a561852805cea58fbe106a28645e3d34b61e3 (diff) | |
| download | rust-3c2b6110ddb99e3d4b67c15321b957bdd4b37671.tar.gz rust-3c2b6110ddb99e3d4b67c15321b957bdd4b37671.zip | |
rustc: Shove the address of the box annihilator into the crate map
Diffstat (limited to 'src/rt/rust_crate_map.cpp')
| -rw-r--r-- | src/rt/rust_crate_map.cpp | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/src/rt/rust_crate_map.cpp b/src/rt/rust_crate_map.cpp index 633361bb932..9f6c18d9207 100644 --- a/src/rt/rust_crate_map.cpp +++ b/src/rt/rust_crate_map.cpp @@ -12,13 +12,13 @@ void iter_crate_map(const cratemap* map, void (*fn)(const mod_entry* map, void *cookie), void *cookie) { // First iterate this crate - iter_module_map(map->entries, fn, cookie); + iter_module_map(map->entries(), fn, cookie); // Then recurse on linked crates // FIXME (#2673) this does double work in diamond-shaped deps. could // keep a set of visited addresses, if it turns out to be actually // slow - for (size_t i = 0; map->children[i]; i++) { - iter_crate_map(map->children[i], fn, cookie); + for (cratemap::iterator i = map->begin(), e = map->end(); i != e; ++i) { + iter_crate_map(*i, fn, cookie); } } |
