1 // Copyright 2012-2015 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.
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.
11 //! Finds crate binaries and loads their metadata
13 //! Might I be the first to welcome you to a world of platform differences,
14 //! version requirements, dependency graphs, conflicting desires, and fun! This
15 //! is the major guts (along with metadata::creader) of the compiler for loading
16 //! crates and resolving dependencies. Let's take a tour!
20 //! Each invocation of the compiler is immediately concerned with one primary
21 //! problem, to connect a set of crates to resolved crates on the filesystem.
22 //! Concretely speaking, the compiler follows roughly these steps to get here:
24 //! 1. Discover a set of `extern crate` statements.
25 //! 2. Transform these directives into crate names. If the directive does not
26 //! have an explicit name, then the identifier is the name.
27 //! 3. For each of these crate names, find a corresponding crate on the
30 //! Sounds easy, right? Let's walk into some of the nuances.
32 //! ## Transitive Dependencies
34 //! Let's say we've got three crates: A, B, and C. A depends on B, and B depends
35 //! on C. When we're compiling A, we primarily need to find and locate B, but we
36 //! also end up needing to find and locate C as well.
38 //! The reason for this is that any of B's types could be composed of C's types,
39 //! any function in B could return a type from C, etc. To be able to guarantee
40 //! that we can always typecheck/translate any function, we have to have
41 //! complete knowledge of the whole ecosystem, not just our immediate
44 //! So now as part of the "find a corresponding crate on the filesystem" step
45 //! above, this involves also finding all crates for *all upstream
46 //! dependencies*. This includes all dependencies transitively.
48 //! ## Rlibs and Dylibs
50 //! The compiler has two forms of intermediate dependencies. These are dubbed
51 //! rlibs and dylibs for the static and dynamic variants, respectively. An rlib
52 //! is a rustc-defined file format (currently just an ar archive) while a dylib
53 //! is a platform-defined dynamic library. Each library has a metadata somewhere
56 //! When translating a crate name to a crate on the filesystem, we all of a
57 //! sudden need to take into account both rlibs and dylibs! Linkage later on may
58 //! use either one of these files, as each has their pros/cons. The job of crate
59 //! loading is to discover what's possible by finding all candidates.
61 //! Most parts of this loading systems keep the dylib/rlib as just separate
66 //! We can't exactly scan your whole hard drive when looking for dependencies,
67 //! so we need to places to look. Currently the compiler will implicitly add the
68 //! target lib search path ($prefix/lib/rustlib/$target/lib) to any compilation,
69 //! and otherwise all -L flags are added to the search paths.
71 //! ## What criterion to select on?
73 //! This a pretty tricky area of loading crates. Given a file, how do we know
74 //! whether it's the right crate? Currently, the rules look along these lines:
76 //! 1. Does the filename match an rlib/dylib pattern? That is to say, does the
77 //! filename have the right prefix/suffix?
78 //! 2. Does the filename have the right prefix for the crate name being queried?
79 //! This is filtering for files like `libfoo*.rlib` and such.
80 //! 3. Is the file an actual rust library? This is done by loading the metadata
81 //! from the library and making sure it's actually there.
82 //! 4. Does the name in the metadata agree with the name of the library?
83 //! 5. Does the target in the metadata agree with the current target?
84 //! 6. Does the SVH match? (more on this later)
86 //! If the file answers `yes` to all these questions, then the file is
87 //! considered as being *candidate* for being accepted. It is illegal to have
88 //! more than two candidates as the compiler has no method by which to resolve
89 //! this conflict. Additionally, rlib/dylib candidates are considered
92 //! After all this has happened, we have 1 or two files as candidates. These
93 //! represent the rlib/dylib file found for a library, and they're returned as
96 //! ### What about versions?
98 //! A lot of effort has been put forth to remove versioning from the compiler.
99 //! There have been forays in the past to have versioning baked in, but it was
100 //! largely always deemed insufficient to the point that it was recognized that
101 //! it's probably something the compiler shouldn't do anyway due to its
102 //! complicated nature and the state of the half-baked solutions.
104 //! With a departure from versioning, the primary criterion for loading crates
105 //! is just the name of a crate. If we stopped here, it would imply that you
106 //! could never link two crates of the same name from different sources
107 //! together, which is clearly a bad state to be in.
109 //! To resolve this problem, we come to the next section!
113 //! A number of flags have been added to the compiler to solve the "version
114 //! problem" in the previous section, as well as generally enabling more
115 //! powerful usage of the crate loading system of the compiler. The goal of
116 //! these flags and options are to enable third-party tools to drive the
117 //! compiler with prior knowledge about how the world should look.
119 //! ## The `--extern` flag
121 //! The compiler accepts a flag of this form a number of times:
124 //! --extern crate-name=path/to/the/crate.rlib
127 //! This flag is basically the following letter to the compiler:
131 //! > When you are attempting to load the immediate dependency `crate-name`, I
132 //! > would like you to assume that the library is located at
133 //! > `path/to/the/crate.rlib`, and look nowhere else. Also, please do not
134 //! > assume that the path I specified has the name `crate-name`.
136 //! This flag basically overrides most matching logic except for validating that
137 //! the file is indeed a rust library. The same `crate-name` can be specified
138 //! twice to specify the rlib/dylib pair.
140 //! ## Enabling "multiple versions"
142 //! This basically boils down to the ability to specify arbitrary packages to
143 //! the compiler. For example, if crate A wanted to use Bv1 and Bv2, then it
144 //! would look something like:
153 //! and the compiler would be invoked as:
156 //! rustc a.rs --extern b1=path/to/libb1.rlib --extern b2=path/to/libb2.rlib
159 //! In this scenario there are two crates named `b` and the compiler must be
160 //! manually driven to be informed where each crate is.
162 //! ## Frobbing symbols
164 //! One of the immediate problems with linking the same library together twice
165 //! in the same problem is dealing with duplicate symbols. The primary way to
166 //! deal with this in rustc is to add hashes to the end of each symbol.
168 //! In order to force hashes to change between versions of a library, if
169 //! desired, the compiler exposes an option `-C metadata=foo`, which is used to
170 //! initially seed each symbol hash. The string `foo` is prepended to each
171 //! string-to-hash to ensure that symbols change over time.
173 //! ## Loading transitive dependencies
175 //! Dealing with same-named-but-distinct crates is not just a local problem, but
176 //! one that also needs to be dealt with for transitive dependencies. Note that
177 //! in the letter above `--extern` flags only apply to the *local* set of
178 //! dependencies, not the upstream transitive dependencies. Consider this
179 //! dependency graph:
191 //! In this scenario, when we compile `D`, we need to be able to distinctly
192 //! resolve `A.1` and `A.2`, but an `--extern` flag cannot apply to these
193 //! transitive dependencies.
195 //! Note that the key idea here is that `B` and `C` are both *already compiled*.
196 //! That is, they have already resolved their dependencies. Due to unrelated
197 //! technical reasons, when a library is compiled, it is only compatible with
198 //! the *exact same* version of the upstream libraries it was compiled against.
199 //! We use the "Strict Version Hash" to identify the exact copy of an upstream
202 //! With this knowledge, we know that `B` and `C` will depend on `A` with
203 //! different SVH values, so we crawl the normal `-L` paths looking for
204 //! `liba*.rlib` and filter based on the contained SVH.
206 //! In the end, this ends up not needing `--extern` to specify upstream
207 //! transitive dependencies.
211 //! That's the general overview of loading crates in the compiler, but it's by
212 //! no means all of the necessary details. Take a look at the rest of
213 //! metadata::loader or metadata::creader for all the juicy details!
215 use cstore::{MetadataBlob, MetadataVec, MetadataArchive};
219 use rustc::back::svh::Svh;
220 use rustc::session::Session;
221 use rustc::session::filesearch::{FileSearch, FileMatches, FileDoesntMatch};
222 use rustc::session::search_paths::PathKind;
223 use rustc::util::common;
225 use rustc_llvm as llvm;
226 use rustc_llvm::{False, ObjectFile, mk_section_iter};
227 use rustc_llvm::archive_ro::ArchiveRO;
228 use syntax::codemap::Span;
229 use syntax::errors::Handler;
230 use rustc_back::target::Target;
233 use std::collections::HashMap;
235 use std::io::prelude::*;
237 use std::path::{Path, PathBuf};
240 use std::time::Instant;
244 pub struct CrateMismatch {
249 pub struct Context<'a> {
250 pub sess: &'a Session,
253 pub crate_name: &'a str,
254 pub hash: Option<&'a Svh>,
255 // points to either self.sess.target.target or self.sess.host, must match triple
256 pub target: &'a Target,
258 pub filesearch: FileSearch<'a>,
259 pub root: &'a Option<CratePaths>,
260 pub rejected_via_hash: Vec<CrateMismatch>,
261 pub rejected_via_triple: Vec<CrateMismatch>,
262 pub rejected_via_kind: Vec<CrateMismatch>,
263 pub should_match_name: bool,
267 pub dylib: Option<(PathBuf, PathKind)>,
268 pub rlib: Option<(PathBuf, PathKind)>,
269 pub metadata: MetadataBlob,
272 pub struct ArchiveMetadata {
274 // points into self._archive
278 pub struct CratePaths {
280 pub dylib: Option<PathBuf>,
281 pub rlib: Option<PathBuf>
284 pub const METADATA_FILENAME: &'static str = "rust.metadata.bin";
287 fn paths(&self) -> Vec<PathBuf> {
288 match (&self.dylib, &self.rlib) {
289 (&None, &None) => vec!(),
290 (&Some(ref p), &None) |
291 (&None, &Some(ref p)) => vec!(p.clone()),
292 (&Some(ref p1), &Some(ref p2)) => vec!(p1.clone(), p2.clone()),
297 impl<'a> Context<'a> {
298 pub fn maybe_load_library_crate(&mut self) -> Option<Library> {
299 self.find_library_crate()
302 pub fn load_library_crate(&mut self) -> Library {
303 match self.find_library_crate() {
306 self.report_load_errs();
312 pub fn report_load_errs(&mut self) {
313 let add = match self.root {
314 &None => String::new(),
315 &Some(ref r) => format!(" which `{}` depends on",
318 if !self.rejected_via_hash.is_empty() {
319 span_err!(self.sess, self.span, E0460,
320 "found possibly newer version of crate `{}`{}",
322 } else if !self.rejected_via_triple.is_empty() {
323 span_err!(self.sess, self.span, E0461,
324 "couldn't find crate `{}` with expected target triple {}{}",
325 self.ident, self.triple, add);
326 } else if !self.rejected_via_kind.is_empty() {
327 span_err!(self.sess, self.span, E0462,
328 "found staticlib `{}` instead of rlib or dylib{}",
331 span_err!(self.sess, self.span, E0463,
332 "can't find crate for `{}`{}",
336 if !self.rejected_via_triple.is_empty() {
337 let mismatches = self.rejected_via_triple.iter();
338 for (i, &CrateMismatch{ ref path, ref got }) in mismatches.enumerate() {
339 self.sess.fileline_note(self.span,
340 &format!("crate `{}`, path #{}, triple {}: {}",
341 self.ident, i+1, got, path.display()));
344 if !self.rejected_via_hash.is_empty() {
345 self.sess.span_note(self.span, "perhaps this crate needs \
347 let mismatches = self.rejected_via_hash.iter();
348 for (i, &CrateMismatch{ ref path, .. }) in mismatches.enumerate() {
349 self.sess.fileline_note(self.span,
350 &format!("crate `{}` path #{}: {}",
351 self.ident, i+1, path.display()));
356 for (i, path) in r.paths().iter().enumerate() {
357 self.sess.fileline_note(self.span,
358 &format!("crate `{}` path #{}: {}",
359 r.ident, i+1, path.display()));
364 if !self.rejected_via_kind.is_empty() {
365 self.sess.fileline_help(self.span, "please recompile this crate using \
367 let mismatches = self.rejected_via_kind.iter();
368 for (i, &CrateMismatch { ref path, .. }) in mismatches.enumerate() {
369 self.sess.fileline_note(self.span,
370 &format!("crate `{}` path #{}: {}",
371 self.ident, i+1, path.display()));
374 self.sess.abort_if_errors();
377 fn find_library_crate(&mut self) -> Option<Library> {
378 // If an SVH is specified, then this is a transitive dependency that
379 // must be loaded via -L plus some filtering.
380 if self.hash.is_none() {
381 self.should_match_name = false;
382 if let Some(s) = self.sess.opts.externs.get(self.crate_name) {
383 return self.find_commandline_library(s);
385 self.should_match_name = true;
388 let dypair = self.dylibname();
390 // want: crate_name.dir_part() + prefix + crate_name.file_part + "-"
391 let dylib_prefix = format!("{}{}", dypair.0, self.crate_name);
392 let rlib_prefix = format!("lib{}", self.crate_name);
393 let staticlib_prefix = format!("lib{}", self.crate_name);
395 let mut candidates = HashMap::new();
396 let mut staticlibs = vec!();
398 // First, find all possible candidate rlibs and dylibs purely based on
399 // the name of the files themselves. We're trying to match against an
400 // exact crate name and a possibly an exact hash.
402 // During this step, we can filter all found libraries based on the
403 // name and id found in the crate id (we ignore the path portion for
404 // filename matching), as well as the exact hash (if specified). If we
405 // end up having many candidates, we must look at the metadata to
406 // perform exact matches against hashes/crate ids. Note that opening up
407 // the metadata is where we do an exact match against the full contents
408 // of the crate id (path/name/id).
410 // The goal of this step is to look at as little metadata as possible.
411 self.filesearch.search(|path, kind| {
412 let file = match path.file_name().and_then(|s| s.to_str()) {
413 None => return FileDoesntMatch,
416 let (hash, rlib) = if file.starts_with(&rlib_prefix[..]) &&
417 file.ends_with(".rlib") {
418 (&file[(rlib_prefix.len()) .. (file.len() - ".rlib".len())],
420 } else if file.starts_with(&dylib_prefix) &&
421 file.ends_with(&dypair.1) {
422 (&file[(dylib_prefix.len()) .. (file.len() - dypair.1.len())],
425 if file.starts_with(&staticlib_prefix[..]) &&
426 file.ends_with(".a") {
427 staticlibs.push(CrateMismatch {
428 path: path.to_path_buf(),
429 got: "static".to_string()
432 return FileDoesntMatch
434 info!("lib candidate: {}", path.display());
436 let hash_str = hash.to_string();
437 let slot = candidates.entry(hash_str)
438 .or_insert_with(|| (HashMap::new(), HashMap::new()));
439 let (ref mut rlibs, ref mut dylibs) = *slot;
440 fs::canonicalize(path).map(|p| {
442 rlibs.insert(p, kind);
444 dylibs.insert(p, kind);
447 }).unwrap_or(FileDoesntMatch)
449 self.rejected_via_kind.extend(staticlibs);
451 // We have now collected all known libraries into a set of candidates
452 // keyed of the filename hash listed. For each filename, we also have a
453 // list of rlibs/dylibs that apply. Here, we map each of these lists
454 // (per hash), to a Library candidate for returning.
456 // A Library candidate is created if the metadata for the set of
457 // libraries corresponds to the crate id and hash criteria that this
458 // search is being performed for.
459 let mut libraries = Vec::new();
460 for (_hash, (rlibs, dylibs)) in candidates {
461 let mut metadata = None;
462 let rlib = self.extract_one(rlibs, "rlib", &mut metadata);
463 let dylib = self.extract_one(dylibs, "dylib", &mut metadata);
466 libraries.push(Library {
476 // Having now translated all relevant found hashes into libraries, see
477 // what we've got and figure out if we found multiple candidates for
479 match libraries.len() {
481 1 => Some(libraries.into_iter().next().unwrap()),
483 span_err!(self.sess, self.span, E0464,
484 "multiple matching crates for `{}`",
486 self.sess.note("candidates:");
487 for lib in &libraries {
489 Some((ref p, _)) => {
490 self.sess.note(&format!("path: {}",
496 Some((ref p, _)) => {
497 self.sess.note(&format!("path: {}",
502 let data = lib.metadata.as_slice();
503 let name = decoder::get_crate_name(data);
504 note_crate_name(self.sess.diagnostic(), &name);
511 // Attempts to extract *one* library from the set `m`. If the set has no
512 // elements, `None` is returned. If the set has more than one element, then
513 // the errors and notes are emitted about the set of libraries.
515 // With only one library in the set, this function will extract it, and then
516 // read the metadata from it if `*slot` is `None`. If the metadata couldn't
517 // be read, it is assumed that the file isn't a valid rust library (no
518 // errors are emitted).
519 fn extract_one(&mut self, m: HashMap<PathBuf, PathKind>, flavor: &str,
520 slot: &mut Option<MetadataBlob>) -> Option<(PathBuf, PathKind)> {
521 let mut ret = None::<(PathBuf, PathKind)>;
525 // FIXME(#10786): for an optimization, we only read one of the
526 // library's metadata sections. In theory we should
527 // read both, but reading dylib metadata is quite
531 } else if m.len() == 1 {
532 return Some(m.into_iter().next().unwrap())
536 for (lib, kind) in m {
537 info!("{} reading metadata from: {}", flavor, lib.display());
538 let metadata = match get_metadata_section(self.target, &lib) {
540 if self.crate_matches(blob.as_slice(), &lib) {
543 info!("metadata mismatch");
548 info!("no metadata found: {}", err);
552 // If we've already found a candidate and we're not matching hashes,
553 // emit an error about duplicate candidates found. If we're matching
554 // based on a hash, however, then if we've gotten this far both
555 // candidates have the same hash, so they're not actually
556 // duplicates that we should warn about.
557 if ret.is_some() && self.hash.is_none() {
558 span_err!(self.sess, self.span, E0465,
559 "multiple {} candidates for `{}` found",
560 flavor, self.crate_name);
561 self.sess.span_note(self.span,
562 &format!(r"candidate #1: {}",
563 ret.as_ref().unwrap().0
570 self.sess.span_note(self.span,
571 &format!(r"candidate #{}: {}", error,
575 *slot = Some(metadata);
576 ret = Some((lib, kind));
578 return if error > 0 {None} else {ret}
581 fn crate_matches(&mut self, crate_data: &[u8], libpath: &Path) -> bool {
582 if self.should_match_name {
583 match decoder::maybe_get_crate_name(crate_data) {
584 Some(ref name) if self.crate_name == *name => {}
585 _ => { info!("Rejecting via crate name"); return false }
588 let hash = match decoder::maybe_get_crate_hash(crate_data) {
589 Some(hash) => hash, None => {
590 info!("Rejecting via lack of crate hash");
595 let triple = match decoder::get_crate_triple(crate_data) {
596 None => { debug!("triple not present"); return false }
599 if triple != self.triple {
600 info!("Rejecting via crate triple: expected {} got {}", self.triple, triple);
601 self.rejected_via_triple.push(CrateMismatch {
602 path: libpath.to_path_buf(),
603 got: triple.to_string()
612 info!("Rejecting via hash: expected {} got {}", *myhash, hash);
613 self.rejected_via_hash.push(CrateMismatch {
614 path: libpath.to_path_buf(),
615 got: myhash.as_str().to_string()
626 // Returns the corresponding (prefix, suffix) that files need to have for
628 fn dylibname(&self) -> (String, String) {
629 let t = &self.target;
630 (t.options.dll_prefix.clone(), t.options.dll_suffix.clone())
633 fn find_commandline_library(&mut self, locs: &[String]) -> Option<Library> {
634 // First, filter out all libraries that look suspicious. We only accept
635 // files which actually exist that have the correct naming scheme for
637 let sess = self.sess;
638 let dylibname = self.dylibname();
639 let mut rlibs = HashMap::new();
640 let mut dylibs = HashMap::new();
642 let locs = locs.iter().map(|l| PathBuf::from(l)).filter(|loc| {
644 sess.err(&format!("extern location for {} does not exist: {}",
645 self.crate_name, loc.display()));
648 let file = match loc.file_name().and_then(|s| s.to_str()) {
651 sess.err(&format!("extern location for {} is not a file: {}",
652 self.crate_name, loc.display()));
656 if file.starts_with("lib") && file.ends_with(".rlib") {
659 let (ref prefix, ref suffix) = dylibname;
660 if file.starts_with(&prefix[..]) &&
661 file.ends_with(&suffix[..]) {
665 sess.err(&format!("extern location for {} is of an unknown type: {}",
666 self.crate_name, loc.display()));
670 // Now that we have an iterator of good candidates, make sure
671 // there's at most one rlib and at most one dylib.
673 if loc.file_name().unwrap().to_str().unwrap().ends_with(".rlib") {
674 rlibs.insert(fs::canonicalize(&loc).unwrap(),
675 PathKind::ExternFlag);
677 dylibs.insert(fs::canonicalize(&loc).unwrap(),
678 PathKind::ExternFlag);
683 // Extract the rlib/dylib pair.
684 let mut metadata = None;
685 let rlib = self.extract_one(rlibs, "rlib", &mut metadata);
686 let dylib = self.extract_one(dylibs, "dylib", &mut metadata);
688 if rlib.is_none() && dylib.is_none() { return None }
690 Some(metadata) => Some(Library {
700 pub fn note_crate_name(diag: &Handler, name: &str) {
701 diag.note(&format!("crate name: {}", name));
704 impl ArchiveMetadata {
705 fn new(ar: ArchiveRO) -> Option<ArchiveMetadata> {
707 let section = ar.iter().find(|sect| {
708 sect.name() == Some(METADATA_FILENAME)
711 Some(s) => s.data() as *const [u8],
713 debug!("didn't find '{}' in the archive", METADATA_FILENAME);
719 Some(ArchiveMetadata {
725 pub fn as_slice<'a>(&'a self) -> &'a [u8] { unsafe { &*self.data } }
728 // Just a small wrapper to time how long reading metadata takes.
729 fn get_metadata_section(target: &Target, filename: &Path)
730 -> Result<MetadataBlob, String> {
731 let start = Instant::now();
732 let ret = get_metadata_section_imp(target, filename);
733 info!("reading {:?} => {:?}", filename.file_name().unwrap(),
738 fn get_metadata_section_imp(target: &Target, filename: &Path)
739 -> Result<MetadataBlob, String> {
740 if !filename.exists() {
741 return Err(format!("no such file: '{}'", filename.display()));
743 if filename.file_name().unwrap().to_str().unwrap().ends_with(".rlib") {
744 // Use ArchiveRO for speed here, it's backed by LLVM and uses mmap
745 // internally to read the file. We also avoid even using a memcpy by
746 // just keeping the archive along while the metadata is in use.
747 let archive = match ArchiveRO::open(filename) {
750 debug!("llvm didn't like `{}`", filename.display());
751 return Err(format!("failed to read rlib metadata: '{}'",
752 filename.display()));
755 return match ArchiveMetadata::new(archive).map(|ar| MetadataArchive(ar)) {
756 None => Err(format!("failed to read rlib metadata: '{}'",
757 filename.display())),
758 Some(blob) => Ok(blob)
762 let buf = common::path2cstr(filename);
763 let mb = llvm::LLVMRustCreateMemoryBufferWithContentsOfFile(buf.as_ptr());
764 if mb as isize == 0 {
765 return Err(format!("error reading library: '{}'",
768 let of = match ObjectFile::new(mb) {
771 return Err((format!("provided path not an object file: '{}'",
772 filename.display())))
775 let si = mk_section_iter(of.llof);
776 while llvm::LLVMIsSectionIteratorAtEnd(of.llof, si.llsi) == False {
777 let mut name_buf = ptr::null();
778 let name_len = llvm::LLVMRustGetSectionName(si.llsi, &mut name_buf);
779 let name = slice::from_raw_parts(name_buf as *const u8,
780 name_len as usize).to_vec();
781 let name = String::from_utf8(name).unwrap();
782 debug!("get_metadata_section: name {}", name);
783 if read_meta_section_name(target) == name {
784 let cbuf = llvm::LLVMGetSectionContents(si.llsi);
785 let csz = llvm::LLVMGetSectionSize(si.llsi) as usize;
786 let cvbuf: *const u8 = cbuf as *const u8;
787 let vlen = encoder::metadata_encoding_version.len();
788 debug!("checking {} bytes of metadata-version stamp",
790 let minsz = cmp::min(vlen, csz);
791 let buf0 = slice::from_raw_parts(cvbuf, minsz);
792 let version_ok = buf0 == encoder::metadata_encoding_version;
794 return Err((format!("incompatible metadata version found: '{}'",
795 filename.display())));
798 let cvbuf1 = cvbuf.offset(vlen as isize);
799 debug!("inflating {} bytes of compressed metadata",
801 let bytes = slice::from_raw_parts(cvbuf1, csz - vlen);
802 match flate::inflate_bytes(bytes) {
803 Ok(inflated) => return Ok(MetadataVec(inflated)),
807 llvm::LLVMMoveToNextSection(si.llsi);
809 Err(format!("metadata not found: '{}'", filename.display()))
813 pub fn meta_section_name(target: &Target) -> &'static str {
814 if target.options.is_like_osx {
815 "__DATA,__note.rustc"
816 } else if target.options.is_like_msvc {
817 // When using link.exe it was seen that the section name `.note.rustc`
818 // was getting shortened to `.note.ru`, and according to the PE and COFF
821 // > Executable images do not use a string table and do not support
822 // > section names longer than 8 characters
824 // https://msdn.microsoft.com/en-us/library/windows/hardware/gg463119.aspx
826 // As a result, we choose a slightly shorter name! As to why
827 // `.note.rustc` works on MinGW, that's another good question...
834 pub fn read_meta_section_name(target: &Target) -> &'static str {
835 if target.options.is_like_osx {
837 } else if target.options.is_like_msvc {
844 // A diagnostic function for dumping crate metadata to an output stream
845 pub fn list_file_metadata(target: &Target, path: &Path,
846 out: &mut io::Write) -> io::Result<()> {
847 match get_metadata_section(target, path) {
848 Ok(bytes) => decoder::list_crate_metadata(bytes.as_slice(), out),
850 write!(out, "{}\n", msg)