--------------------------------------------------------------------------------
I1 cache:         65536 B, 64 B, 4-way associative
D1 cache:         32768 B, 64 B, 8-way associative
LL cache:         67108864 B, 64 B, 64-way associative
Command:          /usr/home/liquid/.rustup/toolchains/w-profiling/bin/rustc --crate-name parking --edition=2018 src/lib.rs --error-format=json --json=diagnostic-rendered-ansi,artifacts,future-incompat --crate-type lib --emit=dep-info,metadata -C embed-bitcode=no -C debuginfo=2 -C metadata=88a82a17d7a01b4a -C extra-filename=-88a82a17d7a01b4a --out-dir /usr/home/liquid/tmp/.tmp7WWiCg/target/debug/deps -L dependency=/usr/home/liquid/tmp/.tmp7WWiCg/target/debug/deps -Adeprecated -Aunknown-lints -Zincremental-verify-ich
Data file:        results/cgout-w-profiling-parking-2.0.0-Check-Full
Events recorded:  Ir
Events shown:     Ir
Event sort order: Ir
Thresholds:       0.1
Include dirs:     
User annotated:   
Auto-annotation:  on

--------------------------------------------------------------------------------
Ir                   
--------------------------------------------------------------------------------
124,248,593 (100.0%)  PROGRAM TOTALS

--------------------------------------------------------------------------------
Ir                   file:function
--------------------------------------------------------------------------------
10,305,124 ( 8.29%)  ./elf/dl-lookup.c:_dl_lookup_symbol_x
 4,835,679 ( 3.89%)  ./elf/dl-lookup.c:do_lookup_x
 4,318,112 ( 3.48%)  ./malloc/malloc.c:_int_malloc
 4,141,271 ( 3.33%)  ./elf/../sysdeps/x86_64/dl-machine.h:_dl_relocate_object
 3,192,258 ( 2.57%)  ./malloc/malloc.c:_int_free
 2,795,071 ( 2.25%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/opaque.rs:<rustc_span::SourceFile as rustc_serialize::serialize::Decodable<rustc_metadata::rmeta::decoder::DecodeContext>>::decode
 2,476,919 ( 1.99%)  /usr/home/liquid/rust/worktree-benchmarking/library/alloc/src/vec/mod.rs:<rustc_span::SourceFile as rustc_serialize::serialize::Decodable<rustc_metadata::rmeta::decoder::DecodeContext>>::decode
 2,329,267 ( 1.87%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/lib.rs:<rustc_span::SourceFile as rustc_serialize::serialize::Decodable<rustc_metadata::rmeta::decoder::DecodeContext>>::decode
 2,225,115 ( 1.79%)  ./malloc/malloc.c:malloc
 2,139,033 ( 1.72%)  ./elf/do-rel.h:_dl_relocate_object
 1,891,344 ( 1.52%)  ./string/../sysdeps/x86_64/multiarch/memmove-vec-unaligned-erms.S:__memcpy_avx_unaligned_erms
 1,362,217 ( 1.10%)  ???:SetImpliedBits(llvm::FeatureBitset&, llvm::FeatureBitset const&, llvm::ArrayRef<llvm::SubtargetFeatureKV>)
 1,072,286 ( 0.86%)  /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/iter/macros.rs:<core::iter::adapters::map::Map<core::iter::adapters::map::Map<core::ops::range::Range<usize>, <rustc_metadata::rmeta::Lazy<[rustc_span::SourceFile], usize>>::decode<rustc_metadata::creader::CrateMetadataRef>::{closure#0}>, <rustc_metadata::creader::CrateMetadataRef>::imported_source_files::{closure#3}::{closure#0}> as core::iter::traits::iterator::Iterator>::fold::<(), core::iter::traits::iterator::Iterator::for_each::call<rustc_metadata::rmeta::decoder::ImportedSourceFile, <alloc::vec::Vec<rustc_metadata::rmeta::decoder::ImportedSourceFile> as alloc::vec::spec_extend::SpecExtend<rustc_metadata::rmeta::decoder::ImportedSourceFile, core::iter::adapters::map::Map<core::iter::adapters::map::Map<core::ops::range::Range<usize>, <rustc_metadata::rmeta::Lazy<[rustc_span::SourceFile], usize>>::decode<rustc_metadata::creader::CrateMetadataRef>::{closure#0}>, <rustc_metadata::creader::CrateMetadataRef>::imported_source_files::{closure#3}::{closure#0}>>>::spec_extend::{closure#0}>::{closure#0}>
 1,068,312 ( 0.86%)  /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/iter/macros.rs:<rustc_span::source_map::SourceMap>::new_imported_source_file
 1,065,373 ( 0.86%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/lib.rs:<rustc_span::source_map::SourceMap>::new_imported_source_file
   926,270 ( 0.75%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/leb128.rs:<rustc_metadata::rmeta::decoder::DecodeContext as rustc_serialize::serialize::Decoder>::read_u32
   869,890 ( 0.70%)  ./malloc/malloc.c:free
   864,856 ( 0.70%)  ./elf/dl-lookup.c:check_match
   779,528 ( 0.63%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_metadata/src/rmeta/decoder.rs:<core::iter::adapters::map::Map<core::iter::adapters::map::Map<core::ops::range::Range<usize>, <rustc_metadata::rmeta::Lazy<[rustc_span::SourceFile], usize>>::decode<rustc_metadata::creader::CrateMetadataRef>::{closure#0}>, <rustc_metadata::creader::CrateMetadataRef>::imported_source_files::{closure#3}::{closure#0}> as core::iter::traits::iterator::Iterator>::fold::<(), core::iter::traits::iterator::Iterator::for_each::call<rustc_metadata::rmeta::decoder::ImportedSourceFile, <alloc::vec::Vec<rustc_metadata::rmeta::decoder::ImportedSourceFile> as alloc::vec::spec_extend::SpecExtend<rustc_metadata::rmeta::decoder::ImportedSourceFile, core::iter::adapters::map::Map<core::iter::adapters::map::Map<core::ops::range::Range<usize>, <rustc_metadata::rmeta::Lazy<[rustc_span::SourceFile], usize>>::decode<rustc_metadata::creader::CrateMetadataRef>::{closure#0}>, <rustc_metadata::creader::CrateMetadataRef>::imported_source_files::{closure#3}::{closure#0}>>>::spec_extend::{closure#0}>::{closure#0}>
   745,995 ( 0.60%)  ./malloc/malloc.c:malloc_consolidate
   711,020 ( 0.57%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/lib.rs:<core::iter::adapters::map::Map<core::iter::adapters::map::Map<core::ops::range::Range<usize>, <rustc_metadata::rmeta::Lazy<[rustc_span::SourceFile], usize>>::decode<rustc_metadata::creader::CrateMetadataRef>::{closure#0}>, <rustc_metadata::creader::CrateMetadataRef>::imported_source_files::{closure#3}::{closure#0}> as core::iter::traits::iterator::Iterator>::fold::<(), core::iter::traits::iterator::Iterator::for_each::call<rustc_metadata::rmeta::decoder::ImportedSourceFile, <alloc::vec::Vec<rustc_metadata::rmeta::decoder::ImportedSourceFile> as alloc::vec::spec_extend::SpecExtend<rustc_metadata::rmeta::decoder::ImportedSourceFile, core::iter::adapters::map::Map<core::iter::adapters::map::Map<core::ops::range::Range<usize>, <rustc_metadata::rmeta::Lazy<[rustc_span::SourceFile], usize>>::decode<rustc_metadata::creader::CrateMetadataRef>::{closure#0}>, <rustc_metadata::creader::CrateMetadataRef>::imported_source_files::{closure#3}::{closure#0}>>>::spec_extend::{closure#0}>::{closure#0}>
   593,531 ( 0.48%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/rustc-hash-1.1.0/src/lib.rs:<&str as core::hash::Hash>::hash::<rustc_hash::FxHasher>
   529,040 ( 0.43%)  ./string/../sysdeps/x86_64/strcmp.S:strcmp
   516,843 ( 0.42%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/leb128.rs:<rustc_serialize::opaque::Decoder as rustc_serialize::serialize::Decoder>::read_usize
   484,500 ( 0.39%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:<hashbrown::raw::RawTable<(rustc_span::def_id::DefId, rustc_query_system::query::plumbing::QueryResult<rustc_middle::dep_graph::dep_node::DepKind>)>>::remove_entry::<hashbrown::map::equivalent_key<rustc_span::def_id::DefId, rustc_span::def_id::DefId, rustc_query_system::query::plumbing::QueryResult<rustc_middle::dep_graph::dep_node::DepKind>>::{closure#0}>
   459,321 ( 0.37%)  ???:llvm::StringMapImpl::LookupBucketFor(llvm::StringRef)
   443,532 ( 0.36%)  ./malloc/malloc.c:unlink_chunk.constprop.0
   407,948 ( 0.33%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/leb128.rs:<rustc_serialize::opaque::Decoder as rustc_serialize::serialize::Decoder>::read_usize
   389,457 ( 0.31%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:<hashbrown::map::RawEntryBuilderMut<rustc_middle::ty::context::Interned<rustc_middle::ty::TyS>, (), core::hash::BuildHasherDefault<rustc_hash::FxHasher>>>::from_hash::<hashbrown::map::equivalent<rustc_middle::ty::sty::TyKind, rustc_middle::ty::context::Interned<rustc_middle::ty::TyS>>::{closure#0}>
   378,643 ( 0.30%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_metadata/src/rmeta/decoder.rs:<rustc_span::span_encoding::Span as rustc_serialize::serialize::Decodable<rustc_metadata::rmeta::decoder::DecodeContext>>::decode
   376,640 ( 0.30%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/source_map.rs:<rustc_span::source_map::SourceMap>::new_imported_source_file
   375,204 ( 0.30%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/leb128.rs:<rustc_metadata::rmeta::decoder::DecodeContext as rustc_serialize::serialize::Decoder>::read_u32
   370,432 ( 0.30%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:<hashbrown::raw::RawTable<(&str, rustc_span::symbol::Symbol)>>::insert::<hashbrown::map::make_hasher<&str, &str, rustc_span::symbol::Symbol, core::hash::BuildHasherDefault<rustc_hash::FxHasher>>::{closure#0}>
   353,393 ( 0.28%)  /usr/home/liquid/rust/worktree-benchmarking/library/core/src/ptr/mod.rs:<rustc_span::SourceFile as rustc_serialize::serialize::Decodable<rustc_metadata::rmeta::decoder::DecodeContext>>::decode
   353,393 ( 0.28%)  /usr/home/liquid/rust/worktree-benchmarking/library/core/src/iter/range.rs:<rustc_span::SourceFile as rustc_serialize::serialize::Decodable<rustc_metadata::rmeta::decoder::DecodeContext>>::decode
   353,393 ( 0.28%)  /usr/home/liquid/rust/worktree-benchmarking/library/core/src/cmp.rs:<rustc_span::SourceFile as rustc_serialize::serialize::Decodable<rustc_metadata::rmeta::decoder::DecodeContext>>::decode
   334,739 ( 0.27%)  ./string/../sysdeps/x86_64/multiarch/memcmp-avx2-movbe.S:__memcmp_avx2_movbe
   319,082 ( 0.26%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/symbol.rs:<rustc_span::symbol::Symbol>::intern
   295,014 ( 0.24%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:<rustc_span::symbol::Symbol>::intern
   277,011 ( 0.22%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/indexmap-1.8.0/src/map/core.rs:<indexmap::map::core::Entry<rustc_middle::ty::fast_reject::SimplifiedTypeGen<rustc_span::def_id::DefId>, alloc::vec::Vec<rustc_span::def_id::DefId>>>::or_default
   256,500 ( 0.21%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/rustc_entry.rs:<hashbrown::map::HashMap<rustc_span::def_id::DefId, rustc_query_system::query::plumbing::QueryResult<rustc_middle::dep_graph::dep_node::DepKind>, core::hash::BuildHasherDefault<rustc_hash::FxHasher>>>::rustc_entry
   256,040 ( 0.21%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/leb128.rs:<rustc_metadata::rmeta::decoder::DecodeContext as rustc_serialize::serialize::Decoder>::read_u64
   244,447 ( 0.20%)  /usr/home/liquid/rust/worktree-benchmarking/library/std/src/sys/unix/alloc.rs:__rdl_alloc
   244,221 ( 0.20%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.11.2/src/raw/mod.rs:<indexmap::map::core::Entry<rustc_middle::ty::fast_reject::SimplifiedTypeGen<rustc_span::def_id::DefId>, alloc::vec::Vec<rustc_span::def_id::DefId>>>::or_default
   243,353 ( 0.20%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/map.rs:<hashbrown::map::HashMap<&str, rustc_span::symbol::Symbol, core::hash::BuildHasherDefault<rustc_hash::FxHasher>>>::insert
   234,425 ( 0.19%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/opaque.rs:<rustc_serialize::opaque::Decoder as rustc_serialize::serialize::Decoder>::read_usize
   221,269 ( 0.18%)  ./stdlib/cxa_finalize.c:__cxa_finalize
   220,780 ( 0.18%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:<hashbrown::raw::RawTableInner<alloc::alloc::Global>>::prepare_insert_slot
   219,790 ( 0.18%)  ./malloc/malloc.c:realloc
   211,375 ( 0.17%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/opaque.rs:<rustc_serialize::opaque::Decoder as rustc_serialize::serialize::Decoder>::read_usize
   209,420 ( 0.17%)  /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/mod.rs:<rustc_span::span_encoding::Span as rustc_serialize::serialize::Decodable<rustc_metadata::rmeta::decoder::DecodeContext>>::decode
   209,090 ( 0.17%)  /usr/home/liquid/rust/worktree-benchmarking/library/core/src/num/uint_macros.rs:<&str as core::hash::Hash>::hash::<rustc_hash::FxHasher>
   206,696 ( 0.17%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.11.2/src/raw/mod.rs:<hashbrown::raw::inner::RawTable<usize>>::reserve_rehash::<indexmap::map::core::get_hash<rustc_middle::ty::fast_reject::SimplifiedTypeGen<rustc_span::def_id::DefId>, alloc::vec::Vec<rustc_span::def_id::DefId>>::{closure#0}>
   206,229 ( 0.17%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs:<rustc_middle::ty::sty::TyKind as core::hash::Hash>::hash::<rustc_hash::FxHasher>
   194,797 ( 0.16%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs:<rustc_middle::ty::context::CtxtInterners>::intern_ty
   186,120 ( 0.15%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/opaque.rs:<rustc_metadata::rmeta::decoder::DecodeContext as rustc_serialize::serialize::Decoder>::read_str
   184,865 ( 0.15%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/map.rs:<hashbrown::map::RawEntryBuilderMut<rustc_middle::ty::context::Interned<rustc_middle::ty::TyS>, (), core::hash::BuildHasherDefault<rustc_hash::FxHasher>>>::from_hash::<hashbrown::map::equivalent<rustc_middle::ty::sty::TyKind, rustc_middle::ty::context::Interned<rustc_middle::ty::TyS>>::{closure#0}>
   180,990 ( 0.15%)  /usr/home/liquid/rust/worktree-benchmarking/library/core/src/tuple.rs:core::slice::sort::recurse::<rustc_span::def_id::DefId, <[rustc_span::def_id::DefId]>::sort_unstable_by_key<(i64, usize), rustc_trait_selection::traits::specialize::specialization_graph_provider::{closure#0}>::{closure#0}>
   178,854 ( 0.14%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/codec.rs:<rustc_metadata::rmeta::decoder::DecodeContext as rustc_serialize::serialize::Decoder>::read_u32
   172,270 ( 0.14%)  /usr/home/liquid/rust/worktree-benchmarking/library/core/src/num/uint_macros.rs:<rustc_data_structures::sip128::SipHasher128>::short_write_process_buffer::<u64>
   172,222 ( 0.14%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/leb128.rs:<rustc_serialize::opaque::Decoder as rustc_serialize::serialize::Decoder>::read_u32
   167,563 ( 0.13%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:<hashbrown::map::RawEntryBuilder<rustc_span::def_id::LocalDefId, (&rustc_middle::ty::context::TypeckResults, rustc_query_system::dep_graph::graph::DepNodeIndex), core::hash::BuildHasherDefault<rustc_hash::FxHasher>>>::from_key_hashed_nocheck::<rustc_span::def_id::LocalDefId>
   165,920 ( 0.13%)  ???:llvm::StringMapImpl::RehashTable(unsigned int)
   164,555 ( 0.13%)  ./string/../sysdeps/x86_64/multiarch/memset-vec-unaligned-erms.S:__memset_avx2_erms
   163,260 ( 0.13%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/indexmap-1.8.0/src/map/core/raw.rs:<indexmap::map::core::IndexMapCore<rustc_middle::ty::fast_reject::SimplifiedTypeGen<rustc_span::def_id::DefId>, alloc::vec::Vec<rustc_span::def_id::DefId>>>::entry
   162,474 ( 0.13%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/mod.rs:<rustc_middle::ty::FieldDef as rustc_serialize::serialize::Decodable<rustc_metadata::rmeta::decoder::DecodeContext>>::decode
   158,475 ( 0.13%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/map.rs:<hashbrown::map::RawEntryBuilderMut<rustc_middle::ty::context::Interned<rustc_middle::ty::list::List<rustc_middle::ty::subst::GenericArg>>, (), core::hash::BuildHasherDefault<rustc_hash::FxHasher>>>::from_hash::<hashbrown::map::equivalent<[rustc_middle::ty::subst::GenericArg], rustc_middle::ty::context::Interned<rustc_middle::ty::list::List<rustc_middle::ty::subst::GenericArg>>>::{closure#0}>
   157,710 ( 0.13%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:<hashbrown::raw::RawTable<(&str, rustc_span::symbol::Symbol)>>::reserve_rehash::<hashbrown::map::make_hasher<&str, &str, rustc_span::symbol::Symbol, core::hash::BuildHasherDefault<rustc_hash::FxHasher>>::{closure#0}>
   157,638 ( 0.13%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/codec.rs:<&rustc_middle::ty::TyS as rustc_serialize::serialize::Decodable<rustc_metadata::rmeta::decoder::DecodeContext>>::decode
   155,477 ( 0.13%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs:<rustc_middle::ty::context::TyCtxt>::_intern_substs
   155,259 ( 0.12%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:<hashbrown::raw::RawTable<(rustc_middle::ty::context::Interned<rustc_middle::ty::TyS>, ())>>::insert_entry::<hashbrown::map::make_hasher<rustc_middle::ty::context::Interned<rustc_middle::ty::TyS>, rustc_middle::ty::context::Interned<rustc_middle::ty::TyS>, (), core::hash::BuildHasherDefault<rustc_hash::FxHasher>>::{closure#0}>
   154,489 ( 0.12%)  ./malloc/malloc.c:_int_realloc
   153,692 ( 0.12%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs:<core::iter::adapters::map::Map<core::ops::range::Range<usize>, <&rustc_middle::ty::list::List<rustc_middle::ty::subst::GenericArg> as rustc_serialize::serialize::Decodable<rustc_metadata::rmeta::decoder::DecodeContext>>::decode::{closure#0}> as rustc_middle::ty::context::InternAs<[rustc_middle::ty::subst::GenericArg], &rustc_middle::ty::list::List<rustc_middle::ty::subst::GenericArg>>>::intern_with::<<rustc_middle::ty::context::TyCtxt>::mk_substs<core::iter::adapters::map::Map<core::ops::range::Range<usize>, <&rustc_middle::ty::list::List<rustc_middle::ty::subst::GenericArg> as rustc_serialize::serialize::Decodable<rustc_metadata::rmeta::decoder::DecodeContext>>::decode::{closure#0}>>::{closure#0}>
   153,061 ( 0.12%)  /usr/home/liquid/rust/worktree-benchmarking/library/std/src/path.rs:<std::path::Path as core::hash::Hash>::hash::<rustc_data_structures::stable_hasher::StableHasher>
   152,763 ( 0.12%)  /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/sort.rs:core::slice::sort::recurse::<rustc_span::def_id::DefId, <[rustc_span::def_id::DefId]>::sort_unstable_by_key<(i64, usize), rustc_trait_selection::traits::specialize::specialization_graph_provider::{closure#0}>::{closure#0}>
   152,342 ( 0.12%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:<hashbrown::map::HashMap<rustc_span::def_id::DefId, rustc_query_system::query::plumbing::QueryResult<rustc_middle::dep_graph::dep_node::DepKind>, core::hash::BuildHasherDefault<rustc_hash::FxHasher>>>::rustc_entry
   152,042 ( 0.12%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/stacker-0.1.14/src/lib.rs:stacker::remaining_stack
   151,972 ( 0.12%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:<hashbrown::raw::RawTable<(rustc_middle::ty::context::Interned<rustc_middle::ty::list::List<rustc_middle::ty::subst::GenericArg>>, ())>>::insert_entry::<hashbrown::map::make_hasher<rustc_middle::ty::context::Interned<rustc_middle::ty::list::List<rustc_middle::ty::subst::GenericArg>>, rustc_middle::ty::context::Interned<rustc_middle::ty::list::List<rustc_middle::ty::subst::GenericArg>>, (), core::hash::BuildHasherDefault<rustc_hash::FxHasher>>::{closure#0}>
   151,168 ( 0.12%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_metadata/src/rmeta/decoder.rs:<rustc_metadata::rmeta::decoder::DecodeContext as rustc_middle::ty::codec::TyDecoder>::cached_ty_for_shorthand::<<&rustc_middle::ty::TyS as rustc_serialize::serialize::Decodable<rustc_metadata::rmeta::decoder::DecodeContext>>::decode::{closure#0}>
   151,130 ( 0.12%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:<hashbrown::map::HashMap<&str, rustc_span::symbol::Symbol, core::hash::BuildHasherDefault<rustc_hash::FxHasher>>>::insert
   148,932 ( 0.12%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_query_system/src/query/plumbing.rs:rustc_query_system::query::plumbing::try_execute_query::<rustc_query_impl::plumbing::QueryCtxt, rustc_query_system::query::caches::DefaultCache<rustc_span::def_id::DefId, core::option::Option<rustc_middle::ty::sty::TraitRef>>>
   147,905 ( 0.12%)  /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/iter/macros.rs:<rustc_middle::ty::context::TyCtxt>::_intern_substs
   142,324 ( 0.11%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_metadata/src/rmeta/table.rs:<rustc_metadata::rmeta::Lazy<rustc_metadata::rmeta::table::Table<rustc_span::def_id::DefIndex, rustc_metadata::rmeta::Lazy<rustc_span::def_id::DefId, ()>>, usize>>::get::<rustc_metadata::creader::CrateMetadataRef>
   140,199 ( 0.11%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_query_system/src/query/plumbing.rs:rustc_query_system::query::plumbing::try_execute_query::<rustc_query_impl::plumbing::QueryCtxt, rustc_query_system::query::caches::DefaultCache<rustc_span::def_id::DefId, core::option::Option<rustc_span::def_id::DefId>>>
   138,107 ( 0.11%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:<rustc_metadata::rmeta::decoder::DecodeContext as rustc_middle::ty::codec::TyDecoder>::cached_ty_for_shorthand::<<&rustc_middle::ty::TyS as rustc_serialize::serialize::Decodable<rustc_metadata::rmeta::decoder::DecodeContext>>::decode::{closure#0}>
   134,409 ( 0.11%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:<hashbrown::raw::RawTable<(rustc_span::def_id::DefId, rustc_span::def_id::DefId)>>::insert::<hashbrown::map::make_hasher<rustc_span::def_id::DefId, rustc_span::def_id::DefId, rustc_span::def_id::DefId, core::hash::BuildHasherDefault<rustc_hash::FxHasher>>::{closure#0}>
   133,852 ( 0.11%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/lib.rs:<rustc_span::span_encoding::Span as rustc_serialize::serialize::Decodable<rustc_metadata::rmeta::decoder::DecodeContext>>::decode
   133,553 ( 0.11%)  /usr/home/liquid/rust/worktree-benchmarking/library/core/src/cmp.rs:<std::path::Path as core::hash::Hash>::hash::<rustc_data_structures::stable_hasher::StableHasher>
   132,503 ( 0.11%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_query_system/src/query/plumbing.rs:rustc_query_system::query::plumbing::get_query::<rustc_query_impl::queries::impl_trait_ref, rustc_query_impl::plumbing::QueryCtxt>
   131,940 ( 0.11%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs:<rustc_middle::ty::sty::TyKind as core::cmp::PartialEq>::eq
   129,815 ( 0.10%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:<hashbrown::map::RawEntryBuilderMut<rustc_middle::ty::context::Interned<rustc_middle::ty::list::List<rustc_middle::ty::subst::GenericArg>>, (), core::hash::BuildHasherDefault<rustc_hash::FxHasher>>>::from_hash::<hashbrown::map::equivalent<[rustc_middle::ty::subst::GenericArg], rustc_middle::ty::context::Interned<rustc_middle::ty::list::List<rustc_middle::ty::subst::GenericArg>>>::{closure#0}>
   126,779 ( 0.10%)  /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/caching_source_map_view.rs:<rustc_span::caching_source_map_view::CachingSourceMapView>::span_data_to_lines_and_cols
   126,531 ( 0.10%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:<hashbrown::raw::RawTable<(rustc_span::def_id::DefId, (core::option::Option<rustc_middle::ty::sty::TraitRef>, rustc_query_system::dep_graph::graph::DepNodeIndex))>>::insert::<hashbrown::map::make_hasher<rustc_span::def_id::DefId, rustc_span::def_id::DefId, (core::option::Option<rustc_middle::ty::sty::TraitRef>, rustc_query_system::dep_graph::graph::DepNodeIndex), core::hash::BuildHasherDefault<rustc_hash::FxHasher>>::{closure#0}>
   126,164 ( 0.10%)  /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:<hashbrown::raw::RawTable<(rustc_span::def_id::DefId, (core::option::Option<rustc_span::def_id::DefId>, rustc_query_system::dep_graph::graph::DepNodeIndex))>>::insert::<hashbrown::map::make_hasher<rustc_span::def_id::DefId, rustc_span::def_id::DefId, (core::option::Option<rustc_span::def_id::DefId>, rustc_query_system::dep_graph::graph::DepNodeIndex), core::hash::BuildHasherDefault<rustc_hash::FxHasher>>::{closure#0}>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/source_map.rs
--------------------------------------------------------------------------------
Ir               

-- line 72 ----------------------------------------
      .                   fn deref(&self) -> &Self::Target {
      .                       &self.0
      .                   }
      .               }
      .           
      .               impl<T> !DerefMut for MonotonicVec<T> {}
      .           }
      .           
    629 ( 0.00%)  #[derive(Clone, Encodable, Decodable, Debug, Copy, HashStable_Generic)]
      .           pub struct Spanned<T> {
      .               pub node: T,
      .               pub span: Span,
      .           }
      .           
      .           pub fn respan<T>(sp: Span, t: T) -> Spanned<T> {
    369 ( 0.00%)      Spanned { node: t, span: sp }
    794 ( 0.00%)  }
      .           
      .           pub fn dummy_spanned<T>(t: T) -> Spanned<T> {
      .               respan(DUMMY_SP, t)
      .           }
      .           
      .           // _____________________________________________________________________________
      .           // SourceFile, MultiByteChar, FileName, FileLines
      .           //
-- line 96 ----------------------------------------
-- line 107 ----------------------------------------
      .           /// A FileLoader that uses std::fs to load real files.
      .           pub struct RealFileLoader;
      .           
      .           impl FileLoader for RealFileLoader {
      .               fn file_exists(&self, path: &Path) -> bool {
      .                   path.exists()
      .               }
      .           
      2 ( 0.00%)      fn read_file(&self, path: &Path) -> io::Result<String> {
      .                   fs::read_to_string(path)
      3 ( 0.00%)      }
      .           }
      .           
      .           /// This is a [SourceFile] identifier that is used to correlate source files between
      .           /// subsequent compilation sessions (which is something we need to do during
      .           /// incremental compilation).
      .           ///
      .           /// The [StableSourceFileId] also contains the CrateNum of the crate the source
      .           /// file was originally parsed for. This way we get two separate entries in
-- line 125 ----------------------------------------
-- line 128 ----------------------------------------
      .           /// at the point where we discover that there's a local use of the file in
      .           /// addition to the upstream one, we might already have made decisions based on
      .           /// the assumption that it's an upstream file. Treating the two files as
      .           /// different has no real downsides.
      .           #[derive(Copy, Clone, PartialEq, Eq, Hash, Encodable, Decodable, Debug)]
      .           pub struct StableSourceFileId {
      .               // A hash of the source file's FileName. This is hash so that it's size
      .               // is more predictable than if we included the actual FileName value.
     46 ( 0.00%)      pub file_name_hash: u64,
      .           
      .               // The CrateNum of the crate this source file was originally parsed for.
      .               // We cannot include this information in the hash because at the time
      .               // of hashing we don't have the context to map from the CrateNum's numeric
      .               // value to a StableCrateId.
      .               pub cnum: CrateNum,
      .           }
      .           
      .           // FIXME: we need a more globally consistent approach to the problem solved by
      .           // StableSourceFileId, perhaps built atop source_file.name_hash.
      .           impl StableSourceFileId {
      .               pub fn new(source_file: &SourceFile) -> StableSourceFileId {
  1,056 ( 0.00%)          StableSourceFileId::new_from_name(&source_file.name, source_file.cnum)
      .               }
      .           
  2,645 ( 0.00%)      fn new_from_name(name: &FileName, cnum: CrateNum) -> StableSourceFileId {
      .                   let mut hasher = StableHasher::new();
    529 ( 0.00%)          name.hash(&mut hasher);
      .                   StableSourceFileId { file_name_hash: hasher.finish(), cnum }
  3,174 ( 0.00%)      }
      .           }
      .           
      .           // _____________________________________________________________________________
      .           // SourceMap
      .           //
      .           
      .           #[derive(Default)]
      .           pub(super) struct SourceMapFiles {
-- line 164 ----------------------------------------
-- line 184 ----------------------------------------
      .               pub fn new(path_mapping: FilePathMapping) -> SourceMap {
      .                   Self::with_file_loader_and_hash_kind(
      .                       Box::new(RealFileLoader),
      .                       path_mapping,
      .                       SourceFileHashAlgorithm::Md5,
      .                   )
      .               }
      .           
      1 ( 0.00%)      pub fn with_file_loader_and_hash_kind(
      .                   file_loader: Box<dyn FileLoader + Sync + Send>,
      .                   path_mapping: FilePathMapping,
      .                   hash_kind: SourceFileHashAlgorithm,
      .               ) -> SourceMap {
      5 ( 0.00%)          SourceMap {
      .                       used_address_space: AtomicU32::new(0),
      .                       files: Default::default(),
      .                       file_loader,
      4 ( 0.00%)              path_mapping,
      .                       hash_kind,
      .                   }
      1 ( 0.00%)      }
      .           
      .               pub fn path_mapping(&self) -> &FilePathMapping {
      3 ( 0.00%)          &self.path_mapping
      3 ( 0.00%)      }
      .           
      .               pub fn file_exists(&self, path: &Path) -> bool {
      .                   self.file_loader.file_exists(path)
      .               }
      .           
     11 ( 0.00%)      pub fn load_file(&self, path: &Path) -> io::Result<Lrc<SourceFile>> {
      4 ( 0.00%)          let src = self.file_loader.read_file(path)?;
      .                   let filename = path.to_owned().into();
     18 ( 0.00%)          Ok(self.new_source_file(filename, src))
      9 ( 0.00%)      }
      .           
      .               /// Loads source file as a binary blob.
      .               ///
      .               /// Unlike `load_file`, guarantees that no normalization like BOM-removal
      .               /// takes place.
      .               pub fn load_binary_file(&self, path: &Path) -> io::Result<Vec<u8>> {
      .                   // Ideally, this should use `self.file_loader`, but it can't
      .                   // deal with binary files yet.
-- line 226 ----------------------------------------
-- line 233 ----------------------------------------
      .                   // empty string.
      .                   let text = std::str::from_utf8(&bytes).unwrap_or("").to_string();
      .                   self.new_source_file(path.to_owned().into(), text);
      .                   Ok(bytes)
      .               }
      .           
      .               // By returning a `MonotonicVec`, we ensure that consumers cannot invalidate
      .               // any existing indices pointing into `files`.
      4 ( 0.00%)      pub fn files(&self) -> MappedReadGuard<'_, monotonic::MonotonicVec<Lrc<SourceFile>>> {
      .                   ReadGuard::map(self.files.borrow(), |files| &files.source_files)
     12 ( 0.00%)      }
      .           
      4 ( 0.00%)      pub fn source_file_by_stable_id(
      .                   &self,
      .                   stable_id: StableSourceFileId,
      .               ) -> Option<Lrc<SourceFile>> {
      .                   self.files.borrow().stable_id_to_source_file.get(&stable_id).cloned()
      5 ( 0.00%)      }
      .           
      .               fn allocate_address_space(&self, size: usize) -> Result<usize, OffsetOverflowError> {
    529 ( 0.00%)          let size = u32::try_from(size).map_err(|_| OffsetOverflowError)?;
      .           
      .                   loop {
    529 ( 0.00%)              let current = self.used_address_space.load(Ordering::Relaxed);
  1,587 ( 0.00%)              let next = current
      .                           .checked_add(size)
      .                           // Add one so there is some space between files. This lets us distinguish
      .                           // positions in the `SourceMap`, even in the presence of zero-length files.
      .                           .and_then(|next| next.checked_add(1))
      .                           .ok_or(OffsetOverflowError)?;
      .           
      .                       if self
      .                           .used_address_space
-- line 265 ----------------------------------------
-- line 269 ----------------------------------------
      .                           return Ok(usize::try_from(current).unwrap());
      .                       }
      .                   }
      .               }
      .           
      .               /// Creates a new `SourceFile`.
      .               /// If a file already exists in the `SourceMap` with the same ID, that file is returned
      .               /// unmodified.
      8 ( 0.00%)      pub fn new_source_file(&self, filename: FileName, src: String) -> Lrc<SourceFile> {
     12 ( 0.00%)          self.try_new_source_file(filename, src).unwrap_or_else(|OffsetOverflowError| {
      .                       eprintln!("fatal error: rustc does not support files larger than 4GB");
      .                       crate::fatal_error::FatalError.raise()
      .                   })
      9 ( 0.00%)      }
      .           
      .               fn try_new_source_file(
      .                   &self,
      .                   filename: FileName,
      .                   src: String,
      .               ) -> Result<Lrc<SourceFile>, OffsetOverflowError> {
      .                   // Note that filename may not be a valid path, eg it may be `<anon>` etc,
      .                   // but this is okay because the directory determined by `path.pop()` will
      .                   // be empty, so the working directory will be used.
     13 ( 0.00%)          let (filename, _) = self.path_mapping.map_filename_prefix(&filename);
      .           
      2 ( 0.00%)          let file_id = StableSourceFileId::new_from_name(&filename, LOCAL_CRATE);
      .           
      6 ( 0.00%)          let lrc_sf = match self.source_file_by_stable_id(file_id) {
      .                       Some(lrc_sf) => lrc_sf,
      .                       None => {
      .                           let start_pos = self.allocate_address_space(src.len())?;
      .           
      6 ( 0.00%)                  let source_file = Lrc::new(SourceFile::new(
      9 ( 0.00%)                      filename,
      3 ( 0.00%)                      src,
      .                               Pos::from_usize(start_pos),
      .                               self.hash_kind,
      .                           ));
      .           
      .                           // Let's make sure the file_id we generated above actually matches
      .                           // the ID we generate for the SourceFile we just created.
      .                           debug_assert_eq!(StableSourceFileId::new(&source_file), file_id);
      .           
-- line 311 ----------------------------------------
-- line 319 ----------------------------------------
      .                   };
      .                   Ok(lrc_sf)
      .               }
      .           
      .               /// Allocates a new `SourceFile` representing a source file from an external
      .               /// crate. The source code of such an "imported `SourceFile`" is not available,
      .               /// but we still know enough to generate accurate debuginfo location
      .               /// information for things inlined from other crates.
  4,224 ( 0.00%)      pub fn new_imported_source_file(
      .                   &self,
      .                   filename: FileName,
      .                   src_hash: SourceFileHash,
      .                   name_hash: u128,
      .                   source_len: usize,
      .                   cnum: CrateNum,
      .                   mut file_local_lines: Vec<BytePos>,
      .                   mut file_local_multibyte_chars: Vec<MultiByteChar>,
-- line 335 ----------------------------------------
-- line 341 ----------------------------------------
      .                   let start_pos = self
      .                       .allocate_address_space(source_len)
      .                       .expect("not enough address space for imported source file");
      .           
      .                   let end_pos = Pos::from_usize(start_pos + source_len);
      .                   let start_pos = Pos::from_usize(start_pos);
      .           
      .                   for pos in &mut file_local_lines {
353,393 ( 0.28%)              *pos = *pos + start_pos;
      .                   }
      .           
      .                   for mbc in &mut file_local_multibyte_chars {
    797 ( 0.00%)              mbc.pos = mbc.pos + start_pos;
      .                   }
      .           
      .                   for swc in &mut file_local_non_narrow_chars {
    616 ( 0.00%)              *swc = *swc + start_pos;
      .                   }
      .           
      .                   for nc in &mut file_local_normalized_pos {
      .                       nc.pos = nc.pos + start_pos;
      .                   }
      .           
  1,584 ( 0.00%)          let source_file = Lrc::new(SourceFile {
  4,224 ( 0.00%)              name: filename,
      .                       src: None,
      .                       src_hash,
      .                       external_src: Lock::new(ExternalSource::Foreign {
      .                           kind: ExternalSourceKind::AbsentOk,
      .                           original_start_pos,
      .                           original_end_pos,
      .                       }),
      .                       start_pos,
-- line 373 ----------------------------------------
-- line 383 ----------------------------------------
      .                   let mut files = self.files.borrow_mut();
      .           
      .                   files.source_files.push(source_file.clone());
      .                   files
      .                       .stable_id_to_source_file
      .                       .insert(StableSourceFileId::new(&source_file), source_file.clone());
      .           
      .                   source_file
  4,752 ( 0.00%)      }
      .           
      .               // If there is a doctest offset, applies it to the line.
      .               pub fn doctest_offset_line(&self, file: &FileName, orig: usize) -> usize {
      .                   match file {
      .                       FileName::DocTest(_, offset) => {
      .                           if *offset < 0 {
      .                               orig - (-(*offset)) as usize
      .                           } else {
-- line 399 ----------------------------------------
-- line 400 ----------------------------------------
      .                               orig + *offset as usize
      .                           }
      .                       }
      .                       _ => orig,
      .                   }
      .               }
      .           
      .               /// Return the SourceFile that contains the given `BytePos`
      3 ( 0.00%)      pub fn lookup_source_file(&self, pos: BytePos) -> Lrc<SourceFile> {
      1 ( 0.00%)          let idx = self.lookup_source_file_idx(pos);
      1 ( 0.00%)          (*self.files.borrow().source_files)[idx].clone()
      3 ( 0.00%)      }
      .           
      .               /// Looks up source information about a `BytePos`.
      .               pub fn lookup_char_pos(&self, pos: BytePos) -> Loc {
      5 ( 0.00%)          let sf = self.lookup_source_file(pos);
      6 ( 0.00%)          let (line, col, col_display) = sf.lookup_file_pos_with_col_display(pos);
      3 ( 0.00%)          Loc { file: sf, line, col, col_display }
      .               }
      .           
      .               // If the corresponding `SourceFile` is empty, does not return a line number.
      .               pub fn lookup_line(&self, pos: BytePos) -> Result<SourceFileAndLine, Lrc<SourceFile>> {
      .                   let f = self.lookup_source_file(pos);
      .           
      .                   match f.lookup_line(pos) {
      .                       Some(line) => Ok(SourceFileAndLine { sf: f, line }),
-- line 425 ----------------------------------------
-- line 451 ----------------------------------------
      .           
      .               /// Format the span location to be printed in diagnostics. Must not be emitted
      .               /// to build artifacts as this may leak local file paths. Use span_to_embeddable_string
      .               /// for string suitable for embedding.
      .               pub fn span_to_diagnostic_string(&self, sp: Span) -> String {
      .                   self.span_to_string(sp, self.path_mapping.filename_display_for_diagnostics)
      .               }
      .           
     11 ( 0.00%)      pub fn span_to_filename(&self, sp: Span) -> FileName {
      3 ( 0.00%)          self.lookup_char_pos(sp.lo()).file.name.clone()
      8 ( 0.00%)      }
      .           
      .               pub fn filename_for_diagnostics<'a>(&self, filename: &'a FileName) -> FileNameDisplay<'a> {
      .                   filename.display(self.path_mapping.filename_display_for_diagnostics)
      .               }
      .           
    286 ( 0.00%)      pub fn is_multiline(&self, sp: Span) -> bool {
    104 ( 0.00%)          let lo = self.lookup_source_file_idx(sp.lo());
    104 ( 0.00%)          let hi = self.lookup_source_file_idx(sp.hi());
     52 ( 0.00%)          if lo != hi {
      .                       return true;
      .                   }
     52 ( 0.00%)          let f = (*self.files.borrow().source_files)[lo].clone();
      .                   f.lookup_line(sp.lo()) != f.lookup_line(sp.hi())
    234 ( 0.00%)      }
      .           
      .               #[instrument(skip(self), level = "trace")]
      .               pub fn is_valid_span(&self, sp: Span) -> Result<(Loc, Loc), SpanLinesError> {
      .                   let lo = self.lookup_char_pos(sp.lo());
      .                   trace!(?lo);
      .                   let hi = self.lookup_char_pos(sp.hi());
      .                   trace!(?hi);
      .                   if lo.file.start_pos != hi.file.start_pos {
-- line 483 ----------------------------------------
-- line 533 ----------------------------------------
      .           
      .               /// Extracts the source surrounding the given `Span` using the `extract_source` function. The
      .               /// extract function takes three arguments: a string slice containing the source, an index in
      .               /// the slice for the beginning of the span and an index in the slice for the end of the span.
      .               fn span_to_source<F, T>(&self, sp: Span, extract_source: F) -> Result<T, SpanSnippetError>
      .               where
      .                   F: Fn(&str, usize, usize) -> Result<T, SpanSnippetError>,
      .               {
     84 ( 0.00%)          let local_begin = self.lookup_byte_offset(sp.lo());
     84 ( 0.00%)          let local_end = self.lookup_byte_offset(sp.hi());
      .           
     24 ( 0.00%)          if local_begin.sf.start_pos != local_end.sf.start_pos {
      .                       Err(SpanSnippetError::DistinctSources(DistinctSources {
      .                           begin: (local_begin.sf.name.clone(), local_begin.sf.start_pos),
      .                           end: (local_end.sf.name.clone(), local_end.sf.start_pos),
      .                       }))
      .                   } else {
      .                       self.ensure_source_file_source_present(local_begin.sf.clone());
      .           
      .                       let start_index = local_begin.pos.to_usize();
      .                       let end_index = local_end.pos.to_usize();
     12 ( 0.00%)              let source_len = (local_begin.sf.end_pos - local_begin.sf.start_pos).to_usize();
      .           
     48 ( 0.00%)              if start_index > end_index || end_index > source_len {
      .                           return Err(SpanSnippetError::MalformedForSourcemap(MalformedSourceMapPositions {
      .                               name: local_begin.sf.name.clone(),
      .                               source_len,
      .                               begin_pos: local_begin.pos,
      .                               end_pos: local_end.pos,
      .                           }));
      .                       }
      .           
     36 ( 0.00%)              if let Some(ref src) = local_begin.sf.src {
      .                           extract_source(src, start_index, end_index)
      .                       } else if let Some(src) = local_begin.sf.external_src.borrow().get_source() {
      .                           extract_source(src, start_index, end_index)
      .                       } else {
      .                           Err(SpanSnippetError::SourceNotAvailable { filename: local_begin.sf.name.clone() })
      .                       }
      .                   }
      .               }
-- line 573 ----------------------------------------
-- line 579 ----------------------------------------
      .               pub fn is_local_span(&self, sp: Span) -> bool {
      .                   let local_begin = self.lookup_byte_offset(sp.lo());
      .                   let local_end = self.lookup_byte_offset(sp.hi());
      .                   // This might be a weird span that covers multiple files
      .                   local_begin.sf.src.is_some() && local_end.sf.src.is_some()
      .               }
      .           
      .               /// Returns the source snippet as `String` corresponding to the given `Span`.
    144 ( 0.00%)      pub fn span_to_snippet(&self, sp: Span) -> Result<String, SpanSnippetError> {
      .                   self.span_to_source(sp, |src, start_index, end_index| {
      .                       src.get(start_index..end_index)
      .                           .map(|s| s.to_string())
      .                           .ok_or(SpanSnippetError::IllFormedSpan(sp))
      .                   })
    108 ( 0.00%)      }
      .           
      .               pub fn span_to_margin(&self, sp: Span) -> Option<usize> {
      .                   Some(self.indentation_before(sp)?.len())
      .               }
      .           
      .               pub fn indentation_before(&self, sp: Span) -> Option<String> {
      .                   self.span_to_source(sp, |src, start_index, _| {
      .                       let before = &src[..start_index];
-- line 601 ----------------------------------------
-- line 679 ----------------------------------------
      .                       }
      .                   }
      .           
      .                   sp
      .               }
      .           
      .               /// Given a `Span`, tries to get a shorter span ending before the first occurrence of `char`
      .               /// `c`.
     99 ( 0.00%)      pub fn span_until_char(&self, sp: Span, c: char) -> Span {
     36 ( 0.00%)          match self.span_to_snippet(sp) {
     36 ( 0.00%)              Ok(snippet) => {
      .                           let snippet = snippet.split(c).next().unwrap_or("").trim_end();
     18 ( 0.00%)                  if !snippet.is_empty() && !snippet.contains('\n') {
     45 ( 0.00%)                      sp.with_hi(BytePos(sp.lo().0 + snippet.len() as u32))
      .                           } else {
      .                               sp
      .                           }
      .                       }
      .                       _ => sp,
      .                   }
     81 ( 0.00%)      }
      .           
      .               /// Given a `Span`, tries to get a shorter span ending just after the first occurrence of `char`
      .               /// `c`.
      .               pub fn span_through_char(&self, sp: Span, c: char) -> Span {
      .                   if let Ok(snippet) = self.span_to_snippet(sp) {
      .                       if let Some(offset) = snippet.find(c) {
      .                           return sp.with_hi(BytePos(sp.lo().0 + (offset + c.len_utf8()) as u32));
      .                       }
-- line 707 ----------------------------------------
-- line 750 ----------------------------------------
      .               /// Given a `Span`, return a span ending in the closest `{`. This is useful when you have a
      .               /// `Span` enclosing a whole item but we need to point at only the head (usually the first
      .               /// line) of that item.
      .               ///
      .               /// *Only suitable for diagnostics.*
      .               pub fn guess_head_span(&self, sp: Span) -> Span {
      .                   // FIXME: extend the AST items to have a head span, or replace callers with pointing at
      .                   // the item's ident when appropriate.
     18 ( 0.00%)          self.span_until_char(sp, '{')
      .               }
      .           
      .               /// Returns a new span representing just the first character of the given span.
     12 ( 0.00%)      pub fn start_point(&self, sp: Span) -> Span {
      .                   let width = {
      .                       let sp = sp.data();
      5 ( 0.00%)              let local_begin = self.lookup_byte_offset(sp.lo);
      .                       let start_index = local_begin.pos.to_usize();
      .                       let src = local_begin.sf.external_src.borrow();
      .           
      3 ( 0.00%)              let snippet = if let Some(ref src) = local_begin.sf.src {
      .                           Some(&src[start_index..])
      .                       } else if let Some(src) = src.get_source() {
      .                           Some(&src[start_index..])
      .                       } else {
      .                           None
      .                       };
      .           
      1 ( 0.00%)              match snippet {
      .                           None => 1,
      .                           Some(snippet) => match snippet.chars().next() {
      .                               None => 1,
      .                               Some(c) => c.len_utf8(),
      .                           },
      .                       }
      .                   };
      .           
     12 ( 0.00%)          sp.with_hi(BytePos(sp.lo().0 + width as u32))
      .               }
      .           
      .               /// Returns a new span representing just the last character of this span.
  2,148 ( 0.00%)      pub fn end_point(&self, sp: Span) -> Span {
      .                   let pos = sp.hi().0;
      .           
    716 ( 0.00%)          let width = self.find_width_of_character_at_span(sp, false);
      .                   let corrected_end_position = pos.checked_sub(width).unwrap_or(pos);
      .           
      .                   let end_point = BytePos(cmp::max(corrected_end_position, sp.lo().0));
  1,790 ( 0.00%)          sp.with_lo(end_point)
      .               }
      .           
      .               /// Returns a new span representing the next character after the end-point of this span.
    143 ( 0.00%)      pub fn next_point(&self, sp: Span) -> Span {
     13 ( 0.00%)          if sp.is_dummy() {
      .                       return sp;
      .                   }
      .                   let start_of_next_point = sp.hi().0;
      .           
     52 ( 0.00%)          let width = self.find_width_of_character_at_span(sp.shrink_to_hi(), true);
      .                   // If the width is 1, then the next span should point to the same `lo` and `hi`. However,
      .                   // in the case of a multibyte character, where the width != 1, the next span should
      .                   // span multiple bytes to include the whole character.
      .                   let end_of_next_point =
     26 ( 0.00%)              start_of_next_point.checked_add(width - 1).unwrap_or(start_of_next_point);
      .           
     26 ( 0.00%)          let end_of_next_point = BytePos(cmp::max(sp.lo().0 + 1, end_of_next_point));
      .                   Span::new(BytePos(start_of_next_point), end_of_next_point, sp.ctxt(), None)
    117 ( 0.00%)      }
      .           
      .               /// Finds the width of the character, either before or after the end of provided span,
      .               /// depending on the `forwards` parameter.
  2,304 ( 0.00%)      fn find_width_of_character_at_span(&self, sp: Span, forwards: bool) -> u32 {
      .                   let sp = sp.data();
    192 ( 0.00%)          if sp.lo == sp.hi {
      .                       debug!("find_width_of_character_at_span: early return empty span");
      .                       return 1;
      .                   }
      .           
  1,253 ( 0.00%)          let local_begin = self.lookup_byte_offset(sp.lo);
  1,611 ( 0.00%)          let local_end = self.lookup_byte_offset(sp.hi);
      .                   debug!(
      .                       "find_width_of_character_at_span: local_begin=`{:?}`, local_end=`{:?}`",
      .                       local_begin, local_end
      .                   );
      .           
    358 ( 0.00%)          if local_begin.sf.start_pos != local_end.sf.start_pos {
      .                       debug!("find_width_of_character_at_span: begin and end are in different files");
      .                       return 1;
      .                   }
      .           
      .                   let start_index = local_begin.pos.to_usize();
      .                   let end_index = local_end.pos.to_usize();
      .                   debug!(
      .                       "find_width_of_character_at_span: start_index=`{:?}`, end_index=`{:?}`",
      .                       start_index, end_index
      .                   );
      .           
      .                   // Disregard indexes that are at the start or end of their spans, they can't fit bigger
      .                   // characters.
    716 ( 0.00%)          if (!forwards && end_index == usize::MIN) || (forwards && start_index == usize::MAX) {
      .                       debug!("find_width_of_character_at_span: start or end of span, cannot be multibyte");
      .                       return 1;
      .                   }
      .           
    179 ( 0.00%)          let source_len = (local_begin.sf.end_pos - local_begin.sf.start_pos).to_usize();
      .                   debug!("find_width_of_character_at_span: source_len=`{:?}`", source_len);
      .                   // Ensure indexes are also not malformed.
    716 ( 0.00%)          if start_index > end_index || end_index > source_len {
      .                       debug!("find_width_of_character_at_span: source indexes are malformed");
      .                       return 1;
      .                   }
      .           
      .                   let src = local_begin.sf.external_src.borrow();
      .           
      .                   // We need to extend the snippet to the end of the src rather than to end_index so when
      .                   // searching forwards for boundaries we've got somewhere to search.
    537 ( 0.00%)          let snippet = if let Some(ref src) = local_begin.sf.src {
      .                       &src[start_index..]
     54 ( 0.00%)          } else if let Some(src) = src.get_source() {
      .                       &src[start_index..]
      .                   } else {
      .                       return 1;
      .                   };
      .                   debug!("find_width_of_character_at_span: snippet=`{:?}`", snippet);
      .           
    750 ( 0.00%)          let mut target = if forwards { end_index + 1 } else { end_index - 1 };
      .                   debug!("find_width_of_character_at_span: initial target=`{:?}`", target);
      .           
    500 ( 0.00%)          while !snippet.is_char_boundary(target - start_index) && target < source_len {
      .                       target = if forwards {
      .                           target + 1
      .                       } else {
      .                           match target.checked_sub(1) {
      .                               Some(target) => target,
      .                               None => {
      .                                   break;
      .                               }
      .                           }
      .                       };
      .                       debug!("find_width_of_character_at_span: target=`{:?}`", target);
      .                   }
      .                   debug!("find_width_of_character_at_span: final target=`{:?}`", target);
      .           
    500 ( 0.00%)          if forwards { (target - end_index) as u32 } else { (end_index - target) as u32 }
  1,728 ( 0.00%)      }
      .           
      .               pub fn get_source_file(&self, filename: &FileName) -> Option<Lrc<SourceFile>> {
      .                   // Remap filename before lookup
      .                   let filename = self.path_mapping().map_filename_prefix(filename).0;
      .                   for sf in self.files.borrow().source_files.iter() {
      .                       if filename == sf.name {
      .                           return Some(sf.clone());
      .                       }
      .                   }
      .                   None
      .               }
      .           
      .               /// For a global `BytePos`, computes the local offset within the containing `SourceFile`.
  1,915 ( 0.00%)      pub fn lookup_byte_offset(&self, bpos: BytePos) -> SourceFileAndBytePos {
    383 ( 0.00%)          let idx = self.lookup_source_file_idx(bpos);
    766 ( 0.00%)          let sf = (*self.files.borrow().source_files)[idx].clone();
      .                   let offset = bpos - sf.start_pos;
      .                   SourceFileAndBytePos { sf, pos: offset }
  1,915 ( 0.00%)      }
      .           
      .               // Returns the index of the `SourceFile` (in `self.files`) that contains `pos`.
      .               // This index is guaranteed to be valid for the lifetime of this `SourceMap`,
      .               // since `source_files` is a `MonotonicVec`
  1,407 ( 0.00%)      pub fn lookup_source_file_idx(&self, pos: BytePos) -> usize {
      .                   self.files
      .                       .borrow()
      .                       .source_files
      .                       .binary_search_by_key(&pos, |key| key.start_pos)
    936 ( 0.00%)              .unwrap_or_else(|p| p - 1)
  1,876 ( 0.00%)      }
      .           
      .               pub fn count_lines(&self) -> usize {
      .                   self.files().iter().fold(0, |a, f| a + f.count_lines())
      .               }
      .           
      .               pub fn generate_fn_name_span(&self, span: Span) -> Option<Span> {
      .                   let prev_span = self.span_extend_to_prev_str(span, "fn", true);
      .                   if let Ok(snippet) = self.span_to_snippet(prev_span) {
-- line 931 ----------------------------------------
-- line 1010 ----------------------------------------
      .           
      .                           return Some((sugg_span, new_snippet));
      .                       }
      .                   }
      .           
      .                   None
      .               }
      .               pub fn ensure_source_file_source_present(&self, source_file: Lrc<SourceFile>) -> bool {
     84 ( 0.00%)          source_file.add_external_src(|| {
      .                       match source_file.name {
      .                           FileName::Real(ref name) if let Some(local_path) = name.local_path() => {
      .                               self.file_loader.read_file(local_path).ok()
      .                           }
      .                           _ => None,
      .                       }
      .                   })
      .               }
-- line 1026 ----------------------------------------
-- line 1053 ----------------------------------------
      .                   let span = span.shrink_to_hi().with_hi(BytePos(span.hi().0.checked_add(1)?));
      .                   if self.span_to_snippet(span).as_deref() != Ok(";") {
      .                       return None;
      .                   }
      .                   Some(span)
      .               }
      .           }
      .           
      8 ( 0.00%)  #[derive(Clone)]
      .           pub struct FilePathMapping {
      4 ( 0.00%)      mapping: Vec<(PathBuf, PathBuf)>,
      2 ( 0.00%)      filename_display_for_diagnostics: FileNameDisplayPreference,
      .           }
      .           
      .           impl FilePathMapping {
      .               pub fn empty() -> FilePathMapping {
      .                   FilePathMapping::new(Vec::new())
      .               }
      .           
      3 ( 0.00%)      pub fn new(mapping: Vec<(PathBuf, PathBuf)>) -> FilePathMapping {
      .                   let filename_display_for_diagnostics = if mapping.is_empty() {
      .                       FileNameDisplayPreference::Local
      .                   } else {
      .                       FileNameDisplayPreference::Remapped
      .                   };
      .           
     12 ( 0.00%)          FilePathMapping { mapping, filename_display_for_diagnostics }
      3 ( 0.00%)      }
      .           
      .               /// Applies any path prefix substitution as defined by the mapping.
      .               /// The return value is the remapped path and a boolean indicating whether
      .               /// the path was affected by the mapping.
     45 ( 0.00%)      pub fn map_prefix(&self, path: PathBuf) -> (PathBuf, bool) {
      .                   // NOTE: We are iterating over the mapping entries from last to first
      .                   //       because entries specified later on the command line should
      .                   //       take precedence.
      .                   for &(ref from, ref to) in self.mapping.iter().rev() {
      .                       if let Ok(rest) = path.strip_prefix(from) {
      .                           return (to.join(rest), true);
      .                       }
      .                   }
      .           
     25 ( 0.00%)          (path, false)
     45 ( 0.00%)      }
      .           
      8 ( 0.00%)      fn map_filename_prefix(&self, file: &FileName) -> (FileName, bool) {
      2 ( 0.00%)          match file {
      2 ( 0.00%)              FileName::Real(realfile) if let RealFileName::LocalPath(local_path) = realfile => {
     14 ( 0.00%)                  let (mapped_path, mapped) = self.map_prefix(local_path.to_path_buf());
      1 ( 0.00%)                  let realfile = if mapped {
      .                               RealFileName::Remapped {
      .                                   local_path: Some(local_path.clone()),
      .                                   virtual_name: mapped_path,
      .                               }
      .                           } else {
      .                               realfile.clone()
      .                           };
     10 ( 0.00%)                  (FileName::Real(realfile), mapped)
      4 ( 0.00%)              }
      .                       FileName::Real(_) => unreachable!("attempted to remap an already remapped filename"),
      .                       other => (other.clone(), false),
      .                   }
      .               }
      .           }

  5,013 ( 0.00%)  <counts for unidentified lines in /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/source_map.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/num/uint_macros.rs
--------------------------------------------------------------------------------
Ir               

-- line 57 ----------------------------------------
      .                   /// # Examples
      .                   ///
      .                   /// Basic usage:
      .                   ///
      .                   /// ```
      .                   #[doc = concat!("assert_eq!(", stringify!($SelfT), "::from_str_radix(\"A\", 16), Ok(10));")]
      .                   /// ```
      .                   #[stable(feature = "rust1", since = "1.0.0")]
      8 ( 0.00%)          pub fn from_str_radix(src: &str, radix: u32) -> Result<Self, ParseIntError> {
      4 ( 0.00%)              from_str_radix(src, radix)
     12 ( 0.00%)          }
      .           
      .                   /// Returns the number of ones in the binary representation of `self`.
      .                   ///
      .                   /// # Examples
      .                   ///
      .                   /// Basic usage:
      .                   ///
      .                   /// ```
-- line 75 ----------------------------------------
-- line 80 ----------------------------------------
      .                   #[stable(feature = "rust1", since = "1.0.0")]
      .                   #[rustc_const_stable(feature = "const_math", since = "1.32.0")]
      .                   #[doc(alias = "popcount")]
      .                   #[doc(alias = "popcnt")]
      .                   #[must_use = "this returns the result of the operation, \
      .                                 without modifying the original"]
      .                   #[inline(always)]
      .                   pub const fn count_ones(self) -> u32 {
  3,585 ( 0.00%)              intrinsics::ctpop(self as $ActualT) as u32
      .                   }
      .           
      .                   /// Returns the number of zeros in the binary representation of `self`.
      .                   ///
      .                   /// # Examples
      .                   ///
      .                   /// Basic usage:
      .                   ///
-- line 96 ----------------------------------------
-- line 118 ----------------------------------------
      .                   /// assert_eq!(n.leading_zeros(), 2);
      .                   /// ```
      .                   #[stable(feature = "rust1", since = "1.0.0")]
      .                   #[rustc_const_stable(feature = "const_math", since = "1.32.0")]
      .                   #[must_use = "this returns the result of the operation, \
      .                                 without modifying the original"]
      .                   #[inline(always)]
      .                   pub const fn leading_zeros(self) -> u32 {
 47,773 ( 0.04%)              intrinsics::ctlz(self as $ActualT) as u32
      .                   }
      .           
      .                   /// Returns the number of trailing zeros in the binary representation
      .                   /// of `self`.
      .                   ///
      .                   /// # Examples
      .                   ///
      .                   /// Basic usage:
-- line 134 ----------------------------------------
-- line 139 ----------------------------------------
      .                   /// assert_eq!(n.trailing_zeros(), 3);
      .                   /// ```
      .                   #[stable(feature = "rust1", since = "1.0.0")]
      .                   #[rustc_const_stable(feature = "const_math", since = "1.32.0")]
      .                   #[must_use = "this returns the result of the operation, \
      .                                 without modifying the original"]
      .                   #[inline(always)]
      .                   pub const fn trailing_zeros(self) -> u32 {
 38,532 ( 0.03%)              intrinsics::cttz(self) as u32
      .                   }
      .           
      .                   /// Returns the number of leading ones in the binary representation of `self`.
      .                   ///
      .                   /// # Examples
      .                   ///
      .                   /// Basic usage:
      .                   ///
-- line 155 ----------------------------------------
-- line 204 ----------------------------------------
      .                   #[doc = concat!("assert_eq!(n.rotate_left(", $rot, "), m);")]
      .                   /// ```
      .                   #[stable(feature = "rust1", since = "1.0.0")]
      .                   #[rustc_const_stable(feature = "const_math", since = "1.32.0")]
      .                   #[must_use = "this returns the result of the operation, \
      .                                 without modifying the original"]
      .                   #[inline(always)]
      .                   pub const fn rotate_left(self, n: u32) -> Self {
483,807 ( 0.39%)              intrinsics::rotate_left(self, n as $SelfT)
      .                   }
      .           
      .                   /// Shifts the bits to the right by a specified amount, `n`,
      .                   /// wrapping the truncated bits to the beginning of the resulting
      .                   /// integer.
      .                   ///
      .                   /// Please note this isn't the same operation as the `>>` shifting operator!
      .                   ///
-- line 220 ----------------------------------------
-- line 456 ----------------------------------------
      .                   )]
      .                   #[must_use = "this returns the result of the operation, \
      .                                 without modifying the original"]
      .                   #[rustc_const_unstable(feature = "const_inherent_unchecked_arith", issue = "85122")]
      .                   #[inline(always)]
      .                   pub const unsafe fn unchecked_add(self, rhs: Self) -> Self {
      .                       // SAFETY: the caller must uphold the safety contract for
      .                       // `unchecked_add`.
 97,880 ( 0.08%)              unsafe { intrinsics::unchecked_add(self, rhs) }
      .                   }
      .           
      .                   /// Checked addition with a signed integer. Computes `self + rhs`,
      .                   /// returning `None` if overflow occurred.
      .                   ///
      .                   /// # Examples
      .                   ///
      .                   /// Basic usage:
-- line 472 ----------------------------------------
-- line 525 ----------------------------------------
      .                   )]
      .                   #[must_use = "this returns the result of the operation, \
      .                                 without modifying the original"]
      .                   #[rustc_const_unstable(feature = "const_inherent_unchecked_arith", issue = "85122")]
      .                   #[inline(always)]
      .                   pub const unsafe fn unchecked_sub(self, rhs: Self) -> Self {
      .                       // SAFETY: the caller must uphold the safety contract for
      .                       // `unchecked_sub`.
  1,853 ( 0.00%)              unsafe { intrinsics::unchecked_sub(self, rhs) }
      .                   }
      .           
      .                   /// Checked integer multiplication. Computes `self * rhs`, returning
      .                   /// `None` if overflow occurred.
      .                   ///
      .                   /// # Examples
      .                   ///
      .                   /// Basic usage:
-- line 541 ----------------------------------------
-- line 1035 ----------------------------------------
      .                   #[doc = concat!("assert_eq!(", stringify!($SelfT), "::MAX.saturating_add(127), ", stringify!($SelfT), "::MAX);")]
      .                   /// ```
      .                   #[stable(feature = "rust1", since = "1.0.0")]
      .                   #[must_use = "this returns the result of the operation, \
      .                                 without modifying the original"]
      .                   #[rustc_const_stable(feature = "const_saturating_int_methods", since = "1.47.0")]
      .                   #[inline(always)]
      .                   pub const fn saturating_add(self, rhs: Self) -> Self {
  4,178 ( 0.00%)              intrinsics::saturating_add(self, rhs)
      .                   }
      .           
      .                   /// Saturating addition with a signed integer. Computes `self + rhs`,
      .                   /// saturating at the numeric bounds instead of overflowing.
      .                   ///
      .                   /// # Examples
      .                   ///
      .                   /// Basic usage:
-- line 1051 ----------------------------------------
-- line 1084 ----------------------------------------
      .                   #[doc = concat!("assert_eq!(13", stringify!($SelfT), ".saturating_sub(127), 0);")]
      .                   /// ```
      .                   #[stable(feature = "rust1", since = "1.0.0")]
      .                   #[must_use = "this returns the result of the operation, \
      .                                 without modifying the original"]
      .                   #[rustc_const_stable(feature = "const_saturating_int_methods", since = "1.47.0")]
      .                   #[inline(always)]
      .                   pub const fn saturating_sub(self, rhs: Self) -> Self {
     78 ( 0.00%)              intrinsics::saturating_sub(self, rhs)
      .                   }
      .           
      .                   /// Saturating integer multiplication. Computes `self * rhs`,
      .                   /// saturating at the numeric bounds instead of overflowing.
      .                   ///
      .                   /// # Examples
      .                   ///
      .                   /// Basic usage:
-- line 1100 ----------------------------------------
-- line 1175 ----------------------------------------
      .                   #[doc = concat!("assert_eq!(200", stringify!($SelfT), ".wrapping_add(", stringify!($SelfT), "::MAX), 199);")]
      .                   /// ```
      .                   #[stable(feature = "rust1", since = "1.0.0")]
      .                   #[rustc_const_stable(feature = "const_wrapping_math", since = "1.32.0")]
      .                   #[must_use = "this returns the result of the operation, \
      .                                 without modifying the original"]
      .                   #[inline(always)]
      .                   pub const fn wrapping_add(self, rhs: Self) -> Self {
208,264 ( 0.17%)              intrinsics::wrapping_add(self, rhs)
      .                   }
      .           
      .                   /// Wrapping (modular) addition with a signed integer. Computes
      .                   /// `self + rhs`, wrapping around at the boundary of the type.
      .                   ///
      .                   /// # Examples
      .                   ///
      .                   /// Basic usage:
-- line 1191 ----------------------------------------
-- line 1217 ----------------------------------------
      .                   #[doc = concat!("assert_eq!(100", stringify!($SelfT), ".wrapping_sub(", stringify!($SelfT), "::MAX), 101);")]
      .                   /// ```
      .                   #[stable(feature = "rust1", since = "1.0.0")]
      .                   #[rustc_const_stable(feature = "const_wrapping_math", since = "1.32.0")]
      .                   #[must_use = "this returns the result of the operation, \
      .                                 without modifying the original"]
      .                   #[inline(always)]
      .                   pub const fn wrapping_sub(self, rhs: Self) -> Self {
154,179 ( 0.12%)              intrinsics::wrapping_sub(self, rhs)
      .                   }
      .           
      .                   /// Wrapping (modular) multiplication. Computes `self *
      .                   /// rhs`, wrapping around at the boundary of the type.
      .                   ///
      .                   /// # Examples
      .                   ///
      .                   /// Basic usage:
-- line 1233 ----------------------------------------
-- line 1240 ----------------------------------------
      .                   /// assert_eq!(25u8.wrapping_mul(12), 44);
      .                   /// ```
      .                   #[stable(feature = "rust1", since = "1.0.0")]
      .                   #[rustc_const_stable(feature = "const_wrapping_math", since = "1.32.0")]
      .                   #[must_use = "this returns the result of the operation, \
      .                                 without modifying the original"]
      .                   #[inline(always)]
      .                   pub const fn wrapping_mul(self, rhs: Self) -> Self {
417,698 ( 0.34%)              intrinsics::wrapping_mul(self, rhs)
      .                   }
      .           
      .                   /// Wrapping (modular) division. Computes `self / rhs`.
      .                   /// Wrapped division on unsigned types is just normal division.
      .                   /// There's no way wrapping could ever happen.
      .                   /// This function exists, so that all operations
      .                   /// are accounted for in the wrapping operations.
      .                   ///
-- line 1256 ----------------------------------------
-- line 1492 ----------------------------------------
      .                   #[doc = concat!("assert_eq!(", stringify!($SelfT), "::MAX.overflowing_add(1), (0, true));")]
      .                   /// ```
      .                   #[stable(feature = "wrapping", since = "1.7.0")]
      .                   #[rustc_const_stable(feature = "const_wrapping_math", since = "1.32.0")]
      .                   #[must_use = "this returns the result of the operation, \
      .                                 without modifying the original"]
      .                   #[inline(always)]
      .                   pub const fn overflowing_add(self, rhs: Self) -> (Self, bool) {
 53,658 ( 0.04%)              let (a, b) = intrinsics::add_with_overflow(self as $ActualT, rhs as $ActualT);
      .                       (a as Self, b)
      .                   }
      .           
      .                   /// Calculates `self + rhs + carry` without the ability to overflow.
      .                   ///
      .                   /// Performs "ternary addition" which takes in an extra bit to add, and may return an
      .                   /// additional bit of overflow. This allows for chaining together multiple additions
      .                   /// to create "big integers" which represent larger values.
-- line 1508 ----------------------------------------
-- line 1588 ----------------------------------------
      .                   #[doc = concat!("assert_eq!(0", stringify!($SelfT), ".overflowing_sub(1), (", stringify!($SelfT), "::MAX, true));")]
      .                   /// ```
      .                   #[stable(feature = "wrapping", since = "1.7.0")]
      .                   #[rustc_const_stable(feature = "const_wrapping_math", since = "1.32.0")]
      .                   #[must_use = "this returns the result of the operation, \
      .                                 without modifying the original"]
      .                   #[inline(always)]
      .                   pub const fn overflowing_sub(self, rhs: Self) -> (Self, bool) {
 23,035 ( 0.02%)              let (a, b) = intrinsics::sub_with_overflow(self as $ActualT, rhs as $ActualT);
      .                       (a as Self, b)
      .                   }
      .           
      .                   /// Calculates `self - rhs - borrow` without the ability to overflow.
      .                   ///
      .                   /// Performs "ternary subtraction" which takes in an extra bit to subtract, and may return
      .                   /// an additional bit of overflow. This allows for chaining together multiple subtractions
      .                   /// to create "big integers" which represent larger values.
-- line 1604 ----------------------------------------
-- line 1674 ----------------------------------------
      .                   /// assert_eq!(1_000_000_000u32.overflowing_mul(10), (1410065408, true));
      .                   /// ```
      .                   #[stable(feature = "wrapping", since = "1.7.0")]
      .                   #[rustc_const_stable(feature = "const_wrapping_math", since = "1.32.0")]
      .                   #[must_use = "this returns the result of the operation, \
      .                                     without modifying the original"]
      .                   #[inline(always)]
      .                   pub const fn overflowing_mul(self, rhs: Self) -> (Self, bool) {
 77,365 ( 0.06%)              let (a, b) = intrinsics::mul_with_overflow(self as $ActualT, rhs as $ActualT);
      .                       (a as Self, b)
      .                   }
      .           
      .                   /// Calculates the divisor when `self` is divided by `rhs`.
      .                   ///
      .                   /// Returns a tuple of the divisor along with a boolean indicating
      .                   /// whether an arithmetic overflow would occur. Note that for unsigned
      .                   /// integers overflow never occurs, so the second value is always
-- line 1690 ----------------------------------------
-- line 2132 ----------------------------------------
      .                   #[doc = concat!("assert!(16", stringify!($SelfT), ".is_power_of_two());")]
      .                   #[doc = concat!("assert!(!10", stringify!($SelfT), ".is_power_of_two());")]
      .                   /// ```
      .                   #[must_use]
      .                   #[stable(feature = "rust1", since = "1.0.0")]
      .                   #[rustc_const_stable(feature = "const_is_power_of_two", since = "1.32.0")]
      .                   #[inline(always)]
      .                   pub const fn is_power_of_two(self) -> bool {
    138 ( 0.00%)              self.count_ones() == 1
      .                   }
      .           
      .                   // Returns one less than next power of two.
      .                   // (For 8u8 next power of two is 8u8 and for 6u8 it is 8u8)
      .                   //
      .                   // 8u8.one_less_than_next_power_of_two() == 7
      .                   // 6u8.one_less_than_next_power_of_two() == 7
      .                   //
      .                   // This method cannot overflow, as in the `next_power_of_two`
      .                   // overflow cases it instead ends up returning the maximum value
      .                   // of the type, and can return 0 for 0.
      .                   #[inline]
      .                   #[rustc_const_stable(feature = "const_int_pow", since = "1.50.0")]
      .                   const fn one_less_than_next_power_of_two(self) -> Self {
    388 ( 0.00%)              if self <= 1 { return 0; }
      .           
  1,185 ( 0.00%)              let p = self - 1;
      .                       // SAFETY: Because `p > 0`, it cannot consist entirely of leading zeros.
      .                       // That means the shift is always in-bounds, and some processors
      .                       // (such as intel pre-haswell) have more efficient ctlz
      .                       // intrinsics when the argument is non-zero.
  3,537 ( 0.00%)              let z = unsafe { intrinsics::ctlz_nonzero(p) };
  1,179 ( 0.00%)              <$SelfT>::MAX >> z
      .                   }
      .           
      .                   /// Returns the smallest power of two greater than or equal to `self`.
      .                   ///
      .                   /// When return value overflows (i.e., `self > (1 << (N-1))` for type
      .                   /// `uN`), it panics in debug mode and the return value is wrapped to 0 in
      .                   /// release mode (the only situation in which method can return 0).
      .                   ///
-- line 2171 ----------------------------------------
-- line 2179 ----------------------------------------
      .                   /// ```
      .                   #[stable(feature = "rust1", since = "1.0.0")]
      .                   #[rustc_const_stable(feature = "const_int_pow", since = "1.50.0")]
      .                   #[must_use = "this returns the result of the operation, \
      .                                 without modifying the original"]
      .                   #[inline]
      .                   #[rustc_inherit_overflow_checks]
      .                   pub const fn next_power_of_two(self) -> Self {
  1,970 ( 0.00%)              self.one_less_than_next_power_of_two() + 1
      .                   }
      .           
      .                   /// Returns the smallest power of two greater than or equal to `n`. If
      .                   /// the next power of two is greater than the type's maximum value,
      .                   /// `None` is returned, otherwise the power of two is wrapped in `Some`.
      .                   ///
      .                   /// # Examples
      .                   ///
-- line 2195 ----------------------------------------

  4,347 ( 0.00%)  <counts for unidentified lines in /usr/home/liquid/rust/worktree-benchmarking/library/core/src/num/uint_macros.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/std/src/path.rs
--------------------------------------------------------------------------------
Ir              

-- line 316 ----------------------------------------
     .           
     .           ////////////////////////////////////////////////////////////////////////////////
     .           // Cross-platform, iterator-independent parsing
     .           ////////////////////////////////////////////////////////////////////////////////
     .           
     .           /// Says whether the first byte after the prefix is a separator.
     .           fn has_physical_root(s: &[u8], prefix: Option<Prefix<'_>>) -> bool {
     .               let path = if let Some(p) = prefix { &s[p.len()..] } else { s };
    86 ( 0.00%)      !path.is_empty() && is_sep_byte(path[0])
     .           }
     .           
     .           // basic workhorse for splitting stem and extension
     .           fn rsplit_file_at_dot(file: &OsStr) -> (Option<&OsStr>, Option<&OsStr>) {
     .               if os_str_as_u8_slice(file) == b".." {
     .                   return (Some(file), None);
     .               }
     .           
     .               // The unsafety here stems from converting between &OsStr and &[u8]
     .               // and back. This is safe to do because (1) we only look at ASCII
     .               // contents of the encoding and (2) new &OsStr values are produced
     .               // only from ASCII-bounded slices of existing &OsStr values.
    72 ( 0.00%)      let mut iter = os_str_as_u8_slice(file).rsplitn(2, |b| *b == b'.');
     .               let after = iter.next();
     .               let before = iter.next();
     .               if before == Some(b"") {
     .                   (Some(file), None)
     .               } else {
     .                   unsafe { (before.map(|s| u8_slice_as_os_str(s)), after.map(|s| u8_slice_as_os_str(s))) }
     .               }
     .           }
-- line 345 ----------------------------------------
-- line 368 ----------------------------------------
     .           ////////////////////////////////////////////////////////////////////////////////
     .           
     .           /// Component parsing works by a double-ended state machine; the cursors at the
     .           /// front and back of the path each keep track of what parts of the path have
     .           /// been consumed so far.
     .           ///
     .           /// Going front to back, a path is made up of a prefix, a starting
     .           /// directory component, and a body (of normal components)
   103 ( 0.00%)  #[derive(Copy, Clone, PartialEq, PartialOrd, Debug)]
     .           enum State {
     .               Prefix = 0,   // c:
     .               StartDir = 1, // / or . or nothing
     .               Body = 2,     // foo/bar/baz
     .               Done = 3,
     .           }
     .           
     .           /// A structure wrapping a Windows path prefix as well as its unparsed string
-- line 384 ----------------------------------------
-- line 493 ----------------------------------------
     .           /// let components = path.components().collect::<Vec<_>>();
     .           /// assert_eq!(&components, &[
     .           ///     Component::RootDir,
     .           ///     Component::Normal("tmp".as_ref()),
     .           ///     Component::Normal("foo".as_ref()),
     .           ///     Component::Normal("bar.txt".as_ref()),
     .           /// ]);
     .           /// ```
     2 ( 0.00%)  #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)]
     .           #[stable(feature = "rust1", since = "1.0.0")]
     .           pub enum Component<'a> {
     .               /// A Windows path prefix, e.g., `C:` or `\\server\share`.
     .               ///
     .               /// There is a large variety of prefix types, see [`Prefix`]'s documentation
     .               /// for more.
     .               ///
     .               /// Does not occur on Unix.
-- line 509 ----------------------------------------
-- line 586 ----------------------------------------
     .           /// let path = Path::new("/tmp/foo/bar.txt");
     .           ///
     .           /// for component in path.components() {
     .           ///     println!("{:?}", component);
     .           /// }
     .           /// ```
     .           ///
     .           /// [`components`]: Path::components
    72 ( 0.00%)  #[derive(Clone)]
     .           #[must_use = "iterators are lazy and do nothing unless consumed"]
     .           #[stable(feature = "rust1", since = "1.0.0")]
     .           pub struct Components<'a> {
     .               // The path left to parse components from
    12 ( 0.00%)      path: &'a [u8],
     .           
     .               // The prefix as it was originally parsed, if any
     .               prefix: Option<Prefix<'a>>,
     .           
     .               // true if path *physically* has a root separator; for most Windows
     .               // prefixes, it may have a "logical" root separator for the purposes of
     .               // normalization, e.g.,  \\server\share == \\server\share\.
     .               has_physical_root: bool,
     .           
     .               // The iterator is double-ended, and these two states keep track of what has
     .               // been produced from either end
     6 ( 0.00%)      front: State,
     6 ( 0.00%)      back: State,
     .           }
     .           
     .           /// An iterator over the [`Component`]s of a [`Path`], as [`OsStr`] slices.
     .           ///
     .           /// This `struct` is created by the [`iter`] method on [`Path`].
     .           /// See its documentation for more.
     .           ///
     .           /// [`iter`]: Path::iter
-- line 620 ----------------------------------------
-- line 650 ----------------------------------------
     .               #[inline]
     .               fn prefix_verbatim(&self) -> bool {
     .                   self.prefix.as_ref().map(Prefix::is_verbatim).unwrap_or(false)
     .               }
     .           
     .               /// how much of the prefix is left from the point of view of iteration?
     .               #[inline]
     .               fn prefix_remaining(&self) -> usize {
    91 ( 0.00%)          if self.front == State::Prefix { self.prefix_len() } else { 0 }
     .               }
     .           
     .               // Given the iteration so far, how much of the pre-State::Body path is left?
     .               #[inline]
   637 ( 0.00%)      fn len_before_body(&self) -> usize {
   364 ( 0.00%)          let root = if self.front <= State::StartDir && self.has_physical_root { 1 } else { 0 };
   103 ( 0.00%)          let cur_dir = if self.front <= State::StartDir && self.include_cur_dir() { 1 } else { 0 };
   364 ( 0.00%)          self.prefix_remaining() + root + cur_dir
   819 ( 0.00%)      }
     .           
     .               // is the iteration complete?
     .               #[inline]
     .               fn finished(&self) -> bool {
     .                   self.front == State::Done || self.back == State::Done || self.front > self.back
     .               }
     .           
     .               #[inline]
-- line 675 ----------------------------------------
-- line 687 ----------------------------------------
     .               /// let mut components = Path::new("/tmp/foo/bar.txt").components();
     .               /// components.next();
     .               /// components.next();
     .               ///
     .               /// assert_eq!(Path::new("foo/bar.txt"), components.as_path());
     .               /// ```
     .               #[must_use]
     .               #[stable(feature = "rust1", since = "1.0.0")]
    36 ( 0.00%)      pub fn as_path(&self) -> &'a Path {
     .                   let mut comps = self.clone();
     6 ( 0.00%)          if comps.front == State::Body {
     .                       comps.trim_left();
     .                   }
     6 ( 0.00%)          if comps.back == State::Body {
     .                       comps.trim_right();
     .                   }
     .                   unsafe { Path::from_u8_slice(comps.path) }
    54 ( 0.00%)      }
     .           
     .               /// Is the *original* path rooted?
     .               fn has_root(&self) -> bool {
   182 ( 0.00%)          if self.has_physical_root {
     .                       return true;
     .                   }
    15 ( 0.00%)          if let Some(p) = self.prefix {
     .                       if p.has_implicit_root() {
     .                           return true;
     .                       }
     .                   }
     .                   false
     .               }
     .           
     .               /// Should the normalized path include a leading . ?
     .               fn include_cur_dir(&self) -> bool {
     6 ( 0.00%)          if self.has_root() {
     .                       return false;
     .                   }
    11 ( 0.00%)          let mut iter = self.path[self.prefix_len()..].iter();
     4 ( 0.00%)          match (iter.next(), iter.next()) {
     .                       (Some(&b'.'), None) => true,
     .                       (Some(&b'.'), Some(&b)) => self.is_sep_byte(b),
     .                       _ => false,
     .                   }
     .               }
     .           
     .               // parse a given byte sequence into the corresponding path component
     .               fn parse_single_component<'b>(&self, comp: &'b [u8]) -> Option<Component<'b>> {
     .                   match comp {
   270 ( 0.00%)              b"." if self.prefix_verbatim() => Some(Component::CurDir),
     .                       b"." => None, // . components are normalized away, except at
     .                       // the beginning of a path, which is treated
     .                       // separately via `include_cur_dir`
     .                       b".." => Some(Component::ParentDir),
     .                       b"" => None,
     .                       _ => Some(Component::Normal(unsafe { u8_slice_as_os_str(comp) })),
     .                   }
     .               }
-- line 743 ----------------------------------------
-- line 750 ----------------------------------------
     .                       None => (0, self.path),
     .                       Some(i) => (1, &self.path[..i]),
     .                   };
     .                   (comp.len() + extra, self.parse_single_component(comp))
     .               }
     .           
     .               // parse a component from the right, saying how many bytes to consume to
     .               // remove the component
   225 ( 0.00%)      fn parse_next_component_back(&self) -> (usize, Option<Component<'a>>) {
     .                   debug_assert!(self.back == State::Body);
    90 ( 0.00%)          let start = self.len_before_body();
    45 ( 0.00%)          let (extra, comp) = match self.path[start..].iter().rposition(|b| self.is_sep_byte(*b)) {
     .                       None => (0, &self.path[start..]),
   176 ( 0.00%)              Some(i) => (1, &self.path[start + i + 1..]),
     .                   };
   270 ( 0.00%)          (comp.len() + extra, self.parse_single_component(comp))
   180 ( 0.00%)      }
     .           
     .               // trim away repeated separators (i.e., empty components) on the left
     .               fn trim_left(&mut self) {
     .                   while !self.path.is_empty() {
     .                       let (size, comp) = self.parse_next_component();
     .                       if comp.is_some() {
     .                           return;
     .                       } else {
     .                           self.path = &self.path[size..];
     .                       }
     .                   }
     .               }
     .           
     .               // trim away repeated separators (i.e., empty components) on the right
     .               fn trim_right(&mut self) {
    18 ( 0.00%)          while self.path.len() > self.len_before_body() {
    18 ( 0.00%)              let (size, comp) = self.parse_next_component_back();
     6 ( 0.00%)              if comp.is_some() {
     .                           return;
     .                       } else {
     .                           self.path = &self.path[..self.path.len() - size];
     .                       }
     .                   }
     .               }
     .           }
     .           
-- line 792 ----------------------------------------
-- line 930 ----------------------------------------
     .                       }
     .                   }
     .                   None
     .               }
     .           }
     .           
     .           #[stable(feature = "rust1", since = "1.0.0")]
     .           impl<'a> DoubleEndedIterator for Components<'a> {
   400 ( 0.00%)      fn next_back(&mut self) -> Option<Component<'a>> {
   202 ( 0.00%)          while !self.finished() {
    90 ( 0.00%)              match self.back {
   200 ( 0.00%)                  State::Body if self.path.len() > self.len_before_body() => {
   468 ( 0.00%)                      let (size, comp) = self.parse_next_component_back();
   156 ( 0.00%)                      self.path = &self.path[..self.path.len() - size];
    39 ( 0.00%)                      if comp.is_some() {
   312 ( 0.00%)                          return comp;
     .                               }
     .                           }
     .                           State::Body => {
     3 ( 0.00%)                      self.back = State::StartDir;
     .                           }
     .                           State::StartDir => {
     2 ( 0.00%)                      self.back = State::Prefix;
    40 ( 0.00%)                      if self.has_physical_root {
     .                                   self.path = &self.path[..self.path.len() - 1];
     .                                   return Some(Component::RootDir);
    12 ( 0.00%)                      } else if let Some(p) = self.prefix {
     .                                   if p.has_implicit_root() && !p.is_verbatim() {
     .                                       return Some(Component::RootDir);
     .                                   }
     .                               } else if self.include_cur_dir() {
     .                                   self.path = &self.path[..self.path.len() - 1];
     .                                   return Some(Component::CurDir);
     .                               }
     .                           }
-- line 964 ----------------------------------------
-- line 965 ----------------------------------------
     .                           State::Prefix if self.prefix_len() > 0 => {
     .                               self.back = State::Done;
     .                               return Some(Component::Prefix(PrefixComponent {
     .                                   raw: unsafe { u8_slice_as_os_str(self.path) },
     .                                   parsed: self.prefix.unwrap(),
     .                               }));
     .                           }
     .                           State::Prefix => {
     1 ( 0.00%)                      self.back = State::Done;
     .                               return None;
     .                           }
     .                           State::Done => unreachable!(),
     .                       }
     .                   }
     .                   None
   360 ( 0.00%)      }
     .           }
     .           
     .           #[stable(feature = "fused", since = "1.26.0")]
     .           impl FusedIterator for Components<'_> {}
     .           
     .           #[stable(feature = "rust1", since = "1.0.0")]
     .           impl<'a> cmp::PartialEq for Components<'a> {
     .               #[inline]
-- line 988 ----------------------------------------
-- line 1001 ----------------------------------------
     .                       // possible future improvement: this could bail out earlier if there were a
     .                       // reverse memcmp/bcmp comparing back to front
     .                       if self.path == other.path {
     .                           return true;
     .                       }
     .                   }
     .           
     .                   // compare back to front since absolute paths often share long prefixes
     1 ( 0.00%)          Iterator::eq(self.clone().rev(), other.clone().rev())
     .               }
     .           }
     .           
     .           #[stable(feature = "rust1", since = "1.0.0")]
     .           impl cmp::Eq for Components<'_> {}
     .           
     .           #[stable(feature = "rust1", since = "1.0.0")]
     .           impl<'a> cmp::PartialOrd for Components<'a> {
-- line 1017 ----------------------------------------
-- line 1179 ----------------------------------------
     .               /// use std::path::PathBuf;
     .               ///
     .               /// let path = PathBuf::new();
     .               /// ```
     .               #[stable(feature = "rust1", since = "1.0.0")]
     .               #[must_use]
     .               #[inline]
     .               pub fn new() -> PathBuf {
    36 ( 0.00%)          PathBuf { inner: OsString::new() }
     .               }
     .           
     .               /// Creates a new `PathBuf` with a given capacity used to create the
     .               /// internal [`OsString`]. See [`with_capacity`] defined on [`OsString`].
     .               ///
     .               /// # Examples
     .               ///
     .               /// ```
-- line 1195 ----------------------------------------
-- line 1260 ----------------------------------------
     .               /// use std::path::PathBuf;
     .               ///
     .               /// let mut path = PathBuf::from("/tmp");
     .               /// path.push("/etc");
     .               /// assert_eq!(path, PathBuf::from("/etc"));
     .               /// ```
     .               #[stable(feature = "rust1", since = "1.0.0")]
     .               pub fn push<P: AsRef<Path>>(&mut self, path: P) {
   184 ( 0.00%)          self._push(path.as_ref())
     .               }
     .           
   368 ( 0.00%)      fn _push(&mut self, path: &Path) {
     .                   // in general, a separator is needed if the rightmost byte is not a separator
     .                   let mut need_sep = self.as_mut_vec().last().map(|c| !is_sep_byte(*c)).unwrap_or(false);
     .           
     .                   // in the special case of `C:` on Windows, do *not* add a separator
     .                   let comps = self.components();
     .           
     .                   if comps.prefix_len() > 0
     .                       && comps.prefix_len() == comps.path.len()
-- line 1279 ----------------------------------------
-- line 1327 ----------------------------------------
     .                       return;
     .           
     .                   // `path` has a root but no prefix, e.g., `\windows` (Windows only)
     .                   } else if path.has_root() {
     .                       let prefix_len = self.components().prefix_remaining();
     .                       self.as_mut_vec().truncate(prefix_len);
     .           
     .                   // `path` is a pure relative path
    45 ( 0.00%)          } else if need_sep {
     .                       self.inner.push(MAIN_SEP_STR);
     .                   }
     .           
     .                   self.inner.push(path);
   276 ( 0.00%)      }
     .           
     .               /// Truncates `self` to [`self.parent`].
     .               ///
     .               /// Returns `false` and does nothing if [`self.parent`] is [`None`].
     .               /// Otherwise, returns `true`.
     .               ///
     .               /// [`self.parent`]: Path::parent
     .               ///
-- line 1348 ----------------------------------------
-- line 1354 ----------------------------------------
     .               /// let mut p = PathBuf::from("/spirited/away.rs");
     .               ///
     .               /// p.pop();
     .               /// assert_eq!(Path::new("/spirited"), p);
     .               /// p.pop();
     .               /// assert_eq!(Path::new("/"), p);
     .               /// ```
     .               #[stable(feature = "rust1", since = "1.0.0")]
    16 ( 0.00%)      pub fn pop(&mut self) -> bool {
     4 ( 0.00%)          match self.parent().map(|p| p.as_u8_slice().len()) {
     .                       Some(len) => {
     .                           self.as_mut_vec().truncate(len);
     .                           true
     .                       }
     .                       None => false,
     .                   }
    16 ( 0.00%)      }
     .           
     .               /// Updates [`self.file_name`] to `file_name`.
     .               ///
     .               /// If [`self.file_name`] was [`None`], this is equivalent to pushing
     .               /// `file_name`.
     .               ///
     .               /// Otherwise it is equivalent to calling [`pop`] and then pushing
     .               /// `file_name`. The new path will be a sibling of the original path.
-- line 1378 ----------------------------------------
-- line 1428 ----------------------------------------
     .               /// p.set_extension("force");
     .               /// assert_eq!(Path::new("/feel/the.force"), p.as_path());
     .               ///
     .               /// p.set_extension("dark_side");
     .               /// assert_eq!(Path::new("/feel/the.dark_side"), p.as_path());
     .               /// ```
     .               #[stable(feature = "rust1", since = "1.0.0")]
     .               pub fn set_extension<S: AsRef<OsStr>>(&mut self, extension: S) -> bool {
    12 ( 0.00%)          self._set_extension(extension.as_ref())
     .               }
     .           
    30 ( 0.00%)      fn _set_extension(&mut self, extension: &OsStr) -> bool {
    24 ( 0.00%)          let file_stem = match self.file_stem() {
     .                       None => return false,
     .                       Some(f) => os_str_as_u8_slice(f),
     .                   };
     .           
     .                   // truncate until right after the file stem
     .                   let end_file_stem = file_stem[file_stem.len()..].as_ptr() as usize;
     .                   let start = os_str_as_u8_slice(&self.inner).as_ptr() as usize;
     .                   let v = self.as_mut_vec();
     .                   v.truncate(end_file_stem.wrapping_sub(start));
     .           
     .                   // add the new extension, if any
     .                   let new = os_str_as_u8_slice(extension);
     3 ( 0.00%)          if !new.is_empty() {
     9 ( 0.00%)              v.reserve_exact(new.len() + 1);
     .                       v.push(b'.');
     .                       v.extend_from_slice(new);
     .                   }
     .           
     .                   true
    24 ( 0.00%)      }
     .           
     .               /// Consumes the `PathBuf`, yielding its internal [`OsString`] storage.
     .               ///
     .               /// # Examples
     .               ///
     .               /// ```
     .               /// use std::path::PathBuf;
     .               ///
-- line 1468 ----------------------------------------
-- line 1558 ----------------------------------------
     .                   self.inner.shrink_to(min_capacity)
     .               }
     .           }
     .           
     .           #[stable(feature = "rust1", since = "1.0.0")]
     .           impl Clone for PathBuf {
     .               #[inline]
     .               fn clone(&self) -> Self {
     6 ( 0.00%)          PathBuf { inner: self.inner.clone() }
     .               }
     .           
     .               #[inline]
     .               fn clone_from(&mut self, source: &Self) {
     .                   self.inner.clone_from(&source.inner)
     .               }
     .           }
     .           
-- line 1574 ----------------------------------------
-- line 1642 ----------------------------------------
     .           
     .           #[stable(feature = "rust1", since = "1.0.0")]
     .           impl From<OsString> for PathBuf {
     .               /// Converts an [`OsString`] into a [`PathBuf`]
     .               ///
     .               /// This conversion does not allocate or copy memory.
     .               #[inline]
     .               fn from(s: OsString) -> PathBuf {
   141 ( 0.00%)          PathBuf { inner: s }
     .               }
     .           }
     .           
     .           #[stable(feature = "from_path_buf_for_os_string", since = "1.14.0")]
     .           impl From<PathBuf> for OsString {
     .               /// Converts a [`PathBuf`] into an [`OsString`]
     .               ///
     .               /// This conversion does not allocate or copy memory.
-- line 1658 ----------------------------------------
-- line 1825 ----------------------------------------
     .               }
     .           }
     .           
     .           #[stable(feature = "rust1", since = "1.0.0")]
     .           impl ToOwned for Path {
     .               type Owned = PathBuf;
     .               #[inline]
     .               fn to_owned(&self) -> PathBuf {
     5 ( 0.00%)          self.to_path_buf()
     .               }
     .               #[inline]
     .               fn clone_into(&self, target: &mut PathBuf) {
     .                   self.inner.clone_into(&mut target.inner);
     .               }
     .           }
     .           
     .           #[stable(feature = "rust1", since = "1.0.0")]
-- line 1841 ----------------------------------------
-- line 1843 ----------------------------------------
     .               #[inline]
     .               fn eq(&self, other: &PathBuf) -> bool {
     .                   self.components() == other.components()
     .               }
     .           }
     .           
     .           #[stable(feature = "rust1", since = "1.0.0")]
     .           impl Hash for PathBuf {
   220 ( 0.00%)      fn hash<H: Hasher>(&self, h: &mut H) {
     .                   self.as_path().hash(h)
   176 ( 0.00%)      }
     .           }
     .           
     .           #[stable(feature = "rust1", since = "1.0.0")]
     .           impl cmp::Eq for PathBuf {}
     .           
     .           #[stable(feature = "rust1", since = "1.0.0")]
     .           impl cmp::PartialOrd for PathBuf {
     .               #[inline]
-- line 1861 ----------------------------------------
-- line 1936 ----------------------------------------
     .           
     .           impl Path {
     .               // The following (private!) function allows construction of a path from a u8
     .               // slice, which is only safe when it is known to follow the OsStr encoding.
     .               unsafe fn from_u8_slice(s: &[u8]) -> &Path {
     .                   unsafe { Path::new(u8_slice_as_os_str(s)) }
     .               }
     .               // The following (private!) function reveals the byte encoding used for OsStr.
 1,138 ( 0.00%)      fn as_u8_slice(&self) -> &[u8] {
     .                   os_str_as_u8_slice(&self.inner)
   569 ( 0.00%)      }
     .           
     .               /// Directly wraps a string slice as a `Path` slice.
     .               ///
     .               /// This is a cost-free conversion.
     .               ///
     .               /// # Examples
     .               ///
     .               /// ```
-- line 1954 ----------------------------------------
-- line 1964 ----------------------------------------
     .               ///
     .               /// let string = String::from("foo.txt");
     .               /// let from_string = Path::new(&string);
     .               /// let from_path = Path::new(&from_string);
     .               /// assert_eq!(from_string, from_path);
     .               /// ```
     .               #[stable(feature = "rust1", since = "1.0.0")]
     .               pub fn new<S: AsRef<OsStr> + ?Sized>(s: &S) -> &Path {
     4 ( 0.00%)          unsafe { &*(s.as_ref() as *const OsStr as *const Path) }
     .               }
     .           
     .               /// Yields the underlying [`OsStr`] slice.
     .               ///
     .               /// # Examples
     .               ///
     .               /// ```
     .               /// use std::path::Path;
-- line 1980 ----------------------------------------
-- line 2050 ----------------------------------------
     .               ///
     .               /// let path_buf = Path::new("foo.txt").to_path_buf();
     .               /// assert_eq!(path_buf, std::path::PathBuf::from("foo.txt"));
     .               /// ```
     .               #[rustc_conversion_suggestion]
     .               #[must_use = "this returns the result of the operation, \
     .                             without modifying the original"]
     .               #[stable(feature = "rust1", since = "1.0.0")]
    40 ( 0.00%)      pub fn to_path_buf(&self) -> PathBuf {
     .                   PathBuf::from(self.inner.to_os_string())
    35 ( 0.00%)      }
     .           
     .               /// Returns `true` if the `Path` is absolute, i.e., if it is independent of
     .               /// the current directory.
     .               ///
     .               /// * On Unix, a path is absolute if it starts with the root, so
     .               /// `is_absolute` and [`has_root`] are equivalent.
     .               ///
     .               /// * On Windows, a path is absolute if it has a prefix and starts with the
-- line 2068 ----------------------------------------
-- line 2082 ----------------------------------------
     .               #[allow(deprecated)]
     .               pub fn is_absolute(&self) -> bool {
     .                   if cfg!(target_os = "redox") {
     .                       // FIXME: Allow Redox prefixes
     .                       self.has_root() || has_redox_scheme(self.as_u8_slice())
     .                   } else {
     .                       self.has_root() && (cfg!(any(unix, target_os = "wasi")) || self.prefix().is_some())
     .                   }
     1 ( 0.00%)      }
     .           
     .               /// Returns `true` if the `Path` is relative, i.e., not absolute.
     .               ///
     .               /// See [`is_absolute`]'s documentation for more details.
     .               ///
     .               /// # Examples
     .               ///
     .               /// ```
-- line 2098 ----------------------------------------
-- line 2150 ----------------------------------------
     .               /// assert_eq!(parent, Path::new("/foo"));
     .               ///
     .               /// let grand_parent = parent.parent().unwrap();
     .               /// assert_eq!(grand_parent, Path::new("/"));
     .               /// assert_eq!(grand_parent.parent(), None);
     .               /// ```
     .               #[stable(feature = "rust1", since = "1.0.0")]
     .               #[must_use]
     2 ( 0.00%)      pub fn parent(&self) -> Option<&Path> {
     .                   let mut comps = self.components();
     6 ( 0.00%)          let comp = comps.next_back();
     8 ( 0.00%)          comp.and_then(|p| match p {
     .                       Component::Normal(_) | Component::CurDir | Component::ParentDir => {
    10 ( 0.00%)                  Some(comps.as_path())
     .                       }
     .                       _ => None,
     .                   })
     4 ( 0.00%)      }
     .           
     .               /// Produces an iterator over `Path` and its ancestors.
     .               ///
     .               /// The iterator will yield the `Path` that is returned if the [`parent`] method is used zero
     .               /// or more times. That means, the iterator will yield `&self`, `&self.parent().unwrap()`,
     .               /// `&self.parent().unwrap().parent().unwrap()` and so on. If the [`parent`] method returns
     .               /// [`None`], the iterator will do likewise. The iterator will always yield at least one value,
     .               /// namely `&self`.
-- line 2175 ----------------------------------------
-- line 2217 ----------------------------------------
     .               /// assert_eq!(Some(OsStr::new("foo.txt")), Path::new("tmp/foo.txt").file_name());
     .               /// assert_eq!(Some(OsStr::new("foo.txt")), Path::new("foo.txt/.").file_name());
     .               /// assert_eq!(Some(OsStr::new("foo.txt")), Path::new("foo.txt/.//").file_name());
     .               /// assert_eq!(None, Path::new("foo.txt/..").file_name());
     .               /// assert_eq!(None, Path::new("/").file_name());
     .               /// ```
     .               #[stable(feature = "rust1", since = "1.0.0")]
     .               #[must_use]
    29 ( 0.00%)      pub fn file_name(&self) -> Option<&OsStr> {
    96 ( 0.00%)          self.components().next_back().and_then(|p| match p {
     .                       Component::Normal(p) => Some(p),
     .                       _ => None,
     .                   })
    58 ( 0.00%)      }
     .           
     .               /// Returns a path that, when joined onto `base`, yields `self`.
     .               ///
     .               /// # Errors
     .               ///
     .               /// If `base` is not a prefix of `self` (i.e., [`starts_with`]
     .               /// returns `false`), returns [`Err`].
     .               ///
-- line 2238 ----------------------------------------
-- line 2354 ----------------------------------------
     .               /// # See Also
     .               /// This method is similar to [`Path::file_prefix`], which extracts the portion of the file name
     .               /// before the *first* `.`
     .               ///
     .               /// [`Path::file_prefix`]: Path::file_prefix
     .               ///
     .               #[stable(feature = "rust1", since = "1.0.0")]
     .               #[must_use]
     3 ( 0.00%)      pub fn file_stem(&self) -> Option<&OsStr> {
     .                   self.file_name().map(rsplit_file_at_dot).and_then(|(before, after)| before.or(after))
     6 ( 0.00%)      }
     .           
     .               /// Extracts the prefix of [`self.file_name`].
     .               ///
     .               /// The prefix is:
     .               ///
     .               /// * [`None`], if there is no file name;
     .               /// * The entire file name if there is no embedded `.`;
     .               /// * The portion of the file name before the first non-beginning `.`;
-- line 2372 ----------------------------------------
-- line 2431 ----------------------------------------
     .               /// ```
     .               /// use std::path::{Path, PathBuf};
     .               ///
     .               /// assert_eq!(Path::new("/etc").join("passwd"), PathBuf::from("/etc/passwd"));
     .               /// ```
     .               #[stable(feature = "rust1", since = "1.0.0")]
     .               #[must_use]
     .               pub fn join<P: AsRef<Path>>(&self, path: P) -> PathBuf {
    40 ( 0.00%)          self._join(path.as_ref())
     .               }
     .           
   132 ( 0.00%)      fn _join(&self, path: &Path) -> PathBuf {
     .                   let mut buf = self.to_path_buf();
     .                   buf.push(path);
     .                   buf
    99 ( 0.00%)      }
     .           
     .               /// Creates an owned [`PathBuf`] like `self` but with the given file name.
     .               ///
     .               /// See [`PathBuf::set_file_name`] for more details.
     .               ///
     .               /// # Examples
     .               ///
     .               /// ```
-- line 2454 ----------------------------------------
-- line 2531 ----------------------------------------
     .               /// assert_eq!(components.next(), Some(Component::Normal(OsStr::new("foo.txt"))));
     .               /// assert_eq!(components.next(), None)
     .               /// ```
     .               ///
     .               /// [`CurDir`]: Component::CurDir
     .               #[stable(feature = "rust1", since = "1.0.0")]
     .               pub fn components(&self) -> Components<'_> {
     .                   let prefix = parse_prefix(self.as_os_str());
   266 ( 0.00%)          Components {
     .                       path: self.as_u8_slice(),
     .                       prefix,
    85 ( 0.00%)              has_physical_root: has_physical_root(self.as_u8_slice(), prefix)
     .                           || has_redox_scheme(self.as_u8_slice()),
     .                       front: State::Prefix,
     .                       back: State::Body,
     .                   }
     .               }
     .           
     .               /// Produces an iterator over the path's components viewed as [`OsStr`]
     .               /// slices.
-- line 2550 ----------------------------------------
-- line 2775 ----------------------------------------
     .               ///
     .               /// When the goal is simply to read from (or write to) the source, the most
     .               /// reliable way to test the source can be read (or written to) is to open
     .               /// it. Only using `is_file` can break workflows like `diff <( prog_a )` on
     .               /// a Unix-like system for example. See [`fs::File::open`] or
     .               /// [`fs::OpenOptions::open`] for more information.
     .               #[stable(feature = "path_ext", since = "1.5.0")]
     .               #[must_use]
     5 ( 0.00%)      pub fn is_file(&self) -> bool {
     .                   fs::metadata(self).map(|m| m.is_file()).unwrap_or(false)
     3 ( 0.00%)      }
     .           
     .               /// Returns `true` if the path exists on disk and is pointing at a directory.
     .               ///
     .               /// This function will traverse symbolic links to query information about the
     .               /// destination file.
     .               ///
     .               /// If you cannot access the metadata of the file, e.g. because of a
     .               /// permission error or broken symbolic links, this will return `false`.
-- line 2793 ----------------------------------------
-- line 2802 ----------------------------------------
     .               ///
     .               /// # See Also
     .               ///
     .               /// This is a convenience function that coerces errors to false. If you want to
     .               /// check errors, call [`fs::metadata`] and handle its [`Result`]. Then call
     .               /// [`fs::Metadata::is_dir`] if it was [`Ok`].
     .               #[stable(feature = "path_ext", since = "1.5.0")]
     .               #[must_use]
    10 ( 0.00%)      pub fn is_dir(&self) -> bool {
     .                   fs::metadata(self).map(|m| m.is_dir()).unwrap_or(false)
     6 ( 0.00%)      }
     .           
     .               /// Returns `true` if the path exists on disk and is pointing at a symbolic link.
     .               ///
     .               /// This function will not traverse symbolic links.
     .               /// In case of a broken symbolic link this will also return true.
     .               ///
     .               /// If you cannot access the directory containing the file, e.g., because of a
     .               /// permission error, this will return false.
-- line 2820 ----------------------------------------
-- line 2898 ----------------------------------------
     .           impl fmt::Debug for Display<'_> {
     .               fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
     .                   fmt::Debug::fmt(&self.path, f)
     .               }
     .           }
     .           
     .           #[stable(feature = "rust1", since = "1.0.0")]
     .           impl fmt::Display for Display<'_> {
     4 ( 0.00%)      fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
     4 ( 0.00%)          self.path.inner.display(f)
     .               }
     .           }
     .           
     .           #[stable(feature = "rust1", since = "1.0.0")]
     .           impl cmp::PartialEq for Path {
     .               #[inline]
     .               fn eq(&self, other: &Path) -> bool {
     .                   self.components() == other.components()
     .               }
     .           }
     .           
     .           #[stable(feature = "rust1", since = "1.0.0")]
     .           impl Hash for Path {
 4,200 ( 0.00%)      fn hash<H: Hasher>(&self, h: &mut H) {
   613 ( 0.00%)          let bytes = self.as_u8_slice();
     .                   let prefix_len = match parse_prefix(&self.inner) {
     .                       Some(prefix) => {
     .                           prefix.hash(h);
     .                           prefix.len()
     .                       }
     .                       None => 0,
     .                   };
     .                   let bytes = &bytes[prefix_len..];
     .           
     .                   let mut component_start = 0;
     .                   let mut bytes_hashed = 0;
     .           
     .                   for i in 0..bytes.len() {
57,045 ( 0.05%)              if is_sep_byte(bytes[i]) {
19,677 ( 0.02%)                  if i > component_start {
     .                               let to_hash = &bytes[component_start..i];
     8 ( 0.00%)                      h.write(to_hash);
11,984 ( 0.01%)                      bytes_hashed += to_hash.len();
     .                           }
     .           
     .                           // skip over separator and optionally a following CurDir item
     .                           // since components() would normalize these away
26,682 ( 0.02%)                  component_start = i + match bytes[i..] {
13,118 ( 0.01%)                      [_, b'.', b'/', ..] | [_, b'.'] => 2,
     .                               _ => 1,
     .                           };
     .                       }
     .                   }
     .           
 1,138 ( 0.00%)          if component_start < bytes.len() {
     .                       let to_hash = &bytes[component_start..];
     3 ( 0.00%)              h.write(to_hash);
 1,138 ( 0.00%)              bytes_hashed += to_hash.len();
     .                   }
     .           
     .                   h.write_usize(bytes_hashed);
 4,192 ( 0.00%)      }
     .           }
     .           
     .           #[stable(feature = "rust1", since = "1.0.0")]
     .           impl cmp::Eq for Path {}
     .           
     .           #[stable(feature = "rust1", since = "1.0.0")]
     .           impl cmp::PartialOrd for Path {
     .               #[inline]
-- line 2967 ----------------------------------------

28,875 ( 0.02%)  <counts for unidentified lines in /usr/home/liquid/rust/worktree-benchmarking/library/std/src/path.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/tuple.rs
--------------------------------------------------------------------------------
Ir               

-- line 10 ----------------------------------------
      .                       $(($idx:tt) -> $T:ident)+
      .                   }
      .               )+) => {
      .                   $(
      .                       #[stable(feature = "rust1", since = "1.0.0")]
      .                       impl<$($T:PartialEq),+> PartialEq for ($($T,)+) where last_type!($($T,)+): ?Sized {
      .                           #[inline]
      .                           fn eq(&self, other: &($($T,)+)) -> bool {
  1,829 ( 0.00%)                      $(self.$idx == other.$idx)&&+
      .                           }
      .                           #[inline]
      .                           fn ne(&self, other: &($($T,)+)) -> bool {
      .                               $(self.$idx != other.$idx)||+
      .                           }
      .                       }
      .           
      .                       #[stable(feature = "rust1", since = "1.0.0")]
-- line 26 ----------------------------------------
-- line 30 ----------------------------------------
      .                       impl<$($T:PartialOrd + PartialEq),+> PartialOrd for ($($T,)+)
      .                               where last_type!($($T,)+): ?Sized {
      .                           #[inline]
      .                           fn partial_cmp(&self, other: &($($T,)+)) -> Option<Ordering> {
      .                               lexical_partial_cmp!($(self.$idx, other.$idx),+)
      .                           }
      .                           #[inline]
      .                           fn lt(&self, other: &($($T,)+)) -> bool {
181,881 ( 0.15%)                      lexical_ord!(lt, $(self.$idx, other.$idx),+)
      .                           }
      .                           #[inline]
      .                           fn le(&self, other: &($($T,)+)) -> bool {
      .                               lexical_ord!(le, $(self.$idx, other.$idx),+)
      .                           }
      .                           #[inline]
      .                           fn ge(&self, other: &($($T,)+)) -> bool {
      1 ( 0.00%)                      lexical_ord!(ge, $(self.$idx, other.$idx),+)
      .                           }
      .                           #[inline]
      .                           fn gt(&self, other: &($($T,)+)) -> bool {
      .                               lexical_ord!(gt, $(self.$idx, other.$idx),+)
      .                           }
      .                       }
      .           
      .                       #[stable(feature = "rust1", since = "1.0.0")]
      .                       impl<$($T:Ord),+> Ord for ($($T,)+) where last_type!($($T,)+): ?Sized {
      .                           #[inline]
      .                           fn cmp(&self, other: &($($T,)+)) -> Ordering {
  1,310 ( 0.00%)                      lexical_cmp!($(self.$idx, other.$idx),+)
      .                           }
      .                       }
      .           
      .                       #[stable(feature = "rust1", since = "1.0.0")]
      .                       impl<$($T:Default),+> Default for ($($T,)+) {
      .                           #[inline]
      .                           fn default() -> ($($T,)+) {
      9 ( 0.00%)                      ($({ let x: $T = Default::default(); x},)+)
      .                           }
      .                       }
      .                   )+
      .               }
      .           }
      .           
      .           // Constructs an expression that performs a lexical ordering using method $rel.
      .           // The values are interleaved, so the macro invocation for
-- line 74 ----------------------------------------

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/opaque.rs
--------------------------------------------------------------------------------
Ir                 

-- line 14 ----------------------------------------
        .           
        .           pub type EncodeResult = Result<(), !>;
        .           
        .           pub struct Encoder {
        .               pub data: Vec<u8>,
        .           }
        .           
        .           impl Encoder {
        1 ( 0.00%)      pub fn new(data: Vec<u8>) -> Encoder {
        4 ( 0.00%)          Encoder { data }
        1 ( 0.00%)      }
        .           
        1 ( 0.00%)      pub fn into_inner(self) -> Vec<u8> {
        4 ( 0.00%)          self.data
        1 ( 0.00%)      }
        .           
        .               #[inline]
        .               pub fn position(&self) -> usize {
      779 ( 0.00%)          self.data.len()
        .               }
        .           }
        .           
        .           macro_rules! write_leb128 {
        .               ($enc:expr, $value:expr, $int_ty:ty, $fun:ident) => {{
        .                   const MAX_ENCODED_LEN: usize = max_leb128_len!($int_ty);
        .                   let old_len = $enc.data.len();
        .           
-- line 40 ----------------------------------------
-- line 67 ----------------------------------------
        .           
        .               #[inline]
        .               fn emit_unit(&mut self) -> EncodeResult {
        .                   Ok(())
        .               }
        .           
        .               #[inline]
        .               fn emit_usize(&mut self, v: usize) -> EncodeResult {
   14,704 ( 0.01%)          write_leb128!(self, v, usize, write_usize_leb128)
        .               }
        .           
        .               #[inline]
        .               fn emit_u128(&mut self, v: u128) -> EncodeResult {
       28 ( 0.00%)          write_leb128!(self, v, u128, write_u128_leb128)
        .               }
        .           
        .               #[inline]
        .               fn emit_u64(&mut self, v: u64) -> EncodeResult {
      273 ( 0.00%)          write_leb128!(self, v, u64, write_u64_leb128)
        .               }
        .           
        .               #[inline]
        .               fn emit_u32(&mut self, v: u32) -> EncodeResult {
   11,788 ( 0.01%)          write_leb128!(self, v, u32, write_u32_leb128)
        .               }
        .           
        .               #[inline]
        .               fn emit_u16(&mut self, v: u16) -> EncodeResult {
        .                   self.data.extend_from_slice(&v.to_le_bytes());
        .                   Ok(())
        .               }
        .           
-- line 98 ----------------------------------------
-- line 131 ----------------------------------------
        .               #[inline]
        .               fn emit_i8(&mut self, v: i8) -> EncodeResult {
        .                   let as_u8: u8 = unsafe { std::mem::transmute(v) };
        .                   self.emit_u8(as_u8)
        .               }
        .           
        .               #[inline]
        .               fn emit_bool(&mut self, v: bool) -> EncodeResult {
      101 ( 0.00%)          self.emit_u8(if v { 1 } else { 0 })
        .               }
        .           
        .               #[inline]
        .               fn emit_f64(&mut self, v: f64) -> EncodeResult {
        .                   let as_u64: u64 = v.to_bits();
        .                   self.emit_u64(as_u64)
        .               }
        .           
-- line 147 ----------------------------------------
-- line 549 ----------------------------------------
        .               #[inline]
        .               pub fn advance(&mut self, bytes: usize) {
        .                   self.position += bytes;
        .               }
        .           
        .               #[inline]
        .               pub fn read_raw_bytes(&mut self, bytes: usize) -> &'a [u8] {
        .                   let start = self.position;
       19 ( 0.00%)          self.position += bytes;
       19 ( 0.00%)          &self.data[start..self.position]
        .               }
        .           }
        .           
        .           macro_rules! read_leb128 {
        .               ($dec:expr, $fun:ident) => {{ leb128::$fun($dec.data, &mut $dec.position) }};
        .           }
        .           
        .           impl<'a> serialize::Decoder for Decoder<'a> {
        .               #[inline]
        .               fn read_unit(&mut self) -> () {
        .                   ()
        .               }
        .           
        .               #[inline]
        .               fn read_u128(&mut self) -> u128 {
      529 ( 0.00%)          read_leb128!(self, read_u128_leb128)
        .               }
        .           
        .               #[inline]
        .               fn read_u64(&mut self) -> u64 {
    2,452 ( 0.00%)          read_leb128!(self, read_u64_leb128)
        .               }
        .           
        .               #[inline]
   19,819 ( 0.02%)      fn read_u32(&mut self) -> u32 {
   95,616 ( 0.08%)          read_leb128!(self, read_u32_leb128)
   39,638 ( 0.03%)      }
        .           
        .               #[inline]
        .               fn read_u16(&mut self) -> u16 {
  561,386 ( 0.45%)          let bytes = [self.data[self.position], self.data[self.position + 1]];
   80,198 ( 0.06%)          let value = u16::from_le_bytes(bytes);
  160,396 ( 0.13%)          self.position += 2;
        .                   value
        .               }
        .           
        .               #[inline]
        .               fn read_u8(&mut self) -> u8 {
1,764,810 ( 1.42%)          let value = self.data[self.position];
  330,880 ( 0.27%)          self.position += 1;
        .                   value
        .               }
        .           
        .               #[inline]
  126,919 ( 0.10%)      fn read_usize(&mut self) -> usize {
  126,967 ( 0.10%)          read_leb128!(self, read_usize_leb128)
  253,838 ( 0.20%)      }
        .           
        .               #[inline]
        .               fn read_i128(&mut self) -> i128 {
        .                   read_leb128!(self, read_i128_leb128)
        .               }
        .           
        .               #[inline]
        .               fn read_i64(&mut self) -> i64 {
-- line 613 ----------------------------------------
-- line 637 ----------------------------------------
        .               #[inline]
        .               fn read_isize(&mut self) -> isize {
        .                   read_leb128!(self, read_isize_leb128)
        .               }
        .           
        .               #[inline]
        .               fn read_bool(&mut self) -> bool {
        .                   let value = self.read_u8();
    3,957 ( 0.00%)          value != 0
        .               }
        .           
        .               #[inline]
        .               fn read_f64(&mut self) -> f64 {
        .                   let bits = self.read_u64();
        .                   f64::from_bits(bits)
        .               }
        .           
-- line 653 ----------------------------------------
-- line 660 ----------------------------------------
        .               #[inline]
        .               fn read_char(&mut self) -> char {
        .                   let bits = self.read_u32();
        .                   std::char::from_u32(bits).unwrap()
        .               }
        .           
        .               #[inline]
        .               fn read_str(&mut self) -> Cow<'_, str> {
   26,012 ( 0.02%)          let len = self.read_usize();
  126,640 ( 0.10%)          let sentinel = self.data[self.position + len];
   31,696 ( 0.03%)          assert!(sentinel == STR_SENTINEL);
        .                   let s = unsafe {
        .                       std::str::from_utf8_unchecked(&self.data[self.position..self.position + len])
        .                   };
   79,240 ( 0.06%)          self.position += len + 1;
   30,636 ( 0.02%)          Cow::Borrowed(s)
        .               }
        .           
        .               #[inline]
        .               fn read_raw_bytes_into(&mut self, s: &mut [u8]) {
       67 ( 0.00%)          let start = self.position;
      448 ( 0.00%)          self.position += s.len();
       67 ( 0.00%)          s.copy_from_slice(&self.data[start..self.position]);
        .               }
        .           }
        .           
        .           // Specializations for contiguous byte sequences follow. The default implementations for slices
        .           // encode and decode each element individually. This isn't necessary for `u8` slices when using
        .           // opaque encoders and decoders, because each `u8` is unchanged by encoding and decoding.
        .           // Therefore, we can use more efficient implementations that process the entire sequence at once.
        .           
-- line 690 ----------------------------------------

  315,748 ( 0.25%)  <counts for unidentified lines in /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/opaque.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.11.2/src/raw/mod.rs
--------------------------------------------------------------------------------
Ir              

-- line 114 ----------------------------------------
     .           const EMPTY: u8 = 0b1111_1111;
     .           
     .           /// Control byte value for a deleted bucket.
     .           const DELETED: u8 = 0b1000_0000;
     .           
     .           /// Checks whether a control byte represents a full bucket (top bit is clear).
     .           #[inline]
     .           fn is_full(ctrl: u8) -> bool {
20,207 ( 0.02%)      ctrl & 0x80 == 0
     .           }
     .           
     .           /// Checks whether a control byte represents a special value (top bit is set).
     .           #[inline]
     .           fn is_special(ctrl: u8) -> bool {
     .               ctrl & 0x80 != 0
     .           }
     .           
-- line 130 ----------------------------------------
-- line 146 ----------------------------------------
     .           /// Secondary hash function, saved in the low 7 bits of the control byte.
     .           #[inline]
     .           #[allow(clippy::cast_possible_truncation)]
     .           fn h2(hash: u64) -> u8 {
     .               // Grab the top 7 bits of the hash. While the hash is normally a full 64-bit
     .               // value, some hash functions (such as FxHash) produce a usize result
     .               // instead, which means that the top 32 bits are 0 on 32-bit platforms.
     .               let hash_len = usize::min(mem::size_of::<usize>(), mem::size_of::<u64>());
16,467 ( 0.01%)      let top7 = hash >> (hash_len * 8 - 7);
     .               (top7 & 0x7f) as u8 // truncation
     .           }
     .           
     .           /// Probe sequence based on triangular numbers, which is guaranteed (since our
     .           /// table size is a power of two) to visit every group of elements exactly once.
     .           ///
     .           /// A triangular probe has us jump by 1 more group every time. So first we
     .           /// jump by 1 group (meaning we just continue our linear scan), then 2 groups
-- line 162 ----------------------------------------
-- line 173 ----------------------------------------
     .               #[inline]
     .               fn move_next(&mut self, bucket_mask: usize) {
     .                   // We should have found an empty bucket by now and ended the probe.
     .                   debug_assert!(
     .                       self.stride <= bucket_mask,
     .                       "Went past end of probe sequence"
     .                   );
     .           
 2,194 ( 0.00%)          self.stride += Group::WIDTH;
 2,194 ( 0.00%)          self.pos += self.stride;
 1,097 ( 0.00%)          self.pos &= bucket_mask;
     .               }
     .           }
     .           
     .           /// Returns the number of buckets needed to hold the given number of items,
     .           /// taking the maximum load factor into account.
     .           ///
     .           /// Returns `None` if an overflow occurs.
     .           // Workaround for emscripten bug emscripten-core/emscripten-fastcomp#258
     .           #[cfg_attr(target_os = "emscripten", inline(never))]
     .           #[cfg_attr(not(target_os = "emscripten"), inline)]
     .           fn capacity_to_buckets(cap: usize) -> Option<usize> {
     .               debug_assert_ne!(cap, 0);
     .           
     .               // For small tables we require at least 1 empty bucket so that lookups are
     .               // guaranteed to terminate if an element doesn't exist in the table.
   652 ( 0.00%)      if cap < 8 {
     .                   // We don't bother with a table size of 2 buckets since that can only
     .                   // hold a single element. Instead we skip directly to a 4 bucket table
     .                   // which can hold 3 elements.
   945 ( 0.00%)          return Some(if cap < 4 { 4 } else { 8 });
     .               }
     .           
     .               // Otherwise require 1/8 buckets to be empty (87.5% load)
     .               //
     .               // Be careful when modifying this, calculate_layout relies on the
     .               // overflow check here.
   822 ( 0.00%)      let adjusted_cap = cap.checked_mul(8)? / 7;
     .           
     .               // Any overflows will have been caught by the checked_mul. Also, any
     .               // rounding errors from the division above will be cleaned up by
     .               // next_power_of_two (which can't overflow because of the previous divison).
     .               Some(adjusted_cap.next_power_of_two())
     .           }
     .           
     .           /// Returns the maximum effective capacity for the given bucket mask, taking
     .           /// the maximum load factor into account.
     .           #[inline]
     .           fn bucket_mask_to_capacity(bucket_mask: usize) -> usize {
 2,501 ( 0.00%)      if bucket_mask < 8 {
     .                   // For tables with 1/2/4/8 buckets, we always reserve one empty slot.
     .                   // Keep in mind that the bucket mask is one less than the bucket count.
     .                   bucket_mask
     .               } else {
     .                   // For larger tables we reserve 12.5% of the slots as empty.
   600 ( 0.00%)          ((bucket_mask + 1) / 8) * 7
     .               }
     .           }
     .           
     .           /// Helper which allows the max calculation for ctrl_align to be statically computed for each T
     .           /// while keeping the rest of `calculate_layout_for` independent of `T`
     .           #[derive(Copy, Clone)]
     .           struct TableLayout {
     .               size: usize,
-- line 236 ----------------------------------------
-- line 249 ----------------------------------------
     .           
     .               #[inline]
     .               fn calculate_layout_for(self, buckets: usize) -> Option<(Layout, usize)> {
     .                   debug_assert!(buckets.is_power_of_two());
     .           
     .                   let TableLayout { size, ctrl_align } = self;
     .                   // Manual layout calculation since Layout methods are not yet stable.
     .                   let ctrl_offset =
 1,438 ( 0.00%)              size.checked_mul(buckets)?.checked_add(ctrl_align - 1)? & !(ctrl_align - 1);
 1,764 ( 0.00%)          let len = ctrl_offset.checked_add(buckets + Group::WIDTH)?;
     .           
     .                   Some((
     .                       unsafe { Layout::from_size_align_unchecked(len, ctrl_align) },
     .                       ctrl_offset,
     .                   ))
     .               }
     .           }
     .           
-- line 266 ----------------------------------------
-- line 636 ----------------------------------------
     .                       }
     .                   }
     .               }
     .           
     .               /// Ensures that at least `additional` items can be inserted into the table
     .               /// without reallocation.
     .               #[cfg_attr(feature = "inline-more", inline)]
     .               pub fn reserve(&mut self, additional: usize, hasher: impl Fn(&T) -> u64) {
     4 ( 0.00%)          if additional > self.table.growth_left {
     .                       // Avoid `Result::unwrap_or_else` because it bloats LLVM IR.
 1,637 ( 0.00%)              if self
     .                           .reserve_rehash(additional, hasher, Fallibility::Infallible)
     .                           .is_err()
     .                       {
     .                           unsafe { hint::unreachable_unchecked() }
     .                       }
     .                   }
     .               }
     .           
-- line 654 ----------------------------------------
-- line 665 ----------------------------------------
     .                   } else {
     .                       Ok(())
     .                   }
     .               }
     .           
     .               /// Out-of-line slow path for `reserve` and `try_reserve`.
     .               #[cold]
     .               #[inline(never)]
 2,704 ( 0.00%)      fn reserve_rehash(
     .                   &mut self,
     .                   additional: usize,
     .                   hasher: impl Fn(&T) -> u64,
     .                   fallibility: Fallibility,
     .               ) -> Result<(), TryReserveError> {
     .                   // Avoid `Option::ok_or_else` because it bloats LLVM IR.
   652 ( 0.00%)          let new_items = match self.table.items.checked_add(additional) {
     .                       Some(new_items) => new_items,
     .                       None => return Err(fallibility.capacity_overflow()),
     .                   };
   652 ( 0.00%)          let full_capacity = bucket_mask_to_capacity(self.table.bucket_mask);
 1,304 ( 0.00%)          if new_items <= full_capacity / 2 {
     .                       // Rehash in-place without re-allocating if we have plenty of spare
     .                       // capacity that is locked up due to DELETED entries.
     .                       self.rehash_in_place(hasher);
     .                       Ok(())
     .                   } else {
     .                       // Otherwise, conservatively resize to at least the next size up
     .                       // to avoid churning deletes into frequent rehashes.
     .                       self.resize(
   326 ( 0.00%)                  usize::max(new_items, full_capacity + 1),
     .                           hasher,
     .                           fallibility,
     .                       )
     .                   }
 2,934 ( 0.00%)      }
     .           
     .               /// Rehashes the contents of the table in place (i.e. without changing the
     .               /// allocation).
     .               ///
     .               /// If `hasher` panics then some the table's contents may be lost.
     .               fn rehash_in_place(&mut self, hasher: impl Fn(&T) -> u64) {
     .                   unsafe {
     .                       // If the hash function panics then properly clean up any elements
-- line 707 ----------------------------------------
-- line 780 ----------------------------------------
     .               fn resize(
     .                   &mut self,
     .                   capacity: usize,
     .                   hasher: impl Fn(&T) -> u64,
     .                   fallibility: Fallibility,
     .               ) -> Result<(), TryReserveError> {
     .                   unsafe {
     .                       let mut new_table =
 2,555 ( 0.00%)                  self.table
     .                               .prepare_resize(TableLayout::new::<T>(), capacity, fallibility)?;
     .           
     .                       // Copy all elements to the new table.
     .                       for item in self.iter() {
     .                           // This may panic.
10,962 ( 0.01%)                  let hash = hasher(item.as_ref());
     .           
     .                           // We can use a simpler version of insert() here since:
     .                           // - there are no DELETED entries.
     .                           // - we know there is enough space in the table.
     .                           // - all elements are unique.
     .                           let (index, _) = new_table.prepare_insert_slot(hash);
10,962 ( 0.01%)                  new_table.bucket(index).copy_from_nonoverlapping(&item);
     .                       }
     .           
     .                       // We successfully copied all elements without panicking. Now replace
     .                       // self with the new table. The old table will have its memory freed but
     .                       // the items will not be dropped (since they have been moved into the
     .                       // new table).
     .                       mem::swap(&mut self.table, &mut new_table);
     .           
   326 ( 0.00%)              Ok(())
     .                   }
     .               }
     .           
     .               /// Inserts a new element into the table, and returns its raw bucket.
     .               ///
     .               /// This does not check if the given element already exists in the table.
     .               #[cfg_attr(feature = "inline-more", inline)]
     .               pub fn insert(&mut self, hash: u64, value: T, hasher: impl Fn(&T) -> u64) -> Bucket<T> {
     .                   unsafe {
     .                       let mut index = self.table.find_insert_slot(hash);
     .           
     .                       // We can avoid growing the table once we have reached our load
     .                       // factor if we are replacing a tombstone. This works since the
     .                       // number of EMPTY slots does not change in this case.
    35 ( 0.00%)              let old_ctrl = *self.table.ctrl(index);
31,784 ( 0.03%)              if unlikely(self.table.growth_left == 0 && special_is_empty(old_ctrl)) {
     .                           self.reserve(1, hasher);
     .                           index = self.table.find_insert_slot(hash);
     .                       }
     .           
     .                       self.table.record_item_insert_at(index, old_ctrl, hash);
     .           
 7,954 ( 0.01%)              let bucket = self.bucket(index);
     .                       bucket.write(value);
     .                       bucket
     .                   }
     .               }
     .           
     .               /// Attempts to insert a new element without growing the table and return its raw bucket.
     .               ///
     .               /// Returns an `Err` containing the given element if inserting it would require growing the
-- line 841 ----------------------------------------
-- line 911 ----------------------------------------
     .                       true
     .                   } else {
     .                       false
     .                   }
     .               }
     .           
     .               /// Searches for an element in the table.
     .               #[inline]
 8,496 ( 0.01%)      pub fn find(&self, hash: u64, mut eq: impl FnMut(&T) -> bool) -> Option<Bucket<T>> {
     .                   unsafe {
57,552 ( 0.05%)              for bucket in self.iter_hash(hash) {
     .                           let elm = bucket.as_ref();
 5,084 ( 0.00%)                  if likely(eq(elm)) {
     .                               return Some(bucket);
     .                           }
     .                       }
     .                       None
     .                   }
11,328 ( 0.01%)      }
     .           
     .               /// Gets a reference to an element in the table.
     .               #[inline]
     .               pub fn get(&self, hash: u64, eq: impl FnMut(&T) -> bool) -> Option<&T> {
     .                   // Avoid `Option::map` because it bloats LLVM IR.
   404 ( 0.00%)          match self.find(hash, eq) {
     .                       Some(bucket) => Some(unsafe { bucket.as_ref() }),
     .                       None => None,
     .                   }
     .               }
     .           
     .               /// Gets a mutable reference to an element in the table.
     .               #[inline]
     .               pub fn get_mut(&mut self, hash: u64, eq: impl FnMut(&T) -> bool) -> Option<&mut T> {
-- line 943 ----------------------------------------
-- line 1007 ----------------------------------------
     .               }
     .           
     .               /// Returns the number of elements the map can hold without reallocating.
     .               ///
     .               /// This number is a lower bound; the table might be able to hold
     .               /// more, but is guaranteed to be able to hold at least this many.
     .               #[cfg_attr(feature = "inline-more", inline)]
     .               pub fn capacity(&self) -> usize {
   654 ( 0.00%)          self.table.items + self.table.growth_left
     .               }
     .           
     .               /// Returns the number of elements in the table.
     .               #[cfg_attr(feature = "inline-more", inline)]
     .               pub fn len(&self) -> usize {
     .                   self.table.items
     .               }
     .           
     .               /// Returns the number of buckets in the table.
     .               #[cfg_attr(feature = "inline-more", inline)]
     .               pub fn buckets(&self) -> usize {
    12 ( 0.00%)          self.table.bucket_mask + 1
     .               }
     .           
     .               /// Returns an iterator over every element in the table. It is up to
     .               /// the caller to ensure that the `RawTable` outlives the `RawIter`.
     .               /// Because we cannot make the `next` method unsafe on the `RawIter`
     .               /// struct, we have to make the `iter` method unsafe.
     .               #[cfg_attr(feature = "inline-more", inline)]
     .               pub unsafe fn iter(&self) -> RawIter<T> {
   326 ( 0.00%)          let data = Bucket::from_base_index(self.data_end(), 0);
     .                   RawIter {
     .                       iter: RawIterRange::new(self.table.ctrl.as_ptr(), data, self.table.buckets()),
     .                       items: self.table.items,
     .                   }
     .               }
     .           
     .               /// Returns an iterator over occupied buckets that could match a given hash.
     .               ///
-- line 1044 ----------------------------------------
-- line 1122 ----------------------------------------
     .           }
     .           
     .           unsafe impl<T, A: Allocator + Clone> Send for RawTable<T, A> where T: Send {}
     .           unsafe impl<T, A: Allocator + Clone> Sync for RawTable<T, A> where T: Sync {}
     .           
     .           impl<A> RawTableInner<A> {
     .               #[cfg_attr(feature = "inline-more", inline)]
     .               const fn new_in(alloc: A) -> Self {
 1,344 ( 0.00%)          Self {
     .                       // Be careful to cast the entire slice to a raw pointer.
   710 ( 0.00%)              ctrl: unsafe { NonNull::new_unchecked(Group::static_empty() as *const _ as *mut u8) },
     .                       bucket_mask: 0,
     .                       items: 0,
     .                       growth_left: 0,
     .                       alloc,
     .                   }
     .               }
     .           }
     .           
-- line 1140 ----------------------------------------
-- line 1149 ----------------------------------------
     .                   debug_assert!(buckets.is_power_of_two());
     .           
     .                   // Avoid `Option::ok_or_else` because it bloats LLVM IR.
     .                   let (layout, ctrl_offset) = match table_layout.calculate_layout_for(buckets) {
     .                       Some(lco) => lco,
     .                       None => return Err(fallibility.capacity_overflow()),
     .                   };
     .           
   652 ( 0.00%)          let ptr: NonNull<u8> = match do_alloc(&alloc, layout) {
     .                       Ok(block) => block.cast(),
     .                       Err(_) => return Err(fallibility.alloc_err(layout)),
     .                   };
     .           
     .                   let ctrl = NonNull::new_unchecked(ptr.as_ptr().add(ctrl_offset));
     .                   Ok(Self {
     .                       ctrl,
   353 ( 0.00%)              bucket_mask: buckets - 1,
     .                       items: 0,
     .                       growth_left: bucket_mask_to_capacity(buckets - 1),
     .                       alloc,
     .                   })
     .               }
     .           
     .               #[inline]
 2,030 ( 0.00%)      fn fallible_with_capacity(
     .                   alloc: A,
     .                   table_layout: TableLayout,
     .                   capacity: usize,
     .                   fallibility: Fallibility,
     .               ) -> Result<Self, TryReserveError> {
     .                   if capacity == 0 {
     .                       Ok(Self::new_in(alloc))
     .                   } else {
     .                       unsafe {
     .                           let buckets =
     .                               capacity_to_buckets(capacity).ok_or_else(|| fallibility.capacity_overflow())?;
     .           
     .                           let result = Self::new_uninitialized(alloc, table_layout, buckets, fallibility)?;
     .                           result.ctrl(0).write_bytes(EMPTY, result.num_ctrl_bytes());
     .           
 1,218 ( 0.00%)                  Ok(result)
     .                       }
     .                   }
 1,624 ( 0.00%)      }
     .           
     .               /// Searches for an empty or deleted bucket which is suitable for inserting
     .               /// a new element and sets the hash for that slot.
     .               ///
     .               /// There must be at least 1 empty bucket in the table.
     .               #[inline]
     .               unsafe fn prepare_insert_slot(&self, hash: u64) -> (usize, u8) {
     .                   let index = self.find_insert_slot(hash);
-- line 1200 ----------------------------------------
-- line 1208 ----------------------------------------
     .               ///
     .               /// There must be at least 1 empty bucket in the table.
     .               #[inline]
     .               fn find_insert_slot(&self, hash: u64) -> usize {
     .                   let mut probe_seq = self.probe_seq(hash);
     .                   loop {
     .                       unsafe {
     .                           let group = Group::load(self.ctrl(probe_seq.pos));
19,777 ( 0.02%)                  if let Some(bit) = group.match_empty_or_deleted().lowest_set_bit() {
57,726 ( 0.05%)                      let result = (probe_seq.pos + bit) & self.bucket_mask;
     .           
     .                               // In tables smaller than the group width, trailing control
     .                               // bytes outside the range of the table are filled with
     .                               // EMPTY entries. These will unfortunately trigger a
     .                               // match, but once masked may point to a full bucket that
     .                               // is already occupied. We detect this situation here and
     .                               // perform a second scan starting at the begining of the
     .                               // table. This second scan is guaranteed to find an empty
     .                               // slot (due to the load factor) before hitting the trailing
     .                               // control bytes (containing EMPTY).
27,196 ( 0.02%)                      if unlikely(is_full(*self.ctrl(result))) {
     .                                   debug_assert!(self.bucket_mask < Group::WIDTH);
     .                                   debug_assert_ne!(probe_seq.pos, 0);
     .                                   return Group::load_aligned(self.ctrl(0))
     .                                       .match_empty_or_deleted()
     .                                       .lowest_set_bit_nonzero();
     .                               }
     .           
     .                               return result;
-- line 1236 ----------------------------------------
-- line 1278 ----------------------------------------
     .               /// Returns an iterator-like object for a probe sequence on the table.
     .               ///
     .               /// This iterator never terminates, but is guaranteed to visit each bucket
     .               /// group exactly once. The loop using `probe_seq` must terminate upon
     .               /// reaching a group containing an empty bucket.
     .               #[inline]
     .               fn probe_seq(&self, hash: u64) -> ProbeSeq {
     .                   ProbeSeq {
92,039 ( 0.07%)              pos: h1(hash) & self.bucket_mask,
     .                       stride: 0,
     .                   }
     .               }
     .           
     .               /// Returns the index of a bucket for which a value must be inserted if there is enough rooom
     .               /// in the table, otherwise returns error
     .               #[cfg(feature = "raw")]
     .               #[inline]
-- line 1294 ----------------------------------------
-- line 1300 ----------------------------------------
     .                   } else {
     .                       self.record_item_insert_at(index, old_ctrl, hash);
     .                       Ok(index)
     .                   }
     .               }
     .           
     .               #[inline]
     .               unsafe fn record_item_insert_at(&mut self, index: usize, old_ctrl: u8, hash: u64) {
39,770 ( 0.03%)          self.growth_left -= special_is_empty(old_ctrl) as usize;
     .                   self.set_ctrl_h2(index, hash);
31,816 ( 0.03%)          self.items += 1;
     .               }
     .           
     .               #[inline]
     .               fn is_in_same_group(&self, i: usize, new_i: usize, hash: u64) -> bool {
     .                   let probe_seq_pos = self.probe_seq(hash).pos;
     .                   let probe_index =
     .                       |pos: usize| (pos.wrapping_sub(probe_seq_pos) & self.bucket_mask) / Group::WIDTH;
     .                   probe_index(i) == probe_index(new_i)
-- line 1318 ----------------------------------------
-- line 1349 ----------------------------------------
     .                   // replicate the buckets at the end of the trailing group. For example
     .                   // with 2 buckets and a group size of 4, the control bytes will look
     .                   // like this:
     .                   //
     .                   //     Real    |             Replicated
     .                   // ---------------------------------------------
     .                   // | [A] | [B] | [EMPTY] | [EMPTY] | [A] | [B] |
     .                   // ---------------------------------------------
56,748 ( 0.05%)          let index2 = ((index.wrapping_sub(Group::WIDTH)) & self.bucket_mask) + Group::WIDTH;
     .           
18,916 ( 0.02%)          *self.ctrl(index) = ctrl;
18,916 ( 0.02%)          *self.ctrl(index2) = ctrl;
     .               }
     .           
     .               /// Returns a pointer to a control byte.
     .               #[inline]
     .               unsafe fn ctrl(&self, index: usize) -> *mut u8 {
     .                   debug_assert!(index < self.num_ctrl_bytes());
     .                   self.ctrl.as_ptr().add(index)
     .               }
     .           
     .               #[inline]
     .               fn buckets(&self) -> usize {
   652 ( 0.00%)          self.bucket_mask + 1
     .               }
     .           
     .               #[inline]
     .               fn num_ctrl_bytes(&self) -> usize {
     .                   self.bucket_mask + 1 + Group::WIDTH
     .               }
     .           
     .               #[inline]
     .               fn is_empty_singleton(&self) -> bool {
 2,036 ( 0.00%)          self.bucket_mask == 0
     .               }
     .           
     .               #[allow(clippy::mut_mut)]
     .               #[inline]
   297 ( 0.00%)      unsafe fn prepare_resize(
     .                   &self,
     .                   table_layout: TableLayout,
     .                   capacity: usize,
     .                   fallibility: Fallibility,
     .               ) -> Result<crate::scopeguard::ScopeGuard<Self, impl FnMut(&mut Self)>, TryReserveError> {
     .                   debug_assert!(self.items <= capacity);
     .           
     .                   // Allocate and initialize the new table.
 1,015 ( 0.00%)          let mut new_table = RawTableInner::fallible_with_capacity(
     .                       self.alloc.clone(),
     .                       table_layout,
     .                       capacity,
     .                       fallibility,
     .                   )?;
   652 ( 0.00%)          new_table.growth_left -= self.items;
     .                   new_table.items = self.items;
     .           
     .                   // The hash function may panic, in which case we simply free the new
     .                   // table without dropping any elements that may have been copied into
     .                   // it.
     .                   //
     .                   // This guard is also used to free the old table on success, see
     .                   // the comment at the bottom of this function.
   216 ( 0.00%)          Ok(guard(new_table, move |self_| {
   326 ( 0.00%)              if !self_.is_empty_singleton() {
     .                           self_.free_buckets(table_layout);
     .                       }
     .                   }))
   216 ( 0.00%)      }
     .           
     .               #[inline]
     .               unsafe fn free_buckets(&mut self, table_layout: TableLayout) {
     .                   // Avoid `Option::unwrap_or_else` because it bloats LLVM IR.
     .                   let (layout, ctrl_offset) = match table_layout.calculate_layout_for(self.buckets()) {
     .                       Some(lco) => lco,
     .                       None => hint::unreachable_unchecked(),
     .                   };
     .                   self.alloc.deallocate(
   113 ( 0.00%)              NonNull::new_unchecked(self.ctrl.as_ptr().sub(ctrl_offset)),
     .                       layout,
     .                   );
     .               }
     .           
     .               /// Marks all table buckets as empty without dropping their contents.
     .               #[inline]
     .               fn clear_no_drop(&mut self) {
     .                   if !self.is_empty_singleton() {
-- line 1434 ----------------------------------------
-- line 1667 ----------------------------------------
     .                       }
     .                   }
     .               }
     .           }
     .           #[cfg(not(feature = "nightly"))]
     .           impl<T, A: Allocator + Clone> Drop for RawTable<T, A> {
     .               #[cfg_attr(feature = "inline-more", inline)]
     .               fn drop(&mut self) {
   715 ( 0.00%)          if !self.table.is_empty_singleton() {
     .                       unsafe {
     .                           self.drop_elements();
     .                           self.free_buckets();
     .                       }
     .                   }
     .               }
     .           }
     .           
-- line 1683 ----------------------------------------
-- line 1798 ----------------------------------------
     .           
     .           impl<T> Iterator for RawIterRange<T> {
     .               type Item = Bucket<T>;
     .           
     .               #[cfg_attr(feature = "inline-more", inline)]
     .               fn next(&mut self) -> Option<Bucket<T>> {
     .                   unsafe {
     .                       loop {
 1,144 ( 0.00%)                  if let Some(index) = self.current_group.lowest_set_bit() {
     .                               self.current_group = self.current_group.remove_lowest_bit();
     .                               return Some(self.data.next_n(index));
     .                           }
     .           
 1,960 ( 0.00%)                  if self.next_ctrl >= self.end {
     .                               return None;
     .                           }
     .           
     .                           // We might read past self.end up to the next group boundary,
     .                           // but this is fine because it only occurs on tables smaller
     .                           // than the group size where the trailing control bytes are all
     .                           // EMPTY. On larger tables self.end is guaranteed to be aligned
     .                           // to the group size (since tables are power-of-two sized).
-- line 1819 ----------------------------------------
-- line 1990 ----------------------------------------
     .           }
     .           
     .           impl<T> Iterator for RawIter<T> {
     .               type Item = Bucket<T>;
     .           
     .               #[cfg_attr(feature = "inline-more", inline)]
     .               fn next(&mut self) -> Option<Bucket<T>> {
     .                   if let Some(b) = self.iter.next() {
21,924 ( 0.02%)              self.items -= 1;
     .                       Some(b)
     .                   } else {
     .                       // We don't check against items == 0 here to allow the
     .                       // compiler to optimize away the item count entirely if the
     .                       // iterator length is never queried.
     .                       debug_assert_eq!(self.items, 0);
     .                       None
     .                   }
-- line 2006 ----------------------------------------
-- line 2178 ----------------------------------------
     .               }
     .           }
     .           impl<'a, A: Allocator + Clone> RawIterHashInner<'a, A> {
     .               #[cfg_attr(feature = "inline-more", inline)]
     .               fn new(table: &'a RawTableInner<A>, hash: u64) -> Self {
     .                   unsafe {
     .                       let h2_hash = h2(hash);
     .                       let probe_seq = table.probe_seq(hash);
 9,812 ( 0.01%)              let group = Group::load(table.ctrl(probe_seq.pos));
     .                       let bitmask = group.match_byte(h2_hash).into_iter();
     .           
     .                       RawIterHashInner {
     .                           table,
     .                           h2_hash,
     .                           probe_seq,
     .                           group,
     .                           bitmask,
-- line 2194 ----------------------------------------
-- line 2195 ----------------------------------------
     .                       }
     .                   }
     .               }
     .           }
     .           
     .           impl<'a, T, A: Allocator + Clone> Iterator for RawIterHash<'a, T, A> {
     .               type Item = Bucket<T>;
     .           
   348 ( 0.00%)      fn next(&mut self) -> Option<Bucket<T>> {
     .                   unsafe {
     .                       match self.inner.next() {
   174 ( 0.00%)                  Some(index) => Some(self.inner.table.bucket(index)),
     .                           None => None,
     .                       }
     .                   }
   348 ( 0.00%)      }
     .           }
     .           
     .           impl<'a, A: Allocator + Clone> Iterator for RawIterHashInner<'a, A> {
     .               type Item = usize;
     .           
     .               fn next(&mut self) -> Option<Self::Item> {
     .                   unsafe {
     .                       loop {
     .                           if let Some(bit) = self.bitmask.next() {
 7,095 ( 0.01%)                      let index = (self.probe_seq.pos + bit) & self.table.bucket_mask;
     .                               return Some(index);
     .                           }
 8,653 ( 0.01%)                  if likely(self.group.match_empty().any_bit_set()) {
     .                               return None;
     .                           }
     .                           self.probe_seq.move_next(self.table.bucket_mask);
     .                           self.group = Group::load(self.table.ctrl(self.probe_seq.pos));
 1,686 ( 0.00%)                  self.bitmask = self.group.match_byte(self.h2_hash).into_iter();
     .                       }
     .                   }
     .               }
     .           }
     .           
     .           #[cfg(test)]
     .           mod test_map {
     .               use super::*;
-- line 2236 ----------------------------------------

85,646 ( 0.07%)  <counts for unidentified lines in /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.11.2/src/raw/mod.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/mod.rs
--------------------------------------------------------------------------------
Ir               

-- line 168 ----------------------------------------
      .               pub self_ty: Ty<'tcx>,
      .               pub trait_ref: Option<TraitRef<'tcx>>,
      .               pub predicates: Vec<Predicate<'tcx>>,
      .           }
      .           
      .           #[derive(
      .               Copy,
      .               Clone,
  1,176 ( 0.00%)      PartialEq,
      .               Eq,
      .               Hash,
      .               TyEncodable,
  5,576 ( 0.00%)      TyDecodable,
      .               HashStable,
      .               Debug,
      .               TypeFoldable
      .           )]
      .           pub enum ImplPolarity {
      .               /// `impl Trait for Type`
      .               Positive,
      .               /// `impl !Trait for Type`
-- line 188 ----------------------------------------
-- line 210 ----------------------------------------
      .                   match self {
      .                       Self::Positive => f.write_str("positive"),
      .                       Self::Negative => f.write_str("negative"),
      .                       Self::Reservation => f.write_str("reservation"),
      .                   }
      .               }
      .           }
      .           
 89,527 ( 0.07%)  #[derive(Clone, Debug, PartialEq, Eq, Copy, Hash, TyEncodable, TyDecodable, HashStable)]
      .           pub enum Visibility {
      .               /// Visible everywhere (including in other crates).
      .               Public,
      .               /// Visible only in the given crate-local module.
      .               Restricted(DefId),
      .               /// Not visible anywhere in the local crate. This is the visibility of private external items.
      .               Invisible,
      .           }
      .           
  1,045 ( 0.00%)  #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, HashStable, TyEncodable, TyDecodable)]
      .           pub enum BoundConstness {
      .               /// `T: Trait`
      .               NotConst,
      .               /// `T: ~const Trait`
      .               ///
      .               /// Requires resolving to const only when we are in a const context.
      .               ConstIfConst,
      .           }
      .           
      .           impl BoundConstness {
      .               /// Reduce `self` and `constness` to two possible combined states instead of four.
    520 ( 0.00%)      pub fn and(&mut self, constness: hir::Constness) -> hir::Constness {
    780 ( 0.00%)          match (constness, self) {
      .                       (hir::Constness::Const, BoundConstness::ConstIfConst) => hir::Constness::Const,
      .                       (_, this) => {
    893 ( 0.00%)                  *this = BoundConstness::NotConst;
      .                           hir::Constness::NotConst
      .                       }
      .                   }
    260 ( 0.00%)      }
      .           }
      .           
      .           impl fmt::Display for BoundConstness {
      .               fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
      .                   match self {
      .                       Self::NotConst => f.write_str("normal"),
      .                       Self::ConstIfConst => f.write_str("`~const`"),
      .                   }
-- line 256 ----------------------------------------
-- line 275 ----------------------------------------
      .               /// Tuple containing the types of closure captures after the feature `capture_disjoint_fields`
      .               pub after_feature_tys: Ty<'tcx>,
      .           }
      .           
      .           pub trait DefIdTree: Copy {
      .               fn parent(self, id: DefId) -> Option<DefId>;
      .           
      .               fn is_descendant_of(self, mut descendant: DefId, ancestor: DefId) -> bool {
      5 ( 0.00%)          if descendant.krate != ancestor.krate {
      .                       return false;
      .                   }
      .           
    356 ( 0.00%)          while descendant != ancestor {
    315 ( 0.00%)              match self.parent(descendant) {
      .                           Some(parent) => descendant = parent,
      .                           None => return false,
      .                       }
      .                   }
      .                   true
      .               }
      .           }
      .           
      .           impl<'tcx> DefIdTree for TyCtxt<'tcx> {
    282 ( 0.00%)      fn parent(self, id: DefId) -> Option<DefId> {
      .                   self.def_key(id).parent.map(|index| DefId { index, ..id })
    423 ( 0.00%)      }
      .           }
      .           
      .           impl Visibility {
     14 ( 0.00%)      pub fn from_hir(visibility: &hir::Visibility<'_>, id: hir::HirId, tcx: TyCtxt<'_>) -> Self {
     42 ( 0.00%)          match visibility.node {
      .                       hir::VisibilityKind::Public => Visibility::Public,
      .                       hir::VisibilityKind::Crate(_) => Visibility::Restricted(DefId::local(CRATE_DEF_INDEX)),
      .                       hir::VisibilityKind::Restricted { ref path, .. } => match path.res {
      .                           // If there is no resolution, `resolve` will have already reported an error, so
      .                           // assume that the visibility is public to avoid reporting more privacy errors.
      .                           Res::Err => Visibility::Public,
      .                           def => Visibility::Restricted(def.def_id()),
      .                       },
      .                       hir::VisibilityKind::Inherited => {
     28 ( 0.00%)                  Visibility::Restricted(tcx.parent_module(id).to_def_id())
      .                       }
      .                   }
     14 ( 0.00%)      }
      .           
      .               /// Returns `true` if an item with this visibility is accessible from the given block.
  1,935 ( 0.00%)      pub fn is_accessible_from<T: DefIdTree>(self, module: DefId, tree: T) -> bool {
  6,118 ( 0.00%)          let restriction = match self {
      .                       // Public items are visible everywhere.
      .                       Visibility::Public => return true,
      .                       // Private items from other crates are visible nowhere.
      .                       Visibility::Invisible => return false,
      .                       // Restricted items are visible in an arbitrary local module.
    164 ( 0.00%)              Visibility::Restricted(other) if other.krate != module.krate => return false,
      .                       Visibility::Restricted(module) => module,
      .                   };
      .           
      .                   tree.is_descendant_of(module, restriction)
  1,935 ( 0.00%)      }
      .           
      .               /// Returns `true` if this visibility is at least as accessible as the given visibility
    684 ( 0.00%)      pub fn is_at_least<T: DefIdTree>(self, vis: Visibility, tree: T) -> bool {
  1,060 ( 0.00%)          let vis_restriction = match vis {
      .                       Visibility::Public => return self == Visibility::Public,
      .                       Visibility::Invisible => return true,
      .                       Visibility::Restricted(module) => module,
      .                   };
      .           
      .                   self.is_accessible_from(vis_restriction, tree)
    684 ( 0.00%)      }
      .           
      .               // Returns `true` if this item is visible anywhere in the local crate.
      .               pub fn is_visible_locally(self) -> bool {
      .                   match self {
      .                       Visibility::Public => true,
      .                       Visibility::Restricted(def_id) => def_id.is_local(),
      .                       Visibility::Invisible => false,
      .                   }
      .               }
      .           
      .               pub fn is_public(self) -> bool {
    124 ( 0.00%)          matches!(self, Visibility::Public)
     62 ( 0.00%)      }
      .           }
      .           
      .           /// The crate variances map is computed during typeck and contains the
      .           /// variance of every item in the local crate. You should not use it
      .           /// directly, because to do so will make your pass dependent on the
      .           /// HIR of every item in the local crate. Instead, use
      .           /// `tcx.variances_of()` to get the variance for a *particular*
      .           /// item.
-- line 365 ----------------------------------------
-- line 509 ----------------------------------------
      .           #[derive(Clone, Copy, Lift)]
      .           pub struct Predicate<'tcx> {
      .               inner: &'tcx PredicateInner<'tcx>,
      .           }
      .           
      .           impl<'tcx> PartialEq for Predicate<'tcx> {
      .               fn eq(&self, other: &Self) -> bool {
      .                   // `self.kind` is always interned.
  1,293 ( 0.00%)          ptr::eq(self.inner, other.inner)
  1,240 ( 0.00%)      }
      .           }
      .           
      .           impl Hash for Predicate<'_> {
      .               fn hash<H: Hasher>(&self, s: &mut H) {
      .                   (self.inner as *const PredicateInner<'_>).hash(s)
      .               }
      .           }
      .           
      .           impl<'tcx> Eq for Predicate<'tcx> {}
      .           
      .           impl<'tcx> Predicate<'tcx> {
      .               /// Gets the inner `Binder<'tcx, PredicateKind<'tcx>>`.
      .               #[inline]
      .               pub fn kind(self) -> Binder<'tcx, PredicateKind<'tcx>> {
 12,423 ( 0.01%)          self.inner.kind
      .               }
      .           
      .               /// Flips the polarity of a Predicate.
      .               ///
      .               /// Given `T: Trait` predicate it returns `T: !Trait` and given `T: !Trait` returns `T: Trait`.
      .               pub fn flip_polarity(&self, tcx: TyCtxt<'tcx>) -> Option<Predicate<'tcx>> {
      .                   let kind = self
      .                       .inner
-- line 541 ----------------------------------------
-- line 567 ----------------------------------------
      .                       flags: _,
      .                       outer_exclusive_binder: _,
      .                   } = self.inner;
      .           
      .                   kind.hash_stable(hcx, hasher);
      .               }
      .           }
      .           
 50,650 ( 0.04%)  #[derive(Clone, Copy, PartialEq, Eq, Hash, TyEncodable, TyDecodable)]
 30,336 ( 0.02%)  #[derive(HashStable, TypeFoldable)]
      .           pub enum PredicateKind<'tcx> {
      .               /// Corresponds to `where Foo: Bar<A, B, C>`. `Foo` here would be
      .               /// the `Self` type of the trait reference and `A`, `B`, and `C`
      .               /// would be the type parameters.
      .               Trait(TraitPredicate<'tcx>),
      .           
      .               /// `where 'a: 'b`
      .               RegionOutlives(RegionOutlivesPredicate<'tcx>),
-- line 584 ----------------------------------------
-- line 601 ----------------------------------------
      .               /// Satisfied (or refuted) once we know the closure's kind.
      .               ClosureKind(DefId, SubstsRef<'tcx>, ClosureKind),
      .           
      .               /// `T1 <: T2`
      .               ///
      .               /// This obligation is created most often when we have two
      .               /// unresolved type variables and hence don't have enough
      .               /// information to process the subtyping obligation yet.
     16 ( 0.00%)      Subtype(SubtypePredicate<'tcx>),
      .           
      .               /// `T1` coerced to `T2`
      .               ///
      .               /// Like a subtyping obligation, this is created most often
      .               /// when we have two unresolved type variables and hence
      .               /// don't have enough information to process the coercion
      .               /// obligation yet. At the moment, we actually process coercions
      .               /// very much like subtyping and don't handle the full coercion
-- line 617 ----------------------------------------
-- line 645 ----------------------------------------
      .           }
      .           
      .           impl<'tcx> Predicate<'tcx> {
      .               /// Performs a substitution suitable for going from a
      .               /// poly-trait-ref to supertraits that must hold if that
      .               /// poly-trait-ref holds. This is slightly different from a normal
      .               /// substitution in terms of what happens with bound regions. See
      .               /// lengthy comment below for details.
     54 ( 0.00%)      pub fn subst_supertrait(
      .                   self,
      .                   tcx: TyCtxt<'tcx>,
      .                   trait_ref: &ty::PolyTraitRef<'tcx>,
      .               ) -> Predicate<'tcx> {
      .                   // The interaction between HRTB and supertraits is not entirely
      .                   // obvious. Let me walk you (and myself) through an example.
      .                   //
      .                   // Let's start with an easy case. Consider two traits:
-- line 661 ----------------------------------------
-- line 731 ----------------------------------------
      .                   //    ['x, 'b]
      .                   let bound_pred = self.kind();
      .                   let pred_bound_vars = bound_pred.bound_vars();
      .                   let trait_bound_vars = trait_ref.bound_vars();
      .                   // 1) Self: Bar1<'a, '^0.0> -> Self: Bar1<'a, '^0.1>
      .                   let shifted_pred =
      .                       tcx.shift_bound_var_indices(trait_bound_vars.len(), bound_pred.skip_binder());
      .                   // 2) Self: Bar1<'a, '^0.1> -> T: Bar1<'^0.0, '^0.1>
      6 ( 0.00%)          let new = shifted_pred.subst(tcx, trait_ref.skip_binder().substs);
      .                   // 3) ['x] + ['b] -> ['x, 'b]
      .                   let bound_vars =
      .                       tcx.mk_bound_variable_kinds(trait_bound_vars.iter().chain(pred_bound_vars));
     54 ( 0.00%)          tcx.reuse_or_mk_predicate(self, ty::Binder::bind_with_vars(new, bound_vars))
     42 ( 0.00%)      }
      .           }
      .           
      .           #[derive(Clone, Copy, PartialEq, Eq, Hash, TyEncodable, TyDecodable)]
  1,661 ( 0.00%)  #[derive(HashStable, TypeFoldable)]
      .           pub struct TraitPredicate<'tcx> {
      .               pub trait_ref: TraitRef<'tcx>,
      .           
  4,229 ( 0.00%)      pub constness: BoundConstness,
      .           
  4,026 ( 0.00%)      pub polarity: ImplPolarity,
      .           }
      .           
      .           pub type PolyTraitPredicate<'tcx> = ty::Binder<'tcx, TraitPredicate<'tcx>>;
      .           
      .           impl<'tcx> TraitPredicate<'tcx> {
  5,064 ( 0.00%)      pub fn remap_constness(&mut self, tcx: TyCtxt<'tcx>, param_env: &mut ParamEnv<'tcx>) {
  4,431 ( 0.00%)          if unlikely!(Some(self.trait_ref.def_id) == tcx.lang_items().drop_trait()) {
      .                       // remap without changing constness of this predicate.
      .                       // this is because `T: ~const Drop` has a different meaning to `T: Drop`
      .                       param_env.remap_constness_with(self.constness)
      .                   } else {
    633 ( 0.00%)              *param_env = param_env.with_constness(self.constness.and(param_env.constness()))
      .                   }
  3,798 ( 0.00%)      }
      .           
      .               /// Remap the constness of this predicate before emitting it for diagnostics.
      .               pub fn remap_constness_diag(&mut self, param_env: ParamEnv<'tcx>) {
      .                   // this is different to `remap_constness` that callees want to print this predicate
      .                   // in case of selection errors. `T: ~const Drop` bounds cannot end up here when the
      .                   // param_env is not const because we it is always satisfied in non-const contexts.
      .                   if let hir::Constness::NotConst = param_env.constness() {
      .                       self.constness = ty::BoundConstness::NotConst;
      .                   }
      .               }
      .           
      .               pub fn def_id(self) -> DefId {
  1,190 ( 0.00%)          self.trait_ref.def_id
    595 ( 0.00%)      }
      .           
    950 ( 0.00%)      pub fn self_ty(self) -> Ty<'tcx> {
  2,850 ( 0.00%)          self.trait_ref.self_ty()
  1,900 ( 0.00%)      }
      .           }
      .           
      .           impl<'tcx> PolyTraitPredicate<'tcx> {
      .               pub fn def_id(self) -> DefId {
      .                   // Ok to skip binder since trait `DefId` does not care about regions.
      .                   self.skip_binder().def_id()
    706 ( 0.00%)      }
      .           
      2 ( 0.00%)      pub fn self_ty(self) -> ty::Binder<'tcx, Ty<'tcx>> {
      8 ( 0.00%)          self.map_bound(|trait_ref| trait_ref.self_ty())
      4 ( 0.00%)      }
      .           
      .               /// Remap the constness of this predicate before emitting it for diagnostics.
      .               pub fn remap_constness_diag(&mut self, param_env: ParamEnv<'tcx>) {
      .                   *self = self.map_bound(|mut p| {
      .                       p.remap_constness_diag(param_env);
      .                       p
      .                   });
      .               }
      .           }
      .           
      .           #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)]
    759 ( 0.00%)  #[derive(HashStable, TypeFoldable)]
    804 ( 0.00%)  pub struct OutlivesPredicate<A, B>(pub A, pub B); // `A: B`
      .           pub type RegionOutlivesPredicate<'tcx> = OutlivesPredicate<ty::Region<'tcx>, ty::Region<'tcx>>;
      .           pub type TypeOutlivesPredicate<'tcx> = OutlivesPredicate<Ty<'tcx>, ty::Region<'tcx>>;
      .           pub type PolyRegionOutlivesPredicate<'tcx> = ty::Binder<'tcx, RegionOutlivesPredicate<'tcx>>;
      .           pub type PolyTypeOutlivesPredicate<'tcx> = ty::Binder<'tcx, TypeOutlivesPredicate<'tcx>>;
      .           
      .           /// Encodes that `a` must be a subtype of `b`. The `a_is_expected` flag indicates
      .           /// whether the `a` type is the type that we should label as "expected" when
      .           /// presenting user diagnostics.
      .           #[derive(Clone, Copy, PartialEq, Eq, Hash, Debug, TyEncodable, TyDecodable)]
      9 ( 0.00%)  #[derive(HashStable, TypeFoldable)]
      .           pub struct SubtypePredicate<'tcx> {
     18 ( 0.00%)      pub a_is_expected: bool,
      .               pub a: Ty<'tcx>,
      .               pub b: Ty<'tcx>,
      .           }
      .           pub type PolySubtypePredicate<'tcx> = ty::Binder<'tcx, SubtypePredicate<'tcx>>;
      .           
      .           /// Encodes that we have to coerce *from* the `a` type to the `b` type.
      .           #[derive(Clone, Copy, PartialEq, Eq, Hash, Debug, TyEncodable, TyDecodable)]
      .           #[derive(HashStable, TypeFoldable)]
-- line 830 ----------------------------------------
-- line 914 ----------------------------------------
      .               }
      .           }
      .           
      .           pub trait ToPolyTraitRef<'tcx> {
      .               fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx>;
      .           }
      .           
      .           impl<'tcx> ToPolyTraitRef<'tcx> for PolyTraitPredicate<'tcx> {
      4 ( 0.00%)      fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx> {
      4 ( 0.00%)          self.map_bound_ref(|trait_pred| trait_pred.trait_ref)
      4 ( 0.00%)      }
      .           }
      .           
      .           pub trait ToPredicate<'tcx> {
      .               fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx>;
      .           }
      .           
      .           impl<'tcx> ToPredicate<'tcx> for Binder<'tcx, PredicateKind<'tcx>> {
      .               #[inline(always)]
      .               fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> {
      .                   tcx.mk_predicate(self)
      .               }
      .           }
      .           
      .           impl<'tcx> ToPredicate<'tcx> for PolyTraitPredicate<'tcx> {
    337 ( 0.00%)      fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> {
  1,685 ( 0.00%)          self.map_bound(PredicateKind::Trait).to_predicate(tcx)
    674 ( 0.00%)      }
      .           }
      .           
      .           impl<'tcx> ToPredicate<'tcx> for PolyRegionOutlivesPredicate<'tcx> {
      .               fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> {
      .                   self.map_bound(PredicateKind::RegionOutlives).to_predicate(tcx)
      .               }
      .           }
      .           
-- line 949 ----------------------------------------
-- line 955 ----------------------------------------
      .           
      .           impl<'tcx> ToPredicate<'tcx> for PolyProjectionPredicate<'tcx> {
      .               fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> {
      .                   self.map_bound(PredicateKind::Projection).to_predicate(tcx)
      .               }
      .           }
      .           
      .           impl<'tcx> Predicate<'tcx> {
     26 ( 0.00%)      pub fn to_opt_poly_trait_pred(self) -> Option<PolyTraitPredicate<'tcx>> {
      .                   let predicate = self.kind();
     78 ( 0.00%)          match predicate.skip_binder() {
     60 ( 0.00%)              PredicateKind::Trait(t) => Some(predicate.rebind(t)),
      .                       PredicateKind::Projection(..)
      .                       | PredicateKind::Subtype(..)
      .                       | PredicateKind::Coerce(..)
      .                       | PredicateKind::RegionOutlives(..)
      .                       | PredicateKind::WellFormed(..)
      .                       | PredicateKind::ObjectSafe(..)
      .                       | PredicateKind::ClosureKind(..)
      .                       | PredicateKind::TypeOutlives(..)
      .                       | PredicateKind::ConstEvaluatable(..)
      .                       | PredicateKind::ConstEquate(..)
      1 ( 0.00%)              | PredicateKind::TypeWellFormedFromEnv(..) => None,
      .                   }
     26 ( 0.00%)      }
      .           
      .               pub fn to_opt_type_outlives(self) -> Option<PolyTypeOutlivesPredicate<'tcx>> {
      .                   let predicate = self.kind();
      .                   match predicate.skip_binder() {
      .                       PredicateKind::TypeOutlives(data) => Some(predicate.rebind(data)),
      .                       PredicateKind::Trait(..)
      .                       | PredicateKind::Projection(..)
      .                       | PredicateKind::Subtype(..)
-- line 987 ----------------------------------------
-- line 1011 ----------------------------------------
      .           /// Example:
      .           ///
      .           ///     struct Foo<T, U: Bar<T>> { ... }
      .           ///
      .           /// Here, the `GenericPredicates` for `Foo` would contain a list of bounds like
      .           /// `[[], [U:Bar<T>]]`. Now if there were some particular reference
      .           /// like `Foo<isize,usize>`, then the `InstantiatedPredicates` would be `[[],
      .           /// [usize:Bar<isize>]]`.
  1,505 ( 0.00%)  #[derive(Clone, Debug, TypeFoldable)]
      .           pub struct InstantiatedPredicates<'tcx> {
      .               pub predicates: Vec<Predicate<'tcx>>,
      .               pub spans: Vec<Span>,
      .           }
      .           
      .           impl<'tcx> InstantiatedPredicates<'tcx> {
      9 ( 0.00%)      pub fn empty() -> InstantiatedPredicates<'tcx> {
  1,204 ( 0.00%)          InstantiatedPredicates { predicates: vec![], spans: vec![] }
      9 ( 0.00%)      }
      .           
      .               pub fn is_empty(&self) -> bool {
      .                   self.predicates.is_empty()
      .               }
      .           }
      .           
      .           #[derive(Copy, Clone, Debug, PartialEq, Eq, HashStable, TyEncodable, TyDecodable, TypeFoldable)]
      .           pub struct OpaqueTypeKey<'tcx> {
-- line 1036 ----------------------------------------
-- line 1091 ----------------------------------------
      .               /// ```
      .               /// for<'a> fn(&'a u32)
      .               /// ```
      .               ///
      .               /// Once we "enter" into this `for<'a>` quantifier, we are in a
      .               /// new universe that extends `U` -- in this new universe, we can
      .               /// name the region `'a`, but that region was not nameable from
      .               /// `U` because it was not in scope there.
    181 ( 0.00%)      pub fn next_universe(self) -> UniverseIndex {
      .                   UniverseIndex::from_u32(self.private.checked_add(1).unwrap())
    543 ( 0.00%)      }
      .           
      .               /// Returns `true` if `self` can name a name from `other` -- in other words,
      .               /// if the set of names in `self` is a superset of those in
      .               /// `other` (`self >= other`).
      .               pub fn can_name(self, other: UniverseIndex) -> bool {
  1,190 ( 0.00%)          self.private >= other.private
    595 ( 0.00%)      }
      .           
      .               /// Returns `true` if `self` cannot name some names from `other` -- in other
      .               /// words, if the set of names in `self` is a strict subset of
      .               /// those in `other` (`self < other`).
      .               pub fn cannot_name(self, other: UniverseIndex) -> bool {
      8 ( 0.00%)          self.private < other.private
      4 ( 0.00%)      }
      .           }
      .           
      .           /// The "placeholder index" fully defines a placeholder region, type, or const. Placeholders are
      .           /// identified by both a universe, as well as a name residing within that universe. Distinct bound
      .           /// regions/types/consts within the same universe simply have an unknown relationship to one
      .           /// another.
      .           #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, TyEncodable, TyDecodable, PartialOrd, Ord)]
      .           pub struct Placeholder<T> {
     46 ( 0.00%)      pub universe: UniverseIndex,
     28 ( 0.00%)      pub name: T,
      .           }
      .           
      .           impl<'a, T> HashStable<StableHashingContext<'a>> for Placeholder<T>
      .           where
      .               T: HashStable<StableHashingContext<'a>>,
      .           {
      .               fn hash_stable(&self, hcx: &mut StableHashingContext<'a>, hasher: &mut StableHasher) {
      .                   self.universe.hash_stable(hcx, hasher);
-- line 1133 ----------------------------------------
-- line 1194 ----------------------------------------
      .           /// aren't allowed to call that query: it is equal to `type_of(const_param)` which is
      .           /// trivial to compute.
      .           ///
      .           /// If we now want to use that constant in a place which potentionally needs its type
      .           /// we also pass the type of its `const_param`. This is the point of `WithOptConstParam`,
      .           /// except that instead of a `Ty` we bundle the `DefId` of the const parameter.
      .           /// Meaning that we need to use `type_of(const_param_did)` if `const_param_did` is `Some`
      .           /// to get the type of `did`.
    605 ( 0.00%)  #[derive(Copy, Clone, Debug, TypeFoldable, Lift, TyEncodable, TyDecodable)]
      .           #[derive(PartialEq, Eq, PartialOrd, Ord)]
      .           #[derive(Hash, HashStable)]
      .           pub struct WithOptConstParam<T> {
    170 ( 0.00%)      pub did: T,
      .               /// The `DefId` of the corresponding generic parameter in case `did` is
      .               /// a const argument.
      .               ///
      .               /// Note that even if `did` is a const argument, this may still be `None`.
      .               /// All queries taking `WithOptConstParam` start by calling `tcx.opt_const_param_of(def.did)`
      .               /// to potentially update `param_did` in the case it is `None`.
    374 ( 0.00%)      pub const_param_did: Option<DefId>,
      .           }
      .           
      .           impl<T> WithOptConstParam<T> {
      .               /// Creates a new `WithOptConstParam` setting `const_param_did` to `None`.
      .               #[inline(always)]
      .               pub fn unknown(did: T) -> WithOptConstParam<T> {
      .                   WithOptConstParam { did, const_param_did: None }
    466 ( 0.00%)      }
      .           }
      .           
      .           impl WithOptConstParam<LocalDefId> {
      .               /// Returns `Some((did, param_did))` if `def_id` is a const argument,
      .               /// `None` otherwise.
      .               #[inline(always)]
      .               pub fn try_lookup(did: LocalDefId, tcx: TyCtxt<'_>) -> Option<(LocalDefId, DefId)> {
      .                   tcx.opt_const_param_of(did).map(|param_did| (did, param_did))
      .               }
      .           
      .               /// In case `self` is unknown but `self.did` is a const argument, this returns
      .               /// a `WithOptConstParam` with the correct `const_param_did`.
      .               #[inline(always)]
      .               pub fn try_upgrade(self, tcx: TyCtxt<'_>) -> Option<WithOptConstParam<LocalDefId>> {
     54 ( 0.00%)          if self.const_param_did.is_none() {
     88 ( 0.00%)              if let const_param_did @ Some(_) = tcx.opt_const_param_of(self.did) {
      .                           return Some(WithOptConstParam { did: self.did, const_param_did });
      .                       }
      .                   }
      .           
      .                   None
      .               }
      .           
      .               pub fn to_global(self) -> WithOptConstParam<DefId> {
      .                   WithOptConstParam { did: self.did.to_def_id(), const_param_did: self.const_param_did }
      .               }
      .           
     12 ( 0.00%)      pub fn def_id_for_type_of(self) -> DefId {
      9 ( 0.00%)          if let Some(did) = self.const_param_did { did } else { self.did.to_def_id() }
      3 ( 0.00%)      }
      .           }
      .           
      .           impl WithOptConstParam<DefId> {
     40 ( 0.00%)      pub fn as_local(self) -> Option<WithOptConstParam<LocalDefId>> {
      .                   self.did
      .                       .as_local()
      .                       .map(|did| WithOptConstParam { did, const_param_did: self.const_param_did })
     40 ( 0.00%)      }
      .           
      .               pub fn as_const_arg(self) -> Option<(LocalDefId, DefId)> {
     90 ( 0.00%)          if let Some(param_did) = self.const_param_did {
     40 ( 0.00%)              if let Some(did) = self.did.as_local() {
      .                           return Some((did, param_did));
      .                       }
      .                   }
      .           
      .                   None
     30 ( 0.00%)      }
      .           
      .               pub fn is_local(self) -> bool {
      .                   self.did.is_local()
      .               }
      .           
     30 ( 0.00%)      pub fn def_id_for_type_of(self) -> DefId {
      .                   self.const_param_did.unwrap_or(self.did)
     30 ( 0.00%)      }
      .           }
      .           
      .           /// When type checking, we use the `ParamEnv` to track
      .           /// details about the set of where-clauses that are in scope at this
      .           /// particular point.
      .           #[derive(Copy, Clone, Hash, PartialEq, Eq)]
      .           pub struct ParamEnv<'tcx> {
      .               /// This packs both caller bounds and the reveal enum into one pointer.
-- line 1285 ----------------------------------------
-- line 1302 ----------------------------------------
      .               reveal: traits::Reveal,
      .               constness: hir::Constness,
      .           }
      .           
      .           unsafe impl rustc_data_structures::tagged_ptr::Tag for ParamTag {
      .               const BITS: usize = 2;
      .               #[inline]
      .               fn into_usize(self) -> usize {
  1,109 ( 0.00%)          match self {
      .                       Self { reveal: traits::Reveal::UserFacing, constness: hir::Constness::NotConst } => 0,
      .                       Self { reveal: traits::Reveal::All, constness: hir::Constness::NotConst } => 1,
      .                       Self { reveal: traits::Reveal::UserFacing, constness: hir::Constness::Const } => 2,
      .                       Self { reveal: traits::Reveal::All, constness: hir::Constness::Const } => 3,
      .                   }
      .               }
      .               #[inline]
      .               unsafe fn from_usize(ptr: usize) -> Self {
 10,656 ( 0.01%)          match ptr {
      .                       0 => Self { reveal: traits::Reveal::UserFacing, constness: hir::Constness::NotConst },
      .                       1 => Self { reveal: traits::Reveal::All, constness: hir::Constness::NotConst },
      .                       2 => Self { reveal: traits::Reveal::UserFacing, constness: hir::Constness::Const },
      .                       3 => Self { reveal: traits::Reveal::All, constness: hir::Constness::Const },
      .                       _ => std::hint::unreachable_unchecked(),
      .                   }
      .               }
      .           }
-- line 1327 ----------------------------------------
-- line 1405 ----------------------------------------
      .               pub fn new(
      .                   caller_bounds: &'tcx List<Predicate<'tcx>>,
      .                   reveal: Reveal,
      .                   constness: hir::Constness,
      .               ) -> Self {
      .                   ty::ParamEnv { packed: CopyTaggedPtr::new(caller_bounds, ParamTag { reveal, constness }) }
      .               }
      .           
      3 ( 0.00%)      pub fn with_user_facing(mut self) -> Self {
      .                   self.packed.set_tag(ParamTag { reveal: Reveal::UserFacing, ..self.packed.tag() });
      .                   self
      3 ( 0.00%)      }
      .           
      .               #[inline]
      .               pub fn with_constness(mut self, constness: hir::Constness) -> Self {
      .                   self.packed.set_tag(ParamTag { constness, ..self.packed.tag() });
      .                   self
      .               }
      .           
      .               #[inline]
-- line 1424 ----------------------------------------
-- line 1430 ----------------------------------------
      .               #[inline]
      .               pub fn without_const(mut self) -> Self {
      .                   self.packed.set_tag(ParamTag { constness: hir::Constness::NotConst, ..self.packed.tag() });
      .                   self
      .               }
      .           
      .               #[inline]
      .               pub fn remap_constness_with(&mut self, mut constness: ty::BoundConstness) {
    152 ( 0.00%)          *self = self.with_constness(constness.and(self.constness()))
      .               }
      .           
      .               /// Returns a new parameter environment with the same clauses, but
      .               /// which "reveals" the true results of projections in all cases
      .               /// (even for associated types that are specializable). This is
      .               /// the desired behavior during codegen and certain other special
      .               /// contexts; normally though we want to use `Reveal::UserFacing`,
      .               /// which is the default.
      .               /// All opaque types in the caller_bounds of the `ParamEnv`
      .               /// will be normalized to their underlying types.
      .               /// See PR #65989 and issue #65918 for more details
    264 ( 0.00%)      pub fn with_reveal_all_normalized(self, tcx: TyCtxt<'tcx>) -> Self {
      .                   if self.packed.tag().reveal == traits::Reveal::All {
      .                       return self;
      .                   }
      .           
      .                   ParamEnv::new(
      .                       tcx.normalize_opaque_types(self.caller_bounds()),
      .                       Reveal::All,
      .                       self.constness(),
      .                   )
    297 ( 0.00%)      }
      .           
      .               /// Returns this same environment but with no caller bounds.
      .               #[inline]
      .               pub fn without_caller_bounds(self) -> Self {
      .                   Self::new(List::empty(), self.reveal(), self.constness())
      .               }
      .           
      .               /// Creates a suitable environment in which to perform trait
-- line 1468 ----------------------------------------
-- line 1472 ----------------------------------------
      .               /// pair it with the empty environment. This improves caching and is generally
      .               /// invisible.
      .               ///
      .               /// N.B., we preserve the environment when type-checking because it
      .               /// is possible for the user to have wacky where-clauses like
      .               /// `where Box<u32>: Copy`, which are clearly never
      .               /// satisfiable. We generally want to behave as if they were true,
      .               /// although the surrounding function is never reachable.
  1,914 ( 0.00%)      pub fn and<T: TypeFoldable<'tcx>>(self, value: T) -> ParamEnvAnd<'tcx, T> {
      .                   match self.reveal() {
      .                       Reveal::UserFacing => ParamEnvAnd { param_env: self, value },
      .           
      .                       Reveal::All => {
     40 ( 0.00%)                  if value.is_global() {
      .                               ParamEnvAnd { param_env: self.without_caller_bounds(), value }
      .                           } else {
      .                               ParamEnvAnd { param_env: self, value }
      .                           }
      .                       }
      .                   }
  1,827 ( 0.00%)      }
      .           }
      .           
      .           // FIXME(ecstaticmorse): Audit all occurrences of `without_const().to_predicate(tcx)` to ensure that
      .           // the constness of trait bounds is being propagated correctly.
      .           impl<'tcx> PolyTraitRef<'tcx> {
      .               #[inline]
      .               pub fn with_constness(self, constness: BoundConstness) -> PolyTraitPredicate<'tcx> {
     18 ( 0.00%)          self.map_bound(|trait_ref| ty::TraitPredicate {
      .                       trait_ref,
      .                       constness,
      .                       polarity: ty::ImplPolarity::Positive,
      .                   })
      .               }
      .               #[inline]
      .               pub fn without_const(self) -> PolyTraitPredicate<'tcx> {
      .                   self.with_constness(BoundConstness::NotConst)
      .               }
      .           }
      .           
     76 ( 0.00%)  #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, TypeFoldable)]
      .           pub struct ParamEnvAnd<'tcx, T> {
    527 ( 0.00%)      pub param_env: ParamEnv<'tcx>,
  7,118 ( 0.01%)      pub value: T,
      .           }
      .           
      .           impl<'tcx, T> ParamEnvAnd<'tcx, T> {
      .               pub fn into_parts(self) -> (ParamEnv<'tcx>, T) {
      .                   (self.param_env, self.value)
      .               }
      .           
      .               #[inline]
      .               pub fn without_const(mut self) -> Self {
      .                   self.param_env = self.param_env.without_const();
    120 ( 0.00%)          self
      .               }
      .           }
      .           
      .           impl<'a, 'tcx, T> HashStable<StableHashingContext<'a>> for ParamEnvAnd<'tcx, T>
      .           where
      .               T: HashStable<StableHashingContext<'a>>,
      .           {
      .               fn hash_stable(&self, hcx: &mut StableHashingContext<'a>, hasher: &mut StableHasher) {
-- line 1534 ----------------------------------------
-- line 1542 ----------------------------------------
      .           #[derive(Copy, Clone, Debug, HashStable)]
      .           pub struct Destructor {
      .               /// The `DefId` of the destructor method
      .               pub did: DefId,
      .               /// The constness of the destructor method
      .               pub constness: hir::Constness,
      .           }
      .           
     61 ( 0.00%)  bitflags! {
    153 ( 0.00%)      #[derive(HashStable, TyEncodable, TyDecodable)]
      .               pub struct VariantFlags: u32 {
      .                   const NO_VARIANT_FLAGS        = 0;
      .                   /// Indicates whether the field list of this variant is `#[non_exhaustive]`.
      .                   const IS_FIELD_LIST_NON_EXHAUSTIVE = 1 << 0;
      .                   /// Indicates whether this variant was obtained as part of recovering from
      .                   /// a syntactic error. May be incomplete or bogus.
      .                   const IS_RECOVERED = 1 << 1;
      .               }
      .           }
      .           
      .           /// Definition of a variant -- a struct's fields or an enum variant.
104,091 ( 0.08%)  #[derive(Debug, HashStable, TyEncodable, TyDecodable)]
      .           pub struct VariantDef {
      .               /// `DefId` that identifies the variant itself.
      .               /// If this variant belongs to a struct or union, then this is a copy of its `DefId`.
      .               pub def_id: DefId,
      .               /// `DefId` that identifies the variant's constructor.
      .               /// If this variant is a struct variant, then this is `None`.
      .               pub ctor_def_id: Option<DefId>,
      .               /// Variant or struct name.
-- line 1571 ----------------------------------------
-- line 1592 ----------------------------------------
      .               /// `parent_did` is the `DefId` of the `AdtDef` representing the enum or struct that
      .               /// owns this variant. It is used for checking if a struct has `#[non_exhaustive]` w/out having
      .               /// to go through the redirect of checking the ctor's attributes - but compiling a small crate
      .               /// requires loading the `AdtDef`s for all the structs in the universe (e.g., coherence for any
      .               /// built-in trait), and we do not want to load attributes twice.
      .               ///
      .               /// If someone speeds up attribute loading to not be a performance concern, they can
      .               /// remove this hack and use the constructor `DefId` everywhere.
    384 ( 0.00%)      pub fn new(
      .                   name: Symbol,
      .                   variant_did: Option<DefId>,
      .                   ctor_def_id: Option<DefId>,
      .                   discr: VariantDiscr,
      .                   fields: Vec<FieldDef>,
      .                   ctor_kind: CtorKind,
      .                   adt_kind: AdtKind,
      .                   parent_did: DefId,
-- line 1608 ----------------------------------------
-- line 1611 ----------------------------------------
      .               ) -> Self {
      .                   debug!(
      .                       "VariantDef::new(name = {:?}, variant_did = {:?}, ctor_def_id = {:?}, discr = {:?},
      .                        fields = {:?}, ctor_kind = {:?}, adt_kind = {:?}, parent_did = {:?})",
      .                       name, variant_did, ctor_def_id, discr, fields, ctor_kind, adt_kind, parent_did,
      .                   );
      .           
      .                   let mut flags = VariantFlags::NO_VARIANT_FLAGS;
     48 ( 0.00%)          if is_field_list_non_exhaustive {
      .                       flags |= VariantFlags::IS_FIELD_LIST_NON_EXHAUSTIVE;
      .                   }
      .           
    144 ( 0.00%)          if recovered {
      .                       flags |= VariantFlags::IS_RECOVERED;
      .                   }
      .           
    432 ( 0.00%)          VariantDef {
      .                       def_id: variant_did.unwrap_or(parent_did),
      .                       ctor_def_id,
      .                       name,
      .                       discr,
    192 ( 0.00%)              fields,
      .                       ctor_kind,
      .                       flags,
      .                   }
    192 ( 0.00%)      }
      .           
      .               /// Is this field list non-exhaustive?
      .               #[inline]
      .               pub fn is_field_list_non_exhaustive(&self) -> bool {
      .                   self.flags.intersects(VariantFlags::IS_FIELD_LIST_NON_EXHAUSTIVE)
      .               }
      .           
      .               /// Was this variant obtained as part of recovering from a syntactic error?
      .               #[inline]
      .               pub fn is_recovered(&self) -> bool {
      .                   self.flags.intersects(VariantFlags::IS_RECOVERED)
      .               }
      .           
      .               /// Computes the `Ident` of this variant by looking up the `Span`
     35 ( 0.00%)      pub fn ident(&self, tcx: TyCtxt<'_>) -> Ident {
     20 ( 0.00%)          Ident::new(self.name, tcx.def_ident_span(self.def_id).unwrap())
     45 ( 0.00%)      }
      .           }
      .           
 55,045 ( 0.04%)  #[derive(Copy, Clone, Debug, PartialEq, Eq, TyEncodable, TyDecodable, HashStable)]
      .           pub enum VariantDiscr {
      .               /// Explicit value for this variant, i.e., `X = 123`.
      .               /// The `DefId` corresponds to the embedded constant.
      .               Explicit(DefId),
      .           
      .               /// The previous variant's discriminant plus one.
      .               /// For efficiency reasons, the distance from the
      .               /// last `Explicit` discriminant is being stored,
      .               /// or `0` for the first variant, if it has none.
      .               Relative(u32),
      .           }
      .           
150,234 ( 0.12%)  #[derive(Debug, HashStable, TyEncodable, TyDecodable)]
      .           pub struct FieldDef {
      .               pub did: DefId,
      .               pub name: Symbol,
      .               pub vis: Visibility,
      .           }
      .           
      9 ( 0.00%)  bitflags! {
      .               #[derive(TyEncodable, TyDecodable, Default, HashStable)]
      .               pub struct ReprFlags: u8 {
      .                   const IS_C               = 1 << 0;
      .                   const IS_SIMD            = 1 << 1;
      .                   const IS_TRANSPARENT     = 1 << 2;
      .                   // Internal only for now. If true, don't reorder fields.
      .                   const IS_LINEAR          = 1 << 3;
      .                   // If true, don't expose any niche to type's context.
-- line 1684 ----------------------------------------
-- line 1689 ----------------------------------------
      .                   // Any of these flags being set prevent field reordering optimisation.
      .                   const IS_UNOPTIMISABLE   = ReprFlags::IS_C.bits
      .                                            | ReprFlags::IS_SIMD.bits
      .                                            | ReprFlags::IS_LINEAR.bits;
      .               }
      .           }
      .           
      .           /// Represents the repr options provided by the user,
 76,514 ( 0.06%)  #[derive(Copy, Clone, Debug, Eq, PartialEq, TyEncodable, TyDecodable, Default, HashStable)]
      .           pub struct ReprOptions {
      .               pub int: Option<attr::IntType>,
      .               pub align: Option<Align>,
      .               pub pack: Option<Align>,
      .               pub flags: ReprFlags,
      .               /// The seed to be used for randomizing a type's layout
      .               ///
      .               /// Note: This could technically be a `[u8; 16]` (a `u128`) which would
-- line 1705 ----------------------------------------
-- line 1706 ----------------------------------------
      .               /// be the "most accurate" hash as it'd encompass the item and crate
      .               /// hash without loss, but it does pay the price of being larger.
      .               /// Everything's a tradeoff, a `u64` seed should be sufficient for our
      .               /// purposes (primarily `-Z randomize-layout`)
      .               pub field_shuffle_seed: u64,
      .           }
      .           
      .           impl ReprOptions {
     39 ( 0.00%)      pub fn new(tcx: TyCtxt<'_>, did: DefId) -> ReprOptions {
      .                   let mut flags = ReprFlags::empty();
      .                   let mut size = None;
      .                   let mut max_align: Option<Align> = None;
      .                   let mut min_pack: Option<Align> = None;
      .           
      .                   // Generate a deterministically-derived seed from the item's path hash
      .                   // to allow for cross-crate compilation to actually work
      .                   let mut field_shuffle_seed = tcx.def_path_hash(did).0.to_smaller_hash();
      .           
      .                   // If the user defined a custom seed for layout randomization, xor the item's
      .                   // path hash with the user defined seed, this will allowing determinism while
      .                   // still allowing users to further randomize layout generation for e.g. fuzzing
      9 ( 0.00%)          if let Some(user_seed) = tcx.sess.opts.debugging_opts.layout_seed {
      .                       field_shuffle_seed ^= user_seed;
      .                   }
      .           
     12 ( 0.00%)          for attr in tcx.get_attrs(did).iter() {
     10 ( 0.00%)              for r in attr::find_repr_attrs(&tcx.sess, attr) {
      .                           flags.insert(match r {
      .                               attr::ReprC => ReprFlags::IS_C,
      .                               attr::ReprPacked(pack) => {
      .                                   let pack = Align::from_bytes(pack as u64).unwrap();
      .                                   min_pack = Some(if let Some(min_pack) = min_pack {
      .                                       min_pack.min(pack)
      .                                   } else {
      .                                       pack
-- line 1740 ----------------------------------------
-- line 1753 ----------------------------------------
      .                                   ReprFlags::empty()
      .                               }
      .                           });
      .                       }
      .                   }
      .           
      .                   // If `-Z randomize-layout` was enabled for the type definition then we can
      .                   // consider performing layout randomization
     24 ( 0.00%)          if tcx.sess.opts.debugging_opts.randomize_layout {
      .                       flags.insert(ReprFlags::RANDOMIZE_LAYOUT);
      .                   }
      .           
      .                   // This is here instead of layout because the choice must make it into metadata.
     18 ( 0.00%)          if !tcx.consider_optimizing(|| format!("Reorder fields of {:?}", tcx.def_path_str(did))) {
      .                       flags.insert(ReprFlags::IS_LINEAR);
      .                   }
      .           
      6 ( 0.00%)          Self { int: size, align: max_align, pack: min_pack, flags, field_shuffle_seed }
     84 ( 0.00%)      }
      .           
      .               #[inline]
      .               pub fn simd(&self) -> bool {
      .                   self.flags.contains(ReprFlags::IS_SIMD)
      .               }
      .           
      .               #[inline]
      .               pub fn c(&self) -> bool {
-- line 1779 ----------------------------------------
-- line 1798 ----------------------------------------
      .               #[inline]
      .               pub fn hide_niche(&self) -> bool {
      .                   self.flags.contains(ReprFlags::HIDE_NICHE)
      .               }
      .           
      .               /// Returns the discriminant type, given these `repr` options.
      .               /// This must only be called on enums!
      .               pub fn discr_type(&self) -> attr::IntType {
     15 ( 0.00%)          self.int.unwrap_or(attr::SignedInt(ast::IntTy::Isize))
      9 ( 0.00%)      }
      .           
      .               /// Returns `true` if this `#[repr()]` should inhabit "smart enum
      .               /// layout" optimizations, such as representing `Foo<&T>` as a
      .               /// single pointer.
      .               pub fn inhibit_enum_layout_opt(&self) -> bool {
      .                   self.c() || self.int.is_some()
      .               }
      .           
-- line 1815 ----------------------------------------
-- line 1836 ----------------------------------------
      .               pub fn inhibit_union_abi_opt(&self) -> bool {
      .                   self.c()
      .               }
      .           }
      .           
      .           impl<'tcx> FieldDef {
      .               /// Returns the type of this field. The resulting type is not normalized. The `subst` is
      .               /// typically obtained via the second field of [`TyKind::Adt`].
  1,526 ( 0.00%)      pub fn ty(&self, tcx: TyCtxt<'tcx>, subst: SubstsRef<'tcx>) -> Ty<'tcx> {
    436 ( 0.00%)          tcx.type_of(self.did).subst(tcx, subst)
  1,744 ( 0.00%)      }
      .           
      .               /// Computes the `Ident` of this variant by looking up the `Span`
    294 ( 0.00%)      pub fn ident(&self, tcx: TyCtxt<'_>) -> Ident {
    168 ( 0.00%)          Ident::new(self.name, tcx.def_ident_span(self.did).unwrap())
    378 ( 0.00%)      }
      .           }
      .           
      .           pub type Attributes<'tcx> = &'tcx [ast::Attribute];
      .           
      .           #[derive(Debug, PartialEq, Eq)]
      .           pub enum ImplOverlapKind {
      .               /// These impls are always allowed to overlap.
      .               Permitted {
-- line 1859 ----------------------------------------
-- line 1891 ----------------------------------------
      .               /// marker traits.
      .               /// 4. Neither of the impls can have any where-clauses.
      .               ///
      .               /// Once `traitobject` 0.1.0 is no longer an active concern, this hack can be removed.
      .               Issue33140,
      .           }
      .           
      .           impl<'tcx> TyCtxt<'tcx> {
    792 ( 0.00%)      pub fn typeck_body(self, body: hir::BodyId) -> &'tcx TypeckResults<'tcx> {
    198 ( 0.00%)          self.typeck(self.hir().body_owner_def_id(body))
    792 ( 0.00%)      }
      .           
      .               pub fn provided_trait_methods(self, id: DefId) -> impl 'tcx + Iterator<Item = &'tcx AssocItem> {
      .                   self.associated_items(id)
      .                       .in_definition_order()
      .                       .filter(|item| item.kind == AssocKind::Fn && item.defaultness.has_value())
      .               }
      .           
      .               fn item_name_from_hir(self, def_id: DefId) -> Option<Ident> {
      .                   self.hir().get_if_local(def_id).and_then(|node| node.ident())
      .               }
      .           
    297 ( 0.00%)      fn item_name_from_def_id(self, def_id: DefId) -> Option<Symbol> {
     33 ( 0.00%)          if def_id.index == CRATE_DEF_INDEX {
      .                       Some(self.crate_name(def_id.krate))
      .                   } else {
     99 ( 0.00%)              let def_key = self.def_key(def_id);
    150 ( 0.00%)              match def_key.disambiguated_data.data {
      .                           // The name of a constructor is that of its parent.
     75 ( 0.00%)                  rustc_hir::definitions::DefPathData::Ctor => self.item_name_from_def_id(DefId {
      .                               krate: def_id.krate,
      .                               index: def_key.parent.unwrap(),
      .                           }),
     36 ( 0.00%)                  _ => def_key.disambiguated_data.data.get_opt_name(),
      .                       }
      .                   }
    264 ( 0.00%)      }
      .           
      .               /// Look up the name of an item across crates. This does not look at HIR.
      .               ///
      .               /// When possible, this function should be used for cross-crate lookups over
      .               /// [`opt_item_name`] to avoid invalidating the incremental cache. If you
      .               /// need to handle items without a name, or HIR items that will not be
      .               /// serialized cross-crate, or if you need the span of the item, use
      .               /// [`opt_item_name`] instead.
      .               ///
      .               /// [`opt_item_name`]: Self::opt_item_name
    126 ( 0.00%)      pub fn item_name(self, id: DefId) -> Symbol {
      .                   // Look at cross-crate items first to avoid invalidating the incremental cache
      .                   // unless we have to.
     18 ( 0.00%)          self.item_name_from_def_id(id).unwrap_or_else(|| {
      .                       bug!("item_name: no name for {:?}", self.def_path(id));
      .                   })
     90 ( 0.00%)      }
      .           
      .               /// Look up the name and span of an item or [`Node`].
      .               ///
      .               /// See [`item_name`][Self::item_name] for more information.
      .               pub fn opt_item_name(self, def_id: DefId) -> Option<Ident> {
      .                   // Look at the HIR first so the span will be correct if this is a local item.
      .                   self.item_name_from_hir(def_id)
      .                       .or_else(|| self.item_name_from_def_id(def_id).map(Ident::with_dummy_span))
      .               }
      .           
  8,750 ( 0.01%)      pub fn opt_associated_item(self, def_id: DefId) -> Option<&'tcx AssocItem> {
  3,500 ( 0.00%)          if let DefKind::AssocConst | DefKind::AssocFn | DefKind::AssocTy = self.def_kind(def_id) {
      .                       Some(self.associated_item(def_id))
      .                   } else {
      .                       None
      .                   }
  7,875 ( 0.01%)      }
      .           
     56 ( 0.00%)      pub fn field_index(self, hir_id: hir::HirId, typeck_results: &TypeckResults<'_>) -> usize {
      .                   typeck_results.field_indices().get(hir_id).cloned().expect("no index for a field")
    112 ( 0.00%)      }
      .           
      .               pub fn find_field_index(self, ident: Ident, variant: &VariantDef) -> Option<usize> {
      .                   variant
      .                       .fields
      .                       .iter()
      .                       .position(|field| self.hygienic_eq(ident, field.ident(self), variant.def_id))
      .               }
      .           
-- line 1973 ----------------------------------------
-- line 2042 ----------------------------------------
      .           
      .                       debug!("impls_are_allowed_to_overlap({:?}, {:?}) = None", def_id1, def_id2);
      .                       None
      .                   }
      .               }
      .           
      .               /// Returns `ty::VariantDef` if `res` refers to a struct,
      .               /// or variant or their constructors, panics otherwise.
     35 ( 0.00%)      pub fn expect_variant_res(self, res: Res) -> &'tcx VariantDef {
     60 ( 0.00%)          match res {
      .                       Res::Def(DefKind::Variant, did) => {
      .                           let enum_did = self.parent(did).unwrap();
      .                           self.adt_def(enum_did).variant_with_id(did)
      .                       }
      .                       Res::Def(DefKind::Struct | DefKind::Union, did) => self.adt_def(did).non_enum_variant(),
      .                       Res::Def(DefKind::Ctor(CtorOf::Variant, ..), variant_ctor_did) => {
      .                           let variant_did = self.parent(variant_ctor_did).unwrap();
      .                           let enum_did = self.parent(variant_did).unwrap();
-- line 2059 ----------------------------------------
-- line 2060 ----------------------------------------
      .                           self.adt_def(enum_did).variant_with_ctor_id(variant_ctor_did)
      .                       }
      .                       Res::Def(DefKind::Ctor(CtorOf::Struct, ..), ctor_did) => {
      .                           let struct_did = self.parent(ctor_did).expect("struct ctor has no parent");
      .                           self.adt_def(struct_did).non_enum_variant()
      .                       }
      .                       _ => bug!("expect_variant_res used with unexpected res {:?}", res),
      .                   }
     40 ( 0.00%)      }
      .           
      .               /// Returns the possibly-auto-generated MIR of a `(DefId, Subst)` pair.
      .               pub fn instance_mir(self, instance: ty::InstanceDef<'tcx>) -> &'tcx Body<'tcx> {
      .                   match instance {
      .                       ty::InstanceDef::Item(def) => match self.def_kind(def.did) {
      .                           DefKind::Const
      .                           | DefKind::Static
      .                           | DefKind::AssocConst
-- line 2076 ----------------------------------------
-- line 2091 ----------------------------------------
      .                       | ty::InstanceDef::Virtual(..)
      .                       | ty::InstanceDef::ClosureOnceShim { .. }
      .                       | ty::InstanceDef::DropGlue(..)
      .                       | ty::InstanceDef::CloneShim(..) => self.mir_shims(instance),
      .                   }
      .               }
      .           
      .               /// Gets the attributes of a definition.
  5,680 ( 0.00%)      pub fn get_attrs(self, did: DefId) -> Attributes<'tcx> {
  1,704 ( 0.00%)          if let Some(did) = did.as_local() {
  1,383 ( 0.00%)              self.hir().attrs(self.hir().local_def_id_to_hir_id(did))
      .                   } else {
      .                       self.item_attrs(did)
      .                   }
  4,544 ( 0.00%)      }
      .           
      .               /// Determines whether an item is annotated with an attribute.
    580 ( 0.00%)      pub fn has_attr(self, did: DefId, attr: Symbol) -> bool {
  1,845 ( 0.00%)          self.sess.contains_name(&self.get_attrs(did), attr)
      .               }
      .           
      .               /// Determines whether an item is annotated with `doc(hidden)`.
     70 ( 0.00%)      pub fn is_doc_hidden(self, did: DefId) -> bool {
     10 ( 0.00%)          self.get_attrs(did)
      .                       .iter()
      2 ( 0.00%)              .filter_map(|attr| if attr.has_name(sym::doc) { attr.meta_item_list() } else { None })
      .                       .any(|items| items.iter().any(|item| item.has_name(sym::hidden)))
     80 ( 0.00%)      }
      .           
      .               /// Returns `true` if this is an `auto trait`.
    504 ( 0.00%)      pub fn trait_is_auto(self, trait_def_id: DefId) -> bool {
     72 ( 0.00%)          self.trait_def(trait_def_id).has_auto_impl
    576 ( 0.00%)      }
      .           
      .               /// Returns layout of a generator. Layout might be unavailable if the
      .               /// generator is tainted by errors.
      .               pub fn generator_layout(self, def_id: DefId) -> Option<&'tcx GeneratorLayout<'tcx>> {
      .                   self.optimized_mir(def_id).generator_layout()
      .               }
      .           
      .               /// Given the `DefId` of an impl, returns the `DefId` of the trait it implements.
      .               /// If it implements no trait, returns `None`.
    126 ( 0.00%)      pub fn trait_id_of_impl(self, def_id: DefId) -> Option<DefId> {
      .                   self.impl_trait_ref(def_id).map(|tr| tr.def_id)
    162 ( 0.00%)      }
      .           
      .               /// If the given defid describes a method belonging to an impl, returns the
      .               /// `DefId` of the impl that the method belongs to; otherwise, returns `None`.
     16 ( 0.00%)      pub fn impl_of_method(self, def_id: DefId) -> Option<DefId> {
     64 ( 0.00%)          self.opt_associated_item(def_id).and_then(|trait_item| match trait_item.container {
      .                       TraitContainer(_) => None,
      .                       ImplContainer(def_id) => Some(def_id),
      .                   })
     32 ( 0.00%)      }
      .           
      .               /// Looks up the span of `impl_did` if the impl is local; otherwise returns `Err`
      .               /// with the name of the crate containing the impl.
      .               pub fn span_of_impl(self, impl_did: DefId) -> Result<Span, Symbol> {
      .                   if let Some(impl_did) = impl_did.as_local() {
      .                       Ok(self.def_span(impl_did))
      .                   } else {
      .                       Err(self.crate_name(impl_did.krate))
      .                   }
      .               }
      .           
      .               /// Hygienically compares a use-site name (`use_name`) for a field or an associated item with
      .               /// its supposed definition name (`def_name`). The method also needs `DefId` of the supposed
      .               /// definition's parent/scope to perform comparison.
    384 ( 0.00%)      pub fn hygienic_eq(self, use_name: Ident, def_name: Ident, def_parent_def_id: DefId) -> bool {
      .                   // We could use `Ident::eq` here, but we deliberately don't. The name
      .                   // comparison fails frequently, and we want to avoid the expensive
      .                   // `normalize_to_macros_2_0()` calls required for the span comparison whenever possible.
     48 ( 0.00%)          use_name.name == def_name.name
    144 ( 0.00%)              && use_name
      .                           .span
      .                           .ctxt()
      .                           .hygienic_eq(def_name.span.ctxt(), self.expn_that_defined(def_parent_def_id))
    384 ( 0.00%)      }
      .           
     63 ( 0.00%)      pub fn adjust_ident(self, mut ident: Ident, scope: DefId) -> Ident {
     14 ( 0.00%)          ident.span.normalize_to_macros_2_0_and_adjust(self.expn_that_defined(scope));
     14 ( 0.00%)          ident
     56 ( 0.00%)      }
      .           
    621 ( 0.00%)      pub fn adjust_ident_and_get_scope(
      .                   self,
      .                   mut ident: Ident,
      .                   scope: DefId,
      .                   block: hir::HirId,
      .               ) -> (Ident, DefId) {
     69 ( 0.00%)          let scope = ident
      .                       .span
      .                       .normalize_to_macros_2_0_and_adjust(self.expn_that_defined(scope))
      .                       .and_then(|actual_expansion| actual_expansion.expn_data().parent_module)
    276 ( 0.00%)              .unwrap_or_else(|| self.parent_module(block).to_def_id());
    414 ( 0.00%)          (ident, scope)
    621 ( 0.00%)      }
      .           
      .               pub fn is_object_safe(self, key: DefId) -> bool {
      .                   self.object_safety_violations(key).is_empty()
      .               }
      .           }
      .           
      .           /// Yields the parent function's `LocalDefId` if `def_id` is an `impl Trait` definition.
    216 ( 0.00%)  pub fn is_impl_trait_defn(tcx: TyCtxt<'_>, def_id: DefId) -> Option<LocalDefId> {
    216 ( 0.00%)      let def_id = def_id.as_local()?;
    172 ( 0.00%)      if let Node::Item(item) = tcx.hir().get_by_def_id(def_id) {
     60 ( 0.00%)          if let hir::ItemKind::OpaqueTy(ref opaque_ty) = item.kind {
      .                       return match opaque_ty.origin {
      .                           hir::OpaqueTyOrigin::FnReturn(parent) | hir::OpaqueTyOrigin::AsyncFn(parent) => {
      .                               Some(parent)
      .                           }
      .                           hir::OpaqueTyOrigin::TyAlias => None,
      .                       };
      .                   }
      .               }
      .               None
    288 ( 0.00%)  }
      .           
      .           pub fn int_ty(ity: ast::IntTy) -> IntTy {
      .               match ity {
      .                   ast::IntTy::Isize => IntTy::Isize,
      .                   ast::IntTy::I8 => IntTy::I8,
      .                   ast::IntTy::I16 => IntTy::I16,
      .                   ast::IntTy::I32 => IntTy::I32,
      .                   ast::IntTy::I64 => IntTy::I64,
-- line 2216 ----------------------------------------
-- line 2231 ----------------------------------------
      .           
      .           pub fn float_ty(fty: ast::FloatTy) -> FloatTy {
      .               match fty {
      .                   ast::FloatTy::F32 => FloatTy::F32,
      .                   ast::FloatTy::F64 => FloatTy::F64,
      .               }
      .           }
      .           
      6 ( 0.00%)  pub fn ast_int_ty(ity: IntTy) -> ast::IntTy {
      .               match ity {
      .                   IntTy::Isize => ast::IntTy::Isize,
      .                   IntTy::I8 => ast::IntTy::I8,
      .                   IntTy::I16 => ast::IntTy::I16,
      .                   IntTy::I32 => ast::IntTy::I32,
      .                   IntTy::I64 => ast::IntTy::I64,
      .                   IntTy::I128 => ast::IntTy::I128,
      .               }
      6 ( 0.00%)  }
      .           
      .           pub fn ast_uint_ty(uty: UintTy) -> ast::UintTy {
      .               match uty {
      .                   UintTy::Usize => ast::UintTy::Usize,
      .                   UintTy::U8 => ast::UintTy::U8,
      .                   UintTy::U16 => ast::UintTy::U16,
      .                   UintTy::U32 => ast::UintTy::U32,
      .                   UintTy::U64 => ast::UintTy::U64,
-- line 2256 ----------------------------------------
-- line 2262 ----------------------------------------
      .               closure::provide(providers);
      .               context::provide(providers);
      .               erase_regions::provide(providers);
      .               layout::provide(providers);
      .               util::provide(providers);
      .               print::provide(providers);
      .               super::util::bug::provide(providers);
      .               super::middle::provide(providers);
      8 ( 0.00%)      *providers = ty::query::Providers {
      .                   trait_impls_of: trait_def::trait_impls_of_provider,
      .                   type_uninhabited_from: inhabitedness::type_uninhabited_from,
      .                   const_param_default: consts::const_param_default,
      .                   vtable_allocation: vtable::vtable_allocation_provider,
      .                   ..*providers
      .               };
      1 ( 0.00%)  }
      .           
      .           /// A map for the local crate mapping each type to a vector of its
      .           /// inherent impls. This is not meant to be used outside of coherence;
      .           /// rather, you should request the vector for a specific type via
      .           /// `tcx.inherent_impls(def_id)` so as to minimize your dependencies
      .           /// (constructing this map requires touching the entire crate).
      .           #[derive(Clone, Debug, Default, HashStable)]
      .           pub struct CrateInherentImpls {
-- line 2285 ----------------------------------------
-- line 2288 ----------------------------------------
      .           
      .           #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, HashStable)]
      .           pub struct SymbolName<'tcx> {
      .               /// `&str` gives a consistent ordering, which ensures reproducible builds.
      .               pub name: &'tcx str,
      .           }
      .           
      .           impl<'tcx> SymbolName<'tcx> {
      6 ( 0.00%)      pub fn new(tcx: TyCtxt<'tcx>, name: &str) -> SymbolName<'tcx> {
      .                   SymbolName {
      .                       name: unsafe { str::from_utf8_unchecked(tcx.arena.alloc_slice(name.as_bytes())) },
      .                   }
      8 ( 0.00%)      }
      .           }
      .           
      .           impl<'tcx> fmt::Display for SymbolName<'tcx> {
      .               fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {
      .                   fmt::Display::fmt(&self.name, fmt)
      .               }
      .           }
      .           
-- line 2308 ----------------------------------------

 66,650 ( 0.05%)  <counts for unidentified lines in /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/mod.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_metadata/src/rmeta/decoder.rs
--------------------------------------------------------------------------------
Ir               

-- line 176 ----------------------------------------
      .               }
      .               fn sess(self) -> Option<&'tcx Session> {
      .                   None
      .               }
      .               fn tcx(self) -> Option<TyCtxt<'tcx>> {
      .                   None
      .               }
      .           
  4,689 ( 0.00%)      fn decoder(self, pos: usize) -> DecodeContext<'a, 'tcx> {
  1,563 ( 0.00%)          let tcx = self.tcx();
184,568 ( 0.15%)          DecodeContext {
 19,427 ( 0.02%)              opaque: opaque::Decoder::new(self.blob(), pos),
  1,563 ( 0.00%)              cdata: self.cdata(),
      .                       blob: self.blob(),
  8,616 ( 0.01%)              sess: self.sess().or(tcx.map(|tcx| tcx.sess)),
      .                       tcx,
      .                       last_source_file_index: 0,
      .                       lazy_state: LazyState::NoNode,
      .                       alloc_decoding_session: self
      .                           .cdata()
 16,697 ( 0.01%)                  .map(|cdata| cdata.cdata.alloc_decoding_state.new_decoding_session()),
      .                   }
  4,689 ( 0.00%)      }
      .           }
      .           
      .           impl<'a, 'tcx> Metadata<'a, 'tcx> for &'a MetadataBlob {
      .               #[inline]
      .               fn blob(self) -> &'a MetadataBlob {
      .                   self
      .               }
      .           }
-- line 206 ----------------------------------------
-- line 255 ----------------------------------------
      .               }
      .               #[inline]
      .               fn tcx(self) -> Option<TyCtxt<'tcx>> {
      .                   Some(self.1)
      .               }
      .           }
      .           
      .           impl<'a, 'tcx, T: Decodable<DecodeContext<'a, 'tcx>>> Lazy<T> {
 31,454 ( 0.03%)      fn decode<M: Metadata<'a, 'tcx>>(self, metadata: M) -> T {
 19,194 ( 0.02%)          let mut dcx = metadata.decoder(self.position.get());
 52,224 ( 0.04%)          dcx.lazy_state = LazyState::NodeStart(self.position);
 15,521 ( 0.01%)          T::decode(&mut dcx)
 40,108 ( 0.03%)      }
      .           }
      .           
      .           impl<'a: 'x, 'tcx: 'x, 'x, T: Decodable<DecodeContext<'a, 'tcx>>> Lazy<[T]> {
      .               fn decode<M: Metadata<'a, 'tcx>>(
      .                   self,
      .                   metadata: M,
      .               ) -> impl ExactSizeIterator<Item = T> + Captures<'a> + Captures<'tcx> + 'x {
     21 ( 0.00%)          let mut dcx = metadata.decoder(self.position.get());
      6 ( 0.00%)          dcx.lazy_state = LazyState::NodeStart(self.position);
  8,710 ( 0.01%)          (0..self.meta).map(move |_| T::decode(&mut dcx))
      .               }
      .           }
      .           
      .           impl<'a, 'tcx> DecodeContext<'a, 'tcx> {
      .               #[inline]
      .               fn tcx(&self) -> TyCtxt<'tcx> {
      .                   debug_assert!(self.tcx.is_some(), "missing TyCtxt in DecodeContext");
      .                   self.tcx.unwrap()
-- line 285 ----------------------------------------
-- line 292 ----------------------------------------
      .           
      .               #[inline]
      .               pub fn cdata(&self) -> CrateMetadataRef<'a> {
      .                   debug_assert!(self.cdata.is_some(), "missing CrateMetadata in DecodeContext");
      .                   self.cdata.unwrap()
      .               }
      .           
      .               fn map_encoded_cnum_to_current(&self, cnum: CrateNum) -> CrateNum {
 73,688 ( 0.06%)          if cnum == LOCAL_CRATE { self.cdata().cnum } else { self.cdata().cnum_map[cnum] }
      .               }
      .           
 26,806 ( 0.02%)      fn read_lazy_with_meta<T: ?Sized + LazyMeta>(&mut self, meta: T::Meta) -> Lazy<T> {
      .                   let distance = self.read_usize();
 25,892 ( 0.02%)          let position = match self.lazy_state {
      .                       LazyState::NoNode => bug!("read_lazy_with_meta: outside of a metadata node"),
  3,899 ( 0.00%)              LazyState::NodeStart(start) => {
      .                           let start = start.get();
  7,798 ( 0.01%)                  assert!(distance <= start);
      .                           start - distance
      .                       }
  8,517 ( 0.01%)              LazyState::Previous(last_pos) => last_pos.get() + distance,
      .                   };
 13,476 ( 0.01%)          self.lazy_state = LazyState::Previous(NonZeroUsize::new(position).unwrap());
      .                   Lazy::from_position_and_meta(NonZeroUsize::new(position).unwrap(), meta)
 26,806 ( 0.02%)      }
      .           
      .               #[inline]
      .               pub fn read_raw_bytes(&mut self, len: usize) -> &'a [u8] {
      .                   self.opaque.read_raw_bytes(len)
      .               }
      .           }
      .           
      .           impl<'a, 'tcx> TyDecoder<'tcx> for DecodeContext<'a, 'tcx> {
-- line 324 ----------------------------------------
-- line 326 ----------------------------------------
      .           
      .               #[inline]
      .               fn tcx(&self) -> TyCtxt<'tcx> {
      .                   self.tcx.expect("missing TyCtxt in DecodeContext")
      .               }
      .           
      .               #[inline]
      .               fn peek_byte(&self) -> u8 {
 44,335 ( 0.04%)          self.opaque.data[self.opaque.position()]
      .               }
      .           
      .               #[inline]
      .               fn position(&self) -> usize {
      .                   self.opaque.position()
      .               }
      .           
 42,861 ( 0.03%)      fn cached_ty_for_shorthand<F>(&mut self, shorthand: usize, or_insert_with: F) -> Ty<'tcx>
      .               where
      .                   F: FnOnce(&mut Self) -> Ty<'tcx>,
      .               {
  6,123 ( 0.00%)          let tcx = self.tcx();
      .           
  6,123 ( 0.00%)          let key = ty::CReaderCacheKey { cnum: Some(self.cdata().cnum), pos: shorthand };
      .           
 16,060 ( 0.01%)          if let Some(&ty) = tcx.ty_rcache.borrow().get(&key) {
      .                       return ty;
      .                   }
      .           
  2,108 ( 0.00%)          let ty = or_insert_with(self);
      .                   tcx.ty_rcache.borrow_mut().insert(key, ty);
      .                   ty
 55,107 ( 0.04%)      }
      .           
      .               fn with_position<F, R>(&mut self, pos: usize, f: F) -> R
      .               where
      .                   F: FnOnce(&mut Self) -> R,
      .               {
      .                   let new_opaque = opaque::Decoder::new(self.opaque.data, pos);
      .                   let old_opaque = mem::replace(&mut self.opaque, new_opaque);
      .                   let old_state = mem::replace(&mut self.lazy_state, LazyState::NoNode);
      .                   let r = f(self);
 10,700 ( 0.01%)          self.opaque = old_opaque;
  2,140 ( 0.00%)          self.lazy_state = old_state;
      .                   r
      .               }
      .           
      .               fn decode_alloc_id(&mut self) -> rustc_middle::mir::interpret::AllocId {
      .                   if let Some(alloc_decoding_session) = self.alloc_decoding_session {
      .                       alloc_decoding_session.decode_alloc_id(self)
      .                   } else {
      .                       bug!("Attempting to decode interpret::AllocId without CrateMetadata")
      .                   }
      .               }
      .           }
      .           
      .           impl<'a, 'tcx> Decodable<DecodeContext<'a, 'tcx>> for CrateNum {
      .               fn decode(d: &mut DecodeContext<'a, 'tcx>) -> CrateNum {
 40,633 ( 0.03%)          let cnum = CrateNum::from_u32(d.read_u32());
      .                   d.map_encoded_cnum_to_current(cnum)
      .               }
      .           }
      .           
      .           impl<'a, 'tcx> Decodable<DecodeContext<'a, 'tcx>> for DefIndex {
    162 ( 0.00%)      fn decode(d: &mut DecodeContext<'a, 'tcx>) -> DefIndex {
 68,433 ( 0.06%)          DefIndex::from_u32(d.read_u32())
    324 ( 0.00%)      }
      .           }
      .           
      .           impl<'a, 'tcx> Decodable<DecodeContext<'a, 'tcx>> for ExpnIndex {
      .               fn decode(d: &mut DecodeContext<'a, 'tcx>) -> ExpnIndex {
      .                   ExpnIndex::from_u32(d.read_u32())
      .               }
      .           }
      .           
      .           impl<'a, 'tcx> Decodable<DecodeContext<'a, 'tcx>> for SyntaxContext {
 27,284 ( 0.02%)      fn decode(decoder: &mut DecodeContext<'a, 'tcx>) -> SyntaxContext {
  6,821 ( 0.01%)          let cdata = decoder.cdata();
  6,821 ( 0.01%)          let sess = decoder.sess.unwrap();
 13,642 ( 0.01%)          let cname = cdata.root.name;
      .                   rustc_span::hygiene::decode_syntax_context(decoder, &cdata.hygiene_context, |_, id| {
      .                       debug!("SpecializedDecoder<SyntaxContext>: decoding {}", id);
    180 ( 0.00%)              cdata
      .                           .root
      .                           .syntax_contexts
      .                           .get(cdata, id)
      .                           .unwrap_or_else(|| panic!("Missing SyntaxContext {:?} for crate {:?}", id, cname))
      .                           .decode((cdata, sess))
      .                   })
 34,105 ( 0.03%)      }
      .           }
      .           
      .           impl<'a, 'tcx> Decodable<DecodeContext<'a, 'tcx>> for ExpnId {
  2,975 ( 0.00%)      fn decode(decoder: &mut DecodeContext<'a, 'tcx>) -> ExpnId {
    425 ( 0.00%)          let local_cdata = decoder.cdata();
    425 ( 0.00%)          let sess = decoder.sess.unwrap();
      .           
      .                   let cnum = CrateNum::decode(decoder);
      .                   let index = u32::decode(decoder);
      .           
      .                   let expn_id = rustc_span::hygiene::decode_expn_id(cnum, index, |expn_id| {
      .                       let ExpnId { krate: cnum, local_id: index } = expn_id;
      .                       // Lookup local `ExpnData`s in our own crate data. Foreign `ExpnData`s
      .                       // are stored in the owning crate, to avoid duplication.
      .                       debug_assert_ne!(cnum, LOCAL_CRATE);
     60 ( 0.00%)              let crate_data = if cnum == local_cdata.cnum {
      .                           local_cdata
      .                       } else {
      .                           local_cdata.cstore.get_crate_data(cnum)
      .                       };
    300 ( 0.00%)              let expn_data = crate_data
      .                           .root
      .                           .expn_data
      .                           .get(crate_data, index)
      .                           .unwrap()
      .                           .decode((crate_data, sess));
    300 ( 0.00%)              let expn_hash = crate_data
      .                           .root
      .                           .expn_hashes
      .                           .get(crate_data, index)
      .                           .unwrap()
      .                           .decode((crate_data, sess));
    600 ( 0.00%)              (expn_data, expn_hash)
      .                   });
      .                   expn_id
  3,400 ( 0.00%)      }
      .           }
      .           
      .           impl<'a, 'tcx> Decodable<DecodeContext<'a, 'tcx>> for Span {
 53,488 ( 0.04%)      fn decode(decoder: &mut DecodeContext<'a, 'tcx>) -> Span {
  6,686 ( 0.01%)          let ctxt = SyntaxContext::decode(decoder);
      .                   let tag = u8::decode(decoder);
      .           
 13,372 ( 0.01%)          if tag == TAG_PARTIAL_SPAN {
      .                       return DUMMY_SP.with_ctxt(ctxt);
      .                   }
      .           
      .                   debug_assert!(tag == TAG_VALID_SPAN_LOCAL || tag == TAG_VALID_SPAN_FOREIGN);
      .           
      .                   let lo = BytePos::decode(decoder);
      .                   let len = BytePos::decode(decoder);
      .                   let hi = lo + len;
      .           
 20,058 ( 0.02%)          let Some(sess) = decoder.sess else {
      .                       bug!("Cannot decode Span without Session.")
      .                   };
      .           
      .                   // There are two possibilities here:
      .                   // 1. This is a 'local span', which is located inside a `SourceFile`
      .                   // that came from this crate. In this case, we use the source map data
      .                   // encoded in this crate. This branch should be taken nearly all of the time.
      .                   // 2. This is a 'foreign span', which is located inside a `SourceFile`
-- line 476 ----------------------------------------
-- line 492 ----------------------------------------
      .                   // a transitive dependency.
      .                   //
      .                   // When we encode a foreign span, we adjust its 'lo' and 'high' values
      .                   // to be based on the *foreign* crate (e.g. crate C), not the crate
      .                   // we are writing metadata for (e.g. crate B). This allows us to
      .                   // treat the 'local' and 'foreign' cases almost identically during deserialization:
      .                   // we can call `imported_source_files` for the proper crate, and binary search
      .                   // through the returned slice using our span.
 15,398 ( 0.01%)          let imported_source_files = if tag == TAG_VALID_SPAN_LOCAL {
      .                       decoder.cdata().imported_source_files(sess)
      .                   } else {
      .                       // When we encode a proc-macro crate, all `Span`s should be encoded
      .                       // with `TAG_VALID_SPAN_LOCAL`
      9 ( 0.00%)              if decoder.cdata().root.is_proc_macro_crate() {
      .                           // Decode `CrateNum` as u32 - using `CrateNum::decode` will ICE
      .                           // since we don't have `cnum_map` populated.
      .                           let cnum = u32::decode(decoder);
      .                           panic!(
      .                               "Decoding of crate {:?} tried to access proc-macro dep {:?}",
      .                               decoder.cdata().root.name,
      .                               cnum
      .                           );
-- line 513 ----------------------------------------
-- line 518 ----------------------------------------
      .                           "SpecializedDecoder<Span>::specialized_decode: loading source files from cnum {:?}",
      .                           cnum
      .                       );
      .           
      .                       // Decoding 'foreign' spans should be rare enough that it's
      .                       // not worth it to maintain a per-CrateNum cache for `last_source_file_index`.
      .                       // We just set it to 0, to ensure that we don't try to access something out
      .                       // of bounds for our initial 'guess'
     18 ( 0.00%)              decoder.last_source_file_index = 0;
      .           
      9 ( 0.00%)              let foreign_data = decoder.cdata().cstore.get_crate_data(cnum);
      .                       foreign_data.imported_source_files(sess)
      .                   };
      .           
      .                   let source_file = {
      .                       // Optimize for the case that most spans within a translated item
      .                       // originate from the same source_file.
 20,058 ( 0.02%)              let last_source_file = &imported_source_files[decoder.last_source_file_index];
      .           
 26,642 ( 0.02%)              if lo >= last_source_file.original_start_pos && lo <= last_source_file.original_end_pos
      .                       {
      .                           last_source_file
      .                       } else {
      .                           let index = imported_source_files
      .                               .binary_search_by_key(&lo, |source_file| source_file.original_start_pos)
  4,050 ( 0.00%)                      .unwrap_or_else(|index| index - 1);
      .           
      .                           // Don't try to cache the index for foreign spans,
      .                           // as this would require a map from CrateNums to indices
  2,026 ( 0.00%)                  if tag == TAG_VALID_SPAN_LOCAL {
  2,023 ( 0.00%)                      decoder.last_source_file_index = index;
      .                           }
  4,052 ( 0.00%)                  &imported_source_files[index]
      .                       }
      .                   };
      .           
      .                   // Make sure our binary search above is correct.
      .                   debug_assert!(
      .                       lo >= source_file.original_start_pos && lo <= source_file.original_end_pos,
      .                       "Bad binary search: lo={:?} source_file.original_start_pos={:?} source_file.original_end_pos={:?}",
      .                       lo,
-- line 558 ----------------------------------------
-- line 565 ----------------------------------------
      .                       hi >= source_file.original_start_pos && hi <= source_file.original_end_pos,
      .                       "Bad binary search: hi={:?} source_file.original_start_pos={:?} source_file.original_end_pos={:?}",
      .                       hi,
      .                       source_file.original_start_pos,
      .                       source_file.original_end_pos
      .                   );
      .           
      .                   let lo =
 26,744 ( 0.02%)              (lo + source_file.translated_source_file.start_pos) - source_file.original_start_pos;
      .                   let hi =
      .                       (hi + source_file.translated_source_file.start_pos) - source_file.original_start_pos;
      .           
      .                   // Do not try to decode parent for foreign spans.
      .                   Span::new(lo, hi, ctxt, None)
 60,174 ( 0.05%)      }
      .           }
      .           
      .           impl<'a, 'tcx> Decodable<DecodeContext<'a, 'tcx>> for &'tcx [thir::abstract_const::Node<'tcx>] {
      .               fn decode(d: &mut DecodeContext<'a, 'tcx>) -> Self {
      .                   ty::codec::RefDecodable::decode(d)
      .               }
      .           }
      .           
-- line 587 ----------------------------------------
-- line 590 ----------------------------------------
      .                   ty::codec::RefDecodable::decode(d)
      .               }
      .           }
      .           
      .           impl<'a, 'tcx, T: Decodable<DecodeContext<'a, 'tcx>>> Decodable<DecodeContext<'a, 'tcx>>
      .               for Lazy<T>
      .           {
      .               fn decode(decoder: &mut DecodeContext<'a, 'tcx>) -> Self {
  7,100 ( 0.01%)          decoder.read_lazy_with_meta(())
      .               }
      .           }
      .           
      .           impl<'a, 'tcx, T: Decodable<DecodeContext<'a, 'tcx>>> Decodable<DecodeContext<'a, 'tcx>>
      .               for Lazy<[T]>
      .           {
      .               fn decode(decoder: &mut DecodeContext<'a, 'tcx>) -> Self {
      .                   let len = decoder.read_usize();
 10,485 ( 0.01%)          if len == 0 { Lazy::empty() } else { decoder.read_lazy_with_meta(len) }
      .               }
      .           }
      .           
      .           impl<'a, 'tcx, I: Idx, T: Decodable<DecodeContext<'a, 'tcx>>> Decodable<DecodeContext<'a, 'tcx>>
      .               for Lazy<Table<I, T>>
      .           where
      .               Option<T>: FixedSizeEncoding,
      .           {
      .               fn decode(decoder: &mut DecodeContext<'a, 'tcx>) -> Self {
      .                   let len = decoder.read_usize();
  9,802 ( 0.01%)          decoder.read_lazy_with_meta(len)
      .               }
      .           }
      .           
      .           implement_ty_decoder!(DecodeContext<'a, 'tcx>);
      .           
      .           impl<'tcx> MetadataBlob {
      .               crate fn new(metadata_ref: MetadataRef) -> MetadataBlob {
      .                   MetadataBlob(Lrc::new(metadata_ref))
-- line 626 ----------------------------------------
-- line 630 ----------------------------------------
      .                   self.blob().starts_with(METADATA_HEADER)
      .               }
      .           
      .               crate fn get_rustc_version(&self) -> String {
      .                   Lazy::<String>::from_position(NonZeroUsize::new(METADATA_HEADER.len() + 4).unwrap())
      .                       .decode(self)
      .               }
      .           
    174 ( 0.00%)      crate fn get_root(&self) -> CrateRoot<'tcx> {
     58 ( 0.00%)          let slice = &self.blob()[..];
      .                   let offset = METADATA_HEADER.len();
    290 ( 0.00%)          let pos = (((slice[offset + 0] as u32) << 24)
    116 ( 0.00%)              | ((slice[offset + 1] as u32) << 16)
    232 ( 0.00%)              | ((slice[offset + 2] as u32) << 8)
    174 ( 0.00%)              | ((slice[offset + 3] as u32) << 0)) as usize;
      .                   Lazy::<CrateRoot<'tcx>>::from_position(NonZeroUsize::new(pos).unwrap()).decode(self)
    290 ( 0.00%)      }
      .           
      .               crate fn list_crate_metadata(&self, out: &mut dyn io::Write) -> io::Result<()> {
      .                   let root = self.get_root();
      .                   writeln!(out, "Crate info:")?;
      .                   writeln!(out, "name {}{}", root.name, root.extra_filename)?;
      .                   writeln!(out, "hash {} stable_crate_id {:?}", root.hash, root.stable_crate_id)?;
      .                   writeln!(out, "proc_macro {:?}", root.proc_macro_data.is_some())?;
      .                   writeln!(out, "=External Dependencies=")?;
-- line 654 ----------------------------------------
-- line 666 ----------------------------------------
      .                   }
      .                   write!(out, "\n")?;
      .                   Ok(())
      .               }
      .           }
      .           
      .           impl CrateRoot<'_> {
      .               crate fn is_proc_macro_crate(&self) -> bool {
     38 ( 0.00%)          self.proc_macro_data.is_some()
      .               }
      .           
      .               crate fn name(&self) -> Symbol {
      2 ( 0.00%)          self.name
      .               }
      .           
      .               crate fn hash(&self) -> Svh {
     19 ( 0.00%)          self.hash
      .               }
      .           
      .               crate fn stable_crate_id(&self) -> StableCrateId {
     38 ( 0.00%)          self.stable_crate_id
      .               }
      .           
      .               crate fn triple(&self) -> &TargetTriple {
      .                   &self.triple
      .               }
      .           
      .               crate fn decode_crate_deps<'a>(
      .                   &self,
      .                   metadata: &'a MetadataBlob,
      .               ) -> impl ExactSizeIterator<Item = CrateDep> + Captures<'a> {
     38 ( 0.00%)          self.crate_deps.decode(metadata)
      .               }
      .           }
      .           
      .           impl<'a, 'tcx> CrateMetadataRef<'a> {
      .               fn raw_proc_macro(self, id: DefIndex) -> &'a ProcMacro {
      .                   // DefIndex's in root.proc_macro_data have a one-to-one correspondence
      .                   // with items in 'raw_proc_macros'.
      .                   let pos = self
-- line 705 ----------------------------------------
-- line 709 ----------------------------------------
      .                       .unwrap()
      .                       .macros
      .                       .decode(self)
      .                       .position(|i| i == id)
      .                       .unwrap();
      .                   &self.raw_proc_macros.unwrap()[pos]
      .               }
      .           
 16,951 ( 0.01%)      fn opt_item_ident(self, item_index: DefIndex, sess: &Session) -> Option<Ident> {
 12,598 ( 0.01%)          let name = self.def_key(item_index).disambiguated_data.data.get_opt_name()?;
  6,769 ( 0.01%)          let span = match self.root.tables.ident_span.get(self, item_index) {
      .                       Some(lazy_span) => lazy_span.decode((self, sess)),
      .                       None => {
      .                           // FIXME: this weird case of a name with no span is specific to `extern crate`
      .                           // items, which are supposed to be treated like `use` items and only be encoded
      .                           // to metadata as `Export`s, return `None` because that's what all the callers
      .                           // expect in this case.
     54 ( 0.00%)                  assert_eq!(self.def_kind(item_index), DefKind::ExternCrate);
      .                           return None;
      .                       }
      .                   };
      .                   Some(Ident::new(name, span))
 21,682 ( 0.02%)      }
      .           
    154 ( 0.00%)      fn item_ident(self, item_index: DefIndex, sess: &Session) -> Ident {
  1,811 ( 0.00%)          self.opt_item_ident(item_index, sess).expect("no encoded ident for item")
    308 ( 0.00%)      }
      .           
      .               fn maybe_kind(self, item_id: DefIndex) -> Option<EntryKind> {
  7,320 ( 0.01%)          self.root.tables.kind.get(self, item_id).map(|k| k.decode(self))
      .               }
      .           
 29,280 ( 0.02%)      fn kind(self, item_id: DefIndex) -> EntryKind {
      .                   self.maybe_kind(item_id).unwrap_or_else(|| {
      .                       bug!(
      .                           "CrateMetadata::kind({:?}): id not found, in crate {:?} with number {}",
      .                           item_id,
      .                           self.root.name,
      .                           self.cnum,
      .                       )
      .                   })
 21,960 ( 0.02%)      }
      .           
  5,852 ( 0.00%)      fn def_kind(self, item_id: DefIndex) -> DefKind {
  3,954 ( 0.00%)          self.root.tables.def_kind.get(self, item_id).map(|k| k.decode(self)).unwrap_or_else(|| {
      .                       bug!(
      .                           "CrateMetadata::def_kind({:?}): id not found, in crate {:?} with number {}",
      .                           item_id,
      .                           self.root.name,
      .                           self.cnum,
      .                       )
      .                   })
  3,344 ( 0.00%)      }
      .           
  1,386 ( 0.00%)      fn get_span(self, index: DefIndex, sess: &Session) -> Span {
  3,080 ( 0.00%)          self.root
      .                       .tables
      .                       .span
      .                       .get(self, index)
      .                       .unwrap_or_else(|| panic!("Missing span for {:?}", index))
      .                       .decode((self, sess))
    770 ( 0.00%)      }
      .           
      .               fn load_proc_macro(self, id: DefIndex, sess: &Session) -> SyntaxExtension {
      .                   let (name, kind, helper_attrs) = match *self.raw_proc_macro(id) {
      .                       ProcMacro::CustomDerive { trait_name, attributes, client } => {
      .                           let helper_attrs =
      .                               attributes.iter().cloned().map(Symbol::intern).collect::<Vec<_>>();
      .                           (
      .                               trait_name,
-- line 778 ----------------------------------------
-- line 795 ----------------------------------------
      .                       self.get_span(id, sess),
      .                       helper_attrs,
      .                       self.root.edition,
      .                       Symbol::intern(name),
      .                       &attrs,
      .                   )
      .               }
      .           
    169 ( 0.00%)      fn get_trait_def(self, item_id: DefIndex, sess: &Session) -> ty::TraitDef {
     52 ( 0.00%)          match self.kind(item_id) {
     13 ( 0.00%)              EntryKind::Trait(data) => {
     78 ( 0.00%)                  let data = data.decode((self, sess));
    208 ( 0.00%)                  ty::TraitDef::new(
      .                               self.local_def_id(item_id),
     26 ( 0.00%)                      data.unsafety,
     26 ( 0.00%)                      data.paren_sugar,
     26 ( 0.00%)                      data.has_auto_impl,
     26 ( 0.00%)                      data.is_marker,
     13 ( 0.00%)                      data.skip_array_during_method_dispatch,
     13 ( 0.00%)                      data.specialization_kind,
     52 ( 0.00%)                      self.def_path_hash(item_id),
     13 ( 0.00%)                      data.must_implement_one_of,
      .                           )
      .                       }
      .                       EntryKind::TraitAlias => ty::TraitDef::new(
      .                           self.local_def_id(item_id),
      .                           hir::Unsafety::Normal,
      .                           false,
      .                           false,
      .                           false,
      .                           false,
      .                           ty::trait_def::TraitSpecializationKind::None,
      .                           self.def_path_hash(item_id),
      .                           None,
      .                       ),
      .                       _ => bug!("def-index does not refer to trait or trait alias"),
      .                   }
    117 ( 0.00%)      }
      .           
    405 ( 0.00%)      fn get_variant(
      .                   self,
      .                   kind: &EntryKind,
      .                   index: DefIndex,
      .                   parent_did: DefId,
      .                   sess: &Session,
      .               ) -> ty::VariantDef {
    180 ( 0.00%)          let data = match kind {
      .                       EntryKind::Variant(data) | EntryKind::Struct(data, _) | EntryKind::Union(data, _) => {
    225 ( 0.00%)                  data.decode(self)
      .                       }
      .                       _ => bug!(),
      .                   };
      .           
    156 ( 0.00%)          let adt_kind = match kind {
      .                       EntryKind::Variant(_) => ty::AdtKind::Enum,
      .                       EntryKind::Struct(..) => ty::AdtKind::Struct,
      .                       EntryKind::Union(..) => ty::AdtKind::Union,
      .                       _ => bug!(),
      .                   };
      .           
      .                   let variant_did =
      .                       if adt_kind == ty::AdtKind::Enum { Some(self.local_def_id(index)) } else { None };
     90 ( 0.00%)          let ctor_did = data.ctor.map(|index| self.local_def_id(index));
      .           
    990 ( 0.00%)          ty::VariantDef::new(
      .                       self.item_ident(index, sess).name,
      .                       variant_did,
      .                       ctor_did,
    180 ( 0.00%)              data.discr,
    270 ( 0.00%)              self.root
      .                           .tables
      .                           .children
      .                           .get(self, index)
      .                           .unwrap_or_else(Lazy::empty)
      .                           .decode(self)
      .                           .map(|index| ty::FieldDef {
     47 ( 0.00%)                      did: self.local_def_id(index),
     94 ( 0.00%)                      name: self.item_ident(index, sess).name,
     94 ( 0.00%)                      vis: self.get_visibility(index),
      .                           })
      .                           .collect(),
      .                       data.ctor_kind,
      .                       adt_kind,
      .                       parent_did,
      .                       false,
     45 ( 0.00%)              data.is_non_exhaustive,
      .                   )
    405 ( 0.00%)      }
      .           
    555 ( 0.00%)      fn get_adt_def(self, item_id: DefIndex, tcx: TyCtxt<'tcx>) -> &'tcx ty::AdtDef {
    148 ( 0.00%)          let kind = self.kind(item_id);
     74 ( 0.00%)          let did = self.local_def_id(item_id);
      .           
    177 ( 0.00%)          let (adt_kind, repr) = match kind {
      .                       EntryKind::Enum(repr) => (ty::AdtKind::Enum, repr),
      .                       EntryKind::Struct(_, repr) => (ty::AdtKind::Struct, repr),
      .                       EntryKind::Union(_, repr) => (ty::AdtKind::Union, repr),
      .                       _ => bug!("get_adt_def called on a non-ADT {:?}", did),
      .                   };
      .           
      .                   let variants = if let ty::AdtKind::Enum = adt_kind {
     20 ( 0.00%)              self.root
      .                           .tables
      .                           .children
      .                           .get(self, item_id)
      .                           .unwrap_or_else(Lazy::empty)
      .                           .decode(self)
    204 ( 0.00%)                  .map(|index| self.get_variant(&self.kind(index), index, did, tcx.sess))
      .                           .collect()
      .                   } else {
    264 ( 0.00%)              std::iter::once(self.get_variant(&kind, item_id, did, tcx.sess)).collect()
      .                   };
      .           
    538 ( 0.00%)          tcx.alloc_adt_def(did, adt_kind, variants, repr)
    259 ( 0.00%)      }
      .           
      .               fn get_explicit_predicates(
      .                   self,
      .                   item_id: DefIndex,
      .                   tcx: TyCtxt<'tcx>,
      .               ) -> ty::GenericPredicates<'tcx> {
    535 ( 0.00%)          self.root.tables.explicit_predicates.get(self, item_id).unwrap().decode((self, tcx))
      .               }
      .           
      .               fn get_inferred_outlives(
      .                   self,
      .                   item_id: DefIndex,
      .                   tcx: TyCtxt<'tcx>,
      .               ) -> &'tcx [(ty::Predicate<'tcx>, Span)] {
    535 ( 0.00%)          self.root
      .                       .tables
      .                       .inferred_outlives
      .                       .get(self, item_id)
     12 ( 0.00%)              .map(|predicates| tcx.arena.alloc_from_iter(predicates.decode((self, tcx))))
      .                       .unwrap_or_default()
      .               }
      .           
      .               fn get_super_predicates(
      .                   self,
      .                   item_id: DefIndex,
      .                   tcx: TyCtxt<'tcx>,
      .               ) -> ty::GenericPredicates<'tcx> {
     30 ( 0.00%)          self.root.tables.super_predicates.get(self, item_id).unwrap().decode((self, tcx))
      .               }
      .           
      .               fn get_explicit_item_bounds(
      .                   self,
      .                   item_id: DefIndex,
      .                   tcx: TyCtxt<'tcx>,
      .               ) -> &'tcx [(ty::Predicate<'tcx>, Span)] {
      .                   self.root
-- line 945 ----------------------------------------
-- line 946 ----------------------------------------
      .                       .tables
      .                       .explicit_item_bounds
      .                       .get(self, item_id)
      .                       .map(|bounds| tcx.arena.alloc_from_iter(bounds.decode((self, tcx))))
      .                       .unwrap_or_default()
      .               }
      .           
      .               fn get_generics(self, item_id: DefIndex, sess: &Session) -> ty::Generics {
    651 ( 0.00%)          self.root.tables.generics.get(self, item_id).unwrap().decode((self, sess))
      .               }
      .           
      .               fn get_type(self, id: DefIndex, tcx: TyCtxt<'tcx>) -> Ty<'tcx> {
  7,075 ( 0.01%)          self.root
      .                       .tables
      .                       .ty
      .                       .get(self, id)
      .                       .unwrap_or_else(|| panic!("Not a type: {:?}", id))
      .                       .decode((self, tcx))
      .               }
      .           
      .               fn get_stability(self, id: DefIndex) -> Option<attr::Stability> {
    290 ( 0.00%)          self.root.tables.stability.get(self, id).map(|stab| stab.decode(self))
      .               }
      .           
      .               fn get_const_stability(self, id: DefIndex) -> Option<attr::ConstStability> {
      5 ( 0.00%)          self.root.tables.const_stability.get(self, id).map(|stab| stab.decode(self))
      .               }
      .           
      .               fn get_deprecation(self, id: DefIndex) -> Option<attr::Deprecation> {
    265 ( 0.00%)          self.root.tables.deprecation.get(self, id).map(|depr| depr.decode(self))
      .               }
      .           
     48 ( 0.00%)      fn get_visibility(self, id: DefIndex) -> ty::Visibility {
  2,646 ( 0.00%)          self.root.tables.visibility.get(self, id).unwrap().decode(self)
     32 ( 0.00%)      }
      .           
      .               fn get_impl_data(self, id: DefIndex) -> ImplData {
 16,536 ( 0.01%)          match self.kind(id) {
 13,780 ( 0.01%)              EntryKind::Impl(data) => data.decode(self),
      .                       _ => bug!(),
      .                   }
      .               }
      .           
      .               fn get_parent_impl(self, id: DefIndex) -> Option<DefId> {
  8,169 ( 0.01%)          self.get_impl_data(id).parent_impl
      .               }
      .           
      .               fn get_impl_polarity(self, id: DefIndex) -> ty::ImplPolarity {
     26 ( 0.00%)          self.get_impl_data(id).polarity
      .               }
      .           
      .               fn get_impl_defaultness(self, id: DefIndex) -> hir::Defaultness {
      2 ( 0.00%)          self.get_impl_data(id).defaultness
      .               }
      .           
      .               fn get_impl_constness(self, id: DefIndex) -> hir::Constness {
      5 ( 0.00%)          self.get_impl_data(id).constness
      .               }
      .           
      .               fn get_trait_item_def_id(self, id: DefIndex) -> Option<DefId> {
  1,135 ( 0.00%)          self.root.tables.trait_item_def_id.get(self, id).map(|d| d.decode(self))
      .               }
      .           
      .               fn get_coerce_unsized_info(self, id: DefIndex) -> Option<ty::adjustment::CoerceUnsizedInfo> {
      .                   self.get_impl_data(id).coerce_unsized_info
      .               }
      .           
      .               fn get_impl_trait(self, id: DefIndex, tcx: TyCtxt<'tcx>) -> Option<ty::TraitRef<'tcx>> {
 32,970 ( 0.03%)          self.root.tables.impl_trait_ref.get(self, id).map(|tr| tr.decode((self, tcx)))
      .               }
      .           
      .               fn get_expn_that_defined(self, id: DefIndex, sess: &Session) -> ExpnId {
  1,600 ( 0.00%)          self.root.tables.expn_that_defined.get(self, id).unwrap().decode((self, sess))
      .               }
      .           
      .               fn get_const_param_default(
      .                   self,
      .                   tcx: TyCtxt<'tcx>,
      .                   id: DefIndex,
      .               ) -> rustc_middle::ty::Const<'tcx> {
      .                   self.root.tables.const_defaults.get(self, id).unwrap().decode((self, tcx))
-- line 1026 ----------------------------------------
-- line 1028 ----------------------------------------
      .           
      .               /// Iterates over all the stability attributes in the given crate.
      .               fn get_lib_features(self, tcx: TyCtxt<'tcx>) -> &'tcx [(Symbol, Option<Symbol>)] {
      .                   tcx.arena.alloc_from_iter(self.root.lib_features.decode(self))
      .               }
      .           
      .               /// Iterates over the language items in the given crate.
      .               fn get_lang_items(self, tcx: TyCtxt<'tcx>) -> &'tcx [(DefId, usize)] {
     57 ( 0.00%)          tcx.arena.alloc_from_iter(
     38 ( 0.00%)              self.root
      .                           .lang_items
      .                           .decode(self)
    564 ( 0.00%)                  .map(|(def_index, index)| (self.local_def_id(def_index), index)),
      .                   )
      .               }
      .           
      .               /// Iterates over the diagnostic items in the given crate.
      .               fn get_diagnostic_items(self) -> DiagnosticItems {
      .                   let mut id_to_name = FxHashMap::default();
     38 ( 0.00%)          let name_to_id = self
      .                       .root
      .                       .diagnostic_items
      .                       .decode(self)
      .                       .map(|(name, def_index)| {
    130 ( 0.00%)                  let id = self.local_def_id(def_index);
    130 ( 0.00%)                  id_to_name.insert(id, name);
      .                           (name, id)
      .                       })
      .                       .collect();
    171 ( 0.00%)          DiagnosticItems { id_to_name, name_to_id }
      .               }
      .           
      .               /// Iterates over all named children of the given module,
      .               /// including both proper items and reexports.
      .               /// Module here is understood in name resolution sense - it can be a `mod` item,
      .               /// or a crate root, or an enum, or a trait.
      .               fn for_each_module_child(
      .                   self,
      .                   id: DefIndex,
      .                   mut callback: impl FnMut(ModChild),
      .                   sess: &Session,
      .               ) {
    184 ( 0.00%)          if let Some(data) = &self.root.proc_macro_data {
      .                       // If we are loading as a proc macro, we want to return
      .                       // the view of this crate as a proc macro crate.
      .                       if id == CRATE_DEF_INDEX {
      .                           for def_index in data.macros.decode(self) {
      .                               let raw_macro = self.raw_proc_macro(def_index);
      .                               let res = Res::Def(
      .                                   DefKind::Macro(macro_kind(raw_macro)),
      .                                   self.local_def_id(def_index),
-- line 1078 ----------------------------------------
-- line 1085 ----------------------------------------
      .                                   span: ident.span,
      .                               });
      .                           }
      .                       }
      .                       return;
      .                   }
      .           
      .                   // Iterate over all children.
    368 ( 0.00%)          if let Some(children) = self.root.tables.children.get(self, id) {
    736 ( 0.00%)              for child_index in children.decode((self, sess)) {
  6,438 ( 0.01%)                  if let Some(ident) = self.opt_item_ident(child_index, sess) {
  1,398 ( 0.00%)                      let kind = self.def_kind(child_index);
    932 ( 0.00%)                      if matches!(kind, DefKind::Macro(..)) {
      .                                   // FIXME: Macros are currently encoded twice, once as items and once as
      .                                   // reexports. We ignore the items here and only use the reexports.
      .                                   continue;
      .                               }
      .                               let def_id = self.local_def_id(child_index);
      .                               let res = Res::Def(kind, def_id);
      .                               let vis = self.get_visibility(child_index);
      .                               let span = self.get_span(child_index, sess);
      .           
      .                               callback(ModChild { ident, res, vis, span });
      .           
      .                               // For non-re-export structs and variants add their constructors to children.
      .                               // Re-export lists automatically contain constructors when necessary.
  1,788 ( 0.00%)                      match kind {
      .                                   DefKind::Struct => {
     36 ( 0.00%)                              if let Some((ctor_def_id, ctor_kind)) =
      .                                           self.get_ctor_def_id_and_kind(child_index)
      .                                       {
      .                                           let ctor_res =
      .                                               Res::Def(DefKind::Ctor(CtorOf::Struct, ctor_kind), ctor_def_id);
      .                                           let vis = self.get_visibility(ctor_def_id.index);
      .                                           callback(ModChild { ident, res: ctor_res, vis, span });
      .                                       }
      .                                   }
      .                                   DefKind::Variant => {
      .                                       // Braced variants, unlike structs, generate unusable names in
      .                                       // value namespace, they are reserved for possible future use.
      .                                       // It's ok to use the variant's id as a ctor id since an
      .                                       // error will be reported on any use of such resolution anyway.
     30 ( 0.00%)                              let (ctor_def_id, ctor_kind) = self
      .                                           .get_ctor_def_id_and_kind(child_index)
      .                                           .unwrap_or((def_id, CtorKind::Fictive));
      .                                       let ctor_res =
      .                                           Res::Def(DefKind::Ctor(CtorOf::Variant, ctor_kind), ctor_def_id);
      .                                       let mut vis = self.get_visibility(ctor_def_id.index);
     10 ( 0.00%)                              if ctor_def_id == def_id && vis.is_public() {
      .                                           // For non-exhaustive variants lower the constructor visibility to
      .                                           // within the crate. We only need this for fictive constructors,
      .                                           // for other constructors correct visibilities
      .                                           // were already encoded in metadata.
      .                                           let mut attrs = self.get_item_attrs(def_id.index, sess);
      .                                           if attrs.any(|item| item.has_name(sym::non_exhaustive)) {
      .                                               let crate_def_id = self.local_def_id(CRATE_DEF_INDEX);
      .                                               vis = ty::Visibility::Restricted(crate_def_id);
-- line 1141 ----------------------------------------
-- line 1144 ----------------------------------------
      .                                       callback(ModChild { ident, res: ctor_res, vis, span });
      .                                   }
      .                                   _ => {}
      .                               }
      .                           }
      .                       }
      .                   }
      .           
    464 ( 0.00%)          match self.kind(id) {
     30 ( 0.00%)              EntryKind::Mod(exports) => {
    934 ( 0.00%)                  for exp in exports.decode((self, sess)) {
      .                               callback(exp);
      .                           }
      .                       }
      .                       EntryKind::Enum(..) | EntryKind::Trait(..) => {}
      .                       _ => bug!("`for_each_module_child` is called on a non-module: {:?}", self.def_kind(id)),
      .                   }
      .               }
      .           
-- line 1162 ----------------------------------------
-- line 1164 ----------------------------------------
      .                   self.root.tables.mir_for_ctfe.get(self, id).is_some()
      .               }
      .           
      .               fn is_item_mir_available(self, id: DefIndex) -> bool {
      .                   self.root.tables.mir.get(self, id).is_some()
      .               }
      .           
      .               fn module_expansion(self, id: DefIndex, sess: &Session) -> ExpnId {
  2,135 ( 0.00%)          match self.kind(id) {
      .                       EntryKind::Mod(_) | EntryKind::Enum(_) | EntryKind::Trait(_) => {
      .                           self.get_expn_that_defined(id, sess)
      .                       }
      .                       _ => panic!("Expected module, found {:?}", self.local_def_id(id)),
      .                   }
      .               }
      .           
      .               fn get_optimized_mir(self, tcx: TyCtxt<'tcx>, id: DefIndex) -> Body<'tcx> {
-- line 1180 ----------------------------------------
-- line 1242 ----------------------------------------
      .                           qualif,
      .                           _,
      .                       ) => qualif,
      .                       _ => bug!("mir_const_qualif: unexpected kind"),
      .                   }
      .               }
      .           
      .               fn get_fn_has_self_parameter(self, id: DefIndex) -> bool {
    560 ( 0.00%)          match self.kind(id) {
    448 ( 0.00%)              EntryKind::AssocFn(data) => data.decode(self).has_self,
      .                       _ => false,
      .                   }
      .               }
      .           
      .               fn get_associated_item_def_ids(self, tcx: TyCtxt<'tcx>, id: DefIndex) -> &'tcx [DefId] {
    308 ( 0.00%)          if let Some(children) = self.root.tables.children.get(self, id) {
    132 ( 0.00%)              tcx.arena.alloc_from_iter(
     44 ( 0.00%)                  children.decode((self, tcx.sess)).map(|child_index| self.local_def_id(child_index)),
      .                       )
      .                   } else {
      .                       &[]
      .                   }
      .               }
      .           
  2,592 ( 0.00%)      fn get_associated_item(self, id: DefIndex, sess: &Session) -> ty::AssocItem {
  1,512 ( 0.00%)          let def_key = self.def_key(id);
      .                   let parent = self.local_def_id(def_key.parent.unwrap());
      .                   let ident = self.item_ident(id, sess);
      .           
  1,548 ( 0.00%)          let (kind, container, has_self) = match self.kind(id) {
     24 ( 0.00%)              EntryKind::AssocConst(container, _, _) => (ty::AssocKind::Const, container, false),
    204 ( 0.00%)              EntryKind::AssocFn(data) => {
      .                           let data = data.decode(self);
  1,428 ( 0.00%)                  (ty::AssocKind::Fn, data.container, data.has_self)
      .                       }
     12 ( 0.00%)              EntryKind::AssocType(container) => (ty::AssocKind::Type, container, false),
      .                       _ => bug!("cannot get associated-item of `{:?}`", def_key),
      .                   };
      .           
  3,888 ( 0.00%)          ty::AssocItem {
      .                       name: ident.name,
      .                       kind,
      .                       vis: self.get_visibility(id),
      .                       defaultness: container.defaultness(),
      .                       def_id: self.local_def_id(id),
      .                       trait_item_def_id: self.get_trait_item_def_id(id),
      .                       container: container.with_def_id(parent),
      .                       fn_has_self_parameter: has_self,
      .                   }
  1,944 ( 0.00%)      }
      .           
      .               fn get_item_variances(self, id: DefIndex) -> impl Iterator<Item = ty::Variance> + 'a {
    105 ( 0.00%)          self.root.tables.variances.get(self, id).unwrap_or_else(Lazy::empty).decode(self)
      .               }
      .           
      .               fn get_ctor_def_id_and_kind(self, node_id: DefIndex) -> Option<(DefId, CtorKind)> {
  1,047 ( 0.00%)          match self.kind(node_id) {
      .                       EntryKind::Struct(data, _) | EntryKind::Variant(data) => {
    451 ( 0.00%)                  let vdata = data.decode(self);
    247 ( 0.00%)                  vdata.ctor.map(|index| (self.local_def_id(index), vdata.ctor_kind))
      .                       }
      .                       _ => None,
      .                   }
    505 ( 0.00%)      }
      .           
    192 ( 0.00%)      fn get_item_attrs(
      .                   self,
      .                   id: DefIndex,
      .                   sess: &'a Session,
      .               ) -> impl Iterator<Item = ast::Attribute> + 'a {
    450 ( 0.00%)          self.root
      .                       .tables
      .                       .attributes
      .                       .get(self, id)
      .                       .unwrap_or_else(|| {
      .                           // Structure and variant constructors don't have any attributes encoded for them,
      .                           // but we assume that someone passing a constructor ID actually wants to look at
      .                           // the attributes on the corresponding struct or variant.
      .                           let def_key = self.def_key(id);
-- line 1320 ----------------------------------------
-- line 1322 ----------------------------------------
      .                           let parent_id = def_key.parent.expect("no parent for a constructor");
      .                           self.root
      .                               .tables
      .                               .attributes
      .                               .get(self, parent_id)
      .                               .expect("no encoded attributes for a structure or variant")
      .                       })
      .                       .decode((self, sess))
    144 ( 0.00%)      }
      .           
      .               fn get_struct_field_names(
      .                   self,
      .                   id: DefIndex,
      .                   sess: &'a Session,
      .               ) -> impl Iterator<Item = Spanned<Symbol>> + 'a {
    445 ( 0.00%)          self.root
      .                       .tables
      .                       .children
      .                       .get(self, id)
      .                       .unwrap_or_else(Lazy::empty)
      .                       .decode(self)
  1,540 ( 0.00%)              .map(move |index| respan(self.get_span(index, sess), self.item_ident(index, sess).name))
      .               }
      .           
      .               fn get_struct_field_visibilities(self, id: DefIndex) -> impl Iterator<Item = Visibility> + 'a {
     60 ( 0.00%)          self.root
      .                       .tables
      .                       .children
      .                       .get(self, id)
      .                       .unwrap_or_else(Lazy::empty)
      .                       .decode(self)
     16 ( 0.00%)              .map(move |field_index| self.get_visibility(field_index))
      .               }
      .           
      .               fn get_inherent_implementations_for_type(
      .                   self,
      .                   tcx: TyCtxt<'tcx>,
      .                   id: DefIndex,
      .               ) -> &'tcx [DefId] {
     40 ( 0.00%)          tcx.arena.alloc_from_iter(
     50 ( 0.00%)              self.root
      .                           .tables
      .                           .inherent_impls
      .                           .get(self, id)
      .                           .unwrap_or_else(Lazy::empty)
      .                           .decode(self)
    243 ( 0.00%)                  .map(|index| self.local_def_id(index)),
      .                   )
      .               }
      .           
      .               fn get_traits(self) -> impl Iterator<Item = DefId> + 'a {
      .                   self.root.traits.decode(self).map(move |index| self.local_def_id(index))
      .               }
      .           
      .               fn get_trait_impls(self) -> impl Iterator<Item = (DefId, DefId, Option<SimplifiedType>)> + 'a {
-- line 1376 ----------------------------------------
-- line 1380 ----------------------------------------
      .                           index: *trait_index,
      .                       };
      .                       impls.decode(self).map(move |(impl_index, simplified_self_ty)| {
      .                           (trait_def_id, self.local_def_id(impl_index), simplified_self_ty)
      .                       })
      .                   })
      .               }
      .           
  2,565 ( 0.00%)      fn get_implementations_of_trait(
      .                   self,
      .                   tcx: TyCtxt<'tcx>,
      .                   trait_def_id: DefId,
      .               ) -> &'tcx [(DefId, Option<SimplifiedType>)] {
    285 ( 0.00%)          if self.trait_impls.is_empty() {
      .                       return &[];
      .                   }
      .           
      .                   // Do a reverse lookup beforehand to avoid touching the crate_num
      .                   // hash map in the loop below.
    450 ( 0.00%)          let key = match self.reverse_translate_def_id(trait_def_id) {
      .                       Some(def_id) => (def_id.krate.as_u32(), def_id.index),
      .                       None => return &[],
      .                   };
      .           
      .                   if let Some(impls) = self.trait_impls.get(&key) {
    380 ( 0.00%)              tcx.arena.alloc_from_iter(
    190 ( 0.00%)                  impls
      .                               .decode(self)
  4,532 ( 0.00%)                      .map(|(idx, simplified_self_ty)| (self.local_def_id(idx), simplified_self_ty)),
      .                       )
      .                   } else {
      .                       &[]
      .                   }
  2,280 ( 0.00%)      }
      .           
      .               fn get_trait_of_item(self, id: DefIndex) -> Option<DefId> {
     72 ( 0.00%)          let def_key = self.def_key(id);
     90 ( 0.00%)          match def_key.disambiguated_data.data {
      .                       DefPathData::TypeNs(..) | DefPathData::ValueNs(..) => (),
      .                       // Not an associated item
      .                       _ => return None,
      .                   }
    162 ( 0.00%)          def_key.parent.and_then(|parent_index| match self.kind(parent_index) {
      .                       EntryKind::Trait(_) | EntryKind::TraitAlias => Some(self.local_def_id(parent_index)),
      .                       _ => None,
      .                   })
      .               }
      .           
      .               fn get_native_libraries(self, sess: &'a Session) -> impl Iterator<Item = NativeLib> + 'a {
     38 ( 0.00%)          self.root.native_libraries.decode((self, sess))
      .               }
      .           
      .               fn get_proc_macro_quoted_span(self, index: usize, sess: &Session) -> Span {
      .                   self.root
      .                       .tables
      .                       .proc_macro_quoted_spans
      .                       .get(self, index)
      .                       .unwrap_or_else(|| panic!("Missing proc macro quoted span: {:?}", index))
-- line 1437 ----------------------------------------
-- line 1450 ----------------------------------------
      .                       self.root.dylib_dependency_formats.decode(self).enumerate().flat_map(|(i, link)| {
      .                           let cnum = CrateNum::new(i + 1);
      .                           link.map(|link| (self.cnum_map[cnum], link))
      .                       }),
      .                   )
      .               }
      .           
      .               fn get_missing_lang_items(self, tcx: TyCtxt<'tcx>) -> &'tcx [lang_items::LangItem] {
     95 ( 0.00%)          tcx.arena.alloc_from_iter(self.root.lang_items_missing.decode(self))
      .               }
      .           
      .               fn get_fn_param_names(self, tcx: TyCtxt<'tcx>, id: DefIndex) -> &'tcx [Ident] {
      .                   let param_names = match self.kind(id) {
      .                       EntryKind::Fn(data) | EntryKind::ForeignFn(data) => data.decode(self).param_names,
      .                       EntryKind::AssocFn(data) => data.decode(self).fn_data.param_names,
      .                       _ => Lazy::empty(),
      .                   };
-- line 1466 ----------------------------------------
-- line 1479 ----------------------------------------
      .                       EntryKind::AnonConst(_, data)
      .                       | EntryKind::Const(_, data)
      .                       | EntryKind::AssocConst(_, _, data) => data.decode(self).0,
      .                       _ => bug!(),
      .                   }
      .               }
      .           
      .               fn get_macro(self, id: DefIndex, sess: &Session) -> MacroDef {
     36 ( 0.00%)          match self.kind(id) {
      6 ( 0.00%)              EntryKind::MacroDef(macro_def) => macro_def.decode((self, sess)),
      .                       _ => bug!(),
      .                   }
      .               }
      .           
      .               // This replicates some of the logic of the crate-local `is_const_fn_raw` query, because we
      .               // don't serialize constness for tuple variant and tuple struct constructors.
      .               fn is_const_fn_raw(self, id: DefIndex) -> bool {
     36 ( 0.00%)          let constness = match self.kind(id) {
      8 ( 0.00%)              EntryKind::AssocFn(data) => data.decode(self).fn_data.constness,
      .                       EntryKind::Fn(data) => data.decode(self).constness,
      .                       EntryKind::ForeignFn(data) => data.decode(self).constness,
      .                       EntryKind::Variant(..) | EntryKind::Struct(..) => hir::Constness::Const,
      .                       _ => hir::Constness::NotConst,
      .                   };
      .                   constness == hir::Constness::Const
      .               }
      .           
-- line 1505 ----------------------------------------
-- line 1532 ----------------------------------------
      .               fn generator_kind(self, id: DefIndex) -> Option<hir::GeneratorKind> {
      .                   match self.kind(id) {
      .                       EntryKind::Generator(data) => Some(data),
      .                       _ => None,
      .                   }
      .               }
      .           
      .               fn fn_sig(self, id: DefIndex, tcx: TyCtxt<'tcx>) -> ty::PolyFnSig<'tcx> {
    160 ( 0.00%)          self.root.tables.fn_sig.get(self, id).unwrap().decode((self, tcx))
      .               }
      .           
      .               #[inline]
 15,890 ( 0.01%)      fn def_key(self, index: DefIndex) -> DefKey {
  4,540 ( 0.00%)          *self
      .                       .def_key_cache
      .                       .lock()
      .                       .entry(index)
  7,635 ( 0.01%)              .or_insert_with(|| self.root.tables.def_keys.get(self, index).unwrap().decode(self))
 18,160 ( 0.01%)      }
      .           
      .               // Returns the path leading to the thing with this `id`.
      .               fn def_path(self, id: DefIndex) -> DefPath {
      .                   debug!("def_path(cnum={:?}, id={:?})", self.cnum, id);
      .                   DefPath::make(self.cnum, id, |parent| self.def_key(parent))
      .               }
      .           
      .               fn def_path_hash_unlocked(
      .                   self,
      .                   index: DefIndex,
      .                   def_path_hashes: &mut FxHashMap<DefIndex, DefPathHash>,
      .               ) -> DefPathHash {
    482 ( 0.00%)          *def_path_hashes.entry(index).or_insert_with(|| {
    335 ( 0.00%)              self.root.tables.def_path_hashes.get(self, index).unwrap().decode(self)
      .                   })
      .               }
      .           
      .               #[inline]
  1,687 ( 0.00%)      fn def_path_hash(self, index: DefIndex) -> DefPathHash {
      .                   let mut def_path_hashes = self.def_path_hash_cache.lock();
      .                   self.def_path_hash_unlocked(index, &mut def_path_hashes)
  1,928 ( 0.00%)      }
      .           
      .               #[inline]
      .               fn def_path_hash_to_def_index(self, hash: DefPathHash) -> DefIndex {
      .                   self.def_path_hash_map.def_path_hash_to_def_index(&hash)
      .               }
      .           
      .               fn expn_hash_to_expn_id(self, sess: &Session, index_guess: u32, hash: ExpnHash) -> ExpnId {
      .                   debug_assert_eq!(ExpnId::from_hash(hash), None);
-- line 1580 ----------------------------------------
-- line 1635 ----------------------------------------
      .               /// Proc macro crates don't currently export spans, so this function does not have
      .               /// to work for them.
      .               fn imported_source_files(self, sess: &Session) -> &'a [ImportedSourceFile] {
      .                   // Translate the virtual `/rustc/$hash` prefix back to a real directory
      .                   // that should hold actual sources, where possible.
      .                   //
      .                   // NOTE: if you update this, you might need to also update bootstrap's code for generating
      .                   // the `rust-src` component in `Src::run` in `src/bootstrap/dist.rs`.
 13,372 ( 0.01%)          let virtual_rust_source_base_dir = option_env!("CFG_VIRTUAL_RUST_SOURCE_BASE_DIR")
      .                       .map(Path::new)
      .                       .filter(|_| {
      .                           // Only spend time on further checks if we have what to translate *to*.
      .                           sess.opts.real_rust_source_base_dir.is_some()
      .                       })
      .                       .filter(|virtual_dir| {
      .                           // Don't translate away `/rustc/$hash` if we're still remapping to it,
      .                           // since that means we're still building `std`/`rustc` that need it,
      .                           // and we don't want the real path to leak into codegen/debuginfo.
      .                           !sess.opts.remap_path_prefix.iter().any(|(_from, to)| to == virtual_dir)
      .                       });
 13,372 ( 0.01%)          let try_to_translate_virtual_to_real = |name: &mut rustc_span::FileName| {
      .                       debug!(
      .                           "try_to_translate_virtual_to_real(name={:?}): \
      .                            virtual_rust_source_base_dir={:?}, real_rust_source_base_dir={:?}",
      .                           name, virtual_rust_source_base_dir, sess.opts.real_rust_source_base_dir,
      .                       );
      .           
  2,640 ( 0.00%)              if let Some(virtual_dir) = virtual_rust_source_base_dir {
      .                           if let Some(real_dir) = &sess.opts.real_rust_source_base_dir {
      .                               if let rustc_span::FileName::Real(old_name) = name {
      .                                   if let rustc_span::RealFileName::Remapped { local_path: _, virtual_name } =
      .                                       old_name
      .                                   {
      .                                       if let Ok(rest) = virtual_name.strip_prefix(virtual_dir) {
      .                                           let virtual_name = virtual_name.clone();
      .           
-- line 1670 ----------------------------------------
-- line 1709 ----------------------------------------
      .                                           *old_name = new_name;
      .                                       }
      .                                   }
      .                               }
      .                           }
      .                       }
      .                   };
      .           
 13,363 ( 0.01%)          self.cdata.source_map_import_info.get_or_init(|| {
     21 ( 0.00%)              let external_source_map = self.root.source_map.decode(self);
      .           
      .                       external_source_map
      .                           .map(|source_file_to_import| {
      .                               // We can't reuse an existing SourceFile, so allocate a new one
      .                               // containing the information we need.
      .                               let rustc_span::SourceFile {
 11,088 ( 0.01%)                          mut name,
  3,168 ( 0.00%)                          src_hash,
    528 ( 0.00%)                          start_pos,
  1,056 ( 0.00%)                          end_pos,
  2,640 ( 0.00%)                          mut lines,
  2,640 ( 0.00%)                          mut multibyte_chars,
  3,168 ( 0.00%)                          mut non_narrow_chars,
  2,640 ( 0.00%)                          mut normalized_pos,
  3,168 ( 0.00%)                          name_hash,
      .                                   ..
      .                               } = source_file_to_import;
      .           
      .                               // If this file is under $sysroot/lib/rustlib/src/ but has not been remapped
      .                               // during rust bootstrapping by `remap-debuginfo = true`, and the user
      .                               // wish to simulate that behaviour by -Z simulate-remapped-rust-src-base,
      .                               // then we change `name` to a similar state as if the rust was bootstrapped
      .                               // with `remap-debuginfo = true`.
      .                               // This is useful for testing so that tests about the effects of
      .                               // `try_to_translate_virtual_to_real` don't have to worry about how the
      .                               // compiler is bootstrapped.
  1,056 ( 0.00%)                      if let Some(virtual_dir) =
      .                                   &sess.opts.debugging_opts.simulate_remapped_rust_src_base
      .                               {
      .                                   if let Some(real_dir) = &sess.opts.real_rust_source_base_dir {
      .                                       if let rustc_span::FileName::Real(ref mut old_name) = name {
      .                                           if let rustc_span::RealFileName::LocalPath(local) = old_name {
      .                                               if let Ok(rest) = local.strip_prefix(real_dir) {
      .                                                   *old_name = rustc_span::RealFileName::Remapped {
      .                                                       local_path: None,
-- line 1753 ----------------------------------------
-- line 1767 ----------------------------------------
      .                               let source_length = (end_pos - start_pos).to_usize();
      .           
      .                               // Translate line-start positions and multibyte character
      .                               // position into frame of reference local to file.
      .                               // `SourceMap::new_imported_source_file()` will then translate those
      .                               // coordinates to their new global frame of reference when the
      .                               // offset of the SourceFile is known.
      .                               for pos in &mut lines {
706,786 ( 0.57%)                          *pos = *pos - start_pos;
      .                               }
      .                               for mbc in &mut multibyte_chars {
  1,594 ( 0.00%)                          mbc.pos = mbc.pos - start_pos;
      .                               }
      .                               for swc in &mut non_narrow_chars {
    924 ( 0.00%)                          *swc = *swc - start_pos;
      .                               }
      .                               for np in &mut normalized_pos {
      .                                   np.pos = np.pos - start_pos;
      .                               }
      .           
  9,504 ( 0.01%)                      let local_version = sess.source_map().new_imported_source_file(
  6,864 ( 0.01%)                          name,
  3,696 ( 0.00%)                          src_hash,
      .                                   name_hash,
      .                                   source_length,
  1,056 ( 0.00%)                          self.cnum,
  2,640 ( 0.00%)                          lines,
  3,168 ( 0.00%)                          multibyte_chars,
  2,640 ( 0.00%)                          non_narrow_chars,
  2,112 ( 0.00%)                          normalized_pos,
      .                                   start_pos,
      .                                   end_pos,
      .                               );
      .                               debug!(
      .                                   "CrateMetaData::imported_source_files alloc \
      .                                    source_file {:?} original (start_pos {:?} end_pos {:?}) \
      .                                    translated (start_pos {:?} end_pos {:?})",
      .                                   local_version.name,
-- line 1804 ----------------------------------------
-- line 1808 ----------------------------------------
      .                                   local_version.end_pos
      .                               );
      .           
      .                               ImportedSourceFile {
      .                                   original_start_pos: start_pos,
      .                                   original_end_pos: end_pos,
      .                                   translated_source_file: local_version,
      .                               }
  1,584 ( 0.00%)                  })
      .                           .collect()
      .                   })
      .               }
      .           }
      .           
      .           impl CrateMetadata {
    228 ( 0.00%)      crate fn new(
      .                   sess: &Session,
      .                   blob: MetadataBlob,
      .                   root: CrateRoot<'static>,
      .                   raw_proc_macros: Option<&'static [ProcMacro]>,
      .                   cnum: CrateNum,
      .                   cnum_map: CrateNumMap,
      .                   dep_kind: CrateDepKind,
      .                   source: CrateSource,
      .                   private_dep: bool,
      .                   host_hash: Option<Svh>,
      .               ) -> CrateMetadata {
     57 ( 0.00%)          let trait_impls = root
      .                       .impls
      .                       .decode((&blob, sess))
      .                       .map(|trait_impls| (trait_impls.trait_id, trait_impls.impls))
      .                       .collect();
      .                   let alloc_decoding_state =
     57 ( 0.00%)              AllocDecodingState::new(root.interpret_alloc_index.decode(&blob).collect());
      .                   let dependencies = Lock::new(cnum_map.iter().cloned().collect());
      .           
      .                   // Pre-decode the DefPathHash->DefIndex table. This is a cheap operation
      .                   // that does not copy any data. It just does some data verification.
     19 ( 0.00%)          let def_path_hash_map = root.def_path_hash_map.decode(&blob);
      .           
    437 ( 0.00%)          CrateMetadata {
     19 ( 0.00%)              blob,
     57 ( 0.00%)              root,
     76 ( 0.00%)              trait_impls,
      .                       raw_proc_macros,
      .                       source_map_import_info: OnceCell::new(),
     76 ( 0.00%)              def_path_hash_map,
      .                       expn_hash_map: Default::default(),
    133 ( 0.00%)              alloc_decoding_state,
      .                       cnum,
     76 ( 0.00%)              cnum_map,
     95 ( 0.00%)              dependencies,
      .                       dep_kind: Lock::new(dep_kind),
    228 ( 0.00%)              source,
      .                       private_dep,
      .                       host_hash,
      .                       extern_crate: Lock::new(None),
      .                       hygiene_context: Default::default(),
      .                       def_key_cache: Default::default(),
      .                       def_path_hash_cache: Default::default(),
      .                   }
    171 ( 0.00%)      }
      .           
      .               crate fn dependencies(&self) -> LockGuard<'_, Vec<CrateNum>> {
      .                   self.dependencies.borrow()
      .               }
      .           
      .               crate fn add_dependency(&self, cnum: CrateNum) {
      .                   self.dependencies.borrow_mut().push(cnum);
      .               }
      .           
      .               crate fn update_extern_crate(&self, new_extern_crate: ExternCrate) -> bool {
      .                   let mut extern_crate = self.extern_crate.borrow_mut();
      .                   let update = Some(new_extern_crate.rank()) > extern_crate.as_ref().map(ExternCrate::rank);
      .                   if update {
     95 ( 0.00%)              *extern_crate = Some(new_extern_crate);
      .                   }
      .                   update
      .               }
      .           
      .               crate fn source(&self) -> &CrateSource {
    136 ( 0.00%)          &self.source
      .               }
      .           
      .               crate fn dep_kind(&self) -> CrateDepKind {
      .                   *self.dep_kind.lock()
      .               }
      .           
      .               crate fn update_dep_kind(&self, f: impl FnOnce(CrateDepKind) -> CrateDepKind) {
    102 ( 0.00%)          self.dep_kind.with_lock(|dep_kind| *dep_kind = f(*dep_kind))
      .               }
      .           
      .               crate fn panic_strategy(&self) -> PanicStrategy {
      .                   self.root.panic_strategy
      .               }
      .           
      .               crate fn needs_panic_runtime(&self) -> bool {
      .                   self.root.needs_panic_runtime
-- line 1905 ----------------------------------------
-- line 1909 ----------------------------------------
      .                   self.root.panic_runtime
      .               }
      .           
      .               crate fn is_profiler_runtime(&self) -> bool {
      .                   self.root.profiler_runtime
      .               }
      .           
      .               crate fn needs_allocator(&self) -> bool {
      5 ( 0.00%)          self.root.needs_allocator
      .               }
      .           
      .               crate fn has_global_allocator(&self) -> bool {
      .                   self.root.has_global_allocator
      .               }
      .           
      .               crate fn has_default_lib_allocator(&self) -> bool {
      .                   self.root.has_default_lib_allocator
      .               }
      .           
      .               crate fn is_proc_macro_crate(&self) -> bool {
      .                   self.root.is_proc_macro_crate()
      .               }
      .           
      .               crate fn name(&self) -> Symbol {
     34 ( 0.00%)          self.root.name
      .               }
      .           
      .               crate fn stable_crate_id(&self) -> StableCrateId {
      .                   self.root.stable_crate_id
      .               }
      .           
      .               crate fn hash(&self) -> Svh {
      .                   self.root.hash
      .               }
      .           
      .               fn num_def_ids(&self) -> usize {
      .                   self.root.tables.def_keys.size()
      .               }
      .           
      .               fn local_def_id(&self, index: DefIndex) -> DefId {
  8,170 ( 0.01%)          DefId { krate: self.cnum, index }
      .               }
      .           
      .               // Translate a DefId from the current compilation environment to a DefId
      .               // for an external crate.
      .               fn reverse_translate_def_id(&self, did: DefId) -> Option<DefId> {
      .                   for (local, &global) in self.cnum_map.iter_enumerated() {
    964 ( 0.00%)              if global == did.krate {
      .                           return Some(DefId { krate: local, index: did.index });
      .                       }
      .                   }
      .           
      .                   None
      .               }
      .           }
      .           
-- line 1964 ----------------------------------------

208,305 ( 0.17%)  <counts for unidentified lines in /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_metadata/src/rmeta/decoder.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/sort.rs
--------------------------------------------------------------------------------
Ir              

-- line 69 ----------------------------------------
     .                           hole.dest = v.add(i);
     .                       }
     .                       // `hole` gets dropped and thus copies `tmp` into the remaining hole in `v`.
     .                   }
     .               }
     .           }
     .           
     .           /// Shifts the last element to the left until it encounters a smaller or equal element.
     3 ( 0.00%)  fn shift_tail<T, F>(v: &mut [T], is_less: &mut F)
     .           where
     .               F: FnMut(&T, &T) -> bool,
     .           {
     .               let len = v.len();
     .               // SAFETY: The unsafe operations below involves indexing without a bound check (by offsetting a
     .               // pointer) and copying memory (`ptr::copy_nonoverlapping`).
     .               //
     .               // a. Indexing:
-- line 85 ----------------------------------------
-- line 91 ----------------------------------------
     .               //  2. They cannot overlap because we obtain pointers to difference indices of the slice.
     .               //     Namely, `i` and `i+1`.
     .               //  3. If the slice is properly aligned, the elements are properly aligned.
     .               //     It is the caller's responsibility to make sure the slice is properly aligned.
     .               //
     .               // See comments below for further detail.
     .               unsafe {
     .                   // If the last two elements are out-of-order...
 9,544 ( 0.01%)          if len >= 2 && is_less(v.get_unchecked(len - 1), v.get_unchecked(len - 2)) {
     .                       // Read the last element into a stack-allocated variable. If a following comparison
     .                       // operation panics, `hole` will get dropped and automatically write the element back
     .                       // into the slice.
     .                       let tmp = mem::ManuallyDrop::new(ptr::read(v.get_unchecked(len - 1)));
     .                       let v = v.as_mut_ptr();
     .                       let mut hole = CopyOnDrop { src: &*tmp, dest: v.add(len - 2) };
     .                       ptr::copy_nonoverlapping(v.add(len - 2), v.add(len - 1), 1);
     .           
     .                       for i in (0..len - 2).rev() {
30,708 ( 0.02%)                  if !is_less(&*tmp, &*v.add(i)) {
     .                               break;
     .                           }
     .           
     .                           // Move `i`-th element one place to the right, thus shifting the hole to the left.
     .                           ptr::copy_nonoverlapping(v.add(i), v.add(i + 1), 1);
     .                           hole.dest = v.add(i);
     .                       }
     .                       // `hole` gets dropped and thus copies `tmp` into the remaining hole in `v`.
     .                   }
     .               }
     6 ( 0.00%)  }
     .           
     .           /// Partially sorts a slice by shifting several out-of-order elements around.
     .           ///
     .           /// Returns `true` if the slice is sorted at the end. This function is *O*(*n*) worst-case.
     .           #[cold]
    90 ( 0.00%)  fn partial_insertion_sort<T, F>(v: &mut [T], is_less: &mut F) -> bool
     .           where
     .               F: FnMut(&T, &T) -> bool,
     .           {
     .               // Maximum number of adjacent out-of-order pairs that will get shifted.
     .               const MAX_STEPS: usize = 5;
     .               // If the slice is shorter than this, don't shift any elements.
     .               const SHORTEST_SHIFTING: usize = 50;
     .           
-- line 134 ----------------------------------------
-- line 135 ----------------------------------------
     .               let len = v.len();
     .               let mut i = 1;
     .           
     .               for _ in 0..MAX_STEPS {
     .                   // SAFETY: We already explicitly did the bound checking with `i < len`.
     .                   // All our subsequent indexing is only in the range `0 <= index < len`
     .                   unsafe {
     .                       // Find the next pair of adjacent out-of-order elements.
   156 ( 0.00%)              while i < len && !is_less(v.get_unchecked(i), v.get_unchecked(i - 1)) {
     7 ( 0.00%)                  i += 1;
     .                       }
     .                   }
     .           
     .                   // Are we done?
    30 ( 0.00%)          if i == len {
     .                       return true;
     .                   }
     .           
     .                   // Don't shift elements on short arrays, that has a performance cost.
     .                   if len < SHORTEST_SHIFTING {
     .                       return false;
     .                   }
     .           
-- line 157 ----------------------------------------
-- line 161 ----------------------------------------
     .                   // Shift the smaller element to the left.
     .                   shift_tail(&mut v[..i], is_less);
     .                   // Shift the greater element to the right.
     .                   shift_head(&mut v[i..], is_less);
     .               }
     .           
     .               // Didn't manage to sort the slice in the limited number of steps.
     .               false
    80 ( 0.00%)  }
     .           
     .           /// Sorts a slice using insertion sort, which is *O*(*n*^2) worst-case.
     .           fn insertion_sort<T, F>(v: &mut [T], is_less: &mut F)
     .           where
     .               F: FnMut(&T, &T) -> bool,
     .           {
     .               for i in 1..v.len() {
     9 ( 0.00%)          shift_tail(&mut v[..i + 1], is_less);
     .               }
     .           }
     .           
     .           /// Sorts `v` using heapsort, which guarantees *O*(*n* \* log(*n*)) worst-case.
     .           #[cold]
     .           #[unstable(feature = "sort_internals", reason = "internal to sort module", issue = "none")]
     .           pub fn heapsort<T, F>(v: &mut [T], mut is_less: F)
     .           where
-- line 185 ----------------------------------------
-- line 264 ----------------------------------------
     .               let mut offsets_r = [MaybeUninit::<u8>::uninit(); BLOCK];
     .           
     .               // FIXME: When we get VLAs, try creating one array of length `min(v.len(), 2 * BLOCK)` rather
     .               // than two fixed-size arrays of length `BLOCK`. VLAs might be more cache-efficient.
     .           
     .               // Returns the number of elements between pointers `l` (inclusive) and `r` (exclusive).
     .               fn width<T>(l: *mut T, r: *mut T) -> usize {
     .                   assert!(mem::size_of::<T>() > 0);
 3,028 ( 0.00%)          (r as usize - l as usize) / mem::size_of::<T>()
     .               }
     .           
     .               loop {
     .                   // We are done with partitioning block-by-block when `l` and `r` get very close. Then we do
     .                   // some patch-up work in order to partition the remaining elements in between.
   687 ( 0.00%)          let is_done = width(l, r) <= 2 * BLOCK;
     .           
   230 ( 0.00%)          if is_done {
     .                       // Number of remaining elements (still not compared to the pivot).
     .                       let mut rem = width(l, r);
   830 ( 0.00%)              if start_l < end_l || start_r < end_r {
    12 ( 0.00%)                  rem -= BLOCK;
     .                       }
     .           
     .                       // Adjust block sizes so that the left and right block don't overlap, but get perfectly
     .                       // aligned to cover the whole remaining gap.
    12 ( 0.00%)              if start_l < end_l {
     .                           block_r = rem;
     .                       } else if start_r < end_r {
     .                           block_l = rem;
     .                       } else {
     .                           // There were the same number of elements to switch on both blocks during the last
     .                           // iteration, so there are no remaining elements on either block. Cover the remaining
     .                           // items with roughly equally-sized blocks.
   400 ( 0.00%)                  block_l = rem / 2;
   400 ( 0.00%)                  block_r = rem - block_l;
     .                       }
     .                       debug_assert!(block_l <= BLOCK && block_r <= BLOCK);
     .                       debug_assert!(width(l, r) == block_l + block_r);
     .                   }
     .           
   687 ( 0.00%)          if start_l == end_l {
     .                       // Trace `block_l` elements from the left side.
     .                       start_l = MaybeUninit::slice_as_mut_ptr(&mut offsets_l);
     .                       end_l = start_l;
     .                       let mut elem = l;
     .           
     .                       for i in 0..block_l {
     .                           // SAFETY: The unsafety operations below involve the usage of the `offset`.
     .                           //         According to the conditions required by the function, we satisfy them because:
-- line 312 ----------------------------------------
-- line 315 ----------------------------------------
     .                           //            Casting a `bool` will never overflow `isize`.
     .                           //         3. We have guaranteed that `block_l` will be `<= BLOCK`.
     .                           //            Plus, `end_l` was initially set to the begin pointer of `offsets_` which was declared on the stack.
     .                           //            Thus, we know that even in the worst case (all invocations of `is_less` returns false) we will only be at most 1 byte pass the end.
     .                           //        Another unsafety operation here is dereferencing `elem`.
     .                           //        However, `elem` was initially the begin pointer to the slice which is always valid.
     .                           unsafe {
     .                               // Branchless comparison.
 7,685 ( 0.01%)                      *end_l = i as u8;
 7,545 ( 0.01%)                      end_l = end_l.offset(!is_less(&*elem, pivot) as isize);
     .                               elem = elem.offset(1);
     .                           }
     .                       }
     .                   }
     .           
   460 ( 0.00%)          if start_r == end_r {
     .                       // Trace `block_r` elements from the right side.
     .                       start_r = MaybeUninit::slice_as_mut_ptr(&mut offsets_r);
     .                       end_r = start_r;
     .                       let mut elem = r;
     .           
     .                       for i in 0..block_r {
     .                           // SAFETY: The unsafety operations below involve the usage of the `offset`.
     .                           //         According to the conditions required by the function, we satisfy them because:
-- line 338 ----------------------------------------
-- line 343 ----------------------------------------
     .                           //            Plus, `end_r` was initially set to the begin pointer of `offsets_` which was declared on the stack.
     .                           //            Thus, we know that even in the worst case (all invocations of `is_less` returns true) we will only be at most 1 byte pass the end.
     .                           //        Another unsafety operation here is dereferencing `elem`.
     .                           //        However, `elem` was initially `1 * sizeof(T)` past the end and we decrement it by `1 * sizeof(T)` before accessing it.
     .                           //        Plus, `block_r` was asserted to be less than `BLOCK` and `elem` will therefore at most be pointing to the beginning of the slice.
     .                           unsafe {
     .                               // Branchless comparison.
     .                               elem = elem.offset(-1);
 7,134 ( 0.01%)                      *end_r = i as u8;
 7,089 ( 0.01%)                      end_r = end_r.offset(is_less(&*elem, pivot) as isize);
     .                           }
     .                       }
     .                   }
     .           
     .                   // Number of out-of-order elements to swap between the left and right side.
     .                   let count = cmp::min(width(start_l, end_l), width(start_r, end_r));
     .           
   460 ( 0.00%)          if count > 0 {
     .                       macro_rules! left {
     .                           () => {
     .                               l.offset(*start_l as isize)
     .                           };
     .                       }
     .                       macro_rules! right {
     .                           () => {
     .                               r.offset(-(*start_r as isize) - 1)
-- line 368 ----------------------------------------
-- line 384 ----------------------------------------
     .                       // The calls to `start_l.offset` are valid because there are at most `count-1` of them,
     .                       // plus the final one at the end of the unsafe block, where `count` is the minimum number
     .                       // of collected offsets in `offsets_l` and `offsets_r`, so there is no risk of there not
     .                       // being enough elements. The same reasoning applies to the calls to `start_r.offset`.
     .                       //
     .                       // The calls to `copy_nonoverlapping` are safe because `left!` and `right!` are guaranteed
     .                       // not to overlap, and are valid because of the reasoning above.
     .                       unsafe {
   229 ( 0.00%)                  let tmp = ptr::read(left!());
   690 ( 0.00%)                  ptr::copy_nonoverlapping(right!(), left!(), 1);
     .           
     .                           for _ in 1..count {
     .                               start_l = start_l.offset(1);
 6,086 ( 0.00%)                      ptr::copy_nonoverlapping(left!(), right!(), 1);
     .                               start_r = start_r.offset(1);
 7,392 ( 0.01%)                      ptr::copy_nonoverlapping(right!(), left!(), 1);
     .                           }
     .           
     .                           ptr::copy_nonoverlapping(&tmp, right!(), 1);
     .                           mem::forget(tmp);
     .                           start_l = start_l.offset(1);
     .                           start_r = start_r.offset(1);
     .                       }
     .                   }
     .           
   690 ( 0.00%)          if start_l == end_l {
     .                       // All out-of-order elements in the left block were moved. Move to the next block.
     .           
     .                       // block-width-guarantee
     .                       // SAFETY: if `!is_done` then the slice width is guaranteed to be at least `2*BLOCK` wide. There
     .                       // are at most `BLOCK` elements in `offsets_l` because of its size, so the `offset` operation is
     .                       // safe. Otherwise, the debug assertions in the `is_done` case guarantee that
     .                       // `width(l, r) == block_l + block_r`, namely, that the block sizes have been adjusted to account
     .                       // for the smaller number of remaining elements.
     .                       l = unsafe { l.offset(block_l as isize) };
     .                   }
     .           
   687 ( 0.00%)          if start_r == end_r {
     .                       // All out-of-order elements in the right block were moved. Move to the previous block.
     .           
     .                       // SAFETY: Same argument as [block-width-guarantee]. Either this is a full block `2*BLOCK`-wide,
     .                       // or `block_r` has been adjusted for the last handful of elements.
   354 ( 0.00%)              r = unsafe { r.offset(-(block_r as isize)) };
     .                   }
     .           
   230 ( 0.00%)          if is_done {
     .                       break;
     .                   }
     .               }
     .           
     .               // All that remains now is at most one block (either the left or the right) with out-of-order
     .               // elements that need to be moved. Such remaining elements can be simply shifted to the end
     .               // within their block.
     .           
   412 ( 0.00%)      if start_l < end_l {
     .                   // The left block remains.
     .                   // Move its remaining out-of-order elements to the far right.
     .                   debug_assert_eq!(width(l, r), block_l);
 1,484 ( 0.00%)          while start_l < end_l {
     .                       // remaining-elements-safety
     .                       // SAFETY: while the loop condition holds there are still elements in `offsets_l`, so it
     .                       // is safe to point `end_l` to the previous element.
     .                       //
     .                       // The `ptr::swap` is safe if both its arguments are valid for reads and writes:
     .                       //  - Per the debug assert above, the distance between `l` and `r` is `block_l`
     .                       //    elements, so there can be at most `block_l` remaining offsets between `start_l`
     .                       //    and `end_l`. This means `r` will be moved at most `block_l` steps back, which
     .                       //    makes the `r.offset` calls valid (at that point `l == r`).
     .                       //  - `offsets_l` contains valid offsets into `v` collected during the partitioning of
     .                       //    the last block, so the `l.offset` calls are valid.
     .                       unsafe {
     .                           end_l = end_l.offset(-1);
   761 ( 0.00%)                  ptr::swap(l.offset(*end_l as isize), r.offset(-1));
     .                           r = r.offset(-1);
     .                       }
     .                   }
     .                   width(v.as_mut_ptr(), r)
   234 ( 0.00%)      } else if start_r < end_r {
     .                   // The right block remains.
     .                   // Move its remaining out-of-order elements to the far left.
     .                   debug_assert_eq!(width(l, r), block_r);
 1,840 ( 0.00%)          while start_r < end_r {
     .                       // SAFETY: See the reasoning in [remaining-elements-safety].
     .                       unsafe {
     .                           end_r = end_r.offset(-1);
 1,538 ( 0.00%)                  ptr::swap(l, r.offset(-(*end_r as isize) - 1));
     .                           l = l.offset(1);
     .                       }
     .                   }
     .                   width(v.as_mut_ptr(), l)
     .               } else {
     .                   // Nothing else to do, we're done.
     .                   width(v.as_mut_ptr(), l)
     .               }
-- line 477 ----------------------------------------
-- line 507 ----------------------------------------
     .                   let mut r = v.len();
     .           
     .                   // SAFETY: The unsafety below involves indexing an array.
     .                   // For the first one: We already do the bounds checking here with `l < r`.
     .                   // For the second one: We initially have `l == 0` and `r == v.len()` and we checked that `l < r` at every indexing operation.
     .                   //                     From here we know that `r` must be at least `r == l` which was shown to be valid from the first one.
     .                   unsafe {
     .                       // Find the first element greater than or equal to the pivot.
 7,141 ( 0.01%)              while l < r && is_less(v.get_unchecked(l), pivot) {
 1,683 ( 0.00%)                  l += 1;
     .                       }
     .           
     .                       // Find the last element smaller that the pivot.
 8,988 ( 0.01%)              while l < r && !is_less(v.get_unchecked(r - 1), pivot) {
     .                           r -= 1;
     .                       }
     .                   }
     .           
 1,442 ( 0.00%)          (l + partition_in_blocks(&mut v[l..r], pivot, is_less), l >= r)
     .           
     .                   // `_pivot_guard` goes out of scope and writes the pivot (which is a stack-allocated
     .                   // variable) back into the slice where it originally was. This step is critical in ensuring
     .                   // safety!
     .               };
     .           
     .               // Place the pivot between the two partitions.
     .               v.swap(0, mid);
-- line 533 ----------------------------------------
-- line 592 ----------------------------------------
     .           
     .               // `_pivot_guard` goes out of scope and writes the pivot (which is a stack-allocated variable)
     .               // back into the slice where it originally was. This step is critical in ensuring safety!
     .           }
     .           
     .           /// Scatters some elements around in an attempt to break patterns that might cause imbalanced
     .           /// partitions in quicksort.
     .           #[cold]
     3 ( 0.00%)  fn break_patterns<T>(v: &mut [T]) {
     .               let len = v.len();
     .               if len >= 8 {
     .                   // Pseudorandom number generator from the "Xorshift RNGs" paper by George Marsaglia.
     .                   let mut random = len as u32;
     .                   let mut gen_u32 = || {
    54 ( 0.00%)              random ^= random << 13;
    54 ( 0.00%)              random ^= random >> 17;
    54 ( 0.00%)              random ^= random << 5;
     .                       random
     .                   };
     .                   let mut gen_usize = || {
     .                       if usize::BITS <= 32 {
     .                           gen_u32() as usize
     .                       } else {
    18 ( 0.00%)                  (((gen_u32() as u64) << 32) | (gen_u32() as u64)) as usize
     .                       }
     .                   };
     .           
     .                   // Take random numbers modulo this number.
     .                   // The number fits into `usize` because `len` is not greater than `isize::MAX`.
     .                   let modulus = len.next_power_of_two();
     .           
     .                   // Some pivot candidates will be in the nearby of this index. Let's randomize them.
     9 ( 0.00%)          let pos = len / 4 * 2;
     .           
     .                   for i in 0..3 {
     .                       // Generate a random number modulo `len`. However, in order to avoid costly operations
     .                       // we first take it modulo a power of two, and then decrease by `len` until it fits
     .                       // into the range `[0, len - 1]`.
    18 ( 0.00%)              let mut other = gen_usize() & (modulus - 1);
     .           
     .                       // `other` is guaranteed to be less than `2 * len`.
    24 ( 0.00%)              if other >= len {
     .                           other -= len;
     .                       }
     .           
     3 ( 0.00%)              v.swap(pos - 1 + i, other);
     .                   }
     .               }
     6 ( 0.00%)  }
     .           
     .           /// Chooses a pivot in `v` and returns the index and `true` if the slice is likely already sorted.
     .           ///
     .           /// Elements in `v` might be reordered in the process.
     .           fn choose_pivot<T, F>(v: &mut [T], is_less: &mut F) -> (usize, bool)
     .           where
     .               F: FnMut(&T, &T) -> bool,
     .           {
-- line 648 ----------------------------------------
-- line 650 ----------------------------------------
     .               // Shorter slices use the simple median-of-three method.
     .               const SHORTEST_MEDIAN_OF_MEDIANS: usize = 50;
     .               // Maximum number of swaps that can be performed in this function.
     .               const MAX_SWAPS: usize = 4 * 3;
     .           
     .               let len = v.len();
     .           
     .               // Three indices near which we are going to choose a pivot.
   415 ( 0.00%)      let mut a = len / 4 * 1;
   209 ( 0.00%)      let mut b = len / 4 * 2;
   209 ( 0.00%)      let mut c = len / 4 * 3;
     .           
     .               // Counts the total number of swaps we are about to perform while sorting indices.
     6 ( 0.00%)      let mut swaps = 0;
     .           
     .               if len >= 8 {
     .                   // Swaps indices so that `v[a] <= v[b]`.
     .                   // SAFETY: `len >= 8` so there are at least two elements in the neighborhoods of
     .                   // `a`, `b` and `c`. This means the three calls to `sort_adjacent` result in
     .                   // corresponding calls to `sort3` with valid 3-item neighborhoods around each
     .                   // pointer, which in turn means the calls to `sort2` are done with valid
     .                   // references. Thus the `v.get_unchecked` calls are safe, as is the `ptr::swap`
     .                   // call.
    15 ( 0.00%)          let mut sort2 = |a: &mut usize, b: &mut usize| unsafe {
 6,304 ( 0.01%)              if is_less(v.get_unchecked(*b), v.get_unchecked(*a)) {
     .                           ptr::swap(a, b);
 1,216 ( 0.00%)                  swaps += 1;
     .                       }
     .                   };
     .           
     .                   // Swaps indices so that `v[a] <= v[b] <= v[c]`.
    21 ( 0.00%)          let mut sort3 = |a: &mut usize, b: &mut usize, c: &mut usize| {
     3 ( 0.00%)              sort2(a, b);
     .                       sort2(b, c);
     .                       sort2(a, b);
    18 ( 0.00%)          };
     .           
   412 ( 0.00%)          if len >= SHORTEST_MEDIAN_OF_MEDIANS {
     .                       // Finds the median of `v[a - 1], v[a], v[a + 1]` and stores the index into `a`.
     .                       let mut sort_adjacent = |a: &mut usize| {
     .                           let tmp = *a;
   390 ( 0.00%)                  sort3(&mut (tmp - 1), a, &mut (tmp + 1));
     .                       };
     .           
     .                       // Find medians in the neighborhoods of `a`, `b`, and `c`.
     .                       sort_adjacent(&mut a);
     .                       sort_adjacent(&mut b);
     .                       sort_adjacent(&mut c);
     .                   }
     .           
     .                   // Find the median among `a`, `b`, and `c`.
    15 ( 0.00%)          sort3(&mut a, &mut b, &mut c);
     .               }
     .           
   129 ( 0.00%)      if swaps < MAX_SWAPS {
   418 ( 0.00%)          (b, swaps == 0)
     .               } else {
     .                   // The maximum number of swaps was performed. Chances are the slice is descending or mostly
     .                   // descending, so reversing will probably help sort it faster.
     .                   v.reverse();
     .                   (len - 1 - b, true)
     .               }
     .           }
     .           
     .           /// Sorts `v` recursively.
     .           ///
     .           /// If the slice had a predecessor in the original array, it is specified as `pred`.
     .           ///
     .           /// `limit` is the number of allowed imbalanced partitions before switching to `heapsort`. If zero,
     .           /// this function will immediately switch to heapsort.
 2,890 ( 0.00%)  fn recurse<'a, T, F>(mut v: &'a mut [T], is_less: &mut F, mut pred: Option<&'a T>, mut limit: u32)
     .           where
     .               F: FnMut(&T, &T) -> bool,
     .           {
     .               // Slices of up to this length get sorted using insertion sort.
     .               const MAX_INSERTION: usize = 20;
     .           
     .               // True if the last partitioning was reasonably balanced.
     .               let mut was_balanced = true;
     .               // True if the last partitioning didn't shuffle elements (the slice was already partitioned).
     .               let mut was_partitioned = true;
     .           
     .               loop {
     .                   let len = v.len();
     .           
     .                   // Very short slices get sorted using insertion sort.
 1,020 ( 0.00%)          if len <= MAX_INSERTION {
     .                       insertion_sort(v, is_less);
     .                       return;
     .                   }
     .           
     .                   // If too many bad pivot choices were made, simply fall back to heapsort in order to
     .                   // guarantee `O(n * log(n))` worst-case.
   412 ( 0.00%)          if limit == 0 {
     .                       heapsort(v, is_less);
     .                       return;
     .                   }
     .           
     .                   // If the last partitioning was imbalanced, try breaking patterns in the slice by shuffling
     .                   // some elements around. Hopefully we'll choose a better pivot this time.
   412 ( 0.00%)          if !was_balanced {
    18 ( 0.00%)              break_patterns(v);
     6 ( 0.00%)              limit -= 1;
     .                   }
     .           
     .                   // Choose a pivot and try guessing whether the slice is already sorted.
   412 ( 0.00%)          let (pivot, likely_sorted) = choose_pivot(v, is_less);
     .           
     .                   // If the last partitioning was decently balanced and didn't shuffle elements, and if pivot
     .                   // selection predicts the slice is likely already sorted...
   422 ( 0.00%)          if was_balanced && was_partitioned && likely_sorted {
     .                       // Try identifying several out-of-order elements and shifting them to correct
     .                       // positions. If the slice ends up being completely sorted, we're done.
    80 ( 0.00%)              if partial_insertion_sort(v, is_less) {
     .                           return;
     .                       }
     .                   }
     .           
     .                   // If the chosen pivot is equal to the predecessor, then it's the smallest element in the
     .                   // slice. Partition the slice into elements equal to and elements greater than the pivot.
     .                   // This case is usually hit when the slice contains many duplicate elements.
   206 ( 0.00%)          if let Some(p) = pred {
 1,086 ( 0.00%)              if !is_less(p, &v[pivot]) {
     .                           let mid = partition_equal(v, pivot, is_less);
     .           
     .                           // Continue sorting elements greater than the pivot.
     .                           v = &mut { v }[mid..];
     .                           continue;
     .                       }
     .                   }
     .           
     .                   // Partition the slice.
     .                   let (mid, was_p) = partition(v, pivot, is_less);
 1,442 ( 0.00%)          was_balanced = cmp::min(mid, len - mid) >= len / 8;
     .                   was_partitioned = was_p;
     .           
     .                   // Split the slice into `left`, `pivot`, and `right`.
     .                   let (left, right) = { v }.split_at_mut(mid);
     .                   let (pivot, right) = right.split_at_mut(1);
     .                   let pivot = &pivot[0];
     .           
     .                   // Recurse into the shorter side only in order to minimize the total number of recursive
     .                   // calls and consume less stack space. Then just continue with the longer side (this is
     .                   // akin to tail recursion).
   412 ( 0.00%)          if left.len() < right.len() {
   891 ( 0.00%)              recurse(left, is_less, pred, limit);
     .                       v = right;
     .                       pred = Some(pivot);
     .                   } else {
   642 ( 0.00%)              recurse(right, is_less, Some(pivot), limit);
     .                       v = left;
     .                   }
     .               }
 2,104 ( 0.00%)  }
     .           
     .           /// Sorts `v` using pattern-defeating quicksort, which is *O*(*n* \* log(*n*)) worst-case.
     .           pub fn quicksort<T, F>(v: &mut [T], mut is_less: F)
     .           where
     .               F: FnMut(&T, &T) -> bool,
     .           {
     .               // Sorting has no meaningful behavior on zero-sized types.
     .               if mem::size_of::<T>() == 0 {
     .                   return;
     .               }
     .           
     .               // Limit the number of imbalanced partitions to `floor(log2(len)) + 1`.
   120 ( 0.00%)      let limit = usize::BITS - v.len().leading_zeros();
     .           
   214 ( 0.00%)      recurse(v, &mut is_less, None, limit);
     .           }
     .           
     .           fn partition_at_index_loop<'a, T, F>(
     .               mut v: &'a mut [T],
     .               mut index: usize,
     .               is_less: &mut F,
     .               mut pred: Option<&'a T>,
     .           ) where
-- line 826 ----------------------------------------

14,293 ( 0.01%)  <counts for unidentified lines in /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/sort.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/mod.rs
--------------------------------------------------------------------------------
Ir              

-- line 141 ----------------------------------------
     .               /// ```
     .               /// let a = [1, 2, 3];
     .               /// assert!(!a.is_empty());
     .               /// ```
     .               #[stable(feature = "rust1", since = "1.0.0")]
     .               #[rustc_const_stable(feature = "const_slice_is_empty", since = "1.39.0")]
     .               #[inline]
     .               pub const fn is_empty(&self) -> bool {
22,027 ( 0.02%)          self.len() == 0
     .               }
     .           
     .               /// Returns the first element of the slice, or `None` if it is empty.
     .               ///
     .               /// # Examples
     .               ///
     .               /// ```
     .               /// let v = [10, 40, 30];
-- line 157 ----------------------------------------
-- line 159 ----------------------------------------
     .               ///
     .               /// let w: &[i32] = &[];
     .               /// assert_eq!(None, w.first());
     .               /// ```
     .               #[stable(feature = "rust1", since = "1.0.0")]
     .               #[rustc_const_stable(feature = "const_slice_first_last_not_mut", since = "1.56.0")]
     .               #[inline]
     .               pub const fn first(&self) -> Option<&T> {
   111 ( 0.00%)          if let [first, ..] = self { Some(first) } else { None }
     .               }
     .           
     .               /// Returns a mutable pointer to the first element of the slice, or `None` if it is empty.
     .               ///
     .               /// # Examples
     .               ///
     .               /// ```
     .               /// let x = &mut [0, 1, 2];
-- line 175 ----------------------------------------
-- line 178 ----------------------------------------
     .               ///     *first = 5;
     .               /// }
     .               /// assert_eq!(x, &[5, 1, 2]);
     .               /// ```
     .               #[stable(feature = "rust1", since = "1.0.0")]
     .               #[rustc_const_unstable(feature = "const_slice_first_last", issue = "83570")]
     .               #[inline]
     .               pub const fn first_mut(&mut self) -> Option<&mut T> {
    48 ( 0.00%)          if let [first, ..] = self { Some(first) } else { None }
     .               }
     .           
     .               /// Returns the first and all the rest of the elements of the slice, or `None` if it is empty.
     .               ///
     .               /// # Examples
     .               ///
     .               /// ```
     .               /// let x = &[0, 1, 2];
-- line 194 ----------------------------------------
-- line 237 ----------------------------------------
     .               ///     assert_eq!(last, &2);
     .               ///     assert_eq!(elements, &[0, 1]);
     .               /// }
     .               /// ```
     .               #[stable(feature = "slice_splits", since = "1.5.0")]
     .               #[rustc_const_stable(feature = "const_slice_first_last_not_mut", since = "1.56.0")]
     .               #[inline]
     .               pub const fn split_last(&self) -> Option<(&T, &[T])> {
   625 ( 0.00%)          if let [init @ .., last] = self { Some((last, init)) } else { None }
     .               }
     .           
     .               /// Returns the last and all the rest of the elements of the slice, or `None` if it is empty.
     .               ///
     .               /// # Examples
     .               ///
     .               /// ```
     .               /// let x = &mut [0, 1, 2];
-- line 253 ----------------------------------------
-- line 276 ----------------------------------------
     .               ///
     .               /// let w: &[i32] = &[];
     .               /// assert_eq!(None, w.last());
     .               /// ```
     .               #[stable(feature = "rust1", since = "1.0.0")]
     .               #[rustc_const_stable(feature = "const_slice_first_last_not_mut", since = "1.56.0")]
     .               #[inline]
     .               pub const fn last(&self) -> Option<&T> {
 8,472 ( 0.01%)          if let [.., last] = self { Some(last) } else { None }
     .               }
     .           
     .               /// Returns a mutable pointer to the last item in the slice.
     .               ///
     .               /// # Examples
     .               ///
     .               /// ```
     .               /// let x = &mut [0, 1, 2];
-- line 292 ----------------------------------------
-- line 295 ----------------------------------------
     .               ///     *last = 10;
     .               /// }
     .               /// assert_eq!(x, &[0, 1, 10]);
     .               /// ```
     .               #[stable(feature = "rust1", since = "1.0.0")]
     .               #[rustc_const_unstable(feature = "const_slice_first_last", issue = "83570")]
     .               #[inline]
     .               pub const fn last_mut(&mut self) -> Option<&mut T> {
12,664 ( 0.01%)          if let [.., last] = self { Some(last) } else { None }
     .               }
     .           
     .               /// Returns a reference to an element or subslice depending on the type of
     .               /// index.
     .               ///
     .               /// - If given a position, returns a reference to the element at that
     .               ///   position or `None` if out of bounds.
     .               /// - If given a range, returns the subslice corresponding to that range,
-- line 311 ----------------------------------------
-- line 448 ----------------------------------------
     .               /// }
     .               /// ```
     .               ///
     .               /// [`as_mut_ptr`]: slice::as_mut_ptr
     .               #[stable(feature = "rust1", since = "1.0.0")]
     .               #[rustc_const_stable(feature = "const_slice_as_ptr", since = "1.32.0")]
     .               #[inline]
     .               pub const fn as_ptr(&self) -> *const T {
16,774 ( 0.01%)          self as *const [T] as *const T
     .               }
     .           
     .               /// Returns an unsafe mutable pointer to the slice's buffer.
     .               ///
     .               /// The caller must ensure that the slice outlives the pointer this
     .               /// function returns, or else it will end up pointing to garbage.
     .               ///
     .               /// Modifying the container referenced by this slice may cause its buffer
-- line 464 ----------------------------------------
-- line 476 ----------------------------------------
     .               ///     }
     .               /// }
     .               /// assert_eq!(x, &[3, 4, 6]);
     .               /// ```
     .               #[stable(feature = "rust1", since = "1.0.0")]
     .               #[rustc_const_unstable(feature = "const_ptr_offset", issue = "71499")]
     .               #[inline]
     .               pub const fn as_mut_ptr(&mut self) -> *mut T {
     1 ( 0.00%)          self as *mut [T] as *mut T
     .               }
     .           
     .               /// Returns the two raw pointers spanning the slice.
     .               ///
     .               /// The returned range is half-open, which means that the end pointer
     .               /// points *one past* the last element of the slice. This way, an empty
     .               /// slice is represented by two equal pointers, and the difference between
     .               /// the two pointers represents the size of the slice.
-- line 492 ----------------------------------------
-- line 582 ----------------------------------------
     .               /// v.swap(2, 4);
     .               /// assert!(v == ["a", "b", "e", "d", "c"]);
     .               /// ```
     .               #[stable(feature = "rust1", since = "1.0.0")]
     .               #[rustc_const_unstable(feature = "const_swap", issue = "83163")]
     .               #[inline]
     .               #[track_caller]
     .               pub const fn swap(&mut self, a: usize, b: usize) {
   170 ( 0.00%)          let _ = &self[a];
 1,187 ( 0.00%)          let _ = &self[b];
     .           
     .                   // SAFETY: we just checked that both `a` and `b` are in bounds
     .                   unsafe { self.swap_unchecked(a, b) }
     .               }
     .           
     .               /// Swaps two elements in the slice, without doing bounds checking.
     .               ///
     .               /// For a safe alternative see [`swap`].
-- line 599 ----------------------------------------
-- line 677 ----------------------------------------
     .           
     .                       // Because this function is first compiled in isolation,
     .                       // this check tells LLVM that the indexing below is
     .                       // in-bounds.  Then after inlining -- once the actual
     .                       // lengths of the slices are known -- it's removed.
     .                       let (a, b) = (&mut a[..n], &mut b[..n]);
     .           
     .                       for i in 0..n {
    43 ( 0.00%)                  mem::swap(&mut a[i], &mut b[n - 1 - i]);
     .                       }
     .                   }
     .               }
     .           
     .               /// Returns an iterator over the slice.
     .               ///
     .               /// # Examples
     .               ///
-- line 693 ----------------------------------------
-- line 1499 ----------------------------------------
     .               ///     assert_eq!(left, [1, 2, 3, 4, 5, 6]);
     .               ///     assert_eq!(right, []);
     .               /// }
     .               /// ```
     .               #[stable(feature = "rust1", since = "1.0.0")]
     .               #[inline]
     .               #[track_caller]
     .               pub fn split_at(&self, mid: usize) -> (&[T], &[T]) {
    18 ( 0.00%)          assert!(mid <= self.len());
     .                   // SAFETY: `[ptr; mid]` and `[mid; len]` are inside `self`, which
     .                   // fulfills the requirements of `from_raw_parts_mut`.
     .                   unsafe { self.split_at_unchecked(mid) }
     .               }
     .           
     .               /// Divides one mutable slice into two at an index.
     .               ///
     .               /// The first will contain all indices from `[0, mid)` (excluding
-- line 1515 ----------------------------------------
-- line 1530 ----------------------------------------
     .               /// left[1] = 2;
     .               /// right[1] = 4;
     .               /// assert_eq!(v, [1, 2, 3, 4, 5, 6]);
     .               /// ```
     .               #[stable(feature = "rust1", since = "1.0.0")]
     .               #[inline]
     .               #[track_caller]
     .               pub fn split_at_mut(&mut self, mid: usize) -> (&mut [T], &mut [T]) {
 1,900 ( 0.00%)          assert!(mid <= self.len());
     .                   // SAFETY: `[ptr; mid]` and `[mid; len]` are inside `self`, which
     .                   // fulfills the requirements of `from_raw_parts_mut`.
     .                   unsafe { self.split_at_mut_unchecked(mid) }
     .               }
     .           
     .               /// Divides one slice into two at an index, without doing bounds checking.
     .               ///
     .               /// The first will contain all indices from `[0, mid)` (excluding
-- line 1546 ----------------------------------------
-- line 1628 ----------------------------------------
     .               pub unsafe fn split_at_mut_unchecked(&mut self, mid: usize) -> (&mut [T], &mut [T]) {
     .                   let len = self.len();
     .                   let ptr = self.as_mut_ptr();
     .           
     .                   // SAFETY: Caller has to check that `0 <= mid <= self.len()`.
     .                   //
     .                   // `[ptr; mid]` and `[mid; len]` are not overlapping, so returning a mutable reference
     .                   // is fine.
   531 ( 0.00%)          unsafe { (from_raw_parts_mut(ptr, mid), from_raw_parts_mut(ptr.add(mid), len - mid)) }
     .               }
     .           
     .               /// Divides one slice into an array and a remainder slice at an index.
     .               ///
     .               /// The array will contain all indices from `[0, N)` (excluding
     .               /// the index `N` itself) and the slice will contain all
     .               /// indices from `[N, len)` (excluding the index `len` itself).
     .               ///
-- line 1644 ----------------------------------------
-- line 2113 ----------------------------------------
     .               /// assert!(!v.iter().any(|e| e == "hi"));
     .               /// ```
     .               #[stable(feature = "rust1", since = "1.0.0")]
     .               #[inline]
     .               pub fn contains(&self, x: &T) -> bool
     .               where
     .                   T: PartialEq,
     .               {
    22 ( 0.00%)          cmp::SliceContains::slice_contains(x, self)
     .               }
     .           
     .               /// Returns `true` if `needle` is a prefix of the slice.
     .               ///
     .               /// # Examples
     .               ///
     .               /// ```
     .               /// let v = [10, 40, 30];
-- line 2129 ----------------------------------------
-- line 2142 ----------------------------------------
     .               /// assert!(v.starts_with(&[]));
     .               /// ```
     .               #[stable(feature = "rust1", since = "1.0.0")]
     .               pub fn starts_with(&self, needle: &[T]) -> bool
     .               where
     .                   T: PartialEq,
     .               {
     .                   let n = needle.len();
 3,913 ( 0.00%)          self.len() >= n && needle == &self[..n]
     .               }
     .           
     .               /// Returns `true` if `needle` is a suffix of the slice.
     .               ///
     .               /// # Examples
     .               ///
     .               /// ```
     .               /// let v = [10, 40, 30];
-- line 2158 ----------------------------------------
-- line 2171 ----------------------------------------
     .               /// assert!(v.ends_with(&[]));
     .               /// ```
     .               #[stable(feature = "rust1", since = "1.0.0")]
     .               pub fn ends_with(&self, needle: &[T]) -> bool
     .               where
     .                   T: PartialEq,
     .               {
     .                   let (m, n) = (self.len(), needle.len());
 2,208 ( 0.00%)          m >= n && needle == &self[m - n..]
     .               }
     .           
     .               /// Returns a subslice with the prefix removed.
     .               ///
     .               /// If the slice starts with `prefix`, returns the subslice after the prefix, wrapped in `Some`.
     .               /// If `prefix` is empty, simply returns the original slice.
     .               ///
     .               /// If the slice does not start with `prefix`, returns `None`.
-- line 2187 ----------------------------------------
-- line 2293 ----------------------------------------
     .               /// s.insert(idx, num);
     .               /// assert_eq!(s, [0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 42, 55]);
     .               /// ```
     .               #[stable(feature = "rust1", since = "1.0.0")]
     .               pub fn binary_search(&self, x: &T) -> Result<usize, usize>
     .               where
     .                   T: Ord,
     .               {
     3 ( 0.00%)          self.binary_search_by(|p| p.cmp(x))
     .               }
     .           
     .               /// Binary searches this sorted slice with a comparator function.
     .               ///
     .               /// The comparator function should implement an order consistent
     .               /// with the sort order of the underlying slice, returning an
     .               /// order code that indicates whether its argument is `Less`,
     .               /// `Equal` or `Greater` the desired target.
-- line 2309 ----------------------------------------
-- line 2345 ----------------------------------------
     .               #[inline]
     .               pub fn binary_search_by<'a, F>(&'a self, mut f: F) -> Result<usize, usize>
     .               where
     .                   F: FnMut(&'a T) -> Ordering,
     .               {
     .                   let mut size = self.len();
     .                   let mut left = 0;
     .                   let mut right = size;
70,467 ( 0.06%)          while left < right {
90,225 ( 0.07%)              let mid = left + size / 2;
     .           
     .                       // SAFETY: the call is made safe by the following invariants:
     .                       // - `mid >= 0`
     .                       // - `mid < size`: `mid` is limited by `[left; right)` bound.
35,734 ( 0.03%)              let cmp = f(unsafe { self.get_unchecked(mid) });
     .           
     .                       // The reason why we use if/else control flow rather than match
     .                       // is because match reorders comparison operations, which is perf sensitive.
     .                       // This is x86 asm for u8: https://rust.godbolt.org/z/8Y8Pra.
27,611 ( 0.02%)              if cmp == Less {
30,131 ( 0.02%)                  left = mid + 1;
14,728 ( 0.01%)              } else if cmp == Greater {
     .                           right = mid;
     .                       } else {
     .                           // SAFETY: same as the `get_unchecked` above
     .                           unsafe { crate::intrinsics::assume(mid < self.len()) };
     .                           return Ok(mid);
     .                       }
     .           
77,353 ( 0.06%)              size = right - left;
     .                   }
     .                   Err(left)
     .               }
     .           
     .               /// Binary searches this sorted slice with a key extraction function.
     .               ///
     .               /// Assumes that the slice is sorted by the key, for instance with
     .               /// [`sort_by_key`] using the same key extraction function.
-- line 2382 ----------------------------------------
-- line 3203 ----------------------------------------
     .                   #[track_caller]
     .                   fn len_mismatch_fail(dst_len: usize, src_len: usize) -> ! {
     .                       panic!(
     .                           "source slice length ({}) does not match destination slice length ({})",
     .                           src_len, dst_len,
     .                       );
     .                   }
     .           
 2,624 ( 0.00%)          if self.len() != src.len() {
     .                       len_mismatch_fail(self.len(), src.len());
     .                   }
     .           
     .                   // SAFETY: `self` is valid for `self.len()` elements by definition, and `src` was
     .                   // checked to have the same length. The slices cannot overlap because
     .                   // mutable references are exclusive.
     .                   unsafe {
     .                       ptr::copy_nonoverlapping(src.as_ptr(), self.as_mut_ptr(), self.len());
-- line 3219 ----------------------------------------
-- line 3382 ----------------------------------------
     .                   }
     .                   let gcd: usize = gcd(mem::size_of::<T>(), mem::size_of::<U>());
     .                   let ts: usize = mem::size_of::<U>() / gcd;
     .                   let us: usize = mem::size_of::<T>() / gcd;
     .           
     .                   // Armed with this knowledge, we can find how many `U`s we can fit!
     .                   let us_len = self.len() / ts * us;
     .                   // And how many `T`s will be in the trailing slice!
   230 ( 0.00%)          let ts_len = self.len() % ts;
     .                   (us_len, ts_len)
     .               }
     .           
     .               /// Transmute the slice to a slice of another type, ensuring alignment of the types is
     .               /// maintained.
     .               ///
     .               /// This method splits the slice into three distinct slices: prefix, correctly aligned middle
     .               /// slice of a new type, and the suffix slice. The method may make the middle slice the greatest
-- line 3398 ----------------------------------------
-- line 3429 ----------------------------------------
     .                       return (self, &[], &[]);
     .                   }
     .           
     .                   // First, find at what point do we split between the first and 2nd slice. Easy with
     .                   // ptr.align_offset.
     .                   let ptr = self.as_ptr();
     .                   // SAFETY: See the `align_to_mut` method for the detailed safety comment.
     .                   let offset = unsafe { crate::ptr::align_offset(ptr, mem::align_of::<U>()) };
   230 ( 0.00%)          if offset > self.len() {
     .                       (self, &[], &[])
     .                   } else {
     .                       let (left, rest) = self.split_at(offset);
     .                       let (us_len, ts_len) = rest.align_to_offsets::<U>();
     .                       // SAFETY: now `rest` is definitely aligned, so `from_raw_parts` below is okay,
     .                       // since the caller guarantees that we can transmute `T` to `U` safely.
     .                       unsafe {
     .                           (
     .                               left,
     .                               from_raw_parts(rest.as_ptr() as *const U, us_len),
   230 ( 0.00%)                      from_raw_parts(rest.as_ptr().add(rest.len() - ts_len), ts_len),
     .                           )
     .                       }
     .                   }
     .               }
     .           
     .               /// Transmute the slice to a slice of another type, ensuring alignment of the types is
     .               /// maintained.
     .               ///
-- line 3456 ----------------------------------------

51,977 ( 0.04%)  <counts for unidentified lines in /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/mod.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/alloc/src/vec/mod.rs
--------------------------------------------------------------------------------
Ir                 

-- line 417 ----------------------------------------
        .               /// # #![allow(unused_mut)]
        .               /// let mut vec: Vec<i32> = Vec::new();
        .               /// ```
        .               #[inline]
        .               #[rustc_const_stable(feature = "const_vec_new", since = "1.39.0")]
        .               #[stable(feature = "rust1", since = "1.0.0")]
        .               #[must_use]
        .               pub const fn new() -> Self {
  106,187 ( 0.09%)          Vec { buf: RawVec::NEW, len: 0 }
       30 ( 0.00%)      }
        .           
        .               /// Constructs a new, empty `Vec<T>` with the specified capacity.
        .               ///
        .               /// The vector will be able to hold exactly `capacity` elements without
        .               /// reallocating. If `capacity` is 0, the vector will not allocate.
        .               ///
        .               /// It is important to note that although the returned vector has the
        .               /// *capacity* specified, the vector will have a zero *length*. For an
-- line 434 ----------------------------------------
-- line 601 ----------------------------------------
        .               /// vec.push(11);
        .               /// assert_eq!(vec.len(), 11);
        .               /// assert!(vec.capacity() >= 11);
        .               /// ```
        .               #[cfg(not(no_global_oom_handling))]
        .               #[inline]
        .               #[unstable(feature = "allocator_api", issue = "32838")]
        .               pub fn with_capacity_in(capacity: usize, alloc: A) -> Self {
   50,989 ( 0.04%)          Vec { buf: RawVec::with_capacity_in(capacity, alloc), len: 0 }
        .               }
        .           
        .               /// Creates a `Vec<T, A>` directly from the raw components of another vector.
        .               ///
        .               /// # Safety
        .               ///
        .               /// This is highly unsafe, due to the number of invariants that aren't
        .               /// checked:
-- line 617 ----------------------------------------
-- line 677 ----------------------------------------
        .               ///     // Put everything back together into a Vec
        .               ///     let rebuilt = Vec::from_raw_parts_in(p, len, cap, alloc.clone());
        .               ///     assert_eq!(rebuilt, [4, 5, 6]);
        .               /// }
        .               /// ```
        .               #[inline]
        .               #[unstable(feature = "allocator_api", issue = "32838")]
        .               pub unsafe fn from_raw_parts_in(ptr: *mut T, length: usize, capacity: usize, alloc: A) -> Self {
    2,110 ( 0.00%)          unsafe { Vec { buf: RawVec::from_raw_parts_in(ptr, capacity, alloc), len: length } }
        .               }
        .           
        .               /// Decomposes a `Vec<T>` into its raw components.
        .               ///
        .               /// Returns the raw pointer to the underlying data, the length of
        .               /// the vector (in elements), and the allocated capacity of the
        .               /// data (in elements). These are the same arguments in the same
        .               /// order as the arguments to [`from_raw_parts`].
-- line 693 ----------------------------------------
-- line 778 ----------------------------------------
        .               ///
        .               /// ```
        .               /// let vec: Vec<i32> = Vec::with_capacity(10);
        .               /// assert_eq!(vec.capacity(), 10);
        .               /// ```
        .               #[inline]
        .               #[stable(feature = "rust1", since = "1.0.0")]
        .               pub fn capacity(&self) -> usize {
   12,157 ( 0.01%)          self.buf.capacity()
        .               }
        .           
        .               /// Reserves capacity for at least `additional` more elements to be inserted
        .               /// in the given `Vec<T>`. The collection may reserve more space to avoid
        .               /// frequent reallocations. After calling `reserve`, capacity will be
        .               /// greater than or equal to `self.len() + additional`. Does nothing if
        .               /// capacity is already sufficient.
        .               ///
-- line 794 ----------------------------------------
-- line 801 ----------------------------------------
        .               /// ```
        .               /// let mut vec = vec![1];
        .               /// vec.reserve(10);
        .               /// assert!(vec.capacity() >= 11);
        .               /// ```
        .               #[cfg(not(no_global_oom_handling))]
        .               #[stable(feature = "rust1", since = "1.0.0")]
        .               pub fn reserve(&mut self, additional: usize) {
    7,782 ( 0.01%)          self.buf.reserve(self.len, additional);
        .               }
        .           
        .               /// Reserves the minimum capacity for exactly `additional` more elements to
        .               /// be inserted in the given `Vec<T>`. After calling `reserve_exact`,
        .               /// capacity will be greater than or equal to `self.len() + additional`.
        .               /// Does nothing if the capacity is already sufficient.
        .               ///
        .               /// Note that the allocator may give the collection more space than it
-- line 817 ----------------------------------------
-- line 829 ----------------------------------------
        .               /// ```
        .               /// let mut vec = vec![1];
        .               /// vec.reserve_exact(10);
        .               /// assert!(vec.capacity() >= 11);
        .               /// ```
        .               #[cfg(not(no_global_oom_handling))]
        .               #[stable(feature = "rust1", since = "1.0.0")]
        .               pub fn reserve_exact(&mut self, additional: usize) {
      715 ( 0.00%)          self.buf.reserve_exact(self.len, additional);
        .               }
        .           
        .               /// Tries to reserve capacity for at least `additional` more elements to be inserted
        .               /// in the given `Vec<T>`. The collection may reserve more space to avoid
        .               /// frequent reallocations. After calling `try_reserve`, capacity will be
        .               /// greater than or equal to `self.len() + additional`. Does nothing if
        .               /// capacity is already sufficient.
        .               ///
-- line 845 ----------------------------------------
-- line 930 ----------------------------------------
        .               /// assert!(vec.capacity() >= 3);
        .               /// ```
        .               #[cfg(not(no_global_oom_handling))]
        .               #[stable(feature = "rust1", since = "1.0.0")]
        .               pub fn shrink_to_fit(&mut self) {
        .                   // The capacity is never less than the length, and there's nothing to do when
        .                   // they are equal, so we can avoid the panic case in `RawVec::shrink_to_fit`
        .                   // by only calling it with a greater capacity.
    1,186 ( 0.00%)          if self.capacity() > self.len {
      192 ( 0.00%)              self.buf.shrink_to_fit(self.len);
        .                   }
        .               }
        .           
        .               /// Shrinks the capacity of the vector with a lower bound.
        .               ///
        .               /// The capacity will remain at least as large as both the length
        .               /// and the supplied value.
        .               ///
-- line 947 ----------------------------------------
-- line 990 ----------------------------------------
        .               /// let slice = vec.into_boxed_slice();
        .               /// assert_eq!(slice.into_vec().capacity(), 3);
        .               /// ```
        .               #[cfg(not(no_global_oom_handling))]
        .               #[stable(feature = "rust1", since = "1.0.0")]
        .               pub fn into_boxed_slice(mut self) -> Box<[T], A> {
        .                   unsafe {
        .                       self.shrink_to_fit();
      271 ( 0.00%)              let me = ManuallyDrop::new(self);
        .                       let buf = ptr::read(&me.buf);
        .                       let len = me.len();
        .                       buf.into_box(len).assume_init()
        .                   }
        .               }
        .           
        .               /// Shortens the vector, keeping the first `len` elements and dropping
        .               /// the rest.
-- line 1006 ----------------------------------------
-- line 1040 ----------------------------------------
        .               /// let mut vec = vec![1, 2, 3];
        .               /// vec.truncate(0);
        .               /// assert_eq!(vec, []);
        .               /// ```
        .               ///
        .               /// [`clear`]: Vec::clear
        .               /// [`drain`]: Vec::drain
        .               #[stable(feature = "rust1", since = "1.0.0")]
    8,372 ( 0.01%)      pub fn truncate(&mut self, len: usize) {
        .                   // This is safe because:
        .                   //
        .                   // * the slice passed to `drop_in_place` is valid; the `len > self.len`
        .                   //   case avoids creating an invalid slice, and
        .                   // * the `len` of the vector is shrunk before calling `drop_in_place`,
        .                   //   such that no value will be dropped twice in case `drop_in_place`
        .                   //   were to panic once (if it panics twice, the program aborts).
        .                   unsafe {
        .                       // Note: It's intentional that this is `>` and not `>=`.
        .                       //       Changing it to `>=` has negative performance
        .                       //       implications in some cases. See #78884 for more.
    6,340 ( 0.01%)              if len > self.len {
        .                           return;
        .                       }
        .                       let remaining_len = self.len - len;
        .                       let s = ptr::slice_from_raw_parts_mut(self.as_mut_ptr().add(len), remaining_len);
    5,114 ( 0.00%)              self.len = len;
      177 ( 0.00%)              ptr::drop_in_place(s);
        .                   }
   10,046 ( 0.01%)      }
        .           
        .               /// Extracts a slice containing the entire vector.
        .               ///
        .               /// Equivalent to `&s[..]`.
        .               ///
        .               /// # Examples
        .               ///
        .               /// ```
-- line 1076 ----------------------------------------
-- line 1126 ----------------------------------------
        .               /// ```
        .               ///
        .               /// [`as_mut_ptr`]: Vec::as_mut_ptr
        .               #[stable(feature = "vec_as_ptr", since = "1.37.0")]
        .               #[inline]
        .               pub fn as_ptr(&self) -> *const T {
        .                   // We shadow the slice method of the same name to avoid going through
        .                   // `deref`, which creates an intermediate reference.
  118,578 ( 0.10%)          let ptr = self.buf.ptr();
        .                   unsafe {
        .                       assume(!ptr.is_null());
        .                   }
        .                   ptr
        .               }
        .           
        .               /// Returns an unsafe mutable pointer to the vector's buffer.
        .               ///
-- line 1142 ----------------------------------------
-- line 1162 ----------------------------------------
        .               /// }
        .               /// assert_eq!(&*x, &[0, 1, 2, 3]);
        .               /// ```
        .               #[stable(feature = "vec_as_ptr", since = "1.37.0")]
        .               #[inline]
        .               pub fn as_mut_ptr(&mut self) -> *mut T {
        .                   // We shadow the slice method of the same name to avoid going through
        .                   // `deref_mut`, which creates an intermediate reference.
  445,979 ( 0.36%)          let ptr = self.buf.ptr();
        .                   unsafe {
        .                       assume(!ptr.is_null());
        .                   }
        .                   ptr
        .               }
        .           
        .               /// Returns a reference to the underlying allocator.
        .               #[unstable(feature = "allocator_api", issue = "32838")]
-- line 1178 ----------------------------------------
-- line 1259 ----------------------------------------
        .               ///
        .               /// Normally, here, one would use [`clear`] instead to correctly drop
        .               /// the contents and thus not leak memory.
        .               #[inline]
        .               #[stable(feature = "rust1", since = "1.0.0")]
        .               pub unsafe fn set_len(&mut self, new_len: usize) {
        .                   debug_assert!(new_len <= self.capacity());
        .           
   22,687 ( 0.02%)          self.len = new_len;
       16 ( 0.00%)      }
        .           
        .               /// Removes an element from the vector and returns it.
        .               ///
        .               /// The removed element is replaced by the last element of the vector.
        .               ///
        .               /// This does not preserve ordering, but is *O*(1).
        .               /// If you need to preserve the element order, use [`remove`] instead.
        .               ///
-- line 1276 ----------------------------------------
-- line 1329 ----------------------------------------
        .               /// let mut vec = vec![1, 2, 3];
        .               /// vec.insert(1, 4);
        .               /// assert_eq!(vec, [1, 4, 2, 3]);
        .               /// vec.insert(4, 5);
        .               /// assert_eq!(vec, [1, 4, 2, 3, 5]);
        .               /// ```
        .               #[cfg(not(no_global_oom_handling))]
        .               #[stable(feature = "rust1", since = "1.0.0")]
      245 ( 0.00%)      pub fn insert(&mut self, index: usize, element: T) {
        .                   #[cold]
        .                   #[inline(never)]
        .                   fn assert_failed(index: usize, len: usize) -> ! {
        .                       panic!("insertion index (is {}) should be <= len (is {})", index, len);
        .                   }
        .           
       35 ( 0.00%)          let len = self.len();
       70 ( 0.00%)          if index > len {
        .                       assert_failed(index, len);
        .                   }
        .           
        .                   // space for the new element
       96 ( 0.00%)          if len == self.buf.capacity() {
        .                       self.reserve(1);
        .                   }
        .           
        .                   unsafe {
        .                       // infallible
        .                       // The spot to put the new value
        .                       {
        .                           let p = self.as_mut_ptr().add(index);
        .                           // Shift everything over to make space. (Duplicating the
        .                           // `index`th element into two consecutive places.)
      144 ( 0.00%)                  ptr::copy(p, p.offset(1), len - index);
        .                           // Write it in, overwriting the first copy of the `index`th
        .                           // element.
        .                           ptr::write(p, element);
        .                       }
       96 ( 0.00%)              self.set_len(len + 1);
        .                   }
      210 ( 0.00%)      }
        .           
        .               /// Removes and returns the element at position `index` within the vector,
        .               /// shifting all elements after it to the left.
        .               ///
        .               /// Note: Because this shifts over the remaining elements, it has a
        .               /// worst-case performance of *O*(*n*). If you don't need the order of elements
        .               /// to be preserved, use [`swap_remove`] instead. If you'd like to remove
        .               /// elements from the beginning of the `Vec`, consider using
-- line 1376 ----------------------------------------
-- line 1395 ----------------------------------------
        .               pub fn remove(&mut self, index: usize) -> T {
        .                   #[cold]
        .                   #[inline(never)]
        .                   #[track_caller]
        .                   fn assert_failed(index: usize, len: usize) -> ! {
        .                       panic!("removal index (is {}) should be < len (is {})", index, len);
        .                   }
        .           
       19 ( 0.00%)          let len = self.len();
       76 ( 0.00%)          if index >= len {
        .                       assert_failed(index, len);
        .                   }
        .                   unsafe {
        .                       // infallible
        .                       let ret;
        .                       {
        .                           // the place we are taking from.
        .                           let ptr = self.as_mut_ptr().add(index);
        .                           // copy it out, unsafely having a copy of the value on
        .                           // the stack and in the vector at the same time.
        .                           ret = ptr::read(ptr);
        .           
        .                           // Shift everything down to fill in that spot.
       54 ( 0.00%)                  ptr::copy(ptr.offset(1), ptr, len - index - 1);
        .                       }
       19 ( 0.00%)              self.set_len(len - 1);
        .                       ret
        .                   }
        .               }
        .           
        .               /// Retains only the elements specified by the predicate.
        .               ///
        .               /// In other words, remove all elements `e` such that `f(&e)` returns `false`.
        .               /// This method operates in place, visiting each element exactly once in the
-- line 1428 ----------------------------------------
-- line 1442 ----------------------------------------
        .               /// ```
        .               /// let mut vec = vec![1, 2, 3, 4, 5];
        .               /// let keep = [false, true, true, false, true];
        .               /// let mut iter = keep.iter();
        .               /// vec.retain(|_| *iter.next().unwrap());
        .               /// assert_eq!(vec, [2, 3, 5]);
        .               /// ```
        .               #[stable(feature = "rust1", since = "1.0.0")]
    7,122 ( 0.01%)      pub fn retain<F>(&mut self, mut f: F)
        .               where
        .                   F: FnMut(&T) -> bool,
        .               {
      656 ( 0.00%)          self.retain_mut(|elem| f(elem));
    6,776 ( 0.01%)      }
        .           
        .               /// Retains only the elements specified by the predicate, passing a mutable reference to it.
        .               ///
        .               /// In other words, remove all elements `e` such that `f(&mut e)` returns `false`.
        .               /// This method operates in place, visiting each element exactly once in the
        .               /// original order, and preserves the order of the retained elements.
        .               ///
        .               /// # Examples
-- line 1463 ----------------------------------------
-- line 1474 ----------------------------------------
        .               /// });
        .               /// assert_eq!(vec, [2, 3, 4]);
        .               /// ```
        .               #[unstable(feature = "vec_retain_mut", issue = "90829")]
        .               pub fn retain_mut<F>(&mut self, mut f: F)
        .               where
        .                   F: FnMut(&mut T) -> bool,
        .               {
      877 ( 0.00%)          let original_len = self.len();
        .                   // Avoid double drop if the drop guard is not executed,
        .                   // since we may make some holes during the process.
        .                   unsafe { self.set_len(0) };
        .           
        .                   // Vec: [Kept, Kept, Hole, Hole, Hole, Hole, Unchecked, Unchecked]
        .                   //      |<-              processed len   ->| ^- next to check
        .                   //                  |<-  deleted cnt     ->|
        .                   //      |<-              original_len                          ->|
-- line 1490 ----------------------------------------
-- line 1499 ----------------------------------------
        .                       v: &'a mut Vec<T, A>,
        .                       processed_len: usize,
        .                       deleted_cnt: usize,
        .                       original_len: usize,
        .                   }
        .           
        .                   impl<T, A: Allocator> Drop for BackshiftOnDrop<'_, T, A> {
        .                       fn drop(&mut self) {
      872 ( 0.00%)                  if self.deleted_cnt > 0 {
        .                               // SAFETY: Trailing unchecked items must be valid since we never touch them.
        .                               unsafe {
        .                                   ptr::copy(
        .                                       self.v.as_ptr().add(self.processed_len),
      640 ( 0.00%)                              self.v.as_mut_ptr().add(self.processed_len - self.deleted_cnt),
        .                                       self.original_len - self.processed_len,
        .                                   );
        .                               }
        .                           }
        .                           // SAFETY: After filling holes, all items are in contiguous memory.
        .                           unsafe {
        2 ( 0.00%)                      self.v.set_len(self.original_len - self.deleted_cnt);
        .                           }
        .                       }
        .                   }
        .           
        .                   let mut g = BackshiftOnDrop { v: self, processed_len: 0, deleted_cnt: 0, original_len };
        .           
        .                   fn process_loop<F, T, A: Allocator, const DELETED: bool>(
        .                       original_len: usize,
        .                       f: &mut F,
        .                       g: &mut BackshiftOnDrop<'_, T, A>,
        .                   ) where
        .                       F: FnMut(&mut T) -> bool,
        .                   {
    8,237 ( 0.01%)              while g.processed_len != original_len {
        .                           // SAFETY: Unchecked element must be valid.
        .                           let cur = unsafe { &mut *g.v.as_mut_ptr().add(g.processed_len) };
    1,856 ( 0.00%)                  if !f(cur) {
        .                               // Advance early to avoid double drop if `drop_in_place` panicked.
       46 ( 0.00%)                      g.processed_len += 1;
       18 ( 0.00%)                      g.deleted_cnt += 1;
        .                               // SAFETY: We never touch this element again after dropped.
       17 ( 0.00%)                      unsafe { ptr::drop_in_place(cur) };
        .                               // We already advanced the counter.
        .                               if DELETED {
        .                                   continue;
        .                               } else {
        .                                   break;
        .                               }
        .                           }
        .                           if DELETED {
        .                               // SAFETY: `deleted_cnt` > 0, so the hole slot must not overlap with current element.
        .                               // We use copy for move, and never touch this element again.
        .                               unsafe {
      222 ( 0.00%)                          let hole_slot = g.v.as_mut_ptr().add(g.processed_len - g.deleted_cnt);
        .                                   ptr::copy_nonoverlapping(cur, hole_slot, 1);
        .                               }
        .                           }
      148 ( 0.00%)                  g.processed_len += 1;
        .                       }
        .                   }
        .           
        .                   // Stage 1: Nothing was deleted.
        .                   process_loop::<F, T, A, false>(original_len, &mut f, &mut g);
        .           
        .                   // Stage 2: Some elements were deleted.
        .                   process_loop::<F, T, A, true>(original_len, &mut f, &mut g);
-- line 1565 ----------------------------------------
-- line 1606 ----------------------------------------
        .               /// ```
        .               /// let mut vec = vec!["foo", "bar", "Bar", "baz", "bar"];
        .               ///
        .               /// vec.dedup_by(|a, b| a.eq_ignore_ascii_case(b));
        .               ///
        .               /// assert_eq!(vec, ["foo", "bar", "baz", "bar"]);
        .               /// ```
        .               #[stable(feature = "dedup_by", since = "1.16.0")]
        7 ( 0.00%)      pub fn dedup_by<F>(&mut self, mut same_bucket: F)
        .               where
        .                   F: FnMut(&mut T, &mut T) -> bool,
        .               {
        1 ( 0.00%)          let len = self.len();
       90 ( 0.00%)          if len <= 1 {
        .                       return;
        .                   }
        .           
        .                   /* INVARIANT: vec.len() > read >= write > write-1 >= 0 */
        .                   struct FillGapOnDrop<'a, T, A: core::alloc::Allocator> {
        .                       /* Offset of the element we want to check if it is duplicate */
        .                       read: usize,
        .           
-- line 1627 ----------------------------------------
-- line 1670 ----------------------------------------
        .                   let ptr = gap.vec.as_mut_ptr();
        .           
        .                   /* Drop items while going through Vec, it should be more efficient than
        .                    * doing slice partition_dedup + truncate */
        .           
        .                   /* SAFETY: Because of the invariant, read_ptr, prev_ptr and write_ptr
        .                    * are always in-bounds and read_ptr never aliases prev_ptr */
        .                   unsafe {
       18 ( 0.00%)              while gap.read < len {
        .                           let read_ptr = ptr.add(gap.read);
        .                           let prev_ptr = ptr.add(gap.write.wrapping_sub(1));
        .           
       18 ( 0.00%)                  if same_bucket(&mut *read_ptr, &mut *prev_ptr) {
        .                               // Increase `gap.read` now since the drop may panic.
        .                               gap.read += 1;
        .                               /* We have found duplicate, drop it in-place */
        .                               ptr::drop_in_place(read_ptr);
        .                           } else {
        .                               let write_ptr = ptr.add(gap.write);
        .           
        .                               /* Because `read_ptr` can be equal to `write_ptr`, we either
        .                                * have to use `copy` or conditional `copy_nonoverlapping`.
        .                                * Looks like the first option is faster. */
        .                               ptr::copy(read_ptr, write_ptr, 1);
        .           
        .                               /* We have filled that place, so go further */
        6 ( 0.00%)                      gap.write += 1;
        .                               gap.read += 1;
        .                           }
        .                       }
        .           
        .                       /* Technically we could let `gap` clean up with its Drop, but
        .                        * when `same_bucket` is guaranteed to not panic, this bloats a little
        .                        * the codegen, so we just do it manually */
        .                       gap.vec.set_len(gap.write);
        .                       mem::forget(gap);
        .                   }
        8 ( 0.00%)      }
        .           
        .               /// Appends an element to the back of a collection.
        .               ///
        .               /// # Panics
        .               ///
        .               /// Panics if the new capacity exceeds `isize::MAX` bytes.
        .               ///
        .               /// # Examples
-- line 1715 ----------------------------------------
-- line 1717 ----------------------------------------
        .               /// ```
        .               /// let mut vec = vec![1, 2];
        .               /// vec.push(3);
        .               /// assert_eq!(vec, [1, 2, 3]);
        .               /// ```
        .               #[cfg(not(no_global_oom_handling))]
        .               #[inline]
        .               #[stable(feature = "rust1", since = "1.0.0")]
       25 ( 0.00%)      pub fn push(&mut self, value: T) {
        .                   // This will panic or abort if we would allocate > isize::MAX bytes
        .                   // or if the length increment would overflow for zero-sized types.
1,232,348 ( 0.99%)          if self.len == self.buf.capacity() {
   29,035 ( 0.02%)              self.buf.reserve_for_push(self.len);
        .                   }
        .                   unsafe {
   11,957 ( 0.01%)              let end = self.as_mut_ptr().add(self.len);
        .                       ptr::write(end, value);
1,276,258 ( 1.03%)              self.len += 1;
        .                   }
       20 ( 0.00%)      }
        .           
        .               /// Removes the last element from a vector and returns it, or [`None`] if it
        .               /// is empty.
        .               ///
        .               /// If you'd like to pop the first element, consider using
        .               /// [`VecDeque::pop_front`] instead.
        .               ///
        .               /// [`VecDeque::pop_front`]: crate::collections::VecDeque::pop_front
-- line 1744 ----------------------------------------
-- line 1748 ----------------------------------------
        .               /// ```
        .               /// let mut vec = vec![1, 2, 3];
        .               /// assert_eq!(vec.pop(), Some(3));
        .               /// assert_eq!(vec, [1, 2]);
        .               /// ```
        .               #[inline]
        .               #[stable(feature = "rust1", since = "1.0.0")]
        .               pub fn pop(&mut self) -> Option<T> {
   27,053 ( 0.02%)          if self.len == 0 {
        8 ( 0.00%)              None
        .                   } else {
        .                       unsafe {
   18,832 ( 0.02%)                  self.len -= 1;
    3,498 ( 0.00%)                  Some(ptr::read(self.as_ptr().add(self.len())))
        .                       }
        .                   }
        .               }
        .           
        .               /// Moves all the elements of `other` into `Self`, leaving `other` empty.
        .               ///
        .               /// # Panics
        .               ///
-- line 1769 ----------------------------------------
-- line 1776 ----------------------------------------
        .               /// let mut vec2 = vec![4, 5, 6];
        .               /// vec.append(&mut vec2);
        .               /// assert_eq!(vec, [1, 2, 3, 4, 5, 6]);
        .               /// assert_eq!(vec2, []);
        .               /// ```
        .               #[cfg(not(no_global_oom_handling))]
        .               #[inline]
        .               #[stable(feature = "append", since = "1.4.0")]
       49 ( 0.00%)      pub fn append(&mut self, other: &mut Self) {
        .                   unsafe {
        .                       self.append_elements(other.as_slice() as _);
        .                       other.set_len(0);
        .                   }
       42 ( 0.00%)      }
        .           
        .               /// Appends elements to `Self` from other buffer.
        .               #[cfg(not(no_global_oom_handling))]
        .               #[inline]
        .               unsafe fn append_elements(&mut self, other: *const [T]) {
        .                   let count = unsafe { (*other).len() };
        .                   self.reserve(count);
      813 ( 0.00%)          let len = self.len();
        .                   unsafe { ptr::copy_nonoverlapping(other as *const T, self.as_mut_ptr().add(len), count) };
    8,900 ( 0.01%)          self.len += count;
        .               }
        .           
        .               /// Creates a draining iterator that removes the specified range in the vector
        .               /// and yields the removed items.
        .               ///
        .               /// When the iterator **is** dropped, all elements in the range are removed
        .               /// from the vector, even if the iterator was not fully consumed. If the
        .               /// iterator **is not** dropped (with [`mem::forget`] for example), it is
-- line 1807 ----------------------------------------
-- line 1834 ----------------------------------------
        .                   // When the Drain is first created, it shortens the length of
        .                   // the source vector to make sure no uninitialized or moved-from elements
        .                   // are accessible at all if the Drain's destructor never gets to run.
        .                   //
        .                   // Drain will ptr::read out the values to remove.
        .                   // When finished, remaining tail of the vec is copied back to cover
        .                   // the hole, and the vector length is restored to the new length.
        .                   //
      848 ( 0.00%)          let len = self.len();
        .                   let Range { start, end } = slice::range(range, ..len);
        .           
        .                   unsafe {
        .                       // set self.vec length's to start, to be safe in case Drain is leaked
        .                       self.set_len(start);
        .                       // Use the borrow in the IterMut to indicate borrowing behavior of the
        .                       // whole Drain iterator (like &mut T).
        6 ( 0.00%)              let range_slice = slice::from_raw_parts_mut(self.as_mut_ptr().add(start), end - start);
      207 ( 0.00%)              Drain {
        .                           tail_start: end,
        6 ( 0.00%)                  tail_len: len - end,
        .                           iter: range_slice.iter(),
        .                           vec: NonNull::from(self),
        .                       }
        .                   }
        .               }
        .           
        .               /// Clears the vector, removing all values.
        .               ///
-- line 1861 ----------------------------------------
-- line 1869 ----------------------------------------
        .               ///
        .               /// v.clear();
        .               ///
        .               /// assert!(v.is_empty());
        .               /// ```
        .               #[inline]
        .               #[stable(feature = "rust1", since = "1.0.0")]
        .               pub fn clear(&mut self) {
   14,629 ( 0.01%)          self.truncate(0)
        .               }
        .           
        .               /// Returns the number of elements in the vector, also referred to
        .               /// as its 'length'.
        .               ///
        .               /// # Examples
        .               ///
        .               /// ```
-- line 1885 ----------------------------------------
-- line 1900 ----------------------------------------
        .               /// let mut v = Vec::new();
        .               /// assert!(v.is_empty());
        .               ///
        .               /// v.push(1);
        .               /// assert!(!v.is_empty());
        .               /// ```
        .               #[stable(feature = "rust1", since = "1.0.0")]
        .               pub fn is_empty(&self) -> bool {
   12,138 ( 0.01%)          self.len() == 0
        .               }
        .           
        .               /// Splits the collection into two at the given index.
        .               ///
        .               /// Returns a newly allocated vector containing the elements in the range
        .               /// `[at, len)`. After the call, the original vector will be left containing
        .               /// the elements `[0, at)` with its previous capacity unchanged.
        .               ///
-- line 1916 ----------------------------------------
-- line 1935 ----------------------------------------
        .                   A: Clone,
        .               {
        .                   #[cold]
        .                   #[inline(never)]
        .                   fn assert_failed(at: usize, len: usize) -> ! {
        .                       panic!("`at` split index (is {}) should be <= len (is {})", at, len);
        .                   }
        .           
       70 ( 0.00%)          if at > self.len() {
        .                       assert_failed(at, self.len());
        .                   }
        .           
       56 ( 0.00%)          if at == 0 {
        .                       // the new vector can take over the original buffer and avoid the copy
        .                       return mem::replace(
        .                           self,
        .                           Vec::with_capacity_in(self.capacity(), self.allocator().clone()),
        .                       );
        .                   }
        .           
        .                   let other_len = self.len - at;
-- line 1955 ----------------------------------------
-- line 1988 ----------------------------------------
        .               ///
        .               /// let mut vec = vec![];
        .               /// let mut p = 1;
        .               /// vec.resize_with(4, || { p *= 2; p });
        .               /// assert_eq!(vec, [2, 4, 8, 16]);
        .               /// ```
        .               #[cfg(not(no_global_oom_handling))]
        .               #[stable(feature = "vec_resize_with", since = "1.33.0")]
      893 ( 0.00%)      pub fn resize_with<F>(&mut self, new_len: usize, f: F)
        .               where
        .                   F: FnMut() -> T,
        .               {
      121 ( 0.00%)          let len = self.len();
      242 ( 0.00%)          if new_len > len {
      938 ( 0.00%)              self.extend_with(new_len - len, ExtendFunc(f));
        .                   } else {
        .                       self.truncate(new_len);
        .                   }
      772 ( 0.00%)      }
        .           
        .               /// Consumes and leaks the `Vec`, returning a mutable reference to the contents,
        .               /// `&'a mut [T]`. Note that the type `T` must outlive the chosen lifetime
        .               /// `'a`. If the type has only static references, or none at all, then this
        .               /// may be chosen to be `'static`.
        .               ///
        .               /// As of Rust 1.57, this method does not reallocate or shrink the `Vec`,
        .               /// so the leaked allocation may include unused capacity that is not part
-- line 2014 ----------------------------------------
-- line 2070 ----------------------------------------
        .               #[stable(feature = "vec_spare_capacity", since = "1.60.0")]
        .               #[inline]
        .               pub fn spare_capacity_mut(&mut self) -> &mut [MaybeUninit<T>] {
        .                   // Note:
        .                   // This method is not implemented in terms of `split_at_spare_mut`,
        .                   // to prevent invalidation of pointers to the buffer.
        .                   unsafe {
        .                       slice::from_raw_parts_mut(
        2 ( 0.00%)                  self.as_mut_ptr().add(self.len) as *mut MaybeUninit<T>,
       18 ( 0.00%)                  self.buf.capacity() - self.len,
        .                       )
        .                   }
        .               }
        .           
        .               /// Returns vector content as a slice of `T`, along with the remaining spare
        .               /// capacity of the vector as a slice of `MaybeUninit<T>`.
        .               ///
        .               /// The returned spare capacity slice can be used to fill the vector with data
-- line 2087 ----------------------------------------
-- line 2189 ----------------------------------------
        .               /// assert_eq!(vec, ["hello", "world", "world"]);
        .               ///
        .               /// let mut vec = vec![1, 2, 3, 4];
        .               /// vec.resize(2, 0);
        .               /// assert_eq!(vec, [1, 2]);
        .               /// ```
        .               #[cfg(not(no_global_oom_handling))]
        .               #[stable(feature = "vec_resize", since = "1.5.0")]
       30 ( 0.00%)      pub fn resize(&mut self, new_len: usize, value: T) {
        3 ( 0.00%)          let len = self.len();
        .           
        9 ( 0.00%)          if new_len > len {
      252 ( 0.00%)              self.extend_with(new_len - len, ExtendElement(value))
        .                   } else {
        .                       self.truncate(new_len);
        .                   }
        3 ( 0.00%)      }
        .           
        .               /// Clones and appends all elements in a slice to the `Vec`.
        .               ///
        .               /// Iterates over the slice `other`, clones each element, and then appends
        .               /// it to this `Vec`. The `other` slice is traversed in-order.
        .               ///
        .               /// Note that this function is same as [`extend`] except that it is
        .               /// specialized to work with slices instead. If and when Rust gets
-- line 2213 ----------------------------------------
-- line 2291 ----------------------------------------
        .               fn last(mut self) -> T {
        .                   (self.0)()
        .               }
        .           }
        .           
        .           impl<T, A: Allocator> Vec<T, A> {
        .               #[cfg(not(no_global_oom_handling))]
        .               /// Extend the vector by `n` values, using the given generator.
    5,284 ( 0.00%)      fn extend_with<E: ExtendWith<T>>(&mut self, n: usize, mut value: E) {
        .                   self.reserve(n);
        .           
        .                   unsafe {
      308 ( 0.00%)              let mut ptr = self.as_mut_ptr().add(self.len());
        .                       // Use SetLenOnDrop to work around bug where compiler
        .                       // might not realize the store through `ptr` through self.set_len()
        .                       // don't alias.
        .                       let mut local_len = SetLenOnDrop::new(&mut self.len);
        .           
        .                       // Write all elements except the last one
        .                       for _ in 1..n {
        .                           ptr::write(ptr, value.next());
        .                           ptr = ptr.offset(1);
        .                           // Increment the length in every step in case next() panics
        .                           local_len.increment_len(1);
        .                       }
        .           
    8,249 ( 0.01%)              if n > 0 {
        .                           // We can write the last element directly without cloning needlessly
        .                           ptr::write(ptr, value.last());
        .                           local_len.increment_len(1);
        .                       }
        .           
        .                       // len set by scope guard
        .                   }
    4,153 ( 0.00%)      }
        .           }
        .           
        .           impl<T: PartialEq, A: Allocator> Vec<T, A> {
        .               /// Removes consecutive repeated elements in the vector according to the
        .               /// [`PartialEq`] trait implementation.
        .               ///
        .               /// If the vector is sorted, this removes all duplicates.
        .               ///
-- line 2333 ----------------------------------------
-- line 2338 ----------------------------------------
        .               ///
        .               /// vec.dedup();
        .               ///
        .               /// assert_eq!(vec, [1, 2, 3, 2]);
        .               /// ```
        .               #[stable(feature = "rust1", since = "1.0.0")]
        .               #[inline]
        .               pub fn dedup(&mut self) {
        2 ( 0.00%)          self.dedup_by(|a, b| a == b)
        .               }
        .           }
        .           
        .           ////////////////////////////////////////////////////////////////////////////////
        .           // Internal methods and functions
        .           ////////////////////////////////////////////////////////////////////////////////
        .           
        .           #[doc(hidden)]
        .           #[cfg(not(no_global_oom_handling))]
        .           #[stable(feature = "rust1", since = "1.0.0")]
    1,209 ( 0.00%)  pub fn from_elem<T: Clone>(elem: T, n: usize) -> Vec<T> {
    7,439 ( 0.01%)      <T as SpecFromElem>::from_elem(elem, n, Global)
    1,512 ( 0.00%)  }
        .           
        .           #[doc(hidden)]
        .           #[cfg(not(no_global_oom_handling))]
        .           #[unstable(feature = "allocator_api", issue = "32838")]
        .           pub fn from_elem_in<T: Clone, A: Allocator>(elem: T, n: usize, alloc: A) -> Vec<T, A> {
        .               <T as SpecFromElem>::from_elem(elem, n, alloc)
        .           }
        .           
-- line 2367 ----------------------------------------
-- line 2424 ----------------------------------------
        .           // Common trait implementations for Vec
        .           ////////////////////////////////////////////////////////////////////////////////
        .           
        .           #[stable(feature = "rust1", since = "1.0.0")]
        .           impl<T, A: Allocator> ops::Deref for Vec<T, A> {
        .               type Target = [T];
        .           
        .               fn deref(&self) -> &[T] {
  171,413 ( 0.14%)          unsafe { slice::from_raw_parts(self.as_ptr(), self.len) }
        5 ( 0.00%)      }
        .           }
        .           
        .           #[stable(feature = "rust1", since = "1.0.0")]
        .           impl<T, A: Allocator> ops::DerefMut for Vec<T, A> {
        .               fn deref_mut(&mut self) -> &mut [T] {
   32,933 ( 0.03%)          unsafe { slice::from_raw_parts_mut(self.as_mut_ptr(), self.len) }
        .               }
        .           }
        .           
        .           #[cfg(not(no_global_oom_handling))]
        .           trait SpecCloneFrom {
        .               fn clone_from(this: &mut Self, other: &Self);
        .           }
        .           
-- line 2447 ----------------------------------------
-- line 2468 ----------------------------------------
        .                   this.extend_from_slice(other);
        .               }
        .           }
        .           
        .           #[cfg(not(no_global_oom_handling))]
        .           #[stable(feature = "rust1", since = "1.0.0")]
        .           impl<T: Clone, A: Allocator + Clone> Clone for Vec<T, A> {
        .               #[cfg(not(test))]
    5,491 ( 0.00%)      fn clone(&self) -> Self {
        .                   let alloc = self.allocator().clone();
        2 ( 0.00%)          <[T]>::to_vec_in(&**self, alloc)
    6,958 ( 0.01%)      }
        .           
        .               // HACK(japaric): with cfg(test) the inherent `[T]::to_vec` method, which is
        .               // required for this method definition, is not available. Instead use the
        .               // `slice::to_vec`  function which is only available with cfg(test)
        .               // NB see the slice::hack module in slice.rs for more information
        .               #[cfg(test)]
        .               fn clone(&self) -> Self {
        .                   let alloc = self.allocator().clone();
-- line 2487 ----------------------------------------
-- line 2518 ----------------------------------------
        .               message = "vector indices are of type `usize` or ranges of `usize`",
        .               label = "vector indices are of type `usize` or ranges of `usize`"
        .           )]
        .           impl<T, I: SliceIndex<[T]>, A: Allocator> Index<I> for Vec<T, A> {
        .               type Output = I::Output;
        .           
        .               #[inline]
        .               fn index(&self, index: I) -> &Self::Output {
    6,525 ( 0.01%)          Index::index(&**self, index)
        .               }
        .           }
        .           
        .           #[stable(feature = "rust1", since = "1.0.0")]
        .           #[rustc_on_unimplemented(
        .               message = "vector indices are of type `usize` or ranges of `usize`",
        .               label = "vector indices are of type `usize` or ranges of `usize`"
        .           )]
        .           impl<T, I: SliceIndex<[T]>, A: Allocator> IndexMut<I> for Vec<T, A> {
        .               #[inline]
        .               fn index_mut(&mut self, index: I) -> &mut Self::Output {
       12 ( 0.00%)          IndexMut::index_mut(&mut **self, index)
        .               }
        .           }
        .           
        .           #[cfg(not(no_global_oom_handling))]
        .           #[stable(feature = "rust1", since = "1.0.0")]
        .           impl<T> FromIterator<T> for Vec<T> {
        .               #[inline]
        .               fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Vec<T> {
   50,047 ( 0.04%)          <Self as SpecFromIter<T, I::IntoIter>>::from_iter(iter.into_iter())
        .               }
        .           }
        .           
        .           #[stable(feature = "rust1", since = "1.0.0")]
        .           impl<T, A: Allocator> IntoIterator for Vec<T, A> {
        .               type Item = T;
        .               type IntoIter = IntoIter<T, A>;
        .           
-- line 2555 ----------------------------------------
-- line 2564 ----------------------------------------
        .               /// for s in v.into_iter() {
        .               ///     // s has type String, not &String
        .               ///     println!("{}", s);
        .               /// }
        .               /// ```
        .               #[inline]
        .               fn into_iter(self) -> IntoIter<T, A> {
        .                   unsafe {
   19,389 ( 0.02%)              let mut me = ManuallyDrop::new(self);
        .                       let alloc = ptr::read(me.allocator());
        .                       let begin = me.as_mut_ptr();
        .                       let end = if mem::size_of::<T>() == 0 {
        .                           arith_offset(begin as *const i8, me.len() as isize) as *const T
        .                       } else {
        .                           begin.add(me.len()) as *const T
        .                       };
        .                       let cap = me.buf.capacity();
    5,986 ( 0.00%)              IntoIter {
        .                           buf: NonNull::new_unchecked(begin),
        .                           phantom: PhantomData,
        .                           cap,
        .                           alloc,
        .                           ptr: begin,
        .                           end,
        .                       }
        .                   }
-- line 2589 ----------------------------------------
-- line 2591 ----------------------------------------
        .           }
        .           
        .           #[stable(feature = "rust1", since = "1.0.0")]
        .           impl<'a, T, A: Allocator> IntoIterator for &'a Vec<T, A> {
        .               type Item = &'a T;
        .               type IntoIter = slice::Iter<'a, T>;
        .           
        .               fn into_iter(self) -> slice::Iter<'a, T> {
       12 ( 0.00%)          self.iter()
        .               }
        .           }
        .           
        .           #[stable(feature = "rust1", since = "1.0.0")]
        .           impl<'a, T, A: Allocator> IntoIterator for &'a mut Vec<T, A> {
        .               type Item = &'a mut T;
        .               type IntoIter = slice::IterMut<'a, T>;
        .           
        .               fn into_iter(self) -> slice::IterMut<'a, T> {
    1,056 ( 0.00%)          self.iter_mut()
        .               }
        .           }
        .           
        .           #[cfg(not(no_global_oom_handling))]
        .           #[stable(feature = "rust1", since = "1.0.0")]
        .           impl<T, A: Allocator> Extend<T> for Vec<T, A> {
        .               #[inline]
       56 ( 0.00%)      fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I) {
   21,355 ( 0.02%)          <Self as SpecExtend<T, I::IntoIter>>::spec_extend(self, iter.into_iter())
       56 ( 0.00%)      }
        .           
        .               #[inline]
        .               fn extend_one(&mut self, item: T) {
        .                   self.push(item);
        .               }
        .           
        .               #[inline]
        .               fn extend_reserve(&mut self, additional: usize) {
-- line 2627 ----------------------------------------
-- line 2636 ----------------------------------------
        .               fn extend_desugared<I: Iterator<Item = T>>(&mut self, mut iterator: I) {
        .                   // This is the case for a general iterator.
        .                   //
        .                   // This function should be the moral equivalent of:
        .                   //
        .                   //      for item in iterator {
        .                   //          self.push(item);
        .                   //      }
    7,108 ( 0.01%)          while let Some(element) = iterator.next() {
      740 ( 0.00%)              let len = self.len();
   12,016 ( 0.01%)              if len == self.capacity() {
      136 ( 0.00%)                  let (lower, _) = iterator.size_hint();
        .                           self.reserve(lower.saturating_add(1));
        .                       }
        .                       unsafe {
        .                           ptr::write(self.as_mut_ptr().add(len), element);
        .                           // Since next() executes user code which can panic we have to bump the length
        .                           // after each step.
        .                           // NB can't overflow since we would have had to alloc the address space
   10,178 ( 0.01%)                  self.set_len(len + 1);
        .                       }
        .                   }
       31 ( 0.00%)      }
        .           
        .               /// Creates a splicing iterator that replaces the specified range in the vector
        .               /// with the given `replace_with` iterator and yields the removed items.
        .               /// `replace_with` does not need to be the same length as `range`.
        .               ///
        .               /// `range` is removed even if the iterator is not consumed until the end.
        .               ///
        .               /// It is unspecified how many elements are removed from the vector
-- line 2666 ----------------------------------------
-- line 2745 ----------------------------------------
        .               /// assert_eq!(evens, vec![2, 4, 6, 8, 14]);
        .               /// assert_eq!(odds, vec![1, 3, 5, 9, 11, 13, 15]);
        .               /// ```
        .               #[unstable(feature = "drain_filter", reason = "recently added", issue = "43244")]
        .               pub fn drain_filter<F>(&mut self, filter: F) -> DrainFilter<'_, T, F, A>
        .               where
        .                   F: FnMut(&mut T) -> bool,
        .               {
       86 ( 0.00%)          let old_len = self.len();
        .           
        .                   // Guard against us getting leaked (leak amplification)
        .                   unsafe {
        .                       self.set_len(0);
        .                   }
        .           
       80 ( 0.00%)          DrainFilter { vec: self, idx: 0, del: 0, old_len, pred: filter, panic_flag: false }
        .               }
        .           }
        .           
        .           /// Extend implementation that copies elements out of references before pushing them onto the Vec.
        .           ///
        .           /// This implementation is specialized for slice iterators, where it uses [`copy_from_slice`] to
        .           /// append the entire slice at once.
        .           ///
-- line 2768 ----------------------------------------
-- line 2803 ----------------------------------------
        .               #[inline]
        .               fn cmp(&self, other: &Self) -> Ordering {
        .                   Ord::cmp(&**self, &**other)
        .               }
        .           }
        .           
        .           #[stable(feature = "rust1", since = "1.0.0")]
        .           unsafe impl<#[may_dangle] T, A: Allocator> Drop for Vec<T, A> {
   27,916 ( 0.02%)      fn drop(&mut self) {
        .                   unsafe {
        .                       // use drop for [T]
        .                       // use a raw slice to refer to the elements of the vector as weakest necessary type;
        .                       // could avoid questions of validity in certain cases
   13,596 ( 0.01%)              ptr::drop_in_place(ptr::slice_from_raw_parts_mut(self.as_mut_ptr(), self.len))
        .                   }
        .                   // RawVec handles deallocation
   32,830 ( 0.03%)      }
        .           }
        .           
        .           #[stable(feature = "rust1", since = "1.0.0")]
        .           #[rustc_const_unstable(feature = "const_default_impls", issue = "87864")]
        .           impl<T> const Default for Vec<T> {
        .               /// Creates an empty `Vec<T>`.
        .               fn default() -> Vec<T> {
        .                   Vec::new()
-- line 2827 ----------------------------------------
-- line 2976 ----------------------------------------
        .               /// newly-allocated buffer with exactly the right capacity.
        .               ///
        .               /// # Examples
        .               ///
        .               /// ```
        .               /// assert_eq!(Box::from(vec![1, 2, 3]), vec![1, 2, 3].into_boxed_slice());
        .               /// ```
        .               fn from(v: Vec<T, A>) -> Self {
        4 ( 0.00%)          v.into_boxed_slice()
        .               }
        .           }
        .           
        .           #[cfg(not(no_global_oom_handling))]
        .           #[stable(feature = "rust1", since = "1.0.0")]
        .           impl From<&str> for Vec<u8> {
        .               /// Allocate a `Vec<u8>` and fill it with a UTF-8 string.
        .               ///
-- line 2992 ----------------------------------------

   66,622 ( 0.05%)  <counts for unidentified lines in /usr/home/liquid/rust/worktree-benchmarking/library/alloc/src/vec/mod.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/iter/macros.rs
--------------------------------------------------------------------------------
Ir                 

-- line 70 ----------------------------------------
        .           
        .                   impl<'a, T> $name<'a, T> {
        .                       // Helper function for creating a slice from the iterator.
        .                       #[inline(always)]
        .                       fn make_slice(&self) -> &'a [T] {
        .                           // SAFETY: the iterator was created from a slice with pointer
        .                           // `self.ptr` and length `len!(self)`. This guarantees that all
        .                           // the prerequisites for `from_raw_parts` are fulfilled.
    2,304 ( 0.00%)                  unsafe { from_raw_parts(self.ptr.as_ptr(), len!(self)) }
        .                       }
        .           
        .                       // Helper function for moving the start of the iterator forwards by `offset` elements,
        .                       // returning the old start.
        .                       // Unsafe because the offset must not exceed `self.len()`.
        .                       #[inline(always)]
        .                       unsafe fn post_inc_start(&mut self, offset: isize) -> * $raw_mut T {
        .                           if mem::size_of::<T>() == 0 {
        .                               zst_shrink!(self, offset);
        .                               self.ptr.as_ptr()
        .                           } else {
        .                               let old = self.ptr.as_ptr();
        .                               // SAFETY: the caller guarantees that `offset` doesn't exceed `self.len()`,
        .                               // so this new pointer is inside `self` and thus guaranteed to be non-null.
   20,066 ( 0.02%)                      self.ptr = unsafe { NonNull::new_unchecked(self.ptr.as_ptr().offset(offset)) };
        .                               old
        .                           }
        .                       }
        .           
        .                       // Helper function for moving the end of the iterator backwards by `offset` elements,
        .                       // returning the new end.
        .                       // Unsafe because the offset must not exceed `self.len()`.
        .                       #[inline(always)]
-- line 101 ----------------------------------------
-- line 102 ----------------------------------------
        .                       unsafe fn pre_dec_end(&mut self, offset: isize) -> * $raw_mut T {
        .                           if mem::size_of::<T>() == 0 {
        .                               zst_shrink!(self, offset);
        .                               self.ptr.as_ptr()
        .                           } else {
        .                               // SAFETY: the caller guarantees that `offset` doesn't exceed `self.len()`,
        .                               // which is guaranteed to not overflow an `isize`. Also, the resulting pointer
        .                               // is in bounds of `slice`, which fulfills the other requirements for `offset`.
       19 ( 0.00%)                      self.end = unsafe { self.end.offset(-offset) };
        .                               self.end
        .                           }
        .                       }
        .                   }
        .           
        .                   #[stable(feature = "rust1", since = "1.0.0")]
        .                   impl<T> ExactSizeIterator for $name<'_, T> {
        .                       #[inline(always)]
        .                       fn len(&self) -> usize {
    3,285 ( 0.00%)                  len!(self)
        .                       }
        .           
        .                       #[inline(always)]
        .                       fn is_empty(&self) -> bool {
        .                           is_empty!(self)
        .                       }
        .                   }
        .           
-- line 128 ----------------------------------------
-- line 134 ----------------------------------------
        .                       fn next(&mut self) -> Option<$elem> {
        .                           // could be implemented with slices, but this avoids bounds checks
        .           
        .                           // SAFETY: `assume` calls are safe since a slice's start pointer
        .                           // must be non-null, and slices over non-ZSTs must also have a
        .                           // non-null end pointer. The call to `next_unchecked!` is safe
        .                           // since we check if the iterator is empty first.
        .                           unsafe {
    4,303 ( 0.00%)                      assume(!self.ptr.as_ptr().is_null());
        .                               if mem::size_of::<T>() != 0 {
    2,148 ( 0.00%)                          assume(!self.end.is_null());
        .                               }
3,012,614 ( 2.42%)                      if is_empty!(self) {
        .                                   None
        .                               } else {
        .                                   Some(next_unchecked!(self))
        .                               }
        .                           }
        .                       }
        .           
        .                       #[inline]
        .                       fn size_hint(&self) -> (usize, Option<usize>) {
   23,434 ( 0.02%)                  let exact = len!(self);
        .                           (exact, Some(exact))
        .                       }
        .           
        .                       #[inline]
        .                       fn count(self) -> usize {
        .                           len!(self)
        .                       }
        .           
        .                       #[inline]
        .                       fn nth(&mut self, n: usize) -> Option<$elem> {
      348 ( 0.00%)                  if n >= len!(self) {
        .                               // This iterator is now empty.
        .                               if mem::size_of::<T>() == 0 {
        .                                   // We have to do it this way as `ptr` may never be 0, but `end`
        .                                   // could be (due to wrapping).
        .                                   self.end = self.ptr.as_ptr();
        .                               } else {
        .                                   // SAFETY: end can't be 0 if T isn't ZST because ptr isn't 0 and end >= ptr
        .                                   unsafe {
-- line 175 ----------------------------------------
-- line 203 ----------------------------------------
        .                       // faster to compile.
        .                       #[inline]
        .                       fn for_each<F>(mut self, mut f: F)
        .                       where
        .                           Self: Sized,
        .                           F: FnMut(Self::Item),
        .                       {
        .                           while let Some(x) = self.next() {
      148 ( 0.00%)                      f(x);
        .                           }
        .                       }
        .           
        .                       // We override the default implementation, which uses `try_fold`,
        .                       // because this simple implementation generates less LLVM IR and is
        .                       // faster to compile.
        .                       #[inline]
        .                       fn all<F>(&mut self, mut f: F) -> bool
        .                       where
        .                           Self: Sized,
        .                           F: FnMut(Self::Item) -> bool,
        .                       {
        9 ( 0.00%)                  while let Some(x) = self.next() {
    2,824 ( 0.00%)                      if !f(x) {
        .                                   return false;
        .                               }
        .                           }
        .                           true
        .                       }
        .           
        .                       // We override the default implementation, which uses `try_fold`,
        .                       // because this simple implementation generates less LLVM IR and is
        .                       // faster to compile.
        .                       #[inline]
        .                       fn any<F>(&mut self, mut f: F) -> bool
        .                       where
        .                           Self: Sized,
        .                           F: FnMut(Self::Item) -> bool,
        .                       {
   12,363 ( 0.01%)                  while let Some(x) = self.next() {
   13,853 ( 0.01%)                      if f(x) {
        .                                   return true;
        .                               }
        .                           }
        .                           false
        .                       }
        .           
        .                       // We override the default implementation, which uses `try_fold`,
        .                       // because this simple implementation generates less LLVM IR and is
        .                       // faster to compile.
        .                       #[inline]
        .                       fn find<P>(&mut self, mut predicate: P) -> Option<Self::Item>
        .                       where
        .                           Self: Sized,
        .                           P: FnMut(&Self::Item) -> bool,
        .                       {
      624 ( 0.00%)                  while let Some(x) = self.next() {
    4,522 ( 0.00%)                      if predicate(&x) {
        .                                   return Some(x);
        .                               }
        .                           }
        .                           None
      304 ( 0.00%)              }
        .           
        .                       // We override the default implementation, which uses `try_fold`,
        .                       // because this simple implementation generates less LLVM IR and is
        .                       // faster to compile.
        .                       #[inline]
        .                       fn find_map<B, F>(&mut self, mut f: F) -> Option<B>
        .                       where
        .                           Self: Sized,
        .                           F: FnMut(Self::Item) -> Option<B>,
        .                       {
      907 ( 0.00%)                  while let Some(x) = self.next() {
    4,176 ( 0.00%)                      if let Some(y) = f(x) {
      346 ( 0.00%)                          return Some(y);
        .                               }
        .                           }
        .                           None
      215 ( 0.00%)              }
        .           
        .                       // We override the default implementation, which uses `try_fold`,
        .                       // because this simple implementation generates less LLVM IR and is
        .                       // faster to compile. Also, the `assume` avoids a bounds check.
        .                       #[inline]
        .                       #[rustc_inherit_overflow_checks]
        .                       fn position<P>(&mut self, mut predicate: P) -> Option<usize> where
        .                           Self: Sized,
        .                           P: FnMut(Self::Item) -> bool,
        .                       {
        .                           let n = len!(self);
        .                           let mut i = 0;
        .                           while let Some(x) = self.next() {
   11,901 ( 0.01%)                      if predicate(x) {
        .                                   // SAFETY: we are guaranteed to be in bounds by the loop invariant:
        .                                   // when `i >= n`, `self.next()` returns `None` and the loop breaks.
        .                                   unsafe { assume(i < n) };
        .                                   return Some(i);
        .                               }
        .                               i += 1;
        .                           }
        .                           None
-- line 303 ----------------------------------------
-- line 308 ----------------------------------------
        .                       // faster to compile. Also, the `assume` avoids a bounds check.
        .                       #[inline]
        .                       fn rposition<P>(&mut self, mut predicate: P) -> Option<usize> where
        .                           P: FnMut(Self::Item) -> bool,
        .                           Self: Sized + ExactSizeIterator + DoubleEndedIterator
        .                       {
        .                           let n = len!(self);
        .                           let mut i = n;
      570 ( 0.00%)                  while let Some(x) = self.next_back() {
    8,046 ( 0.01%)                      i -= 1;
    6,986 ( 0.01%)                      if predicate(x) {
        .                                   // SAFETY: `i` must be lower than `n` since it starts at `n`
        .                                   // and is only decreasing.
        .                                   unsafe { assume(i < n) };
        .                                   return Some(i);
        .                               }
        .                           }
        .                           None
        .                       }
-- line 326 ----------------------------------------
-- line 332 ----------------------------------------
        .                           // the returned references is guaranteed to refer to an element
        .                           // of the slice and thus guaranteed to be valid.
        .                           //
        .                           // Also note that the caller also guarantees that we're never
        .                           // called with the same index again, and that no other methods
        .                           // that will access this subslice are called, so it is valid
        .                           // for the returned reference to be mutable in the case of
        .                           // `IterMut`
      836 ( 0.00%)                  unsafe { & $( $mut_ )? * self.ptr.as_ptr().add(idx) }
        .                       }
        .           
        .                       $($extra)*
        .                   }
        .           
        .                   #[stable(feature = "rust1", since = "1.0.0")]
        .                   impl<'a, T> DoubleEndedIterator for $name<'a, T> {
        .                       #[inline]
-- line 348 ----------------------------------------
-- line 351 ----------------------------------------
        .           
        .                           // SAFETY: `assume` calls are safe since a slice's start pointer must be non-null,
        .                           // and slices over non-ZSTs must also have a non-null end pointer.
        .                           // The call to `next_back_unchecked!` is safe since we check if the iterator is
        .                           // empty first.
        .                           unsafe {
        .                               assume(!self.ptr.as_ptr().is_null());
        .                               if mem::size_of::<T>() != 0 {
       20 ( 0.00%)                          assume(!self.end.is_null());
        .                               }
   22,068 ( 0.02%)                      if is_empty!(self) {
        .                                   None
        .                               } else {
        .                                   Some(next_back_unchecked!(self))
        .                               }
        .                           }
        .                       }
        .           
        .                       #[inline]
-- line 369 ----------------------------------------

  185,306 ( 0.15%)  <counts for unidentified lines in /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/iter/macros.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs
--------------------------------------------------------------------------------
Ir              

-- line 118 ----------------------------------------
     .               stability: InternedSet<'tcx, attr::Stability>,
     .           
     .               /// `#[rustc_const_stable]` and `#[rustc_const_unstable]` attributes
     .               const_stability: InternedSet<'tcx, attr::ConstStability>,
     .           }
     .           
     .           impl<'tcx> CtxtInterners<'tcx> {
     .               fn new(arena: &'tcx WorkerLocal<Arena<'tcx>>) -> CtxtInterners<'tcx> {
    17 ( 0.00%)          CtxtInterners {
     .                       arena,
     .                       type_: Default::default(),
     .                       type_list: Default::default(),
     .                       substs: Default::default(),
     .                       region: Default::default(),
     .                       poly_existential_predicates: Default::default(),
     .                       canonical_var_infos: Default::default(),
     .                       predicate: Default::default(),
-- line 134 ----------------------------------------
-- line 143 ----------------------------------------
     .                       stability: Default::default(),
     .                       const_stability: Default::default(),
     .                   }
     .               }
     .           
     .               /// Interns a type.
     .               #[allow(rustc::usage_of_ty_tykind)]
     .               #[inline(never)]
62,224 ( 0.05%)      fn intern_ty(&self, kind: TyKind<'tcx>) -> Ty<'tcx> {
     .                   self.type_
38,890 ( 0.03%)              .intern(kind, |kind| {
 6,766 ( 0.01%)                  let flags = super::flags::FlagComputation::for_kind(&kind);
     .           
     .                           let ty_struct = TyS {
13,532 ( 0.01%)                      kind,
     .                               flags: flags.flags,
     .                               outer_exclusive_binder: flags.outer_exclusive_binder,
     .                           };
     .           
     .                           Interned(self.arena.alloc(ty_struct))
     .                       })
     .                       .0
70,002 ( 0.06%)      }
     .           
     .               #[inline(never)]
13,608 ( 0.01%)      fn intern_predicate(
     .                   &self,
     .                   kind: Binder<'tcx, PredicateKind<'tcx>>,
     .               ) -> &'tcx PredicateInner<'tcx> {
     .                   self.predicate
11,907 ( 0.01%)              .intern(kind, |kind| {
 5,304 ( 0.00%)                  let flags = super::flags::FlagComputation::for_predicate(kind);
     .           
     .                           let predicate_struct = PredicateInner {
     .                               kind,
     .                               flags: flags.flags,
     .                               outer_exclusive_binder: flags.outer_exclusive_binder,
     .                           };
     .           
     .                           Interned(self.arena.alloc(predicate_struct))
     .                       })
     .                       .0
15,309 ( 0.01%)      }
     .           }
     .           
     .           pub struct CommonTypes<'tcx> {
     .               pub unit: Ty<'tcx>,
     .               pub bool: Ty<'tcx>,
     .               pub char: Ty<'tcx>,
     .               pub isize: Ty<'tcx>,
     .               pub i8: Ty<'tcx>,
-- line 193 ----------------------------------------
-- line 237 ----------------------------------------
     .           /// safely used as a key in the maps of a TypeckResults. For that to be
     .           /// the case, the HirId must have the same `owner` as all the other IDs in
     .           /// this table (signified by `hir_owner`). Otherwise the HirId
     .           /// would be in a different frame of reference and using its `local_id`
     .           /// would result in lookup errors, or worse, in silently wrong data being
     .           /// stored/returned.
     .           #[inline]
     .           fn validate_hir_id_for_typeck_results(hir_owner: LocalDefId, hir_id: hir::HirId) {
 6,550 ( 0.01%)      if hir_id.owner != hir_owner {
     .                   invalid_hir_id_for_typeck_results(hir_owner, hir_id);
     .               }
     .           }
     .           
     .           #[cold]
     .           #[inline(never)]
     .           fn invalid_hir_id_for_typeck_results(hir_owner: LocalDefId, hir_id: hir::HirId) {
     .               ty::tls::with(|tcx| {
-- line 253 ----------------------------------------
-- line 261 ----------------------------------------
     .           }
     .           
     .           impl<'a, V> LocalTableInContext<'a, V> {
     .               pub fn contains_key(&self, id: hir::HirId) -> bool {
     .                   validate_hir_id_for_typeck_results(self.hir_owner, id);
     .                   self.data.contains_key(&id.local_id)
     .               }
     .           
 4,728 ( 0.00%)      pub fn get(&self, id: hir::HirId) -> Option<&V> {
   952 ( 0.00%)          validate_hir_id_for_typeck_results(self.hir_owner, id);
   952 ( 0.00%)          self.data.get(&id.local_id)
 3,790 ( 0.00%)      }
     .           
     .               pub fn iter(&self) -> hash_map::Iter<'_, hir::ItemLocalId, V> {
     .                   self.data.iter()
     .               }
     .           }
     .           
     .           impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
     .               type Output = V;
     .           
    84 ( 0.00%)      fn index(&self, key: hir::HirId) -> &V {
     .                   self.get(key).expect("LocalTableInContext: key not found")
    56 ( 0.00%)      }
     .           }
     .           
     .           pub struct LocalTableInContextMut<'a, V> {
     .               hir_owner: LocalDefId,
     .               data: &'a mut ItemLocalMap<V>,
     .           }
     .           
     .           impl<'a, V> LocalTableInContextMut<'a, V> {
-- line 292 ----------------------------------------
-- line 507 ----------------------------------------
     .               pub treat_byte_string_as_slice: ItemLocalSet,
     .           
     .               /// Contains the data for evaluating the effect of feature `capture_disjoint_fields`
     .               /// on closure size.
     .               pub closure_size_eval: FxHashMap<DefId, ClosureSizeProfileData<'tcx>>,
     .           }
     .           
     .           impl<'tcx> TypeckResults<'tcx> {
   366 ( 0.00%)      pub fn new(hir_owner: LocalDefId) -> TypeckResults<'tcx> {
 4,331 ( 0.00%)          TypeckResults {
     .                       hir_owner,
     .                       type_dependent_defs: Default::default(),
     .                       field_indices: Default::default(),
     .                       user_provided_types: Default::default(),
     .                       user_provided_sigs: Default::default(),
     .                       node_types: Default::default(),
     .                       node_substs: Default::default(),
     .                       adjustments: Default::default(),
-- line 524 ----------------------------------------
-- line 532 ----------------------------------------
     .                       tainted_by_errors: None,
     .                       concrete_opaque_types: Default::default(),
     .                       closure_min_captures: Default::default(),
     .                       closure_fake_reads: Default::default(),
     .                       generator_interior_types: ty::Binder::dummy(Default::default()),
     .                       treat_byte_string_as_slice: Default::default(),
     .                       closure_size_eval: Default::default(),
     .                   }
   366 ( 0.00%)      }
     .           
     .               /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
 1,032 ( 0.00%)      pub fn qpath_res(&self, qpath: &hir::QPath<'_>, id: hir::HirId) -> Res {
   688 ( 0.00%)          match *qpath {
 1,752 ( 0.00%)              hir::QPath::Resolved(_, ref path) => path.res,
     .                       hir::QPath::TypeRelative(..) | hir::QPath::LangItem(..) => self
     .                           .type_dependent_def(id)
   312 ( 0.00%)                  .map_or(Res::Err, |(kind, def_id)| Res::Def(kind, def_id)),
     .                   }
 1,720 ( 0.00%)      }
     .           
    13 ( 0.00%)      pub fn type_dependent_defs(
     .                   &self,
     .               ) -> LocalTableInContext<'_, Result<(DefKind, DefId), ErrorReported>> {
    47 ( 0.00%)          LocalTableInContext { hir_owner: self.hir_owner, data: &self.type_dependent_defs }
    13 ( 0.00%)      }
     .           
   122 ( 0.00%)      pub fn type_dependent_def(&self, id: HirId) -> Option<(DefKind, DefId)> {
   263 ( 0.00%)          validate_hir_id_for_typeck_results(self.hir_owner, id);
     .                   self.type_dependent_defs.get(&id.local_id).cloned().and_then(|r| r.ok())
   244 ( 0.00%)      }
     .           
   356 ( 0.00%)      pub fn type_dependent_def_id(&self, id: HirId) -> Option<DefId> {
     .                   self.type_dependent_def(id).map(|(_, def_id)| def_id)
   356 ( 0.00%)      }
     .           
   441 ( 0.00%)      pub fn type_dependent_defs_mut(
     .                   &mut self,
     .               ) -> LocalTableInContextMut<'_, Result<(DefKind, DefId), ErrorReported>> {
   441 ( 0.00%)          LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.type_dependent_defs }
   441 ( 0.00%)      }
     .           
     .               pub fn field_indices(&self) -> LocalTableInContext<'_, usize> {
   104 ( 0.00%)          LocalTableInContext { hir_owner: self.hir_owner, data: &self.field_indices }
    24 ( 0.00%)      }
     .           
     .               pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> {
   168 ( 0.00%)          LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.field_indices }
    84 ( 0.00%)      }
     .           
     .               pub fn user_provided_types(&self) -> LocalTableInContext<'_, CanonicalUserType<'tcx>> {
   216 ( 0.00%)          LocalTableInContext { hir_owner: self.hir_owner, data: &self.user_provided_types }
   108 ( 0.00%)      }
     .           
     .               pub fn user_provided_types_mut(
     .                   &mut self,
     .               ) -> LocalTableInContextMut<'_, CanonicalUserType<'tcx>> {
    28 ( 0.00%)          LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.user_provided_types }
    14 ( 0.00%)      }
     .           
     .               pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> {
   846 ( 0.00%)          LocalTableInContext { hir_owner: self.hir_owner, data: &self.node_types }
   423 ( 0.00%)      }
     .           
     .               pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> {
 1,570 ( 0.00%)          LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.node_types }
   785 ( 0.00%)      }
     .           
 7,008 ( 0.01%)      pub fn node_type(&self, id: hir::HirId) -> Ty<'tcx> {
 1,168 ( 0.00%)          self.node_type_opt(id).unwrap_or_else(|| {
     .                       bug!("node_type: no type for node `{}`", tls::with(|tcx| tcx.hir().node_to_string(id)))
     .                   })
 5,840 ( 0.00%)      }
     .           
 1,493 ( 0.00%)      pub fn node_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
 1,493 ( 0.00%)          validate_hir_id_for_typeck_results(self.hir_owner, id);
     .                   self.node_types.get(&id.local_id).cloned()
 2,986 ( 0.00%)      }
     .           
     .               pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, SubstsRef<'tcx>> {
   160 ( 0.00%)          LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.node_substs }
    80 ( 0.00%)      }
     .           
   531 ( 0.00%)      pub fn node_substs(&self, id: hir::HirId) -> SubstsRef<'tcx> {
   531 ( 0.00%)          validate_hir_id_for_typeck_results(self.hir_owner, id);
     .                   self.node_substs.get(&id.local_id).cloned().unwrap_or_else(|| InternalSubsts::empty())
 1,062 ( 0.00%)      }
     .           
   353 ( 0.00%)      pub fn node_substs_opt(&self, id: hir::HirId) -> Option<SubstsRef<'tcx>> {
   353 ( 0.00%)          validate_hir_id_for_typeck_results(self.hir_owner, id);
     .                   self.node_substs.get(&id.local_id).cloned()
   706 ( 0.00%)      }
     .           
     .               // Returns the type of a pattern as a monotype. Like @expr_ty, this function
     .               // doesn't provide type parameter substitutions.
     .               pub fn pat_ty(&self, pat: &hir::Pat<'_>) -> Ty<'tcx> {
   112 ( 0.00%)          self.node_type(pat.hir_id)
     .               }
     .           
     .               // Returns the type of an expression as a monotype.
     .               //
     .               // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression.  That is, in
     .               // some cases, we insert `Adjustment` annotations such as auto-deref or
     .               // auto-ref.  The type returned by this function does not consider such
     .               // adjustments.  See `expr_ty_adjusted()` instead.
     .               //
     .               // NB (2): This type doesn't provide type parameter substitutions; e.g., if you
     .               // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
     .               // instead of "fn(ty) -> T with T = isize".
     .               pub fn expr_ty(&self, expr: &hir::Expr<'_>) -> Ty<'tcx> {
 1,392 ( 0.00%)          self.node_type(expr.hir_id)
     .               }
     .           
     .               pub fn expr_ty_opt(&self, expr: &hir::Expr<'_>) -> Option<Ty<'tcx>> {
 1,248 ( 0.00%)          self.node_type_opt(expr.hir_id)
     .               }
     .           
     .               pub fn adjustments(&self) -> LocalTableInContext<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
   638 ( 0.00%)          LocalTableInContext { hir_owner: self.hir_owner, data: &self.adjustments }
   319 ( 0.00%)      }
     .           
     .               pub fn adjustments_mut(
     .                   &mut self,
     .               ) -> LocalTableInContextMut<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
 1,002 ( 0.00%)          LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.adjustments }
   501 ( 0.00%)      }
     .           
   594 ( 0.00%)      pub fn expr_adjustments(&self, expr: &hir::Expr<'_>) -> &[ty::adjustment::Adjustment<'tcx>] {
 1,188 ( 0.00%)          validate_hir_id_for_typeck_results(self.hir_owner, expr.hir_id);
     .                   self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
 1,188 ( 0.00%)      }
     .           
     .               /// Returns the type of `expr`, considering any `Adjustment`
     .               /// entry recorded for that expression.
   130 ( 0.00%)      pub fn expr_ty_adjusted(&self, expr: &hir::Expr<'_>) -> Ty<'tcx> {
    26 ( 0.00%)          self.expr_adjustments(expr).last().map_or_else(|| self.expr_ty(expr), |adj| adj.target)
    72 ( 0.00%)      }
     .           
     .               pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr<'_>) -> Option<Ty<'tcx>> {
     .                   self.expr_adjustments(expr).last().map(|adj| adj.target).or_else(|| self.expr_ty_opt(expr))
     .               }
     .           
    34 ( 0.00%)      pub fn is_method_call(&self, expr: &hir::Expr<'_>) -> bool {
     .                   // Only paths and method calls/overloaded operators have
     .                   // entries in type_dependent_defs, ignore the former here.
    68 ( 0.00%)          if let hir::ExprKind::Path(_) = expr.kind {
     .                       return false;
     .                   }
     .           
    72 ( 0.00%)          matches!(self.type_dependent_defs().get(expr.hir_id), Some(Ok((DefKind::AssocFn, _))))
    68 ( 0.00%)      }
     .           
   258 ( 0.00%)      pub fn extract_binding_mode(&self, s: &Session, id: HirId, sp: Span) -> Option<BindingMode> {
     .                   self.pat_binding_modes().get(id).copied().or_else(|| {
     .                       s.delay_span_bug(sp, "missing binding mode");
     .                       None
     .                   })
   344 ( 0.00%)      }
     .           
     .               pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> {
   214 ( 0.00%)          LocalTableInContext { hir_owner: self.hir_owner, data: &self.pat_binding_modes }
    64 ( 0.00%)      }
     .           
     .               pub fn pat_binding_modes_mut(&mut self) -> LocalTableInContextMut<'_, BindingMode> {
   116 ( 0.00%)          LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.pat_binding_modes }
    58 ( 0.00%)      }
     .           
     .               pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
   282 ( 0.00%)          LocalTableInContext { hir_owner: self.hir_owner, data: &self.pat_adjustments }
   141 ( 0.00%)      }
     .           
     .               pub fn pat_adjustments_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
    90 ( 0.00%)          LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.pat_adjustments }
    45 ( 0.00%)      }
     .           
     .               /// For a given closure, returns the iterator of `ty::CapturedPlace`s that are captured
     .               /// by the closure.
    68 ( 0.00%)      pub fn closure_min_captures_flattened(
     .                   &self,
     .                   closure_def_id: DefId,
     .               ) -> impl Iterator<Item = &ty::CapturedPlace<'tcx>> {
     .                   self.closure_min_captures
     .                       .get(&closure_def_id)
     .                       .map(|closure_min_captures| closure_min_captures.values().flat_map(|v| v.iter()))
     .                       .into_iter()
     .                       .flatten()
    85 ( 0.00%)      }
     .           
     .               pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, HirPlace<'tcx>)> {
    34 ( 0.00%)          LocalTableInContext { hir_owner: self.hir_owner, data: &self.closure_kind_origins }
    17 ( 0.00%)      }
     .           
     .               pub fn closure_kind_origins_mut(
     .                   &mut self,
     .               ) -> LocalTableInContextMut<'_, (Span, HirPlace<'tcx>)> {
     .                   LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.closure_kind_origins }
     .               }
     .           
     .               pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> {
    90 ( 0.00%)          LocalTableInContext { hir_owner: self.hir_owner, data: &self.liberated_fn_sigs }
    45 ( 0.00%)      }
     .           
     .               pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> {
    56 ( 0.00%)          LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.liberated_fn_sigs }
    28 ( 0.00%)      }
     .           
     .               pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
    34 ( 0.00%)          LocalTableInContext { hir_owner: self.hir_owner, data: &self.fru_field_types }
    17 ( 0.00%)      }
     .           
     .               pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
     .                   LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.fru_field_types }
     .               }
     .           
     .               pub fn is_coercion_cast(&self, hir_id: hir::HirId) -> bool {
     .                   validate_hir_id_for_typeck_results(self.hir_owner, hir_id);
     .                   self.coercion_casts.contains(&hir_id.local_id)
     .               }
     .           
     .               pub fn set_coercion_cast(&mut self, id: ItemLocalId) {
     .                   self.coercion_casts.insert(id);
     .               }
     .           
     .               pub fn coercion_casts(&self) -> &ItemLocalSet {
    17 ( 0.00%)          &self.coercion_casts
    17 ( 0.00%)      }
     .           }
     .           
     .           impl<'a, 'tcx> HashStable<StableHashingContext<'a>> for TypeckResults<'tcx> {
     .               fn hash_stable(&self, hcx: &mut StableHashingContext<'a>, hasher: &mut StableHasher) {
     .                   let ty::TypeckResults {
     .                       hir_owner,
     .                       ref type_dependent_defs,
     .                       ref field_indices,
-- line 764 ----------------------------------------
-- line 819 ----------------------------------------
     .                   const START_INDEX = 0,
     .               }
     .           }
     .           
     .           /// Mapping of type annotation indices to canonical user type annotations.
     .           pub type CanonicalUserTypeAnnotations<'tcx> =
     .               IndexVec<UserTypeAnnotationIndex, CanonicalUserTypeAnnotation<'tcx>>;
     .           
    14 ( 0.00%)  #[derive(Clone, Debug, TyEncodable, TyDecodable, HashStable, TypeFoldable, Lift)]
     .           pub struct CanonicalUserTypeAnnotation<'tcx> {
     .               pub user_ty: CanonicalUserType<'tcx>,
     .               pub span: Span,
     7 ( 0.00%)      pub inferred_ty: Ty<'tcx>,
     .           }
     .           
     .           /// Canonicalized user type annotation.
     .           pub type CanonicalUserType<'tcx> = Canonical<'tcx, UserType<'tcx>>;
     .           
     .           impl<'tcx> CanonicalUserType<'tcx> {
     .               /// Returns `true` if this represents a substitution of the form `[?0, ?1, ?2]`,
     .               /// i.e., each thing is mapped to a canonical variable with the same index.
    25 ( 0.00%)      pub fn is_identity(&self) -> bool {
    50 ( 0.00%)          match self.value {
     .                       UserType::Ty(_) => false,
     .                       UserType::TypeOf(_, user_substs) => {
    25 ( 0.00%)                  if user_substs.user_self_ty.is_some() {
     .                               return false;
     .                           }
     .           
     .                           iter::zip(user_substs.substs, BoundVar::new(0)..).all(|(kind, cvar)| {
     .                               match kind.unpack() {
    44 ( 0.00%)                          GenericArgKind::Type(ty) => match ty.kind() {
     .                                       ty::Bound(debruijn, b) => {
     .                                           // We only allow a `ty::INNERMOST` index in substitutions.
    22 ( 0.00%)                                  assert_eq!(*debruijn, ty::INNERMOST);
     .                                           cvar == b.var
     .                                       }
     .                                       _ => false,
     .                                   },
     .           
     .                                   GenericArgKind::Lifetime(r) => match r {
     .                                       ty::ReLateBound(debruijn, br) => {
     .                                           // We only allow a `ty::INNERMOST` index in substitutions.
-- line 861 ----------------------------------------
-- line 872 ----------------------------------------
     .                                           cvar == b
     .                                       }
     .                                       _ => false,
     .                                   },
     .                               }
     .                           })
     .                       }
     .                   }
    50 ( 0.00%)      }
     .           }
     .           
     .           /// A user-given type annotation attached to a constant. These arise
     .           /// from constants that are named via paths, like `Foo::<A>::new` and
     .           /// so forth.
    42 ( 0.00%)  #[derive(Copy, Clone, Debug, PartialEq, TyEncodable, TyDecodable)]
   309 ( 0.00%)  #[derive(HashStable, TypeFoldable, Lift)]
     .           pub enum UserType<'tcx> {
     .               Ty(Ty<'tcx>),
     .           
     .               /// The canonical type is the result of `type_of(def_id)` with the
     .               /// given substitutions applied.
     .               TypeOf(DefId, UserSubsts<'tcx>),
     .           }
     .           
     .           impl<'tcx> CommonTypes<'tcx> {
     .               fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
   111 ( 0.00%)          let mk = |ty| interners.intern_ty(ty);
     .           
     .                   CommonTypes {
     .                       unit: mk(Tuple(List::empty())),
     .                       bool: mk(Bool),
     .                       char: mk(Char),
     .                       never: mk(Never),
     .                       isize: mk(Int(ty::IntTy::Isize)),
     .                       i8: mk(Int(ty::IntTy::I8)),
-- line 906 ----------------------------------------
-- line 921 ----------------------------------------
     .           
     .                       trait_object_dummy_self: mk(Infer(ty::FreshTy(0))),
     .                   }
     .               }
     .           }
     .           
     .           impl<'tcx> CommonLifetimes<'tcx> {
     .               fn new(interners: &CtxtInterners<'tcx>) -> CommonLifetimes<'tcx> {
    67 ( 0.00%)          let mk = |r| interners.region.intern(r, |r| Interned(interners.arena.alloc(r))).0;
     .           
     .                   CommonLifetimes {
     5 ( 0.00%)              re_root_empty: mk(RegionKind::ReEmpty(ty::UniverseIndex::ROOT)),
     5 ( 0.00%)              re_static: mk(RegionKind::ReStatic),
     5 ( 0.00%)              re_erased: mk(RegionKind::ReErased),
     .                   }
     .               }
     .           }
     .           
     .           impl<'tcx> CommonConsts<'tcx> {
     .               fn new(interners: &CtxtInterners<'tcx>, types: &CommonTypes<'tcx>) -> CommonConsts<'tcx> {
     6 ( 0.00%)          let mk_const = |c| interners.const_.intern(c, |c| Interned(interners.arena.alloc(c))).0;
     .           
     .                   CommonConsts {
     .                       unit: mk_const(ty::Const {
     .                           val: ty::ConstKind::Value(ConstValue::Scalar(Scalar::ZST)),
     .                           ty: types.unit,
     .                       }),
     .                   }
     .               }
-- line 949 ----------------------------------------
-- line 1045 ----------------------------------------
     .           
     .               /// Stores memory for globals (statics/consts).
     .               pub(crate) alloc_map: Lock<interpret::AllocMap<'tcx>>,
     .           
     .               output_filenames: Arc<OutputFilenames>,
     .           }
     .           
     .           impl<'tcx> TyCtxt<'tcx> {
   740 ( 0.00%)      pub fn typeck_opt_const_arg(
     .                   self,
     .                   def: ty::WithOptConstParam<LocalDefId>,
     .               ) -> &'tcx TypeckResults<'tcx> {
   296 ( 0.00%)          if let Some(param_did) = def.const_param_did {
     .                       self.typeck_const_arg((def.did, param_did))
     .                   } else {
     .                       self.typeck(def.did)
     .                   }
   592 ( 0.00%)      }
     .           
    51 ( 0.00%)      pub fn alloc_steal_thir(self, thir: Thir<'tcx>) -> &'tcx Steal<Thir<'tcx>> {
    17 ( 0.00%)          self.arena.alloc(Steal::new(thir))
    68 ( 0.00%)      }
     .           
   270 ( 0.00%)      pub fn alloc_steal_mir(self, mir: Body<'tcx>) -> &'tcx Steal<Body<'tcx>> {
    54 ( 0.00%)          self.arena.alloc(Steal::new(mir))
   378 ( 0.00%)      }
     .           
    68 ( 0.00%)      pub fn alloc_steal_promoted(
     .                   self,
     .                   promoted: IndexVec<Promoted, Body<'tcx>>,
     .               ) -> &'tcx Steal<IndexVec<Promoted, Body<'tcx>>> {
    17 ( 0.00%)          self.arena.alloc(Steal::new(promoted))
    85 ( 0.00%)      }
     .           
   360 ( 0.00%)      pub fn alloc_adt_def(
     .                   self,
     .                   did: DefId,
     .                   kind: AdtKind,
     .                   variants: IndexVec<VariantIdx, ty::VariantDef>,
     .                   repr: ReprOptions,
     .               ) -> &'tcx ty::AdtDef {
   640 ( 0.00%)          self.intern_adt_def(ty::AdtDef::new(self, did, kind, variants, repr))
   160 ( 0.00%)      }
     .           
     .               /// Allocates a read-only byte or string literal for `mir::interpret`.
     .               pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
     .                   // Create an allocation that just contains these bytes.
     .                   let alloc = interpret::Allocation::from_bytes_byte_aligned_immutable(bytes);
     .                   let alloc = self.intern_const_alloc(alloc);
     .                   self.create_memory_alloc(alloc)
     .               }
     .           
     .               /// Returns a range of the start/end indices specified with the
     .               /// `rustc_layout_scalar_valid_range` attribute.
     .               // FIXME(eddyb) this is an awkward spot for this method, maybe move it?
   320 ( 0.00%)      pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
   160 ( 0.00%)          let attrs = self.get_attrs(def_id);
   680 ( 0.00%)          let get = |name| {
   160 ( 0.00%)              let attr = match attrs.iter().find(|a| a.has_name(name)) {
     .                           Some(attr) => attr,
     .                           None => return Bound::Unbounded,
     .                       };
     .                       debug!("layout_scalar_valid_range: attr={:?}", attr);
     .                       if let Some(
     .                           &[
     .                               ast::NestedMetaItem::Literal(ast::Lit {
     .                                   kind: ast::LitKind::Int(a, _), ..
-- line 1111 ----------------------------------------
-- line 1114 ----------------------------------------
     .                       ) = attr.meta_item_list().as_deref()
     .                       {
     .                           Bound::Included(a)
     .                       } else {
     .                           self.sess
     .                               .delay_span_bug(attr.span, "invalid rustc_layout_scalar_valid_range attribute");
     .                           Bound::Unbounded
     .                       }
   800 ( 0.00%)          };
   240 ( 0.00%)          (
   240 ( 0.00%)              get(sym::rustc_layout_scalar_valid_range_start),
   120 ( 0.00%)              get(sym::rustc_layout_scalar_valid_range_end),
     .                   )
   320 ( 0.00%)      }
     .           
     .               pub fn lift<T: Lift<'tcx>>(self, value: T) -> Option<T::Lifted> {
     .                   value.lift_to_tcx(self)
     .               }
     .           
     .               /// Creates a type context and call the closure with a `TyCtxt` reference
     .               /// to the context. The closure enforces that the type context and any interned
     .               /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
     .               /// reference to the context, to allow formatting values that need it.
    23 ( 0.00%)      pub fn create_global_ctxt(
     .                   s: &'tcx Session,
     .                   lint_store: Lrc<dyn Any + sync::Send + sync::Sync>,
     .                   arena: &'tcx WorkerLocal<Arena<'tcx>>,
     .                   resolutions: ty::ResolverOutputs,
     .                   krate: &'tcx hir::Crate<'tcx>,
     .                   dep_graph: DepGraph,
     .                   on_disk_cache: Option<&'tcx dyn OnDiskCache<'tcx>>,
     .                   queries: &'tcx dyn query::QueryEngine<'tcx>,
     .                   query_kinds: &'tcx [DepKindStruct],
     .                   crate_name: &str,
     .                   output_filenames: OutputFilenames,
     .               ) -> GlobalCtxt<'tcx> {
     1 ( 0.00%)          let data_layout = TargetDataLayout::parse(&s.target).unwrap_or_else(|err| {
     .                       s.fatal(&err);
     .                   });
     .                   let interners = CtxtInterners::new(arena);
     .                   let common_types = CommonTypes::new(&interners);
     .                   let common_lifetimes = CommonLifetimes::new(&interners);
     .                   let common_consts = CommonConsts::new(&interners, &common_types);
     .           
   127 ( 0.00%)          GlobalCtxt {
     .                       sess: s,
     6 ( 0.00%)              lint_store,
     .                       arena,
     2 ( 0.00%)              interners,
     5 ( 0.00%)              dep_graph,
     4 ( 0.00%)              untracked_resolutions: resolutions,
     2 ( 0.00%)              prof: s.prof.clone(),
     .                       types: common_types,
     .                       lifetimes: common_lifetimes,
     .                       consts: common_consts,
     .                       untracked_crate: krate,
     .                       on_disk_cache,
     .                       queries,
     .                       query_caches: query::QueryCaches::default(),
     .                       query_kinds,
     .                       ty_rcache: Default::default(),
     .                       pred_rcache: Default::default(),
     .                       selection_cache: Default::default(),
     .                       evaluation_cache: Default::default(),
     1 ( 0.00%)              crate_name: Symbol::intern(crate_name),
     .                       data_layout,
     .                       alloc_map: Lock::new(interpret::AllocMap::new()),
     .                       output_filenames: Arc::new(output_filenames),
     .                   }
     9 ( 0.00%)      }
     .           
     .               crate fn query_kind(self, k: DepKind) -> &'tcx DepKindStruct {
     .                   &self.query_kinds[k as usize]
     .               }
     .           
     .               /// Constructs a `TyKind::Error` type and registers a `delay_span_bug` to ensure it gets used.
     .               #[track_caller]
     .               pub fn ty_error(self) -> Ty<'tcx> {
-- line 1191 ----------------------------------------
-- line 1217 ----------------------------------------
     .                   ty: Ty<'tcx>,
     .                   span: S,
     .                   msg: &str,
     .               ) -> &'tcx Const<'tcx> {
     .                   self.sess.delay_span_bug(span, msg);
     .                   self.mk_const(ty::Const { val: ty::ConstKind::Error(DelaySpanBugEmitted(())), ty })
     .               }
     .           
    21 ( 0.00%)      pub fn consider_optimizing<T: Fn() -> String>(self, msg: T) -> bool {
     3 ( 0.00%)          let cname = self.crate_name(LOCAL_CRATE);
    24 ( 0.00%)          self.sess.consider_optimizing(cname.as_str(), msg)
    24 ( 0.00%)      }
     .           
     .               /// Obtain all lang items of this crate and all dependencies (recursively)
18,277 ( 0.01%)      pub fn lang_items(self) -> &'tcx rustc_hir::lang_items::LanguageItems {
     .                   self.get_lang_items(())
23,499 ( 0.02%)      }
     .           
     .               /// Obtain the given diagnostic item's `DefId`. Use `is_diagnostic_item` if you just want to
     .               /// compare against another `DefId`, since `is_diagnostic_item` is cheaper.
   119 ( 0.00%)      pub fn get_diagnostic_item(self, name: Symbol) -> Option<DefId> {
     .                   self.all_diagnostic_items(()).name_to_id.get(&name).copied()
   136 ( 0.00%)      }
     .           
     .               /// Obtain the diagnostic item's name
   476 ( 0.00%)      pub fn get_diagnostic_name(self, id: DefId) -> Option<Symbol> {
     .                   self.diagnostic_items(id.krate).id_to_name.get(&id).copied()
   544 ( 0.00%)      }
     .           
     .               /// Check whether the diagnostic item with the given `name` has the given `DefId`.
   798 ( 0.00%)      pub fn is_diagnostic_item(self, name: Symbol, did: DefId) -> bool {
     .                   self.diagnostic_items(did.krate).name_to_id.get(&name) == Some(&did)
   912 ( 0.00%)      }
     .           
   252 ( 0.00%)      pub fn stability(self) -> &'tcx stability::Index<'tcx> {
     .                   self.stability_index(())
   324 ( 0.00%)      }
     .           
 8,022 ( 0.01%)      pub fn features(self) -> &'tcx rustc_feature::Features {
     .                   self.features_query(())
 9,168 ( 0.01%)      }
     .           
     .               pub fn def_key(self, id: DefId) -> rustc_hir::definitions::DefKey {
     .                   // Accessing the DefKey is ok, since it is part of DefPathHash.
   598 ( 0.00%)          if let Some(id) = id.as_local() {
     .                       self.untracked_resolutions.definitions.def_key(id)
     .                   } else {
   525 ( 0.00%)              self.untracked_resolutions.cstore.def_key(id)
     .                   }
     .               }
     .           
     .               /// Converts a `DefId` into its fully expanded `DefPath` (every
     .               /// `DefId` is really just an interned `DefPath`).
     .               ///
     .               /// Note that if `id` is not local to this crate, the result will
     .               ///  be a non-local `DefPath`.
-- line 1272 ----------------------------------------
-- line 1277 ----------------------------------------
     .                   } else {
     .                       self.untracked_resolutions.cstore.def_path(id)
     .                   }
     .               }
     .           
     .               #[inline]
     .               pub fn def_path_hash(self, def_id: DefId) -> rustc_hir::definitions::DefPathHash {
     .                   // Accessing the DefPathHash is ok, it is incr. comp. stable.
   153 ( 0.00%)          if let Some(def_id) = def_id.as_local() {
     .                       self.untracked_resolutions.definitions.def_path_hash(def_id)
     .                   } else {
    44 ( 0.00%)              self.untracked_resolutions.cstore.def_path_hash(def_id)
     .                   }
     .               }
     .           
     .               #[inline]
     .               pub fn stable_crate_id(self, crate_num: CrateNum) -> StableCrateId {
     .                   if crate_num == LOCAL_CRATE {
     .                       self.sess.local_stable_crate_id()
     .                   } else {
-- line 1296 ----------------------------------------
-- line 1353 ----------------------------------------
     .                       &(format!("{:08x}", stable_crate_id.to_u64()))[..4],
     .                       self.def_path(def_id).to_string_no_crate_verbose()
     .                   )
     .               }
     .           
     .               /// Note that this is *untracked* and should only be used within the query
     .               /// system if the result is otherwise tracked through queries
     .               pub fn cstore_untracked(self) -> &'tcx ty::CrateStoreDyn {
17,374 ( 0.01%)          &*self.untracked_resolutions.cstore
 8,687 ( 0.01%)      }
     .           
     .               /// Note that this is *untracked* and should only be used within the query
     .               /// system if the result is otherwise tracked through queries
     .               pub fn definitions_untracked(self) -> &'tcx hir::definitions::Definitions {
     .                   &self.untracked_resolutions.definitions
     .               }
     .           
     .               #[inline(always)]
     .               pub fn create_stable_hashing_context(self) -> StableHashingContext<'tcx> {
     1 ( 0.00%)          let resolutions = &self.gcx.untracked_resolutions;
     4 ( 0.00%)          StableHashingContext::new(self.sess, &resolutions.definitions, &*resolutions.cstore)
     .               }
     .           
     .               #[inline(always)]
     .               pub fn create_no_span_stable_hashing_context(self) -> StableHashingContext<'tcx> {
     .                   let resolutions = &self.gcx.untracked_resolutions;
     .                   StableHashingContext::ignore_spans(
     .                       self.sess,
     .                       &resolutions.definitions,
-- line 1381 ----------------------------------------
-- line 1390 ----------------------------------------
     .               /// If `true`, we should use the MIR-based borrowck, but also
     .               /// fall back on the AST borrowck if the MIR-based one errors.
     .               pub fn migrate_borrowck(self) -> bool {
     .                   self.borrowck_mode().migrate()
     .               }
     .           
     .               /// What mode(s) of borrowck should we run? AST? MIR? both?
     .               /// (Also considers the `#![feature(nll)]` setting.)
    34 ( 0.00%)      pub fn borrowck_mode(self) -> BorrowckMode {
     .                   // Here are the main constraints we need to deal with:
     .                   //
     .                   // 1. An opts.borrowck_mode of `BorrowckMode::Migrate` is
     .                   //    synonymous with no `-Z borrowck=...` flag at all.
     .                   //
     .                   // 2. We want to allow developers on the Nightly channel
     .                   //    to opt back into the "hard error" mode for NLL,
     .                   //    (which they can do via specifying `#![feature(nll)]`
-- line 1406 ----------------------------------------
-- line 1413 ----------------------------------------
     .                   //   errors. (To simplify the code here, it now even overrides
     .                   //   a user's attempt to specify `-Z borrowck=compare`, which
     .                   //   we arguably do not need anymore and should remove.)
     .                   //
     .                   // * Otherwise, if no `-Z borrowck=...` then use migrate mode
     .                   //
     .                   // * Otherwise, use the behavior requested via `-Z borrowck=...`
     .           
    51 ( 0.00%)          if self.features().nll {
     .                       return BorrowckMode::Mir;
     .                   }
     .           
    17 ( 0.00%)          self.sess.opts.borrowck_mode
    68 ( 0.00%)      }
     .           
     .               /// If `true`, we should use lazy normalization for constants, otherwise
     .               /// we still evaluate them eagerly.
     .               #[inline]
     .               pub fn lazy_normalization(self) -> bool {
     .                   let features = self.features();
     .                   // Note: We only use lazy normalization for generic const expressions.
     .                   features.generic_const_exprs
-- line 1434 ----------------------------------------
-- line 1554 ----------------------------------------
     .                   self.mk_imm_ref(
     .                       self.lifetimes.re_static,
     .                       self.type_of(self.require_lang_item(LangItem::PanicLocation, None))
     .                           .subst(self, self.mk_substs([self.lifetimes.re_static.into()].iter())),
     .                   )
     .               }
     .           
     .               /// Returns a displayable description and article for the given `def_id` (e.g. `("a", "struct")`).
   176 ( 0.00%)      pub fn article_and_description(self, def_id: DefId) -> (&'static str, &'static str) {
   128 ( 0.00%)          match self.def_kind(def_id) {
     .                       DefKind::Generator => match self.generator_kind(def_id).unwrap() {
     .                           rustc_hir::GeneratorKind::Async(..) => ("an", "async closure"),
     .                           rustc_hir::GeneratorKind::Gen => ("a", "generator"),
     .                       },
   288 ( 0.00%)              def_kind => (def_kind.article(), def_kind.descr(def_id)),
     .                   }
   144 ( 0.00%)      }
     .           
     .               pub fn type_length_limit(self) -> Limit {
     .                   self.limits(()).type_length_limit
     .               }
     .           
 5,670 ( 0.00%)      pub fn recursion_limit(self) -> Limit {
     .                   self.limits(()).recursion_limit
 6,480 ( 0.01%)      }
     .           
     .               pub fn move_size_limit(self) -> Limit {
     .                   self.limits(()).move_size_limit
     .               }
     .           
    42 ( 0.00%)      pub fn const_eval_limit(self) -> Limit {
     .                   self.limits(()).const_eval_limit
    48 ( 0.00%)      }
     .           
     .               pub fn all_traits(self) -> impl Iterator<Item = DefId> + 'tcx {
     .                   iter::once(LOCAL_CRATE)
     .                       .chain(self.crates(()).iter().copied())
     .                       .flat_map(move |cnum| self.traits_in_crate(cnum).iter().copied())
     .               }
     .           }
     .           
-- line 1594 ----------------------------------------
-- line 1684 ----------------------------------------
     .               /// This is the implicit state of rustc. It contains the current
     .               /// `TyCtxt` and query. It is updated when creating a local interner or
     .               /// executing a new query. Whenever there's a `TyCtxt` value available
     .               /// you should also have access to an `ImplicitCtxt` through the functions
     .               /// in this module.
     .               #[derive(Clone)]
     .               pub struct ImplicitCtxt<'a, 'tcx> {
     .                   /// The current `TyCtxt`.
     1 ( 0.00%)          pub tcx: TyCtxt<'tcx>,
     .           
     .                   /// The current query job, if any. This is updated by `JobOwner::start` in
     .                   /// `ty::query::plumbing` when executing a query.
     .                   pub query: Option<query::QueryJobId<DepKind>>,
     .           
     .                   /// Where to store diagnostics for the current query job, if any.
     .                   /// This is updated by `JobOwner::start` in `ty::query::plumbing` when executing a query.
     .                   pub diagnostics: Option<&'a Lock<ThinVec<Diagnostic>>>,
-- line 1700 ----------------------------------------
-- line 1703 ----------------------------------------
     .                   pub layout_depth: usize,
     .           
     .                   /// The current dep graph task. This is used to add dependencies to queries
     .                   /// when executing them.
     .                   pub task_deps: TaskDepsRef<'a>,
     .               }
     .           
     .               impl<'a, 'tcx> ImplicitCtxt<'a, 'tcx> {
     5 ( 0.00%)          pub fn new(gcx: &'tcx GlobalCtxt<'tcx>) -> Self {
     .                       let tcx = TyCtxt { gcx };
    25 ( 0.00%)              ImplicitCtxt {
     .                           tcx,
     .                           query: None,
     .                           diagnostics: None,
     .                           layout_depth: 0,
     .                           task_deps: TaskDepsRef::Ignore,
     .                       }
     5 ( 0.00%)          }
     .               }
     .           
     .               /// Sets Rayon's thread-local variable, which is preserved for Rayon jobs
     .               /// to `value` during the call to `f`. It is restored to its previous value after.
     .               /// This is used to set the pointer to the new `ImplicitCtxt`.
     .               #[cfg(parallel_compiler)]
     .               #[inline]
     .               fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
-- line 1728 ----------------------------------------
-- line 1745 ----------------------------------------
     .           
     .               /// Sets TLV to `value` during the call to `f`.
     .               /// It is restored to its previous value after.
     .               /// This is used to set the pointer to the new `ImplicitCtxt`.
     .               #[cfg(not(parallel_compiler))]
     .               #[inline]
     .               fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
     .                   let old = get_tlv();
11,045 ( 0.01%)          let _reset = rustc_data_structures::OnDrop(move || TLV.with(|tlv| tlv.set(old)));
     .                   TLV.with(|tlv| tlv.set(value));
     .                   f()
     .               }
     .           
     .               /// Gets the pointer to the current `ImplicitCtxt`.
     .               #[cfg(not(parallel_compiler))]
     .               #[inline]
     .               fn get_tlv() -> usize {
-- line 1761 ----------------------------------------
-- line 1763 ----------------------------------------
     .               }
     .           
     .               /// Sets `context` as the new current `ImplicitCtxt` for the duration of the function `f`.
     .               #[inline]
     .               pub fn enter_context<'a, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'tcx>, f: F) -> R
     .               where
     .                   F: FnOnce(&ImplicitCtxt<'a, 'tcx>) -> R,
     .               {
     1 ( 0.00%)          set_tlv(context as *const _ as usize, || f(&context))
     .               }
     .           
     .               /// Allows access to the current `ImplicitCtxt` in a closure if one is available.
     .               #[inline]
     .               pub fn with_context_opt<F, R>(f: F) -> R
     .               where
     .                   F: for<'a, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'tcx>>) -> R,
     .               {
     .                   let context = get_tlv();
44,443 ( 0.04%)          if context == 0 {
     .                       f(None)
     .                   } else {
     .                       // We could get an `ImplicitCtxt` pointer from another thread.
     .                       // Ensure that `ImplicitCtxt` is `Sync`.
     .                       sync::assert_sync::<ImplicitCtxt<'_, '_>>();
     .           
     .                       unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_>))) }
     .                   }
-- line 1789 ----------------------------------------
-- line 1805 ----------------------------------------
     .               /// This will panic if you pass it a `TyCtxt` which is different from the current
     .               /// `ImplicitCtxt`'s `tcx` field.
     .               #[inline]
     .               pub fn with_related_context<'tcx, F, R>(tcx: TyCtxt<'tcx>, f: F) -> R
     .               where
     .                   F: FnOnce(&ImplicitCtxt<'_, 'tcx>) -> R,
     .               {
     .                   with_context(|context| unsafe {
22,082 ( 0.02%)              assert!(ptr_eq(context.tcx.gcx, tcx.gcx));
     .                       let context: &ImplicitCtxt<'_, '_> = mem::transmute(context);
22,078 ( 0.02%)              f(context)
     .                   })
     .               }
     .           
     .               /// Allows access to the `TyCtxt` in the current `ImplicitCtxt`.
     .               /// Panics if there is no `ImplicitCtxt` available.
     .               #[inline]
     .               pub fn with<F, R>(f: F) -> R
     .               where
-- line 1823 ----------------------------------------
-- line 1981 ----------------------------------------
     .               fn into_pointer(&self) -> *const () {
     .                   self.0 as *const _ as *const ()
     .               }
     .           }
     .           
     .           #[allow(rustc::usage_of_ty_tykind)]
     .           impl<'tcx> Borrow<TyKind<'tcx>> for Interned<'tcx, TyS<'tcx>> {
     .               fn borrow<'a>(&'a self) -> &'a TyKind<'tcx> {
 4,763 ( 0.00%)          &self.0.kind()
     .               }
     .           }
     .           
     .           impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
     .               fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
     .                   // The `Borrow` trait requires that `x.borrow() == y.borrow()` equals
     .                   // `x == y`.
     .                   self.0.kind() == other.0.kind()
-- line 1997 ----------------------------------------
-- line 1998 ----------------------------------------
     .               }
     .           }
     .           
     .           impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
     .           
     .           impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
     .               fn hash<H: Hasher>(&self, s: &mut H) {
     .                   // The `Borrow` trait requires that `x.borrow().hash(s) == x.hash(s)`.
10,740 ( 0.01%)          self.0.kind().hash(s)
     .               }
     .           }
     .           
     .           impl<'tcx> Borrow<Binder<'tcx, PredicateKind<'tcx>>> for Interned<'tcx, PredicateInner<'tcx>> {
     .               fn borrow<'a>(&'a self) -> &'a Binder<'tcx, PredicateKind<'tcx>> {
   903 ( 0.00%)          &self.0.kind
     .               }
     .           }
     .           
     .           impl<'tcx> PartialEq for Interned<'tcx, PredicateInner<'tcx>> {
     .               fn eq(&self, other: &Interned<'tcx, PredicateInner<'tcx>>) -> bool {
     .                   // The `Borrow` trait requires that `x.borrow() == y.borrow()` equals
     .                   // `x == y`.
     .                   self.0.kind == other.0.kind
-- line 2020 ----------------------------------------
-- line 2021 ----------------------------------------
     .               }
     .           }
     .           
     .           impl<'tcx> Eq for Interned<'tcx, PredicateInner<'tcx>> {}
     .           
     .           impl<'tcx> Hash for Interned<'tcx, PredicateInner<'tcx>> {
     .               fn hash<H: Hasher>(&self, s: &mut H) {
     .                   // The `Borrow` trait requires that `x.borrow().hash(s) == x.hash(s)`.
   892 ( 0.00%)          self.0.kind.hash(s)
     .               }
     .           }
     .           
     .           impl<'tcx, T> Borrow<[T]> for Interned<'tcx, List<T>> {
     .               fn borrow<'a>(&'a self) -> &'a [T] {
 5,852 ( 0.00%)          &self.0[..]
     .               }
     .           }
     .           
     .           impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
     .               fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
     .                   // The `Borrow` trait requires that `x.borrow() == y.borrow()` equals
     .                   // `x == y`.
     .                   self.0[..] == other.0[..]
-- line 2043 ----------------------------------------
-- line 2044 ----------------------------------------
     .               }
     .           }
     .           
     .           impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
     .           
     .           impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
     .               fn hash<H: Hasher>(&self, s: &mut H) {
     .                   // The `Borrow` trait requires that `x.borrow().hash(s) == x.hash(s)`.
 4,071 ( 0.00%)          self.0[..].hash(s)
     .               }
     .           }
     .           
     .           macro_rules! direct_interners {
     .               ($($name:ident: $method:ident($ty:ty),)+) => {
     .                   $(impl<'tcx> Borrow<$ty> for Interned<'tcx, $ty> {
     .                       fn borrow<'a>(&'a self) -> &'a $ty {
 2,174 ( 0.00%)                  &self.0
     .                       }
     .                   }
     .           
     .                   impl<'tcx> PartialEq for Interned<'tcx, $ty> {
     .                       fn eq(&self, other: &Self) -> bool {
     .                           // The `Borrow` trait requires that `x.borrow() == y.borrow()`
     .                           // equals `x == y`.
     .                           self.0 == other.0
-- line 2068 ----------------------------------------
-- line 2070 ----------------------------------------
     .                   }
     .           
     .                   impl<'tcx> Eq for Interned<'tcx, $ty> {}
     .           
     .                   impl<'tcx> Hash for Interned<'tcx, $ty> {
     .                       fn hash<H: Hasher>(&self, s: &mut H) {
     .                           // The `Borrow` trait requires that `x.borrow().hash(s) ==
     .                           // x.hash(s)`.
 6,168 ( 0.00%)                  self.0.hash(s)
     .                       }
     .                   }
     .           
     .                   impl<'tcx> TyCtxt<'tcx> {
25,949 ( 0.02%)              pub fn $method(self, v: $ty) -> &'tcx $ty {
13,262 ( 0.01%)                  self.interners.$name.intern(v, |v| {
 1,151 ( 0.00%)                      Interned(self.interners.arena.alloc(v))
     .                           }).0
28,971 ( 0.02%)              }
     .                   })+
     .               }
     .           }
     .           
     .           direct_interners! {
     .               region: mk_region(RegionKind),
     .               const_: mk_const(Const<'tcx>),
     .               const_allocation: intern_const_alloc(Allocation),
-- line 2095 ----------------------------------------
-- line 2097 ----------------------------------------
     .               adt_def: intern_adt_def(AdtDef),
     .               stability: intern_stability(attr::Stability),
     .               const_stability: intern_const_stability(attr::ConstStability),
     .           }
     .           
     .           macro_rules! slice_interners {
     .               ($($field:ident: $method:ident($ty:ty)),+ $(,)?) => (
     .                   impl<'tcx> TyCtxt<'tcx> {
91,842 ( 0.07%)              $(pub fn $method(self, v: &[$ty]) -> &'tcx List<$ty> {
     .                           self.interners.$field.intern_ref(v, || {
     .                               Interned(List::from_arena(&*self.arena, v))
     .                           }).0
82,332 ( 0.07%)              })+
     .                   }
     .               );
     .           }
     .           
     .           slice_interners!(
     .               type_list: _intern_type_list(Ty<'tcx>),
     .               substs: _intern_substs(GenericArg<'tcx>),
     .               canonical_var_infos: _intern_canonical_var_infos(CanonicalVarInfo<'tcx>),
-- line 2117 ----------------------------------------
-- line 2188 ----------------------------------------
     .                       self.mk_fn_sig(params_iter, s.output(), s.c_variadic, unsafety, abi::Abi::Rust)
     .                   })
     .               }
     .           
     .               /// Same a `self.mk_region(kind)`, but avoids accessing the interners if
     .               /// `*r == kind`.
     .               #[inline]
     .               pub fn reuse_or_mk_region(self, r: Region<'tcx>, kind: RegionKind) -> Region<'tcx> {
 2,052 ( 0.00%)          if *r == kind { r } else { self.mk_region(kind) }
     .               }
     .           
     .               #[allow(rustc::usage_of_ty_tykind)]
     .               #[inline]
     .               pub fn mk_ty(self, st: TyKind<'tcx>) -> Ty<'tcx> {
57,253 ( 0.05%)          self.interners.intern_ty(st)
     .               }
     .           
     .               #[inline]
     .               pub fn mk_predicate(self, binder: Binder<'tcx, PredicateKind<'tcx>>) -> Predicate<'tcx> {
18,513 ( 0.01%)          let inner = self.interners.intern_predicate(binder);
     .                   Predicate { inner }
     .               }
     .           
     .               #[inline]
10,480 ( 0.01%)      pub fn reuse_or_mk_predicate(
     .                   self,
     .                   pred: Predicate<'tcx>,
     .                   binder: Binder<'tcx, PredicateKind<'tcx>>,
     .               ) -> Predicate<'tcx> {
   605 ( 0.00%)          if pred.kind() != binder { self.mk_predicate(binder) } else { pred }
10,480 ( 0.01%)      }
     .           
     .               pub fn mk_mach_int(self, tm: IntTy) -> Ty<'tcx> {
     .                   match tm {
     .                       IntTy::Isize => self.types.isize,
     .                       IntTy::I8 => self.types.i8,
     .                       IntTy::I16 => self.types.i16,
     .                       IntTy::I32 => self.types.i32,
     .                       IntTy::I64 => self.types.i64,
     .                       IntTy::I128 => self.types.i128,
     .                   }
     .               }
     .           
     .               pub fn mk_mach_uint(self, tm: UintTy) -> Ty<'tcx> {
     6 ( 0.00%)          match tm {
     .                       UintTy::Usize => self.types.usize,
     .                       UintTy::U8 => self.types.u8,
     .                       UintTy::U16 => self.types.u16,
     .                       UintTy::U32 => self.types.u32,
     .                       UintTy::U64 => self.types.u64,
     .                       UintTy::U128 => self.types.u128,
     .                   }
     6 ( 0.00%)      }
     .           
     .               pub fn mk_mach_float(self, tm: FloatTy) -> Ty<'tcx> {
     .                   match tm {
     .                       FloatTy::F32 => self.types.f32,
     .                       FloatTy::F64 => self.types.f64,
     .                   }
     .               }
     .           
     .               #[inline]
     .               pub fn mk_static_str(self) -> Ty<'tcx> {
    12 ( 0.00%)          self.mk_imm_ref(self.lifetimes.re_static, self.types.str_)
     .               }
     .           
     .               #[inline]
     .               pub fn mk_adt(self, def: &'tcx AdtDef, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
     .                   // Take a copy of substs so that we own the vectors inside.
     .                   self.mk_ty(Adt(def, substs))
     .               }
     .           
-- line 2259 ----------------------------------------
-- line 2329 ----------------------------------------
     .               }
     .           
     .               #[inline]
     .               pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
     .                   self.mk_ptr(TypeAndMut { ty, mutbl: hir::Mutability::Not })
     .               }
     .           
     .               #[inline]
   138 ( 0.00%)      pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
     .                   self.mk_ty(Array(ty, ty::Const::from_usize(self, n)))
   144 ( 0.00%)      }
     .           
     .               #[inline]
     .               pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
     .                   self.mk_ty(Slice(ty))
     .               }
     .           
     .               #[inline]
     .               pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
     .                   let kinds: Vec<_> = ts.iter().map(|&t| GenericArg::from(t)).collect();
     .                   self.mk_ty(Tuple(self.intern_substs(&kinds)))
     .               }
     .           
     .               pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
   250 ( 0.00%)          iter.intern_with(|ts| {
   102 ( 0.00%)              let kinds: Vec<_> = ts.iter().map(|&t| GenericArg::from(t)).collect();
   640 ( 0.00%)              self.mk_ty(Tuple(self.intern_substs(&kinds)))
   225 ( 0.00%)          })
     .               }
     .           
     .               #[inline]
     .               pub fn mk_unit(self) -> Ty<'tcx> {
    11 ( 0.00%)          self.types.unit
     .               }
     .           
     .               #[inline]
     .               pub fn mk_diverging_default(self) -> Ty<'tcx> {
     .                   if self.features().never_type_fallback { self.types.never } else { self.types.unit }
     .               }
     .           
     .               #[inline]
     .               pub fn mk_fn_def(self, def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
     .                   self.mk_ty(FnDef(def_id, substs))
     .               }
     .           
     .               #[inline]
     .               pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
    34 ( 0.00%)          self.mk_ty(FnPtr(fty))
     .               }
     .           
     .               #[inline]
     .               pub fn mk_dynamic(
     .                   self,
     .                   obj: &'tcx List<ty::Binder<'tcx, ExistentialPredicate<'tcx>>>,
     .                   reg: ty::Region<'tcx>,
     .               ) -> Ty<'tcx> {
-- line 2384 ----------------------------------------
-- line 2445 ----------------------------------------
     .                   self.mk_ty(Param(ParamTy { index, name }))
     .               }
     .           
     .               #[inline]
     .               pub fn mk_const_param(self, index: u32, name: Symbol, ty: Ty<'tcx>) -> &'tcx Const<'tcx> {
     .                   self.mk_const(ty::Const { val: ty::ConstKind::Param(ParamConst { index, name }), ty })
     .               }
     .           
    77 ( 0.00%)      pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> GenericArg<'tcx> {
    55 ( 0.00%)          match param.kind {
     .                       GenericParamDefKind::Lifetime => {
     .                           self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
     .                       }
    22 ( 0.00%)              GenericParamDefKind::Type { .. } => self.mk_ty_param(param.index, param.name).into(),
     .                       GenericParamDefKind::Const { .. } => {
     .                           self.mk_const_param(param.index, param.name, self.type_of(param.def_id)).into()
     .                       }
     .                   }
    77 ( 0.00%)      }
     .           
     .               #[inline]
     .               pub fn mk_opaque(self, def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
     .                   self.mk_ty(Opaque(def_id, substs))
     .               }
     .           
     .               pub fn mk_place_field(self, place: Place<'tcx>, f: Field, ty: Ty<'tcx>) -> Place<'tcx> {
     .                   self.mk_place_elem(place, PlaceElem::Field(f, ty))
-- line 2471 ----------------------------------------
-- line 2504 ----------------------------------------
     .               /// flight.
     .               pub fn mk_place_elem(self, place: Place<'tcx>, elem: PlaceElem<'tcx>) -> Place<'tcx> {
     .                   let mut projection = place.projection.to_vec();
     .                   projection.push(elem);
     .           
     .                   Place { local: place.local, projection: self.intern_place_elems(&projection) }
     .               }
     .           
    42 ( 0.00%)      pub fn intern_poly_existential_predicates(
     .                   self,
     .                   eps: &[ty::Binder<'tcx, ExistentialPredicate<'tcx>>],
     .               ) -> &'tcx List<ty::Binder<'tcx, ExistentialPredicate<'tcx>>> {
     6 ( 0.00%)          assert!(!eps.is_empty());
     .                   assert!(
     .                       eps.array_windows()
    30 ( 0.00%)                  .all(|[a, b]| a.skip_binder().stable_cmp(self, &b.skip_binder())
     .                               != Ordering::Greater)
     .                   );
    24 ( 0.00%)          self._intern_poly_existential_predicates(eps)
    48 ( 0.00%)      }
     .           
     .               pub fn intern_predicates(self, preds: &[Predicate<'tcx>]) -> &'tcx List<Predicate<'tcx>> {
     .                   // FIXME consider asking the input slice to be sorted to avoid
     .                   // re-interning permutations, in which case that would be asserted
     .                   // here.
   306 ( 0.00%)          if preds.is_empty() {
     .                       // The macro-generated method below asserts we don't intern an empty slice.
     .                       List::empty()
     .                   } else {
    54 ( 0.00%)              self._intern_predicates(preds)
     .                   }
   504 ( 0.00%)      }
     .           
     .               pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
 1,059 ( 0.00%)          if ts.is_empty() { List::empty() } else { self._intern_type_list(ts) }
    46 ( 0.00%)      }
     .           
     .               pub fn intern_substs(self, ts: &[GenericArg<'tcx>]) -> &'tcx List<GenericArg<'tcx>> {
16,947 ( 0.01%)          if ts.is_empty() { List::empty() } else { self._intern_substs(ts) }
 2,518 ( 0.00%)      }
     .           
     .               pub fn intern_projs(self, ps: &[ProjectionKind]) -> &'tcx List<ProjectionKind> {
     .                   if ps.is_empty() { List::empty() } else { self._intern_projs(ps) }
     .               }
     .           
     .               pub fn intern_place_elems(self, ts: &[PlaceElem<'tcx>]) -> &'tcx List<PlaceElem<'tcx>> {
   166 ( 0.00%)          if ts.is_empty() { List::empty() } else { self._intern_place_elems(ts) }
   104 ( 0.00%)      }
     .           
     .               pub fn intern_canonical_var_infos(
     .                   self,
     .                   ts: &[CanonicalVarInfo<'tcx>],
     .               ) -> CanonicalVarInfos<'tcx> {
   604 ( 0.00%)          if ts.is_empty() { List::empty() } else { self._intern_canonical_var_infos(ts) }
    12 ( 0.00%)      }
     .           
     .               pub fn intern_bound_variable_kinds(
     .                   self,
     .                   ts: &[ty::BoundVariableKind],
     .               ) -> &'tcx List<ty::BoundVariableKind> {
   271 ( 0.00%)          if ts.is_empty() { List::empty() } else { self._intern_bound_variable_kinds(ts) }
   404 ( 0.00%)      }
     .           
     .               pub fn mk_fn_sig<I>(
     .                   self,
     .                   inputs: I,
     .                   output: I::Item,
     .                   c_variadic: bool,
     .                   unsafety: hir::Unsafety,
     .                   abi: abi::Abi,
     .               ) -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
     .               where
     .                   I: Iterator<Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>,
     .               {
     .                   inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
    92 ( 0.00%)              inputs_and_output: self.intern_type_list(xs),
    16 ( 0.00%)              c_variadic,
    22 ( 0.00%)              unsafety,
    20 ( 0.00%)              abi,
     .                   })
     .               }
     .           
     .               pub fn mk_poly_existential_predicates<
     .                   I: InternAs<
     .                       [ty::Binder<'tcx, ExistentialPredicate<'tcx>>],
     .                       &'tcx List<ty::Binder<'tcx, ExistentialPredicate<'tcx>>>,
     .                   >,
     .               >(
     .                   self,
     .                   iter: I,
     .               ) -> I::Output {
    18 ( 0.00%)          iter.intern_with(|xs| self.intern_poly_existential_predicates(xs))
     .               }
     .           
     .               pub fn mk_predicates<I: InternAs<[Predicate<'tcx>], &'tcx List<Predicate<'tcx>>>>(
     .                   self,
     .                   iter: I,
     .               ) -> I::Output {
     .                   iter.intern_with(|xs| self.intern_predicates(xs))
     .               }
     .           
     .               pub fn mk_type_list<I: InternAs<[Ty<'tcx>], &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
   396 ( 0.00%)          iter.intern_with(|xs| self.intern_type_list(xs))
     .               }
     .           
     .               pub fn mk_substs<I: InternAs<[GenericArg<'tcx>], &'tcx List<GenericArg<'tcx>>>>(
     .                   self,
     .                   iter: I,
     .               ) -> I::Output {
54,478 ( 0.04%)          iter.intern_with(|xs| self.intern_substs(xs))
     .               }
     .           
     .               pub fn mk_place_elems<I: InternAs<[PlaceElem<'tcx>], &'tcx List<PlaceElem<'tcx>>>>(
     .                   self,
     .                   iter: I,
     .               ) -> I::Output {
     .                   iter.intern_with(|xs| self.intern_place_elems(xs))
     .               }
     .           
   488 ( 0.00%)      pub fn mk_substs_trait(self, self_ty: Ty<'tcx>, rest: &[GenericArg<'tcx>]) -> SubstsRef<'tcx> {
     .                   self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
   976 ( 0.00%)      }
     .           
     .               pub fn mk_bound_variable_kinds<
     .                   I: InternAs<[ty::BoundVariableKind], &'tcx List<ty::BoundVariableKind>>,
     .               >(
     .                   self,
     .                   iter: I,
     .               ) -> I::Output {
 1,985 ( 0.00%)          iter.intern_with(|xs| self.intern_bound_variable_kinds(xs))
     .               }
     .           
     .               /// Walks upwards from `id` to find a node which might change lint levels with attributes.
     .               /// It stops at `bound` and just returns it if reached.
 4,074 ( 0.00%)      pub fn maybe_lint_level_root_bounded(self, mut id: HirId, bound: HirId) -> HirId {
 4,074 ( 0.00%)          let hir = self.hir();
     .                   loop {
 8,922 ( 0.01%)              if id == bound {
     .                           return bound;
     .                       }
     .           
11,960 ( 0.01%)              if hir.attrs(id).iter().any(|attr| Level::from_symbol(attr.name_or_empty()).is_some()) {
     .                           return id;
     .                       }
     .                       let next = hir.get_parent_node(id);
 7,176 ( 0.01%)              if next == id {
     .                           bug!("lint traversal reached the root of the crate");
     .                       }
     .                       id = next;
     .                   }
 5,820 ( 0.00%)      }
     .           
   328 ( 0.00%)      pub fn lint_level_at_node(
     .                   self,
     .                   lint: &'static Lint,
     .                   mut id: hir::HirId,
     .               ) -> (Level, LintLevelSource) {
     .                   let sets = self.lint_levels(());
     .                   loop {
 1,069 ( 0.00%)              if let Some(pair) = sets.level_and_source(lint, id, self.sess) {
     .                           return pair;
     .                       }
    55 ( 0.00%)              let next = self.hir().get_parent_node(id);
   165 ( 0.00%)              if next == id {
     .                           bug!("lint traversal reached the root of the crate");
     .                       }
     .                       id = next;
     .                   }
   328 ( 0.00%)      }
     .           
     .               pub fn struct_span_lint_hir(
     .                   self,
     .                   lint: &'static Lint,
     .                   hir_id: HirId,
     .                   span: impl Into<MultiSpan>,
     .                   decorate: impl for<'a> FnOnce(LintDiagnosticBuilder<'a>),
     .               ) {
    16 ( 0.00%)          let (level, src) = self.lint_level_at_node(lint, hir_id);
     4 ( 0.00%)          struct_lint_level(self.sess, lint, level, src, Some(span.into()), decorate);
     .               }
     .           
     .               pub fn struct_lint_node(
     .                   self,
     .                   lint: &'static Lint,
     .                   id: HirId,
     .                   decorate: impl for<'a> FnOnce(LintDiagnosticBuilder<'a>),
     .               ) {
     .                   let (level, src) = self.lint_level_at_node(lint, id);
     .                   struct_lint_level(self.sess, lint, level, src, None, decorate);
     .               }
     .           
   287 ( 0.00%)      pub fn in_scope_traits(self, id: HirId) -> Option<&'tcx [TraitCandidate]> {
    82 ( 0.00%)          let map = self.in_scope_traits_map(id.owner)?;
     .                   let candidates = map.get(&id.local_id)?;
    82 ( 0.00%)          Some(&*candidates)
   328 ( 0.00%)      }
     .           
   336 ( 0.00%)      pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
     .                   debug!(?id, "named_region");
     .                   self.named_region_map(id.owner).and_then(|map| map.get(&id.local_id).cloned())
   432 ( 0.00%)      }
     .           
     .               pub fn is_late_bound(self, id: HirId) -> bool {
     .                   self.is_late_bound_map(id.owner)
     .                       .map_or(false, |(owner, set)| owner == id.owner && set.contains(&id.local_id))
     .               }
     .           
   343 ( 0.00%)      pub fn object_lifetime_defaults(self, id: HirId) -> Option<Vec<ObjectLifetimeDefault>> {
     .                   self.object_lifetime_defaults_map(id.owner)
   441 ( 0.00%)      }
     .           
   162 ( 0.00%)      pub fn late_bound_vars(self, id: HirId) -> &'tcx List<ty::BoundVariableKind> {
     .                   self.mk_bound_variable_kinds(
     .                       self.late_bound_vars_map(id.owner)
     .                           .and_then(|map| map.get(&id.local_id).cloned())
     .                           .unwrap_or_else(|| {
     .                               bug!("No bound vars found for {:?} ({:?})", self.hir().node_to_string(id), id)
     .                           })
     .                           .iter(),
     .                   )
   162 ( 0.00%)      }
     .           
     .               pub fn lifetime_scope(self, id: HirId) -> Option<LifetimeScopeForPath> {
     .                   self.lifetime_scope_map(id.owner).and_then(|mut map| map.remove(&id.local_id))
     .               }
     .           
     .               /// Whether the `def_id` counts as const fn in the current crate, considering all active
     .               /// feature gates
    40 ( 0.00%)      pub fn is_const_fn(self, def_id: DefId) -> bool {
     4 ( 0.00%)          if self.is_const_fn_raw(def_id) {
     2 ( 0.00%)              match self.lookup_const_stability(def_id) {
     4 ( 0.00%)                  Some(stability) if stability.level.is_unstable() => {
     .                               // has a `rustc_const_unstable` attribute, check whether the user enabled the
     .                               // corresponding feature gate.
     .                               self.features()
     .                                   .declared_lib_features
     .                                   .iter()
     .                                   .any(|&(sym, _)| sym == stability.feature)
     .                           }
     .                           // functions without const stability are either stable user written
     .                           // const fn or the user is using feature gates and we thus don't
     .                           // care what they do
     .                           _ => true,
     .                       }
     .                   } else {
     .                       false
     .                   }
    36 ( 0.00%)      }
     .           }
     .           
     .           impl<'tcx> TyCtxtAt<'tcx> {
     .               /// Constructs a `TyKind::Error` type and registers a `delay_span_bug` to ensure it gets used.
     .               #[track_caller]
     .               pub fn ty_error(self) -> Ty<'tcx> {
     .                   self.tcx.ty_error_with_message(self.span, "TyKind::Error constructed but no error reported")
     .               }
-- line 2759 ----------------------------------------
-- line 2774 ----------------------------------------
     .           }
     .           
     .           impl<I, T, R, E> InternAs<[T], R> for I
     .           where
     .               E: InternIteratorElement<T, R>,
     .               I: Iterator<Item = E>,
     .           {
     .               type Output = E::Output;
39,584 ( 0.03%)      fn intern_with<F>(self, f: F) -> Self::Output
     .               where
     .                   F: FnOnce(&[T]) -> R,
     .               {
38,962 ( 0.03%)          E::intern_with(self, f)
37,179 ( 0.03%)      }
     .           }
     .           
     .           pub trait InternIteratorElement<T, R>: Sized {
     .               type Output;
     .               fn intern_with<I: Iterator<Item = Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
     .           }
     .           
     .           impl<T, R> InternIteratorElement<T, R> for T {
     .               type Output = R;
 5,250 ( 0.00%)      fn intern_with<I: Iterator<Item = Self>, F: FnOnce(&[T]) -> R>(
     .                   mut iter: I,
     .                   f: F,
     .               ) -> Self::Output {
     .                   // This code is hot enough that it's worth specializing for the most
     .                   // common length lists, to avoid the overhead of `SmallVec` creation.
     .                   // Lengths 0, 1, and 2 typically account for ~95% of cases. If
     .                   // `size_hint` is incorrect a panic will occur via an `unwrap` or an
     .                   // `assert`.
23,685 ( 0.02%)          match iter.size_hint() {
     .                       (0, Some(0)) => {
     .                           assert!(iter.next().is_none());
     .                           f(&[])
     .                       }
     .                       (1, Some(1)) => {
     .                           let t0 = iter.next().unwrap();
     3 ( 0.00%)                  assert!(iter.next().is_none());
 3,821 ( 0.00%)                  f(&[t0])
     .                       }
     .                       (2, Some(2)) => {
     .                           let t0 = iter.next().unwrap();
     .                           let t1 = iter.next().unwrap();
     6 ( 0.00%)                  assert!(iter.next().is_none());
 1,221 ( 0.00%)                  f(&[t0, t1])
     .                       }
    40 ( 0.00%)              _ => f(&iter.collect::<SmallVec<[_; 8]>>()),
     .                   }
 4,230 ( 0.00%)      }
     .           }
     .           
     .           impl<'a, T, R> InternIteratorElement<T, R> for &'a T
     .           where
     .               T: Clone + 'a,
     .           {
     .               type Output = R;
    90 ( 0.00%)      fn intern_with<I: Iterator<Item = Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
     .                   // This code isn't hot.
     .                   f(&iter.cloned().collect::<SmallVec<[_; 8]>>())
    72 ( 0.00%)      }
     .           }
     .           
     .           impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
     .               type Output = Result<R, E>;
 5,899 ( 0.00%)      fn intern_with<I: Iterator<Item = Self>, F: FnOnce(&[T]) -> R>(
     .                   mut iter: I,
     .                   f: F,
     .               ) -> Self::Output {
     .                   // This code is hot enough that it's worth specializing for the most
     .                   // common length lists, to avoid the overhead of `SmallVec` creation.
     .                   // Lengths 0, 1, and 2 typically account for ~95% of cases. If
     .                   // `size_hint` is incorrect a panic will occur via an `unwrap` or an
     .                   // `assert`, unless a failure happens first, in which case the result
     .                   // will be an error anyway.
 4,520 ( 0.00%)          Ok(match iter.size_hint() {
     .                       (0, Some(0)) => {
     .                           assert!(iter.next().is_none());
     .                           f(&[])
     .                       }
     .                       (1, Some(1)) => {
     .                           let t0 = iter.next().unwrap()?;
     .                           assert!(iter.next().is_none());
   318 ( 0.00%)                  f(&[t0])
     .                       }
     .                       (2, Some(2)) => {
     2 ( 0.00%)                  let t0 = iter.next().unwrap()?;
     2 ( 0.00%)                  let t1 = iter.next().unwrap()?;
     3 ( 0.00%)                  assert!(iter.next().is_none());
   454 ( 0.00%)                  f(&[t0, t1])
     .                       }
    40 ( 0.00%)              _ => f(&iter.collect::<Result<SmallVec<[_; 8]>, _>>()?),
     .                   })
 6,741 ( 0.01%)      }
     .           }
     .           
     .           // We are comparing types with different invariant lifetimes, so `ptr::eq`
     .           // won't work for us.
     .           fn ptr_eq<T, U>(t: *const T, u: *const U) -> bool {
22,082 ( 0.02%)      t as *const () == u as *const ()
     .           }
     .           
     .           pub fn provide(providers: &mut ty::query::Providers) {
     2 ( 0.00%)      providers.in_scope_traits_map =
     .                   |tcx, id| tcx.hir_crate(()).owners[id].as_ref().map(|owner_info| &owner_info.trait_map);
     3 ( 0.00%)      providers.resolutions = |tcx, ()| &tcx.untracked_resolutions;
     2 ( 0.00%)      providers.module_reexports =
     .                   |tcx, id| tcx.resolutions(()).reexport_map.get(&id).map(|v| &v[..]);
     2 ( 0.00%)      providers.crate_name = |tcx, id| {
     1 ( 0.00%)          assert_eq!(id, LOCAL_CRATE);
     1 ( 0.00%)          tcx.crate_name
     .               };
     2 ( 0.00%)      providers.maybe_unused_trait_import =
     .                   |tcx, id| tcx.resolutions(()).maybe_unused_trait_imports.contains(&id);
     2 ( 0.00%)      providers.maybe_unused_extern_crates =
     .                   |tcx, ()| &tcx.resolutions(()).maybe_unused_extern_crates[..];
     2 ( 0.00%)      providers.names_imported_by_glob_use = |tcx, id| {
     .                   tcx.arena.alloc(tcx.resolutions(()).glob_map.get(&id).cloned().unwrap_or_default())
     .               };
     .           
    11 ( 0.00%)      providers.lookup_stability = |tcx, id| tcx.stability().local_stability(id.expect_local());
     2 ( 0.00%)      providers.lookup_const_stability =
     .                   |tcx, id| tcx.stability().local_const_stability(id.expect_local());
     2 ( 0.00%)      providers.lookup_deprecation_entry =
   272 ( 0.00%)          |tcx, id| tcx.stability().local_deprecation_entry(id.expect_local());
     2 ( 0.00%)      providers.extern_mod_stmt_cnum =
     .                   |tcx, id| tcx.resolutions(()).extern_crate_map.get(&id).cloned();
     3 ( 0.00%)      providers.output_filenames = |tcx, ()| tcx.output_filenames.clone();
     3 ( 0.00%)      providers.features_query = |tcx, ()| tcx.sess.features_untracked();
     2 ( 0.00%)      providers.is_panic_runtime = |tcx, cnum| {
     .                   assert_eq!(cnum, LOCAL_CRATE);
     .                   tcx.sess.contains_name(tcx.hir().krate_attrs(), sym::panic_runtime)
     .               };
     2 ( 0.00%)      providers.is_compiler_builtins = |tcx, cnum| {
     .                   assert_eq!(cnum, LOCAL_CRATE);
     .                   tcx.sess.contains_name(tcx.hir().krate_attrs(), sym::compiler_builtins)
     .               };
     2 ( 0.00%)      providers.has_panic_handler = |tcx, cnum| {
     1 ( 0.00%)          assert_eq!(cnum, LOCAL_CRATE);
     .                   // We want to check if the panic handler was defined in this crate
     3 ( 0.00%)          tcx.lang_items().panic_impl().map_or(false, |did| did.is_local())
     .               };
     .           }

66,067 ( 0.05%)  <counts for unidentified lines in /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/caching_source_map_view.rs
--------------------------------------------------------------------------------
Ir              

-- line 27 ----------------------------------------
     .           impl CacheEntry {
     .               #[inline]
     .               fn update(
     .                   &mut self,
     .                   new_file_and_idx: Option<(Lrc<SourceFile>, usize)>,
     .                   pos: BytePos,
     .                   time_stamp: usize,
     .               ) {
   401 ( 0.00%)          if let Some((file, file_idx)) = new_file_and_idx {
   139 ( 0.00%)              self.file = file;
   119 ( 0.00%)              self.file_index = file_idx;
     .                   }
     .           
   236 ( 0.00%)          let line_index = self.file.lookup_line(pos).unwrap();
     .                   let line_bounds = self.file.line_bounds(line_index);
   644 ( 0.00%)          self.line_number = line_index + 1;
   953 ( 0.00%)          self.line = line_bounds;
     .                   self.touch(time_stamp);
     .               }
     .           
     .               #[inline]
     .               fn touch(&mut self, time_stamp: usize) {
 3,183 ( 0.00%)          self.time_stamp = time_stamp;
     .               }
     .           }
     .           
     .           #[derive(Clone)]
     .           pub struct CachingSourceMapView<'sm> {
     .               source_map: &'sm SourceMap,
     .               line_cache: [CacheEntry; 3],
     .               time_stamp: usize,
     .           }
     .           
     .           impl<'sm> CachingSourceMapView<'sm> {
   114 ( 0.00%)      pub fn new(source_map: &'sm SourceMap) -> CachingSourceMapView<'sm> {
     .                   let files = source_map.files();
    57 ( 0.00%)          let first_file = files[0].clone();
     .                   let entry = CacheEntry {
     .                       time_stamp: 0,
     .                       line_number: 0,
     .                       line: BytePos(0)..BytePos(0),
     .                       file: first_file,
     .                       file_index: 0,
     .                   };
     .           
   285 ( 0.00%)          CachingSourceMapView {
     .                       source_map,
   399 ( 0.00%)              line_cache: [entry.clone(), entry.clone(), entry],
     .                       time_stamp: 0,
     .                   }
   228 ( 0.00%)      }
     .           
     .               pub fn byte_pos_to_line_and_col(
     .                   &mut self,
     .                   pos: BytePos,
     .               ) -> Option<(Lrc<SourceFile>, usize, BytePos)> {
     .                   self.time_stamp += 1;
     .           
     .                   // Check if the position is in one of the cached lines
-- line 85 ----------------------------------------
-- line 106 ----------------------------------------
     .                   };
     .           
     .                   let cache_entry = &mut self.line_cache[oldest];
     .                   cache_entry.update(new_file_and_idx, pos, self.time_stamp);
     .           
     .                   Some((cache_entry.file.clone(), cache_entry.line_number, pos - cache_entry.line.start))
     .               }
     .           
12,082 ( 0.01%)      pub fn span_data_to_lines_and_cols(
     .                   &mut self,
     .                   span_data: &SpanData,
     .               ) -> Option<(Lrc<SourceFile>, usize, BytePos, usize, BytePos)> {
 6,904 ( 0.01%)          self.time_stamp += 1;
     .           
     .                   // Check if lo and hi are in the cached lines.
 1,726 ( 0.00%)          let lo_cache_idx = self.cache_entry_index(span_data.lo);
 1,726 ( 0.00%)          let hi_cache_idx = self.cache_entry_index(span_data.hi);
     .           
 2,920 ( 0.00%)          if lo_cache_idx != -1 && hi_cache_idx != -1 {
     .                       // Cache hit for span lo and hi. Check if they belong to the same file.
     .                       let result = {
 2,914 ( 0.00%)                  let lo = &self.line_cache[lo_cache_idx as usize];
     .                           let hi = &self.line_cache[hi_cache_idx as usize];
     .           
 8,742 ( 0.01%)                  if lo.file_index != hi.file_index {
     .                               return None;
     .                           }
     .           
     .                           (
 2,914 ( 0.00%)                      lo.file.clone(),
     .                               lo.line_number,
     .                               span_data.lo - lo.line.start,
 1,457 ( 0.00%)                      hi.line_number,
     .                               span_data.hi - hi.line.start,
     .                           )
     .                       };
     .           
 1,457 ( 0.00%)              self.line_cache[lo_cache_idx as usize].touch(self.time_stamp);
 1,457 ( 0.00%)              self.line_cache[hi_cache_idx as usize].touch(self.time_stamp);
     .           
 5,828 ( 0.00%)              return Some(result);
     .                   }
     .           
     .                   // No cache hit or cache hit for only one of span lo and hi.
   532 ( 0.00%)          let oldest = if lo_cache_idx != -1 || hi_cache_idx != -1 {
     .                       let avoid_idx = if lo_cache_idx != -1 { lo_cache_idx } else { hi_cache_idx };
     .                       self.oldest_cache_entry_index_avoid(avoid_idx as usize)
     .                   } else {
     .                       self.oldest_cache_entry_index()
     .                   };
     .           
     .                   // If the entry doesn't point to the correct file, get the new file and index.
     .                   // Return early if the file containing beginning of span doesn't contain end of span.
 2,112 ( 0.00%)          let new_file_and_idx = if !file_contains(&self.line_cache[oldest].file, span_data.lo) {
   165 ( 0.00%)              let new_file_and_idx = self.file_for_position(span_data.lo)?;
   198 ( 0.00%)              if !file_contains(&new_file_and_idx.0, span_data.hi) {
     .                           return None;
     .                       }
     .           
   132 ( 0.00%)              Some(new_file_and_idx)
     .                   } else {
     .                       let file = &self.line_cache[oldest].file;
   708 ( 0.00%)              if !file_contains(&file, span_data.hi) {
     .                           return None;
     .                       }
     .           
   708 ( 0.00%)              None
     .                   };
     .           
     .                   // Update the cache entries.
 1,345 ( 0.00%)          let (lo_idx, hi_idx) = match (lo_cache_idx, hi_cache_idx) {
     .                       // Oldest cache entry is for span_data.lo line.
     .                       (-1, -1) => {
     .                           let lo = &mut self.line_cache[oldest];
     .                           lo.update(new_file_and_idx, span_data.lo, self.time_stamp);
     .           
   600 ( 0.00%)                  if !lo.line.contains(&span_data.hi) {
     .                               let new_file_and_idx = Some((lo.file.clone(), lo.file_index));
     .                               let next_oldest = self.oldest_cache_entry_index_avoid(oldest);
     .                               let hi = &mut self.line_cache[next_oldest];
     .                               hi.update(new_file_and_idx, span_data.hi, self.time_stamp);
     .                               (oldest, next_oldest)
     .                           } else {
     .                               (oldest, oldest)
     .                           }
     .                       }
     .                       // Oldest cache entry is for span_data.lo line.
     .                       (-1, _) => {
     .                           let lo = &mut self.line_cache[oldest];
     .                           lo.update(new_file_and_idx, span_data.lo, self.time_stamp);
     6 ( 0.00%)                  let hi = &mut self.line_cache[hi_cache_idx as usize];
     9 ( 0.00%)                  hi.touch(self.time_stamp);
     .                           (oldest, hi_cache_idx as usize)
     .                       }
     .                       // Oldest cache entry is for span_data.hi line.
     .                       (_, -1) => {
     .                           let hi = &mut self.line_cache[oldest];
    66 ( 0.00%)                  hi.update(new_file_and_idx, span_data.hi, self.time_stamp);
   132 ( 0.00%)                  let lo = &mut self.line_cache[lo_cache_idx as usize];
   264 ( 0.00%)                  lo.touch(self.time_stamp);
     .                           (lo_cache_idx as usize, oldest)
     .                       }
     .                       _ => {
     .                           panic!();
     .                       }
     .                   };
     .           
     .                   let lo = &self.line_cache[lo_idx];
     .                   let hi = &self.line_cache[hi_idx];
     .           
     .                   // Span lo and hi may equal line end when last line doesn't
     .                   // end in newline, hence the inclusive upper bounds below.
   538 ( 0.00%)          assert!(span_data.lo >= lo.line.start);
   269 ( 0.00%)          assert!(span_data.lo <= lo.line.end);
   538 ( 0.00%)          assert!(span_data.hi >= hi.line.start);
   269 ( 0.00%)          assert!(span_data.hi <= hi.line.end);
 1,345 ( 0.00%)          assert!(lo.file.contains(span_data.lo));
   807 ( 0.00%)          assert!(lo.file.contains(span_data.hi));
   807 ( 0.00%)          assert_eq!(lo.file_index, hi.file_index);
     .           
   807 ( 0.00%)          Some((
   269 ( 0.00%)              lo.file.clone(),
     .                       lo.line_number,
     .                       span_data.lo - lo.line.start,
   269 ( 0.00%)              hi.line_number,
     .                       span_data.hi - hi.line.start,
     .                   ))
15,534 ( 0.01%)      }
     .           
     .               fn cache_entry_index(&self, pos: BytePos) -> isize {
     .                   for (idx, cache_entry) in self.line_cache.iter().enumerate() {
17,113 ( 0.01%)              if cache_entry.line.contains(&pos) {
     .                           return idx as isize;
     .                       }
     .                   }
     .           
     .                   -1
     .               }
     .           
     .               fn oldest_cache_entry_index(&self) -> usize {
     .                   let mut oldest = 0;
     .           
     .                   for idx in 1..self.line_cache.len() {
 1,200 ( 0.00%)              if self.line_cache[idx].time_stamp < self.line_cache[oldest].time_stamp {
     .                           oldest = idx;
     .                       }
     .                   }
     .           
     .                   oldest
     .               }
     .           
     .               fn oldest_cache_entry_index_avoid(&self, avoid_idx: usize) -> usize {
     .                   let mut oldest = if avoid_idx != 0 { 0 } else { 1 };
     .           
     .                   for idx in 0..self.line_cache.len() {
   743 ( 0.00%)              if idx != avoid_idx
   395 ( 0.00%)                  && self.line_cache[idx].time_stamp < self.line_cache[oldest].time_stamp
     .                       {
     .                           oldest = idx;
     .                       }
     .                   }
     .           
     .                   oldest
     .               }
     .           
   165 ( 0.00%)      fn file_for_position(&self, pos: BytePos) -> Option<(Lrc<SourceFile>, usize)> {
    33 ( 0.00%)          if !self.source_map.files().is_empty() {
    66 ( 0.00%)              let file_idx = self.source_map.lookup_source_file_idx(pos);
     .                       let file = &self.source_map.files()[file_idx];
     .           
   264 ( 0.00%)              if file_contains(file, pos) {
     .                           return Some((file.clone(), file_idx));
     .                       }
     .                   }
     .           
     .                   None
   165 ( 0.00%)      }
     .           }
     .           
     .           #[inline]
     .           fn file_contains(file: &SourceFile, pos: BytePos) -> bool {
     .               // `SourceMap::lookup_source_file_idx` and `SourceFile::contains` both consider the position
     .               // one past the end of a file to belong to it. Normally, that's what we want. But for the
     .               // purposes of converting a byte position to a line and column number, we can't come up with a
     .               // line and column number if the file is empty, because an empty file doesn't contain any
-- line 290 ----------------------------------------

23,163 ( 0.02%)  <counts for unidentified lines in /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/caching_source_map_view.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/stacker-0.1.14/src/lib.rs
--------------------------------------------------------------------------------
Ir              

-- line 42 ----------------------------------------
     .           /// `stack_size` bytes.
     .           ///
     .           /// The closure `f` is guaranteed to run on a stack with at least `red_zone` bytes, and it will be
     .           /// run on the current stack if there's space available.
     .           #[inline(always)]
     .           pub fn maybe_grow<R, F: FnOnce() -> R>(red_zone: usize, stack_size: usize, callback: F) -> R {
     .               // if we can't guess the remaining stack (unsupported on some platforms) we immediately grow
     .               // the stack and then cache the new stack size (which we do know now because we allocated it.
33,178 ( 0.03%)      let enough_space = match remaining_stack() {
     .                   Some(remaining) => remaining >= red_zone,
     .                   None => false,
     .               };
41,466 ( 0.03%)      if enough_space {
 1,439 ( 0.00%)          callback()
     .               } else {
     .                   grow(stack_size, callback)
     .               }
     .           }
     .           
     .           /// Always creates a new stack for the passed closure to run on.
     .           /// The closure will still be on the same thread as the caller of `grow`.
     .           /// This will allocate a new stack with at least `stack_size` bytes.
-- line 63 ----------------------------------------
-- line 82 ----------------------------------------
     .               _grow(stack_size, dyn_callback);
     .               ret.unwrap()
     .           }
     .           
     .           /// Queries the amount of remaining stack as interpreted by this library.
     .           ///
     .           /// This function will return the amount of stack space left which will be used
     .           /// to determine whether a stack switch should be made or not.
27,644 ( 0.02%)  pub fn remaining_stack() -> Option<usize> {
     .               let current_ptr = current_stack_ptr();
27,644 ( 0.02%)      get_stack_limit().map(|limit| current_ptr - limit)
55,288 ( 0.04%)  }
     .           
     .           psm_stack_information! (
     .               yes {
     .                   fn current_stack_ptr() -> usize {
27,644 ( 0.02%)              psm::stack_pointer() as usize
     .                   }
     .               }
     .               no {
     .                   #[inline(always)]
     .                   fn current_stack_ptr() -> usize {
     .                       unsafe {
     .                           let mut x = std::mem::MaybeUninit::<u8>::uninit();
     .                           // Unlikely to be ever exercised. As a fallback we execute a volatile read to a
-- line 106 ----------------------------------------
-- line 111 ----------------------------------------
     .                           x.as_ptr() as usize
     .                       }
     .                   }
     .               }
     .           );
     .           
     .           thread_local! {
     .               static STACK_LIMIT: Cell<Option<usize>> = Cell::new(unsafe {
     1 ( 0.00%)          guess_os_stack_limit()
     .               })
     .           }
     .           
     .           #[inline(always)]
     .           fn get_stack_limit() -> Option<usize> {
     .               STACK_LIMIT.with(|s| s.get())
     .           }
     .           
-- line 127 ----------------------------------------
-- line 403 ----------------------------------------
     .                       VirtualQuery(
     .                           psm::stack_pointer() as *const _,
     .                           mi.as_mut_ptr(),
     .                           std::mem::size_of::<QueryT>() as SIZE_T,
     .                       );
     .                       Some(mi.assume_init().AllocationBase as usize + get_thread_stack_guarantee() + 0x1000)
     .                   }
     .               } else if #[cfg(any(target_os = "linux", target_os="solaris", target_os = "netbsd"))] {
     2 ( 0.00%)          unsafe fn guess_os_stack_limit() -> Option<usize> {
     .                       let mut attr = std::mem::MaybeUninit::<libc::pthread_attr_t>::uninit();
     4 ( 0.00%)              assert_eq!(libc::pthread_attr_init(attr.as_mut_ptr()), 0);
     7 ( 0.00%)              assert_eq!(libc::pthread_getattr_np(libc::pthread_self(),
     .                                                           attr.as_mut_ptr()), 0);
     1 ( 0.00%)              let mut stackaddr = std::ptr::null_mut();
     4 ( 0.00%)              let mut stacksize = 0;
     4 ( 0.00%)              assert_eq!(libc::pthread_attr_getstack(
     .                           attr.as_ptr(), &mut stackaddr, &mut stacksize
     .                       ), 0);
     4 ( 0.00%)              assert_eq!(libc::pthread_attr_destroy(attr.as_mut_ptr()), 0);
     1 ( 0.00%)              Some(stackaddr as usize)
     3 ( 0.00%)          }
     .               } else if #[cfg(any(target_os = "freebsd", target_os = "dragonfly"))] {
     .                   unsafe fn guess_os_stack_limit() -> Option<usize> {
     .                       let mut attr = std::mem::MaybeUninit::<libc::pthread_attr_t>::uninit();
     .                       assert_eq!(libc::pthread_attr_init(attr.as_mut_ptr()), 0);
     .                       assert_eq!(libc::pthread_attr_get_np(libc::pthread_self(), attr.as_mut_ptr()), 0);
     .                       let mut stackaddr = std::ptr::null_mut();
     .                       let mut stacksize = 0;
     .                       assert_eq!(libc::pthread_attr_getstack(
-- line 431 ----------------------------------------

15,004 ( 0.01%)  <counts for unidentified lines in /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/stacker-0.1.14/src/lib.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/lib.rs
--------------------------------------------------------------------------------
Ir                 

-- line 84 ----------------------------------------
        .           pub struct SessionGlobals {
        .               symbol_interner: symbol::Interner,
        .               span_interner: Lock<span_encoding::SpanInterner>,
        .               hygiene_data: Lock<hygiene::HygieneData>,
        .               source_map: Lock<Option<Lrc<SourceMap>>>,
        .           }
        .           
        .           impl SessionGlobals {
       12 ( 0.00%)      pub fn new(edition: Edition) -> SessionGlobals {
       50 ( 0.00%)          SessionGlobals {
        2 ( 0.00%)              symbol_interner: symbol::Interner::fresh(),
        .                       span_interner: Lock::new(span_encoding::SpanInterner::default()),
        6 ( 0.00%)              hygiene_data: Lock::new(hygiene::HygieneData::new(edition)),
        .                       source_map: Lock::new(None),
        .                   }
       10 ( 0.00%)      }
        .           }
        .           
        .           #[inline]
        .           pub fn create_session_globals_then<R>(edition: Edition, f: impl FnOnce() -> R) -> R {
        1 ( 0.00%)      assert!(
        .                   !SESSION_GLOBALS.is_set(),
        .                   "SESSION_GLOBALS should never be overwritten! \
        .                    Use another thread if you need another SessionGlobals"
        .               );
        3 ( 0.00%)      let session_globals = SessionGlobals::new(edition);
        7 ( 0.00%)      SESSION_GLOBALS.set(&session_globals, f)
        1 ( 0.00%)  }
        .           
        .           #[inline]
        .           pub fn set_session_globals_then<R>(session_globals: &SessionGlobals, f: impl FnOnce() -> R) -> R {
        .               assert!(
        .                   !SESSION_GLOBALS.is_set(),
        .                   "SESSION_GLOBALS should never be overwritten! \
        .                    Use another thread if you need another SessionGlobals"
        .               );
-- line 119 ----------------------------------------
-- line 120 ----------------------------------------
        .               SESSION_GLOBALS.set(session_globals, f)
        .           }
        .           
        .           #[inline]
        .           pub fn create_default_session_if_not_set_then<R, F>(f: F) -> R
        .           where
        .               F: FnOnce(&SessionGlobals) -> R,
        .           {
        4 ( 0.00%)      create_session_if_not_set_then(edition::DEFAULT_EDITION, f)
        .           }
        .           
        .           #[inline]
        .           pub fn create_session_if_not_set_then<R, F>(edition: Edition, f: F) -> R
        .           where
        .               F: FnOnce(&SessionGlobals) -> R,
        .           {
        1 ( 0.00%)      if !SESSION_GLOBALS.is_set() {
        3 ( 0.00%)          let session_globals = SessionGlobals::new(edition);
       11 ( 0.00%)          SESSION_GLOBALS.set(&session_globals, || SESSION_GLOBALS.with(f))
        1 ( 0.00%)      } else {
        .                   SESSION_GLOBALS.with(f)
        .               }
        .           }
        .           
        .           #[inline]
        .           pub fn with_session_globals<R, F>(f: F) -> R
        .           where
        .               F: FnOnce(&SessionGlobals) -> R,
        .           {
   23,582 ( 0.02%)      SESSION_GLOBALS.with(f)
        .           }
        .           
        .           #[inline]
        .           pub fn create_default_session_globals_then<R>(f: impl FnOnce() -> R) -> R {
        .               create_session_globals_then(edition::DEFAULT_EDITION, f)
        .           }
        .           
        .           // If this ever becomes non thread-local, `decode_syntax_context`
        .           // and `decode_expn_id` will need to be updated to handle concurrent
        .           // deserialization.
        .           scoped_tls::scoped_thread_local!(static SESSION_GLOBALS: SessionGlobals);
        .           
        .           // FIXME: We should use this enum or something like it to get rid of the
        .           // use of magic `/rust/1.x/...` paths across the board.
       13 ( 0.00%)  #[derive(Debug, Eq, PartialEq, Clone, Ord, PartialOrd)]
    1,042 ( 0.00%)  #[derive(Decodable)]
        .           pub enum RealFileName {
        .               LocalPath(PathBuf),
        .               /// For remapped paths (namely paths into libstd that have been mapped
        .               /// to the appropriate spot on the local host's file system, and local file
        .               /// system paths that have been remapped with `FilePathMapping`),
        .               Remapped {
        .                   /// `local_path` is the (host-dependent) local path to the file. This is
        .                   /// None if the file was imported from another crate
-- line 173 ----------------------------------------
-- line 179 ----------------------------------------
        .           }
        .           
        .           impl Hash for RealFileName {
        .               fn hash<H: std::hash::Hasher>(&self, state: &mut H) {
        .                   // To prevent #70924 from happening again we should only hash the
        .                   // remapped (virtualized) path if that exists. This is because
        .                   // virtualized paths to sysroot crates (/rust/$hash or /rust/$version)
        .                   // remain stable even if the corresponding local_path changes
    2,630 ( 0.00%)          self.remapped_path_if_available().hash(state)
        .               }
        .           }
        .           
        .           // This is functionally identical to #[derive(Encodable)], with the exception of
        .           // an added assert statement
        .           impl<S: Encoder> Encodable<S> for RealFileName {
        .               fn encode(&self, encoder: &mut S) -> Result<(), S::Error> {
        2 ( 0.00%)          encoder.emit_enum(|encoder| match *self {
        .                       RealFileName::LocalPath(ref local_path) => {
        8 ( 0.00%)                  encoder.emit_enum_variant("LocalPath", 0, 1, |encoder| {
        .                               encoder.emit_enum_variant_arg(true, |encoder| local_path.encode(encoder))?;
        .                               Ok(())
        .                           })
        .                       }
        .           
        .                       RealFileName::Remapped { ref local_path, ref virtual_name } => encoder
        .                           .emit_enum_variant("Remapped", 1, 2, |encoder| {
        .                               // For privacy and build reproducibility, we must not embed host-dependant path in artifacts
-- line 205 ----------------------------------------
-- line 224 ----------------------------------------
        .                           p.as_ref().map(PathBuf::as_path)
        .                       }
        .                   }
        .               }
        .           
        .               /// Returns the path suitable for reading from the file system on the local host,
        .               /// if this information exists.
        .               /// Avoid embedding this in build artifacts; see `remapped_path_if_available()` for that.
        2 ( 0.00%)      pub fn into_local_path(self) -> Option<PathBuf> {
        2 ( 0.00%)          match self {
        .                       RealFileName::LocalPath(p) => Some(p),
        .                       RealFileName::Remapped { local_path: p, virtual_name: _ } => p,
        .                   }
        3 ( 0.00%)      }
        .           
        .               /// Returns the path suitable for embedding into build artifacts. This would still
        .               /// be a local path if it has not been remapped. A remapped path will not correspond
        .               /// to a valid file system path: see `local_path_if_available()` for something that
        .               /// is more likely to return paths into the local host file system.
        .               pub fn remapped_path_if_available(&self) -> &Path {
    2,100 ( 0.00%)          match self {
        .                       RealFileName::LocalPath(p)
        .                       | RealFileName::Remapped { local_path: _, virtual_name: p } => &p,
        .                   }
        2 ( 0.00%)      }
        .           
        .               /// Returns the path suitable for reading from the file system on the local host,
        .               /// if this information exists. Otherwise returns the remapped name.
        .               /// Avoid embedding this in build artifacts; see `remapped_path_if_available()` for that.
        .               pub fn local_path_if_available(&self) -> &Path {
        1 ( 0.00%)          match self {
        .                       RealFileName::LocalPath(path)
        .                       | RealFileName::Remapped { local_path: None, virtual_name: path }
        .                       | RealFileName::Remapped { local_path: Some(path), virtual_name: _ } => path,
        .                   }
        .               }
        .           
        .               pub fn to_string_lossy(&self, display_pref: FileNameDisplayPreference) -> Cow<'_, str> {
        1 ( 0.00%)          match display_pref {
        .                       FileNameDisplayPreference::Local => self.local_path_if_available().to_string_lossy(),
        .                       FileNameDisplayPreference::Remapped => {
        .                           self.remapped_path_if_available().to_string_lossy()
        .                       }
        .                   }
        .               }
        .           }
        .           
        .           /// Differentiates between real files and common virtual files.
    5,381 ( 0.00%)  #[derive(Debug, Eq, PartialEq, Clone, Ord, PartialOrd, Hash)]
    6,300 ( 0.01%)  #[derive(Decodable, Encodable)]
        .           pub enum FileName {
        .               Real(RealFileName),
        .               /// Call to `quote!`.
        .               QuoteExpansion(u64),
        .               /// Command line.
        .               Anon(u64),
        .               /// Hack in `src/librustc_ast/parse.rs`.
        .               // FIXME(jseyfried)
-- line 281 ----------------------------------------
-- line 288 ----------------------------------------
        .               /// Custom sources for explicit parser calls from plugins and drivers.
        .               Custom(String),
        .               DocTest(PathBuf, isize),
        .               /// Post-substitution inline assembly from LLVM.
        .               InlineAsm(u64),
        .           }
        .           
        .           impl From<PathBuf> for FileName {
        7 ( 0.00%)      fn from(p: PathBuf) -> Self {
        2 ( 0.00%)          assert!(!p.to_string_lossy().ends_with('>'));
        6 ( 0.00%)          FileName::Real(RealFileName::LocalPath(p))
        7 ( 0.00%)      }
        .           }
        .           
        2 ( 0.00%)  #[derive(Clone, Copy, Eq, PartialEq, Hash, Debug)]
        .           pub enum FileNameDisplayPreference {
        .               Remapped,
        .               Local,
        .           }
        .           
        .           pub struct FileNameDisplay<'a> {
        .               inner: &'a FileName,
        .               display_pref: FileNameDisplayPreference,
        .           }
        .           
        .           impl fmt::Display for FileNameDisplay<'_> {
        4 ( 0.00%)      fn fmt(&self, fmt: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        .                   use FileName::*;
        6 ( 0.00%)          match *self.inner {
        .                       Real(ref name) => {
        6 ( 0.00%)                  write!(fmt, "{}", name.to_string_lossy(self.display_pref))
        .                       }
        .                       QuoteExpansion(_) => write!(fmt, "<quote expansion>"),
        .                       MacroExpansion(_) => write!(fmt, "<macro expansion>"),
        .                       Anon(_) => write!(fmt, "<anon>"),
        .                       ProcMacroSourceCode(_) => write!(fmt, "<proc-macro source code>"),
        .                       CfgSpec(_) => write!(fmt, "<cfgspec>"),
        .                       CliCrateAttr(_) => write!(fmt, "<crate attribute>"),
        .                       Custom(ref s) => write!(fmt, "<{}>", s),
        .                       DocTest(ref path, _) => write!(fmt, "{}", path.display()),
        .                       InlineAsm(_) => write!(fmt, "<inline asm>"),
        .                   }
        5 ( 0.00%)      }
        .           }
        .           
        .           impl FileNameDisplay<'_> {
        .               pub fn to_string_lossy(&self) -> Cow<'_, str> {
        .                   match self.inner {
        .                       FileName::Real(ref inner) => inner.to_string_lossy(self.display_pref),
        .                       _ => Cow::from(format!("{}", self)),
        .                   }
        .               }
        .           }
        .           
        .           impl FileName {
        .               pub fn is_real(&self) -> bool {
        .                   use FileName::*;
    1,058 ( 0.00%)          match *self {
        .                       Real(_) => true,
        .                       Anon(_)
        .                       | MacroExpansion(_)
        .                       | ProcMacroSourceCode(_)
        .                       | CfgSpec(_)
        .                       | CliCrateAttr(_)
        .                       | Custom(_)
        .                       | QuoteExpansion(_)
-- line 353 ----------------------------------------
-- line 357 ----------------------------------------
        .               }
        .           
        .               pub fn prefer_remapped(&self) -> FileNameDisplay<'_> {
        .                   FileNameDisplay { inner: self, display_pref: FileNameDisplayPreference::Remapped }
        .               }
        .           
        .               // This may include transient local filesystem information.
        .               // Must not be embedded in build outputs.
        1 ( 0.00%)      pub fn prefer_local(&self) -> FileNameDisplay<'_> {
        .                   FileNameDisplay { inner: self, display_pref: FileNameDisplayPreference::Local }
        2 ( 0.00%)      }
        .           
        .               pub fn display(&self, display_pref: FileNameDisplayPreference) -> FileNameDisplay<'_> {
        .                   FileNameDisplay { inner: self, display_pref }
        .               }
        .           
        .               pub fn macro_expansion_source_code(src: &str) -> FileName {
        .                   let mut hasher = StableHasher::new();
        .                   src.hash(&mut hasher);
-- line 375 ----------------------------------------
-- line 423 ----------------------------------------
        .           /// that the length of the span is equal to `span.hi - span.lo`; there may be space in the
        .           /// [`BytePos`] range between files.
        .           ///
        .           /// `SpanData` is public because `Span` uses a thread-local interner and can't be
        .           /// sent to other threads, but some pieces of performance infra run in a separate thread.
        .           /// Using `Span` is generally preferred.
        .           #[derive(Clone, Copy, Hash, PartialEq, Eq)]
        .           pub struct SpanData {
        9 ( 0.00%)      pub lo: BytePos,
        9 ( 0.00%)      pub hi: BytePos,
        .               /// Information about where the macro came from, if this piece of
        .               /// code was created by a macro expansion.
       27 ( 0.00%)      pub ctxt: SyntaxContext,
        9 ( 0.00%)      pub parent: Option<LocalDefId>,
        .           }
        .           
        .           // Order spans by position in the file.
        .           impl Ord for SpanData {
        .               fn cmp(&self, other: &Self) -> Ordering {
        .                   let SpanData {
        .                       lo: s_lo,
        .                       hi: s_hi,
-- line 444 ----------------------------------------
-- line 485 ----------------------------------------
        .               }
        .               #[inline]
        .               pub fn with_parent(&self, parent: Option<LocalDefId>) -> Span {
        .                   Span::new(self.lo, self.hi, self.ctxt, parent)
        .               }
        .               /// Returns `true` if this is a dummy span with any hygienic context.
        .               #[inline]
        .               pub fn is_dummy(self) -> bool {
    5,811 ( 0.00%)          self.lo.0 == 0 && self.hi.0 == 0
        .               }
        .               /// Returns `true` if `self` fully encloses `other`.
        .               pub fn contains(self, other: Self) -> bool {
       18 ( 0.00%)          self.lo <= other.lo && other.hi <= self.hi
        .               }
        .           }
        .           
        .           // The interner is pointed to by a thread local value which is only set on the main thread
        .           // with parallelization is disabled. So we don't allow `Span` to transfer between threads
        .           // to avoid panics and other errors, even though it would be memory safe to do so.
        .           #[cfg(not(parallel_compiler))]
        .           impl !Send for Span {}
        .           #[cfg(not(parallel_compiler))]
        .           impl !Sync for Span {}
        .           
        .           impl PartialOrd for Span {
    5,240 ( 0.00%)      fn partial_cmp(&self, rhs: &Self) -> Option<Ordering> {
    3,930 ( 0.00%)          PartialOrd::partial_cmp(&self.data(), &rhs.data())
    5,240 ( 0.00%)      }
        .           }
        .           impl Ord for Span {
        .               fn cmp(&self, rhs: &Self) -> Ordering {
        .                   Ord::cmp(&self.data(), &rhs.data())
        .               }
        .           }
        .           
        .           /// A collection of `Span`s.
-- line 520 ----------------------------------------
-- line 532 ----------------------------------------
        .           }
        .           
        .           impl Span {
        .               #[inline]
        .               pub fn lo(self) -> BytePos {
        .                   self.data().lo
        .               }
        .               #[inline]
    2,268 ( 0.00%)      pub fn with_lo(self, lo: BytePos) -> Span {
        .                   self.data().with_lo(lo)
    1,512 ( 0.00%)      }
        .               #[inline]
      160 ( 0.00%)      pub fn hi(self) -> BytePos {
        .                   self.data().hi
      160 ( 0.00%)      }
        .               #[inline]
      567 ( 0.00%)      pub fn with_hi(self, hi: BytePos) -> Span {
        .                   self.data().with_hi(hi)
      378 ( 0.00%)      }
        .               #[inline]
        .               pub fn ctxt(self) -> SyntaxContext {
        .                   self.data_untracked().ctxt
        .               }
        .               #[inline]
      105 ( 0.00%)      pub fn with_ctxt(self, ctxt: SyntaxContext) -> Span {
        .                   self.data_untracked().with_ctxt(ctxt)
       63 ( 0.00%)      }
        .               #[inline]
        .               pub fn parent(self) -> Option<LocalDefId> {
        .                   self.data().parent
        .               }
        .               #[inline]
        .               pub fn with_parent(self, ctxt: Option<LocalDefId>) -> Span {
        .                   self.data().with_parent(ctxt)
        .               }
-- line 566 ----------------------------------------
-- line 600 ----------------------------------------
        .               /// Returns a new span representing an empty span at the beginning of this span.
        .               #[inline]
        .               pub fn shrink_to_lo(self) -> Span {
        .                   let span = self.data_untracked();
        .                   span.with_hi(span.lo)
        .               }
        .               /// Returns a new span representing an empty span at the end of this span.
        .               #[inline]
       15 ( 0.00%)      pub fn shrink_to_hi(self) -> Span {
        .                   let span = self.data_untracked();
        .                   span.with_lo(span.hi)
       10 ( 0.00%)      }
        .           
        .               #[inline]
        .               /// Returns `true` if `hi == lo`.
        .               pub fn is_empty(self) -> bool {
        .                   let span = self.data_untracked();
        .                   span.hi == span.lo
        .               }
        .           
        .               /// Returns `self` if `self` is not the dummy span, and `other` otherwise.
        .               pub fn substitute_dummy(self, other: Span) -> Span {
        .                   if self.is_dummy() { other } else { self }
        .               }
        .           
        .               /// Returns `true` if `self` fully encloses `other`.
       54 ( 0.00%)      pub fn contains(self, other: Span) -> bool {
        .                   let span = self.data();
        .                   let other = other.data();
        .                   span.contains(other)
       36 ( 0.00%)      }
        .           
        .               /// Returns `true` if `self` touches `other`.
        .               pub fn overlaps(self, other: Span) -> bool {
        .                   let span = self.data();
        .                   let other = other.data();
        .                   span.lo < other.hi && other.lo < span.hi
        .               }
        .           
-- line 638 ----------------------------------------
-- line 663 ----------------------------------------
        .               /// The `Span` for the tokens in the previous macro expansion from which `self` was generated,
        .               /// if any.
        .               pub fn parent_callsite(self) -> Option<Span> {
        .                   let expn_data = self.ctxt().outer_expn_data();
        .                   if !expn_data.is_root() { Some(expn_data.call_site) } else { None }
        .               }
        .           
        .               /// Walk down the expansion ancestors to find a span that's contained within `outer`.
       50 ( 0.00%)      pub fn find_ancestor_inside(mut self, outer: Span) -> Option<Span> {
       25 ( 0.00%)          while !outer.contains(self) {
        .                       self = self.parent_callsite()?;
        .                   }
        .                   Some(self)
       55 ( 0.00%)      }
        .           
        .               /// Edition of the crate from which this span came.
      747 ( 0.00%)      pub fn edition(self) -> edition::Edition {
        .                   self.ctxt().edition()
      498 ( 0.00%)      }
        .           
        .               #[inline]
        .               pub fn rust_2015(self) -> bool {
      158 ( 0.00%)          self.edition() == edition::Edition::Edition2015
        .               }
        .           
        .               #[inline]
        .               pub fn rust_2018(self) -> bool {
      116 ( 0.00%)          self.edition() >= edition::Edition::Edition2018
        .               }
        .           
        .               #[inline]
        .               pub fn rust_2021(self) -> bool {
      110 ( 0.00%)          self.edition() >= edition::Edition::Edition2021
        .               }
        .           
        .               /// Returns the source callee.
        .               ///
        .               /// Returns `None` if the supplied span has no expansion trace,
        .               /// else returns the `ExpnData` for the macro definition
        .               /// corresponding to the source callsite.
        .               pub fn source_callee(self) -> Option<ExpnData> {
-- line 703 ----------------------------------------
-- line 707 ----------------------------------------
        .                   }
        .                   let expn_data = self.ctxt().outer_expn_data();
        .                   if !expn_data.is_root() { Some(source_callee(expn_data)) } else { None }
        .               }
        .           
        .               /// Checks if a span is "internal" to a macro in which `#[unstable]`
        .               /// items can be used (that is, a macro marked with
        .               /// `#[allow_internal_unstable]`).
      115 ( 0.00%)      pub fn allows_unstable(self, feature: Symbol) -> bool {
       23 ( 0.00%)          self.ctxt()
        .                       .outer_expn_data()
        .                       .allow_internal_unstable
        .                       .map_or(false, |features| features.iter().any(|&f| f == feature))
       92 ( 0.00%)      }
        .           
        .               /// Checks if this span arises from a compiler desugaring of kind `kind`.
      294 ( 0.00%)      pub fn is_desugaring(self, kind: DesugaringKind) -> bool {
      252 ( 0.00%)          match self.ctxt().outer_expn_data().kind {
        .                       ExpnKind::Desugaring(k) => k == kind,
        .                       _ => false,
        .                   }
      210 ( 0.00%)      }
        .           
        .               /// Returns the compiler desugaring that created this span, or `None`
        .               /// if this span is not from a desugaring.
        .               pub fn desugaring_kind(self) -> Option<DesugaringKind> {
        .                   match self.ctxt().outer_expn_data().kind {
        .                       ExpnKind::Desugaring(k) => Some(k),
        .                       _ => None,
        .                   }
-- line 736 ----------------------------------------
-- line 767 ----------------------------------------
        .           
        .               /// Returns a `Span` that would enclose both `self` and `end`.
        .               ///
        .               /// ```text
        .               ///     ____             ___
        .               ///     self lorem ipsum end
        .               ///     ^^^^^^^^^^^^^^^^^^^^
        .               /// ```
   10,934 ( 0.01%)      pub fn to(self, end: Span) -> Span {
        .                   let span_data = self.data();
        .                   let end_data = end.data();
        .                   // FIXME(jseyfried): `self.ctxt` should always equal `end.ctxt` here (cf. issue #23480).
        .                   // Return the macro span on its own to avoid weird diagnostic output. It is preferable to
        .                   // have an incomplete span than a completely nonsensical one.
    1,981 ( 0.00%)          if span_data.ctxt != end_data.ctxt {
        7 ( 0.00%)              if span_data.ctxt == SyntaxContext::root() {
        .                           return end;
        7 ( 0.00%)              } else if end_data.ctxt == SyntaxContext::root() {
        .                           return self;
        .                       }
        .                       // Both spans fall within a macro.
        .                       // FIXME(estebank): check if it is the *same* macro.
        .                   }
        .                   Span::new(
        .                       cmp::min(span_data.lo, end_data.lo),
        .                       cmp::max(span_data.hi, end_data.hi),
        .                       if span_data.ctxt == SyntaxContext::root() { end_data.ctxt } else { span_data.ctxt },
    6,909 ( 0.01%)              if span_data.parent == end_data.parent { span_data.parent } else { None },
        .                   )
    8,946 ( 0.01%)      }
        .           
        .               /// Returns a `Span` between the end of `self` to the beginning of `end`.
        .               ///
        .               /// ```text
        .               ///     ____             ___
        .               ///     self lorem ipsum end
        .               ///         ^^^^^^^^^^^^^
        .               /// ```
       77 ( 0.00%)      pub fn between(self, end: Span) -> Span {
        .                   let span = self.data();
        .                   let end = end.data();
        .                   Span::new(
        .                       span.hi,
        .                       end.lo,
        .                       if end.ctxt == SyntaxContext::root() { end.ctxt } else { span.ctxt },
       49 ( 0.00%)              if span.parent == end.parent { span.parent } else { None },
        .                   )
       56 ( 0.00%)      }
        .           
        .               /// Returns a `Span` from the beginning of `self` until the beginning of `end`.
        .               ///
        .               /// ```text
        .               ///     ____             ___
        .               ///     self lorem ipsum end
        .               ///     ^^^^^^^^^^^^^^^^^
        .               /// ```
       55 ( 0.00%)      pub fn until(self, end: Span) -> Span {
        .                   // Most of this function's body is copied from `to`.
        .                   // We can't just do `self.to(end.shrink_to_lo())`,
        .                   // because to also does some magic where it uses min/max so
        .                   // it can handle overlapping spans. Some advanced mis-use of
        .                   // `until` with different ctxts makes this visible.
        .                   let span_data = self.data();
        .                   let end_data = end.data();
        .                   // FIXME(jseyfried): `self.ctxt` should always equal `end.ctxt` here (cf. issue #23480).
        .                   // Return the macro span on its own to avoid weird diagnostic output. It is preferable to
        .                   // have an incomplete span than a completely nonsensical one.
       10 ( 0.00%)          if span_data.ctxt != end_data.ctxt {
        .                       if span_data.ctxt == SyntaxContext::root() {
        .                           return end;
        .                       } else if end_data.ctxt == SyntaxContext::root() {
        .                           return self;
        .                       }
        .                       // Both spans fall within a macro.
        .                       // FIXME(estebank): check if it is the *same* macro.
        .                   }
        .                   Span::new(
        .                       span_data.lo,
        .                       end_data.lo,
        .                       if end_data.ctxt == SyntaxContext::root() { end_data.ctxt } else { span_data.ctxt },
       35 ( 0.00%)              if span_data.parent == end_data.parent { span_data.parent } else { None },
        .                   )
       45 ( 0.00%)      }
        .           
       22 ( 0.00%)      pub fn from_inner(self, inner: InnerSpan) -> Span {
        .                   let span = self.data();
        .                   Span::new(
        .                       span.lo + BytePos::from_usize(inner.start),
        .                       span.lo + BytePos::from_usize(inner.end),
        .                       span.ctxt,
        .                       span.parent,
        .                   )
       14 ( 0.00%)      }
        .           
        .               /// Equivalent of `Span::def_site` from the proc macro API,
        .               /// except that the location is taken from the `self` span.
        .               pub fn with_def_site_ctxt(self, expn_id: ExpnId) -> Span {
       58 ( 0.00%)          self.with_ctxt_from_mark(expn_id, Transparency::Opaque)
        .               }
        .           
        .               /// Equivalent of `Span::call_site` from the proc macro API,
        .               /// except that the location is taken from the `self` span.
        .               pub fn with_call_site_ctxt(self, expn_id: ExpnId) -> Span {
        8 ( 0.00%)          self.with_ctxt_from_mark(expn_id, Transparency::Transparent)
        .               }
        .           
        .               /// Equivalent of `Span::mixed_site` from the proc macro API,
        .               /// except that the location is taken from the `self` span.
        .               pub fn with_mixed_site_ctxt(self, expn_id: ExpnId) -> Span {
        .                   self.with_ctxt_from_mark(expn_id, Transparency::SemiTransparent)
        .               }
        .           
        .               /// Produces a span with the same location as `self` and context produced by a macro with the
        .               /// given ID and transparency, assuming that macro was defined directly and not produced by
        .               /// some other macro (which is the case for built-in and procedural macros).
      396 ( 0.00%)      pub fn with_ctxt_from_mark(self, expn_id: ExpnId, transparency: Transparency) -> Span {
        .                   self.with_ctxt(SyntaxContext::root().apply_mark(expn_id, transparency))
      231 ( 0.00%)      }
        .           
        .               #[inline]
        .               pub fn apply_mark(self, expn_id: ExpnId, transparency: Transparency) -> Span {
        .                   let span = self.data();
    1,071 ( 0.00%)          span.with_ctxt(span.ctxt.apply_mark(expn_id, transparency))
        .               }
        .           
        .               #[inline]
        .               pub fn remove_mark(&mut self) -> ExpnId {
        .                   let mut span = self.data();
        .                   let mark = span.ctxt.remove_mark();
        .                   *self = Span::new(span.lo, span.hi, span.ctxt, span.parent);
        .                   mark
-- line 897 ----------------------------------------
-- line 901 ----------------------------------------
        .               pub fn adjust(&mut self, expn_id: ExpnId) -> Option<ExpnId> {
        .                   let mut span = self.data();
        .                   let mark = span.ctxt.adjust(expn_id);
        .                   *self = Span::new(span.lo, span.hi, span.ctxt, span.parent);
        .                   mark
        .               }
        .           
        .               #[inline]
    2,025 ( 0.00%)      pub fn normalize_to_macros_2_0_and_adjust(&mut self, expn_id: ExpnId) -> Option<ExpnId> {
    1,350 ( 0.00%)          let mut span = self.data();
    1,117 ( 0.00%)          let mark = span.ctxt.normalize_to_macros_2_0_and_adjust(expn_id);
    2,025 ( 0.00%)          *self = Span::new(span.lo, span.hi, span.ctxt, span.parent);
        .                   mark
    2,242 ( 0.00%)      }
        .           
        .               #[inline]
        .               pub fn glob_adjust(&mut self, expn_id: ExpnId, glob_span: Span) -> Option<Option<ExpnId>> {
        .                   let mut span = self.data();
        .                   let mark = span.ctxt.glob_adjust(expn_id, glob_span);
        .                   *self = Span::new(span.lo, span.hi, span.ctxt, span.parent);
        .                   mark
        .               }
-- line 922 ----------------------------------------
-- line 929 ----------------------------------------
        .               ) -> Option<Option<ExpnId>> {
        .                   let mut span = self.data();
        .                   let mark = span.ctxt.reverse_glob_adjust(expn_id, glob_span);
        .                   *self = Span::new(span.lo, span.hi, span.ctxt, span.parent);
        .                   mark
        .               }
        .           
        .               #[inline]
    1,568 ( 0.00%)      pub fn normalize_to_macros_2_0(self) -> Span {
        .                   let span = self.data();
        .                   span.with_ctxt(span.ctxt.normalize_to_macros_2_0())
    1,372 ( 0.00%)      }
        .           
        .               #[inline]
        .               pub fn normalize_to_macro_rules(self) -> Span {
        .                   let span = self.data();
        .                   span.with_ctxt(span.ctxt.normalize_to_macro_rules())
        .               }
        .           }
        .           
-- line 948 ----------------------------------------
-- line 958 ----------------------------------------
        .           
        .               /// What label should we attach to this span (if any)?
        .               pub label: Option<String>,
        .           }
        .           
        .           impl Default for Span {
        .               fn default() -> Self {
        .                   DUMMY_SP
        2 ( 0.00%)      }
        .           }
        .           
        .           impl<E: Encoder> Encodable<E> for Span {
        .               default fn encode(&self, s: &mut E) -> Result<(), E::Error> {
        .                   let span = self.data();
        .                   s.emit_struct(false, |s| {
        .                       s.emit_struct_field("lo", true, |s| span.lo.encode(s))?;
        .                       s.emit_struct_field("hi", false, |s| span.hi.encode(s))
-- line 974 ----------------------------------------
-- line 990 ----------------------------------------
        .           /// any spans that are debug-printed during the closure's execution.
        .           ///
        .           /// Normally, the global `TyCtxt` is used to retrieve the `SourceMap`
        .           /// (see `rustc_interface::callbacks::span_debug1`). However, some parts
        .           /// of the compiler (e.g. `rustc_parse`) may debug-print `Span`s before
        .           /// a `TyCtxt` is available. In this case, we fall back to
        .           /// the `SourceMap` provided to this function. If that is not available,
        .           /// we fall back to printing the raw `Span` field values.
        9 ( 0.00%)  pub fn with_source_map<T, F: FnOnce() -> T>(source_map: Lrc<SourceMap>, f: F) -> T {
        .               with_session_globals(|session_globals| {
        2 ( 0.00%)          *session_globals.source_map.borrow_mut() = Some(source_map);
        .               });
        .               struct ClearSourceMap;
        .               impl Drop for ClearSourceMap {
        .                   fn drop(&mut self) {
        .                       with_session_globals(|session_globals| {
        1 ( 0.00%)                  session_globals.source_map.borrow_mut().take();
        .                       });
        .                   }
        .               }
        .           
        .               let _guard = ClearSourceMap;
        4 ( 0.00%)      f()
        8 ( 0.00%)  }
        .           
        .           pub fn debug_with_source_map(
        .               span: Span,
        .               f: &mut fmt::Formatter<'_>,
        .               source_map: &SourceMap,
        .           ) -> fmt::Result {
        .               write!(f, "{} ({:?})", source_map.span_to_diagnostic_string(span), span.ctxt())
        .           }
-- line 1021 ----------------------------------------
-- line 1048 ----------------------------------------
        .           
        .           impl MultiSpan {
        .               #[inline]
        .               pub fn new() -> MultiSpan {
        .                   MultiSpan { primary_spans: vec![], span_labels: vec![] }
        .               }
        .           
        .               pub fn from_span(primary_span: Span) -> MultiSpan {
       30 ( 0.00%)          MultiSpan { primary_spans: vec![primary_span], span_labels: vec![] }
        .               }
        .           
        .               pub fn from_spans(mut vec: Vec<Span>) -> MultiSpan {
        .                   vec.sort();
        .                   MultiSpan { primary_spans: vec, span_labels: vec![] }
        .               }
        .           
        .               pub fn push_span_label(&mut self, span: Span, label: String) {
        .                   self.span_labels.push((span, label));
        .               }
        .           
        .               /// Selects the first primary span (if any).
        .               pub fn primary_span(&self) -> Option<Span> {
        .                   self.primary_spans.first().cloned()
        4 ( 0.00%)      }
        .           
        .               /// Returns all primary spans.
        .               pub fn primary_spans(&self) -> &[Span] {
        .                   &self.primary_spans
        .               }
        .           
        .               /// Returns `true` if any of the primary spans are displayable.
        .               pub fn has_primary_spans(&self) -> bool {
-- line 1079 ----------------------------------------
-- line 1139 ----------------------------------------
        .           
        .               /// Returns `true` if any of the span labels is displayable.
        .               pub fn has_span_labels(&self) -> bool {
        .                   self.span_labels.iter().any(|(sp, _)| !sp.is_dummy())
        .               }
        .           }
        .           
        .           impl From<Span> for MultiSpan {
       30 ( 0.00%)      fn from(span: Span) -> MultiSpan {
        .                   MultiSpan::from_span(span)
       30 ( 0.00%)      }
        .           }
        .           
        .           impl From<Vec<Span>> for MultiSpan {
        .               fn from(spans: Vec<Span>) -> MultiSpan {
        .                   MultiSpan::from_spans(spans)
        .               }
        .           }
        .           
-- line 1157 ----------------------------------------
-- line 1160 ----------------------------------------
        .           pub struct MultiByteChar {
        .               /// The absolute offset of the character in the `SourceMap`.
        .               pub pos: BytePos,
        .               /// The number of bytes, `>= 2`.
        .               pub bytes: u8,
        .           }
        .           
        .           /// Identifies an offset of a non-narrow character in a `SourceFile`.
      308 ( 0.00%)  #[derive(Copy, Clone, Encodable, Decodable, Eq, PartialEq, Debug)]
        .           pub enum NonNarrowChar {
        .               /// Represents a zero-width character.
        .               ZeroWidth(BytePos),
        .               /// Represents a wide (full-width) character.
        .               Wide(BytePos),
        .               /// Represents a tab character, represented visually with a width of 4 characters.
        .               Tab(BytePos),
        .           }
-- line 1176 ----------------------------------------
-- line 1201 ----------------------------------------
        .                   }
        .               }
        .           }
        .           
        .           impl Add<BytePos> for NonNarrowChar {
        .               type Output = Self;
        .           
        .               fn add(self, rhs: BytePos) -> Self {
      532 ( 0.00%)          match self {
        .                       NonNarrowChar::ZeroWidth(pos) => NonNarrowChar::ZeroWidth(pos + rhs),
        .                       NonNarrowChar::Wide(pos) => NonNarrowChar::Wide(pos + rhs),
        .                       NonNarrowChar::Tab(pos) => NonNarrowChar::Tab(pos + rhs),
        .                   }
        .               }
        .           }
        .           
        .           impl Sub<BytePos> for NonNarrowChar {
        .               type Output = Self;
        .           
      154 ( 0.00%)      fn sub(self, rhs: BytePos) -> Self {
      532 ( 0.00%)          match self {
        .                       NonNarrowChar::ZeroWidth(pos) => NonNarrowChar::ZeroWidth(pos - rhs),
        .                       NonNarrowChar::Wide(pos) => NonNarrowChar::Wide(pos - rhs),
        .                       NonNarrowChar::Tab(pos) => NonNarrowChar::Tab(pos - rhs),
        .                   }
      462 ( 0.00%)      }
        .           }
        .           
        .           /// Identifies an offset of a character that was normalized away from `SourceFile`.
        .           #[derive(Copy, Clone, Encodable, Decodable, Eq, PartialEq, Debug)]
        .           pub struct NormalizedPos {
        .               /// The absolute offset of the character in the `SourceMap`.
        .               pub pos: BytePos,
        .               /// The difference between original and normalized string at position.
        .               pub diff: u32,
        .           }
        .           
        3 ( 0.00%)  #[derive(PartialEq, Eq, Clone, Debug)]
        .           pub enum ExternalSource {
        .               /// No external source has to be loaded, since the `SourceFile` represents a local crate.
        .               Unneeded,
        .               Foreign {
        .                   kind: ExternalSourceKind,
        .                   /// This SourceFile's byte-offset within the source_map of its original crate.
        .                   original_start_pos: BytePos,
        .                   /// The end of this SourceFile within the source_map of its original crate.
-- line 1246 ----------------------------------------
-- line 1257 ----------------------------------------
        .               AbsentOk,
        .               /// A failed attempt has been made to load the external source.
        .               AbsentErr,
        .               Unneeded,
        .           }
        .           
        .           impl ExternalSource {
        .               pub fn get_source(&self) -> Option<&Lrc<String>> {
       54 ( 0.00%)          match self {
        .                       ExternalSource::Foreign { kind: ExternalSourceKind::Present(ref src), .. } => Some(src),
        .                       _ => None,
        .                   }
        .               }
        .           }
        .           
        .           #[derive(Debug)]
        .           pub struct OffsetOverflowError;
        .           
    1,056 ( 0.00%)  #[derive(Copy, Clone, Debug, PartialEq, Eq, PartialOrd, Ord, Hash, Encodable, Decodable)]
        .           pub enum SourceFileHashAlgorithm {
        .               Md5,
        .               Sha1,
        .               Sha256,
        .           }
        .           
        .           impl FromStr for SourceFileHashAlgorithm {
        .               type Err = ();
-- line 1283 ----------------------------------------
-- line 1290 ----------------------------------------
        .                       _ => Err(()),
        .                   }
        .               }
        .           }
        .           
        .           rustc_data_structures::impl_stable_hash_via_hash!(SourceFileHashAlgorithm);
        .           
        .           /// The hash of the on-disk source file used for debug info.
        6 ( 0.00%)  #[derive(Copy, Clone, PartialEq, Eq, Debug)]
    2,112 ( 0.00%)  #[derive(HashStable_Generic, Encodable, Decodable)]
        .           pub struct SourceFileHash {
        .               pub kind: SourceFileHashAlgorithm,
        .               value: [u8; 32],
        .           }
        .           
        .           impl SourceFileHash {
        .               pub fn new(kind: SourceFileHashAlgorithm, src: &str) -> SourceFileHash {
        .                   let mut hash = SourceFileHash { kind, value: Default::default() };
        .                   let len = hash.hash_len();
        .                   let value = &mut hash.value[..len];
        .                   let data = src.as_bytes();
        .                   match kind {
        .                       SourceFileHashAlgorithm::Md5 => {
        3 ( 0.00%)                  value.copy_from_slice(&Md5::digest(data));
        .                       }
        .                       SourceFileHashAlgorithm::Sha1 => {
        .                           value.copy_from_slice(&Sha1::digest(data));
        .                       }
        .                       SourceFileHashAlgorithm::Sha256 => {
        .                           value.copy_from_slice(&Sha256::digest(data));
        .                       }
        .                   }
-- line 1321 ----------------------------------------
-- line 1329 ----------------------------------------
        .           
        .               /// The bytes of the hash.
        .               pub fn hash_bytes(&self) -> &[u8] {
        .                   let len = self.hash_len();
        .                   &self.value[..len]
        .               }
        .           
        .               fn hash_len(&self) -> usize {
        3 ( 0.00%)          match self.kind {
        .                       SourceFileHashAlgorithm::Md5 => 16,
        .                       SourceFileHashAlgorithm::Sha1 => 20,
        .                       SourceFileHashAlgorithm::Sha256 => 32,
        .                   }
        .               }
        .           }
        .           
        .           /// A single source in the [`SourceMap`].
       58 ( 0.00%)  #[derive(Clone)]
        .           pub struct SourceFile {
        .               /// The name of the file that the source came from. Source that doesn't
        .               /// originate from files has names between angle brackets by convention
        .               /// (e.g., `<anon>`).
        .               pub name: FileName,
        .               /// The complete source code.
        1 ( 0.00%)      pub src: Option<Lrc<String>>,
        .               /// The source code's hash.
        .               pub src_hash: SourceFileHash,
        .               /// The external source code (used for external crates, which will have a `None`
        .               /// value as `self.src`.
        .               pub external_src: Lock<ExternalSource>,
        .               /// The start position of this source in the `SourceMap`.
        .               pub start_pos: BytePos,
        .               /// The end position of this source in the `SourceMap`.
-- line 1361 ----------------------------------------
-- line 1364 ----------------------------------------
        .               pub lines: Vec<BytePos>,
        .               /// Locations of multi-byte characters in the source code.
        .               pub multibyte_chars: Vec<MultiByteChar>,
        .               /// Width of characters that are not narrow in the source code.
        .               pub non_narrow_chars: Vec<NonNarrowChar>,
        .               /// Locations of characters removed during normalization.
        .               pub normalized_pos: Vec<NormalizedPos>,
        .               /// A hash of the filename, used for speeding up hashing in incremental compilation.
        1 ( 0.00%)      pub name_hash: u128,
        .               /// Indicates which crate this `SourceFile` was imported from.
        1 ( 0.00%)      pub cnum: CrateNum,
        .           }
        .           
        .           impl<S: Encoder> Encodable<S> for SourceFile {
        .               fn encode(&self, s: &mut S) -> Result<(), S::Error> {
        .                   s.emit_struct(false, |s| {
        .                       s.emit_struct_field("name", true, |s| self.name.encode(s))?;
        .                       s.emit_struct_field("src_hash", false, |s| self.src_hash.encode(s))?;
        .                       s.emit_struct_field("start_pos", false, |s| self.start_pos.encode(s))?;
        .                       s.emit_struct_field("end_pos", false, |s| self.end_pos.encode(s))?;
        .                       s.emit_struct_field("lines", false, |s| {
        .                           let lines = &self.lines[..];
        .                           // Store the length.
        .                           s.emit_u32(lines.len() as u32)?;
        .           
        4 ( 0.00%)                  if !lines.is_empty() {
        .                               // In order to preserve some space, we exploit the fact that
        .                               // the lines list is sorted and individual lines are
        .                               // probably not that long. Because of that we can store lines
        .                               // as a difference list, using as little space as possible
        .                               // for the differences.
        .                               let max_line_length = if lines.len() == 1 {
        .                                   0
        .                               } else {
-- line 1397 ----------------------------------------
-- line 1399 ----------------------------------------
        .                                       .array_windows()
        .                                       .map(|&[fst, snd]| snd - fst)
        .                                       .map(|bp| bp.to_usize())
        .                                       .max()
        .                                       .unwrap()
        .                               };
        .           
        .                               let bytes_per_diff: u8 = match max_line_length {
        2 ( 0.00%)                          0..=0xFF => 1,
        .                                   0x100..=0xFFFF => 2,
        .                                   _ => 4,
        .                               };
        .           
        .                               // Encode the number of bytes used per diff.
        .                               bytes_per_diff.encode(s)?;
        .           
        .                               // Encode the first element.
        .                               lines[0].encode(s)?;
        .           
        .                               let diff_iter = lines.array_windows().map(|&[fst, snd]| snd - fst);
        .           
        2 ( 0.00%)                      match bytes_per_diff {
        .                                   1 => {
        .                                       for diff in diff_iter {
        .                                           (diff.0 as u8).encode(s)?
        .                                       }
        .                                   }
        .                                   2 => {
        .                                       for diff in diff_iter {
        .                                           (diff.0 as u16).encode(s)?
-- line 1428 ----------------------------------------
-- line 1436 ----------------------------------------
        .                                   _ => unreachable!(),
        .                               }
        .                           }
        .           
        .                           Ok(())
        .                       })?;
        .                       s.emit_struct_field("multibyte_chars", false, |s| self.multibyte_chars.encode(s))?;
        .                       s.emit_struct_field("non_narrow_chars", false, |s| self.non_narrow_chars.encode(s))?;
        3 ( 0.00%)              s.emit_struct_field("name_hash", false, |s| self.name_hash.encode(s))?;
        .                       s.emit_struct_field("normalized_pos", false, |s| self.normalized_pos.encode(s))?;
       11 ( 0.00%)              s.emit_struct_field("cnum", false, |s| self.cnum.encode(s))
        .                   })
        .               }
        .           }
        .           
        .           impl<D: Decoder> Decodable<D> for SourceFile {
    4,752 ( 0.00%)      fn decode(d: &mut D) -> SourceFile {
        .                   d.read_struct(|d| {
        .                       let name: FileName = d.read_struct_field("name", |d| Decodable::decode(d));
        .                       let src_hash: SourceFileHash =
        .                           d.read_struct_field("src_hash", |d| Decodable::decode(d));
        .                       let start_pos: BytePos = d.read_struct_field("start_pos", |d| Decodable::decode(d));
        .                       let end_pos: BytePos = d.read_struct_field("end_pos", |d| Decodable::decode(d));
        .                       let lines: Vec<BytePos> = d.read_struct_field("lines", |d| {
        .                           let num_lines: u32 = Decodable::decode(d);
      528 ( 0.00%)                  let mut lines = Vec::with_capacity(num_lines as usize);
        .           
        .                           if num_lines > 0 {
        .                               // Read the number of bytes used per diff.
        .                               let bytes_per_diff: u8 = Decodable::decode(d);
        .           
        .                               // Read the first element.
        .                               let mut line_start: BytePos = Decodable::decode(d);
        .                               lines.push(line_start);
        .           
        .                               for _ in 1..num_lines {
  866,126 ( 0.70%)                          let diff = match bytes_per_diff {
        .                                       1 => d.read_u8() as u32,
        .                                       2 => d.read_u16() as u32,
        .                                       4 => d.read_u32(),
        .                                       _ => unreachable!(),
        .                                   };
        .           
        .                                   line_start = line_start + BytePos(diff);
        .           
-- line 1480 ----------------------------------------
-- line 1483 ----------------------------------------
        .                           }
        .           
        .                           lines
        .                       });
        .                       let multibyte_chars: Vec<MultiByteChar> =
        .                           d.read_struct_field("multibyte_chars", |d| Decodable::decode(d));
        .                       let non_narrow_chars: Vec<NonNarrowChar> =
        .                           d.read_struct_field("non_narrow_chars", |d| Decodable::decode(d));
    1,056 ( 0.00%)              let name_hash: u128 = d.read_struct_field("name_hash", |d| Decodable::decode(d));
        .                       let normalized_pos: Vec<NormalizedPos> =
        .                           d.read_struct_field("normalized_pos", |d| Decodable::decode(d));
        .                       let cnum: CrateNum = d.read_struct_field("cnum", |d| Decodable::decode(d));
    5,808 ( 0.00%)              SourceFile {
    4,224 ( 0.00%)                  name,
        .                           start_pos,
        .                           end_pos,
        .                           src: None,
    2,112 ( 0.00%)                  src_hash,
        .                           // Unused - the metadata decoder will construct
        .                           // a new SourceFile, filling in `external_src` properly
        .                           external_src: Lock::new(ExternalSource::Unneeded),
    2,112 ( 0.00%)                  lines,
    2,112 ( 0.00%)                  multibyte_chars,
    2,112 ( 0.00%)                  non_narrow_chars,
    2,112 ( 0.00%)                  normalized_pos,
        .                           name_hash,
        .                           cnum,
        .                       }
        .                   })
    4,752 ( 0.00%)      }
        .           }
        .           
        .           impl fmt::Debug for SourceFile {
        .               fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {
        .                   write!(fmt, "SourceFile({:?})", self.name)
        .               }
        .           }
        .           
        .           impl SourceFile {
       11 ( 0.00%)      pub fn new(
        .                   name: FileName,
        .                   mut src: String,
        .                   start_pos: BytePos,
        .                   hash_kind: SourceFileHashAlgorithm,
        .               ) -> Self {
        .                   // Compute the file hash before any normalization.
        .                   let src_hash = SourceFileHash::new(hash_kind, &src);
        3 ( 0.00%)          let normalized_pos = normalize_src(&mut src, start_pos);
        .           
        .                   let name_hash = {
        .                       let mut hasher: StableHasher = StableHasher::new();
        2 ( 0.00%)              name.hash(&mut hasher);
        .                       hasher.finish::<u128>()
        .                   };
        2 ( 0.00%)          let end_pos = start_pos.to_usize() + src.len();
        3 ( 0.00%)          assert!(end_pos <= u32::MAX as usize);
        .           
       12 ( 0.00%)          let (lines, multibyte_chars, non_narrow_chars) =
        2 ( 0.00%)              analyze_source_file::analyze_source_file(&src, start_pos);
        .           
       17 ( 0.00%)          SourceFile {
        .                       name,
        .                       src: Some(Lrc::new(src)),
       11 ( 0.00%)              src_hash,
        .                       external_src: Lock::new(ExternalSource::Unneeded),
        .                       start_pos,
        .                       end_pos: Pos::from_usize(end_pos),
        4 ( 0.00%)              lines,
        4 ( 0.00%)              multibyte_chars,
        4 ( 0.00%)              non_narrow_chars,
        4 ( 0.00%)              normalized_pos,
        .                       name_hash,
        .                       cnum: LOCAL_CRATE,
        .                   }
        9 ( 0.00%)      }
        .           
        .               /// Returns the `BytePos` of the beginning of the current line.
        .               pub fn line_begin_pos(&self, pos: BytePos) -> BytePos {
        .                   let line_index = self.lookup_line(pos).unwrap();
        .                   self.lines[line_index]
        .               }
        .           
        .               /// Add externally loaded source.
        .               /// If the hash of the input doesn't match or no input is supplied via None,
        .               /// it is interpreted as an error and the corresponding enum variant is set.
        .               /// The return value signifies whether some kind of source is present.
       84 ( 0.00%)      pub fn add_external_src<F>(&self, get_src: F) -> bool
        .               where
        .                   F: FnOnce() -> Option<String>,
        .               {
       12 ( 0.00%)          if matches!(
       24 ( 0.00%)              *self.external_src.borrow(),
        .                       ExternalSource::Foreign { kind: ExternalSourceKind::AbsentOk, .. }
        .                   ) {
        .                       let src = get_src();
        .                       let mut external_src = self.external_src.borrow_mut();
        .                       // Check that no-one else have provided the source while we were getting it
        .                       if let ExternalSource::Foreign {
        .                           kind: src_kind @ ExternalSourceKind::AbsentOk, ..
        .                       } = &mut *external_src
-- line 1582 ----------------------------------------
-- line 1592 ----------------------------------------
        .                               *src_kind = ExternalSourceKind::AbsentErr;
        .                           }
        .           
        .                           false
        .                       } else {
        .                           self.src.is_some() || external_src.get_source().is_some()
        .                       }
        .                   } else {
       12 ( 0.00%)              self.src.is_some() || self.external_src.borrow().get_source().is_some()
        .                   }
      108 ( 0.00%)      }
        .           
        .               /// Gets a line from the list of pre-computed line-beginnings.
        .               /// The line number here is 0-based.
        .               pub fn get_line(&self, line_number: usize) -> Option<Cow<'_, str>> {
        .                   fn get_until_newline(src: &str, begin: usize) -> &str {
        .                       // We can't use `lines.get(line_number+1)` because we might
        .                       // be parsing when we call this function and thus the current
        .                       // line is the last one we have line info for.
-- line 1610 ----------------------------------------
-- line 1627 ----------------------------------------
        .                       Some(Cow::Owned(String::from(get_until_newline(src, begin))))
        .                   } else {
        .                       None
        .                   }
        .               }
        .           
        .               pub fn is_real_file(&self) -> bool {
        .                   self.name.is_real()
      529 ( 0.00%)      }
        .           
        .               pub fn is_imported(&self) -> bool {
        .                   self.src.is_none()
      839 ( 0.00%)      }
        .           
        .               pub fn count_lines(&self) -> usize {
        .                   self.lines.len()
        .               }
        .           
        .               /// Finds the line containing the given position. The return value is the
        .               /// index into the `lines` array of this `SourceFile`, not the 1-based line
        .               /// number. If the source_file is empty or the position is located before the
        .               /// first line, `None` is returned.
        .               pub fn lookup_line(&self, pos: BytePos) -> Option<usize> {
      492 ( 0.00%)          match self.lines.binary_search(&pos) {
        .                       Ok(idx) => Some(idx),
        .                       Err(0) => None,
        .                       Err(idx) => Some(idx - 1),
        .                   }
        .               }
        .           
        .               pub fn line_bounds(&self, line_index: usize) -> Range<BytePos> {
    1,019 ( 0.00%)          if self.is_empty() {
        .                       return self.start_pos..self.end_pos;
        .                   }
        .           
      710 ( 0.00%)          assert!(line_index < self.lines.len());
      966 ( 0.00%)          if line_index == (self.lines.len() - 1) {
        7 ( 0.00%)              self.lines[line_index]..self.end_pos
        .                   } else {
      638 ( 0.00%)              self.lines[line_index]..self.lines[line_index + 1]
        .                   }
        .               }
        .           
        .               /// Returns whether or not the file contains the given `SourceMap` byte
        .               /// position. The position one past the end of the file is considered to be
        .               /// contained by the file. This implies that files for which `is_empty`
        .               /// returns true still contain one byte position according to this function.
        .               #[inline]
-- line 1674 ----------------------------------------
-- line 1692 ----------------------------------------
        .                       Err(i) if i == 0 => 0,
        .                       Err(i) => self.normalized_pos[i - 1].diff,
        .                   };
        .           
        .                   BytePos::from_u32(pos.0 - self.start_pos.0 + diff)
        .               }
        .           
        .               /// Converts an absolute `BytePos` to a `CharPos` relative to the `SourceFile`.
        2 ( 0.00%)      pub fn bytepos_to_file_charpos(&self, bpos: BytePos) -> CharPos {
        .                   // The number of extra bytes due to multibyte chars in the `SourceFile`.
        .                   let mut total_extra_bytes = 0;
        .           
        6 ( 0.00%)          for mbc in self.multibyte_chars.iter() {
        .                       debug!("{}-byte char at {:?}", mbc.bytes, mbc.pos);
        .                       if mbc.pos < bpos {
        .                           // Every character is at least one byte, so we only
        .                           // count the actual extra bytes.
        .                           total_extra_bytes += mbc.bytes as u32 - 1;
        .                           // We should never see a byte position in the middle of a
        .                           // character.
        .                           assert!(bpos.to_u32() >= mbc.pos.to_u32() + mbc.bytes as u32);
        .                       } else {
        .                           break;
        .                       }
        .                   }
        .           
       12 ( 0.00%)          assert!(self.start_pos.to_u32() + total_extra_bytes <= bpos.to_u32());
       10 ( 0.00%)          CharPos(bpos.to_usize() - self.start_pos.to_usize() - total_extra_bytes as usize)
        4 ( 0.00%)      }
        .           
        .               /// Looks up the file's (1-based) line number and (0-based `CharPos`) column offset, for a
        .               /// given `BytePos`.
        7 ( 0.00%)      pub fn lookup_file_pos(&self, pos: BytePos) -> (usize, CharPos) {
        2 ( 0.00%)          let chpos = self.bytepos_to_file_charpos(pos);
        .                   match self.lookup_line(pos) {
        .                       Some(a) => {
        .                           let line = a + 1; // Line numbers start at 1
        1 ( 0.00%)                  let linebpos = self.lines[a];
        2 ( 0.00%)                  let linechpos = self.bytepos_to_file_charpos(linebpos);
        .                           let col = chpos - linechpos;
        .                           debug!("byte pos {:?} is on the line at byte pos {:?}", pos, linebpos);
        .                           debug!("char pos {:?} is on the line at char pos {:?}", chpos, linechpos);
        .                           debug!("byte is on line: {}", line);
        1 ( 0.00%)                  assert!(chpos >= linechpos);
        .                           (line, col)
        .                       }
        .                       None => (0, chpos),
        .                   }
        8 ( 0.00%)      }
        .           
        .               /// Looks up the file's (1-based) line number, (0-based `CharPos`) column offset, and (0-based)
        .               /// column offset when displayed, for a given `BytePos`.
        8 ( 0.00%)      pub fn lookup_file_pos_with_col_display(&self, pos: BytePos) -> (usize, CharPos, usize) {
        3 ( 0.00%)          let (line, col_or_chpos) = self.lookup_file_pos(pos);
        2 ( 0.00%)          if line > 0 {
        .                       let col = col_or_chpos;
        1 ( 0.00%)              let linebpos = self.lines[line - 1];
        .                       let col_display = {
        .                           let start_width_idx = self
        .                               .non_narrow_chars
        .                               .binary_search_by_key(&linebpos, |x| x.pos())
        .                               .unwrap_or_else(|x| x);
        .                           let end_width_idx = self
        .                               .non_narrow_chars
        .                               .binary_search_by_key(&pos, |x| x.pos())
        .                               .unwrap_or_else(|x| x);
        .                           let special_chars = end_width_idx - start_width_idx;
        .                           let non_narrow: usize = self.non_narrow_chars[start_width_idx..end_width_idx]
        .                               .iter()
        .                               .map(|x| x.width())
        .                               .sum();
        5 ( 0.00%)                  col.0 - special_chars + non_narrow
        .                       };
        .                       (line, col, col_display)
        .                   } else {
        .                       let chpos = col_or_chpos;
        .                       let col_display = {
        .                           let end_width_idx = self
        .                               .non_narrow_chars
        .                               .binary_search_by_key(&pos, |x| x.pos())
        .                               .unwrap_or_else(|x| x);
        .                           let non_narrow: usize =
        .                               self.non_narrow_chars[0..end_width_idx].iter().map(|x| x.width()).sum();
        .                           chpos.0 - end_width_idx + non_narrow
        .                       };
        .                       (0, chpos, col_display)
        .                   }
        7 ( 0.00%)      }
        .           }
        .           
        .           /// Normalizes the source code and records the normalizations.
       10 ( 0.00%)  fn normalize_src(src: &mut String, start_pos: BytePos) -> Vec<NormalizedPos> {
        .               let mut normalized_pos = vec![];
        .               remove_bom(src, &mut normalized_pos);
        .               normalize_newlines(src, &mut normalized_pos);
        .           
        .               // Offset all the positions by start_pos to match the final file positions.
        .               for np in &mut normalized_pos {
        .                   np.pos.0 += start_pos.0;
        .               }
        .           
        .               normalized_pos
        9 ( 0.00%)  }
        .           
        .           /// Removes UTF-8 BOM, if any.
        .           fn remove_bom(src: &mut String, normalized_pos: &mut Vec<NormalizedPos>) {
        1 ( 0.00%)      if src.starts_with('\u{feff}') {
        .                   src.drain(..3);
        .                   normalized_pos.push(NormalizedPos { pos: BytePos(0), diff: 3 });
        .               }
        .           }
        .           
        .           /// Replaces `\r\n` with `\n` in-place in `src`.
        .           ///
        .           /// Returns error if there's a lone `\r` in the string.
        .           fn normalize_newlines(src: &mut String, normalized_pos: &mut Vec<NormalizedPos>) {
        1 ( 0.00%)      if !src.as_bytes().contains(&b'\r') {
        .                   return;
        .               }
        .           
        .               // We replace `\r\n` with `\n` in-place, which doesn't break utf-8 encoding.
        .               // While we *can* call `as_mut_vec` and do surgery on the live string
        .               // directly, let's rather steal the contents of `src`. This makes the code
        .               // safe even if a panic occurs.
        .           
-- line 1816 ----------------------------------------
-- line 1877 ----------------------------------------
        .               (
        .                   $(
        .                       $(#[$attr:meta])*
        .                       $vis:vis struct $ident:ident($inner_vis:vis $inner_ty:ty);
        .                   )*
        .               ) => {
        .                   $(
        .                       $(#[$attr])*
    2,049 ( 0.00%)              $vis struct $ident($inner_vis $inner_ty);
        .           
        .                       impl Pos for $ident {
        .                           #[inline(always)]
        .                           fn from_usize(n: usize) -> $ident {
      272 ( 0.00%)                      $ident(n as $inner_ty)
        .                           }
        .           
        .                           #[inline(always)]
        .                           fn to_usize(&self) -> usize {
    3,665 ( 0.00%)                      self.0 as usize
        .                           }
        .           
        .                           #[inline(always)]
        .                           fn from_u32(n: u32) -> $ident {
        .                               $ident(n as $inner_ty)
        .                           }
        .           
        .                           #[inline(always)]
-- line 1903 ----------------------------------------
-- line 1906 ----------------------------------------
        .                           }
        .                       }
        .           
        .                       impl Add for $ident {
        .                           type Output = $ident;
        .           
        .                           #[inline(always)]
        .                           fn add(self, rhs: $ident) -> $ident {
1,461,833 ( 1.18%)                      $ident(self.0 + rhs.0)
        .                           }
        .                       }
        .           
        .                       impl Sub for $ident {
        .                           type Output = $ident;
        .           
        .                           #[inline(always)]
        .                           fn sub(self, rhs: $ident) -> $ident {
  762,194 ( 0.61%)                      $ident(self.0 - rhs.0)
        .                           }
        .                       }
        .                   )*
        .               };
        .           }
        .           
        .           impl_pos! {
        .               /// A byte offset.
-- line 1931 ----------------------------------------
-- line 1946 ----------------------------------------
        .           impl<S: rustc_serialize::Encoder> Encodable<S> for BytePos {
        .               fn encode(&self, s: &mut S) -> Result<(), S::Error> {
        .                   s.emit_u32(self.0)
        .               }
        .           }
        .           
        .           impl<D: rustc_serialize::Decoder> Decodable<D> for BytePos {
        .               fn decode(d: &mut D) -> BytePos {
   44,878 ( 0.04%)          BytePos(d.read_u32())
        .               }
        .           }
        .           
        .           // _____________________________________________________________________________
        .           // Loc, SourceFileAndLine, SourceFileAndBytePos
        .           //
        .           
        .           /// A source code location used for error reporting.
-- line 1962 ----------------------------------------
-- line 2042 ----------------------------------------
        .           /// Range inside of a `Span` used for diagnostics when we only have access to relative positions.
        .           #[derive(Copy, Clone, PartialEq, Eq, Debug)]
        .           pub struct InnerSpan {
        .               pub start: usize,
        .               pub end: usize,
        .           }
        .           
        .           impl InnerSpan {
       14 ( 0.00%)      pub fn new(start: usize, end: usize) -> InnerSpan {
        .                   InnerSpan { start, end }
        7 ( 0.00%)      }
        .           }
        .           
        .           /// Requirements for a `StableHashingContext` to be used in this crate.
        .           ///
        .           /// This is a hack to allow using the [`HashStable_Generic`] derive macro
        .           /// instead of implementing everything in rustc_middle.
        .           pub trait HashStableContext {
        .               fn def_path_hash(&self, def_id: DefId) -> DefPathHash;
-- line 2060 ----------------------------------------
-- line 2079 ----------------------------------------
        .               /// offsets into the `SourceMap`). Instead, we hash the (file name, line, column)
        .               /// triple, which stays the same even if the containing `SourceFile` has moved
        .               /// within the `SourceMap`.
        .               ///
        .               /// Also note that we are hashing byte offsets for the column, not unicode
        .               /// codepoint offsets. For the purpose of the hash that's sufficient.
        .               /// Also, hashing filenames is expensive so we avoid doing it twice when the
        .               /// span starts and ends in the same file, which is almost always the case.
   12,411 ( 0.01%)      fn hash_stable(&self, ctx: &mut CTX, hasher: &mut StableHasher) {
        .                   const TAG_VALID_SPAN: u8 = 0;
        .                   const TAG_INVALID_SPAN: u8 = 1;
        .                   const TAG_RELATIVE_SPAN: u8 = 2;
        .           
    2,377 ( 0.00%)          if !ctx.hash_spans() {
        .                       return;
        .                   }
        .           
   10,034 ( 0.01%)          let span = self.data_untracked();
    3,507 ( 0.00%)          span.ctxt.hash_stable(ctx, hasher);
    5,319 ( 0.00%)          span.parent.hash_stable(ctx, hasher);
        .           
    3,593 ( 0.00%)          if span.is_dummy() {
        .                       Hash::hash(&TAG_INVALID_SPAN, hasher);
        .                       return;
        .                   }
        .           
    3,452 ( 0.00%)          if let Some(parent) = span.parent {
        .                       let def_span = ctx.def_span(parent).data_untracked();
        .                       if def_span.contains(span) {
        .                           // This span is enclosed in a definition: only hash the relative position.
        .                           Hash::hash(&TAG_RELATIVE_SPAN, hasher);
        .                           (span.lo - def_span.lo).to_u32().hash_stable(ctx, hasher);
        .                           (span.hi - def_span.lo).to_u32().hash_stable(ctx, hasher);
        .                           return;
        .                       }
        .                   }
        .           
        .                   // If this is not an empty or invalid span, we want to hash the last
        .                   // position that belongs to it, as opposed to hashing the first
        .                   // position past it.
    6,904 ( 0.01%)          let (file, line_lo, col_lo, line_hi, col_hi) = match ctx.span_data_to_lines_and_cols(&span)
        .                   {
    3,452 ( 0.00%)              Some(pos) => pos,
        .                       None => {
        .                           Hash::hash(&TAG_INVALID_SPAN, hasher);
        .                           return;
        .                       }
        .                   };
        .           
        .                   Hash::hash(&TAG_VALID_SPAN, hasher);
        .                   // We truncate the stable ID hash and line and column numbers. The chances
-- line 2129 ----------------------------------------
-- line 2134 ----------------------------------------
        .                   // hash only the length, for example, then two otherwise equal spans with
        .                   // different end locations will have the same hash. This can cause a problem
        .                   // during incremental compilation wherein a previous result for a query that
        .                   // depends on the end location of a span will be incorrectly reused when the
        .                   // end location of the span it depends on has changed (see issue #74890). A
        .                   // similar analysis applies if some query depends specifically on the length
        .                   // of the span, but we only hash the end location. So hash both.
        .           
    1,726 ( 0.00%)          let col_lo_trunc = (col_lo.0 as u64) & 0xFF;
        .                   let line_lo_trunc = ((line_lo as u64) & 0xFF_FF_FF) << 8;
        .                   let col_hi_trunc = (col_hi.0 as u64) & 0xFF << 32;
        .                   let line_hi_trunc = ((line_hi as u64) & 0xFF_FF_FF) << 40;
        .                   let col_line = col_lo_trunc | line_lo_trunc | col_hi_trunc | line_hi_trunc;
    1,726 ( 0.00%)          let len = (span.hi - span.lo).0;
        .                   Hash::hash(&col_line, hasher);
        .                   Hash::hash(&len, hasher);
   14,184 ( 0.01%)      }
        .           }

1,121,736 ( 0.90%)  <counts for unidentified lines in /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/lib.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs
--------------------------------------------------------------------------------
Ir                 

-- line 111 ----------------------------------------
        .           const EMPTY: u8 = 0b1111_1111;
        .           
        .           /// Control byte value for a deleted bucket.
        .           const DELETED: u8 = 0b1000_0000;
        .           
        .           /// Checks whether a control byte represents a full bucket (top bit is clear).
        .           #[inline]
        .           fn is_full(ctrl: u8) -> bool {
  169,682 ( 0.14%)      ctrl & 0x80 == 0
        .           }
        .           
        .           /// Checks whether a control byte represents a special value (top bit is set).
        .           #[inline]
        .           fn is_special(ctrl: u8) -> bool {
        .               ctrl & 0x80 != 0
        .           }
        .           
        .           /// Checks whether a special control value is EMPTY (just check 1 bit).
        .           #[inline]
        .           fn special_is_empty(ctrl: u8) -> bool {
        .               debug_assert!(is_special(ctrl));
   13,775 ( 0.01%)      ctrl & 0x01 != 0
        .           }
        .           
        .           /// Primary hash function, used to select the initial bucket to probe from.
        .           #[inline]
        .           #[allow(clippy::cast_possible_truncation)]
        .           fn h1(hash: u64) -> usize {
        .               // On 32-bit platforms we simply ignore the higher hash bits.
        .               hash as usize
-- line 140 ----------------------------------------
-- line 143 ----------------------------------------
        .           /// Secondary hash function, saved in the low 7 bits of the control byte.
        .           #[inline]
        .           #[allow(clippy::cast_possible_truncation)]
        .           fn h2(hash: u64) -> u8 {
        .               // Grab the top 7 bits of the hash. While the hash is normally a full 64-bit
        .               // value, some hash functions (such as FxHash) produce a usize result
        .               // instead, which means that the top 32 bits are 0 on 32-bit platforms.
        .               let hash_len = usize::min(mem::size_of::<usize>(), mem::size_of::<u64>());
1,289,901 ( 1.04%)      let top7 = hash >> (hash_len * 8 - 7);
        .               (top7 & 0x7f) as u8 // truncation
        .           }
        .           
        .           /// Probe sequence based on triangular numbers, which is guaranteed (since our
        .           /// table size is a power of two) to visit every group of elements exactly once.
        .           ///
        .           /// A triangular probe has us jump by 1 more group every time. So first we
        .           /// jump by 1 group (meaning we just continue our linear scan), then 2 groups
-- line 159 ----------------------------------------
-- line 170 ----------------------------------------
        .               #[inline]
        .               fn move_next(&mut self, bucket_mask: usize) {
        .                   // We should have found an empty bucket by now and ended the probe.
        .                   debug_assert!(
        .                       self.stride <= bucket_mask,
        .                       "Went past end of probe sequence"
        .                   );
        .           
   22,378 ( 0.02%)          self.stride += Group::WIDTH;
   22,378 ( 0.02%)          self.pos += self.stride;
   18,469 ( 0.01%)          self.pos &= bucket_mask;
        .               }
        .           }
        .           
        .           /// Returns the number of buckets needed to hold the given number of items,
        .           /// taking the maximum load factor into account.
        .           ///
        .           /// Returns `None` if an overflow occurs.
        .           // Workaround for emscripten bug emscripten-core/emscripten-fastcomp#258
        .           #[cfg_attr(target_os = "emscripten", inline(never))]
        .           #[cfg_attr(not(target_os = "emscripten"), inline)]
        .           fn capacity_to_buckets(cap: usize) -> Option<usize> {
        .               debug_assert_ne!(cap, 0);
        .           
        .               // For small tables we require at least 1 empty bucket so that lookups are
        .               // guaranteed to terminate if an element doesn't exist in the table.
    6,288 ( 0.01%)      if cap < 8 {
        .                   // We don't bother with a table size of 2 buckets since that can only
        .                   // hold a single element. Instead we skip directly to a 4 bucket table
        .                   // which can hold 3 elements.
   11,975 ( 0.01%)          return Some(if cap < 4 { 4 } else { 8 });
        .               }
        .           
        .               // Otherwise require 1/8 buckets to be empty (87.5% load)
        .               //
        .               // Be careful when modifying this, calculate_layout relies on the
        .               // overflow check here.
    4,494 ( 0.00%)      let adjusted_cap = cap.checked_mul(8)? / 7;
        .           
        .               // Any overflows will have been caught by the checked_mul. Also, any
        .               // rounding errors from the division above will be cleaned up by
        .               // next_power_of_two (which can't overflow because of the previous division).
        .               Some(adjusted_cap.next_power_of_two())
        .           }
        .           
        .           /// Returns the maximum effective capacity for the given bucket mask, taking
        .           /// the maximum load factor into account.
        .           #[inline]
        .           fn bucket_mask_to_capacity(bucket_mask: usize) -> usize {
   16,126 ( 0.01%)      if bucket_mask < 8 {
        .                   // For tables with 1/2/4/8 buckets, we always reserve one empty slot.
        .                   // Keep in mind that the bucket mask is one less than the bucket count.
        .                   bucket_mask
        .               } else {
        .                   // For larger tables we reserve 12.5% of the slots as empty.
    6,364 ( 0.01%)          ((bucket_mask + 1) / 8) * 7
        .               }
        .           }
        .           
        .           /// Helper which allows the max calculation for ctrl_align to be statically computed for each T
        .           /// while keeping the rest of `calculate_layout_for` independent of `T`
        .           #[derive(Copy, Clone)]
        .           struct TableLayout {
        .               size: usize,
-- line 233 ----------------------------------------
-- line 246 ----------------------------------------
        .           
        .               #[inline]
        .               fn calculate_layout_for(self, buckets: usize) -> Option<(Layout, usize)> {
        .                   debug_assert!(buckets.is_power_of_two());
        .           
        .                   let TableLayout { size, ctrl_align } = self;
        .                   // Manual layout calculation since Layout methods are not yet stable.
        .                   let ctrl_offset =
   13,274 ( 0.01%)              size.checked_mul(buckets)?.checked_add(ctrl_align - 1)? & !(ctrl_align - 1);
   17,495 ( 0.01%)          let len = ctrl_offset.checked_add(buckets + Group::WIDTH)?;
        .           
        .                   Some((
        .                       unsafe { Layout::from_size_align_unchecked(len, ctrl_align) },
        .                       ctrl_offset,
        .                   ))
        .               }
        .           }
        .           
-- line 263 ----------------------------------------
-- line 337 ----------------------------------------
        .                   }
        .               }
        .               #[cfg_attr(feature = "inline-more", inline)]
        .               pub unsafe fn drop(&self) {
        .                   self.as_ptr().drop_in_place();
        .               }
        .               #[inline]
        .               pub unsafe fn read(&self) -> T {
       56 ( 0.00%)          self.as_ptr().read()
        .               }
        .               #[inline]
        .               pub unsafe fn write(&self, val: T) {
        .                   self.as_ptr().write(val);
        .               }
        .               #[inline]
        .               pub unsafe fn as_ref<'a>(&self) -> &'a T {
        .                   &*self.as_ptr()
-- line 353 ----------------------------------------
-- line 422 ----------------------------------------
        .               /// Creates a new empty hash table without allocating any memory, using the
        .               /// given allocator.
        .               ///
        .               /// In effect this returns a table with exactly 1 bucket. However we can
        .               /// leave the data pointer dangling since that bucket is never written to
        .               /// due to our load factor forcing us to always have at least 1 free bucket.
        .               #[inline]
        .               pub fn new_in(alloc: A) -> Self {
       51 ( 0.00%)          Self {
        .                       table: RawTableInner::new_in(alloc),
        .                       marker: PhantomData,
        .                   }
        .               }
        .           
        .               /// Allocates a new hash table with the given number of buckets.
        .               ///
        .               /// The control bytes are left uninitialized.
-- line 438 ----------------------------------------
-- line 440 ----------------------------------------
        .               unsafe fn new_uninitialized(
        .                   alloc: A,
        .                   buckets: usize,
        .                   fallibility: Fallibility,
        .               ) -> Result<Self, TryReserveError> {
        .                   debug_assert!(buckets.is_power_of_two());
        .           
        .                   Ok(Self {
       15 ( 0.00%)              table: RawTableInner::new_uninitialized(
        .                           alloc,
        .                           TableLayout::new::<T>(),
        .                           buckets,
        .                           fallibility,
        .                       )?,
        .                       marker: PhantomData,
        .                   })
        .               }
-- line 456 ----------------------------------------
-- line 458 ----------------------------------------
        .               /// Attempts to allocate a new hash table with at least enough capacity
        .               /// for inserting the given number of elements without reallocating.
        .               fn fallible_with_capacity(
        .                   alloc: A,
        .                   capacity: usize,
        .                   fallibility: Fallibility,
        .               ) -> Result<Self, TryReserveError> {
        .                   Ok(Self {
      595 ( 0.00%)              table: RawTableInner::fallible_with_capacity(
        .                           alloc,
        .                           TableLayout::new::<T>(),
        .                           capacity,
        .                           fallibility,
        .                       )?,
        .                       marker: PhantomData,
        .                   })
        .               }
-- line 474 ----------------------------------------
-- line 527 ----------------------------------------
        .                   debug_assert_ne!(self.table.bucket_mask, 0);
        .                   debug_assert!(index < self.buckets());
        .                   Bucket::from_base_index(self.data_end(), index)
        .               }
        .           
        .               /// Erases an element from the table without dropping it.
        .               #[cfg_attr(feature = "inline-more", inline)]
        .               #[deprecated(since = "0.8.1", note = "use erase or remove instead")]
      588 ( 0.00%)      pub unsafe fn erase_no_drop(&mut self, item: &Bucket<T>) {
      588 ( 0.00%)          let index = self.bucket_index(item);
        .                   self.table.erase(index);
    1,176 ( 0.00%)      }
        .           
        .               /// Erases an element from the table, dropping it in place.
        .               #[cfg_attr(feature = "inline-more", inline)]
        .               #[allow(clippy::needless_pass_by_value)]
        .               #[allow(deprecated)]
        .               pub unsafe fn erase(&mut self, item: Bucket<T>) {
        .                   // Erase the element from the table first since drop might panic.
      154 ( 0.00%)          self.erase_no_drop(&item);
        .                   item.drop();
        .               }
        .           
        .               /// Finds and erases an element from the table, dropping it in place.
        .               /// Returns true if an element was found.
        .               #[cfg(feature = "raw")]
        .               #[cfg_attr(feature = "inline-more", inline)]
        .               pub fn erase_entry(&mut self, hash: u64, eq: impl FnMut(&T) -> bool) -> bool {
-- line 554 ----------------------------------------
-- line 563 ----------------------------------------
        .                   }
        .               }
        .           
        .               /// Removes an element from the table, returning it.
        .               #[cfg_attr(feature = "inline-more", inline)]
        .               #[allow(clippy::needless_pass_by_value)]
        .               #[allow(deprecated)]
        .               pub unsafe fn remove(&mut self, item: Bucket<T>) -> T {
    1,022 ( 0.00%)          self.erase_no_drop(&item);
        1 ( 0.00%)          item.read()
        .               }
        .           
        .               /// Finds and removes an element from the table, returning it.
        .               #[cfg_attr(feature = "inline-more", inline)]
   44,827 ( 0.04%)      pub fn remove_entry(&mut self, hash: u64, eq: impl FnMut(&T) -> bool) -> Option<T> {
        .                   // Avoid `Option::map` because it bloats LLVM IR.
       20 ( 0.00%)          match self.find(hash, eq) {
      276 ( 0.00%)              Some(bucket) => Some(unsafe { self.remove(bucket) }),
    4,292 ( 0.00%)              None => None,
        .                   }
   70,299 ( 0.06%)      }
        .           
        .               /// Marks all table buckets as empty without dropping their contents.
        .               #[cfg_attr(feature = "inline-more", inline)]
        .               pub fn clear_no_drop(&mut self) {
        .                   self.table.clear_no_drop();
        .               }
        .           
        .               /// Removes all elements from the table without freeing the backing memory.
        .               #[cfg_attr(feature = "inline-more", inline)]
        .               pub fn clear(&mut self) {
        .                   // Ensure that the table is reset even if one of the drops panic
        .                   let mut self_ = guard(self, |self_| self_.clear_no_drop());
        .                   unsafe {
        1 ( 0.00%)              self_.drop_elements();
        .                   }
        .               }
        .           
        7 ( 0.00%)      unsafe fn drop_elements(&mut self) {
      538 ( 0.00%)          if mem::needs_drop::<T>() && !self.is_empty() {
        .                       for item in self.iter() {
        .                           item.drop();
        .                       }
        .                   }
        8 ( 0.00%)      }
        .           
        .               /// Shrinks the table to fit `max(self.len(), min_size)` elements.
        .               #[cfg_attr(feature = "inline-more", inline)]
        .               pub fn shrink_to(&mut self, min_size: usize, hasher: impl Fn(&T) -> u64) {
        .                   // Calculate the minimal number of elements that we need to reserve
        .                   // space for.
        .                   let min_size = usize::max(self.table.items, min_size);
        .                   if min_size == 0 {
-- line 615 ----------------------------------------
-- line 642 ----------------------------------------
        .                       }
        .                   }
        .               }
        .           
        .               /// Ensures that at least `additional` items can be inserted into the table
        .               /// without reallocation.
        .               #[cfg_attr(feature = "inline-more", inline)]
        .               pub fn reserve(&mut self, additional: usize, hasher: impl Fn(&T) -> u64) {
   30,250 ( 0.02%)          if additional > self.table.growth_left {
        .                       // Avoid `Result::unwrap_or_else` because it bloats LLVM IR.
   10,602 ( 0.01%)              if self
        .                           .reserve_rehash(additional, hasher, Fallibility::Infallible)
        .                           .is_err()
        .                       {
        .                           unsafe { hint::unreachable_unchecked() }
        .                       }
        .                   }
        .               }
        .           
-- line 660 ----------------------------------------
-- line 671 ----------------------------------------
        .                   } else {
        .                       Ok(())
        .                   }
        .               }
        .           
        .               /// Out-of-line slow path for `reserve` and `try_reserve`.
        .               #[cold]
        .               #[inline(never)]
   25,115 ( 0.02%)      fn reserve_rehash(
        .                   &mut self,
        .                   additional: usize,
        .                   hasher: impl Fn(&T) -> u64,
        .                   fallibility: Fallibility,
        .               ) -> Result<(), TryReserveError> {
        .                   unsafe {
        .                       self.table.reserve_rehash_inner(
        .                           additional,
-- line 687 ----------------------------------------
-- line 690 ----------------------------------------
        .                           TableLayout::new::<T>(),
        .                           if mem::needs_drop::<T>() {
        .                               Some(mem::transmute(ptr::drop_in_place::<T> as unsafe fn(*mut T)))
        .                           } else {
        .                               None
        .                           },
        .                       )
        .                   }
   15,632 ( 0.01%)      }
        .           
        .               /// Allocates a new table of a different size and moves the contents of the
        .               /// current table into it.
        .               fn resize(
        .                   &mut self,
        .                   capacity: usize,
        .                   hasher: impl Fn(&T) -> u64,
        .                   fallibility: Fallibility,
-- line 706 ----------------------------------------
-- line 714 ----------------------------------------
        .                       )
        .                   }
        .               }
        .           
        .               /// Inserts a new element into the table, and returns its raw bucket.
        .               ///
        .               /// This does not check if the given element already exists in the table.
        .               #[cfg_attr(feature = "inline-more", inline)]
  278,032 ( 0.22%)      pub fn insert(&mut self, hash: u64, value: T, hasher: impl Fn(&T) -> u64) -> Bucket<T> {
        .                   unsafe {
        .                       let mut index = self.table.find_insert_slot(hash);
        .           
        .                       // We can avoid growing the table once we have reached our load
        .                       // factor if we are replacing a tombstone. This works since the
        .                       // number of EMPTY slots does not change in this case.
      346 ( 0.00%)              let old_ctrl = *self.table.ctrl(index);
  174,284 ( 0.14%)              if unlikely(self.table.growth_left == 0 && special_is_empty(old_ctrl)) {
        .                           self.reserve(1, hasher);
        .                           index = self.table.find_insert_slot(hash);
        .                       }
        .           
        .                       self.table.record_item_insert_at(index, old_ctrl, hash);
        .           
        .                       let bucket = self.bucket(index);
        2 ( 0.00%)              bucket.write(value);
        .                       bucket
        .                   }
  205,026 ( 0.17%)      }
        .           
        .               /// Attempts to insert a new element without growing the table and return its raw bucket.
        .               ///
        .               /// Returns an `Err` containing the given element if inserting it would require growing the
        .               /// table.
        .               ///
        .               /// This does not check if the given element already exists in the table.
        .               #[cfg(feature = "raw")]
-- line 749 ----------------------------------------
-- line 760 ----------------------------------------
        .                       }
        .                   }
        .               }
        .           
        .               /// Inserts a new element into the table, and returns a mutable reference to it.
        .               ///
        .               /// This does not check if the given element already exists in the table.
        .               #[cfg_attr(feature = "inline-more", inline)]
   72,648 ( 0.06%)      pub fn insert_entry(&mut self, hash: u64, value: T, hasher: impl Fn(&T) -> u64) -> &mut T {
       84 ( 0.00%)          unsafe { self.insert(hash, value, hasher).as_mut() }
   54,486 ( 0.04%)      }
        .           
        .               /// Inserts a new element into the table, without growing the table.
        .               ///
        .               /// There must be enough space in the table to insert the new element.
        .               ///
        .               /// This does not check if the given element already exists in the table.
        .               #[cfg_attr(feature = "inline-more", inline)]
        .               #[cfg(any(feature = "raw", feature = "rustc-internal-api"))]
       69 ( 0.00%)      pub unsafe fn insert_no_grow(&mut self, hash: u64, value: T) -> Bucket<T> {
   41,047 ( 0.03%)          let (index, old_ctrl) = self.table.prepare_insert_slot(hash);
      273 ( 0.00%)          let bucket = self.table.bucket(index);
        .           
        .                   // If we are replacing a DELETED entry then we don't need to update
        .                   // the load counter.
   83,010 ( 0.07%)          self.table.growth_left -= special_is_empty(old_ctrl) as usize;
        .           
        .                   bucket.write(value);
   67,514 ( 0.05%)          self.table.items += 1;
        .                   bucket
      133 ( 0.00%)      }
        .           
        .               /// Temporary removes a bucket, applying the given function to the removed
        .               /// element and optionally put back the returned value in the same bucket.
        .               ///
        .               /// Returns `true` if the bucket still contains an element
        .               ///
        .               /// This does not check if the given bucket is actually occupied.
        .               #[cfg_attr(feature = "inline-more", inline)]
-- line 798 ----------------------------------------
-- line 813 ----------------------------------------
        .                       true
        .                   } else {
        .                       false
        .                   }
        .               }
        .           
        .               /// Searches for an element in the table.
        .               #[inline]
      120 ( 0.00%)      pub fn find(&self, hash: u64, mut eq: impl FnMut(&T) -> bool) -> Option<Bucket<T>> {
      143 ( 0.00%)          let result = self.table.find_inner(hash, &mut |index| unsafe {
      472 ( 0.00%)              eq(self.bucket(index).as_ref())
       39 ( 0.00%)          });
        .           
        .                   // Avoid `Option::map` because it bloats LLVM IR.
        .                   match result {
       11 ( 0.00%)              Some(index) => Some(unsafe { self.bucket(index) }),
        .                       None => None,
        .                   }
      120 ( 0.00%)      }
        .           
        .               /// Gets a reference to an element in the table.
        .               #[inline]
        .               pub fn get(&self, hash: u64, eq: impl FnMut(&T) -> bool) -> Option<&T> {
        .                   // Avoid `Option::map` because it bloats LLVM IR.
      312 ( 0.00%)          match self.find(hash, eq) {
        .                       Some(bucket) => Some(unsafe { bucket.as_ref() }),
        .                       None => None,
        .                   }
        .               }
        .           
        .               /// Gets a mutable reference to an element in the table.
        .               #[inline]
        .               pub fn get_mut(&mut self, hash: u64, eq: impl FnMut(&T) -> bool) -> Option<&mut T> {
        .                   // Avoid `Option::map` because it bloats LLVM IR.
       85 ( 0.00%)          match self.find(hash, eq) {
        .                       Some(bucket) => Some(unsafe { bucket.as_mut() }),
        .                       None => None,
        .                   }
        .               }
        .           
        .               /// Attempts to get mutable references to `N` entries in the table at once.
        .               ///
        .               /// Returns an array of length `N` with the results of each query.
-- line 855 ----------------------------------------
-- line 920 ----------------------------------------
        .               #[inline]
        .               pub fn len(&self) -> usize {
        .                   self.table.items
        .               }
        .           
        .               /// Returns `true` if the table contains no elements.
        .               #[inline]
        .               pub fn is_empty(&self) -> bool {
   43,115 ( 0.03%)          self.len() == 0
        .               }
        .           
        .               /// Returns the number of buckets in the table.
        .               #[inline]
        .               pub fn buckets(&self) -> usize {
        .                   self.table.bucket_mask + 1
        .               }
        .           
-- line 936 ----------------------------------------
-- line 938 ----------------------------------------
        .               /// the caller to ensure that the `RawTable` outlives the `RawIter`.
        .               /// Because we cannot make the `next` method unsafe on the `RawIter`
        .               /// struct, we have to make the `iter` method unsafe.
        .               #[inline]
        .               pub unsafe fn iter(&self) -> RawIter<T> {
        .                   let data = Bucket::from_base_index(self.data_end(), 0);
        .                   RawIter {
        .                       iter: RawIterRange::new(self.table.ctrl.as_ptr(), data, self.table.buckets()),
    3,988 ( 0.00%)              items: self.table.items,
        .                   }
        .               }
        .           
        .               /// Returns an iterator over occupied buckets that could match a given hash.
        .               ///
        .               /// `RawTable` only stores 7 bits of the hash value, so this iterator may
        .               /// return items that have a hash value different than the one provided. You
        .               /// should always validate the returned values before using them.
-- line 954 ----------------------------------------
-- line 995 ----------------------------------------
        .               /// Iteration starts at the provided iterator's current location.
        .               ///
        .               /// It is up to the caller to ensure that the iterator is valid for this
        .               /// `RawTable` and covers all items that remain in the table.
        .               pub unsafe fn into_iter_from(self, iter: RawIter<T>) -> RawIntoIter<T, A> {
        .                   debug_assert_eq!(iter.len(), self.len());
        .           
        .                   let alloc = self.table.alloc.clone();
      620 ( 0.00%)          let allocation = self.into_allocation();
      465 ( 0.00%)          RawIntoIter {
      775 ( 0.00%)              iter,
        .                       allocation,
        .                       marker: PhantomData,
        .                       alloc,
        .                   }
        .               }
        .           
        .               /// Converts the table into a raw allocation. The contents of the table
        .               /// should be dropped using a `RawIter` before freeing the allocation.
        .               #[cfg_attr(feature = "inline-more", inline)]
        .               pub(crate) fn into_allocation(self) -> Option<(NonNull<u8>, Layout)> {
      214 ( 0.00%)          let alloc = if self.table.is_empty_singleton() {
        .                       None
        .                   } else {
        .                       // Avoid `Option::unwrap_or_else` because it bloats LLVM IR.
        .                       let (layout, ctrl_offset) = match calculate_layout::<T>(self.table.buckets()) {
        .                           Some(lco) => lco,
        .                           None => unsafe { hint::unreachable_unchecked() },
        .                       };
        .                       Some((
       75 ( 0.00%)                  unsafe { NonNull::new_unchecked(self.table.ctrl.as_ptr().sub(ctrl_offset)) },
        .                           layout,
        .                       ))
        .                   };
        .                   mem::forget(self);
        .                   alloc
        .               }
        .           }
        .           
-- line 1033 ----------------------------------------
-- line 1042 ----------------------------------------
        .               T: Sync,
        .               A: Sync,
        .           {
        .           }
        .           
        .           impl<A> RawTableInner<A> {
        .               #[inline]
        .               const fn new_in(alloc: A) -> Self {
   25,609 ( 0.02%)          Self {
        .                       // Be careful to cast the entire slice to a raw pointer.
        .                       ctrl: unsafe { NonNull::new_unchecked(Group::static_empty() as *const _ as *mut u8) },
        .                       bucket_mask: 0,
        .                       items: 0,
        .                       growth_left: 0,
        .                       alloc,
        .                   }
        .               }
        .           }
        .           
        .           impl<A: Allocator + Clone> RawTableInner<A> {
        .               #[cfg_attr(feature = "inline-more", inline)]
   21,474 ( 0.02%)      unsafe fn new_uninitialized(
        .                   alloc: A,
        .                   table_layout: TableLayout,
        .                   buckets: usize,
        .                   fallibility: Fallibility,
        .               ) -> Result<Self, TryReserveError> {
        .                   debug_assert!(buckets.is_power_of_two());
        .           
        .                   // Avoid `Option::ok_or_else` because it bloats LLVM IR.
-- line 1071 ----------------------------------------
-- line 1078 ----------------------------------------
        .                   // exceed `isize::MAX`. We can skip this check on 64-bit systems since
        .                   // such allocations will never succeed anyways.
        .                   //
        .                   // This mirrors what Vec does in the standard library.
        .                   if mem::size_of::<usize>() < 8 && layout.size() > isize::MAX as usize {
        .                       return Err(fallibility.capacity_overflow());
        .                   }
        .           
    5,548 ( 0.00%)          let ptr: NonNull<u8> = match do_alloc(&alloc, layout) {
        .                       Ok(block) => block.cast(),
        .                       Err(_) => return Err(fallibility.alloc_err(layout)),
        .                   };
        .           
        .                   let ctrl = NonNull::new_unchecked(ptr.as_ptr().add(ctrl_offset));
   12,996 ( 0.01%)          Ok(Self {
        .                       ctrl,
    5,313 ( 0.00%)              bucket_mask: buckets - 1,
        .                       items: 0,
        .                       growth_left: bucket_mask_to_capacity(buckets - 1),
        .                       alloc,
        .                   })
   15,760 ( 0.01%)      }
        .           
        .               #[inline]
    2,765 ( 0.00%)      fn fallible_with_capacity(
        .                   alloc: A,
        .                   table_layout: TableLayout,
        .                   capacity: usize,
        .                   fallibility: Fallibility,
        .               ) -> Result<Self, TryReserveError> {
      704 ( 0.00%)          if capacity == 0 {
      413 ( 0.00%)              Ok(Self::new_in(alloc))
        .                   } else {
        .                       unsafe {
        .                           let buckets =
        .                               capacity_to_buckets(capacity).ok_or_else(|| fallibility.capacity_overflow())?;
        .           
    9,911 ( 0.01%)                  let result = Self::new_uninitialized(alloc, table_layout, buckets, fallibility)?;
        .                           result.ctrl(0).write_bytes(EMPTY, result.num_ctrl_bytes());
        .           
    1,596 ( 0.00%)                  Ok(result)
        .                       }
        .                   }
    2,765 ( 0.00%)      }
        .           
        .               /// Searches for an empty or deleted bucket which is suitable for inserting
        .               /// a new element and sets the hash for that slot.
        .               ///
        .               /// There must be at least 1 empty bucket in the table.
        .               #[inline]
   13,711 ( 0.01%)      unsafe fn prepare_insert_slot(&self, hash: u64) -> (usize, u8) {
        .                   let index = self.find_insert_slot(hash);
   13,711 ( 0.01%)          let old_ctrl = *self.ctrl(index);
        .                   self.set_ctrl_h2(index, hash);
        .                   (index, old_ctrl)
   27,422 ( 0.02%)      }
        .           
        .               /// Searches for an empty or deleted bucket which is suitable for inserting
        .               /// a new element.
        .               ///
        .               /// There must be at least 1 empty bucket in the table.
        .               #[inline]
        .               fn find_insert_slot(&self, hash: u64) -> usize {
        .                   let mut probe_seq = self.probe_seq(hash);
        .                   loop {
        .                       unsafe {
        .                           let group = Group::load(self.ctrl(probe_seq.pos));
  113,831 ( 0.09%)                  if let Some(bit) = group.match_empty_or_deleted().lowest_set_bit() {
  329,947 ( 0.27%)                      let result = (probe_seq.pos + bit) & self.bucket_mask;
        .           
        .                               // In tables smaller than the group width, trailing control
        .                               // bytes outside the range of the table are filled with
        .                               // EMPTY entries. These will unfortunately trigger a
        .                               // match, but once masked may point to a full bucket that
        .                               // is already occupied. We detect this situation here and
        .                               // perform a second scan starting at the beginning of the
        .                               // table. This second scan is guaranteed to find an empty
        .                               // slot (due to the load factor) before hitting the trailing
        .                               // control bytes (containing EMPTY).
  153,528 ( 0.12%)                      if unlikely(is_full(*self.ctrl(result))) {
        .                                   debug_assert!(self.bucket_mask < Group::WIDTH);
        .                                   debug_assert_ne!(probe_seq.pos, 0);
        .                                   return Group::load_aligned(self.ctrl(0))
        .                                       .match_empty_or_deleted()
        .                                       .lowest_set_bit_nonzero();
        .                               }
        .           
        .                               return result;
-- line 1165 ----------------------------------------
-- line 1171 ----------------------------------------
        .           
        .               /// Searches for an element in the table. This uses dynamic dispatch to reduce the amount of
        .               /// code generated, but it is eliminated by LLVM optimizations.
        .               #[inline]
        .               fn find_inner(&self, hash: u64, eq: &mut dyn FnMut(usize) -> bool) -> Option<usize> {
        .                   let h2_hash = h2(hash);
        .                   let mut probe_seq = self.probe_seq(hash);
        .           
    2,288 ( 0.00%)          loop {
        .                       let group = unsafe { Group::load(self.ctrl(probe_seq.pos)) };
        .           
  183,941 ( 0.15%)              for bit in group.match_byte(h2_hash) {
  257,752 ( 0.21%)                  let index = (probe_seq.pos + bit) & self.bucket_mask;
        .           
  182,541 ( 0.15%)                  if likely(eq(index)) {
        .                               return Some(index);
        .                           }
        .                       }
        .           
   93,394 ( 0.08%)              if likely(group.match_empty().any_bit_set()) {
        .                           return None;
        .                       }
        .           
        .                       probe_seq.move_next(self.bucket_mask);
        .                   }
        .               }
        .           
        .               #[allow(clippy::mut_mut)]
-- line 1198 ----------------------------------------
-- line 1225 ----------------------------------------
        .                   Bucket::from_base_index(self.data_end(), index)
        .               }
        .           
        .               #[inline]
        .               unsafe fn bucket_ptr(&self, index: usize, size_of: usize) -> *mut u8 {
        .                   debug_assert_ne!(self.bucket_mask, 0);
        .                   debug_assert!(index < self.buckets());
        .                   let base: *mut u8 = self.data_end().as_ptr();
  402,728 ( 0.32%)          base.sub((index + 1) * size_of)
        .               }
        .           
        .               #[inline]
        .               unsafe fn data_end<T>(&self) -> NonNull<T> {
        .                   NonNull::new_unchecked(self.ctrl.as_ptr().cast())
        .               }
        .           
        .               /// Returns an iterator-like object for a probe sequence on the table.
        .               ///
        .               /// This iterator never terminates, but is guaranteed to visit each bucket
        .               /// group exactly once. The loop using `probe_seq` must terminate upon
        .               /// reaching a group containing an empty bucket.
        .               #[inline]
        .               fn probe_seq(&self, hash: u64) -> ProbeSeq {
        .                   ProbeSeq {
1,355,282 ( 1.09%)              pos: h1(hash) & self.bucket_mask,
        .                       stride: 0,
        .                   }
        .               }
        .           
        .               /// Returns the index of a bucket for which a value must be inserted if there is enough rooom
        .               /// in the table, otherwise returns error
        .               #[cfg(feature = "raw")]
        .               #[inline]
-- line 1257 ----------------------------------------
-- line 1263 ----------------------------------------
        .                   } else {
        .                       self.record_item_insert_at(index, old_ctrl, hash);
        .                       Ok(index)
        .                   }
        .               }
        .           
        .               #[inline]
        .               unsafe fn record_item_insert_at(&mut self, index: usize, old_ctrl: u8, hash: u64) {
  217,830 ( 0.18%)          self.growth_left -= special_is_empty(old_ctrl) as usize;
        .                   self.set_ctrl_h2(index, hash);
  174,264 ( 0.14%)          self.items += 1;
        .               }
        .           
        .               #[inline]
        .               fn is_in_same_group(&self, i: usize, new_i: usize, hash: u64) -> bool {
        .                   let probe_seq_pos = self.probe_seq(hash).pos;
        .                   let probe_index =
        .                       |pos: usize| (pos.wrapping_sub(probe_seq_pos) & self.bucket_mask) / Group::WIDTH;
        .                   probe_index(i) == probe_index(new_i)
-- line 1281 ----------------------------------------
-- line 1312 ----------------------------------------
        .                   // replicate the buckets at the end of the trailing group. For example
        .                   // with 2 buckets and a group size of 4, the control bytes will look
        .                   // like this:
        .                   //
        .                   //     Real    |             Replicated
        .                   // ---------------------------------------------
        .                   // | [A] | [B] | [EMPTY] | [EMPTY] | [A] | [B] |
        .                   // ---------------------------------------------
  323,046 ( 0.26%)          let index2 = ((index.wrapping_sub(Group::WIDTH)) & self.bucket_mask) + Group::WIDTH;
        .           
  107,682 ( 0.09%)          *self.ctrl(index) = ctrl;
  107,685 ( 0.09%)          *self.ctrl(index2) = ctrl;
        .               }
        .           
        .               /// Returns a pointer to a control byte.
        .               #[inline]
        .               unsafe fn ctrl(&self, index: usize) -> *mut u8 {
        .                   debug_assert!(index < self.num_ctrl_bytes());
        .                   self.ctrl.as_ptr().add(index)
        .               }
        .           
        .               #[inline]
        .               fn buckets(&self) -> usize {
   13,370 ( 0.01%)          self.bucket_mask + 1
        .               }
        .           
        .               #[inline]
        .               fn num_ctrl_bytes(&self) -> usize {
   12,612 ( 0.01%)          self.bucket_mask + 1 + Group::WIDTH
        .               }
        .           
        .               #[inline]
        .               fn is_empty_singleton(&self) -> bool {
   51,235 ( 0.04%)          self.bucket_mask == 0
        .               }
        .           
        .               #[allow(clippy::mut_mut)]
        .               #[inline]
        .               unsafe fn prepare_resize(
        .                   &self,
        .                   table_layout: TableLayout,
        .                   capacity: usize,
        .                   fallibility: Fallibility,
        .               ) -> Result<crate::scopeguard::ScopeGuard<Self, impl FnMut(&mut Self)>, TryReserveError> {
        .                   debug_assert!(self.items <= capacity);
        .           
        .                   // Allocate and initialize the new table.
      597 ( 0.00%)          let mut new_table = RawTableInner::fallible_with_capacity(
        .                       self.alloc.clone(),
        .                       table_layout,
        .                       capacity,
        .                       fallibility,
        .                   )?;
    6,591 ( 0.01%)          new_table.growth_left -= self.items;
        .                   new_table.items = self.items;
        .           
        .                   // The hash function may panic, in which case we simply free the new
        .                   // table without dropping any elements that may have been copied into
        .                   // it.
        .                   //
        .                   // This guard is also used to free the old table on success, see
        .                   // the comment at the bottom of this function.
        .                   Ok(guard(new_table, move |self_| {
    3,077 ( 0.00%)              if !self_.is_empty_singleton() {
        .                           self_.free_buckets(table_layout);
        .                       }
        .                   }))
        .               }
        .           
        .               /// Reserves or rehashes to make room for `additional` more elements.
        .               ///
        .               /// This uses dynamic dispatch to reduce the amount of
-- line 1383 ----------------------------------------
-- line 1388 ----------------------------------------
        .                   &mut self,
        .                   additional: usize,
        .                   hasher: &dyn Fn(&mut Self, usize) -> u64,
        .                   fallibility: Fallibility,
        .                   layout: TableLayout,
        .                   drop: Option<fn(*mut u8)>,
        .               ) -> Result<(), TryReserveError> {
        .                   // Avoid `Option::ok_or_else` because it bloats LLVM IR.
    6,154 ( 0.00%)          let new_items = match self.items.checked_add(additional) {
        .                       Some(new_items) => new_items,
        .                       None => return Err(fallibility.capacity_overflow()),
        .                   };
    6,154 ( 0.00%)          let full_capacity = bucket_mask_to_capacity(self.bucket_mask);
   12,875 ( 0.01%)          if new_items <= full_capacity / 2 {
        .                       // Rehash in-place without re-allocating if we have plenty of spare
        .                       // capacity that is locked up due to DELETED entries.
        .                       self.rehash_in_place(hasher, layout.size, drop);
        .                       Ok(())
        .                   } else {
        .                       // Otherwise, conservatively resize to at least the next size up
        .                       // to avoid churning deletes into frequent rehashes.
        .                       self.resize_inner(
    3,077 ( 0.00%)                  usize::max(new_items, full_capacity + 1),
        .                           hasher,
        .                           fallibility,
        .                           layout,
        .                       )
        .                   }
        .               }
        .           
        .               /// Allocates a new table of a different size and moves the contents of the
-- line 1418 ----------------------------------------
-- line 1424 ----------------------------------------
        .               #[inline(always)]
        .               unsafe fn resize_inner(
        .                   &mut self,
        .                   capacity: usize,
        .                   hasher: &dyn Fn(&mut Self, usize) -> u64,
        .                   fallibility: Fallibility,
        .                   layout: TableLayout,
        .               ) -> Result<(), TryReserveError> {
    1,483 ( 0.00%)          let mut new_table = self.prepare_resize(layout, capacity, fallibility)?;
        .           
        .                   // Copy all elements to the new table.
        .                   for i in 0..self.buckets() {
   59,720 ( 0.05%)              if !is_full(*self.ctrl(i)) {
        .                           continue;
        .                       }
        .           
        .                       // This may panic.
        .                       let hash = hasher(self, i);
        .           
        .                       // We can use a simpler version of insert() here since:
        .                       // - there are no DELETED entries.
-- line 1444 ----------------------------------------
-- line 1454 ----------------------------------------
        .                   }
        .           
        .                   // We successfully copied all elements without panicking. Now replace
        .                   // self with the new table. The old table will have its memory freed but
        .                   // the items will not be dropped (since they have been moved into the
        .                   // new table).
        .                   mem::swap(self, &mut new_table);
        .           
    3,077 ( 0.00%)          Ok(())
        .               }
        .           
        .               /// Rehashes the contents of the table in place (i.e. without changing the
        .               /// allocation).
        .               ///
        .               /// If `hasher` panics then some the table's contents may be lost.
        .               ///
        .               /// This uses dynamic dispatch to reduce the amount of
-- line 1470 ----------------------------------------
-- line 1554 ----------------------------------------
        .               #[inline]
        .               unsafe fn free_buckets(&mut self, table_layout: TableLayout) {
        .                   // Avoid `Option::unwrap_or_else` because it bloats LLVM IR.
        .                   let (layout, ctrl_offset) = match table_layout.calculate_layout_for(self.buckets()) {
        .                       Some(lco) => lco,
        .                       None => hint::unreachable_unchecked(),
        .                   };
        .                   self.alloc.deallocate(
    1,846 ( 0.00%)              NonNull::new_unchecked(self.ctrl.as_ptr().sub(ctrl_offset)),
        .                       layout,
        .                   );
        .               }
        .           
        .               /// Marks all table buckets as empty without dropping their contents.
        .               #[inline]
        .               fn clear_no_drop(&mut self) {
      321 ( 0.00%)          if !self.is_empty_singleton() {
        .                       unsafe {
        .                           self.ctrl(0).write_bytes(EMPTY, self.num_ctrl_bytes());
        .                       }
        .                   }
      370 ( 0.00%)          self.items = 0;
      321 ( 0.00%)          self.growth_left = bucket_mask_to_capacity(self.bucket_mask);
        .               }
        .           
        .               #[inline]
        .               unsafe fn erase(&mut self, index: usize) {
        .                   debug_assert!(is_full(*self.ctrl(index)));
   11,908 ( 0.01%)          let index_before = index.wrapping_sub(Group::WIDTH) & self.bucket_mask;
        .                   let empty_before = Group::load(self.ctrl(index_before)).match_empty();
        .                   let empty_after = Group::load(self.ctrl(index)).match_empty();
        .           
        .                   // If we are inside a continuous block of Group::WIDTH full or deleted
        .                   // cells then a probe window may have seen a full block when trying to
        .                   // insert. We therefore need to keep that block non-empty so that
        .                   // lookups will continue searching to the next probe window.
        .                   //
        .                   // Note that in this context `leading_zeros` refers to the bytes at the
        .                   // end of a group, while `trailing_zeros` refers to the bytes at the
        .                   // beginning of a group.
   47,632 ( 0.04%)          let ctrl = if empty_before.leading_zeros() + empty_after.trailing_zeros() >= Group::WIDTH {
        .                       DELETED
        .                   } else {
   59,430 ( 0.05%)              self.growth_left += 1;
        .                       EMPTY
        .                   };
        .                   self.set_ctrl(index, ctrl);
   47,632 ( 0.04%)          self.items -= 1;
        .               }
        .           }
        .           
        .           impl<T: Clone, A: Allocator + Clone> Clone for RawTable<T, A> {
      152 ( 0.00%)      fn clone(&self) -> Self {
       20 ( 0.00%)          if self.table.is_empty_singleton() {
        .                       Self::new_in(self.table.alloc.clone())
        .                   } else {
        .                       unsafe {
        .                           let mut new_table = ManuallyDrop::new(
        .                               // Avoid `Result::ok_or_else` because it bloats LLVM IR.
        .                               match Self::new_uninitialized(
        .                                   self.table.alloc.clone(),
        .                                   self.table.buckets(),
-- line 1615 ----------------------------------------
-- line 1624 ----------------------------------------
        .                               // We need to free the memory allocated for the new table.
        .                               new_table.free_buckets();
        .                           });
        .           
        .                           // Return the newly created table.
        .                           ManuallyDrop::into_inner(new_table)
        .                       }
        .                   }
      171 ( 0.00%)      }
        .           
        .               fn clone_from(&mut self, source: &Self) {
        .                   if source.table.is_empty_singleton() {
        .                       *self = Self::new_in(self.table.alloc.clone());
        .                   } else {
        .                       unsafe {
        .                           // First, drop all our elements without clearing the control bytes.
        .                           self.drop_elements();
-- line 1640 ----------------------------------------
-- line 1687 ----------------------------------------
        .                       .table
        .                       .ctrl(0)
        .                       .copy_to_nonoverlapping(self.table.ctrl(0), self.table.num_ctrl_bytes());
        .                   source
        .                       .data_start()
        .                       .copy_to_nonoverlapping(self.data_start(), self.table.buckets());
        .           
        .                   self.table.items = source.table.items;
        6 ( 0.00%)          self.table.growth_left = source.table.growth_left;
        .               }
        .           }
        .           
        .           impl<T: Clone, A: Allocator + Clone> RawTable<T, A> {
        .               /// Common code for clone and clone_from. Assumes `self.buckets() == source.buckets()`.
        .               #[cfg_attr(feature = "inline-more", inline)]
        .               unsafe fn clone_from_impl(&mut self, source: &Self, mut on_panic: impl FnMut(&mut Self)) {
        .                   // Copy the control bytes unchanged. We do this in a single pass
-- line 1703 ----------------------------------------
-- line 1790 ----------------------------------------
        .               fn default() -> Self {
        .                   Self::new_in(Default::default())
        .               }
        .           }
        .           
        .           #[cfg(feature = "nightly")]
        .           unsafe impl<#[may_dangle] T, A: Allocator + Clone> Drop for RawTable<T, A> {
        .               #[cfg_attr(feature = "inline-more", inline)]
   25,992 ( 0.02%)      fn drop(&mut self) {
   21,604 ( 0.02%)          if !self.table.is_empty_singleton() {
        .                       unsafe {
        .                           self.drop_elements();
        .                           self.free_buckets();
        .                       }
        .                   }
   27,906 ( 0.02%)      }
        .           }
        .           #[cfg(not(feature = "nightly"))]
        .           impl<T, A: Allocator + Clone> Drop for RawTable<T, A> {
        .               #[cfg_attr(feature = "inline-more", inline)]
        .               fn drop(&mut self) {
        .                   if !self.table.is_empty_singleton() {
        .                       unsafe {
        .                           self.drop_elements();
-- line 1813 ----------------------------------------
-- line 1817 ----------------------------------------
        .               }
        .           }
        .           
        .           impl<T, A: Allocator + Clone> IntoIterator for RawTable<T, A> {
        .               type Item = T;
        .               type IntoIter = RawIntoIter<T, A>;
        .           
        .               #[cfg_attr(feature = "inline-more", inline)]
      620 ( 0.00%)      fn into_iter(self) -> RawIntoIter<T, A> {
        .                   unsafe {
        .                       let iter = self.iter();
        .                       self.into_iter_from(iter)
        .                   }
      775 ( 0.00%)      }
        .           }
        .           
        .           /// Iterator over a sub-range of a table. Unlike `RawIter` this iterator does
        .           /// not track an item count.
        .           pub(crate) struct RawIterRange<T> {
        .               // Mask of full buckets in the current group. Bits are cleared from this
        .               // mask as each element is processed.
        .               current_group: BitMask,
-- line 1838 ----------------------------------------
-- line 1934 ----------------------------------------
        .           
        .           impl<T> Iterator for RawIterRange<T> {
        .               type Item = Bucket<T>;
        .           
        .               #[cfg_attr(feature = "inline-more", inline)]
        .               fn next(&mut self) -> Option<Bucket<T>> {
        .                   unsafe {
        .                       loop {
    8,601 ( 0.01%)                  if let Some(index) = self.current_group.lowest_set_bit() {
      979 ( 0.00%)                      self.current_group = self.current_group.remove_lowest_bit();
    1,637 ( 0.00%)                      return Some(self.data.next_n(index));
        .                           }
        .           
    7,436 ( 0.01%)                  if self.next_ctrl >= self.end {
        .                               return None;
        .                           }
        .           
        .                           // We might read past self.end up to the next group boundary,
        .                           // but this is fine because it only occurs on tables smaller
        .                           // than the group size where the trailing control bytes are all
        .                           // EMPTY. On larger tables self.end is guaranteed to be aligned
        .                           // to the group size (since tables are power-of-two sized).
      225 ( 0.00%)                  self.current_group = Group::load_aligned(self.next_ctrl).match_full();
      106 ( 0.00%)                  self.data = self.data.next_n(Group::WIDTH);
      452 ( 0.00%)                  self.next_ctrl = self.next_ctrl.add(Group::WIDTH);
        .                       }
        .                   }
        .               }
        .           
        .               #[inline]
        .               fn size_hint(&self) -> (usize, Option<usize>) {
        .                   // We don't have an item count, so just guess based on the range size.
        .                   (
-- line 1966 ----------------------------------------
-- line 2102 ----------------------------------------
        .                           }
        .                       } else {
        .                           // We must have already iterated past the removed item.
        .                       }
        .                   }
        .               }
        .           
        .               unsafe fn drop_elements(&mut self) {
      278 ( 0.00%)          if mem::needs_drop::<T>() && self.len() != 0 {
        .                       for item in self {
        .                           item.drop();
        .                       }
        .                   }
        .               }
        .           }
        .           
        .           impl<T> Clone for RawIter<T> {
-- line 2118 ----------------------------------------
-- line 2124 ----------------------------------------
        .                   }
        .               }
        .           }
        .           
        .           impl<T> Iterator for RawIter<T> {
        .               type Item = Bucket<T>;
        .           
        .               #[cfg_attr(feature = "inline-more", inline)]
    1,200 ( 0.00%)      fn next(&mut self) -> Option<Bucket<T>> {
    2,802 ( 0.00%)          if let Some(b) = self.iter.next() {
   10,335 ( 0.01%)              self.items -= 1;
        .                       Some(b)
        .                   } else {
        .                       // We don't check against items == 0 here to allow the
        .                       // compiler to optimize away the item count entirely if the
        .                       // iterator length is never queried.
        .                       debug_assert_eq!(self.items, 0);
        .                       None
        .                   }
    2,400 ( 0.00%)      }
        .           
        .               #[inline]
        .               fn size_hint(&self) -> (usize, Option<usize>) {
        .                   (self.items, Some(self.items))
        .               }
        .           }
        .           
        .           impl<T> ExactSizeIterator for RawIter<T> {}
-- line 2151 ----------------------------------------
-- line 2177 ----------------------------------------
        .               T: Sync,
        .               A: Sync,
        .           {
        .           }
        .           
        .           #[cfg(feature = "nightly")]
        .           unsafe impl<#[may_dangle] T, A: Allocator + Clone> Drop for RawIntoIter<T, A> {
        .               #[cfg_attr(feature = "inline-more", inline)]
      518 ( 0.00%)      fn drop(&mut self) {
        .                   unsafe {
        .                       // Drop all remaining elements
        .                       self.iter.drop_elements();
        .           
        .                       // Free the table
      979 ( 0.00%)              if let Some((ptr, layout)) = self.allocation {
        .                           self.alloc.deallocate(ptr, layout);
        .                       }
        .                   }
      174 ( 0.00%)      }
        .           }
        .           #[cfg(not(feature = "nightly"))]
        .           impl<T, A: Allocator + Clone> Drop for RawIntoIter<T, A> {
        .               #[cfg_attr(feature = "inline-more", inline)]
        .               fn drop(&mut self) {
        .                   unsafe {
        .                       // Drop all remaining elements
        .                       self.iter.drop_elements();
-- line 2203 ----------------------------------------
-- line 2209 ----------------------------------------
        .                   }
        .               }
        .           }
        .           
        .           impl<T, A: Allocator + Clone> Iterator for RawIntoIter<T, A> {
        .               type Item = T;
        .           
        .               #[cfg_attr(feature = "inline-more", inline)]
       19 ( 0.00%)      fn next(&mut self) -> Option<T> {
        6 ( 0.00%)          unsafe { Some(self.iter.next()?.read()) }
       38 ( 0.00%)      }
        .           
        .               #[inline]
        .               fn size_hint(&self) -> (usize, Option<usize>) {
        2 ( 0.00%)          self.iter.size_hint()
        .               }
        .           }
        .           
        .           impl<T, A: Allocator + Clone> ExactSizeIterator for RawIntoIter<T, A> {}
        .           impl<T, A: Allocator + Clone> FusedIterator for RawIntoIter<T, A> {}
        .           
        .           /// Iterator which consumes elements without freeing the table storage.
        .           pub struct RawDrain<'a, T, A: Allocator + Clone = Global> {
-- line 2231 ----------------------------------------
-- line 2259 ----------------------------------------
        .           where
        .               T: Sync,
        .               A: Sync,
        .           {
        .           }
        .           
        .           impl<T, A: Allocator + Clone> Drop for RawDrain<'_, T, A> {
        .               #[cfg_attr(feature = "inline-more", inline)]
       40 ( 0.00%)      fn drop(&mut self) {
        .                   unsafe {
        .                       // Drop all remaining elements. Note that this may panic.
        .                       self.iter.drop_elements();
        .           
        .                       // Reset the contents of the table now that all elements have been
        .                       // dropped.
        .                       self.table.clear_no_drop();
        .           
        .                       // Move the now empty table back to its original location.
        5 ( 0.00%)              self.orig_table
        .                           .as_ptr()
        .                           .copy_from_nonoverlapping(&*self.table, 1);
        .                   }
       40 ( 0.00%)      }
        .           }
        .           
        .           impl<T, A: Allocator + Clone> Iterator for RawDrain<'_, T, A> {
        .               type Item = T;
        .           
        .               #[cfg_attr(feature = "inline-more", inline)]
        .               fn next(&mut self) -> Option<T> {
        .                   unsafe {
-- line 2289 ----------------------------------------

  725,265 ( 0.58%)  <counts for unidentified lines in /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/codec.rs
--------------------------------------------------------------------------------
Ir               

-- line 70 ----------------------------------------
      .           ///
      .           /// `Decodable` can still be implemented in cases where `Decodable` is required
      .           /// by a trait bound.
      .           pub trait RefDecodable<'tcx, D: TyDecoder<'tcx>> {
      .               fn decode(d: &mut D) -> &'tcx Self;
      .           }
      .           
      .           /// Encode the given value or a previously cached shorthand.
    516 ( 0.00%)  pub fn encode_with_shorthand<'tcx, E, T, M>(
      .               encoder: &mut E,
      .               value: &T,
      .               cache: M,
      .           ) -> Result<(), E::Error>
      .           where
      .               E: TyEncoder<'tcx>,
      .               M: for<'b> Fn(&'b mut E) -> &'b mut FxHashMap<T, usize>,
      .               T: EncodableWithShorthand<'tcx, E>,
-- line 86 ----------------------------------------
-- line 90 ----------------------------------------
      .               let existing_shorthand = cache(encoder).get(value).copied();
      .               if let Some(shorthand) = existing_shorthand {
      .                   return encoder.emit_usize(shorthand);
      .               }
      .           
      .               let variant = value.variant();
      .           
      .               let start = encoder.position();
    126 ( 0.00%)      variant.encode(encoder)?;
     84 ( 0.00%)      let len = encoder.position() - start;
      .           
      .               // The shorthand encoding uses the same usize as the
      .               // discriminant, with an offset so they can't conflict.
      .               let discriminant = intrinsics::discriminant_value(variant);
      .               assert!(SHORTHAND_OFFSET > discriminant as usize);
      .           
     84 ( 0.00%)      let shorthand = start + SHORTHAND_OFFSET;
      .           
      .               // Get the number of bits that leb128 could fit
      .               // in the same space as the fully encoded type.
     84 ( 0.00%)      let leb128_bits = len * 7;
      .           
      .               // Check that the shorthand is a not longer than the
      .               // full encoding itself, i.e., it's an obvious win.
    294 ( 0.00%)      if leb128_bits >= 64 || (shorthand as u64) < (1 << leb128_bits) {
      .                   cache(encoder).insert(*value, shorthand);
      .               }
      .           
      .               Ok(())
    300 ( 0.00%)  }
      .           
      .           impl<'tcx, E: TyEncoder<'tcx>> Encodable<E> for Ty<'tcx> {
      .               fn encode(&self, e: &mut E) -> Result<(), E::Error> {
    268 ( 0.00%)          encode_with_shorthand(e, self, TyEncoder::type_shorthands)
      .               }
      .           }
      .           
      .           impl<'tcx, E: TyEncoder<'tcx>> Encodable<E> for ty::Binder<'tcx, ty::PredicateKind<'tcx>> {
      .               fn encode(&self, e: &mut E) -> Result<(), E::Error> {
      .                   self.bound_vars().encode(e)?;
      .                   encode_with_shorthand(e, &self.skip_binder(), TyEncoder::predicate_shorthands)
      .               }
-- line 131 ----------------------------------------
-- line 141 ----------------------------------------
      .               fn encode(&self, e: &mut E) -> Result<(), E::Error> {
      .                   e.encode_alloc_id(self)
      .               }
      .           }
      .           
      .           macro_rules! encodable_via_deref {
      .               ($($t:ty),+) => {
      .                   $(impl<'tcx, E: TyEncoder<'tcx>> Encodable<E> for $t {
     25 ( 0.00%)              fn encode(&self, e: &mut E) -> Result<(), E::Error> {
      5 ( 0.00%)                  (**self).encode(e)
     25 ( 0.00%)              }
      .                   })*
      .               }
      .           }
      .           
      .           encodable_via_deref! {
      .               &'tcx ty::TypeckResults<'tcx>,
      .               ty::Region<'tcx>,
      .               &'tcx mir::Body<'tcx>,
-- line 159 ----------------------------------------
-- line 176 ----------------------------------------
      .               where
      .                   F: FnOnce(&mut Self) -> Ty<'tcx>;
      .           
      .               fn with_position<F, R>(&mut self, pos: usize, f: F) -> R
      .               where
      .                   F: FnOnce(&mut Self) -> R;
      .           
      .               fn positioned_at_shorthand(&self) -> bool {
  8,867 ( 0.01%)          (self.peek_byte() & (SHORTHAND_OFFSET as u8)) != 0
      .               }
      .           
      .               fn decode_alloc_id(&mut self) -> AllocId;
      .           }
      .           
      .           #[inline]
      .           fn decode_arena_allocable<'tcx, D, T: ArenaAllocatable<'tcx> + Decodable<D>>(
      .               decoder: &mut D,
      .           ) -> &'tcx T
      .           where
      .               D: TyDecoder<'tcx>,
      .           {
  4,138 ( 0.00%)      decoder.tcx().arena.alloc(Decodable::decode(decoder))
      .           }
      .           
      .           #[inline]
      .           fn decode_arena_allocable_slice<'tcx, D, T: ArenaAllocatable<'tcx> + Decodable<D>>(
      .               decoder: &mut D,
      .           ) -> &'tcx [T]
      .           where
      .               D: TyDecoder<'tcx>,
      .           {
      .               decoder.tcx().arena.alloc_from_iter(<Vec<T> as Decodable<D>>::decode(decoder))
      .           }
      .           
      .           impl<'tcx, D: TyDecoder<'tcx>> Decodable<D> for Ty<'tcx> {
      .               #[allow(rustc::usage_of_ty_tykind)]
 35,316 ( 0.03%)      fn decode(decoder: &mut D) -> Ty<'tcx> {
      .                   // Handle shorthands first, if we have a usize > 0x80.
  8,829 ( 0.01%)          if decoder.positioned_at_shorthand() {
      .                       let pos = decoder.read_usize();
 12,246 ( 0.01%)              assert!(pos >= SHORTHAND_OFFSET);
 18,369 ( 0.01%)              let shorthand = pos - SHORTHAND_OFFSET;
      .           
 18,369 ( 0.01%)              decoder.cached_ty_for_shorthand(shorthand, |decoder| {
      .                           decoder.with_position(shorthand, Ty::decode)
      .                       })
      .                   } else {
  2,706 ( 0.00%)              let tcx = decoder.tcx();
  5,412 ( 0.00%)              tcx.mk_ty(ty::TyKind::decode(decoder))
      .                   }
 35,316 ( 0.03%)      }
      .           }
      .           
      .           impl<'tcx, D: TyDecoder<'tcx>> Decodable<D> for ty::Binder<'tcx, ty::PredicateKind<'tcx>> {
    228 ( 0.00%)      fn decode(decoder: &mut D) -> ty::Binder<'tcx, ty::PredicateKind<'tcx>> {
      .                   let bound_vars = Decodable::decode(decoder);
      .                   // Handle shorthands first, if we have a usize > 0x80.
      .                   ty::Binder::bind_with_vars(
     38 ( 0.00%)              if decoder.positioned_at_shorthand() {
      .                           let pos = decoder.read_usize();
     64 ( 0.00%)                  assert!(pos >= SHORTHAND_OFFSET);
     32 ( 0.00%)                  let shorthand = pos - SHORTHAND_OFFSET;
      .           
      .                           decoder.with_position(shorthand, ty::PredicateKind::decode)
      .                       } else {
     18 ( 0.00%)                  ty::PredicateKind::decode(decoder)
      .                       },
      .                       bound_vars,
      .                   )
    228 ( 0.00%)      }
      .           }
      .           
      .           impl<'tcx, D: TyDecoder<'tcx>> Decodable<D> for ty::Predicate<'tcx> {
      .               fn decode(decoder: &mut D) -> ty::Predicate<'tcx> {
    114 ( 0.00%)          let predicate_kind = Decodable::decode(decoder);
     38 ( 0.00%)          decoder.tcx().mk_predicate(predicate_kind)
      .               }
      .           }
      .           
      .           impl<'tcx, D: TyDecoder<'tcx>> Decodable<D> for SubstsRef<'tcx> {
      .               fn decode(decoder: &mut D) -> Self {
      .                   let len = decoder.read_usize();
  4,948 ( 0.00%)          let tcx = decoder.tcx();
      .                   tcx.mk_substs(
  9,740 ( 0.01%)              (0..len).map::<ty::subst::GenericArg<'tcx>, _>(|_| Decodable::decode(decoder)),
      .                   )
      .               }
      .           }
      .           
      .           impl<'tcx, D: TyDecoder<'tcx>> Decodable<D> for mir::Place<'tcx> {
      .               fn decode(decoder: &mut D) -> Self {
      .                   let local: mir::Local = Decodable::decode(decoder);
      .                   let len = decoder.read_usize();
-- line 268 ----------------------------------------
-- line 269 ----------------------------------------
      .                   let projection = decoder.tcx().mk_place_elems(
      .                       (0..len).map::<mir::PlaceElem<'tcx>, _>(|_| Decodable::decode(decoder)),
      .                   );
      .                   mir::Place { local, projection }
      .               }
      .           }
      .           
      .           impl<'tcx, D: TyDecoder<'tcx>> Decodable<D> for ty::Region<'tcx> {
  8,197 ( 0.01%)      fn decode(decoder: &mut D) -> Self {
  3,513 ( 0.00%)          decoder.tcx().mk_region(Decodable::decode(decoder))
  9,368 ( 0.01%)      }
      .           }
      .           
      .           impl<'tcx, D: TyDecoder<'tcx>> Decodable<D> for CanonicalVarInfos<'tcx> {
      .               fn decode(decoder: &mut D) -> Self {
      .                   let len = decoder.read_usize();
      .                   let interned: Vec<CanonicalVarInfo<'tcx>> =
      .                       (0..len).map(|_| Decodable::decode(decoder)).collect();
      .                   decoder.tcx().intern_canonical_var_infos(interned.as_slice())
-- line 287 ----------------------------------------
-- line 308 ----------------------------------------
      .                       }
      .                   })*
      .               }
      .           }
      .           
      .           impl<'tcx, D: TyDecoder<'tcx>> RefDecodable<'tcx, D> for ty::List<Ty<'tcx>> {
      .               fn decode(decoder: &mut D) -> &'tcx Self {
      .                   let len = decoder.read_usize();
    845 ( 0.00%)          decoder.tcx().mk_type_list((0..len).map::<Ty<'tcx>, _>(|_| Decodable::decode(decoder)))
      .               }
      .           }
      .           
      .           impl<'tcx, D: TyDecoder<'tcx>> RefDecodable<'tcx, D>
      .               for ty::List<ty::Binder<'tcx, ty::ExistentialPredicate<'tcx>>>
      .           {
      .               fn decode(decoder: &mut D) -> &'tcx Self {
      .                   let len = decoder.read_usize();
      6 ( 0.00%)          decoder.tcx().mk_poly_existential_predicates(
     38 ( 0.00%)              (0..len).map::<ty::Binder<'tcx, _>, _>(|_| Decodable::decode(decoder)),
      .                   )
      .               }
      .           }
      .           
      .           impl<'tcx, D: TyDecoder<'tcx>> RefDecodable<'tcx, D> for ty::Const<'tcx> {
      .               fn decode(decoder: &mut D) -> &'tcx Self {
    234 ( 0.00%)          decoder.tcx().mk_const(Decodable::decode(decoder))
      .               }
      .           }
      .           
      .           impl<'tcx, D: TyDecoder<'tcx>> RefDecodable<'tcx, D> for [ty::ValTree<'tcx>] {
      .               fn decode(decoder: &mut D) -> &'tcx Self {
      .                   decoder.tcx().arena.alloc_from_iter(
      .                       (0..decoder.read_usize()).map(|_| Decodable::decode(decoder)).collect::<Vec<_>>(),
      .                   )
-- line 341 ----------------------------------------
-- line 344 ----------------------------------------
      .           
      .           impl<'tcx, D: TyDecoder<'tcx>> RefDecodable<'tcx, D> for Allocation {
      .               fn decode(decoder: &mut D) -> &'tcx Self {
      .                   decoder.tcx().intern_const_alloc(Decodable::decode(decoder))
      .               }
      .           }
      .           
      .           impl<'tcx, D: TyDecoder<'tcx>> RefDecodable<'tcx, D> for [(ty::Predicate<'tcx>, Span)] {
    791 ( 0.00%)      fn decode(decoder: &mut D) -> &'tcx Self {
    226 ( 0.00%)          decoder.tcx().arena.alloc_from_iter(
      .                       (0..decoder.read_usize()).map(|_| Decodable::decode(decoder)).collect::<Vec<_>>(),
      .                   )
  1,130 ( 0.00%)      }
      .           }
      .           
      .           impl<'tcx, D: TyDecoder<'tcx>> RefDecodable<'tcx, D> for [thir::abstract_const::Node<'tcx>] {
      .               fn decode(decoder: &mut D) -> &'tcx Self {
      .                   decoder.tcx().arena.alloc_from_iter(
      .                       (0..decoder.read_usize()).map(|_| Decodable::decode(decoder)).collect::<Vec<_>>(),
      .                   )
      .               }
-- line 364 ----------------------------------------
-- line 370 ----------------------------------------
      .                       (0..decoder.read_usize()).map(|_| Decodable::decode(decoder)).collect::<Vec<_>>(),
      .                   )
      .               }
      .           }
      .           
      .           impl<'tcx, D: TyDecoder<'tcx>> RefDecodable<'tcx, D> for ty::List<ty::BoundVariableKind> {
      .               fn decode(decoder: &mut D) -> &'tcx Self {
      .                   let len = decoder.read_usize();
    162 ( 0.00%)          decoder.tcx().mk_bound_variable_kinds(
    109 ( 0.00%)              (0..len).map::<ty::BoundVariableKind, _>(|_| Decodable::decode(decoder)),
      .                   )
      .               }
      .           }
      .           
      .           impl_decodable_via_ref! {
      .               &'tcx ty::TypeckResults<'tcx>,
      .               &'tcx ty::List<Ty<'tcx>>,
      .               &'tcx ty::List<ty::Binder<'tcx, ty::ExistentialPredicate<'tcx>>>,
-- line 387 ----------------------------------------
-- line 394 ----------------------------------------
      .               &'tcx ty::AdtDef
      .           }
      .           
      .           #[macro_export]
      .           macro_rules! __impl_decoder_methods {
      .               ($($name:ident -> $ty:ty;)*) => {
      .                   $(
      .                       #[inline]
129,261 ( 0.10%)              fn $name(&mut self) -> $ty {
242,046 ( 0.19%)                  self.opaque.$name()
197,250 ( 0.16%)              }
      .                   )*
      .               }
      .           }
      .           
      .           macro_rules! impl_arena_allocatable_decoder {
      .               ([]$args:tt) => {};
      .               ([decode $(, $attrs:ident)*]
      .                [$name:ident: $ty:ty]) => {
-- line 412 ----------------------------------------
-- line 483 ----------------------------------------
      .               }
      .           }
      .           
      .           macro_rules! impl_binder_encode_decode {
      .               ($($t:ty),+ $(,)?) => {
      .                   $(
      .                       impl<'tcx, E: TyEncoder<'tcx>> Encodable<E> for ty::Binder<'tcx, $t> {
      .                           fn encode(&self, e: &mut E) -> Result<(), E::Error> {
     14 ( 0.00%)                      self.bound_vars().encode(e)?;
      .                               self.as_ref().skip_binder().encode(e)
      .                           }
      .                       }
      .                       impl<'tcx, D: TyDecoder<'tcx>> Decodable<D> for ty::Binder<'tcx, $t> {
    396 ( 0.00%)                  fn decode(decoder: &mut D) -> Self {
      .                               let bound_vars = Decodable::decode(decoder);
      .                               ty::Binder::bind_with_vars(Decodable::decode(decoder), bound_vars)
    396 ( 0.00%)                  }
      .                       }
      .                   )*
      .               }
      .           }
      .           
      .           impl_binder_encode_decode! {
      .               &'tcx ty::List<Ty<'tcx>>,
      .               ty::FnSig<'tcx>,
-- line 507 ----------------------------------------

  5,253 ( 0.00%)  <counts for unidentified lines in /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/codec.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/map.rs
--------------------------------------------------------------------------------
Ir               

-- line 186 ----------------------------------------
      .           /// // use the values stored in map
      .           /// ```
      .           pub struct HashMap<K, V, S = DefaultHashBuilder, A: Allocator + Clone = Global> {
      .               pub(crate) hash_builder: S,
      .               pub(crate) table: RawTable<(K, V), A>,
      .           }
      .           
      .           impl<K: Clone, V: Clone, S: Clone, A: Allocator + Clone> Clone for HashMap<K, V, S, A> {
      8 ( 0.00%)      fn clone(&self) -> Self {
     88 ( 0.00%)          HashMap {
      .                       hash_builder: self.hash_builder.clone(),
     18 ( 0.00%)              table: self.table.clone(),
      .                   }
      9 ( 0.00%)      }
      .           
      .               fn clone_from(&mut self, source: &Self) {
      .                   self.table.clone_from(&source.table);
      .           
      .                   // Update hash_builder only if we successfully cloned all elements.
      .                   self.hash_builder.clone_from(&source.hash_builder);
      .               }
      .           }
-- line 207 ----------------------------------------
-- line 210 ----------------------------------------
      .           /// instances of any functions like RawTable::reserve from being generated
      .           #[cfg_attr(feature = "inline-more", inline)]
      .           pub(crate) fn make_hasher<K, Q, V, S>(hash_builder: &S) -> impl Fn(&(Q, V)) -> u64 + '_
      .           where
      .               K: Borrow<Q>,
      .               Q: Hash,
      .               S: BuildHasher,
      .           {
  5,027 ( 0.00%)      move |val| make_hash::<K, Q, S>(hash_builder, &val.0)
      .           }
      .           
      .           /// Ensures that a single closure type across uses of this which, in turn prevents multiple
      .           /// instances of any functions like RawTable::reserve from being generated
      .           #[cfg_attr(feature = "inline-more", inline)]
      .           fn equivalent_key<Q, K, V>(k: &Q) -> impl Fn(&(K, V)) -> bool + '_
      .           where
      .               K: Borrow<Q>,
      .               Q: ?Sized + Eq,
      .           {
 13,496 ( 0.01%)      move |x| k.eq(x.0.borrow())
      .           }
      .           
      .           /// Ensures that a single closure type across uses of this which, in turn prevents multiple
      .           /// instances of any functions like RawTable::reserve from being generated
      .           #[cfg_attr(feature = "inline-more", inline)]
      .           fn equivalent<Q, K>(k: &Q) -> impl Fn(&K) -> bool + '_
      .           where
      .               K: Borrow<Q>,
      .               Q: ?Sized + Eq,
      .           {
  9,703 ( 0.01%)      move |x| k.eq(x.borrow())
      .           }
      .           
      .           #[cfg(not(feature = "nightly"))]
      .           #[cfg_attr(feature = "inline-more", inline)]
      .           pub(crate) fn make_hash<K, Q, S>(hash_builder: &S, val: &Q) -> u64
      .           where
      .               K: Borrow<Q>,
      .               Q: Hash + ?Sized,
-- line 248 ----------------------------------------
-- line 251 ----------------------------------------
      .               use core::hash::Hasher;
      .               let mut state = hash_builder.build_hasher();
      .               val.hash(&mut state);
      .               state.finish()
      .           }
      .           
      .           #[cfg(feature = "nightly")]
      .           #[cfg_attr(feature = "inline-more", inline)]
      2 ( 0.00%)  pub(crate) fn make_hash<K, Q, S>(hash_builder: &S, val: &Q) -> u64
      .           where
      .               K: Borrow<Q>,
      .               Q: Hash + ?Sized,
      .               S: BuildHasher,
      .           {
      .               hash_builder.hash_one(val)
      4 ( 0.00%)  }
      .           
      .           #[cfg(not(feature = "nightly"))]
      .           #[cfg_attr(feature = "inline-more", inline)]
      .           pub(crate) fn make_insert_hash<K, S>(hash_builder: &S, val: &K) -> u64
      .           where
      .               K: Hash,
      .               S: BuildHasher,
      .           {
-- line 274 ----------------------------------------
-- line 367 ----------------------------------------
      .               /// let s = DefaultHashBuilder::default();
      .               /// let mut map = HashMap::with_hasher(s);
      .               /// map.insert(1, 2);
      .               /// ```
      .               ///
      .               /// [`BuildHasher`]: ../../std/hash/trait.BuildHasher.html
      .               #[cfg_attr(feature = "inline-more", inline)]
      .               pub const fn with_hasher(hash_builder: S) -> Self {
  5,961 ( 0.00%)          Self {
      .                       hash_builder,
      .                       table: RawTable::new(),
      .                   }
      .               }
      .           
      .               /// Creates an empty `HashMap` with the specified capacity, using `hash_builder`
      .               /// to hash the keys.
      .               ///
-- line 383 ----------------------------------------
-- line 437 ----------------------------------------
      .               /// use hashbrown::hash_map::DefaultHashBuilder;
      .               ///
      .               /// let s = DefaultHashBuilder::default();
      .               /// let mut map = HashMap::with_hasher(s);
      .               /// map.insert(1, 2);
      .               /// ```
      .               #[cfg_attr(feature = "inline-more", inline)]
      .               pub fn with_hasher_in(hash_builder: S, alloc: A) -> Self {
     61 ( 0.00%)          Self {
      .                       hash_builder,
      .                       table: RawTable::new_in(alloc),
      .                   }
      .               }
      .           
      .               /// Creates an empty `HashMap` with the specified capacity, using `hash_builder`
      .               /// to hash the keys. It will be allocated with the given allocator.
      .               ///
-- line 453 ----------------------------------------
-- line 663 ----------------------------------------
      .               ///
      .               /// let mut a = HashMap::new();
      .               /// assert_eq!(a.len(), 0);
      .               /// a.insert(1, "a");
      .               /// assert_eq!(a.len(), 1);
      .               /// ```
      .               #[cfg_attr(feature = "inline-more", inline)]
      .               pub fn len(&self) -> usize {
    471 ( 0.00%)          self.table.len()
      .               }
      .           
      .               /// Returns `true` if the map contains no elements.
      .               ///
      .               /// # Examples
      .               ///
      .               /// ```
      .               /// use hashbrown::HashMap;
-- line 679 ----------------------------------------
-- line 680 ----------------------------------------
      .               ///
      .               /// let mut a = HashMap::new();
      .               /// assert!(a.is_empty());
      .               /// a.insert(1, "a");
      .               /// assert!(!a.is_empty());
      .               /// ```
      .               #[cfg_attr(feature = "inline-more", inline)]
      .               pub fn is_empty(&self) -> bool {
  2,596 ( 0.00%)          self.len() == 0
      .               }
      .           
      .               /// Clears the map, returning all key-value pairs as an iterator. Keeps the
      .               /// allocated memory for reuse.
      .               ///
      .               /// # Examples
      .               ///
      .               /// ```
-- line 696 ----------------------------------------
-- line 790 ----------------------------------------
      .               /// use hashbrown::HashMap;
      .               ///
      .               /// let mut a = HashMap::new();
      .               /// a.insert(1, "a");
      .               /// a.clear();
      .               /// assert!(a.is_empty());
      .               /// ```
      .               #[cfg_attr(feature = "inline-more", inline)]
      6 ( 0.00%)      pub fn clear(&mut self) {
      .                   self.table.clear();
      6 ( 0.00%)      }
      .           
      .               /// Creates a consuming iterator visiting all the keys in arbitrary order.
      .               /// The map cannot be used after calling this.
      .               /// The iterator element type is `K`.
      .               ///
      .               /// # Examples
      .               ///
      .               /// ```
-- line 808 ----------------------------------------
-- line 963 ----------------------------------------
      .               /// }
      .               ///
      .               /// assert_eq!(letters[&'s'], 2);
      .               /// assert_eq!(letters[&'t'], 3);
      .               /// assert_eq!(letters[&'u'], 1);
      .               /// assert_eq!(letters.get(&'y'), None);
      .               /// ```
      .               #[cfg_attr(feature = "inline-more", inline)]
    208 ( 0.00%)      pub fn entry(&mut self, key: K) -> Entry<'_, K, V, S, A> {
      .                   let hash = make_insert_hash::<K, S>(&self.hash_builder, &key);
      .                   if let Some(elem) = self.table.find(hash, equivalent_key(&key)) {
     15 ( 0.00%)              Entry::Occupied(OccupiedEntry {
      .                           hash,
      .                           key: Some(key),
      .                           elem,
      .                           table: self,
      .                       })
      .                   } else {
    245 ( 0.00%)              Entry::Vacant(VacantEntry {
      .                           hash,
      .                           key,
      .                           table: self,
      .                       })
      .                   }
    260 ( 0.00%)      }
      .           
      .               /// Gets the given key's corresponding entry by reference in the map for in-place manipulation.
      .               ///
      .               /// # Examples
      .               ///
      .               /// ```
      .               /// use hashbrown::HashMap;
      .               ///
-- line 995 ----------------------------------------
-- line 1047 ----------------------------------------
      .               /// ```
      .               #[inline]
      .               pub fn get<Q: ?Sized>(&self, k: &Q) -> Option<&V>
      .               where
      .                   K: Borrow<Q>,
      .                   Q: Hash + Eq,
      .               {
      .                   // Avoid `Option::map` because it bloats LLVM IR.
 18,448 ( 0.01%)          match self.get_inner(k) {
      .                       Some(&(_, ref v)) => Some(v),
      .                       None => None,
      .                   }
      .               }
      .           
      .               /// Returns the key-value pair corresponding to the supplied key.
      .               ///
      .               /// The supplied key may be any borrowed form of the map's key type, but
-- line 1063 ----------------------------------------
-- line 1091 ----------------------------------------
      .               }
      .           
      .               #[inline]
      .               fn get_inner<Q: ?Sized>(&self, k: &Q) -> Option<&(K, V)>
      .               where
      .                   K: Borrow<Q>,
      .                   Q: Hash + Eq,
      .               {
 42,503 ( 0.03%)          if self.table.is_empty() {
      .                       None
      .                   } else {
      1 ( 0.00%)              let hash = make_hash::<K, Q, S>(&self.hash_builder, k);
      .                       self.table.get(hash, equivalent_key(k))
      .                   }
      .               }
      .           
      .               /// Returns the key-value pair corresponding to the supplied key, with a mutable reference to value.
      .               ///
      .               /// The supplied key may be any borrowed form of the map's key type, but
      .               /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
-- line 1110 ----------------------------------------
-- line 1155 ----------------------------------------
      .               /// use hashbrown::HashMap;
      .               ///
      .               /// let mut map = HashMap::new();
      .               /// map.insert(1, "a");
      .               /// assert_eq!(map.contains_key(&1), true);
      .               /// assert_eq!(map.contains_key(&2), false);
      .               /// ```
      .               #[cfg_attr(feature = "inline-more", inline)]
  7,232 ( 0.01%)      pub fn contains_key<Q: ?Sized>(&self, k: &Q) -> bool
      .               where
      .                   K: Borrow<Q>,
      .                   Q: Hash + Eq,
      .               {
      .                   self.get_inner(k).is_some()
  9,422 ( 0.01%)      }
      .           
      .               /// Returns a mutable reference to the value corresponding to the key.
      .               ///
      .               /// The key may be any borrowed form of the map's key type, but
      .               /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
      .               /// the key type.
      .               ///
      .               /// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html
-- line 1177 ----------------------------------------
-- line 1185 ----------------------------------------
      .               /// let mut map = HashMap::new();
      .               /// map.insert(1, "a");
      .               /// if let Some(x) = map.get_mut(&1) {
      .               ///     *x = "b";
      .               /// }
      .               /// assert_eq!(map[&1], "b");
      .               /// ```
      .               #[cfg_attr(feature = "inline-more", inline)]
     16 ( 0.00%)      pub fn get_mut<Q: ?Sized>(&mut self, k: &Q) -> Option<&mut V>
      .               where
      .                   K: Borrow<Q>,
      .                   Q: Hash + Eq,
      .               {
      .                   // Avoid `Option::map` because it bloats LLVM IR.
     48 ( 0.00%)          match self.get_inner_mut(k) {
      .                       Some(&mut (_, ref mut v)) => Some(v),
      .                       None => None,
      .                   }
     32 ( 0.00%)      }
      .           
      .               #[inline]
      .               fn get_inner_mut<Q: ?Sized>(&mut self, k: &Q) -> Option<&mut (K, V)>
      .               where
      .                   K: Borrow<Q>,
      .                   Q: Hash + Eq,
      .               {
     16 ( 0.00%)          if self.table.is_empty() {
      .                       None
      .                   } else {
      .                       let hash = make_hash::<K, Q, S>(&self.hash_builder, k);
      .                       self.table.get_mut(hash, equivalent_key(k))
      .                   }
      .               }
      .           
      .               /// Attempts to get mutable references to `N` values in the map at once.
-- line 1219 ----------------------------------------
-- line 1495 ----------------------------------------
      .               /// assert_eq!(map.insert(37, "a"), None);
      .               /// assert_eq!(map.is_empty(), false);
      .               ///
      .               /// map.insert(37, "b");
      .               /// assert_eq!(map.insert(37, "c"), Some("b"));
      .               /// assert_eq!(map[&37], "c");
      .               /// ```
      .               #[cfg_attr(feature = "inline-more", inline)]
256,662 ( 0.21%)      pub fn insert(&mut self, k: K, v: V) -> Option<V> {
      .                   let hash = make_insert_hash::<K, S>(&self.hash_builder, &k);
     15 ( 0.00%)          if let Some((_, item)) = self.table.get_mut(hash, equivalent_key(&k)) {
      .                       Some(mem::replace(item, v))
      .                   } else {
167,441 ( 0.13%)              self.table
146,527 ( 0.12%)                  .insert(hash, (k, v), make_hasher::<K, _, V, S>(&self.hash_builder));
 11,535 ( 0.01%)              None
      .                   }
237,550 ( 0.19%)      }
      .           
      .               /// Insert a key-value pair into the map without checking
      .               /// if the key already exists in the map.
      .               ///
      .               /// Returns a reference to the key and value just inserted.
      .               ///
      .               /// This operation is safe if a key does not exist in the map.
      .               ///
-- line 1520 ----------------------------------------
-- line 1592 ----------------------------------------
      .               /// use hashbrown::HashMap;
      .               ///
      .               /// let mut map = HashMap::new();
      .               /// map.insert(1, "a");
      .               /// assert_eq!(map.remove(&1), Some("a"));
      .               /// assert_eq!(map.remove(&1), None);
      .               /// ```
      .               #[cfg_attr(feature = "inline-more", inline)]
  1,748 ( 0.00%)      pub fn remove<Q: ?Sized>(&mut self, k: &Q) -> Option<V>
      .               where
      .                   K: Borrow<Q>,
      .                   Q: Hash + Eq,
      .               {
      .                   // Avoid `Option::map` because it bloats LLVM IR.
 70,770 ( 0.06%)          match self.remove_entry(k) {
    760 ( 0.00%)              Some((_, v)) => Some(v),
  1,404 ( 0.00%)              None => None,
      .                   }
  4,068 ( 0.00%)      }
      .           
      .               /// Removes a key from the map, returning the stored key and value if the
      .               /// key was previously in the map.
      .               ///
      .               /// The key may be any borrowed form of the map's key type, but
      .               /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
      .               /// the key type.
      .               ///
-- line 1618 ----------------------------------------
-- line 1631 ----------------------------------------
      .               /// ```
      .               #[cfg_attr(feature = "inline-more", inline)]
      .               pub fn remove_entry<Q: ?Sized>(&mut self, k: &Q) -> Option<(K, V)>
      .               where
      .                   K: Borrow<Q>,
      .                   Q: Hash + Eq,
      .               {
      .                   let hash = make_hash::<K, Q, S>(&self.hash_builder, k);
 15,139 ( 0.01%)          self.table.remove_entry(hash, equivalent_key(k))
      .               }
      .           }
      .           
      .           impl<K, V, S, A: Allocator + Clone> HashMap<K, V, S, A> {
      .               /// Creates a raw entry builder for the HashMap.
      .               ///
      .               /// Raw entries provide the lowest level of control for searching and
      .               /// manipulating a map. They must be manually initialized with a hash and
-- line 1647 ----------------------------------------
-- line 2209 ----------------------------------------
      .               /// Creates a `RawEntryMut` from the given key and its hash.
      .               #[inline]
      .               #[allow(clippy::wrong_self_convention)]
      .               pub fn from_key_hashed_nocheck<Q: ?Sized>(self, hash: u64, k: &Q) -> RawEntryMut<'a, K, V, S, A>
      .               where
      .                   K: Borrow<Q>,
      .                   Q: Eq,
      .               {
 61,996 ( 0.05%)          self.from_hash(hash, equivalent(k))
      .               }
      .           }
      .           
      .           impl<'a, K, V, S, A: Allocator + Clone> RawEntryBuilderMut<'a, K, V, S, A> {
      .               /// Creates a `RawEntryMut` from the given hash.
      .               #[cfg_attr(feature = "inline-more", inline)]
      .               #[allow(clippy::wrong_self_convention)]
153,319 ( 0.12%)      pub fn from_hash<F>(self, hash: u64, is_match: F) -> RawEntryMut<'a, K, V, S, A>
      .               where
      .                   for<'b> F: FnMut(&'b K) -> bool,
      .               {
      .                   self.search(hash, is_match)
167,069 ( 0.13%)      }
      .           
      .               #[cfg_attr(feature = "inline-more", inline)]
      .               fn search<F>(self, hash: u64, mut is_match: F) -> RawEntryMut<'a, K, V, S, A>
      .               where
      .                   for<'b> F: FnMut(&'b K) -> bool,
      .               {
 12,916 ( 0.01%)          match self.map.table.find(hash, |(k, _)| is_match(k)) {
 64,776 ( 0.05%)              Some(elem) => RawEntryMut::Occupied(RawOccupiedEntryMut {
      .                           elem,
      .                           table: &mut self.map.table,
      .                           hash_builder: &self.map.hash_builder,
      .                       }),
 31,762 ( 0.03%)              None => RawEntryMut::Vacant(RawVacantEntryMut {
      .                           table: &mut self.map.table,
      .                           hash_builder: &self.map.hash_builder,
      .                       }),
      .                   }
      .               }
      .           }
      .           
      .           impl<'a, K, V, S, A: Allocator + Clone> RawEntryBuilder<'a, K, V, S, A> {
-- line 2251 ----------------------------------------
-- line 2260 ----------------------------------------
      .               {
      .                   let hash = make_hash::<K, Q, S>(&self.map.hash_builder, k);
      .                   self.from_key_hashed_nocheck(hash, k)
      .               }
      .           
      .               /// Access an entry by a key and its hash.
      .               #[cfg_attr(feature = "inline-more", inline)]
      .               #[allow(clippy::wrong_self_convention)]
 38,875 ( 0.03%)      pub fn from_key_hashed_nocheck<Q: ?Sized>(self, hash: u64, k: &Q) -> Option<(&'a K, &'a V)>
      .               where
      .                   K: Borrow<Q>,
      .                   Q: Eq,
      .               {
 53,048 ( 0.04%)          self.from_hash(hash, equivalent(k))
 72,534 ( 0.06%)      }
      .           
      .               #[cfg_attr(feature = "inline-more", inline)]
      .               fn search<F>(self, hash: u64, mut is_match: F) -> Option<(&'a K, &'a V)>
      .               where
      .                   F: FnMut(&K) -> bool,
      .               {
 67,438 ( 0.05%)          match self.map.table.get(hash, |(k, _)| is_match(k)) {
      .                       Some(&(ref key, ref value)) => Some((key, value)),
      .                       None => None,
      .                   }
      .               }
      .           
      .               /// Access an entry by hash.
      .               #[cfg_attr(feature = "inline-more", inline)]
      .               #[allow(clippy::wrong_self_convention)]
-- line 2289 ----------------------------------------
-- line 2624 ----------------------------------------
      .               /// and returns a mutable reference to it.
      .               #[cfg_attr(feature = "inline-more", inline)]
      .               #[allow(clippy::shadow_unrelated)]
      .               pub fn insert_hashed_nocheck(self, hash: u64, key: K, value: V) -> (&'a mut K, &'a mut V)
      .               where
      .                   K: Hash,
      .                   S: BuildHasher,
      .               {
 50,687 ( 0.04%)          let &mut (ref mut k, ref mut v) = self.table.insert_entry(
      .                       hash,
      .                       (key, value),
      .                       make_hasher::<K, _, V, S>(self.hash_builder),
      .                   );
      .                   (k, v)
      .               }
      .           
      .               /// Set the value of an entry with a custom hasher function.
-- line 2640 ----------------------------------------
-- line 2974 ----------------------------------------
      .               /// map.insert("a", 1);
      .               /// map.insert("b", 2);
      .               /// map.insert("c", 3);
      .               ///
      .               /// // Not possible with .iter()
      .               /// let vec: Vec<(&str, i32)> = map.into_iter().collect();
      .               /// ```
      .               #[cfg_attr(feature = "inline-more", inline)]
     59 ( 0.00%)      fn into_iter(self) -> IntoIter<K, V, A> {
  1,849 ( 0.00%)          IntoIter {
  1,325 ( 0.00%)              inner: self.table.into_iter(),
      .                   }
    177 ( 0.00%)      }
      .           }
      .           
      .           impl<'a, K, V> Iterator for Iter<'a, K, V> {
      .               type Item = (&'a K, &'a V);
      .           
      .               #[cfg_attr(feature = "inline-more", inline)]
      .               fn next(&mut self) -> Option<(&'a K, &'a V)> {
      .                   // Avoid `Option::map` because it bloats LLVM IR.
  3,455 ( 0.00%)          match self.inner.next() {
      .                       Some(x) => unsafe {
      .                           let r = x.as_ref();
     21 ( 0.00%)                  Some((&r.0, &r.1))
      .                       },
      .                       None => None,
      .                   }
      .               }
      .               #[cfg_attr(feature = "inline-more", inline)]
      .               fn size_hint(&self) -> (usize, Option<usize>) {
      .                   self.inner.size_hint()
      .               }
-- line 3006 ----------------------------------------
-- line 3051 ----------------------------------------
      .               }
      .           }
      .           
      .           impl<K, V, A: Allocator + Clone> Iterator for IntoIter<K, V, A> {
      .               type Item = (K, V);
      .           
      .               #[cfg_attr(feature = "inline-more", inline)]
      .               fn next(&mut self) -> Option<(K, V)> {
     36 ( 0.00%)          self.inner.next()
      .               }
      .               #[cfg_attr(feature = "inline-more", inline)]
      .               fn size_hint(&self) -> (usize, Option<usize>) {
      .                   self.inner.size_hint()
      .               }
      .           }
      .           impl<K, V, A: Allocator + Clone> ExactSizeIterator for IntoIter<K, V, A> {
      .               #[cfg_attr(feature = "inline-more", inline)]
-- line 3067 ----------------------------------------
-- line 3076 ----------------------------------------
      .                   f.debug_list().entries(self.iter()).finish()
      .               }
      .           }
      .           
      .           impl<'a, K, V> Iterator for Keys<'a, K, V> {
      .               type Item = &'a K;
      .           
      .               #[cfg_attr(feature = "inline-more", inline)]
      2 ( 0.00%)      fn next(&mut self) -> Option<&'a K> {
      .                   // Avoid `Option::map` because it bloats LLVM IR.
      .                   match self.inner.next() {
      .                       Some((k, _)) => Some(k),
      .                       None => None,
      .                   }
      4 ( 0.00%)      }
      .               #[cfg_attr(feature = "inline-more", inline)]
      .               fn size_hint(&self) -> (usize, Option<usize>) {
      .                   self.inner.size_hint()
      .               }
      .           }
      .           impl<K, V> ExactSizeIterator for Keys<'_, K, V> {
      .               #[cfg_attr(feature = "inline-more", inline)]
      .               fn len(&self) -> usize {
-- line 3098 ----------------------------------------
-- line 3819 ----------------------------------------
      .               /// ```
      .               #[cfg_attr(feature = "inline-more", inline)]
      .               pub fn insert(self, value: V) -> &'a mut V
      .               where
      .                   K: Hash,
      .                   S: BuildHasher,
      .               {
      .                   let table = &mut self.table.table;
     16 ( 0.00%)          let entry = table.insert_entry(
      .                       self.hash,
      .                       (self.key, value),
      .                       make_hasher::<K, _, V, S>(&self.table.hash_builder),
      .                   );
      .                   &mut entry.1
      .               }
      .           
      .               #[cfg_attr(feature = "inline-more", inline)]
-- line 3835 ----------------------------------------
-- line 4557 ----------------------------------------
      .           /// keys with new values returned from the iterator.
      .           impl<K, V, S, A> Extend<(K, V)> for HashMap<K, V, S, A>
      .           where
      .               K: Eq + Hash,
      .               S: BuildHasher,
      .               A: Allocator + Clone,
      .           {
      .               #[cfg_attr(feature = "inline-more", inline)]
  1,283 ( 0.00%)      fn extend<T: IntoIterator<Item = (K, V)>>(&mut self, iter: T) {
      .                   // Keys may be already present or show multiple times in the iterator.
      .                   // Reserve the entire hint lower bound if the map is empty.
      .                   // Otherwise reserve half the hint (rounded up), so the map
      .                   // will only resize twice in the worst case.
  1,080 ( 0.00%)          let iter = iter.into_iter();
    607 ( 0.00%)          let reserve = if self.is_empty() {
      .                       iter.size_hint().0
      .                   } else {
      3 ( 0.00%)              (iter.size_hint().0 + 1) / 2
      .                   };
      .                   self.reserve(reserve);
      .                   iter.for_each(move |(k, v)| {
 14,918 ( 0.01%)              self.insert(k, v);
      .                   });
    814 ( 0.00%)      }
      .           
      .               #[inline]
      .               #[cfg(feature = "nightly")]
      .               fn extend_one(&mut self, (k, v): (K, V)) {
      .                   self.insert(k, v);
      .               }
      .           
      .               #[inline]
-- line 4588 ----------------------------------------

 82,060 ( 0.07%)  <counts for unidentified lines in /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/map.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/indexmap-1.8.0/src/map/core.rs
--------------------------------------------------------------------------------
Ir              

-- line 26 ----------------------------------------
     .               /// indices mapping from the entry hash to its index.
     .               indices: RawTable<usize>,
     .               /// entries is a dense vec of entries in their order.
     .               entries: Vec<Bucket<K, V>>,
     .           }
     .           
     .           #[inline(always)]
     .           fn get_hash<K, V>(entries: &[Bucket<K, V>]) -> impl Fn(&usize) -> u64 + '_ {
53,593 ( 0.04%)      move |&i| entries[i].hash.get()
     .           }
     .           
     .           #[inline]
     .           fn equivalent<'a, K, V, Q: ?Sized + Equivalent<K>>(
     .               key: &'a Q,
     .               entries: &'a [Bucket<K, V>],
     .           ) -> impl Fn(&usize) -> bool + 'a {
 5,807 ( 0.00%)      move |&i| Q::equivalent(key, &entries[i].key)
     .           }
     .           
     .           #[inline]
     .           fn erase_index(table: &mut RawTable<usize>, hash: HashValue, index: usize) {
     .               table.erase_entry(hash.get(), move |&i| i == index);
     .           }
     .           
     .           #[inline]
-- line 50 ----------------------------------------
-- line 132 ----------------------------------------
     .                   IndexMapCore {
     .                       indices: RawTable::with_capacity(n),
     .                       entries: Vec::with_capacity(n),
     .                   }
     .               }
     .           
     .               #[inline]
     .               pub(crate) fn len(&self) -> usize {
   207 ( 0.00%)          self.indices.len()
     .               }
     .           
     .               #[inline]
     .               pub(crate) fn capacity(&self) -> usize {
     .                   cmp::min(self.indices.capacity(), self.entries.capacity())
     .               }
     .           
     .               pub(crate) fn clear(&mut self) {
-- line 148 ----------------------------------------
-- line 152 ----------------------------------------
     .           
     .               pub(crate) fn truncate(&mut self, len: usize) {
     .                   if len < self.len() {
     .                       self.erase_indices(len, self.entries.len());
     .                       self.entries.truncate(len);
     .                   }
     .               }
     .           
    27 ( 0.00%)      pub(crate) fn drain<R>(&mut self, range: R) -> Drain<'_, Bucket<K, V>>
     .               where
     .                   R: RangeBounds<usize>,
     .               {
     9 ( 0.00%)          let range = simplify_range(range, self.entries.len());
     .                   self.erase_indices(range.start, range.end);
     .                   self.entries.drain(range)
    24 ( 0.00%)      }
     .           
     .               #[cfg(feature = "rayon")]
     .               pub(crate) fn par_drain<R>(&mut self, range: R) -> rayon::vec::Drain<'_, Bucket<K, V>>
     .               where
     .                   K: Send,
     .                   V: Send,
     .                   R: RangeBounds<usize>,
     .               {
-- line 175 ----------------------------------------
-- line 194 ----------------------------------------
     .               /// Reserve capacity for `additional` more key-value pairs.
     .               pub(crate) fn reserve(&mut self, additional: usize) {
     .                   self.indices.reserve(additional, get_hash(&self.entries));
     .                   self.reserve_entries();
     .               }
     .           
     .               /// Reserve entries capacity to match the indices
     .               fn reserve_entries(&mut self) {
 1,307 ( 0.00%)          let additional = self.indices.capacity() - self.entries.len();
     .                   self.entries.reserve_exact(additional);
     .               }
     .           
     .               /// Shrink the capacity of the map as much as possible.
     .               pub(crate) fn shrink_to_fit(&mut self) {
     .                   self.indices.shrink_to(0, get_hash(&self.entries));
     .                   self.entries.shrink_to_fit();
     .               }
-- line 210 ----------------------------------------
-- line 218 ----------------------------------------
     .                   } else {
     .                       None
     .                   }
     .               }
     .           
     .               /// Append a key-value pair, *without* checking whether it already exists,
     .               /// and return the pair's new index.
     .               fn push(&mut self, hash: HashValue, key: K, value: V) -> usize {
 7,924 ( 0.01%)          let i = self.entries.len();
     .                   self.indices.insert(hash.get(), i, get_hash(&self.entries));
15,921 ( 0.01%)          if i == self.entries.capacity() {
     .                       // Reserve our own capacity synced to the indices,
     .                       // rather than letting `Vec::push` just double it.
     .                       self.reserve_entries();
     .                   }
47,967 ( 0.04%)          self.entries.push(Bucket { hash, key, value });
     .                   i
     .               }
     .           
     .               /// Return the index in `entries` where an equivalent key can be found
   554 ( 0.00%)      pub(crate) fn get_index_of<Q>(&self, hash: HashValue, key: &Q) -> Option<usize>
     .               where
     .                   Q: ?Sized + Equivalent<K>,
     .               {
    60 ( 0.00%)          let eq = equivalent(key, &self.entries);
     .                   self.indices.get(hash.get(), eq).copied()
   554 ( 0.00%)      }
     .           
   279 ( 0.00%)      pub(crate) fn insert_full(&mut self, hash: HashValue, key: K, value: V) -> (usize, Option<V>)
     .               where
     .                   K: Eq,
     .               {
     .                   match self.get_index_of(hash, &key) {
     .                       Some(i) => (i, Some(replace(&mut self.entries[i].value, value))),
    26 ( 0.00%)              None => (self.push(hash, key, value), None),
     .                   }
   253 ( 0.00%)      }
     .           
     .               /// Remove an entry by shifting all entries that follow it
     .               pub(crate) fn shift_remove_full<Q>(&mut self, hash: HashValue, key: &Q) -> Option<(usize, K, V)>
     .               where
     .                   Q: ?Sized + Equivalent<K>,
     .               {
     .                   let eq = equivalent(key, &self.entries);
     .                   match self.indices.remove_entry(hash.get(), eq) {
-- line 262 ----------------------------------------
-- line 361 ----------------------------------------
     .                   let (init, shifted_entries) = self.entries.split_at(end);
     .                   let (start_entries, erased_entries) = init.split_at(start);
     .           
     .                   let erased = erased_entries.len();
     .                   let shifted = shifted_entries.len();
     .                   let half_capacity = self.indices.buckets() / 2;
     .           
     .                   // Use a heuristic between different strategies
     6 ( 0.00%)          if erased == 0 {
     .                       // Degenerate case, nothing to do
     .                   } else if start + shifted < half_capacity && start < erased {
     .                       // Reinsert everything, as there are few kept indices
     .                       self.indices.clear();
     .           
     .                       // Reinsert stable indices
     .                       for (i, entry) in enumerate(start_entries) {
     .                           self.indices.insert_no_grow(entry.hash.get(), i);
-- line 377 ----------------------------------------
-- line 468 ----------------------------------------
     .                       Entry::Vacant(entry) => entry.insert(default),
     .                   }
     .               }
     .           
     .               /// Inserts the result of the `call` function in the entry if it is vacant and returns a mutable
     .               /// reference to it. Otherwise a mutable reference to an already existent value is returned.
     .               ///
     .               /// Computes in **O(1)** time (amortized average).
10,538 ( 0.01%)      pub fn or_insert_with<F>(self, call: F) -> &'a mut V
     .               where
     .                   F: FnOnce() -> V,
     .               {
 2,636 ( 0.00%)          match self {
   347 ( 0.00%)              Entry::Occupied(entry) => entry.into_mut(),
 1,123 ( 0.00%)              Entry::Vacant(entry) => entry.insert(call()),
     .                   }
10,544 ( 0.01%)      }
     .           
     .               /// Inserts the result of the `call` function with a reference to the entry's key if it is
     .               /// vacant, and returns a mutable reference to the new value. Otherwise a mutable reference to
     .               /// an already existent value is returned.
     .               ///
     .               /// Computes in **O(1)** time (amortized average).
     .               pub fn or_insert_with_key<F>(self, call: F) -> &'a mut V
     .               where
-- line 492 ----------------------------------------
-- line 531 ----------------------------------------
     .                       x => x,
     .                   }
     .               }
     .           
     .               /// Inserts a default-constructed value in the entry if it is vacant and returns a mutable
     .               /// reference to it. Otherwise a mutable reference to an already existent value is returned.
     .               ///
     .               /// Computes in **O(1)** time (amortized average).
50,862 ( 0.04%)      pub fn or_default(self) -> &'a mut V
     .               where
     .                   V: Default,
     .               {
14,532 ( 0.01%)          match self {
   457 ( 0.00%)              Entry::Occupied(entry) => entry.into_mut(),
20,427 ( 0.02%)              Entry::Vacant(entry) => entry.insert(V::default()),
     .                   }
58,128 ( 0.05%)      }
     .           }
     .           
     .           impl<K: fmt::Debug, V: fmt::Debug> fmt::Debug for Entry<'_, K, V> {
     .               fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
     .                   match *self {
     .                       Entry::Vacant(ref v) => f.debug_tuple(stringify!(Entry)).field(v).finish(),
     .                       Entry::Occupied(ref o) => f.debug_tuple(stringify!(Entry)).field(o).finish(),
     .                   }
-- line 555 ----------------------------------------
-- line 634 ----------------------------------------
     .           
     .               /// Return the index where the key-value pair will be inserted.
     .               pub fn index(&self) -> usize {
     .                   self.map.len()
     .               }
     .           
     .               /// Inserts the entry's key and the given value into the map, and returns a mutable reference
     .               /// to the value.
 1,124 ( 0.00%)      pub fn insert(self, value: V) -> &'a mut V {
20,893 ( 0.02%)          let i = self.map.push(self.hash, self.key, value);
    15 ( 0.00%)          &mut self.map.entries[i].value
 1,262 ( 0.00%)      }
     .           }
     .           
     .           impl<K: fmt::Debug, V> fmt::Debug for VacantEntry<'_, K, V> {
     .               fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
     .                   f.debug_tuple(stringify!(VacantEntry))
     .                       .field(self.key())
     .                       .finish()
     .               }
-- line 653 ----------------------------------------

50,388 ( 0.04%)  <counts for unidentified lines in /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/indexmap-1.8.0/src/map/core.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/cmp.rs
--------------------------------------------------------------------------------
Ir               

-- line 223 ----------------------------------------
      .               fn eq(&self, other: &Rhs) -> bool;
      .           
      .               /// This method tests for `!=`.
      .               #[inline]
      .               #[must_use]
      .               #[stable(feature = "rust1", since = "1.0.0")]
      .               #[default_method_body_is_const]
      .               fn ne(&self, other: &Rhs) -> bool {
  1,353 ( 0.00%)          !self.eq(other)
      .               }
      .           }
      .           
      .           /// Derive macro generating an impl of the trait `PartialEq`.
      .           #[rustc_builtin_macro]
      .           #[stable(feature = "builtin_macro_prelude", since = "1.38.0")]
      .           #[allow_internal_unstable(core_intrinsics, structural_match)]
      .           pub macro PartialEq($item:item) {
-- line 239 ----------------------------------------
-- line 328 ----------------------------------------
      .           /// assert_eq!(Ordering::Less, result);
      .           ///
      .           /// let result = 1.cmp(&1);
      .           /// assert_eq!(Ordering::Equal, result);
      .           ///
      .           /// let result = 2.cmp(&1);
      .           /// assert_eq!(Ordering::Greater, result);
      .           /// ```
    154 ( 0.00%)  #[derive(Clone, Copy, PartialEq, Debug, Hash)]
      .           #[stable(feature = "rust1", since = "1.0.0")]
      .           #[repr(i8)]
      .           pub enum Ordering {
      .               /// An ordering where a compared value is less than another.
      .               #[stable(feature = "rust1", since = "1.0.0")]
      .               Less = -1,
      .               /// An ordering where a compared value is equal to another.
      .               #[stable(feature = "rust1", since = "1.0.0")]
-- line 344 ----------------------------------------
-- line 569 ----------------------------------------
      .               /// let result = x.0.cmp(&y.0).then_with(|| x.1.cmp(&y.1)).then_with(|| x.2.cmp(&y.2));
      .               ///
      .               /// assert_eq!(result, Ordering::Less);
      .               /// ```
      .               #[inline]
      .               #[must_use]
      .               #[stable(feature = "ordering_chaining", since = "1.17.0")]
      .               pub fn then_with<F: FnOnce() -> Ordering>(self, f: F) -> Ordering {
    155 ( 0.00%)          match self {
      .                       Equal => f(),
      .                       _ => self,
      .                   }
      .               }
      .           }
      .           
      .           /// A helper struct for reverse ordering.
      .           ///
-- line 585 ----------------------------------------
-- line 792 ----------------------------------------
      .               /// ```
      .               #[stable(feature = "ord_max_min", since = "1.21.0")]
      .               #[inline]
      .               #[must_use]
      .               fn max(self, other: Self) -> Self
      .               where
      .                   Self: Sized,
      .               {
  3,150 ( 0.00%)          max_by(self, other, Ord::cmp)
      .               }
      .           
      .               /// Compares and returns the minimum of two values.
      .               ///
      .               /// Returns the first argument if the comparison determines them to be equal.
      .               ///
      .               /// # Examples
      .               ///
-- line 808 ----------------------------------------
-- line 812 ----------------------------------------
      .               /// ```
      .               #[stable(feature = "ord_max_min", since = "1.21.0")]
      .               #[inline]
      .               #[must_use]
      .               fn min(self, other: Self) -> Self
      .               where
      .                   Self: Sized,
      .               {
    182 ( 0.00%)          min_by(self, other, Ord::cmp)
      .               }
      .           
      .               /// Restrict a value to a certain interval.
      .               ///
      .               /// Returns `max` if `self` is greater than `max`, and `min` if `self` is
      .               /// less than `min`. Otherwise this returns `self`.
      .               ///
      .               /// # Panics
-- line 828 ----------------------------------------
-- line 1097 ----------------------------------------
      .               /// let result = 2.0 < 1.0;
      .               /// assert_eq!(result, false);
      .               /// ```
      .               #[inline]
      .               #[must_use]
      .               #[stable(feature = "rust1", since = "1.0.0")]
      .               #[default_method_body_is_const]
      .               fn lt(&self, other: &Rhs) -> bool {
  3,323 ( 0.00%)          matches!(self.partial_cmp(other), Some(Less))
      .               }
      .           
      .               /// This method tests less than or equal to (for `self` and `other`) and is used by the `<=`
      .               /// operator.
      .               ///
      .               /// # Examples
      .               ///
      .               /// ```
-- line 1113 ----------------------------------------
-- line 1121 ----------------------------------------
      .               #[must_use]
      .               #[stable(feature = "rust1", since = "1.0.0")]
      .               #[default_method_body_is_const]
      .               fn le(&self, other: &Rhs) -> bool {
      .                   // Pattern `Some(Less | Eq)` optimizes worse than negating `None | Some(Greater)`.
      .                   // FIXME: The root cause was fixed upstream in LLVM with:
      .                   // https://github.com/llvm/llvm-project/commit/9bad7de9a3fb844f1ca2965f35d0c2a3d1e11775
      .                   // Revert this workaround once support for LLVM 12 gets dropped.
 17,504 ( 0.01%)          !matches!(self.partial_cmp(other), None | Some(Greater))
      .               }
      .           
      .               /// This method tests greater than (for `self` and `other`) and is used by the `>` operator.
      .               ///
      .               /// # Examples
      .               ///
      .               /// ```
      .               /// let result = 1.0 > 2.0;
-- line 1137 ----------------------------------------
-- line 1140 ----------------------------------------
      .               /// let result = 2.0 > 2.0;
      .               /// assert_eq!(result, false);
      .               /// ```
      .               #[inline]
      .               #[must_use]
      .               #[stable(feature = "rust1", since = "1.0.0")]
      .               #[default_method_body_is_const]
      .               fn gt(&self, other: &Rhs) -> bool {
 24,335 ( 0.02%)          matches!(self.partial_cmp(other), Some(Greater))
      .               }
      .           
      .               /// This method tests greater than or equal to (for `self` and `other`) and is used by the `>=`
      .               /// operator.
      .               ///
      .               /// # Examples
      .               ///
      .               /// ```
-- line 1156 ----------------------------------------
-- line 1160 ----------------------------------------
      .               /// let result = 2.0 >= 2.0;
      .               /// assert_eq!(result, true);
      .               /// ```
      .               #[inline]
      .               #[must_use]
      .               #[stable(feature = "rust1", since = "1.0.0")]
      .               #[default_method_body_is_const]
      .               fn ge(&self, other: &Rhs) -> bool {
      5 ( 0.00%)          matches!(self.partial_cmp(other), Some(Greater | Equal))
      .               }
      .           }
      .           
      .           /// Derive macro generating an impl of the trait `PartialOrd`.
      .           #[rustc_builtin_macro]
      .           #[stable(feature = "builtin_macro_prelude", since = "1.38.0")]
      .           #[allow_internal_unstable(core_intrinsics)]
      .           pub macro PartialOrd($item:item) {
-- line 1176 ----------------------------------------
-- line 1210 ----------------------------------------
      .           ///
      .           /// assert_eq!(cmp::min_by(-2, 1, |x: &i32, y: &i32| x.abs().cmp(&y.abs())), 1);
      .           /// assert_eq!(cmp::min_by(-2, 2, |x: &i32, y: &i32| x.abs().cmp(&y.abs())), -2);
      .           /// ```
      .           #[inline]
      .           #[must_use]
      .           #[stable(feature = "cmp_min_max_by", since = "1.53.0")]
      .           pub fn min_by<T, F: FnOnce(&T, &T) -> Ordering>(v1: T, v2: T, compare: F) -> T {
  7,138 ( 0.01%)      match compare(&v1, &v2) {
      .                   Ordering::Less | Ordering::Equal => v1,
      .                   Ordering::Greater => v2,
      .               }
      .           }
      .           
      .           /// Returns the element that gives the minimum value from the specified function.
      .           ///
      .           /// Returns the first argument if the comparison determines them to be equal.
-- line 1226 ----------------------------------------
-- line 1273 ----------------------------------------
      .           ///
      .           /// assert_eq!(cmp::max_by(-2, 1, |x: &i32, y: &i32| x.abs().cmp(&y.abs())), -2);
      .           /// assert_eq!(cmp::max_by(-2, 2, |x: &i32, y: &i32| x.abs().cmp(&y.abs())), 2);
      .           /// ```
      .           #[inline]
      .           #[must_use]
      .           #[stable(feature = "cmp_min_max_by", since = "1.53.0")]
      .           pub fn max_by<T, F: FnOnce(&T, &T) -> Ordering>(v1: T, v2: T, compare: F) -> T {
 23,592 ( 0.02%)      match compare(&v1, &v2) {
    300 ( 0.00%)          Ordering::Less | Ordering::Equal => v2,
      .                   Ordering::Greater => v1,
      .               }
      .           }
      .           
      .           /// Returns the element that gives the maximum value from the specified function.
      .           ///
      .           /// Returns the second argument if the comparison determines them to be equal.
      .           ///
-- line 1290 ----------------------------------------
-- line 1308 ----------------------------------------
      .               use crate::cmp::Ordering::{self, Equal, Greater, Less};
      .               use crate::hint::unreachable_unchecked;
      .           
      .               macro_rules! partial_eq_impl {
      .                   ($($t:ty)*) => ($(
      .                       #[stable(feature = "rust1", since = "1.0.0")]
      .                       impl PartialEq for $t {
      .                           #[inline]
    468 ( 0.00%)                  fn eq(&self, other: &$t) -> bool { (*self) == (*other) }
      .                           #[inline]
 29,314 ( 0.02%)                  fn ne(&self, other: &$t) -> bool { (*self) != (*other) }
      .                       }
      .                   )*)
      .               }
      .           
      .               #[stable(feature = "rust1", since = "1.0.0")]
      .               impl PartialEq for () {
      .                   #[inline]
      .                   fn eq(&self, _other: &()) -> bool {
-- line 1326 ----------------------------------------
-- line 1392 ----------------------------------------
      .                   ($($t:ty)*) => ($(
      .                       #[stable(feature = "rust1", since = "1.0.0")]
      .                       impl PartialOrd for $t {
      .                           #[inline]
      .                           fn partial_cmp(&self, other: &$t) -> Option<Ordering> {
      .                               Some(self.cmp(other))
      .                           }
      .                           #[inline]
774,357 ( 0.62%)                  fn lt(&self, other: &$t) -> bool { (*self) < (*other) }
      .                           #[inline]
  1,780 ( 0.00%)                  fn le(&self, other: &$t) -> bool { (*self) <= (*other) }
      .                           #[inline]
      .                           fn ge(&self, other: &$t) -> bool { (*self) >= (*other) }
      .                           #[inline]
      .                           fn gt(&self, other: &$t) -> bool { (*self) > (*other) }
      .                       }
      .           
      .                       #[stable(feature = "rust1", since = "1.0.0")]
      .                       impl Ord for $t {
      .                           #[inline]
      .                           fn cmp(&self, other: &$t) -> Ordering {
      .                               // The order here is important to generate more optimal assembly.
      .                               // See <https://github.com/rust-lang/rust/issues/63758> for more info.
 63,414 ( 0.05%)                      if *self < *other { Less }
      .                               else if *self == *other { Equal }
      .                               else { Greater }
      .                           }
      .                       }
      .                   )*)
      .               }
      .           
      .               #[stable(feature = "rust1", since = "1.0.0")]
-- line 1423 ----------------------------------------
-- line 1430 ----------------------------------------
      .           
      .               #[stable(feature = "rust1", since = "1.0.0")]
      .               impl Ord for bool {
      .                   #[inline]
      .                   fn cmp(&self, other: &bool) -> Ordering {
      .                       // Casting to i8's and converting the difference to an Ordering generates
      .                       // more optimal assembly.
      .                       // See <https://github.com/rust-lang/rust/issues/66780> for more info.
    580 ( 0.00%)              match (*self as i8) - (*other as i8) {
      .                           -1 => Less,
      .                           0 => Equal,
      .                           1 => Greater,
      .                           // SAFETY: bool as i8 returns 0 or 1, so the difference can't be anything else
      .                           _ => unsafe { unreachable_unchecked() },
      .                       }
      .                   }
      .               }
-- line 1446 ----------------------------------------
-- line 1474 ----------------------------------------
      .               // & pointers
      .           
      .               #[stable(feature = "rust1", since = "1.0.0")]
      .               impl<A: ?Sized, B: ?Sized> PartialEq<&B> for &A
      .               where
      .                   A: PartialEq<B>,
      .               {
      .                   #[inline]
    165 ( 0.00%)          fn eq(&self, other: &&B) -> bool {
 15,583 ( 0.01%)              PartialEq::eq(*self, *other)
  1,988 ( 0.00%)          }
      .                   #[inline]
      .                   fn ne(&self, other: &&B) -> bool {
     57 ( 0.00%)              PartialEq::ne(*self, *other)
    589 ( 0.00%)          }
      .               }
      .               #[stable(feature = "rust1", since = "1.0.0")]
      .               impl<A: ?Sized, B: ?Sized> PartialOrd<&B> for &A
      .               where
      .                   A: PartialOrd<B>,
      .               {
      .                   #[inline]
      .                   fn partial_cmp(&self, other: &&B) -> Option<Ordering> {
-- line 1496 ----------------------------------------
-- line 1516 ----------------------------------------
      .               #[stable(feature = "rust1", since = "1.0.0")]
      .               impl<A: ?Sized> Ord for &A
      .               where
      .                   A: Ord,
      .               {
      .                   #[inline]
      .                   fn cmp(&self, other: &Self) -> Ordering {
      .                       Ord::cmp(*self, *other)
    135 ( 0.00%)          }
      .               }
      .               #[stable(feature = "rust1", since = "1.0.0")]
      .               impl<A: ?Sized> Eq for &A where A: Eq {}
      .           
      .               // &mut pointers
      .           
      .               #[stable(feature = "rust1", since = "1.0.0")]
      .               impl<A: ?Sized, B: ?Sized> PartialEq<&mut B> for &mut A
-- line 1532 ----------------------------------------

 92,713 ( 0.07%)  <counts for unidentified lines in /usr/home/liquid/rust/worktree-benchmarking/library/core/src/cmp.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/rustc-hash-1.1.0/src/lib.rs
--------------------------------------------------------------------------------
Ir               

-- line 71 ----------------------------------------
      .               fn default() -> FxHasher {
      .                   FxHasher { hash: 0 }
      .               }
      .           }
      .           
      .           impl FxHasher {
      .               #[inline]
      .               fn add_to_hash(&mut self, i: usize) {
 73,889 ( 0.06%)          self.hash = self.hash.rotate_left(5).bitxor(i).wrapping_mul(K);
      .               }
      .           }
      .           
      .           impl Hasher for FxHasher {
      .               #[inline]
    900 ( 0.00%)      fn write(&mut self, mut bytes: &[u8]) {
      .                   #[cfg(target_pointer_width = "32")]
      .                   let read_usize = |bytes: &[u8]| u32::from_ne_bytes(bytes[..4].try_into().unwrap());
      .                   #[cfg(target_pointer_width = "64")]
      .                   let read_usize = |bytes: &[u8]| u64::from_ne_bytes(bytes[..8].try_into().unwrap());
      .           
 31,786 ( 0.03%)          let mut hash = FxHasher { hash: self.hash };
      .                   assert!(size_of::<usize>() <= 8);
363,253 ( 0.29%)          while bytes.len() >= size_of::<usize>() {
      .                       hash.add_to_hash(read_usize(bytes) as usize);
      .                       bytes = &bytes[size_of::<usize>()..];
      .                   }
 62,508 ( 0.05%)          if (size_of::<usize>() > 4) && (bytes.len() >= 4) {
      .                       hash.add_to_hash(u32::from_ne_bytes(bytes[..4].try_into().unwrap()) as usize);
      .                       bytes = &bytes[4..];
      .                   }
 62,508 ( 0.05%)          if (size_of::<usize>() > 2) && bytes.len() >= 2 {
      .                       hash.add_to_hash(u16::from_ne_bytes(bytes[..2].try_into().unwrap()) as usize);
      .                       bytes = &bytes[2..];
      .                   }
 69,741 ( 0.06%)          if (size_of::<usize>() > 1) && bytes.len() >= 1 {
 16,268 ( 0.01%)              hash.add_to_hash(bytes[0] as usize);
      .                   }
  1,512 ( 0.00%)          self.hash = hash.hash;
    900 ( 0.00%)      }
      .           
      .               #[inline]
      .               fn write_u8(&mut self, i: u8) {
     19 ( 0.00%)          self.add_to_hash(i as usize);
      .               }
      .           
      .               #[inline]
      .               fn write_u16(&mut self, i: u16) {
     12 ( 0.00%)          self.add_to_hash(i as usize);
      .               }
      .           
      .               #[inline]
      .               fn write_u32(&mut self, i: u32) {
 74,018 ( 0.06%)          self.add_to_hash(i as usize);
      .               }
      .           
      .               #[cfg(target_pointer_width = "32")]
      .               #[inline]
      .               fn write_u64(&mut self, i: u64) {
      .                   self.add_to_hash(i as usize);
      .                   self.add_to_hash((i >> 32) as usize);
      .               }
-- line 131 ----------------------------------------

      1 ( 0.00%)  <counts for unidentified lines in /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/rustc-hash-1.1.0/src/lib.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/symbol.rs
--------------------------------------------------------------------------------
Ir               

-- line 15 ----------------------------------------
      .           use std::str;
      .           
      .           use crate::{with_session_globals, Edition, Span, DUMMY_SP};
      .           
      .           #[cfg(test)]
      .           mod tests;
      .           
      .           // The proc macro code for this is in `compiler/rustc_macros/src/symbols.rs`.
      8 ( 0.00%)  symbols! {
      .               // After modifying this list adjust `is_special`, `is_used_keyword`/`is_unused_keyword`,
      .               // this should be rarely necessary though if the keywords are kept in alphabetic order.
      .               Keywords {
      .                   // Special reserved identifiers used internally for elided lifetimes,
      .                   // unnamed method parameters, crate root module, error recovery etc.
      .                   Empty:              "",
      .                   PathRoot:           "{{root}}",
      .                   DollarCrate:        "$crate",
-- line 31 ----------------------------------------
-- line 1498 ----------------------------------------
      .                   write_str,
      .                   writeln_macro,
      .                   x87_reg,
      .                   xer,
      .                   xmm_reg,
      .                   ymm_reg,
      .                   zmm_reg,
      .               }
     10 ( 0.00%)  }
      .           
  2,928 ( 0.00%)  #[derive(Copy, Clone, Eq, HashStable_Generic, Encodable, Decodable)]
      .           pub struct Ident {
      .               pub name: Symbol,
      .               pub span: Span,
      .           }
      .           
      .           impl Ident {
      .               #[inline]
      .               /// Constructs a new identifier from a symbol and a span.
      .               pub const fn new(name: Symbol, span: Span) -> Ident {
      .                   Ident { name, span }
 13,867 ( 0.01%)      }
      .           
      .               /// Constructs a new identifier with a dummy span.
      .               #[inline]
      .               pub const fn with_dummy_span(name: Symbol) -> Ident {
      .                   Ident::new(name, DUMMY_SP)
      .               }
      .           
      .               #[inline]
      .               pub fn empty() -> Ident {
      .                   Ident::with_dummy_span(kw::Empty)
      .               }
      .           
      .               /// Maps a string to an identifier with a dummy span.
      2 ( 0.00%)      pub fn from_str(string: &str) -> Ident {
      2 ( 0.00%)          Ident::with_dummy_span(Symbol::intern(string))
      8 ( 0.00%)      }
      .           
      .               /// Maps a string and a span to an identifier.
      .               pub fn from_str_and_span(string: &str, span: Span) -> Ident {
      .                   Ident::new(Symbol::intern(string), span)
      .               }
      .           
      .               /// Replaces `lo` and `hi` with those from `span`, but keep hygiene context.
    840 ( 0.00%)      pub fn with_span_pos(self, span: Span) -> Ident {
      .                   Ident::new(self.name, span.with_ctxt(self.span.ctxt()))
    525 ( 0.00%)      }
      .           
      .               pub fn without_first_quote(self) -> Ident {
      .                   Ident::new(Symbol::intern(self.as_str().trim_start_matches('\'')), self.span)
      .               }
      .           
      .               /// "Normalize" ident for use in comparisons using "item hygiene".
      .               /// Identifiers with same string value become same if they came from the same macro 2.0 macro
      .               /// (e.g., `macro` item, but not `macro_rules` item) and stay different if they came from
      .               /// different macro 2.0 macros.
      .               /// Technically, this operation strips all non-opaque marks from ident's syntactic context.
 12,870 ( 0.01%)      pub fn normalize_to_macros_2_0(self) -> Ident {
      .                   Ident::new(self.name, self.span.normalize_to_macros_2_0())
 10,010 ( 0.01%)      }
      .           
      .               /// "Normalize" ident for use in comparisons using "local variable hygiene".
      .               /// Identifiers with same string value become same if they came from the same non-transparent
      .               /// macro (e.g., `macro` or `macro_rules!` items) and stay different if they came from different
      .               /// non-transparent macros.
      .               /// Technically, this operation strips all transparent marks from ident's syntactic context.
    882 ( 0.00%)      pub fn normalize_to_macro_rules(self) -> Ident {
      .                   Ident::new(self.name, self.span.normalize_to_macro_rules())
    686 ( 0.00%)      }
      .           
      .               /// Access the underlying string. This is a slowish operation because it
      .               /// requires locking the symbol interner.
      .               ///
      .               /// Note that the lifetime of the return value is a lie. See
      .               /// `Symbol::as_str()` for details.
      .               pub fn as_str(&self) -> &str {
     29 ( 0.00%)          self.name.as_str()
      .               }
      .           }
      .           
      .           impl PartialEq for Ident {
  1,734 ( 0.00%)      fn eq(&self, rhs: &Self) -> bool {
  4,120 ( 0.00%)          self.name == rhs.name && self.span.ctxt() == rhs.span.ctxt()
  2,312 ( 0.00%)      }
      .           }
      .           
      .           impl Hash for Ident {
      .               fn hash<H: Hasher>(&self, state: &mut H) {
      .                   self.name.hash(state);
    731 ( 0.00%)          self.span.ctxt().hash(state);
      .               }
      .           }
      .           
      .           impl fmt::Debug for Ident {
      .               fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
      .                   fmt::Display::fmt(self, f)?;
      .                   fmt::Debug::fmt(&self.span.ctxt(), f)
      .               }
-- line 1596 ----------------------------------------
-- line 1622 ----------------------------------------
      .               is_raw: bool,
      .               /// Span used for retrieving the crate name to which `$crate` refers to,
      .               /// if this field is `None` then the `$crate` conversion doesn't happen.
      .               convert_dollar_crate: Option<Span>,
      .           }
      .           
      .           impl IdentPrinter {
      .               /// The most general `IdentPrinter` constructor. Do not use this.
      4 ( 0.00%)      pub fn new(symbol: Symbol, is_raw: bool, convert_dollar_crate: Option<Span>) -> IdentPrinter {
     64 ( 0.00%)          IdentPrinter { symbol, is_raw, convert_dollar_crate }
      4 ( 0.00%)      }
      .           
      .               /// This implementation is supposed to be used when printing identifiers
      .               /// as a part of pretty-printing for larger AST pieces.
      .               /// Do not use this either.
     24 ( 0.00%)      pub fn for_ast_ident(ident: Ident, is_raw: bool) -> IdentPrinter {
     24 ( 0.00%)          IdentPrinter::new(ident.name, is_raw, Some(ident.span))
     12 ( 0.00%)      }
      .           }
      .           
      .           impl fmt::Display for IdentPrinter {
     80 ( 0.00%)      fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
     32 ( 0.00%)          if self.is_raw {
      .                       f.write_str("r#")?;
     16 ( 0.00%)          } else if self.symbol == kw::DollarCrate {
      .                       if let Some(span) = self.convert_dollar_crate {
      .                           let converted = span.ctxt().dollar_crate_name();
      .                           if !converted.is_path_segment_keyword() {
      .                               f.write_str("::")?;
      .                           }
      .                           return fmt::Display::fmt(&converted, f);
      .                       }
      .                   }
-- line 1654 ----------------------------------------
-- line 1656 ----------------------------------------
      .               }
      .           }
      .           
      .           /// An newtype around `Ident` that calls [Ident::normalize_to_macro_rules] on
      .           /// construction.
      .           // FIXME(matthewj, petrochenkov) Use this more often, add a similar
      .           // `ModernIdent` struct and use that as well.
      .           #[derive(Copy, Clone, Eq, PartialEq, Hash)]
    178 ( 0.00%)  pub struct MacroRulesNormalizedIdent(Ident);
      .           
      .           impl MacroRulesNormalizedIdent {
      .               pub fn new(ident: Ident) -> Self {
     69 ( 0.00%)          Self(ident.normalize_to_macro_rules())
      .               }
      .           }
      .           
      .           impl fmt::Debug for MacroRulesNormalizedIdent {
      .               fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
      .                   fmt::Debug::fmt(&self.0, f)
      .               }
      .           }
-- line 1676 ----------------------------------------
-- line 1686 ----------------------------------------
      .           /// Internally, a `Symbol` is implemented as an index, and all operations
      .           /// (including hashing, equality, and ordering) operate on that index. The use
      .           /// of `rustc_index::newtype_index!` means that `Option<Symbol>` only takes up 4 bytes,
      .           /// because `rustc_index::newtype_index!` reserves the last 256 values for tagging purposes.
      .           ///
      .           /// Note that `Symbol` cannot directly be a `rustc_index::newtype_index!` because it
      .           /// implements `fmt::Debug`, `Encodable`, and `Decodable` in special ways.
      .           #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]
  4,978 ( 0.00%)  pub struct Symbol(SymbolIndex);
      .           
      .           rustc_index::newtype_index! {
      .               struct SymbolIndex { .. }
      .           }
      .           
      .           impl Symbol {
      .               const fn new(n: u32) -> Self {
      .                   Symbol(SymbolIndex::from_u32(n))
     14 ( 0.00%)      }
      .           
      .               /// Maps a string to its interned representation.
141,255 ( 0.11%)      pub fn intern(string: &str) -> Self {
      .                   with_session_globals(|session_globals| session_globals.symbol_interner.intern(string))
141,255 ( 0.11%)      }
      .           
      .               /// Access the underlying string. This is a slowish operation because it
      .               /// requires locking the symbol interner.
      .               ///
      .               /// Note that the lifetime of the return value is a lie. It's not the same
      .               /// as `&self`, but actually tied to the lifetime of the underlying
      .               /// interner. Interners are long-lived, and there are very few of them, and
      .               /// this function is typically used for short-lived things, so in practice
      .               /// it works out ok.
  4,875 ( 0.00%)      pub fn as_str(&self) -> &str {
  1,625 ( 0.00%)          with_session_globals(|session_globals| unsafe {
      .                       std::mem::transmute::<&str, &str>(session_globals.symbol_interner.get(*self))
      .                   })
  6,500 ( 0.01%)      }
      .           
      .               pub fn as_u32(self) -> u32 {
      .                   self.0.as_u32()
      .               }
      .           
      .               pub fn is_empty(self) -> bool {
      .                   self == kw::Empty
      .               }
-- line 1730 ----------------------------------------
-- line 1740 ----------------------------------------
      .           
      .           impl fmt::Debug for Symbol {
      .               fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
      .                   fmt::Debug::fmt(self.as_str(), f)
      .               }
      .           }
      .           
      .           impl fmt::Display for Symbol {
    162 ( 0.00%)      fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
    630 ( 0.00%)          fmt::Display::fmt(self.as_str(), f)
      .               }
      .           }
      .           
      .           impl<S: Encoder> Encodable<S> for Symbol {
      .               fn encode(&self, s: &mut S) -> Result<(), S::Error> {
  2,336 ( 0.00%)          s.emit_str(self.as_str())
      .               }
      .           }
      .           
      .           impl<D: Decoder> Decodable<D> for Symbol {
      .               #[inline]
  6,100 ( 0.00%)      fn decode(d: &mut D) -> Symbol {
 42,995 ( 0.03%)          Symbol::intern(&d.read_str())
      .               }
      .           }
      .           
      .           impl<CTX> HashStable<CTX> for Symbol {
      .               #[inline]
    174 ( 0.00%)      fn hash_stable(&self, hcx: &mut CTX, hasher: &mut StableHasher) {
    996 ( 0.00%)          self.as_str().hash_stable(hcx, hasher);
    138 ( 0.00%)      }
      .           }
      .           
      .           impl<CTX> ToStableHashKey<CTX> for Symbol {
      .               type KeyType = String;
      .               #[inline]
      .               fn to_stable_hash_key(&self, _: &CTX) -> String {
      .                   self.as_str().to_string()
      .               }
-- line 1778 ----------------------------------------
-- line 1785 ----------------------------------------
      .           //
      .           // The `FxHashMap`+`Vec` pair could be replaced by `FxIndexSet`, but #75278
      .           // found that to regress performance up to 2% in some cases. This might be
      .           // revisited after further improvements to `indexmap`.
      .           //
      .           // This type is private to prevent accidentally constructing more than one
      .           // `Interner` on the same thread, which makes it easy to mixup `Symbol`s
      .           // between `Interner`s.
      2 ( 0.00%)  #[derive(Default)]
      .           struct InternerInner {
      .               arena: DroplessArena,
      .               names: FxHashMap<&'static str, Symbol>,
      .               strings: Vec<&'static str>,
      .           }
      .           
      .           impl Interner {
      .               fn prefill(init: &[&'static str]) -> Self {
     30 ( 0.00%)          Interner(Lock::new(InternerInner {
      .                       strings: init.into(),
      .                       names: init.iter().copied().zip((0..).map(Symbol::new)).collect(),
      .                       ..Default::default()
      .                   }))
      .               }
      .           
      .               #[inline]
      .               fn intern(&self, string: &str) -> Symbol {
      .                   let mut inner = self.0.lock();
 21,032 ( 0.02%)          if let Some(&name) = inner.names.get(string) {
      .                       return name;
      .                   }
      .           
  5,179 ( 0.00%)          let name = Symbol::new(inner.strings.len() as u32);
      .           
      .                   // SAFETY: we convert from `&str` to `&[u8]`, clone it into the arena,
      .                   // and immediately convert the clone back to `&[u8], all because there
      .                   // is no `inner.arena.alloc_str()` method. This is clearly safe.
      .                   let string: &str =
      .                       unsafe { str::from_utf8_unchecked(inner.arena.alloc_slice(string.as_bytes())) };
      .           
      .                   // SAFETY: we can extend the arena allocation to `'static` because we
-- line 1824 ----------------------------------------
-- line 1831 ----------------------------------------
      .                   // #91445 for details.
      .                   inner.names.insert(string, name);
      .                   name
      .               }
      .           
      .               // Get the symbol as a string. `Symbol::as_str()` should be used in
      .               // preference to this function.
      .               fn get(&self, symbol: Symbol) -> &str {
  4,875 ( 0.00%)          self.0.lock().strings[symbol.0.as_usize()]
      .               }
      .           }
      .           
      .           // This module has a very short name because it's used a lot.
      .           /// This module contains all the defined keyword `Symbol`s.
      .           ///
      .           /// Given that `kw` is imported, use them like `kw::keyword_name`.
      .           /// For example `kw::Loop` or `kw::Break`.
-- line 1847 ----------------------------------------
-- line 1863 ----------------------------------------
      .           
      .               // Used from a macro in `librustc_feature/accepted.rs`
      .               pub use super::kw::MacroRules as macro_rules;
      .           
      .               /// Get the symbol for an integer.
      .               ///
      .               /// The first few non-negative integers each have a static symbol and therefore
      .               /// are fast.
     28 ( 0.00%)      pub fn integer<N: TryInto<usize> + Copy + ToString>(n: N) -> Symbol {
     28 ( 0.00%)          if let Result::Ok(idx) = n.try_into() {
      .                       if idx < 10 {
     28 ( 0.00%)                  return Symbol::new(super::SYMBOL_DIGITS_BASE + idx as u32);
      .                       }
      .                   }
      .                   Symbol::intern(&n.to_string())
      .               }
      .           }
      .           
      .           impl Symbol {
      .               fn is_special(self) -> bool {
      .                   self <= kw::Underscore
      .               }
      .           
      .               fn is_used_keyword_always(self) -> bool {
     12 ( 0.00%)          self >= kw::As && self <= kw::While
      .               }
      .           
      .               fn is_used_keyword_conditional(self, edition: impl FnOnce() -> Edition) -> bool {
  1,272 ( 0.00%)          (self >= kw::Async && self <= kw::Dyn) && edition() >= Edition::Edition2018
      .               }
      .           
      .               fn is_unused_keyword_always(self) -> bool {
     12 ( 0.00%)          self >= kw::Abstract && self <= kw::Yield
      .               }
      .           
      .               fn is_unused_keyword_conditional(self, edition: impl FnOnce() -> Edition) -> bool {
      4 ( 0.00%)          self == kw::Try && edition() >= Edition::Edition2018
      .               }
      .           
      .               pub fn is_reserved(self, edition: impl Copy + FnOnce() -> Edition) -> bool {
  2,345 ( 0.00%)          self.is_special()
      .                       || self.is_used_keyword_always()
      .                       || self.is_unused_keyword_always()
      .                       || self.is_used_keyword_conditional(edition)
      .                       || self.is_unused_keyword_conditional(edition)
      .               }
      .           
      .               /// A keyword or reserved identifier that can be used as a path segment.
      .               pub fn is_path_segment_keyword(self) -> bool {
  6,986 ( 0.01%)          self == kw::Super
      .                       || self == kw::SelfLower
      .                       || self == kw::SelfUpper
      .                       || self == kw::Crate
      .                       || self == kw::PathRoot
      .                       || self == kw::DollarCrate
      .               }
      .           
      .               /// Returns `true` if the symbol is `true` or `false`.
      .               pub fn is_bool_lit(self) -> bool {
     95 ( 0.00%)          self == kw::True || self == kw::False
     95 ( 0.00%)      }
      .           
      .               /// Returns `true` if this symbol can be a raw identifier.
      .               pub fn can_be_raw(self) -> bool {
     30 ( 0.00%)          self != kw::Empty && self != kw::Underscore && !self.is_path_segment_keyword()
      1 ( 0.00%)      }
      .           }
      .           
      .           impl Ident {
      .               // Returns `true` for reserved identifiers used internally for elided lifetimes,
      .               // unnamed method parameters, crate root module, error recovery etc.
      .               pub fn is_special(self) -> bool {
      .                   self.name.is_special()
      4 ( 0.00%)      }
      .           
      .               /// Returns `true` if the token is a keyword used in the language.
      4 ( 0.00%)      pub fn is_used_keyword(self) -> bool {
      .                   // Note: `span.edition()` is relatively expensive, don't call it unless necessary.
      4 ( 0.00%)          self.name.is_used_keyword_always()
      .                       || self.name.is_used_keyword_conditional(|| self.span.edition())
      8 ( 0.00%)      }
      .           
      .               /// Returns `true` if the token is a keyword reserved for possible future use.
      4 ( 0.00%)      pub fn is_unused_keyword(self) -> bool {
      .                   // Note: `span.edition()` is relatively expensive, don't call it unless necessary.
      4 ( 0.00%)          self.name.is_unused_keyword_always()
      .                       || self.name.is_unused_keyword_conditional(|| self.span.edition())
      8 ( 0.00%)      }
      .           
      .               /// Returns `true` if the token is either a special identifier or a keyword.
    457 ( 0.00%)      pub fn is_reserved(self) -> bool {
      .                   // Note: `span.edition()` is relatively expensive, don't call it unless necessary.
      .                   self.name.is_reserved(|| self.span.edition())
    914 ( 0.00%)      }
      .           
      .               /// A keyword or reserved identifier that can be used as a path segment.
      .               pub fn is_path_segment_keyword(self) -> bool {
      .                   self.name.is_path_segment_keyword()
    998 ( 0.00%)      }
      .           
      .               /// We see this identifier in a normal identifier position, like variable name or a type.
      .               /// How was it written originally? Did it use the raw form? Let's try to guess.
     12 ( 0.00%)      pub fn is_raw_guess(self) -> bool {
      .                   self.name.can_be_raw() && self.is_reserved()
     24 ( 0.00%)      }
      .           }

 22,600 ( 0.02%)  <counts for unidentified lines in /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/symbol.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/std/src/sys/unix/alloc.rs
--------------------------------------------------------------------------------
Ir               

-- line 5 ----------------------------------------
      .           #[stable(feature = "alloc_system_type", since = "1.28.0")]
      .           unsafe impl GlobalAlloc for System {
      .               #[inline]
      .               unsafe fn alloc(&self, layout: Layout) -> *mut u8 {
      .                   // jemalloc provides alignment less than MIN_ALIGN for small allocations.
      .                   // So only rely on MIN_ALIGN if size >= align.
      .                   // Also see <https://github.com/rust-lang/rust/issues/45955> and
      .                   // <https://github.com/rust-lang/rust/issues/62251#issuecomment-507580914>.
139,684 ( 0.11%)          if layout.align() <= MIN_ALIGN && layout.align() <= layout.size() {
104,763 ( 0.08%)              libc::malloc(layout.size()) as *mut u8
      .                   } else {
      .                       #[cfg(target_os = "macos")]
      .                       {
      .                           if layout.align() > (1 << 31) {
      .                               return ptr::null_mut();
      .                           }
      .                       }
      .                       aligned_malloc(&layout)
      .                   }
      .               }
      .           
      .               #[inline]
      .               unsafe fn alloc_zeroed(&self, layout: Layout) -> *mut u8 {
      .                   // See the comment above in `alloc` for why this check looks the way it does.
  3,040 ( 0.00%)          if layout.align() <= MIN_ALIGN && layout.align() <= layout.size() {
  4,560 ( 0.00%)              libc::calloc(layout.size(), 1) as *mut u8
      .                   } else {
      .                       let ptr = self.alloc(layout);
      .                       if !ptr.is_null() {
      .                           ptr::write_bytes(ptr, 0, layout.size());
      .                       }
      .                       ptr
      .                   }
      .               }
      .           
      .               #[inline]
      .               unsafe fn dealloc(&self, ptr: *mut u8, _layout: Layout) {
 35,670 ( 0.03%)          libc::free(ptr as *mut libc::c_void)
      .               }
      .           
      .               #[inline]
      .               unsafe fn realloc(&self, ptr: *mut u8, layout: Layout, new_size: usize) -> *mut u8 {
  9,360 ( 0.01%)          if layout.align() <= MIN_ALIGN && layout.align() <= new_size {
 18,720 ( 0.02%)              libc::realloc(ptr as *mut libc::c_void, new_size) as *mut u8
      .                   } else {
      .                       realloc_fallback(self, ptr, layout, new_size)
      .                   }
      .               }
      .           }
      .           
      .           cfg_if::cfg_if! {
      .               if #[cfg(any(
-- line 56 ----------------------------------------

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/ptr/mod.rs
--------------------------------------------------------------------------------
Ir                 

-- line 180 ----------------------------------------
        .           /// assert_eq!(v, &[0.into()]);
        .           ///
        .           /// // Ensure that the last item was dropped.
        .           /// assert!(weak.upgrade().is_none());
        .           /// ```
        .           #[stable(feature = "drop_in_place", since = "1.8.0")]
        .           #[lang = "drop_in_place"]
        .           #[allow(unconditional_recursion)]
  705,595 ( 0.57%)  pub unsafe fn drop_in_place<T: ?Sized>(to_drop: *mut T) {
        .               // Code here does not matter - this is replaced by the
        .               // real drop glue by the compiler.
        .           
        .               // SAFETY: see comment above
        .               unsafe { drop_in_place(to_drop) }
        .           }
        .           
        .           /// Creates a null raw pointer.
-- line 196 ----------------------------------------
-- line 448 ----------------------------------------
        .                       return;
        .                   }
        .               }
        .           
        .               // Direct swapping, for the cases not going through the block optimization.
        .               // SAFETY: the caller must guarantee that `x` and `y` are valid
        .               // for writes, properly aligned, and non-overlapping.
        .               unsafe {
        2 ( 0.00%)          let z = read(x);
        .                   copy_nonoverlapping(y, x, 1);
        .                   write(y, z);
        .               }
        .           }
        .           
        .           #[inline]
        .           #[rustc_const_unstable(feature = "const_swap", issue = "83163")]
        .           const unsafe fn swap_nonoverlapping_bytes(x: *mut u8, y: *mut u8, len: usize) {
-- line 464 ----------------------------------------
-- line 693 ----------------------------------------
        .               let mut tmp = MaybeUninit::<T>::uninit();
        .               // SAFETY: the caller must guarantee that `src` is valid for reads.
        .               // `src` cannot overlap `tmp` because `tmp` was just allocated on
        .               // the stack as a separate allocated object.
        .               //
        .               // Also, since we just wrote a valid value into `tmp`, it is guaranteed
        .               // to be properly initialized.
        .               unsafe {
   23,337 ( 0.02%)          copy_nonoverlapping(src, tmp.as_mut_ptr(), 1);
  119,850 ( 0.10%)          tmp.assume_init()
        .               }
        .           }
        .           
        .           /// Reads the value from `src` without moving it. This leaves the
        .           /// memory in `src` unchanged.
        .           ///
        .           /// Unlike [`read`], `read_unaligned` works with unaligned pointers.
        .           ///
-- line 710 ----------------------------------------
-- line 884 ----------------------------------------
        .                   #[rustc_const_unstable(feature = "const_intrinsic_copy", issue = "80697")]
        .                   fn copy_nonoverlapping<T>(src: *const T, dst: *mut T, count: usize);
        .               }
        .           
        .               // SAFETY: the caller must guarantee that `dst` is valid for writes.
        .               // `dst` cannot overlap `src` because the caller has mutable access
        .               // to `dst` while `src` is owned by this function.
        .               unsafe {
1,669,819 ( 1.34%)          copy_nonoverlapping(&src as *const T, dst, 1);
        .                   intrinsics::forget(src);
        .               }
        .           }
        .           
        .           /// Overwrites a memory location with the given value without reading or
        .           /// dropping the old value.
        .           ///
        .           /// Unlike [`write()`], the pointer may be unaligned.
-- line 900 ----------------------------------------
-- line 1206 ----------------------------------------
        .               if stride == 1 {
        .                   // `stride == 1` case can be computed more simply through `-p (mod a)`, but doing so
        .                   // inhibits LLVM's ability to select instructions like `lea`. Instead we compute
        .                   //
        .                   //    round_up_to_next_alignment(p, a) - p
        .                   //
        .                   // which distributes operations around the load-bearing, but pessimizing `and` sufficiently
        .                   // for LLVM to be able to utilize the various optimizations it knows about.
      115 ( 0.00%)          return wrapping_sub(
      688 ( 0.00%)              wrapping_add(p as usize, a_minus_one) & wrapping_sub(0, a),
        .                       p as usize,
        .                   );
        .               }
        .           
        .               let pmoda = p as usize & a_minus_one;
        .               if pmoda == 0 {
        .                   // Already aligned. Yay!
        .                   return 0;
-- line 1223 ----------------------------------------
-- line 1348 ----------------------------------------
        .           /// assert!(std::ptr::eq(
        .           ///     &wrapper as &dyn Trait as *const dyn Trait as *const u8,
        .           ///     &wrapper.member as &dyn Trait as *const dyn Trait as *const u8,
        .           /// ));
        .           /// ```
        .           #[stable(feature = "ptr_eq", since = "1.17.0")]
        .           #[inline]
        .           pub fn eq<T: ?Sized>(a: *const T, b: *const T) -> bool {
   17,345 ( 0.01%)      a == b
        .           }
        .           
        .           /// Hash a raw pointer.
        .           ///
        .           /// This can be used to hash a `&T` reference (which coerces to `*const T` implicitly)
        .           /// by its address rather than the value it points to
        .           /// (which is what the `Hash for &T` implementation does).
        .           ///
-- line 1364 ----------------------------------------

   98,501 ( 0.08%)  <counts for unidentified lines in /usr/home/liquid/rust/worktree-benchmarking/library/core/src/ptr/mod.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/rustc_entry.rs
--------------------------------------------------------------------------------
Ir               

-- line 26 ----------------------------------------
      .               /// }
      .               ///
      .               /// assert_eq!(letters[&'s'], 2);
      .               /// assert_eq!(letters[&'t'], 3);
      .               /// assert_eq!(letters[&'u'], 1);
      .               /// assert_eq!(letters.get(&'y'), None);
      .               /// ```
      .               #[cfg_attr(feature = "inline-more", inline)]
189,330 ( 0.15%)      pub fn rustc_entry(&mut self, key: K) -> RustcEntry<'_, K, V, A> {
      .                   let hash = make_insert_hash(&self.hash_builder, &key);
    138 ( 0.00%)          if let Some(elem) = self.table.find(hash, |q| q.0.eq(&key)) {
 14,403 ( 0.01%)              RustcEntry::Occupied(RustcOccupiedEntry {
  2,342 ( 0.00%)                  key: Some(key),
      .                           elem,
      .                           table: &mut self.table,
      .                       })
      .                   } else {
      .                       // Ideally we would put this in VacantEntry::insert, but Entry is not
      .                       // generic over the BuildHasher and adding a generic parameter would be
      .                       // a breaking change.
      .                       self.reserve(1);
      .           
 58,789 ( 0.05%)              RustcEntry::Vacant(RustcVacantEntry {
      .                           hash,
  4,417 ( 0.00%)                  key,
      .                           table: &mut self.table,
      .                       })
      .                   }
153,917 ( 0.12%)      }
      .           }
      .           
      .           /// A view into a single entry in a map, which may either be vacant or occupied.
      .           ///
      .           /// This `enum` is constructed from the [`entry`] method on [`HashMap`].
      .           ///
      .           /// [`HashMap`]: struct.HashMap.html
      .           /// [`entry`]: struct.HashMap.html#method.rustc_entry
-- line 62 ----------------------------------------
-- line 405 ----------------------------------------
      .               /// if let RustcEntry::Occupied(o) = map.rustc_entry("poneyland") {
      .               ///     *o.into_mut() += 10;
      .               /// }
      .               ///
      .               /// assert_eq!(map["poneyland"], 22);
      .               /// ```
      .               #[cfg_attr(feature = "inline-more", inline)]
      .               pub fn into_mut(self) -> &'a mut V {
    829 ( 0.00%)          unsafe { &mut self.elem.as_mut().1 }
      .               }
      .           
      .               /// Sets the value of the entry, and returns the entry's old value.
      .               ///
      .               /// # Examples
      .               ///
      .               /// ```
      .               /// use hashbrown::HashMap;
-- line 421 ----------------------------------------
-- line 568 ----------------------------------------
      .               /// let mut map: HashMap<&str, u32> = HashMap::new();
      .               ///
      .               /// if let RustcEntry::Vacant(o) = map.rustc_entry("poneyland") {
      .               ///     o.insert(37);
      .               /// }
      .               /// assert_eq!(map["poneyland"], 37);
      .               /// ```
      .               #[cfg_attr(feature = "inline-more", inline)]
    530 ( 0.00%)      pub fn insert(self, value: V) -> &'a mut V {
      .                   unsafe {
  3,004 ( 0.00%)              let bucket = self.table.insert_no_grow(self.hash, (self.key, value));
    244 ( 0.00%)              &mut bucket.as_mut().1
      .                   }
    730 ( 0.00%)      }
      .           
      .               /// Sets the value of the entry with the RustcVacantEntry's key,
      .               /// and returns a RustcOccupiedEntry.
      .               ///
      .               /// # Examples
      .               ///
      .               /// ```
      .               /// use hashbrown::HashMap;
-- line 589 ----------------------------------------

 40,363 ( 0.03%)  <counts for unidentified lines in /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/rustc_entry.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs
--------------------------------------------------------------------------------
Ir               

-- line 23 ----------------------------------------
      .           use std::cmp::Ordering;
      .           use std::marker::PhantomData;
      .           use std::ops::Range;
      .           use ty::util::IntTypeExt;
      .           
      .           #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)]
      .           #[derive(HashStable, TypeFoldable, Lift)]
      .           pub struct TypeAndMut<'tcx> {
     13 ( 0.00%)      pub ty: Ty<'tcx>,
     65 ( 0.00%)      pub mutbl: hir::Mutability,
      .           }
      .           
      .           #[derive(Clone, PartialEq, PartialOrd, Eq, Ord, Hash, TyEncodable, TyDecodable, Copy)]
      .           #[derive(HashStable)]
      .           /// A "free" region `fr` can be interpreted as "some region
      .           /// at least as big as the scope `fr.scope`".
      .           pub struct FreeRegion {
    431 ( 0.00%)      pub scope: DefId,
    963 ( 0.00%)      pub bound_region: BoundRegionKind,
      .           }
      .           
  6,230 ( 0.01%)  #[derive(Clone, PartialEq, PartialOrd, Eq, Ord, Hash, TyEncodable, TyDecodable, Copy)]
      .           #[derive(HashStable)]
      .           pub enum BoundRegionKind {
      .               /// An anonymous region parameter for a given fn (&T)
    414 ( 0.00%)      BrAnon(u32),
      .           
      .               /// Named region parameters for functions (a in &'a T)
      .               ///
      .               /// The `DefId` is needed to distinguish free regions in
      .               /// the event of shadowing.
     32 ( 0.00%)      BrNamed(DefId, Symbol),
      .           
      .               /// Anonymous region for the implicit env pointer parameter
      .               /// to a closure
      .               BrEnv,
      .           }
      .           
     30 ( 0.00%)  #[derive(Copy, Clone, PartialEq, Eq, Hash, TyEncodable, TyDecodable, Debug, PartialOrd, Ord)]
      .           #[derive(HashStable)]
      .           pub struct BoundRegion {
  1,122 ( 0.00%)      pub var: BoundVar,
    878 ( 0.00%)      pub kind: BoundRegionKind,
      .           }
      .           
      .           impl BoundRegionKind {
      .               pub fn is_named(&self) -> bool {
      .                   match *self {
      .                       BoundRegionKind::BrNamed(_, name) => name != kw::UnderscoreLifetime,
      .                       _ => false,
      .                   }
      .               }
      .           }
      .           
      .           /// Defines the kinds of types.
      .           ///
      .           /// N.B., if you change this, you'll probably want to change the corresponding
      .           /// AST structure in `rustc_ast/src/ast.rs` as well.
285,040 ( 0.23%)  #[derive(Clone, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable, Debug)]
      .           #[derive(HashStable)]
      .           #[rustc_diagnostic_item = "TyKind"]
      .           pub enum TyKind<'tcx> {
      .               /// The primitive boolean type. Written as `bool`.
      .               Bool,
      .           
      .               /// The primitive character type; holds a Unicode scalar value
      .               /// (a non-surrogate code point). Written as `char`.
-- line 89 ----------------------------------------
-- line 99 ----------------------------------------
      .               Float(ty::FloatTy),
      .           
      .               /// Algebraic data types (ADT). For example: structures, enumerations and unions.
      .               ///
      .               /// InternalSubsts here, possibly against intuition, *may* contain `Param`s.
      .               /// That is, even after substitution it is possible that there are type
      .               /// variables. This happens when the `Adt` corresponds to an ADT
      .               /// definition and not a concrete use of it.
 31,071 ( 0.03%)      Adt(&'tcx AdtDef, SubstsRef<'tcx>),
      .           
      .               /// An unsized FFI type that is opaque to Rust. Written as `extern type T`.
      .               Foreign(DefId),
      .           
      .               /// The pointee of a string slice. Written as `str`.
      .               Str,
      .           
      .               /// An array with the given length. Written as `[T; n]`.
    971 ( 0.00%)      Array(Ty<'tcx>, &'tcx ty::Const<'tcx>),
      .           
      .               /// The pointee of an array slice. Written as `[T]`.
      .               Slice(Ty<'tcx>),
      .           
      .               /// A raw pointer. Written as `*mut T` or `*const T`
      .               RawPtr(TypeAndMut<'tcx>),
      .           
      .               /// A reference; a pointer with an associated lifetime. Written as
      .               /// `&'a mut T` or `&'a T`.
 14,724 ( 0.01%)      Ref(Region<'tcx>, Ty<'tcx>, hir::Mutability),
      .           
      .               /// The anonymous type of a function declaration/definition. Each
      .               /// function has a unique type, which is output (for a function
      .               /// named `foo` returning an `i32`) as `fn() -> i32 {foo}`.
      .               ///
      .               /// For example the type of `bar` here:
      .               ///
      .               /// ```rust
-- line 134 ----------------------------------------
-- line 143 ----------------------------------------
      .               ///
      .               /// ```rust
      .               /// fn foo() -> i32 { 1 }
      .               /// let bar: fn() -> i32 = foo;
      .               /// ```
      .               FnPtr(PolyFnSig<'tcx>),
      .           
      .               /// A trait object. Written as `dyn for<'b> Trait<'b, Assoc = u32> + Send + 'a`.
     15 ( 0.00%)      Dynamic(&'tcx List<Binder<'tcx, ExistentialPredicate<'tcx>>>, ty::Region<'tcx>),
      .           
      .               /// The anonymous type of a closure. Used to represent the type of
      .               /// `|a| a`.
      .               Closure(DefId, SubstsRef<'tcx>),
      .           
      .               /// The anonymous type of a generator. Used to represent the type of
      .               /// `|a| yield a`.
      .               Generator(DefId, SubstsRef<'tcx>, hir::Movability),
-- line 159 ----------------------------------------
-- line 180 ----------------------------------------
      .               /// The substitutions are for the generics of the function in question.
      .               /// After typeck, the concrete type can be found in the `types` map.
      .               Opaque(DefId, SubstsRef<'tcx>),
      .           
      .               /// A type parameter; for example, `T` in `fn f<T>(x: T) {}`.
      .               Param(ParamTy),
      .           
      .               /// Bound type variable, used only when preparing a trait query.
     41 ( 0.00%)      Bound(ty::DebruijnIndex, BoundTy),
      .           
      .               /// A placeholder type - universally quantified higher-ranked type.
      .               Placeholder(ty::PlaceholderType),
      .           
      .               /// A type variable used during type checking.
      .               Infer(InferTy),
      .           
      .               /// A placeholder for a type which could not be computed; this is
-- line 196 ----------------------------------------
-- line 760 ----------------------------------------
      .               }
      .           
      .               /// Returns the type of this inline const.
      .               pub fn ty(self) -> Ty<'tcx> {
      .                   self.split().ty.expect_ty()
      .               }
      .           }
      .           
    156 ( 0.00%)  #[derive(Debug, Copy, Clone, PartialEq, PartialOrd, Ord, Eq, Hash, TyEncodable, TyDecodable)]
      .           #[derive(HashStable, TypeFoldable)]
      .           pub enum ExistentialPredicate<'tcx> {
      .               /// E.g., `Iterator`.
      .               Trait(ExistentialTraitRef<'tcx>),
      .               /// E.g., `Iterator::Item = T`.
      .               Projection(ExistentialProjection<'tcx>),
      .               /// E.g., `Send`.
      6 ( 0.00%)      AutoTrait(DefId),
      .           }
      .           
      .           impl<'tcx> ExistentialPredicate<'tcx> {
      .               /// Compares via an ordering that will not change if modules are reordered or other changes are
      .               /// made to the tree. In particular, this ordering is preserved across incremental compilations.
     30 ( 0.00%)      pub fn stable_cmp(&self, tcx: TyCtxt<'tcx>, other: &Self) -> Ordering {
      .                   use self::ExistentialPredicate::*;
     32 ( 0.00%)          match (*self, *other) {
      .                       (Trait(_), Trait(_)) => Ordering::Equal,
      .                       (Projection(ref a), Projection(ref b)) => {
      .                           tcx.def_path_hash(a.item_def_id).cmp(&tcx.def_path_hash(b.item_def_id))
      .                       }
      .                       (AutoTrait(ref a), AutoTrait(ref b)) => {
      .                           tcx.def_path_hash(*a).cmp(&tcx.def_path_hash(*b))
      .                       }
      .                       (Trait(_), _) => Ordering::Less,
      .                       (Projection(_), Trait(_)) => Ordering::Greater,
      .                       (Projection(_), _) => Ordering::Less,
      .                       (AutoTrait(_), _) => Ordering::Greater,
      .                   }
     36 ( 0.00%)      }
      .           }
      .           
      .           impl<'tcx> Binder<'tcx, ExistentialPredicate<'tcx>> {
      .               pub fn with_self_ty(&self, tcx: TyCtxt<'tcx>, self_ty: Ty<'tcx>) -> ty::Predicate<'tcx> {
      .                   use crate::ty::ToPredicate;
      .                   match self.skip_binder() {
      .                       ExistentialPredicate::Trait(tr) => {
      .                           self.rebind(tr).with_self_ty(tcx, self_ty).without_const().to_predicate(tcx)
-- line 805 ----------------------------------------
-- line 840 ----------------------------------------
      .               ///
      .               /// It is also possible to have a "trivial" trait object that
      .               /// consists only of auto traits, with no principal - for example,
      .               /// `dyn Send + Sync`. In that case, the set of auto-trait bounds
      .               /// is `{Send, Sync}`, while there is no principal. These trait objects
      .               /// have a "trivial" vtable consisting of just the size, alignment,
      .               /// and destructor.
      .               pub fn principal(&self) -> Option<ty::Binder<'tcx, ExistentialTraitRef<'tcx>>> {
      6 ( 0.00%)          self[0]
      6 ( 0.00%)              .map_bound(|this| match this {
      .                           ExistentialPredicate::Trait(tr) => Some(tr),
      .                           _ => None,
      .                       })
      .                       .transpose()
      .               }
      .           
      .               pub fn principal_def_id(&self) -> Option<DefId> {
      .                   self.principal().map(|trait_ref| trait_ref.skip_binder().def_id)
-- line 857 ----------------------------------------
-- line 886 ----------------------------------------
      .           ///     T: Foo<U>
      .           ///
      .           /// This would be represented by a trait-reference where the `DefId` is the
      .           /// `DefId` for the trait `Foo` and the substs define `T` as parameter 0,
      .           /// and `U` as parameter 1.
      .           ///
      .           /// Trait references also appear in object types like `Foo<U>`, but in
      .           /// that case the `Self` parameter is absent from the substitutions.
  8,247 ( 0.01%)  #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)]
  7,579 ( 0.01%)  #[derive(HashStable, TypeFoldable)]
      .           pub struct TraitRef<'tcx> {
      .               pub def_id: DefId,
  5,946 ( 0.00%)      pub substs: SubstsRef<'tcx>,
      .           }
      .           
      .           impl<'tcx> TraitRef<'tcx> {
     17 ( 0.00%)      pub fn new(def_id: DefId, substs: SubstsRef<'tcx>) -> TraitRef<'tcx> {
      .                   TraitRef { def_id, substs }
     68 ( 0.00%)      }
      .           
      .               /// Returns a `TraitRef` of the form `P0: Foo<P1..Pn>` where `Pi`
      .               /// are the parameters defined on trait.
     81 ( 0.00%)      pub fn identity(tcx: TyCtxt<'tcx>, def_id: DefId) -> Binder<'tcx, TraitRef<'tcx>> {
     36 ( 0.00%)          ty::Binder::dummy(TraitRef {
      .                       def_id,
     54 ( 0.00%)              substs: InternalSubsts::identity_for_item(tcx, def_id),
      .                   })
     72 ( 0.00%)      }
      .           
      .               #[inline]
      .               pub fn self_ty(&self) -> Ty<'tcx> {
      .                   self.substs.type_at(0)
      .               }
      .           
     40 ( 0.00%)      pub fn from_method(
      .                   tcx: TyCtxt<'tcx>,
      .                   trait_id: DefId,
      .                   substs: SubstsRef<'tcx>,
      .               ) -> ty::TraitRef<'tcx> {
      .                   let defs = tcx.generics_of(trait_id);
      .           
      5 ( 0.00%)          ty::TraitRef { def_id: trait_id, substs: tcx.intern_substs(&substs[..defs.params.len()]) }
     55 ( 0.00%)      }
      .           }
      .           
      .           pub type PolyTraitRef<'tcx> = Binder<'tcx, TraitRef<'tcx>>;
      .           
      .           impl<'tcx> PolyTraitRef<'tcx> {
      .               pub fn self_ty(&self) -> Binder<'tcx, Ty<'tcx>> {
      .                   self.map_bound_ref(|tr| tr.self_ty())
      .               }
      .           
      .               pub fn def_id(&self) -> DefId {
      .                   self.skip_binder().def_id
      .               }
      .           
     15 ( 0.00%)      pub fn to_poly_trait_predicate(&self) -> ty::PolyTraitPredicate<'tcx> {
     30 ( 0.00%)          self.map_bound(|trait_ref| ty::TraitPredicate {
      .                       trait_ref,
      .                       constness: ty::BoundConstness::NotConst,
      .                       polarity: ty::ImplPolarity::Positive,
      .                   })
     15 ( 0.00%)      }
      .           }
      .           
      .           /// An existential reference to a trait, where `Self` is erased.
      .           /// For example, the trait object `Trait<'a, 'b, X, Y>` is:
      .           ///
      .           ///     exists T. T: Trait<'a, 'b, X, Y>
      .           ///
      .           /// The substitutions don't include the erased `Self`, only trait
      .           /// type and lifetime parameters (`[X, Y]` and `['a, 'b]` above).
     24 ( 0.00%)  #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)]
      .           #[derive(HashStable, TypeFoldable)]
      .           pub struct ExistentialTraitRef<'tcx> {
      6 ( 0.00%)      pub def_id: DefId,
     12 ( 0.00%)      pub substs: SubstsRef<'tcx>,
      .           }
      .           
      .           impl<'tcx> ExistentialTraitRef<'tcx> {
      .               pub fn erase_self_ty(
      .                   tcx: TyCtxt<'tcx>,
      .                   trait_ref: ty::TraitRef<'tcx>,
      .               ) -> ty::ExistentialTraitRef<'tcx> {
      .                   // Assert there is a Self.
-- line 970 ----------------------------------------
-- line 999 ----------------------------------------
      .               /// we convert the principal trait-ref into a normal trait-ref,
      .               /// you must give *some* self type. A common choice is `mk_err()`
      .               /// or some placeholder type.
      .               pub fn with_self_ty(&self, tcx: TyCtxt<'tcx>, self_ty: Ty<'tcx>) -> ty::PolyTraitRef<'tcx> {
      .                   self.map_bound(|trait_ref| trait_ref.with_self_ty(tcx, self_ty))
      .               }
      .           }
      .           
  1,633 ( 0.00%)  #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)]
      .           #[derive(HashStable)]
      .           pub enum BoundVariableKind {
      .               Ty(BoundTyKind),
      .               Region(BoundRegionKind),
      .               Const,
      .           }
      .           
      .           /// Binder is a binder for higher-ranked lifetimes or types. It is part of the
-- line 1015 ----------------------------------------
-- line 1016 ----------------------------------------
      .           /// compiler's representation for things like `for<'a> Fn(&'a isize)`
      .           /// (which would be represented by the type `PolyTraitRef ==
      .           /// Binder<'tcx, TraitRef>`). Note that when we instantiate,
      .           /// erase, or otherwise "discharge" these bound vars, we change the
      .           /// type from `Binder<'tcx, T>` to just `T` (see
      .           /// e.g., `liberate_late_bound_regions`).
      .           ///
      .           /// `Decodable` and `Encodable` are implemented for `Binder<T>` using the `impl_binder_encode_decode!` macro.
     68 ( 0.00%)  #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)]
  6,055 ( 0.00%)  pub struct Binder<'tcx, T>(T, &'tcx List<BoundVariableKind>);
      .           
      .           impl<'tcx, T> Binder<'tcx, T>
      .           where
      .               T: TypeFoldable<'tcx>,
      .           {
      .               /// Wraps `value` in a binder, asserting that `value` does not
      .               /// contain any bound vars that would be bound by the
      .               /// binder. This is commonly used to 'inject' a value T into a
      .               /// different binding level.
    495 ( 0.00%)      pub fn dummy(value: T) -> Binder<'tcx, T> {
  2,418 ( 0.00%)          assert!(!value.has_escaping_bound_vars());
  5,199 ( 0.00%)          Binder(value, ty::List::empty())
    495 ( 0.00%)      }
      .           
      .               pub fn bind_with_vars(value: T, vars: &'tcx List<BoundVariableKind>) -> Binder<'tcx, T> {
      .                   if cfg!(debug_assertions) {
      .                       let mut validator = ValidateBoundVars::new(vars);
      .                       value.visit_with(&mut validator);
      .                   }
    657 ( 0.00%)          Binder(value, vars)
      .               }
      .           }
      .           
      .           impl<'tcx, T> Binder<'tcx, T> {
      .               /// Skips the binder and returns the "bound" value. This is a
      .               /// risky thing to do because it's easy to get confused about
      .               /// De Bruijn indices and the like. It is usually better to
      .               /// discharge the binder using `no_bound_vars` or
-- line 1053 ----------------------------------------
-- line 1059 ----------------------------------------
      .               /// accounting.
      .               ///
      .               /// Some examples where `skip_binder` is reasonable:
      .               ///
      .               /// - extracting the `DefId` from a PolyTraitRef;
      .               /// - comparing the self type of a PolyTraitRef to see if it is equal to
      .               ///   a type parameter `X`, since the type `X` does not reference any regions
      .               pub fn skip_binder(self) -> T {
 17,957 ( 0.01%)          self.0
      .               }
      .           
      .               pub fn bound_vars(&self) -> &'tcx List<BoundVariableKind> {
      6 ( 0.00%)          self.1
      .               }
      .           
      .               pub fn as_ref(&self) -> Binder<'tcx, &T> {
     18 ( 0.00%)          Binder(&self.0, self.1)
      .               }
      .           
      .               pub fn map_bound_ref_unchecked<F, U>(&self, f: F) -> Binder<'tcx, U>
      .               where
      .                   F: FnOnce(&T) -> U,
      .               {
      .                   let value = f(&self.0);
      .                   Binder(value, self.1)
-- line 1083 ----------------------------------------
-- line 1089 ----------------------------------------
      .               {
      .                   self.as_ref().map_bound(f)
      .               }
      .           
      .               pub fn map_bound<F, U: TypeFoldable<'tcx>>(self, f: F) -> Binder<'tcx, U>
      .               where
      .                   F: FnOnce(T) -> U,
      .               {
    770 ( 0.00%)          let value = f(self.0);
      .                   if cfg!(debug_assertions) {
      .                       let mut validator = ValidateBoundVars::new(self.1);
      .                       value.visit_with(&mut validator);
      .                   }
  4,247 ( 0.00%)          Binder(value, self.1)
      .               }
      .           
      .               pub fn try_map_bound<F, U: TypeFoldable<'tcx>, E>(self, f: F) -> Result<Binder<'tcx, U>, E>
      .               where
      .                   F: FnOnce(T) -> Result<U, E>,
      .               {
      .                   let value = f(self.0)?;
      .                   if cfg!(debug_assertions) {
      .                       let mut validator = ValidateBoundVars::new(self.1);
      .                       value.visit_with(&mut validator);
      .                   }
     70 ( 0.00%)          Ok(Binder(value, self.1))
      .               }
      .           
      .               /// Wraps a `value` in a binder, using the same bound variables as the
      .               /// current `Binder`. This should not be used if the new value *changes*
      .               /// the bound variables. Note: the (old or new) value itself does not
      .               /// necessarily need to *name* all the bound variables.
      .               ///
      .               /// This currently doesn't do anything different than `bind`, because we
-- line 1122 ----------------------------------------
-- line 1126 ----------------------------------------
      .               pub fn rebind<U>(&self, value: U) -> Binder<'tcx, U>
      .               where
      .                   U: TypeFoldable<'tcx>,
      .               {
      .                   if cfg!(debug_assertions) {
      .                       let mut validator = ValidateBoundVars::new(self.bound_vars());
      .                       value.visit_with(&mut validator);
      .                   }
    139 ( 0.00%)          Binder(value, self.1)
      .               }
      .           
      .               /// Unwraps and returns the value within, but only if it contains
      .               /// no bound vars at all. (In other words, if this binder --
      .               /// and indeed any enclosing binder -- doesn't bind anything at
      .               /// all.) Otherwise, returns `None`.
      .               ///
      .               /// (One could imagine having a method that just unwraps a single
-- line 1142 ----------------------------------------
-- line 1143 ----------------------------------------
      .               /// binder, but permits late-bound vars bound by enclosing
      .               /// binders, but that would require adjusting the debruijn
      .               /// indices, and given the shallow binding structure we often use,
      .               /// would not be that useful.)
      .               pub fn no_bound_vars(self) -> Option<T>
      .               where
      .                   T: TypeFoldable<'tcx>,
      .               {
  2,635 ( 0.00%)          if self.0.has_escaping_bound_vars() { None } else { Some(self.skip_binder()) }
      .               }
      .           
      .               /// Splits the contents into two things that share the same binder
      .               /// level as the original, returning two distinct binders.
      .               ///
      .               /// `f` should consider bound regions at depth 1 to be free, and
      .               /// anything it produces with bound regions at depth 1 will be
      .               /// bound in the resulting return values.
-- line 1159 ----------------------------------------
-- line 1170 ----------------------------------------
      .               pub fn transpose(self) -> Option<Binder<'tcx, T>> {
      .                   let bound_vars = self.1;
      .                   self.0.map(|v| Binder(v, bound_vars))
      .               }
      .           }
      .           
      .           /// Represents the projection of an associated type. In explicit UFCS
      .           /// form this would be written `<T as Trait<..>>::N`.
     13 ( 0.00%)  #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)]
    194 ( 0.00%)  #[derive(HashStable, TypeFoldable)]
      .           pub struct ProjectionTy<'tcx> {
      .               /// The parameters of the associated item.
     73 ( 0.00%)      pub substs: SubstsRef<'tcx>,
      .           
      .               /// The `DefId` of the `TraitItem` for the associated type `N`.
      .               ///
      .               /// Note that this is not the `DefId` of the `TraitRef` containing this
      .               /// associated type, which is in `tcx.associated_item(item_def_id).container`.
     59 ( 0.00%)      pub item_def_id: DefId,
      .           }
      .           
      .           impl<'tcx> ProjectionTy<'tcx> {
     70 ( 0.00%)      pub fn trait_def_id(&self, tcx: TyCtxt<'tcx>) -> DefId {
     20 ( 0.00%)          tcx.associated_item(self.item_def_id).container.id()
     80 ( 0.00%)      }
      .           
      .               /// Extracts the underlying trait reference and own substs from this projection.
      .               /// For example, if this is a projection of `<T as StreamingIterator>::Item<'a>`,
      .               /// then this function would return a `T: Iterator` trait reference and `['a]` as the own substs
      .               pub fn trait_ref_and_own_substs(
      .                   &self,
      .                   tcx: TyCtxt<'tcx>,
      .               ) -> (ty::TraitRef<'tcx>, &'tcx [ty::GenericArg<'tcx>]) {
-- line 1202 ----------------------------------------
-- line 1210 ----------------------------------------
      .           
      .               /// Extracts the underlying trait reference from this projection.
      .               /// For example, if this is a projection of `<T as Iterator>::Item`,
      .               /// then this function would return a `T: Iterator` trait reference.
      .               ///
      .               /// WARNING: This will drop the substs for generic associated types
      .               /// consider calling [Self::trait_ref_and_own_substs] to get those
      .               /// as well.
     90 ( 0.00%)      pub fn trait_ref(&self, tcx: TyCtxt<'tcx>) -> ty::TraitRef<'tcx> {
     10 ( 0.00%)          let def_id = self.trait_def_id(tcx);
     10 ( 0.00%)          ty::TraitRef { def_id, substs: self.substs.truncate_to(tcx, tcx.generics_of(def_id)) }
    110 ( 0.00%)      }
      .           
     20 ( 0.00%)      pub fn self_ty(&self) -> Ty<'tcx> {
     60 ( 0.00%)          self.substs.type_at(0)
     40 ( 0.00%)      }
      .           }
      .           
      .           #[derive(Copy, Clone, Debug, TypeFoldable)]
      .           pub struct GenSig<'tcx> {
      .               pub resume_ty: Ty<'tcx>,
      .               pub yield_ty: Ty<'tcx>,
      .               pub return_ty: Ty<'tcx>,
      .           }
-- line 1233 ----------------------------------------
-- line 1235 ----------------------------------------
      .           pub type PolyGenSig<'tcx> = Binder<'tcx, GenSig<'tcx>>;
      .           
      .           /// Signature of a function type, which we have arbitrarily
      .           /// decided to use to refer to the input/output types.
      .           ///
      .           /// - `inputs`: is the list of arguments and their modes.
      .           /// - `output`: is the return type.
      .           /// - `c_variadic`: indicates whether this is a C-variadic function.
  1,727 ( 0.00%)  #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)]
    503 ( 0.00%)  #[derive(HashStable, TypeFoldable)]
      .           pub struct FnSig<'tcx> {
     43 ( 0.00%)      pub inputs_and_output: &'tcx List<Ty<'tcx>>,
    523 ( 0.00%)      pub c_variadic: bool,
     79 ( 0.00%)      pub unsafety: hir::Unsafety,
    781 ( 0.00%)      pub abi: abi::Abi,
      .           }
      .           
      .           impl<'tcx> FnSig<'tcx> {
    560 ( 0.00%)      pub fn inputs(&self) -> &'tcx [Ty<'tcx>] {
  2,846 ( 0.00%)          &self.inputs_and_output[..self.inputs_and_output.len() - 1]
  1,120 ( 0.00%)      }
      .           
    366 ( 0.00%)      pub fn output(&self) -> Ty<'tcx> {
  2,940 ( 0.00%)          self.inputs_and_output[self.inputs_and_output.len() - 1]
    732 ( 0.00%)      }
      .           
      .               // Creates a minimal `FnSig` to be used when encountering a `TyKind::Error` in a fallible
      .               // method.
      .               fn fake() -> FnSig<'tcx> {
      .                   FnSig {
      .                       inputs_and_output: List::empty(),
      .                       c_variadic: false,
      .                       unsafety: hir::Unsafety::Normal,
-- line 1267 ----------------------------------------
-- line 1270 ----------------------------------------
      .               }
      .           }
      .           
      .           pub type PolyFnSig<'tcx> = Binder<'tcx, FnSig<'tcx>>;
      .           
      .           impl<'tcx> PolyFnSig<'tcx> {
      .               #[inline]
      .               pub fn inputs(&self) -> Binder<'tcx, &'tcx [Ty<'tcx>]> {
     76 ( 0.00%)          self.map_bound_ref_unchecked(|fn_sig| fn_sig.inputs())
      .               }
      .               #[inline]
      .               pub fn input(&self, index: usize) -> ty::Binder<'tcx, Ty<'tcx>> {
    203 ( 0.00%)          self.map_bound_ref(|fn_sig| fn_sig.inputs()[index])
      .               }
      .               pub fn inputs_and_output(&self) -> ty::Binder<'tcx, &'tcx List<Ty<'tcx>>> {
      .                   self.map_bound_ref(|fn_sig| fn_sig.inputs_and_output)
     14 ( 0.00%)      }
      .               #[inline]
      .               pub fn output(&self) -> ty::Binder<'tcx, Ty<'tcx>> {
    158 ( 0.00%)          self.map_bound_ref(|fn_sig| fn_sig.output())
      .               }
      .               pub fn c_variadic(&self) -> bool {
     28 ( 0.00%)          self.skip_binder().c_variadic
     14 ( 0.00%)      }
      .               pub fn unsafety(&self) -> hir::Unsafety {
    114 ( 0.00%)          self.skip_binder().unsafety
     57 ( 0.00%)      }
      .               pub fn abi(&self) -> abi::Abi {
    256 ( 0.00%)          self.skip_binder().abi
     64 ( 0.00%)      }
      .           }
      .           
      .           pub type CanonicalPolyFnSig<'tcx> = Canonical<'tcx, Binder<'tcx, FnSig<'tcx>>>;
      .           
      .           #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)]
      .           #[derive(HashStable)]
      .           pub struct ParamTy {
      .               pub index: u32,
-- line 1307 ----------------------------------------
-- line 1321 ----------------------------------------
      .               pub fn to_ty(self, tcx: TyCtxt<'tcx>) -> Ty<'tcx> {
      .                   tcx.mk_ty_param(self.index, self.name)
      .               }
      .           }
      .           
      .           #[derive(Copy, Clone, Hash, TyEncodable, TyDecodable, Eq, PartialEq, Ord, PartialOrd)]
      .           #[derive(HashStable)]
      .           pub struct ParamConst {
     38 ( 0.00%)      pub index: u32,
     38 ( 0.00%)      pub name: Symbol,
      .           }
      .           
      .           impl ParamConst {
      .               pub fn new(index: u32, name: Symbol) -> ParamConst {
      .                   ParamConst { index, name }
      .               }
      .           
      .               pub fn for_def(def: &ty::GenericParamDef) -> ParamConst {
-- line 1338 ----------------------------------------
-- line 1440 ----------------------------------------
      .           /// the inference variable is supposed to satisfy the relation
      .           /// *for every value of the placeholder region*. To ensure that doesn't
      .           /// happen, you can use `leak_check`. This is more clearly explained
      .           /// by the [rustc dev guide].
      .           ///
      .           /// [1]: https://smallcultfollowing.com/babysteps/blog/2013/10/29/intermingled-parameter-lists/
      .           /// [2]: https://smallcultfollowing.com/babysteps/blog/2013/11/04/intermingled-parameter-lists/
      .           /// [rustc dev guide]: https://rustc-dev-guide.rust-lang.org/traits/hrtb.html
 76,348 ( 0.06%)  #[derive(Clone, PartialEq, Eq, Hash, Copy, TyEncodable, TyDecodable, PartialOrd, Ord)]
     16 ( 0.00%)  pub enum RegionKind {
      .               /// Region bound in a type or fn declaration which will be
      .               /// substituted 'early' -- that is, at the same time when type
      .               /// parameters are substituted.
      .               ReEarlyBound(EarlyBoundRegion),
      .           
      .               /// Region bound in a function scope, which will be substituted when the
      .               /// function is called.
  1,756 ( 0.00%)      ReLateBound(ty::DebruijnIndex, BoundRegion),
      .           
      .               /// When checking a function body, the types of all arguments and so forth
      .               /// that refer to bound region parameters are modified to refer to free
      .               /// region parameters.
      .               ReFree(FreeRegion),
      .           
      .               /// Static data that has an "infinite" lifetime. Top in the region lattice.
      .               ReStatic,
-- line 1465 ----------------------------------------
-- line 1478 ----------------------------------------
      .               /// regions visible from `U`, but not less than regions not visible
      .               /// from `U`.
      .               ReEmpty(ty::UniverseIndex),
      .           
      .               /// Erased region, used by trait selection, in MIR and during codegen.
      .               ReErased,
      .           }
      .           
  6,810 ( 0.01%)  #[derive(Copy, Clone, PartialEq, Eq, Hash, TyEncodable, TyDecodable, Debug, PartialOrd, Ord)]
      .           pub struct EarlyBoundRegion {
      4 ( 0.00%)      pub def_id: DefId,
  2,736 ( 0.00%)      pub index: u32,
  2,324 ( 0.00%)      pub name: Symbol,
      .           }
      .           
      .           /// A **`const`** **v**ariable **ID**.
      .           #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)]
      .           pub struct ConstVid<'tcx> {
     36 ( 0.00%)      pub index: u32,
      .               pub phantom: PhantomData<&'tcx ()>,
      .           }
      .           
      .           rustc_index::newtype_index! {
      .               /// A **region** (lifetime) **v**ariable **ID**.
      .               pub struct RegionVid {
      .                   DEBUG_FORMAT = custom,
      .               }
-- line 1504 ----------------------------------------
-- line 1513 ----------------------------------------
      .           rustc_index::newtype_index! {
      .               pub struct BoundVar { .. }
      .           }
      .           
      .           #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)]
      .           #[derive(HashStable)]
      .           pub struct BoundTy {
      .               pub var: BoundVar,
     41 ( 0.00%)      pub kind: BoundTyKind,
      .           }
      .           
    712 ( 0.00%)  #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)]
      .           #[derive(HashStable)]
      .           pub enum BoundTyKind {
      .               Anon,
      .               Param(Symbol),
      .           }
      .           
      .           impl From<BoundVar> for BoundTy {
      .               fn from(var: BoundVar) -> Self {
-- line 1532 ----------------------------------------
-- line 1616 ----------------------------------------
      .                       RegionKind::RePlaceholder(placeholder) => placeholder.name.is_named(),
      .                       RegionKind::ReEmpty(_) => false,
      .                       RegionKind::ReErased => false,
      .                   }
      .               }
      .           
      .               #[inline]
      .               pub fn is_late_bound(&self) -> bool {
     36 ( 0.00%)          matches!(*self, ty::ReLateBound(..))
      .               }
      .           
      .               #[inline]
      .               pub fn is_placeholder(&self) -> bool {
      .                   matches!(*self, ty::RePlaceholder(..))
      .               }
      .           
      .               #[inline]
      .               pub fn bound_at_or_above_binder(&self, index: ty::DebruijnIndex) -> bool {
  1,733 ( 0.00%)          match *self {
      .                       ty::ReLateBound(debruijn, _) => debruijn >= index,
      .                       _ => false,
      .                   }
      .               }
      .           
      .               pub fn type_flags(&self) -> TypeFlags {
      .                   let mut flags = TypeFlags::empty();
      .           
  6,286 ( 0.01%)          match *self {
      .                       ty::ReVar(..) => {
      .                           flags = flags | TypeFlags::HAS_FREE_REGIONS;
      .                           flags = flags | TypeFlags::HAS_FREE_LOCAL_REGIONS;
      .                           flags = flags | TypeFlags::HAS_RE_INFER;
      .                       }
      .                       ty::RePlaceholder(..) => {
      .                           flags = flags | TypeFlags::HAS_FREE_REGIONS;
      .                           flags = flags | TypeFlags::HAS_FREE_LOCAL_REGIONS;
-- line 1651 ----------------------------------------
-- line 1669 ----------------------------------------
      .                       ty::ReErased => {
      .                           flags = flags | TypeFlags::HAS_RE_ERASED;
      .                       }
      .                   }
      .           
      .                   debug!("type_flags({:?}) = {:?}", self, flags);
      .           
      .                   flags
    100 ( 0.00%)      }
      .           
      .               /// Given an early-bound or free region, returns the `DefId` where it was bound.
      .               /// For example, consider the regions in this snippet of code:
      .               ///
      .               /// ```
      .               /// impl<'a> Foo {
      .               ///      ^^ -- early bound, declared on an impl
      .               ///
-- line 1685 ----------------------------------------
-- line 1713 ----------------------------------------
      .           
      .               #[inline(always)]
      .               pub fn flags(&self) -> TypeFlags {
      .                   self.flags
      .               }
      .           
      .               #[inline]
      .               pub fn is_unit(&self) -> bool {
     88 ( 0.00%)          match self.kind() {
     22 ( 0.00%)              Tuple(ref tys) => tys.is_empty(),
      .                       _ => false,
      .                   }
      .               }
      .           
      .               #[inline]
      .               pub fn is_never(&self) -> bool {
    855 ( 0.00%)          matches!(self.kind(), Never)
      .               }
      .           
      .               #[inline]
      .               pub fn is_primitive(&self) -> bool {
      .                   self.kind().is_primitive()
      .               }
      .           
      .               #[inline]
-- line 1737 ----------------------------------------
-- line 1741 ----------------------------------------
      .           
      .               #[inline]
      .               pub fn is_ref(&self) -> bool {
      .                   matches!(self.kind(), Ref(..))
      .               }
      .           
      .               #[inline]
      .               pub fn is_ty_var(&self) -> bool {
  1,155 ( 0.00%)          matches!(self.kind(), Infer(TyVar(_)))
      .               }
      .           
      .               #[inline]
      .               pub fn ty_vid(&self) -> Option<ty::TyVid> {
    508 ( 0.00%)          match self.kind() {
     60 ( 0.00%)              &Infer(TyVar(vid)) => Some(vid),
      .                       _ => None,
      .                   }
      .               }
      .           
      .               #[inline]
      .               pub fn is_ty_infer(&self) -> bool {
      .                   matches!(self.kind(), Infer(_))
      .               }
      .           
      .               #[inline]
      .               pub fn is_phantom_data(&self) -> bool {
      3 ( 0.00%)          if let Adt(def, _) = self.kind() { def.is_phantom_data() } else { false }
      .               }
      .           
      .               #[inline]
      .               pub fn is_bool(&self) -> bool {
      .                   *self.kind() == Bool
      .               }
      .           
      .               /// Returns `true` if this type is a `str`.
-- line 1775 ----------------------------------------
-- line 1791 ----------------------------------------
      .                   match self.kind() {
      .                       RawPtr(TypeAndMut { ty, .. }) | Ref(_, ty, _) => matches!(ty.kind(), Slice(_) | Str),
      .                       _ => false,
      .                   }
      .               }
      .           
      .               #[inline]
      .               pub fn is_array(&self) -> bool {
      2 ( 0.00%)          matches!(self.kind(), Array(..))
      .               }
      .           
      .               #[inline]
      .               pub fn is_simd(&self) -> bool {
      .                   match self.kind() {
      .                       Adt(def, _) => def.repr.simd(),
      .                       _ => false,
      .                   }
      .               }
      .           
     12 ( 0.00%)      pub fn sequence_element_type(&self, tcx: TyCtxt<'tcx>) -> Ty<'tcx> {
     24 ( 0.00%)          match self.kind() {
      .                       Array(ty, _) | Slice(ty) => ty,
      .                       Str => tcx.mk_mach_uint(ty::UintTy::U8),
      .                       _ => bug!("`sequence_element_type` called on non-sequence value: {}", self),
      .                   }
     12 ( 0.00%)      }
      .           
      .               pub fn simd_size_and_type(&self, tcx: TyCtxt<'tcx>) -> (u64, Ty<'tcx>) {
      .                   match self.kind() {
      .                       Adt(def, substs) => {
      .                           assert!(def.repr.simd(), "`simd_size_and_type` called on non-SIMD type");
      .                           let variant = def.non_enum_variant();
      .                           let f0_ty = variant.fields[0].ty(tcx, substs);
      .           
-- line 1824 ----------------------------------------
-- line 1861 ----------------------------------------
      .                   match self.kind() {
      .                       Ref(_, _, mutability) => Some(*mutability),
      .                       _ => None,
      .                   }
      .               }
      .           
      .               #[inline]
      .               pub fn is_unsafe_ptr(&self) -> bool {
     40 ( 0.00%)          matches!(self.kind(), RawPtr(_))
      .               }
      .           
      .               /// Tests if this is any kind of primitive pointer type (reference, raw pointer, fn pointer).
      .               #[inline]
      .               pub fn is_any_ptr(&self) -> bool {
      .                   self.is_region_ptr() || self.is_unsafe_ptr() || self.is_fn_ptr()
      .               }
      .           
      .               #[inline]
      .               pub fn is_box(&self) -> bool {
    834 ( 0.00%)          match self.kind() {
    163 ( 0.00%)              Adt(def, _) => def.is_box(),
      .                       _ => false,
      .                   }
      .               }
      .           
      .               /// Panics if called on any type other than `Box<T>`.
      .               pub fn boxed_ty(&self) -> Ty<'tcx> {
      .                   match self.kind() {
      .                       Adt(def, substs) if def.is_box() => substs.type_at(0),
-- line 1889 ----------------------------------------
-- line 1891 ----------------------------------------
      .                   }
      .               }
      .           
      .               /// A scalar type is one that denotes an atomic datum, with no sub-components.
      .               /// (A RawPtr is scalar because it represents a non-managed pointer, so its
      .               /// contents are abstract to rustc.)
      .               #[inline]
      .               pub fn is_scalar(&self) -> bool {
      7 ( 0.00%)          matches!(
     17 ( 0.00%)              self.kind(),
      .                       Bool | Char
      .                           | Int(_)
      .                           | Float(_)
      .                           | Uint(_)
      .                           | FnDef(..)
      .                           | FnPtr(_)
      .                           | RawPtr(_)
      .                           | Infer(IntVar(_) | FloatVar(_))
-- line 1908 ----------------------------------------
-- line 1922 ----------------------------------------
      .           
      .               #[inline]
      .               pub fn is_enum(&self) -> bool {
      .                   matches!(self.kind(), Adt(adt_def, _) if adt_def.is_enum())
      .               }
      .           
      .               #[inline]
      .               pub fn is_union(&self) -> bool {
    102 ( 0.00%)          matches!(self.kind(), Adt(adt_def, _) if adt_def.is_union())
      .               }
      .           
      .               #[inline]
      .               pub fn is_closure(&self) -> bool {
     38 ( 0.00%)          matches!(self.kind(), Closure(..))
      .               }
      .           
      .               #[inline]
      .               pub fn is_generator(&self) -> bool {
     57 ( 0.00%)          matches!(self.kind(), Generator(..))
      .               }
      .           
      .               #[inline]
      .               pub fn is_integral(&self) -> bool {
    121 ( 0.00%)          matches!(self.kind(), Infer(IntVar(_)) | Int(_) | Uint(_))
      .               }
      .           
      .               #[inline]
      .               pub fn is_fresh_ty(&self) -> bool {
      .                   matches!(self.kind(), Infer(FreshTy(_)))
      .               }
      .           
      .               #[inline]
      .               pub fn is_fresh(&self) -> bool {
     96 ( 0.00%)          matches!(self.kind(), Infer(FreshTy(_) | FreshIntTy(_) | FreshFloatTy(_)))
      .               }
      .           
      .               #[inline]
      .               pub fn is_char(&self) -> bool {
      .                   matches!(self.kind(), Char)
      .               }
      .           
      .               #[inline]
-- line 1963 ----------------------------------------
-- line 1967 ----------------------------------------
      .           
      .               #[inline]
      .               pub fn is_signed(&self) -> bool {
      .                   matches!(self.kind(), Int(_))
      .               }
      .           
      .               #[inline]
      .               pub fn is_ptr_sized_integral(&self) -> bool {
     30 ( 0.00%)          matches!(self.kind(), Int(ty::IntTy::Isize) | Uint(ty::UintTy::Usize))
      .               }
      .           
      .               #[inline]
      .               pub fn has_concrete_skeleton(&self) -> bool {
      .                   !matches!(self.kind(), Param(_) | Infer(_) | Error(_))
      .               }
      .           
      .               /// Returns the type and mutability of `*ty`.
      .               ///
      .               /// The parameter `explicit` indicates if this is an *explicit* dereference.
      .               /// Some types -- notably unsafe ptrs -- can only be dereferenced explicitly.
    169 ( 0.00%)      pub fn builtin_deref(&self, explicit: bool) -> Option<TypeAndMut<'tcx>> {
  1,087 ( 0.00%)          match self.kind() {
     32 ( 0.00%)              Adt(def, _) if def.is_box() => {
      .                           Some(TypeAndMut { ty: self.boxed_ty(), mutbl: hir::Mutability::Not })
      .                       }
    650 ( 0.00%)              Ref(_, ty, mutbl) => Some(TypeAndMut { ty, mutbl: *mutbl }),
      .                       RawPtr(mt) if explicit => Some(*mt),
      .                       _ => None,
      .                   }
    338 ( 0.00%)      }
      .           
      .               /// Returns the type of `ty[i]`.
      .               pub fn builtin_index(&self) -> Option<Ty<'tcx>> {
      .                   match self.kind() {
      .                       Array(ty, _) | Slice(ty) => Some(ty),
      .                       _ => None,
      .                   }
      .               }
      .           
  1,200 ( 0.00%)      pub fn fn_sig(&self, tcx: TyCtxt<'tcx>) -> PolyFnSig<'tcx> {
    600 ( 0.00%)          match self.kind() {
    450 ( 0.00%)              FnDef(def_id, substs) => tcx.fn_sig(*def_id).subst(tcx, substs),
      .                       FnPtr(f) => *f,
      .                       Error(_) => {
      .                           // ignore errors (#54954)
      .                           ty::Binder::dummy(FnSig::fake())
      .                       }
      .                       Closure(..) => bug!(
      .                           "to get the signature of a closure, use `substs.as_closure().sig()` not `fn_sig()`",
      .                       ),
      .                       _ => bug!("Ty::fn_sig() called on non-fn type: {:?}", self),
      .                   }
  1,350 ( 0.00%)      }
      .           
      .               #[inline]
      .               pub fn is_fn(&self) -> bool {
     15 ( 0.00%)          matches!(self.kind(), FnDef(..) | FnPtr(_))
      .               }
      .           
      .               #[inline]
      .               pub fn is_fn_ptr(&self) -> bool {
      .                   matches!(self.kind(), FnPtr(_))
      .               }
      .           
      .               #[inline]
      .               pub fn is_impl_trait(&self) -> bool {
      .                   matches!(self.kind(), Opaque(..))
      .               }
      .           
      .               #[inline]
      .               pub fn ty_adt_def(&self) -> Option<&'tcx AdtDef> {
  1,306 ( 0.00%)          match self.kind() {
      .                       Adt(adt, _) => Some(adt),
      .                       _ => None,
      .                   }
      .               }
      .           
      .               /// Iterates over tuple fields.
      .               /// Panics when called on anything but a tuple.
      1 ( 0.00%)      pub fn tuple_fields(&self) -> impl DoubleEndedIterator<Item = Ty<'tcx>> {
     26 ( 0.00%)          match self.kind() {
     13 ( 0.00%)              Tuple(substs) => substs.iter().map(|field| field.expect_ty()),
      .                       _ => bug!("tuple_fields called on non-tuple"),
      .                   }
      2 ( 0.00%)      }
      .           
      .               /// Get the `i`-th element of a tuple.
      .               /// Panics when called on anything but a tuple.
      .               pub fn tuple_element_ty(&self, i: usize) -> Option<Ty<'tcx>> {
      .                   match self.kind() {
      .                       Tuple(substs) => substs.iter().nth(i).map(|field| field.expect_ty()),
      .                       _ => bug!("tuple_fields called on non-tuple"),
      .                   }
-- line 2059 ----------------------------------------
-- line 2095 ----------------------------------------
      .                       TyKind::Generator(def_id, substs, _) => {
      .                           Some(substs.as_generator().discriminant_for_variant(*def_id, tcx, variant_index))
      .                       }
      .                       _ => None,
      .                   }
      .               }
      .           
      .               /// Returns the type of the discriminant of this type.
     60 ( 0.00%)      pub fn discriminant_ty(&'tcx self, tcx: TyCtxt<'tcx>) -> Ty<'tcx> {
     30 ( 0.00%)          match self.kind() {
     48 ( 0.00%)              ty::Adt(adt, _) if adt.is_enum() => adt.repr.discr_type().to_ty(tcx),
      .                       ty::Generator(_, substs, _) => substs.as_generator().discr_ty(tcx),
      .           
      .                       ty::Param(_) | ty::Projection(_) | ty::Opaque(..) | ty::Infer(ty::TyVar(_)) => {
      .                           let assoc_items = tcx.associated_item_def_ids(
      .                               tcx.require_lang_item(hir::LangItem::DiscriminantKind, None),
      .                           );
      .                           tcx.mk_projection(assoc_items[0], tcx.intern_substs(&[self.into()]))
      .                       }
-- line 2113 ----------------------------------------
-- line 2135 ----------------------------------------
      .                       | ty::Infer(IntVar(_) | FloatVar(_)) => tcx.types.u8,
      .           
      .                       ty::Bound(..)
      .                       | ty::Placeholder(_)
      .                       | ty::Infer(FreshTy(_) | ty::FreshIntTy(_) | ty::FreshFloatTy(_)) => {
      .                           bug!("`discriminant_ty` applied to unexpected type: {:?}", self)
      .                       }
      .                   }
     48 ( 0.00%)      }
      .           
      .               /// Returns the type of metadata for (potentially fat) pointers to this type.
      .               pub fn ptr_metadata_ty(
      .                   &'tcx self,
      .                   tcx: TyCtxt<'tcx>,
      .                   normalize: impl FnMut(Ty<'tcx>) -> Ty<'tcx>,
      .               ) -> Ty<'tcx> {
      .                   let tail = tcx.struct_tail_with_normalize(self, normalize);
-- line 2151 ----------------------------------------
-- line 2229 ----------------------------------------
      .               /// Returning true means the type is known to be sized. Returning
      .               /// `false` means nothing -- could be sized, might not be.
      .               ///
      .               /// Note that we could never rely on the fact that a type such as `[_]` is
      .               /// trivially `!Sized` because we could be in a type environment with a
      .               /// bound such as `[_]: Copy`. A function with such a bound obviously never
      .               /// can be called, but that doesn't mean it shouldn't typecheck. This is why
      .               /// this method doesn't return `Option<bool>`.
  3,204 ( 0.00%)      pub fn is_trivially_sized(&self, tcx: TyCtxt<'tcx>) -> bool {
  2,136 ( 0.00%)          match self.kind() {
      .                       ty::Infer(ty::IntVar(_) | ty::FloatVar(_))
      .                       | ty::Uint(_)
      .                       | ty::Int(_)
      .                       | ty::Bool
      .                       | ty::Float(_)
      .                       | ty::FnDef(..)
      .                       | ty::FnPtr(_)
      .                       | ty::RawPtr(..)
-- line 2246 ----------------------------------------
-- line 2250 ----------------------------------------
      .                       | ty::GeneratorWitness(..)
      .                       | ty::Array(..)
      .                       | ty::Closure(..)
      .                       | ty::Never
      .                       | ty::Error(_) => true,
      .           
      .                       ty::Str | ty::Slice(_) | ty::Dynamic(..) | ty::Foreign(..) => false,
      .           
     45 ( 0.00%)              ty::Tuple(tys) => tys.iter().all(|ty| ty.expect_ty().is_trivially_sized(tcx)),
      .           
    309 ( 0.00%)              ty::Adt(def, _substs) => def.sized_constraint(tcx).is_empty(),
      .           
      .                       ty::Projection(_) | ty::Param(_) | ty::Opaque(..) => false,
      .           
      .                       ty::Infer(ty::TyVar(_)) => false,
      .           
      .                       ty::Bound(..)
      .                       | ty::Placeholder(..)
      .                       | ty::Infer(ty::FreshTy(_) | ty::FreshIntTy(_) | ty::FreshFloatTy(_)) => {
      .                           bug!("`is_trivially_sized` applied to unexpected type: {:?}", self)
      .                       }
      .                   }
  3,204 ( 0.00%)      }
      .           }
      .           
      .           /// Extra information about why we ended up with a particular variance.
      .           /// This is only used to add more information to error messages, and
      .           /// has no effect on soundness. While choosing the 'wrong' `VarianceDiagInfo`
      .           /// may lead to confusing notes in error messages, it will never cause
      .           /// a miscompilation or unsoundness.
      .           ///
-- line 2280 ----------------------------------------
-- line 2295 ----------------------------------------
      .                   /// (e.g. `0` for `*mut T`, `1` for `MyStruct<'CovariantParam, 'InvariantParam>`)
      .                   param_index: u32,
      .               },
      .           }
      .           
      .           impl<'tcx> VarianceDiagInfo<'tcx> {
      .               /// Mirrors `Variance::xform` - used to 'combine' the existing
      .               /// and new `VarianceDiagInfo`s when our variance changes.
    930 ( 0.00%)      pub fn xform(self, other: VarianceDiagInfo<'tcx>) -> VarianceDiagInfo<'tcx> {
      .                   // For now, just use the first `VarianceDiagInfo::Invariant` that we see
  1,395 ( 0.00%)          match self {
      .                       VarianceDiagInfo::None => other,
      .                       VarianceDiagInfo::Invariant { .. } => self,
      .                   }
    465 ( 0.00%)      }
      .           }

286,381 ( 0.23%)  <counts for unidentified lines in /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_query_system/src/query/plumbing.rs
--------------------------------------------------------------------------------
Ir               

-- line 43 ----------------------------------------
      .               pub(super) key_hash: u64,
      .               shard: usize,
      .           }
      .           
      .           // We compute the key's hash once and then use it for both the
      .           // shard lookup and the hashmap lookup. This relies on the fact
      .           // that both of them use `FxHasher`.
      .           fn hash_for_shard<K: Hash>(key: &K) -> u64 {
     61 ( 0.00%)      let mut hasher = FxHasher::default();
     12 ( 0.00%)      key.hash(&mut hasher);
      .               hasher.finish()
      .           }
      .           
      .           impl<C: QueryCache> QueryCacheStore<C> {
     45 ( 0.00%)      pub(super) fn get_lookup<'tcx>(
      .                   &'tcx self,
      .                   key: &C::Key,
      .               ) -> (QueryLookup, LockGuard<'tcx, C::Sharded>) {
      .                   let key_hash = hash_for_shard(key);
      .                   let shard = get_shard_index_by_hash(key_hash);
      .                   let lock = self.shards.get_shard_by_index(shard).lock();
    164 ( 0.00%)          (QueryLookup { key_hash, shard }, lock)
    123 ( 0.00%)      }
      .           
      .               pub fn iter_results(&self, f: &mut dyn FnMut(&C::Key, &C::Value, DepNodeIndex)) {
      .                   self.cache.iter(&self.shards, f)
      .               }
      .           }
      .           
      .           struct QueryStateShard<D, K> {
      .               active: FxHashMap<K, QueryResult<D>>,
-- line 73 ----------------------------------------
-- line 190 ----------------------------------------
      .               ) -> TryGetJob<'b, CTX::DepKind, K>
      .               where
      .                   CTX: QueryContext,
      .               {
      .                   let shard = lookup.shard;
      .                   let mut state_lock = state.shards.get_shard_by_index(shard).lock();
      .                   let lock = &mut *state_lock;
      .           
 24,287 ( 0.02%)          match lock.active.entry(key) {
      .                       Entry::Vacant(entry) => {
      .                           // Generate an id unique within this shard.
 11,039 ( 0.01%)                  let id = lock.jobs.checked_add(1).unwrap();
 11,039 ( 0.01%)                  lock.jobs = id;
      .                           let id = QueryShardJobId(NonZeroU32::new(id).unwrap());
      .           
      .                           let job = tcx.current_query_job();
      .                           let job = QueryJob::new(id, span, job);
      .           
      .                           let key = entry.key().clone();
      .                           entry.insert(QueryResult::Started(job));
      .           
      .                           let global_id = QueryJobId::new(id, shard, dep_kind);
      .                           let owner = JobOwner { state, id: global_id, key };
    156 ( 0.00%)                  return TryGetJob::NotYetStarted(owner);
      .                       }
      .                       Entry::Occupied(mut entry) => {
      .                           match entry.get_mut() {
      .                               #[cfg(not(parallel_compiler))]
      .                               QueryResult::Started(job) => {
      .                                   let id = QueryJobId::new(job.id, shard, dep_kind);
      .           
      .                                   drop(state_lock);
-- line 221 ----------------------------------------
-- line 262 ----------------------------------------
      .                   cache: &QueryCacheStore<C>,
      .                   result: C::Value,
      .                   dep_node_index: DepNodeIndex,
      .               ) -> C::Stored
      .               where
      .                   C: QueryCache<Key = K>,
      .               {
      .                   // We can move out of `self` here because we `mem::forget` it below
 11,812 ( 0.01%)          let key = unsafe { ptr::read(&self.key) };
      .                   let state = self.state;
      .           
      .                   // Forget ourself so our destructor won't poison the query
      .                   mem::forget(self);
      .           
    578 ( 0.00%)          let (job, result) = {
      .                       let key_hash = hash_for_shard(&key);
      .                       let shard = get_shard_index_by_hash(key_hash);
      .                       let job = {
      .                           let mut lock = state.shards.get_shard_by_index(shard).lock();
      .                           match lock.active.remove(&key).unwrap() {
      .                               QueryResult::Started(job) => job,
      .                               QueryResult::Poisoned => panic!(),
      .                           }
      .                       };
      .                       let result = {
      .                           let mut lock = cache.shards.get_shard_by_index(shard).lock();
 21,924 ( 0.02%)                  cache.cache.complete(&mut lock, key, result, dep_node_index)
      .                       };
    620 ( 0.00%)              (job, result)
      .                   };
      .           
      .                   job.signal_complete();
      .                   result
      .               }
      .           }
      .           
      .           impl<'tcx, D, K> Drop for JobOwner<'tcx, D, K>
-- line 298 ----------------------------------------
-- line 347 ----------------------------------------
      .               Cycle(CycleError),
      .           }
      .           
      .           /// Checks if the query is already computed and in the cache.
      .           /// It returns the shard index and a lock guard to the shard,
      .           /// which will be used if the query is not in the cache and we need
      .           /// to compute it.
      .           #[inline]
 27,068 ( 0.02%)  pub fn try_get_cached<'a, CTX, C, R, OnHit>(
      .               tcx: CTX,
      .               cache: &'a QueryCacheStore<C>,
      .               key: &C::Key,
      .               // `on_hit` can be called while holding a lock to the query cache
      .               on_hit: OnHit,
      .           ) -> Result<R, QueryLookup>
      .           where
      .               C: QueryCache,
      .               CTX: DepContext,
      .               OnHit: FnOnce(&C::Stored) -> R,
      .           {
      .               cache.cache.lookup(cache, &key, |value, index| {
 29,021 ( 0.02%)          if unlikely!(tcx.profiler().enabled()) {
      .                       tcx.profiler().query_cache_hit(index.into());
      .                   }
      .                   tcx.dep_graph().read_index(index);
 16,286 ( 0.01%)          on_hit(value)
      .               })
 30,752 ( 0.02%)  }
      .           
 98,566 ( 0.08%)  fn try_execute_query<CTX, C>(
      .               tcx: CTX,
      .               state: &QueryState<CTX::DepKind, C::Key>,
      .               cache: &QueryCacheStore<C>,
      .               span: Span,
      .               key: C::Key,
      .               lookup: QueryLookup,
      .               dep_node: Option<DepNode<CTX::DepKind>>,
      .               query: &QueryVtable<CTX, C::Key, C::Value>,
-- line 384 ----------------------------------------
-- line 391 ----------------------------------------
      .               match JobOwner::<'_, CTX::DepKind, C::Key>::try_start(
      .                   &tcx,
      .                   state,
      .                   span,
      .                   key.clone(),
      .                   lookup,
      .                   query.dep_kind,
      .               ) {
 45,548 ( 0.04%)          TryGetJob::NotYetStarted(job) => {
125,518 ( 0.10%)              let (result, dep_node_index) = execute_job(tcx, key, dep_node, query, job.id);
 11,613 ( 0.01%)              let result = job.complete(cache, result, dep_node_index);
 14,569 ( 0.01%)              (result, Some(dep_node_index))
      .                   }
      .                   TryGetJob::Cycle(error) => {
      .                       let result = mk_cycle(tcx, error, query.handle_cycle_error, &cache.cache);
      .                       (result, None)
      .                   }
      .                   #[cfg(parallel_compiler)]
      .                   TryGetJob::JobCompleted(query_blocked_prof_timer) => {
      .                       let (v, index) = cache
-- line 410 ----------------------------------------
-- line 415 ----------------------------------------
      .                       if unlikely!(tcx.dep_context().profiler().enabled()) {
      .                           tcx.dep_context().profiler().query_cache_hit(index.into());
      .                       }
      .                       query_blocked_prof_timer.finish_with_query_invocation_id(index.into());
      .           
      .                       (v, Some(index))
      .                   }
      .               }
103,218 ( 0.08%)  }
      .           
      .           fn execute_job<CTX, K, V>(
      .               tcx: CTX,
      .               key: K,
      .               mut dep_node_opt: Option<DepNode<CTX::DepKind>>,
      .               query: &QueryVtable<CTX, K, V>,
      .               job_id: QueryJobId<CTX::DepKind>,
      .           ) -> (V, DepNodeIndex)
-- line 431 ----------------------------------------
-- line 432 ----------------------------------------
      .           where
      .               K: Clone + DepNodeParams<CTX::DepContext>,
      .               V: Debug,
      .               CTX: QueryContext,
      .           {
      .               let dep_graph = tcx.dep_context().dep_graph();
      .           
      .               // Fast path for when incr. comp. is off.
 11,039 ( 0.01%)      if !dep_graph.is_fully_enabled() {
      .                   let prof_timer = tcx.dep_context().profiler().query_provider();
 14,940 ( 0.01%)          let result = tcx.start_query(job_id, None, || query.compute(*tcx.dep_context(), key));
      .                   let dep_node_index = dep_graph.next_virtual_depnode_index();
      .                   prof_timer.finish_with_query_invocation_id(dep_node_index.into());
 10,934 ( 0.01%)          return (result, dep_node_index);
      .               }
      .           
      .               if !query.anon && !query.eval_always {
      .                   // `to_dep_node` is expensive for some `DepKind`s.
      .                   let dep_node =
      .                       dep_node_opt.get_or_insert_with(|| query.to_dep_node(*tcx.dep_context(), &key));
      .           
      .                   // The diagnostics for this query will be promoted to the current session during
-- line 453 ----------------------------------------
-- line 691 ----------------------------------------
      .           /// Executing `query::ensure(D)` is considered a read of the dep-node `D`.
      .           /// Returns true if the query should still run.
      .           ///
      .           /// This function is particularly useful when executing passes for their
      .           /// side-effects -- e.g., in order to report errors for erroneous programs.
      .           ///
      .           /// Note: The optimization is only available during incr. comp.
      .           #[inline(never)]
  2,216 ( 0.00%)  fn ensure_must_run<CTX, K, V>(
      .               tcx: CTX,
      .               key: &K,
      .               query: &QueryVtable<CTX, K, V>,
      .           ) -> (bool, Option<DepNode<CTX::DepKind>>)
      .           where
      .               K: crate::dep_graph::DepNodeParams<CTX::DepContext>,
      .               CTX: QueryContext,
      .           {
    554 ( 0.00%)      if query.eval_always {
      4 ( 0.00%)          return (true, None);
      .               }
      .           
      .               // Ensuring an anonymous query makes no sense
    550 ( 0.00%)      assert!(!query.anon);
      .           
      .               let dep_node = query.to_dep_node(*tcx.dep_context(), key);
      .           
      .               let dep_graph = tcx.dep_context().dep_graph();
  1,517 ( 0.00%)      match dep_graph.try_mark_green(tcx, &dep_node) {
      .                   None => {
      .                       // A None return from `try_mark_green` means that this is either
      .                       // a new dep node or that the dep node has already been marked red.
      .                       // Either way, we can't call `dep_graph.read()` as we don't have the
      .                       // DepNodeIndex. We must invoke the query itself. The performance cost
      .                       // this introduces should be negligible as we'll immediately hit the
      .                       // in-memory cache, or another query down the line will.
  1,650 ( 0.00%)              (true, Some(dep_node))
      .                   }
      .                   Some((_, dep_node_index)) => {
      .                       dep_graph.read_index(dep_node_index);
      .                       tcx.dep_context().profiler().query_cache_hit(dep_node_index.into());
      .                       (false, None)
      .                   }
      .               }
  2,216 ( 0.00%)  }
      .           
      .           pub enum QueryMode {
      .               Get,
      .               Ensure,
      .           }
      .           
111,637 ( 0.09%)  pub fn get_query<Q, CTX>(
      .               tcx: CTX,
      .               span: Span,
      .               key: Q::Key,
      .               lookup: QueryLookup,
      .               mode: QueryMode,
      .           ) -> Option<Q::Stored>
      .           where
      .               Q: QueryDescription<CTX>,
      .               Q::Key: DepNodeParams<CTX::DepContext>,
      .               CTX: QueryContext,
      .           {
      .               let query = Q::make_vtable(tcx, &key);
 22,395 ( 0.02%)      let dep_node = if let QueryMode::Ensure = mode {
  2,593 ( 0.00%)          let (must_run, dep_node) = ensure_must_run(tcx, &key, &query);
    277 ( 0.00%)          if !must_run {
      .                       return None;
      .                   }
    568 ( 0.00%)          dep_node
      .               } else {
      .                   None
      .               };
      .           
      .               debug!("ty::query::get_query<{}>(key={:?}, span={:?})", Q::NAME, key, span);
151,233 ( 0.12%)      let (result, dep_node_index) = try_execute_query(
      .                   tcx,
      .                   Q::query_state(tcx),
      .                   Q::query_cache(tcx),
      .                   span,
    625 ( 0.00%)          key,
      .                   lookup,
 43,793 ( 0.04%)          dep_node,
      .                   &query,
      .               );
 22,078 ( 0.02%)      if let Some(dep_node_index) = dep_node_index {
      .                   tcx.dep_context().dep_graph().read_index(dep_node_index)
      .               }
  4,734 ( 0.00%)      Some(result)
105,667 ( 0.09%)  }
      .           
      .           pub fn force_query<Q, CTX>(tcx: CTX, key: Q::Key, dep_node: DepNode<CTX::DepKind>)
      .           where
      .               Q: QueryDescription<CTX>,
      .               Q::Key: DepNodeParams<CTX::DepContext>,
      .               CTX: QueryContext,
      .           {
      .               // We may be concurrently trying both execute and force a query.
-- line 787 ----------------------------------------

 94,953 ( 0.08%)  <counts for unidentified lines in /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_query_system/src/query/plumbing.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/iter/range.rs
--------------------------------------------------------------------------------
Ir               

-- line 198 ----------------------------------------
      .                   }
      .           
      .                   #[inline]
      .                   #[allow(arithmetic_overflow)]
      .                   #[rustc_inherit_overflow_checks]
      .                   fn forward(start: Self, n: usize) -> Self {
      .                       // In debug builds, trigger a panic on overflow.
      .                       // This should optimize completely out in release builds.
  3,320 ( 0.00%)              if Self::forward_checked(start, n).is_none() {
      .                           let _ = Self::MAX + 1;
      .                       }
      .                       // Do wrapping math to allow e.g. `Step::forward(-128i8, 255)`.
      .                       start.wrapping_add(n as Self)
      .                   }
      .           
      .                   #[inline]
      .                   #[allow(arithmetic_overflow)]
-- line 214 ----------------------------------------
-- line 613 ----------------------------------------
      .           
      .                   if taken < n { Err(taken) } else { Ok(()) }
      .               }
      .           }
      .           
      .           impl<T: TrustedStep> RangeIteratorImpl for ops::Range<T> {
      .               #[inline]
      .               fn spec_next(&mut self) -> Option<T> {
631,504 ( 0.51%)          if self.start < self.end {
      .                       // SAFETY: just checked precondition
      .                       let n = unsafe { Step::forward_unchecked(self.start.clone(), 1) };
      .                       Some(mem::replace(&mut self.start, n))
      .                   } else {
      .                       None
      .                   }
      .               }
      .           
-- line 629 ----------------------------------------
-- line 657 ----------------------------------------
      .                   // Otherwise 0 is returned which always safe to use.
      .                   self.start = unsafe { Step::forward_unchecked(self.start.clone(), taken) };
      .           
      .                   if taken < n { Err(taken) } else { Ok(()) }
      .               }
      .           
      .               #[inline]
      .               fn spec_next_back(&mut self) -> Option<T> {
 16,906 ( 0.01%)          if self.start < self.end {
      .                       // SAFETY: just checked precondition
      .                       self.end = unsafe { Step::backward_unchecked(self.end.clone(), 1) };
      .                       Some(self.end.clone())
      .                   } else {
      .                       None
      .                   }
      .               }
      .           
-- line 673 ----------------------------------------
-- line 708 ----------------------------------------
      .           
      .               #[inline]
      .               fn next(&mut self) -> Option<A> {
      .                   self.spec_next()
      .               }
      .           
      .               #[inline]
      .               fn size_hint(&self) -> (usize, Option<usize>) {
 22,063 ( 0.02%)          if self.start < self.end {
      .                       let hint = Step::steps_between(&self.start, &self.end);
      .                       (hint.unwrap_or(usize::MAX), hint)
      .                   } else {
      .                       (0, Some(0))
      .                   }
      .               }
      .           
      .               #[inline]
-- line 724 ----------------------------------------
-- line 857 ----------------------------------------
      .           impl<A: Step> FusedIterator for ops::Range<A> {}
      .           
      .           #[stable(feature = "rust1", since = "1.0.0")]
      .           impl<A: Step> Iterator for ops::RangeFrom<A> {
      .               type Item = A;
      .           
      .               #[inline]
      .               fn next(&mut self) -> Option<A> {
    391 ( 0.00%)          let n = Step::forward(self.start.clone(), 1);
      .                   Some(mem::replace(&mut self.start, n))
      .               }
      .           
      .               #[inline]
      .               fn size_hint(&self) -> (usize, Option<usize>) {
      .                   (usize::MAX, None)
      .               }
      .           
-- line 873 ----------------------------------------
-- line 998 ----------------------------------------
      .           
      .                   try { accum }
      .               }
      .           }
      .           
      .           impl<T: TrustedStep> RangeInclusiveIteratorImpl for ops::RangeInclusive<T> {
      .               #[inline]
      .               fn spec_next(&mut self) -> Option<T> {
    458 ( 0.00%)          if self.is_empty() {
      .                       return None;
      .                   }
      .                   let is_iterating = self.start < self.end;
    301 ( 0.00%)          Some(if is_iterating {
      .                       // SAFETY: just checked precondition
      .                       let n = unsafe { Step::forward_unchecked(self.start.clone(), 1) };
      .                       mem::replace(&mut self.start, n)
      .                   } else {
      .                       self.exhausted = true;
      .                       self.start.clone()
      .                   })
      .               }
-- line 1018 ----------------------------------------
-- line 1025 ----------------------------------------
      .                   R: Try<Output = B>,
      .               {
      .                   if self.is_empty() {
      .                       return try { init };
      .                   }
      .           
      .                   let mut accum = init;
      .           
    711 ( 0.00%)          while self.start < self.end {
      .                       // SAFETY: just checked precondition
      .                       let n = unsafe { Step::forward_unchecked(self.start.clone(), 1) };
      .                       let n = mem::replace(&mut self.start, n);
      .                       accum = f(accum, n)?;
      .                   }
      .           
      .                   self.exhausted = true;
      .           
     51 ( 0.00%)          if self.start == self.end {
      .                       accum = f(accum, self.start.clone())?;
      .                   }
      .           
      .                   try { accum }
      .               }
      .           
      .               #[inline]
      .               fn spec_next_back(&mut self) -> Option<T> {
-- line 1050 ----------------------------------------
-- line 1098 ----------------------------------------
      .           
      .               #[inline]
      .               fn next(&mut self) -> Option<A> {
      .                   self.spec_next()
      .               }
      .           
      .               #[inline]
      .               fn size_hint(&self) -> (usize, Option<usize>) {
    628 ( 0.00%)          if self.is_empty() {
      .                       return (0, Some(0));
      .                   }
      .           
      .                   match Step::steps_between(&self.start, &self.end) {
      .                       Some(hint) => (hint.saturating_add(1), hint.checked_add(1)),
      .                       None => (usize::MAX, None),
      .                   }
      .               }
-- line 1114 ----------------------------------------

 98,436 ( 0.08%)  <counts for unidentified lines in /usr/home/liquid/rust/worktree-benchmarking/library/core/src/iter/range.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/leb128.rs
--------------------------------------------------------------------------------
Ir               

-- line 17 ----------------------------------------
      .                   #[inline]
      .                   pub fn $fn_name(
      .                       out: &mut [::std::mem::MaybeUninit<u8>; max_leb128_len!($int_ty)],
      .                       mut value: $int_ty,
      .                   ) -> &[u8] {
      .                       let mut i = 0;
      .           
      .                       loop {
  8,451 ( 0.01%)                  if value < 0x80 {
      .                               unsafe {
  4,188 ( 0.00%)                          *out.get_unchecked_mut(i).as_mut_ptr() = value as u8;
      .                               }
      .           
  5,786 ( 0.00%)                      i += 1;
      .                               break;
      .                           } else {
      .                               unsafe {
  3,520 ( 0.00%)                          *out.get_unchecked_mut(i).as_mut_ptr() = ((value & 0x7f) | 0x80) as u8;
      .                               }
      .           
  1,591 ( 0.00%)                      value >>= 7;
      .                               i += 1;
      .                           }
      .                       }
      .           
      .                       unsafe { ::std::mem::MaybeUninit::slice_assume_init_ref(&out.get_unchecked(..i)) }
      .                   }
      .               };
      .           }
-- line 45 ----------------------------------------
-- line 53 ----------------------------------------
      .           macro_rules! impl_read_unsigned_leb128 {
      .               ($fn_name:ident, $int_ty:ty) => {
      .                   #[inline]
      .                   pub fn $fn_name(slice: &[u8], position: &mut usize) -> $int_ty {
      .                       // The first iteration of this loop is unpeeled. This is a
      .                       // performance win because this code is hot and integer values less
      .                       // than 128 are very common, typically occurring 50-80% or more of
      .                       // the time, even for u64 and u128.
902,256 ( 0.73%)              let byte = slice[*position];
451,128 ( 0.36%)              *position += 1;
451,128 ( 0.36%)              if (byte & 0x80) == 0 {
      2 ( 0.00%)                  return byte as $int_ty;
      .                       }
  1,056 ( 0.00%)              let mut result = (byte & 0x7F) as $int_ty;
      .                       let mut shift = 7;
      .                       loop {
331,887 ( 0.27%)                  let byte = slice[*position];
214,858 ( 0.17%)                  *position += 1;
221,258 ( 0.18%)                  if (byte & 0x80) == 0 {
170,973 ( 0.14%)                      result |= (byte as $int_ty) << shift;
      .                               return result;
      .                           } else {
      .                               result |= ((byte & 0x7F) as $int_ty) << shift;
      .                           }
      .                           shift += 7;
      .                       }
      .                   }
      .               };
-- line 80 ----------------------------------------

355,773 ( 0.29%)  <counts for unidentified lines in /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/leb128.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/indexmap-1.8.0/src/map/core/raw.rs
--------------------------------------------------------------------------------
Ir              

-- line 30 ----------------------------------------
     .                               bucket.write(i - offset);
     .                           } else if i >= start {
     .                               self.indices.erase(bucket);
     .                           }
     .                       }
     .                   }
     .               }
     .           
74,321 ( 0.06%)      pub(crate) fn entry(&mut self, hash: HashValue, key: K) -> Entry<'_, K, V>
     .               where
     .                   K: Eq,
     .               {
     .                   let eq = equivalent(&key, &self.entries);
13,655 ( 0.01%)          match self.indices.find(hash.get(), eq) {
     .                       // SAFETY: The entry is created with a live raw bucket, at the same time
     .                       // we have a &mut reference to the map, so it can not be modified further.
 5,242 ( 0.00%)              Some(raw_bucket) => Entry::Occupied(OccupiedEntry {
     .                           map: self,
     .                           raw_bucket,
 2,082 ( 0.00%)                  key,
     .                       }),
31,710 ( 0.03%)              None => Entry::Vacant(VacantEntry {
     .                           map: self,
     .                           hash,
 5,790 ( 0.00%)                  key,
     .                       }),
     .                   }
55,955 ( 0.05%)      }
     .           
     .               pub(super) fn indices_mut(&mut self) -> impl Iterator<Item = &mut usize> {
     .                   // SAFETY: we're not letting any of the buckets escape this function,
     .                   // only the item references that are appropriately bound to `&mut self`.
     .                   unsafe { self.indices.iter().map(|bucket| bucket.as_mut()) }
     .               }
     .           
     .               /// Return the raw bucket for the given index
-- line 65 ----------------------------------------
-- line 139 ----------------------------------------
     .               pub fn index(&self) -> usize {
     .                   // SAFETY: we have &mut map keep keeping the bucket stable
     .                   unsafe { self.raw_bucket.read() }
     .               }
     .           
     .               /// Converts into a mutable reference to the entry's value in the map,
     .               /// with a lifetime bound to the map itself.
     .               pub fn into_mut(self) -> &'a mut V {
   804 ( 0.00%)          let index = self.index();
 2,412 ( 0.00%)          &mut self.map.entries[index].value
     .               }
     .           
     .               /// Remove and return the key, value pair stored in the map for this entry
     .               ///
     .               /// Like `Vec::swap_remove`, the pair is removed by swapping it with the
     .               /// last element of the map and popping it off. **This perturbs
     .               /// the position of what used to be the last element!**
     .               ///
-- line 156 ----------------------------------------

56,307 ( 0.05%)  <counts for unidentified lines in /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/indexmap-1.8.0/src/map/core/raw.rs>

--------------------------------------------------------------------------------
-- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_metadata/src/rmeta/table.rs
--------------------------------------------------------------------------------
Ir              

-- line 38 ----------------------------------------
     .               ($byte_len:expr) => {
     .                   const BYTE_LEN: usize = $byte_len;
     .                   fn maybe_read_from_bytes_at(b: &[u8], i: usize) -> Option<Self> {
     .                       const BYTE_LEN: usize = $byte_len;
     .                       // HACK(eddyb) ideally this would be done with fully safe code,
     .                       // but slicing `[u8]` with `i * N..` is optimized worse, due to the
     .                       // possibility of `i * N` overflowing, than indexing `[[u8; N]]`.
     .                       let b = unsafe {
15,154 ( 0.01%)                  std::slice::from_raw_parts(b.as_ptr() as *const [u8; BYTE_LEN], b.len() / BYTE_LEN)
     .                       };
     .                       b.get(i).map(|b| FixedSizeEncoding::from_bytes(b))
     .                   }
     .                   fn write_to_bytes_at(self, b: &mut [u8], i: usize) {
     .                       const BYTE_LEN: usize = $byte_len;
     .                       // HACK(eddyb) ideally this would be done with fully safe code,
     .                       // see similar comment in `read_from_bytes_at` for why it can't yet.
     .                       let b = unsafe {
     .                           std::slice::from_raw_parts_mut(
     .                               b.as_mut_ptr() as *mut [u8; BYTE_LEN],
   616 ( 0.00%)                      b.len() / BYTE_LEN,
     .                           )
     .                       };
 1,232 ( 0.00%)              self.write_to_bytes(&mut b[i]);
     .                   }
     .               };
     .           }
     .           
     .           impl FixedSizeEncoding for u32 {
     .               fixed_size_encoding_byte_len_and_defaults!(4);
     .           
     .               fn from_bytes(b: &[u8]) -> Self {
-- line 68 ----------------------------------------
-- line 78 ----------------------------------------
     .           
     .           // NOTE(eddyb) there could be an impl for `usize`, which would enable a more
     .           // generic `Lazy<T>` impl, but in the general case we might not need / want to
     .           // fit every `usize` in `u32`.
     .           impl<T> FixedSizeEncoding for Option<Lazy<T>> {
     .               fixed_size_encoding_byte_len_and_defaults!(u32::BYTE_LEN);
     .           
     .               fn from_bytes(b: &[u8]) -> Self {
   461 ( 0.00%)          Some(Lazy::from_position(NonZeroUsize::new(u32::from_bytes(b) as usize)?))
     .               }
     .           
     .               fn write_to_bytes(self, b: &mut [u8]) {
     .                   let position = self.map_or(0, |lazy| lazy.position.get());
     .                   let position: u32 = position.try_into().unwrap();
     .           
     .                   position.write_to_bytes(b)
     .               }
-- line 94 ----------------------------------------
-- line 143 ----------------------------------------
     .               _marker: PhantomData<(fn(&I), T)>,
     .           }
     .           
     .           impl<I: Idx, T> Default for TableBuilder<I, T>
     .           where
     .               Option<T>: FixedSizeEncoding,
     .           {
     .               fn default() -> Self {
     3 ( 0.00%)          TableBuilder { bytes: vec![], _marker: PhantomData }
     .               }
     .           }
     .           
     .           impl<I: Idx, T> TableBuilder<I, T>
     .           where
     .               Option<T>: FixedSizeEncoding,
     .           {
 4,278 ( 0.00%)      pub(crate) fn set(&mut self, i: I, value: T) {
     .                   // FIXME(eddyb) investigate more compact encodings for sparse tables.
     .                   // On the PR @michaelwoerister mentioned:
     .                   // > Space requirements could perhaps be optimized by using the HAMT `popcnt`
     .                   // > trick (i.e. divide things into buckets of 32 or 64 items and then
     .                   // > store bit-masks of which item in each bucket is actually serialized).
     .                   let i = i.index();
   638 ( 0.00%)          let needed = (i + 1) * <Option<T>>::BYTE_LEN;
 1,952 ( 0.00%)          if self.bytes.len() < needed {
     .                       self.bytes.resize(needed, 0);
     .                   }
     .           
     .                   Some(value).write_to_bytes_at(&mut self.bytes, i);
 3,690 ( 0.00%)      }
     .           
     .               pub(crate) fn encode(&self, buf: &mut Encoder) -> Lazy<Table<I, T>> {
     .                   let pos = buf.position();
     .                   buf.emit_raw_bytes(&self.bytes).unwrap();
     .                   Lazy::from_position_and_meta(NonZeroUsize::new(pos as usize).unwrap(), self.bytes.len())
     .               }
     .           }
     .           
-- line 180 ----------------------------------------
-- line 186 ----------------------------------------
     .           }
     .           
     .           impl<I: Idx, T> Lazy<Table<I, T>>
     .           where
     .               Option<T>: FixedSizeEncoding,
     .           {
     .               /// Given the metadata, extract out the value at a particular index (if any).
     .               #[inline(never)]
14,693 ( 0.01%)      pub(super) fn get<'a, 'tcx, M: Metadata<'a, 'tcx>>(&self, metadata: M, i: I) -> Option<T> {
     .                   debug!("Table::lookup: index={:?} len={:?}", i, self.meta);
     .           
29,386 ( 0.02%)          let start = self.position.get();
29,386 ( 0.02%)          let bytes = &metadata.blob()[start..start + self.meta];
     .                   <Option<T>>::maybe_read_from_bytes_at(bytes, i.index())?
29,386 ( 0.02%)      }
     .           
     .               /// Size of the table in entries, including possible gaps.
     .               pub(super) fn size(&self) -> usize {
     .                   self.meta / <Option<T>>::BYTE_LEN
     .               }
     .           }

30,547 ( 0.02%)  <counts for unidentified lines in /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_metadata/src/rmeta/table.rs>

--------------------------------------------------------------------------------
The following files chosen for auto-annotation could not be found:
--------------------------------------------------------------------------------
  ./elf/../sysdeps/x86_64/dl-machine.h
  ./elf/dl-lookup.c
  ./elf/do-rel.h
  ./malloc/malloc.c
  ./stdlib/cxa_finalize.c
  ./string/../sysdeps/x86_64/multiarch/memcmp-avx2-movbe.S
  ./string/../sysdeps/x86_64/multiarch/memmove-vec-unaligned-erms.S
  ./string/../sysdeps/x86_64/multiarch/memset-vec-unaligned-erms.S
  ./string/../sysdeps/x86_64/strcmp.S

--------------------------------------------------------------------------------
Ir                  
--------------------------------------------------------------------------------
43,848,177 (35.29%)  events annotated