-------------------------------------------------------------------------------- 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 vsdbsled --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 --cfg feature="default" --cfg feature="no_metrics" -C metadata=58385c2215ab7eb1 -C extra-filename=-58385c2215ab7eb1 --out-dir /usr/home/liquid/tmp/.tmpVAnhrv/target/debug/deps -L dependency=/usr/home/liquid/tmp/.tmpVAnhrv/target/debug/deps --extern crc32fast=/usr/home/liquid/tmp/.tmpVAnhrv/target/debug/deps/libcrc32fast-7c6db4300ce8ebbb.rmeta --extern crossbeam_epoch=/usr/home/liquid/tmp/.tmpVAnhrv/target/debug/deps/libcrossbeam_epoch-612cdcbe2a620936.rmeta --extern crossbeam_utils=/usr/home/liquid/tmp/.tmpVAnhrv/target/debug/deps/libcrossbeam_utils-161632d0d3aded87.rmeta --extern fs2=/usr/home/liquid/tmp/.tmpVAnhrv/target/debug/deps/libfs2-802f16a4deb6dfb1.rmeta --extern fxhash=/usr/home/liquid/tmp/.tmpVAnhrv/target/debug/deps/libfxhash-80812a70edcbf791.rmeta --extern libc=/usr/home/liquid/tmp/.tmpVAnhrv/target/debug/deps/liblibc-6af22c5d4ed4fc5c.rmeta --extern log=/usr/home/liquid/tmp/.tmpVAnhrv/target/debug/deps/liblog-ffcd0f6d1dad8496.rmeta --extern parking_lot=/usr/home/liquid/tmp/.tmpVAnhrv/target/debug/deps/libparking_lot-893e3a22ffe8caff.rmeta -Adeprecated -Aunknown-lints -Zincremental-verify-ich Data file: results/cgout-w-profiling-vsdbsled-0.34.7-patched-Check-Full Events recorded: Ir Events shown: Ir Event sort order: Ir Thresholds: 0.1 Include dirs: User annotated: Auto-annotation: on -------------------------------------------------------------------------------- Ir -------------------------------------------------------------------------------- 6,873,809,429 (100.0%) PROGRAM TOTALS -------------------------------------------------------------------------------- Ir file:function -------------------------------------------------------------------------------- 212,281,561 ( 3.09%) ./malloc/malloc.c:_int_free 184,554,231 ( 2.68%) ./malloc/malloc.c:_int_malloc 126,970,162 ( 1.85%) ./string/../sysdeps/x86_64/multiarch/memmove-vec-unaligned-erms.S:__memcpy_avx_unaligned_erms 125,466,592 ( 1.83%) ./malloc/malloc.c:malloc 61,899,559 ( 0.90%) ./malloc/malloc.c:free 58,834,187 ( 0.86%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:, (), core::hash::BuildHasherDefault>>::from_hash::>::{closure#0}> 32,103,315 ( 0.47%) ./malloc/malloc.c:malloc_consolidate 28,851,395 ( 0.42%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:>>::from_key_hashed_nocheck:: 28,574,873 ( 0.42%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs:::eq 27,602,105 ( 0.40%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/map.rs:, (), core::hash::BuildHasherDefault>>::from_hash::>::{closure#0}> 26,469,590 ( 0.39%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs:::intern_ty 25,999,097 ( 0.38%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/mod.rs:::shallow_resolve_ty 25,941,620 ( 0.38%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs:::hash:: 25,451,685 ( 0.37%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/num/uint_macros.rs:::short_write_process_buffer:: 25,166,064 ( 0.37%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/option.rs: as rustc_const_eval::interpret::visitor::ValueVisitor>::walk_aggregate::, >::mplace_array_fields::{closure#0}>, as rustc_const_eval::interpret::visitor::ValueVisitor>::walk_value::{closure#1}>> 24,121,788 ( 0.35%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_const_eval/src/interpret/intern.rs: as rustc_const_eval::interpret::visitor::ValueVisitor>::visit_value 23,438,233 ( 0.34%) ./malloc/malloc.c:realloc 20,512,476 ( 0.30%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:, (), core::hash::BuildHasherDefault>>::from_hash::, rustc_middle::ty::context::Interned>::{closure#0}> 20,184,486 ( 0.29%) ./malloc/malloc.c:unlink_chunk.constprop.0 19,402,835 ( 0.28%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/mod.rs:::attrs 18,874,548 ( 0.27%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/mir/interpret/pointer.rs:<&mut >::mplace_array_fields::{closure#0} as core::ops::function::FnOnce<(u64,)>>::call_once 18,422,600 ( 0.27%) /usr/home/liquid/rust/worktree-benchmarking/library/std/src/sys/unix/alloc.rs:__rdl_alloc 18,024,327 ( 0.26%) /usr/home/liquid/rust/worktree-benchmarking/library/alloc/src/collections/btree/search.rs:>::search_tree:: 17,672,820 ( 0.26%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/map.rs:>, (), core::hash::BuildHasherDefault>>::from_hash::>>::{closure#0}> 17,487,514 ( 0.25%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/caching_source_map_view.rs:::span_data_to_lines_and_cols 17,073,180 ( 0.25%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/sip128.rs:::short_write_process_buffer:: 16,524,536 ( 0.24%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs:::hash:: 16,516,798 ( 0.24%) ./malloc/malloc.c:_int_realloc 16,354,820 ( 0.24%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs:::_intern_substs 16,176,858 ( 0.24%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/mod.rs:::lookup_source_file_idx 16,105,694 ( 0.23%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_borrowck/src/lib.rs:::access_place 15,531,882 ( 0.23%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/iter/macros.rs:::_intern_substs 14,913,450 ( 0.22%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/obligation_forest/mod.rs:>::process_obligations::> 14,876,676 ( 0.22%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/type_variable.rs:::probe 14,680,252 ( 0.21%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_const_eval/src/interpret/visitor.rs: as rustc_const_eval::interpret::visitor::ValueVisitor>::walk_aggregate::, >::mplace_array_fields::{closure#0}>, as rustc_const_eval::interpret::visitor::ValueVisitor>::walk_value::{closure#1}>> 14,680,204 ( 0.21%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/iter/adapters/enumerate.rs: as rustc_const_eval::interpret::visitor::ValueVisitor>::walk_aggregate::, >::mplace_array_fields::{closure#0}>, as rustc_const_eval::interpret::visitor::ValueVisitor>::walk_value::{closure#1}>> 14,555,968 ( 0.21%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:>, (), core::hash::BuildHasherDefault>>::from_hash::>>::{closure#0}> 14,361,416 ( 0.21%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs:, (), core::hash::BuildHasherDefault>>::from_hash::>::{closure#0}> 14,022,986 ( 0.20%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/hir/map/mod.rs:::find_parent_node 13,698,466 ( 0.20%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs:::eq 13,631,618 ( 0.20%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/result.rs: as rustc_const_eval::interpret::visitor::ValueVisitor>::walk_aggregate::, >::mplace_array_fields::{closure#0}>, as rustc_const_eval::interpret::visitor::ValueVisitor>::walk_value::{closure#1}>> 13,631,618 ( 0.20%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_const_eval/src/interpret/place.rs:<&mut >::mplace_array_fields::{closure#0} as core::ops::function::FnOnce<(u64,)>>::call_once 12,667,088 ( 0.18%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/hir/map/mod.rs:::attrs 12,641,455 ( 0.18%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_mir_dataflow/src/drop_flag_effects.rs:rustc_mir_dataflow::drop_flag_effects::on_all_children_bits::is_terminal_path 12,459,516 ( 0.18%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/lib.rs:>::hash_stable 12,286,128 ( 0.18%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/graph/scc/mod.rs:, rustc_borrowck::constraints::ConstraintSccIndex>>::start_walk_from 11,410,842 ( 0.17%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_parse/src/parser/mod.rs:::check 11,350,206 ( 0.17%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_privacy/src/lib.rs: as rustc_middle::ty::fold::TypeVisitor>::visit_ty 10,938,891 ( 0.16%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/region_constraints/mod.rs:>::search_tree:: 10,647,959 ( 0.15%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_parse/src/parser/mod.rs:::next 10,635,722 ( 0.15%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/graph/scc/mod.rs:, rustc_borrowck::constraints::ConstraintSccIndex>>::inspect_node 10,625,318 ( 0.15%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/map.rs:>>::from_key_hashed_nocheck:: 10,305,124 ( 0.15%) ./elf/dl-lookup.c:_dl_lookup_symbol_x 10,101,874 ( 0.15%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_parse/src/parser/mod.rs:::bump 9,967,182 ( 0.15%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/undo_log.rs:::rollback_to 9,879,641 ( 0.14%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/subst.rs:::fold_ty 9,769,634 ( 0.14%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/map.rs:, (), core::hash::BuildHasherDefault>>::from_hash::>::{closure#0}> 9,765,939 ( 0.14%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs:::intern_predicate 9,746,496 ( 0.14%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:>>::get:: 9,629,755 ( 0.14%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_index/src/interval.rs:>::union 9,438,841 ( 0.14%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_const_eval/src/interpret/visitor.rs: as rustc_const_eval::interpret::visitor::ValueVisitor>::visit_value 9,182,589 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/mod.rs:::hash:: 8,949,963 ( 0.13%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/map.rs:, (), core::hash::BuildHasherDefault>>::from_hash::, rustc_middle::ty::context::Interned>::{closure#0}> 8,931,367 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/sip128.rs:>::hash_stable 8,909,515 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs:::maybe_lint_level_root_bounded 8,868,167 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/mir/traversal.rs:::traverse_successor 8,855,307 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/relate.rs:rustc_middle::ty::relate::super_relate_tys:: 8,837,655 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/freshen.rs:::fold_ty 8,770,932 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_parse/src/lexer/mod.rs:::next_token 8,693,691 ( 0.13%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/bitmask.rs:, (), core::hash::BuildHasherDefault>>::from_hash::>::{closure#0}> 8,388,688 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/ops/function.rs:<&mut >::mplace_array_fields::{closure#0} as core::ops::function::FnOnce<(u64,)>>::call_once 8,388,684 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/num/uint_macros.rs:<&mut >::mplace_array_fields::{closure#0} as core::ops::function::FnOnce<(u64,)>>::call_once 8,199,664 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/fold.rs:<&rustc_middle::ty::TyS as rustc_middle::ty::fold::TypeFoldable>::super_fold_with:: 8,196,173 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_trait_selection/src/traits/fulfill.rs:>::process_obligations::> 8,173,586 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/region_constraints/mod.rs:::make_subregion 8,167,861 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_ast/src/token.rs:::clone 8,153,696 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/obligation_forest/mod.rs:>::register_obligation_at 8,066,271 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/ops/bit.rs:::hash:: 8,036,300 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/combine.rs:::tys 7,926,817 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_trait_selection/src/traits/fulfill.rs:::progress_changed_obligations 7,845,996 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/walk.rs:::next 7,809,690 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/sharded.rs:::intern_ty 7,773,777 ( 0.11%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/stacker-0.1.14/src/lib.rs:stacker::remaining_stack 7,734,099 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/undo_log.rs:>::reverse 7,627,201 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/../../stdarch/crates/core_arch/src/x86/sse2.rs:>>::from_key_hashed_nocheck:: 7,618,563 ( 0.11%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:, (), core::hash::BuildHasherDefault>>::from_hash::>::{closure#0}> 7,610,246 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs:::mk_region 7,512,256 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/library/alloc/src/vec/into_iter.rs:> as core::ops::drop::Drop>::drop 7,503,027 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_ast/src/tokenstream.rs:::next_with_spacing 7,435,333 ( 0.11%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/smallvec-1.7.0/src/lib.rs: as core::iter::traits::collect::Extend>::extend::>>> 7,327,624 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_ast/src/token.rs:::is_keyword 7,125,237 ( 0.10%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/cell.rs:::attrs 7,004,113 ( 0.10%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_borrowck/src/type_check/mod.rs:::typeck_mir 6,943,314 ( 0.10%) /usr/home/liquid/rust/worktree-benchmarking/library/std/src/collections/hash/map.rs:::intern_ty -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_privacy/src/lib.rs -------------------------------------------------------------------------------- Ir -- line 59 ---------------------------------------- . &mut self, . def_id: DefId, . kind: &str, . descr: &dyn fmt::Display, . ) -> ControlFlow; . . /// Not overridden, but used to actually visit types and traits. . fn skeleton(&mut self) -> DefIdVisitorSkeleton<'_, 'tcx, Self> { 787,527 ( 0.01%) DefIdVisitorSkeleton { . def_id_visitor: self, . visited_opaque_tys: Default::default(), . dummy: Default::default(), . } . } 6,396 ( 0.00%) fn visit(&mut self, ty_fragment: impl TypeFoldable<'tcx>) -> ControlFlow { . ty_fragment.visit_with(&mut self.skeleton()) 10,660 ( 0.00%) } 2,814 ( 0.00%) fn visit_trait(&mut self, trait_ref: TraitRef<'tcx>) -> ControlFlow { . self.skeleton().visit_trait(trait_ref) 2,814 ( 0.00%) } . fn visit_projection_ty( . &mut self, . projection: ty::ProjectionTy<'tcx>, . ) -> ControlFlow { 84 ( 0.00%) self.skeleton().visit_projection_ty(projection) . } . fn visit_predicates( . &mut self, . predicates: ty::GenericPredicates<'tcx>, . ) -> ControlFlow { 3,737 ( 0.00%) self.skeleton().visit_predicates(predicates) . } . } . . struct DefIdVisitorSkeleton<'v, 'tcx, V: ?Sized> { . def_id_visitor: &'v mut V, . visited_opaque_tys: FxHashSet, . dummy: PhantomData>, . } . . impl<'tcx, V> DefIdVisitorSkeleton<'_, 'tcx, V> . where . V: DefIdVisitor<'tcx> + ?Sized, . { . fn visit_trait(&mut self, trait_ref: TraitRef<'tcx>) -> ControlFlow { 469 ( 0.00%) let TraitRef { def_id, substs } = trait_ref; 53,114 ( 0.00%) self.def_id_visitor.visit_def_id(def_id, "trait", &trait_ref.print_only_trait_path())?; 469 ( 0.00%) if self.def_id_visitor.shallow() { ControlFlow::CONTINUE } else { substs.visit_with(self) } . } . 12,770 ( 0.00%) fn visit_projection_ty( . &mut self, . projection: ty::ProjectionTy<'tcx>, . ) -> ControlFlow { 10,216 ( 0.00%) let (trait_ref, assoc_substs) = 2,554 ( 0.00%) projection.trait_ref_and_own_substs(self.def_id_visitor.tcx()); . self.visit_trait(trait_ref)?; . if self.def_id_visitor.shallow() { . ControlFlow::CONTINUE . } else { . assoc_substs.iter().try_for_each(|subst| subst.visit_with(self)) . } 11,493 ( 0.00%) } . . fn visit_predicate(&mut self, predicate: ty::Predicate<'tcx>) -> ControlFlow { 1,162 ( 0.00%) match predicate.kind().skip_binder() { . ty::PredicateKind::Trait(ty::TraitPredicate { . trait_ref, . constness: _, . polarity: _, . }) => self.visit_trait(trait_ref), . ty::PredicateKind::Projection(ty::ProjectionPredicate { projection_ty, term }) => { 142 ( 0.00%) term.visit_with(self)?; 523 ( 0.00%) self.visit_projection_ty(projection_ty) . } . ty::PredicateKind::TypeOutlives(ty::OutlivesPredicate(ty, _region)) => { . ty.visit_with(self) . } . ty::PredicateKind::RegionOutlives(..) => ControlFlow::CONTINUE, . ty::PredicateKind::ConstEvaluatable(uv) . if self.def_id_visitor.tcx().features().generic_const_exprs => . { -- line 140 ---------------------------------------- -- line 157 ---------------------------------------- . ACNode::Leaf(leaf) => self.visit_const(leaf), . ACNode::Cast(_, _, ty) => self.visit_ty(ty), . ACNode::Binop(..) | ACNode::UnaryOp(..) | ACNode::FunctionCall(_, _) => { . ControlFlow::CONTINUE . } . }) . } . 26,334 ( 0.00%) fn visit_predicates( . &mut self, . predicates: ty::GenericPredicates<'tcx>, . ) -> ControlFlow { . let ty::GenericPredicates { parent: _, predicates } = predicates; . predicates.iter().try_for_each(|&(predicate, _span)| self.visit_predicate(predicate)) 30,096 ( 0.00%) } . } . . impl<'tcx, V> TypeVisitor<'tcx> for DefIdVisitorSkeleton<'_, 'tcx, V> . where . V: DefIdVisitor<'tcx> + ?Sized, . { . type BreakTy = V::BreakTy; . 2,725,931 ( 0.04%) fn visit_ty(&mut self, ty: Ty<'tcx>) -> ControlFlow { 304,058 ( 0.00%) let tcx = self.def_id_visitor.tcx(); . // InternalSubsts are not visited here because they are visited below in `super_visit_with`. 1,506,242 ( 0.02%) match *ty.kind() { 379,130 ( 0.01%) ty::Adt(&ty::AdtDef { did: def_id, .. }, ..) . | ty::Foreign(def_id) . | ty::FnDef(def_id, ..) . | ty::Closure(def_id, ..) . | ty::Generator(def_id, ..) => { 1,774,834 ( 0.03%) self.def_id_visitor.visit_def_id(def_id, "type", &ty)?; . if self.def_id_visitor.shallow() { . return ControlFlow::CONTINUE; . } . // Default type visitor doesn't visit signatures of fn types. . // Something like `fn() -> Priv {my_func}` is considered a private type even if . // `my_func` is public, so we need to visit signatures. 394,059 ( 0.01%) if let ty::FnDef(..) = ty.kind() { . tcx.fn_sig(def_id).visit_with(self)?; . } . // Inherent static methods don't have self type in substs. . // Something like `fn() {my_method}` type of the method . // `impl Pub { pub fn my_method() {} }` is considered a private type, . // so we need to visit the self type additionally. 572,338 ( 0.01%) if let Some(assoc_item) = tcx.opt_associated_item(def_id) { 29,346 ( 0.00%) if let ty::ImplContainer(impl_def_id) = assoc_item.container { 7,950 ( 0.00%) tcx.type_of(impl_def_id).visit_with(self)?; . } . } . } 2,286 ( 0.00%) ty::Projection(proj) => { . if self.def_id_visitor.skip_assoc_tys() { . // Visitors searching for minimal visibility/reachability want to . // conservatively approximate associated types like `::Alias` . // as visible/reachable even if both `Type` and `Trait` are private. . // Ideally, associated types should be substituted in the same way as . // free type aliases, but this isn't done yet. . return ControlFlow::CONTINUE; . } . // This will also visit substs if necessary, so we don't need to recurse. 11,341 ( 0.00%) return self.visit_projection_ty(proj); . } 715 ( 0.00%) ty::Dynamic(predicates, ..) => { . // All traits in the list are considered the "primary" part of the type . // and are visited by shallow visitors. 6,245 ( 0.00%) for predicate in predicates { 6,624 ( 0.00%) let trait_ref = match predicate.skip_binder() { 4,236 ( 0.00%) ty::ExistentialPredicate::Trait(trait_ref) => trait_ref, 2,296 ( 0.00%) ty::ExistentialPredicate::Projection(proj) => proj.trait_ref(tcx), . ty::ExistentialPredicate::AutoTrait(def_id) => { 650 ( 0.00%) ty::ExistentialTraitRef { def_id, substs: InternalSubsts::empty() } . } . }; 1,412 ( 0.00%) let ty::ExistentialTraitRef { def_id, substs: _ } = trait_ref; 11,940 ( 0.00%) self.def_id_visitor.visit_def_id(def_id, "trait", &trait_ref)?; . } . } 656 ( 0.00%) ty::Opaque(def_id, ..) => { . // Skip repeated `Opaque`s to avoid infinite recursion. 656 ( 0.00%) if self.visited_opaque_tys.insert(def_id) { . // The intent is to treat `impl Trait1 + Trait2` identically to . // `dyn Trait1 + Trait2`. Therefore we ignore def-id of the opaque type itself . // (it either has no visibility, or its visibility is insignificant, like . // visibilities of type aliases) and recurse into bounds instead to go . // through the trait list (default type visitor doesn't visit those traits). . // All traits in the list are considered the "primary" part of the type . // and are visited by shallow visitors. 50 ( 0.00%) self.visit_predicates(ty::GenericPredicates { . parent: None, . predicates: tcx.explicit_item_bounds(def_id), . })?; . } . } . // These types don't have their own def-ids (but may have subcomponents . // with def-ids that should be visited recursively). . ty::Bool -- line 254 ---------------------------------------- -- line 270 ---------------------------------------- . ty::Bound(..) | ty::Placeholder(..) | ty::Infer(..) => { . bug!("unexpected type: {:?}", ty) . } . } . . if self.def_id_visitor.shallow() { . ControlFlow::CONTINUE . } else { 863,284 ( 0.01%) ty.super_visit_with(self) . } 2,662,900 ( 0.04%) } . . fn visit_const(&mut self, c: &'tcx Const<'tcx>) -> ControlFlow { 28,026 ( 0.00%) self.visit_ty(c.ty)?; 4,807 ( 0.00%) let tcx = self.def_id_visitor.tcx(); 32,697 ( 0.00%) if let Ok(Some(ct)) = AbstractConst::from_const(tcx, c) { . self.visit_abstract_const_expr(tcx, ct)?; . } . ControlFlow::CONTINUE . } . } . . fn min(vis1: ty::Visibility, vis2: ty::Visibility, tcx: TyCtxt<'_>) -> ty::Visibility { 2,011 ( 0.00%) if vis1.is_at_least(vis2, tcx) { vis2 } else { vis1 } . } . . //////////////////////////////////////////////////////////////////////////////// . /// Visitor used to determine if pub(restricted) is used anywhere in the crate. . /// . /// This is done so that `private_in_public` warnings can be turned into hard errors . /// in crates that have been updated to use pub(restricted). . //////////////////////////////////////////////////////////////////////////////// -- line 301 ---------------------------------------- -- line 303 ---------------------------------------- . tcx: TyCtxt<'tcx>, . has_pub_restricted: bool, . } . . impl<'tcx> Visitor<'tcx> for PubRestrictedVisitor<'tcx> { . type NestedFilter = nested_filter::All; . . fn nested_visit_map(&mut self) -> Self::Map { 3,609 ( 0.00%) self.tcx.hir() . } . fn visit_vis(&mut self, vis: &'tcx hir::Visibility<'tcx>) { 8,236 ( 0.00%) self.has_pub_restricted = self.has_pub_restricted || vis.node.is_pub_restricted(); . } . } . . //////////////////////////////////////////////////////////////////////////////// . /// Visitor used to determine impl visibility and reachability. . //////////////////////////////////////////////////////////////////////////////// . . struct FindMin<'a, 'tcx, VL: VisibilityLike> { -- line 322 ---------------------------------------- -- line 336 ---------------------------------------- . true . } . fn visit_def_id( . &mut self, . def_id: DefId, . _kind: &str, . _descr: &dyn fmt::Display, . ) -> ControlFlow { 19,483 ( 0.00%) self.min = VL::new_min(self, def_id); . ControlFlow::CONTINUE . } . } . . trait VisibilityLike: Sized { . const MAX: Self; . const SHALLOW: bool = false; . fn new_min(find: &FindMin<'_, '_, Self>, def_id: DefId) -> Self; . . // Returns an over-approximation (`skip_assoc_tys` = true) of visibility due to . // associated types for which we can't determine visibility precisely. 14,924 ( 0.00%) fn of_impl(def_id: LocalDefId, tcx: TyCtxt<'_>, access_levels: &AccessLevels) -> Self { 6,929 ( 0.00%) let mut find = FindMin { tcx, access_levels, min: Self::MAX }; 2,132 ( 0.00%) find.visit(tcx.type_of(def_id)); 6,396 ( 0.00%) if let Some(trait_ref) = tcx.impl_trait_ref(def_id) { 469 ( 0.00%) find.visit_trait(trait_ref); . } 1,450 ( 0.00%) find.min 17,056 ( 0.00%) } . } . impl VisibilityLike for ty::Visibility { . const MAX: Self = ty::Visibility::Public; 11,844 ( 0.00%) fn new_min(find: &FindMin<'_, '_, Self>, def_id: DefId) -> Self { 5,076 ( 0.00%) min(find.tcx.visibility(def_id), find.min, find.tcx) 16,920 ( 0.00%) } . } . impl VisibilityLike for Option { . const MAX: Self = Some(AccessLevel::Public); . // Type inference is very smart sometimes. . // It can make an impl reachable even some components of its type or trait are unreachable. . // E.g. methods of `impl ReachableTrait for ReachableTy { ... }` . // can be usable from other crates (#57264). So we skip substs when calculating reachability . // and consider an impl reachable if its "shallow" type and trait are reachable. . // . // The assumption we make here is that type-inference won't let you use an impl without knowing . // both "shallow" version of its self type and "shallow" version of its trait if it exists . // (which require reaching the `DefId`s in them). . const SHALLOW: bool = true; 8,757 ( 0.00%) fn new_min(find: &FindMin<'_, '_, Self>, def_id: DefId) -> Self { . cmp::min( 8,757 ( 0.00%) if let Some(def_id) = def_id.as_local() { 3,246 ( 0.00%) find.access_levels.map.get(&def_id).copied() . } else { . Self::MAX . }, 5,846 ( 0.00%) find.min, . ) 11,676 ( 0.00%) } . } . . //////////////////////////////////////////////////////////////////////////////// . /// The embargo visitor, used to determine the exports of the AST. . //////////////////////////////////////////////////////////////////////////////// . . struct EmbargoVisitor<'tcx> { . tcx: TyCtxt<'tcx>, -- line 400 ---------------------------------------- -- line 422 ---------------------------------------- . . struct ReachEverythingInTheInterfaceVisitor<'a, 'tcx> { . access_level: Option, . item_def_id: LocalDefId, . ev: &'a mut EmbargoVisitor<'tcx>, . } . . impl<'tcx> EmbargoVisitor<'tcx> { 36,372 ( 0.00%) fn get(&self, def_id: LocalDefId) -> Option { . self.access_levels.map.get(&def_id).copied() 36,372 ( 0.00%) } . . fn update_with_hir_id( . &mut self, . hir_id: hir::HirId, . level: Option, . ) -> Option { 4,848 ( 0.00%) let def_id = self.tcx.hir().local_def_id(hir_id); . self.update(def_id, level) . } . . /// Updates node level and returns the updated level. . fn update(&mut self, def_id: LocalDefId, level: Option) -> Option { 39,447 ( 0.00%) let old_level = self.get(def_id); . // Accessibility levels can only grow. . if level > old_level { . self.access_levels.map.insert(def_id, level.unwrap()); 906 ( 0.00%) self.changed = true; . level . } else { . old_level . } . } . . fn reach( . &mut self, -- line 457 ---------------------------------------- -- line 458 ---------------------------------------- . def_id: LocalDefId, . access_level: Option, . ) -> ReachEverythingInTheInterfaceVisitor<'_, 'tcx> { . ReachEverythingInTheInterfaceVisitor { . access_level: cmp::min(access_level, Some(AccessLevel::Reachable)), . item_def_id: def_id, . ev: self, . } 9,874 ( 0.00%) } . . // We have to make sure that the items that macros might reference . // are reachable, since they might be exported transitively. . fn update_reachability_from_macro(&mut self, local_def_id: LocalDefId, md: &MacroDef) { . // Non-opaque macros cannot make other items more accessible than they already are. . 33 ( 0.00%) let hir_id = self.tcx.hir().local_def_id_to_hir_id(local_def_id); 99 ( 0.00%) let attrs = self.tcx.hir().attrs(hir_id); 231 ( 0.00%) if attr::find_transparency(attrs, md.macro_rules).0 != Transparency::Opaque { . return; . } . . let item_def_id = local_def_id.to_def_id(); . let macro_module_def_id = . ty::DefIdTree::parent(self.tcx, item_def_id).unwrap().expect_local(); . if self.tcx.hir().opt_def_kind(macro_module_def_id) != Some(DefKind::Mod) { . // The macro's parent doesn't correspond to a `mod`, return early (#63164, #65252). -- line 483 ---------------------------------------- -- line 630 ---------------------------------------- . } . . impl<'tcx> Visitor<'tcx> for EmbargoVisitor<'tcx> { . type NestedFilter = nested_filter::All; . . /// We want to visit items in the context of their containing . /// module and so forth, so supply a crate for doing a deep walk. . fn nested_visit_map(&mut self) -> Self::Map { 10,827 ( 0.00%) self.tcx.hir() . } . 39,744 ( 0.00%) fn visit_item(&mut self, item: &'tcx hir::Item<'tcx>) { 8,832 ( 0.00%) let item_level = match item.kind { . hir::ItemKind::Impl { .. } => { . let impl_level = 9,594 ( 0.00%) Option::::of_impl(item.def_id, self.tcx, &self.access_levels); 1,599 ( 0.00%) self.update(item.def_id, impl_level) . } 11,268 ( 0.00%) _ => self.get(item.def_id), . }; . . // Update levels of nested things. 22,415 ( 0.00%) match item.kind { . hir::ItemKind::Enum(ref def, _) => { 57 ( 0.00%) for variant in def.variants { 648 ( 0.00%) let variant_level = self.update_with_hir_id(variant.id, item_level); 864 ( 0.00%) if let Some(ctor_hir_id) = variant.data.ctor_hir_id() { . self.update_with_hir_id(ctor_hir_id, item_level); . } 432 ( 0.00%) for field in variant.data.fields() { 489 ( 0.00%) self.update_with_hir_id(field.hir_id, variant_level); . } . } . } . hir::ItemKind::Impl(ref impl_) => { 4,797 ( 0.00%) for impl_item_ref in impl_.items { 10,938 ( 0.00%) if impl_.of_trait.is_some() 2,106 ( 0.00%) || self.tcx.visibility(impl_item_ref.id.def_id) == ty::Visibility::Public . { 3,924 ( 0.00%) self.update(impl_item_ref.id.def_id, item_level); . } . } . } 36 ( 0.00%) hir::ItemKind::Trait(.., trait_item_refs) => { . for trait_item_ref in trait_item_refs { 60 ( 0.00%) self.update(trait_item_ref.id.def_id, item_level); . } . } . hir::ItemKind::Struct(ref def, _) | hir::ItemKind::Union(ref def, _) => { 960 ( 0.00%) if let Some(ctor_hir_id) = def.ctor_hir_id() { . self.update_with_hir_id(ctor_hir_id, item_level); . } 480 ( 0.00%) for field in def.fields() { 3,432 ( 0.00%) if field.vis.node.is_pub() { 1,320 ( 0.00%) self.update_with_hir_id(field.hir_id, item_level); . } . } . } . hir::ItemKind::Macro(ref macro_def) => { 66 ( 0.00%) self.update_reachability_from_macro(item.def_id, macro_def); . } . hir::ItemKind::ForeignMod { items, .. } => { . for foreign_item in items { . if self.tcx.visibility(foreign_item.id.def_id) == ty::Visibility::Public { . self.update(foreign_item.id.def_id, item_level); . } . } . } -- line 697 ---------------------------------------- -- line 704 ---------------------------------------- . | hir::ItemKind::TyAlias(..) . | hir::ItemKind::Mod(..) . | hir::ItemKind::TraitAlias(..) . | hir::ItemKind::Fn(..) . | hir::ItemKind::ExternCrate(..) => {} . } . . // Mark all items in interfaces of reachable items as reachable. 22,080 ( 0.00%) match item.kind { . // The interface is empty. . hir::ItemKind::Macro(..) | hir::ItemKind::ExternCrate(..) => {} . // All nested items are checked by `visit_item`. . hir::ItemKind::Mod(..) => {} . // Handled in the access level of in rustc_resolve . hir::ItemKind::Use(..) => {} . // The interface is empty. . hir::ItemKind::GlobalAsm(..) => {} . hir::ItemKind::OpaqueTy(..) => { . // HACK(jynelson): trying to infer the type of `impl trait` breaks `async-std` (and `pub async fn` in general) . // Since rustdoc never needs to do codegen and doesn't care about link-time reachability, . // mark this as unreachable. . // See https://github.com/rust-lang/rust/issues/75100 60 ( 0.00%) if !self.tcx.sess.opts.actually_rustdoc { . // FIXME: This is some serious pessimization intended to workaround deficiencies . // in the reachability pass (`middle/reachable.rs`). Types are marked as link-time . // reachable if they are returned via `impl Trait`, even from private functions. . let exist_level = . cmp::max(item_level, Some(AccessLevel::ReachableFromImplTrait)); 45 ( 0.00%) self.reach(item.def_id, exist_level).generics().predicates().ty(); . } . } . // Visit everything. . hir::ItemKind::Const(..) . | hir::ItemKind::Static(..) . | hir::ItemKind::Fn(..) . | hir::ItemKind::TyAlias(..) => { 474 ( 0.00%) if item_level.is_some() { 78 ( 0.00%) self.reach(item.def_id, item_level).generics().predicates().ty(); . } . } 18 ( 0.00%) hir::ItemKind::Trait(.., trait_item_refs) => { 12 ( 0.00%) if item_level.is_some() { 72 ( 0.00%) self.reach(item.def_id, item_level).generics().predicates(); . . for trait_item_ref in trait_item_refs { 48 ( 0.00%) let mut reach = self.reach(trait_item_ref.id.def_id, item_level); 96 ( 0.00%) reach.generics().predicates(); . 33 ( 0.00%) if trait_item_ref.kind == AssocItemKind::Type 6 ( 0.00%) && !trait_item_ref.defaultness.has_value() . { . // No type to visit. . } else { 42 ( 0.00%) reach.ty(); . } . } . } . } . hir::ItemKind::TraitAlias(..) => { . if item_level.is_some() { . self.reach(item.def_id, item_level).generics().predicates(); . } . } . // Visit everything except for private impl items. . hir::ItemKind::Impl(ref impl_) => { 1,599 ( 0.00%) if item_level.is_some() { 9,560 ( 0.00%) self.reach(item.def_id, item_level).generics().predicates().ty().trait_ref(); . 956 ( 0.00%) for impl_item_ref in impl_.items { 4,893 ( 0.00%) let impl_item_level = self.get(impl_item_ref.id.def_id); 6,671 ( 0.00%) if impl_item_level.is_some() { 13,660 ( 0.00%) self.reach(impl_item_ref.id.def_id, impl_item_level) . .generics() . .predicates() . .ty(); . } . } . } . } . . // Visit everything, but enum variants have their own levels. . hir::ItemKind::Enum(ref def, _) => { 57 ( 0.00%) if item_level.is_some() { 256 ( 0.00%) self.reach(item.def_id, item_level).generics().predicates(); . } 57 ( 0.00%) for variant in def.variants { 1,944 ( 0.00%) let variant_level = self.get(self.tcx.hir().local_def_id(variant.id)); 216 ( 0.00%) if variant_level.is_some() { 246 ( 0.00%) for field in variant.data.fields() { 945 ( 0.00%) self.reach(self.tcx.hir().local_def_id(field.hir_id), variant_level) . .ty(); . } . // Corner case: if the variant is reachable, but its . // enum is not, make the enum reachable as well. 246 ( 0.00%) self.update(item.def_id, variant_level); . } . } . } . // Visit everything, but foreign items have their own levels. . hir::ItemKind::ForeignMod { items, .. } => { . for foreign_item in items { . let foreign_item_level = self.get(foreign_item.id.def_id); . if foreign_item_level.is_some() { -- line 806 ---------------------------------------- -- line 808 ---------------------------------------- . .generics() . .predicates() . .ty(); . } . } . } . // Visit everything except for private fields. . hir::ItemKind::Struct(ref struct_def, _) | hir::ItemKind::Union(ref struct_def, _) => { 240 ( 0.00%) if item_level.is_some() { 632 ( 0.00%) self.reach(item.def_id, item_level).generics().predicates(); 158 ( 0.00%) for field in struct_def.fields() { 1,911 ( 0.00%) let def_id = self.tcx.hir().local_def_id(field.hir_id); 819 ( 0.00%) let field_level = self.get(def_id); 273 ( 0.00%) if field_level.is_some() { 490 ( 0.00%) self.reach(def_id, field_level).ty(); . } . } . } . } . } . . let orig_level = mem::replace(&mut self.prev_level, item_level); 13,248 ( 0.00%) intravisit::walk_item(self, item); 4,416 ( 0.00%) self.prev_level = orig_level; 35,328 ( 0.00%) } . . fn visit_block(&mut self, b: &'tcx hir::Block<'tcx>) { . // Blocks can have public items, for example impls, but they always . // start as completely private regardless of publicity of a function, . // constant, type, field, etc., in which this block resides. . let orig_level = mem::replace(&mut self.prev_level, None); . intravisit::walk_block(self, b); . self.prev_level = orig_level; . } . } . . impl ReachEverythingInTheInterfaceVisitor<'_, '_> { 17,640 ( 0.00%) fn generics(&mut self) -> &mut Self { 10,080 ( 0.00%) for param in &self.ev.tcx.generics_of(self.item_def_id).params { 5,550 ( 0.00%) match param.kind { . GenericParamDefKind::Lifetime => {} 387 ( 0.00%) GenericParamDefKind::Type { has_default, .. } => { 387 ( 0.00%) if has_default { 60 ( 0.00%) self.visit(self.ev.tcx.type_of(param.def_id)); . } . } . GenericParamDefKind::Const { has_default, .. } => { . self.visit(self.ev.tcx.type_of(param.def_id)); . if has_default { . self.visit(self.ev.tcx.const_param_default(param.def_id)); . } . } . } . } . self 22,680 ( 0.00%) } . 12,600 ( 0.00%) fn predicates(&mut self) -> &mut Self { 7,560 ( 0.00%) self.visit_predicates(self.ev.tcx.predicates_of(self.item_def_id)); . self 15,120 ( 0.00%) } . 12,475 ( 0.00%) fn ty(&mut self) -> &mut Self { 7,590 ( 0.00%) self.visit(self.ev.tcx.type_of(self.item_def_id)); . self 14,970 ( 0.00%) } . . fn trait_ref(&mut self) -> &mut Self { 5,736 ( 0.00%) if let Some(trait_ref) = self.ev.tcx.impl_trait_ref(self.item_def_id) { . self.visit_trait(trait_ref); . } . self . } . } . . impl<'tcx> DefIdVisitor<'tcx> for ReachEverythingInTheInterfaceVisitor<'_, 'tcx> { . fn tcx(&self) -> TyCtxt<'tcx> { 57,448 ( 0.00%) self.ev.tcx . } 57,490 ( 0.00%) fn visit_def_id( . &mut self, . def_id: DefId, . _kind: &str, . _descr: &dyn fmt::Display, . ) -> ControlFlow { 34,503 ( 0.00%) if let Some(def_id) = def_id.as_local() { 35,012 ( 0.00%) if let (ty::Visibility::Public, _) | (_, Some(AccessLevel::ReachableFromImplTrait)) = 8,764 ( 0.00%) (self.tcx().visibility(def_id.to_def_id()), self.access_level) . { . self.ev.update(def_id, self.access_level); . } . } . ControlFlow::CONTINUE 80,486 ( 0.00%) } . } . . ////////////////////////////////////////////////////////////////////////////////////// . /// Name privacy visitor, checks privacy and reports violations. . /// Most of name privacy checks are performed during the main resolution phase, . /// or later in type checking when field accesses and associated items are resolved. . /// This pass performs remaining checks for fields in struct expressions and patterns. . ////////////////////////////////////////////////////////////////////////////////////// -- line 909 ---------------------------------------- -- line 920 ---------------------------------------- . /// `Expr` or `Pat` nodes (they are guaranteed to be found only in bodies). . #[track_caller] . fn typeck_results(&self) -> &'tcx ty::TypeckResults<'tcx> { . self.maybe_typeck_results . .expect("`NamePrivacyVisitor::typeck_results` called outside of body") . } . . // Checks that a field in a struct constructor (expression or pattern) is accessible. 18,650 ( 0.00%) fn check_field( . &mut self, . use_ctxt: Span, // syntax context of the field name at the use site . span: Span, // span of the field pattern, e.g., `x: 0` . def: &'tcx ty::AdtDef, // definition of the struct or enum . field: &'tcx ty::FieldDef, . in_update_syntax: bool, . ) { 3,730 ( 0.00%) if def.is_enum() { . return; . } . . // definition of the field . let ident = Ident::new(kw::Empty, use_ctxt); 2,124 ( 0.00%) let hir_id = self.tcx.hir().local_def_id_to_hir_id(self.current_item); 7,434 ( 0.00%) let def_id = self.tcx.adjust_ident_and_get_scope(ident, def.did, hir_id).1; 1,062 ( 0.00%) if !field.vis.is_accessible_from(def_id, self.tcx) { . let label = if in_update_syntax { . format!("field `{}` is private", field.name) . } else { . "private field".to_string() . }; . . struct_span_err!( . self.tcx.sess, -- line 952 ---------------------------------------- -- line 955 ---------------------------------------- . "field `{}` of {} `{}` is private", . field.name, . def.variant_descr(), . self.tcx.def_path_str(def.did) . ) . .span_label(span, label) . .emit(); . } 14,920 ( 0.00%) } . } . . impl<'tcx> Visitor<'tcx> for NamePrivacyVisitor<'tcx> { . type NestedFilter = nested_filter::All; . . /// We want to visit items in the context of their containing . /// module and so forth, so supply a crate for doing a deep walk. . fn nested_visit_map(&mut self) -> Self::Map { 2,313 ( 0.00%) self.tcx.hir() . } . . fn visit_mod(&mut self, _m: &'tcx hir::Mod<'tcx>, _s: Span, _n: hir::HirId) { . // Don't visit nested modules, since we run a separate visitor walk . // for each module in `privacy_access_levels` . } . . fn visit_nested_body(&mut self, body: hir::BodyId) { . let old_maybe_typeck_results = 6,574 ( 0.00%) self.maybe_typeck_results.replace(self.tcx.typeck_body(body)); 7,506 ( 0.00%) let body = self.tcx.hir().body(body); . self.visit_body(body); 398 ( 0.00%) self.maybe_typeck_results = old_maybe_typeck_results; . } . . fn visit_item(&mut self, item: &'tcx hir::Item<'tcx>) { 1,472 ( 0.00%) let orig_current_item = mem::replace(&mut self.current_item, item.def_id); 4,371 ( 0.00%) intravisit::walk_item(self, item); 1,472 ( 0.00%) self.current_item = orig_current_item; . } . 411,921 ( 0.01%) fn visit_expr(&mut self, expr: &'tcx hir::Expr<'tcx>) { 91,538 ( 0.00%) if let hir::ExprKind::Struct(qpath, fields, ref base) = expr.kind { 1,974 ( 0.00%) let res = self.typeck_results().qpath_res(qpath, expr.hir_id); 987 ( 0.00%) let adt = self.typeck_results().expr_ty(expr).ty_adt_def().unwrap(); 2,961 ( 0.00%) let variant = adt.variant_of_res(res); 1,316 ( 0.00%) if let Some(base) = *base { . // If the expression uses FRU we need to make sure all the unmentioned fields . // are checked for privacy (RFC 736). Rather than computing the set of . // unmentioned fields, just check them all. . for (vf_index, variant_field) in variant.fields.iter().enumerate() { . let field = fields.iter().find(|f| { 56 ( 0.00%) self.tcx.field_index(f.hir_id, self.typeck_results()) == vf_index . }); . let (use_ctxt, span) = match field { 6 ( 0.00%) Some(field) => (field.ident.span, field.span), 24 ( 0.00%) None => (base.span, base.span), . }; 140 ( 0.00%) self.check_field(use_ctxt, span, adt, variant_field, true); . } . } else { . for field in fields { 687 ( 0.00%) let use_ctxt = field.ident.span; 4,735 ( 0.00%) let index = self.tcx.field_index(field.hir_id, self.typeck_results()); 7,557 ( 0.00%) self.check_field(use_ctxt, field.span, adt, &variant.fields[index], false); . } . } . } . 457,690 ( 0.01%) intravisit::walk_expr(self, expr); . } . 62,840 ( 0.00%) fn visit_pat(&mut self, pat: &'tcx hir::Pat<'tcx>) { 16,619 ( 0.00%) if let PatKind::Struct(ref qpath, fields, _) = pat.kind { 6,363 ( 0.00%) let res = self.typeck_results().qpath_res(qpath, pat.hir_id); 3,636 ( 0.00%) let adt = self.typeck_results().pat_ty(pat).ty_adt_def().unwrap(); 7,272 ( 0.00%) let variant = adt.variant_of_res(res); . for field in fields { 1,164 ( 0.00%) let use_ctxt = field.ident.span; 8,304 ( 0.00%) let index = self.tcx.field_index(field.hir_id, self.typeck_results()); 11,640 ( 0.00%) self.check_field(use_ctxt, field.span, adt, &variant.fields[index], false); . } . } . 70,695 ( 0.00%) intravisit::walk_pat(self, pat); . } . } . . //////////////////////////////////////////////////////////////////////////////////////////// . /// Type privacy visitor, checks types for privacy and reports violations. . /// Both explicitly written types and inferred types of expressions and patterns are checked. . /// Checks are performed on "semantic" types regardless of names and their hygiene. . //////////////////////////////////////////////////////////////////////////////////////////// -- line 1045 ---------------------------------------- -- line 1061 ---------------------------------------- . .expect("`TypePrivacyVisitor::typeck_results` called outside of body") . } . . fn item_is_accessible(&self, did: DefId) -> bool { . self.tcx.visibility(did).is_accessible_from(self.current_item.to_def_id(), self.tcx) . } . . // Take node-id of an expression or pattern and check its type for privacy. 396,200 ( 0.01%) fn check_expr_pat_type(&mut self, id: hir::HirId, span: Span) -> bool { 56,600 ( 0.00%) self.span = span; 56,600 ( 0.00%) let typeck_results = self.typeck_results(); . let result: ControlFlow<()> = try { 226,400 ( 0.00%) self.visit(typeck_results.node_type(id))?; 452,800 ( 0.01%) self.visit(typeck_results.node_substs(id))?; 509,400 ( 0.01%) if let Some(adjustments) = typeck_results.adjustments().get(id) { . adjustments.iter().try_for_each(|adjustment| self.visit(adjustment.target))?; . } . }; . result.is_break() 452,800 ( 0.01%) } . . fn check_def_id(&mut self, def_id: DefId, kind: &str, descr: &dyn fmt::Display) -> bool { 243,534 ( 0.00%) let is_error = !self.item_is_accessible(def_id); . if is_error { . self.tcx . .sess . .struct_span_err(self.span, &format!("{} `{}` is private", kind, descr)) . .span_label(self.span, &format!("private {}", kind)) . .emit(); . } . is_error -- line 1091 ---------------------------------------- -- line 1093 ---------------------------------------- . } . . impl<'tcx> Visitor<'tcx> for TypePrivacyVisitor<'tcx> { . type NestedFilter = nested_filter::All; . . /// We want to visit items in the context of their containing . /// module and so forth, so supply a crate for doing a deep walk. . fn nested_visit_map(&mut self) -> Self::Map { 2,313 ( 0.00%) self.tcx.hir() . } . . fn visit_mod(&mut self, _m: &'tcx hir::Mod<'tcx>, _s: Span, _n: hir::HirId) { . // Don't visit nested modules, since we run a separate visitor walk . // for each module in `privacy_access_levels` . } . 12,510 ( 0.00%) fn visit_nested_body(&mut self, body: hir::BodyId) { . let old_maybe_typeck_results = 3,753 ( 0.00%) self.maybe_typeck_results.replace(self.tcx.typeck_body(body)); 7,506 ( 0.00%) let body = self.tcx.hir().body(body); . self.visit_body(body); 1,251 ( 0.00%) self.maybe_typeck_results = old_maybe_typeck_results; 10,008 ( 0.00%) } . . fn visit_generic_arg(&mut self, generic_arg: &'tcx hir::GenericArg<'tcx>) { 14,362 ( 0.00%) match generic_arg { 4,168 ( 0.00%) hir::GenericArg::Type(t) => self.visit_ty(t), . hir::GenericArg::Infer(inf) => self.visit_infer(inf), . hir::GenericArg::Lifetime(_) | hir::GenericArg::Const(_) => {} . } . } . 62,699 ( 0.00%) fn visit_ty(&mut self, hir_ty: &'tcx hir::Ty<'tcx>) { 17,914 ( 0.00%) self.span = hir_ty.span; 26,871 ( 0.00%) if let Some(typeck_results) = self.maybe_typeck_results { . // Types in bodies. 8,178 ( 0.00%) if self.visit(typeck_results.node_type(hir_ty.hir_id)).is_break() { . return; . } . } else { . // Types in signatures. . // FIXME: This is very ineffective. Ideally each HIR type should be converted . // into a semantic type only once and the result should be cached somehow. 18,693 ( 0.00%) if self.visit(rustc_typeck::hir_ty_to_ty(self.tcx, hir_ty)).is_break() { . return; . } . } . 26,871 ( 0.00%) intravisit::walk_ty(self, hir_ty); 53,742 ( 0.00%) } . . fn visit_infer(&mut self, inf: &'tcx hir::InferArg) { . self.span = inf.span; . if let Some(typeck_results) = self.maybe_typeck_results { . if let Some(ty) = typeck_results.node_type_opt(inf.hir_id) { . if self.visit(ty).is_break() { . return; . } -- line 1150 ---------------------------------------- -- line 1152 ---------------------------------------- . // We don't do anything for const infers here. . } . } else { . bug!("visit_infer without typeck_results"); . } . intravisit::walk_inf(self, inf); . } . 5,080 ( 0.00%) fn visit_trait_ref(&mut self, trait_ref: &'tcx hir::TraitRef<'tcx>) { 1,905 ( 0.00%) self.span = trait_ref.path.span; 635 ( 0.00%) if self.maybe_typeck_results.is_none() { . // Avoid calling `hir_trait_to_predicates` in bodies, it will ICE. . // The traits' privacy in bodies is already checked as a part of trait object types. 635 ( 0.00%) let bounds = rustc_typeck::hir_trait_to_predicates( 635 ( 0.00%) self.tcx, . trait_ref, . // NOTE: This isn't really right, but the actual type doesn't matter here. It's . // just required by `ty::TraitRef`. 1,905 ( 0.00%) self.tcx.types.never, . ); . 5,715 ( 0.00%) for (trait_predicate, _, _) in bounds.trait_bounds { 4,445 ( 0.00%) if self.visit_trait(trait_predicate.skip_binder()).is_break() { . return; . } . } . 3,957 ( 0.00%) for (poly_predicate, _) in bounds.projection_bounds { 126 ( 0.00%) let pred = poly_predicate.skip_binder(); . let poly_pred_term = self.visit(pred.term); 84 ( 0.00%) if poly_pred_term.is_break() . || self.visit_projection_ty(pred.projection_ty).is_break() . { . return; . } . } . } . . intravisit::walk_trait_ref(self, trait_ref); 5,080 ( 0.00%) } . . // Check types of expressions 411,921 ( 0.01%) fn visit_expr(&mut self, expr: &'tcx hir::Expr<'tcx>) { 411,921 ( 0.01%) if self.check_expr_pat_type(expr.hir_id, expr.span) { . // Do not check nested expressions if the error already happened. . return; . } 307,767 ( 0.00%) match expr.kind { 1,314 ( 0.00%) hir::ExprKind::Assign(_, rhs, _) | hir::ExprKind::Match(rhs, ..) => { . // Do not report duplicate errors for `x = y` and `match x { ... }`. 7,420 ( 0.00%) if self.check_expr_pat_type(rhs.hir_id, rhs.span) { . return; . } . } 2,751 ( 0.00%) hir::ExprKind::MethodCall(segment, ..) => { . // Method calls have to be checked specially. 5,502 ( 0.00%) self.span = segment.ident.span; 16,506 ( 0.00%) if let Some(def_id) = self.typeck_results().type_dependent_def_id(expr.hir_id) { 8,253 ( 0.00%) if self.visit(self.tcx.type_of(def_id)).is_break() { . return; . } . } else { . self.tcx . .sess . .delay_span_bug(expr.span, "no type-dependent def for method call"); . } . } . _ => {} . } . 137,307 ( 0.00%) intravisit::walk_expr(self, expr); 366,152 ( 0.01%) } . . // Prohibit access to associated items with insufficient nominal visibility. . // . // Additionally, until better reachability analysis for macros 2.0 is available, . // we prohibit access to private statics from other crates, this allows to give . // more code internal visibility at link time. (Access to private functions . // is already prohibited by type privacy for function types.) 253,250 ( 0.00%) fn visit_qpath(&mut self, qpath: &'tcx hir::QPath<'tcx>, id: hir::HirId, span: Span) { 50,650 ( 0.00%) let def = match qpath { 64,443 ( 0.00%) hir::QPath::Resolved(_, path) => match path.res { 60,786 ( 0.00%) Res::Def(kind, def_id) => Some((kind, def_id)), . _ => None, . }, 3,844 ( 0.00%) hir::QPath::TypeRelative(..) | hir::QPath::LangItem(..) => self . .maybe_typeck_results 34,344 ( 0.00%) .and_then(|typeck_results| typeck_results.type_dependent_def(id)), . }; . let def = def.filter(|(kind, _)| { 27,894 ( 0.00%) matches!( . kind, . DefKind::AssocFn | DefKind::AssocConst | DefKind::AssocTy | DefKind::Static . ) . }); . if let Some((kind, def_id)) = def { . let is_local_static = 15,168 ( 0.00%) if let DefKind::Static = kind { def_id.is_local() } else { false }; 8,416 ( 0.00%) if !self.item_is_accessible(def_id) && !is_local_static { . let sess = self.tcx.sess; . let sm = sess.source_map(); . let name = match qpath { . hir::QPath::Resolved(..) | hir::QPath::LangItem(..) => { . sm.span_to_snippet(qpath.span()).ok() . } . hir::QPath::TypeRelative(_, segment) => Some(segment.ident.to_string()), . }; -- line 1258 ---------------------------------------- -- line 1263 ---------------------------------------- . }; . sess.struct_span_err(span, &msg) . .span_label(span, &format!("private {}", kind)) . .emit(); . return; . } . } . 278,575 ( 0.00%) intravisit::walk_qpath(self, qpath, id, span); . } . . // Check types of patterns. . fn visit_pat(&mut self, pattern: &'tcx hir::Pat<'tcx>) { 51,996 ( 0.00%) if self.check_expr_pat_type(pattern.hir_id, pattern.span) { . // Do not check nested patterns if the error already happened. . return; . } . 26,898 ( 0.00%) intravisit::walk_pat(self, pattern); . } . 9,810 ( 0.00%) fn visit_local(&mut self, local: &'tcx hir::Local<'tcx>) { 5,886 ( 0.00%) if let Some(init) = local.init { 13,412 ( 0.00%) if self.check_expr_pat_type(init.hir_id, init.span) { . // Do not report duplicate errors for `let x = y`. . return; . } . } . . intravisit::walk_local(self, local); 7,504 ( 0.00%) } . . // Check types in item interfaces. . fn visit_item(&mut self, item: &'tcx hir::Item<'tcx>) { 1,472 ( 0.00%) let orig_current_item = mem::replace(&mut self.current_item, item.def_id); . let old_maybe_typeck_results = self.maybe_typeck_results.take(); 4,371 ( 0.00%) intravisit::walk_item(self, item); 1,472 ( 0.00%) self.maybe_typeck_results = old_maybe_typeck_results; 1,528 ( 0.00%) self.current_item = orig_current_item; . } . } . . impl<'tcx> DefIdVisitor<'tcx> for TypePrivacyVisitor<'tcx> { . fn tcx(&self) -> TyCtxt<'tcx> { 548,911 ( 0.01%) self.tcx . } 1,826,505 ( 0.03%) fn visit_def_id( . &mut self, . def_id: DefId, . kind: &str, . descr: &dyn fmt::Display, . ) -> ControlFlow { . if self.check_def_id(def_id, kind, descr) { . ControlFlow::BREAK . } else { . ControlFlow::CONTINUE . } 1,095,903 ( 0.02%) } . } . . /////////////////////////////////////////////////////////////////////////////// . /// Obsolete visitors for checking for private items in public interfaces. . /// These visitors are supposed to be kept in frozen state and produce an . /// "old error node set". For backward compatibility the new visitor reports . /// warnings instead of hard errors when the erroneous node is not in this old set. . /////////////////////////////////////////////////////////////////////////////// -- line 1328 ---------------------------------------- -- line 1342 ---------------------------------------- . /// Whether we've recurred at all (i.e., if we're pointing at the . /// first type on which `visit_ty` was called). . at_outer_type: bool, . /// Whether that first type is a public path. . outer_type_is_public_path: bool, . } . . impl<'a, 'tcx> ObsoleteVisiblePrivateTypesVisitor<'a, 'tcx> { 1,532 ( 0.00%) fn path_is_private_type(&self, path: &hir::Path<'_>) -> bool { 4,761 ( 0.00%) let did = match path.res { . Res::PrimTy(..) | Res::SelfTy(..) | Res::Err => return false, 7,806 ( 0.00%) res => res.def_id(), . }; . . // A path can only be private if: . // it's in this crate... 1,301 ( 0.00%) if let Some(did) = did.as_local() { . // .. and it corresponds to a private type in the AST (this returns . // `None` for type parameters). 5,757 ( 0.00%) match self.tcx.hir().find(self.tcx.hir().local_def_id_to_hir_id(did)) { 3,954 ( 0.00%) Some(Node::Item(item)) => !item.vis.node.is_pub(), . Some(_) | None => false, . } . } else { . false . } 3,064 ( 0.00%) } . . fn trait_is_public(&self, trait_id: LocalDefId) -> bool { . // FIXME: this would preferably be using `exported_items`, but all . // traits are exported currently (see `EmbargoVisitor.exported_trait`). . self.access_levels.is_public(trait_id) . } . . fn check_generic_bound(&mut self, bound: &hir::GenericBound<'_>) { 256 ( 0.00%) if let hir::GenericBound::Trait(ref trait_ref, _) = *bound { 64 ( 0.00%) if self.path_is_private_type(trait_ref.trait_ref.path) { . self.old_error_set.insert(trait_ref.trait_ref.hir_ref_id); . } . } . } . . fn item_is_public(&self, def_id: LocalDefId, vis: &hir::Visibility<'_>) -> bool { 1,599 ( 0.00%) self.access_levels.is_reachable(def_id) || vis.node.is_pub() . } . } . . impl<'a, 'b, 'tcx, 'v> Visitor<'v> for ObsoleteCheckTypeForPrivatenessVisitor<'a, 'b, 'tcx> { . fn visit_generic_arg(&mut self, generic_arg: &'v hir::GenericArg<'v>) { 506 ( 0.00%) match generic_arg { . hir::GenericArg::Type(t) => self.visit_ty(t), . hir::GenericArg::Infer(inf) => self.visit_ty(&inf.to_ty()), . hir::GenericArg::Lifetime(_) | hir::GenericArg::Const(_) => {} . } . } . . fn visit_ty(&mut self, ty: &hir::Ty<'_>) { 3,330 ( 0.00%) if let hir::TyKind::Path(hir::QPath::Resolved(_, path)) = ty.kind { 2,276 ( 0.00%) if self.inner.path_is_private_type(path) { . self.contains_private = true; . // Found what we're looking for, so let's stop working. . return; . } . } . if let hir::TyKind::Path(_) = ty.kind { 118 ( 0.00%) if self.at_outer_type { 395 ( 0.00%) self.outer_type_is_public_path = true; . } . } 1,003 ( 0.00%) self.at_outer_type = false; 1,280 ( 0.00%) intravisit::walk_ty(self, ty) 1,672 ( 0.00%) } . . // Don't want to recurse into `[, .. expr]`. . fn visit_expr(&mut self, _: &hir::Expr<'_>) {} . } . . impl<'a, 'tcx> Visitor<'tcx> for ObsoleteVisiblePrivateTypesVisitor<'a, 'tcx> { . type NestedFilter = nested_filter::All; . . /// We want to visit items in the context of their containing . /// module and so forth, so supply a crate for doing a deep walk. . fn nested_visit_map(&mut self) -> Self::Map { 1,648 ( 0.00%) self.tcx.hir() . } . 12,987 ( 0.00%) fn visit_item(&mut self, item: &'tcx hir::Item<'tcx>) { 5,772 ( 0.00%) match item.kind { . // Contents of a private mod can be re-exported, so we need . // to check internals. . hir::ItemKind::Mod(_) => {} . . // An `extern {}` doesn't introduce a new privacy . // namespace (the contents have their own privacies). . hir::ItemKind::ForeignMod { .. } => {} . 8 ( 0.00%) hir::ItemKind::Trait(.., bounds, _) => { 19 ( 0.00%) if !self.trait_is_public(item.def_id) { . return; . } . . for bound in bounds.iter() { . self.check_generic_bound(bound) . } . } . -- line 1447 ---------------------------------------- -- line 1454 ---------------------------------------- . // `impl [... for] Private` is never visible. . let self_contains_private; . // `impl [... for] Public<...>`, but not `impl [... for] . // Vec` or `(Public,)`, etc. . let self_is_public_path; . . // Check the properties of the `Self` type: . { 2,132 ( 0.00%) let mut visitor = ObsoleteCheckTypeForPrivatenessVisitor { . inner: self, . contains_private: false, . at_outer_type: true, . outer_type_is_public_path: false, . }; 533 ( 0.00%) visitor.visit_ty(impl_.self_ty); . self_contains_private = visitor.contains_private; . self_is_public_path = visitor.outer_type_is_public_path; . } . . // Miscellaneous info about the impl: . . // `true` iff this is `impl Private for ...`. . let not_private_trait = impl_.of_trait.as_ref().map_or( . true, // no trait counts as public trait . |tr| { 1,407 ( 0.00%) if let Some(def_id) = tr.path.res.def_id().as_local() { 129 ( 0.00%) self.trait_is_public(def_id) . } else { . true // external traits must be public . } . }, . ); . . // `true` iff this is a trait impl or at least one method is public. . // . // `impl Public { $( fn ...() {} )* }` is not visible. . // . // This is required over just using the methods' privacy . // directly because we might have `impl> ...`, . // and we shouldn't warn about the generics if all the methods . // are private (because `T` won't be visible externally). . let trait_or_some_public_method = impl_.of_trait.is_some() 64 ( 0.00%) || impl_.items.iter().any(|impl_item_ref| { 860 ( 0.00%) let impl_item = self.tcx.hir().impl_item(impl_item_ref.id); 750 ( 0.00%) match impl_item.kind { . hir::ImplItemKind::Const(..) | hir::ImplItemKind::Fn(..) => { . self.access_levels.is_reachable(impl_item_ref.id.def_id) . } . hir::ImplItemKind::TyAlias(_) => false, . } . }); . 982 ( 0.00%) if !self_contains_private && not_private_trait && trait_or_some_public_method { . intravisit::walk_generics(self, &impl_.generics); . 754 ( 0.00%) match impl_.of_trait { . None => { 22 ( 0.00%) for impl_item_ref in impl_.items { . // This is where we choose whether to walk down . // further into the impl to check its items. We . // should only walk into public items so that we . // don't erroneously report errors for private . // types in private items. 1,086 ( 0.00%) let impl_item = self.tcx.hir().impl_item(impl_item_ref.id); 1,015 ( 0.00%) match impl_item.kind { . hir::ImplItemKind::Const(..) | hir::ImplItemKind::Fn(..) 599 ( 0.00%) if self 181 ( 0.00%) .item_is_public(impl_item.def_id, &impl_item.vis) => . { . intravisit::walk_impl_item(self, impl_item) . } . hir::ImplItemKind::TyAlias(..) => { . intravisit::walk_impl_item(self, impl_item) . } . _ => {} . } -- line 1529 ---------------------------------------- -- line 1538 ---------------------------------------- . // . // Those in 1. can only occur if the trait is in . // this crate and will've been warned about on the . // trait definition (there's no need to warn twice . // so we don't check the methods). . // . // Those in 2. are warned via walk_generics and this . // call here. 1,065 ( 0.00%) intravisit::walk_path(self, tr.path); . . // Those in 3. are warned with this call. 355 ( 0.00%) for impl_item_ref in impl_.items { 1,860 ( 0.00%) let impl_item = self.tcx.hir().impl_item(impl_item_ref.id); 2,844 ( 0.00%) if let hir::ImplItemKind::TyAlias(ty) = impl_item.kind { . self.visit_ty(ty); . } . } . } . } 468 ( 0.00%) } else if impl_.of_trait.is_none() && self_is_public_path { . // `impl Public { ... }`. Any public static . // methods will be visible as `Public::foo`. . let mut found_pub_static = false; 20 ( 0.00%) for impl_item_ref in impl_.items { 336 ( 0.00%) if self.access_levels.is_reachable(impl_item_ref.id.def_id) 166 ( 0.00%) || self.tcx.visibility(impl_item_ref.id.def_id) . == ty::Visibility::Public . { 115 ( 0.00%) let impl_item = self.tcx.hir().impl_item(impl_item_ref.id); 296 ( 0.00%) match impl_item_ref.kind { . AssocItemKind::Const => { . found_pub_static = true; . intravisit::walk_impl_item(self, impl_item); . } . AssocItemKind::Fn { has_self: false } => { . found_pub_static = true; . intravisit::walk_impl_item(self, impl_item); . } . _ => {} . } . } . } 40 ( 0.00%) if found_pub_static { 9 ( 0.00%) intravisit::walk_generics(self, &impl_.generics) . } . } . return; . } . . // `type ... = ...;` can contain private types, because . // we're introducing a new name. . hir::ItemKind::TyAlias(..) => return, . . // Not at all public, so we don't care. 5,593 ( 0.00%) _ if !self.item_is_public(item.def_id, &item.vis) => { . return; . } . . _ => {} . } . . // We've carefully constructed it so that if we're here, then . // any `visit_ty`'s will be called on things that are in . // public signatures, i.e., things that we're interested in for . // this visitor. 1,680 ( 0.00%) intravisit::walk_item(self, item); 10,200 ( 0.00%) } . 1,432 ( 0.00%) fn visit_generics(&mut self, generics: &'tcx hir::Generics<'tcx>) { . for param in generics.params { 72 ( 0.00%) for bound in param.bounds { . self.check_generic_bound(bound); . } . } 179 ( 0.00%) for predicate in generics.where_clause.predicates { 96 ( 0.00%) match predicate { . hir::WherePredicate::BoundPredicate(bound_pred) => { 32 ( 0.00%) for bound in bound_pred.bounds.iter() { . self.check_generic_bound(bound) . } . } . hir::WherePredicate::RegionPredicate(_) => {} . hir::WherePredicate::EqPredicate(eq_pred) => { . self.visit_ty(eq_pred.rhs_ty); . } . } . } 1,432 ( 0.00%) } . . fn visit_foreign_item(&mut self, item: &'tcx hir::ForeignItem<'tcx>) { . if self.access_levels.is_reachable(item.def_id) { . intravisit::walk_foreign_item(self, item) . } . } . . fn visit_ty(&mut self, t: &'tcx hir::Ty<'tcx>) { 4,138 ( 0.00%) if let hir::TyKind::Path(hir::QPath::Resolved(_, path)) = t.kind { 2,944 ( 0.00%) if self.path_is_private_type(path) { 20 ( 0.00%) self.old_error_set.insert(t.hir_id); . } . } 5,345 ( 0.00%) intravisit::walk_ty(self, t) . } . 360 ( 0.00%) fn visit_variant( . &mut self, . v: &'tcx hir::Variant<'tcx>, . g: &'tcx hir::Generics<'tcx>, . item_id: hir::HirId, . ) { 450 ( 0.00%) if self.access_levels.is_reachable(self.tcx.hir().local_def_id(v.id)) { 45 ( 0.00%) self.in_variant = true; . intravisit::walk_variant(self, v, g, item_id); 45 ( 0.00%) self.in_variant = false; . } 315 ( 0.00%) } . 1,105 ( 0.00%) fn visit_field_def(&mut self, s: &'tcx hir::FieldDef<'tcx>) { 1,142 ( 0.00%) if s.vis.node.is_pub() || self.in_variant { . intravisit::walk_field_def(self, s); . } 376 ( 0.00%) } . . // We don't need to introspect into these at all: an . // expression/block context can't possibly contain exported things. . // (Making them no-ops stops us from traversing the whole AST without . // having to be super careful about our `walk_...` calls above.) . fn visit_block(&mut self, _: &'tcx hir::Block<'tcx>) {} . fn visit_expr(&mut self, _: &'tcx hir::Expr<'tcx>) {} . } -- line 1667 ---------------------------------------- -- line 1679 ---------------------------------------- . /// The visitor checks that each component type is at least this visible. . required_visibility: ty::Visibility, . has_pub_restricted: bool, . has_old_errors: bool, . in_assoc_ty: bool, . } . . impl SearchInterfaceForPrivateItemsVisitor<'_> { 8,512 ( 0.00%) fn generics(&mut self) -> &mut Self { 3,648 ( 0.00%) for param in &self.tcx.generics_of(self.item_def_id).params { 1,003 ( 0.00%) match param.kind { . GenericParamDefKind::Lifetime => {} 122 ( 0.00%) GenericParamDefKind::Type { has_default, .. } => { 122 ( 0.00%) if has_default { 15 ( 0.00%) self.visit(self.tcx.type_of(param.def_id)); . } . } . // FIXME(generic_const_exprs): May want to look inside const here . GenericParamDefKind::Const { .. } => { . self.visit(self.tcx.type_of(param.def_id)); . } . } . } . self 9,728 ( 0.00%) } . 6,055 ( 0.00%) fn predicates(&mut self) -> &mut Self { . // N.B., we use `explicit_predicates_of` and not `predicates_of` . // because we don't want to report privacy errors due to where . // clauses that the compiler inferred. We only want to . // consider the ones that the user wrote. This is important . // for the inferred outlives rules; see . // `src/test/ui/rfc-2093-infer-outlives/privacy.rs`. 2,422 ( 0.00%) self.visit_predicates(self.tcx.explicit_predicates_of(self.item_def_id)); . self 7,266 ( 0.00%) } . 30 ( 0.00%) fn bounds(&mut self) -> &mut Self { . self.visit_predicates(ty::GenericPredicates { . parent: None, 12 ( 0.00%) predicates: self.tcx.explicit_item_bounds(self.item_def_id), . }); . self 30 ( 0.00%) } . 6,965 ( 0.00%) fn ty(&mut self) -> &mut Self { 2,786 ( 0.00%) self.visit(self.tcx.type_of(self.item_def_id)); . self 6,965 ( 0.00%) } . . fn check_def_id(&mut self, def_id: DefId, kind: &str, descr: &dyn fmt::Display) -> bool { 24,475 ( 0.00%) if self.leaks_private_dep(def_id) { . self.tcx.struct_span_lint_hir( . lint::builtin::EXPORTED_PRIVATE_DEPENDENCIES, . self.tcx.hir().local_def_id_to_hir_id(self.item_def_id), . self.tcx.def_span(self.item_def_id.to_def_id()), . |lint| { . lint.build(&format!( . "{} `{}` from private dependency '{}' in public \ . interface", -- line 1738 ---------------------------------------- -- line 1740 ---------------------------------------- . descr, . self.tcx.crate_name(def_id.krate) . )) . .emit() . }, . ); . } . 13,354 ( 0.00%) let hir_id = match def_id.as_local() { 3,999 ( 0.00%) Some(def_id) => self.tcx.hir().local_def_id_to_hir_id(def_id), . None => return false, . }; . . let vis = self.tcx.visibility(def_id); 6,416 ( 0.00%) if !vis.is_at_least(self.required_visibility, self.tcx) { . let vis_descr = match vis { . ty::Visibility::Public => "public", . ty::Visibility::Invisible => "private", . ty::Visibility::Restricted(vis_def_id) => { . if vis_def_id == self.tcx.parent_module(hir_id).to_def_id() { . "private" . } else if vis_def_id.is_top_level_module() { . "crate-private" -- line 1762 ---------------------------------------- -- line 1792 ---------------------------------------- . false . } . . /// An item is 'leaked' from a private dependency if all . /// of the following are true: . /// 1. It's contained within a public type . /// 2. It comes from a private crate . fn leaks_private_dep(&self, item_id: DefId) -> bool { 16,068 ( 0.00%) let ret = self.required_visibility.is_public() && self.tcx.is_private_dep(item_id.krate); . . tracing::debug!("leaks_private_dep(item_id={:?})={}", item_id, ret); . ret . } . } . . impl<'tcx> DefIdVisitor<'tcx> for SearchInterfaceForPrivateItemsVisitor<'tcx> { . fn tcx(&self) -> TyCtxt<'tcx> { 9,569 ( 0.00%) self.tcx . } 85,696 ( 0.00%) fn visit_def_id( . &mut self, . def_id: DefId, . kind: &str, . descr: &dyn fmt::Display, . ) -> ControlFlow { . if self.check_def_id(def_id, kind, descr) { . ControlFlow::BREAK . } else { . ControlFlow::CONTINUE . } 48,204 ( 0.00%) } . } . . struct PrivateItemsInPublicInterfacesVisitor<'tcx> { . tcx: TyCtxt<'tcx>, . has_pub_restricted: bool, . old_error_set_ancestry: LocalDefIdSet, . } . . impl<'tcx> PrivateItemsInPublicInterfacesVisitor<'tcx> { . fn check( . &self, . def_id: LocalDefId, . required_visibility: ty::Visibility, . ) -> SearchInterfaceForPrivateItemsVisitor<'tcx> { 12,181 ( 0.00%) SearchInterfaceForPrivateItemsVisitor { 1,237 ( 0.00%) tcx: self.tcx, . item_def_id: def_id, . required_visibility, 1,918 ( 0.00%) has_pub_restricted: self.has_pub_restricted, . has_old_errors: self.old_error_set_ancestry.contains(&def_id), . in_assoc_ty: false, . } . } . 11,518 ( 0.00%) fn check_assoc_item( . &self, . def_id: LocalDefId, . assoc_item_kind: AssocItemKind, . defaultness: hir::Defaultness, . vis: ty::Visibility, . ) { . let mut check = self.check(def_id, vis); . 1,772 ( 0.00%) let (check_ty, is_assoc_ty) = match assoc_item_kind { . AssocItemKind::Const | AssocItemKind::Fn { .. } => (true, false), 92 ( 0.00%) AssocItemKind::Type => (defaultness.has_value(), true), . }; 1,772 ( 0.00%) check.in_assoc_ty = is_assoc_ty; 3,544 ( 0.00%) check.generics().predicates(); 93 ( 0.00%) if check_ty { 885 ( 0.00%) check.ty(); . } 7,088 ( 0.00%) } . } . . impl<'tcx> Visitor<'tcx> for PrivateItemsInPublicInterfacesVisitor<'tcx> { . type NestedFilter = nested_filter::OnlyBodies; . . fn nested_visit_map(&mut self) -> Self::Map { 996 ( 0.00%) self.tcx.hir() . } . 13,248 ( 0.00%) fn visit_item(&mut self, item: &'tcx hir::Item<'tcx>) { 1,472 ( 0.00%) let tcx = self.tcx; 1,472 ( 0.00%) let item_visibility = tcx.visibility(item.def_id); . 7,360 ( 0.00%) match item.kind { . // Crates are always public. . hir::ItemKind::ExternCrate(..) => {} . // All nested items are checked by `visit_item`. . hir::ItemKind::Mod(..) => {} . // Checked in resolve. . hir::ItemKind::Use(..) => {} . // No subitems. . hir::ItemKind::Macro(..) | hir::ItemKind::GlobalAsm(..) => {} . // Subitems of these items have inherited publicity. . hir::ItemKind::Const(..) . | hir::ItemKind::Static(..) . | hir::ItemKind::Fn(..) . | hir::ItemKind::TyAlias(..) => { 948 ( 0.00%) self.check(item.def_id, item_visibility).generics().predicates().ty(); . } . hir::ItemKind::OpaqueTy(..) => { . // `ty()` for opaque types is the underlying type, . // it's not a part of interface, so we skip it. 25 ( 0.00%) self.check(item.def_id, item_visibility).generics().bounds(); . } 16 ( 0.00%) hir::ItemKind::Trait(.., trait_item_refs) => { 16 ( 0.00%) self.check(item.def_id, item_visibility).generics().predicates(); . . for trait_item_ref in trait_item_refs { 60 ( 0.00%) self.check_assoc_item( 10 ( 0.00%) trait_item_ref.id.def_id, . trait_item_ref.kind, . trait_item_ref.defaultness, . item_visibility, . ); . 35 ( 0.00%) if let AssocItemKind::Type = trait_item_ref.kind { 6 ( 0.00%) self.check(trait_item_ref.id.def_id, item_visibility).bounds(); . } . } . } . hir::ItemKind::TraitAlias(..) => { . self.check(item.def_id, item_visibility).generics().predicates(); . } . hir::ItemKind::Enum(ref def, _) => { 76 ( 0.00%) self.check(item.def_id, item_visibility).generics().predicates(); . 19 ( 0.00%) for variant in def.variants { 72 ( 0.00%) for field in variant.data.fields() { 768 ( 0.00%) self.check(self.tcx.hir().local_def_id(field.hir_id), item_visibility).ty(); . } . } . } . // Subitems of foreign modules have their own publicity. . hir::ItemKind::ForeignMod { items, .. } => { . for foreign_item in items { . let vis = tcx.visibility(foreign_item.id.def_id); . self.check(foreign_item.id.def_id, vis).generics().predicates().ty(); . } . } . // Subitems of structs and unions have their own publicity. . hir::ItemKind::Struct(ref struct_def, _) | hir::ItemKind::Union(ref struct_def, _) => { 320 ( 0.00%) self.check(item.def_id, item_visibility).generics().predicates(); . 240 ( 0.00%) for field in struct_def.fields() { 1,716 ( 0.00%) let def_id = tcx.hir().local_def_id(field.hir_id); . let field_visibility = tcx.visibility(def_id); 858 ( 0.00%) self.check(def_id, min(item_visibility, field_visibility, tcx)).ty(); . } . } . // An inherent impl is public when its type is public . // Subitems of inherent impls have their own publicity. . // A trait impl is public when both its type and its trait are public . // Subitems of trait impls have inherited publicity. . hir::ItemKind::Impl(ref impl_) => { 2,132 ( 0.00%) let impl_vis = ty::Visibility::of_impl(item.def_id, tcx, &Default::default()); . // check that private components do not appear in the generics or predicates of inherent impls . // this check is intentionally NOT performed for impls of traits, per #90586 1,066 ( 0.00%) if impl_.of_trait.is_none() { 320 ( 0.00%) self.check(item.def_id, impl_vis).generics().predicates(); . } 533 ( 0.00%) for impl_item_ref in impl_.items { 852 ( 0.00%) let impl_item_vis = if impl_.of_trait.is_none() { 351 ( 0.00%) min(tcx.visibility(impl_item_ref.id.def_id), impl_vis, tcx) . } else { . impl_vis . }; 4,905 ( 0.00%) self.check_assoc_item( 876 ( 0.00%) impl_item_ref.id.def_id, . impl_item_ref.kind, . impl_item_ref.defaultness, . impl_item_vis, . ); . } . } . } 11,776 ( 0.00%) } . } . . pub fn provide(providers: &mut Providers) { 8 ( 0.00%) *providers = Providers { . visibility, . privacy_access_levels, . check_private_in_public, . check_mod_privacy, . ..*providers . }; 1 ( 0.00%) } . 26,712 ( 0.00%) fn visibility(tcx: TyCtxt<'_>, def_id: DefId) -> ty::Visibility { 2,968 ( 0.00%) let def_id = def_id.expect_local(); . match tcx.resolutions(()).visibilities.get(&def_id) { 3,670 ( 0.00%) Some(vis) => *vis, . None => { . let hir_id = tcx.hir().local_def_id_to_hir_id(def_id); 13,266 ( 0.00%) match tcx.hir().get(hir_id) { . // Unique types created for closures participate in type privacy checking. . // They have visibilities inherited from the module they are defined in. . Node::Expr(hir::Expr { kind: hir::ExprKind::Closure(..), .. }) => { 672 ( 0.00%) ty::Visibility::Restricted(tcx.parent_module(hir_id).to_def_id()) . } . // - AST lowering may clone `use` items and the clones don't . // get their entries in the resolver's visibility table. . // - AST lowering also creates opaque type items with inherited visibilies. . // Visibility on them should have no effect, but to avoid the visibility . // query failing on some items, we provide it for opaque types as well. . Node::Item(hir::Item { 496 ( 0.00%) vis, . kind: hir::ItemKind::Use(..) | hir::ItemKind::OpaqueTy(..), . .. 2,976 ( 0.00%) }) => ty::Visibility::from_hir(vis, hir_id, tcx), . // Visibilities of trait impl items are inherited from their traits . // and are not filled in resolve. . Node::ImplItem(impl_item) => { 6,825 ( 0.00%) match tcx.hir().get_by_def_id(tcx.hir().get_parent_item(hir_id)) { . Node::Item(hir::Item { . kind: hir::ItemKind::Impl(hir::Impl { of_trait: Some(tr), .. }), . .. 525 ( 0.00%) }) => tr.path.res.opt_def_id().map_or_else( . || { . tcx.sess.delay_span_bug(tr.path.span, "trait without a def-id"); . ty::Visibility::Public . }, . |def_id| tcx.visibility(def_id), . ), . _ => span_bug!(impl_item.span, "the parent is not a trait impl"), . } -- line 2021 ---------------------------------------- -- line 2023 ---------------------------------------- . _ => span_bug!( . tcx.def_span(def_id), . "visibility table unexpectedly missing a def-id: {:?}", . def_id, . ), . } . } . } 23,744 ( 0.00%) } . 360 ( 0.00%) fn check_mod_privacy(tcx: TyCtxt<'_>, module_def_id: LocalDefId) { . // Check privacy of names not checked in previous compilation stages. . let mut visitor = 180 ( 0.00%) NamePrivacyVisitor { tcx, maybe_typeck_results: None, current_item: module_def_id }; 405 ( 0.00%) let (module, span, hir_id) = tcx.hir().get_module(module_def_id); . . intravisit::walk_mod(&mut visitor, module, hir_id); . . // Check privacy of explicitly written types and traits as well as . // inferred types of expressions and patterns. . let mut visitor = 270 ( 0.00%) TypePrivacyVisitor { tcx, maybe_typeck_results: None, current_item: module_def_id, span }; . intravisit::walk_mod(&mut visitor, module, hir_id); 360 ( 0.00%) } . 7 ( 0.00%) fn privacy_access_levels(tcx: TyCtxt<'_>, (): ()) -> &AccessLevels { . // Build up a set of all exported items in the AST. This is a set of all . // items which are reachable from external crates based on visibility. 9 ( 0.00%) let mut visitor = EmbargoVisitor { . tcx, . access_levels: tcx.resolutions(()).access_levels.clone(), . macro_reachable: Default::default(), . prev_level: Some(AccessLevel::Public), . changed: false, . }; . . loop { . tcx.hir().walk_toplevel_module(&mut visitor); 6 ( 0.00%) if visitor.changed { 6 ( 0.00%) visitor.changed = false; . } else { . break; . } . } . 1 ( 0.00%) tcx.arena.alloc(visitor.access_levels) 9 ( 0.00%) } . 8 ( 0.00%) fn check_private_in_public(tcx: TyCtxt<'_>, (): ()) { . let access_levels = tcx.privacy_access_levels(()); . 9 ( 0.00%) let mut visitor = ObsoleteVisiblePrivateTypesVisitor { . tcx, . access_levels, . in_variant: false, . old_error_set: Default::default(), . }; . tcx.hir().walk_toplevel_module(&mut visitor); . . let has_pub_restricted = { 5 ( 0.00%) let mut pub_restricted_visitor = PubRestrictedVisitor { tcx, has_pub_restricted: false }; . tcx.hir().walk_toplevel_module(&mut pub_restricted_visitor); 1 ( 0.00%) pub_restricted_visitor.has_pub_restricted . }; . . let mut old_error_set_ancestry = HirIdSet::default(); 9 ( 0.00%) for mut id in visitor.old_error_set.iter().copied() { . loop { 60 ( 0.00%) if !old_error_set_ancestry.insert(id) { . break; . } 115 ( 0.00%) let parent = tcx.hir().get_parent_node(id); 70 ( 0.00%) if parent == id { . break; . } . id = parent; . } . } . . // Check for private types and traits in public interfaces. 8 ( 0.00%) let mut visitor = PrivateItemsInPublicInterfacesVisitor { . tcx, . has_pub_restricted, . // Only definition IDs are ever searched in `old_error_set_ancestry`, . // so we can filter away all non-definition IDs at this point. . old_error_set_ancestry: old_error_set_ancestry . .into_iter() . .filter_map(|hir_id| tcx.hir().opt_local_def_id(hir_id)) . .collect(), . }; 6 ( 0.00%) tcx.hir().visit_all_item_likes(&mut DeepVisitor::new(&mut visitor)); 8 ( 0.00%) } 1,289,407 ( 0.02%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_parse/src/parser/mod.rs -------------------------------------------------------------------------------- Ir -- line 36 ---------------------------------------- . use rustc_session::parse::ParseSess; . use rustc_span::source_map::{MultiSpan, Span, DUMMY_SP}; . use rustc_span::symbol::{kw, sym, Ident, Symbol}; . use tracing::debug; . . use std::ops::Range; . use std::{cmp, mem, slice}; . 68,978 ( 0.00%) bitflags::bitflags! { . struct Restrictions: u8 { . const STMT_EXPR = 1 << 0; . const NO_STRUCT_LITERAL = 1 << 1; . const CONST_EXPR = 1 << 2; . } . } . . #[derive(Clone, Copy, PartialEq, Debug)] -- line 52 ---------------------------------------- -- line 104 ---------------------------------------- . $self.bump(); . return $self.maybe_recover_from_bad_qpath_stage_2($self.prev_token.span, ty); . } . } . } . }; . } . 321,270 ( 0.00%) #[derive(Clone)] . pub struct Parser<'a> { 13,740 ( 0.00%) pub sess: &'a ParseSess, . /// The current token. 10,606 ( 0.00%) pub token: Token, . /// The spacing for the current token 5,597 ( 0.00%) pub token_spacing: Spacing, . /// The previous token. 15,909 ( 0.00%) pub prev_token: Token, 5,891 ( 0.00%) pub capture_cfg: bool, 12,076 ( 0.00%) restrictions: Restrictions, 11,194 ( 0.00%) expected_tokens: Vec, . // Important: This must only be advanced from `next_tok` . // to ensure that `token_cursor.num_next_calls` is updated properly . token_cursor: TokenCursor, 11,194 ( 0.00%) desugar_doc_comments: bool, . /// This field is used to keep track of how many left angle brackets we have seen. This is . /// required in order to detect extra leading left angle brackets (`<` characters) and error . /// appropriately. . /// . /// See the comments in the `parse_path_segment` function for more details. 11,194 ( 0.00%) unmatched_angle_bracket_count: u32, 16,791 ( 0.00%) max_angle_bracket_count: u32, . /// A list of all unclosed delimiters found by the lexer. If an entry is used for error recovery . /// it gets removed from here. Every entry left at the end gets emitted as an independent . /// error. 5,597 ( 0.00%) pub(super) unclosed_delims: Vec, . last_unexpected_token_span: Option, . /// Span pointing at the `:` for the last type ascription the parser has seen, and whether it . /// looked like it could have been a mistyped path or literal `Option:Some(42)`). . pub last_type_ascription: Option<(Span, bool /* likely path typo */)>, . /// If present, this `Parser` is not parsing Rust code but rather a macro call. . subparser_name: Option<&'static str>, . capture_state: CaptureState, . /// This allows us to recover when the user forget to add braces around -- line 146 ---------------------------------------- -- line 173 ---------------------------------------- . /// the first macro inner attribute to invoke a proc-macro). . /// When create a `TokenStream`, the inner attributes get inserted . /// into the proper place in the token stream. . pub type ReplaceRange = (Range, Vec<(FlatToken, Spacing)>); . . /// Controls how we capture tokens. Capturing can be expensive, . /// so we try to avoid performing capturing in cases where . /// we will never need an `AttrAnnotatedTokenStream` 5,597 ( 0.00%) #[derive(Copy, Clone)] . pub enum Capturing { . /// We aren't performing any capturing - this is the default mode. . No, . /// We are capturing tokens . Yes, . } . 25,228 ( 0.00%) #[derive(Clone)] . struct CaptureState { 22,388 ( 0.00%) capturing: Capturing, 5,597 ( 0.00%) replace_ranges: Vec, . inner_attr_ranges: FxHashMap, . } . . impl<'a> Drop for Parser<'a> { . fn drop(&mut self) { 37,890 ( 0.00%) emit_unclosed_delims(&mut self.unclosed_delims, &self.sess); . } . } . 398,161 ( 0.01%) #[derive(Clone)] . struct TokenCursor { . frame: TokenCursorFrame, 92,695 ( 0.00%) stack: Vec, . desugar_doc_comments: bool, . // Counts the number of calls to `next` or `next_desugared`, . // depending on whether `desugar_doc_comments` is set. 29,229 ( 0.00%) num_next_calls: usize, . // During parsing, we may sometimes need to 'unglue' a . // glued token into two component tokens . // (e.g. '>>' into '>' and '>), so that the parser . // can consume them one at a time. This process . // bypasses the normal capturing mechanism . // (e.g. `num_next_calls` will not be incremented), . // since the 'unglued' tokens due not exist in . // the original `TokenStream`. -- line 217 ---------------------------------------- -- line 226 ---------------------------------------- . // in `Option>` requires us to unglue . // the trailing `>>` token. The `break_last_token` . // field is used to track this token - it gets . // appended to the captured stream when . // we evaluate a `LazyTokenStream` . break_last_token: bool, . } . 178,819 ( 0.00%) #[derive(Clone)] . struct TokenCursorFrame { 49,401 ( 0.00%) delim: token::DelimToken, . span: DelimSpan, . open_delim: bool, 98,802 ( 0.00%) tree_cursor: tokenstream::Cursor, . close_delim: bool, . } . . impl TokenCursorFrame { . fn new(span: DelimSpan, delim: DelimToken, tts: TokenStream) -> Self { 33,840 ( 0.00%) TokenCursorFrame { . delim, . span, . open_delim: false, 36,517 ( 0.00%) tree_cursor: tts.into_trees(), . close_delim: false, . } . } . } . . impl TokenCursor { 2,357,604 ( 0.03%) fn next(&mut self) -> (Token, Spacing) { . loop { 1,141,732 ( 0.02%) let (tree, spacing) = if !self.frame.open_delim { 22,981 ( 0.00%) self.frame.open_delim = true; 114,905 ( 0.00%) TokenTree::open_tt(self.frame.span, self.frame.delim).into() 2,260,129 ( 0.03%) } else if let Some(tree) = self.frame.tree_cursor.next_with_spacing() { . tree 104,122 ( 0.00%) } else if !self.frame.close_delim { 22,282 ( 0.00%) self.frame.close_delim = true; 111,410 ( 0.00%) TokenTree::close_tt(self.frame.span, self.frame.delim).into() 44,492 ( 0.00%) } else if let Some(frame) = self.stack.pop() { 289,198 ( 0.00%) self.frame = frame; . continue; . } else { 135,594 ( 0.00%) (TokenTree::Token(Token::new(token::Eof, DUMMY_SP)), Spacing::Alone) . }; . 438,896 ( 0.01%) match tree { . TokenTree::Token(token) => { 1,571,736 ( 0.02%) return (token, spacing); . } . TokenTree::Delimited(sp, delim, tts) => { . let frame = TokenCursorFrame::new(sp, delim, tts); . self.stack.push(mem::replace(&mut self.frame, frame)); . } . } . } 1,571,736 ( 0.02%) } . 267,560 ( 0.00%) fn next_desugared(&mut self) -> (Token, Spacing) { 80,268 ( 0.00%) let (data, attr_style, sp) = match self.next() { . (Token { kind: token::DocComment(_, attr_style, data), span }, _) => { . (data, attr_style, span) . } 133,780 ( 0.00%) tok => return tok, . }; . . // Searches for the occurrences of `"#*` and returns the minimum number of `#`s . // required to wrap the text. . let mut num_of_hashes = 0; . let mut count = 0; . for ch in data.as_str().chars() { . count = match ch { -- line 298 ---------------------------------------- -- line 332 ---------------------------------------- . .iter() . .cloned() . .collect::() . }, . ), . )); . . self.next() 240,804 ( 0.00%) } . } . 50,190 ( 0.00%) #[derive(Debug, Clone, PartialEq)] . enum TokenType { 40,152 ( 0.00%) Token(TokenKind), . Keyword(Symbol), . Operator, . Lifetime, . Ident, . Path, . Type, . Const, . } -- line 353 ---------------------------------------- -- line 378 ---------------------------------------- . /// The separator token. . sep: Option, . /// `true` if a trailing separator is allowed. . trailing_sep_allowed: bool, . } . . impl SeqSep { . fn trailing_allowed(t: TokenKind) -> SeqSep { 345 ( 0.00%) SeqSep { sep: Some(t), trailing_sep_allowed: true } . } . . fn none() -> SeqSep { . SeqSep { sep: None, trailing_sep_allowed: false } . } . } . . pub enum FollowedByType { . Yes, . No, . } . . fn token_descr_opt(token: &Token) -> Option<&'static str> { 2,226 ( 0.00%) Some(match token.kind { 4,452 ( 0.00%) _ if token.is_special_ident() => "reserved identifier", 4,452 ( 0.00%) _ if token.is_used_keyword() => "keyword", 4,452 ( 0.00%) _ if token.is_unused_keyword() => "reserved keyword", . token::DocComment(..) => "doc comment", . _ => return None, . }) . } . 7,791 ( 0.00%) pub(super) fn token_descr(token: &Token) -> String { 2,226 ( 0.00%) let token_str = pprust::token_to_string(token); . match token_descr_opt(token) { . Some(prefix) => format!("{} `{}`", prefix, token_str), 7,791 ( 0.00%) _ => format!("`{}`", token_str), . } 5,565 ( 0.00%) } . . impl<'a> Parser<'a> { 94,752 ( 0.00%) pub fn new( . sess: &'a ParseSess, . tokens: TokenStream, . desugar_doc_comments: bool, . subparser_name: Option<&'static str>, . ) -> Self { 6,768 ( 0.00%) let mut start_frame = TokenCursorFrame::new(DelimSpan::dummy(), token::NoDelim, tokens); 13,536 ( 0.00%) start_frame.open_delim = true; . start_frame.close_delim = true; . 209,808 ( 0.00%) let mut parser = Parser { . sess, 6,768 ( 0.00%) token: Token::dummy(), . token_spacing: Spacing::Alone, 6,768 ( 0.00%) prev_token: Token::dummy(), . capture_cfg: false, . restrictions: Restrictions::empty(), . expected_tokens: Vec::new(), . token_cursor: TokenCursor { 40,608 ( 0.00%) frame: start_frame, . stack: Vec::new(), . num_next_calls: 0, . desugar_doc_comments, . break_last_token: false, . }, . desugar_doc_comments, . unmatched_angle_bracket_count: 0, . max_angle_bracket_count: 0, -- line 445 ---------------------------------------- -- line 451 ---------------------------------------- . capturing: Capturing::No, . replace_ranges: Vec::new(), . inner_attr_ranges: Default::default(), . }, . current_closure: None, . }; . . // Make parser point to the first token. 13,536 ( 0.00%) parser.bump(); . . parser 60,912 ( 0.00%) } . . fn next_tok(&mut self, fallback_span: Span) -> (Token, Spacing) { . loop { 1,108,254 ( 0.02%) let (mut next, spacing) = if self.desugar_doc_comments { 107,024 ( 0.00%) self.token_cursor.next_desugared() . } else { 473,859 ( 0.01%) self.token_cursor.next() . }; 738,836 ( 0.01%) self.token_cursor.num_next_calls += 1; . // We've retrieved an token from the underlying . // cursor, so we no longer need to worry about . // an unglued token. See `break_and_eat` for more details 184,709 ( 0.00%) self.token_cursor.break_last_token = false; 738,836 ( 0.01%) if next.span.is_dummy() { . // Tweak the location for better diagnostics, but keep syntactic context intact. 27,320 ( 0.00%) next.span = fallback_span.with_ctxt(next.span.ctxt()); . } 620,809 ( 0.01%) if matches!( 369,418 ( 0.01%) next.kind, . token::OpenDelim(token::NoDelim) | token::CloseDelim(token::NoDelim) . ) { . continue; . } 738,836 ( 0.01%) return (next, spacing); . } . } . . pub fn unexpected(&mut self) -> PResult<'a, T> { . match self.expect_one_of(&[], &[]) { . Err(e) => Err(e), . // We can get `Ok(true)` from `recover_closing_delimiter` . // which is called in `expected_one_of_not_found`. . Ok(_) => FatalError.raise(), . } . } . . /// Expects and consumes the token `t`. Signals an error if the next token is not `t`. 158,319 ( 0.00%) pub fn expect(&mut self, t: &TokenKind) -> PResult<'a, bool /* recovered */> { 17,591 ( 0.00%) if self.expected_tokens.is_empty() { 8,796 ( 0.00%) if self.token == *t { 7,330 ( 0.00%) self.bump(); . Ok(false) . } else { . self.unexpected_try_recover(t) . } . } else { 193,500 ( 0.00%) self.expect_one_of(slice::from_ref(t), &[]) . } 263,865 ( 0.00%) } . . /// Expect next token to be edible or inedible token. If edible, . /// then consume it; if inedible, then return without consuming . /// anything. Signal a fatal error if next token is unexpected. 235,776 ( 0.00%) pub fn expect_one_of( . &mut self, . edible: &[TokenKind], . inedible: &[TokenKind], . ) -> PResult<'a, bool /* recovered */> { 39,296 ( 0.00%) if edible.contains(&self.token.kind) { 50,259 ( 0.00%) self.bump(); . Ok(false) . } else if inedible.contains(&self.token.kind) { . // leave it in the input . Ok(false) . } else if self.last_unexpected_token_span == Some(self.token.span) { . FatalError.raise(); . } else { . self.expected_one_of_not_found(edible, inedible) . } 294,720 ( 0.00%) } . . // Public for rustfmt usage. . pub fn parse_ident(&mut self) -> PResult<'a, Ident> { 143,346 ( 0.00%) self.parse_ident_common(true) . } . . fn ident_or_err(&mut self) -> PResult<'a, (Ident, /* is_raw */ bool)> { 108,696 ( 0.00%) self.token.ident().ok_or_else(|| match self.prev_token.kind { . TokenKind::DocComment(..) => { . self.span_err(self.prev_token.span, Error::UselessDocComment) . } . _ => self.expected_ident_found(), . }) . } . 250,453 ( 0.00%) fn parse_ident_common(&mut self, recover: bool) -> PResult<'a, Ident> { 35,779 ( 0.00%) let (ident, is_raw) = self.ident_or_err()?; 214,674 ( 0.00%) if !is_raw && ident.is_reserved() { . let mut err = self.expected_ident_found(); . if recover { . err.emit(); . } else { . return Err(err); . } . } 143,116 ( 0.00%) self.bump(); . Ok(ident) 357,790 ( 0.01%) } . . /// Checks if the next token is `tok`, and returns `true` if so. . /// . /// This method will automatically add `tok` to `expected_tokens` if `tok` is not . /// encountered. 3,419,696 ( 0.05%) fn check(&mut self, tok: &TokenKind) -> bool { 1,492,060 ( 0.02%) let is_present = self.token == *tok; 1,010,202 ( 0.01%) if !is_present { 2,146,568 ( 0.03%) self.expected_tokens.push(TokenType::Token(tok.clone())); . } . is_present 3,419,696 ( 0.05%) } . . /// Consumes a token 'tok' if it exists. Returns whether the given token was present. 2,736 ( 0.00%) pub fn eat(&mut self, tok: &TokenKind) -> bool { 691,048 ( 0.01%) let is_present = self.check(tok); 449,436 ( 0.01%) if is_present { 90,903 ( 0.00%) self.bump() . } . is_present 3,420 ( 0.00%) } . . /// If the next token is the given keyword, returns `true` without eating it. . /// An expectation is also added for diagnostics purposes. 114,380 ( 0.00%) fn check_keyword(&mut self, kw: Symbol) -> bool { 23,122 ( 0.00%) self.expected_tokens.push(TokenType::Keyword(kw)); 711,676 ( 0.01%) self.token.is_keyword(kw) . } . . /// If the next token is the given keyword, eats it and returns `true`. . /// Otherwise, returns `false`. An expectation is also added for diagnostics purposes. . // Public for rustfmt usage. 218,170 ( 0.00%) pub fn eat_keyword(&mut self, kw: Symbol) -> bool { 156,454 ( 0.00%) if self.check_keyword(kw) { 16,288 ( 0.00%) self.bump(); . true . } else { . false . } 218,170 ( 0.00%) } . . fn eat_keyword_noexpect(&mut self, kw: Symbol) -> bool { 20,352 ( 0.00%) if self.token.is_keyword(kw) { 4,698 ( 0.00%) self.bump(); . true . } else { . false . } . } . . /// If the given word is not a keyword, signals an error. . /// If the next token is not the given word, signals an error. . /// Otherwise, eats it. 2,035 ( 0.00%) fn expect_keyword(&mut self, kw: Symbol) -> PResult<'a, ()> { . if !self.eat_keyword(kw) { self.unexpected() } else { Ok(()) } 1,628 ( 0.00%) } . . /// Is the given keyword `kw` followed by a non-reserved identifier? 178,408 ( 0.00%) fn is_kw_followed_by_ident(&self, kw: Symbol) -> bool { 89,204 ( 0.00%) self.token.is_keyword(kw) && self.look_ahead(1, |t| t.is_ident() && !t.is_reserved_ident()) 200,709 ( 0.00%) } . 186,606 ( 0.00%) fn check_or_expected(&mut self, ok: bool, typ: TokenType) -> bool { 73,328 ( 0.00%) if ok { . true . } else { 28,952 ( 0.00%) self.expected_tokens.push(typ); . false . } 186,606 ( 0.00%) } . . fn check_ident(&mut self) -> bool { 35,819 ( 0.00%) self.check_or_expected(self.token.is_ident(), TokenType::Ident) . } . 80,480 ( 0.00%) fn check_path(&mut self) -> bool { 174,603 ( 0.00%) self.check_or_expected(self.token.is_path_start(), TokenType::Path) 100,600 ( 0.00%) } . . fn check_type(&mut self) -> bool { 9,046 ( 0.00%) self.check_or_expected(self.token.can_begin_type(), TokenType::Type) . } . . fn check_const_arg(&mut self) -> bool { 8,464 ( 0.00%) self.check_or_expected(self.token.can_begin_const_arg(), TokenType::Const) . } . 40,419 ( 0.00%) fn check_inline_const(&self, dist: usize) -> bool { 22,455 ( 0.00%) self.is_keyword_ahead(dist, &[kw::Const]) . && self.look_ahead(dist + 1, |t| match t.kind { . token::Interpolated(ref nt) => matches!(**nt, token::NtBlock(..)), . token::OpenDelim(DelimToken::Brace) => true, . _ => false, . }) 40,419 ( 0.00%) } . . /// Checks to see if the next token is either `+` or `+=`. . /// Otherwise returns `false`. . fn check_plus(&mut self) -> bool { 15,664 ( 0.00%) self.check_or_expected( 7,832 ( 0.00%) self.token.is_like_plus(), 7,832 ( 0.00%) TokenType::Token(token::BinOp(token::Plus)), . ) . } . . /// Eats the expected token if it's present possibly breaking . /// compound tokens like multi-character operators in process. . /// Returns `true` if the token was eaten. 286,032 ( 0.00%) fn break_and_eat(&mut self, expected: TokenKind) -> bool { 166,852 ( 0.00%) if self.token.kind == expected { 8,232 ( 0.00%) self.bump(); . return true; . } 98,600 ( 0.00%) match self.token.kind.break_two_token_op() { 899 ( 0.00%) Some((first, second)) if first == expected => { 512 ( 0.00%) let first_span = self.sess.source_map().start_point(self.token.span); 640 ( 0.00%) let second_span = self.token.span.with_lo(first_span.hi()); 1,152 ( 0.00%) self.token = Token::new(first, first_span); . // Keep track of this token - if we end token capturing now, . // we'll want to append this token to the captured stream. . // . // If we consume any additional tokens, then this token . // is not needed (we'll capture the entire 'glued' token), . // and `next_tok` will set this field to `None` 128 ( 0.00%) self.token_cursor.break_last_token = true; . // Use the spacing of the glued token as the spacing . // of the unglued second token. 1,792 ( 0.00%) self.bump_with((Token::new(second, second_span), self.token_spacing)); . true . } . _ => { 58,776 ( 0.00%) self.expected_tokens.push(TokenType::Token(expected)); . false . } . } 292,893 ( 0.00%) } . . /// Eats `+` possibly breaking tokens like `+=` in process. . fn eat_plus(&mut self) -> bool { 824 ( 0.00%) self.break_and_eat(token::BinOp(token::Plus)) . } . . /// Eats `&` possibly breaking tokens like `&&` in process. . /// Signals an error if `&` is not eaten. . fn expect_and(&mut self) -> PResult<'a, ()> { 9,228 ( 0.00%) if self.break_and_eat(token::BinOp(token::And)) { Ok(()) } else { self.unexpected() } . } . . /// Eats `|` possibly breaking tokens like `||` in process. . /// Signals an error if `|` was not eaten. . fn expect_or(&mut self) -> PResult<'a, ()> { 690 ( 0.00%) if self.break_and_eat(token::BinOp(token::Or)) { Ok(()) } else { self.unexpected() } . } . . /// Eats `<` possibly breaking tokens like `<<` in process. 10,390 ( 0.00%) fn eat_lt(&mut self) -> bool { 64,331 ( 0.00%) let ate = self.break_and_eat(token::Lt); 42,505 ( 0.00%) if ate { . // See doc comment for `unmatched_angle_bracket_count`. 5,112 ( 0.00%) self.unmatched_angle_bracket_count += 1; 5,346 ( 0.00%) self.max_angle_bracket_count += 1; . debug!("eat_lt: (increment) count={:?}", self.unmatched_angle_bracket_count); . } . ate 10,390 ( 0.00%) } . . /// Eats `<` possibly breaking tokens like `<<` in process. . /// Signals an error if `<` was not eaten. . fn expect_lt(&mut self) -> PResult<'a, ()> { . if self.eat_lt() { Ok(()) } else { self.unexpected() } . } . . /// Eats `>` possibly breaking tokens like `>>` in process. . /// Signals an error if `>` was not eaten. . fn expect_gt(&mut self) -> PResult<'a, ()> { 7,506 ( 0.00%) if self.break_and_eat(token::Gt) { . // See doc comment for `unmatched_angle_bracket_count`. 3,753 ( 0.00%) if self.unmatched_angle_bracket_count > 0 { 2,502 ( 0.00%) self.unmatched_angle_bracket_count -= 1; . debug!("expect_gt: (decrement) count={:?}", self.unmatched_angle_bracket_count); . } . Ok(()) . } else { . self.unexpected() . } . } . . fn expect_any_with_type(&mut self, kets: &[&TokenKind], expect: TokenExpectType) -> bool { . kets.iter().any(|k| match expect { 56,076 ( 0.00%) TokenExpectType::Expect => self.check(k), 1,797 ( 0.00%) TokenExpectType::NoExpect => self.token == **k, . }) . } . . fn parse_seq_to_before_tokens( . &mut self, . kets: &[&TokenKind], . sep: SeqSep, . expect: TokenExpectType, -- line 759 ---------------------------------------- -- line 761 ---------------------------------------- . ) -> PResult<'a, (Vec, bool /* trailing */, bool /* recovered */)> { . let mut first = true; . let mut recovered = false; . let mut trailing = false; . let mut v = vec![]; . let unclosed_delims = !self.unclosed_delims.is_empty(); . . while !self.expect_any_with_type(kets, expect) { 61,697 ( 0.00%) if let token::CloseDelim(..) | token::Eof = self.token.kind { . break; . } 42,412 ( 0.00%) if let Some(ref t) = sep.sep { 48,640 ( 0.00%) if first { . first = false; . } else { 33,602 ( 0.00%) match self.expect(t) { . Ok(false) => { . self.current_closure.take(); . } . Ok(true) => { . self.current_closure.take(); . recovered = true; . break; . } -- line 784 ---------------------------------------- -- line 857 ---------------------------------------- . e.cancel(); . break; . } . } . } . } . } . } 21,798 ( 0.00%) if sep.trailing_sep_allowed && self.expect_any_with_type(kets, expect) { . trailing = true; . break; . } . 13,468 ( 0.00%) let t = f(self)?; 11,103 ( 0.00%) v.push(t); . } . 35,732 ( 0.00%) Ok((v, trailing, recovered)) . } . . fn recover_missing_braces_around_closure_body( . &mut self, . closure_spans: ClosureSpans, . mut expect_err: DiagnosticBuilder<'_>, . ) -> PResult<'a, ()> { . let initial_semicolon = self.token.span; -- line 882 ---------------------------------------- -- line 937 ---------------------------------------- . /// `f` must consume tokens until reaching the next separator or . /// closing bracket. . fn parse_seq_to_before_end( . &mut self, . ket: &TokenKind, . sep: SeqSep, . f: impl FnMut(&mut Parser<'a>) -> PResult<'a, T>, . ) -> PResult<'a, (Vec, bool, bool)> { 35,953 ( 0.00%) self.parse_seq_to_before_tokens(&[ket], sep, TokenExpectType::Expect, f) . } . . /// Parses a sequence, including the closing delimiter. The function . /// `f` must consume tokens until reaching the next separator or . /// closing bracket. 61,270 ( 0.00%) fn parse_seq_to_end( . &mut self, . ket: &TokenKind, . sep: SeqSep, . f: impl FnMut(&mut Parser<'a>) -> PResult<'a, T>, . ) -> PResult<'a, (Vec, bool /* trailing */)> { 23,947 ( 0.00%) let (val, trailing, recovered) = self.parse_seq_to_before_end(ket, sep, f)?; 11,325 ( 0.00%) if !recovered { . self.eat(ket); . } 63,756 ( 0.00%) Ok((val, trailing)) 49,016 ( 0.00%) } . . /// Parses a sequence, including the closing delimiter. The function . /// `f` must consume tokens until reaching the next separator or . /// closing bracket. . fn parse_unspanned_seq( . &mut self, . bra: &TokenKind, . ket: &TokenKind, . sep: SeqSep, . f: impl FnMut(&mut Parser<'a>) -> PResult<'a, T>, . ) -> PResult<'a, (Vec, bool)> { 21,614 ( 0.00%) self.expect(bra)?; 49,016 ( 0.00%) self.parse_seq_to_end(ket, sep, f) . } . . fn parse_delim_comma_seq( . &mut self, . delim: DelimToken, . f: impl FnMut(&mut Parser<'a>) -> PResult<'a, T>, . ) -> PResult<'a, (Vec, bool)> { . self.parse_unspanned_seq( 8,165 ( 0.00%) &token::OpenDelim(delim), 10,223 ( 0.00%) &token::CloseDelim(delim), . SeqSep::trailing_allowed(token::Comma), . f, . ) . } . . fn parse_paren_comma_seq( . &mut self, . f: impl FnMut(&mut Parser<'a>) -> PResult<'a, T>, . ) -> PResult<'a, (Vec, bool)> { . self.parse_delim_comma_seq(token::Paren, f) . } . . /// Advance the parser by one token using provided token as the next one. 2,402,881 ( 0.03%) fn bump_with(&mut self, (next_token, next_spacing): (Token, Spacing)) { . // Bumping after EOF is a bad sign, usually an infinite loop. 1,109,022 ( 0.02%) if self.prev_token.kind == TokenKind::Eof { . let msg = "attempted to bump the parser past EOF (may be stuck in a loop)"; . self.span_bug(self.token.span, msg); . } . . // Update the current and previous tokens. 739,348 ( 0.01%) self.prev_token = mem::replace(&mut self.token, next_token); 184,837 ( 0.00%) self.token_spacing = next_spacing; . . // Diagnostics. 184,837 ( 0.00%) self.expected_tokens.clear(); . } . . /// Advance the parser by one token. 1,477,672 ( 0.02%) pub fn bump(&mut self) { 738,836 ( 0.01%) let next_token = self.next_tok(self.token.span); 1,108,254 ( 0.02%) self.bump_with(next_token); 1,477,672 ( 0.02%) } . . /// Look-ahead `dist` tokens of `self.token` and get access to that token there. . /// When `dist == 0` then the current token is looked at. 4,232 ( 0.00%) pub fn look_ahead(&self, dist: usize, looker: impl FnOnce(&Token) -> R) -> R { 15,210 ( 0.00%) if dist == 0 { 5,629 ( 0.00%) return looker(&self.token); . } . 59,541 ( 0.00%) let frame = &self.token_cursor.frame; 66,073 ( 0.00%) if frame.delim != DelimToken::NoDelim { . let all_normal = (0..dist).all(|i| { 173,741 ( 0.00%) let token = frame.tree_cursor.look_ahead(i); 230,841 ( 0.00%) !matches!(token, Some(TokenTree::Delimited(_, DelimToken::NoDelim, _))) . }); . if all_normal { 279,378 ( 0.00%) return match frame.tree_cursor.look_ahead(dist - 1) { 98,648 ( 0.00%) Some(tree) => match tree { 45,483 ( 0.00%) TokenTree::Token(token) => looker(token), . TokenTree::Delimited(dspan, delim, _) => { 31,084 ( 0.00%) looker(&Token::new(token::OpenDelim(*delim), dspan.open)) . } . }, 48,702 ( 0.00%) None => looker(&Token::new(token::CloseDelim(frame.delim), frame.span.close)), . }; . } . } . . let mut cursor = self.token_cursor.clone(); . let mut i = 0; 10,330 ( 0.00%) let mut token = Token::dummy(); 10,324 ( 0.00%) while i < dist { 76,137 ( 0.00%) token = cursor.next().0; 32,937 ( 0.00%) if matches!( 20,682 ( 0.00%) token.kind, . token::OpenDelim(token::NoDelim) | token::CloseDelim(token::NoDelim) . ) { . continue; . } 4,620 ( 0.00%) i += 1; . } 1,000 ( 0.00%) return looker(&token); 4,734 ( 0.00%) } . . /// Returns whether any of the given keywords are `dist` tokens ahead of the current one. 59,031 ( 0.00%) fn is_keyword_ahead(&self, dist: usize, kws: &[Symbol]) -> bool { 15,514 ( 0.00%) self.look_ahead(dist, |t| kws.iter().any(|&kw| t.is_keyword(kw))) 59,031 ( 0.00%) } . . /// Parses asyncness: `async` or nothing. . fn parse_asyncness(&mut self) -> Async { . if self.eat_keyword(kw::Async) { 5 ( 0.00%) let span = self.prev_token.uninterpolated_span(); . Async::Yes { span, closure_id: DUMMY_NODE_ID, return_impl_trait_id: DUMMY_NODE_ID } . } else { . Async::No . } . } . . /// Parses unsafety: `unsafe` or nothing. 2,478 ( 0.00%) fn parse_unsafety(&mut self) -> Unsafe { . if self.eat_keyword(kw::Unsafe) { 120 ( 0.00%) Unsafe::Yes(self.prev_token.uninterpolated_span()) . } else { . Unsafe::No . } 9,912 ( 0.00%) } . . /// Parses constness: `const` or nothing. 32,048 ( 0.00%) fn parse_constness(&mut self) -> Const { . // Avoid const blocks to be parsed as const items 9,134 ( 0.00%) if self.look_ahead(1, |t| t != &token::OpenDelim(DelimToken::Brace)) . && self.eat_keyword(kw::Const) . { 330 ( 0.00%) Const::Yes(self.prev_token.uninterpolated_span()) . } else { . Const::No . } 56,084 ( 0.00%) } . . /// Parses inline const expressions. . fn parse_const_block(&mut self, span: Span, pat: bool) -> PResult<'a, P> { . if pat { . self.sess.gated_spans.gate(sym::inline_const_pat, span); . } else { . self.sess.gated_spans.gate(sym::inline_const, span); . } -- line 1104 ---------------------------------------- -- line 1108 ---------------------------------------- . id: DUMMY_NODE_ID, . value: self.mk_expr(blk.span, ExprKind::Block(blk, None), AttrVec::new()), . }; . let blk_span = anon_const.value.span; . Ok(self.mk_expr(span.to(blk_span), ExprKind::ConstBlock(anon_const), AttrVec::new())) . } . . /// Parses mutability (`mut` or nothing). 300 ( 0.00%) fn parse_mutability(&mut self) -> Mutability { . if self.eat_keyword(kw::Mut) { Mutability::Mut } else { Mutability::Not } 3,532 ( 0.00%) } . . /// Possibly parses mutability (`const` or `mut`). 204 ( 0.00%) fn parse_const_or_mut(&mut self) -> Option { . if self.eat_keyword(kw::Mut) { . Some(Mutability::Mut) . } else if self.eat_keyword(kw::Const) { . Some(Mutability::Not) . } else { . None . } 204 ( 0.00%) } . . fn parse_field_name(&mut self) -> PResult<'a, Ident> { 900 ( 0.00%) if let token::Literal(token::Lit { kind: token::Integer, symbol, suffix }) = self.token.kind . { . self.expect_no_suffix(self.token.span, "a tuple index", suffix); . self.bump(); . Ok(Ident::new(symbol, self.prev_token.span)) . } else { 1,350 ( 0.00%) self.parse_ident_common(true) . } . } . . fn parse_mac_args(&mut self) -> PResult<'a, P> { 12,628 ( 0.00%) self.parse_mac_args_common(true).map(P) . } . . fn parse_attr_args(&mut self) -> PResult<'a, MacArgs> { 1,512 ( 0.00%) self.parse_mac_args_common(false) . } . 45,936 ( 0.00%) fn parse_mac_args_common(&mut self, delimited_only: bool) -> PResult<'a, MacArgs> { 40,832 ( 0.00%) Ok( 26,048 ( 0.00%) if self.check(&token::OpenDelim(DelimToken::Paren)) 549 ( 0.00%) || self.check(&token::OpenDelim(DelimToken::Bracket)) 243 ( 0.00%) || self.check(&token::OpenDelim(DelimToken::Brace)) . { 20,160 ( 0.00%) match self.parse_token_tree() { 25,200 ( 0.00%) TokenTree::Delimited(dspan, delim, tokens) => . // We've confirmed above that there is a delimiter so unwrapping is OK. . { 10,080 ( 0.00%) MacArgs::Delimited(dspan, MacDelimiter::from_token(delim).unwrap(), tokens) . } . _ => unreachable!(), . } 128 ( 0.00%) } else if !delimited_only { . if self.eat(&token::Eq) { 7 ( 0.00%) let eq_span = self.prev_token.span; . . // Collect tokens because they are used during lowering to HIR. 7 ( 0.00%) let expr = self.parse_expr_force_collect()?; 7 ( 0.00%) let span = expr.span; . 35 ( 0.00%) let token_kind = token::Interpolated(Lrc::new(token::NtExpr(expr))); 63 ( 0.00%) MacArgs::Eq(eq_span, Token::new(token_kind, span)) . } else { . MacArgs::Empty . } . } else { . return self.unexpected(); . }, . ) 35,728 ( 0.00%) } . . fn parse_or_use_outer_attributes( . &mut self, . already_parsed_attrs: Option, . ) -> PResult<'a, AttrWrapper> { 70,531 ( 0.00%) if let Some(attrs) = already_parsed_attrs { . Ok(attrs) . } else { 38,402 ( 0.00%) self.parse_outer_attributes() . } . } . . /// Parses a single token tree from the input. 96,456 ( 0.00%) pub(crate) fn parse_token_tree(&mut self) -> TokenTree { 63,039 ( 0.00%) match self.token.kind { . token::OpenDelim(..) => { . let depth = self.token_cursor.stack.len(); . . // We keep advancing the token cursor until we hit . // the matching `CloseDelim` token. 124,556 ( 0.00%) while !(depth == self.token_cursor.stack.len() . && matches!(self.token.kind, token::CloseDelim(_))) . { . // Advance one token at a time, so `TokenCursor::next()` . // can capture these tokens if necessary. 69,398 ( 0.00%) self.bump(); . } . // We are still inside the frame corresponding . // to the delimited stream we captured, so grab . // the tokens from this frame. . let frame = &self.token_cursor.frame; 10,680 ( 0.00%) let stream = frame.tree_cursor.stream.clone(); 10,680 ( 0.00%) let span = frame.span; 5,340 ( 0.00%) let delim = frame.delim; . // Consume close delimiter 10,680 ( 0.00%) self.bump(); 26,700 ( 0.00%) TokenTree::Delimited(span, delim, stream) . } . token::CloseDelim(_) | token::Eof => unreachable!(), . _ => { 13,434 ( 0.00%) self.bump(); 33,585 ( 0.00%) TokenTree::Token(self.prev_token.clone()) . } . } 84,399 ( 0.00%) } . . /// Parses a stream of tokens into a list of `TokenTree`s, up to EOF. . pub fn parse_all_token_trees(&mut self) -> PResult<'a, Vec> { . let mut tts = Vec::new(); . while self.token != token::Eof { . tts.push(self.parse_token_tree()); . } . Ok(tts) . } . 208 ( 0.00%) pub fn parse_tokens(&mut self) -> TokenStream { . let mut result = Vec::new(); . loop { 622 ( 0.00%) match self.token.kind { . token::Eof | token::CloseDelim(..) => break, 264 ( 0.00%) _ => result.push(self.parse_token_tree().into()), . } . } 156 ( 0.00%) TokenStream::new(result) 208 ( 0.00%) } . . /// Evaluates the closure with restrictions in place. . /// . /// Afters the closure is evaluated, restrictions are reset. . fn with_res(&mut self, res: Restrictions, f: impl FnOnce(&mut Self) -> T) -> T { 23,793 ( 0.00%) let old = self.restrictions; 30,446 ( 0.00%) self.restrictions = res; . let res = f(self); 30,485 ( 0.00%) self.restrictions = old; . res . } . 62,032 ( 0.00%) fn is_crate_vis(&self) -> bool { 38,770 ( 0.00%) self.token.is_keyword(kw::Crate) && self.look_ahead(1, |t| t != &token::ModSep) 69,786 ( 0.00%) } . . /// Parses `pub`, `pub(crate)` and `pub(in path)` plus shortcuts `crate` for `pub(crate)`, . /// `pub(self)` for `pub(in self)` and `pub(super)` for `pub(in super)`. . /// If the following element can't be a tuple (i.e., it's a function definition), then . /// it's not a tuple struct field), and the contents within the parentheses aren't valid, . /// so emit a proper diagnostic. . // Public for rustfmt usage. 43,630 ( 0.00%) pub fn parse_visibility(&mut self, fbt: FollowedByType) -> PResult<'a, Visibility> { 8,783 ( 0.00%) maybe_whole!(self, NtVis, |x| x); . 4,363 ( 0.00%) self.expected_tokens.push(TokenType::Keyword(kw::Crate)); 17,452 ( 0.00%) if self.is_crate_vis() { . self.bump(); // `crate` . self.sess.gated_spans.gate(sym::crate_visibility_modifier, self.prev_token.span); . return Ok(Visibility { . span: self.prev_token.span, . kind: VisibilityKind::Crate(CrateSugar::JustCrate), . tokens: None, . }); . } . . if !self.eat_keyword(kw::Pub) { . // We need a span for our `Spanned`, but there's inherently no . // keyword to grab a span from for inherited visibility; an empty span at the . // beginning of the current token would seem to be the "Schelling span". 3,653 ( 0.00%) return Ok(Visibility { 10,959 ( 0.00%) span: self.token.span.shrink_to_lo(), . kind: VisibilityKind::Inherited, . tokens: None, . }); . } 710 ( 0.00%) let lo = self.prev_token.span; . 3,550 ( 0.00%) if self.check(&token::OpenDelim(token::Paren)) { . // We don't `self.bump()` the `(` yet because this might be a struct definition where . // `()` or a tuple might be allowed. For example, `struct Struct(pub (), pub (usize));`. . // Because of this, we only `bump` the `(` if we're assured it is appropriate to do so . // by the following tokens. 2,208 ( 0.00%) if self.is_keyword_ahead(1, &[kw::Crate]) && self.look_ahead(2, |t| t != &token::ModSep) . // account for `pub(crate::foo)` . { . // Parse `pub(crate)`. 645 ( 0.00%) self.bump(); // `(` 430 ( 0.00%) self.bump(); // `crate` 645 ( 0.00%) self.expect(&token::CloseDelim(token::Paren))?; // `)` 215 ( 0.00%) let vis = VisibilityKind::Crate(CrateSugar::PubCrate); . return Ok(Visibility { 645 ( 0.00%) span: lo.to(self.prev_token.span), . kind: vis, . tokens: None, . }); 273 ( 0.00%) } else if self.is_keyword_ahead(1, &[kw::In]) { . // Parse `pub(in path)`. 39 ( 0.00%) self.bump(); // `(` 39 ( 0.00%) self.bump(); // `in` 13 ( 0.00%) let path = self.parse_path(PathStyle::Mod)?; // `path` 39 ( 0.00%) self.expect(&token::CloseDelim(token::Paren))?; // `)` 143 ( 0.00%) let vis = VisibilityKind::Restricted { path: P(path), id: ast::DUMMY_NODE_ID }; . return Ok(Visibility { 52 ( 0.00%) span: lo.to(self.prev_token.span), . kind: vis, . tokens: None, . }); 104 ( 0.00%) } else if self.look_ahead(2, |t| t == &token::CloseDelim(token::Paren)) 130 ( 0.00%) && self.is_keyword_ahead(1, &[kw::Super, kw::SelfLower]) . { . // Parse `pub(self)` or `pub(super)`. 78 ( 0.00%) self.bump(); // `(` 26 ( 0.00%) let path = self.parse_path(PathStyle::Mod)?; // `super`/`self` 78 ( 0.00%) self.expect(&token::CloseDelim(token::Paren))?; // `)` 286 ( 0.00%) let vis = VisibilityKind::Restricted { path: P(path), id: ast::DUMMY_NODE_ID }; . return Ok(Visibility { 104 ( 0.00%) span: lo.to(self.prev_token.span), . kind: vis, . tokens: None, . }); . } else if let FollowedByType::No = fbt { . // Provide this diagnostic if a type cannot follow; . // in particular, if this is not a tuple struct. . self.recover_incorrect_vis_restriction()?; . // Emit diagnostic, but continue with public visibility. . } . } . 1,368 ( 0.00%) Ok(Visibility { span: lo, kind: VisibilityKind::Public, tokens: None }) 39,267 ( 0.00%) } . . /// Recovery for e.g. `pub(something) fn ...` or `struct X { pub(something) y: Z }` . fn recover_incorrect_vis_restriction(&mut self) -> PResult<'a, ()> { . self.bump(); // `(` . let path = self.parse_path(PathStyle::Mod)?; . self.expect(&token::CloseDelim(token::Paren))?; // `)` . . let msg = "incorrect visibility restriction"; -- line 1355 ---------------------------------------- -- line 1370 ---------------------------------------- . ) . .emit(); . . Ok(()) . } . . /// Parses `extern string_literal?`. . fn parse_extern(&mut self) -> Extern { 843 ( 0.00%) if self.eat_keyword(kw::Extern) { Extern::from_abi(self.parse_abi()) } else { Extern::None } . } . . /// Parses a string literal as an ABI spec. . fn parse_abi(&mut self) -> Option { . match self.parse_str_lit() { . Ok(str_lit) => Some(str_lit), . Err(Some(lit)) => match lit.kind { . ast::LitKind::Err(_) => None, -- line 1386 ---------------------------------------- -- line 1395 ---------------------------------------- . .emit(); . None . } . }, . Err(None) => None, . } . } . 14,310 ( 0.00%) pub fn collect_tokens_no_attrs( . &mut self, . f: impl FnOnce(&mut Self) -> PResult<'a, R>, . ) -> PResult<'a, R> { . // The only reason to call `collect_tokens_no_attrs` is if you want tokens, so use . // `ForceCollect::Yes` . self.collect_tokens_trailing_token( . AttrWrapper::empty(), . ForceCollect::Yes, 3,704 ( 0.00%) |this, _attrs| Ok((f(this)?, TrailingToken::None)), . ) 14,310 ( 0.00%) } . . /// `::{` or `::*` 237,440 ( 0.00%) fn is_import_coupler(&mut self) -> bool { 118,720 ( 0.00%) self.check(&token::ModSep) . && self.look_ahead(1, |t| { 65,018 ( 0.00%) *t == token::OpenDelim(token::Brace) || *t == token::BinOp(token::Star) . }) 236,214 ( 0.00%) } . . pub fn clear_expected_tokens(&mut self) { . self.expected_tokens.clear(); . } . } . . crate fn make_unclosed_delims_error( . unmatched: UnmatchedBrace, -- line 1430 ---------------------------------------- -- line 1450 ---------------------------------------- . err.span_label(sp, "closing delimiter possibly meant for this"); . } . if let Some(sp) = unmatched.unclosed_span { . err.span_label(sp, "unclosed delimiter"); . } . Some(err) . } . 98,920 ( 0.00%) pub fn emit_unclosed_delims(unclosed_delims: &mut Vec, sess: &ParseSess) { 49,460 ( 0.00%) *sess.reached_eof.borrow_mut() |= . unclosed_delims.iter().any(|unmatched_delim| unmatched_delim.found_delim.is_none()); 49,460 ( 0.00%) for unmatched in unclosed_delims.drain(..) { . if let Some(mut e) = make_unclosed_delims_error(unmatched, sess) { . e.emit(); . } . } 98,920 ( 0.00%) } . . /// A helper struct used when building an `AttrAnnotatedTokenStream` from . /// a `LazyTokenStream`. Both delimiter and non-delimited tokens . /// are stored as `FlatToken::Token`. A vector of `FlatToken`s . /// is then 'parsed' to build up an `AttrAnnotatedTokenStream` with nested . /// `AttrAnnotatedTokenTree::Delimited` tokens 765 ( 0.00%) #[derive(Debug, Clone)] . pub enum FlatToken { . /// A token - this holds both delimiter (e.g. '{' and '}') . /// and non-delimiter tokens . Token(Token), . /// Holds the `AttributesData` for an AST node. The . /// `AttributesData` is inserted directly into the . /// constructed `AttrAnnotatedTokenStream` as . /// an `AttrAnnotatedTokenTree::Attributes` -- line 1481 ---------------------------------------- 1,208,384 ( 0.02%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_mir_dataflow/src/drop_flag_effects.rs -------------------------------------------------------------------------------- Ir -- line 10 ---------------------------------------- . pub fn move_path_children_matching<'tcx, F>( . move_data: &MoveData<'tcx>, . path: MovePathIndex, . mut cond: F, . ) -> Option . where . F: FnMut(mir::PlaceElem<'tcx>) -> bool, . { 29 ( 0.00%) let mut next_child = move_data.move_paths[path].first_child; 74 ( 0.00%) while let Some(child_index) = next_child { . let move_path_children = &move_data.move_paths[child_index]; 68 ( 0.00%) if let Some(&elem) = move_path_children.place.projection.last() { 115 ( 0.00%) if cond(elem) { . return Some(child_index); . } . } . next_child = move_path_children.next_sibling; . } . . None . } -- line 30 ---------------------------------------- -- line 48 ---------------------------------------- . // . // FIXME: we have to do something for moving slice patterns. . fn place_contents_drop_state_cannot_differ<'tcx>( . tcx: TyCtxt<'tcx>, . body: &Body<'tcx>, . place: mir::Place<'tcx>, . ) -> bool { . let ty = place.ty(body, tcx).ty; 2,072,758 ( 0.03%) match ty.kind() { . ty::Array(..) => { . debug!( . "place_contents_drop_state_cannot_differ place: {:?} ty: {:?} => false", . place, ty . ); . false . } . ty::Slice(..) | ty::Ref(..) | ty::RawPtr(..) => { . debug!( . "place_contents_drop_state_cannot_differ place: {:?} ty: {:?} refd => true", . place, ty . ); . true . } 1,185,057 ( 0.02%) ty::Adt(def, _) if (def.has_dtor(tcx) && !def.is_box()) || def.is_union() => { . debug!( . "place_contents_drop_state_cannot_differ place: {:?} ty: {:?} Drop => true", . place, ty . ); . true . } . _ => false, . } -- line 79 ---------------------------------------- -- line 83 ---------------------------------------- . tcx: TyCtxt<'tcx>, . body: &Body<'tcx>, . move_data: &MoveData<'tcx>, . lookup_result: LookupResult, . each_child: F, . ) where . F: FnMut(MovePathIndex), . { 49,934 ( 0.00%) match lookup_result { . LookupResult::Parent(..) => { . // access to untracked value - do not touch children . } . LookupResult::Exact(e) => on_all_children_bits(tcx, body, move_data, e, each_child), . } . } . . pub fn on_all_children_bits<'tcx, F>( -- line 99 ---------------------------------------- -- line 100 ---------------------------------------- . tcx: TyCtxt<'tcx>, . body: &Body<'tcx>, . move_data: &MoveData<'tcx>, . move_path_index: MovePathIndex, . mut each_child: F, . ) where . F: FnMut(MovePathIndex), . { 3,208,000 ( 0.05%) fn is_terminal_path<'tcx>( . tcx: TyCtxt<'tcx>, . body: &Body<'tcx>, . move_data: &MoveData<'tcx>, . path: MovePathIndex, . ) -> bool { 802,000 ( 0.01%) place_contents_drop_state_cannot_differ(tcx, body, move_data.move_paths[path].place) 3,208,000 ( 0.05%) } . 3,849,196 ( 0.06%) fn on_all_children_bits<'tcx, F>( . tcx: TyCtxt<'tcx>, . body: &Body<'tcx>, . move_data: &MoveData<'tcx>, . move_path_index: MovePathIndex, . each_child: &mut F, . ) where . F: FnMut(MovePathIndex), . { 110,934 ( 0.00%) each_child(move_path_index); . 2,807,078 ( 0.04%) if is_terminal_path(tcx, body, move_data, move_path_index) { . return; . } . 221,923 ( 0.00%) let mut next_child_index = move_data.move_paths[move_path_index].first_child; 561,344 ( 0.01%) while let Some(child_index) = next_child_index { 170,718 ( 0.00%) on_all_children_bits(tcx, body, move_data, child_index, each_child); 28,453 ( 0.00%) next_child_index = move_data.move_paths[child_index].next_sibling; . } 3,206,560 ( 0.05%) } 2,264,881 ( 0.03%) on_all_children_bits(tcx, body, move_data, move_path_index, &mut each_child); . } . . pub fn on_all_drop_children_bits<'tcx, F>( . tcx: TyCtxt<'tcx>, . body: &Body<'tcx>, . ctxt: &MoveDataParamEnv<'tcx>, . path: MovePathIndex, . mut each_child: F, . ) where . F: FnMut(MovePathIndex), . { 1,275 ( 0.00%) on_all_children_bits(tcx, body, &ctxt.move_data, path, |child| { 900 ( 0.00%) let place = &ctxt.move_data.move_paths[path].place; 225 ( 0.00%) let ty = place.ty(body, tcx).ty; . debug!("on_all_drop_children_bits({:?}, {:?} : {:?})", path, place, ty); . 124 ( 0.00%) let erased_ty = tcx.erase_regions(ty); 1,398 ( 0.00%) if erased_ty.needs_drop(tcx, ctxt.param_env) { 225 ( 0.00%) each_child(child); . } else { . debug!("on_all_drop_children_bits - skipping") . } . }) . } . 38,457 ( 0.00%) pub fn drop_flag_effects_for_function_entry<'tcx, F>( . tcx: TyCtxt<'tcx>, . body: &Body<'tcx>, . ctxt: &MoveDataParamEnv<'tcx>, . mut callback: F, . ) where . F: FnMut(MovePathIndex, DropFlagState), . { . let move_data = &ctxt.move_data; 3,474 ( 0.00%) for arg in body.args_iter() { 6,688 ( 0.00%) let place = mir::Place::from(arg); 10,032 ( 0.00%) let lookup_result = move_data.rev_lookup.find(place.as_ref()); . on_lookup_result_bits(tcx, body, move_data, lookup_result, |mpi| { 3,432 ( 0.00%) callback(mpi, DropFlagState::Present) . }); . } 27,792 ( 0.00%) } . 5,537,589 ( 0.08%) pub fn drop_flag_effects_for_location<'tcx, F>( . tcx: TyCtxt<'tcx>, . body: &Body<'tcx>, . ctxt: &MoveDataParamEnv<'tcx>, . loc: Location, . mut callback: F, . ) where . F: FnMut(MovePathIndex, DropFlagState), . { . let move_data = &ctxt.move_data; . debug!("drop_flag_effects_for_location({:?})", loc); . . // first, move out of the RHS 458,570 ( 0.01%) for mi in &move_data.loc_map[loc] { 950,149 ( 0.01%) let path = mi.move_path_index(move_data); . debug!("moving out of path {:?}", move_data.move_paths[path]); . 259,717 ( 0.00%) on_all_children_bits(tcx, body, move_data, path, |mpi| callback(mpi, DropFlagState::Absent)) . } . . debug!("drop_flag_effects: assignment for location({:?})", loc); . 111,014 ( 0.00%) for_location_inits(tcx, body, move_data, loc, |mpi| callback(mpi, DropFlagState::Present)); 3,699,448 ( 0.05%) } . . pub fn for_location_inits<'tcx, F>( . tcx: TyCtxt<'tcx>, . body: &Body<'tcx>, . move_data: &MoveData<'tcx>, . loc: Location, . mut callback: F, . ) where . F: FnMut(MovePathIndex), . { 458,570 ( 0.01%) for ii in &move_data.init_loc_map[loc] { 570,880 ( 0.01%) let init = move_data.inits[*ii]; 354,370 ( 0.01%) match init.kind { . InitKind::Deep => { . let path = init.path; . . on_all_children_bits(tcx, body, move_data, path, &mut callback) . } . InitKind::Shallow => { . let mpi = init.path; . callback(mpi); -- line 226 ---------------------------------------- -- line 230 ---------------------------------------- . } . } . . /// Calls `handle_inactive_variant` for each descendant move path of `enum_place` that contains a . /// `Downcast` to a variant besides the `active_variant`. . /// . /// NOTE: If there are no move paths corresponding to an inactive variant, . /// `handle_inactive_variant` will not be called for that variant. 25,896 ( 0.00%) pub(crate) fn on_all_inactive_variants<'tcx>( . tcx: TyCtxt<'tcx>, . body: &mir::Body<'tcx>, . move_data: &MoveData<'tcx>, . enum_place: mir::Place<'tcx>, . active_variant: VariantIdx, . mut handle_inactive_variant: impl FnMut(MovePathIndex), . ) { 10,790 ( 0.00%) let enum_mpi = match move_data.rev_lookup.find(enum_place.as_ref()) { . LookupResult::Exact(mpi) => mpi, . LookupResult::Parent(_) => return, . }; . . let enum_path = &move_data.move_paths[enum_mpi]; 9,637 ( 0.00%) for (variant_mpi, variant_path) in enum_path.children(&move_data.move_paths) { . // Because of the way we build the `MoveData` tree, each child should have exactly one more . // projection than `enum_place`. This additional projection must be a downcast since the . // base is an enum. 1,551 ( 0.00%) let (downcast, base_proj) = variant_path.place.projection.split_last().unwrap(); 6,204 ( 0.00%) assert_eq!(enum_place.projection.len(), base_proj.len()); . 4,653 ( 0.00%) let variant_idx = match *downcast { . mir::ProjectionElem::Downcast(_, idx) => idx, . _ => unreachable!(), . }; . 1,551 ( 0.00%) if variant_idx != active_variant { . on_all_children_bits(tcx, body, move_data, variant_mpi, |mpi| { 1,528 ( 0.00%) handle_inactive_variant(mpi) . }); . } . } 17,264 ( 0.00%) } 2,694,664 ( 0.04%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/fold.rs -------------------------------------------------------------------------------- Ir -- line 46 ---------------------------------------- . /// . /// To implement this conveniently, use the derive macro located in `rustc_macros`. . pub trait TypeFoldable<'tcx>: fmt::Debug + Clone { . /// Consumers may find this more convenient to use with infallible folders than . /// [`try_super_fold_with`][`TypeFoldable::try_super_fold_with`], to which the . /// provided default definition delegates. Implementors **should not** override . /// this provided default definition, to ensure that the two methods are coherent . /// (provide a definition of `try_super_fold_with` instead). 11,652,553 ( 0.17%) fn super_fold_with>(self, folder: &mut F) -> Self { 292,377 ( 0.00%) self.try_super_fold_with(folder).into_ok() 11,906,842 ( 0.17%) } . /// Consumers may find this more convenient to use with infallible folders than . /// [`try_fold_with`][`TypeFoldable::try_fold_with`], to which the provided . /// default definition delegates. Implementors **should not** override this . /// provided default definition, to ensure that the two methods are coherent . /// (provide a definition of `try_fold_with` instead). 1,016,263 ( 0.01%) fn fold_with>(self, folder: &mut F) -> Self { 338,417 ( 0.00%) self.try_fold_with(folder).into_ok() 933,806 ( 0.01%) } . . fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result; . 12,875,953 ( 0.19%) fn try_fold_with>(self, folder: &mut F) -> Result { 3,286,212 ( 0.05%) self.try_super_fold_with(folder) 12,904,930 ( 0.19%) } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow; 1,496,421 ( 0.02%) fn visit_with>(&self, visitor: &mut V) -> ControlFlow { 1,128,984 ( 0.02%) self.super_visit_with(visitor) 860,338 ( 0.01%) } . . /// Returns `true` if `self` has any late-bound regions that are either . /// bound by `binder` or bound by some binder outside of `binder`. . /// If `binder` is `ty::INNERMOST`, this indicates whether . /// there are any late-bound regions that appear free. . fn has_vars_bound_at_or_above(&self, binder: ty::DebruijnIndex) -> bool { 727,827 ( 0.01%) self.visit_with(&mut HasEscapingVarsVisitor { outer_index: binder }).is_break() . } . . /// Returns `true` if this `self` has any regions that escape `binder` (and . /// hence are not bound by it). . fn has_vars_bound_above(&self, binder: ty::DebruijnIndex) -> bool { 324 ( 0.00%) self.has_vars_bound_at_or_above(binder.shifted_in(1)) . } . 2,237,871 ( 0.03%) fn has_escaping_bound_vars(&self) -> bool { 286,899 ( 0.00%) self.has_vars_bound_at_or_above(ty::INNERMOST) 2,244,585 ( 0.03%) } . 191,209 ( 0.00%) #[instrument(level = "trace")] . fn has_type_flags(&self, flags: TypeFlags) -> bool { 140,398 ( 0.00%) self.visit_with(&mut HasTypeFlagsVisitor { flags }).break_value() == Some(FoundFlags) . } . fn has_projections(&self) -> bool { 23,332 ( 0.00%) self.has_type_flags(TypeFlags::HAS_PROJECTION) . } . fn has_opaque_types(&self) -> bool { . self.has_type_flags(TypeFlags::HAS_TY_OPAQUE) . } 74,768 ( 0.00%) fn references_error(&self) -> bool { . self.has_type_flags(TypeFlags::HAS_ERROR) 74,768 ( 0.00%) } . fn has_param_types_or_consts(&self) -> bool { 1,056 ( 0.00%) self.has_type_flags(TypeFlags::HAS_TY_PARAM | TypeFlags::HAS_CT_PARAM) . } . fn has_infer_regions(&self) -> bool { . self.has_type_flags(TypeFlags::HAS_RE_INFER) . } . fn has_infer_types(&self) -> bool { . self.has_type_flags(TypeFlags::HAS_TY_INFER) . } . fn has_infer_types_or_consts(&self) -> bool { 546,550 ( 0.01%) self.has_type_flags(TypeFlags::HAS_TY_INFER | TypeFlags::HAS_CT_INFER) . } 121,030 ( 0.00%) fn needs_infer(&self) -> bool { 308,096 ( 0.00%) self.has_type_flags(TypeFlags::NEEDS_INFER) 123,156 ( 0.00%) } . fn has_placeholders(&self) -> bool { . self.has_type_flags( . TypeFlags::HAS_RE_PLACEHOLDER . | TypeFlags::HAS_TY_PLACEHOLDER . | TypeFlags::HAS_CT_PLACEHOLDER, . ) . } . fn needs_subst(&self) -> bool { -- line 133 ---------------------------------------- -- line 147 ---------------------------------------- . fn has_erasable_regions(&self) -> bool { . self.has_type_flags(TypeFlags::HAS_FREE_REGIONS) . } . . /// Indicates whether this value references only 'global' . /// generic parameters that are the same regardless of what fn we are . /// in. This is used for caching. . fn is_global(&self) -> bool { 142,423 ( 0.00%) !self.has_type_flags(TypeFlags::HAS_FREE_LOCAL_NAMES) . } . . /// True if there are any late-bound regions . fn has_late_bound_regions(&self) -> bool { 3 ( 0.00%) self.has_type_flags(TypeFlags::HAS_RE_LATE_BOUND) . } . . /// Indicates whether this value still has parameters/placeholders/inference variables . /// which could be replaced later, in a way that would change the results of `impl` . /// specialization. . fn still_further_specializable(&self) -> bool { . self.has_type_flags(TypeFlags::STILL_FURTHER_SPECIALIZABLE) . } -- line 168 ---------------------------------------- -- line 194 ---------------------------------------- . . fn tcx<'a>(&'a self) -> TyCtxt<'tcx>; . . fn fold_binder(&mut self, t: Binder<'tcx, T>) -> Binder<'tcx, T> . where . T: TypeFoldable<'tcx>, . Self: TypeFolder<'tcx, Error = !>, . { 2,462,497 ( 0.04%) t.super_fold_with(self) . } . . fn fold_ty(&mut self, t: Ty<'tcx>) -> Ty<'tcx> . where . Self: TypeFolder<'tcx, Error = !>, . { 557,314 ( 0.01%) t.super_fold_with(self) . } . . fn fold_region(&mut self, r: ty::Region<'tcx>) -> ty::Region<'tcx> . where . Self: TypeFolder<'tcx, Error = !>, . { . r.super_fold_with(self) . } . . fn fold_const(&mut self, c: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> . where . Self: TypeFolder<'tcx, Error = !>, . { 45,202 ( 0.00%) c.super_fold_with(self) . } . . fn fold_predicate(&mut self, p: ty::Predicate<'tcx>) -> ty::Predicate<'tcx> . where . Self: TypeFolder<'tcx, Error = !>, . { 4,357 ( 0.00%) p.super_fold_with(self) . } . . fn fold_mir_const(&mut self, c: mir::ConstantKind<'tcx>) -> mir::ConstantKind<'tcx> . where . Self: TypeFolder<'tcx, Error = !>, . { . bug!("most type folders should not be folding MIR datastructures: {:?}", c) . } -- line 238 ---------------------------------------- -- line 247 ---------------------------------------- . /// A blanket implementation of this trait (that defers to the relevant . /// method of [`TypeFolder`]) is provided for all infallible folders in . /// order to ensure the two APIs are coherent. . pub trait FallibleTypeFolder<'tcx>: TypeFolder<'tcx> { . fn try_fold_binder(&mut self, t: Binder<'tcx, T>) -> Result, Self::Error> . where . T: TypeFoldable<'tcx>, . { 29,028 ( 0.00%) t.try_super_fold_with(self) . } . . fn try_fold_ty(&mut self, t: Ty<'tcx>) -> Result, Self::Error> { . t.try_super_fold_with(self) . } . . fn try_fold_region(&mut self, r: ty::Region<'tcx>) -> Result, Self::Error> { . r.try_super_fold_with(self) -- line 263 ---------------------------------------- -- line 269 ---------------------------------------- . ) -> Result<&'tcx ty::Const<'tcx>, Self::Error> { . c.try_super_fold_with(self) . } . . fn try_fold_predicate( . &mut self, . p: ty::Predicate<'tcx>, . ) -> Result, Self::Error> { 7,509 ( 0.00%) p.try_super_fold_with(self) . } . . fn try_fold_mir_const( . &mut self, . c: mir::ConstantKind<'tcx>, . ) -> Result, Self::Error> { . bug!("most type folders should not be folding MIR datastructures: {:?}", c) . } -- line 285 ---------------------------------------- -- line 286 ---------------------------------------- . } . . // Blanket implementation of fallible trait for infallible folders . // delegates to infallible methods to prevent incoherence . impl<'tcx, F> FallibleTypeFolder<'tcx> for F . where . F: TypeFolder<'tcx, Error = !>, . { 394,456 ( 0.01%) fn try_fold_binder(&mut self, t: Binder<'tcx, T>) -> Result, Self::Error> . where . T: TypeFoldable<'tcx>, . { 699,688 ( 0.01%) Ok(self.fold_binder(t)) 586,732 ( 0.01%) } . 191,679 ( 0.00%) fn try_fold_ty(&mut self, t: Ty<'tcx>) -> Result, Self::Error> { 5,763,153 ( 0.08%) Ok(self.fold_ty(t)) 149,136 ( 0.00%) } . 80,728 ( 0.00%) fn try_fold_region(&mut self, r: ty::Region<'tcx>) -> Result, Self::Error> { 1,101,020 ( 0.02%) Ok(self.fold_region(r)) 80,728 ( 0.00%) } . 13,051 ( 0.00%) fn try_fold_const( . &mut self, . c: &'tcx ty::Const<'tcx>, . ) -> Result<&'tcx ty::Const<'tcx>, Self::Error> { 44,271 ( 0.00%) Ok(self.fold_const(c)) 10,191 ( 0.00%) } . . fn try_fold_predicate( . &mut self, . p: ty::Predicate<'tcx>, . ) -> Result, Self::Error> { . Ok(self.fold_predicate(p)) . } . -- line 322 ---------------------------------------- -- line 330 ---------------------------------------- . . pub trait TypeVisitor<'tcx>: Sized { . type BreakTy = !; . . fn visit_binder>( . &mut self, . t: &Binder<'tcx, T>, . ) -> ControlFlow { 3,033 ( 0.00%) t.super_visit_with(self) . } . . fn visit_ty(&mut self, t: Ty<'tcx>) -> ControlFlow { 17,766 ( 0.00%) t.super_visit_with(self) . } . . fn visit_region(&mut self, r: ty::Region<'tcx>) -> ControlFlow { . r.super_visit_with(self) . } . 296 ( 0.00%) fn visit_const(&mut self, c: &'tcx ty::Const<'tcx>) -> ControlFlow { 3 ( 0.00%) c.super_visit_with(self) 259 ( 0.00%) } . . fn visit_unevaluated_const(&mut self, uv: ty::Unevaluated<'tcx>) -> ControlFlow { . uv.super_visit_with(self) . } . . fn visit_predicate(&mut self, p: ty::Predicate<'tcx>) -> ControlFlow { . p.super_visit_with(self) . } -- line 359 ---------------------------------------- -- line 376 ---------------------------------------- . . impl<'tcx, F, G, H> TypeFolder<'tcx> for BottomUpFolder<'tcx, F, G, H> . where . F: FnMut(Ty<'tcx>) -> Ty<'tcx>, . G: FnMut(ty::Region<'tcx>) -> ty::Region<'tcx>, . H: FnMut(&'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx>, . { . fn tcx<'b>(&'b self) -> TyCtxt<'tcx> { 179 ( 0.00%) self.tcx . } . . fn fold_ty(&mut self, ty: Ty<'tcx>) -> Ty<'tcx> { 6,726 ( 0.00%) let t = ty.super_fold_with(self); . (self.ty_op)(t) . } . . fn fold_region(&mut self, r: ty::Region<'tcx>) -> ty::Region<'tcx> { . let r = r.super_fold_with(self); . (self.lt_op)(r) . } . . fn fold_const(&mut self, ct: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> { 42 ( 0.00%) let ct = ct.super_fold_with(self); . (self.ct_op)(ct) . } . } . . /////////////////////////////////////////////////////////////////////////// . // Region folder . . impl<'tcx> TyCtxt<'tcx> { -- line 406 ---------------------------------------- -- line 415 ---------------------------------------- . ) -> T . where . T: TypeFoldable<'tcx>, . { . value.fold_with(&mut RegionFolder::new(self, skipped_regions, &mut f)) . } . . /// Invoke `callback` on every region appearing free in `value`. 15,627 ( 0.00%) pub fn for_each_free_region( . self, . value: &impl TypeFoldable<'tcx>, . mut callback: impl FnMut(ty::Region<'tcx>), . ) { . self.any_free_region_meets(value, |r| { 153,907 ( 0.00%) callback(r); . false . }); 13,448 ( 0.00%) } . . /// Returns `true` if `callback` returns true for every region appearing free in `value`. . pub fn all_free_regions_meet( . self, . value: &impl TypeFoldable<'tcx>, . mut callback: impl FnMut(ty::Region<'tcx>) -> bool, . ) -> bool { 23,979 ( 0.00%) !self.any_free_region_meets(value, |r| !callback(r)) . } . . /// Returns `true` if `callback` returns true for some region appearing free in `value`. . pub fn any_free_region_meets( . self, . value: &impl TypeFoldable<'tcx>, . callback: impl FnMut(ty::Region<'tcx>) -> bool, . ) -> bool { -- line 448 ---------------------------------------- -- line 473 ---------------------------------------- . F: FnMut(ty::Region<'tcx>) -> bool, . { . type BreakTy = (); . . fn visit_binder>( . &mut self, . t: &Binder<'tcx, T>, . ) -> ControlFlow { 5,471 ( 0.00%) self.outer_index.shift_in(1); 4,164 ( 0.00%) let result = t.as_ref().skip_binder().visit_with(self); 3,123 ( 0.00%) self.outer_index.shift_out(1); . result . } . 143,800 ( 0.00%) fn visit_region(&mut self, r: ty::Region<'tcx>) -> ControlFlow { 220,755 ( 0.00%) match *r { 725 ( 0.00%) ty::ReLateBound(debruijn, _) if debruijn < self.outer_index => { . ControlFlow::CONTINUE . } . _ => { . if (self.callback)(r) { . ControlFlow::BREAK . } else { . ControlFlow::CONTINUE . } . } . } 201,320 ( 0.00%) } . . fn visit_ty(&mut self, ty: Ty<'tcx>) -> ControlFlow { . // We're only interested in types involving regions 149,458 ( 0.00%) if ty.flags().intersects(TypeFlags::HAS_FREE_REGIONS) { 179,366 ( 0.00%) ty.super_visit_with(self) . } else { . ControlFlow::CONTINUE . } . } . } . 308,202 ( 0.00%) value.visit_with(&mut RegionVisitor { outer_index: ty::INNERMOST, callback }).is_break() . } . } . . /// Folds over the substructure of a type, visiting its component . /// types and all regions that occur *free* within it. . /// . /// That is, `Ty` can contain function or method types that bind . /// regions at the call site (`ReLateBound`), and occurrences of -- line 520 ---------------------------------------- -- line 540 ---------------------------------------- . . impl<'a, 'tcx> RegionFolder<'a, 'tcx> { . #[inline] . pub fn new( . tcx: TyCtxt<'tcx>, . skipped_regions: &'a mut bool, . fold_region_fn: &'a mut dyn FnMut(ty::Region<'tcx>, ty::DebruijnIndex) -> ty::Region<'tcx>, . ) -> RegionFolder<'a, 'tcx> { 783,081 ( 0.01%) RegionFolder { tcx, skipped_regions, current_index: ty::INNERMOST, fold_region_fn } . } . } . . impl<'a, 'tcx> TypeFolder<'tcx> for RegionFolder<'a, 'tcx> { . fn tcx<'b>(&'b self) -> TyCtxt<'tcx> { 194,304 ( 0.00%) self.tcx 194,304 ( 0.00%) } . . fn fold_binder>( . &mut self, . t: ty::Binder<'tcx, T>, . ) -> ty::Binder<'tcx, T> { 13,352 ( 0.00%) self.current_index.shift_in(1); 10,920 ( 0.00%) let t = t.super_fold_with(self); 11,340 ( 0.00%) self.current_index.shift_out(1); . t . } . 9,306 ( 0.00%) #[instrument(skip(self), level = "debug")] . fn fold_region(&mut self, r: ty::Region<'tcx>) -> ty::Region<'tcx> { 152,106 ( 0.00%) match *r { 9,306 ( 0.00%) ty::ReLateBound(debruijn, _) if debruijn < self.current_index => { . debug!(?self.current_index, "skipped bound region"); 9,306 ( 0.00%) *self.skipped_regions = true; . r . } . _ => { . debug!(?self.current_index, "folding free region"); 428,400 ( 0.01%) (self.fold_region_fn)(r, self.current_index) . } . } . } . } . . /////////////////////////////////////////////////////////////////////////// . // Bound vars replacer . -- line 585 ---------------------------------------- -- line 592 ---------------------------------------- . current_index: ty::DebruijnIndex, . . fld_r: Option<&'a mut (dyn FnMut(ty::BoundRegion) -> ty::Region<'tcx> + 'a)>, . fld_t: Option<&'a mut (dyn FnMut(ty::BoundTy) -> Ty<'tcx> + 'a)>, . fld_c: Option<&'a mut (dyn FnMut(ty::BoundVar, Ty<'tcx>) -> &'tcx ty::Const<'tcx> + 'a)>, . } . . impl<'a, 'tcx> BoundVarReplacer<'a, 'tcx> { 261,792 ( 0.00%) fn new( . tcx: TyCtxt<'tcx>, . fld_r: Option<&'a mut (dyn FnMut(ty::BoundRegion) -> ty::Region<'tcx> + 'a)>, . fld_t: Option<&'a mut (dyn FnMut(ty::BoundTy) -> Ty<'tcx> + 'a)>, . fld_c: Option<&'a mut (dyn FnMut(ty::BoundVar, Ty<'tcx>) -> &'tcx ty::Const<'tcx> + 'a)>, . ) -> Self { 921,328 ( 0.01%) BoundVarReplacer { tcx, current_index: ty::INNERMOST, fld_r, fld_t, fld_c } 130,896 ( 0.00%) } . } . . impl<'a, 'tcx> TypeFolder<'tcx> for BoundVarReplacer<'a, 'tcx> { . fn tcx<'b>(&'b self) -> TyCtxt<'tcx> { 156,499 ( 0.00%) self.tcx 43,765 ( 0.00%) } . . fn fold_binder>( . &mut self, . t: ty::Binder<'tcx, T>, . ) -> ty::Binder<'tcx, T> { 202,286 ( 0.00%) self.current_index.shift_in(1); 79,140 ( 0.00%) let t = t.super_fold_with(self); 159,710 ( 0.00%) self.current_index.shift_out(1); . t . } . 576,295 ( 0.01%) fn fold_ty(&mut self, t: Ty<'tcx>) -> Ty<'tcx> { 407,732 ( 0.01%) match *t.kind() { 20,797 ( 0.00%) ty::Bound(debruijn, bound_ty) if debruijn == self.current_index => { 4,187 ( 0.00%) if let Some(fld_t) = self.fld_t.as_mut() { . let ty = fld_t(bound_ty); 4,187 ( 0.00%) return ty::fold::shift_vars(self.tcx, &ty, self.current_index.as_u32()); . } . } 399,358 ( 0.01%) _ if t.has_vars_bound_at_or_above(self.current_index) => { 590,655 ( 0.01%) return t.super_fold_with(self); . } . _ => {} . } . t 305,706 ( 0.00%) } . 461,260 ( 0.01%) fn fold_region(&mut self, r: ty::Region<'tcx>) -> ty::Region<'tcx> { 386,256 ( 0.01%) match *r { 385,170 ( 0.01%) ty::ReLateBound(debruijn, br) if debruijn == self.current_index => { 192,350 ( 0.00%) if let Some(fld_r) = self.fld_r.as_mut() { . let region = fld_r(br); 389,932 ( 0.01%) return if let ty::ReLateBound(debruijn1, br) = *region { . // If the callback returns a late-bound region, . // that region should always use the INNERMOST . // debruijn index. Then we adjust it to the . // correct depth. 2,616 ( 0.00%) assert_eq!(debruijn1, ty::INNERMOST); 26,040 ( 0.00%) self.tcx.mk_region(ty::ReLateBound(debruijn, br)) . } else { . region . }; . } . } . _ => {} . } . r 461,260 ( 0.01%) } . . fn fold_const(&mut self, ct: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> { 264 ( 0.00%) match *ct { . ty::Const { val: ty::ConstKind::Bound(debruijn, bound_const), ty } . if debruijn == self.current_index => . { . if let Some(fld_c) = self.fld_c.as_mut() { . let ct = fld_c(bound_const, ty); . return ty::fold::shift_vars(self.tcx, &ct, self.current_index.as_u32()); . } . } 88 ( 0.00%) _ if ct.has_vars_bound_at_or_above(self.current_index) => { . return ct.super_fold_with(self); . } . _ => {} . } . ct . } . } . -- line 681 ---------------------------------------- -- line 697 ---------------------------------------- . mut fld_r: F, . ) -> (T, BTreeMap>) . where . F: FnMut(ty::BoundRegion) -> ty::Region<'tcx>, . T: TypeFoldable<'tcx>, . { . let mut region_map = BTreeMap::new(); . let mut real_fld_r = 282,610 ( 0.00%) |br: ty::BoundRegion| *region_map.entry(br).or_insert_with(|| fld_r(br)); 7,397 ( 0.00%) let value = value.skip_binder(); 41,674 ( 0.00%) let value = if !value.has_escaping_bound_vars() { 64,360 ( 0.00%) value . } else { 46,827 ( 0.00%) let mut replacer = BoundVarReplacer::new(self, Some(&mut real_fld_r), None, None); 6,149 ( 0.00%) value.fold_with(&mut replacer) . }; 182,742 ( 0.00%) (value, region_map) . } . . /// Replaces all escaping bound vars. The `fld_r` closure replaces escaping . /// bound regions; the `fld_t` closure replaces escaping bound types and the `fld_c` . /// closure replaces escaping bound consts. 1,034,074 ( 0.02%) pub fn replace_escaping_bound_vars( . self, . value: T, . mut fld_r: F, . mut fld_t: G, . mut fld_c: H, . ) -> T . where . F: FnMut(ty::BoundRegion) -> ty::Region<'tcx>, . G: FnMut(ty::BoundTy) -> Ty<'tcx>, . H: FnMut(ty::BoundVar, Ty<'tcx>) -> &'tcx ty::Const<'tcx>, . T: TypeFoldable<'tcx>, . { 144,795 ( 0.00%) if !value.has_escaping_bound_vars() { 204,370 ( 0.00%) value . } else { . let mut replacer = 1,506,977 ( 0.02%) BoundVarReplacer::new(self, Some(&mut fld_r), Some(&mut fld_t), Some(&mut fld_c)); 53,385 ( 0.00%) value.fold_with(&mut replacer) . } 710,937 ( 0.01%) } . . /// Replaces all types or regions bound by the given `Binder`. The `fld_r` . /// closure replaces bound regions while the `fld_t` closure replaces bound . /// types. 826,336 ( 0.01%) pub fn replace_bound_vars( . self, . value: Binder<'tcx, T>, . mut fld_r: F, . fld_t: G, . fld_c: H, . ) -> (T, BTreeMap>) . where . F: FnMut(ty::BoundRegion) -> ty::Region<'tcx>, . G: FnMut(ty::BoundTy) -> Ty<'tcx>, . H: FnMut(ty::BoundVar, Ty<'tcx>) -> &'tcx ty::Const<'tcx>, . T: TypeFoldable<'tcx>, . { . let mut region_map = BTreeMap::new(); 813,347 ( 0.01%) let real_fld_r = |br: ty::BoundRegion| *region_map.entry(br).or_insert_with(|| fld_r(br)); 828,569 ( 0.01%) let value = self.replace_escaping_bound_vars(value.skip_binder(), real_fld_r, fld_t, fld_c); 934,733 ( 0.01%) (value, region_map) 575,459 ( 0.01%) } . . /// Replaces any late-bound regions bound in `value` with . /// free variants attached to `all_outlive_scope`. 34,089 ( 0.00%) pub fn liberate_late_bound_regions( . self, . all_outlive_scope: DefId, . value: ty::Binder<'tcx, T>, . ) -> T . where . T: TypeFoldable<'tcx>, . { . self.replace_late_bound_regions(value, |br| { 50,648 ( 0.00%) self.mk_region(ty::ReFree(ty::FreeRegion { 7,792 ( 0.00%) scope: all_outlive_scope, . bound_region: br.kind, . })) . }) . .0 18,594 ( 0.00%) } . . pub fn shift_bound_var_indices(self, bound_vars: usize, value: T) -> T . where . T: TypeFoldable<'tcx>, . { . self.replace_escaping_bound_vars( 32,715 ( 0.00%) value, 552 ( 0.00%) |r| { 3,864 ( 0.00%) self.mk_region(ty::ReLateBound( . ty::INNERMOST, . ty::BoundRegion { 2,208 ( 0.00%) var: ty::BoundVar::from_usize(r.var.as_usize() + bound_vars), . kind: r.kind, . }, . )) 1,104 ( 0.00%) }, . |t| { . self.mk_ty(ty::Bound( . ty::INNERMOST, . ty::BoundTy { . var: ty::BoundVar::from_usize(t.var.as_usize() + bound_vars), . kind: t.kind, . }, . )) -- line 804 ---------------------------------------- -- line 843 ---------------------------------------- . fn collect_late_bound_regions( . self, . value: &Binder<'tcx, T>, . just_constraint: bool, . ) -> FxHashSet . where . T: TypeFoldable<'tcx>, . { 3,920 ( 0.00%) let mut collector = LateBoundRegionsCollector::new(just_constraint); . let result = value.as_ref().skip_binder().visit_with(&mut collector); . assert!(result.is_continue()); // should never have stopped early 7,744 ( 0.00%) collector.regions . } . . /// Replaces any late-bound regions bound in `value` with `'erased`. Useful in codegen but also . /// method lookup and a few other places where precise region relationships are not required. . pub fn erase_late_bound_regions(self, value: Binder<'tcx, T>) -> T . where . T: TypeFoldable<'tcx>, . { 12,772 ( 0.00%) self.replace_late_bound_regions(value, |_| self.lifetimes.re_erased).0 . } . . /// Rewrite any late-bound regions so that they are anonymous. Region numbers are . /// assigned starting at 0 and increasing monotonically in the order traversed . /// by the fold operation. . /// . /// The chief purpose of this function is to canonicalize regions so that two . /// `FnSig`s or `TraitRef`s which are equivalent up to region naming will become . /// structurally identical. For example, `for<'a, 'b> fn(&'a isize, &'b isize)` and . /// `for<'a, 'b> fn(&'b isize, &'a isize)` will become identical after anonymization. 81,407 ( 0.00%) pub fn anonymize_late_bound_regions(self, sig: Binder<'tcx, T>) -> Binder<'tcx, T> . where . T: TypeFoldable<'tcx>, . { 58,915 ( 0.00%) let mut counter = 0; 3,072 ( 0.00%) let inner = self . .replace_late_bound_regions(sig, |_| { . let br = ty::BoundRegion { 4,128 ( 0.00%) var: ty::BoundVar::from_u32(counter), . kind: ty::BrAnon(counter), . }; 16,512 ( 0.00%) let r = self.mk_region(ty::ReLateBound(ty::INNERMOST, br)); 10,320 ( 0.00%) counter += 1; . r . }) . .0; 11,783 ( 0.00%) let bound_vars = self.mk_bound_variable_kinds( 35,349 ( 0.00%) (0..counter).map(|i| ty::BoundVariableKind::Region(ty::BrAnon(i))), . ); 68,062 ( 0.00%) Binder::bind_with_vars(inner, bound_vars) 69,967 ( 0.00%) } . } . . pub struct ValidateBoundVars<'tcx> { . bound_vars: &'tcx ty::List, . binder_index: ty::DebruijnIndex, . // We may encounter the same variable at different levels of binding, so . // this can't just be `Ty` . visited: SsoHashSet<(ty::DebruijnIndex, Ty<'tcx>)>, -- line 902 ---------------------------------------- -- line 1004 ---------------------------------------- . tcx: TyCtxt<'tcx>, . current_index: ty::DebruijnIndex, . amount: u32, . } . . impl<'tcx> Shifter<'tcx> { . pub fn new(tcx: TyCtxt<'tcx>, amount: u32) -> Self { . Shifter { tcx, current_index: ty::INNERMOST, amount } 8,538 ( 0.00%) } . } . . impl<'tcx> TypeFolder<'tcx> for Shifter<'tcx> { . fn tcx<'b>(&'b self) -> TyCtxt<'tcx> { 210 ( 0.00%) self.tcx . } . . fn fold_binder>( . &mut self, . t: ty::Binder<'tcx, T>, . ) -> ty::Binder<'tcx, T> { . self.current_index.shift_in(1); . let t = t.super_fold_with(self); . self.current_index.shift_out(1); . t . } . . fn fold_region(&mut self, r: ty::Region<'tcx>) -> ty::Region<'tcx> { 204 ( 0.00%) match *r { . ty::ReLateBound(debruijn, br) => { 408 ( 0.00%) if self.amount == 0 || debruijn < self.current_index { . r . } else { 102 ( 0.00%) let debruijn = debruijn.shifted_in(self.amount); . let shifted = ty::ReLateBound(debruijn, br); 1,020 ( 0.00%) self.tcx.mk_region(shifted) . } . } . _ => r, . } . } . . fn fold_ty(&mut self, ty: Ty<'tcx>) -> Ty<'tcx> { 9,086 ( 0.00%) match *ty.kind() { . ty::Bound(debruijn, bound_ty) => { . if self.amount == 0 || debruijn < self.current_index { . ty . } else { . let debruijn = debruijn.shifted_in(self.amount); . self.tcx.mk_ty(ty::Bound(debruijn, bound_ty)) . } . } . 14,163 ( 0.00%) _ => ty.super_fold_with(self), . } . } . . fn fold_const(&mut self, ct: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> { . if let ty::Const { val: ty::ConstKind::Bound(debruijn, bound_ct), ty } = *ct { . if self.amount == 0 || debruijn < self.current_index { . ct . } else { -- line 1064 ---------------------------------------- -- line 1073 ---------------------------------------- . . pub fn shift_region<'tcx>( . tcx: TyCtxt<'tcx>, . region: ty::Region<'tcx>, . amount: u32, . ) -> ty::Region<'tcx> { . match region { . ty::ReLateBound(debruijn, br) if amount > 0 => { 16,510 ( 0.00%) tcx.mk_region(ty::ReLateBound(debruijn.shifted_in(amount), *br)) . } . _ => region, . } . } . . pub fn shift_vars<'tcx, T>(tcx: TyCtxt<'tcx>, value: T, amount: u32) -> T . where . T: TypeFoldable<'tcx>, . { . debug!("shift_vars(value={:?}, amount={})", value, amount); . 9,090 ( 0.00%) value.fold_with(&mut Shifter::new(tcx, amount)) . } . . #[derive(Debug, PartialEq, Eq, Copy, Clone)] . struct FoundEscapingVars; . . /// An "escaping var" is a bound var whose binder is not part of `t`. A bound var can be a . /// bound region or a bound type. . /// -- line 1101 ---------------------------------------- -- line 1128 ---------------------------------------- . . impl<'tcx> TypeVisitor<'tcx> for HasEscapingVarsVisitor { . type BreakTy = FoundEscapingVars; . . fn visit_binder>( . &mut self, . t: &Binder<'tcx, T>, . ) -> ControlFlow { 83,448 ( 0.00%) self.outer_index.shift_in(1); . let result = t.super_visit_with(self); 110,144 ( 0.00%) self.outer_index.shift_out(1); . result . } . . #[inline] . fn visit_ty(&mut self, t: Ty<'tcx>) -> ControlFlow { . // If the outer-exclusive-binder is *strictly greater* than . // `outer_index`, that means that `t` contains some content . // bound at `outer_index` or above (because -- line 1146 ---------------------------------------- -- line 1160 ---------------------------------------- . // visited. . if r.bound_at_or_above_binder(self.outer_index) { . ControlFlow::Break(FoundEscapingVars) . } else { . ControlFlow::CONTINUE . } . } . 60 ( 0.00%) fn visit_const(&mut self, ct: &'tcx ty::Const<'tcx>) -> ControlFlow { . // we don't have a `visit_infer_const` callback, so we have to . // hook in here to catch this case (annoying...), but . // otherwise we do want to remember to visit the rest of the . // const, as it has types/regions embedded in a lot of other . // places. 158 ( 0.00%) match ct.val { . ty::ConstKind::Bound(debruijn, _) if debruijn >= self.outer_index => { . ControlFlow::Break(FoundEscapingVars) . } 102 ( 0.00%) _ => ct.super_visit_with(self), . } 60 ( 0.00%) } . . #[inline] . fn visit_predicate(&mut self, predicate: ty::Predicate<'tcx>) -> ControlFlow { . if predicate.inner.outer_exclusive_binder > self.outer_index { . ControlFlow::Break(FoundEscapingVars) . } else { . ControlFlow::CONTINUE . } -- line 1188 ---------------------------------------- -- line 1210 ---------------------------------------- . #[instrument(level = "trace")] . fn visit_ty(&mut self, t: Ty<'_>) -> ControlFlow { . debug!( . "HasTypeFlagsVisitor: t={:?} t.flags={:?} self.flags={:?}", . t, . t.flags(), . self.flags . ); 806,030 ( 0.01%) if t.flags().intersects(self.flags) { . ControlFlow::Break(FoundFlags) . } else { . ControlFlow::CONTINUE . } . } . . #[inline] . #[instrument(skip(self), level = "trace")] . fn visit_region(&mut self, r: ty::Region<'tcx>) -> ControlFlow { 37,199 ( 0.00%) let flags = r.type_flags(); . trace!(r.flags=?flags); . if flags.intersects(self.flags) { . ControlFlow::Break(FoundFlags) . } else { . ControlFlow::CONTINUE . } . } . . #[inline] . #[instrument(level = "trace")] . fn visit_const(&mut self, c: &'tcx ty::Const<'tcx>) -> ControlFlow { 12,108 ( 0.00%) let flags = FlagComputation::for_const(c); . trace!(r.flags=?flags); 16,730 ( 0.00%) if flags.intersects(self.flags) { . ControlFlow::Break(FoundFlags) . } else { . ControlFlow::CONTINUE . } . } . . #[inline] . #[instrument(level = "trace")] . fn visit_unevaluated_const(&mut self, uv: ty::Unevaluated<'tcx>) -> ControlFlow { 6,748 ( 0.00%) let flags = FlagComputation::for_unevaluated_const(uv); . trace!(r.flags=?flags); . if flags.intersects(self.flags) { . ControlFlow::Break(FoundFlags) . } else { . ControlFlow::CONTINUE . } . } . -- line 1260 ---------------------------------------- -- line 1285 ---------------------------------------- . /// them constraints `'a == 'b`. But if you have `<&'a u32 as . /// Trait>::Foo` and `<&'b u32 as Trait>::Foo`, normalizing those . /// types may mean that `'a` and `'b` don't appear in the results, . /// so they are not considered *constrained*. . just_constrained: bool, . } . . impl LateBoundRegionsCollector { 1,936 ( 0.00%) fn new(just_constrained: bool) -> Self { 13,552 ( 0.00%) LateBoundRegionsCollector { . current_index: ty::INNERMOST, . regions: Default::default(), . just_constrained, . } 1,936 ( 0.00%) } . } . . impl<'tcx> TypeVisitor<'tcx> for LateBoundRegionsCollector { . fn visit_binder>( . &mut self, . t: &Binder<'tcx, T>, . ) -> ControlFlow { 36 ( 0.00%) self.current_index.shift_in(1); 36 ( 0.00%) let result = t.super_visit_with(self); 36 ( 0.00%) self.current_index.shift_out(1); . result . } . 7,233 ( 0.00%) fn visit_ty(&mut self, t: Ty<'tcx>) -> ControlFlow { . // if we are only looking for "constrained" region, we have to . // ignore the inputs to a projection, as they may not appear . // in the normalized form 7,712 ( 0.00%) if self.just_constrained { 7,392 ( 0.00%) if let ty::Projection(..) | ty::Opaque(..) = t.kind() { . return ControlFlow::CONTINUE; . } . } . 8,997 ( 0.00%) t.super_visit_with(self) 4,964 ( 0.00%) } . . fn visit_const(&mut self, c: &'tcx ty::Const<'tcx>) -> ControlFlow { . // if we are only looking for "constrained" region, we have to . // ignore the inputs of an unevaluated const, as they may not appear . // in the normalized form 142 ( 0.00%) if self.just_constrained { 134 ( 0.00%) if let ty::ConstKind::Unevaluated(..) = c.val { . return ControlFlow::CONTINUE; . } . } . . c.super_visit_with(self) . } . . fn visit_region(&mut self, r: ty::Region<'tcx>) -> ControlFlow { 6,760 ( 0.00%) if let ty::ReLateBound(debruijn, br) = *r { 1,242 ( 0.00%) if debruijn == self.current_index { . self.regions.insert(br.kind); . } . } . ControlFlow::CONTINUE . } . } 844,694 ( 0.01%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_const_eval/src/interpret/place.rs -------------------------------------------------------------------------------- Ir -- line 14 ---------------------------------------- . use rustc_target::abi::{HasDataLayout, Size, VariantIdx, Variants}; . . use super::{ . alloc_range, mir_assign_valid_types, AllocId, AllocRef, AllocRefMut, CheckInAllocMsg, . ConstAlloc, ImmTy, Immediate, InterpCx, InterpResult, LocalValue, Machine, MemoryKind, OpTy, . Operand, Pointer, PointerArithmetic, Provenance, Scalar, ScalarMaybeUninit, . }; . 2,239 ( 0.00%) #[derive(Copy, Clone, Hash, PartialEq, Eq, HashStable, Debug)] . /// Information required for the sound usage of a `MemPlace`. . pub enum MemPlaceMeta { . /// The unsized payload (e.g. length for slices or vtable pointer for trait objects). . Meta(Scalar), . /// `Sized` types or unsized `extern type` . None, . /// The address of this place may not be taken. This protects the `MemPlace` from coming from . /// a ZST Operand without a backing allocation and being converted to an integer address. This -- line 30 ---------------------------------------- -- line 33 ---------------------------------------- . Poison, . } . . #[cfg(all(target_arch = "x86_64", target_pointer_width = "64"))] . rustc_data_structures::static_assert_size!(MemPlaceMeta, 24); . . impl MemPlaceMeta { . pub fn unwrap_meta(self) -> Scalar { 24 ( 0.00%) match self { 18 ( 0.00%) Self::Meta(s) => s, . Self::None | Self::Poison => { . bug!("expected wide pointer extra data (e.g. slice length or trait object vtable)") . } . } . } . fn has_meta(self) -> bool { 411 ( 0.00%) match self { . Self::Meta(_) => true, . Self::None | Self::Poison => false, . } . } . } . . #[derive(Copy, Clone, Hash, PartialEq, Eq, HashStable, Debug)] . pub struct MemPlace { -- line 57 ---------------------------------------- -- line 113 ---------------------------------------- . fn deref(&self) -> &MemPlace { . &self.mplace . } . } . . impl<'tcx, Tag: Provenance> From> for PlaceTy<'tcx, Tag> { . #[inline(always)] . fn from(mplace: MPlaceTy<'tcx, Tag>) -> Self { 4,046 ( 0.00%) PlaceTy { place: Place::Ptr(mplace.mplace), layout: mplace.layout } . } . } . . impl MemPlace { . #[inline(always)] . pub fn from_ptr(ptr: Pointer>, align: Align) -> Self { . MemPlace { ptr, align, meta: MemPlaceMeta::None } . } -- line 129 ---------------------------------------- -- line 132 ---------------------------------------- . pub fn map_provenance(self, f: impl FnOnce(Option) -> Option) -> Self { . MemPlace { ptr: self.ptr.map_provenance(f), ..self } . } . . /// Turn a mplace into a (thin or wide) pointer, as a reference, pointing to the same space. . /// This is the inverse of `ref_to_mplace`. . #[inline(always)] . pub fn to_ref(self, cx: &impl HasDataLayout) -> Immediate { 40 ( 0.00%) match self.meta { 28 ( 0.00%) MemPlaceMeta::None => Immediate::from(Scalar::from_maybe_pointer(self.ptr, cx)), . MemPlaceMeta::Meta(meta) => { . Immediate::ScalarPair(Scalar::from_maybe_pointer(self.ptr, cx).into(), meta.into()) . } . MemPlaceMeta::Poison => bug!( . "MPlaceTy::dangling may never be used to produce a \ . place that will have the address of its pointee taken" . ), . } -- line 149 ---------------------------------------- -- line 177 ---------------------------------------- . #[inline] . pub fn offset( . &self, . offset: Size, . meta: MemPlaceMeta, . layout: TyAndLayout<'tcx>, . cx: &impl HasDataLayout, . ) -> InterpResult<'tcx, Self> { 7,340,627 ( 0.11%) Ok(MPlaceTy { mplace: self.mplace.offset(offset, meta, cx)?, layout }) . } . . #[inline] . pub fn from_aligned_ptr(ptr: Pointer>, layout: TyAndLayout<'tcx>) -> Self { 200 ( 0.00%) MPlaceTy { mplace: MemPlace::from_ptr(ptr, layout.align.abi), layout } . } . . #[inline] 8 ( 0.00%) pub(super) fn len(&self, cx: &impl HasDataLayout) -> InterpResult<'tcx, u64> { 47 ( 0.00%) if self.layout.is_unsized() { . // We need to consult `meta` metadata 33 ( 0.00%) match self.layout.ty.kind() { 12 ( 0.00%) ty::Slice(..) | ty::Str => self.mplace.meta.unwrap_meta().to_machine_usize(cx), . _ => bug!("len not supported on unsized type {:?}", self.layout.ty), . } . } else { . // Go through the layout. There are lots of types that support a length, . // e.g., SIMD types. (But not all repr(simd) types even have FieldsShape::Array!) 14 ( 0.00%) match self.layout.fields { 12 ( 0.00%) FieldsShape::Array { count, .. } => Ok(count), . _ => bug!("len not supported on sized type {:?}", self.layout.ty), . } . } 16 ( 0.00%) } . . #[inline] . pub(super) fn vtable(&self) -> Scalar { . match self.layout.ty.kind() { . ty::Dynamic(..) => self.mplace.meta.unwrap_meta(), . _ => bug!("vtable not supported on type {:?}", self.layout.ty), . } . } -- line 217 ---------------------------------------- -- line 218 ---------------------------------------- . } . . // These are defined here because they produce a place. . impl<'tcx, Tag: Provenance> OpTy<'tcx, Tag> { . #[inline(always)] . /// Note: do not call `as_ref` on the resulting place. This function should only be used to . /// read from the resulting mplace, not to get its address back. . pub fn try_as_mplace(&self) -> Result, ImmTy<'tcx, Tag>> { 7,638 ( 0.00%) match **self { 4,196 ( 0.00%) Operand::Indirect(mplace) => Ok(MPlaceTy { mplace, layout: self.layout }), 1,072 ( 0.00%) Operand::Immediate(_) if self.layout.is_zst() => Ok(MPlaceTy::dangling(self.layout)), 26,658 ( 0.00%) Operand::Immediate(imm) => Err(ImmTy::from_immediate(imm, self.layout)), . } . } . . #[inline(always)] . /// Note: do not call `as_ref` on the resulting place. This function should only be used to . /// read from the resulting mplace, not to get its address back. . pub fn assert_mem_place(&self) -> MPlaceTy<'tcx, Tag> { . self.try_as_mplace().unwrap() -- line 237 ---------------------------------------- -- line 263 ---------------------------------------- . M: Machine<'mir, 'tcx, PointerTag = Tag>, . { . /// Take a value, which represents a (thin or wide) reference, and make it a place. . /// Alignment is just based on the type. This is the inverse of `MemPlace::to_ref()`. . /// . /// Only call this if you are sure the place is "valid" (aligned and inbounds), or do not . /// want to ever use the place for memory access! . /// Generally prefer `deref_operand`. 140 ( 0.00%) pub fn ref_to_mplace( . &self, . val: &ImmTy<'tcx, M::PointerTag>, . ) -> InterpResult<'tcx, MPlaceTy<'tcx, M::PointerTag>> { . let pointee_type = 42 ( 0.00%) val.layout.ty.builtin_deref(true).expect("`ref_to_mplace` called on non-ptr type").ty; 42 ( 0.00%) let layout = self.layout_of(pointee_type)?; 70 ( 0.00%) let (ptr, meta) = match **val { 16 ( 0.00%) Immediate::Scalar(ptr) => (ptr, MemPlaceMeta::None), 42 ( 0.00%) Immediate::ScalarPair(ptr, meta) => (ptr, MemPlaceMeta::Meta(meta.check_init()?)), . }; . . let mplace = MemPlace { . ptr: self.scalar_to_ptr(ptr.check_init()?), . // We could use the run-time alignment here. For now, we do not, because . // the point of tracking the alignment here is to make sure that the *static* . // alignment information emitted with the loads is correct. The run-time . // alignment can only be more restrictive. 14 ( 0.00%) align: layout.align.abi, . meta, . }; 238 ( 0.00%) Ok(MPlaceTy { mplace, layout }) 126 ( 0.00%) } . . /// Take an operand, representing a pointer, and dereference it to a place -- that . /// will always be a MemPlace. Lives in `place.rs` because it creates a place. 33 ( 0.00%) pub fn deref_operand( . &self, . src: &OpTy<'tcx, M::PointerTag>, . ) -> InterpResult<'tcx, MPlaceTy<'tcx, M::PointerTag>> { 9 ( 0.00%) let val = self.read_immediate(src)?; . trace!("deref to {} on {:?}", val.layout.ty, *val); 6 ( 0.00%) let mplace = self.ref_to_mplace(&val)?; 15 ( 0.00%) self.check_mplace_access(mplace, CheckInAllocMsg::DerefTest)?; 33 ( 0.00%) Ok(mplace) 27 ( 0.00%) } . . #[inline] . pub(super) fn get_alloc( . &self, . place: &MPlaceTy<'tcx, M::PointerTag>, . ) -> InterpResult<'tcx, Option>> { . assert!(!place.layout.is_unsized()); 269 ( 0.00%) assert!(!place.meta.has_meta()); 269 ( 0.00%) let size = place.layout.size; 2,421 ( 0.00%) self.memory.get(place.ptr, size, place.align) . } . . #[inline] . pub(super) fn get_alloc_mut( . &mut self, . place: &MPlaceTy<'tcx, M::PointerTag>, . ) -> InterpResult<'tcx, Option>> { 142 ( 0.00%) assert!(!place.layout.is_unsized()); 142 ( 0.00%) assert!(!place.meta.has_meta()); 142 ( 0.00%) let size = place.layout.size; 852 ( 0.00%) self.memory.get_mut(place.ptr, size, place.align) . } . . /// Check if this mplace is dereferenceable and sufficiently aligned. . fn check_mplace_access( . &self, . mplace: MPlaceTy<'tcx, M::PointerTag>, . msg: CheckInAllocMsg, . ) -> InterpResult<'tcx> { . let (size, align) = self . .size_and_align_of_mplace(&mplace)? 3 ( 0.00%) .unwrap_or((mplace.layout.size, mplace.layout.align.abi)); 3 ( 0.00%) assert!(mplace.mplace.align <= align, "dynamic alignment less strict than static one?"); 3 ( 0.00%) let align = M::enforce_alignment(&self.memory.extra).then_some(align); 9 ( 0.00%) self.memory.check_ptr_access_align(mplace.ptr, size, align.unwrap_or(Align::ONE), msg)?; . Ok(()) . } . . /// Offset a pointer to project to a field of a struct/union. Unlike `place_field`, this is . /// always possible without allocating, so it can take `&self`. Also return the field's layout. . /// This supports both struct and array fields. . /// . /// This also works for arrays, but then the `usize` index type is restricting. . /// For indexing into arrays, use `mplace_index`. . #[inline(always)] . pub fn mplace_field( . &self, . base: &MPlaceTy<'tcx, M::PointerTag>, . field: usize, . ) -> InterpResult<'tcx, MPlaceTy<'tcx, M::PointerTag>> { 414 ( 0.00%) let offset = base.layout.fields.offset(field); 331 ( 0.00%) let field_layout = base.layout.field(self, field); . . // Offset may need adjustment for unsized fields. 647 ( 0.00%) let (meta, offset) = if field_layout.is_unsized() { . // Re-use parent metadata to determine dynamic field layout. . // With custom DSTS, this *will* execute user-defined code, but the same . // happens at run-time so that's okay. . match self.size_and_align_of(&base.meta, &field_layout)? { . Some((_, align)) => (base.meta, offset.align_to(align)), . None => { . // For unsized types with an extern type tail we perform no adjustments. . // NOTE: keep this in sync with `PlaceRef::project_field` in the codegen backend. -- line 369 ---------------------------------------- -- line 374 ---------------------------------------- . } else { . // base.meta could be present; we might be accessing a sized field of an unsized . // struct. . (MemPlaceMeta::None, offset) . }; . . // We do not look at `base.layout.align` nor `field_layout.align`, unlike . // codegen -- mostly to see if we can get away with that 148 ( 0.00%) base.offset(offset, meta, field_layout, self) . } . . /// Index into an array. . #[inline(always)] . pub fn mplace_index( . &self, . base: &MPlaceTy<'tcx, M::PointerTag>, . index: u64, -- line 390 ---------------------------------------- -- line 409 ---------------------------------------- . "`mplace_index` called on non-array type {:?}", . base.layout.ty . ), . } . } . . // Iterates over all fields of an array. Much more efficient than doing the . // same by repeatedly calling `mplace_array`. 70 ( 0.00%) pub(super) fn mplace_array_fields<'a>( . &self, . base: &'a MPlaceTy<'tcx, Tag>, . ) -> InterpResult<'tcx, impl Iterator>> + 'a> . { 28 ( 0.00%) let len = base.len(self)?; // also asserts that we have a type where this makes sense 21 ( 0.00%) let stride = match base.layout.fields { 7 ( 0.00%) FieldsShape::Array { stride, .. } => stride, . _ => span_bug!(self.cur_span(), "mplace_array_fields: expected an array layout"), . }; 14 ( 0.00%) let layout = base.layout.field(self, 0); 7 ( 0.00%) let dl = &self.tcx.data_layout; . // `Size` multiplication 6,291,565 ( 0.09%) Ok((0..len).map(move |i| base.offset(stride * i, MemPlaceMeta::None, layout, dl))) 63 ( 0.00%) } . . fn mplace_subslice( . &self, . base: &MPlaceTy<'tcx, M::PointerTag>, . from: u64, . to: u64, . from_end: bool, . ) -> InterpResult<'tcx, MPlaceTy<'tcx, M::PointerTag>> { -- line 439 ---------------------------------------- -- line 542 ---------------------------------------- . assert_eq!(layout.size, base.layout.size); . Ok((MPlaceTy { layout, ..*base }, len)) . } . . /// Gets the place of a field inside the place, and also the field's type. . /// Just a convenience function, but used quite a bit. . /// This is the only projection that might have a side-effect: We cannot project . /// into the field of a local `ScalarPair`, we have to first allocate it. 470 ( 0.00%) pub fn place_field( . &mut self, . base: &PlaceTy<'tcx, M::PointerTag>, . field: usize, . ) -> InterpResult<'tcx, PlaceTy<'tcx, M::PointerTag>> { . // FIXME: We could try to be smarter and avoid allocation for fields that span the . // entire place. 47 ( 0.00%) let mplace = self.force_allocation(base)?; 564 ( 0.00%) Ok(self.mplace_field(&mplace, field)?.into()) 376 ( 0.00%) } . . pub fn place_index( . &mut self, . base: &PlaceTy<'tcx, M::PointerTag>, . index: u64, . ) -> InterpResult<'tcx, PlaceTy<'tcx, M::PointerTag>> { . let mplace = self.force_allocation(base)?; . Ok(self.mplace_index(&mplace, index)?.into()) -- line 567 ---------------------------------------- -- line 586 ---------------------------------------- . . /// Projects into a place. . pub fn place_projection( . &mut self, . base: &PlaceTy<'tcx, M::PointerTag>, . &proj_elem: &mir::ProjectionElem>, . ) -> InterpResult<'tcx, PlaceTy<'tcx, M::PointerTag>> { . use rustc_middle::mir::ProjectionElem::*; 600 ( 0.00%) Ok(match proj_elem { 185 ( 0.00%) Field(field, _) => self.place_field(base, field.index())?, . Downcast(_, variant) => self.place_downcast(base, variant)?, 24 ( 0.00%) Deref => self.deref_operand(&self.place_to_op(base)?)?.into(), . // For the other variants, we have to force an allocation. . // This matches `operand_projection`. . Subslice { .. } | ConstantIndex { .. } | Index(_) => { . let mplace = self.force_allocation(base)?; . self.mplace_projection(&mplace, proj_elem)?.into() . } . }) . } -- line 605 ---------------------------------------- -- line 611 ---------------------------------------- . base: &PlaceTy<'tcx, M::PointerTag>, . ) -> InterpResult<'tcx, (MPlaceTy<'tcx, M::PointerTag>, u64)> { . let mplace = self.force_allocation(base)?; . self.mplace_to_simd(&mplace) . } . . /// Computes a place. You should only use this if you intend to write into this . /// place; for reading, a more efficient alternative is `eval_place_for_read`. 10,416 ( 0.00%) pub fn eval_place( . &mut self, . place: mir::Place<'tcx>, . ) -> InterpResult<'tcx, PlaceTy<'tcx, M::PointerTag>> { 6,510 ( 0.00%) let mut place_ty = PlaceTy { . // This works even for dead/uninitialized locals; we check further when writing . place: Place::Local { frame: self.frame_idx(), local: place.local }, . layout: self.layout_of_local(self.frame(), place.local, None)?, . }; . 80 ( 0.00%) for elem in place.projection.iter() { 40 ( 0.00%) place_ty = self.place_projection(&place_ty, &elem)? . } . . trace!("{:?}", self.dump_place(place_ty.place)); . // Sanity-check the type we ended up with. . debug_assert!(mir_assign_valid_types( . *self.tcx, . self.param_env, . self.layout_of(self.subst_from_current_frame_and_normalize_erasing_regions( . place.ty(&self.frame().body.local_decls, *self.tcx).ty . )?)?, . place_ty.layout, . )); 23,436 ( 0.00%) Ok(place_ty) 10,416 ( 0.00%) } . . /// Write an immediate to a place . #[inline(always)] . pub fn write_immediate( . &mut self, . src: Immediate, . dest: &PlaceTy<'tcx, M::PointerTag>, . ) -> InterpResult<'tcx> { 5,987 ( 0.00%) self.write_immediate_no_validate(src, dest)?; . . if M::enforce_validity(self) { . // Data got changed, better make sure it matches the type! . self.validate_operand(&self.place_to_op(dest)?)?; . } . . Ok(()) . } -- line 661 ---------------------------------------- -- line 672 ---------------------------------------- . . /// Write a pointer to a place . #[inline(always)] . pub fn write_pointer( . &mut self, . ptr: impl Into>>, . dest: &PlaceTy<'tcx, M::PointerTag>, . ) -> InterpResult<'tcx> { 9 ( 0.00%) self.write_scalar(Scalar::from_maybe_pointer(ptr.into(), self), dest) . } . . /// Write an immediate to a place. . /// If you use this you are responsible for validating that things got copied at the . /// right type. 1,384 ( 0.00%) fn write_immediate_no_validate( . &mut self, . src: Immediate, . dest: &PlaceTy<'tcx, M::PointerTag>, . ) -> InterpResult<'tcx> { . if cfg!(debug_assertions) { . // This is a very common path, avoid some checks in release mode . assert!(!dest.layout.is_unsized(), "Cannot write unsized data"); . match src { -- line 694 ---------------------------------------- -- line 705 ---------------------------------------- . // FIXME: Can we check anything here? . } . } . } . trace!("write_immediate: {:?} <- {:?}: {}", *dest, src, dest.layout.ty); . . // See if we can avoid an allocation. This is the counterpart to `try_read_immediate`, . // but not factored as a separate function. 2,768 ( 0.00%) let mplace = match dest.place { 2,484 ( 0.00%) Place::Local { frame, local } => { . match M::access_local_mut(self, frame, local)? { . Ok(local) => { . // Local can be updated in-place. 12,420 ( 0.00%) *local = LocalValue::Live(Operand::Immediate(src)); . return Ok(()); . } . Err(mplace) => { . // The local is in memory, go on below. . mplace . } . } . } 852 ( 0.00%) Place::Ptr(mplace) => mplace, // already referring to memory . }; 1,278 ( 0.00%) let dest = MPlaceTy { mplace, layout: dest.layout }; . . // This is already in memory, write there. 1,562 ( 0.00%) self.write_immediate_to_mplace_no_validate(src, &dest) 2,768 ( 0.00%) } . . /// Write an immediate to memory. . /// If you use this you are responsible for validating that things got copied at the . /// right type. 1,420 ( 0.00%) fn write_immediate_to_mplace_no_validate( . &mut self, . value: Immediate, . dest: &MPlaceTy<'tcx, M::PointerTag>, . ) -> InterpResult<'tcx> { . // Note that it is really important that the type here is the right one, and matches the . // type things are read at. In case `src_val` is a `ScalarPair`, we don't do any magic here . // to handle padding properly, which is only correct if we never look at this data with the . // wrong type. . . // Invalid places are a thing: the return place of a diverging function 142 ( 0.00%) let tcx = *self.tcx; 284 ( 0.00%) let mut alloc = match self.get_alloc_mut(dest)? { 710 ( 0.00%) Some(a) => a, . None => return Ok(()), // zero-sized access . }; . . // FIXME: We should check that there are dest.layout.size many bytes available in . // memory. The code below is not sufficient, with enough padding it might not . // cover all the bytes! 284 ( 0.00%) match value { . Immediate::Scalar(scalar) => { 278 ( 0.00%) match dest.layout.abi { . Abi::Scalar(_) => {} // fine . _ => span_bug!( . self.cur_span(), . "write_immediate_to_mplace: invalid Scalar layout: {:#?}", . dest.layout . ), . } 1,251 ( 0.00%) alloc.write_scalar(alloc_range(Size::ZERO, dest.layout.size), scalar) . } . Immediate::ScalarPair(a_val, b_val) => { . // We checked `ptr_align` above, so all fields will have the alignment they need. . // We would anyway check against `ptr_align.restrict_for_offset(b_offset)`, . // which `ptr.offset(b_offset)` cannot possibly fail to satisfy. 6 ( 0.00%) let (a, b) = match dest.layout.abi { 9 ( 0.00%) Abi::ScalarPair(a, b) => (a.value, b.value), . _ => span_bug!( . self.cur_span(), . "write_immediate_to_mplace: invalid ScalarPair layout: {:#?}", . dest.layout . ), . }; . let (a_size, b_size) = (a.size(&tcx), b.size(&tcx)); . let b_offset = a_size.align_to(b.align(&tcx).abi); . . // It is tempting to verify `b_offset` against `layout.fields.offset(1)`, . // but that does not work: We could be a newtype around a pair, then the . // fields do not match the `ScalarPair` components. . 30 ( 0.00%) alloc.write_scalar(alloc_range(Size::ZERO, a_size), a_val)?; 24 ( 0.00%) alloc.write_scalar(alloc_range(b_offset, b_size), b_val) . } . } 1,136 ( 0.00%) } . . /// Copies the data from an operand to a place. This does not support transmuting! . /// Use `copy_op_transmute` if the layouts could disagree. . #[inline(always)] . pub fn copy_op( . &mut self, . src: &OpTy<'tcx, M::PointerTag>, . dest: &PlaceTy<'tcx, M::PointerTag>, . ) -> InterpResult<'tcx> { 5,034 ( 0.00%) self.copy_op_no_validate(src, dest)?; . . if M::enforce_validity(self) { . // Data got changed, better make sure it matches the type! . self.validate_operand(&self.place_to_op(dest)?)?; . } . . Ok(()) . } . . /// Copies the data from an operand to a place. This does not support transmuting! . /// Use `copy_op_transmute` if the layouts could disagree. . /// Also, if you use this you are responsible for validating that things get copied at the . /// right type. 6,840 ( 0.00%) fn copy_op_no_validate( . &mut self, . src: &OpTy<'tcx, M::PointerTag>, . dest: &PlaceTy<'tcx, M::PointerTag>, . ) -> InterpResult<'tcx> { . // We do NOT compare the types for equality, because well-typed code can . // actually "transmute" `&mut T` to `&T` in an assignment without a cast. 15,390 ( 0.00%) if !mir_assign_valid_types(*self.tcx, self.param_env, src.layout, dest.layout) { . span_bug!( . self.cur_span(), . "type mismatch when copying!\nsrc: {:?},\ndest: {:?}", . src.layout.ty, . dest.layout.ty, . ); . } . . // Let us see if the layout is simple so we take a shortcut, avoid force_allocation. 4,275 ( 0.00%) let src = match self.try_read_immediate(src)? { . Ok(src_val) => { 820 ( 0.00%) assert!(!src.layout.is_unsized(), "cannot have unsized immediates"); . // Yay, we got a value that we can write directly. . // FIXME: Add a check to make sure that if `src` is indirect, . // it does not overlap with `dest`. 10,660 ( 0.00%) return self.write_immediate_no_validate(*src_val, dest); . } 280 ( 0.00%) Err(mplace) => mplace, . }; . // Slow path, this does not fit into an immediate. Just memcpy. . trace!("copy_op: {:?} <- {:?}: {}", *dest, src, dest.layout.ty); . . // This interprets `src.meta` with the `dest` local's layout, if an unsized local . // is being initialized! 455 ( 0.00%) let (dest, size) = self.force_allocation_maybe_sized(dest, src.meta)?; . let size = size.unwrap_or_else(|| { 54 ( 0.00%) assert!( . !dest.layout.is_unsized(), . "Cannot copy into already initialized unsized place" . ); 18 ( 0.00%) dest.layout.size . }); 35 ( 0.00%) assert_eq!(src.meta, dest.meta, "Can only copy between equally-sized instances"); . 35 ( 0.00%) self.memory 105 ( 0.00%) .copy(src.ptr, src.align, dest.ptr, dest.align, size, /*nonoverlapping*/ true) 6,840 ( 0.00%) } . . /// Copies the data from an operand to a place. The layouts may disagree, but they must . /// have the same size. 1,496 ( 0.00%) pub fn copy_op_transmute( . &mut self, . src: &OpTy<'tcx, M::PointerTag>, . dest: &PlaceTy<'tcx, M::PointerTag>, . ) -> InterpResult<'tcx> { 3,366 ( 0.00%) if mir_assign_valid_types(*self.tcx, self.param_env, src.layout, dest.layout) { . // Fast path: Just use normal `copy_op` . return self.copy_op(src, dest); . } . // We still require the sizes to match. . if src.layout.size != dest.layout.size { . // FIXME: This should be an assert instead of an error, but if we transmute within an . // array length computation, `typeck` may not have yet been run and errored out. In fact . // most likey we *are* running `typeck` right now. Investigate whether we can bail out -- line 878 ---------------------------------------- -- line 916 ---------------------------------------- . /// Ensures that a place is in memory, and returns where it is. . /// If the place currently refers to a local that doesn't yet have a matching allocation, . /// create such an allocation. . /// This is essentially `force_to_memplace`. . /// . /// This supports unsized types and returns the computed size to avoid some . /// redundant computation when copying; use `force_allocation` for a simpler, sized-only . /// version. 783 ( 0.00%) pub fn force_allocation_maybe_sized( . &mut self, . place: &PlaceTy<'tcx, M::PointerTag>, . meta: MemPlaceMeta, . ) -> InterpResult<'tcx, (MPlaceTy<'tcx, M::PointerTag>, Option)> { 870 ( 0.00%) let (mplace, size) = match place.place { 66 ( 0.00%) Place::Local { frame, local } => { 132 ( 0.00%) match M::access_local_mut(self, frame, local)? { 450 ( 0.00%) Ok(&mut local_val) => { . // We need to make an allocation. . . // We need the layout of the local. We can NOT use the layout we got, . // that might e.g., be an inner field of a struct with `Scalar` layout, . // that has different alignment than the outer field. . let local_layout = 250 ( 0.00%) self.layout_of_local(&self.stack()[frame], local, None)?; . // We also need to support unsized types, and hence cannot use `allocate`. 200 ( 0.00%) let (size, align) = self . .size_and_align_of(&meta, &local_layout)? . .expect("Cannot allocate for non-dyn-sized type"); 350 ( 0.00%) let ptr = self.memory.allocate(size, align, MemoryKind::Stack)?; . let mplace = MemPlace { ptr: ptr.into(), align, meta }; 250 ( 0.00%) if let LocalValue::Live(Operand::Immediate(value)) = local_val { . // Preserve old value. . // We don't have to validate as we can assume the local . // was already valid for its type. . let mplace = MPlaceTy { mplace, layout: local_layout }; . self.write_immediate_to_mplace_no_validate(value, &mplace)?; . } . // Now we can call `access_mut` again, asserting it goes well, . // and actually overwrite things. 950 ( 0.00%) *M::access_local_mut(self, frame, local).unwrap().unwrap() = . LocalValue::Live(Operand::Indirect(mplace)); 350 ( 0.00%) (mplace, Some(size)) . } 160 ( 0.00%) Err(mplace) => (mplace, None), // this already was an indirect local . } . } 273 ( 0.00%) Place::Ptr(mplace) => (mplace, None), . }; . // Return with the original layout, so that the caller can go on 1,044 ( 0.00%) Ok((MPlaceTy { mplace, layout: place.layout }, size)) 696 ( 0.00%) } . . #[inline(always)] . pub fn force_allocation( . &mut self, . place: &PlaceTy<'tcx, M::PointerTag>, . ) -> InterpResult<'tcx, MPlaceTy<'tcx, M::PointerTag>> { 460 ( 0.00%) Ok(self.force_allocation_maybe_sized(place, MemPlaceMeta::None)?.0) . } . . pub fn allocate( . &mut self, . layout: TyAndLayout<'tcx>, . kind: MemoryKind, . ) -> InterpResult<'static, MPlaceTy<'tcx, M::PointerTag>> { 784 ( 0.00%) let ptr = self.memory.allocate(layout.size, layout.align.abi, kind)?; . Ok(MPlaceTy::from_aligned_ptr(ptr.into(), layout)) . } . . /// Returns a wide MPlace of type `&'static [mut] str` to a new 1-aligned allocation. . pub fn allocate_str( . &mut self, . str: &str, . kind: MemoryKind, -- line 989 ---------------------------------------- -- line 1084 ---------------------------------------- . self.write_immediate(*tag_val, &niche_dest)?; . } . } . } . . Ok(()) . } . 900 ( 0.00%) pub fn raw_const_to_mplace( . &self, . raw: ConstAlloc<'tcx>, . ) -> InterpResult<'tcx, MPlaceTy<'tcx, M::PointerTag>> { . // This must be an allocation in `tcx` 300 ( 0.00%) let _ = self.tcx.global_alloc(raw.alloc_id); . let ptr = self.global_base_pointer(Pointer::from(raw.alloc_id))?; 300 ( 0.00%) let layout = self.layout_of(raw.ty)?; 600 ( 0.00%) Ok(MPlaceTy::from_aligned_ptr(ptr.into(), layout)) 700 ( 0.00%) } . . /// Turn a place with a `dyn Trait` type into a place with the actual dynamic type. . /// Also return some more information so drop doesn't have to run the same code twice. . pub(super) fn unpack_dyn_trait( . &self, . mplace: &MPlaceTy<'tcx, M::PointerTag>, . ) -> InterpResult<'tcx, (ty::Instance<'tcx>, MPlaceTy<'tcx, M::PointerTag>)> { . let vtable = self.scalar_to_ptr(mplace.vtable()); // also sanity checks the type -- line 1109 ---------------------------------------- 10,240 ( 0.00%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/walk.rs -------------------------------------------------------------------------------- Ir -- line 20 ---------------------------------------- . /// . /// It's very easy to produce a deeply . /// nested type tree with a lot of . /// identical subtrees. In order to work efficiently . /// in this situation walker only visits each type once. . /// It maintains a set of visited types and . /// skips any types that are already there. . impl<'tcx> TypeWalker<'tcx> { 100,368 ( 0.00%) pub fn new(root: GenericArg<'tcx>) -> Self { 401,472 ( 0.01%) Self { stack: smallvec![root], last_subtree: 1, visited: SsoHashSet::new() } 100,368 ( 0.00%) } . . /// Skips the subtree corresponding to the last type . /// returned by `next()`. . /// . /// Example: Imagine you are walking `Foo, usize>`. . /// . /// ``` . /// let mut iter: TypeWalker = ...; . /// iter.next(); // yields Foo . /// iter.next(); // yields Bar . /// iter.skip_current_subtree(); // skips i32 . /// iter.next(); // yields usize . /// ``` . pub fn skip_current_subtree(&mut self) { 988 ( 0.00%) self.stack.truncate(self.last_subtree); 494 ( 0.00%) } . } . . impl<'tcx> Iterator for TypeWalker<'tcx> { . type Item = GenericArg<'tcx>; . 3,210,840 ( 0.05%) fn next(&mut self) -> Option> { . debug!("next(): stack={:?}", self.stack); . loop { 547,464 ( 0.01%) let next = self.stack.pop()?; 273,732 ( 0.00%) self.last_subtree = self.stack.len(); 547,464 ( 0.01%) if self.visited.insert(next) { 769,176 ( 0.01%) push_inner(&mut self.stack, next); . debug!("next: stack={:?}", self.stack); . return Some(next); . } . } 2,497,320 ( 0.04%) } . } . . impl<'tcx> GenericArg<'tcx> { . /// Iterator that walks `self` and any types reachable from . /// `self`, in depth-first order. Note that just walks the types . /// that appear in `self`, it does not descend into the fields of . /// structs or variants. For example: . /// . /// ```text . /// isize => { isize } . /// Foo> => { Foo>, Bar, isize } . /// [isize] => { [isize], isize } . /// ``` 100,518 ( 0.00%) pub fn walk(self) -> TypeWalker<'tcx> { 50,259 ( 0.00%) TypeWalker::new(self) 150,777 ( 0.00%) } . . /// Iterator that walks the immediate children of `self`. Hence . /// `Foo, u32>` yields the sequence `[Bar, u32]` . /// (but not `i32`, like `walk`). . /// . /// Iterator only walks items once. . /// It accepts visited set, updates it with all visited types . /// and skips any types that are already there. 384,995 ( 0.01%) pub fn walk_shallow( . self, . visited: &mut SsoHashSet>, . ) -> impl Iterator> { . let mut stack = SmallVec::new(); 76,999 ( 0.00%) push_inner(&mut stack, self); 153,998 ( 0.00%) stack.retain(|a| visited.insert(*a)); 846,989 ( 0.01%) stack.into_iter() 384,995 ( 0.01%) } . } . . impl<'tcx> super::TyS<'tcx> { . /// Iterator that walks `self` and any types reachable from . /// `self`, in depth-first order. Note that just walks the types . /// that appear in `self`, it does not descend into the fields of . /// structs or variants. For example: . /// . /// ```text . /// isize => { isize } . /// Foo> => { Foo>, Bar, isize } . /// [isize] => { [isize], isize } . /// ``` 100,218 ( 0.00%) pub fn walk(&'tcx self) -> TypeWalker<'tcx> { 50,109 ( 0.00%) TypeWalker::new(self.into()) 150,327 ( 0.00%) } . } . . /// We push `GenericArg`s on the stack in reverse order so as to . /// maintain a pre-order traversal. As of the time of this . /// writing, the fact that the traversal is pre-order is not . /// known to be significant to any code, but it seems like the . /// natural order one would expect (basically, the order of the . /// types as they are written). 2,000,346 ( 0.03%) fn push_inner<'tcx>(stack: &mut TypeWalkerStack<'tcx>, parent: GenericArg<'tcx>) { . match parent.unpack() { 1,447,595 ( 0.02%) GenericArgKind::Type(parent_ty) => match *parent_ty.kind() { . ty::Bool . | ty::Char . | ty::Int(_) . | ty::Uint(_) . | ty::Float(_) . | ty::Str . | ty::Infer(_) . | ty::Param(_) . | ty::Never . | ty::Error(_) . | ty::Placeholder(..) . | ty::Bound(..) . | ty::Foreign(..) => {} . 4,528 ( 0.00%) ty::Array(ty, len) => { 6,792 ( 0.00%) stack.push(len.into()); . stack.push(ty.into()); . } . ty::Slice(ty) => { . stack.push(ty.into()); . } . ty::RawPtr(mt) => { . stack.push(mt.ty.into()); . } 78,818 ( 0.00%) ty::Ref(lt, ty, _) => { 78,818 ( 0.00%) stack.push(ty.into()); . stack.push(lt.into()); . } 66 ( 0.00%) ty::Projection(data) => { . stack.extend(data.substs.iter().rev()); . } 2,492 ( 0.00%) ty::Dynamic(obj, lt) => { 2,492 ( 0.00%) stack.push(lt.into()); 2,492 ( 0.00%) stack.extend(obj.iter().rev().flat_map(|predicate| { . let (substs, opt_ty) = match predicate.skip_binder() { . ty::ExistentialPredicate::Trait(tr) => (tr.substs, None), . ty::ExistentialPredicate::Projection(p) => (p.substs, Some(p.term)), . ty::ExistentialPredicate::AutoTrait(_) => . // Empty iterator . { . (ty::InternalSubsts::empty(), None) . } . }; . 990 ( 0.00%) substs.iter().rev().chain(opt_ty.map(|term| match term { . ty::Term::Ty(ty) => ty.into(), . ty::Term::Const(ct) => ct.into(), . })) . })); . } . ty::Adt(_, substs) . | ty::Opaque(_, substs) . | ty::Closure(_, substs) . | ty::Generator(_, substs, _) 15,028 ( 0.00%) | ty::Tuple(substs) . | ty::FnDef(_, substs) => { . stack.extend(substs.iter().rev()); . } 9 ( 0.00%) ty::GeneratorWitness(ts) => { 54 ( 0.00%) stack.extend(ts.skip_binder().iter().rev().map(|ty| ty.into())); . } 14,574 ( 0.00%) ty::FnPtr(sig) => { 51,009 ( 0.00%) stack.push(sig.skip_binder().output().into()); 58,296 ( 0.00%) stack.extend(sig.skip_binder().inputs().iter().copied().rev().map(|ty| ty.into())); . } . }, . GenericArgKind::Lifetime(_) => {} . GenericArgKind::Const(parent_ct) => { . stack.push(parent_ct.ty.into()); 4,548 ( 0.00%) match parent_ct.val { . ty::ConstKind::Infer(_) . | ty::ConstKind::Param(_) . | ty::ConstKind::Placeholder(_) . | ty::ConstKind::Bound(..) . | ty::ConstKind::Value(_) . | ty::ConstKind::Error(_) => {} . 39 ( 0.00%) ty::ConstKind::Unevaluated(ct) => { . stack.extend(ct.substs.iter().rev()); . } . } . } . } 666,115 ( 0.01%) } 2,364,346 ( 0.03%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/mir/traversal.rs -------------------------------------------------------------------------------- Ir -- line 23 ---------------------------------------- . pub struct Preorder<'a, 'tcx> { . body: &'a Body<'tcx>, . visited: BitSet, . worklist: Vec, . root_is_start_block: bool, . } . . impl<'a, 'tcx> Preorder<'a, 'tcx> { 74,650 ( 0.00%) pub fn new(body: &'a Body<'tcx>, root: BasicBlock) -> Preorder<'a, 'tcx> { 7,465 ( 0.00%) let worklist = vec![root]; . 22,395 ( 0.00%) Preorder { . body, . visited: BitSet::new_empty(body.basic_blocks().len()), 29,860 ( 0.00%) worklist, . root_is_start_block: root == START_BLOCK, . } 67,185 ( 0.00%) } . } . 8,484 ( 0.00%) pub fn preorder<'a, 'tcx>(body: &'a Body<'tcx>) -> Preorder<'a, 'tcx> { 27,822 ( 0.00%) Preorder::new(body, START_BLOCK) 12,726 ( 0.00%) } . . impl<'a, 'tcx> Iterator for Preorder<'a, 'tcx> { . type Item = (BasicBlock, &'a BasicBlockData<'tcx>); . 1,603,965 ( 0.02%) fn next(&mut self) -> Option<(BasicBlock, &'a BasicBlockData<'tcx>)> { 218,367 ( 0.00%) while let Some(idx) = self.worklist.pop() { 218,367 ( 0.00%) if !self.visited.insert(idx) { . continue; . } . 138,350 ( 0.00%) let data = &self.body[idx]; . 691,750 ( 0.01%) if let Some(ref term) = data.terminator { . self.worklist.extend(term.successors()); . } . . return Some((idx, data)); . } . . None 1,312,335 ( 0.02%) } . . fn size_hint(&self) -> (usize, Option) { . // All the blocks, minus the number of blocks we've visited. . let upper = self.body.basic_blocks().len() - self.visited.count(); . . let lower = if self.root_is_start_block { . // We will visit all remaining blocks exactly once. . upper -- line 74 ---------------------------------------- -- line 101 ---------------------------------------- . pub struct Postorder<'a, 'tcx> { . body: &'a Body<'tcx>, . visited: BitSet, . visit_stack: Vec<(BasicBlock, Successors<'a>)>, . root_is_start_block: bool, . } . . impl<'a, 'tcx> Postorder<'a, 'tcx> { 69,797 ( 0.00%) pub fn new(body: &'a Body<'tcx>, root: BasicBlock) -> Postorder<'a, 'tcx> { . let mut po = Postorder { . body, . visited: BitSet::new_empty(body.basic_blocks().len()), . visit_stack: Vec::new(), . root_is_start_block: root == START_BLOCK, . }; . . let data = &po.body[root]; . 69,797 ( 0.00%) if let Some(ref term) = data.terminator { . po.visited.insert(root); 39,884 ( 0.00%) po.visit_stack.push((root, term.successors())); 19,942 ( 0.00%) po.traverse_successor(); . } . . po 89,739 ( 0.00%) } . 1,390,802 ( 0.02%) fn traverse_successor(&mut self) { . // This is quite a complex loop due to 1. the borrow checker not liking it much . // and 2. what exactly is going on is not clear . // . // It does the actual traversal of the graph, while the `next` method on the iterator . // just pops off of the stack. `visit_stack` is a stack containing pairs of nodes and . // iterators over the successors of those nodes. Each iteration attempts to get the next . // node from the top of the stack, then pushes that node and an iterator over the . // successors to the top of the stack. This loop only grows `visit_stack`, stopping when -- line 136 ---------------------------------------- -- line 169 ---------------------------------------- . // . // Now that the top of the stack has no successors we can traverse, each item will . // be popped off during iteration until we get back to `A`. This yields [E, D, B]. . // . // When we yield `B` and call `traverse_successor`, we push `C` to the stack, but . // since we've already visited `E`, that child isn't added to the stack. The last . // two iterations yield `C` and finally `A` for a final traversal of [E, D, B, C, A] . loop { 1,448,063 ( 0.02%) let bb = if let Some(&mut (_, ref mut iter)) = self.visit_stack.last_mut() { 871,947 ( 0.01%) if let Some(&bb) = iter.next() { . bb . } else { . break; . } . } else { . break; . }; . 290,649 ( 0.00%) if self.visited.insert(bb) { 1,251,208 ( 0.02%) if let Some(term) = &self.body[bb].terminator { 714,976 ( 0.01%) self.visit_stack.push((bb, term.successors())); . } . } . } 1,589,488 ( 0.02%) } . } . 490 ( 0.00%) pub fn postorder<'a, 'tcx>(body: &'a Body<'tcx>) -> Postorder<'a, 'tcx> { 490 ( 0.00%) Postorder::new(body, START_BLOCK) 735 ( 0.00%) } . . impl<'a, 'tcx> Iterator for Postorder<'a, 'tcx> { . type Item = (BasicBlock, &'a BasicBlockData<'tcx>); . 2,259 ( 0.00%) fn next(&mut self) -> Option<(BasicBlock, &'a BasicBlockData<'tcx>)> { . let next = self.visit_stack.pop(); 188,715 ( 0.00%) if next.is_some() { 367,704 ( 0.01%) self.traverse_successor(); . } . 188,715 ( 0.00%) next.map(|(bb, _)| (bb, &self.body[bb])) 3,765 ( 0.00%) } . 1,240 ( 0.00%) fn size_hint(&self) -> (usize, Option) { . // All the blocks, minus the number of blocks we've visited. 33,948 ( 0.00%) let upper = self.body.basic_blocks().len() - self.visited.count(); . 33,948 ( 0.00%) let lower = if self.root_is_start_block { . // We will visit all remaining blocks exactly once. . upper . } else { . self.visit_stack.len() . }; . 744 ( 0.00%) (lower, Some(upper)) 1,736 ( 0.00%) } . } . . /// Reverse postorder traversal of a graph . /// . /// Reverse postorder is the reverse order of a postorder traversal. . /// This is different to a preorder traversal and represents a natural . /// linearization of control-flow. . /// -- line 232 ---------------------------------------- -- line 253 ---------------------------------------- . pub struct ReversePostorder<'a, 'tcx> { . body: &'a Body<'tcx>, . blocks: Vec, . idx: usize, . } . . impl<'a, 'tcx> ReversePostorder<'a, 'tcx> { . pub fn new(body: &'a Body<'tcx>, root: BasicBlock) -> ReversePostorder<'a, 'tcx> { 19,452 ( 0.00%) let blocks: Vec<_> = Postorder::new(body, root).map(|(bb, _)| bb).collect(); . 9,726 ( 0.00%) let len = blocks.len(); . 48,630 ( 0.00%) ReversePostorder { body, blocks, idx: len } . } . } . 58,356 ( 0.00%) pub fn reverse_postorder<'a, 'tcx>(body: &'a Body<'tcx>) -> ReversePostorder<'a, 'tcx> { . ReversePostorder::new(body, START_BLOCK) 48,630 ( 0.00%) } . . impl<'a, 'tcx> Iterator for ReversePostorder<'a, 'tcx> { . type Item = (BasicBlock, &'a BasicBlockData<'tcx>); . 197,933 ( 0.00%) fn next(&mut self) -> Option<(BasicBlock, &'a BasicBlockData<'tcx>)> { 791,732 ( 0.01%) if self.idx == 0 { . return None; . } 376,414 ( 0.01%) self.idx -= 1; . . self.blocks.get(self.idx).map(|&bb| (bb, &self.body[bb])) 395,866 ( 0.01%) } . . fn size_hint(&self) -> (usize, Option) { . (self.idx, Some(self.idx)) . } . } . . impl<'a, 'tcx> ExactSizeIterator for ReversePostorder<'a, 'tcx> {} . -- line 291 ---------------------------------------- -- line 295 ---------------------------------------- . /// This is clearer than writing `preorder` in cases where the order doesn't matter. . pub fn reachable<'a, 'tcx>( . body: &'a Body<'tcx>, . ) -> impl 'a + Iterator)> { . preorder(body) . } . . /// Returns a `BitSet` containing all basic blocks reachable from the `START_BLOCK`. 19,338 ( 0.00%) pub fn reachable_as_bitset<'tcx>(body: &Body<'tcx>) -> BitSet { . let mut iter = preorder(body); . (&mut iter).for_each(drop); 12,892 ( 0.00%) iter.visited 19,338 ( 0.00%) } 1,925,528 ( 0.03%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/alloc/src/collections/btree/search.rs -------------------------------------------------------------------------------- Ir -- line 40 ---------------------------------------- . . impl NodeRef { . /// Looks up a given key in a (sub)tree headed by the node, recursively. . /// Returns a `Found` with the handle of the matching KV, if any. Otherwise, . /// returns a `GoDown` with the handle of the leaf edge where the key belongs. . /// . /// The result is meaningful only if the tree is ordered by key, like the tree . /// in a `BTreeMap` is. 2,898,336 ( 0.04%) pub fn search_tree( . mut self, . key: &Q, . ) -> SearchResult . where . Q: Ord, . K: Borrow, . { . loop { . self = match self.search_node(key) { . Found(handle) => return Found(handle), 173,798 ( 0.00%) GoDown(handle) => match handle.force() { . Leaf(leaf) => return GoDown(leaf), . Internal(internal) => internal.descend(), . }, . } . } 1,552,275 ( 0.02%) } . . /// Descends to the nearest node where the edge matching the lower bound . /// of the range is different from the edge matching the upper bound, i.e., . /// the nearest node that has at least one key contained in the range. . /// . /// If found, returns an `Ok` with that node, the strictly ascending pair of . /// edge indices in the node delimiting the range, and the corresponding . /// pair of bounds for continuing the search in the child nodes, in case -- line 73 ---------------------------------------- -- line 202 ---------------------------------------- . unsafe fn find_key_index(&self, key: &Q, start_index: usize) -> IndexResult . where . Q: Ord, . K: Borrow, . { . let node = self.reborrow(); . let keys = node.keys(); . debug_assert!(start_index <= keys.len()); 2,064,008 ( 0.03%) for (offset, k) in unsafe { keys.get_unchecked(start_index..) }.iter().enumerate() { 8,404,107 ( 0.12%) match key.cmp(k.borrow()) { . Ordering::Greater => {} . Ordering::Equal => return IndexResult::KV(start_index + offset), . Ordering::Less => return IndexResult::Edge(start_index + offset), . } . } . IndexResult::Edge(keys.len()) . } . -- line 219 ---------------------------------------- 4,248,868 ( 0.06%) -------------------------------------------------------------------------------- -- 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>(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. 1,482,582 ( 0.02%) let enough_space = match remaining_stack() { . Some(remaining) => remaining >= red_zone, . None => false, . }; 2,120,121 ( 0.03%) if enough_space { 132,425 ( 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. 1,413,414 ( 0.02%) pub fn remaining_stack() -> Option { . let current_ptr = current_stack_ptr(); 1,413,414 ( 0.02%) get_stack_limit().map(|limit| current_ptr - limit) 2,826,828 ( 0.04%) } . . psm_stack_information! ( . yes { . fn current_stack_ptr() -> usize { 1,413,414 ( 0.02%) psm::stack_pointer() as usize . } . } . no { . #[inline(always)] . fn current_stack_ptr() -> usize { . unsafe { . let mut x = std::mem::MaybeUninit::::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> = Cell::new(unsafe { 1 ( 0.00%) guess_os_stack_limit() . }) . } . . #[inline(always)] . fn get_stack_limit() -> Option { . STACK_LIMIT.with(|s| s.get()) . } . -- line 127 ---------------------------------------- -- line 403 ---------------------------------------- . VirtualQuery( . psm::stack_pointer() as *const _, . mi.as_mut_ptr(), . std::mem::size_of::() 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 { . let mut attr = std::mem::MaybeUninit::::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 { . let mut attr = std::mem::MaybeUninit::::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 ---------------------------------------- 932,186 ( 0.01%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/result.rs -------------------------------------------------------------------------------- Ir -- line 491 ---------------------------------------- . . use crate::iter::{self, FromIterator, FusedIterator, TrustedLen}; . use crate::ops::{self, ControlFlow, Deref, DerefMut}; . use crate::{convert, fmt, hint}; . . /// `Result` is a type that represents either success ([`Ok`]) or failure ([`Err`]). . /// . /// See the [module documentation](self) for details. 120 ( 0.00%) #[derive(Copy, PartialEq, PartialOrd, Eq, Ord, Debug, Hash)] . #[must_use = "this `Result` may be an `Err` variant, which should be handled"] . #[rustc_diagnostic_item = "Result"] . #[stable(feature = "rust1", since = "1.0.0")] . pub enum Result { . /// Contains the success value . #[lang = "Ok"] . #[stable(feature = "rust1", since = "1.0.0")] 423 ( 0.00%) Ok(#[stable(feature = "rust1", since = "1.0.0")] T), . . /// Contains the error value . #[lang = "Err"] . #[stable(feature = "rust1", since = "1.0.0")] . Err(#[stable(feature = "rust1", since = "1.0.0")] E), . } . . ///////////////////////////////////////////////////////////////////////////// -- line 515 ---------------------------------------- -- line 534 ---------------------------------------- . /// let x: Result = Err("Some error message"); . /// assert_eq!(x.is_ok(), false); . /// ``` . #[must_use = "if you intended to assert that this is ok, consider `.unwrap()` instead"] . #[rustc_const_stable(feature = "const_result", since = "1.48.0")] . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub const fn is_ok(&self) -> bool { 21,026 ( 0.00%) matches!(*self, Ok(_)) . } . . /// Returns `true` if the result is [`Ok`] wrapping a value matching the predicate. . /// . /// # Examples . /// . /// ``` . /// #![feature(is_some_with)] -- line 550 ---------------------------------------- -- line 628 ---------------------------------------- . /// assert_eq!(x.ok(), Some(2)); . /// . /// let x: Result = Err("Nothing here"); . /// assert_eq!(x.ok(), None); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn ok(self) -> Option { 80,447 ( 0.00%) match self { 83,437 ( 0.00%) Ok(x) => Some(x), . Err(_) => None, . } . } . . /// Converts from `Result` to [`Option`]. . /// . /// Converts `self` into an [`Option`], consuming `self`, . /// and discarding the success value, if any. -- line 645 ---------------------------------------- -- line 657 ---------------------------------------- . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn err(self) -> Option { . match self { . Ok(_) => None, . Err(x) => Some(x), . } 4 ( 0.00%) } . . ///////////////////////////////////////////////////////////////////////// . // Adapter for working with references . ///////////////////////////////////////////////////////////////////////// . . /// Converts from `&Result` to `Result<&T, &E>`. . /// . /// Produces a new `Result`, containing a reference -- line 673 ---------------------------------------- -- line 683 ---------------------------------------- . /// . /// let x: Result = Err("Error"); . /// assert_eq!(x.as_ref(), Err(&"Error")); . /// ``` . #[inline] . #[rustc_const_stable(feature = "const_result", since = "1.48.0")] . #[stable(feature = "rust1", since = "1.0.0")] . pub const fn as_ref(&self) -> Result<&T, &E> { 62 ( 0.00%) match *self { . Ok(ref x) => Ok(x), . Err(ref x) => Err(x), . } . } . . /// Converts from `&mut Result` to `Result<&mut T, &mut E>`. . /// . /// # Examples -- line 699 ---------------------------------------- -- line 715 ---------------------------------------- . /// let mut x: Result = Err(13); . /// mutate(&mut x); . /// assert_eq!(x.unwrap_err(), 0); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_result", issue = "82814")] . pub const fn as_mut(&mut self) -> Result<&mut T, &mut E> { 18,859 ( 0.00%) match *self { . Ok(ref mut x) => Ok(x), . Err(ref mut x) => Err(x), . } . } . . ///////////////////////////////////////////////////////////////////////// . // Transforming contained values . ///////////////////////////////////////////////////////////////////////// -- line 731 ---------------------------------------- -- line 747 ---------------------------------------- . /// Ok(n) => println!("{}", n), . /// Err(..) => {} . /// } . /// } . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn map U>(self, op: F) -> Result { 994,391 ( 0.01%) match self { 1,188,260 ( 0.02%) Ok(t) => Ok(op(t)), 230,969 ( 0.00%) Err(e) => Err(e), . } 1,618 ( 0.00%) } . . /// Returns the provided default (if [`Err`]), or . /// applies a function to the contained value (if [`Ok`]), . /// . /// Arguments passed to `map_or` are eagerly evaluated; if you are passing . /// the result of a function call, it is recommended to use [`map_or_else`], . /// which is lazily evaluated. . /// -- line 767 ---------------------------------------- -- line 774 ---------------------------------------- . /// assert_eq!(x.map_or(42, |v| v.len()), 3); . /// . /// let x: Result<&str, _> = Err("bar"); . /// assert_eq!(x.map_or(42, |v| v.len()), 42); . /// ``` . #[inline] . #[stable(feature = "result_map_or", since = "1.41.0")] . pub fn map_or U>(self, default: U, f: F) -> U { 2,539 ( 0.00%) match self { 367 ( 0.00%) Ok(t) => f(t), . Err(_) => default, . } . } . . /// Maps a `Result` to `U` by applying fallback function `default` to . /// a contained [`Err`] value, or function `f` to a contained [`Ok`] value. . /// . /// This function can be used to unpack a successful result -- line 791 ---------------------------------------- -- line 831 ---------------------------------------- . /// let x: Result = Ok(2); . /// assert_eq!(x.map_err(stringify), Ok(2)); . /// . /// let x: Result = Err(13); . /// assert_eq!(x.map_err(stringify), Err("error code: 13".to_string())); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] 2,194 ( 0.00%) pub fn map_err F>(self, op: O) -> Result { 1,972,743 ( 0.03%) match self { 2,666,973 ( 0.04%) Ok(t) => Ok(t), 17,377 ( 0.00%) Err(e) => Err(op(e)), . } 17,147 ( 0.00%) } . . /// Calls the provided closure with a reference to the contained value (if [`Ok`]). . /// . /// # Examples . /// . /// ``` . /// #![feature(result_option_inspect)] . /// -- line 852 ---------------------------------------- -- line 1012 ---------------------------------------- . /// ``` . #[inline] . #[track_caller] . #[stable(feature = "result_expect", since = "1.4.0")] . pub fn expect(self, msg: &str) -> T . where . E: fmt::Debug, . { 41,682 ( 0.00%) match self { 918 ( 0.00%) Ok(t) => t, . Err(e) => unwrap_failed(msg, &e), . } . } . . /// Returns the contained [`Ok`] value, consuming the `self` value. . /// . /// Because this function may panic, its use is generally discouraged. . /// Instead, prefer to use pattern matching and handle the [`Err`] -- line 1029 ---------------------------------------- -- line 1051 ---------------------------------------- . /// . /// ```should_panic . /// let x: Result = Err("emergency failure"); . /// x.unwrap(); // panics with `emergency failure` . /// ``` . #[inline] . #[track_caller] . #[stable(feature = "rust1", since = "1.0.0")] 170 ( 0.00%) pub fn unwrap(self) -> T . where . E: fmt::Debug, . { 81,638 ( 0.00%) match self { 8,843 ( 0.00%) Ok(t) => t, . Err(e) => unwrap_failed("called `Result::unwrap()` on an `Err` value", &e), . } 255 ( 0.00%) } . . /// Returns the contained [`Ok`] value or a default . /// . /// Consumes the `self` argument then, if [`Ok`], returns the contained . /// value, otherwise if [`Err`], returns the default value for that . /// type. . /// . /// # Examples -- line 1075 ---------------------------------------- -- line 1092 ---------------------------------------- . /// [`parse`]: str::parse . /// [`FromStr`]: crate::str::FromStr . #[inline] . #[stable(feature = "result_unwrap_or_default", since = "1.16.0")] . pub fn unwrap_or_default(self) -> T . where . T: Default, . { 19,492 ( 0.00%) match self { 12,565 ( 0.00%) Ok(x) => x, . Err(_) => Default::default(), . } . } . . /// Returns the contained [`Err`] value, consuming the `self` value. . /// . /// # Panics . /// -- line 1109 ---------------------------------------- -- line 1152 ---------------------------------------- . /// ``` . #[inline] . #[track_caller] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn unwrap_err(self) -> E . where . T: fmt::Debug, . { 3,180 ( 0.00%) match self { . Ok(t) => unwrap_failed("called `Result::unwrap_err()` on an `Ok` value", &t), . Err(e) => e, . } . } . . /// Returns the contained [`Ok`] value, but never panics. . /// . /// Unlike [`unwrap`], this method is known to never panic on the -- line 1168 ---------------------------------------- -- line 1190 ---------------------------------------- . /// ``` . #[unstable(feature = "unwrap_infallible", reason = "newly added", issue = "61695")] . #[inline] . pub fn into_ok(self) -> T . where . E: Into, . { . match self { 2,822,051 ( 0.04%) Ok(x) => x, . Err(e) => e.into(), . } . } . . /// Returns the contained [`Err`] value, but never panics. . /// . /// Unlike [`unwrap_err`], this method is known to never panic on the . /// result types it is implemented for. Therefore, it can be used -- line 1206 ---------------------------------------- -- line 1290 ---------------------------------------- . /// assert_eq!(Ok(2).and_then(sq).and_then(sq), Ok(16)); . /// assert_eq!(Ok(2).and_then(sq).and_then(err), Err(4)); . /// assert_eq!(Ok(2).and_then(err).and_then(sq), Err(2)); . /// assert_eq!(Err(3).and_then(sq).and_then(sq), Err(3)); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn and_then Result>(self, op: F) -> Result { 3,210,999 ( 0.05%) match self { 9,537,564 ( 0.14%) Ok(t) => op(t), 18,703 ( 0.00%) Err(e) => Err(e), . } . } . . /// Returns `res` if the result is [`Err`], otherwise returns the [`Ok`] value of `self`. . /// . /// Arguments passed to `or` are eagerly evaluated; if you are passing the . /// result of a function call, it is recommended to use [`or_else`], which is . /// lazily evaluated. -- line 1308 ---------------------------------------- -- line 1355 ---------------------------------------- . /// assert_eq!(Ok(2).or_else(sq).or_else(sq), Ok(2)); . /// assert_eq!(Ok(2).or_else(err).or_else(sq), Ok(2)); . /// assert_eq!(Err(3).or_else(sq).or_else(err), Ok(9)); . /// assert_eq!(Err(3).or_else(err).or_else(err), Err(3)); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn or_else Result>(self, op: O) -> Result { 10,942 ( 0.00%) match self { 35,785 ( 0.00%) Ok(t) => Ok(t), . Err(e) => op(e), . } . } . . /// Returns the contained [`Ok`] value or a provided default. . /// . /// Arguments passed to `unwrap_or` are eagerly evaluated; if you are passing . /// the result of a function call, it is recommended to use [`unwrap_or_else`], -- line 1372 ---------------------------------------- -- line 1384 ---------------------------------------- . /// assert_eq!(x.unwrap_or(default), 9); . /// . /// let x: Result = Err("error"); . /// assert_eq!(x.unwrap_or(default), default); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn unwrap_or(self, default: T) -> T { 73 ( 0.00%) match self { 36 ( 0.00%) Ok(t) => t, . Err(_) => default, . } . } . . /// Returns the contained [`Ok`] value or computes it from a closure. . /// . /// . /// # Examples -- line 1401 ---------------------------------------- -- line 1406 ---------------------------------------- . /// fn count(x: &str) -> usize { x.len() } . /// . /// assert_eq!(Ok(2).unwrap_or_else(count), 2); . /// assert_eq!(Err("foo").unwrap_or_else(count), 3); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn unwrap_or_else T>(self, op: F) -> T { 397,132 ( 0.01%) match self { 193,216 ( 0.00%) Ok(t) => t, . Err(e) => op(e), . } 6 ( 0.00%) } . . /// Returns the contained [`Ok`] value, consuming the `self` value, . /// without checking that the value is not an [`Err`]. . /// . /// # Safety . /// . /// Calling this method on an [`Err`] is *[undefined behavior]*. . /// -- line 1426 ---------------------------------------- -- line 1647 ---------------------------------------- . /// let x: Result, SomeErr> = Ok(Some(5)); . /// let y: Option> = Some(Ok(5)); . /// assert_eq!(x.transpose(), y); . /// ``` . #[inline] . #[stable(feature = "transpose_result", since = "1.33.0")] . #[rustc_const_unstable(feature = "const_result", issue = "82814")] . pub const fn transpose(self) -> Option> { 3,398 ( 0.00%) match self { . Ok(Some(x)) => Some(Ok(x)), . Ok(None) => None, . Err(e) => Some(Err(e)), . } . } . } . . impl Result, E> { -- line 1663 ---------------------------------------- -- line 1751 ---------------------------------------- . . ///////////////////////////////////////////////////////////////////////////// . // Trait implementations . ///////////////////////////////////////////////////////////////////////////// . . #[stable(feature = "rust1", since = "1.0.0")] . impl Clone for Result { . #[inline] 158,955 ( 0.00%) fn clone(&self) -> Self { 921,142 ( 0.01%) match self { 608,999 ( 0.01%) Ok(x) => Ok(x.clone()), 212,888 ( 0.00%) Err(x) => Err(x.clone()), . } 333,538 ( 0.00%) } . . #[inline] . fn clone_from(&mut self, source: &Self) { . match (self, source) { . (Ok(to), Ok(from)) => to.clone_from(from), . (Err(to), Err(from)) => to.clone_from(from), . (to, from) => *to = from.clone(), . } -- line 1772 ---------------------------------------- -- line 2011 ---------------------------------------- . /// . /// Since the third element caused an underflow, no further elements were taken, . /// so the final value of `shared` is 6 (= `3 + 2 + 1`), not 16. . #[inline] . fn from_iter>>(iter: I) -> Result { . // FIXME(#11084): This could be replaced with Iterator::scan when this . // performance bug is closed. . 7,508 ( 0.00%) iter::process_results(iter.into_iter(), |i| i.collect()) . } . } . . #[unstable(feature = "try_trait_v2", issue = "84277")] . #[rustc_const_unstable(feature = "const_convert", issue = "88674")] . impl const ops::Try for Result { . type Output = T; . type Residual = Result; . . #[inline] . fn from_output(output: Self::Output) -> Self { 6,690 ( 0.00%) Ok(output) . } . . #[inline] . fn branch(self) -> ControlFlow { 8,538,015 ( 0.12%) match self { 7,759,577 ( 0.11%) Ok(v) => ControlFlow::Continue(v), 304,206 ( 0.00%) Err(e) => ControlFlow::Break(Err(e)), . } . } . } . . #[unstable(feature = "try_trait_v2", issue = "84277")] . #[rustc_const_unstable(feature = "const_convert", issue = "88674")] . impl> const ops::FromResidual> . for Result . { . #[inline] . #[track_caller] . fn from_residual(residual: Result) -> Self { . match residual { 247,920 ( 0.00%) Err(e) => Err(From::from(e)), . } . } . } . . #[unstable(feature = "try_trait_v2_residual", issue = "91285")] . impl ops::Residual for Result { . type TryType = Result; . } -- line 2060 ---------------------------------------- 3,692,789 ( 0.05%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/mod.rs -------------------------------------------------------------------------------- Ir -- line 157 ---------------------------------------- . pub fn opt_fn_def_id(self) -> Option { . if let Res::Def(DefKind::Fn, def_id) = self.res { Some(def_id) } else { None } . } . } . . /// The "header" of an impl is everything outside the body: a Self type, a trait . /// ref (in the case of a trait impl), and a set of predicates (from the . /// bounds / where-clauses). 26,411 ( 0.00%) #[derive(Clone, Debug, TypeFoldable)] . pub struct ImplHeader<'tcx> { . pub impl_def_id: DefId, . pub self_ty: Ty<'tcx>, . pub trait_ref: Option>, . pub predicates: Vec>, . } . . #[derive( . Copy, . Clone, 312,027 ( 0.00%) PartialEq, . Eq, . Hash, . TyEncodable, 22,236 ( 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"), . } . } . } . 480,846 ( 0.01%) #[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, . } . 379,727 ( 0.01%) #[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. 119,150 ( 0.00%) pub fn and(&mut self, constness: hir::Constness) -> hir::Constness { 178,725 ( 0.00%) match (constness, self) { . (hir::Constness::Const, BoundConstness::ConstIfConst) => hir::Constness::Const, . (_, this) => { 158,832 ( 0.00%) *this = BoundConstness::NotConst; . hir::Constness::NotConst . } . } 59,575 ( 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 274 ---------------------------------------- . pub before_feature_tys: Ty<'tcx>, . /// 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; . 280 ( 0.00%) fn is_descendant_of(self, mut descendant: DefId, ancestor: DefId) -> bool { 357 ( 0.00%) if descendant.krate != ancestor.krate { . return false; . } . 79,791 ( 0.00%) while descendant != ancestor { 117,286 ( 0.00%) match self.parent(descendant) { . Some(parent) => descendant = parent, . None => return false, . } . } . true 320 ( 0.00%) } . } . . impl<'tcx> DefIdTree for TyCtxt<'tcx> { 57,302 ( 0.00%) fn parent(self, id: DefId) -> Option { . self.def_key(id).parent.map(|index| DefId { index, ..id }) 85,953 ( 0.00%) } . } . . impl Visibility { 992 ( 0.00%) pub fn from_hir(visibility: &hir::Visibility<'_>, id: hir::HirId, tcx: TyCtxt<'_>) -> Self { 2,976 ( 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 => { 1,760 ( 0.00%) Visibility::Restricted(tcx.parent_module(id).to_def_id()) . } . } 992 ( 0.00%) } . . /// Returns `true` if an item with this visibility is accessible from the given block. 235,008 ( 0.00%) pub fn is_accessible_from(self, module: DefId, tree: T) -> bool { 1,105,266 ( 0.02%) 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. 27,249 ( 0.00%) Visibility::Restricted(other) if other.krate != module.krate => return false, . Visibility::Restricted(module) => module, . }; . 80 ( 0.00%) tree.is_descendant_of(module, restriction) 235,008 ( 0.00%) } . . /// Returns `true` if this visibility is at least as accessible as the given visibility 50,868 ( 0.00%) pub fn is_at_least(self, vis: Visibility, tree: T) -> bool { 85,990 ( 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) 50,868 ( 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 { 10,712 ( 0.00%) matches!(self, Visibility::Public) 5,356 ( 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 434 ---------------------------------------- . } . . // `TyS` is used a lot. Make sure it doesn't unintentionally get bigger. . #[cfg(all(target_arch = "x86_64", target_pointer_width = "64"))] . static_assert_size!(TyS<'_>, 40); . . impl<'tcx> Ord for TyS<'tcx> { . fn cmp(&self, other: &TyS<'tcx>) -> Ordering { 4 ( 0.00%) self.kind().cmp(other.kind()) . } . } . . impl<'tcx> PartialOrd for TyS<'tcx> { . fn partial_cmp(&self, other: &TyS<'tcx>) -> Option { . Some(self.kind().cmp(other.kind())) . } . } -- line 450 ---------------------------------------- -- 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. 345,702 ( 0.01%) ptr::eq(self.inner, other.inner) 335,659 ( 0.00%) } . } . . impl Hash for Predicate<'_> { . fn hash(&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>> { 2,796,181 ( 0.04%) 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> { . let kind = self . .inner -- line 541 ---------------------------------------- -- line 567 ---------------------------------------- . flags: _, . outer_exclusive_binder: _, . } = self.inner; . . kind.hash_stable(hcx, hasher); . } . } . 11,287,362 ( 0.16%) #[derive(Clone, Copy, PartialEq, Eq, Hash, TyEncodable, TyDecodable)] 8,491,650 ( 0.12%) #[derive(HashStable, TypeFoldable)] . pub enum PredicateKind<'tcx> { . /// Corresponds to `where Foo: Bar`. `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 594 ---------------------------------------- . WellFormed(GenericArg<'tcx>), . . /// Trait must be object-safe. . ObjectSafe(DefId), . . /// No direct syntax. May be thought of as `where T: FnFoo<...>` . /// for some substitutions `...` and `T` being a closure type. . /// Satisfied (or refuted) once we know the closure's kind. 2,712 ( 0.00%) 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. 4,409 ( 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. 19,629 ( 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> 2,181 ( 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)); 19,629 ( 0.00%) tcx.reuse_or_mk_predicate(self, ty::Binder::bind_with_vars(new, bound_vars)) 15,267 ( 0.00%) } . } . 9,202 ( 0.00%) #[derive(Clone, Copy, PartialEq, Eq, Hash, TyEncodable, TyDecodable)] 564,685 ( 0.01%) #[derive(HashStable, TypeFoldable)] . pub struct TraitPredicate<'tcx> { . pub trait_ref: TraitRef<'tcx>, . 1,012,983 ( 0.01%) pub constness: BoundConstness, . 1,071,018 ( 0.02%) pub polarity: ImplPolarity, . } . . pub type PolyTraitPredicate<'tcx> = ty::Binder<'tcx, TraitPredicate<'tcx>>; . . impl<'tcx> TraitPredicate<'tcx> { 796,472 ( 0.01%) pub fn remap_constness(&mut self, tcx: TyCtxt<'tcx>, param_env: &mut ParamEnv<'tcx>) { 697,475 ( 0.01%) 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` 562 ( 0.00%) param_env.remap_constness_with(self.constness) . } else { 99,278 ( 0.00%) *param_env = param_env.with_constness(self.constness.and(param_env.constness())) . } 597,354 ( 0.01%) } . . /// 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 { 228,506 ( 0.00%) self.trait_ref.def_id 114,253 ( 0.00%) } . 147,379 ( 0.00%) pub fn self_ty(self) -> Ty<'tcx> { 442,137 ( 0.01%) self.trait_ref.self_ty() 294,758 ( 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() 99,364 ( 0.00%) } . 434 ( 0.00%) pub fn self_ty(self) -> ty::Binder<'tcx, Ty<'tcx>> { 1,736 ( 0.00%) self.map_bound(|trait_ref| trait_ref.self_ty()) 868 ( 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 . }); . } . } . 129 ( 0.00%) #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)] 167,645 ( 0.00%) #[derive(HashStable, TypeFoldable)] 196,699 ( 0.00%) pub struct OutlivesPredicate(pub A, pub B); // `A: B` . pub type RegionOutlivesPredicate<'tcx> = OutlivesPredicate, ty::Region<'tcx>>; . pub type TypeOutlivesPredicate<'tcx> = OutlivesPredicate, 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)] 10,398 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub struct SubtypePredicate<'tcx> { 18,605 ( 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)] 199 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub struct CoercePredicate<'tcx> { . pub a: Ty<'tcx>, . pub b: Ty<'tcx>, . } . pub type PolyCoercePredicate<'tcx> = ty::Binder<'tcx, CoercePredicate<'tcx>>; . 66,427 ( 0.00%) #[derive(Debug, Copy, Clone, PartialEq, Eq, Hash, PartialOrd, Ord, TyEncodable, TyDecodable)] 74,831 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub enum Term<'tcx> { 1,722 ( 0.00%) Ty(Ty<'tcx>), . Const(&'tcx Const<'tcx>), . } . . impl<'tcx> From> for Term<'tcx> { . fn from(ty: Ty<'tcx>) -> Self { . Term::Ty(ty) 8,628 ( 0.00%) } . } . . impl<'tcx> From<&'tcx Const<'tcx>> for Term<'tcx> { . fn from(c: &'tcx Const<'tcx>) -> Self { . Term::Const(c) . } . } . . impl<'tcx> Term<'tcx> { . pub fn ty(&self) -> Option> { 10,634 ( 0.00%) if let Term::Ty(ty) = self { Some(ty) } else { None } 5,317 ( 0.00%) } . } . . /// This kind of predicate has no *direct* correspondent in the . /// syntax, but it roughly corresponds to the syntactic forms: . /// . /// 1. `T: TraitRef<..., Item = Type>` . /// 2. `>::Item == Type` (NYI) . /// . /// In particular, form #1 is "desugared" to the combination of a . /// normal trait predicate (`T: TraitRef<...>`) and one of these . /// predicates. Form #2 is a broader form in that it also permits . /// equality between arbitrary types. Processing an instance of . /// Form #2 eventually yields one of these `ProjectionPredicate` . /// instances to normalize the LHS. 140 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, Hash, TyEncodable, TyDecodable)] 16,918 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub struct ProjectionPredicate<'tcx> { . pub projection_ty: ProjectionTy<'tcx>, 27,361 ( 0.00%) pub term: Term<'tcx>, . } . . pub type PolyProjectionPredicate<'tcx> = Binder<'tcx, ProjectionPredicate<'tcx>>; . . impl<'tcx> PolyProjectionPredicate<'tcx> { . /// Returns the `DefId` of the trait of the associated item being projected. . #[inline] . pub fn trait_def_id(&self, tcx: TyCtxt<'tcx>) -> DefId { 436 ( 0.00%) self.skip_binder().projection_ty.trait_def_id(tcx) . } . . /// Get the [PolyTraitRef] required for this projection to be well formed. . /// Note that for generic associated types the predicates of the associated . /// type also need to be checked. . #[inline] . pub fn required_poly_trait_ref(&self, tcx: TyCtxt<'tcx>) -> PolyTraitRef<'tcx> { . // Note: unlike with `TraitRef::to_poly_trait_ref()`, . // `self.0.trait_ref` is permitted to have escaping regions. . // This is because here `self` has a `Binder` and so does our . // return value, so we are preserving the number of binding . // levels. 310 ( 0.00%) self.map_bound(|predicate| predicate.projection_ty.trait_ref(tcx)) . } . . pub fn term(&self) -> Binder<'tcx, Term<'tcx>> { . self.map_bound(|predicate| predicate.term) . } . . /// The `DefId` of the `TraitItem` for the associated type. . /// . /// Note that this is not the `DefId` of the `TraitRef` containing this . /// associated type, which is in `tcx.associated_item(projection_def_id()).container`. . pub fn projection_def_id(&self) -> DefId { . // Ok to skip binder since trait `DefId` does not care about regions. 524 ( 0.00%) self.skip_binder().projection_ty.item_def_id 262 ( 0.00%) } . } . . pub trait ToPolyTraitRef<'tcx> { . fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx>; . } . . impl<'tcx> ToPolyTraitRef<'tcx> for PolyTraitPredicate<'tcx> { 7,502 ( 0.00%) fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx> { 7,502 ( 0.00%) self.map_bound_ref(|trait_pred| trait_pred.trait_ref) 7,502 ( 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> { 55,631 ( 0.00%) fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> { 278,155 ( 0.00%) self.map_bound(PredicateKind::Trait).to_predicate(tcx) 111,262 ( 0.00%) } . } . . impl<'tcx> ToPredicate<'tcx> for PolyRegionOutlivesPredicate<'tcx> { 17 ( 0.00%) fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> { 34 ( 0.00%) self.map_bound(PredicateKind::RegionOutlives).to_predicate(tcx) 34 ( 0.00%) } . } . . impl<'tcx> ToPredicate<'tcx> for PolyTypeOutlivesPredicate<'tcx> { 359 ( 0.00%) fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> { 718 ( 0.00%) self.map_bound(PredicateKind::TypeOutlives).to_predicate(tcx) 718 ( 0.00%) } . } . . impl<'tcx> ToPredicate<'tcx> for PolyProjectionPredicate<'tcx> { 1,990 ( 0.00%) fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> { 9,950 ( 0.00%) self.map_bound(PredicateKind::Projection).to_predicate(tcx) 3,980 ( 0.00%) } . } . . impl<'tcx> Predicate<'tcx> { 38,470 ( 0.00%) pub fn to_opt_poly_trait_pred(self) -> Option> { . let predicate = self.kind(); 115,410 ( 0.00%) match predicate.skip_binder() { 87,715 ( 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,692 ( 0.00%) | PredicateKind::TypeWellFormedFromEnv(..) => None, . } 38,470 ( 0.00%) } . 4,044 ( 0.00%) pub fn to_opt_type_outlives(self) -> Option> { . let predicate = self.kind(); 8,088 ( 0.00%) match predicate.skip_binder() { 1,413 ( 0.00%) PredicateKind::TypeOutlives(data) => Some(predicate.rebind(data)), . PredicateKind::Trait(..) . | PredicateKind::Projection(..) . | PredicateKind::Subtype(..) . | PredicateKind::Coerce(..) . | PredicateKind::RegionOutlives(..) . | PredicateKind::WellFormed(..) . | PredicateKind::ObjectSafe(..) . | PredicateKind::ClosureKind(..) . | PredicateKind::ConstEvaluatable(..) . | PredicateKind::ConstEquate(..) 3,573 ( 0.00%) | PredicateKind::TypeWellFormedFromEnv(..) => None, . } 4,044 ( 0.00%) } . } . . /// Represents the bounds declared on a particular set of type . /// parameters. Should eventually be generalized into a flag list of . /// where-clauses. You can obtain an `InstantiatedPredicates` list from a . /// `GenericPredicates` by using the `instantiate` method. Note that this method . /// reflects an important semantic invariant of `InstantiatedPredicates`: while . /// the `GenericPredicates` are expressed in terms of the bound type -- line 1005 ---------------------------------------- -- line 1011 ---------------------------------------- . /// Example: . /// . /// struct Foo> { ... } . /// . /// Here, the `GenericPredicates` for `Foo` would contain a list of bounds like . /// `[[], [U:Bar]]`. Now if there were some particular reference . /// like `Foo`, then the `InstantiatedPredicates` would be `[[], . /// [usize:Bar]]`. 291,757 ( 0.00%) #[derive(Clone, Debug, TypeFoldable)] . pub struct InstantiatedPredicates<'tcx> { . pub predicates: Vec>, . pub spans: Vec, . } . . impl<'tcx> InstantiatedPredicates<'tcx> { 1,357 ( 0.00%) pub fn empty() -> InstantiatedPredicates<'tcx> { 168,618 ( 0.00%) InstantiatedPredicates { predicates: vec![], spans: vec![] } 1,357 ( 0.00%) } . . pub fn is_empty(&self) -> bool { . self.predicates.is_empty() 45 ( 0.00%) } . } . 35 ( 0.00%) #[derive(Copy, Clone, Debug, PartialEq, Eq, HashStable, TyEncodable, TyDecodable, TypeFoldable)] . pub struct OpaqueTypeKey<'tcx> { . pub def_id: DefId, . pub substs: SubstsRef<'tcx>, . } . . rustc_index::newtype_index! { . /// "Universes" are used during type- and trait-checking in the . /// presence of `for<..>` binders to control what sets of names are -- line 1043 ---------------------------------------- -- 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. 61,213 ( 0.00%) pub fn next_universe(self) -> UniverseIndex { . UniverseIndex::from_u32(self.private.checked_add(1).unwrap()) 183,639 ( 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 { 278,300 ( 0.00%) self.private >= other.private 139,150 ( 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 { 2,682 ( 0.00%) self.private < other.private 1,341 ( 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 { 39,774 ( 0.00%) pub universe: UniverseIndex, 18,817 ( 0.00%) pub name: T, . } . . impl<'a, T> HashStable> for Placeholder . where . T: HashStable>, . { . 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`. 4,692 ( 0.00%) #[derive(Copy, Clone, Debug, TypeFoldable, Lift, TyEncodable, TyDecodable)] . #[derive(PartialEq, Eq, PartialOrd, Ord)] . #[derive(Hash, HashStable)] . pub struct WithOptConstParam { 13,304 ( 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`. 21,170 ( 0.00%) pub const_param_did: Option, . } . . impl WithOptConstParam { . /// Creates a new `WithOptConstParam` setting `const_param_did` to `None`. . #[inline(always)] . pub fn unknown(did: T) -> WithOptConstParam { . WithOptConstParam { did, const_param_did: None } 38,515 ( 0.00%) } . } . . impl WithOptConstParam { . /// 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> { 3,995 ( 0.00%) if self.const_param_did.is_none() { 6,497 ( 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 { . WithOptConstParam { did: self.did.to_def_id(), const_param_did: self.const_param_did } 46 ( 0.00%) } . 844 ( 0.00%) pub fn def_id_for_type_of(self) -> DefId { 1,938 ( 0.00%) if let Some(did) = self.const_param_did { did } else { self.did.to_def_id() } 211 ( 0.00%) } . } . . impl WithOptConstParam { 2,770 ( 0.00%) pub fn as_local(self) -> Option> { . self.did . .as_local() . .map(|did| WithOptConstParam { did, const_param_did: self.const_param_did }) 2,770 ( 0.00%) } . . pub fn as_const_arg(self) -> Option<(LocalDefId, DefId)> { 10,748 ( 0.00%) if let Some(param_did) = self.const_param_did { 4,555 ( 0.00%) if let Some(did) = self.did.as_local() { . return Some((did, param_did)); . } . } . . None 4,770 ( 0.00%) } . . pub fn is_local(self) -> bool { . self.did.is_local() . } . 1,315 ( 0.00%) pub fn def_id_for_type_of(self) -> DefId { . self.const_param_did.unwrap_or(self.did) 1,315 ( 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 { 252,511 ( 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 { 1,823,560 ( 0.03%) 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>, . reveal: Reveal, . constness: hir::Constness, . ) -> Self { . ty::ParamEnv { packed: CopyTaggedPtr::new(caller_bounds, ParamTag { reveal, constness }) } . } . 112 ( 0.00%) pub fn with_user_facing(mut self) -> Self { . self.packed.set_tag(ParamTag { reveal: Reveal::UserFacing, ..self.packed.tag() }); . self 112 ( 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) { 49,849 ( 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 15,944 ( 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(), . ) 17,937 ( 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: Copy`, which are clearly never . /// satisfiable. We generally want to behave as if they were true, . /// although the surrounding function is never reachable. 185,201 ( 0.00%) pub fn and>(self, value: T) -> ParamEnvAnd<'tcx, T> { . match self.reveal() { . Reveal::UserFacing => ParamEnvAnd { param_env: self, value }, . . Reveal::All => { 2,849 ( 0.00%) if value.is_global() { . ParamEnvAnd { param_env: self.without_caller_bounds(), value } . } else { . ParamEnvAnd { param_env: self, value } . } . } . } 174,979 ( 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> { 2,256 ( 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) . } . } . 8,368 ( 0.00%) #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, TypeFoldable)] . pub struct ParamEnvAnd<'tcx, T> { 85,850 ( 0.00%) pub param_env: ParamEnv<'tcx>, 1,534,937 ( 0.02%) 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(); 14,465 ( 0.00%) self . } . } . . impl<'a, 'tcx, T> HashStable> for ParamEnvAnd<'tcx, T> . where . T: HashStable>, . { . 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, . } . 7,469 ( 0.00%) bitflags! { 6,867 ( 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. 181,389 ( 0.00%) #[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, . /// 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. 3,896 ( 0.00%) pub fn new( . name: Symbol, . variant_did: Option, . ctor_def_id: Option, . discr: VariantDiscr, . fields: Vec, . 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; 487 ( 0.00%) if is_field_list_non_exhaustive { . flags |= VariantFlags::IS_FIELD_LIST_NON_EXHAUSTIVE; . } . 1,461 ( 0.00%) if recovered { . flags |= VariantFlags::IS_RECOVERED; . } . 4,383 ( 0.00%) VariantDef { . def_id: variant_did.unwrap_or(parent_did), . ctor_def_id, . name, . discr, 1,948 ( 0.00%) fields, . ctor_kind, . flags, . } 1,948 ( 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` 27,874 ( 0.00%) pub fn ident(&self, tcx: TyCtxt<'_>) -> Ident { 15,928 ( 0.00%) Ident::new(self.name, tcx.def_ident_span(self.def_id).unwrap()) 35,838 ( 0.00%) } . } . 116,305 ( 0.00%) #[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), . } . 258,206 ( 0.00%) #[derive(Debug, HashStable, TyEncodable, TyDecodable)] . pub struct FieldDef { . pub did: DefId, . pub name: Symbol, . pub vis: Visibility, . } . 1,234 ( 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, 173,840 ( 0.00%) #[derive(Copy, Clone, Debug, Eq, PartialEq, TyEncodable, TyDecodable, Default, HashStable)] . pub struct ReprOptions { . pub int: Option, . pub align: Option, . pub pack: Option, . 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 { 1,287 ( 0.00%) pub fn new(tcx: TyCtxt<'_>, did: DefId) -> ReprOptions { . let mut flags = ReprFlags::empty(); . let mut size = None; . let mut max_align: Option = None; . let mut min_pack: Option = 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 297 ( 0.00%) if let Some(user_seed) = tcx.sess.opts.debugging_opts.layout_seed { . field_shuffle_seed ^= user_seed; . } . 396 ( 0.00%) for attr in tcx.get_attrs(did).iter() { 1,175 ( 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 . }); . ReprFlags::empty() . } . attr::ReprTransparent => ReprFlags::IS_TRANSPARENT, . attr::ReprNoNiche => ReprFlags::HIDE_NICHE, . attr::ReprSimd => ReprFlags::IS_SIMD, . attr::ReprInt(i) => { 7 ( 0.00%) size = Some(i); . ReprFlags::empty() . } . attr::ReprAlign(align) => { . max_align = max_align.max(Some(Align::from_bytes(align as u64).unwrap())); . ReprFlags::empty() . } . }); . } . } . . // If `-Z randomize-layout` was enabled for the type definition then we can . // consider performing layout randomization 792 ( 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. 594 ( 0.00%) if !tcx.consider_optimizing(|| format!("Reorder fields of {:?}", tcx.def_path_str(did))) { . flags.insert(ReprFlags::IS_LINEAR); . } . 198 ( 0.00%) Self { int: size, align: max_align, pack: min_pack, flags, field_shuffle_seed } 2,772 ( 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 { 5,275 ( 0.00%) self.int.unwrap_or(attr::SignedInt(ast::IntTy::Isize)) 3,196 ( 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 { 175 ( 0.00%) self.c() || self.int.is_some() . } . . /// Returns `true` if this `#[repr()]` should inhibit struct field reordering . /// optimizations, such as with `repr(C)`, `repr(packed(1))`, or `repr()`. . pub fn inhibit_struct_field_reordering_opt(&self) -> bool { 610 ( 0.00%) if let Some(pack) = self.pack { . if pack.bytes() == 1 { . return true; . } . } . 1,292 ( 0.00%) self.flags.intersects(ReprFlags::IS_UNOPTIMISABLE) || self.int.is_some() . } . . /// Returns `true` if this type is valid for reordering and `-Z randomize-layout` . /// was enabled for its declaration crate . pub fn can_randomize_type_layout(&self) -> bool { 287 ( 0.00%) !self.inhibit_struct_field_reordering_opt() . && self.flags.contains(ReprFlags::RANDOMIZE_LAYOUT) . } . . /// Returns `true` if this `#[repr()]` should inhibit union ABI optimisations. . 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`]. 159,453 ( 0.00%) pub fn ty(&self, tcx: TyCtxt<'tcx>, subst: SubstsRef<'tcx>) -> Ty<'tcx> { 45,558 ( 0.00%) tcx.type_of(self.did).subst(tcx, subst) 182,232 ( 0.00%) } . . /// Computes the `Ident` of this variant by looking up the `Span` 67,837 ( 0.00%) pub fn ident(&self, tcx: TyCtxt<'_>) -> Ident { 38,764 ( 0.00%) Ident::new(self.name, tcx.def_ident_span(self.did).unwrap()) 87,219 ( 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> { 56,824 ( 0.00%) pub fn typeck_body(self, body: hir::BodyId) -> &'tcx TypeckResults<'tcx> { 14,206 ( 0.00%) self.typeck(self.hir().body_owner_def_id(body)) 56,824 ( 0.00%) } . . pub fn provided_trait_methods(self, id: DefId) -> impl 'tcx + Iterator { . 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 { . self.hir().get_if_local(def_id).and_then(|node| node.ident()) . } . 3,393 ( 0.00%) fn item_name_from_def_id(self, def_id: DefId) -> Option { 377 ( 0.00%) if def_id.index == CRATE_DEF_INDEX { . Some(self.crate_name(def_id.krate)) . } else { 1,131 ( 0.00%) let def_key = self.def_key(def_id); 1,784 ( 0.00%) match def_key.disambiguated_data.data { . // The name of a constructor is that of its parent. 505 ( 0.00%) rustc_hir::definitions::DefPathData::Ctor => self.item_name_from_def_id(DefId { . krate: def_id.krate, . index: def_key.parent.unwrap(), . }), 552 ( 0.00%) _ => def_key.disambiguated_data.data.get_opt_name(), . } . } 3,016 ( 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 1,932 ( 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. 276 ( 0.00%) self.item_name_from_def_id(id).unwrap_or_else(|| { . bug!("item_name: no name for {:?}", self.def_path(id)); . }) 1,380 ( 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 { . // 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)) . } . 1,401,230 ( 0.02%) pub fn opt_associated_item(self, def_id: DefId) -> Option<&'tcx AssocItem> { 560,492 ( 0.01%) if let DefKind::AssocConst | DefKind::AssocFn | DefKind::AssocTy = self.def_kind(def_id) { . Some(self.associated_item(def_id)) . } else { . None . } 1,261,107 ( 0.02%) } . 9,441 ( 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") 18,882 ( 0.00%) } . 36 ( 0.00%) pub fn find_field_index(self, ident: Ident, variant: &VariantDef) -> Option { . variant . .fields . .iter() 88 ( 0.00%) .position(|field| self.hygienic_eq(ident, field.ident(self), variant.def_id)) 36 ( 0.00%) } . . /// Returns `true` if the impls are the same polarity and the trait either . /// has no items or is annotated `#[marker]` and prevents item overrides. 26,040 ( 0.00%) pub fn impls_are_allowed_to_overlap( . self, . def_id1: DefId, . def_id2: DefId, . ) -> Option { . // If either trait impl references an error, they're allowed to overlap, . // as one of them essentially doesn't exist. . if self.impl_trait_ref(def_id1).map_or(false, |tr| tr.references_error()) 5,208 ( 0.00%) || self.impl_trait_ref(def_id2).map_or(false, |tr| tr.references_error()) . { . return Some(ImplOverlapKind::Permitted { marker: false }); . } . 26,040 ( 0.00%) match (self.impl_polarity(def_id1), self.impl_polarity(def_id2)) { . (ImplPolarity::Reservation, _) | (_, ImplPolarity::Reservation) => { . // `#[rustc_reservation_impl]` impls don't overlap with anything . debug!( . "impls_are_allowed_to_overlap({:?}, {:?}) = Some(Permitted) (reservations)", . def_id1, def_id2 . ); . return Some(ImplOverlapKind::Permitted { marker: false }); . } -- line 1997 ---------------------------------------- -- line 2004 ---------------------------------------- . ); . return None; . } . (ImplPolarity::Positive, ImplPolarity::Positive) . | (ImplPolarity::Negative, ImplPolarity::Negative) => {} . }; . . let is_marker_overlap = { 26,040 ( 0.00%) let is_marker_impl = |def_id: DefId| -> bool { 7,812 ( 0.00%) let trait_ref = self.impl_trait_ref(def_id); 7,812 ( 0.00%) trait_ref.map_or(false, |tr| self.trait_def(tr.def_id).is_marker) 20,832 ( 0.00%) }; 10,416 ( 0.00%) is_marker_impl(def_id1) && is_marker_impl(def_id2) . }; . . if is_marker_overlap { . debug!( . "impls_are_allowed_to_overlap({:?}, {:?}) = Some(Permitted) (marker overlap)", . def_id1, def_id2 . ); . Some(ImplOverlapKind::Permitted { marker: true }) . } else { 10,416 ( 0.00%) if let Some(self_ty1) = self.issue33140_self_ty(def_id1) { . if let Some(self_ty2) = self.issue33140_self_ty(def_id2) { . if self_ty1 == self_ty2 { . debug!( . "impls_are_allowed_to_overlap({:?}, {:?}) - issue #33140 HACK", . def_id1, def_id2 . ); . return Some(ImplOverlapKind::Issue33140); . } else { -- line 2034 ---------------------------------------- -- line 2038 ---------------------------------------- . ); . } . } . } . . debug!("impls_are_allowed_to_overlap({:?}, {:?}) = None", def_id1, def_id2); . None . } 20,832 ( 0.00%) } . . /// Returns `ty::VariantDef` if `res` refers to a struct, . /// or variant or their constructors, panics otherwise. 4,375 ( 0.00%) pub fn expect_variant_res(self, res: Res) -> &'tcx VariantDef { 7,500 ( 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), . } 5,000 ( 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. 423,930 ( 0.01%) pub fn get_attrs(self, did: DefId) -> Attributes<'tcx> { 127,179 ( 0.00%) if let Some(did) = did.as_local() { 104,361 ( 0.00%) self.hir().attrs(self.hir().local_def_id_to_hir_id(did)) . } else { . self.item_attrs(did) . } 339,144 ( 0.00%) } . . /// Determines whether an item is annotated with an attribute. 55,940 ( 0.00%) pub fn has_attr(self, did: DefId, attr: Symbol) -> bool { 158,670 ( 0.00%) self.sess.contains_name(&self.get_attrs(did), attr) . } . . /// Determines whether an item is annotated with `doc(hidden)`. 4,067 ( 0.00%) pub fn is_doc_hidden(self, did: DefId) -> bool { 581 ( 0.00%) self.get_attrs(did) . .iter() 347 ( 0.00%) .filter_map(|attr| if attr.has_name(sym::doc) { attr.meta_item_list() } else { None }) 27 ( 0.00%) .any(|items| items.iter().any(|item| item.has_name(sym::hidden))) 4,648 ( 0.00%) } . . /// Returns `true` if this is an `auto trait`. 37,639 ( 0.00%) pub fn trait_is_auto(self, trait_def_id: DefId) -> bool { 5,377 ( 0.00%) self.trait_def(trait_def_id).has_auto_impl 43,016 ( 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`. 34,076 ( 0.00%) pub fn trait_id_of_impl(self, def_id: DefId) -> Option { . self.impl_trait_ref(def_id).map(|tr| tr.def_id) 43,812 ( 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`. 938 ( 0.00%) pub fn impl_of_method(self, def_id: DefId) -> Option { 3,752 ( 0.00%) self.opt_associated_item(def_id).and_then(|trait_item| match trait_item.container { . TraitContainer(_) => None, . ImplContainer(def_id) => Some(def_id), . }) 1,876 ( 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 { . 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. 74,528 ( 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. 9,316 ( 0.00%) use_name.name == def_name.name 27,195 ( 0.00%) && use_name . .span . .ctxt() . .hygienic_eq(def_name.span.ctxt(), self.expn_that_defined(def_parent_def_id)) 74,528 ( 0.00%) } . 16,677 ( 0.00%) pub fn adjust_ident(self, mut ident: Ident, scope: DefId) -> Ident { 3,706 ( 0.00%) ident.span.normalize_to_macros_2_0_and_adjust(self.expn_that_defined(scope)); 3,706 ( 0.00%) ident 14,824 ( 0.00%) } . 78,633 ( 0.00%) pub fn adjust_ident_and_get_scope( . self, . mut ident: Ident, . scope: DefId, . block: hir::HirId, . ) -> (Ident, DefId) { 8,737 ( 0.00%) let scope = ident . .span . .normalize_to_macros_2_0_and_adjust(self.expn_that_defined(scope)) 28 ( 0.00%) .and_then(|actual_expansion| actual_expansion.expn_data().parent_module) 34,892 ( 0.00%) .unwrap_or_else(|| self.parent_module(block).to_def_id()); 52,422 ( 0.00%) (ident, scope) 78,633 ( 0.00%) } . 3,437 ( 0.00%) pub fn is_object_safe(self, key: DefId) -> bool { . self.object_safety_violations(key).is_empty() 3,928 ( 0.00%) } . } . . /// Yields the parent function's `LocalDefId` if `def_id` is an `impl Trait` definition. 11,571 ( 0.00%) pub fn is_impl_trait_defn(tcx: TyCtxt<'_>, def_id: DefId) -> Option { 11,571 ( 0.00%) let def_id = def_id.as_local()?; 10,860 ( 0.00%) if let Node::Item(item) = tcx.hir().get_by_def_id(def_id) { 2,992 ( 0.00%) if let hir::ItemKind::OpaqueTy(ref opaque_ty) = item.kind { 58 ( 0.00%) return match opaque_ty.origin { . hir::OpaqueTyOrigin::FnReturn(parent) | hir::OpaqueTyOrigin::AsyncFn(parent) => { . Some(parent) . } . hir::OpaqueTyOrigin::TyAlias => None, . }; . } . } . None 15,428 ( 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 2224 ---------------------------------------- . ast::UintTy::U8 => UintTy::U8, . ast::UintTy::U16 => UintTy::U16, . ast::UintTy::U32 => UintTy::U32, . ast::UintTy::U64 => UintTy::U64, . ast::UintTy::U128 => UintTy::U128, . } . } . 27 ( 0.00%) pub fn float_ty(fty: ast::FloatTy) -> FloatTy { . match fty { . ast::FloatTy::F32 => FloatTy::F32, . ast::FloatTy::F64 => FloatTy::F64, . } 27 ( 0.00%) } . 2,419 ( 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, . } 2,419 ( 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 ---------------------------------------- 9,461,486 ( 0.14%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/obligation_forest/mod.rs -------------------------------------------------------------------------------- Ir -- line 121 ---------------------------------------- . #[derive(Debug)] . pub enum ProcessResult { . Unchanged, . Changed(Vec), . Error(E), . } . . #[derive(Clone, Copy, PartialEq, Eq, Hash, Debug)] 146,621 ( 0.00%) struct ObligationTreeId(usize); . . type ObligationTreeIdGenerator = . std::iter::Map, fn(usize) -> ObligationTreeId>; . . pub struct ObligationForest { . /// The list of obligations. In between calls to `process_obligations`, . /// this list only contains nodes in the `Pending` or `Waiting` state. . /// -- line 137 ---------------------------------------- -- line 181 ---------------------------------------- . has_parent: bool, . . /// Identifier of the obligation tree to which this node belongs. . obligation_tree_id: ObligationTreeId, . } . . impl Node { . fn new(parent: Option, obligation: O, obligation_tree_id: ObligationTreeId) -> Node { 1,789,168 ( 0.03%) Node { . obligation, . state: Cell::new(NodeState::Pending), 227,437 ( 0.00%) dependents: if let Some(parent_index) = parent { vec![parent_index] } else { vec![] }, . has_parent: parent.is_some(), . obligation_tree_id, . } . } . } . . /// The state of one node in some tree within the forest. This represents the . /// current state of processing for the obligation (of type `O`) associated -- line 200 ---------------------------------------- -- line 223 ---------------------------------------- . /// | compress() . /// v . /// (Removed) . /// ``` . /// The `Error` state can be introduced in several places, via `error_at()`. . /// . /// Outside of `ObligationForest` methods, nodes should be either `Pending` or . /// `Waiting`. 1,736,187 ( 0.03%) #[derive(Debug, Copy, Clone, PartialEq, Eq)] . enum NodeState { . /// This obligation has not yet been selected successfully. Cannot have . /// subobligations. . Pending, . . /// This obligation was selected successfully, but may or may not have . /// subobligations. . Success, -- line 239 ---------------------------------------- -- line 279 ---------------------------------------- . pub stalled: bool, . } . . impl OutcomeTrait for Outcome { . type Error = Error; . type Obligation = O; . . fn new() -> Self { 235,604 ( 0.00%) Self { stalled: true, errors: vec![] } . } . . fn mark_not_stalled(&mut self) { 110,822 ( 0.00%) self.stalled = false; . } . . fn is_stalled(&self) -> bool { 55,461 ( 0.00%) self.stalled . } . . fn record_completed(&mut self, _outcome: &Self::Obligation) { . // do nothing . } . . fn record_error(&mut self, error: Self::Error) { 1,168 ( 0.00%) self.errors.push(error) . } . } . . #[derive(Debug, PartialEq, Eq)] . pub struct Error { . pub error: E, . pub backtrace: Vec, . } . . impl ObligationForest { 32,067 ( 0.00%) pub fn new() -> ObligationForest { 384,804 ( 0.01%) ObligationForest { . nodes: vec![], . done_cache: Default::default(), . active_cache: Default::default(), . reused_node_vec: vec![], . obligation_tree_id_generator: (0..).map(ObligationTreeId), . error_cache: Default::default(), . } 32,067 ( 0.00%) } . . /// Returns the total number of nodes in the forest that have not . /// yet been fully resolved. . pub fn len(&self) -> usize { . self.nodes.len() . } . . /// Registers an obligation. . pub fn register_obligation(&mut self, obligation: O) { . // Ignore errors here - there is no guarantee of success. 1,208,246 ( 0.02%) let _ = self.register_obligation_at(obligation, None); . } . . // Returns Err(()) if we already know this obligation failed. 1,778,073 ( 0.03%) fn register_obligation_at(&mut self, obligation: O, parent: Option) -> Result<(), ()> { 323,286 ( 0.00%) let cache_key = obligation.as_cache_key(); 323,286 ( 0.00%) if self.done_cache.contains(&cache_key) { . debug!("register_obligation_at: ignoring already done obligation: {:?}", obligation); . return Ok(()); . } . 775,998 ( 0.01%) match self.active_cache.entry(cache_key) { . Entry::Occupied(o) => { 35,020 ( 0.00%) let node = &mut self.nodes[*o.get()]; 35,020 ( 0.00%) if let Some(parent_index) = parent { . // If the node is already in `active_cache`, it has already . // had its chance to be marked with a parent. So if it's . // not already present, just dump `parent` into the . // dependents as a non-parent. 34,452 ( 0.00%) if !node.dependents.contains(&parent_index) { . node.dependents.push(parent_index); . } . } 52,530 ( 0.00%) if let NodeState::Error = node.state.get() { Err(()) } else { Ok(()) } . } 335,469 ( 0.00%) Entry::Vacant(v) => { 670,938 ( 0.01%) let obligation_tree_id = match parent { 77,076 ( 0.00%) Some(parent_index) => self.nodes[parent_index].obligation_tree_id, . None => self.obligation_tree_id_generator.next().unwrap(), . }; . . let already_failed = parent.is_some() . && self . .error_cache . .get(&obligation_tree_id) . .map_or(false, |errors| errors.contains(v.key())); . . if already_failed { . Err(()) . } else { 111,823 ( 0.00%) let new_index = self.nodes.len(); . v.insert(new_index); . self.nodes.push(Node::new(parent, obligation, obligation_tree_id)); . Ok(()) . } . } . } 1,454,787 ( 0.02%) } . . /// Converts all remaining obligations to the given error. 280,056 ( 0.00%) pub fn to_errors(&mut self, error: E) -> Vec> { . let errors = self . .nodes . .iter() . .enumerate() . .filter(|(_index, node)| node.state.get() == NodeState::Pending) . .map(|(index, _node)| Error { error: error.clone(), backtrace: self.error_at(index) }) . .collect(); . 80,016 ( 0.00%) self.compress(|_| assert!(false)); . errors 240,048 ( 0.00%) } . . /// Returns the set of obligations that are in a pending state. . pub fn map_pending_obligations(&self, f: F) -> Vec

. where . F: Fn(&O) -> P, . { 1,588 ( 0.00%) self.nodes . .iter() . .filter(|node| node.state.get() == NodeState::Pending) . .map(|node| f(&node.obligation)) . .collect() . } . 868 ( 0.00%) fn insert_into_error_cache(&mut self, index: usize) { . let node = &self.nodes[index]; 124 ( 0.00%) self.error_cache 372 ( 0.00%) .entry(node.obligation_tree_id) . .or_default() . .insert(node.obligation.as_cache_key()); 992 ( 0.00%) } . . /// Performs a pass through the obligation list. This must . /// be called in a loop until `outcome.stalled` is false. . /// . /// This _cannot_ be unrolled (presently, at least). . #[inline(never)] 1,060,218 ( 0.02%) pub fn process_obligations(&mut self, processor: &mut P) -> OUT . where . P: ObligationProcessor, . OUT: OutcomeTrait>, . { . let mut outcome = OUT::new(); . . // Note that the loop body can append new nodes, and those new nodes . // will then be processed by subsequent iterations of the loop. . // . // We can't use an iterator for the loop because `self.nodes` is . // appended to and the borrow checker would complain. We also can't use . // `for index in 0..self.nodes.len() { ... }` because the range would . // be computed with the initial length, and we would miss the appended . // nodes. Therefore we use a `while` loop. . let mut index = 0; 778,023 ( 0.01%) while let Some(node) = self.nodes.get_mut(index) { . // `processor.process_obligation` can modify the predicate within . // `node.obligation`, and that predicate is the key used for . // `self.active_cache`. This means that `self.active_cache` can get . // out of sync with `nodes`. It's not very common, but it does . // happen, and code in `compress` has to allow for it. 1,320,442 ( 0.02%) if node.state.get() != NodeState::Pending { 50,316 ( 0.00%) index += 1; . continue; . } . 627,079 ( 0.01%) match processor.process_obligation(&mut node.obligation) { . ProcessResult::Unchanged => { . // No change in state. . } 442,996 ( 0.01%) ProcessResult::Changed(children) => { . // We are not (yet) stalled. . outcome.mark_not_stalled(); . node.state.set(NodeState::Success); . 580,398 ( 0.01%) for child in children { 1,167,917 ( 0.02%) let st = self.register_obligation_at(child, Some(index)); 137,402 ( 0.00%) if let Err(()) = st { . // Error already reported - propagate it . // to our node. . self.error_at(index); . } . } . } . ProcessResult::Error(err) => { . outcome.mark_not_stalled(); 2,409 ( 0.00%) outcome.record_error(Error { error: err, backtrace: self.error_at(index) }); . } . } 1,219,810 ( 0.02%) index += 1; . } . . // There's no need to perform marking, cycle processing and compression when nothing . // changed. 55,461 ( 0.00%) if !outcome.is_stalled() { . self.mark_successes(); . self.process_cycles(processor); 53,628 ( 0.00%) self.compress(|obl| outcome.record_completed(obl)); . } . . outcome 1,060,218 ( 0.02%) } . . /// Returns a vector of obligations for `p` and all of its . /// ancestors, putting them into the error state in the process. 511 ( 0.00%) fn error_at(&self, mut index: usize) -> Vec { . let mut error_stack: Vec = vec![]; . let mut trace = vec![]; . . loop { . let node = &self.nodes[index]; 124 ( 0.00%) node.state.set(NodeState::Error); . trace.push(node.obligation.clone()); 248 ( 0.00%) if node.has_parent { . // The first dependent is the parent, which is treated . // specially. . error_stack.extend(node.dependents.iter().skip(1)); 51 ( 0.00%) index = node.dependents[0]; . } else { . // No parent; treat all dependents non-specially. . error_stack.extend(node.dependents.iter()); . break; . } . } . . while let Some(index) = error_stack.pop() { -- line 508 ---------------------------------------- -- line 509 ---------------------------------------- . let node = &self.nodes[index]; . if node.state.get() != NodeState::Error { . node.state.set(NodeState::Error); . error_stack.extend(node.dependents.iter()); . } . } . . trace 584 ( 0.00%) } . . /// Mark all `Waiting` nodes as `Success`, except those that depend on a . /// pending node. . fn mark_successes(&self) { . // Convert all `Waiting` nodes to `Success`. . for node in &self.nodes { 631,307 ( 0.01%) if node.state.get() == NodeState::Waiting { . node.state.set(NodeState::Success); . } . } . . // Convert `Success` nodes that depend on a pending node back to . // `Waiting`. . for node in &self.nodes { 297,562 ( 0.00%) if node.state.get() == NodeState::Pending { . // This call site is hot. . self.inlined_mark_dependents_as_waiting(node); . } . } . } . . // This always-inlined function is for the hot call site. . #[inline(always)] . fn inlined_mark_dependents_as_waiting(&self, node: &Node) { 24,845 ( 0.00%) for &index in node.dependents.iter() { . let node = &self.nodes[index]; 24,845 ( 0.00%) let state = node.state.get(); 24,845 ( 0.00%) if state == NodeState::Success { . // This call site is cold. 51,345 ( 0.00%) self.uninlined_mark_dependents_as_waiting(node); . } else { . debug_assert!(state == NodeState::Waiting || state == NodeState::Error) . } . } . } . . // This never-inlined function is for the cold call site. . #[inline(never)] 119,805 ( 0.00%) fn uninlined_mark_dependents_as_waiting(&self, node: &Node) { . // Mark node Waiting in the cold uninlined code instead of the hot inlined . node.state.set(NodeState::Waiting); . self.inlined_mark_dependents_as_waiting(node) 136,920 ( 0.00%) } . . /// Report cycles between all `Success` nodes, and convert all `Success` . /// nodes to `Done`. This must be called after `mark_successes`. . fn process_cycles

(&mut self, processor: &mut P) . where . P: ObligationProcessor, . { 26,814 ( 0.00%) let mut stack = std::mem::take(&mut self.reused_node_vec); . for (index, node) in self.nodes.iter().enumerate() { . // For some benchmarks this state test is extremely hot. It's a win . // to handle the no-op cases immediately to avoid the cost of the . // function call. 297,562 ( 0.00%) if node.state.get() == NodeState::Success { 534,690 ( 0.01%) self.find_cycles_from_node(&mut stack, processor, index); . } . } . . debug_assert!(stack.is_empty()); 214,512 ( 0.00%) self.reused_node_vec = stack; . } . 1,392,489 ( 0.02%) fn find_cycles_from_node

(&self, stack: &mut Vec, processor: &mut P, index: usize) . where . P: ObligationProcessor, . { . let node = &self.nodes[index]; 309,442 ( 0.00%) if node.state.get() == NodeState::Success { 7,990 ( 0.00%) match stack.iter().rposition(|&n| n == index) { . None => { . stack.push(index); 47,783 ( 0.00%) for &dep_index in node.dependents.iter() { 191,132 ( 0.00%) self.find_cycles_from_node(stack, processor, dep_index); . } . stack.pop(); . node.state.set(NodeState::Done); . } . Some(rpos) => { . // Cycle detected. 360 ( 0.00%) processor.process_backedge( . stack[rpos..].iter().map(|&i| &self.nodes[i].obligation), . PhantomData, . ); . } . } . } 1,237,768 ( 0.02%) } . . /// Compresses the vector, removing all popped nodes. This adjusts the . /// indices and hence invalidates any outstanding indices. `process_cycles` . /// must be run beforehand to remove any cycles on `Success` nodes. . #[inline(never)] 494,568 ( 0.01%) fn compress(&mut self, mut outcome_cb: impl FnMut(&O)) { 66,822 ( 0.00%) let orig_nodes_len = self.nodes.len(); . let mut node_rewrites: Vec<_> = std::mem::take(&mut self.reused_node_vec); . debug_assert!(node_rewrites.is_empty()); . node_rewrites.extend(0..orig_nodes_len); . let mut dead_nodes = 0; . . // Move removable nodes to the end, preserving the order of the . // remaining nodes. . // . // LOOP INVARIANT: . // self.nodes[0..index - dead_nodes] are the first remaining nodes . // self.nodes[index - dead_nodes..index] are all dead . // self.nodes[index..] are unchanged . for index in 0..orig_nodes_len { . let node = &self.nodes[index]; 1,595,066 ( 0.02%) match node.state.get() { . NodeState::Pending | NodeState::Waiting => { 373,480 ( 0.01%) if dead_nodes > 0 { 131,319 ( 0.00%) self.nodes.swap(index, index - dead_nodes); 218,865 ( 0.00%) node_rewrites[index] -= dead_nodes; . } . } . NodeState::Done => { . // This lookup can fail because the contents of . // `self.active_cache` are not guaranteed to match those of . // `self.nodes`. See the comment in `process_obligation` . // for more details. 414,723 ( 0.01%) if let Some((predicate, _)) = 332,094 ( 0.00%) self.active_cache.remove_entry(&node.obligation.as_cache_key()) . { . self.done_cache.insert(predicate); . } else { . self.done_cache.insert(node.obligation.as_cache_key().clone()); . } . // Extract the success stories. . outcome_cb(&node.obligation); 221,396 ( 0.00%) node_rewrites[index] = orig_nodes_len; 221,396 ( 0.00%) dead_nodes += 1; . } . NodeState::Error => { . // We *intentionally* remove the node from the cache at this point. Otherwise . // tests must come up with a different type on every type error they . // check against. 372 ( 0.00%) self.active_cache.remove(&node.obligation.as_cache_key()); 248 ( 0.00%) self.insert_into_error_cache(index); 248 ( 0.00%) node_rewrites[index] = orig_nodes_len; 248 ( 0.00%) dead_nodes += 1; . } . NodeState::Success => unreachable!(), . } . } . . if dead_nodes > 0 { . // Remove the dead nodes and rewrite indices. 51,836 ( 0.00%) self.nodes.truncate(orig_nodes_len - dead_nodes); 25,918 ( 0.00%) self.apply_rewrites(&node_rewrites); . } . . node_rewrites.truncate(0); 267,288 ( 0.00%) self.reused_node_vec = node_rewrites; 534,576 ( 0.01%) } . . #[inline(never)] 233,262 ( 0.00%) fn apply_rewrites(&mut self, node_rewrites: &[usize]) { . let orig_nodes_len = node_rewrites.len(); . . for node in &mut self.nodes { . let mut i = 0; 196,367 ( 0.00%) while let Some(dependent) = node.dependents.get_mut(i) { 87,484 ( 0.00%) let new_index = node_rewrites[*dependent]; 43,742 ( 0.00%) if new_index >= orig_nodes_len { . node.dependents.swap_remove(i); . if i == 0 && node.has_parent { . // We just removed the parent. . node.has_parent = false; . } . } else { 21,871 ( 0.00%) *dependent = new_index; 43,742 ( 0.00%) i += 1; . } . } . } . . // This updating of `self.active_cache` is necessary because the . // removal of nodes within `compress` can fail. See above. . self.active_cache.retain(|_predicate, index| { 810,260 ( 0.01%) let new_index = node_rewrites[*index]; 405,130 ( 0.01%) if new_index >= orig_nodes_len { . false . } else { 174,496 ( 0.00%) *index = new_index; . true . } . }); 207,344 ( 0.00%) } . } 3,309,027 ( 0.05%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_trait_selection/src/traits/fulfill.rs -------------------------------------------------------------------------------- Ir -- line 33 ---------------------------------------- . . impl<'tcx> ForestObligation for PendingPredicateObligation<'tcx> { . /// Note that we include both the `ParamEnv` and the `Predicate`, . /// as the `ParamEnv` can influence whether fulfillment succeeds . /// or fails. . type CacheKey = ty::ParamEnvAnd<'tcx, ty::Predicate<'tcx>>; . . fn as_cache_key(&self) -> Self::CacheKey { 901,974 ( 0.01%) self.obligation.param_env.and(self.obligation.predicate) . } . } . . /// The fulfillment context is used to drive trait resolution. It . /// consists of a list of obligations that must be (eventually) . /// satisfied. The job is to track which are satisfied, which yielded . /// errors, and which are still pending. At any point, users can call . /// `select_where_possible`, and the fulfillment context will try to do -- line 49 ---------------------------------------- -- line 79 ---------------------------------------- . // outside of any snapshot, so any use of it inside a snapshot . // will lead to trouble and therefore is checked against, but . // other fulfillment contexts sometimes do live inside of . // a snapshot (they don't *straddle* a snapshot, so there . // is no trouble there). . usable_in_snapshot: bool, . } . 1,240 ( 0.00%) #[derive(Clone, Debug)] . pub struct PendingPredicateObligation<'tcx> { . pub obligation: PredicateObligation<'tcx>, . // This is far more often read than modified, meaning that we . // should mostly optimize for reading speed, while modifying is not as relevant. . // . // For whatever reason using a boxed slice is slower than using a `Vec` here. . pub stalled_on: Vec>, . } . . // `PendingPredicateObligation` is used a lot. Make sure it doesn't unintentionally get bigger. . #[cfg(all(target_arch = "x86_64", target_pointer_width = "64"))] . static_assert_size!(PendingPredicateObligation<'_>, 72); . . impl<'a, 'tcx> FulfillmentContext<'tcx> { . /// Creates a new fulfillment context. 10,749 ( 0.00%) pub fn new() -> FulfillmentContext<'tcx> { 138,361 ( 0.00%) FulfillmentContext { 21,920 ( 0.00%) predicates: ObligationForest::new(), . relationships: FxHashMap::default(), . register_region_obligations: true, . usable_in_snapshot: false, . } 10,749 ( 0.00%) } . . pub fn new_in_snapshot() -> FulfillmentContext<'tcx> { 4,764 ( 0.00%) FulfillmentContext { 1,588 ( 0.00%) predicates: ObligationForest::new(), . relationships: FxHashMap::default(), . register_region_obligations: true, . usable_in_snapshot: true, . } . } . . pub fn new_ignoring_regions() -> FulfillmentContext<'tcx> { 34,640 ( 0.00%) FulfillmentContext { 8,660 ( 0.00%) predicates: ObligationForest::new(), . relationships: FxHashMap::default(), . register_region_obligations: false, . usable_in_snapshot: false, . } . } . . /// Attempts to select obligations using `selcx`. . fn select(&mut self, selcx: &mut SelectionContext<'a, 'tcx>) -> Vec> { 181,976 ( 0.00%) let span = debug_span!("select", obligation_forest_size = ?self.predicates.len()); . let _enter = span.enter(); . . let mut errors = Vec::new(); . . loop { . debug!("select: starting another iteration"); . . // Process pending obligations. . let outcome: Outcome<_, _> = 824,614 ( 0.01%) self.predicates.process_obligations(&mut FulfillProcessor { . selcx, 117,802 ( 0.00%) register_region_obligations: self.register_region_obligations, . }); . debug!("select: outcome={:#?}", outcome); . . // FIXME: if we kept the original cache key, we could mark projection . // obligations as complete for the projection cache here. . . errors.extend(outcome.errors.into_iter().map(to_fulfillment_error)); . . // If nothing new was added, no need to keep looping. 235,604 ( 0.00%) if outcome.stalled { . break; . } . } . . debug!( . "select({} predicates remaining, {} errors) done", . self.predicates.len(), . errors.len() -- line 162 ---------------------------------------- -- line 169 ---------------------------------------- . impl<'tcx> TraitEngine<'tcx> for FulfillmentContext<'tcx> { . /// "Normalize" a projection type `::X` by . /// creating a fresh type variable `$0` as well as a projection . /// predicate `::X == $0`. When the . /// inference engine runs, it will attempt to find an impl of . /// `SomeTrait` or a where-clause that lets us unify `$0` with . /// something concrete. If this fails, we'll unify `$0` with . /// `projection_ty` again. 34,936 ( 0.00%) #[tracing::instrument(level = "debug", skip(self, infcx, param_env, cause))] . fn normalize_projection_type( . &mut self, . infcx: &InferCtxt<'_, 'tcx>, . param_env: ty::ParamEnv<'tcx>, . projection_ty: ty::ProjectionTy<'tcx>, . cause: ObligationCause<'tcx>, . ) -> Ty<'tcx> { . debug_assert!(!projection_ty.has_escaping_bound_vars()); . . // FIXME(#20304) -- cache . . let mut selcx = SelectionContext::new(infcx); . let mut obligations = vec![]; 14,292 ( 0.00%) let normalized_ty = project::normalize_projection_type( . &mut selcx, . param_env, . projection_ty, 7,940 ( 0.00%) cause, . 0, . &mut obligations, . ); . self.register_predicate_obligations(infcx, obligations); . . debug!(?normalized_ty); . . normalized_ty . } . 557,652 ( 0.01%) fn register_predicate_obligation( . &mut self, . infcx: &InferCtxt<'_, 'tcx>, . obligation: PredicateObligation<'tcx>, . ) { . // this helps to reduce duplicate errors, as well as making . // debug output much nicer to read and so on. 278,826 ( 0.00%) let obligation = infcx.resolve_vars_if_possible(obligation); . . debug!(?obligation, "register_predicate_obligation"); . 557,652 ( 0.01%) assert!(!infcx.is_in_snapshot() || self.usable_in_snapshot); . 278,826 ( 0.00%) super::relationships::update(self, infcx, &obligation); . . self.predicates . .register_obligation(PendingPredicateObligation { obligation, stalled_on: vec![] }); 464,710 ( 0.01%) } . 320,608 ( 0.00%) fn select_all_or_error(&mut self, infcx: &InferCtxt<'_, 'tcx>) -> Vec> { . { 40,076 ( 0.00%) let errors = self.select_where_possible(infcx); 40,076 ( 0.00%) if !errors.is_empty() { 340 ( 0.00%) return errors; . } . } . 200,040 ( 0.00%) self.predicates.to_errors(CodeAmbiguity).into_iter().map(to_fulfillment_error).collect() 280,532 ( 0.00%) } . 909,880 ( 0.01%) fn select_where_possible( . &mut self, . infcx: &InferCtxt<'_, 'tcx>, . ) -> Vec> { . let mut selcx = SelectionContext::new(infcx); . self.select(&mut selcx) 818,892 ( 0.01%) } . 1,425 ( 0.00%) fn pending_obligations(&self) -> Vec> { . self.predicates.map_pending_obligations(|o| o.obligation.clone()) 1,900 ( 0.00%) } . . fn relationships(&mut self) -> &mut FxHashMap { 250 ( 0.00%) &mut self.relationships 250 ( 0.00%) } . } . . struct FulfillProcessor<'a, 'b, 'tcx> { . selcx: &'a mut SelectionContext<'b, 'tcx>, . register_region_obligations: bool, . } . . fn mk_pending(os: Vec>) -> Vec> { -- line 258 ---------------------------------------- -- line 275 ---------------------------------------- . #[inline(always)] . fn process_obligation( . &mut self, . pending_obligation: &mut Self::Obligation, . ) -> ProcessResult { . // If we were stalled on some unresolved variables, first check whether . // any of them have been resolved; if not, don't bother doing more work . // yet. 3,323,736 ( 0.05%) let change = match pending_obligation.stalled_on.len() { . // Match arms are in order of frequency, which matters because this . // code is so hot. 1 and 0 dominate; 2+ is fairly rare. . 1 => { 1,448,235 ( 0.02%) let infer_var = pending_obligation.stalled_on[0]; 482,745 ( 0.01%) self.selcx.infcx().ty_or_const_infer_var_changed(infer_var) . } . 0 => { . // In this case we haven't changed, but wish to make a change. . true . } . _ => { . // This `for` loop was once a call to `all()`, but this lower-level . // form was a perf win. See #64545 for details. 45,786 ( 0.00%) (|| { 90,048 ( 0.00%) for &infer_var in &pending_obligation.stalled_on { 1,677 ( 0.00%) if self.selcx.infcx().ty_or_const_infer_var_changed(infer_var) { . return true; . } . } . false . })() . } . }; . 1,048 ( 0.00%) if !change { . debug!( . "process_predicate: pending obligation {:?} still stalled on {:?}", . self.selcx.infcx().resolve_vars_if_possible(pending_obligation.obligation.clone()), . pending_obligation.stalled_on . ); . return ProcessResult::Unchanged; . } . 405,435 ( 0.01%) self.progress_changed_obligations(pending_obligation) . } . 840 ( 0.00%) fn process_backedge<'c, I>( . &mut self, . cycle: I, . _marker: PhantomData<&'c PendingPredicateObligation<'tcx>>, . ) where . I: Clone + Iterator>, . { 120 ( 0.00%) if self.selcx.coinductive_match(cycle.clone().map(|s| s.obligation.predicate)) { . debug!("process_child_obligations: coinductive match"); . } else { . let cycle: Vec<_> = cycle.map(|c| c.obligation.clone()).collect(); . self.selcx.infcx().report_overflow_error_cycle(&cycle); . } 960 ( 0.00%) } . } . . impl<'a, 'b, 'tcx> FulfillProcessor<'a, 'b, 'tcx> { . // The code calling this method is extremely hot and only rarely . // actually uses this, so move this part of the code . // out of that loop. . #[inline(never)] 1,351,450 ( 0.02%) fn progress_changed_obligations( . &mut self, . pending_obligation: &mut PendingPredicateObligation<'tcx>, . ) -> ProcessResult, FulfillmentErrorCode<'tcx>> { . pending_obligation.stalled_on.truncate(0); . . let obligation = &mut pending_obligation.obligation; . 405,435 ( 0.01%) if obligation.predicate.has_infer_types_or_consts() { 60,011 ( 0.00%) obligation.predicate = 180,033 ( 0.00%) self.selcx.infcx().resolve_vars_if_possible(obligation.predicate); . } . . debug!(?obligation, ?obligation.cause, "process_obligation"); . . let infcx = self.selcx.infcx(); . 150,268 ( 0.00%) let binder = obligation.predicate.kind(); 946,015 ( 0.01%) match binder.no_bound_vars() { 1,782 ( 0.00%) None => match binder.skip_binder() { . // Evaluation will discard candidates using the leak check. . // This means we need to pass it the bound version of our . // predicate. . ty::PredicateKind::Trait(trait_ref) => { . let trait_obligation = obligation.with(binder.rebind(trait_ref)); . 324 ( 0.00%) self.process_trait_obligation( . obligation, 972 ( 0.00%) trait_obligation, . &mut pending_obligation.stalled_on, . ) . } . ty::PredicateKind::Projection(data) => { . let project_obligation = obligation.with(binder.rebind(data)); . 324 ( 0.00%) self.process_projection_obligation( . obligation, 972 ( 0.00%) project_obligation, . &mut pending_obligation.stalled_on, . ) . } . ty::PredicateKind::RegionOutlives(_) . | ty::PredicateKind::TypeOutlives(_) . | ty::PredicateKind::WellFormed(_) . | ty::PredicateKind::ObjectSafe(_) . | ty::PredicateKind::ClosureKind(..) -- line 386 ---------------------------------------- -- line 397 ---------------------------------------- . ty::PredicateKind::TypeWellFormedFromEnv(..) => { . bug!("TypeWellFormedFromEnv is only used for Chalk") . } . }, . Some(pred) => match pred { . ty::PredicateKind::Trait(data) => { . let trait_obligation = obligation.with(Binder::dummy(data)); . 329,600 ( 0.00%) self.process_trait_obligation( . obligation, 1,450,240 ( 0.02%) trait_obligation, . &mut pending_obligation.stalled_on, . ) . } . . ty::PredicateKind::RegionOutlives(data) => { 27,762 ( 0.00%) match infcx.region_outlives_predicate(&obligation.cause, Binder::dummy(data)) { 18,508 ( 0.00%) Ok(()) => ProcessResult::Changed(vec![]), . Err(_) => ProcessResult::Error(CodeSelectionError(Unimplemented)), . } . } . . ty::PredicateKind::TypeOutlives(ty::OutlivesPredicate(t_a, r_b)) => { 37,000 ( 0.00%) if self.register_region_obligations { 92,500 ( 0.00%) self.selcx.infcx().register_region_obligation_with_cause( . t_a, . r_b, . &obligation.cause, . ); . } . ProcessResult::Changed(vec![]) . } . . ty::PredicateKind::Projection(ref data) => { . let project_obligation = obligation.with(Binder::dummy(*data)); . 22,675 ( 0.00%) self.process_projection_obligation( . obligation, 68,025 ( 0.00%) project_obligation, . &mut pending_obligation.stalled_on, . ) . } . . ty::PredicateKind::ObjectSafe(trait_def_id) => { 604 ( 0.00%) if !self.selcx.tcx().is_object_safe(trait_def_id) { . ProcessResult::Error(CodeSelectionError(Unimplemented)) . } else { . ProcessResult::Changed(vec![]) . } . } . . ty::PredicateKind::ClosureKind(_, closure_substs, kind) => { 1,662 ( 0.00%) match self.selcx.infcx().closure_kind(closure_substs) { . Some(closure_kind) => { 2,874 ( 0.00%) if closure_kind.extends(kind) { . ProcessResult::Changed(vec![]) . } else { . ProcessResult::Error(CodeSelectionError(Unimplemented)) . } . } . None => ProcessResult::Unchanged, . } . } . . ty::PredicateKind::WellFormed(arg) => { 273,973 ( 0.00%) match wf::obligations( . self.selcx.infcx(), 78,278 ( 0.00%) obligation.param_env, 78,278 ( 0.00%) obligation.cause.body_id, 117,417 ( 0.00%) obligation.recursion_depth + 1, . arg, . obligation.cause.span, . ) { . None => { 28,800 ( 0.00%) pending_obligation.stalled_on = 50,400 ( 0.00%) vec![TyOrConstInferVar::maybe_from_generic_arg(arg).unwrap()]; 14,400 ( 0.00%) ProcessResult::Unchanged . } 95,817 ( 0.00%) Some(os) => ProcessResult::Changed(mk_pending(os)), . } . } . . ty::PredicateKind::Subtype(subtype) => { 10,736 ( 0.00%) match self.selcx.infcx().subtype_predicate( . &obligation.cause, . obligation.param_env, . Binder::dummy(subtype), . ) { . None => { . // None means that both are unresolved. 5,760 ( 0.00%) pending_obligation.stalled_on = vec![ 1,152 ( 0.00%) TyOrConstInferVar::maybe_from_ty(subtype.a).unwrap(), 2,304 ( 0.00%) TyOrConstInferVar::maybe_from_ty(subtype.b).unwrap(), . ]; . ProcessResult::Unchanged . } . Some(Ok(ok)) => ProcessResult::Changed(mk_pending(ok.obligations)), . Some(Err(err)) => { . let expected_found = . ExpectedFound::new(subtype.a_is_expected, subtype.a, subtype.b); . ProcessResult::Error(FulfillmentErrorCode::CodeSubtypeError( -- line 497 ---------------------------------------- -- line 498 ---------------------------------------- . expected_found, . err, . )) . } . } . } . . ty::PredicateKind::Coerce(coerce) => { 1,592 ( 0.00%) match self.selcx.infcx().coerce_predicate( . &obligation.cause, . obligation.param_env, . Binder::dummy(coerce), . ) { . None => { . // None means that both are unresolved. 285 ( 0.00%) pending_obligation.stalled_on = vec![ 57 ( 0.00%) TyOrConstInferVar::maybe_from_ty(coerce.a).unwrap(), 114 ( 0.00%) TyOrConstInferVar::maybe_from_ty(coerce.b).unwrap(), . ]; . ProcessResult::Unchanged . } . Some(Ok(ok)) => ProcessResult::Changed(mk_pending(ok.obligations)), . Some(Err(err)) => { . let expected_found = ExpectedFound::new(false, coerce.a, coerce.b); . ProcessResult::Error(FulfillmentErrorCode::CodeSubtypeError( . expected_found, . err, . )) . } . } . } . . ty::PredicateKind::ConstEvaluatable(uv) => { 96 ( 0.00%) match const_evaluatable::is_const_evaluatable( . self.selcx.infcx(), 192 ( 0.00%) uv, 32 ( 0.00%) obligation.param_env, 16 ( 0.00%) obligation.cause.span, . ) { . Ok(()) => ProcessResult::Changed(vec![]), . Err(NotConstEvaluatable::MentionsInfer) => { . pending_obligation.stalled_on.clear(); . pending_obligation.stalled_on.extend( . uv.substs . .iter() . .filter_map(TyOrConstInferVar::maybe_from_generic_arg), -- line 543 ---------------------------------------- -- line 639 ---------------------------------------- . } . } . } . ty::PredicateKind::TypeWellFormedFromEnv(..) => { . bug!("TypeWellFormedFromEnv is only used for Chalk") . } . }, . } 1,216,305 ( 0.02%) } . 1,254,019 ( 0.02%) #[instrument(level = "debug", skip(self, obligation, stalled_on))] . fn process_trait_obligation( . &mut self, . obligation: &PredicateObligation<'tcx>, . trait_obligation: TraitObligation<'tcx>, . stalled_on: &mut Vec>, . ) -> ProcessResult, FulfillmentErrorCode<'tcx>> { 66,001 ( 0.00%) let infcx = self.selcx.infcx(); 198,003 ( 0.00%) if obligation.predicate.is_global() { . // no type variables present, can use evaluation for better caching. . // FIXME: consider caching errors too. 62,856 ( 0.00%) if infcx.predicate_must_hold_considering_regions(obligation) { . debug!( . "selecting trait at depth {} evaluated to holds", . obligation.recursion_depth . ); 62,010 ( 0.00%) return ProcessResult::Changed(vec![]); . } . } . 244,826 ( 0.00%) match self.selcx.select(&trait_obligation) { . Ok(Some(impl_source)) => { . debug!("selecting trait at depth {} yielded Ok(Some)", obligation.recursion_depth); 381,456 ( 0.01%) ProcessResult::Changed(mk_pending(impl_source.nested_obligations())) . } . Ok(None) => { . debug!("selecting trait at depth {} yielded Ok(None)", obligation.recursion_depth); . . // This is a bit subtle: for the most part, the . // only reason we can fail to make progress on . // trait selection is because we don't have enough . // information about the types in the trait. . stalled_on.clear(); . stalled_on.extend(substs_infer_vars( . self.selcx, 13,731 ( 0.00%) trait_obligation.predicate.map_bound(|pred| pred.trait_ref.substs), . )); . . debug!( . "process_predicate: pending obligation {:?} now stalled on {:?}", . infcx.resolve_vars_if_possible(obligation.clone()), . stalled_on . ); . 13,731 ( 0.00%) ProcessResult::Unchanged . } . Err(selection_err) => { . debug!("selecting trait at depth {} yielded Err", obligation.recursion_depth); . 1,022 ( 0.00%) ProcessResult::Error(CodeSelectionError(selection_err)) . } . } . } . 50,776 ( 0.00%) fn process_projection_obligation( . &mut self, . obligation: &PredicateObligation<'tcx>, . project_obligation: PolyProjectionObligation<'tcx>, . stalled_on: &mut Vec>, . ) -> ProcessResult, FulfillmentErrorCode<'tcx>> { 4,616 ( 0.00%) let tcx = self.selcx.tcx(); . 13,848 ( 0.00%) if obligation.predicate.is_global() { . // no type variables present, can use evaluation for better caching. . // FIXME: consider caching errors too. 914 ( 0.00%) if self.selcx.infcx().predicate_must_hold_considering_regions(obligation) { 2,712 ( 0.00%) if let Some(key) = ProjectionCacheKey::from_poly_projection_predicate( . &mut self.selcx, 3,164 ( 0.00%) project_obligation.predicate, . ) { . // If `predicate_must_hold_considering_regions` succeeds, then we've . // evaluated all sub-obligations. We can therefore mark the 'root' . // obligation as complete, and skip evaluating sub-obligations. 2,712 ( 0.00%) self.selcx . .infcx() . .inner . .borrow_mut() . .projection_cache() . .complete(key, EvaluationResult::EvaluatedToOk); . } 904 ( 0.00%) return ProcessResult::Changed(vec![]); . } else { . tracing::debug!("Does NOT hold: {:?}", obligation); . } . } . 29,148 ( 0.00%) match project::poly_project_and_unify_type(self.selcx, &project_obligation) { . Ok(Ok(Some(os))) => ProcessResult::Changed(mk_pending(os)), . Ok(Ok(None)) => { . stalled_on.clear(); . stalled_on.extend(substs_infer_vars( . self.selcx, 2,108 ( 0.00%) project_obligation.predicate.map_bound(|pred| pred.projection_ty.substs), . )); 2,108 ( 0.00%) ProcessResult::Unchanged . } . // Let the caller handle the recursion . Ok(Err(project::InProgress)) => ProcessResult::Changed(mk_pending(vec![ . project_obligation.with(project_obligation.predicate.to_predicate(tcx)), . ])), . Err(e) => ProcessResult::Error(CodeProjectionError(e)), . } 36,928 ( 0.00%) } . } . . /// Returns the set of inference variables contained in `substs`. . fn substs_infer_vars<'a, 'tcx>( . selcx: &mut SelectionContext<'a, 'tcx>, . substs: ty::Binder<'tcx, SubstsRef<'tcx>>, . ) -> impl Iterator> { . selcx . .infcx() . .resolve_vars_if_possible(substs) . .skip_binder() // ok because this check doesn't care about regions . .iter() . .filter(|arg| arg.has_infer_types_or_consts()) . .flat_map(|arg| { 83,325 ( 0.00%) let mut walker = arg.walk(); 150,095 ( 0.00%) while let Some(c) = walker.next() { 16,689 ( 0.00%) if !c.has_infer_types_or_consts() { . walker.visited.remove(&c); 8 ( 0.00%) walker.skip_current_subtree(); . } . } . walker.visited.into_iter() . }) . .filter_map(TyOrConstInferVar::maybe_from_generic_arg) . } . . fn to_fulfillment_error<'tcx>( . error: Error, FulfillmentErrorCode<'tcx>>, . ) -> FulfillmentError<'tcx> { . let mut iter = error.backtrace.into_iter(); 73 ( 0.00%) let obligation = iter.next().unwrap().obligation; . // The root obligation is the last item in the backtrace - if there's only . // one item, then it's the same as the main obligation . let root_obligation = iter.next_back().map_or_else(|| obligation.clone(), |e| e.obligation); 2,190 ( 0.00%) FulfillmentError::new(obligation, error.error, root_obligation) . } 3,483,351 ( 0.05%) -------------------------------------------------------------------------------- -- 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 { 2,235,994 ( 0.03%) 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> { 15,759 ( 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> { 6,396 ( 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 197 ---------------------------------------- . /// assert_eq!(first, &0); . /// assert_eq!(elements, &[1, 2]); . /// } . /// ``` . #[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_first(&self) -> Option<(&T, &[T])> { 12 ( 0.00%) if let [first, tail @ ..] = self { Some((first, tail)) } else { None } . } . . /// Returns the first and all the rest of the elements of the slice, or `None` if it is empty. . /// . /// # Examples . /// . /// ``` . /// let x = &mut [0, 1, 2]; -- line 213 ---------------------------------------- -- 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])> { 79,541 ( 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> { 1,174,718 ( 0.02%) 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> { 2,677,122 ( 0.04%) 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 { 2,589,373 ( 0.04%) 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 { 47 ( 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) { 43,660 ( 0.00%) let _ = &self[a]; 135,825 ( 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 { 4,311 ( 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]) { 42 ( 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]) { 270,570 ( 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. 14,279 ( 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, . { 4,906 ( 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(); 118,817 ( 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()); 7,900 ( 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 . 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 . where . F: FnMut(&'a T) -> Ordering, . { . let mut size = self.len(); . let mut left = 0; . let mut right = size; 10,701,262 ( 0.16%) while left < right { 13,040,091 ( 0.19%) 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. 1,597,423 ( 0.02%) 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. 3,819,925 ( 0.06%) if cmp == Less { 5,827,216 ( 0.08%) left = mid + 1; 1,646,009 ( 0.02%) } else if cmp == Greater { . right = mid; . } else { . // SAFETY: same as the `get_unchecked` above . unsafe { crate::intrinsics::assume(mid < self.len()) }; . return Ok(mid); . } . 11,084,856 ( 0.16%) 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, . ); . } . 450,860 ( 0.01%) 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::(), mem::size_of::()); . let ts: usize = mem::size_of::() / gcd; . let us: usize = mem::size_of::() / 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! 17,310 ( 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::()) }; 17,310 ( 0.00%) if offset > self.len() { . (self, &[], &[]) . } else { . let (left, rest) = self.split_at(offset); . let (us_len, ts_len) = rest.align_to_offsets::(); . // 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), 17,310 ( 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 ---------------------------------------- -- line 3731 ---------------------------------------- . /// let v = [1, 2, 3, 3, 5, 6, 7]; . /// let i = v.partition_point(|&x| x < 5); . /// . /// assert_eq!(i, 4); . /// assert!(v[..i].iter().all(|&x| x < 5)); . /// assert!(v[i..].iter().all(|&x| !(x < 5))); . /// ``` . #[stable(feature = "partition_point", since = "1.52.0")] 3 ( 0.00%) pub fn partition_point

(&self, mut pred: P) -> usize . where . P: FnMut(&T) -> bool, . { . self.binary_search_by(|x| if pred(x) { Less } else { Greater }).unwrap_or_else(|i| i) 6 ( 0.00%) } . . /// Removes the subslice corresponding to the given range . /// and returns a reference to it. . /// . /// Returns `None` and does not modify the slice if the given . /// range is out of bounds. . /// . /// Note that this method only accepts one-sided ranges such as -- line 3752 ---------------------------------------- 9,513,250 ( 0.14%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_index/src/interval.rs -------------------------------------------------------------------------------- Ir -- line 25 ---------------------------------------- . Bound::Included(start) => start.index() as u32, . Bound::Excluded(start) => start.index() as u32 + 1, . Bound::Unbounded => 0, . } . } . . #[inline] . fn inclusive_end(domain: usize, range: impl RangeBounds) -> Option { 770,635 ( 0.01%) let end = match range.end_bound() { . Bound::Included(end) => end.index() as u32, 9 ( 0.00%) Bound::Excluded(end) => end.index().checked_sub(1)? as u32, . Bound::Unbounded => domain.checked_sub(1)? as u32, . }; . Some(end) . } . . impl IntervalSet { . pub fn new(domain: usize) -> IntervalSet { . IntervalSet { map: SmallVec::new(), domain, _data: PhantomData } -- line 43 ---------------------------------------- -- line 54 ---------------------------------------- . self.iter_intervals().flatten() . } . . /// Iterates through intervals stored in the set, in order. . pub fn iter_intervals(&self) -> impl Iterator> + '_ . where . I: Step, . { 1,516 ( 0.00%) self.map.iter().map(|&(start, end)| I::new(start as usize)..I::new(end as usize + 1)) . } . . /// Returns true if we increased the number of elements present. . pub fn insert(&mut self, point: I) -> bool { 370,466 ( 0.01%) self.insert_range(point..=point) . } . . /// Returns true if we increased the number of elements present. 1,058,634 ( 0.02%) pub fn insert_range(&mut self, range: impl RangeBounds + Clone) -> bool { . let start = inclusive_start(range.clone()); . let Some(mut end) = inclusive_end(self.domain, range) else { . // empty range . return false; . }; 683,764 ( 0.01%) if start > end { . return false; . } . . loop { . // This condition looks a bit weird, but actually makes sense. . // . // if r.0 == end + 1, then we're actually adjacent, so we want to . // continue to the next range. We're looking here for the first . // range which starts *non-adjacently* to our end. 719,219 ( 0.01%) let next = self.map.partition_point(|r| r.0 <= end + 1); 243,074 ( 0.00%) if let Some(last) = next.checked_sub(1) { . let (prev_start, prev_end) = &mut self.map[last]; 1,396,452 ( 0.02%) if *prev_end + 1 >= start { . // If the start for the inserted range is adjacent to the . // end of the previous, we can extend the previous range. 365,266 ( 0.01%) if start < *prev_start { . // Our range starts before the one we found. We'll need . // to *remove* it, and then try again. . // . // FIXME: This is not so efficient; we may need to . // recurse a bunch of times here. Instead, it's probably . // better to do something like drain_filter(...) on the . // map to be able to delete or modify all the ranges in . // start..=end and then potentially re-insert a new -- line 101 ---------------------------------------- -- line 104 ---------------------------------------- . self.map.remove(last); . } else { . // We overlap with the previous range, increase it to . // include us. . // . // Make sure we're actually going to *increase* it though -- . // it may be that end is just inside the previously existing . // set. 133,192 ( 0.00%) return if end > *prev_end { 84,464 ( 0.00%) *prev_end = end; . true . } else { . false . }; . } . } else { . // Otherwise, we don't overlap, so just insert 150,327 ( 0.00%) self.map.insert(last + 1, (start, end)); . return true; . } . } else { . if self.map.is_empty() { . // Quite common in practice, and expensive to call memcpy . // with length zero. . self.map.push((start, end)); . } else { 30,996 ( 0.00%) self.map.insert(next, (start, end)); . } . return true; . } . } 941,008 ( 0.01%) } . 134 ( 0.00%) pub fn contains(&self, needle: I) -> bool { . let needle = needle.index() as u32; 203,397 ( 0.00%) let last = match self.map.partition_point(|r| r.0 <= needle).checked_sub(1) { . Some(idx) => idx, . None => { . // All ranges in the map start after the new range's end . return false; . } . }; . let (_, prev_end) = &self.map[last]; 130,579 ( 0.00%) needle <= *prev_end 268 ( 0.00%) } . 32 ( 0.00%) pub fn superset(&self, other: &IntervalSet) -> bool . where . I: Step, . { . // FIXME: Performance here is probably not great. We will be doing a lot . // of pointless tree traversals. 402 ( 0.00%) other.iter().all(|elem| self.contains(elem)) 36 ( 0.00%) } . . pub fn is_empty(&self) -> bool { 43,230 ( 0.00%) self.map.is_empty() . } . . /// Returns the maximum (last) element present in the set from `range`. 36,501 ( 0.00%) pub fn last_set_in(&self, range: impl RangeBounds + Clone) -> Option { . let start = inclusive_start(range.clone()); . let Some(end) = inclusive_end(self.domain, range) else { . // empty range . return None; . }; 73,002 ( 0.00%) if start > end { . return None; . } 62,265 ( 0.00%) let last = match self.map.partition_point(|r| r.0 <= end).checked_sub(1) { . Some(idx) => idx, . None => { . // All ranges in the map start after the new range's end . return None; . } . }; . let (_, prev_end) = &self.map[last]; 24,240 ( 0.00%) if start <= *prev_end { Some(I::new(std::cmp::min(*prev_end, end) as usize)) } else { None } 73,002 ( 0.00%) } . 49,020 ( 0.00%) pub fn insert_all(&mut self) { . self.clear(); 9,804 ( 0.00%) self.map.push((0, self.domain.try_into().unwrap())); 49,020 ( 0.00%) } . 1,852,520 ( 0.03%) pub fn union(&mut self, other: &IntervalSet) -> bool . where . I: Step, . { 694,695 ( 0.01%) assert_eq!(self.domain, other.domain); . let mut did_insert = false; . for range in other.iter_intervals() { 672,768 ( 0.01%) did_insert |= self.insert_range(range); . } . did_insert 2,084,085 ( 0.03%) } . } . . /// This data structure optimizes for cases where the stored bits in each row . /// are expected to be highly contiguous (long ranges of 1s or 0s), in contrast . /// to BitMatrix and SparseBitMatrix which are optimized for . /// "random"/non-contiguous bits and cheap(er) point queries at the expense of . /// memory usage. . #[derive(Clone)] -- line 207 ---------------------------------------- -- line 215 ---------------------------------------- . } . . impl SparseIntervalMatrix { . pub fn new(column_size: usize) -> SparseIntervalMatrix { . SparseIntervalMatrix { rows: IndexVec::new(), column_size } . } . . pub fn rows(&self) -> impl Iterator { 4,626 ( 0.00%) self.rows.indices() . } . . pub fn row(&self, row: R) -> Option<&IntervalSet> { . self.rows.get(row) . } . . fn ensure_row(&mut self, row: R) -> &mut IntervalSet { 16,823 ( 0.00%) self.rows.ensure_contains_elem(row, || IntervalSet::new(self.column_size)); . &mut self.rows[row] . } . . pub fn union_row(&mut self, row: R, from: &IntervalSet) -> bool . where . C: Step, . { 321,467 ( 0.00%) self.ensure_row(row).union(from) . } . . pub fn union_rows(&mut self, read: R, write: R) -> bool . where . C: Step, . { 229,707 ( 0.00%) if read == write || self.rows.get(read).is_none() { . return false; . } . self.ensure_row(write); 574,265 ( 0.01%) let (read_row, write_row) = self.rows.pick2_mut(read, write); 459,412 ( 0.01%) write_row.union(read_row) . } . . pub fn insert_all_into_row(&mut self, row: R) { 14,079 ( 0.00%) self.ensure_row(row).insert_all(); . } . . pub fn insert_range(&mut self, row: R, range: impl RangeBounds + Clone) { . self.ensure_row(row).insert_range(range); . } . . pub fn insert(&mut self, row: R, point: C) -> bool { . self.ensure_row(row).insert(point) -- line 263 ---------------------------------------- 3,300,826 ( 0.05%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/sharded.rs -------------------------------------------------------------------------------- Ir -- line 31 ---------------------------------------- . fn default() -> Self { . Self::new(T::default) . } . } . . impl Sharded { . #[inline] . pub fn new(mut value: impl FnMut() -> T) -> Self { 2 ( 0.00%) Sharded { shards: [(); SHARDS].map(|()| CacheAligned(Lock::new(value()))) } . } . . /// The shard is selected by hashing `val` with `FxHasher`. . #[inline] . pub fn get_shard_by_value(&self, val: &K) -> &Lock { . if SHARDS == 1 { &self.shards[0].0 } else { self.get_shard_by_hash(make_hash(val)) } . } . . #[inline] . pub fn get_shard_by_hash(&self, hash: u64) -> &Lock { . &self.shards[get_shard_index_by_hash(hash)].0 . } . . #[inline] . pub fn get_shard_by_index(&self, i: usize) -> &Lock { 369,424 ( 0.01%) &self.shards[i].0 . } . . pub fn lock_shards(&self) -> Vec> { . (0..SHARDS).map(|i| self.shards[i].0.lock()).collect() . } . . pub fn try_lock_shards(&self) -> Option>> { . (0..SHARDS).map(|i| self.shards[i].0.try_lock()).collect() -- line 63 ---------------------------------------- -- line 79 ---------------------------------------- . K: Borrow, . Q: Hash + Eq, . { . let hash = make_hash(value); . let mut shard = self.get_shard_by_hash(hash).lock(); . let entry = shard.raw_entry_mut().from_key_hashed_nocheck(hash, value); . . match entry { 883,424 ( 0.01%) RawEntryMut::Occupied(e) => *e.key(), . RawEntryMut::Vacant(e) => { . let v = make(); . e.insert_hashed_nocheck(hash, v, ()); . v . } . } . } . -- line 95 ---------------------------------------- -- line 99 ---------------------------------------- . K: Borrow, . Q: Hash + Eq, . { . let hash = make_hash(&value); . let mut shard = self.get_shard_by_hash(hash).lock(); . let entry = shard.raw_entry_mut().from_key_hashed_nocheck(hash, &value); . . match entry { 1,661,391 ( 0.02%) RawEntryMut::Occupied(e) => *e.key(), . RawEntryMut::Vacant(e) => { 1,420,124 ( 0.02%) let v = make(value); . e.insert_hashed_nocheck(hash, v, ()); . v . } . } 193 ( 0.00%) } . } . . pub trait IntoPointer { . /// Returns a pointer which outlives `self`. . fn into_pointer(&self) -> *const (); . } . . impl ShardedHashMap { -- line 122 ---------------------------------------- -- line 125 ---------------------------------------- . let shard = self.get_shard_by_hash(hash).lock(); . let value = value.into_pointer(); . shard.raw_entry().from_hash(hash, |entry| entry.into_pointer() == value).is_some() . } . } . . #[inline] . fn make_hash(val: &K) -> u64 { 5,776,164 ( 0.08%) let mut state = FxHasher::default(); 1,548,125 ( 0.02%) val.hash(&mut state); . state.finish() . } . . /// Get a shard with a pre-computed hash value. If `get_shard_by_value` is . /// ever used in combination with `get_shard_by_hash` on a single `Sharded` . /// instance, then `hash` must be computed with `FxHasher`. Otherwise, . /// `hash` can be computed with any hasher, so long as that hasher is used . /// consistently for each `Sharded` instance. -- line 142 ---------------------------------------- 2,644,690 ( 0.04%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/bitmask.rs -------------------------------------------------------------------------------- Ir -- line 17 ---------------------------------------- . pub struct BitMask(pub BitMaskWord); . . #[allow(clippy::use_self)] . impl BitMask { . /// Returns a new `BitMask` with all bits inverted. . #[inline] . #[must_use] . pub fn invert(self) -> Self { 354,925 ( 0.01%) BitMask(self.0 ^ BITMASK_MASK) . } . . /// Flip the bit in the mask for the entry at the given index. . /// . /// Returns the bit's previous state. . #[inline] . #[allow(clippy::cast_ptr_alignment)] . #[cfg(feature = "raw")] -- line 33 ---------------------------------------- -- line 38 ---------------------------------------- . // The bit was set if the bit is now 0. . self.0 & mask == 0 . } . . /// Returns a new `BitMask` with the lowest bit removed. . #[inline] . #[must_use] . pub fn remove_lowest_bit(self) -> Self { 354,680 ( 0.01%) BitMask(self.0 & (self.0 - 1)) . } . /// Returns whether the `BitMask` has at least one set bit. . #[inline] . pub fn any_bit_set(self) -> bool { 4,726,031 ( 0.07%) self.0 != 0 . } . . /// Returns the first set bit in the `BitMask`, if there is one. . #[inline] . pub fn lowest_set_bit(self) -> Option { 56,528,512 ( 0.82%) if self.0 == 0 { . None . } else { . Some(unsafe { self.lowest_set_bit_nonzero() }) . } . } . . /// Returns the first set bit in the `BitMask`, if there is one. The . /// bitmask must not be empty. . #[inline] . #[cfg(feature = "nightly")] . pub unsafe fn lowest_set_bit_nonzero(self) -> usize { 94,046 ( 0.00%) intrinsics::cttz_nonzero(self.0) as usize / BITMASK_STRIDE . } . #[inline] . #[cfg(not(feature = "nightly"))] . pub unsafe fn lowest_set_bit_nonzero(self) -> usize { . self.trailing_zeros() . } . . /// Returns the number of trailing zeroes in the `BitMask`. -- line 77 ---------------------------------------- -- line 110 ---------------------------------------- . /// bits. . pub struct BitMaskIter(BitMask); . . impl Iterator for BitMaskIter { . type Item = usize; . . #[inline] . fn next(&mut self) -> Option { 11,713,172 ( 0.17%) let bit = self.0.lowest_set_bit()?; . self.0 = self.0.remove_lowest_bit(); . Some(bit) . } . } 279,021 ( 0.00%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/option.rs -------------------------------------------------------------------------------- Ir -- line 504 ---------------------------------------- . use crate::panicking::{panic, panic_str}; . use crate::pin::Pin; . use crate::{ . convert, hint, mem, . ops::{self, ControlFlow, Deref, DerefMut}, . }; . . /// The `Option` type. See [the module level documentation](self) for more. 4,776,346 ( 0.07%) #[derive(Copy, PartialEq, PartialOrd, Eq, Ord, Debug, Hash)] . #[rustc_diagnostic_item = "Option"] . #[stable(feature = "rust1", since = "1.0.0")] . pub enum Option { . /// No value. . #[lang = "None"] . #[stable(feature = "rust1", since = "1.0.0")] . None, . /// Some value of type `T`. . #[lang = "Some"] . #[stable(feature = "rust1", since = "1.0.0")] 15,051 ( 0.00%) Some(#[stable(feature = "rust1", since = "1.0.0")] T), . } . . ///////////////////////////////////////////////////////////////////////////// . // Type implementation . ///////////////////////////////////////////////////////////////////////////// . . impl Option { . ///////////////////////////////////////////////////////////////////////// -- line 531 ---------------------------------------- -- line 543 ---------------------------------------- . /// let x: Option = None; . /// assert_eq!(x.is_some(), false); . /// ``` . #[must_use = "if you intended to assert that this has a value, consider `.unwrap()` instead"] . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_stable(feature = "const_option", since = "1.48.0")] . pub const fn is_some(&self) -> bool { 6,582,830 ( 0.10%) matches!(*self, Some(_)) . } . . /// Returns `true` if the option is a [`Some`] wrapping a value matching the predicate. . /// . /// # Examples . /// . /// ``` . /// #![feature(is_some_with)] -- line 559 ---------------------------------------- -- line 616 ---------------------------------------- . /// // then consume *that* with `map`, leaving `text` on the stack. . /// let text_length: Option = text.as_ref().map(|s| s.len()); . /// println!("still can print text: {:?}", text); . /// ``` . #[inline] . #[rustc_const_stable(feature = "const_option", since = "1.48.0")] . #[stable(feature = "rust1", since = "1.0.0")] . pub const fn as_ref(&self) -> Option<&T> { 12,196,473 ( 0.18%) match *self { . Some(ref x) => Some(x), . None => None, . } . } . . /// Converts from `&mut Option` to `Option<&mut T>`. . /// . /// # Examples -- line 632 ---------------------------------------- -- line 638 ---------------------------------------- . /// None => {}, . /// } . /// assert_eq!(x, Some(42)); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_option", issue = "67441")] . pub const fn as_mut(&mut self) -> Option<&mut T> { 3,068,254 ( 0.04%) match *self { . Some(ref mut x) => Some(x), . None => None, . } . } . . /// Converts from [Pin]<[&]Option\> to Option<[Pin]<[&]T>>. . /// . /// [&]: reference "shared reference" -- line 654 ---------------------------------------- -- line 705 ---------------------------------------- . /// let x: Option<&str> = None; . /// x.expect("fruits are healthy"); // panics with `fruits are healthy` . /// ``` . #[inline] . #[track_caller] . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_option", issue = "67441")] . pub const fn expect(self, msg: &str) -> T { 3,017,761 ( 0.04%) match self { 1,460,526 ( 0.02%) Some(val) => val, . None => expect_failed(msg), . } . } . . /// Returns the contained [`Some`] value, consuming the `self` value. . /// . /// Because this function may panic, its use is generally discouraged. . /// Instead, prefer to use pattern matching and handle the [`None`] -- line 722 ---------------------------------------- -- line 742 ---------------------------------------- . /// let x: Option<&str> = None; . /// assert_eq!(x.unwrap(), "air"); // fails . /// ``` . #[inline] . #[track_caller] . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_option", issue = "67441")] . pub const fn unwrap(self) -> T { 6,440,962 ( 0.09%) match self { 1,995,830 ( 0.03%) Some(val) => val, . None => panic("called `Option::unwrap()` on a `None` value"), . } . } . . /// Returns the contained [`Some`] value or a provided default. . /// . /// Arguments passed to `unwrap_or` are eagerly evaluated; if you are passing . /// the result of a function call, it is recommended to use [`unwrap_or_else`], -- line 759 ---------------------------------------- -- line 769 ---------------------------------------- . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_option_ext", issue = "91930")] . pub const fn unwrap_or(self, default: T) -> T . where . T: ~const Drop, . { 3,925,518 ( 0.06%) match self { 16 ( 0.00%) Some(x) => x, 57,468 ( 0.00%) None => default, . } 3,255 ( 0.00%) } . . /// Returns the contained [`Some`] value or computes it from a closure. . /// . /// # Examples . /// . /// ``` . /// let k = 10; . /// assert_eq!(Some(4).unwrap_or_else(|| 2 * k), 4); . /// assert_eq!(None.unwrap_or_else(|| 2 * k), 20); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_option_ext", issue = "91930")] 681 ( 0.00%) pub const fn unwrap_or_else(self, f: F) -> T . where . F: ~const FnOnce() -> T, . F: ~const Drop, . { 2,453,375 ( 0.04%) match self { 179,616 ( 0.00%) Some(x) => x, 34,214 ( 0.00%) None => f(), . } 1,335 ( 0.00%) } . . /// Returns the contained [`Some`] value or a default. . /// . /// Consumes the `self` argument then, if [`Some`], returns the contained . /// value, otherwise if [`None`], returns the [default value] for that . /// type. . /// . /// # Examples -- line 812 ---------------------------------------- -- line 831 ---------------------------------------- . /// [`FromStr`]: crate::str::FromStr . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_option_ext", issue = "91930")] . pub const fn unwrap_or_default(self) -> T . where . T: ~const Default, . { 17,432 ( 0.00%) match self { 13,464 ( 0.00%) Some(x) => x, . None => Default::default(), . } . } . . /// Returns the contained [`Some`] value, consuming the `self` value, . /// without checking that the value is not [`None`]. . /// . /// # Safety -- line 848 ---------------------------------------- -- line 892 ---------------------------------------- . /// // `Option::map` takes self *by value*, consuming `maybe_some_string` . /// let maybe_some_len = maybe_some_string.map(|s| s.len()); . /// . /// assert_eq!(maybe_some_len, Some(13)); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_option_ext", issue = "91930")] 7,518 ( 0.00%) pub const fn map(self, f: F) -> Option . where . F: ~const FnOnce(T) -> U, . F: ~const Drop, . { 10,558,700 ( 0.15%) match self { 27,514,578 ( 0.40%) Some(x) => Some(f(x)), 416,044 ( 0.01%) None => None, . } 177,363 ( 0.00%) } . . /// Calls the provided closure with a reference to the contained value (if [`Some`]). . /// . /// # Examples . /// . /// ``` . /// #![feature(result_option_inspect)] . /// -- line 917 ---------------------------------------- -- line 960 ---------------------------------------- . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_option_ext", issue = "91930")] . pub const fn map_or(self, default: U, f: F) -> U . where . F: ~const FnOnce(T) -> U, . F: ~const Drop, . U: ~const Drop, . { 2,625,980 ( 0.04%) match self { 87,308 ( 0.00%) Some(t) => f(t), 69,002 ( 0.00%) None => default, . } . } . . /// Computes a default function result (if none), or . /// applies a different function to the contained value (if any). . /// . /// # Examples . /// -- line 978 ---------------------------------------- -- line 990 ---------------------------------------- . #[rustc_const_unstable(feature = "const_option_ext", issue = "91930")] . pub const fn map_or_else(self, default: D, f: F) -> U . where . D: ~const FnOnce() -> U, . D: ~const Drop, . F: ~const FnOnce(T) -> U, . F: ~const Drop, . { 82,716 ( 0.00%) match self { 2,436 ( 0.00%) Some(t) => f(t), . None => default(), . } . } . . /// Transforms the `Option` into a [`Result`], mapping [`Some(v)`] to . /// [`Ok(v)`] and [`None`] to [`Err(err)`]. . /// . /// Arguments passed to `ok_or` are eagerly evaluated; if you are passing the -- line 1007 ---------------------------------------- -- line 1024 ---------------------------------------- . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_option_ext", issue = "91930")] . pub const fn ok_or(self, err: E) -> Result . where . E: ~const Drop, . { 1,067,328 ( 0.02%) match self { 6,014 ( 0.00%) Some(v) => Ok(v), 3,004 ( 0.00%) None => Err(err), . } . } . . /// Transforms the `Option` into a [`Result`], mapping [`Some(v)`] to . /// [`Ok(v)`] and [`None`] to [`Err(err())`]. . /// . /// [`Ok(v)`]: Ok . /// [`Err(err())`]: Err -- line 1042 ---------------------------------------- -- line 1054 ---------------------------------------- . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_option_ext", issue = "91930")] . pub const fn ok_or_else(self, err: F) -> Result . where . F: ~const FnOnce() -> E, . F: ~const Drop, . { 219,551 ( 0.00%) match self { 221,860 ( 0.00%) Some(v) => Ok(v), 73,652 ( 0.00%) None => Err(err()), . } . } . . /// Converts from `Option` (or `&Option`) to `Option<&T::Target>`. . /// . /// Leaves the original Option in-place, creating a new one with a reference . /// to the original one, additionally coercing the contents via [`Deref`]. . /// -- line 1072 ---------------------------------------- -- line 1080 ---------------------------------------- . /// assert_eq!(x.as_deref(), None); . /// ``` . #[stable(feature = "option_deref", since = "1.40.0")] . #[rustc_const_unstable(feature = "const_option_ext", issue = "91930")] . pub const fn as_deref(&self) -> Option<&T::Target> . where . T: ~const Deref, . { 88,560 ( 0.00%) match self.as_ref() { . Some(t) => Some(t.deref()), . None => None, . } . } . . /// Converts from `Option` (or `&mut Option`) to `Option<&mut T::Target>`. . /// . /// Leaves the original `Option` in-place, creating a new one containing a mutable reference to -- line 1096 ---------------------------------------- -- line 1213 ---------------------------------------- . /// assert_eq!(Some(2).and_then(sq).and_then(sq), Some(16)); . /// assert_eq!(Some(2).and_then(sq).and_then(nope), None); . /// assert_eq!(Some(2).and_then(nope).and_then(sq), None); . /// assert_eq!(None.and_then(sq).and_then(sq), None); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_option_ext", issue = "91930")] 5,009 ( 0.00%) pub const fn and_then(self, f: F) -> Option . where . F: ~const FnOnce(T) -> Option, . F: ~const Drop, . { 350,269 ( 0.01%) match self { 59,167 ( 0.00%) Some(x) => f(x), . None => None, . } 152,167 ( 0.00%) } . . /// Returns [`None`] if the option is [`None`], otherwise calls `predicate` . /// with the wrapped value and returns: . /// . /// - [`Some(t)`] if `predicate` returns `true` (where `t` is the wrapped . /// value), and . /// - [`None`] if `predicate` returns `false`. . /// -- line 1238 ---------------------------------------- -- line 1257 ---------------------------------------- . #[stable(feature = "option_filter", since = "1.27.0")] . #[rustc_const_unstable(feature = "const_option_ext", issue = "91930")] . pub const fn filter

(self, predicate: P) -> Self . where . T: ~const Drop, . P: ~const FnOnce(&T) -> bool, . P: ~const Drop, . { 12,640 ( 0.00%) if let Some(x) = self { 24,728 ( 0.00%) if predicate(&x) { . return Some(x); . } . } . None 21 ( 0.00%) } . . /// Returns the option if it contains a value, otherwise returns `optb`. . /// . /// Arguments passed to `or` are eagerly evaluated; if you are passing the . /// result of a function call, it is recommended to use [`or_else`], which is . /// lazily evaluated. . /// . /// [`or_else`]: Option::or_else -- line 1279 ---------------------------------------- -- line 1299 ---------------------------------------- . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_option_ext", issue = "91930")] . pub const fn or(self, optb: Option) -> Option . where . T: ~const Drop, . { 37,399 ( 0.00%) match self { 3,325 ( 0.00%) Some(x) => Some(x), . None => optb, . } . } . . /// Returns the option if it contains a value, otherwise calls `f` and . /// returns the result. . /// . /// # Examples -- line 1316 ---------------------------------------- -- line 1326 ---------------------------------------- . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_option_ext", issue = "91930")] . pub const fn or_else(self, f: F) -> Option . where . F: ~const FnOnce() -> Option, . F: ~const Drop, . { 163,315 ( 0.00%) match self { 77,446 ( 0.00%) Some(x) => Some(x), . None => f(), . } . } . . /// Returns [`Some`] if exactly one of `self`, `optb` is [`Some`], otherwise returns [`None`]. . /// . /// # Examples . /// -- line 1343 ---------------------------------------- -- line 1431 ---------------------------------------- . /// ``` . #[inline] . #[stable(feature = "option_entry", since = "1.20.0")] . #[rustc_const_unstable(feature = "const_option_ext", issue = "91930")] . pub const fn get_or_insert(&mut self, value: T) -> &mut T . where . T: ~const Drop, . { 269,952 ( 0.00%) if let None = *self { 629,432 ( 0.01%) *self = Some(value); . } . . // SAFETY: a `None` variant for `self` would have been replaced by a `Some` . // variant in the code above. . unsafe { self.as_mut().unwrap_unchecked() } . } . . /// Inserts the default value into the option if it is [`None`], then -- line 1448 ---------------------------------------- -- line 1499 ---------------------------------------- . #[inline] . #[stable(feature = "option_entry", since = "1.20.0")] . #[rustc_const_unstable(feature = "const_option_ext", issue = "91930")] . pub const fn get_or_insert_with(&mut self, f: F) -> &mut T . where . F: ~const FnOnce() -> T, . F: ~const Drop, . { 1,248,678 ( 0.02%) if let None = *self { . // the compiler isn't smart enough to know that we are not dropping a `T` . // here and wants us to ensure `T` can be dropped at compile time. 48 ( 0.00%) mem::forget(mem::replace(self, Some(f()))) . } . . // SAFETY: a `None` variant for `self` would have been replaced by a `Some` . // variant in the code above. . unsafe { self.as_mut().unwrap_unchecked() } . } . . ///////////////////////////////////////////////////////////////////////// -- line 1518 ---------------------------------------- -- line 1558 ---------------------------------------- . /// let old = x.replace(3); . /// assert_eq!(x, Some(3)); . /// assert_eq!(old, None); . /// ``` . #[inline] . #[rustc_const_unstable(feature = "const_option", issue = "67441")] . #[stable(feature = "option_replace", since = "1.31.0")] . pub const fn replace(&mut self, value: T) -> Option { 5,968 ( 0.00%) mem::replace(self, Some(value)) . } . . /// Returns `true` if the option is a [`Some`] value containing the given value. . /// . /// # Examples . /// . /// ``` . /// #![feature(option_result_contains)] -- line 1574 ---------------------------------------- -- line 1712 ---------------------------------------- . #[stable(feature = "copied", since = "1.35.0")] . #[rustc_const_unstable(feature = "const_option", issue = "67441")] . pub const fn copied(self) -> Option . where . T: Copy, . { . // FIXME: this implementation, which sidesteps using `Option::map` since it's not const . // ready yet, should be reverted when possible to avoid code repetition 180,530 ( 0.00%) match self { 1,749,542 ( 0.03%) Some(&v) => Some(v), 17,042 ( 0.00%) None => None, . } 124 ( 0.00%) } . . /// Maps an `Option<&T>` to an `Option` by cloning the contents of the . /// option. . /// . /// # Examples . /// . /// ``` . /// let x = 12; -- line 1732 ---------------------------------------- -- line 1733 ---------------------------------------- . /// let opt_x = Some(&x); . /// assert_eq!(opt_x, Some(&12)); . /// let cloned = opt_x.cloned(); . /// assert_eq!(cloned, Some(12)); . /// ``` . #[must_use = "`self` will be dropped if the result is not used"] . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_option_cloned", issue = "91582")] 70,179 ( 0.00%) pub const fn cloned(self) -> Option . where . T: ~const Clone, . { 513,042 ( 0.01%) match self { 1,273,578 ( 0.02%) Some(t) => Some(t.clone()), 56,698 ( 0.00%) None => None, . } 209,983 ( 0.00%) } . } . . impl Option<&mut T> { . /// Maps an `Option<&mut T>` to an `Option` by copying the contents of the . /// option. . /// . /// # Examples . /// -- line 1757 ---------------------------------------- -- line 1843 ---------------------------------------- . ///////////////////////////////////////////////////////////////////////////// . // Trait implementations . ///////////////////////////////////////////////////////////////////////////// . . #[stable(feature = "rust1", since = "1.0.0")] . impl Clone for Option { . #[inline] . fn clone(&self) -> Self { 6,438,045 ( 0.09%) match self { 164,834 ( 0.00%) Some(x) => Some(x.clone()), 17,725 ( 0.00%) None => None, . } 2,073,319 ( 0.03%) } . . #[inline] . fn clone_from(&mut self, source: &Self) { . match (self, source) { . (Some(to), Some(from)) => to.clone_from(from), . (to, from) => *to = from.clone(), . } . } -- line 1863 ---------------------------------------- -- line 1895 ---------------------------------------- . /// assert_eq!(v, ["string"]); . /// . /// let x = None; . /// let v: Vec<&str> = x.into_iter().collect(); . /// assert!(v.is_empty()); . /// ``` . #[inline] . fn into_iter(self) -> IntoIter { 933 ( 0.00%) IntoIter { inner: Item { opt: self } } . } . } . . #[stable(since = "1.4.0", feature = "option_iter")] . impl<'a, T> IntoIterator for &'a Option { . type Item = &'a T; . type IntoIter = Iter<'a, T>; . -- line 1911 ---------------------------------------- -- line 2006 ---------------------------------------- . . #[inline] . fn next(&mut self) -> Option { . self.opt.take() . } . . #[inline] . fn size_hint(&self) -> (usize, Option) { 95,833 ( 0.00%) match self.opt { . Some(_) => (1, Some(1)), . None => (0, Some(0)), . } . } . } . . impl DoubleEndedIterator for Item { . #[inline] -- line 2022 ---------------------------------------- -- line 2136 ---------------------------------------- . type Item = A; . . #[inline] . fn next(&mut self) -> Option { . self.inner.next() . } . #[inline] . fn size_hint(&self) -> (usize, Option) { 111 ( 0.00%) self.inner.size_hint() . } . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl DoubleEndedIterator for IntoIter { . #[inline] . fn next_back(&mut self) -> Option { . self.inner.next_back() -- line 2152 ---------------------------------------- -- line 2241 ---------------------------------------- . #[rustc_const_unstable(feature = "const_convert", issue = "88674")] . impl const ops::Try for Option { . type Output = T; . type Residual = Option; . . #[inline] . fn from_output(output: Self::Output) -> Self { . Some(output) 7,460 ( 0.00%) } . . #[inline] . fn branch(self) -> ControlFlow { 1,770,653 ( 0.03%) match self { 152,488 ( 0.00%) Some(v) => ControlFlow::Continue(v), . None => ControlFlow::Break(None), . } . } . } . . #[unstable(feature = "try_trait_v2", issue = "84277")] . #[rustc_const_unstable(feature = "const_convert", issue = "88674")] . impl const ops::FromResidual for Option { . #[inline] . fn from_residual(residual: Option) -> Self { . match residual { 235,324 ( 0.00%) None => None, . } . } . } . . #[unstable(feature = "try_trait_v2_residual", issue = "91285")] . impl ops::Residual for Option { . type TryType = Option; . } -- line 2274 ---------------------------------------- -- line 2297 ---------------------------------------- . /// let x: Option>> = Some(Some(Some(6))); . /// assert_eq!(Some(Some(6)), x.flatten()); . /// assert_eq!(Some(6), x.flatten().flatten()); . /// ``` . #[inline] . #[stable(feature = "option_flattening", since = "1.40.0")] . #[rustc_const_unstable(feature = "const_option", issue = "67441")] . pub const fn flatten(self) -> Option { 46 ( 0.00%) match self { 253 ( 0.00%) Some(inner) => inner, 12 ( 0.00%) None => None, . } . } . } 11,255,443 ( 0.16%) -------------------------------------------------------------------------------- -- 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 { . pub(crate) hash_builder: S, . pub(crate) table: RawTable<(K, V), A>, . } . . impl Clone for HashMap { 2,000 ( 0.00%) fn clone(&self) -> Self { 25,899 ( 0.00%) HashMap { . hash_builder: self.hash_builder.clone(), 5,598 ( 0.00%) table: self.table.clone(), . } 2,250 ( 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(hash_builder: &S) -> impl Fn(&(Q, V)) -> u64 + '_ . where . K: Borrow, . Q: Hash, . S: BuildHasher, . { 446,202 ( 0.01%) move |val| make_hash::(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(k: &Q) -> impl Fn(&(K, V)) -> bool + '_ . where . K: Borrow, . Q: ?Sized + Eq, . { 1,395,119 ( 0.02%) 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(k: &Q) -> impl Fn(&K) -> bool + '_ . where . K: Borrow, . Q: ?Sized + Eq, . { 1,635,471 ( 0.02%) move |x| k.eq(x.borrow()) . } . . #[cfg(not(feature = "nightly"))] . #[cfg_attr(feature = "inline-more", inline)] . pub(crate) fn make_hash(hash_builder: &S, val: &Q) -> u64 . where . K: Borrow, . 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(hash_builder: &S, val: &Q) -> u64 . where . K: Borrow, . 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(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 { 849,514 ( 0.01%) 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 { 352 ( 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 { 65,707 ( 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 { 360,865 ( 0.01%) 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)] 3,336 ( 0.00%) pub fn entry(&mut self, key: K) -> Entry<'_, K, V, S, A> { . let hash = make_insert_hash::(&self.hash_builder, &key); . if let Some(elem) = self.table.find(hash, equivalent_key(&key)) { 1,205 ( 0.00%) Entry::Occupied(OccupiedEntry { . hash, . key: Some(key), . elem, . table: self, . }) . } else { 2,965 ( 0.00%) Entry::Vacant(VacantEntry { . hash, . key, . table: self, . }) . } 4,170 ( 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(&self, k: &Q) -> Option<&V> . where . K: Borrow, . Q: Hash + Eq, . { . // Avoid `Option::map` because it bloats LLVM IR. 3,370,890 ( 0.05%) 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(&self, k: &Q) -> Option<&(K, V)> . where . K: Borrow, . Q: Hash + Eq, . { 3,609,681 ( 0.05%) if self.table.is_empty() { . None . } else { 1 ( 0.00%) let hash = make_hash::(&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)] 1,358,176 ( 0.02%) pub fn contains_key(&self, k: &Q) -> bool . where . K: Borrow, . Q: Hash + Eq, . { . self.get_inner(k).is_some() 1,682,244 ( 0.02%) } . . /// 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)] 1,417 ( 0.00%) pub fn get_mut(&mut self, k: &Q) -> Option<&mut V> . where . K: Borrow, . Q: Hash + Eq, . { . // Avoid `Option::map` because it bloats LLVM IR. 4,317 ( 0.00%) match self.get_inner_mut(k) { . Some(&mut (_, ref mut v)) => Some(v), . None => None, . } 2,834 ( 0.00%) } . . #[inline] . fn get_inner_mut(&mut self, k: &Q) -> Option<&mut (K, V)> . where . K: Borrow, . Q: Hash + Eq, . { 1,440 ( 0.00%) if self.table.is_empty() { . None . } else { . let hash = make_hash::(&self.hash_builder, k); 88 ( 0.00%) self.table.get_mut(hash, equivalent_key(k)) . } . } . . /// Attempts to get mutable references to `N` values in the map at once. . /// . /// Returns an array of length `N` with the results of each query. For soundness, at most one . /// mutable reference will be returned to any value. `None` will be returned if any of the . /// keys are duplicates or missing. -- line 1223 ---------------------------------------- -- 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)] 9,131,287 ( 0.13%) pub fn insert(&mut self, k: K, v: V) -> Option { . let hash = make_insert_hash::(&self.hash_builder, &k); 1,556 ( 0.00%) if let Some((_, item)) = self.table.get_mut(hash, equivalent_key(&k)) { 124 ( 0.00%) Some(mem::replace(item, v)) . } else { 4,112,354 ( 0.06%) self.table 3,460,492 ( 0.05%) .insert(hash, (k, v), make_hasher::(&self.hash_builder)); 392,429 ( 0.01%) None . } 8,584,303 ( 0.12%) } . . /// 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)] 291,860 ( 0.00%) pub fn remove(&mut self, k: &Q) -> Option . where . K: Borrow, . Q: Hash + Eq, . { . // Avoid `Option::map` because it bloats LLVM IR. 1,738,656 ( 0.03%) match self.remove_entry(k) { 163,793 ( 0.00%) Some((_, v)) => Some(v), 224,776 ( 0.00%) None => None, . } 686,882 ( 0.01%) } . . /// 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(&mut self, k: &Q) -> Option<(K, V)> . where . K: Borrow, . Q: Hash + Eq, . { . let hash = make_hash::(&self.hash_builder, k); 781,294 ( 0.01%) self.table.remove_entry(hash, equivalent_key(k)) . } . } . . impl HashMap { . /// 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 2069 ---------------------------------------- . where . F: FnMut(&K, &mut V) -> bool, . A: Allocator + Clone, . { . type Item = (K, V); . . #[cfg_attr(feature = "inline-more", inline)] . fn next(&mut self) -> Option { 9 ( 0.00%) self.inner.next(&mut self.f) . } . . #[inline] . fn size_hint(&self) -> (usize, Option) { . (0, self.inner.iter.size_hint().1) . } . } . -- line 2085 ---------------------------------------- -- line 2095 ---------------------------------------- . #[cfg_attr(feature = "inline-more", inline)] . pub(super) fn next(&mut self, f: &mut F) -> Option<(K, V)> . where . F: FnMut(&K, &mut V) -> bool, . { . unsafe { . for item in &mut self.iter { . let &mut (ref key, ref mut value) = item.as_mut(); 30 ( 0.00%) if f(key, value) { 3 ( 0.00%) return Some(self.table.remove(item)); . } . } . } . None . } . } . . /// A mutable iterator over the values of a `HashMap`. -- line 2112 ---------------------------------------- -- line 2209 ---------------------------------------- . /// Creates a `RawEntryMut` from the given key and its hash. . #[inline] . #[allow(clippy::wrong_self_convention)] . pub fn from_key_hashed_nocheck(self, hash: u64, k: &Q) -> RawEntryMut<'a, K, V, S, A> . where . K: Borrow, . Q: Eq, . { 7,941,520 ( 0.12%) 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)] 21,446,811 ( 0.31%) pub fn from_hash(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) 22,812,983 ( 0.33%) } . . #[cfg_attr(feature = "inline-more", inline)] . fn search(self, hash: u64, mut is_match: F) -> RawEntryMut<'a, K, V, S, A> . where . for<'b> F: FnMut(&'b K) -> bool, . { 2,470,738 ( 0.04%) match self.map.table.find(hash, |(k, _)| is_match(k)) { 13,002,359 ( 0.19%) Some(elem) => RawEntryMut::Occupied(RawOccupiedEntryMut { . elem, . table: &mut self.map.table, . hash_builder: &self.map.hash_builder, . }), 1,374,114 ( 0.02%) 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::(&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)] 4,501,243 ( 0.07%) pub fn from_key_hashed_nocheck(self, hash: u64, k: &Q) -> Option<(&'a K, &'a V)> . where . K: Borrow, . Q: Eq, . { 5,229,238 ( 0.08%) self.from_hash(hash, equivalent(k)) 8,111,617 ( 0.12%) } . . #[cfg_attr(feature = "inline-more", inline)] . fn search(self, hash: u64, mut is_match: F) -> Option<(&'a K, &'a V)> . where . F: FnMut(&K) -> bool, . { 8,214,733 ( 0.12%) 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, . { 2,278,500 ( 0.03%) let &mut (ref mut k, ref mut v) = self.table.insert_entry( . hash, . (key, value), . make_hasher::(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)] 4,152 ( 0.00%) fn into_iter(self) -> IntoIter { 83,672 ( 0.00%) IntoIter { 42,368 ( 0.00%) inner: self.table.into_iter(), . } 12,456 ( 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. 501,529 ( 0.01%) match self.inner.next() { . Some(x) => unsafe { . let r = x.as_ref(); 4,027 ( 0.00%) Some((&r.0, &r.1)) . }, . None => None, . } . } . #[cfg_attr(feature = "inline-more", inline)] . fn size_hint(&self) -> (usize, Option) { 26 ( 0.00%) self.inner.size_hint() . } . } . impl ExactSizeIterator for Iter<'_, K, V> { . #[cfg_attr(feature = "inline-more", inline)] . fn len(&self) -> usize { . self.inner.len() . } . } -- line 3013 ---------------------------------------- -- line 3018 ---------------------------------------- . type Item = (&'a K, &'a mut V); . . #[cfg_attr(feature = "inline-more", inline)] . fn next(&mut self) -> Option<(&'a K, &'a mut V)> { . // Avoid `Option::map` because it bloats LLVM IR. . match self.inner.next() { . Some(x) => unsafe { . let r = x.as_mut(); 8 ( 0.00%) Some((&r.0, &mut r.1)) . }, . None => None, . } . } . #[cfg_attr(feature = "inline-more", inline)] . fn size_hint(&self) -> (usize, Option) { . self.inner.size_hint() . } -- line 3034 ---------------------------------------- -- line 3051 ---------------------------------------- . } . } . . impl Iterator for IntoIter { . type Item = (K, V); . . #[cfg_attr(feature = "inline-more", inline)] . fn next(&mut self) -> Option<(K, V)> { 2,864 ( 0.00%) self.inner.next() . } . #[cfg_attr(feature = "inline-more", inline)] . fn size_hint(&self) -> (usize, Option) { . self.inner.size_hint() . } . } . impl ExactSizeIterator for IntoIter { . #[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)] 653 ( 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, . } 1,306 ( 0.00%) } . #[cfg_attr(feature = "inline-more", inline)] . fn size_hint(&self) -> (usize, Option) { . self.inner.size_hint() . } . } . impl 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; 350 ( 0.00%) let entry = table.insert_entry( . self.hash, . (self.key, value), . make_hasher::(&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 Extend<(K, V)> for HashMap . where . K: Eq + Hash, . S: BuildHasher, . A: Allocator + Clone, . { . #[cfg_attr(feature = "inline-more", inline)] 112,233 ( 0.00%) fn extend>(&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. 89,078 ( 0.00%) let iter = iter.into_iter(); 79,110 ( 0.00%) let reserve = if self.is_empty() { . iter.size_hint().0 . } else { 5,055 ( 0.00%) (iter.size_hint().0 + 1) / 2 . }; . self.reserve(reserve); . iter.for_each(move |(k, v)| { 314,544 ( 0.00%) self.insert(k, v); . }); 79,412 ( 0.00%) } . . #[inline] . #[cfg(feature = "nightly")] . fn extend_one(&mut self, (k, v): (K, V)) { . self.insert(k, v); . } . . #[inline] -- line 4588 ---------------------------------------- -- line 4604 ---------------------------------------- . impl<'a, K, V, S, A> Extend<(&'a K, &'a V)> for HashMap . where . K: Eq + Hash + Copy, . V: Copy, . S: BuildHasher, . A: Allocator + Clone, . { . #[cfg_attr(feature = "inline-more", inline)] 21 ( 0.00%) fn extend>(&mut self, iter: T) { . self.extend(iter.into_iter().map(|(&key, &value)| (key, value))); 24 ( 0.00%) } . . #[inline] . #[cfg(feature = "nightly")] . fn extend_one(&mut self, (k, v): (&'a K, &'a V)) { . self.insert(*k, *v); . } . . #[inline] -- line 4622 ---------------------------------------- 8,775,027 ( 0.13%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/ops/bit.rs -------------------------------------------------------------------------------- Ir -- line 267 ---------------------------------------- . macro_rules! bitor_impl { . ($($t:ty)*) => ($( . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_ops", issue = "90080")] . impl const BitOr for $t { . type Output = $t; . . #[inline] 45,741 ( 0.00%) fn bitor(self, rhs: $t) -> $t { self | rhs } . } . . forward_ref_binop! { impl const BitOr, bitor for $t, $t } . )*) . } . . bitor_impl! { bool usize u8 u16 u32 u64 u128 isize i8 i16 i32 i64 i128 } . -- line 283 ---------------------------------------- -- line 368 ---------------------------------------- . macro_rules! bitxor_impl { . ($($t:ty)*) => ($( . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_ops", issue = "90080")] . impl const BitXor for $t { . type Output = $t; . . #[inline] 15,580,225 ( 0.23%) fn bitxor(self, other: $t) -> $t { self ^ other } . } . . forward_ref_binop! { impl const BitXor, bitxor for $t, $t } . )*) . } . . bitxor_impl! { bool usize u8 u16 u32 u64 u128 isize i8 i16 i32 i64 i128 } . -- line 384 ---------------------------------------- -- line 468 ---------------------------------------- . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_ops", issue = "90080")] . impl const Shl<$f> for $t { . type Output = $t; . . #[inline] . #[rustc_inherit_overflow_checks] . fn shl(self, other: $f) -> $t { 354 ( 0.00%) self << other . } . } . . forward_ref_binop! { impl const Shl, shl for $t, $f } . }; . } . . macro_rules! shl_impl_all { -- line 484 ---------------------------------------- 3,266,307 ( 0.05%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/hir/map/mod.rs -------------------------------------------------------------------------------- Ir -- line 17 ---------------------------------------- . use rustc_span::hygiene::MacroKind; . use rustc_span::source_map::Spanned; . use rustc_span::symbol::{kw, sym, Ident, Symbol}; . use rustc_span::Span; . use rustc_target::spec::abi::Abi; . use std::collections::VecDeque; . . fn fn_decl<'hir>(node: Node<'hir>) -> Option<&'hir FnDecl<'hir>> { 12,660 ( 0.00%) match node { . Node::Item(Item { kind: ItemKind::Fn(sig, _, _), .. }) . | Node::TraitItem(TraitItem { kind: TraitItemKind::Fn(sig, _), .. }) . | Node::ImplItem(ImplItem { kind: ImplItemKind::Fn(sig, _), .. }) => Some(&sig.decl), . Node::Expr(Expr { kind: ExprKind::Closure(_, fn_decl, ..), .. }) . | Node::ForeignItem(ForeignItem { kind: ForeignItemKind::Fn(fn_decl, ..), .. }) => { . Some(fn_decl) . } . _ => None, . } . } . . pub fn fn_sig<'hir>(node: Node<'hir>) -> Option<&'hir FnSig<'hir>> { 1,527 ( 0.00%) match &node { . Node::Item(Item { kind: ItemKind::Fn(sig, _, _), .. }) . | Node::TraitItem(TraitItem { kind: TraitItemKind::Fn(sig, _), .. }) . | Node::ImplItem(ImplItem { kind: ImplItemKind::Fn(sig, _), .. }) => Some(sig), . _ => None, . } . } . . pub fn associated_body<'hir>(node: Node<'hir>) -> Option { 166,881 ( 0.00%) match node { . Node::Item(Item { . kind: ItemKind::Const(_, body) | ItemKind::Static(.., body) | ItemKind::Fn(.., body), . .. . }) . | Node::TraitItem(TraitItem { . kind: . TraitItemKind::Const(_, Some(body)) | TraitItemKind::Fn(_, TraitFn::Provided(body)), . .. . }) . | Node::ImplItem(ImplItem { . kind: ImplItemKind::Const(_, body) | ImplItemKind::Fn(_, body), . .. . }) 29,543 ( 0.00%) | Node::Expr(Expr { kind: ExprKind::Closure(.., body, _, _), .. }) => Some(*body), . 12,168 ( 0.00%) Node::AnonConst(constant) => Some(constant.body), . . _ => None, . } . } . . fn is_body_owner<'hir>(node: Node<'hir>, hir_id: HirId) -> bool { . match associated_body(node) { . Some(b) => b.hir_id == hir_id, -- line 71 ---------------------------------------- -- line 83 ---------------------------------------- . pub struct ParentHirIterator<'hir> { . current_id: HirId, . map: Map<'hir>, . } . . impl<'hir> Iterator for ParentHirIterator<'hir> { . type Item = (HirId, Node<'hir>); . 20,804 ( 0.00%) fn next(&mut self) -> Option { 3,044 ( 0.00%) if self.current_id == CRATE_HIR_ID { . return None; . } . loop { . // There are nodes that do not have entries, so we need to skip them. . let parent_id = self.map.get_parent_node(self.current_id); . 9,162 ( 0.00%) if parent_id == self.current_id { . self.current_id = CRATE_HIR_ID; . return None; . } . 6,179 ( 0.00%) self.current_id = parent_id; 24,462 ( 0.00%) if let Some(node) = self.map.find(parent_id) { 11,888 ( 0.00%) return Some((parent_id, node)); . } . // If this `HirId` doesn't have an entry, skip it and look for its `parent_id`. . } 26,748 ( 0.00%) } . } . . /// An iterator that walks up the ancestor tree of a given `HirId`. . /// Constructed using `tcx.hir().parent_owner_iter(hir_id)`. . pub struct ParentOwnerIterator<'hir> { . current_id: HirId, . map: Map<'hir>, . } . . impl<'hir> Iterator for ParentOwnerIterator<'hir> { . type Item = (LocalDefId, OwnerNode<'hir>); . 158,202 ( 0.00%) fn next(&mut self) -> Option { 52,734 ( 0.00%) if self.current_id.local_id.index() != 0 { 9,166 ( 0.00%) self.current_id.local_id = ItemLocalId::new(0); 36,664 ( 0.00%) if let Some(node) = self.map.tcx.hir_owner(self.current_id.owner) { . return Some((self.current_id.owner, node.node)); . } . } 8,412 ( 0.00%) if self.current_id == CRATE_HIR_ID { 154 ( 0.00%) return None; . } . loop { . // There are nodes that do not have entries, so we need to skip them. . let parent_id = self.map.def_key(self.current_id.owner).parent; . . let parent_id = parent_id.map_or(CRATE_HIR_ID.owner, |local_def_index| { . let def_id = LocalDefId { local_def_index }; . self.map.local_def_id_to_hir_id(def_id).owner . }); 16,670 ( 0.00%) self.current_id = HirId::make_owner(parent_id); . . // If this `HirId` doesn't have an entry, skip it and look for its `parent_id`. 16,670 ( 0.00%) if let Some(node) = self.map.tcx.hir_owner(self.current_id.owner) { . return Some((self.current_id.owner, node.node)); . } . } 140,624 ( 0.00%) } . } . . impl<'hir> Map<'hir> { 231 ( 0.00%) pub fn krate(&self) -> &'hir Crate<'hir> { 33 ( 0.00%) self.tcx.hir_crate(()) 264 ( 0.00%) } . 7 ( 0.00%) pub fn root_module(&self) -> &'hir Mod<'hir> { 1 ( 0.00%) match self.tcx.hir_owner(CRATE_DEF_ID).map(|o| o.node) { . Some(OwnerNode::Crate(item)) => item, . _ => bug!(), . } 8 ( 0.00%) } . . pub fn items(&self) -> impl Iterator> + 'hir { . let krate = self.krate(); . krate.owners.iter().filter_map(|owner| match owner.as_ref()?.node() { . OwnerNode::Item(item) => Some(item), . _ => None, . }) . } -- line 169 ---------------------------------------- -- line 184 ---------------------------------------- . . #[inline] . pub fn def_path_hash(self, def_id: LocalDefId) -> DefPathHash { . // Accessing the DefPathHash is ok, it is incr. comp. stable. . self.tcx.untracked_resolutions.definitions.def_path_hash(def_id) . } . . #[inline] 266,892 ( 0.00%) pub fn local_def_id(&self, hir_id: HirId) -> LocalDefId { 58,347 ( 0.00%) self.opt_local_def_id(hir_id).unwrap_or_else(|| { . bug!( . "local_def_id: no entry for `{:?}`, which has a map of `{:?}`", . hir_id, . self.find(hir_id) . ) . }) 200,169 ( 0.00%) } . . #[inline] 155,600 ( 0.00%) pub fn opt_local_def_id(&self, hir_id: HirId) -> Option { 45,949 ( 0.00%) if hir_id.local_id == ItemLocalId::new(0) { . Some(hir_id.owner) . } else { 28,060 ( 0.00%) self.tcx . .hir_owner_nodes(hir_id.owner)? . .local_id_to_def_id . .get(&hir_id.local_id) . .copied() . } 175,050 ( 0.00%) } . . #[inline] 144 ( 0.00%) pub fn local_def_id_to_hir_id(&self, def_id: LocalDefId) -> HirId { . // FIXME(#85914) is this access safe for incr. comp.? 11,690 ( 0.00%) self.tcx.untracked_resolutions.definitions.local_def_id_to_hir_id(def_id) 288 ( 0.00%) } . 7 ( 0.00%) pub fn iter_local_def_id(&self) -> impl Iterator + '_ { . // Create a dependency to the crate to be sure we reexcute this when the amount of . // definitions change. 1 ( 0.00%) self.tcx.ensure().hir_crate(()); . self.tcx.untracked_resolutions.definitions.iter_local_def_id() 9 ( 0.00%) } . 30,471 ( 0.00%) pub fn opt_def_kind(&self, local_def_id: LocalDefId) -> Option { . let hir_id = self.local_def_id_to_hir_id(local_def_id); 56,589 ( 0.00%) let def_kind = match self.find(hir_id)? { 5,888 ( 0.00%) Node::Item(item) => match item.kind { . ItemKind::Static(..) => DefKind::Static, . ItemKind::Const(..) => DefKind::Const, . ItemKind::Fn(..) => DefKind::Fn, . ItemKind::Macro(..) => DefKind::Macro(MacroKind::Bang), . ItemKind::Mod(..) => DefKind::Mod, . ItemKind::OpaqueTy(..) => DefKind::OpaqueTy, . ItemKind::TyAlias(..) => DefKind::TyAlias, . ItemKind::Enum(..) => DefKind::Enum, -- line 239 ---------------------------------------- -- line 247 ---------------------------------------- . ItemKind::GlobalAsm(..) => DefKind::GlobalAsm, . ItemKind::Impl { .. } => DefKind::Impl, . }, . Node::ForeignItem(item) => match item.kind { . ForeignItemKind::Fn(..) => DefKind::Fn, . ForeignItemKind::Static(..) => DefKind::Static, . ForeignItemKind::Type => DefKind::ForeignTy, . }, 20 ( 0.00%) Node::TraitItem(item) => match item.kind { . TraitItemKind::Const(..) => DefKind::AssocConst, . TraitItemKind::Fn(..) => DefKind::AssocFn, . TraitItemKind::Type(..) => DefKind::AssocTy, . }, 876 ( 0.00%) Node::ImplItem(item) => match item.kind { . ImplItemKind::Const(..) => DefKind::AssocConst, . ImplItemKind::Fn(..) => DefKind::AssocFn, . ImplItemKind::TyAlias(..) => DefKind::AssocTy, . }, . Node::Variant(_) => DefKind::Variant, . Node::Ctor(variant_data) => { . // FIXME(eddyb) is this even possible, if we have a `Node::Ctor`? 375 ( 0.00%) assert_ne!(variant_data.ctor_hir_id(), None); . 505 ( 0.00%) let ctor_of = match self.find(self.get_parent_node(hir_id)) { . Some(Node::Item(..)) => def::CtorOf::Struct, . Some(Node::Variant(..)) => def::CtorOf::Variant, . _ => unreachable!(), . }; 150 ( 0.00%) DefKind::Ctor(ctor_of, def::CtorKind::from_hir(variant_data)) 300 ( 0.00%) } . Node::AnonConst(_) => { 1,034 ( 0.00%) let inline = match self.find(self.get_parent_node(hir_id)) { . Some(Node::Expr(&Expr { . kind: ExprKind::ConstBlock(ref anon_const), .. . })) if anon_const.hir_id == hir_id => true, . _ => false, . }; . if inline { DefKind::InlineConst } else { DefKind::AnonConst } . } . Node::Field(_) => DefKind::Field, 560 ( 0.00%) Node::Expr(expr) => match expr.kind { . ExprKind::Closure(.., None) => DefKind::Closure, . ExprKind::Closure(.., Some(_)) => DefKind::Generator, . _ => bug!("def_kind: unsupported node: {}", self.node_to_string(hir_id)), . }, 1,266 ( 0.00%) Node::GenericParam(param) => match param.kind { . GenericParamKind::Lifetime { .. } => DefKind::LifetimeParam, . GenericParamKind::Type { .. } => DefKind::TyParam, . GenericParamKind::Const { .. } => DefKind::ConstParam, . }, . Node::Crate(_) => DefKind::Mod, . Node::Stmt(_) . | Node::PathSegment(_) . | Node::Ty(_) -- line 300 ---------------------------------------- -- line 304 ---------------------------------------- . | Node::Binding(_) . | Node::Local(_) . | Node::Param(_) . | Node::Arm(_) . | Node::Lifetime(_) . | Node::Visibility(_) . | Node::Block(_) => return None, . }; 14,236 ( 0.00%) Some(def_kind) 43,530 ( 0.00%) } . . pub fn def_kind(&self, local_def_id: LocalDefId) -> DefKind { . self.opt_def_kind(local_def_id) . .unwrap_or_else(|| bug!("def_kind: unsupported node: {:?}", local_def_id)) . } . 4,506,400 ( 0.07%) pub fn find_parent_node(&self, id: HirId) -> Option { 563,300 ( 0.01%) if id.local_id == ItemLocalId::from_u32(0) { . Some(self.tcx.hir_owner_parent(id.owner)) . } else { 1,109,596 ( 0.02%) let owner = self.tcx.hir_owner_nodes(id.owner)?; 554,798 ( 0.01%) let node = owner.nodes[id.local_id].as_ref()?; 1,664,394 ( 0.02%) let hir_id = HirId { owner: id.owner, local_id: node.parent }; . Some(hir_id) . } 4,506,400 ( 0.07%) } . 12,180 ( 0.00%) pub fn get_parent_node(&self, hir_id: HirId) -> HirId { 3,172,140 ( 0.05%) self.find_parent_node(hir_id).unwrap() 24,360 ( 0.00%) } . . /// Retrieves the `Node` corresponding to `id`, returning `None` if cannot be found. 1,446,880 ( 0.02%) pub fn find(&self, id: HirId) -> Option> { 180,860 ( 0.00%) if id.local_id == ItemLocalId::from_u32(0) { . let owner = self.tcx.hir_owner(id.owner)?; 94,499 ( 0.00%) Some(owner.node.into()) . } else { 170,986 ( 0.00%) let owner = self.tcx.hir_owner_nodes(id.owner)?; 85,493 ( 0.00%) let node = owner.nodes[id.local_id].as_ref()?; 256,479 ( 0.00%) Some(node.node) . } 1,446,880 ( 0.02%) } . . /// Retrieves the `Node` corresponding to `id`, returning `None` if cannot be found. . #[inline] . pub fn find_by_def_id(&self, id: LocalDefId) -> Option> { 26,136 ( 0.00%) self.find(self.local_def_id_to_hir_id(id)) . } . . /// Retrieves the `Node` corresponding to `id`, panicking if it cannot be found. 116,859 ( 0.00%) pub fn get(&self, id: HirId) -> Node<'hir> { 66,699 ( 0.00%) self.find(id).unwrap_or_else(|| bug!("couldn't find hir id {} in the HIR map", id)) 77,906 ( 0.00%) } . . /// Retrieves the `Node` corresponding to `id`, panicking if it cannot be found. . #[inline] . pub fn get_by_def_id(&self, id: LocalDefId) -> Node<'hir> { . self.find_by_def_id(id).unwrap_or_else(|| bug!("couldn't find {:?} in the HIR map", id)) . } . 3,064 ( 0.00%) pub fn get_if_local(&self, id: DefId) -> Option> { 1,532 ( 0.00%) id.as_local().and_then(|id| self.find(self.local_def_id_to_hir_id(id))) 3,064 ( 0.00%) } . . pub fn get_generics(&self, id: LocalDefId) -> Option<&'hir Generics<'hir>> { . let node = self.tcx.hir_owner(id)?; . match node.node { . OwnerNode::ImplItem(impl_item) => Some(&impl_item.generics), . OwnerNode::TraitItem(trait_item) => Some(&trait_item.generics), . OwnerNode::Item(Item { . kind: -- line 374 ---------------------------------------- -- line 381 ---------------------------------------- . | ItemKind::TraitAlias(generics, _) . | ItemKind::Impl(Impl { generics, .. }), . .. . }) => Some(generics), . _ => None, . } . } . 288,491 ( 0.00%) pub fn item(&self, id: ItemId) -> &'hir Item<'hir> { 82,426 ( 0.00%) self.tcx.hir_owner(id.def_id).unwrap().node.expect_item() 329,704 ( 0.00%) } . 1,918 ( 0.00%) pub fn trait_item(&self, id: TraitItemId) -> &'hir TraitItem<'hir> { 548 ( 0.00%) self.tcx.hir_owner(id.def_id).unwrap().node.expect_trait_item() 2,192 ( 0.00%) } . 180,908 ( 0.00%) pub fn impl_item(&self, id: ImplItemId) -> &'hir ImplItem<'hir> { 51,688 ( 0.00%) self.tcx.hir_owner(id.def_id).unwrap().node.expect_impl_item() 206,752 ( 0.00%) } . . pub fn foreign_item(&self, id: ForeignItemId) -> &'hir ForeignItem<'hir> { . self.tcx.hir_owner(id.def_id).unwrap().node.expect_foreign_item() . } . 308,140 ( 0.00%) pub fn body(&self, id: BodyId) -> &'hir Body<'hir> { 88,040 ( 0.00%) self.tcx.hir_owner_nodes(id.hir_id.owner).unwrap().bodies[&id.hir_id.local_id] 352,160 ( 0.01%) } . 7,596 ( 0.00%) pub fn fn_decl_by_hir_id(&self, hir_id: HirId) -> Option<&'hir FnDecl<'hir>> { 7,596 ( 0.00%) if let Some(node) = self.find(hir_id) { . fn_decl(node) . } else { . bug!("no node for hir_id `{}`", hir_id) . } 5,064 ( 0.00%) } . 723 ( 0.00%) pub fn fn_sig_by_hir_id(&self, hir_id: HirId) -> Option<&'hir FnSig<'hir>> { 723 ( 0.00%) if let Some(node) = self.find(hir_id) { . fn_sig(node) . } else { . bug!("no node for hir_id `{}`", hir_id) . } 723 ( 0.00%) } . . pub fn enclosing_body_owner(&self, hir_id: HirId) -> HirId { . for (parent, _) in self.parent_iter(hir_id) { . if let Some(body) = self.maybe_body_owned_by(parent) { . return self.body_owner(body); . } . } . . bug!("no `enclosing_body_owner` for hir_id `{}`", hir_id); . } . . /// Returns the `HirId` that corresponds to the definition of . /// which this is the body of, i.e., a `fn`, `const` or `static` . /// item (possibly associated), a closure, or a `hir::AnonConst`. 196,648 ( 0.00%) pub fn body_owner(&self, BodyId { hir_id }: BodyId) -> HirId { . let parent = self.get_parent_node(hir_id); 147,486 ( 0.00%) assert!(self.find(parent).map_or(false, |n| is_body_owner(n, hir_id))); . parent 196,648 ( 0.00%) } . 61,725 ( 0.00%) pub fn body_owner_def_id(&self, id: BodyId) -> LocalDefId { 97,240 ( 0.00%) self.local_def_id(self.body_owner(id)) 61,725 ( 0.00%) } . . /// Given a `HirId`, returns the `BodyId` associated with it, . /// if the node is a body owner, otherwise returns `None`. 9,205 ( 0.00%) pub fn maybe_body_owned_by(&self, hir_id: HirId) -> Option { 30,286 ( 0.00%) self.find(hir_id).map(associated_body).flatten() 27,615 ( 0.00%) } . . /// Given a body owner's id, returns the `BodyId` associated with it. 24,039 ( 0.00%) pub fn body_owned_by(&self, id: HirId) -> BodyId { . self.maybe_body_owned_by(id).unwrap_or_else(|| { . span_bug!( . self.span(id), . "body_owned_by: {} has no associated body", . self.node_to_string(id) . ); . }) 18,697 ( 0.00%) } . 928 ( 0.00%) pub fn body_param_names(&self, id: BodyId) -> impl Iterator + 'hir { 8,352 ( 0.00%) self.body(id).params.iter().map(|arg| match arg.pat.kind { 2,766 ( 0.00%) PatKind::Binding(_, _, ident, _) => ident, . _ => Ident::empty(), . }) 2,784 ( 0.00%) } . . /// Returns the `BodyOwnerKind` of this `LocalDefId`. . /// . /// Panics if `LocalDefId` does not have an associated body. 38,688 ( 0.00%) pub fn body_owner_kind(&self, id: HirId) -> BodyOwnerKind { 91,610 ( 0.00%) match self.get(id) { . Node::Item(&Item { kind: ItemKind::Const(..), .. }) . | Node::TraitItem(&TraitItem { kind: TraitItemKind::Const(..), .. }) . | Node::ImplItem(&ImplItem { kind: ImplItemKind::Const(..), .. }) . | Node::AnonConst(_) => BodyOwnerKind::Const, . Node::Ctor(..) . | Node::Item(&Item { kind: ItemKind::Fn(..), .. }) . | Node::TraitItem(&TraitItem { kind: TraitItemKind::Fn(..), .. }) . | Node::ImplItem(&ImplItem { kind: ImplItemKind::Fn(..), .. }) => BodyOwnerKind::Fn, 144 ( 0.00%) Node::Item(&Item { kind: ItemKind::Static(_, m, _), .. }) => BodyOwnerKind::Static(m), . Node::Expr(&Expr { kind: ExprKind::Closure(..), .. }) => BodyOwnerKind::Closure, . node => bug!("{:#?} is not a body node", node), . } 38,688 ( 0.00%) } . . /// Returns the `ConstContext` of the body associated with this `LocalDefId`. . /// . /// Panics if `LocalDefId` does not have an associated body. . /// . /// This should only be used for determining the context of a body, a return . /// value of `Some` does not always suggest that the owner of the body is `const`, . /// just that it has to be checked as if it were. 43,904 ( 0.00%) pub fn body_const_context(&self, did: LocalDefId) -> Option { . let hir_id = self.local_def_id_to_hir_id(did); 65,856 ( 0.00%) let ccx = match self.body_owner_kind(hir_id) { . BodyOwnerKind::Const => ConstContext::Const, 216 ( 0.00%) BodyOwnerKind::Static(mt) => ConstContext::Static(mt), . 3,772 ( 0.00%) BodyOwnerKind::Fn if self.tcx.is_constructor(did.to_def_id()) => return None, 3,772 ( 0.00%) BodyOwnerKind::Fn if self.tcx.is_const_fn_raw(did.to_def_id()) => ConstContext::ConstFn, . BodyOwnerKind::Fn 7,184 ( 0.00%) if self.tcx.has_attr(did.to_def_id(), sym::default_method_body_is_const) => . { . ConstContext::ConstFn . } . BodyOwnerKind::Fn | BodyOwnerKind::Closure => return None, . }; . . Some(ccx) 49,392 ( 0.00%) } . . /// Returns an iterator of the `DefId`s for all body-owners in this . /// crate. If you would prefer to iterate over the bodies . /// themselves, you can do `self.hir().krate().body_ids.iter()`. 21 ( 0.00%) pub fn body_owners(self) -> impl Iterator + 'hir { 3 ( 0.00%) self.krate() . .owners . .iter_enumerated() . .flat_map(move |(owner, owner_info)| { 12,606 ( 0.00%) let bodies = &owner_info.as_ref()?.nodes.bodies; . Some(bodies.iter().map(move |&(local_id, _)| { 208 ( 0.00%) let hir_id = HirId { owner, local_id }; . let body_id = BodyId { hir_id }; 11,886 ( 0.00%) self.body_owner_def_id(body_id) . })) . }) . .flatten() 15 ( 0.00%) } . 10 ( 0.00%) pub fn par_body_owners(self, f: F) { . use rustc_data_structures::sync::{par_iter, ParallelIterator}; . #[cfg(parallel_compiler)] . use rustc_rayon::iter::IndexedParallelIterator; . 3 ( 0.00%) par_iter(&self.krate().owners.raw).enumerate().for_each(|(owner, owner_info)| { . let owner = LocalDefId::new(owner); 25,212 ( 0.00%) if let Some(owner_info) = owner_info { . par_iter(owner_info.nodes.bodies.range(..)).for_each(|(local_id, _)| { . let hir_id = HirId { owner, local_id: *local_id }; . let body_id = BodyId { hir_id }; 11,259 ( 0.00%) f(self.body_owner_def_id(body_id)) . }) . } . }); 8 ( 0.00%) } . 30 ( 0.00%) pub fn ty_param_owner(&self, id: HirId) -> LocalDefId { 24 ( 0.00%) match self.get(id) { . Node::Item(&Item { kind: ItemKind::Trait(..) | ItemKind::TraitAlias(..), .. }) => { . id.expect_owner() . } . Node::GenericParam(_) => self.get_parent_item(id), . _ => bug!("ty_param_owner: {} not a type parameter", self.node_to_string(id)), . } 21 ( 0.00%) } . 100 ( 0.00%) pub fn ty_param_name(&self, id: HirId) -> Symbol { 90 ( 0.00%) match self.get(id) { . Node::Item(&Item { kind: ItemKind::Trait(..) | ItemKind::TraitAlias(..), .. }) => { . kw::SelfUpper . } . Node::GenericParam(param) => param.name.ident().name, . _ => bug!("ty_param_name: {} not a type parameter", self.node_to_string(id)), . } 60 ( 0.00%) } . 1,125 ( 0.00%) pub fn trait_impls(&self, trait_did: DefId) -> &'hir [LocalDefId] { 125 ( 0.00%) self.tcx.all_local_trait_impls(()).get(&trait_did).map_or(&[], |xs| &xs[..]) 1,125 ( 0.00%) } . . /// Gets the attributes on the crate. This is preferable to . /// invoking `krate.attrs` because it registers a tighter . /// dep-graph access. . pub fn krate_attrs(&self) -> &'hir [ast::Attribute] { 20 ( 0.00%) self.attrs(CRATE_HIR_ID) . } . 1,008 ( 0.00%) pub fn get_module(&self, module: LocalDefId) -> (&'hir Mod<'hir>, Span, HirId) { . let hir_id = HirId::make_owner(module); 720 ( 0.00%) match self.tcx.hir_owner(module).map(|o| o.node) { 264 ( 0.00%) Some(OwnerNode::Item(&Item { span, kind: ItemKind::Mod(ref m), .. })) => { . (m, span, hir_id) . } 36 ( 0.00%) Some(OwnerNode::Crate(item)) => (item, item.inner, hir_id), . node => panic!("not a module: {:?}", node), . } 1,296 ( 0.00%) } . . /// Walks the contents of a crate. See also `Crate::visit_all_items`. 11 ( 0.00%) pub fn walk_toplevel_module(self, visitor: &mut impl Visitor<'hir>) { 35 ( 0.00%) let (top_mod, span, hir_id) = self.get_module(CRATE_DEF_ID); . visitor.visit_mod(top_mod, span, hir_id); 8 ( 0.00%) } . . /// Walks the attributes in a crate. 20 ( 0.00%) pub fn walk_attributes(self, visitor: &mut impl Visitor<'hir>) { 2 ( 0.00%) let krate = self.krate(); . for (owner, info) in krate.owners.iter_enumerated() { 16,808 ( 0.00%) if let Some(info) = info { . for (local_id, attrs) in info.attrs.map.iter() { . let id = HirId { owner, local_id: *local_id }; . for a in *attrs { 17,855 ( 0.00%) visitor.visit_attribute(id, a) . } . } . } . } 16 ( 0.00%) } . . /// Visits all items in the crate in some deterministic (but . /// unspecified) order. If you just need to process every item, . /// but don't care about nesting, this method is the best choice. . /// . /// If you do care about nesting -- usually because your algorithm . /// follows lexical scoping rules -- then you want a different . /// approach. You should override `visit_nested_item` in your . /// visitor and then call `intravisit::walk_crate` instead. 152 ( 0.00%) pub fn visit_all_item_likes(&self, visitor: &mut V) . where . V: itemlikevisit::ItemLikeVisitor<'hir>, . { 21 ( 0.00%) let krate = self.krate(); 71 ( 0.00%) for owner in krate.owners.iter().filter_map(Option::as_ref) { 84,924 ( 0.00%) match owner.node() { 69,184 ( 0.00%) OwnerNode::Item(item) => visitor.visit_item(item), . OwnerNode::ForeignItem(item) => visitor.visit_foreign_item(item), 2,628 ( 0.00%) OwnerNode::ImplItem(item) => visitor.visit_impl_item(item), . OwnerNode::TraitItem(item) => visitor.visit_trait_item(item), . OwnerNode::Crate(_) => {} . } . } 152 ( 0.00%) } . . /// A parallel version of `visit_all_item_likes`. . pub fn par_visit_all_item_likes(&self, visitor: &V) . where . V: itemlikevisit::ParItemLikeVisitor<'hir> + Sync + Send, . { 1 ( 0.00%) let krate = self.krate(); 2 ( 0.00%) par_for_each_in(&krate.owners.raw, |owner| match owner.as_ref().map(OwnerInfo::node) { 1,472 ( 0.00%) Some(OwnerNode::Item(item)) => visitor.visit_item(item), . Some(OwnerNode::ForeignItem(item)) => visitor.visit_foreign_item(item), 876 ( 0.00%) Some(OwnerNode::ImplItem(item)) => visitor.visit_impl_item(item), 10 ( 0.00%) Some(OwnerNode::TraitItem(item)) => visitor.visit_trait_item(item), . Some(OwnerNode::Crate(_)) | None => {} . }) . } . 3,870 ( 0.00%) pub fn visit_item_likes_in_module(&self, module: LocalDefId, visitor: &mut V) . where . V: ItemLikeVisitor<'hir>, . { 495 ( 0.00%) let module = self.tcx.hir_module_items(module); . 540 ( 0.00%) for id in module.items.iter() { 66,240 ( 0.00%) visitor.visit_item(self.item(*id)); . } . 540 ( 0.00%) for id in module.trait_items.iter() { 400 ( 0.00%) visitor.visit_trait_item(self.trait_item(*id)); . } . 540 ( 0.00%) for id in module.impl_items.iter() { 34,164 ( 0.00%) visitor.visit_impl_item(self.impl_item(*id)); . } . 540 ( 0.00%) for id in module.foreign_items.iter() { . visitor.visit_foreign_item(self.foreign_item(*id)); . } 3,960 ( 0.00%) } . 46 ( 0.00%) pub fn for_each_module(&self, f: impl Fn(LocalDefId)) { . let mut queue = VecDeque::new(); . queue.push_back(CRATE_DEF_ID); . 360 ( 0.00%) while let Some(id) = queue.pop_front() { . f(id); 135 ( 0.00%) let items = self.tcx.hir_module_items(id); 1,440 ( 0.00%) queue.extend(items.submodules.iter().copied()) . } 40 ( 0.00%) } . . #[cfg(not(parallel_compiler))] . #[inline] . pub fn par_for_each_module(&self, f: impl Fn(LocalDefId)) { 4 ( 0.00%) self.for_each_module(f) . } . . #[cfg(parallel_compiler)] . pub fn par_for_each_module(&self, f: impl Fn(LocalDefId) + Sync) { . use rustc_data_structures::sync::{par_iter, ParallelIterator}; . par_iter_submodules(self.tcx, CRATE_DEF_ID, &f); . . fn par_iter_submodules(tcx: TyCtxt<'_>, module: LocalDefId, f: &F) -- line 699 ---------------------------------------- -- line 703 ---------------------------------------- . (*f)(module); . let items = tcx.hir_module_items(module); . par_iter(&items.submodules[..]).for_each(|&sm| par_iter_submodules(tcx, sm, f)); . } . } . . /// Returns an iterator for the nodes in the ancestor tree of the `current_id` . /// until the crate root is reached. Prefer this over your own loop using `get_parent_node`. 2,585 ( 0.00%) pub fn parent_iter(self, current_id: HirId) -> ParentHirIterator<'hir> { . ParentHirIterator { current_id, map: self } 10,384 ( 0.00%) } . . /// Returns an iterator for the nodes in the ancestor tree of the `current_id` . /// until the crate root is reached. Prefer this over your own loop using `get_parent_node`. . pub fn parent_owner_iter(self, current_id: HirId) -> ParentOwnerIterator<'hir> { . ParentOwnerIterator { current_id, map: self } 51,527 ( 0.00%) } . . /// Checks if the node is left-hand side of an assignment. . pub fn is_lhs(&self, id: HirId) -> bool { . match self.find(self.get_parent_node(id)) { . Some(Node::Expr(expr)) => match expr.kind { . ExprKind::Assign(lhs, _rhs, _span) => lhs.hir_id == id, . _ => false, . }, -- line 727 ---------------------------------------- -- line 752 ---------------------------------------- . /// ``` . /// fn foo(x: usize) -> bool { . /// loop { . /// true // If `get_return_block` gets passed the `id` corresponding . /// } // to this, it will return `None`. . /// false . /// } . /// ``` 90 ( 0.00%) pub fn get_return_block(&self, id: HirId) -> Option { 10 ( 0.00%) let mut iter = self.parent_iter(id).peekable(); . let mut ignore_tail = false; 40 ( 0.00%) if let Some(node) = self.find(id) { 40 ( 0.00%) if let Node::Expr(Expr { kind: ExprKind::Ret(_), .. }) = node { . // When dealing with `return` statements, we don't care about climbing only tail . // expressions. . ignore_tail = true; . } . } 122 ( 0.00%) while let Some((hir_id, node)) = iter.next() { 497 ( 0.00%) if let (Some((_, next_node)), false) = (iter.peek(), ignore_tail) { . match next_node { . Node::Block(Block { expr: None, .. }) => return None, . // The current node is not the tail expression of its parent. . Node::Block(Block { expr: Some(e), .. }) if hir_id != e.hir_id => return None, . _ => {} . } . } 552 ( 0.00%) match node { . Node::Item(_) . | Node::ForeignItem(_) . | Node::TraitItem(_) . | Node::Expr(Expr { kind: ExprKind::Closure(..), .. }) . | Node::ImplItem(_) => return Some(hir_id), . // Ignore `return`s on the first iteration . Node::Expr(Expr { kind: ExprKind::Loop(..) | ExprKind::Ret(..), .. }) . | Node::Local(_) => { . return None; . } . _ => {} . } . } . None 100 ( 0.00%) } . . /// Retrieves the `HirId` for `id`'s parent item, or `id` itself if no . /// parent item is in this map. The "parent item" is the closest parent node . /// in the HIR which is recorded by the map and is an item, either an item . /// in a module, trait, or impl. 15,094 ( 0.00%) pub fn get_parent_item(&self, hir_id: HirId) -> LocalDefId { 136,126 ( 0.00%) if let Some((def_id, _node)) = self.parent_owner_iter(hir_id).next() { . def_id . } else { . CRATE_DEF_ID . } 30,188 ( 0.00%) } . . /// Returns the `HirId` of `id`'s nearest module parent, or `id` itself if no . /// module parent is in this map. . pub(super) fn get_module_parent_node(&self, hir_id: HirId) -> LocalDefId { 17,764 ( 0.00%) for (def_id, node) in self.parent_owner_iter(hir_id) { 9,318 ( 0.00%) if let OwnerNode::Item(&Item { kind: ItemKind::Mod(_), .. }) = node { . return def_id; . } . } . CRATE_DEF_ID . } . . /// When on an if expression, a match arm tail expression or a match arm, give back . /// the enclosing `if` or `match` expression. -- line 820 ---------------------------------------- -- line 834 ---------------------------------------- . } . _ => {} . } . } . None . } . . /// Returns the nearest enclosing scope. A scope is roughly an item or block. 8 ( 0.00%) pub fn get_enclosing_scope(&self, hir_id: HirId) -> Option { 3 ( 0.00%) for (hir_id, node) in self.parent_iter(hir_id) { 6 ( 0.00%) if let Node::Item(Item { . kind: . ItemKind::Fn(..) . | ItemKind::Const(..) . | ItemKind::Static(..) . | ItemKind::Mod(..) . | ItemKind::Enum(..) . | ItemKind::Struct(..) . | ItemKind::Union(..) -- line 852 ---------------------------------------- -- line 858 ---------------------------------------- . | Node::TraitItem(TraitItem { kind: TraitItemKind::Fn(..), .. }) . | Node::ImplItem(ImplItem { kind: ImplItemKind::Fn(..), .. }) . | Node::Block(_) = node . { . return Some(hir_id); . } . } . None 10 ( 0.00%) } . . /// Returns the defining scope for an opaque type definition. . pub fn get_defining_scope(&self, id: HirId) -> HirId { . let mut scope = id; . loop { . scope = self.get_enclosing_scope(scope).unwrap_or(CRATE_HIR_ID); . if scope == CRATE_HIR_ID || !matches!(self.get(scope), Node::Block(_)) { . return scope; -- line 874 ---------------------------------------- -- line 885 ---------------------------------------- . } . } . bug!( . "expected foreign mod or inlined parent, found {}", . self.node_to_string(HirId::make_owner(parent)) . ) . } . 58,569 ( 0.00%) pub fn expect_item(&self, id: LocalDefId) -> &'hir Item<'hir> { 25,101 ( 0.00%) match self.tcx.hir_owner(id) { . Some(Owner { node: OwnerNode::Item(item), .. }) => item, . _ => bug!("expected item, found {}", self.node_to_string(HirId::make_owner(id))), . } 66,936 ( 0.00%) } . 12,264 ( 0.00%) pub fn expect_impl_item(&self, id: LocalDefId) -> &'hir ImplItem<'hir> { 5,256 ( 0.00%) match self.tcx.hir_owner(id) { . Some(Owner { node: OwnerNode::ImplItem(item), .. }) => item, . _ => bug!("expected impl item, found {}", self.node_to_string(HirId::make_owner(id))), . } 14,016 ( 0.00%) } . 140 ( 0.00%) pub fn expect_trait_item(&self, id: LocalDefId) -> &'hir TraitItem<'hir> { 60 ( 0.00%) match self.tcx.hir_owner(id) { . Some(Owner { node: OwnerNode::TraitItem(item), .. }) => item, . _ => bug!("expected trait item, found {}", self.node_to_string(HirId::make_owner(id))), . } 160 ( 0.00%) } . . pub fn expect_variant(&self, id: HirId) -> &'hir Variant<'hir> { . match self.find(id) { . Some(Node::Variant(variant)) => variant, . _ => bug!("expected variant, found {}", self.node_to_string(id)), . } . } . -- line 920 ---------------------------------------- -- line 922 ---------------------------------------- . match self.tcx.hir_owner(id) { . Some(Owner { node: OwnerNode::ForeignItem(item), .. }) => item, . _ => { . bug!("expected foreign item, found {}", self.node_to_string(HirId::make_owner(id))) . } . } . } . 24 ( 0.00%) pub fn expect_expr(&self, id: HirId) -> &'hir Expr<'hir> { 9 ( 0.00%) match self.find(id) { . Some(Node::Expr(expr)) => expr, . _ => bug!("expected expr, found {}", self.node_to_string(id)), . } 21 ( 0.00%) } . 17,244 ( 0.00%) pub fn opt_name(&self, id: HirId) -> Option { 6,052 ( 0.00%) Some(match self.get(id) { . Node::Item(i) => i.ident.name, . Node::ForeignItem(fi) => fi.ident.name, . Node::ImplItem(ii) => ii.ident.name, . Node::TraitItem(ti) => ti.ident.name, . Node::Variant(v) => v.ident.name, . Node::Field(f) => f.ident.name, . Node::Lifetime(lt) => lt.name.ident().name, 5,292 ( 0.00%) Node::GenericParam(param) => param.name.ident().name, 304 ( 0.00%) Node::Binding(&Pat { kind: PatKind::Binding(_, _, l, _), .. }) => l.name, . Node::Ctor(..) => self.name(HirId::make_owner(self.get_parent_item(id))), . _ => return None, . }) 9,580 ( 0.00%) } . 14,720 ( 0.00%) pub fn name(&self, id: HirId) -> Symbol { 5,900 ( 0.00%) match self.opt_name(id) { . Some(name) => name, . None => bug!("no name for {}", self.node_to_string(id)), . } 11,040 ( 0.00%) } . . /// Given a node ID, gets a list of attributes associated with the AST . /// corresponding to the node-ID. 5,541,851 ( 0.08%) pub fn attrs(&self, id: HirId) -> &'hir [ast::Attribute] { 791,693 ( 0.01%) self.tcx.hir_attrs(id.owner).get(id.local_id) 6,333,544 ( 0.09%) } . . /// Gets the span of the definition of the specified HIR node. . /// This is used by `tcx.get_span` 16,467 ( 0.00%) pub fn span(&self, hir_id: HirId) -> Span { 167,981 ( 0.00%) self.opt_span(hir_id) . .unwrap_or_else(|| bug!("hir::map::Map::span: id not in map: {:?}", hir_id)) 16,467 ( 0.00%) } . 349,440 ( 0.01%) pub fn opt_span(&self, hir_id: HirId) -> Option { 349,440 ( 0.01%) let span = match self.find(hir_id)? { . Node::Param(param) => param.span, 3,796 ( 0.00%) Node::Item(item) => match &item.kind { . ItemKind::Fn(sig, _, _) => sig.span, 3,036 ( 0.00%) _ => item.span, . }, . Node::ForeignItem(foreign_item) => foreign_item.span, 280 ( 0.00%) Node::TraitItem(trait_item) => match &trait_item.kind { 240 ( 0.00%) TraitItemKind::Fn(sig, _) => sig.span, 40 ( 0.00%) _ => trait_item.span, . }, 6,738 ( 0.00%) Node::ImplItem(impl_item) => match &impl_item.kind { 6,648 ( 0.00%) ImplItemKind::Fn(sig, _) => sig.span, 90 ( 0.00%) _ => impl_item.span, . }, 144 ( 0.00%) Node::Variant(variant) => variant.span, 708 ( 0.00%) Node::Field(field) => field.span, 5,985 ( 0.00%) Node::AnonConst(constant) => self.body(constant.body).value.span, . Node::Expr(expr) => expr.span, . Node::Stmt(stmt) => stmt.span, . Node::PathSegment(seg) => seg.ident.span, . Node::Ty(ty) => ty.span, . Node::TraitRef(tr) => tr.path.span, . Node::Binding(pat) => pat.span, . Node::Pat(pat) => pat.span, . Node::Arm(arm) => arm.span, . Node::Block(block) => block.span, 802 ( 0.00%) Node::Ctor(..) => match self.find(self.get_parent_node(hir_id))? { . Node::Item(item) => item.span, . Node::Variant(variant) => variant.span, . _ => unreachable!(), . }, . Node::Lifetime(lifetime) => lifetime.span, . Node::GenericParam(param) => param.span, . Node::Visibility(&Spanned { . node: VisibilityKind::Restricted { ref path, .. }, . .. . }) => path.span, . Node::Infer(i) => i.span, . Node::Visibility(v) => bug!("unexpected Visibility {:?}", v), . Node::Local(local) => local.span, 4 ( 0.00%) Node::Crate(item) => item.inner, . }; . Some(span) 499,200 ( 0.01%) } . . /// Like `hir.span()`, but includes the body of function items . /// (instead of just the function header) . pub fn span_with_body(&self, hir_id: HirId) -> Span { . match self.find(hir_id) { . Some(Node::TraitItem(item)) => item.span, . Some(Node::ImplItem(impl_item)) => impl_item.span, . Some(Node::Item(item)) => item.span, . Some(_) => self.span(hir_id), . _ => bug!("hir::map::Map::span_with_body: id not in map: {:?}", hir_id), . } . } . 1,148 ( 0.00%) pub fn span_if_local(&self, id: DefId) -> Option { 7,291 ( 0.00%) id.as_local().and_then(|id| self.opt_span(self.local_def_id_to_hir_id(id))) 1,722 ( 0.00%) } . . pub fn res_span(&self, res: Res) -> Option { . match res { . Res::Err => None, . Res::Local(id) => Some(self.span(id)), . res => self.span_if_local(res.opt_def_id()?), . } . } -- line 1042 ---------------------------------------- -- line 1062 ---------------------------------------- . } . . impl<'hir> intravisit::Map<'hir> for Map<'hir> { . fn find(&self, hir_id: HirId) -> Option> { . self.find(hir_id) . } . . fn body(&self, id: BodyId) -> &'hir Body<'hir> { 25,626 ( 0.00%) self.body(id) . } . . fn item(&self, id: ItemId) -> &'hir Item<'hir> { 20,541 ( 0.00%) self.item(id) . } . . fn trait_item(&self, id: TraitItemId) -> &'hir TraitItem<'hir> { 154 ( 0.00%) self.trait_item(id) . } . . fn impl_item(&self, id: ImplItemId) -> &'hir ImplItem<'hir> { 13,140 ( 0.00%) self.impl_item(id) . } . . fn foreign_item(&self, id: ForeignItemId) -> &'hir ForeignItem<'hir> { . self.foreign_item(id) . } . } . 7 ( 0.00%) pub(super) fn crate_hash(tcx: TyCtxt<'_>, crate_num: CrateNum) -> Svh { . debug_assert_eq!(crate_num, LOCAL_CRATE); . let krate = tcx.hir_crate(()); 3 ( 0.00%) let hir_body_hash = krate.hir_hash; . . let upstream_crates = upstream_crates(tcx); . . // We hash the final, remapped names of all local source files so we . // don't have to include the path prefix remapping commandline args. . // If we included the full mapping in the SVH, we could only have . // reproducible builds by compiling from the same directory. So we just . // hash the result of the mapping instead of the mapping itself. 2 ( 0.00%) let mut source_file_names: Vec<_> = tcx . .sess . .source_map() . .files() . .iter() . .filter(|source_file| source_file.cnum == LOCAL_CRATE) 131 ( 0.00%) .map(|source_file| source_file.name_hash) . .collect(); . . source_file_names.sort_unstable(); . . let mut hcx = tcx.create_stable_hashing_context(); . let mut stable_hasher = StableHasher::new(); . hir_body_hash.hash_stable(&mut hcx, &mut stable_hasher); . upstream_crates.hash_stable(&mut hcx, &mut stable_hasher); . source_file_names.hash_stable(&mut hcx, &mut stable_hasher); 3 ( 0.00%) if tcx.sess.opts.debugging_opts.incremental_relative_spans { . let definitions = &tcx.untracked_resolutions.definitions; . let mut owner_spans: Vec<_> = krate . .owners . .iter_enumerated() . .filter_map(|(def_id, info)| { . let _ = info.as_ref()?; . let def_path_hash = definitions.def_path_hash(def_id); . let span = definitions.def_span(def_id); . debug_assert_eq!(span.parent(), None); . Some((def_path_hash, span)) . }) . .collect(); . owner_spans.sort_unstable_by_key(|bn| bn.0); . owner_spans.hash_stable(&mut hcx, &mut stable_hasher); . } 3 ( 0.00%) tcx.sess.opts.dep_tracking_hash(true).hash_stable(&mut hcx, &mut stable_hasher); 2 ( 0.00%) tcx.sess.local_stable_crate_id().hash_stable(&mut hcx, &mut stable_hasher); . . let crate_hash: Fingerprint = stable_hasher.finish(); 1 ( 0.00%) Svh::new(crate_hash.to_smaller_hash()) 9 ( 0.00%) } . . fn upstream_crates(tcx: TyCtxt<'_>) -> Vec<(StableCrateId, Svh)> { . let mut upstream_crates: Vec<_> = tcx . .crates(()) . .iter() . .map(|&cnum| { 180 ( 0.00%) let stable_crate_id = tcx.resolutions(()).cstore.stable_crate_id(cnum); 36 ( 0.00%) let hash = tcx.crate_hash(cnum); . (stable_crate_id, hash) . }) . .collect(); . upstream_crates.sort_unstable_by_key(|&(stable_crate_id, _)| stable_crate_id); . upstream_crates . } . . fn hir_id_to_string(map: &Map<'_>, id: HirId) -> String { -- line 1155 ---------------------------------------- -- line 1238 ---------------------------------------- . Some(Node::Lifetime(_)) => node_str("lifetime"), . Some(Node::GenericParam(ref param)) => format!("generic_param {:?}{}", param, id_str), . Some(Node::Visibility(ref vis)) => format!("visibility {:?}{}", vis, id_str), . Some(Node::Crate(..)) => String::from("root_crate"), . None => format!("unknown node{}", id_str), . } . } . 405 ( 0.00%) pub(super) fn hir_module_items(tcx: TyCtxt<'_>, module_id: LocalDefId) -> ModuleItems { 270 ( 0.00%) let mut collector = ModuleCollector { . tcx, . submodules: Vec::default(), . items: Vec::default(), . trait_items: Vec::default(), . impl_items: Vec::default(), . foreign_items: Vec::default(), . }; . 225 ( 0.00%) let (hir_mod, span, hir_id) = tcx.hir().get_module(module_id); . collector.visit_mod(hir_mod, span, hir_id); . 720 ( 0.00%) let ModuleCollector { submodules, items, trait_items, impl_items, foreign_items, .. } = . collector; 495 ( 0.00%) return ModuleItems { 180 ( 0.00%) submodules: submodules.into_boxed_slice(), 180 ( 0.00%) items: items.into_boxed_slice(), 180 ( 0.00%) trait_items: trait_items.into_boxed_slice(), 180 ( 0.00%) impl_items: impl_items.into_boxed_slice(), 180 ( 0.00%) foreign_items: foreign_items.into_boxed_slice(), . }; . . struct ModuleCollector<'tcx> { . tcx: TyCtxt<'tcx>, . submodules: Vec, . items: Vec, . trait_items: Vec, . impl_items: Vec, . foreign_items: Vec, . } . . impl<'hir> Visitor<'hir> for ModuleCollector<'hir> { . type NestedFilter = nested_filter::All; . . fn nested_visit_map(&mut self) -> Self::Map { 3,564 ( 0.00%) self.tcx.hir() . } . 7,360 ( 0.00%) fn visit_item(&mut self, item: &'hir Item<'hir>) { 4,416 ( 0.00%) self.items.push(item.item_id()); 2,944 ( 0.00%) if let ItemKind::Mod(..) = item.kind { . // If this declares another module, do not recurse inside it. 44 ( 0.00%) self.submodules.push(item.def_id); . } else { 8,568 ( 0.00%) intravisit::walk_item(self, item) . } 176 ( 0.00%) } . . fn visit_trait_item(&mut self, item: &'hir TraitItem<'hir>) { 30 ( 0.00%) self.trait_items.push(item.trait_item_id()); 30 ( 0.00%) intravisit::walk_trait_item(self, item) . } . . fn visit_impl_item(&mut self, item: &'hir ImplItem<'hir>) { 2,628 ( 0.00%) self.impl_items.push(item.impl_item_id()); 2,628 ( 0.00%) intravisit::walk_impl_item(self, item) . } . . fn visit_foreign_item(&mut self, item: &'hir ForeignItem<'hir>) { . self.foreign_items.push(item.foreign_item_id()); . intravisit::walk_foreign_item(self, item) . } . } 360 ( 0.00%) } 2,006,376 ( 0.03%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_borrowck/src/type_check/mod.rs -------------------------------------------------------------------------------- Ir -- line 118 ---------------------------------------- . /// - `promoted` -- map of promoted constants within `body` . /// - `universal_regions` -- the universal regions from `body`s function signature . /// - `location_table` -- MIR location map of `body` . /// - `borrow_set` -- information about borrows occurring in `body` . /// - `all_facts` -- when using Polonius, this is the generated set of Polonius facts . /// - `flow_inits` -- results of a maybe-init dataflow analysis . /// - `move_data` -- move-data constructed when performing the maybe-init dataflow analysis . /// - `elements` -- MIR region map 15,012 ( 0.00%) pub(crate) fn type_check<'mir, 'tcx>( . infcx: &InferCtxt<'_, 'tcx>, . param_env: ty::ParamEnv<'tcx>, . body: &Body<'tcx>, . promoted: &IndexVec>, . universal_regions: &Rc>, . location_table: &LocationTable, . borrow_set: &BorrowSet<'tcx>, . all_facts: &mut Option, . flow_inits: &mut ResultsCursor<'mir, 'tcx, MaybeInitializedPlaces<'mir, 'tcx>>, . move_data: &MoveData<'tcx>, . elements: &Rc, . upvars: &[Upvar<'tcx>], . ) -> MirTypeckResults<'tcx> { 11,259 ( 0.00%) let implicit_region_bound = infcx.tcx.mk_region(ty::ReVar(universal_regions.fr_fn_body)); . let mut universe_causes = FxHashMap::default(); . universe_causes.insert(ty::UniverseIndex::from_u32(0), UniverseInfo::other()); 27,522 ( 0.00%) let mut constraints = MirTypeckRegionConstraints { . placeholder_indices: PlaceholderIndices::default(), . placeholder_index_to_region: IndexVec::default(), 1,251 ( 0.00%) liveness_constraints: LivenessValues::new(elements.clone()), . outlives_constraints: OutlivesConstraintSet::default(), . member_constraints: MemberConstraintSet::default(), . closure_bounds_mapping: Default::default(), . type_tests: Vec::default(), 5,004 ( 0.00%) universe_causes, . }; . . let CreateResult { 2,502 ( 0.00%) universal_region_relations, 5,004 ( 0.00%) region_bound_pairs, 5,004 ( 0.00%) normalized_inputs_and_output, 6,255 ( 0.00%) } = free_region_relations::create( . infcx, . param_env, . Some(implicit_region_bound), . universal_regions, . &mut constraints, . ); . 2,502 ( 0.00%) for u in ty::UniverseIndex::ROOT..infcx.universe() { . let info = UniverseInfo::other(); . constraints.universe_causes.insert(u, info); . } . 11,259 ( 0.00%) let mut borrowck_context = BorrowCheckContext { 1,251 ( 0.00%) universal_regions, . location_table, . borrow_set, . all_facts, . constraints: &mut constraints, . upvars, . }; . . let opaque_type_values = type_check_internal( -- line 180 ---------------------------------------- -- line 190 ---------------------------------------- . liveness::generate(&mut cx, body, elements, flow_inits, move_data, location_table); . . translate_outlives_facts(&mut cx); . let opaque_type_values = mem::take(&mut infcx.inner.borrow_mut().opaque_types); . . opaque_type_values . .into_iter() . .filter_map(|(opaque_type_key, mut decl)| { 5 ( 0.00%) decl.concrete_ty = infcx.resolve_vars_if_possible(decl.concrete_ty); . trace!( . "finalized opaque type {:?} to {:#?}", . opaque_type_key, . decl.concrete_ty.kind() . ); 5 ( 0.00%) if decl.concrete_ty.has_infer_types_or_consts() { . infcx.tcx.sess.delay_span_bug( . body.span, . &format!("could not resolve {:#?}", decl.concrete_ty.kind()), . ); . decl.concrete_ty = infcx.tcx.ty_error(); . } 20 ( 0.00%) let concrete_is_opaque = if let ty::Opaque(def_id, _) = decl.concrete_ty.kind() . { . *def_id == opaque_type_key.def_id . } else { . false . }; . 1 ( 0.00%) if concrete_is_opaque { . // We're using an opaque `impl Trait` type without . // 'revealing' it. For example, code like this: . // . // type Foo = impl Debug; . // fn foo1() -> Foo { ... } . // fn foo2() -> Foo { foo1() } . // . // In `foo2`, we're not revealing the type of `Foo` - we're -- line 226 ---------------------------------------- -- line 243 ---------------------------------------- . } else { . Some((opaque_type_key, decl)) . } . }) . .collect() . }, . ); . 15,012 ( 0.00%) MirTypeckResults { constraints, universal_region_relations, opaque_type_values } 10,008 ( 0.00%) } . . #[instrument( . skip(infcx, body, promoted, region_bound_pairs, borrowck_context, extra), . level = "debug" . )] . fn type_check_internal<'a, 'tcx, R>( . infcx: &'a InferCtxt<'a, 'tcx>, . param_env: ty::ParamEnv<'tcx>, -- line 260 ---------------------------------------- -- line 270 ---------------------------------------- . body, . param_env, . region_bound_pairs, . implicit_region_bound, . borrowck_context, . ); . let errors_reported = { . let mut verifier = TypeVerifier::new(&mut checker, body, promoted); 1,251 ( 0.00%) verifier.visit_body(&body); 1,251 ( 0.00%) verifier.errors_reported . }; . 1,251 ( 0.00%) if !errors_reported { . // if verifier failed, don't do further checks to avoid ICEs 1,251 ( 0.00%) checker.typeck_mir(body); . } . 16,263 ( 0.00%) extra(checker) . } . . fn translate_outlives_facts(typeck: &mut TypeChecker<'_, '_>) { . let cx = &mut typeck.borrowck_context; 5,004 ( 0.00%) if let Some(facts) = cx.all_facts { . let _prof_timer = typeck.infcx.tcx.prof.generic_activity("polonius_fact_generation"); . let location_table = cx.location_table; . facts.subset_base.extend(cx.constraints.outlives_constraints.outlives().iter().flat_map( . |constraint: &OutlivesConstraint<'_>| { . if let Some(from_location) = constraint.locations.from_location() { . Either::Left(iter::once(( . constraint.sup, . constraint.sub, -- line 300 ---------------------------------------- -- line 334 ---------------------------------------- . body: &'b Body<'tcx>, . promoted: &'b IndexVec>, . last_span: Span, . errors_reported: bool, . } . . impl<'a, 'b, 'tcx> Visitor<'tcx> for TypeVerifier<'a, 'b, 'tcx> { . fn visit_span(&mut self, span: &Span) { 831,529 ( 0.01%) if !span.is_dummy() { 207,269 ( 0.00%) self.last_span = *span; . } . } . 1,098,460 ( 0.02%) fn visit_place(&mut self, place: &Place<'tcx>, context: PlaceContext, location: Location) { . self.sanitize_place(place, location, context); 798,880 ( 0.01%) } . 213,000 ( 0.00%) fn visit_constant(&mut self, constant: &Constant<'tcx>, location: Location) { . self.super_constant(constant, location); 142,000 ( 0.00%) let ty = self.sanitize_type(constant, constant.literal.ty()); . 159,750 ( 0.00%) self.cx.infcx.tcx.for_each_free_region(&ty, |live_region| { . let live_region_vid = . self.cx.borrowck_context.universal_regions.to_region_vid(live_region); 15,560 ( 0.00%) self.cx . .borrowck_context . .constraints . .liveness_constraints 15,560 ( 0.00%) .add_element(live_region_vid, location); . }); . 71,000 ( 0.00%) if let Some(annotation_index) = constant.user_ty { 16,623 ( 0.00%) if let Err(terr) = self.cx.relate_type_and_user_type( 3,694 ( 0.00%) constant.literal.ty(), . ty::Variance::Invariant, 3,694 ( 0.00%) &UserTypeProjection { base: annotation_index, projs: vec![] }, 3,694 ( 0.00%) location.to_locations(), . ConstraintCategory::Boring, . ) { . let annotation = &self.cx.user_type_annotations[annotation_index]; . span_mirbug!( . self, . constant, . "bad constant user type {:?} vs {:?}: {:?}", . annotation, . constant.literal.ty(), . terr, . ); . } . } else { . let tcx = self.tcx(); 47,709 ( 0.00%) let maybe_uneval = match constant.literal { 47,709 ( 0.00%) ConstantKind::Ty(ct) => match ct.val { 1,854 ( 0.00%) ty::ConstKind::Unevaluated(uv) => Some(uv), . _ => None, . }, . _ => None, . }; 3,708 ( 0.00%) if let Some(uv) = maybe_uneval { 3,708 ( 0.00%) if let Some(promoted) = uv.promoted { . let check_err = |verifier: &mut TypeVerifier<'a, 'b, 'tcx>, . promoted: &Body<'tcx>, . ty, . san_ty| { 3,186 ( 0.00%) if let Err(terr) = verifier.cx.eq_types( . ty, . san_ty, 2,124 ( 0.00%) location.to_locations(), . ConstraintCategory::Boring, . ) { . span_mirbug!( . verifier, . promoted, . "bad promoted type ({:?}: {:?}): {:?}", . ty, . san_ty, . terr . ); . }; . }; . 2,124 ( 0.00%) if !self.errors_reported { 1,062 ( 0.00%) let promoted_body = &self.promoted[promoted]; 4,248 ( 0.00%) self.sanitize_promoted(promoted_body, location); . . let promoted_ty = promoted_body.return_ty(); . check_err(self, promoted_body, ty, promoted_ty); . } . } else { 5,544 ( 0.00%) if let Err(terr) = self.cx.fully_perform_op( 1,584 ( 0.00%) location.to_locations(), . ConstraintCategory::Boring, 5,544 ( 0.00%) self.cx.param_env.and(type_op::ascribe_user_type::AscribeUserType::new( 1,584 ( 0.00%) constant.literal.ty(), . uv.def.did, 3,168 ( 0.00%) UserSubsts { substs: uv.substs, user_self_ty: None }, . )), . ) { . span_mirbug!( . self, . constant, . "bad constant type {:?} ({:?})", . constant, . terr . ); . } . } 56,196 ( 0.00%) } else if let Some(static_def_id) = constant.check_static_ptr(tcx) { . let unnormalized_ty = tcx.type_of(static_def_id); 170 ( 0.00%) let locations = location.to_locations(); 595 ( 0.00%) let normalized_ty = self.cx.normalize(unnormalized_ty, locations); 425 ( 0.00%) let literal_ty = constant.literal.ty().builtin_deref(true).unwrap().ty; . 255 ( 0.00%) if let Err(terr) = self.cx.eq_types( . literal_ty, . normalized_ty, . locations, . ConstraintCategory::Boring, . ) { . span_mirbug!(self, constant, "bad static type {:?} ({:?})", constant, terr); . } . } . 88,521 ( 0.00%) if let ty::FnDef(def_id, substs) = *constant.literal.ty().kind() { 16,606 ( 0.00%) let instantiated_predicates = tcx.predicates_of(def_id).instantiate(tcx, substs); 16,606 ( 0.00%) self.cx.normalize_and_prove_instantiated_predicates( . def_id, 49,818 ( 0.00%) instantiated_predicates, 16,606 ( 0.00%) location.to_locations(), . ); . } . } 142,000 ( 0.00%) } . 352,671 ( 0.01%) fn visit_rvalue(&mut self, rvalue: &Rvalue<'tcx>, location: Location) { . self.super_rvalue(rvalue, location); 96,183 ( 0.00%) let rval_ty = rvalue.ty(self.body, self.tcx()); 384,732 ( 0.01%) self.sanitize_type(rvalue, rval_ty); . } . 436,680 ( 0.01%) fn visit_local_decl(&mut self, local: Local, local_decl: &LocalDecl<'tcx>) { . self.super_local_decl(local, local_decl); 218,340 ( 0.00%) self.sanitize_type(local_decl, local_decl.ty); . 131,004 ( 0.00%) if let Some(user_ty) = &local_decl.user_ty { 44 ( 0.00%) for (user_ty, span) in user_ty.projections_and_spans() { 220 ( 0.00%) let ty = if !local_decl.is_nonref_binding() { . // If we have a binding of the form `let ref x: T = ..` . // then remove the outermost reference so we can check the . // type annotation for the remaining type. . if let ty::Ref(_, rty, _) = local_decl.ty.kind() { . rty . } else { . bug!("{:?} with ref binding has wrong type {}", local, local_decl.ty); . } . } else { . local_decl.ty . }; . 352 ( 0.00%) if let Err(terr) = self.cx.relate_type_and_user_type( . ty, . ty::Variance::Invariant, . user_ty, 132 ( 0.00%) Locations::All(*span), . ConstraintCategory::TypeAnnotation, . ) { . span_mirbug!( . self, . local, . "bad user type on variable {:?}: {:?} != {:?} ({:?})", . local, . local_decl.ty, . local_decl.user_ty, . terr, . ); . } . } . } 349,344 ( 0.01%) } . 16,191 ( 0.00%) fn visit_body(&mut self, body: &Body<'tcx>) { 6,939 ( 0.00%) self.sanitize_type(&"return type", body.return_ty()); . for local_decl in &body.local_decls { 218,340 ( 0.00%) self.sanitize_type(local_decl, local_decl.ty); . } 4,626 ( 0.00%) if self.errors_reported { . return; . } . self.super_body(body); 18,504 ( 0.00%) } . } . . impl<'a, 'b, 'tcx> TypeVerifier<'a, 'b, 'tcx> { . fn new( . cx: &'a mut TypeChecker<'b, 'tcx>, . body: &'b Body<'tcx>, . promoted: &'b IndexVec>, . ) -> Self { 11,259 ( 0.00%) TypeVerifier { body, promoted, cx, last_span: body.span, errors_reported: false } . } . . fn tcx(&self) -> TyCtxt<'tcx> { 246,904 ( 0.00%) self.cx.infcx.tcx . } . 1,447,830 ( 0.02%) fn sanitize_type(&mut self, parent: &dyn fmt::Debug, ty: Ty<'tcx>) -> Ty<'tcx> { 289,566 ( 0.00%) if ty.has_escaping_bound_vars() || ty.references_error() { . span_mirbug_and_err!(self, parent, "bad type {:?}", ty) . } else { . ty . } 1,013,481 ( 0.01%) } . . /// Checks that the types internal to the `place` match up with . /// what would be expected. . fn sanitize_place( . &mut self, . place: &Place<'tcx>, . location: Location, . context: PlaceContext, . ) -> PlaceTy<'tcx> { . debug!("sanitize_place: {:?}", place); . 399,440 ( 0.01%) let mut place_ty = PlaceTy::from_ty(self.body.local_decls[place.local].ty); . 137,266 ( 0.00%) for elem in place.projection.iter() { 18,703 ( 0.00%) if place_ty.variant_index.is_none() { 17,264 ( 0.00%) if place_ty.ty.references_error() { . assert!(self.errors_reported); . return PlaceTy::from_ty(self.tcx().ty_error()); . } . } . place_ty = self.sanitize_projection(place_ty, elem, place, location); . } . 288,936 ( 0.00%) if let PlaceContext::NonMutatingUse(NonMutatingUseContext::Copy) = context { . let tcx = self.tcx(); . let trait_ref = ty::TraitRef { 40,770 ( 0.00%) def_id: tcx.require_lang_item(LangItem::Copy, Some(self.last_span)), 20,385 ( 0.00%) substs: tcx.mk_substs_trait(place_ty.ty, &[]), . }; . . // To have a `Copy` operand, the type `T` of the . // value must be `Copy`. Note that we prove that `T: Copy`, . // rather than using the `is_copy_modulo_regions` . // test. This is important because . // `is_copy_modulo_regions` ignores the resulting region . // obligations and assumes they pass. This can result in . // bounds from `Copy` impls being unsoundly ignored (e.g., . // #29149). Note that we decide to use `Copy` before knowing . // whether the bounds fully apply: in effect, the rule is . // that if a value of some type could implement `Copy`, then . // it must. 12,231 ( 0.00%) self.cx.prove_trait_ref( . trait_ref, . location.to_locations(), . ConstraintCategory::CopyBound, . ); . } . . place_ty . } -- line 595 ---------------------------------------- -- line 598 ---------------------------------------- . // Determine the constraints from the promoted MIR by running the type . // checker on the promoted MIR, then transfer the constraints back to . // the main MIR, changing the locations to the provided location. . . let parent_body = mem::replace(&mut self.body, promoted_body); . . // Use new sets of constraints and closure bounds so that we can . // modify their locations. 1,062 ( 0.00%) let all_facts = &mut None; . let mut constraints = Default::default(); . let mut closure_bounds = Default::default(); . let mut liveness_constraints = 2,124 ( 0.00%) LivenessValues::new(Rc::new(RegionValueElements::new(&promoted_body))); . // Don't try to add borrow_region facts for the promoted MIR . . let mut swap_constraints = |this: &mut Self| { 4,248 ( 0.00%) mem::swap(this.cx.borrowck_context.all_facts, all_facts); . mem::swap( 4,248 ( 0.00%) &mut this.cx.borrowck_context.constraints.outlives_constraints, . &mut constraints, . ); . mem::swap( 4,248 ( 0.00%) &mut this.cx.borrowck_context.constraints.closure_bounds_mapping, . &mut closure_bounds, . ); . mem::swap( 4,248 ( 0.00%) &mut this.cx.borrowck_context.constraints.liveness_constraints, . &mut liveness_constraints, . ); . }; . 1,062 ( 0.00%) swap_constraints(self); . 3,186 ( 0.00%) self.visit_body(&promoted_body); . 2,124 ( 0.00%) if !self.errors_reported { . // if verifier failed, don't do further checks to avoid ICEs 3,186 ( 0.00%) self.cx.typeck_mir(promoted_body); . } . 1,062 ( 0.00%) self.body = parent_body; . // Merge the outlives constraints back in, at the given location. 1,062 ( 0.00%) swap_constraints(self); . . let locations = location.to_locations(); . for constraint in constraints.outlives().iter() { . let mut constraint = constraint.clone(); . constraint.locations = locations; 16,652 ( 0.00%) if let ConstraintCategory::Return(_) . | ConstraintCategory::UseAsConst . | ConstraintCategory::UseAsStatic = constraint.category . { . // "Returning" from a promoted is an assignment to a . // temporary from the user's point of view. . constraint.category = ConstraintCategory::Boring; . } . self.cx.borrowck_context.constraints.outlives_constraints.push(constraint) . } . for region in liveness_constraints.rows() { . // If the region is live at at least one location in the promoted MIR, . // then add a liveness constraint to the main MIR for this region . // at the location provided as an argument to this method 163,392 ( 0.00%) if liveness_constraints.get_elements(region).next().is_some() { 4,548 ( 0.00%) self.cx . .borrowck_context . .constraints . .liveness_constraints . .add_element(region, location); . } . } . 1,062 ( 0.00%) if !closure_bounds.is_empty() { . let combined_bounds_mapping = . closure_bounds.into_iter().flat_map(|(_, value)| value).collect(); . let existing = self . .cx . .borrowck_context . .constraints . .closure_bounds_mapping . .insert(location, combined_bounds_mapping); . assert!(existing.is_none(), "Multiple promoteds/closures at the same location."); . } 4,248 ( 0.00%) } . . fn sanitize_projection( . &mut self, . base: PlaceTy<'tcx>, . pi: PlaceElem<'tcx>, . place: &Place<'tcx>, . location: Location, . ) -> PlaceTy<'tcx> { . debug!("sanitize_projection: {:?} {:?} {:?}", base, pi, place); . let tcx = self.tcx(); 18,703 ( 0.00%) let base_ty = base.ty; 93,515 ( 0.00%) match pi { . ProjectionElem::Deref => { 35,601 ( 0.00%) let deref_ty = base_ty.builtin_deref(true); . PlaceTy::from_ty(deref_ty.map(|t| t.ty).unwrap_or_else(|| { . span_mirbug_and_err!(self, place, "deref of non-pointer {:?}", base_ty) . })) . } 74 ( 0.00%) ProjectionElem::Index(i) => { 296 ( 0.00%) let index_ty = Place::from(i).ty(self.body, tcx).ty; 74 ( 0.00%) if index_ty != tcx.types.usize { . PlaceTy::from_ty(span_mirbug_and_err!(self, i, "index by non-usize {:?}", i)) . } else { 74 ( 0.00%) PlaceTy::from_ty(base_ty.builtin_index().unwrap_or_else(|| { . span_mirbug_and_err!(self, place, "index of non-array {:?}", base_ty) . })) . } . } . ProjectionElem::ConstantIndex { .. } => { . // consider verifying in-bounds . PlaceTy::from_ty(base_ty.builtin_index().unwrap_or_else(|| { . span_mirbug_and_err!(self, place, "index of non-array {:?}", base_ty) -- line 712 ---------------------------------------- -- line 720 ---------------------------------------- . } . ty::Slice(..) => { . assert!(from_end, "slice subslices should use from_end"); . base_ty . } . _ => span_mirbug_and_err!(self, place, "slice of non-array {:?}", base_ty), . }) . } 4,317 ( 0.00%) ProjectionElem::Downcast(maybe_name, index) => match base_ty.kind() { 4,317 ( 0.00%) ty::Adt(adt_def, _substs) if adt_def.is_enum() => { 4,317 ( 0.00%) if index.as_usize() >= adt_def.variants.len() { . PlaceTy::from_ty(span_mirbug_and_err!( . self, . place, . "cast to variant #{:?} but enum only has {:?}", . index, . adt_def.variants.len() . )) . } else { -- line 738 ---------------------------------------- -- line 752 ---------------------------------------- . ) . } else { . span_mirbug_and_err!(self, place, "can't downcast {:?}", base_ty) . }; . PlaceTy::from_ty(ty) . } . }, . ProjectionElem::Field(field, fty) => { 26,615 ( 0.00%) let fty = self.sanitize_type(place, fty); 74,522 ( 0.00%) let fty = self.cx.normalize(fty, location); 6 ( 0.00%) match self.field_ty(place, base, field, location) { . Ok(ty) => { 42,584 ( 0.00%) let ty = self.cx.normalize(ty, location); 10,646 ( 0.00%) if let Err(terr) = self.cx.eq_types( . ty, . fty, . location.to_locations(), . ConstraintCategory::Boring, . ) { . span_mirbug!( . self, . place, -- line 773 ---------------------------------------- -- line 800 ---------------------------------------- . &mut self, . parent: &dyn fmt::Debug, . base_ty: PlaceTy<'tcx>, . field: Field, . location: Location, . ) -> Result, FieldAccessError> { . let tcx = self.tcx(); . 5,323 ( 0.00%) let (variant, substs) = match base_ty { 5,756 ( 0.00%) PlaceTy { ty, variant_index: Some(variant_index) } => match *ty.kind() { 2,878 ( 0.00%) ty::Adt(adt_def, substs) => (&adt_def.variants[variant_index], substs), . ty::Generator(def_id, substs, _) => { . let mut variants = substs.as_generator().state_tys(def_id, tcx); . let mut variant = match variants.nth(variant_index.into()) { . Some(v) => v, . None => bug!( . "variant_index of generator out of range: {:?}/{:?}", . variant_index, . substs.as_generator().state_tys(def_id, tcx).count() -- line 818 ---------------------------------------- -- line 820 ---------------------------------------- . }; . return match variant.nth(field.index()) { . Some(ty) => Ok(ty), . None => Err(FieldAccessError::OutOfRange { field_count: variant.count() }), . }; . } . _ => bug!("can't have downcast of non-adt non-generator type"), . }, 15,536 ( 0.00%) PlaceTy { ty, variant_index: None } => match *ty.kind() { 8,944 ( 0.00%) ty::Adt(adt_def, substs) if !adt_def.is_enum() => { . (&adt_def.variants[VariantIdx::new(0)], substs) . } 166 ( 0.00%) ty::Closure(_, substs) => { 1,494 ( 0.00%) return match substs . .as_closure() . .tupled_upvars_ty() . .tuple_element_ty(field.index()) . { . Some(ty) => Ok(ty), . None => Err(FieldAccessError::OutOfRange { . field_count: substs.as_closure().upvar_tys().count(), . }), . }; . } 2 ( 0.00%) ty::Generator(_, substs, _) => { . // Only prefix fields (upvars and current state) are . // accessible without a variant index. 26 ( 0.00%) return match substs.as_generator().prefix_tys().nth(field.index()) { . Some(ty) => Ok(ty), . None => Err(FieldAccessError::OutOfRange { . field_count: substs.as_generator().prefix_tys().count(), . }), . }; . } 1,480 ( 0.00%) ty::Tuple(tys) => { 1,480 ( 0.00%) return match tys.get(field.index()) { 5,920 ( 0.00%) Some(&ty) => Ok(ty.expect_ty()), . None => Err(FieldAccessError::OutOfRange { field_count: tys.len() }), . }; . } . _ => { . return Ok(span_mirbug_and_err!( . self, . parent, . "can't project out of {:?}", . base_ty . )); . } . }, . }; . 3,675 ( 0.00%) if let Some(field) = variant.fields.get(field.index()) { 36,750 ( 0.00%) Ok(self.cx.normalize(field.ty(tcx, substs), location)) . } else { . Err(FieldAccessError::OutOfRange { field_count: variant.fields.len() }) . } . } . } . . /// The MIR type checker. Visits the MIR and enforces all the . /// constraints needed for it to be valid and well-typed. Along the -- line 880 ---------------------------------------- -- line 943 ---------------------------------------- . FxHashMap>, . . crate universe_causes: FxHashMap>, . . crate type_tests: Vec>, . } . . impl<'tcx> MirTypeckRegionConstraints<'tcx> { 14,150 ( 0.00%) fn placeholder_region( . &mut self, . infcx: &InferCtxt<'_, 'tcx>, . placeholder: ty::PlaceholderRegion, . ) -> ty::Region<'tcx> { . let placeholder_index = self.placeholder_indices.insert(placeholder); 2,830 ( 0.00%) match self.placeholder_index_to_region.get(placeholder_index) { 322 ( 0.00%) Some(&v) => v, . None => { 5,016 ( 0.00%) let origin = NllRegionVariableOrigin::Placeholder(placeholder); 11,286 ( 0.00%) let region = infcx.next_nll_region_var_in_universe(origin, placeholder.universe); . self.placeholder_index_to_region.push(region); . region . } . } 11,320 ( 0.00%) } . } . . /// The `Locations` type summarizes *where* region constraints are . /// required to hold. Normally, this is at a particular point which . /// created the obligation, but for constraints that the user gave, we . /// want the constraint to hold at all points. 138,527 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)] . pub enum Locations { . /// Indicates that a type constraint should always be true. This . /// is particularly important in the new borrowck analysis for . /// things like the type of the return slot. Consider this . /// example: . /// . /// ``` . /// fn foo<'a>(x: &'a u32) -> &'a u32 { -- line 981 ---------------------------------------- -- line 1020 ---------------------------------------- . match self { . Locations::All(_) => None, . Locations::Single(from_location) => Some(*from_location), . } . } . . /// Gets a span representing the location. . pub fn span(&self, body: &Body<'_>) -> Span { 150 ( 0.00%) match self { 23 ( 0.00%) Locations::All(span) => *span, 260 ( 0.00%) Locations::Single(l) => body.source_info(*l).span, . } . } . } . . impl<'a, 'tcx> TypeChecker<'a, 'tcx> { . fn new( . infcx: &'a InferCtxt<'a, 'tcx>, . body: &'a Body<'tcx>, . param_env: ty::ParamEnv<'tcx>, . region_bound_pairs: &'a RegionBoundPairs<'tcx>, . implicit_region_bound: ty::Region<'tcx>, . borrowck_context: &'a mut BorrowCheckContext<'a, 'tcx>, . ) -> Self { 16,263 ( 0.00%) let mut checker = Self { . infcx, . last_span: DUMMY_SP, . body, 1,251 ( 0.00%) user_type_annotations: &body.user_type_annotations, . param_env, . region_bound_pairs, . implicit_region_bound, . borrowck_context, . reported_errors: Default::default(), . }; . checker.check_user_type_annotations(); . checker . } . . fn unsized_feature_enabled(&self) -> bool { 81,224 ( 0.00%) let features = self.tcx().features(); 162,448 ( 0.00%) features.unsized_locals || features.unsized_fn_params . } . . /// Equate the inferred type and the annotated type for user type annotations . fn check_user_type_annotations(&mut self) { . debug!( . "check_user_type_annotations: user_type_annotations={:?}", . self.user_type_annotations . ); 2,027 ( 0.00%) for user_annotation in self.user_type_annotations { 4,054 ( 0.00%) let CanonicalUserTypeAnnotation { span, ref user_ty, inferred_ty } = *user_annotation; 12,162 ( 0.00%) let inferred_ty = self.normalize(inferred_ty, Locations::All(span)); 4,054 ( 0.00%) let annotation = self.instantiate_canonical_with_fresh_inference_vars(span, user_ty); 4,054 ( 0.00%) match annotation { 360 ( 0.00%) UserType::Ty(mut ty) => { 1,080 ( 0.00%) ty = self.normalize(ty, Locations::All(span)); . 360 ( 0.00%) if let Err(terr) = self.eq_types( . ty, 180 ( 0.00%) inferred_ty, . Locations::All(span), . ConstraintCategory::BoringNoLocation, . ) { . span_mirbug!( . self, . user_annotation, . "bad user type ({:?} = {:?}): {:?}", . ty, . inferred_ty, . terr . ); . } . 1,260 ( 0.00%) self.prove_predicate( 540 ( 0.00%) ty::Binder::dummy(ty::PredicateKind::WellFormed(inferred_ty.into())) . .to_predicate(self.tcx()), 360 ( 0.00%) Locations::All(span), . ConstraintCategory::TypeAnnotation, . ); . } 14,776 ( 0.00%) UserType::TypeOf(def_id, user_substs) => { 16,623 ( 0.00%) if let Err(terr) = self.fully_perform_op( 3,694 ( 0.00%) Locations::All(span), . ConstraintCategory::BoringNoLocation, 9,235 ( 0.00%) self.param_env.and(type_op::ascribe_user_type::AscribeUserType::new( 1,847 ( 0.00%) inferred_ty, . def_id, 3,694 ( 0.00%) user_substs, . )), . ) { . span_mirbug!( . self, . user_annotation, . "bad user type AscribeUserType({:?}, {:?} {:?}, type_of={:?}): {:?}", . inferred_ty, . def_id, -- line 1116 ---------------------------------------- -- line 1128 ---------------------------------------- . fn push_region_constraints( . &mut self, . locations: Locations, . category: ConstraintCategory, . data: &QueryRegionConstraints<'tcx>, . ) { . debug!("constraints generated: {:#?}", data); . 15,476 ( 0.00%) constraint_conversion::ConstraintConversion::new( 7 ( 0.00%) self.infcx, 30,717 ( 0.00%) self.borrowck_context.universal_regions, 15,362 ( 0.00%) self.region_bound_pairs, . Some(self.implicit_region_bound), 1,522 ( 0.00%) self.param_env, . locations, . category, 15,362 ( 0.00%) &mut self.borrowck_context.constraints, . ) . .convert_all(data); . } . . /// Try to relate `sub <: sup` . fn sub_types( . &mut self, . sub: Ty<'tcx>, . sup: Ty<'tcx>, . locations: Locations, . category: ConstraintCategory, . ) -> Fallible<()> { . // Use this order of parameters because the sup type is usually the . // "expected" type in diagnostics. 750,028 ( 0.01%) self.relate_types(sup, ty::Variance::Contravariant, sub, locations, category) . } . . #[instrument(skip(self, category), level = "debug")] . fn eq_types( . &mut self, . expected: Ty<'tcx>, . found: Ty<'tcx>, . locations: Locations, . category: ConstraintCategory, . ) -> Fallible<()> { 113,923 ( 0.00%) self.relate_types(expected, ty::Variance::Invariant, found, locations, category) . } . 32,147 ( 0.00%) #[instrument(skip(self), level = "debug")] . fn relate_type_and_user_type( . &mut self, . a: Ty<'tcx>, . v: ty::Variance, . user_ty: &UserTypeProjection, . locations: Locations, . category: ConstraintCategory, . ) -> Fallible<()> { 7,768 ( 0.00%) let annotated_type = self.user_type_annotations[user_ty.base].inferred_ty; . let mut curr_projected_ty = PlaceTy::from_ty(annotated_type); . 5,826 ( 0.00%) let tcx = self.infcx.tcx; . . for proj in &user_ty.projs { 12 ( 0.00%) let projected_ty = curr_projected_ty.projection_ty_core( . tcx, 4 ( 0.00%) self.param_env, . proj, 8 ( 0.00%) |this, field, &()| { 10 ( 0.00%) let ty = this.field_ty(tcx, field); 20 ( 0.00%) self.normalize(ty, locations) . }, . ); . curr_projected_ty = projected_ty; . } . debug!( . "user_ty base: {:?} freshened: {:?} projs: {:?} yields: {:?}", . user_ty.base, annotated_type, user_ty.projs, curr_projected_ty . ); . . let ty = curr_projected_ty.ty; 31,225 ( 0.00%) self.relate_types(ty, v.xform(ty::Variance::Contravariant), a, locations, category)?; . . Ok(()) . } . . /// Equates a type `anon_ty` that may contain opaque types whose . /// values are to be inferred by the MIR. . /// . /// The type `revealed_ty` contains the same type as `anon_ty`, but with the -- line 1213 ---------------------------------------- -- line 1231 ---------------------------------------- . /// . /// In terms of our function parameters: . /// . /// * `anon_ty` would be `Box>` where `Foo` is an opaque type . /// scoped to this function (note that it is parameterized by the . /// generics of `foo`). Note that `anon_ty` is not just the opaque type, . /// but the entire return type (which may contain opaque types within it). . /// * `revealed_ty` would be `Box<(T, u32)>` 25,897 ( 0.00%) #[instrument(skip(self), level = "debug")] . fn eq_opaque_type_and_type( . &mut self, . revealed_ty: Ty<'tcx>, . anon_ty: Ty<'tcx>, . locations: Locations, . category: ConstraintCategory, . ) -> Fallible<()> { . // Fast path for the common case. 1,363 ( 0.00%) if !anon_ty.has_opaque_types() { 2,716 ( 0.00%) if let Err(terr) = self.eq_types(anon_ty, revealed_ty, locations, category) { . span_mirbug!( . self, . locations, . "eq_opaque_type_and_type: `{:?}=={:?}` failed with `{:?}`", . revealed_ty, . anon_ty, . terr . ); . } . return Ok(()); . } . 10 ( 0.00%) let param_env = self.param_env; 5 ( 0.00%) let body = self.body; . let mir_def_id = body.source.def_id().expect_local(); . . debug!(?mir_def_id); . self.fully_perform_op( 25 ( 0.00%) locations, . category, . CustomTypeOp::new( . |infcx| { . let mut obligations = ObligationAccumulator::default(); . . let dummy_body_id = hir::CRATE_HIR_ID; . . // Replace the opaque types defined by this function with . // inference variables, creating a map. In our example above, . // this would transform the type `Box>` (where `Foo` is an opaque type) . // to `Box`, returning an `opaque_type_map` mapping `{Foo -> ?T}`. . // (Note that the key of the map is both the def-id of `Foo` along with . // any generic parameters.) . let output_ty = obligations.add(infcx.instantiate_opaque_types( . dummy_body_id, 5 ( 0.00%) param_env, 5 ( 0.00%) anon_ty, . locations.span(body), . )); . debug!(?output_ty, ?revealed_ty); . . // Make sure that the inferred types are well-formed. I'm . // not entirely sure this is needed (the HIR type check . // didn't do this) but it seems sensible to prevent opaque . // types hiding ill-formed types. . obligations.obligations.push(traits::Obligation::new( . ObligationCause::dummy(), 5 ( 0.00%) param_env, 20 ( 0.00%) ty::Binder::dummy(ty::PredicateKind::WellFormed(revealed_ty.into())) 5 ( 0.00%) .to_predicate(infcx.tcx), . )); . obligations.add( . infcx 5 ( 0.00%) .at(&ObligationCause::dummy(), param_env) 5 ( 0.00%) .eq(output_ty, revealed_ty)?, . ); . . debug!("equated"); . 20 ( 0.00%) Ok(InferOk { value: (), obligations: obligations.into_vec() }) 5 ( 0.00%) }, . || "input_output".to_string(), . ), . )?; . . // Finally, if we instantiated the anon types successfully, we . // have to solve any bounds (e.g., `-> impl Iterator` needs to . // prove that `T: Iterator` where `T` is the type we . // instantiated it with). 5 ( 0.00%) let opaque_type_map = self.infcx.inner.borrow().opaque_types.clone(); 65 ( 0.00%) for (opaque_type_key, opaque_decl) in opaque_type_map { . self.fully_perform_op( 20 ( 0.00%) locations, . ConstraintCategory::OpaqueType, . CustomTypeOp::new( . |infcx| { 15 ( 0.00%) infcx.constrain_opaque_type(opaque_type_key, &opaque_decl); 5 ( 0.00%) Ok(InferOk { value: (), obligations: vec![] }) . }, . || "opaque_type_map".to_string(), . ), . )?; . } . Ok(()) . } . . fn tcx(&self) -> TyCtxt<'tcx> { 663,833 ( 0.01%) self.infcx.tcx . } . . #[instrument(skip(self, body, location), level = "debug")] . fn check_stmt(&mut self, body: &Body<'tcx>, stmt: &Statement<'tcx>, location: Location) { . let tcx = self.tcx(); 412,008 ( 0.01%) match stmt.kind { 32,061 ( 0.00%) StatementKind::Assign(box (ref place, ref rv)) => { . // Assignments to temporaries are not "interesting"; . // they are not caused by the user, but rather artifacts . // of lowering. Assignments to other sorts of places *are* interesting . // though. 127,950 ( 0.00%) let category = match place.as_local() { . Some(RETURN_PLACE) => { 4,790 ( 0.00%) let defining_ty = &self.borrowck_context.universal_regions.defining_ty; 2,395 ( 0.00%) if defining_ty.is_const() { 796 ( 0.00%) if tcx.is_static(defining_ty.def_id()) { . ConstraintCategory::UseAsStatic . } else { . ConstraintCategory::UseAsConst . } . } else { . ConstraintCategory::Return(ReturnConstraint::Normal) . } . } . Some(l) 45,383 ( 0.00%) if matches!( 63,004 ( 0.00%) body.local_decls[l].local_info, . Some(box LocalInfo::AggregateTemp) . ) => . { . ConstraintCategory::Usage . } . Some(l) if !body.local_decls[l].is_user_variable() => { . ConstraintCategory::Boring . } -- line 1371 ---------------------------------------- -- line 1373 ---------------------------------------- . }; . debug!( . "assignment category: {:?} {:?}", . category, . place.as_local().map(|l| &body.local_decls[l]) . ); . . let place_ty = place.ty(body, tcx).ty; 384,732 ( 0.01%) let place_ty = self.normalize(place_ty, location); 32,061 ( 0.00%) let rv_ty = rv.ty(body, tcx); 192,366 ( 0.00%) let rv_ty = self.normalize(rv_ty, location); 64,122 ( 0.00%) if let Err(terr) = . self.sub_types(rv_ty, place_ty, location.to_locations(), category) . { . span_mirbug!( . self, . stmt, . "bad assignment ({:?} = {:?}): {:?}", . place_ty, . rv_ty, . terr . ); . } . 1,724 ( 0.00%) if let Some(annotation_index) = self.rvalue_user_ty(rv) { . if let Err(terr) = self.relate_type_and_user_type( . rv_ty, . ty::Variance::Invariant, . &UserTypeProjection { base: annotation_index, projs: vec![] }, . location.to_locations(), . ConstraintCategory::Boring, . ) { . let annotation = &self.user_type_annotations[annotation_index]; -- line 1405 ---------------------------------------- -- line 1409 ---------------------------------------- . "bad user type on rvalue ({:?} = {:?}): {:?}", . annotation, . rv_ty, . terr . ); . } . } . 224,427 ( 0.00%) self.check_rvalue(body, rv, location); 32,061 ( 0.00%) if !self.unsized_feature_enabled() { . let trait_ref = ty::TraitRef { 352,671 ( 0.01%) def_id: tcx.require_lang_item(LangItem::Sized, Some(self.last_span)), 160,305 ( 0.00%) substs: tcx.mk_substs_trait(place_ty, &[]), . }; 96,183 ( 0.00%) self.prove_trait_ref( . trait_ref, . location.to_locations(), . ConstraintCategory::SizedBound, . ); . } . } . StatementKind::SetDiscriminant { ref place, variant_index } => { . let place_type = place.ty(body, tcx).ty; -- line 1431 ---------------------------------------- -- line 1444 ---------------------------------------- . span_bug!( . stmt.source_info.span, . "bad set discriminant ({:?} = {:?}): value of of range", . place, . variant_index . ); . }; . } 51 ( 0.00%) StatementKind::AscribeUserType(box (ref place, ref projection), variance) => { 51 ( 0.00%) let place_ty = place.ty(body, tcx).ty; . if let Err(terr) = self.relate_type_and_user_type( . place_ty, . variance, . projection, 204 ( 0.00%) Locations::All(stmt.source_info.span), . ConstraintCategory::TypeAnnotation, . ) { . let annotation = &self.user_type_annotations[projection.base]; . span_mirbug!( . self, . stmt, . "bad type assert ({:?} <: {:?} with projections {:?}): {:?}", . place_ty, -- line 1466 ---------------------------------------- -- line 1488 ---------------------------------------- . #[instrument(skip(self, body, term_location), level = "debug")] . fn check_terminator( . &mut self, . body: &Body<'tcx>, . term: &Terminator<'tcx>, . term_location: Location, . ) { . let tcx = self.tcx(); 138,595 ( 0.00%) match term.kind { . TerminatorKind::Goto { .. } . | TerminatorKind::Resume . | TerminatorKind::Abort . | TerminatorKind::Return . | TerminatorKind::GeneratorDrop . | TerminatorKind::Unreachable . | TerminatorKind::Drop { .. } . | TerminatorKind::FalseEdge { .. } . | TerminatorKind::FalseUnwind { .. } . | TerminatorKind::InlineAsm { .. } => { . // no checks needed for these . } . . TerminatorKind::DropAndReplace { ref place, ref value, target: _, unwind: _ } => { 46 ( 0.00%) let place_ty = place.ty(body, tcx).ty; 46 ( 0.00%) let rv_ty = value.ty(body, tcx); . . let locations = term_location.to_locations(); 92 ( 0.00%) if let Err(terr) = . self.sub_types(rv_ty, place_ty, locations, ConstraintCategory::Assignment) . { . span_mirbug!( . self, . term, . "bad DropAndReplace ({:?} = {:?}): {:?}", . place_ty, . rv_ty, . terr . ); . } . } 8,556 ( 0.00%) TerminatorKind::SwitchInt { ref discr, switch_ty, .. } => { 6,417 ( 0.00%) self.check_operand(discr, term_location); . 2,139 ( 0.00%) let discr_ty = discr.ty(body, tcx); 4,278 ( 0.00%) if let Err(terr) = self.sub_types( . discr_ty, . switch_ty, . term_location.to_locations(), . ConstraintCategory::Assignment, . ) { . span_mirbug!( . self, . term, . "bad SwitchInt ({:?} on {:?}): {:?}", . switch_ty, . discr_ty, . terr . ); . } 2,592 ( 0.00%) if !switch_ty.is_integral() && !switch_ty.is_char() && !switch_ty.is_bool() { . span_mirbug!(self, term, "bad SwitchInt discr ty {:?}", switch_ty); . } . // FIXME: check the values . } 57,564 ( 0.00%) TerminatorKind::Call { ref func, ref args, ref destination, from_hir_call, .. } => { 47,970 ( 0.00%) self.check_operand(func, term_location); . for arg in args { 69,005 ( 0.00%) self.check_operand(arg, term_location); . } . 9,594 ( 0.00%) let func_ty = func.ty(body, tcx); . debug!("check_terminator: call, func_ty={:?}", func_ty); 38,376 ( 0.00%) let sig = match func_ty.kind() { 38,376 ( 0.00%) ty::FnDef(..) | ty::FnPtr(_) => func_ty.fn_sig(tcx), . _ => { . span_mirbug!(self, term, "call to non-function {:?}", func_ty); . return; . } . }; 95,940 ( 0.00%) let (sig, map) = self.infcx.replace_bound_vars_with_fresh_vars( 28,782 ( 0.00%) term.source_info.span, . LateBoundRegionConversionTime::FnCall, . sig, . ); 19,188 ( 0.00%) let sig = self.normalize(sig, term_location); 38,376 ( 0.00%) self.check_call_dest(body, term, &sig, destination, term_location); . . self.prove_predicates( 9,594 ( 0.00%) sig.inputs_and_output . .iter() 46,790 ( 0.00%) .map(|ty| ty::Binder::dummy(ty::PredicateKind::WellFormed(ty.into()))), . term_location.to_locations(), . ConstraintCategory::Boring, . ); . . // The ordinary liveness rules will ensure that all . // regions in the type of the callee are live here. We . // then further constrain the late-bound regions that . // were instantiated at the call site to be live as . // well. The resulting is that all the input (and . // output) types in the signature must be live, since . // all the inputs that fed into it were live. 75,628 ( 0.00%) for &late_bound_region in map.values() { . let region_vid = 18,064 ( 0.00%) self.borrowck_context.universal_regions.to_region_vid(late_bound_region); 18,064 ( 0.00%) self.borrowck_context . .constraints . .liveness_constraints . .add_element(region_vid, term_location); . } . 19,188 ( 0.00%) self.check_call_inputs(body, term, &sig, args, term_location, from_hir_call); . } 834 ( 0.00%) TerminatorKind::Assert { ref cond, ref msg, .. } => { 1,251 ( 0.00%) self.check_operand(cond, term_location); . 834 ( 0.00%) let cond_ty = cond.ty(body, tcx); 417 ( 0.00%) if cond_ty != tcx.types.bool { . span_mirbug!(self, term, "bad Assert ({:?}, not bool", cond_ty); . } . 1,106 ( 0.00%) if let AssertKind::BoundsCheck { ref len, ref index } = *msg { 68 ( 0.00%) if len.ty(body, tcx) != tcx.types.usize { . span_mirbug!(self, len, "bounds-check length non-usize {:?}", len) . } 68 ( 0.00%) if index.ty(body, tcx) != tcx.types.usize { . span_mirbug!(self, index, "bounds-check index non-usize {:?}", index) . } . } . } 2 ( 0.00%) TerminatorKind::Yield { ref value, .. } => { 3 ( 0.00%) self.check_operand(value, term_location); . 2 ( 0.00%) let value_ty = value.ty(body, tcx); 2 ( 0.00%) match body.yield_ty() { . None => span_mirbug!(self, term, "yield in non-generator"), 1 ( 0.00%) Some(ty) => { 2 ( 0.00%) if let Err(terr) = self.sub_types( . value_ty, . ty, . term_location.to_locations(), . ConstraintCategory::Yield, . ) { . span_mirbug!( . self, . term, -- line 1633 ---------------------------------------- -- line 1647 ---------------------------------------- . &mut self, . body: &Body<'tcx>, . term: &Terminator<'tcx>, . sig: &ty::FnSig<'tcx>, . destination: &Option<(Place<'tcx>, BasicBlock)>, . term_location: Location, . ) { . let tcx = self.tcx(); 38,376 ( 0.00%) match *destination { . Some((ref dest, _target_block)) => { . let dest_ty = dest.ty(body, tcx).ty; 56,472 ( 0.00%) let dest_ty = self.normalize(dest_ty, term_location); 47,060 ( 0.00%) let category = match dest.as_local() { . Some(RETURN_PLACE) => { 5,411 ( 0.00%) if let BorrowCheckContext { . universal_regions: . UniversalRegions { . defining_ty: . DefiningTy::Const(def_id, _) . | DefiningTy::InlineConst(def_id, _), . .. . }, . .. . } = self.borrowck_context . { 104 ( 0.00%) if tcx.is_static(*def_id) { . ConstraintCategory::UseAsStatic . } else { . ConstraintCategory::UseAsConst . } . } else { . ConstraintCategory::Return(ReturnConstraint::Normal) . } . } 3,984 ( 0.00%) Some(l) if !body.local_decls[l].is_user_variable() => { . ConstraintCategory::Boring . } . _ => ConstraintCategory::Assignment, . }; . . let locations = term_location.to_locations(); . 65,884 ( 0.00%) if let Err(terr) = self.sub_types(sig.output(), dest_ty, locations, category) { . span_mirbug!( . self, . term, . "call dest mismatch ({:?} <- {:?}): {:?}", . dest_ty, . sig.output(), . terr . ); . } . . // When `unsized_fn_params` and `unsized_locals` are both not enabled, . // this check is done at `check_local`. 9,412 ( 0.00%) if self.unsized_feature_enabled() { . let span = term.source_info.span; . self.ensure_place_sized(dest_ty, span); . } . } . None => { 182 ( 0.00%) if !self . .tcx() 546 ( 0.00%) .conservative_is_privately_uninhabited(self.param_env.and(sig.output())) . { . span_mirbug!(self, term, "call to converging function {:?} w/o dest", sig); . } . } . } . } . . fn check_call_inputs( -- line 1718 ---------------------------------------- -- line 1720 ---------------------------------------- . body: &Body<'tcx>, . term: &Terminator<'tcx>, . sig: &ty::FnSig<'tcx>, . args: &[Operand<'tcx>], . term_location: Location, . from_hir_call: bool, . ) { . debug!("check_call_inputs({:?}, {:?})", sig, args); 67,158 ( 0.00%) if args.len() < sig.inputs().len() || (args.len() > sig.inputs().len() && !sig.c_variadic) { . span_mirbug!(self, term, "call to {:?} with wrong # of args", sig); . } 46,790 ( 0.00%) for (n, (fn_arg, op_arg)) in iter::zip(sig.inputs(), args).enumerate() { . let op_arg_ty = op_arg.ty(body, self.tcx()); 55,204 ( 0.00%) let op_arg_ty = self.normalize(op_arg_ty, term_location); . let category = if from_hir_call { . ConstraintCategory::CallArgument . } else { . ConstraintCategory::Boring . }; 27,602 ( 0.00%) if let Err(terr) = 27,602 ( 0.00%) self.sub_types(op_arg_ty, fn_arg, term_location.to_locations(), category) . { . span_mirbug!( . self, . term, . "bad arg #{:?} ({:?} <- {:?}): {:?}", . n, . fn_arg, . op_arg_ty, . terr . ); . } . } . } . . fn check_iscleanup(&mut self, body: &Body<'tcx>, block_data: &BasicBlockData<'tcx>) { 16,994 ( 0.00%) let is_cleanup = block_data.is_cleanup; 83,157 ( 0.00%) self.last_span = block_data.terminator().source_info.span; 166,314 ( 0.00%) match block_data.terminator().kind { 3,759 ( 0.00%) TerminatorKind::Goto { target } => { 15,036 ( 0.00%) self.assert_iscleanup(body, block_data, target, is_cleanup) . } 2,139 ( 0.00%) TerminatorKind::SwitchInt { ref targets, .. } => { 2,139 ( 0.00%) for target in targets.all_targets() { 29,868 ( 0.00%) self.assert_iscleanup(body, block_data, *target, is_cleanup); . } . } . TerminatorKind::Resume => { 951 ( 0.00%) if !is_cleanup { . span_mirbug!(self, block_data, "resume on non-cleanup block!") . } . } . TerminatorKind::Abort => { . if !is_cleanup { . span_mirbug!(self, block_data, "abort on non-cleanup block!") . } . } . TerminatorKind::Return => { 2,309 ( 0.00%) if is_cleanup { . span_mirbug!(self, block_data, "return on cleanup block") . } . } . TerminatorKind::GeneratorDrop { .. } => { 1 ( 0.00%) if is_cleanup { . span_mirbug!(self, block_data, "generator_drop in cleanup block") . } . } 2 ( 0.00%) TerminatorKind::Yield { resume, drop, .. } => { 1 ( 0.00%) if is_cleanup { . span_mirbug!(self, block_data, "yield in cleanup block") . } 4 ( 0.00%) self.assert_iscleanup(body, block_data, resume, is_cleanup); 3 ( 0.00%) if let Some(drop) = drop { 4 ( 0.00%) self.assert_iscleanup(body, block_data, drop, is_cleanup); . } . } . TerminatorKind::Unreachable => {} . TerminatorKind::Drop { target, unwind, .. } . | TerminatorKind::DropAndReplace { target, unwind, .. } . | TerminatorKind::Assert { target, cleanup: unwind, .. } => { 36,665 ( 0.00%) self.assert_iscleanup(body, block_data, target, is_cleanup); 14,666 ( 0.00%) if let Some(unwind) = unwind { 3,994 ( 0.00%) if is_cleanup { . span_mirbug!(self, block_data, "unwind on cleanup block") . } . self.assert_iscleanup(body, block_data, unwind, true); . } . } 9,594 ( 0.00%) TerminatorKind::Call { ref destination, cleanup, .. } => { 47,424 ( 0.00%) if let &Some((_, target)) = destination { 18,824 ( 0.00%) self.assert_iscleanup(body, block_data, target, is_cleanup); . } 28,782 ( 0.00%) if let Some(cleanup) = cleanup { 9,589 ( 0.00%) if is_cleanup { . span_mirbug!(self, block_data, "cleanup on cleanup block") . } . self.assert_iscleanup(body, block_data, cleanup, true); . } . } 1,986 ( 0.00%) TerminatorKind::FalseEdge { real_target, imaginary_target } => { 5,958 ( 0.00%) self.assert_iscleanup(body, block_data, real_target, is_cleanup); 4,965 ( 0.00%) self.assert_iscleanup(body, block_data, imaginary_target, is_cleanup); . } 298 ( 0.00%) TerminatorKind::FalseUnwind { real_target, unwind } => { 745 ( 0.00%) self.assert_iscleanup(body, block_data, real_target, is_cleanup); 298 ( 0.00%) if let Some(unwind) = unwind { 149 ( 0.00%) if is_cleanup { . span_mirbug!(self, block_data, "cleanup in cleanup block via false unwind"); . } . self.assert_iscleanup(body, block_data, unwind, true); . } . } . TerminatorKind::InlineAsm { destination, cleanup, .. } => { . if let Some(target) = destination { . self.assert_iscleanup(body, block_data, target, is_cleanup); -- line 1834 ---------------------------------------- -- line 1838 ---------------------------------------- . span_mirbug!(self, block_data, "cleanup on cleanup block") . } . self.assert_iscleanup(body, block_data, cleanup, true); . } . } . } . } . 372,159 ( 0.01%) fn assert_iscleanup( . &mut self, . body: &Body<'tcx>, . ctxt: &dyn fmt::Debug, . bb: BasicBlock, . iscleanuppad: bool, . ) { 248,106 ( 0.00%) if body[bb].is_cleanup != iscleanuppad { . span_mirbug!(self, ctxt, "cleanuppad mismatch: {:?} should be {:?}", bb, iscleanuppad); . } 206,755 ( 0.00%) } . . fn check_local(&mut self, body: &Body<'tcx>, local: Local, local_decl: &LocalDecl<'tcx>) { . match body.local_kind(local) { . LocalKind::ReturnPointer | LocalKind::Arg => { . // return values of normal functions are required to be . // sized by typeck, but return values of ADT constructors are . // not because we don't include a `Self: Sized` bounds on them. . // -- line 1864 ---------------------------------------- -- line 1866 ---------------------------------------- . // - maybe we should make that a warning. . return; . } . LocalKind::Var | LocalKind::Temp => {} . } . . // When `unsized_fn_params` or `unsized_locals` is enabled, only function calls . // and nullary ops are checked in `check_call_dest`. 39,751 ( 0.00%) if !self.unsized_feature_enabled() { 79,502 ( 0.00%) let span = local_decl.source_info.span; 39,751 ( 0.00%) let ty = local_decl.ty; 79,502 ( 0.00%) self.ensure_place_sized(ty, span); . } . } . 357,759 ( 0.01%) fn ensure_place_sized(&mut self, ty: Ty<'tcx>, span: Span) { . let tcx = self.tcx(); . . // Erase the regions from `ty` to get a global type. The . // `Sized` bound in no way depends on precise regions, so this . // shouldn't affect `is_sized`. . let erased_ty = tcx.erase_regions(ty); 238,506 ( 0.00%) if !erased_ty.is_sized(tcx.at(span), self.param_env) { . // in current MIR construction, all non-control-flow rvalue . // expressions evaluate through `as_temp` or `into` a return . // slot or local, so to find all unsized rvalues it is enough . // to check all temps, return slots and locals. . if self.reported_errors.replace((ty, span)).is_none() { . let mut diag = struct_span_err!( . self.tcx().sess, . span, -- line 1896 ---------------------------------------- -- line 1901 ---------------------------------------- . ); . . // While this is located in `nll::typeck` this error is not . // an NLL error, it's a required check to prevent creation . // of unsized rvalues in a call expression. . diag.emit(); . } . } 238,506 ( 0.00%) } . . fn aggregate_field_ty( . &mut self, . ak: &AggregateKind<'tcx>, . field_index: usize, . location: Location, . ) -> Result, FieldAccessError> { . let tcx = self.tcx(); . 14,130 ( 0.00%) match *ak { 12,717 ( 0.00%) AggregateKind::Adt(adt_did, variant_index, substs, _, active_field_index) => { . let def = tcx.adt_def(adt_did); . let variant = &def.variants[variant_index]; . let adj_field_index = active_field_index.unwrap_or(field_index); 1,413 ( 0.00%) if let Some(field) = variant.fields.get(adj_field_index) { 12,717 ( 0.00%) Ok(self.normalize(field.ty(tcx, substs), location)) . } else { . Err(FieldAccessError::OutOfRange { field_count: variant.fields.len() }) . } . } 75 ( 0.00%) AggregateKind::Closure(_, substs) => { 900 ( 0.00%) match substs.as_closure().upvar_tys().nth(field_index) { . Some(ty) => Ok(ty), . None => Err(FieldAccessError::OutOfRange { . field_count: substs.as_closure().upvar_tys().count(), . }), . } . } 1 ( 0.00%) AggregateKind::Generator(_, substs, _) => { . // It doesn't make sense to look at a field beyond the prefix; . // these require a variant index, and are not initialized in . // aggregate rvalues. 12 ( 0.00%) match substs.as_generator().prefix_tys().nth(field_index) { . Some(ty) => Ok(ty), . None => Err(FieldAccessError::OutOfRange { . field_count: substs.as_generator().prefix_tys().count(), . }), . } . } 1,337 ( 0.00%) AggregateKind::Array(ty) => Ok(ty), . AggregateKind::Tuple => { . unreachable!("This should have been covered in check_rvalues"); . } . } . } . 311,675 ( 0.00%) fn check_operand(&mut self, op: &Operand<'tcx>, location: Location) { 89,050 ( 0.00%) if let Operand::Constant(constant) = op { 51,624 ( 0.00%) let maybe_uneval = match constant.literal { 51,624 ( 0.00%) ConstantKind::Ty(ct) => match ct.val { 1,448 ( 0.00%) ty::ConstKind::Unevaluated(uv) => Some(uv), . _ => None, . }, . _ => None, . }; 2,896 ( 0.00%) if let Some(uv) = maybe_uneval { 1,448 ( 0.00%) if uv.promoted.is_none() { . let tcx = self.tcx(); 2,702 ( 0.00%) let def_id = uv.def.def_id_for_type_of(); 1,544 ( 0.00%) if tcx.def_kind(def_id) == DefKind::InlineConst { . let predicates = self.prove_closure_bounds( . tcx, . def_id.expect_local(), . uv.substs, . location, . ); . self.normalize_and_prove_instantiated_predicates( . def_id, . predicates, . location.to_locations(), . ); . } . } . } . } 356,200 ( 0.01%) } . 416,793 ( 0.01%) fn check_rvalue(&mut self, body: &Body<'tcx>, rvalue: &Rvalue<'tcx>, location: Location) { . let tcx = self.tcx(); . 162,645 ( 0.00%) match rvalue { . Rvalue::Aggregate(ak, ops) => { . for op in ops { 22,095 ( 0.00%) self.check_operand(op, location); . } 6,386 ( 0.00%) self.check_aggregate_rvalue(&body, rvalue, ak, ops, location) . } . 30 ( 0.00%) Rvalue::Repeat(operand, len) => { 40 ( 0.00%) self.check_operand(operand, location); . . // If the length cannot be evaluated we must assume that the length can be larger . // than 1. . // If the length is larger than 1, the repeat expression will need to copy the . // element, so we require the `Copy` trait. 50 ( 0.00%) if len.try_eval_usize(tcx, self.param_env).map_or(true, |len| len > 1) { 20 ( 0.00%) match operand { . Operand::Copy(..) | Operand::Constant(..) => { . // These are always okay: direct use of a const, or a value that can evidently be copied. . } . Operand::Move(place) => { . // Make sure that repeated elements implement `Copy`. . let span = body.source_info(location).span; . let ty = operand.ty(body, tcx); . if !self.infcx.type_is_copy_modulo_regions(self.param_env, ty, span) { -- line 2014 ---------------------------------------- -- line 2045 ---------------------------------------- . } . } . } . } . } . . Rvalue::NullaryOp(_, ty) => { . let trait_ref = ty::TraitRef { 500 ( 0.00%) def_id: tcx.require_lang_item(LangItem::Sized, Some(self.last_span)), 100 ( 0.00%) substs: tcx.mk_substs_trait(ty, &[]), . }; . . self.prove_trait_ref( . trait_ref, . location.to_locations(), . ConstraintCategory::SizedBound, . ); . } . 50 ( 0.00%) Rvalue::ShallowInitBox(operand, ty) => { 100 ( 0.00%) self.check_operand(operand, location); . . let trait_ref = ty::TraitRef { 250 ( 0.00%) def_id: tcx.require_lang_item(LangItem::Sized, Some(self.last_span)), 25 ( 0.00%) substs: tcx.mk_substs_trait(ty, &[]), . }; . . self.prove_trait_ref( . trait_ref, . location.to_locations(), . ConstraintCategory::SizedBound, . ); . } . 7,132 ( 0.00%) Rvalue::Cast(cast_kind, op, ty) => { 7,132 ( 0.00%) self.check_operand(op, location); . 21,609 ( 0.00%) match cast_kind { . CastKind::Pointer(PointerCast::ReifyFnPointer) => { 4,272 ( 0.00%) let fn_sig = op.ty(body, tcx).fn_sig(tcx); . . // The type that we see in the fcx is like . // `foo::<'a, 'b>`, where `foo` is the path to a . // function definition. When we extract the . // signature, it comes from the `fn_sig` query, . // and hence may contain unnormalized results. 5,874 ( 0.00%) let fn_sig = self.normalize(fn_sig, location); . 534 ( 0.00%) let ty_fn_ptr_from = tcx.mk_fn_ptr(fn_sig); . 1,068 ( 0.00%) if let Err(terr) = self.eq_types( 534 ( 0.00%) ty, . ty_fn_ptr_from, . location.to_locations(), . ConstraintCategory::Cast, . ) { . span_mirbug!( . self, . rvalue, . "equating {:?} with {:?} yields {:?}", -- line 2104 ---------------------------------------- -- line 2158 ---------------------------------------- . ty_fn_ptr_from, . ty, . terr . ); . } . } . . CastKind::Pointer(PointerCast::Unsize) => { 3,261 ( 0.00%) let &ty = ty; . let trait_ref = ty::TraitRef { 11,957 ( 0.00%) def_id: tcx 1,087 ( 0.00%) .require_lang_item(LangItem::CoerceUnsized, Some(self.last_span)), 13,044 ( 0.00%) substs: tcx.mk_substs_trait(op.ty(body, tcx), &[ty.into()]), . }; . 9,783 ( 0.00%) self.prove_trait_ref( . trait_ref, . location.to_locations(), . ConstraintCategory::Cast, . ); . } . . CastKind::Pointer(PointerCast::MutToConstPointer) => { 45 ( 0.00%) let ty_from = match op.ty(body, tcx).kind() { . ty::RawPtr(ty::TypeAndMut { . ty: ty_from, . mutbl: hir::Mutability::Mut, 5 ( 0.00%) }) => ty_from, . _ => { . span_mirbug!( . self, . rvalue, . "unexpected base type for cast {:?}", . ty, . ); . return; . } . }; 30 ( 0.00%) let ty_to = match ty.kind() { . ty::RawPtr(ty::TypeAndMut { . ty: ty_to, . mutbl: hir::Mutability::Not, 5 ( 0.00%) }) => ty_to, . _ => { . span_mirbug!( . self, . rvalue, . "unexpected target type for cast {:?}", . ty, . ); . return; . } . }; 10 ( 0.00%) if let Err(terr) = self.sub_types( 5 ( 0.00%) ty_from, 5 ( 0.00%) ty_to, . location.to_locations(), . ConstraintCategory::Cast, . ) { . span_mirbug!( . self, . rvalue, . "relating {:?} with {:?} yields {:?}", . ty_from, -- line 2221 ---------------------------------------- -- line 2290 ---------------------------------------- . ty_elem, . ty_to, . terr . ) . } . } . . CastKind::Misc => { 157 ( 0.00%) let ty_from = op.ty(body, tcx); 628 ( 0.00%) let cast_ty_from = CastTy::from_ty(ty_from); 471 ( 0.00%) let cast_ty_to = CastTy::from_ty(ty); 2,035 ( 0.00%) match (cast_ty_from, cast_ty_to) { . (None, _) . | (_, None | Some(CastTy::FnPtr)) . | (Some(CastTy::Float), Some(CastTy::Ptr(_))) . | (Some(CastTy::Ptr(_) | CastTy::FnPtr), Some(CastTy::Float)) => { . span_mirbug!(self, rvalue, "Invalid cast {:?} -> {:?}", ty_from, ty,) . } . ( . Some(CastTy::Int(_)), -- line 2309 ---------------------------------------- -- line 2312 ---------------------------------------- . | (Some(CastTy::Float), Some(CastTy::Int(_) | CastTy::Float)) . | (Some(CastTy::Ptr(_)), Some(CastTy::Int(_) | CastTy::Ptr(_))) . | (Some(CastTy::FnPtr), Some(CastTy::Int(_) | CastTy::Ptr(_))) => (), . } . } . } . } . 14,631 ( 0.00%) Rvalue::Ref(region, _borrow_kind, borrowed_place) => { 87,786 ( 0.00%) self.add_reborrow_constraint(&body, location, region, borrowed_place); . } . . Rvalue::BinaryOp( . BinOp::Eq | BinOp::Ne | BinOp::Lt | BinOp::Le | BinOp::Gt | BinOp::Ge, 1,497 ( 0.00%) box (left, right), . ) => { 2,495 ( 0.00%) self.check_operand(left, location); 2,495 ( 0.00%) self.check_operand(right, location); . 499 ( 0.00%) let ty_left = left.ty(body, tcx); 1,497 ( 0.00%) match ty_left.kind() { . // Types with regions are comparable if they have a common super-type. . ty::RawPtr(_) | ty::FnPtr(_) => { 48 ( 0.00%) let ty_right = right.ty(body, tcx); 42 ( 0.00%) let common_ty = self.infcx.next_ty_var(TypeVariableOrigin { . kind: TypeVariableOriginKind::MiscVariable, 30 ( 0.00%) span: body.source_info(location).span, . }); 24 ( 0.00%) self.sub_types( . ty_left, . common_ty, . location.to_locations(), . ConstraintCategory::Boring, . ) . .unwrap_or_else(|err| { . bug!("Could not equate type variable with {:?}: {:?}", ty_left, err) . }); 12 ( 0.00%) if let Err(terr) = self.sub_types( . ty_right, . common_ty, . location.to_locations(), . ConstraintCategory::Boring, . ) { . span_mirbug!( . self, . rvalue, -- line 2357 ---------------------------------------- -- line 2360 ---------------------------------------- . ty_right, . terr . ) . } . } . // For types with no regions we can just check that the . // both operands have the same type. . ty::Int(_) | ty::Uint(_) | ty::Bool | ty::Char | ty::Float(_) 2,465 ( 0.00%) if ty_left == right.ty(body, tcx) => {} . // Other types are compared by trait methods, not by . // `Rvalue::BinaryOp`. . _ => span_mirbug!( . self, . rvalue, . "unexpected comparison types {:?} and {:?}", . ty_left, . right.ty(body, tcx) . ), . } . } . . Rvalue::Use(operand) | Rvalue::UnaryOp(_, operand) => { 21,192 ( 0.00%) self.check_operand(operand, location); . } . . Rvalue::BinaryOp(_, box (left, right)) . | Rvalue::CheckedBinaryOp(_, box (left, right)) => { 1,484 ( 0.00%) self.check_operand(left, location); 742 ( 0.00%) self.check_operand(right, location); . } . . Rvalue::AddressOf(..) . | Rvalue::ThreadLocalRef(..) . | Rvalue::Len(..) . | Rvalue::Discriminant(..) => {} . } 168,752 ( 0.00%) } . . /// If this rvalue supports a user-given type annotation, then . /// extract and return it. This represents the final type of the . /// rvalue and will be unified with the inferred type. . fn rvalue_user_ty(&self, rvalue: &Rvalue<'tcx>) -> Option { 128,244 ( 0.00%) match rvalue { . Rvalue::Use(_) . | Rvalue::ThreadLocalRef(_) . | Rvalue::Repeat(..) . | Rvalue::Ref(..) . | Rvalue::AddressOf(..) . | Rvalue::Len(..) . | Rvalue::Cast(..) . | Rvalue::ShallowInitBox(..) . | Rvalue::BinaryOp(..) . | Rvalue::CheckedBinaryOp(..) . | Rvalue::NullaryOp(..) . | Rvalue::UnaryOp(..) . | Rvalue::Discriminant(..) => None, . 9,579 ( 0.00%) Rvalue::Aggregate(aggregate, _) => match **aggregate { 5,172 ( 0.00%) AggregateKind::Adt(_, _, _, user_ty, _) => user_ty, . AggregateKind::Array(_) => None, . AggregateKind::Tuple => None, . AggregateKind::Closure(_, _) => None, . AggregateKind::Generator(_, _, _) => None, . }, . } . } . -- line 2426 ---------------------------------------- -- line 2431 ---------------------------------------- . aggregate_kind: &AggregateKind<'tcx>, . operands: &[Operand<'tcx>], . location: Location, . ) { . let tcx = self.tcx(); . . self.prove_aggregate_predicates(aggregate_kind, location); . 3,193 ( 0.00%) if *aggregate_kind == AggregateKind::Tuple { . // tuple rvalue field type is always the type of the op. Nothing to check here. . return; . } . 2,826 ( 0.00%) for (i, operand) in operands.iter().enumerate() { 229 ( 0.00%) let field_ty = match self.aggregate_field_ty(aggregate_kind, i, location) { 5,652 ( 0.00%) Ok(field_ty) => field_ty, . Err(FieldAccessError::OutOfRange { field_count }) => { . span_mirbug!( . self, . rvalue, . "accessed field #{} but variant only has {}", . i, . field_count . ); . continue; . } . }; . let operand_ty = operand.ty(body, tcx); 16,956 ( 0.00%) let operand_ty = self.normalize(operand_ty, location); . 5,652 ( 0.00%) if let Err(terr) = self.sub_types( . operand_ty, 2,826 ( 0.00%) field_ty, . location.to_locations(), . ConstraintCategory::Boring, . ) { . span_mirbug!( . self, . rvalue, . "{:?} is not a subtype of {:?}: {:?}", . operand_ty, -- line 2471 ---------------------------------------- -- line 2486 ---------------------------------------- . fn add_reborrow_constraint( . &mut self, . body: &Body<'tcx>, . location: Location, . borrow_region: ty::Region<'tcx>, . borrowed_place: &Place<'tcx>, . ) { . // These constraints are only meaningful during borrowck: 14,631 ( 0.00%) let BorrowCheckContext { borrow_set, location_table, all_facts, constraints, .. } = . self.borrowck_context; . . // In Polonius mode, we also push a `loan_issued_at` fact . // linking the loan to the region (in some cases, though, . // there is no loan associated with this borrow expression -- . // that occurs when we are borrowing an unsafe place, for . // example). 87,786 ( 0.00%) if let Some(all_facts) = all_facts { . let _prof_timer = self.infcx.tcx.prof.generic_activity("polonius_fact_generation"); . if let Some(borrow_index) = borrow_set.get_index_of(&location) { . let region_vid = borrow_region.to_region_vid(); . all_facts.loan_issued_at.push(( . region_vid, . borrow_index, . location_table.mid_index(location), . )); -- line 2510 ---------------------------------------- -- line 2516 ---------------------------------------- . // *p`, where the `p` has type `&'b mut Foo`, for example, we . // need to ensure that `'b: 'a`. . . debug!( . "add_reborrow_constraint({:?}, {:?}, {:?})", . location, borrow_region, borrowed_place . ); . 14,631 ( 0.00%) let mut cursor = borrowed_place.projection.as_ref(); 14,631 ( 0.00%) let tcx = self.infcx.tcx; 29,262 ( 0.00%) let field = path_utils::is_upvar_field_projection( . tcx, 29,262 ( 0.00%) &self.borrowck_context.upvars, . borrowed_place.as_ref(), . body, . ); 29,262 ( 0.00%) let category = if let Some(field) = field { 324 ( 0.00%) let var_hir_id = self.borrowck_context.upvars[field.index()].place.get_root_variable(); . // FIXME(project-rfc-2229#8): Use Place for better diagnostics . ConstraintCategory::ClosureUpvar(var_hir_id) . } else { . ConstraintCategory::Boring . }; . 81,041 ( 0.00%) while let [proj_base @ .., elem] = cursor { . cursor = proj_base; . . debug!("add_reborrow_constraint - iteration {:?}", elem); . 77,162 ( 0.00%) match elem { . ProjectionElem::Deref => { 20,358 ( 0.00%) let base_ty = Place::ty_from(borrowed_place.local, proj_base, body, tcx).ty; . . debug!("add_reborrow_constraint - base_ty = {:?}", base_ty); 50,907 ( 0.00%) match base_ty.kind() { . ty::Ref(ref_region, _, mutbl) => { 10,155 ( 0.00%) constraints.outlives_constraints.push(OutlivesConstraint { 20,310 ( 0.00%) sup: ref_region.to_region_vid(), . sub: borrow_region.to_region_vid(), . locations: location.to_locations(), . category, . variance_info: ty::VarianceDiagInfo::default(), . }); . 29,189 ( 0.00%) match mutbl { . hir::Mutability::Not => { . // Immutable reference. We don't need the base . // to be valid for the entire lifetime of . // the borrow. . break; . } . hir::Mutability::Mut => { . // Mutable reference. We *do* need the base -- line 2568 ---------------------------------------- -- line 2588 ---------------------------------------- . // ``` . } . } . } . ty::RawPtr(..) => { . // deref of raw pointer, guaranteed to be valid . break; . } 18 ( 0.00%) ty::Adt(def, _) if def.is_box() => { . // deref of `Box`, need the base to be valid - propagate . } . _ => bug!("unexpected deref ty {:?} in {:?}", base_ty, borrowed_place), . } . } . ProjectionElem::Field(..) . | ProjectionElem::Downcast(..) . | ProjectionElem::Index(..) -- line 2604 ---------------------------------------- -- line 2617 ---------------------------------------- . ) { . let tcx = self.tcx(); . . debug!( . "prove_aggregate_predicates(aggregate_kind={:?}, location={:?})", . aggregate_kind, location . ); . 40,631 ( 0.00%) let (def_id, instantiated_predicates) = match aggregate_kind { . AggregateKind::Adt(adt_did, _, substs, _, _) => { 13,792 ( 0.00%) (*adt_did, tcx.predicates_of(*adt_did).instantiate(tcx, substs)) . } . . // For closures, we have some **extra requirements** we . // . // have to check. In particular, in their upvars and . // signatures, closures often reference various regions . // from the surrounding function -- we call those the . // closure's free regions. When we borrow-check (and hence -- line 2635 ---------------------------------------- -- line 2644 ---------------------------------------- . // . // Despite the opacity of the previous parapgrah, this is . // actually relatively easy to understand in terms of the . // desugaring. A closure gets desugared to a struct, and . // these extra requirements are basically like where . // clauses on the struct. . AggregateKind::Closure(def_id, substs) . | AggregateKind::Generator(def_id, substs, _) => { 1,344 ( 0.00%) (*def_id, self.prove_closure_bounds(tcx, def_id.expect_local(), substs, location)) . } . . AggregateKind::Array(_) | AggregateKind::Tuple => { 2,714 ( 0.00%) (CRATE_DEF_ID.to_def_id(), ty::InstantiatedPredicates::empty()) . } . }; . 3,193 ( 0.00%) self.normalize_and_prove_instantiated_predicates( . def_id, 9,579 ( 0.00%) instantiated_predicates, . location.to_locations(), . ); . } . 1,008 ( 0.00%) fn prove_closure_bounds( . &mut self, . tcx: TyCtxt<'tcx>, . def_id: LocalDefId, . substs: SubstsRef<'tcx>, . location: Location, . ) -> ty::InstantiatedPredicates<'tcx> { 336 ( 0.00%) if let Some(ref closure_region_requirements) = tcx.mir_borrowck(def_id).closure_requirements . { 7 ( 0.00%) let closure_constraints = QueryRegionConstraints { 42 ( 0.00%) outlives: closure_region_requirements.apply_requirements( . tcx, . def_id.to_def_id(), . substs, . ), . . // Presently, closures never propagate member . // constraints to their parents -- they are enforced . // locally. This is largely a non-issue as member -- line 2685 ---------------------------------------- -- line 2688 ---------------------------------------- . // closures. . member_constraints: vec![], . }; . . let bounds_mapping = closure_constraints . .outlives . .iter() . .enumerate() 23 ( 0.00%) .filter_map(|(idx, constraint)| { . let ty::OutlivesPredicate(k1, r2) = 18 ( 0.00%) constraint.no_bound_vars().unwrap_or_else(|| { . bug!("query_constraint {:?} contained bound vars", constraint,); . }); . . match k1.unpack() { . GenericArgKind::Lifetime(r1) => { . // constraint is r1: r2 . let r1_vid = self.borrowck_context.universal_regions.to_region_vid(r1); . let r2_vid = self.borrowck_context.universal_regions.to_region_vid(r2); . let outlives_requirements = . &closure_region_requirements.outlives_requirements[idx]; . Some(( . (r1_vid, r2_vid), 9 ( 0.00%) (outlives_requirements.category, outlives_requirements.blame_span), . )) . } . GenericArgKind::Type(_) | GenericArgKind::Const(_) => None, . } . }) . .collect(); . . let existing = self . .borrowck_context . .constraints . .closure_bounds_mapping . .insert(location, bounds_mapping); 7 ( 0.00%) assert!(existing.is_none(), "Multiple closures at the same location."); . . self.push_region_constraints( . location.to_locations(), . ConstraintCategory::ClosureBounds, . &closure_constraints, . ); . } . 336 ( 0.00%) tcx.predicates_of(def_id).instantiate(tcx, substs) 896 ( 0.00%) } . 34,695 ( 0.00%) #[instrument(skip(self, body), level = "debug")] . fn typeck_mir(&mut self, body: &Body<'tcx>) { 9,252 ( 0.00%) self.last_span = body.span; . debug!(?body.span); . . for (local, local_decl) in body.local_decls.iter_enumerated() { . self.check_local(&body, local, local_decl); . } . . for (block, block_data) in body.basic_blocks().iter_enumerated() { . let mut location = Location { block, statement_index: 0 }; . for stmt in &block_data.statements { 412,008 ( 0.01%) if !stmt.source_info.span.is_dummy() { 411,504 ( 0.01%) self.last_span = stmt.source_info.span; . } . self.check_stmt(body, stmt, location); 42,198 ( 0.00%) location.statement_index += 1; . } . . self.check_terminator(&body, block_data.terminator(), location); . self.check_iscleanup(&body, block_data); . } . } . } . -- line 2760 ---------------------------------------- -- line 2765 ---------------------------------------- . impl NormalizeLocation for Locations { . fn to_locations(self) -> Locations { . self . } . } . . impl NormalizeLocation for Location { . fn to_locations(self) -> Locations { 393,230 ( 0.01%) Locations::Single(self) . } . } . . #[derive(Debug, Default)] . struct ObligationAccumulator<'tcx> { . obligations: PredicateObligations<'tcx>, . } . -- line 2781 ---------------------------------------- 1,031,125 ( 0.02%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/freshen.rs -------------------------------------------------------------------------------- Ir -- line 47 ---------------------------------------- . const_freshen_count: u32, . ty_freshen_map: FxHashMap>, . const_freshen_map: FxHashMap, &'tcx ty::Const<'tcx>>, . keep_static: bool, . } . . impl<'a, 'tcx> TypeFreshener<'a, 'tcx> { . pub fn new(infcx: &'a InferCtxt<'a, 'tcx>, keep_static: bool) -> TypeFreshener<'a, 'tcx> { 1,763,795 ( 0.03%) TypeFreshener { . infcx, . ty_freshen_count: 0, . const_freshen_count: 0, . ty_freshen_map: Default::default(), . const_freshen_map: Default::default(), . keep_static, . } . } . 628,760 ( 0.01%) fn freshen_ty( . &mut self, . opt_ty: Option>, . key: ty::InferTy, . freshener: F, . ) -> Ty<'tcx> . where . F: FnOnce(u32) -> ty::InferTy, . { 157,190 ( 0.00%) if let Some(ty) = opt_ty { . return ty.fold_with(self); . } . 96,414 ( 0.00%) match self.ty_freshen_map.entry(key) { 5,611 ( 0.00%) Entry::Occupied(entry) => *entry.get(), . Entry::Vacant(entry) => { 42,596 ( 0.00%) let index = self.ty_freshen_count; 170,384 ( 0.00%) self.ty_freshen_count += 1; 85,192 ( 0.00%) let t = self.infcx.tcx.mk_ty_infer(freshener(index)); . entry.insert(t); . t . } . } 433,863 ( 0.01%) } . . fn freshen_const( . &mut self, . opt_ct: Option<&'tcx ty::Const<'tcx>>, . key: ty::InferConst<'tcx>, . freshener: F, . ty: Ty<'tcx>, . ) -> &'tcx ty::Const<'tcx> -- line 96 ---------------------------------------- -- line 111 ---------------------------------------- . ct . } . } . } . } . . impl<'a, 'tcx> TypeFolder<'tcx> for TypeFreshener<'a, 'tcx> { . fn tcx<'b>(&'b self) -> TyCtxt<'tcx> { 608,082 ( 0.01%) self.infcx.tcx 112,973 ( 0.00%) } . . fn fold_region(&mut self, r: ty::Region<'tcx>) -> ty::Region<'tcx> { 434,684 ( 0.01%) match *r { . ty::ReLateBound(..) => { . // leave bound regions alone . r . } . . ty::ReEarlyBound(..) . | ty::ReFree(_) . | ty::ReVar(_) . | ty::RePlaceholder(..) . | ty::ReEmpty(_) . | ty::ReErased => { . // replace all free regions with 'erased . self.tcx().lifetimes.re_erased . } . ty::ReStatic => { 17,808 ( 0.00%) if self.keep_static { . r . } else { . self.tcx().lifetimes.re_erased . } . } . } 109 ( 0.00%) } . 2,341,692 ( 0.03%) fn fold_ty(&mut self, t: Ty<'tcx>) -> Ty<'tcx> { 1,170,846 ( 0.02%) if !t.needs_infer() && !t.has_erasable_regions() { . return t; . } . . let tcx = self.infcx.tcx; . 1,201,783 ( 0.02%) match *t.kind() { 76,295 ( 0.00%) ty::Infer(ty::TyVar(v)) => { 610,360 ( 0.01%) let opt_ty = self.infcx.inner.borrow_mut().type_variables().probe(v).known(); 686,655 ( 0.01%) self.freshen_ty(opt_ty, ty::TyVar(v), ty::FreshTy) . } . 9,168 ( 0.00%) ty::Infer(ty::IntVar(v)) => self.freshen_ty( 18,336 ( 0.00%) self.infcx . .inner . .borrow_mut() . .int_unification_table() . .probe_value(v) . .map(|v| v.to_type(tcx)), . ty::IntVar(v), . ty::FreshIntTy, . ), . 40 ( 0.00%) ty::Infer(ty::FloatVar(v)) => self.freshen_ty( 64 ( 0.00%) self.infcx . .inner . .borrow_mut() . .float_unification_table() . .probe_value(v) . .map(|v| v.to_type(tcx)), . ty::FloatVar(v), . ty::FreshFloatTy, . ), -- line 181 ---------------------------------------- -- line 210 ---------------------------------------- . | ty::Dynamic(..) . | ty::Never . | ty::Tuple(..) . | ty::Projection(..) . | ty::Foreign(..) . | ty::Param(..) . | ty::Closure(..) . | ty::GeneratorWitness(..) 1,108,888 ( 0.02%) | ty::Opaque(..) => t.super_fold_with(self), . . ty::Placeholder(..) | ty::Bound(..) => bug!("unexpected type {:?}", t), . } 1,227,632 ( 0.02%) } . 20,160 ( 0.00%) fn fold_const(&mut self, ct: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> { 20,160 ( 0.00%) match ct.val { . ty::ConstKind::Infer(ty::InferConst::Var(v)) => { . let opt_ct = self . .infcx . .inner . .borrow_mut() . .const_unification_table() . .probe_value(v) . .val -- line 233 ---------------------------------------- -- line 256 ---------------------------------------- . } . . ty::ConstKind::Param(_) . | ty::ConstKind::Value(_) . | ty::ConstKind::Unevaluated(..) . | ty::ConstKind::Error(_) => {} . } . 26,880 ( 0.00%) ct.super_fold_with(self) . } . } 826,854 ( 0.01%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/sip128.rs -------------------------------------------------------------------------------- Ir -- line 91 ---------------------------------------- . // maximum of number bytes needed to fill an 8-byte-sized element on which . // SipHash operates. Note that for variable-sized copies which are known to be . // less than 8 bytes, this function will perform more work than necessary unless . // the compiler is able to optimize the extra work away. . #[inline] . unsafe fn copy_nonoverlapping_small(src: *const u8, dst: *mut u8, count: usize) { . debug_assert!(count <= 8); . 125,465 ( 0.00%) if count == 8 { . ptr::copy_nonoverlapping(src, dst, 8); . return; . } . . let mut i = 0; 139,038 ( 0.00%) if i + 3 < count { . ptr::copy_nonoverlapping(src.add(i), dst.add(i), 4); . i += 4; . } . 300,319 ( 0.00%) if i + 1 < count { . ptr::copy_nonoverlapping(src.add(i), dst.add(i), 2); 37,435 ( 0.00%) i += 2 . } . 139,038 ( 0.00%) if i < count { 97,677 ( 0.00%) *dst.add(i) = *src.add(i); . i += 1; . } . . debug_assert_eq!(i, count); . } . . // # Implementation . // -- line 124 ---------------------------------------- -- line 201 ---------------------------------------- . . hasher . } . . // A specialized write function for values with size <= 8. . #[inline] . fn short_write(&mut self, x: T) { . let size = mem::size_of::(); 1,891,270 ( 0.03%) let nbuf = self.nbuf; . debug_assert!(size <= 8); . debug_assert!(nbuf < BUFFER_SIZE); . debug_assert!(nbuf + size < BUFFER_WITH_SPILL_SIZE); . 12,742,598 ( 0.19%) if nbuf + size < BUFFER_SIZE { . unsafe { . // The memcpy call is optimized away because the size is known. . let dst = (self.buf.as_mut_ptr() as *mut u8).add(nbuf); . ptr::copy_nonoverlapping(&x as *const _ as *const u8, dst, size); . } . 4,004,309 ( 0.06%) self.nbuf = nbuf + size; . . return; . } . 630,370 ( 0.01%) unsafe { self.short_write_process_buffer(x) } . } . . // A specialized write function for values with size <= 8 that should only . // be called when the write would cause the buffer to fill. . // . // SAFETY: the write of `x` into `self.buf` starting at byte offset . // `self.nbuf` must cause `self.buf` to become fully initialized (and not . // overflow) if it wasn't already. . #[inline(never)] 188,518 ( 0.00%) unsafe fn short_write_process_buffer(&mut self, x: T) { . let size = mem::size_of::(); 188,518 ( 0.00%) let nbuf = self.nbuf; . debug_assert!(size <= 8); . debug_assert!(nbuf < BUFFER_SIZE); . debug_assert!(nbuf + size >= BUFFER_SIZE); . debug_assert!(nbuf + size < BUFFER_WITH_SPILL_SIZE); . . // Copy first part of input into end of buffer, possibly into spill . // element. The memcpy call is optimized away because the size is known. . let dst = (self.buf.as_mut_ptr() as *mut u8).add(nbuf); . ptr::copy_nonoverlapping(&x as *const _ as *const u8, dst, size); . . // Process buffer. . for i in 0..BUFFER_CAPACITY { 1,885,180 ( 0.03%) let elem = self.buf.get_unchecked(i).assume_init().to_le(); 1,508,144 ( 0.02%) self.state.v3 ^= elem; . Sip24Rounds::c_rounds(&mut self.state); 1,696,662 ( 0.02%) self.state.v0 ^= elem; . } . . // Copy remaining input into start of buffer by copying size - 1 . // elements from spill (at most size - 1 bytes could have overflowed . // into the spill). The memcpy call is optimized away because the size . // is known. And the whole copy is optimized away for size == 1. . let src = self.buf.get_unchecked(BUFFER_SPILL_INDEX) as *const _ as *const u8; . ptr::copy_nonoverlapping(src, self.buf.as_mut_ptr() as *mut u8, size - 1); . . // This function should only be called when the write fills the buffer. . // Therefore, when size == 1, the new `self.nbuf` must be zero. The size . // is statically known, so the branch is optimized away. 879,234 ( 0.01%) self.nbuf = if size == 1 { 0 } else { nbuf + size - BUFFER_SIZE }; 754,072 ( 0.01%) self.processed += BUFFER_SIZE; 377,036 ( 0.01%) } . . // A write function for byte slices. . #[inline] . fn slice_write(&mut self, msg: &[u8]) { . let length = msg.len(); 18,944 ( 0.00%) let nbuf = self.nbuf; . debug_assert!(nbuf < BUFFER_SIZE); . 432,968 ( 0.01%) if nbuf + length < BUFFER_SIZE { . unsafe { . let dst = (self.buf.as_mut_ptr() as *mut u8).add(nbuf); . 154,136 ( 0.00%) if length <= 8 { . copy_nonoverlapping_small(msg.as_ptr(), dst, length); . } else { . // This memcpy is *not* optimized away. . ptr::copy_nonoverlapping(msg.as_ptr(), dst, length); . } . } . 79,235 ( 0.00%) self.nbuf = nbuf + length; . . return; . } . 65,519 ( 0.00%) unsafe { self.slice_write_process_buffer(msg) } . } . . // A write function for byte slices that should only be called when the . // write would cause the buffer to fill. . // . // SAFETY: `self.buf` must be initialized up to the byte offset `self.nbuf`, . // and `msg` must contain enough bytes to initialize the rest of the element . // containing the byte offset `self.nbuf`. . #[inline(never)] 39,255 ( 0.00%) unsafe fn slice_write_process_buffer(&mut self, msg: &[u8]) { . let length = msg.len(); 7,851 ( 0.00%) let nbuf = self.nbuf; . debug_assert!(nbuf < BUFFER_SIZE); . debug_assert!(nbuf + length >= BUFFER_SIZE); . . // Always copy first part of input into current element of buffer. . // This function should only be called when the write fills the buffer, . // so we know that there is enough input to fill the current element. 23,553 ( 0.00%) let valid_in_elem = nbuf % ELEM_SIZE; 7,851 ( 0.00%) let needed_in_elem = ELEM_SIZE - valid_in_elem; . . let src = msg.as_ptr(); . let dst = (self.buf.as_mut_ptr() as *mut u8).add(nbuf); . copy_nonoverlapping_small(src, dst, needed_in_elem); . . // Process buffer. . . // Using `nbuf / ELEM_SIZE + 1` rather than `(nbuf + needed_in_elem) / . // ELEM_SIZE` to show the compiler that this loop's upper bound is > 0. . // We know that is true, because last step ensured we have a full . // element in the buffer. 15,702 ( 0.00%) let last = nbuf / ELEM_SIZE + 1; . . for i in 0..last { 59,809 ( 0.00%) let elem = self.buf.get_unchecked(i).assume_init().to_le(); 67,660 ( 0.00%) self.state.v3 ^= elem; . Sip24Rounds::c_rounds(&mut self.state); 119,618 ( 0.00%) self.state.v0 ^= elem; . } . . // Process the remaining element-sized chunks of input. . let mut processed = needed_in_elem; 15,702 ( 0.00%) let input_left = length - processed; 10,320 ( 0.00%) let elems_left = input_left / ELEM_SIZE; . let extra_bytes_left = input_left % ELEM_SIZE; . . for _ in 0..elems_left { 5,815 ( 0.00%) let elem = (msg.as_ptr().add(processed) as *const u64).read_unaligned().to_le(); 5,815 ( 0.00%) self.state.v3 ^= elem; . Sip24Rounds::c_rounds(&mut self.state); 5,815 ( 0.00%) self.state.v0 ^= elem; 11,630 ( 0.00%) processed += ELEM_SIZE; . } . . // Copy remaining input into start of buffer. . let src = msg.as_ptr().add(processed); . let dst = self.buf.as_mut_ptr() as *mut u8; . copy_nonoverlapping_small(src, dst, extra_bytes_left); . 7,851 ( 0.00%) self.nbuf = extra_bytes_left; 39,255 ( 0.00%) self.processed += nbuf + processed; 47,106 ( 0.00%) } . . #[inline] . pub fn finish128(mut self) -> (u64, u64) { . debug_assert!(self.nbuf < BUFFER_SIZE); . . // Process full elements in buffer. 83,073 ( 0.00%) let last = self.nbuf / ELEM_SIZE; . . // Since we're consuming self, avoid updating members for a potential . // performance gain. 110,764 ( 0.00%) let mut state = self.state; . . for i in 0..last { 77,565 ( 0.00%) let elem = unsafe { self.buf.get_unchecked(i).assume_init().to_le() }; 77,565 ( 0.00%) state.v3 ^= elem; . Sip24Rounds::c_rounds(&mut state); 77,565 ( 0.00%) state.v0 ^= elem; . } . . // Get remaining partial element. 55,382 ( 0.00%) let elem = if self.nbuf % ELEM_SIZE != 0 { . unsafe { . // Ensure element is initialized by writing zero bytes. At most . // `ELEM_SIZE - 1` are required given the above check. It's safe . // to write this many because we have the spill and we maintain . // `self.nbuf` such that this write will start before the spill. . let dst = (self.buf.as_mut_ptr() as *mut u8).add(self.nbuf); . ptr::write_bytes(dst, 0, ELEM_SIZE - 1); 24,214 ( 0.00%) self.buf.get_unchecked(last).assume_init().to_le() . } . } else { . 0 . }; . . // Finalize the hash. 79,596 ( 0.00%) let length = self.processed + self.nbuf; 55,380 ( 0.00%) let b: u64 = ((length as u64 & 0xff) << 56) | elem; . 27,690 ( 0.00%) state.v3 ^= b; . Sip24Rounds::c_rounds(&mut state); 27,690 ( 0.00%) state.v0 ^= b; . 27,690 ( 0.00%) state.v2 ^= 0xee; . Sip24Rounds::d_rounds(&mut state); 87,668 ( 0.00%) let _0 = state.v0 ^ state.v1 ^ state.v2 ^ state.v3; . 32,286 ( 0.00%) state.v1 ^= 0xdd; . Sip24Rounds::d_rounds(&mut state); 32,286 ( 0.00%) let _1 = state.v0 ^ state.v1 ^ state.v2 ^ state.v3; . . (_0, _1) . } . } . . impl Hasher for SipHasher128 { . #[inline] . fn write_u8(&mut self, i: u8) { -- line 414 ---------------------------------------- -- line 471 ---------------------------------------- . } . . #[derive(Debug, Clone, Default)] . struct Sip24Rounds; . . impl Sip24Rounds { . #[inline] . fn c_rounds(state: &mut State) { 6,928,163 ( 0.10%) compress!(state); 7,461,073 ( 0.11%) compress!(state); . } . . #[inline] . fn d_rounds(state: &mut State) { 175,332 ( 0.00%) compress!(state); 175,332 ( 0.00%) compress!(state); 175,332 ( 0.00%) compress!(state); 147,643 ( 0.00%) compress!(state); . } . } 1,468,659 ( 0.02%) -------------------------------------------------------------------------------- -- 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. 269,122 ( 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::() == 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. 1,321,644 ( 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::() == 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`. 99 ( 0.00%) self.end = unsafe { self.end.offset(-offset) }; . self.end . } . } . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl ExactSizeIterator for $name<'_, T> { . #[inline(always)] . fn len(&self) -> usize { 496,851 ( 0.01%) 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 { 598,920 ( 0.01%) assume(!self.ptr.as_ptr().is_null()); . if mem::size_of::() != 0 { 209,426 ( 0.00%) assume(!self.end.is_null()); . } 114,400,330 ( 1.66%) if is_empty!(self) { . None . } else { 39 ( 0.00%) Some(next_unchecked!(self)) . } . } . } . . #[inline] . fn size_hint(&self) -> (usize, Option) { 4,068,014 ( 0.06%) let exact = len!(self); . (exact, Some(exact)) . } . . #[inline] . fn count(self) -> usize { . len!(self) . } . . #[inline] . fn nth(&mut self, n: usize) -> Option<$elem> { 81,609 ( 0.00%) if n >= len!(self) { . // This iterator is now empty. . if mem::size_of::() == 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(mut self, mut f: F) . where . Self: Sized, . F: FnMut(Self::Item), . { . while let Some(x) = self.next() { 25,536 ( 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(&mut self, mut f: F) -> bool . where . Self: Sized, . F: FnMut(Self::Item) -> bool, . { 5,532 ( 0.00%) while let Some(x) = self.next() { 30,123 ( 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] 536 ( 0.00%) fn any(&mut self, mut f: F) -> bool . where . Self: Sized, . F: FnMut(Self::Item) -> bool, . { 2,040,440 ( 0.03%) while let Some(x) = self.next() { 1,699,809 ( 0.02%) if f(x) { . return true; . } . } . false 536 ( 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

(&mut self, mut predicate: P) -> Option . where . Self: Sized, . P: FnMut(&Self::Item) -> bool, . { 93,672 ( 0.00%) while let Some(x) = self.next() { 203,656 ( 0.00%) if predicate(&x) { 6 ( 0.00%) return Some(x); . } . } . None 4,769 ( 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(&mut self, mut f: F) -> Option . where . Self: Sized, . F: FnMut(Self::Item) -> Option, . { 104,357 ( 0.00%) while let Some(x) = self.next() { 525,952 ( 0.01%) if let Some(y) = f(x) { 75,088 ( 0.00%) return Some(y); . } . } . None 13,598 ( 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

(&mut self, mut predicate: P) -> Option where . Self: Sized, . P: FnMut(Self::Item) -> bool, . { . let n = len!(self); . let mut i = 0; . while let Some(x) = self.next() { 1,265,059 ( 0.02%) 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

(&mut self, mut predicate: P) -> Option where . P: FnMut(Self::Item) -> bool, . Self: Sized + ExactSizeIterator + DoubleEndedIterator . { . let n = len!(self); . let mut i = n; 29,051 ( 0.00%) while let Some(x) = self.next_back() { 378,032 ( 0.01%) i -= 1; 278,966 ( 0.00%) 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` 269,650 ( 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 349 ---------------------------------------- . fn next_back(&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_back_unchecked!` is safe since we check if the iterator is . // empty first. . unsafe { 56 ( 0.00%) assume(!self.ptr.as_ptr().is_null()); . if mem::size_of::() != 0 { 93 ( 0.00%) assume(!self.end.is_null()); . } 3,656,571 ( 0.05%) if is_empty!(self) { . None . } else { . Some(next_back_unchecked!(self)) . } . } . } . . #[inline] -- line 369 ---------------------------------------- 25,317,910 ( 0.37%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/std/src/collections/hash/map.rs -------------------------------------------------------------------------------- Ir -- line 270 ---------------------------------------- . /// . /// let s = RandomState::new(); . /// let mut map = HashMap::with_hasher(s); . /// map.insert(1, 2); . /// ``` . #[inline] . #[stable(feature = "hashmap_build_hasher", since = "1.7.0")] . pub fn with_hasher(hash_builder: S) -> HashMap { 2,138,723 ( 0.03%) HashMap { base: base::HashMap::with_hasher(hash_builder) } . } . . /// Creates an empty `HashMap` with the specified capacity, using `hash_builder` . /// to hash the keys. . /// . /// The hash map will be able to hold at least `capacity` elements without . /// reallocating. If `capacity` is 0, the hash map will not allocate. . /// -- line 286 ---------------------------------------- -- line 300 ---------------------------------------- . /// . /// let s = RandomState::new(); . /// let mut map = HashMap::with_capacity_and_hasher(10, s); . /// map.insert(1, 2); . /// ``` . #[inline] . #[stable(feature = "hashmap_build_hasher", since = "1.7.0")] . pub fn with_capacity_and_hasher(capacity: usize, hash_builder: S) -> HashMap { 10,298 ( 0.00%) HashMap { base: base::HashMap::with_capacity_and_hasher(capacity, hash_builder) } . } . . /// Returns the number of elements the map can hold without reallocating. . /// . /// This number is a lower bound; the `HashMap` might be able to hold . /// more, but is guaranteed to be able to hold at least this many. . /// . /// # Examples -- line 316 ---------------------------------------- -- line 468 ---------------------------------------- . /// ]); . /// . /// for (key, val) in map.iter() { . /// println!("key: {} val: {}", key, val); . /// } . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . pub fn iter(&self) -> Iter<'_, K, V> { 23,590 ( 0.00%) Iter { base: self.base.iter() } . } . . /// An iterator visiting all key-value pairs in arbitrary order, . /// with mutable references to the values. . /// The iterator element type is `(&'a K, &'a mut V)`. . /// . /// # Examples . /// -- line 484 ---------------------------------------- -- line 643 ---------------------------------------- . /// let mut a = HashMap::new(); . /// a.insert(1, "a"); . /// a.clear(); . /// assert!(a.is_empty()); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn clear(&mut self) { 1 ( 0.00%) self.base.clear(); . } . . /// Returns a reference to the map's [`BuildHasher`]. . /// . /// # Examples . /// . /// ``` . /// use std::collections::HashMap; -- line 659 ---------------------------------------- -- line 688 ---------------------------------------- . /// ``` . /// use std::collections::HashMap; . /// let mut map: HashMap<&str, i32> = HashMap::new(); . /// map.reserve(10); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn reserve(&mut self, additional: usize) { 1 ( 0.00%) self.base.reserve(additional) . } . . /// Tries to reserve capacity for at least `additional` more elements to be inserted . /// in the given `HashMap`. The collection may reserve more space to avoid . /// frequent reallocations. . /// . /// # Errors . /// -- line 704 ---------------------------------------- -- line 784 ---------------------------------------- . /// assert_eq!(letters[&'s'], 2); . /// assert_eq!(letters[&'t'], 3); . /// assert_eq!(letters[&'u'], 1); . /// assert_eq!(letters.get(&'y'), None); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn entry(&mut self, key: K) -> Entry<'_, K, V> { 2,535,817 ( 0.04%) map_entry(self.base.rustc_entry(key)) . } . . /// Returns a 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. . /// -- line 800 ---------------------------------------- -- line 805 ---------------------------------------- . /// . /// let mut map = HashMap::new(); . /// map.insert(1, "a"); . /// assert_eq!(map.get(&1), Some(&"a")); . /// assert_eq!(map.get(&2), None); . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . #[inline] 1,629,502 ( 0.02%) pub fn get(&self, k: &Q) -> Option<&V> . where . K: Borrow, . Q: Hash + Eq, . { . self.base.get(k) 2,365,624 ( 0.03%) } . . /// 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 . /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for . /// the key type. . /// . /// # Examples -- line 827 ---------------------------------------- -- line 862 ---------------------------------------- . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn contains_key(&self, k: &Q) -> bool . where . K: Borrow, . Q: Hash + Eq, . { 91,731 ( 0.00%) self.base.contains_key(k) . } . . /// 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. . /// -- line 878 ---------------------------------------- -- line 890 ---------------------------------------- . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn get_mut(&mut self, k: &Q) -> Option<&mut V> . where . K: Borrow, . Q: Hash + Eq, . { 2,884 ( 0.00%) self.base.get_mut(k) . } . . /// Inserts a key-value pair into the map. . /// . /// If the map did not have this key present, [`None`] is returned. . /// . /// If the map did have this key present, the value is updated, and the old . /// value is returned. The key is not updated, though; this matters for -- line 906 ---------------------------------------- -- line 920 ---------------------------------------- . /// . /// map.insert(37, "b"); . /// assert_eq!(map.insert(37, "c"), Some("b")); . /// assert_eq!(map[&37], "c"); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn insert(&mut self, k: K, v: V) -> Option { 4,738,118 ( 0.07%) self.base.insert(k, v) . } . . /// Tries to insert a key-value pair into the map, and returns . /// a mutable reference to the value in the entry. . /// . /// If the map already had this key present, nothing is updated, and . /// an error containing the occupied entry and the value is returned. . /// -- line 936 ---------------------------------------- -- line 978 ---------------------------------------- . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn remove(&mut self, k: &Q) -> Option . where . K: Borrow, . Q: Hash + Eq, . { 405,922 ( 0.01%) self.base.remove(k) . } . . /// 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 994 ---------------------------------------- -- line 1083 ---------------------------------------- . impl Clone for HashMap . where . K: Clone, . V: Clone, . S: Clone, . { . #[inline] . fn clone(&self) -> Self { 12,695 ( 0.00%) Self { base: self.base.clone() } . } . . #[inline] . fn clone_from(&mut self, other: &Self) { . self.base.clone_from(&other.base); . } . } . -- line 1099 ---------------------------------------- -- line 1155 ---------------------------------------- . type Output = V; . . /// Returns a reference to the value corresponding to the supplied key. . /// . /// # Panics . /// . /// Panics if the key is not present in the `HashMap`. . #[inline] 13,190 ( 0.00%) fn index(&self, key: &Q) -> &V { . self.get(key).expect("no entry found for key") 15,988 ( 0.00%) } . } . . #[stable(feature = "std_collections_from_array", since = "1.56.0")] . // Note: as what is currently the most convenient built-in way to construct . // a HashMap, a simple usage of this function must not *require* the user . // to provide a type annotation in order to infer the third type parameter . // (the hasher parameter, conventionally "S"). . // To that end, this impl is defined using RandomState as the concrete -- line 1173 ---------------------------------------- -- line 1557 ---------------------------------------- . /// Creates a `RawEntryMut` from the given key and its hash. . #[inline] . #[unstable(feature = "hash_raw_entry", issue = "56167")] . pub fn from_key_hashed_nocheck(self, hash: u64, k: &Q) -> RawEntryMut<'a, K, V, S> . where . K: Borrow, . Q: Eq, . { 7,824,301 ( 0.11%) map_raw_entry(self.map.base.raw_entry_mut().from_key_hashed_nocheck(hash, k)) . } . . /// Creates a `RawEntryMut` from the given hash. . #[inline] . #[unstable(feature = "hash_raw_entry", issue = "56167")] . pub fn from_hash(self, hash: u64, is_match: F) -> RawEntryMut<'a, K, V, S> . where . for<'b> F: FnMut(&'b K) -> bool, -- line 1573 ---------------------------------------- -- line 1594 ---------------------------------------- . /// Access an entry by a key and its hash. . #[inline] . #[unstable(feature = "hash_raw_entry", issue = "56167")] . pub fn from_key_hashed_nocheck(self, hash: u64, k: &Q) -> Option<(&'a K, &'a V)> . where . K: Borrow, . Q: Hash + Eq, . { 8,200,674 ( 0.12%) self.map.base.raw_entry().from_key_hashed_nocheck(hash, k) . } . . /// Access an entry by hash. . #[inline] . #[unstable(feature = "hash_raw_entry", issue = "56167")] . pub fn from_hash(self, hash: u64, is_match: F) -> Option<(&'a K, &'a V)> . where . F: FnMut(&K) -> bool, -- line 1610 ---------------------------------------- -- line 2338 ---------------------------------------- . /// assert_eq!(map["poneyland"], 3); . /// . /// *map.entry("poneyland").or_insert(10) *= 2; . /// assert_eq!(map["poneyland"], 6); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn or_insert(self, default: V) -> &'a mut V { 80,930 ( 0.00%) match self { . Occupied(entry) => entry.into_mut(), . Vacant(entry) => entry.insert(default), . } . } . . /// Ensures a value is in the entry by inserting the result of the default function if empty, . /// and returns a mutable reference to the value in the entry. . /// -- line 2354 ---------------------------------------- -- line 2362 ---------------------------------------- . /// . /// map.entry("poneyland").or_insert_with(|| s); . /// . /// assert_eq!(map["poneyland"], "hoho".to_string()); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn or_insert_with V>(self, default: F) -> &'a mut V { 425,132 ( 0.01%) match self { . Occupied(entry) => entry.into_mut(), . Vacant(entry) => entry.insert(default()), . } . } . . /// Ensures a value is in the entry by inserting, if empty, the result of the default function. . /// This method allows for generating key-derived values for insertion by providing the default . /// function a reference to the key that was moved during the `.entry(key)` method call. -- line 2378 ---------------------------------------- -- line 2443 ---------------------------------------- . /// assert_eq!(map["poneyland"], 43); . /// ``` . #[inline] . #[stable(feature = "entry_and_modify", since = "1.26.0")] . pub fn and_modify(self, f: F) -> Self . where . F: FnOnce(&mut V), . { 48 ( 0.00%) match self { . Occupied(mut entry) => { . f(entry.get_mut()); . Occupied(entry) . } . Vacant(entry) => Vacant(entry), . } . } . -- line 2459 ---------------------------------------- -- line 2496 ---------------------------------------- . /// map.entry("poneyland").or_default(); . /// . /// assert_eq!(map["poneyland"], None); . /// # } . /// ``` . #[inline] . #[stable(feature = "entry_or_default", since = "1.28.0")] . pub fn or_default(self) -> &'a mut V { 75,708 ( 0.00%) match self { . Occupied(entry) => entry.into_mut(), . Vacant(entry) => entry.insert(Default::default()), . } . } . } . . impl<'a, K, V> OccupiedEntry<'a, K, V> { . /// Gets a reference to the key in the entry. -- line 2512 ---------------------------------------- -- line 2790 ---------------------------------------- . /// if let Entry::Vacant(o) = map.entry("poneyland") { . /// o.insert(37); . /// } . /// assert_eq!(map["poneyland"], 37); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn insert(self, value: V) -> &'a mut V { 668,107 ( 0.01%) self.base.insert(value) . } . . /// Sets the value of the entry with the `VacantEntry`'s key, . /// and returns an `OccupiedEntry`. . /// . /// # Examples . /// . /// ``` -- line 2806 ---------------------------------------- -- line 2823 ---------------------------------------- . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl FromIterator<(K, V)> for HashMap . where . K: Eq + Hash, . S: BuildHasher + Default, . { 139 ( 0.00%) fn from_iter>(iter: T) -> HashMap { . let mut map = HashMap::with_hasher(Default::default()); . map.extend(iter); . map 140 ( 0.00%) } . } . . /// Inserts all new key-values from the iterator and replaces values with existing . /// keys with new values returned from the iterator. . #[stable(feature = "rust1", since = "1.0.0")] . impl Extend<(K, V)> for HashMap . where . K: Eq + Hash, . S: BuildHasher, . { . #[inline] . fn extend>(&mut self, iter: T) { 92,965 ( 0.00%) self.base.extend(iter) . } . . #[inline] . fn extend_one(&mut self, (k, v): (K, V)) { . self.base.insert(k, v); . } . . #[inline] -- line 2856 ---------------------------------------- -- line 2863 ---------------------------------------- . impl<'a, K, V, S> Extend<(&'a K, &'a V)> for HashMap . where . K: Eq + Hash + Copy, . V: Copy, . S: BuildHasher, . { . #[inline] . fn extend>(&mut self, iter: T) { 9 ( 0.00%) self.base.extend(iter) . } . . #[inline] . fn extend_one(&mut self, (&k, &v): (&'a K, &'a V)) { . self.base.insert(k, v); . } . . #[inline] -- line 2879 ---------------------------------------- -- line 2928 ---------------------------------------- . // many hash maps are created on a thread. To solve this performance . // trap we cache the first set of randomly generated keys per-thread. . // . // Later in #36481 it was discovered that exposing a deterministic . // iteration order allows a form of DOS attack. To counter that we . // increment one of the seeds on every RandomState creation, giving . // every corresponding HashMap a different iteration order. . thread_local!(static KEYS: Cell<(u64, u64)> = { 1 ( 0.00%) Cell::new(sys::hashmap_random_keys()) . }); . . KEYS.with(|keys| { 3 ( 0.00%) let (k0, k1) = keys.get(); . keys.set((k0.wrapping_add(1), k1)); . RandomState { k0, k1 } . }) . } . } . . #[stable(feature = "hashmap_build_hasher", since = "1.7.0")] . impl BuildHasher for RandomState { -- line 2948 ---------------------------------------- -- line 2967 ---------------------------------------- . /// Creates a new `DefaultHasher`. . /// . /// This hasher is not guaranteed to be the same as all other . /// `DefaultHasher` instances, but is the same as all other `DefaultHasher` . /// instances created through `new` or `default`. . #[stable(feature = "hashmap_default_hasher", since = "1.13.0")] . #[allow(deprecated)] . #[must_use] 3 ( 0.00%) pub fn new() -> DefaultHasher { 12 ( 0.00%) DefaultHasher(SipHasher13::new_with_keys(0, 0)) 3 ( 0.00%) } . } . . #[stable(feature = "hashmap_default_hasher", since = "1.13.0")] . impl Default for DefaultHasher { . /// Creates a new `DefaultHasher` using [`new`]. . /// See its documentation for more. . /// . /// [`new`]: DefaultHasher::new -- line 2985 ---------------------------------------- -- line 2986 ---------------------------------------- . fn default() -> DefaultHasher { . DefaultHasher::new() . } . } . . #[stable(feature = "hashmap_default_hasher", since = "1.13.0")] . impl Hasher for DefaultHasher { . #[inline] 1,074 ( 0.00%) fn write(&mut self, msg: &[u8]) { . self.0.write(msg) 1,074 ( 0.00%) } . . #[inline] . fn finish(&self) -> u64 { . self.0.finish() . } . } . . #[stable(feature = "hashmap_build_hasher", since = "1.7.0")] -- line 3004 ---------------------------------------- -- line 3014 ---------------------------------------- . impl fmt::Debug for RandomState { . fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { . f.debug_struct("RandomState").finish_non_exhaustive() . } . } . . #[inline] . fn map_entry<'a, K: 'a, V: 'a>(raw: base::RustcEntry<'a, K, V>) -> Entry<'a, K, V> { 172,111 ( 0.00%) match raw { 21 ( 0.00%) base::RustcEntry::Occupied(base) => Entry::Occupied(OccupiedEntry { base }), 19,663 ( 0.00%) base::RustcEntry::Vacant(base) => Entry::Vacant(VacantEntry { base }), . } . } . . #[inline] . pub(super) fn map_try_reserve_error(err: hashbrown::TryReserveError) -> TryReserveError { . match err { . hashbrown::TryReserveError::CapacityOverflow => { . TryReserveErrorKind::CapacityOverflow.into() -- line 3032 ---------------------------------------- -- line 3036 ---------------------------------------- . } . } . } . . #[inline] . fn map_raw_entry<'a, K: 'a, V: 'a, S: 'a>( . raw: base::RawEntryMut<'a, K, V, S>, . ) -> RawEntryMut<'a, K, V, S> { 5,896,712 ( 0.09%) match raw { . base::RawEntryMut::Occupied(base) => RawEntryMut::Occupied(RawOccupiedEntryMut { base }), . base::RawEntryMut::Vacant(base) => RawEntryMut::Vacant(RawVacantEntryMut { base }), . } . } . . #[allow(dead_code)] . fn assert_covariance() { . fn map_key<'new>(v: HashMap<&'static str, u8>) -> HashMap<&'new str, u8> { -- line 3052 ---------------------------------------- 4,722,536 ( 0.07%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/subst.rs -------------------------------------------------------------------------------- Ir -- line 22 ---------------------------------------- . . /// An entity in the Rust type system, which can be one of . /// several kinds (types, lifetimes, and consts). . /// To reduce memory usage, a `GenericArg` is an interned pointer, . /// with the lowest 2 bits being reserved for a tag to . /// indicate the type (`Ty`, `Region`, or `Const`) it points to. . #[derive(Copy, Clone, PartialEq, Eq, Hash)] . pub struct GenericArg<'tcx> { 1,211,795 ( 0.02%) ptr: NonZeroUsize, 3,451,649 ( 0.05%) marker: PhantomData<(Ty<'tcx>, ty::Region<'tcx>, &'tcx ty::Const<'tcx>)>, . } . . const TAG_MASK: usize = 0b11; . const TYPE_TAG: usize = 0b00; . const REGION_TAG: usize = 0b01; . const CONST_TAG: usize = 0b10; . 80,608 ( 0.00%) #[derive(Debug, TyEncodable, TyDecodable, PartialEq, Eq, PartialOrd, Ord, HashStable)] . pub enum GenericArgKind<'tcx> { . Lifetime(ty::Region<'tcx>), . Type(Ty<'tcx>), . Const(&'tcx ty::Const<'tcx>), . } . . impl<'tcx> GenericArgKind<'tcx> { 20,633 ( 0.00%) fn pack(self) -> GenericArg<'tcx> { 20,633 ( 0.00%) let (tag, ptr) = match self { . GenericArgKind::Lifetime(lt) => { . // Ensure we can use the tag bits. . assert_eq!(mem::align_of_val(lt) & TAG_MASK, 0); . (REGION_TAG, lt as *const _ as usize) . } . GenericArgKind::Type(ty) => { . // Ensure we can use the tag bits. . assert_eq!(mem::align_of_val(ty) & TAG_MASK, 0); -- line 56 ---------------------------------------- -- line 58 ---------------------------------------- . } . GenericArgKind::Const(ct) => { . // Ensure we can use the tag bits. . assert_eq!(mem::align_of_val(ct) & TAG_MASK, 0); . (CONST_TAG, ct as *const _ as usize) . } . }; . 587,224 ( 0.01%) GenericArg { ptr: unsafe { NonZeroUsize::new_unchecked(ptr | tag) }, marker: PhantomData } 20,633 ( 0.00%) } . } . . impl<'tcx> fmt::Debug for GenericArg<'tcx> { . fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { . match self.unpack() { . GenericArgKind::Lifetime(lt) => lt.fmt(f), . GenericArgKind::Type(ty) => ty.fmt(f), . GenericArgKind::Const(ct) => ct.fmt(f), . } . } . } . . impl<'tcx> Ord for GenericArg<'tcx> { 6 ( 0.00%) fn cmp(&self, other: &GenericArg<'_>) -> Ordering { 4 ( 0.00%) self.unpack().cmp(&other.unpack()) . } . } . . impl<'tcx> PartialOrd for GenericArg<'tcx> { . fn partial_cmp(&self, other: &GenericArg<'_>) -> Option { . Some(self.cmp(&other)) . } . } . . impl<'tcx> From> for GenericArg<'tcx> { 420,406 ( 0.01%) fn from(r: ty::Region<'tcx>) -> GenericArg<'tcx> { . GenericArgKind::Lifetime(r).pack() 420,406 ( 0.01%) } . } . . impl<'tcx> From> for GenericArg<'tcx> { 1,564,332 ( 0.02%) fn from(ty: Ty<'tcx>) -> GenericArg<'tcx> { . GenericArgKind::Type(ty).pack() 1,564,332 ( 0.02%) } . } . . impl<'tcx> From<&'tcx ty::Const<'tcx>> for GenericArg<'tcx> { 1,057 ( 0.00%) fn from(c: &'tcx ty::Const<'tcx>) -> GenericArg<'tcx> { . GenericArgKind::Const(c).pack() 1,057 ( 0.00%) } . } . . impl<'tcx> GenericArg<'tcx> { . #[inline] . pub fn unpack(self) -> GenericArgKind<'tcx> { . let ptr = self.ptr.get(); . unsafe { 21,167,322 ( 0.31%) match ptr & TAG_MASK { 371,431 ( 0.01%) REGION_TAG => GenericArgKind::Lifetime(&*((ptr & !TAG_MASK) as *const _)), 4,983,485 ( 0.07%) TYPE_TAG => GenericArgKind::Type(&*((ptr & !TAG_MASK) as *const _)), 3,748 ( 0.00%) CONST_TAG => GenericArgKind::Const(&*((ptr & !TAG_MASK) as *const _)), . _ => intrinsics::unreachable(), . } . } . } . . /// Unpack the `GenericArg` as a type when it is known certainly to be a type. . /// This is true in cases where `Substs` is used in places where the kinds are known . /// to be limited (e.g. in tuples, where the only parameters are type parameters). . pub fn expect_ty(self) -> Ty<'tcx> { . match self.unpack() { . GenericArgKind::Type(ty) => ty, . _ => bug!("expected a type, but found another kind"), . } 167,922 ( 0.00%) } . . /// Unpack the `GenericArg` as a const when it is known certainly to be a const. . pub fn expect_const(self) -> &'tcx ty::Const<'tcx> { . match self.unpack() { . GenericArgKind::Const(c) => c, . _ => bug!("expected a const, but found another kind"), . } . } -- line 140 ---------------------------------------- -- line 170 ---------------------------------------- . GenericArgKind::Type(ty) => ty.visit_with(visitor), . GenericArgKind::Const(ct) => ct.visit_with(visitor), . } . } . } . . impl<'tcx, E: TyEncoder<'tcx>> Encodable for GenericArg<'tcx> { . fn encode(&self, e: &mut E) -> Result<(), E::Error> { 8,763 ( 0.00%) self.unpack().encode(e) . } . } . . impl<'tcx, D: TyDecoder<'tcx>> Decodable for GenericArg<'tcx> { 103,165 ( 0.00%) fn decode(d: &mut D) -> GenericArg<'tcx> { 103,165 ( 0.00%) GenericArgKind::decode(d).pack() . } . } . . /// A substitution mapping generic parameters to new values. . pub type InternalSubsts<'tcx> = List>; . . pub type SubstsRef<'tcx> = &'tcx InternalSubsts<'tcx>; . . impl<'a, 'tcx> InternalSubsts<'tcx> { . /// Interpret these substitutions as the substitutions of a closure type. . /// Closure substitutions have a particular structure controlled by the . /// compiler that encodes information like the signature and closure kind; . /// see `ty::ClosureSubsts` struct for more comments. 4,592 ( 0.00%) pub fn as_closure(&'a self) -> ClosureSubsts<'a> { . ClosureSubsts { substs: self } 4,592 ( 0.00%) } . . /// Interpret these substitutions as the substitutions of a generator type. . /// Generator substitutions have a particular structure controlled by the . /// compiler that encodes information like the signature and generator kind; . /// see `ty::GeneratorSubsts` struct for more comments. . pub fn as_generator(&'tcx self) -> GeneratorSubsts<'tcx> { . GeneratorSubsts { substs: self } . } -- line 208 ---------------------------------------- -- line 211 ---------------------------------------- . /// Inline const substitutions have a particular structure controlled by the . /// compiler that encodes information like the inferred type; . /// see `ty::InlineConstSubsts` struct for more comments. . pub fn as_inline_const(&'tcx self) -> InlineConstSubsts<'tcx> { . InlineConstSubsts { substs: self } . } . . /// Creates an `InternalSubsts` that maps each generic parameter to itself. 37,720 ( 0.00%) pub fn identity_for_item(tcx: TyCtxt<'tcx>, def_id: DefId) -> SubstsRef<'tcx> { 9,060 ( 0.00%) Self::for_item(tcx, def_id, |param, _| tcx.mk_param_from_def(param)) 33,948 ( 0.00%) } . . /// Creates an `InternalSubsts` for generic parameter definitions, . /// by calling closures to obtain each kind. . /// The closures get to observe the `InternalSubsts` as they're . /// being built, which can be used to correctly . /// substitute defaults of generic parameters. 541,307 ( 0.01%) pub fn for_item(tcx: TyCtxt<'tcx>, def_id: DefId, mut mk_kind: F) -> SubstsRef<'tcx> . where . F: FnMut(&ty::GenericParamDef, &[GenericArg<'tcx>]) -> GenericArg<'tcx>, . { . let defs = tcx.generics_of(def_id); . let count = defs.count(); . let mut substs = SmallVec::with_capacity(count); 198,899 ( 0.00%) Self::fill_item(&mut substs, tcx, defs, &mut mk_kind); 122,164 ( 0.00%) tcx.intern_substs(&substs) 550,521 ( 0.01%) } . . pub fn extend_to(&self, tcx: TyCtxt<'tcx>, def_id: DefId, mut mk_kind: F) -> SubstsRef<'tcx> . where . F: FnMut(&ty::GenericParamDef, &[GenericArg<'tcx>]) -> GenericArg<'tcx>, . { . Self::for_item(tcx, def_id, |param, substs| { . self.get(param.index as usize).cloned().unwrap_or_else(|| mk_kind(param, substs)) . }) . } . 719,843 ( 0.01%) pub fn fill_item( . substs: &mut SmallVec<[GenericArg<'tcx>; 8]>, . tcx: TyCtxt<'tcx>, . defs: &ty::Generics, . mk_kind: &mut F, . ) where . F: FnMut(&ty::GenericParamDef, &[GenericArg<'tcx>]) -> GenericArg<'tcx>, . { 298,676 ( 0.00%) if let Some(def_id) = defs.parent { . let parent_defs = tcx.generics_of(def_id); 33,816 ( 0.00%) Self::fill_item(substs, tcx, parent_defs, mk_kind); . } . Self::fill_single(substs, defs, mk_kind) 573,936 ( 0.01%) } . 360 ( 0.00%) pub fn fill_single( . substs: &mut SmallVec<[GenericArg<'tcx>; 8]>, . defs: &ty::Generics, . mk_kind: &mut F, . ) where . F: FnMut(&ty::GenericParamDef, &[GenericArg<'tcx>]) -> GenericArg<'tcx>, . { . substs.reserve(defs.params.len()); . for param in &defs.params { . let kind = mk_kind(param, substs); 437,991 ( 0.01%) assert_eq!(param.index as usize, substs.len()); . substs.push(kind); . } 360 ( 0.00%) } . . #[inline] . pub fn types(&'a self) -> impl DoubleEndedIterator> + 'a { . self.iter() . .filter_map(|k| if let GenericArgKind::Type(ty) = k.unpack() { Some(ty) } else { None }) . } . . #[inline] -- line 284 ---------------------------------------- -- line 302 ---------------------------------------- . self.iter().filter_map(|k| match k.unpack() { . GenericArgKind::Lifetime(_) => None, . generic => Some(generic), . }) . } . . #[inline] . pub fn type_at(&self, i: usize) -> Ty<'tcx> { 610,734 ( 0.01%) if let GenericArgKind::Type(ty) = self[i].unpack() { . ty . } else { . bug!("expected type for param #{} in {:?}", i, self); . } . } . . #[inline] . pub fn region_at(&self, i: usize) -> ty::Region<'tcx> { -- line 318 ---------------------------------------- -- line 350 ---------------------------------------- . /// impl X for U { fn f() {} } . /// ``` . /// . /// * If `self` is `[Self, S, T]`: the identity substs of `f` in the trait. . /// * If `source_ancestor` is the def_id of the trait. . /// * If `target_substs` is `[U]`, the substs for the impl. . /// * Then we will return `[U, T]`, the subst for `f` in the impl that . /// are needed for it to match the trait. 37,030 ( 0.00%) pub fn rebase_onto( . &self, . tcx: TyCtxt<'tcx>, . source_ancestor: DefId, . target_substs: SubstsRef<'tcx>, . ) -> SubstsRef<'tcx> { . let defs = tcx.generics_of(source_ancestor); 10,580 ( 0.00%) tcx.mk_substs(target_substs.iter().chain(self.iter().skip(defs.params.len()))) 42,320 ( 0.00%) } . . pub fn truncate_to(&self, tcx: TyCtxt<'tcx>, generics: &ty::Generics) -> SubstsRef<'tcx> { . tcx.mk_substs(self.iter().take(generics.count())) . } . } . . impl<'tcx> TypeFoldable<'tcx> for SubstsRef<'tcx> { 62,391 ( 0.00%) fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result { . // This code is hot enough that it's worth specializing for the most . // common length lists, to avoid the overhead of `SmallVec` creation. . // The match arms are in order of frequency. The 1, 2, and 0 cases are . // typically hit in 90--99.99% of cases. When folding doesn't change . // the substs, it's faster to reuse the existing substs rather than . // calling `intern_substs`. 4,784,236 ( 0.07%) match self.len() { . 1 => { 724,754 ( 0.01%) let param0 = self[0].try_fold_with(folder)?; 2,506,041 ( 0.04%) if param0 == self[0] { Ok(self) } else { Ok(folder.tcx().intern_substs(&[param0])) } . } . 2 => { 569,408 ( 0.01%) let param0 = self[0].try_fold_with(folder)?; 1,284,544 ( 0.02%) let param1 = self[1].try_fold_with(folder)?; 1,277,881 ( 0.02%) if param0 == self[0] && param1 == self[1] { . Ok(self) . } else { 1,080,228 ( 0.02%) Ok(folder.tcx().intern_substs(&[param0, param1])) . } . } . 0 => Ok(self), . _ => { . let params: SmallVec<[_; 8]> = 184,604 ( 0.00%) self.iter().map(|k| k.try_fold_with(folder)).collect::>()?; 13,546 ( 0.00%) if params[..] == self[..] { . Ok(self) . } else { 38,806 ( 0.00%) Ok(folder.tcx().intern_substs(¶ms)) . } . } . } 194,922 ( 0.00%) } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { 742,099 ( 0.01%) self.iter().try_for_each(|t| t.visit_with(visitor)) . } . } . . /////////////////////////////////////////////////////////////////////////// . // Public trait `Subst` . // . // Just call `foo.subst(tcx, substs)` to perform a substitution across . // `foo`. Or use `foo.subst_spanned(tcx, substs, Some(span))` when -- line 420 ---------------------------------------- -- line 435 ---------------------------------------- . . impl<'tcx, T: TypeFoldable<'tcx>> Subst<'tcx> for T { . fn subst_spanned( . self, . tcx: TyCtxt<'tcx>, . substs: &[GenericArg<'tcx>], . span: Option, . ) -> T { 1,728,335 ( 0.03%) let mut folder = SubstFolder { tcx, substs, span, binders_passed: 0 }; . self.fold_with(&mut folder) . } . } . . /////////////////////////////////////////////////////////////////////////// . // The actual substitution engine itself is a type folder. . . struct SubstFolder<'a, 'tcx> { -- line 451 ---------------------------------------- -- line 456 ---------------------------------------- . span: Option, . . /// Number of region binders we have passed through while doing the substitution . binders_passed: u32, . } . . impl<'a, 'tcx> TypeFolder<'tcx> for SubstFolder<'a, 'tcx> { . fn tcx<'b>(&'b self) -> TyCtxt<'tcx> { 339,232 ( 0.00%) self.tcx . } . . fn fold_binder>( . &mut self, . t: ty::Binder<'tcx, T>, . ) -> ty::Binder<'tcx, T> { 461,842 ( 0.01%) self.binders_passed += 1; 97,193 ( 0.00%) let t = t.super_fold_with(self); 461,842 ( 0.01%) self.binders_passed -= 1; . t . } . 685,548 ( 0.01%) fn fold_region(&mut self, r: ty::Region<'tcx>) -> ty::Region<'tcx> { . // Note: This routine only handles regions that are bound on . // type declarations and other outer declarations, not those . // bound in *fn types*. Region substitution of the bound . // regions that appear in a function signature is done using . // the specialized routine `ty::replace_late_regions()`. 228,516 ( 0.00%) match *r { 159,066 ( 0.00%) ty::ReEarlyBound(data) => { 159,066 ( 0.00%) let rk = self.substs.get(data.index as usize).map(|k| k.unpack()); . match rk { 79,533 ( 0.00%) Some(GenericArgKind::Lifetime(lt)) => self.shift_region_through_binders(lt), . _ => { . let span = self.span.unwrap_or(DUMMY_SP); . let msg = format!( . "Region parameter out of range \ . when substituting in region {} (index={})", . data.name, data.index . ); . span_bug!(span, "{}", msg); . } . } . } . _ => r, . } 799,806 ( 0.01%) } . 1,601,577 ( 0.02%) fn fold_ty(&mut self, t: Ty<'tcx>) -> Ty<'tcx> { 533,859 ( 0.01%) if !t.needs_subst() { . return t; . } . 806,052 ( 0.01%) match *t.kind() { 1,274,020 ( 0.02%) ty::Param(p) => self.ty_for_param(p, t), 889,332 ( 0.01%) _ => t.super_fold_with(self), . } 1,928,185 ( 0.03%) } . 12,376 ( 0.00%) fn fold_const(&mut self, c: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> { 8,606 ( 0.00%) if let ty::ConstKind::Param(p) = c.val { . self.const_for_param(p, c) . } else { 6,786 ( 0.00%) c.super_fold_with(self) . } 8,112 ( 0.00%) } . . #[inline] . fn fold_mir_const(&mut self, c: mir::ConstantKind<'tcx>) -> mir::ConstantKind<'tcx> { . c.super_fold_with(self) . } . } . . impl<'a, 'tcx> SubstFolder<'a, 'tcx> { . fn ty_for_param(&self, p: ty::ParamTy, source_ty: Ty<'tcx>) -> Ty<'tcx> { . // Look up the type in the substitutions. It really should be in there. 509,608 ( 0.01%) let opt_ty = self.substs.get(p.index as usize).map(|k| k.unpack()); . let ty = match opt_ty { . Some(GenericArgKind::Type(ty)) => ty, . Some(kind) => { . let span = self.span.unwrap_or(DUMMY_SP); . span_bug!( . span, . "expected type for `{:?}` ({:?}/{}) but found {:?} \ . when substituting, substs={:?}", -- line 539 ---------------------------------------- -- line 562 ---------------------------------------- . } . . fn const_for_param( . &self, . p: ParamConst, . source_ct: &'tcx ty::Const<'tcx>, . ) -> &'tcx ty::Const<'tcx> { . // Look up the const in the substitutions. It really should be in there. 2,028 ( 0.00%) let opt_ct = self.substs.get(p.index as usize).map(|k| k.unpack()); . let ct = match opt_ct { . Some(GenericArgKind::Const(ct)) => ct, . Some(kind) => { . let span = self.span.unwrap_or(DUMMY_SP); . span_bug!( . span, . "expected const for `{:?}` ({:?}/{}) but found {:?} \ . when substituting substs={:?}", -- line 578 ---------------------------------------- -- line 645 ---------------------------------------- . fn shift_vars_through_binders>(&self, val: T) -> T { . debug!( . "shift_vars(val={:?}, binders_passed={:?}, has_escaping_bound_vars={:?})", . val, . self.binders_passed, . val.has_escaping_bound_vars() . ); . 917,644 ( 0.01%) if self.binders_passed == 0 || !val.has_escaping_bound_vars() { . return val; . } . . let result = ty::fold::shift_vars(self.tcx(), val, self.binders_passed); . debug!("shift_vars: shifted result = {:?}", result); . . result . } . . fn shift_region_through_binders(&self, region: ty::Region<'tcx>) -> ty::Region<'tcx> { 193,984 ( 0.00%) if self.binders_passed == 0 || !region.has_escaping_bound_vars() { . return region; . } . ty::fold::shift_region(self.tcx, region, self.binders_passed) . } . } . . /// Stores the user-given substs to reach some fully qualified path . /// (e.g., `::Item` or `::Item`). . #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, TyEncodable, TyDecodable)] 26,224 ( 0.00%) #[derive(HashStable, TypeFoldable, Lift)] . pub struct UserSubsts<'tcx> { . /// The substitutions for the item as given by the user. . pub substs: SubstsRef<'tcx>, . . /// The self type, in the case of a `::Item` path (when applied . /// to an inherent impl). See `UserSelfTy` below. 6,505 ( 0.00%) pub user_self_ty: Option>, . } . . /// Specifies the user-given self type. In the case of a path that . /// refers to a member in an inherent impl, this self type is . /// sometimes needed to constrain the type parameters on the impl. For . /// example, in this code: . /// . /// ``` -- line 689 ---------------------------------------- -- line 696 ---------------------------------------- . /// self type `Foo`. Then we can instantiate the parameters of . /// the impl (with the substs from `UserSubsts`) and apply those to . /// the self type, giving `Foo`. Finally, we unify that with . /// the self type here, which contains `?A` to be `&'static u32` . #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, TyEncodable, TyDecodable)] . #[derive(HashStable, TypeFoldable, Lift)] . pub struct UserSelfTy<'tcx> { . pub impl_def_id: DefId, 4,839 ( 0.00%) pub self_ty: Ty<'tcx>, . } 7,798,996 ( 0.11%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/region_constraints/mod.rs -------------------------------------------------------------------------------- Ir -- line 23 ---------------------------------------- . use std::collections::BTreeMap; . use std::ops::Range; . use std::{cmp, fmt, mem}; . . mod leak_check; . . pub use rustc_middle::infer::MemberConstraint; . 433,917 ( 0.01%) #[derive(Default)] . pub struct RegionConstraintStorage<'tcx> { . /// For each `RegionVid`, the corresponding `RegionVariableOrigin`. . var_infos: IndexVec, . . data: RegionConstraintData<'tcx>, . . /// For a given pair of regions (R1, R2), maps to a region R3 that . /// is designated as their LUB (edges R1 <= R3 and R2 <= R3 -- line 39 ---------------------------------------- -- line 64 ---------------------------------------- . storage: &'a mut RegionConstraintStorage<'tcx>, . undo_log: &'a mut InferCtxtUndoLogs<'tcx>, . } . . impl<'tcx> std::ops::Deref for RegionConstraintCollector<'_, 'tcx> { . type Target = RegionConstraintStorage<'tcx>; . #[inline] . fn deref(&self) -> &RegionConstraintStorage<'tcx> { 17,868 ( 0.00%) self.storage . } . } . . impl<'tcx> std::ops::DerefMut for RegionConstraintCollector<'_, 'tcx> { . #[inline] . fn deref_mut(&mut self) -> &mut RegionConstraintStorage<'tcx> { 175,167 ( 0.00%) self.storage . } . } . . pub type VarInfos = IndexVec; . . /// The full set of region constraints gathered up by the collector. . /// Describes constraints between the region variables and other . /// regions, as well as other conditions that must be verified, or . /// assumptions that can be made. 210,648 ( 0.00%) #[derive(Debug, Default, Clone)] . pub struct RegionConstraintData<'tcx> { . /// Constraints of the form `A <= B`, where either `A` or `B` can . /// be a region variable (or neither, as it happens). . pub constraints: BTreeMap, SubregionOrigin<'tcx>>, . . /// Constraints of the form `R0 member of [R1, ..., Rn]`, meaning that . /// `R0` must be equal to one of the regions `R1..Rn`. These occur . /// with `impl Trait` quite frequently. -- line 97 ---------------------------------------- -- line 122 ---------------------------------------- . /// This hashmap is used to avoid that naive scenario. Basically . /// we record the fact that `'a <= 'b` is implied by the fn . /// signature, and then ignore the constraint when solving . /// equations. This is a bit of a hack but seems to work. . pub givens: FxHashSet<(Region<'tcx>, ty::RegionVid)>, . } . . /// Represents a constraint that influences the inference process. 8,390,240 ( 0.12%) #[derive(Clone, Copy, PartialEq, Eq, Debug, PartialOrd, Ord)] . pub enum Constraint<'tcx> { . /// A region variable is a subregion of another. 2,016,398 ( 0.03%) VarSubVar(RegionVid, RegionVid), . . /// A concrete region is a subregion of region variable. 254,495 ( 0.00%) RegSubVar(Region<'tcx>, RegionVid), . . /// A region variable is a subregion of a concrete region. This does not . /// directly affect inference, but instead is checked after . /// inference is complete. 133,313 ( 0.00%) VarSubReg(RegionVid, Region<'tcx>), . . /// A constraint where neither side is a variable. This does not . /// directly affect inference, but instead is checked after . /// inference is complete. 22,525 ( 0.00%) RegSubReg(Region<'tcx>, Region<'tcx>), . } . . impl Constraint<'_> { . pub fn involves_placeholders(&self) -> bool { 8,954 ( 0.00%) match self { . Constraint::VarSubVar(_, _) => false, . Constraint::VarSubReg(_, r) | Constraint::RegSubVar(r, _) => r.is_placeholder(), . Constraint::RegSubReg(r, s) => r.is_placeholder() || s.is_placeholder(), . } . } . } . . #[derive(Debug, Clone)] -- line 159 ---------------------------------------- -- line 263 ---------------------------------------- . /// In other words, if we meet *all* bounds in `B`, that suffices. . /// This is used when *some* bound in `B` is known to suffice, but . /// we don't know which. . AllBounds(Vec>), . } . . #[derive(Copy, Clone, PartialEq, Eq, Hash)] . pub(crate) struct TwoRegions<'tcx> { 135 ( 0.00%) a: Region<'tcx>, 145 ( 0.00%) b: Region<'tcx>, . } . . #[derive(Copy, Clone, PartialEq)] . pub(crate) enum UndoLog<'tcx> { . /// We added `RegionVid`. . AddVar(RegionVid), . . /// We added the given `constraint`. -- line 280 ---------------------------------------- -- line 304 ---------------------------------------- . pub universe: ty::UniverseIndex, . } . . pub struct RegionSnapshot { . any_unifications: bool, . } . . impl<'tcx> RegionConstraintStorage<'tcx> { 78,894 ( 0.00%) pub fn new() -> Self { . Self::default() 78,894 ( 0.00%) } . . #[inline] . pub(crate) fn with_log<'a>( . &'a mut self, . undo_log: &'a mut InferCtxtUndoLogs<'tcx>, . ) -> RegionConstraintCollector<'a, 'tcx> { . RegionConstraintCollector { storage: self, undo_log } . } . . fn rollback_undo_entry(&mut self, undo_entry: UndoLog<'tcx>) { 400,822 ( 0.01%) match undo_entry { . AddVar(vid) => { . self.var_infos.pop().unwrap(); 136,412 ( 0.00%) assert_eq!(self.var_infos.len(), vid.index() as usize); . } 46,060 ( 0.00%) AddConstraint(ref constraint) => { 184,240 ( 0.00%) self.data.constraints.remove(constraint); . } . AddVerify(index) => { . self.data.verifys.pop(); . assert_eq!(self.data.verifys.len(), index); . } . AddGiven(sub, sup) => { . self.data.givens.remove(&(sub, sup)); . } -- line 339 ---------------------------------------- -- line 348 ---------------------------------------- . } . . impl<'tcx> RegionConstraintCollector<'_, 'tcx> { . pub fn num_region_vars(&self) -> usize { . self.var_infos.len() . } . . pub fn region_constraint_data(&self) -> &RegionConstraintData<'tcx> { 9,918 ( 0.00%) &self.data 9,918 ( 0.00%) } . . /// Once all the constraints have been gathered, extract out the final data. . /// . /// Not legal during a snapshot. . pub fn into_infos_and_data(self) -> (VarInfos, RegionConstraintData<'tcx>) { 13,205 ( 0.00%) assert!(!UndoLogs::>::in_snapshot(&self.undo_log)); . (mem::take(&mut self.storage.var_infos), mem::take(&mut self.storage.data)) . } . . /// Takes (and clears) the current set of constraints. Note that . /// the set of variables remains intact, but all relationships . /// between them are reset. This is used during NLL checking to . /// grab the set of constraints that arose from a particular . /// operation. . /// . /// We don't want to leak relationships between variables between . /// points because just because (say) `r1 == r2` was true at some . /// point P in the graph doesn't imply that it will be true at . /// some other point Q, in NLL. . /// . /// Not legal during a snapshot. 60 ( 0.00%) pub fn take_and_reset_data(&mut self) -> RegionConstraintData<'tcx> { 10 ( 0.00%) assert!(!UndoLogs::>::in_snapshot(&self.undo_log)); . . // If you add a new field to `RegionConstraintCollector`, you . // should think carefully about whether it needs to be cleared . // or updated in some way. . let RegionConstraintStorage { . var_infos: _, 10 ( 0.00%) data, . lubs, . glbs, . unification_table: _, . any_unifications, . } = self.storage; . . // Clear the tables of (lubs, glbs), so that we will create . // fresh regions if we do a LUB operation. As it happens, -- line 395 ---------------------------------------- -- line 399 ---------------------------------------- . glbs.clear(); . . let data = mem::take(data); . . // Clear all unifications and recreate the variables a "now . // un-unified" state. Note that when we unify `a` and `b`, we . // also insert `a <= b` and a `b <= a` edges, so the . // `RegionConstraintData` contains the relationship here. 20 ( 0.00%) if *any_unifications { 1 ( 0.00%) *any_unifications = false; 3 ( 0.00%) self.unification_table().reset_unifications(|_| UnifiedRegion(None)); . } . . data 80 ( 0.00%) } . . pub fn data(&self) -> &RegionConstraintData<'tcx> { . &self.data . } . . pub fn start_snapshot(&mut self) -> RegionSnapshot { . debug!("RegionConstraintCollector: start_snapshot"); . RegionSnapshot { any_unifications: self.any_unifications } . } . . pub fn rollback_to(&mut self, snapshot: RegionSnapshot) { . debug!("RegionConstraintCollector: rollback_to({:?})", snapshot); 137,804 ( 0.00%) self.any_unifications = snapshot.any_unifications; . } . 1,050,936 ( 0.02%) pub fn new_region_var( . &mut self, . universe: ty::UniverseIndex, . origin: RegionVariableOrigin, . ) -> RegionVid { 175,156 ( 0.00%) let vid = self.var_infos.push(RegionVariableInfo { origin, universe }); . 525,468 ( 0.01%) let u_vid = self.unification_table().new_key(UnifiedRegion(None)); 175,156 ( 0.00%) assert_eq!(vid, u_vid.vid); . self.undo_log.push(AddVar(vid)); . debug!("created new region variable {:?} in {:?} with origin {:?}", vid, universe, origin); . vid 1,401,248 ( 0.02%) } . . /// Returns the universe for the given variable. . pub fn var_universe(&self, vid: RegionVid) -> ty::UniverseIndex { 97,112 ( 0.00%) self.var_infos[vid].universe . } . . /// Returns the origin for the given variable. . pub fn var_origin(&self, vid: RegionVid) -> RegionVariableOrigin { . self.var_infos[vid].origin . } . . fn add_constraint(&mut self, constraint: Constraint<'tcx>, origin: SubregionOrigin<'tcx>) { . // cannot add constraints once regions are resolved . debug!("RegionConstraintCollector: add_constraint({:?})", constraint); . . // never overwrite an existing (constraint, origin) - only insert one if it isn't . // present in the map yet. This prevents origins from outside the snapshot being . // replaced with "less informative" origins e.g., during calls to `can_eq` . let undo_log = &mut self.undo_log; 1,072,730 ( 0.02%) self.storage.data.constraints.entry(constraint).or_insert_with(|| { 592,080 ( 0.01%) undo_log.push(AddConstraint(constraint)); 394,720 ( 0.01%) origin . }); . } . . fn add_verify(&mut self, verify: Verify<'tcx>) { . // cannot add verifys once regions are resolved . debug!("RegionConstraintCollector: add_verify({:?})", verify); . . // skip no-op cases known to be satisfied 1,654 ( 0.00%) if let VerifyBound::AllBounds(ref bs) = verify.bound { 3 ( 0.00%) if bs.is_empty() { . return; . } . } . 827 ( 0.00%) let index = self.data.verifys.len(); 12,405 ( 0.00%) self.data.verifys.push(verify); 827 ( 0.00%) self.undo_log.push(AddVerify(index)); . } . 99 ( 0.00%) pub fn add_given(&mut self, sub: Region<'tcx>, sup: ty::RegionVid) { . // cannot add givens once regions are resolved . if self.data.givens.insert((sub, sup)) { . debug!("add_given({:?} <= {:?})", sub, sup); . 11 ( 0.00%) self.undo_log.push(AddGiven(sub, sup)); . } 77 ( 0.00%) } . 413,670 ( 0.01%) pub fn make_eqregion( . &mut self, . origin: SubregionOrigin<'tcx>, . sub: Region<'tcx>, . sup: Region<'tcx>, . ) { 206,835 ( 0.00%) if sub != sup { . // Eventually, it would be nice to add direct support for . // equating regions. 227,320 ( 0.00%) self.make_subregion(origin.clone(), sub, sup); 255,735 ( 0.00%) self.make_subregion(origin, sup, sub); . 142,111 ( 0.00%) match (sub, sup) { 66,414 ( 0.00%) (&ty::ReVar(sub), &ty::ReVar(sup)) => { . debug!("make_eqregion: unifying {:?} with {:?}", sub, sup); 110,690 ( 0.00%) self.unification_table().union(sub, sup); . self.any_unifications = true; . } . (&ty::ReVar(vid), value) | (value, &ty::ReVar(vid)) => { . debug!("make_eqregion: unifying {:?} with {:?}", vid, value); 24,964 ( 0.00%) self.unification_table().union_value(vid, UnifiedRegion(Some(value))); . self.any_unifications = true; . } . (_, _) => {} . } . } 198,905 ( 0.00%) } . 28 ( 0.00%) pub fn member_constraint( . &mut self, . opaque_type_def_id: DefId, . definition_span: Span, . hidden_ty: Ty<'tcx>, . member_region: ty::Region<'tcx>, . choice_regions: &Lrc>>, . ) { . debug!("member_constraint({:?} in {:#?})", member_region, choice_regions); . 2 ( 0.00%) if choice_regions.iter().any(|&r| r == member_region) { . return; . } . 18 ( 0.00%) self.data.member_constraints.push(MemberConstraint { . opaque_type_def_id, . definition_span, . hidden_ty, . member_region, . choice_regions: choice_regions.clone(), . }); 16 ( 0.00%) } . 1,485,118 ( 0.02%) #[instrument(skip(self, origin), level = "debug")] . pub fn make_subregion( . &mut self, . origin: SubregionOrigin<'tcx>, . sub: Region<'tcx>, . sup: Region<'tcx>, . ) { . // cannot add constraints once regions are resolved . debug!("origin = {:#?}", origin); . 1,081,610 ( 0.02%) match (sub, sup) { . (&ReLateBound(..), _) | (_, &ReLateBound(..)) => { . span_bug!(origin.span(), "cannot relate bound region: {:?} <= {:?}", sub, sup); . } . (_, &ReStatic) => { . // all regions are subregions of static, so we can ignore this . } 76,528 ( 0.00%) (&ReVar(sub_id), &ReVar(sup_id)) => { 535,696 ( 0.01%) self.add_constraint(Constraint::VarSubVar(sub_id, sup_id), origin); . } . (_, &ReVar(sup_id)) => { 72,814 ( 0.00%) self.add_constraint(Constraint::RegSubVar(sub, sup_id), origin); . } 11,256 ( 0.00%) (&ReVar(sub_id), _) => { 78,792 ( 0.00%) self.add_constraint(Constraint::VarSubReg(sub_id, sup), origin); . } . _ => { 31,500 ( 0.00%) self.add_constraint(Constraint::RegSubReg(sub, sup), origin); . } . } . } . 4,135 ( 0.00%) pub fn verify_generic_bound( . &mut self, . origin: SubregionOrigin<'tcx>, . kind: GenericKind<'tcx>, . sub: Region<'tcx>, . bound: VerifyBound<'tcx>, . ) { 10,751 ( 0.00%) self.add_verify(Verify { kind, origin, region: sub, bound }); 4,135 ( 0.00%) } . . pub fn lub_regions( . &mut self, . tcx: TyCtxt<'tcx>, . origin: SubregionOrigin<'tcx>, . a: Region<'tcx>, . b: Region<'tcx>, . ) -> Region<'tcx> { -- line 591 ---------------------------------------- -- line 599 ---------------------------------------- . _ if a == b => { . a // LUB(a,a) = a . } . . _ => self.combine_vars(tcx, Lub, a, b, origin), . } . } . 1,992 ( 0.00%) pub fn glb_regions( . &mut self, . tcx: TyCtxt<'tcx>, . origin: SubregionOrigin<'tcx>, . a: Region<'tcx>, . b: Region<'tcx>, . ) -> Region<'tcx> { . // cannot add constraints once regions are resolved . debug!("RegionConstraintCollector: glb_regions({:?}, {:?})", a, b); 996 ( 0.00%) match (a, b) { . (&ReStatic, r) | (r, &ReStatic) => { . r // static lives longer than everything else . } . 498 ( 0.00%) _ if a == b => { . a // GLB(a,a) = a . } . 2,988 ( 0.00%) _ => self.combine_vars(tcx, Glb, a, b, origin), . } 1,992 ( 0.00%) } . . /// Resolves the passed RegionVid to the root RegionVid in the unification table . pub fn opportunistic_resolve_var(&mut self, rid: ty::RegionVid) -> ty::RegionVid { 154,130 ( 0.00%) self.unification_table().find(rid).vid . } . . /// If the Region is a `ReVar`, then resolves it either to the root value in . /// the unification table, if it exists, or to the root `ReVar` in the table. . /// If the Region is not a `ReVar`, just returns the Region itself. . pub fn opportunistic_resolve_region( . &mut self, . tcx: TyCtxt<'tcx>, -- line 639 ---------------------------------------- -- line 647 ---------------------------------------- . tcx.reuse_or_mk_region(region, ty::ReVar(root)) . }) . } . _ => region, . } . } . . fn combine_map(&mut self, t: CombineMapType) -> &mut CombineMap<'tcx> { 1,992 ( 0.00%) match t { . Glb => &mut self.glbs, . Lub => &mut self.lubs, . } . } . 2,988 ( 0.00%) fn combine_vars( . &mut self, . tcx: TyCtxt<'tcx>, . t: CombineMapType, . a: Region<'tcx>, . b: Region<'tcx>, . origin: SubregionOrigin<'tcx>, . ) -> Region<'tcx> { . let vars = TwoRegions { a, b }; 2 ( 0.00%) if let Some(&c) = self.combine_map(t).get(&vars) { 12 ( 0.00%) return tcx.mk_region(ReVar(c)); . } . let a_universe = self.universe(a); . let b_universe = self.universe(b); . let c_universe = cmp::max(a_universe, b_universe); 1,235 ( 0.00%) let c = self.new_region_var(c_universe, MiscVariable(origin.span())); . self.combine_map(t).insert(vars, c); 247 ( 0.00%) self.undo_log.push(AddCombination(t, vars)); 1,235 ( 0.00%) let new_r = tcx.mk_region(ReVar(c)); 1,976 ( 0.00%) for old_r in [a, b] { 494 ( 0.00%) match t { 4,199 ( 0.00%) Glb => self.make_subregion(origin.clone(), new_r, old_r), . Lub => self.make_subregion(origin.clone(), old_r, new_r), . } . } . debug!("combine_vars() c={:?}", c); . new_r 2,241 ( 0.00%) } . . pub fn universe(&self, region: Region<'tcx>) -> ty::UniverseIndex { 101,270 ( 0.00%) match *region { . ty::ReStatic | ty::ReErased | ty::ReFree(..) | ty::ReEarlyBound(..) => { . ty::UniverseIndex::ROOT . } . ty::ReEmpty(ui) => ui, . ty::RePlaceholder(placeholder) => placeholder.universe, 14,272 ( 0.00%) ty::ReVar(vid) => self.var_universe(vid), . ty::ReLateBound(..) => bug!("universe(): encountered bound region {:?}", region), . } . } . 31,230 ( 0.00%) pub fn vars_since_snapshot( . &self, . value_count: usize, . ) -> (Range, Vec) { . let range = RegionVid::from(value_count)..RegionVid::from(self.unification_table.len()); 37,476 ( 0.00%) ( . range.clone(), . (range.start.index()..range.end.index()) . .map(|index| self.var_infos[ty::RegionVid::from(index)].origin) . .collect(), . ) 37,476 ( 0.00%) } . . /// See `InferCtxt::region_constraints_added_in_snapshot`. 54,516 ( 0.00%) pub fn region_constraints_added_in_snapshot(&self, mark: &Snapshot<'tcx>) -> Option { 18,172 ( 0.00%) self.undo_log . .region_constraints_in_snapshot(mark) 12,276 ( 0.00%) .map(|&elt| match elt { 3,256 ( 0.00%) AddConstraint(constraint) => Some(constraint.involves_placeholders()), . _ => None, . }) . .max() . .unwrap_or(None) 72,688 ( 0.00%) } . . #[inline] . fn unification_table(&mut self) -> super::UnificationTable<'_, 'tcx, RegionVidKey<'tcx>> { 484,136 ( 0.01%) ut::UnificationTable::with_log(&mut self.storage.unification_table, self.undo_log) . } . } . . impl fmt::Debug for RegionSnapshot { . fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { . write!(f, "RegionSnapshot") . } . } -- line 737 ---------------------------------------- -- line 750 ---------------------------------------- . match *self { . GenericKind::Param(ref p) => write!(f, "{}", p), . GenericKind::Projection(ref p) => write!(f, "{}", p), . } . } . } . . impl<'tcx> GenericKind<'tcx> { 940 ( 0.00%) pub fn to_ty(&self, tcx: TyCtxt<'tcx>) -> Ty<'tcx> { 15,443 ( 0.00%) match *self { 1,293 ( 0.00%) GenericKind::Param(ref p) => p.to_ty(tcx), 4 ( 0.00%) GenericKind::Projection(ref p) => tcx.mk_projection(p.item_def_id, p.substs), . } 940 ( 0.00%) } . } . . impl<'tcx> VerifyBound<'tcx> { 162 ( 0.00%) pub fn must_hold(&self) -> bool { 222 ( 0.00%) match self { . VerifyBound::IfEq(..) => false, . VerifyBound::OutlivedBy(ty::ReStatic) => true, . VerifyBound::OutlivedBy(_) => false, . VerifyBound::IsEmpty => false, 42 ( 0.00%) VerifyBound::AnyBound(bs) => bs.iter().any(|b| b.must_hold()), . VerifyBound::AllBounds(bs) => bs.iter().all(|b| b.must_hold()), . } 189 ( 0.00%) } . 120 ( 0.00%) pub fn cannot_hold(&self) -> bool { 176 ( 0.00%) match self { . VerifyBound::IfEq(_, b) => b.cannot_hold(), . VerifyBound::IsEmpty => false, . VerifyBound::OutlivedBy(_) => false, 16 ( 0.00%) VerifyBound::AnyBound(bs) => bs.iter().all(|b| b.cannot_hold()), 28 ( 0.00%) VerifyBound::AllBounds(bs) => bs.iter().any(|b| b.cannot_hold()), . } 168 ( 0.00%) } . 24 ( 0.00%) pub fn or(self, vb: VerifyBound<'tcx>) -> VerifyBound<'tcx> { 32 ( 0.00%) if self.must_hold() || vb.cannot_hold() { . self 16 ( 0.00%) } else if self.cannot_hold() || vb.must_hold() { 16 ( 0.00%) vb . } else { . VerifyBound::AnyBound(vec![self, vb]) . } 32 ( 0.00%) } . } . . impl<'tcx> RegionConstraintData<'tcx> { . /// Returns `true` if this region constraint data contains no constraints, and `false` . /// otherwise. . pub fn is_empty(&self) -> bool { . let RegionConstraintData { constraints, member_constraints, verifys, givens } = self; 3,753 ( 0.00%) constraints.is_empty() . && member_constraints.is_empty() . && verifys.is_empty() . && givens.is_empty() . } . } . . impl<'tcx> Rollback> for RegionConstraintStorage<'tcx> { 400,820 ( 0.01%) fn reverse(&mut self, undo: UndoLog<'tcx>) { 320,656 ( 0.00%) self.rollback_undo_entry(undo) 400,820 ( 0.01%) } . } 4,060,549 ( 0.06%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/undo_log.rs -------------------------------------------------------------------------------- Ir -- line 28 ---------------------------------------- . PushRegionObligation, . } . . macro_rules! impl_from { . ($($ctor: ident ($ty: ty),)*) => { . $( . impl<'tcx> From<$ty> for UndoLog<'tcx> { . fn from(x: $ty) -> Self { 4,398 ( 0.00%) UndoLog::$ctor(x.into()) . } . } . )* . } . } . . // Upcast from a single kind of "undoable action" to the general enum . impl_from! { -- line 44 ---------------------------------------- -- line 57 ---------------------------------------- . ConstUnificationTable(sv::UndoLog>>), . . RegionUnificationTable(sv::UndoLog>>), . ProjectionCache(traits::UndoLog<'tcx>), . } . . /// The Rollback trait defines how to rollback a particular action. . impl<'tcx> Rollback> for InferCtxtInner<'tcx> { 1,142,133 ( 0.02%) fn reverse(&mut self, undo: UndoLog<'tcx>) { 1,903,555 ( 0.03%) match undo { 2,330,460 ( 0.03%) UndoLog::TypeVariables(undo) => self.type_variable_storage.reverse(undo), 1,266 ( 0.00%) UndoLog::ConstUnificationTable(undo) => self.const_unification_storage.reverse(undo), 4,464 ( 0.00%) UndoLog::IntUnificationTable(undo) => self.int_unification_storage.reverse(undo), 18 ( 0.00%) UndoLog::FloatUnificationTable(undo) => self.float_unification_storage.reverse(undo), . UndoLog::RegionConstraintCollector(undo) => { 561,148 ( 0.01%) self.region_constraint_storage.as_mut().unwrap().reverse(undo) . } . UndoLog::RegionUnificationTable(undo) => { 127,870 ( 0.00%) self.region_constraint_storage.as_mut().unwrap().unification_table.reverse(undo) . } . UndoLog::ProjectionCache(undo) => self.projection_cache.reverse(undo), . UndoLog::PushRegionObligation => { . self.region_obligations.pop(); . } . } 1,522,844 ( 0.02%) } . } . . /// The combined undo log for all the various unification tables. For each change to the storage . /// for any kind of inference variable, we record an UndoLog entry in the vector here. . pub(crate) struct InferCtxtUndoLogs<'tcx> { . logs: Vec>, . num_open_snapshots: usize, . } . . impl Default for InferCtxtUndoLogs<'_> { . fn default() -> Self { 78,894 ( 0.00%) Self { logs: Default::default(), num_open_snapshots: Default::default() } . } . } . . /// The UndoLogs trait defines how we undo a particular kind of action (of type T). We can undo any . /// action that is convertable into an UndoLog (per the From impls above). . impl<'tcx, T> UndoLogs for InferCtxtUndoLogs<'tcx> . where . UndoLog<'tcx>: From, -- line 102 ---------------------------------------- -- line 103 ---------------------------------------- . { . #[inline] . fn num_open_snapshots(&self) -> usize { . self.num_open_snapshots . } . . #[inline] . fn push(&mut self, undo: T) { 403,826 ( 0.01%) if self.in_snapshot() { 35,184 ( 0.00%) self.logs.push(undo.into()) . } . } . . fn clear(&mut self) { . self.logs.clear(); . self.num_open_snapshots = 0; . } . -- line 120 ---------------------------------------- -- line 125 ---------------------------------------- . { . if self.in_snapshot() { . self.logs.extend(undos.into_iter().map(UndoLog::from)) . } . } . } . . impl<'tcx> InferCtxtInner<'tcx> { 826,824 ( 0.01%) pub fn rollback_to(&mut self, snapshot: Snapshot<'tcx>) { . debug!("rollback_to({})", snapshot.undo_len); . self.undo_log.assert_open_snapshot(&snapshot); . 1,417,741 ( 0.02%) while self.undo_log.logs.len() > snapshot.undo_len { . let undo = self.undo_log.logs.pop().unwrap(); 4,568,532 ( 0.07%) self.reverse(undo); . } . 327,975 ( 0.00%) if self.undo_log.num_open_snapshots == 1 { . // The root snapshot. It's safe to clear the undo log because . // there's no snapshot further out that we might need to roll back . // to. 90,780 ( 0.00%) assert!(snapshot.undo_len == 0); . self.undo_log.logs.clear(); . } . 458,802 ( 0.01%) self.undo_log.num_open_snapshots -= 1; 964,628 ( 0.01%) } . . pub fn commit(&mut self, snapshot: Snapshot<'tcx>) { . debug!("commit({})", snapshot.undo_len); . 764,805 ( 0.01%) if self.undo_log.num_open_snapshots == 1 { . // The root snapshot. It's safe to clear the undo log because . // there's no snapshot further out that we might need to roll back . // to. 188,310 ( 0.00%) assert!(snapshot.undo_len == 0); . self.undo_log.logs.clear(); . } . 858,960 ( 0.01%) self.undo_log.num_open_snapshots -= 1; . } . } . . impl<'tcx> InferCtxtUndoLogs<'tcx> { . pub fn start_snapshot(&mut self) -> Snapshot<'tcx> { 1,570,956 ( 0.02%) self.num_open_snapshots += 1; . Snapshot { undo_len: self.logs.len(), _marker: PhantomData } . } . . pub(crate) fn region_constraints_in_snapshot( . &self, . s: &Snapshot<'tcx>, . ) -> impl Iterator> + Clone { 73,801 ( 0.00%) self.logs[s.undo_len..].iter().filter_map(|log| match log { . UndoLog::RegionConstraintCollector(log) => Some(log), . _ => None, . }) . } . . pub(crate) fn region_constraints( . &self, . ) -> impl Iterator> + Clone { 1,326 ( 0.00%) self.logs.iter().filter_map(|log| match log { . UndoLog::RegionConstraintCollector(log) => Some(log), . _ => None, . }) . } . . fn assert_open_snapshot(&self, snapshot: &Snapshot<'tcx>) { . // Failures here may indicate a failure to follow a stack discipline. 413,412 ( 0.01%) assert!(self.logs.len() >= snapshot.undo_len); 413,412 ( 0.01%) assert!(self.num_open_snapshots > 0); . } . } . . impl<'tcx> std::ops::Index for InferCtxtUndoLogs<'tcx> { . type Output = UndoLog<'tcx>; . . fn index(&self, key: usize) -> &Self::Output { . &self.logs[key] -- line 204 ---------------------------------------- 625,417 ( 0.01%) -------------------------------------------------------------------------------- -- 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")] 2,424 ( 0.00%) pub fn from_str_radix(src: &str, radix: u32) -> Result { 1,212 ( 0.00%) from_str_radix(src, radix) 3,636 ( 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 { 349,080 ( 0.01%) 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 { 1,364,991 ( 0.02%) 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 { 5,410,858 ( 0.08%) 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 { 36,653,187 ( 0.53%) 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 430 ---------------------------------------- . #[doc = concat!("assert_eq!((", stringify!($SelfT), "::MAX - 2).checked_add(3), None);")] . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_stable(feature = "const_checked_int_methods", since = "1.47.0")] . #[must_use = "this returns the result of the operation, \ . without modifying the original"] . #[inline] . pub const fn checked_add(self, rhs: Self) -> Option { 10 ( 0.00%) let (a, b) = self.overflowing_add(rhs); . if unlikely!(b) {None} else {Some(a)} . } . . /// Unchecked integer addition. Computes `self + rhs`, assuming overflow . /// cannot occur. . /// . /// # Safety . /// -- line 446 ---------------------------------------- -- 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`. 4,395,909 ( 0.06%) 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`. 228,773 ( 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 { 579,025 ( 0.01%) 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 { 16,845 ( 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 1104 ---------------------------------------- . #[doc = concat!("assert_eq!((", stringify!($SelfT), "::MAX).saturating_mul(10), ", stringify!($SelfT),"::MAX);")] . /// ``` . #[stable(feature = "wrapping", since = "1.7.0")] . #[rustc_const_stable(feature = "const_saturating_int_methods", since = "1.47.0")] . #[must_use = "this returns the result of the operation, \ . without modifying the original"] . #[inline] . pub const fn saturating_mul(self, rhs: Self) -> Self { 24 ( 0.00%) match self.checked_mul(rhs) { . Some(x) => x, . None => Self::MAX, . } . } . . /// Saturating integer division. Computes `self / rhs`, saturating at the . /// numeric bounds instead of overflowing. . /// -- line 1120 ---------------------------------------- -- 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 { 17,626,943 ( 0.26%) 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 { 6,246,654 ( 0.09%) 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 { 26,381,799 ( 0.38%) 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 1397 ---------------------------------------- . #[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_shl(self, rhs: u32) -> Self { . // SAFETY: the masking by the bitsize of the type ensures that we do not shift . // out of bounds . unsafe { 36 ( 0.00%) intrinsics::unchecked_shl(self, (rhs & ($BITS - 1)) as $SelfT) . } . } . . /// Panic-free bitwise shift-right; yields `self >> mask(rhs)`, . /// where `mask` removes any high-order bits of `rhs` that . /// would cause the shift to exceed the bitwidth of the type. . /// . /// Note that this is *not* the same as a rotate-right; the -- line 1413 ---------------------------------------- -- 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) { 4,748,648 ( 0.07%) 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 1587 ---------------------------------------- . #[doc = concat!("assert_eq!(5", stringify!($SelfT), ".overflowing_sub(2), (3, false));")] . #[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)] 531 ( 0.00%) pub const fn overflowing_sub(self, rhs: Self) -> (Self, bool) { 1,330,140 ( 0.02%) let (a, b) = intrinsics::sub_with_overflow(self as $ActualT, rhs as $ActualT); . (a as Self, b) 1,062 ( 0.00%) } . . /// 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. . /// . /// # Examples -- line 1606 ---------------------------------------- -- line 1673 ---------------------------------------- . /// assert_eq!(5u32.overflowing_mul(2), (10, false)); . /// 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)] 2 ( 0.00%) pub const fn overflowing_mul(self, rhs: Self) -> (Self, bool) { 9,564,772 ( 0.14%) let (a, b) = intrinsics::mul_with_overflow(self as $ActualT, rhs as $ActualT); . (a as Self, b) 1 ( 0.00%) } . . /// 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 . /// `false`. . /// -- line 1692 ---------------------------------------- -- line 1838 ---------------------------------------- . #[doc = concat!("assert_eq!(0x1", stringify!($SelfT), ".overflowing_shl(132), (0x10, 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_shl(self, rhs: u32) -> (Self, bool) { 12 ( 0.00%) (self.wrapping_shl(rhs), (rhs > ($BITS - 1))) . } . . /// Shifts self right by `rhs` bits. . /// . /// Returns a tuple of the shifted version of self along with a boolean . /// indicating whether the shift value was larger than or equal to the . /// number of bits. If the shift value is too large, then value is . /// masked (N-1) where N is the number of bits, and this value is then -- line 1854 ---------------------------------------- -- 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 { 276 ( 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 { 59,316 ( 0.00%) if self <= 1 { return 0; } . 78,839 ( 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. 235,089 ( 0.00%) let z = unsafe { intrinsics::ctlz_nonzero(p) }; 80,171 ( 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 { 98,290 ( 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 ---------------------------------------- 454,835 ( 0.01%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/smallvec-1.7.0/src/lib.rs -------------------------------------------------------------------------------- Ir -- line 294 ---------------------------------------- . #[allow(deprecated)] . impl From for CollectionAllocErr { . fn from(_: LayoutErr) -> Self { . CollectionAllocErr::CapacityOverflow . } . } . . fn infallible(result: Result) -> T { 1,040,302 ( 0.02%) match result { . Ok(x) => x, . Err(CollectionAllocErr::CapacityOverflow) => panic!("capacity overflow"), . Err(CollectionAllocErr::AllocErr { layout }) => alloc::alloc::handle_alloc_error(layout), . } . } . . /// FIXME: use `Layout::array` when we require a Rust version where it’s stable . /// https://github.com/rust-lang/rust/issues/55724 -- line 310 ---------------------------------------- -- line 422 ---------------------------------------- . #[cfg(feature = "union")] . impl SmallVecData { . #[inline] . unsafe fn inline(&self) -> *const A::Item { . self.inline.as_ptr() as *const A::Item . } . #[inline] . unsafe fn inline_mut(&mut self) -> *mut A::Item { 414,176 ( 0.01%) self.inline.as_mut_ptr() as *mut A::Item . } . #[inline] . fn from_inline(inline: MaybeUninit) -> SmallVecData { . SmallVecData { . inline: core::mem::ManuallyDrop::new(inline), . } . } . #[inline] . unsafe fn into_inline(self) -> MaybeUninit { . core::mem::ManuallyDrop::into_inner(self.inline) . } . #[inline] . unsafe fn heap(&self) -> (*mut A::Item, usize) { 46,813 ( 0.00%) self.heap . } . #[inline] . unsafe fn heap_mut(&mut self) -> &mut (*mut A::Item, usize) { . &mut self.heap . } . #[inline] . fn from_heap(ptr: *mut A::Item, len: usize) -> SmallVecData { . SmallVecData { heap: (ptr, len) } -- line 452 ---------------------------------------- -- line 557 ---------------------------------------- . #[inline] . pub fn new() -> SmallVec { . // Try to detect invalid custom implementations of `Array`. Hopefully, . // this check should be optimized away entirely for valid ones. . assert!( . mem::size_of::() == A::size() * mem::size_of::() . && mem::align_of::() >= mem::align_of::() . ); 1,365,029 ( 0.02%) SmallVec { . capacity: 0, . data: SmallVecData::from_inline(MaybeUninit::uninit()), . } . } . . /// Construct an empty vector with enough capacity pre-allocated to store at least `n` . /// elements. . /// -- line 573 ---------------------------------------- -- line 579 ---------------------------------------- . /// let v: SmallVec<[u8; 3]> = SmallVec::with_capacity(100); . /// . /// assert!(v.is_empty()); . /// assert!(v.capacity() >= 100); . /// ``` . #[inline] . pub fn with_capacity(n: usize) -> Self { . let mut v = SmallVec::new(); 24 ( 0.00%) v.reserve_exact(n); . v . } . . /// Construct a new `SmallVec` from a `Vec`. . /// . /// Elements will be copied to the inline buffer if vec.capacity() <= Self::inline_capacity(). . /// . /// ```rust -- line 595 ---------------------------------------- -- line 635 ---------------------------------------- . /// let small_vec: SmallVec<_> = SmallVec::from_buf(buf); . /// . /// assert_eq!(&*small_vec, &[1, 2, 3, 4, 5]); . /// ``` . #[inline] . pub fn from_buf(buf: A) -> SmallVec { . SmallVec { . capacity: A::size(), 37,891 ( 0.00%) data: SmallVecData::from_inline(MaybeUninit::new(buf)), . } . } . . /// Constructs a new `SmallVec` on the stack from an `A` without . /// copying elements. Also sets the length, which must be less or . /// equal to the size of `buf`. . /// . /// ```rust -- line 651 ---------------------------------------- -- line 653 ---------------------------------------- . /// . /// let buf = [1, 2, 3, 4, 5, 0, 0, 0]; . /// let small_vec: SmallVec<_> = SmallVec::from_buf_and_len(buf, 5); . /// . /// assert_eq!(&*small_vec, &[1, 2, 3, 4, 5]); . /// ``` . #[inline] . pub fn from_buf_and_len(buf: A, len: usize) -> SmallVec { 12 ( 0.00%) assert!(len <= A::size()); 36 ( 0.00%) unsafe { SmallVec::from_buf_and_len_unchecked(MaybeUninit::new(buf), len) } . } . . /// Constructs a new `SmallVec` on the stack from an `A` without . /// copying elements. Also sets the length. The user is responsible . /// for ensuring that `len <= A::size()`. . /// . /// ```rust . /// use smallvec::SmallVec; -- line 670 ---------------------------------------- -- line 674 ---------------------------------------- . /// let small_vec: SmallVec<_> = unsafe { . /// SmallVec::from_buf_and_len_unchecked(MaybeUninit::new(buf), 5) . /// }; . /// . /// assert_eq!(&*small_vec, &[1, 2, 3, 4, 5]); . /// ``` . #[inline] . pub unsafe fn from_buf_and_len_unchecked(buf: MaybeUninit, len: usize) -> SmallVec { 6 ( 0.00%) SmallVec { . capacity: len, . data: SmallVecData::from_inline(buf), . } . } . . /// Sets the length of a vector. . /// . /// This will explicitly set the size of the vector, without actually . /// modifying its buffers, so it is up to the caller to ensure that the . /// vector is actually the specified size. . pub unsafe fn set_len(&mut self, new_len: usize) { . let (_, len_ptr, _) = self.triple_mut(); 312,364 ( 0.00%) *len_ptr = new_len; . } . . /// The maximum number of elements this vector can hold inline . #[inline] . fn inline_capacity() -> usize { . if mem::size_of::() > 0 { 96 ( 0.00%) A::size() . } else { . // For zero-size items code like `ptr.add(offset)` always returns the same pointer. . // Therefore all items are at the same address, . // and any array size has capacity for infinitely many items. . // The capacity is limited by the bit width of the length field. . // . // `Vec` also does this: . // https://github.com/rust-lang/rust/blob/1.44.0/src/liballoc/raw_vec.rs#L186 -- line 710 ---------------------------------------- -- line 725 ---------------------------------------- . #[inline] . pub fn len(&self) -> usize { . self.triple().1 . } . . /// Returns `true` if the vector is empty . #[inline] . pub fn is_empty(&self) -> bool { 283,353 ( 0.00%) self.len() == 0 . } . . /// The number of items the vector can hold without reallocating . #[inline] . pub fn capacity(&self) -> usize { . self.triple().2 . } . . /// Returns a tuple with (data ptr, len, capacity) . /// Useful to get all SmallVec properties with a single check of the current storage variant. . #[inline] . fn triple(&self) -> (*const A::Item, usize, usize) { . unsafe { 13,673,774 ( 0.20%) if self.spilled() { . let (ptr, len) = self.data.heap(); . (ptr, len, self.capacity) . } else { . (self.data.inline(), self.capacity, Self::inline_capacity()) . } . } . } . . /// Returns a tuple with (data ptr, len ptr, capacity) . #[inline] . fn triple_mut(&mut self) -> (*mut A::Item, &mut usize, usize) { . unsafe { 17,318,056 ( 0.25%) if self.spilled() { 59,190 ( 0.00%) let &mut (ptr, ref mut len_ptr) = self.data.heap_mut(); . (ptr, len_ptr, self.capacity) . } else { . ( . self.data.inline_mut(), . &mut self.capacity, . Self::inline_capacity(), . ) . } . } . } . . /// Returns `true` if the data has spilled into a separate heap-allocated buffer. . #[inline] . pub fn spilled(&self) -> bool { 19,669,940 ( 0.29%) self.capacity > Self::inline_capacity() . } . . /// Creates a draining iterator that removes the specified range in the vector . /// and yields the removed items. . /// . /// Note 1: The element range is removed even if the iterator is only . /// partially consumed or not consumed at all. . /// -- line 784 ---------------------------------------- -- line 821 ---------------------------------------- . iter: range_slice.iter(), . vec: NonNull::from(self), . } . } . } . . /// Append an item to the vector. . #[inline] 511,271 ( 0.01%) pub fn push(&mut self, value: A::Item) { . unsafe { . let (mut ptr, mut len, cap) = self.triple_mut(); 2,509,446 ( 0.04%) if *len == cap { 1,054 ( 0.00%) self.reserve(1); 36,043 ( 0.00%) let &mut (heap_ptr, ref mut heap_len) = self.data.heap_mut(); . ptr = heap_ptr; . len = heap_len; . } 37,430 ( 0.00%) ptr::write(ptr.add(*len), value); 4,688,771 ( 0.07%) *len += 1; . } 409,042 ( 0.01%) } . . /// Remove an item from the end of the vector and return it, or None if empty. . #[inline] . pub fn pop(&mut self) -> Option { . unsafe { . let (ptr, len_ptr, _) = self.triple_mut(); 1,182,696 ( 0.02%) if *len_ptr == 0 { 24 ( 0.00%) return None; . } 333,773 ( 0.00%) let last_index = *len_ptr - 1; 344,406 ( 0.01%) *len_ptr = last_index; 273,732 ( 0.00%) Some(ptr::read(ptr.add(last_index))) . } 490 ( 0.00%) } . . /// Moves all the elements of `other` into `self`, leaving `other` empty. . /// . /// # Example . /// . /// ``` . /// # use smallvec::{SmallVec, smallvec}; . /// let mut v0: SmallVec<[u8; 16]> = smallvec![1, 2, 3]; -- line 863 ---------------------------------------- -- line 879 ---------------------------------------- . /// or if the capacity computation overflows `usize`. . pub fn grow(&mut self, new_cap: usize) { . infallible(self.try_grow(new_cap)) . } . . /// Re-allocate to set the capacity to `max(new_cap, inline_size())`. . /// . /// Panics if `new_cap` is less than the vector's length 25,694 ( 0.00%) pub fn try_grow(&mut self, new_cap: usize) -> Result<(), CollectionAllocErr> { . unsafe { 714 ( 0.00%) let (ptr, &mut len, cap) = self.triple_mut(); . let unspilled = !self.spilled(); 60,760 ( 0.00%) assert!(new_cap >= len); 60,760 ( 0.00%) if new_cap <= self.inline_size() { . if unspilled { . return Ok(()); . } . self.data = SmallVecData::from_inline(MaybeUninit::uninit()); . ptr::copy_nonoverlapping(ptr, self.data.inline_mut(), len); . self.capacity = len; . deallocate(ptr, cap); 60,760 ( 0.00%) } else if new_cap != cap { 58,467 ( 0.00%) let layout = layout_array::(new_cap)?; . debug_assert!(layout.size() > 0); . let new_alloc; 30,380 ( 0.00%) if unspilled { . new_alloc = NonNull::new(alloc::alloc::alloc(layout)) . .ok_or(CollectionAllocErr::AllocErr { layout })? . .cast() . .as_ptr(); . ptr::copy_nonoverlapping(ptr, new_alloc, len); . } else { . // This should never fail since the same succeeded . // when previously allocating `ptr`. 15,647 ( 0.00%) let old_layout = layout_array::(cap)?; . . let new_ptr = alloc::alloc::realloc(ptr as *mut u8, old_layout, layout.size()); . new_alloc = NonNull::new(new_ptr) . .ok_or(CollectionAllocErr::AllocErr { layout })? . .cast() . .as_ptr(); . } 60,760 ( 0.00%) self.data = SmallVecData::from_heap(new_alloc, len); 89,165 ( 0.00%) self.capacity = new_cap; . } . Ok(()) . } 26,408 ( 0.00%) } . . /// Reserve capacity for `additional` more elements to be inserted. . /// . /// May reserve more space to avoid frequent reallocations. . /// . /// Panics if the capacity computation overflows `usize`. . #[inline] 319,503 ( 0.00%) pub fn reserve(&mut self, additional: usize) { 1,178,735 ( 0.02%) infallible(self.try_reserve(additional)) 362,632 ( 0.01%) } . . /// Reserve capacity for `additional` more elements to be inserted. . /// . /// May reserve more space to avoid frequent reallocations. 4,353,173 ( 0.06%) pub fn try_reserve(&mut self, additional: usize) -> Result<(), CollectionAllocErr> { . // prefer triple_mut() even if triple() would work . // so that the optimizer removes duplicated calls to it . // from callers like insert() 36,324 ( 0.00%) let (_, &mut len, cap) = self.triple_mut(); 4,159,128 ( 0.06%) if cap - len >= additional { . return Ok(()); . } . let new_cap = len . .checked_add(additional) . .and_then(usize::checked_next_power_of_two) . .ok_or(CollectionAllocErr::CapacityOverflow)?; 6,301 ( 0.00%) self.try_grow(new_cap) 4,667,949 ( 0.07%) } . . /// Reserve the minimum capacity for `additional` more elements to be inserted. . /// . /// Panics if the new capacity overflows `usize`. 24 ( 0.00%) pub fn reserve_exact(&mut self, additional: usize) { . infallible(self.try_reserve_exact(additional)) 24 ( 0.00%) } . . /// Reserve the minimum capacity for `additional` more elements to be inserted. . pub fn try_reserve_exact(&mut self, additional: usize) -> Result<(), CollectionAllocErr> { . let (_, &mut len, cap) = self.triple_mut(); 323,801 ( 0.00%) if cap - len >= additional { . return Ok(()); . } . let new_cap = len . .checked_add(additional) . .ok_or(CollectionAllocErr::CapacityOverflow)?; 729 ( 0.00%) self.try_grow(new_cap) 729 ( 0.00%) } . . /// Shrink the capacity of the vector as much as possible. . /// . /// When possible, this will move data from an external heap buffer to the vector's inline . /// storage. . pub fn shrink_to_fit(&mut self) { . if !self.spilled() { . return; -- line 981 ---------------------------------------- -- line 999 ---------------------------------------- . /// If `len` is greater than or equal to the vector's current length, this has no . /// effect. . /// . /// This does not re-allocate. If you want the vector's capacity to shrink, call . /// `shrink_to_fit` after truncating. . pub fn truncate(&mut self, len: usize) { . unsafe { . let (ptr, len_ptr, _) = self.triple_mut(); 261,140 ( 0.00%) while len < *len_ptr { . let last_index = *len_ptr - 1; . *len_ptr = last_index; . ptr::drop_in_place(ptr.add(last_index)); . } . } . } . . /// Extracts a slice containing the entire vector. -- line 1015 ---------------------------------------- -- line 1044 ---------------------------------------- . pub fn clear(&mut self) { . self.truncate(0); . } . . /// Remove and return the element at position `index`, shifting all elements after it to the . /// left. . /// . /// Panics if `index` is out of bounds. 184 ( 0.00%) pub fn remove(&mut self, index: usize) -> A::Item { . unsafe { . let (mut ptr, len_ptr, _) = self.triple_mut(); 49,441 ( 0.00%) let len = *len_ptr; 153,111 ( 0.00%) assert!(index < len); 155,532 ( 0.00%) *len_ptr = len - 1; . ptr = ptr.add(index); . let item = ptr::read(ptr); 102,074 ( 0.00%) ptr::copy(ptr.add(1), ptr, len - index - 1); . item . } 230 ( 0.00%) } . . /// Insert an element at position `index`, shifting all elements after it to the right. . /// . /// Panics if `index` is out of bounds. 664,860 ( 0.01%) pub fn insert(&mut self, index: usize, element: A::Item) { . self.reserve(1); . . unsafe { . let (mut ptr, len_ptr, _) = self.triple_mut(); 60,508 ( 0.00%) let len = *len_ptr; 120,950 ( 0.00%) assert!(index <= len); 241,900 ( 0.00%) *len_ptr = len + 1; . ptr = ptr.add(index); 120,950 ( 0.00%) ptr::copy(ptr, ptr.add(1), len - index); . ptr::write(ptr, element); . } 423,095 ( 0.01%) } . . /// Insert multiple elements at position `index`, shifting all following elements toward the . /// back. . pub fn insert_many>(&mut self, index: usize, iterable: I) { . let mut iter = iterable.into_iter(); . if index == self.len() { . return self.extend(iter); . } -- line 1088 ---------------------------------------- -- line 1201 ---------------------------------------- . } . } . . /// 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 and preserves the order of the retained . /// elements. 692,991 ( 0.01%) pub fn retain bool>(&mut self, mut f: F) { . let mut del = 0; . let len = self.len(); . for i in 0..len { 315,052 ( 0.00%) if !f(&mut self[i]) { 7,372 ( 0.00%) del += 1; 90,460 ( 0.00%) } else if del > 0 { 8,034 ( 0.00%) self.swap(i - del, i); . } . } 153,998 ( 0.00%) self.truncate(len - del); 615,992 ( 0.01%) } . . /// Removes consecutive duplicate elements. 140 ( 0.00%) pub fn dedup(&mut self) . where . A::Item: PartialEq, . { . self.dedup_by(|a, b| a == b); 160 ( 0.00%) } . . /// Removes consecutive duplicate elements using the given equality relation. . pub fn dedup_by(&mut self, mut same_bucket: F) . where . F: FnMut(&mut A::Item, &mut A::Item) -> bool, . { . // See the implementation of Vec::dedup_by in the . // standard library for an explanation of this algorithm. . let len = self.len(); 40 ( 0.00%) if len <= 1 { . return; . } . . let ptr = self.as_mut_ptr(); . let mut w: usize = 1; . . unsafe { . for r in 1..len { . let p_r = ptr.add(r); 73 ( 0.00%) let p_wm1 = ptr.add(w - 1); . if !same_bucket(&mut *p_r, &mut *p_wm1) { 22 ( 0.00%) if r != w { . let p_w = p_wm1.add(1); . mem::swap(&mut *p_r, &mut *p_w); . } 22 ( 0.00%) w += 1; . } . } . } . . self.truncate(w); . } . . /// Removes consecutive elements that map to the same key. -- line 1262 ---------------------------------------- -- line 1418 ---------------------------------------- . capacity: len, . data: SmallVecData::from_inline(unsafe { . let mut data: MaybeUninit = MaybeUninit::uninit(); . ptr::copy_nonoverlapping( . slice.as_ptr(), . data.as_mut_ptr() as *mut A::Item, . len, . ); 7,817 ( 0.00%) data . }), . } . } else { . let mut b = slice.to_vec(); . let (ptr, cap) = (b.as_mut_ptr(), b.capacity()); . mem::forget(b); . SmallVec { . capacity: cap, -- line 1434 ---------------------------------------- -- line 1436 ---------------------------------------- . } . } . } . . /// Copy elements from a slice into the vector at position `index`, shifting any following . /// elements toward the back. . /// . /// For slices of `Copy` types, this is more efficient than `insert`. 981,995 ( 0.01%) pub fn insert_from_slice(&mut self, index: usize, slice: &[A::Item]) { . self.reserve(slice.len()); . . let len = self.len(); 303,615 ( 0.00%) assert!(index <= len); . . unsafe { . let slice_ptr = slice.as_ptr(); . let ptr = self.as_mut_ptr().add(index); . ptr::copy(ptr, ptr.add(slice.len()), len - index); . ptr::copy_nonoverlapping(slice_ptr, ptr, slice.len()); 202,410 ( 0.00%) self.set_len(len + slice.len()); . } 809,640 ( 0.01%) } . . /// Copy elements from a slice and append them to the vector. . /// . /// For slices of `Copy` types, this is more efficient than `extend`. . #[inline] . pub fn extend_from_slice(&mut self, slice: &[A::Item]) { . let len = self.len(); 252,928 ( 0.00%) self.insert_from_slice(len, slice); . } . } . . impl SmallVec . where . A::Item: Clone, . { . /// Resizes the vector so that its length is equal to `len`. . /// . /// If `len` is less than the current length, the vector simply truncated. . /// . /// If `len` is greater than the current length, `value` is appended to the . /// vector until its length equals `len`. 360 ( 0.00%) pub fn resize(&mut self, len: usize, value: A::Item) { . let old_len = self.len(); . 72 ( 0.00%) if len > old_len { . self.extend(repeat(value).take(len - old_len)); . } else { . self.truncate(len); . } 252 ( 0.00%) } . . /// Creates a `SmallVec` with `n` copies of `elem`. . /// ``` . /// use smallvec::SmallVec; . /// . /// let v = SmallVec::<[char; 128]>::from_elem('d', 2); . /// assert_eq!(v, SmallVec::from_buf(['d', 'd'])); . /// ``` -- line 1495 ---------------------------------------- -- line 1522 ---------------------------------------- . } . } . } . . impl ops::DerefMut for SmallVec { . #[inline] . fn deref_mut(&mut self) -> &mut [A::Item] { . unsafe { 289,825 ( 0.00%) let (ptr, &mut len, _) = self.triple_mut(); . slice::from_raw_parts_mut(ptr, len) . } . } . } . . impl AsRef<[A::Item]> for SmallVec { . #[inline] . fn as_ref(&self) -> &[A::Item] { -- line 1538 ---------------------------------------- -- line 1691 ---------------------------------------- . fn from(array: A) -> SmallVec { . SmallVec::from_buf(array) . } . } . . impl> ops::Index for SmallVec { . type Output = I::Output; . 12 ( 0.00%) fn index(&self, index: I) -> &I::Output { . &(**self)[index] 36 ( 0.00%) } . } . . impl> ops::IndexMut for SmallVec { . fn index_mut(&mut self, index: I) -> &mut I::Output { . &mut (&mut **self)[index] . } . } . -- line 1709 ---------------------------------------- -- line 1716 ---------------------------------------- . SmallVec::extend_from_slice(self, other) . } . } . . impl FromIterator for SmallVec { . #[inline] . fn from_iter>(iterable: I) -> SmallVec { . let mut v = SmallVec::new(); 1,931,808 ( 0.03%) v.extend(iterable); . v . } . } . . impl Extend for SmallVec { 5,943,194 ( 0.09%) fn extend>(&mut self, iterable: I) { 617,872 ( 0.01%) let mut iter = iterable.into_iter(); 6 ( 0.00%) let (lower_size_bound, _) = iter.size_hint(); 64,486 ( 0.00%) self.reserve(lower_size_bound); . . unsafe { . let (ptr, len_ptr, cap) = self.triple_mut(); . let mut len = SetLenOnDrop::new(len_ptr); 2,974,325 ( 0.04%) while len.get() < cap { 835,887 ( 0.01%) if let Some(out) = iter.next() { 350 ( 0.00%) ptr::write(ptr.add(len.get()), out); . len.increment_len(1); . } else { . return; . } . } . } . 403,688 ( 0.01%) for elem in iter { 49,408 ( 0.00%) self.push(elem); . } 5,227,745 ( 0.08%) } . } . . impl fmt::Debug for SmallVec . where . A::Item: fmt::Debug, . { . fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { . f.debug_list().entries(self.iter()).finish() -- line 1759 ---------------------------------------- -- line 1764 ---------------------------------------- . #[inline] . fn default() -> SmallVec { . SmallVec::new() . } . } . . #[cfg(feature = "may_dangle")] . unsafe impl<#[may_dangle] A: Array> Drop for SmallVec { 1,979,902 ( 0.03%) fn drop(&mut self) { . unsafe { 4,075,544 ( 0.06%) if self.spilled() { . let (ptr, len) = self.data.heap(); . Vec::from_raw_parts(ptr, len, self.capacity); . } else { . ptr::drop_in_place(&mut self[..]); . } . } 2,141,025 ( 0.03%) } . } . . #[cfg(not(feature = "may_dangle"))] . impl Drop for SmallVec { . fn drop(&mut self) { . unsafe { . if self.spilled() { . let (ptr, len) = self.data.heap(); -- line 1789 ---------------------------------------- -- line 1888 ---------------------------------------- . A::Item: Clone, . { . fn clone(&self) -> IntoIter { . SmallVec::from(self.as_slice()).into_iter() . } . } . . impl Drop for IntoIter { 8,454 ( 0.00%) fn drop(&mut self) { 236,464 ( 0.00%) for _ in self {} 7,840 ( 0.00%) } . } . . impl Iterator for IntoIter { . type Item = A::Item; . . #[inline] . fn next(&mut self) -> Option { 1,422,623 ( 0.02%) if self.current == self.end { 1,977 ( 0.00%) None . } else { . unsafe { . let current = self.current; 670,979 ( 0.01%) self.current += 1; 46,864 ( 0.00%) Some(ptr::read(self.data.as_ptr().add(current))) . } . } . } . . #[inline] . fn size_hint(&self) -> (usize, Option) { 43,418 ( 0.00%) let size = self.end - self.current; . (size, Some(size)) . } . } . . impl DoubleEndedIterator for IntoIter { . #[inline] . fn next_back(&mut self) -> Option { . if self.current == self.end { -- line 1927 ---------------------------------------- -- line 1955 ---------------------------------------- . impl IntoIterator for SmallVec { . type IntoIter = IntoIter; . type Item = A::Item; . fn into_iter(mut self) -> Self::IntoIter { . unsafe { . // Set SmallVec len to zero as `IntoIter` drop handles dropping of the elements . let len = self.len(); . self.set_len(0); 176,229 ( 0.00%) IntoIter { 930,057 ( 0.01%) data: self, . current: 0, . end: len, . } . } . } . } . . impl<'a, A: Array> IntoIterator for &'a SmallVec { -- line 1972 ---------------------------------------- -- line 2000 ---------------------------------------- . len: &'a mut usize, . local_len: usize, . } . . impl<'a> SetLenOnDrop<'a> { . #[inline] . fn new(len: &'a mut usize) -> Self { . SetLenOnDrop { 672,243 ( 0.01%) local_len: *len, . len, . } . } . . #[inline] . fn get(&self) -> usize { . self.local_len . } . . #[inline] . fn increment_len(&mut self, increment: usize) { 494,449 ( 0.01%) self.local_len += increment; . } . } . . impl<'a> Drop for SetLenOnDrop<'a> { . #[inline] . fn drop(&mut self) { 752,383 ( 0.01%) *self.len = self.local_len; . } . } . . #[cfg(feature = "const_new")] . impl SmallVec<[T; N]> { . /// Construct an empty vector. . /// . /// This is a `const` version of [`SmallVec::new`] that is enabled by the feature `const_new`, with the limitation that it only works for arrays. -- line 2035 ---------------------------------------- 13,836,486 ( 0.20%) -------------------------------------------------------------------------------- -- 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> { 4,441 ( 0.00%) pub ty: Ty<'tcx>, 22,205 ( 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 { 63,397 ( 0.00%) pub scope: DefId, 117,477 ( 0.00%) pub bound_region: BoundRegionKind, . } . 1,149,558 ( 0.02%) #[derive(Clone, PartialEq, PartialOrd, Eq, Ord, Hash, TyEncodable, TyDecodable, Copy)] . #[derive(HashStable)] . pub enum BoundRegionKind { . /// An anonymous region parameter for a given fn (&T) 100,581 ( 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. 3,906 ( 0.00%) BrNamed(DefId, Symbol), . . /// Anonymous region for the implicit env pointer parameter . /// to a closure . BrEnv, . } . 2,523 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, Hash, TyEncodable, TyDecodable, Debug, PartialOrd, Ord)] . #[derive(HashStable)] . pub struct BoundRegion { 257,416 ( 0.00%) pub var: BoundVar, 199,590 ( 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. 35,355,904 ( 0.51%) #[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. 4,095,938 ( 0.06%) 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]`. 133,298 ( 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`. 4,420,995 ( 0.06%) 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`. 76,828 ( 0.00%) Dynamic(&'tcx List>>, 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`. 847 ( 0.00%) Generator(DefId, SubstsRef<'tcx>, hir::Movability), . . /// A type representing the types stored inside a generator. . /// This should only appear in GeneratorInteriors. . GeneratorWitness(Binder<'tcx, &'tcx List>>), . . /// The never type `!`. . Never, . -- line 167 ---------------------------------------- -- 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(x: T) {}`. . Param(ParamTy), . . /// Bound type variable, used only when preparing a trait query. 12,935 ( 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 330 ---------------------------------------- . pub closure_kind_ty: T, . pub closure_sig_as_fn_ptr_ty: T, . pub tupled_upvars_ty: T, . } . . impl<'tcx> ClosureSubsts<'tcx> { . /// Construct `ClosureSubsts` from `ClosureSubstsParts`, containing `Substs` . /// for the closure parent, alongside additional closure-specific components. 111 ( 0.00%) pub fn new( . tcx: TyCtxt<'tcx>, . parts: ClosureSubstsParts<'tcx, Ty<'tcx>>, . ) -> ClosureSubsts<'tcx> { . ClosureSubsts { . substs: tcx.mk_substs( 222 ( 0.00%) parts.parent_substs.iter().copied().chain( 444 ( 0.00%) [parts.closure_kind_ty, parts.closure_sig_as_fn_ptr_ty, parts.tupled_upvars_ty] . .iter() . .map(|&ty| ty.into()), . ), . ), . } 222 ( 0.00%) } . . /// Divides the closure substs into their respective components. . /// The ordering assumed here must match that used by `ClosureSubsts::new` above. 2,179 ( 0.00%) fn split(self) -> ClosureSubstsParts<'tcx, GenericArg<'tcx>> { . match self.substs[..] { 19,008 ( 0.00%) [ 5,173 ( 0.00%) ref parent_substs @ .., 5,210 ( 0.00%) closure_kind_ty, 2,797 ( 0.00%) closure_sig_as_fn_ptr_ty, 3,691 ( 0.00%) tupled_upvars_ty, 8,716 ( 0.00%) ] => ClosureSubstsParts { . parent_substs, . closure_kind_ty, . closure_sig_as_fn_ptr_ty, . tupled_upvars_ty, . }, . _ => bug!("closure substs missing synthetics"), . } 6,537 ( 0.00%) } . . /// Returns `true` only if enough of the synthetic types are known to . /// allow using all of the methods on `ClosureSubsts` without panicking. . /// . /// Used primarily by `ty::print::pretty` to be able to handle closure . /// types that haven't had their synthetic types substituted in. 15 ( 0.00%) pub fn is_valid(self) -> bool { 30 ( 0.00%) self.substs.len() >= 3 30 ( 0.00%) && matches!(self.split().tupled_upvars_ty.expect_ty().kind(), Tuple(_)) 30 ( 0.00%) } . . /// Returns the substitutions of the closure's parent. . pub fn parent_substs(self) -> &'tcx [GenericArg<'tcx>] { . self.split().parent_substs . } . . /// Returns an iterator over the list of types of captured paths by the closure. . /// In case there was a type error in figuring out the types of the captured path, an . /// empty iterator is returned. . #[inline] 450 ( 0.00%) pub fn upvar_tys(self) -> impl Iterator> + 'tcx { 765 ( 0.00%) match self.tupled_upvars_ty().kind() { . TyKind::Error(_) => None, 525 ( 0.00%) TyKind::Tuple(..) => Some(self.tupled_upvars_ty().tuple_fields()), . TyKind::Infer(_) => bug!("upvar_tys called before capture types are inferred"), . ty => bug!("Unexpected representation of upvar types tuple {:?}", ty), . } . .into_iter() . .flatten() 300 ( 0.00%) } . . /// Returns the tuple type representing the upvars for this closure. . #[inline] . pub fn tupled_upvars_ty(self) -> Ty<'tcx> { 9,725 ( 0.00%) self.split().tupled_upvars_ty.expect_ty() . } . . /// Returns the closure kind for this closure; may return a type . /// variable during inference. To get the closure kind during . /// inference, use `infcx.closure_kind(substs)`. 1,261 ( 0.00%) pub fn kind_ty(self) -> Ty<'tcx> { . self.split().closure_kind_ty.expect_ty() 2,522 ( 0.00%) } . . /// Returns the `fn` pointer type representing the closure signature for this . /// closure. . // FIXME(eddyb) this should be unnecessary, as the shallowly resolved . // type is known at the time of the creation of `ClosureSubsts`, . // see `rustc_typeck::check::closure`. . pub fn sig_as_fn_ptr_ty(self) -> Ty<'tcx> { . self.split().closure_sig_as_fn_ptr_ty.expect_ty() . } . . /// Returns the closure kind for this closure; only usable outside . /// of an inference context, because in that context we know that . /// there are no type variables. . /// . /// If you have an inference context, use `infcx.closure_kind()`. 51 ( 0.00%) pub fn kind(self) -> ty::ClosureKind { 51 ( 0.00%) self.kind_ty().to_opt_closure_kind().unwrap() 102 ( 0.00%) } . . /// Extracts the signature from the closure. 1,300 ( 0.00%) pub fn sig(self) -> ty::PolyFnSig<'tcx> { . let ty = self.sig_as_fn_ptr_ty(); 2,600 ( 0.00%) match ty.kind() { 5,200 ( 0.00%) ty::FnPtr(sig) => *sig, . _ => bug!("closure_sig_as_fn_ptr_ty is not a fn-ptr: {:?}", ty.kind()), . } 3,900 ( 0.00%) } . } . . /// Similar to `ClosureSubsts`; see the above documentation for more. . #[derive(Copy, Clone, Debug, TypeFoldable)] . pub struct GeneratorSubsts<'tcx> { . pub substs: SubstsRef<'tcx>, . } . -- line 448 ---------------------------------------- -- line 453 ---------------------------------------- . pub return_ty: T, . pub witness: T, . pub tupled_upvars_ty: T, . } . . impl<'tcx> GeneratorSubsts<'tcx> { . /// Construct `GeneratorSubsts` from `GeneratorSubstsParts`, containing `Substs` . /// for the generator parent, alongside additional generator-specific components. 1 ( 0.00%) pub fn new( . tcx: TyCtxt<'tcx>, . parts: GeneratorSubstsParts<'tcx, Ty<'tcx>>, . ) -> GeneratorSubsts<'tcx> { . GeneratorSubsts { . substs: tcx.mk_substs( 2 ( 0.00%) parts.parent_substs.iter().copied().chain( 3 ( 0.00%) [ 1 ( 0.00%) parts.resume_ty, . parts.yield_ty, 1 ( 0.00%) parts.return_ty, . parts.witness, 1 ( 0.00%) parts.tupled_upvars_ty, . ] . .iter() . .map(|&ty| ty.into()), . ), . ), . } 2 ( 0.00%) } . . /// Divides the generator substs into their respective components. . /// The ordering assumed here must match that used by `GeneratorSubsts::new` above. 31 ( 0.00%) fn split(self) -> GeneratorSubstsParts<'tcx, GenericArg<'tcx>> { . match self.substs[..] { 503 ( 0.00%) [ref parent_substs @ .., resume_ty, yield_ty, return_ty, witness, tupled_upvars_ty] => { 155 ( 0.00%) GeneratorSubstsParts { . parent_substs, . resume_ty, . yield_ty, . return_ty, . witness, . tupled_upvars_ty, . } . } . _ => bug!("generator substs missing synthetics"), . } 93 ( 0.00%) } . . /// Returns `true` only if enough of the synthetic types are known to . /// allow using all of the methods on `GeneratorSubsts` without panicking. . /// . /// Used primarily by `ty::print::pretty` to be able to handle generator . /// types that haven't had their synthetic types substituted in. 1 ( 0.00%) pub fn is_valid(self) -> bool { 2 ( 0.00%) self.substs.len() >= 5 2 ( 0.00%) && matches!(self.split().tupled_upvars_ty.expect_ty().kind(), Tuple(_)) 2 ( 0.00%) } . . /// Returns the substitutions of the generator's parent. . pub fn parent_substs(self) -> &'tcx [GenericArg<'tcx>] { . self.split().parent_substs . } . . /// This describes the types that can be contained in a generator. . /// It will be a type variable initially and unified in the last stages of typeck of a body. . /// It contains a tuple of all the types that could end up on a generator frame. . /// The state transformation MIR pass may only produce layouts which mention types . /// in this tuple. Upvars are not counted here. 3 ( 0.00%) pub fn witness(self) -> Ty<'tcx> { . self.split().witness.expect_ty() 6 ( 0.00%) } . . /// Returns an iterator over the list of types of captured paths by the generator. . /// In case there was a type error in figuring out the types of the captured path, an . /// empty iterator is returned. . #[inline] 36 ( 0.00%) pub fn upvar_tys(self) -> impl Iterator> + 'tcx { 33 ( 0.00%) match self.tupled_upvars_ty().kind() { . TyKind::Error(_) => None, 22 ( 0.00%) TyKind::Tuple(..) => Some(self.tupled_upvars_ty().tuple_fields()), . TyKind::Infer(_) => bug!("upvar_tys called before capture types are inferred"), . ty => bug!("Unexpected representation of upvar types tuple {:?}", ty), . } . .into_iter() . .flatten() 24 ( 0.00%) } . . /// Returns the tuple type representing the upvars for this generator. . #[inline] . pub fn tupled_upvars_ty(self) -> Ty<'tcx> { 118 ( 0.00%) self.split().tupled_upvars_ty.expect_ty() . } . . /// Returns the type representing the resume type of the generator. 3 ( 0.00%) pub fn resume_ty(self) -> Ty<'tcx> { . self.split().resume_ty.expect_ty() 6 ( 0.00%) } . . /// Returns the type representing the yield type of the generator. 2 ( 0.00%) pub fn yield_ty(self) -> Ty<'tcx> { . self.split().yield_ty.expect_ty() 4 ( 0.00%) } . . /// Returns the type representing the return type of the generator. 2 ( 0.00%) pub fn return_ty(self) -> Ty<'tcx> { . self.split().return_ty.expect_ty() 4 ( 0.00%) } . . /// Returns the "generator signature", which consists of its yield . /// and return types. . /// . /// N.B., some bits of the code prefers to see this wrapped in a . /// binder, but it never contains bound regions. Probably this . /// function should be removed. 48 ( 0.00%) pub fn poly_sig(self) -> PolyGenSig<'tcx> { 12 ( 0.00%) ty::Binder::dummy(self.sig()) 48 ( 0.00%) } . . /// Returns the "generator signature", which consists of its resume, yield . /// and return types. 13 ( 0.00%) pub fn sig(self) -> GenSig<'tcx> { 39 ( 0.00%) ty::GenSig { . resume_ty: self.resume_ty(), . yield_ty: self.yield_ty(), . return_ty: self.return_ty(), . } 39 ( 0.00%) } . } . . impl<'tcx> GeneratorSubsts<'tcx> { . /// Generator has not been resumed yet. . pub const UNRESUMED: usize = 0; . /// Generator has returned or is completed. . pub const RETURNED: usize = 1; . /// Generator has been poisoned. -- line 586 ---------------------------------------- -- line 635 ---------------------------------------- . Self::POISONED => Cow::from(Self::POISONED_NAME), . _ => Cow::from(format!("Suspend{}", v.as_usize() - 3)), . } . } . . /// The type of the state discriminant used in the generator type. . #[inline] . pub fn discr_ty(&self, tcx: TyCtxt<'tcx>) -> Ty<'tcx> { 4 ( 0.00%) tcx.types.u32 . } . . /// This returns the types of the MIR locals which had to be stored across suspension points. . /// It is calculated in rustc_const_eval::transform::generator::StateTransform. . /// All the types here must be in the tuple in GeneratorInterior. . /// . /// The locals are grouped by their variant number. Note that some locals may . /// be repeated in multiple variants. -- line 651 ---------------------------------------- -- line 659 ---------------------------------------- . layout.variant_fields.iter().map(move |variant| { . variant.iter().map(move |field| layout.field_tys[*field].subst(tcx, self.substs)) . }) . } . . /// This is the types of the fields of a generator which are not stored in a . /// variant. . #[inline] 18 ( 0.00%) pub fn prefix_tys(self) -> impl Iterator> { . self.upvar_tys() 12 ( 0.00%) } . } . . #[derive(Debug, Copy, Clone, HashStable)] . pub enum UpvarSubsts<'tcx> { . Closure(SubstsRef<'tcx>), . Generator(SubstsRef<'tcx>), . } . . impl<'tcx> UpvarSubsts<'tcx> { . /// Returns an iterator over the list of types of captured paths by the closure/generator. . /// In case there was a type error in figuring out the types of the captured path, an . /// empty iterator is returned. . #[inline] . pub fn upvar_tys(self) -> impl Iterator> + 'tcx { 328 ( 0.00%) let tupled_tys = match self { 435 ( 0.00%) UpvarSubsts::Closure(substs) => substs.as_closure().tupled_upvars_ty(), 5 ( 0.00%) UpvarSubsts::Generator(substs) => substs.as_generator().tupled_upvars_ty(), . }; . 716 ( 0.00%) match tupled_tys.kind() { . TyKind::Error(_) => None, 604 ( 0.00%) TyKind::Tuple(..) => Some(self.tupled_upvars_ty().tuple_fields()), . TyKind::Infer(_) => bug!("upvar_tys called before capture types are inferred"), . ty => bug!("Unexpected representation of upvar types tuple {:?}", ty), . } . .into_iter() . .flatten() . } . . #[inline] . pub fn tupled_upvars_ty(self) -> Ty<'tcx> { 552 ( 0.00%) match self { 635 ( 0.00%) UpvarSubsts::Closure(substs) => substs.as_closure().tupled_upvars_ty(), 7 ( 0.00%) UpvarSubsts::Generator(substs) => substs.as_generator().tupled_upvars_ty(), . } . } . } . . /// An inline const is modeled like . /// . /// const InlineConst<'l0...'li, T0...Tj, R>: R; . /// -- line 711 ---------------------------------------- -- line 760 ---------------------------------------- . } . . /// Returns the type of this inline const. . pub fn ty(self) -> Ty<'tcx> { . self.split().ty.expect_ty() . } . } . 97,353 ( 0.00%) #[derive(Debug, Copy, Clone, PartialEq, PartialOrd, Ord, Eq, Hash, TyEncodable, TyDecodable)] 88,180 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub enum ExistentialPredicate<'tcx> { . /// E.g., `Iterator`. . Trait(ExistentialTraitRef<'tcx>), . /// E.g., `Iterator::Item = T`. . Projection(ExistentialProjection<'tcx>), . /// E.g., `Send`. 863 ( 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. 11,410 ( 0.00%) pub fn stable_cmp(&self, tcx: TyCtxt<'tcx>, other: &Self) -> Ordering { . use self::ExistentialPredicate::*; 16,594 ( 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, . } 13,692 ( 0.00%) } . } . . impl<'tcx> Binder<'tcx, ExistentialPredicate<'tcx>> { 7,200 ( 0.00%) pub fn with_self_ty(&self, tcx: TyCtxt<'tcx>, self_ty: Ty<'tcx>) -> ty::Predicate<'tcx> { . use crate::ty::ToPredicate; 4,320 ( 0.00%) match self.skip_binder() { . ExistentialPredicate::Trait(tr) => { . self.rebind(tr).with_self_ty(tcx, self_ty).without_const().to_predicate(tcx) . } . ExistentialPredicate::Projection(p) => { 4 ( 0.00%) self.rebind(p.with_self_ty(tcx, self_ty)).to_predicate(tcx) . } . ExistentialPredicate::AutoTrait(did) => { 228 ( 0.00%) let trait_ref = self.rebind(ty::TraitRef { . def_id: did, . substs: tcx.mk_substs_trait(self_ty, &[]), . }); . trait_ref.without_const().to_predicate(tcx) . } . } 6,400 ( 0.00%) } . } . . impl<'tcx> List>> { . /// Returns the "principal `DefId`" of this set of existential predicates. . /// . /// A Rust trait object type consists (in addition to a lifetime bound) . /// of a set of trait bounds, which are separated into any number . /// of auto-trait bounds, and at most one non-auto-trait bound. The -- line 826 ---------------------------------------- -- line 839 ---------------------------------------- . /// are the set `{Sync}`. . /// . /// 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. 33 ( 0.00%) pub fn principal(&self) -> Option>> { 2,343 ( 0.00%) self[0] 2,244 ( 0.00%) .map_bound(|this| match this { . ExistentialPredicate::Trait(tr) => Some(tr), . _ => None, 132 ( 0.00%) }) . .transpose() 99 ( 0.00%) } . 719 ( 0.00%) pub fn principal_def_id(&self) -> Option { . self.principal().map(|trait_ref| trait_ref.skip_binder().def_id) 1,438 ( 0.00%) } . . #[inline] . pub fn projection_bounds<'a>( . &'a self, . ) -> impl Iterator>> + 'a { . self.iter().filter_map(|predicate| { 81 ( 0.00%) predicate 152 ( 0.00%) .map_bound(|pred| match pred { 26 ( 0.00%) ExistentialPredicate::Projection(projection) => Some(projection), . _ => None, . }) . .transpose() . }) . } . . #[inline] . pub fn auto_traits<'a>(&'a self) -> impl Iterator + 'a { 9 ( 0.00%) self.iter().filter_map(|predicate| match predicate.skip_binder() { . ExistentialPredicate::AutoTrait(did) => Some(did), . _ => None, . }) . } . } . . /// A complete reference to a trait. These take numerous guises in syntax, . /// but perhaps the most recognizable form is in a where-clause: -- line 884 ---------------------------------------- -- line 886 ---------------------------------------- . /// T: Foo . /// . /// 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`, but in . /// that case the `Self` parameter is absent from the substitutions. 31,871 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)] 2,615,929 ( 0.04%) #[derive(HashStable, TypeFoldable)] . pub struct TraitRef<'tcx> { 6,119 ( 0.00%) pub def_id: DefId, 1,820,245 ( 0.03%) pub substs: SubstsRef<'tcx>, . } . . impl<'tcx> TraitRef<'tcx> { 6,679 ( 0.00%) pub fn new(def_id: DefId, substs: SubstsRef<'tcx>) -> TraitRef<'tcx> { . TraitRef { def_id, substs } 26,716 ( 0.00%) } . . /// Returns a `TraitRef` of the form `P0: Foo` where `Pi` . /// are the parameters defined on trait. 1,503 ( 0.00%) pub fn identity(tcx: TyCtxt<'tcx>, def_id: DefId) -> Binder<'tcx, TraitRef<'tcx>> { 668 ( 0.00%) ty::Binder::dummy(TraitRef { . def_id, 1,002 ( 0.00%) substs: InternalSubsts::identity_for_item(tcx, def_id), . }) 1,336 ( 0.00%) } . . #[inline] 6 ( 0.00%) pub fn self_ty(&self) -> Ty<'tcx> { . self.substs.type_at(0) 4 ( 0.00%) } . 5,584 ( 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); . 698 ( 0.00%) ty::TraitRef { def_id: trait_id, substs: tcx.intern_substs(&substs[..defs.params.len()]) } 7,678 ( 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 { 3,447 ( 0.00%) self.skip_binder().def_id 1,149 ( 0.00%) } . 7,363 ( 0.00%) pub fn to_poly_trait_predicate(&self) -> ty::PolyTraitPredicate<'tcx> { 14,726 ( 0.00%) self.map_bound(|trait_ref| ty::TraitPredicate { . trait_ref, . constness: ty::BoundConstness::NotConst, . polarity: ty::ImplPolarity::Positive, . }) 7,363 ( 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). 92 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)] 30,937 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub struct ExistentialTraitRef<'tcx> { 3,958 ( 0.00%) pub def_id: DefId, 34,922 ( 0.00%) pub substs: SubstsRef<'tcx>, . } . . impl<'tcx> ExistentialTraitRef<'tcx> { 168 ( 0.00%) pub fn erase_self_ty( . tcx: TyCtxt<'tcx>, . trait_ref: ty::TraitRef<'tcx>, . ) -> ty::ExistentialTraitRef<'tcx> { . // Assert there is a Self. . trait_ref.substs.type_at(0); . . ty::ExistentialTraitRef { . def_id: trait_ref.def_id, . substs: tcx.intern_substs(&trait_ref.substs[1..]), . } 168 ( 0.00%) } . . /// Object types don't have a self type specified. Therefore, when . /// 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. 34 ( 0.00%) pub fn with_self_ty(&self, tcx: TyCtxt<'tcx>, self_ty: Ty<'tcx>) -> ty::TraitRef<'tcx> { . // otherwise the escaping vars would be captured by the binder . // debug_assert!(!self_ty.has_escaping_bound_vars()); . 17 ( 0.00%) ty::TraitRef { def_id: self.def_id, substs: tcx.mk_substs_trait(self_ty, self.substs) } 85 ( 0.00%) } . } . . pub type PolyExistentialTraitRef<'tcx> = Binder<'tcx, ExistentialTraitRef<'tcx>>; . . impl<'tcx> PolyExistentialTraitRef<'tcx> { . pub fn def_id(&self) -> DefId { . self.skip_binder().def_id . } . . /// Object types don't have a self type specified. Therefore, when . /// 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. 36 ( 0.00%) pub fn with_self_ty(&self, tcx: TyCtxt<'tcx>, self_ty: Ty<'tcx>) -> ty::PolyTraitRef<'tcx> { 36 ( 0.00%) self.map_bound(|trait_ref| trait_ref.with_self_ty(tcx, self_ty)) 48 ( 0.00%) } . } . 91,936 ( 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` using the `impl_binder_encode_decode!` macro. 107,186 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)] 1,175,006 ( 0.02%) pub struct Binder<'tcx, T>(T, &'tcx List); . . 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. 123,078 ( 0.00%) pub fn dummy(value: T) -> Binder<'tcx, T> { 478,149 ( 0.01%) assert!(!value.has_escaping_bound_vars()); 1,023,024 ( 0.01%) Binder(value, ty::List::empty()) 122,668 ( 0.00%) } . . pub fn bind_with_vars(value: T, vars: &'tcx List) -> Binder<'tcx, T> { . if cfg!(debug_assertions) { . let mut validator = ValidateBoundVars::new(vars); . value.visit_with(&mut validator); . } 32,791 ( 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 { 3,303,891 ( 0.05%) self.0 . } . . pub fn bound_vars(&self) -> &'tcx List { 2,182 ( 0.00%) self.1 . } . . pub fn as_ref(&self) -> Binder<'tcx, &T> { 8,541 ( 0.00%) Binder(&self.0, self.1) . } . . pub fn map_bound_ref_unchecked(&self, f: F) -> Binder<'tcx, U> . where . F: FnOnce(&T) -> U, . { . let value = f(&self.0); . Binder(value, self.1) -- line 1083 ---------------------------------------- -- line 1085 ---------------------------------------- . . pub fn map_bound_ref>(&self, f: F) -> Binder<'tcx, U> . where . F: FnOnce(&T) -> U, . { . self.as_ref().map_bound(f) . } . 1,183 ( 0.00%) pub fn map_bound>(self, f: F) -> Binder<'tcx, U> . where . F: FnOnce(T) -> U, . { 103,524 ( 0.00%) let value = f(self.0); . if cfg!(debug_assertions) { . let mut validator = ValidateBoundVars::new(self.1); . value.visit_with(&mut validator); . } 764,547 ( 0.01%) Binder(value, self.1) 1,177 ( 0.00%) } . . pub fn try_map_bound, E>(self, f: F) -> Result, E> . where . F: FnOnce(T) -> Result, . { . let value = f(self.0)?; . if cfg!(debug_assertions) { . let mut validator = ValidateBoundVars::new(self.1); . value.visit_with(&mut validator); . } 16,954 ( 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(&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); . } 27,026 ( 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 . where . T: TypeFoldable<'tcx>, . { 553,510 ( 0.01%) if self.0.has_escaping_bound_vars() { None } else { Some(self.skip_binder()) } 2,435 ( 0.00%) } . . /// 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. . pub fn split(self, f: F) -> (Binder<'tcx, U>, Binder<'tcx, V>) -- line 1160 ---------------------------------------- -- line 1170 ---------------------------------------- . pub fn transpose(self) -> Option> { . 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 `>::N`. 2,105 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)] 108,970 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub struct ProjectionTy<'tcx> { . /// The parameters of the associated item. 76,088 ( 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`. 64,913 ( 0.00%) pub item_def_id: DefId, . } . . impl<'tcx> ProjectionTy<'tcx> { 47,838 ( 0.00%) pub fn trait_def_id(&self, tcx: TyCtxt<'tcx>) -> DefId { 13,668 ( 0.00%) tcx.associated_item(self.item_def_id).container.id() 54,672 ( 0.00%) } . . /// Extracts the underlying trait reference and own substs from this projection. . /// For example, if this is a projection of `::Item<'a>`, . /// then this function would return a `T: Iterator` trait reference and `['a]` as the own substs 8,939 ( 0.00%) pub fn trait_ref_and_own_substs( . &self, . tcx: TyCtxt<'tcx>, . ) -> (ty::TraitRef<'tcx>, &'tcx [ty::GenericArg<'tcx>]) { 3,831 ( 0.00%) let def_id = tcx.associated_item(self.item_def_id).container.id(); . let trait_generics = tcx.generics_of(def_id); 6,385 ( 0.00%) ( . ty::TraitRef { def_id, substs: self.substs.truncate_to(tcx, trait_generics) }, . &self.substs[trait_generics.count()..], . ) 11,493 ( 0.00%) } . . /// Extracts the underlying trait reference from this projection. . /// For example, if this is a projection of `::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. 60,516 ( 0.00%) pub fn trait_ref(&self, tcx: TyCtxt<'tcx>) -> ty::TraitRef<'tcx> { 6,724 ( 0.00%) let def_id = self.trait_def_id(tcx); 6,724 ( 0.00%) ty::TraitRef { def_id, substs: self.substs.truncate_to(tcx, tcx.generics_of(def_id)) } 73,964 ( 0.00%) } . 13,330 ( 0.00%) pub fn self_ty(&self) -> Ty<'tcx> { 39,990 ( 0.00%) self.substs.type_at(0) 26,660 ( 0.00%) } . } . 54 ( 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>, . } . . 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. 134,804 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)] 108,761 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub struct FnSig<'tcx> { 21,470 ( 0.00%) pub inputs_and_output: &'tcx List>, 178,200 ( 0.00%) pub c_variadic: bool, 36,314 ( 0.00%) pub unsafety: hir::Unsafety, 161,702 ( 0.00%) pub abi: abi::Abi, . } . . impl<'tcx> FnSig<'tcx> { 99,481 ( 0.00%) pub fn inputs(&self) -> &'tcx [Ty<'tcx>] { 427,027 ( 0.01%) &self.inputs_and_output[..self.inputs_and_output.len() - 1] 198,962 ( 0.00%) } . 60,660 ( 0.00%) pub fn output(&self) -> Ty<'tcx> { 450,477 ( 0.01%) self.inputs_and_output[self.inputs_and_output.len() - 1] 121,320 ( 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>]> { 13,039 ( 0.00%) self.map_bound_ref_unchecked(|fn_sig| fn_sig.inputs()) . } . #[inline] . pub fn input(&self, index: usize) -> ty::Binder<'tcx, Ty<'tcx>> { 50,292 ( 0.00%) self.map_bound_ref(|fn_sig| fn_sig.inputs()[index]) . } . pub fn inputs_and_output(&self) -> ty::Binder<'tcx, &'tcx List>> { . self.map_bound_ref(|fn_sig| fn_sig.inputs_and_output) 1,039 ( 0.00%) } . #[inline] . pub fn output(&self) -> ty::Binder<'tcx, Ty<'tcx>> { 28,581 ( 0.00%) self.map_bound_ref(|fn_sig| fn_sig.output()) . } . pub fn c_variadic(&self) -> bool { 2,072 ( 0.00%) self.skip_binder().c_variadic 1,036 ( 0.00%) } . pub fn unsafety(&self) -> hir::Unsafety { 22,434 ( 0.00%) self.skip_binder().unsafety 11,217 ( 0.00%) } . pub fn abi(&self) -> abi::Abi { 25,412 ( 0.00%) self.skip_binder().abi 6,353 ( 0.00%) } . } . . pub type CanonicalPolyFnSig<'tcx> = Canonical<'tcx, Binder<'tcx, FnSig<'tcx>>>; . 180 ( 0.00%) #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)] . #[derive(HashStable)] . pub struct ParamTy { 718 ( 0.00%) pub index: u32, . pub name: Symbol, . } . . impl<'tcx> ParamTy { 382 ( 0.00%) pub fn new(index: u32, name: Symbol) -> ParamTy { . ParamTy { index, name } 191 ( 0.00%) } . . pub fn for_def(def: &ty::GenericParamDef) -> ParamTy { 166 ( 0.00%) ParamTy::new(def.index, def.name) 83 ( 0.00%) } . . #[inline] . 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 { 120 ( 0.00%) pub index: u32, 120 ( 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 13,633,836 ( 0.20%) #[derive(Clone, PartialEq, Eq, Hash, Copy, TyEncodable, TyDecodable, PartialOrd, Ord)] 54 ( 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. 394,656 ( 0.01%) 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, . } . 27,538 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, Hash, TyEncodable, TyDecodable, Debug, PartialOrd, Ord)] . pub struct EarlyBoundRegion { 39,557 ( 0.00%) pub def_id: DefId, 42,884 ( 0.00%) pub index: u32, 49,577 ( 0.00%) pub name: Symbol, . } . . /// A **`const`** **v**ariable **ID**. . #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)] . pub struct ConstVid<'tcx> { 7,434 ( 0.00%) pub index: u32, 2,340 ( 0.00%) pub phantom: PhantomData<&'tcx ()>, . } . . rustc_index::newtype_index! { . /// A **region** (lifetime) **v**ariable **ID**. . pub struct RegionVid { . DEBUG_FORMAT = custom, . } . } -- line 1505 ---------------------------------------- -- 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, 12,935 ( 0.00%) pub kind: BoundTyKind, . } . 220,039 ( 0.00%) #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)] . #[derive(HashStable)] . pub enum BoundTyKind { . Anon, . Param(Symbol), . } . . impl From for BoundTy { . fn from(var: BoundVar) -> Self { . BoundTy { var, kind: BoundTyKind::Anon } . } . } . . /// A `ProjectionPredicate` for an `ExistentialTraitRef`. 26 ( 0.00%) #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)] 7,423 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub struct ExistentialProjection<'tcx> { 724 ( 0.00%) pub item_def_id: DefId, 6,880 ( 0.00%) pub substs: SubstsRef<'tcx>, 1,720 ( 0.00%) pub term: Term<'tcx>, . } . . pub type PolyExistentialProjection<'tcx> = Binder<'tcx, ExistentialProjection<'tcx>>; . . impl<'tcx> ExistentialProjection<'tcx> { . /// Extracts the underlying existential trait reference from this projection. . /// For example, if this is a projection of `exists T. ::Item == X`, . /// then this function would return an `exists T. T: Iterator` existential trait . /// reference. 1,148 ( 0.00%) pub fn trait_ref(&self, tcx: TyCtxt<'tcx>) -> ty::ExistentialTraitRef<'tcx> { 492 ( 0.00%) let def_id = tcx.associated_item(self.item_def_id).container.id(); 328 ( 0.00%) let subst_count = tcx.generics_of(def_id).count() - 1; 164 ( 0.00%) let substs = tcx.intern_substs(&self.substs[..subst_count]); . ty::ExistentialTraitRef { def_id, substs } 1,476 ( 0.00%) } . . pub fn with_self_ty( . &self, . tcx: TyCtxt<'tcx>, . self_ty: Ty<'tcx>, . ) -> ty::ProjectionPredicate<'tcx> { . // otherwise the escaping regions would be captured by the binders . debug_assert!(!self_ty.has_escaping_bound_vars()); -- line 1566 ---------------------------------------- -- line 1569 ---------------------------------------- . projection_ty: ty::ProjectionTy { . item_def_id: self.item_def_id, . substs: tcx.mk_substs_trait(self_ty, self.substs), . }, . term: self.term, . } . } . 40 ( 0.00%) pub fn erase_self_ty( . tcx: TyCtxt<'tcx>, . projection_predicate: ty::ProjectionPredicate<'tcx>, . ) -> Self { . // Assert there is a Self. 24 ( 0.00%) projection_predicate.projection_ty.substs.type_at(0); . 32 ( 0.00%) Self { 16 ( 0.00%) item_def_id: projection_predicate.projection_ty.item_def_id, . substs: tcx.intern_substs(&projection_predicate.projection_ty.substs[1..]), 8 ( 0.00%) term: projection_predicate.term, . } 56 ( 0.00%) } . } . . impl<'tcx> PolyExistentialProjection<'tcx> { 55 ( 0.00%) pub fn with_self_ty( . &self, . tcx: TyCtxt<'tcx>, . self_ty: Ty<'tcx>, . ) -> ty::PolyProjectionPredicate<'tcx> { 55 ( 0.00%) self.map_bound(|p| p.with_self_ty(tcx, self_ty)) 66 ( 0.00%) } . . pub fn item_def_id(&self) -> DefId { 22 ( 0.00%) self.skip_binder().item_def_id 11 ( 0.00%) } . } . . /// Region utilities . impl RegionKind { . /// Is this region named by the user? . pub fn has_name(&self) -> bool { . match *self { . RegionKind::ReEarlyBound(ebr) => ebr.has_name(), -- line 1611 ---------------------------------------- -- line 1616 ---------------------------------------- . RegionKind::RePlaceholder(placeholder) => placeholder.name.is_named(), . RegionKind::ReEmpty(_) => false, . RegionKind::ReErased => false, . } . } . . #[inline] . pub fn is_late_bound(&self) -> bool { 13,078 ( 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 { 374,569 ( 0.01%) match *self { . ty::ReLateBound(debruijn, _) => debruijn >= index, . _ => false, . } . } . . pub fn type_flags(&self) -> TypeFlags { . let mut flags = TypeFlags::empty(); . 578,772 ( 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 18,644 ( 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 { 13,273 ( 0.00%) match self.kind() { 4,636 ( 0.00%) Tuple(ref tys) => tys.is_empty(), . _ => false, . } . } . . #[inline] . pub fn is_never(&self) -> bool { 154,985 ( 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 { 200,198 ( 0.00%) matches!(self.kind(), Infer(TyVar(_))) . } . . #[inline] . pub fn ty_vid(&self) -> Option { 143,480 ( 0.00%) match self.kind() { 21,246 ( 0.00%) &Infer(TyVar(vid)) => Some(vid), . _ => None, . } . } . . #[inline] . pub fn is_ty_infer(&self) -> bool { 336 ( 0.00%) matches!(self.kind(), Infer(_)) . } . . #[inline] . pub fn is_phantom_data(&self) -> bool { 13 ( 0.00%) if let Adt(def, _) = self.kind() { def.is_phantom_data() } else { false } . } . . #[inline] . pub fn is_bool(&self) -> bool { 192 ( 0.00%) *self.kind() == Bool . } . . /// Returns `true` if this type is a `str`. . #[inline] . pub fn is_str(&self) -> bool { . *self.kind() == Str . } . . #[inline] . pub fn is_param(&self, index: u32) -> bool { 63 ( 0.00%) match self.kind() { . ty::Param(ref data) => data.index == index, . _ => false, . } . } . . #[inline] . pub fn is_slice(&self) -> bool { . match self.kind() { . RawPtr(TypeAndMut { ty, .. }) | Ref(_, ty, _) => matches!(ty.kind(), Slice(_) | Str), . _ => false, . } . } . . #[inline] . pub fn is_array(&self) -> bool { 1,183 ( 0.00%) matches!(self.kind(), Array(..)) . } . . #[inline] . pub fn is_simd(&self) -> bool { . match self.kind() { . Adt(def, _) => def.repr.simd(), . _ => false, . } . } . 1,612 ( 0.00%) pub fn sequence_element_type(&self, tcx: TyCtxt<'tcx>) -> Ty<'tcx> { 3,224 ( 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), . } 1,612 ( 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 1838 ---------------------------------------- . } . } . _ => bug!("`simd_size_and_type` called on invalid type"), . } . } . . #[inline] . pub fn is_region_ptr(&self) -> bool { 157 ( 0.00%) matches!(self.kind(), Ref(..)) . } . . #[inline] . pub fn is_mutable_ptr(&self) -> bool { 6 ( 0.00%) matches!( 4 ( 0.00%) self.kind(), . RawPtr(TypeAndMut { mutbl: hir::Mutability::Mut, .. }) . | Ref(_, _, hir::Mutability::Mut) . ) . } . . /// Get the mutability of the reference or `None` when not a reference . #[inline] . pub fn ref_mutability(&self) -> Option { -- line 1860 ---------------------------------------- -- line 1861 ---------------------------------------- . match self.kind() { . Ref(_, _, mutability) => Some(*mutability), . _ => None, . } . } . . #[inline] . pub fn is_unsafe_ptr(&self) -> bool { 11,167 ( 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 { 22 ( 0.00%) self.is_region_ptr() || self.is_unsafe_ptr() || self.is_fn_ptr() . } . . #[inline] . pub fn is_box(&self) -> bool { 184,412 ( 0.00%) match self.kind() { 37,834 ( 0.00%) Adt(def, _) => def.is_box(), . _ => false, . } . } . . /// Panics if called on any type other than `Box`. 1,276 ( 0.00%) pub fn boxed_ty(&self) -> Ty<'tcx> { 1,276 ( 0.00%) match self.kind() { 3,190 ( 0.00%) Adt(def, substs) if def.is_box() => substs.type_at(0), . _ => bug!("`boxed_ty` is called on non-box type {:?}", self), . } 1,276 ( 0.00%) } . . /// 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 { 4,649 ( 0.00%) matches!( 10,679 ( 0.00%) self.kind(), . Bool | Char . | Int(_) . | Float(_) . | Uint(_) . | FnDef(..) . | FnPtr(_) . | RawPtr(_) . | Infer(IntVar(_) | FloatVar(_)) . ) . } . . /// Returns `true` if this type is a floating point type. . #[inline] . pub fn is_floating_point(&self) -> bool { 23 ( 0.00%) matches!(self.kind(), Float(_) | Infer(FloatVar(_))) . } . . #[inline] . pub fn is_trait(&self) -> bool { . matches!(self.kind(), Dynamic(..)) . } . . #[inline] . pub fn is_enum(&self) -> bool { 34 ( 0.00%) matches!(self.kind(), Adt(adt_def, _) if adt_def.is_enum()) . } . . #[inline] . pub fn is_union(&self) -> bool { 26,889 ( 0.00%) matches!(self.kind(), Adt(adt_def, _) if adt_def.is_union()) . } . . #[inline] . pub fn is_closure(&self) -> bool { 7,568 ( 0.00%) matches!(self.kind(), Closure(..)) . } . . #[inline] . pub fn is_generator(&self) -> bool { 11,201 ( 0.00%) matches!(self.kind(), Generator(..)) . } . . #[inline] . pub fn is_integral(&self) -> bool { 24,538 ( 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 { 10,151 ( 0.00%) matches!(self.kind(), Infer(FreshTy(_) | FreshIntTy(_) | FreshFloatTy(_))) . } . . #[inline] . pub fn is_char(&self) -> bool { . matches!(self.kind(), Char) . } . . #[inline] . pub fn is_numeric(&self) -> bool { . self.is_integral() || self.is_floating_point() . } . . #[inline] . pub fn is_signed(&self) -> bool { 64 ( 0.00%) matches!(self.kind(), Int(_)) . } . . #[inline] . pub fn is_ptr_sized_integral(&self) -> bool { 5,838 ( 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. 37,063 ( 0.00%) pub fn builtin_deref(&self, explicit: bool) -> Option> { 230,713 ( 0.00%) match self.kind() { 5,674 ( 0.00%) Adt(def, _) if def.is_box() => { 1,757 ( 0.00%) Some(TypeAndMut { ty: self.boxed_ty(), mutbl: hir::Mutability::Not }) . } 138,866 ( 0.00%) Ref(_, ty, mutbl) => Some(TypeAndMut { ty, mutbl: *mutbl }), 642 ( 0.00%) RawPtr(mt) if explicit => Some(*mt), . _ => None, . } 74,126 ( 0.00%) } . . /// Returns the type of `ty[i]`. . pub fn builtin_index(&self) -> Option> { 2,194 ( 0.00%) match self.kind() { . Array(ty, _) | Slice(ty) => Some(ty), . _ => None, . } 433 ( 0.00%) } . 216,288 ( 0.00%) pub fn fn_sig(&self, tcx: TyCtxt<'tcx>) -> PolyFnSig<'tcx> { 108,144 ( 0.00%) match self.kind() { 80,853 ( 0.00%) FnDef(def_id, substs) => tcx.fn_sig(*def_id).subst(tcx, substs), 425 ( 0.00%) 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), . } 243,324 ( 0.00%) } . . #[inline] . pub fn is_fn(&self) -> bool { 1,911 ( 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> { 8,580 ( 0.00%) match self.kind() { . Adt(adt, _) => Some(adt), . _ => None, . } . } . . /// Iterates over tuple fields. . /// Panics when called on anything but a tuple. 444 ( 0.00%) pub fn tuple_fields(&self) -> impl DoubleEndedIterator> { 6,060 ( 0.00%) match self.kind() { 3,676 ( 0.00%) Tuple(substs) => substs.iter().map(|field| field.expect_ty()), . _ => bug!("tuple_fields called on non-tuple"), . } 888 ( 0.00%) } . . /// Get the `i`-th element of a tuple. . /// Panics when called on anything but a tuple. 256 ( 0.00%) pub fn tuple_element_ty(&self, i: usize) -> Option> { 512 ( 0.00%) match self.kind() { 512 ( 0.00%) Tuple(substs) => substs.iter().nth(i).map(|field| field.expect_ty()), . _ => bug!("tuple_fields called on non-tuple"), . } 512 ( 0.00%) } . . /// If the type contains variants, returns the valid range of variant indices. . // . // FIXME: This requires the optimized MIR in the case of generators. . #[inline] . pub fn variant_range(&self, tcx: TyCtxt<'tcx>) -> Option> { . match self.kind() { . TyKind::Adt(adt, _) => Some(adt.variant_range()), -- line 2068 ---------------------------------------- -- line 2073 ---------------------------------------- . } . } . . /// If the type contains variants, returns the variant for `variant_index`. . /// Panics if `variant_index` is out of range. . // . // FIXME: This requires the optimized MIR in the case of generators. . #[inline] 110 ( 0.00%) pub fn discriminant_for_variant( . &self, . tcx: TyCtxt<'tcx>, . variant_index: VariantIdx, . ) -> Option> { 95 ( 0.00%) match self.kind() { 16 ( 0.00%) TyKind::Adt(adt, _) if adt.variants.is_empty() => { . // This can actually happen during CTFE, see . // https://github.com/rust-lang/rust/issues/89765. . None . } 8 ( 0.00%) TyKind::Adt(adt, _) if adt.is_enum() => { . Some(adt.discriminant_for_variant(tcx, variant_index)) . } . TyKind::Generator(def_id, substs, _) => { . Some(substs.as_generator().discriminant_for_variant(*def_id, tcx, variant_index)) . } . _ => None, . } 88 ( 0.00%) } . . /// Returns the type of the discriminant of this type. 17,040 ( 0.00%) pub fn discriminant_ty(&'tcx self, tcx: TyCtxt<'tcx>) -> Ty<'tcx> { 8,520 ( 0.00%) match self.kind() { 13,624 ( 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) . } . } 13,632 ( 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 2200 ---------------------------------------- . /// function converts such a special type into the closure . /// kind. To go the other way, use . /// `tcx.closure_kind_ty(closure_kind)`. . /// . /// Note that during type checking, we use an inference variable . /// to represent the closure kind, because it has not yet been . /// inferred. Once upvar inference (in `rustc_typeck/src/check/upvar.rs`) . /// is complete, that type variable will be unified. 3,062 ( 0.00%) pub fn to_opt_closure_kind(&self) -> Option { 6,124 ( 0.00%) match self.kind() { 5,780 ( 0.00%) Int(int_ty) => match int_ty { . ty::IntTy::I8 => Some(ty::ClosureKind::Fn), . ty::IntTy::I16 => Some(ty::ClosureKind::FnMut), . ty::IntTy::I32 => Some(ty::ClosureKind::FnOnce), . _ => bug!("cannot convert type `{:?}` to a closure kind", self), . }, . . // "Bound" types appear in canonical queries when the . // closure type is not yet known . Bound(..) | Infer(_) => None, . . Error(_) => Some(ty::ClosureKind::Fn), . . _ => bug!("cannot convert type `{:?}` to a closure kind", self), . } 3,062 ( 0.00%) } . . /// Fast path helper for testing if a type is `Sized`. . /// . /// 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`. 741,366 ( 0.01%) pub fn is_trivially_sized(&self, tcx: TyCtxt<'tcx>) -> bool { 494,244 ( 0.01%) 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, . 17,861 ( 0.00%) ty::Tuple(tys) => tys.iter().all(|ty| ty.expect_ty().is_trivially_sized(tcx)), . 47,619 ( 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) . } . } 741,366 ( 0.01%) } . } . . /// 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. . /// . /// When in doubt, use `VarianceDiagInfo::default()` 216 ( 0.00%) #[derive(Copy, Clone, Debug, Default, PartialEq, Eq, PartialOrd, Ord)] . pub enum VarianceDiagInfo<'tcx> { . /// No additional information - this is the default. . /// We will not add any additional information to error messages. . #[default] . None, . /// We switched our variance because a generic argument occurs inside . /// the invariant generic argument of another type. . Invariant { -- line 2290 ---------------------------------------- -- 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. 224,502 ( 0.00%) pub fn xform(self, other: VarianceDiagInfo<'tcx>) -> VarianceDiagInfo<'tcx> { . // For now, just use the first `VarianceDiagInfo::Invariant` that we see 336,753 ( 0.00%) match self { . VarianceDiagInfo::None => other, . VarianceDiagInfo::Invariant { .. } => self, . } 112,251 ( 0.00%) } . } 49,180,569 ( 0.72%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_const_eval/src/interpret/intern.rs -------------------------------------------------------------------------------- Ir -- line 49 ---------------------------------------- . /// particular allocation. It is primarily used to make as many allocations as possible . /// read-only so LLVM can place them in const memory. . mode: InternMode, . /// This field stores whether we are *currently* inside an `UnsafeCell`. This can affect . /// the intern mode of references we encounter. . inside_unsafe_cell: bool, . } . 904 ( 0.00%) #[derive(Copy, Clone, Debug, PartialEq, Hash, Eq)] . enum InternMode { . /// A static and its current mutability. Below shared references inside a `static mut`, . /// this is *immutable*, and below mutable references inside an `UnsafeCell`, this . /// is *mutable*. . Static(hir::Mutability), . /// A `const`. . Const, . } -- line 65 ---------------------------------------- -- line 69 ---------------------------------------- . struct IsStaticOrFn; . . /// Intern an allocation without looking at its children. . /// `mode` is the mode of the environment where we found this pointer. . /// `mutablity` is the mutability of the place to be interned; even if that says . /// `immutable` things might become mutable if `ty` is not frozen. . /// `ty` can be `None` if there is no potential interior mutability . /// to account for (e.g. for vtables). 1,392 ( 0.00%) fn intern_shallow<'rt, 'mir, 'tcx, M: CompileTimeMachine<'mir, 'tcx, const_eval::MemoryKind>>( . ecx: &'rt mut InterpCx<'mir, 'tcx, M>, . leftover_allocations: &'rt mut FxHashSet, . alloc_id: AllocId, . mode: InternMode, . ty: Option>, . ) -> Option { . trace!("intern_shallow {:?} with {:?}", alloc_id, mode); . // remove allocation 116 ( 0.00%) let tcx = ecx.tcx; 1,695 ( 0.00%) let (kind, mut alloc) = match ecx.memory.alloc_map.remove(&alloc_id) { 1,130 ( 0.00%) Some(entry) => entry, . None => { . // Pointer not found in local memory map. It is either a pointer to the global . // map, or dangling. . // If the pointer is dangling (neither in local nor global memory), we leave it . // to validation to error -- it has the much better error messages, pointing out where . // in the value the dangling reference lies. . // The `delay_span_bug` ensures that we don't forget such a check in validation. 15 ( 0.00%) if tcx.get_global_alloc(alloc_id).is_none() { . tcx.sess.delay_span_bug(ecx.tcx.span, "tried to intern dangling pointer"); . } . // treat dangling pointers like other statics . // just to stop trying to recurse into them . return Some(IsStaticOrFn); . } . }; . // This match is just a canary for future changes to `MemoryKind`, which most likely need -- line 104 ---------------------------------------- -- line 106 ---------------------------------------- . match kind { . MemoryKind::Stack . | MemoryKind::Machine(const_eval::MemoryKind::Heap) . | MemoryKind::CallerLocation => {} . } . // Set allocation mutability as appropriate. This is used by LLVM to put things into . // read-only memory, and also by Miri when evaluating other globals that . // access this one. 226 ( 0.00%) if let InternMode::Static(mutability) = mode { . // For this, we need to take into account `UnsafeCell`. When `ty` is `None`, we assume . // no interior mutability. 60 ( 0.00%) let frozen = ty.map_or(true, |ty| ty.is_freeze(ecx.tcx, ecx.param_env)); . // For statics, allocation mutability is the combination of place mutability and . // type mutability. . // The entire allocation needs to be mutable if it contains an `UnsafeCell` anywhere. . let immutable = mutability == Mutability::Not && frozen; 36 ( 0.00%) if immutable { . alloc.mutability = Mutability::Not; . } else { . // Just making sure we are not "upgrading" an immutable allocation to mutable. 11 ( 0.00%) assert_eq!(alloc.mutability, Mutability::Mut); . } . } else { . // No matter what, *constants are never mutable*. Mutating them is UB. . // See const_eval::machine::MemoryExtra::can_access_statics for why . // immutability is so important. . . // Validation will ensure that there is no `UnsafeCell` on an immutable allocation. . alloc.mutability = Mutability::Not; . }; . // link the alloc id to the actual allocation 2,599 ( 0.00%) let alloc = tcx.intern_const_alloc(alloc); . leftover_allocations.extend(alloc.relocations().iter().map(|&(_, alloc_id)| alloc_id)); 452 ( 0.00%) tcx.set_alloc_id_memory(alloc_id, alloc); . None 928 ( 0.00%) } . . impl<'rt, 'mir, 'tcx, M: CompileTimeMachine<'mir, 'tcx, const_eval::MemoryKind>> . InternVisitor<'rt, 'mir, 'tcx, M> . { . fn intern_shallow( . &mut self, . alloc_id: AllocId, . mode: InternMode, . ty: Option>, . ) -> Option { 16 ( 0.00%) intern_shallow(self.ecx, self.leftover_allocations, alloc_id, mode, ty) . } . } . . impl<'rt, 'mir, 'tcx: 'mir, M: CompileTimeMachine<'mir, 'tcx, const_eval::MemoryKind>> . ValueVisitor<'mir, 'tcx, M> for InternVisitor<'rt, 'mir, 'tcx, M> . { . type V = MPlaceTy<'tcx>; . -- line 160 ---------------------------------------- -- line 164 ---------------------------------------- . } . . fn visit_aggregate( . &mut self, . mplace: &MPlaceTy<'tcx>, . fields: impl Iterator>, . ) -> InterpResult<'tcx> { . // ZSTs cannot contain pointers, so we can skip them. 19 ( 0.00%) if mplace.layout.is_zst() { . return Ok(()); . } . 128 ( 0.00%) if let Some(def) = mplace.layout.ty.ty_adt_def() { 276 ( 0.00%) if Some(def.did) == self.ecx.tcx.lang_items().unsafe_cell_type() { . // We are crossing over an `UnsafeCell`, we can mutate again. This means that . // References we encounter inside here are interned as pointing to mutable . // allocations. . // Remember the `old` value to handle nested `UnsafeCell`. . let old = std::mem::replace(&mut self.inside_unsafe_cell, true); 98 ( 0.00%) let walked = self.walk_aggregate(mplace, fields); . self.inside_unsafe_cell = old; . return walked; . } . } . 139 ( 0.00%) self.walk_aggregate(mplace, fields) . } . 9,438,624 ( 0.14%) fn visit_value(&mut self, mplace: &MPlaceTy<'tcx>) -> InterpResult<'tcx> { . // Handle Reference types, as these are the only relocations supported by const eval. . // Raw pointers (and boxes) are handled by the `leftover_relocations` logic. 1,048,736 ( 0.02%) let tcx = self.ecx.tcx; 1,048,736 ( 0.02%) let ty = mplace.layout.ty; 3,146,220 ( 0.05%) if let ty::Ref(_, referenced_ty, ref_mutability) = *ty.kind() { 40 ( 0.00%) let value = self.ecx.read_immediate(&(*mplace).into())?; 12 ( 0.00%) let mplace = self.ecx.ref_to_mplace(&value)?; 4 ( 0.00%) assert_eq!(mplace.layout.ty, referenced_ty); . // Handle trait object vtables. 8 ( 0.00%) if let ty::Dynamic(..) = 16 ( 0.00%) tcx.struct_tail_erasing_lifetimes(referenced_ty, self.ecx.param_env).kind() . { . let ptr = self.ecx.scalar_to_ptr(mplace.meta.unwrap_meta()); . if let Some(alloc_id) = ptr.provenance { . // Explicitly choose const mode here, since vtables are immutable, even . // if the reference of the fat pointer is mutable. . self.intern_shallow(alloc_id, InternMode::Const, None); . } else { . // Validation will error (with a better message) on an invalid vtable pointer. . // Let validation show the error message, but make sure it *does* error. . tcx.sess . .delay_span_bug(tcx.span, "vtables pointers cannot be integer pointers"); . } . } . // Check if we have encountered this pointer+layout combination before. . // Only recurse for allocation-backed pointers. 12 ( 0.00%) if let Some(alloc_id) = mplace.ptr.provenance { . // Compute the mode with which we intern this. Our goal here is to make as many . // statics as we can immutable so they can be placed in read-only memory by LLVM. 16 ( 0.00%) let ref_mode = match self.mode { . InternMode::Static(mutbl) => { . // In statics, merge outer mutability with reference mutability and . // take into account whether we are in an `UnsafeCell`. . . // The only way a mutable reference actually works as a mutable reference is . // by being in a `static mut` directly or behind another mutable reference. . // If there's an immutable reference or we are inside a `static`, then our . // mutable reference is equivalent to an immutable one. As an example: -- line 230 ---------------------------------------- -- line 254 ---------------------------------------- . } . InternMode::Const => { . // Ignore `UnsafeCell`, everything is immutable. Validity does some sanity . // checking for mutable references that we encounter -- they must all be . // ZST. . InternMode::Const . } . }; 12 ( 0.00%) match self.intern_shallow(alloc_id, ref_mode, Some(referenced_ty)) { . // No need to recurse, these are interned already and statics may have . // cycles, so we don't want to recurse there . Some(IsStaticOrFn) => {} . // intern everything referenced by this value. The mutability is taken from the . // reference. It is checked above that mutable references only happen in . // `static mut` 9 ( 0.00%) None => self.ref_tracking.track((mplace, ref_mode), || ()), . } . } . Ok(()) . } else { . // Not a reference -- proceed recursively. . self.walk_value(mplace) . } 9,438,624 ( 0.14%) } . } . . #[derive(Copy, Clone, Debug, PartialEq, Hash, Eq)] . pub enum InternKind { . /// The `mutability` of the static, ignoring the type which may have interior mutability. . Static(hir::Mutability), . Constant, . Promoted, -- line 285 ---------------------------------------- -- line 286 ---------------------------------------- . } . . /// Intern `ret` and everything it references. . /// . /// This *cannot raise an interpreter error*. Doing so is left to validation, which . /// tracks where in the value we are and thus can show much better error messages. . /// Any errors here would anyway be turned into `const_err` lints, whereas validation failures . /// are hard errors. 896 ( 0.00%) #[tracing::instrument(level = "debug", skip(ecx))] 896 ( 0.00%) pub fn intern_const_alloc_recursive< . 'mir, . 'tcx: 'mir, . M: CompileTimeMachine<'mir, 'tcx, const_eval::MemoryKind>, . >( . ecx: &mut InterpCx<'mir, 'tcx, M>, . intern_kind: InternKind, . ret: &MPlaceTy<'tcx>, . ) -> Result<(), ErrorReported> { 224 ( 0.00%) let tcx = ecx.tcx; 784 ( 0.00%) let base_intern_mode = match intern_kind { . InternKind::Static(mutbl) => InternMode::Static(mutbl), . // `Constant` includes array lengths. . InternKind::Constant | InternKind::Promoted => InternMode::Const, . }; . . // Type based interning. . // `ref_tracking` tracks typed references we have already interned and still need to crawl for . // more typed information inside them. . // `leftover_allocations` collects *all* allocations we see, because some might not . // be available in a typed way. They get interned at the end. . let mut ref_tracking = RefTracking::empty(); . let leftover_allocations = &mut FxHashSet::default(); . . // start with the outermost allocation 448 ( 0.00%) intern_shallow( . ecx, . leftover_allocations, . // The outermost allocation must exist, because we allocated it with . // `Memory::allocate`. 112 ( 0.00%) ret.ptr.provenance.unwrap(), . base_intern_mode, 112 ( 0.00%) Some(ret.layout.ty), . ); . . ref_tracking.track((*ret, base_intern_mode), || ()); . 1,130 ( 0.00%) while let Some(((mplace, mode), _)) = ref_tracking.todo.pop() { 1,130 ( 0.00%) let res = InternVisitor { . ref_tracking: &mut ref_tracking, . ecx, . mode, . leftover_allocations, . inside_unsafe_cell: false, . } . .visit_value(&mplace); . // We deliberately *ignore* interpreter errors here. When there is a problem, the remaining . // references are "leftover"-interned, and later validation will show a proper error . // and point at the right part of the value causing the problem. 226 ( 0.00%) match res { . Ok(()) => {} . Err(error) => { . ecx.tcx.sess.delay_span_bug( . ecx.tcx.span, . &format!( . "error during interning should later cause validation failure: {}", . error . ), -- line 352 ---------------------------------------- -- line 354 ---------------------------------------- . } . } . } . . // Intern the rest of the allocations as mutable. These might be inside unions, padding, raw . // pointers, ... So we can't intern them according to their type rules . . let mut todo: Vec<_> = leftover_allocations.iter().cloned().collect(); 21 ( 0.00%) while let Some(alloc_id) = todo.pop() { . if let Some((_, mut alloc)) = ecx.memory.alloc_map.remove(&alloc_id) { . // We can't call the `intern_shallow` method here, as its logic is tailored to safe . // references and a `leftover_allocations` set (where we only have a todo-list here). . // So we hand-roll the interning logic here again. . match intern_kind { . // Statics may contain mutable allocations even behind relocations. . // Even for immutable statics it would be ok to have mutable allocations behind . // raw pointers, e.g. for `static FOO: *const AtomicUsize = &AtomicUsize::new(42)`. -- line 370 ---------------------------------------- -- line 396 ---------------------------------------- . } . let alloc = tcx.intern_const_alloc(alloc); . tcx.set_alloc_id_memory(alloc_id, alloc); . for &(_, alloc_id) in alloc.relocations().iter() { . if leftover_allocations.insert(alloc_id) { . todo.push(alloc_id); . } . } 14 ( 0.00%) } else if ecx.memory.dead_alloc_map.contains_key(&alloc_id) { . // Codegen does not like dangling pointers, and generally `tcx` assumes that . // all allocations referenced anywhere actually exist. So, make sure we error here. . ecx.tcx.sess.span_err(ecx.tcx.span, "encountered dangling pointer in final constant"); . return Err(ErrorReported); 28 ( 0.00%) } else if ecx.tcx.get_global_alloc(alloc_id).is_none() { . // We have hit an `AllocId` that is neither in local or global memory and isn't . // marked as dangling by local memory. That should be impossible. . span_bug!(ecx.tcx.span, "encountered unknown alloc id {:?}", alloc_id); . } . } . Ok(()) . } . -- line 417 ---------------------------------------- 706 ( 0.00%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/graph/scc/mod.rs -------------------------------------------------------------------------------- Ir -- line 35 ---------------------------------------- . . /// Contains the successors for all the Sccs, concatenated. The . /// range of indices corresponding to a given SCC is found in its . /// SccData. . all_successors: Vec, . } . . impl Sccs { 11,504 ( 0.00%) pub fn new(graph: &(impl DirectedGraph + WithNumNodes + WithSuccessors)) -> Self { . SccsConstruction::construct(graph) 11,574 ( 0.00%) } . . /// Returns the number of SCCs in the graph. . pub fn num_sccs(&self) -> usize { . self.scc_data.len() . } . . /// Returns an iterator over the SCCs in the graph. . /// -- line 53 ---------------------------------------- -- line 56 ---------------------------------------- . /// This is convenient when the edges represent dependencies: when you visit . /// `S1`, the value for `S2` will already have been computed. . pub fn all_sccs(&self) -> impl Iterator { . (0..self.scc_data.len()).map(S::new) . } . . /// Returns the SCC to which a node `r` belongs. . pub fn scc(&self, r: N) -> S { 185,875 ( 0.00%) self.scc_indices[r] . } . . /// Returns the successors of the given SCC. . pub fn successors(&self, scc: S) -> &[S] { . self.scc_data.successors(scc) . } . . /// Construct the reverse graph of the SCC graph. . pub fn reverse(&self) -> VecGraph { 8 ( 0.00%) VecGraph::new( . self.num_sccs(), . self.all_sccs() . .flat_map(|source| { . self.successors(source).iter().map(move |&target| (target, source)) . }) . .collect(), . ) . } -- line 82 ---------------------------------------- -- line 116 ---------------------------------------- . self.ranges.len() . } . . /// Returns the successors of the given SCC. . fn successors(&self, scc: S) -> &[S] { . // Annoyingly, `range` does not implement `Copy`, so we have . // to do `range.start..range.end`: . let range = &self.ranges[scc]; 525,424 ( 0.01%) &self.all_successors[range.start..range.end] . } . . /// Creates a new SCC with `successors` as its successors and . /// returns the resulting index. . fn create_scc(&mut self, successors: impl IntoIterator) -> S { . // Store the successors on `scc_successors_vec`, remembering . // the range of indices. 65,733 ( 0.00%) let all_successors_start = self.all_successors.len(); . self.all_successors.extend(successors); . let all_successors_end = self.all_successors.len(); . . debug!( . "create_scc({:?}) successors={:?}", . self.ranges.len(), . &self.all_successors[all_successors_start..all_successors_end], . ); -- line 140 ---------------------------------------- -- line 164 ---------------------------------------- . /// into the successors_stack, we sometimes get duplicate entries. . /// We use this set to remove those -- we also keep its storage . /// around between successors to amortize memory allocation costs. . duplicate_set: FxHashSet, . . scc_data: SccData, . } . 6,430 ( 0.00%) #[derive(Copy, Clone, Debug)] . enum NodeState { . /// This node has not yet been visited as part of the DFS. . /// . /// After SCC construction is complete, this state ought to be . /// impossible. . NotVisited, . . /// This node is currently being walk as part of our DFS. It is on -- line 180 ---------------------------------------- -- line 216 ---------------------------------------- . /// N with depth D can reach some other node N' with lower depth . /// D' (i.e., D' < D), we know that N, N', and all nodes in . /// between them on the stack are part of an SCC. . /// . /// [wikipedia]: https://bit.ly/2EZIx84 . fn construct(graph: &'c G) -> Sccs { . let num_nodes = graph.num_nodes(); . 14,146 ( 0.00%) let mut this = Self { . graph, . node_states: IndexVec::from_elem_n(NodeState::NotVisited, num_nodes), . node_stack: Vec::with_capacity(num_nodes), . successors_stack: Vec::new(), . scc_data: SccData { ranges: IndexVec::new(), all_successors: Vec::new() }, . duplicate_set: FxHashSet::default(), . }; . . let scc_indices = (0..num_nodes) . .map(G::Node::new) 539,904 ( 0.01%) .map(|node| match this.start_walk_from(node) { . WalkReturn::Complete { scc_index } => scc_index, . WalkReturn::Cycle { min_depth } => panic!( . "`start_walk_node({:?})` returned cycle with depth {:?}", . node, min_depth . ), . }) . .collect(); . 7,716 ( 0.00%) Sccs { scc_indices, scc_data: this.scc_data } . } . 809,856 ( 0.01%) fn start_walk_from(&mut self, node: G::Node) -> WalkReturn { 359,936 ( 0.01%) if let Some(result) = self.inspect_node(node) { . result . } else { . self.walk_unvisited_node(node) . } 899,840 ( 0.01%) } . . /// Inspect a node during the DFS. We first examine its current . /// state -- if it is not yet visited (`NotVisited`), return `None` so . /// that the caller might push it onto the stack and start walking its . /// successors. . /// . /// If it is already on the DFS stack it will be in the state . /// `BeingVisited`. In that case, we have found a cycle and we . /// return the depth from the stack. . /// . /// Otherwise, we are looking at a node that has already been . /// completely visited. We therefore return `WalkReturn::Complete` . /// with its associated SCC index. 1,096,068 ( 0.02%) fn inspect_node(&mut self, node: G::Node) -> Option> { 2,192,136 ( 0.03%) Some(match self.find_state(node) { 472,722 ( 0.01%) NodeState::InCycle { scc_index } => WalkReturn::Complete { scc_index }, . 79,377 ( 0.00%) NodeState::BeingVisited { depth: min_depth } => WalkReturn::Cycle { min_depth }, . . NodeState::NotVisited => return None, . . NodeState::InCycleWith { parent } => panic!( . "`find_state` returned `InCycleWith({:?})`, which ought to be impossible", . parent . ), . }) 1,918,119 ( 0.03%) } . . /// Fetches the state of the node `r`. If `r` is recorded as being . /// in a cycle with some other node `r2`, then fetches the state . /// of `r2` (and updates `r` to reflect current result). This is . /// basically the "find" part of a standard union-find algorithm . /// (with path compression). . fn find_state(&mut self, mut node: G::Node) -> NodeState { . // To avoid recursion we temporarily reuse the `parent` of each -- line 288 ---------------------------------------- -- line 299 ---------------------------------------- . // following links downwards is then simply as soon as we have . // found the initial self-loop. . let mut previous_node = node; . . // Ultimately assigned by the parent when following . // `InCycleWith` upwards. . let node_state = loop { . debug!("find_state(r = {:?} in state {:?})", node, self.node_states[node]); 2,164,624 ( 0.03%) match self.node_states[node] { 630,296 ( 0.01%) NodeState::InCycle { scc_index } => break NodeState::InCycle { scc_index }, 105,836 ( 0.00%) NodeState::BeingVisited { depth } => break NodeState::BeingVisited { depth }, 89,984 ( 0.00%) NodeState::NotVisited => break NodeState::NotVisited, 38,114 ( 0.00%) NodeState::InCycleWith { parent } => { . // We test this, to be extremely sure that we never . // ever break our termination condition for the . // reverse iteration loop. 38,114 ( 0.00%) assert!(node != parent, "Node can not be in cycle with itself"); . // Store the previous node as an inverted list link 190,570 ( 0.00%) self.node_states[node] = NodeState::InCycleWith { parent: previous_node }; . // Update to parent node. . previous_node = node; . node = parent; . } . } . }; . . // The states form a graph where up to one outgoing link is stored at -- line 325 ---------------------------------------- -- line 355 ---------------------------------------- . // We can then walk backwards, starting from `previous_node`, and assign . // each node in the list with the updated state. The loop terminates . // when we reach the self-cycle. . . // Move backwards until we found the node where we started. We . // will know when we hit the state where previous_node == node. . loop { . // Back at the beginning, we can return. 421,014 ( 0.01%) if previous_node == node { . return node_state; . } . // Update to previous node in the link. 76,228 ( 0.00%) match self.node_states[previous_node] { 38,114 ( 0.00%) NodeState::InCycleWith { parent: previous } => { . node = previous_node; . previous_node = previous; . } . // Only InCycleWith nodes were added to the reverse linked list. . other => panic!("Invalid previous link while compressing cycle: {:?}", other), . } . . debug!("find_state: parent_state = {:?}", node_state); . . // Update the node state from the parent state. The assigned . // state is actually a loop invariant but it will only be . // evaluated if there is at least one backlink to follow. . // Fully trusting llvm here to find this loop optimization. 152,456 ( 0.00%) match node_state { . // Path compression, make current node point to the same root. . NodeState::InCycle { .. } => { 48,502 ( 0.00%) self.node_states[node] = node_state; . } . // Still visiting nodes, compress to cycle to the node . // at that depth. 13,863 ( 0.00%) NodeState::BeingVisited { depth } => { 27,726 ( 0.00%) self.node_states[node] = 13,863 ( 0.00%) NodeState::InCycleWith { parent: self.node_stack[depth] }; . } . // These are never allowed as parent nodes. InCycleWith . // should have been followed to a real parent and . // NotVisited can not be part of a cycle since it should . // have instead gotten explored. . NodeState::NotVisited | NodeState::InCycleWith { .. } => { . panic!("invalid parent state: {:?}", node_state) . } . } . } 548,034 ( 0.01%) } . . /// Walks a node that has never been visited before. . /// . /// Call this method when `inspect_node` has returned `None`. Having the . /// caller decide avoids mutual recursion between the two methods and allows . /// us to maintain an allocated stack for nodes on the path between calls. . #[instrument(skip(self, initial), level = "debug")] . fn walk_unvisited_node(&mut self, initial: G::Node) -> WalkReturn { -- line 410 ---------------------------------------- -- line 418 ---------------------------------------- . successor_node: G::Node, . } . . // Move the stack to a local variable. We want to utilize the existing allocation and . // mutably borrow it without borrowing self at the same time. . let mut successors_stack = core::mem::take(&mut self.successors_stack); . debug_assert_eq!(successors_stack.len(), 0); . 9,401 ( 0.00%) let mut stack: Vec> = vec![VisitingNodeFrame { . node: initial, . depth: 0, . min_depth: 0, . iter: None, . successors_len: 0, . min_cycle_root: initial, . successor_node: initial, . }]; . . let mut return_value = None; . 89,984 ( 0.00%) 'recurse: while let Some(frame) = stack.last_mut() { . let VisitingNodeFrame { 356,886 ( 0.01%) node, . depth, . iter, 357,250 ( 0.01%) successors_len, . min_depth, . min_cycle_root, . successor_node, . } = frame; . 178,625 ( 0.00%) let node = *node; 357,614 ( 0.01%) let depth = *depth; . 535,875 ( 0.01%) let successors = match iter { . Some(iter) => iter, . None => { . // This None marks that we still have the initialize this node's frame. . debug!(?depth, ?node); . . debug_assert!(matches!(self.node_states[node], NodeState::NotVisited)); . . // Push `node` onto the stack. 359,936 ( 0.01%) self.node_states[node] = NodeState::BeingVisited { depth }; . self.node_stack.push(node); . . // Walk each successor of the node, looking to see if any of . // them can reach a node that is presently on the stack. If . // so, that means they can also reach us. 179,968 ( 0.00%) *successors_len = successors_stack.len(); . // Set and return a reference, this is currently empty. 359,708 ( 0.01%) iter.get_or_insert(self.graph.successors(node)) . } . }; . . // Now that iter is initialized, this is a constant for this frame. 357,250 ( 0.01%) let successors_len = *successors_len; . . // Construct iterators for the nodes and walk results. There are two cases: . // * The walk of a successor node returned. . // * The remaining successor nodes. . let returned_walk = . return_value.take().into_iter().map(|walk| (*successor_node, Some(walk))); . . let successor_walk = successors.by_ref().map(|successor_node| { . debug!(?node, ?successor_node); 552,099 ( 0.01%) (successor_node, self.inspect_node(successor_node)) . }); . 725,680 ( 0.01%) for (successor_node, walk) in returned_walk.chain(successor_walk) { 989,276 ( 0.01%) match walk { . Some(WalkReturn::Cycle { min_depth: successor_min_depth }) => { . // Track the minimum depth we can reach. 101,420 ( 0.00%) assert!(successor_min_depth <= depth); 126,726 ( 0.00%) if successor_min_depth < *min_depth { . debug!(?node, ?successor_min_depth); 75,782 ( 0.00%) *min_depth = successor_min_depth; 25,306 ( 0.00%) *min_cycle_root = successor_node; . } . } . . Some(WalkReturn::Complete { scc_index: successor_scc_index }) => { . // Push the completed SCC indices onto . // the `successors_stack` for later. . debug!(?node, ?successor_scc_index); . successors_stack.push(successor_scc_index); . } . . None => { 177,282 ( 0.00%) let depth = depth + 1; . debug!(?depth, ?successor_node); . // Remember which node the return value will come from. 88,641 ( 0.00%) frame.successor_node = successor_node; . // Start a new stack frame the step into it. . stack.push(VisitingNodeFrame { . node: successor_node, . depth, . iter: None, . successors_len: 0, . min_depth: depth, . min_cycle_root: successor_node, -- line 518 ---------------------------------------- -- line 531 ---------------------------------------- . let frame = stack.pop().unwrap(); . . // If `min_depth == depth`, then we are the root of the . // cycle: we can't reach anyone further down the stack. . . // Pass the 'return value' down the stack. . // We return one frame at a time so there can't be another return value. . debug_assert!(return_value.is_none()); 179,968 ( 0.00%) return_value = Some(if frame.min_depth == depth { . // Note that successor stack may have duplicates, so we . // want to remove those: . let deduplicated_successors = { . let duplicate_set = &mut self.duplicate_set; . duplicate_set.clear(); . successors_stack . .drain(successors_len..) 133,323 ( 0.00%) .filter(move |&i| duplicate_set.insert(i)) . }; . let scc_index = self.scc_data.create_scc(deduplicated_successors); 394,398 ( 0.01%) self.node_states[node] = NodeState::InCycle { scc_index }; . WalkReturn::Complete { scc_index } . } else { . // We are not the head of the cycle. Return back to our . // caller. They will take ownership of the . // `self.successors` data that we pushed. 145,506 ( 0.00%) self.node_states[node] = NodeState::InCycleWith { parent: frame.min_cycle_root }; . WalkReturn::Cycle { min_depth: frame.min_depth } . }); . } . . // Keep the allocation we used for successors_stack. 12,087 ( 0.00%) self.successors_stack = successors_stack; . debug_assert_eq!(self.successors_stack.len(), 0); . . return_value.unwrap() . } . } 3,943,734 ( 0.06%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/mod.rs -------------------------------------------------------------------------------- Ir -- line 108 ---------------------------------------- . suppress_errors: bool, . }, . } . . impl RegionckMode { . /// Indicates that the MIR borrowck will repeat these region . /// checks, so we should ignore errors if NLL is (unconditionally) . /// enabled. 1,139 ( 0.00%) pub fn for_item_body(tcx: TyCtxt<'_>) -> Self { . // FIXME(Centril): Once we actually remove `::Migrate` also make . // this always `true` and then proceed to eliminate the dead code. 1,139 ( 0.00%) match tcx.borrowck_mode() { . // If we're on Migrate mode, report AST region errors . BorrowckMode::Migrate => RegionckMode::Erase { suppress_errors: false }, . . // If we're on MIR, don't report AST region errors as they should be reported by NLL . BorrowckMode::Mir => RegionckMode::Erase { suppress_errors: true }, . } 2,278 ( 0.00%) } . } . . /// This type contains all the things within `InferCtxt` that sit within a . /// `RefCell` and are involved with taking/rolling back snapshots. Snapshot . /// operations are hot enough that we want only one call to `borrow_mut` per . /// call to `start_snapshot` and `rollback_to`. . pub struct InferCtxtInner<'tcx> { . /// Cache for projections. This cache is snapshotted along with the infcx. -- line 134 ---------------------------------------- -- line 202 ---------------------------------------- . /// type instantiations (`ty::Infer`) to the actual opaque . /// type (`ty::Opaque`). Used during fallback to map unconstrained . /// opaque type inference variables to their corresponding . /// opaque type. . pub opaque_types_vars: FxHashMap, Ty<'tcx>>, . } . . impl<'tcx> InferCtxtInner<'tcx> { 197,235 ( 0.00%) fn new() -> InferCtxtInner<'tcx> { 1,341,198 ( 0.02%) InferCtxtInner { . projection_cache: Default::default(), . type_variable_storage: type_variable::TypeVariableStorage::new(), . undo_log: InferCtxtUndoLogs::default(), . const_unification_storage: ut::UnificationTableStorage::new(), . int_unification_storage: ut::UnificationTableStorage::new(), . float_unification_storage: ut::UnificationTableStorage::new(), 118,341 ( 0.00%) region_constraint_storage: Some(RegionConstraintStorage::new()), . region_obligations: vec![], . opaque_types: Default::default(), . opaque_types_vars: Default::default(), . } 236,682 ( 0.00%) } . . #[inline] . pub fn region_obligations(&self) -> &[(hir::HirId, RegionObligation<'tcx>)] { . &self.region_obligations . } . . #[inline] . pub fn projection_cache(&mut self) -> traits::ProjectionCache<'_, 'tcx> { 19,329 ( 0.00%) self.projection_cache.with_log(&mut self.undo_log) . } . . #[inline] . fn type_variables(&mut self) -> type_variable::TypeVariableTable<'_, 'tcx> { 1,725,934 ( 0.03%) self.type_variable_storage.with_log(&mut self.undo_log) . } . . #[inline] . fn int_unification_table( . &mut self, . ) -> ut::UnificationTable< . ut::InPlace< . ty::IntVid, . &mut ut::UnificationStorage, . &mut InferCtxtUndoLogs<'tcx>, . >, . > { 29,918 ( 0.00%) self.int_unification_storage.with_log(&mut self.undo_log) . } . . #[inline] . fn float_unification_table( . &mut self, . ) -> ut::UnificationTable< . ut::InPlace< . ty::FloatVid, . &mut ut::UnificationStorage, . &mut InferCtxtUndoLogs<'tcx>, . >, . > { 117 ( 0.00%) self.float_unification_storage.with_log(&mut self.undo_log) . } . . #[inline] . fn const_unification_table( . &mut self, . ) -> ut::UnificationTable< . ut::InPlace< . ty::ConstVid<'tcx>, . &mut ut::UnificationStorage>, . &mut InferCtxtUndoLogs<'tcx>, . >, . > { 17,930 ( 0.00%) self.const_unification_storage.with_log(&mut self.undo_log) . } . . #[inline] . pub fn unwrap_region_constraints(&mut self) -> RegionConstraintCollector<'_, 'tcx> { 319,104 ( 0.00%) self.region_constraint_storage . .as_mut() . .expect("region constraints already solved") 389,923 ( 0.01%) .with_log(&mut self.undo_log) . } . } . . pub struct InferCtxt<'a, 'tcx> { . pub tcx: TyCtxt<'tcx>, . . /// The `DefId` of the item in whose context we are performing inference or typeck. . /// It is used to check whether an opaque type use is a defining use. -- line 292 ---------------------------------------- -- line 361 ---------------------------------------- . /// item we are type-checking, and just consider those names as . /// part of the root universe. So this would only get incremented . /// when we enter into a higher-ranked (`for<..>`) type or trait . /// bound. . universe: Cell, . } . . /// See the `error_reporting` module for more details. 546,264 ( 0.01%) #[derive(Clone, Copy, Debug, PartialEq, Eq, TypeFoldable)] . pub enum ValuePairs<'tcx> { . Types(ExpectedFound>), . Regions(ExpectedFound>), . Consts(ExpectedFound<&'tcx ty::Const<'tcx>>), . TraitRefs(ExpectedFound>), . PolyTraitRefs(ExpectedFound>), . } . -- line 377 ---------------------------------------- -- line 383 ---------------------------------------- . pub struct TypeTrace<'tcx> { . cause: ObligationCause<'tcx>, . values: ValuePairs<'tcx>, . } . . /// The origin of a `r1 <= r2` constraint. . /// . /// See `error_reporting` module for more details 518,611 ( 0.01%) #[derive(Clone, Debug)] . pub enum SubregionOrigin<'tcx> { . /// Arose from a subtyping relation 28,909 ( 0.00%) Subtype(Box>), . . /// When casting `&'a T` to an `&'b Trait` object, . /// relating `'a` to `'b` . RelateObjectBound(Span), . . /// Some type parameter was instantiated with the given type, . /// and that type must outlive some region. 4,835 ( 0.00%) RelateParamBound(Span, Ty<'tcx>, Option), . . /// The given region parameter was instantiated with a region . /// that must outlive some other region. . RelateRegionParamBound(Span), . . /// Creating a pointer `b` to contents of another reference . Reborrow(Span), . . /// Creating a pointer `b` to contents of an upvar . ReborrowUpvar(Span, ty::UpvarId), . . /// Data with type `Ty<'tcx>` was borrowed 5,237 ( 0.00%) DataBorrowed(Ty<'tcx>, Span), . . /// (&'a &'b T) where a >= b 3,763 ( 0.00%) ReferenceOutlivesReferent(Ty<'tcx>, Span), . . /// Comparing the signature and requirements of an impl method against . /// the containing trait. . CompareImplMethodObligation { span: Span, impl_item_def_id: DefId, trait_item_def_id: DefId }, . . /// Comparing the signature and requirements of an impl associated type . /// against the containing trait . CompareImplTypeObligation { span: Span, impl_item_def_id: DefId, trait_item_def_id: DefId }, -- line 426 ---------------------------------------- -- line 554 ---------------------------------------- . defining_use_anchor: Option, . } . . pub trait TyCtxtInferExt<'tcx> { . fn infer_ctxt(self) -> InferCtxtBuilder<'tcx>; . } . . impl<'tcx> TyCtxtInferExt<'tcx> for TyCtxt<'tcx> { 39,447 ( 0.00%) fn infer_ctxt(self) -> InferCtxtBuilder<'tcx> { 118,341 ( 0.00%) InferCtxtBuilder { tcx: self, defining_use_anchor: None, fresh_typeck_results: None } 39,447 ( 0.00%) } . } . . impl<'tcx> InferCtxtBuilder<'tcx> { . /// Used only by `rustc_typeck` during body type-checking/inference, . /// will initialize `in_progress_typeck_results` with fresh `TypeckResults`. . /// Will also change the scope for opaque type defining use checks to the given owner. 25,182 ( 0.00%) pub fn with_fresh_in_progress_typeck_results(mut self, table_owner: LocalDefId) -> Self { 30,778 ( 0.00%) self.fresh_typeck_results = Some(RefCell::new(ty::TypeckResults::new(table_owner))); 13,990 ( 0.00%) self.with_opaque_type_inference(table_owner) 19,586 ( 0.00%) } . . /// Whenever the `InferCtxt` should be able to handle defining uses of opaque types, . /// you need to call this function. Otherwise the opaque type will be treated opaquely. . /// . /// It is only meant to be called in two places, for typeck . /// (via `with_fresh_in_progress_typeck_results`) and for the inference context used . /// in mir borrowck. 2,512 ( 0.00%) pub fn with_opaque_type_inference(mut self, defining_use_anchor: LocalDefId) -> Self { 1,256 ( 0.00%) self.defining_use_anchor = Some(defining_use_anchor); 8,108 ( 0.00%) self 3,768 ( 0.00%) } . . /// Given a canonical value `C` as a starting point, create an . /// inference context that contains each of the bound values . /// within instantiated as a fresh variable. The `f` closure is . /// invoked with the new infcx, along with the instantiated value . /// `V` and a substitution `S`. This substitution `S` maps from . /// the bound values in `C` to their instantiated values in `V` . /// (in other words, `S(C) = V`). 90,634 ( 0.00%) pub fn enter_with_canonical( . &mut self, . span: Span, . canonical: &Canonical<'tcx, T>, . f: impl for<'a> FnOnce(InferCtxt<'a, 'tcx>, T, CanonicalVarValues<'tcx>) -> R, . ) -> R . where . T: TypeFoldable<'tcx>, . { . self.enter(|infcx| { 124,274 ( 0.00%) let (value, subst) = 7,114 ( 0.00%) infcx.instantiate_canonical_with_fresh_inference_vars(span, canonical); 185,764 ( 0.00%) f(infcx, value, subst) . }) 97,579 ( 0.00%) } . 172,216 ( 0.00%) pub fn enter(&mut self, f: impl for<'a> FnOnce(InferCtxt<'a, 'tcx>) -> R) -> R { 111,209 ( 0.00%) let InferCtxtBuilder { tcx, defining_use_anchor, ref fresh_typeck_results } = *self; . let in_progress_typeck_results = fresh_typeck_results.as_ref(); 1,648,045 ( 0.02%) f(InferCtxt { . tcx, . defining_use_anchor, . in_progress_typeck_results, 39,447 ( 0.00%) inner: RefCell::new(InferCtxtInner::new()), . lexical_region_resolutions: RefCell::new(None), . selection_cache: Default::default(), . evaluation_cache: Default::default(), . reported_trait_errors: Default::default(), . reported_closure_mismatch: Default::default(), . tainted_by_errors_flag: Cell::new(false), 39,447 ( 0.00%) err_count_on_creation: tcx.sess.err_count(), . in_snapshot: Cell::new(false), . skip_leak_check: Cell::new(false), . universe: Cell::new(ty::UniverseIndex::ROOT), . }) 187,336 ( 0.00%) } . } . . impl<'tcx, T> InferOk<'tcx, T> { . pub fn unit(self) -> InferOk<'tcx, ()> { . InferOk { value: (), obligations: self.obligations } . } . . /// Extracts `value`, registering any obligations into `fulfill_cx`. . pub fn into_value_registering_obligations( . self, . infcx: &InferCtxt<'_, 'tcx>, . fulfill_cx: &mut dyn TraitEngine<'tcx>, . ) -> T { 2,242 ( 0.00%) let InferOk { value, obligations } = self; 9,188 ( 0.00%) for obligation in obligations { 767 ( 0.00%) fulfill_cx.register_predicate_obligation(infcx, obligation); . } . value . } . } . . impl<'tcx> InferOk<'tcx, ()> { 40,555 ( 0.00%) pub fn into_obligations(self) -> PredicateObligations<'tcx> { 162,220 ( 0.00%) self.obligations 40,555 ( 0.00%) } . } . . #[must_use = "once you start a snapshot, you should always consume it"] . pub struct CombinedSnapshot<'a, 'tcx> { . undo_snapshot: Snapshot<'tcx>, . region_constraints_snapshot: RegionSnapshot, . universe: ty::UniverseIndex, . was_in_snapshot: bool, -- line 662 ---------------------------------------- -- line 674 ---------------------------------------- . let canonical = self.canonicalize_query((a, b), &mut OriginalQueryValues::default()); . debug!("canonical consts: {:?}", &canonical.value); . . self.tcx.try_unify_abstract_consts(canonical.value) . } . . pub fn is_in_snapshot(&self) -> bool { . self.in_snapshot.get() 92,942 ( 0.00%) } . 572,544 ( 0.01%) pub fn freshen>(&self, t: T) -> T { 644,112 ( 0.01%) t.fold_with(&mut self.freshener()) 644,112 ( 0.01%) } . . /// Returns the origin of the type variable identified by `vid`, or `None` . /// if this is not a type variable. . /// . /// No attempt is made to resolve `ty`. 1,466 ( 0.00%) pub fn type_var_origin(&'a self, ty: Ty<'tcx>) -> Option { 2,932 ( 0.00%) match *ty.kind() { 698 ( 0.00%) ty::Infer(ty::TyVar(vid)) => { 2,792 ( 0.00%) Some(*self.inner.borrow_mut().type_variables().var_origin(vid)) . } 35 ( 0.00%) _ => None, . } 2,932 ( 0.00%) } . 71,568 ( 0.00%) pub fn freshener<'b>(&'b self) -> TypeFreshener<'b, 'tcx> { . freshen::TypeFreshener::new(self, false) 71,568 ( 0.00%) } . . /// Like `freshener`, but does not replace `'static` regions. 281,191 ( 0.00%) pub fn freshener_keep_static<'b>(&'b self) -> TypeFreshener<'b, 'tcx> { . freshen::TypeFreshener::new(self, true) 281,191 ( 0.00%) } . 5,556 ( 0.00%) pub fn unsolved_variables(&self) -> Vec> { 2,778 ( 0.00%) let mut inner = self.inner.borrow_mut(); 2,778 ( 0.00%) let mut vars: Vec> = inner . .type_variables() . .unsolved_variables() . .into_iter() 1,374 ( 0.00%) .map(|t| self.tcx.mk_ty_var(t)) . .collect(); . vars.extend( . (0..inner.int_unification_table().len()) . .map(|i| ty::IntVid { index: i as u32 }) 1,516 ( 0.00%) .filter(|&vid| inner.int_unification_table().probe_value(vid).is_none()) 35 ( 0.00%) .map(|v| self.tcx.mk_int_var(v)), . ); . vars.extend( . (0..inner.float_unification_table().len()) . .map(|i| ty::FloatVid { index: i as u32 }) 6 ( 0.00%) .filter(|&vid| inner.float_unification_table().probe_value(vid).is_none()) . .map(|v| self.tcx.mk_float_var(v)), . ); . vars 9,723 ( 0.00%) } . 149,062 ( 0.00%) fn combine_fields( . &'a self, . trace: TypeTrace<'tcx>, . param_env: ty::ParamEnv<'tcx>, . ) -> CombineFields<'a, 'tcx> { 602,676 ( 0.01%) CombineFields { . infcx: self, 1,506,690 ( 0.02%) trace, . cause: None, . param_env, . obligations: PredicateObligations::new(), . } 149,062 ( 0.00%) } . . /// Clear the "currently in a snapshot" flag, invoke the closure, . /// then restore the flag to its original value. This flag is a . /// debugging measure designed to detect cases where we start a . /// snapshot, create type variables, and register obligations . /// which may involve those type variables in the fulfillment cx, . /// potentially leaving "dangling type variables" behind. . /// In such cases, an assertion will fail when attempting to -- line 753 ---------------------------------------- -- line 755 ---------------------------------------- . /// better than grovelling through megabytes of `RUSTC_LOG` output. . /// . /// HOWEVER, in some cases the flag is unhelpful. In particular, we . /// sometimes create a "mini-fulfilment-cx" in which we enroll . /// obligations. As long as this fulfillment cx is fully drained . /// before we return, this is not a problem, as there won't be any . /// escaping obligations in the main cx. In those cases, you can . /// use this function. 416 ( 0.00%) pub fn save_and_restore_in_snapshot_flag(&self, func: F) -> R . where . F: FnOnce(&Self) -> R, . { . let flag = self.in_snapshot.replace(false); 37,632 ( 0.00%) let result = func(self); . self.in_snapshot.set(flag); . result 468 ( 0.00%) } . 785,478 ( 0.01%) fn start_snapshot(&self) -> CombinedSnapshot<'a, 'tcx> { . debug!("start_snapshot()"); . . let in_snapshot = self.in_snapshot.replace(true); . . let mut inner = self.inner.borrow_mut(); . 2,356,434 ( 0.03%) CombinedSnapshot { . undo_snapshot: inner.undo_log.start_snapshot(), . region_constraints_snapshot: inner.unwrap_region_constraints().start_snapshot(), . universe: self.universe(), . was_in_snapshot: in_snapshot, . // Borrow typeck results "in progress" (i.e., during typeck) . // to ban writes from within a snapshot to them. 392,739 ( 0.01%) _in_progress_typeck_results: self . .in_progress_typeck_results . .map(|typeck_results| typeck_results.borrow()), . } 1,570,956 ( 0.02%) } . 1,515,844 ( 0.02%) #[instrument(skip(self, snapshot), level = "debug")] . fn rollback_to(&self, cause: &str, snapshot: CombinedSnapshot<'a, 'tcx>) { . let CombinedSnapshot { 137,804 ( 0.00%) undo_snapshot, 137,804 ( 0.00%) region_constraints_snapshot, 137,804 ( 0.00%) universe, 137,804 ( 0.00%) was_in_snapshot, 275,608 ( 0.00%) _in_progress_typeck_results, . } = snapshot; . . self.in_snapshot.set(was_in_snapshot); . self.universe.set(universe); . . let mut inner = self.inner.borrow_mut(); 137,804 ( 0.00%) inner.rollback_to(undo_snapshot); . inner.unwrap_region_constraints().rollback_to(region_constraints_snapshot); . } . 3,824,025 ( 0.06%) #[instrument(skip(self, snapshot), level = "debug")] . fn commit_from(&self, snapshot: CombinedSnapshot<'a, 'tcx>) { . let CombinedSnapshot { 254,935 ( 0.00%) undo_snapshot, . region_constraints_snapshot: _, . universe: _, 254,935 ( 0.00%) was_in_snapshot, 509,870 ( 0.01%) _in_progress_typeck_results, . } = snapshot; . . self.in_snapshot.set(was_in_snapshot); . . self.inner.borrow_mut().commit(undo_snapshot); . } . . /// Executes `f` and commit the bindings. 197,547 ( 0.00%) #[instrument(skip(self, f), level = "debug")] 244,035 ( 0.00%) pub fn commit_unconditionally(&self, f: F) -> R . where . F: FnOnce(&CombinedSnapshot<'a, 'tcx>) -> R, . { 22,185 ( 0.00%) let snapshot = self.start_snapshot(); 77,857 ( 0.00%) let r = f(&snapshot); 155,295 ( 0.00%) self.commit_from(snapshot); 130,540 ( 0.00%) r . } . . /// Execute `f` and commit the bindings if closure `f` returns `Ok(_)`. 1,651,953 ( 0.02%) #[instrument(skip(self, f), level = "debug")] 2,039,269 ( 0.03%) pub fn commit_if_ok(&self, f: F) -> Result . where . F: FnOnce(&CombinedSnapshot<'a, 'tcx>) -> Result, . { 313,783 ( 0.00%) let snapshot = self.start_snapshot(); 943,152 ( 0.01%) let r = f(&snapshot); . debug!("commit_if_ok() -- r.is_ok() = {}", r.is_ok()); 329,289 ( 0.00%) match r { . Ok(_) => { 1,656,162 ( 0.02%) self.commit_from(snapshot); . } . Err(_) => { 516,269 ( 0.01%) self.rollback_to("commit_if_ok -- error", snapshot); . } . } 1,784,518 ( 0.03%) r . } . . /// Execute `f` then unroll any bindings it creates. 582,160 ( 0.01%) #[instrument(skip(self, f), level = "debug")] 692,838 ( 0.01%) pub fn probe(&self, f: F) -> R . where . F: FnOnce(&CombinedSnapshot<'a, 'tcx>) -> R, . { 160,866 ( 0.00%) let snapshot = self.start_snapshot(); 286,388 ( 0.00%) let r = f(&snapshot); 763,473 ( 0.01%) self.rollback_to("probe", snapshot); 132,937 ( 0.00%) r . } . . /// If `should_skip` is true, then execute `f` then unroll any bindings it creates. 11,475 ( 0.00%) #[instrument(skip(self, f), level = "debug")] 15,300 ( 0.00%) pub fn probe_maybe_skip_leak_check(&self, should_skip: bool, f: F) -> R . where . F: FnOnce(&CombinedSnapshot<'a, 'tcx>) -> R, . { 2,550 ( 0.00%) let snapshot = self.start_snapshot(); 1,275 ( 0.00%) let was_skip_leak_check = self.skip_leak_check.get(); 2,550 ( 0.00%) if should_skip { . self.skip_leak_check.set(true); . } 5,100 ( 0.00%) let r = f(&snapshot); 11,475 ( 0.00%) self.rollback_to("probe", snapshot); . self.skip_leak_check.set(was_skip_leak_check); 15,300 ( 0.00%) r . } . . /// Scan the constraints produced since `snapshot` began and returns: . /// . /// - `None` -- if none of them involve "region outlives" constraints . /// - `Some(true)` -- if there are `'a: 'b` constraints where `'a` or `'b` is a placeholder . /// - `Some(false)` -- if there are `'a: 'b` constraints but none involve placeholders 36,344 ( 0.00%) pub fn region_constraints_added_in_snapshot( . &self, . snapshot: &CombinedSnapshot<'a, 'tcx>, . ) -> Option { 72,688 ( 0.00%) self.inner . .borrow_mut() . .unwrap_region_constraints() . .region_constraints_added_in_snapshot(&snapshot.undo_snapshot) 54,516 ( 0.00%) } . 22 ( 0.00%) pub fn add_given(&self, sub: ty::Region<'tcx>, sup: ty::RegionVid) { 44 ( 0.00%) self.inner.borrow_mut().unwrap_region_constraints().add_given(sub, sup); 33 ( 0.00%) } . 3,000 ( 0.00%) pub fn can_sub(&self, param_env: ty::ParamEnv<'tcx>, a: T, b: T) -> UnitResult<'tcx> . where . T: at::ToTrace<'tcx>, . { . let origin = &ObligationCause::dummy(); . self.probe(|_| { . self.at(origin, param_env).sub(a, b).map(|InferOk { obligations: _, .. }| { . // Ignore obligations, since we are unrolling . // everything anyway. . }) . }) 2,250 ( 0.00%) } . 15,024 ( 0.00%) pub fn can_eq(&self, param_env: ty::ParamEnv<'tcx>, a: T, b: T) -> UnitResult<'tcx> . where . T: at::ToTrace<'tcx>, . { . let origin = &ObligationCause::dummy(); . self.probe(|_| { . self.at(origin, param_env).eq(a, b).map(|InferOk { obligations: _, .. }| { . // Ignore obligations, since we are unrolling . // everything anyway. . }) . }) 11,268 ( 0.00%) } . 225,680 ( 0.00%) #[instrument(skip(self), level = "debug")] . pub fn sub_regions( . &self, . origin: SubregionOrigin<'tcx>, . a: ty::Region<'tcx>, . b: ty::Region<'tcx>, . ) { 203,112 ( 0.00%) self.inner.borrow_mut().unwrap_region_constraints().make_subregion(origin, a, b); . } . . /// Require that the region `r` be equal to one of the regions in . /// the set `regions`. 10 ( 0.00%) #[instrument(skip(self), level = "debug")] . pub fn member_constraint( . &self, . opaque_type_def_id: DefId, . definition_span: Span, . hidden_ty: Ty<'tcx>, . region: ty::Region<'tcx>, . in_regions: &Lrc>>, . ) { 10 ( 0.00%) self.inner.borrow_mut().unwrap_region_constraints().member_constraint( . opaque_type_def_id, . definition_span, . hidden_ty, . region, . in_regions, . ); . } . -- line 961 ---------------------------------------- -- line 969 ---------------------------------------- . /// to `subtype_predicate` -- that is, "coercing" `a` to `b` winds up . /// actually requiring `a <: b`. This is of course a valid coercion, . /// but it's not as flexible as `FnCtxt::coerce` would be. . /// . /// (We may refactor this in the future, but there are a number of . /// practical obstacles. Among other things, `FnCtxt::coerce` presently . /// records adjustments that are required on the HIR in order to perform . /// the coercion, and we don't currently have a way to manage that.) 597 ( 0.00%) pub fn coerce_predicate( . &self, . cause: &ObligationCause<'tcx>, . param_env: ty::ParamEnv<'tcx>, . predicate: ty::PolyCoercePredicate<'tcx>, . ) -> Option> { 398 ( 0.00%) let subtype_predicate = predicate.map_bound(|p| ty::SubtypePredicate { . a_is_expected: false, // when coercing from `a` to `b`, `b` is expected . a: p.a, . b: p.b, . }); 995 ( 0.00%) self.subtype_predicate(cause, param_env, subtype_predicate) 796 ( 0.00%) } . 18,828 ( 0.00%) pub fn subtype_predicate( . &self, . cause: &ObligationCause<'tcx>, . param_env: ty::ParamEnv<'tcx>, . predicate: ty::PolySubtypePredicate<'tcx>, . ) -> Option> { . // Check for two unresolved inference variables, in which case we can . // make no progress. This is partly a micro-optimization, but it's . // also an opportunity to "sub-unify" the variables. This isn't -- line 999 ---------------------------------------- -- line 1002 ---------------------------------------- . // earlier that they are sub-unified). . // . // Note that we can just skip the binders here because . // type variables can't (at present, at . // least) capture any of the things bound by this binder. . // . // Note that this sub here is not just for diagnostics - it has semantic . // effects as well. 1,569 ( 0.00%) let r_a = self.shallow_resolve(predicate.skip_binder().a); 1,569 ( 0.00%) let r_b = self.shallow_resolve(predicate.skip_binder().b); 11,126 ( 0.00%) match (r_a.kind(), r_b.kind()) { 2,474 ( 0.00%) (&ty::Infer(ty::TyVar(a_vid)), &ty::Infer(ty::TyVar(b_vid))) => { . self.inner.borrow_mut().type_variables().sub(a_vid, b_vid); 2,474 ( 0.00%) return None; . } . _ => {} . } . . Some(self.commit_if_ok(|_snapshot| { 332 ( 0.00%) let ty::SubtypePredicate { a_is_expected, a, b } = . self.replace_bound_vars_with_placeholders(predicate); . 664 ( 0.00%) let ok = self.at(cause, param_env).sub_exp(a_is_expected, a, b)?; . . Ok(ok.unit()) . })) 14,121 ( 0.00%) } . 55,524 ( 0.00%) pub fn region_outlives_predicate( . &self, . cause: &traits::ObligationCause<'tcx>, . predicate: ty::PolyRegionOutlivesPredicate<'tcx>, . ) -> UnitResult<'tcx> { . self.commit_if_ok(|_snapshot| { . let ty::OutlivesPredicate(r_a, r_b) = . self.replace_bound_vars_with_placeholders(predicate); . let origin = SubregionOrigin::from_obligation_cause(cause, || { . RelateRegionParamBound(cause.span) . }); 46,270 ( 0.00%) self.sub_regions(origin, r_b, r_a); // `b : a` ==> `a <= b` . Ok(()) . }) 37,016 ( 0.00%) } . . /// Number of type variables created so far. 250 ( 0.00%) pub fn num_ty_vars(&self) -> usize { . self.inner.borrow_mut().type_variables().num_vars() 500 ( 0.00%) } . 72,074 ( 0.00%) pub fn next_ty_var_id(&self, origin: TypeVariableOrigin) -> TyVid { 360,370 ( 0.01%) self.inner.borrow_mut().type_variables().new_var(self.universe(), origin) 108,111 ( 0.00%) } . 66,000 ( 0.00%) pub fn next_ty_var(&self, origin: TypeVariableOrigin) -> Ty<'tcx> { 249,222 ( 0.00%) self.tcx.mk_ty_var(self.next_ty_var_id(origin)) 99,000 ( 0.00%) } . 6,576 ( 0.00%) pub fn next_ty_var_in_universe( . &self, . origin: TypeVariableOrigin, . universe: ty::UniverseIndex, . ) -> Ty<'tcx> { 36,168 ( 0.00%) let vid = self.inner.borrow_mut().type_variables().new_var(universe, origin); 3,288 ( 0.00%) self.tcx.mk_ty_var(vid) 9,864 ( 0.00%) } . . pub fn next_const_var( . &self, . ty: Ty<'tcx>, . origin: ConstVariableOrigin, . ) -> &'tcx ty::Const<'tcx> { . self.tcx.mk_const_var(self.next_const_var_id(origin), ty) . } -- line 1074 ---------------------------------------- -- line 1090 ---------------------------------------- . pub fn next_const_var_id(&self, origin: ConstVariableOrigin) -> ConstVid<'tcx> { . self.inner.borrow_mut().const_unification_table().new_key(ConstVarValue { . origin, . val: ConstVariableValue::Unknown { universe: self.universe() }, . }) . } . . fn next_int_var_id(&self) -> IntVid { 2,550 ( 0.00%) self.inner.borrow_mut().int_unification_table().new_key(None) . } . 1,530 ( 0.00%) pub fn next_int_var(&self) -> Ty<'tcx> { . self.tcx.mk_int_var(self.next_int_var_id()) 2,040 ( 0.00%) } . . fn next_float_var_id(&self) -> FloatVid { 15 ( 0.00%) self.inner.borrow_mut().float_unification_table().new_key(None) . } . 9 ( 0.00%) pub fn next_float_var(&self) -> Ty<'tcx> { . self.tcx.mk_float_var(self.next_float_var_id()) 12 ( 0.00%) } . . /// Creates a fresh region variable with the next available index. . /// The variable will be created in the maximum universe created . /// thus far, allowing it to name any region created thus far. 40,841 ( 0.00%) pub fn next_region_var(&self, origin: RegionVariableOrigin) -> ty::Region<'tcx> { 910,383 ( 0.01%) self.next_region_var_in_universe(origin, self.universe()) 81,682 ( 0.00%) } . . /// Creates a fresh region variable with the next available index . /// in the given universe; typically, you can use . /// `next_region_var` and just use the maximal universe. 349,818 ( 0.01%) pub fn next_region_var_in_universe( . &self, . origin: RegionVariableOrigin, . universe: ty::UniverseIndex, . ) -> ty::Region<'tcx> { . let region_var = 2,273,817 ( 0.03%) self.inner.borrow_mut().unwrap_region_constraints().new_region_var(universe, origin); 874,545 ( 0.01%) self.tcx.mk_region(ty::ReVar(region_var)) 524,727 ( 0.01%) } . . /// Return the universe that the region `r` was created in. For . /// most regions (e.g., `'static`, named regions from the user, . /// etc) this is the root universe U0. For inference variables or . /// placeholders, however, it will return the universe which which . /// they are associated. 32,148 ( 0.00%) pub fn universe_of_region(&self, r: ty::Region<'tcx>) -> ty::UniverseIndex { . self.inner.borrow_mut().unwrap_region_constraints().universe(r) 48,222 ( 0.00%) } . . /// Number of region variables created so far. 10,232 ( 0.00%) pub fn num_region_vars(&self) -> usize { . self.inner.borrow_mut().unwrap_region_constraints().num_region_vars() 15,348 ( 0.00%) } . . /// Just a convenient wrapper of `next_region_var` for using during NLL. 75,581 ( 0.00%) pub fn next_nll_region_var(&self, origin: NllRegionVariableOrigin) -> ty::Region<'tcx> { . self.next_region_var(RegionVariableOrigin::Nll(origin)) 151,162 ( 0.00%) } . . /// Just a convenient wrapper of `next_region_var` for using during NLL. 1,365 ( 0.00%) pub fn next_nll_region_var_in_universe( . &self, . origin: NllRegionVariableOrigin, . universe: ty::UniverseIndex, . ) -> ty::Region<'tcx> { 10,375 ( 0.00%) self.next_region_var_in_universe(RegionVariableOrigin::Nll(origin), universe) 2,730 ( 0.00%) } . 610,344 ( 0.01%) pub fn var_for_def(&self, span: Span, param: &ty::GenericParamDef) -> GenericArg<'tcx> { 328,743 ( 0.00%) match param.kind { . GenericParamDefKind::Lifetime => { . // Create a region inference variable for the given . // region parameter definition. 26,361 ( 0.00%) self.next_region_var(EarlyBoundRegion(span, param.name)).into() . } . GenericParamDefKind::Type { .. } => { . // Create a type inference variable for the given . // type parameter definition. The substitutions are . // for actual parameters that may be referred to by . // the default of this type parameter, if it exists. . // e.g., `struct Foo(...);` when . // used in a path such as `Foo::::new()` will . // use an inference variable for `C` with `[T, U]` . // as the substitutions for the default, `(T, U)`. 196,852 ( 0.00%) let ty_var_id = self.inner.borrow_mut().type_variables().new_var( . self.universe(), 246,065 ( 0.00%) TypeVariableOrigin { . kind: TypeVariableOriginKind::TypeParameterDefinition( 49,213 ( 0.00%) param.name, 49,213 ( 0.00%) Some(param.def_id), . ), . span, . }, . ); . 49,213 ( 0.00%) self.tcx.mk_ty_var(ty_var_id).into() . } . GenericParamDefKind::Const { .. } => { . let origin = ConstVariableOrigin { . kind: ConstVariableOriginKind::ConstParameterDefinition( . param.name, . param.def_id, . ), . span, . }; . let const_var_id = 7,909 ( 0.00%) self.inner.borrow_mut().const_unification_table().new_key(ConstVarValue { . origin, . val: ConstVariableValue::Unknown { universe: self.universe() }, . }); 719 ( 0.00%) self.tcx.mk_const_var(const_var_id, self.tcx.type_of(param.def_id)).into() . } . } 5,752 ( 0.00%) } . . /// Given a set of generics defined on a type or impl, returns a substitution mapping each . /// type/region parameter to a fresh inference variable. 145,917 ( 0.00%) pub fn fresh_substs_for_item(&self, span: Span, def_id: DefId) -> SubstsRef<'tcx> { 647,169 ( 0.01%) InternalSubsts::for_item(self.tcx, def_id, |param, _| self.var_for_def(span, param)) 97,278 ( 0.00%) } . . /// Returns `true` if errors have been reported since this infcx was . /// created. This is sometimes used as a heuristic to skip . /// reporting errors that often occur as a result of earlier . /// errors, but where it's hard to be 100% sure (e.g., unresolved . /// inference variables, regionck errors). 3,764 ( 0.00%) pub fn is_tainted_by_errors(&self) -> bool { . debug!( . "is_tainted_by_errors(err_count={}, err_count_on_creation={}, \ . tainted_by_errors_flag={})", . self.tcx.sess.err_count(), . self.err_count_on_creation, . self.tainted_by_errors_flag.get() . ); . 84,898 ( 0.00%) if self.tcx.sess.err_count() > self.err_count_on_creation { . return true; // errors reported since this infcx was made . } . self.tainted_by_errors_flag.get() 5,646 ( 0.00%) } . . /// Set the "tainted by errors" flag to true. We call this when we . /// observe an error from a prior pass. . pub fn set_tainted_by_errors(&self) { . debug!("set_tainted_by_errors()"); . self.tainted_by_errors_flag.set(true) . } . . /// Process the region constraints and return any any errors that . /// result. After this, no more unification operations should be . /// done -- or the compiler will panic -- but it is legal to use . /// `resolve_vars_if_possible` as well as `fully_resolve`. 83,678 ( 0.00%) pub fn resolve_regions( . &self, . region_context: DefId, . outlives_env: &OutlivesEnvironment<'tcx>, . mode: RegionckMode, . ) -> Vec> { 227,126 ( 0.00%) let (var_infos, data) = { . let mut inner = self.inner.borrow_mut(); . let inner = &mut *inner; 11,954 ( 0.00%) assert!( 35,862 ( 0.00%) self.is_tainted_by_errors() || inner.region_obligations.is_empty(), . "region_obligations not empty: {:#?}", . inner.region_obligations . ); . inner . .region_constraint_storage . .take() . .expect("regions already resolved") . .with_log(&mut inner.undo_log) . .into_infos_and_data() 11,954 ( 0.00%) }; . . let region_rels = 11,954 ( 0.00%) &RegionRelations::new(self.tcx, region_context, outlives_env.free_region_map()); . 107,586 ( 0.00%) let (lexical_region_resolutions, errors) = 286,896 ( 0.00%) lexical_region_resolve::resolve(region_rels, var_infos, data, mode); . 47,816 ( 0.00%) let old_value = self.lexical_region_resolutions.replace(Some(lexical_region_resolutions)); 11,954 ( 0.00%) assert!(old_value.is_none()); . . errors 107,586 ( 0.00%) } . . /// Process the region constraints and report any errors that . /// result. After this, no more unification operations should be . /// done -- or the compiler will panic -- but it is legal to use . /// `resolve_vars_if_possible` as well as `fully_resolve`. 119,540 ( 0.00%) pub fn resolve_regions_and_report_errors( . &self, . region_context: DefId, . outlives_env: &OutlivesEnvironment<'tcx>, . mode: RegionckMode, . ) { 23,908 ( 0.00%) let errors = self.resolve_regions(region_context, outlives_env, mode); . 35,862 ( 0.00%) if !self.is_tainted_by_errors() { . // As a heuristic, just skip reporting region errors . // altogether if other errors have been reported while . // this infcx was in use. This is totally hokey but . // otherwise we have a hard time separating legit region . // errors from silly ones. 23,908 ( 0.00%) self.report_region_errors(&errors); . } 59,770 ( 0.00%) } . . /// Obtains (and clears) the current set of region . /// constraints. The inference context is still usable: further . /// unifications will simply add new constraints. . /// . /// This method is not meant to be used with normal lexical region . /// resolution. Rather, it is used in the NLL mode as a kind of . /// interim hack: basically we run normal type-check and generate . /// region constraints as normal, but then we take them and . /// translate them into the form that the NLL solver . /// understands. See the NLL module for mode details. 30 ( 0.00%) pub fn take_and_reset_region_constraints(&self) -> RegionConstraintData<'tcx> { 10 ( 0.00%) assert!( . self.inner.borrow().region_obligations.is_empty(), . "region_obligations not empty: {:#?}", . self.inner.borrow().region_obligations . ); . 40 ( 0.00%) self.inner.borrow_mut().unwrap_region_constraints().take_and_reset_data() 50 ( 0.00%) } . . /// Gives temporary access to the region constraint data. . pub fn with_region_constraints( . &self, . op: impl FnOnce(&RegionConstraintData<'tcx>) -> R, . ) -> R { . let mut inner = self.inner.borrow_mut(); 39,672 ( 0.00%) op(inner.unwrap_region_constraints().data()) . } . . pub fn region_var_origin(&self, vid: ty::RegionVid) -> RegionVariableOrigin { . let mut inner = self.inner.borrow_mut(); . let inner = &mut *inner; . inner . .region_constraint_storage . .as_mut() -- line 1335 ---------------------------------------- -- line 1338 ---------------------------------------- . .var_origin(vid) . } . . /// Takes ownership of the list of variable regions. This implies . /// that all the region constraints have already been taken, and . /// hence that `resolve_regions_and_report_errors` can never be . /// called. This is used only during NLL processing to "hand off" ownership . /// of the set of region variables into the NLL region context. 6,255 ( 0.00%) pub fn take_region_var_origins(&self) -> VarInfos { . let mut inner = self.inner.borrow_mut(); 23,769 ( 0.00%) let (var_infos, data) = inner . .region_constraint_storage . .take() . .expect("regions already resolved") . .with_log(&mut inner.undo_log) 1,251 ( 0.00%) .into_infos_and_data(); 1,251 ( 0.00%) assert!(data.is_empty()); . var_infos 10,008 ( 0.00%) } . . pub fn ty_to_string(&self, t: Ty<'tcx>) -> String { . self.resolve_vars_if_possible(t).to_string() . } . . /// If `TyVar(vid)` resolves to a type, return that type. Else, return the . /// universe index of `TyVar(vid)`. 32,548 ( 0.00%) pub fn probe_ty_var(&self, vid: TyVid) -> Result, ty::UniverseIndex> { . use self::type_variable::TypeVariableValue; . 97,644 ( 0.00%) match self.inner.borrow_mut().type_variables().probe(vid) { . TypeVariableValue::Known { value } => Ok(value), . TypeVariableValue::Unknown { universe } => Err(universe), . } 113,918 ( 0.00%) } . . /// Resolve any type variables found in `value` -- but only one . /// level. So, if the variable `?X` is bound to some type . /// `Foo`, then this would return `Foo` (but `?Y` may . /// itself be bound to a type). . /// . /// Useful when you only need to inspect the outermost level of . /// the type and don't care about nested types (or perhaps you . /// will be resolving them as well, e.g. in a loop). . pub fn shallow_resolve(&self, value: T) -> T . where . T: TypeFoldable<'tcx>, . { 729,780 ( 0.01%) value.fold_with(&mut ShallowResolver { infcx: self }) . } . 39,518 ( 0.00%) pub fn root_var(&self, var: ty::TyVid) -> ty::TyVid { . self.inner.borrow_mut().type_variables().root_var(var) 59,277 ( 0.00%) } . . /// Where possible, replaces type/const variables in . /// `value` with their final value. Note that region variables . /// are unaffected. If a type/const variable has not been unified, it . /// is left as is. This is an idempotent operation that does . /// not affect inference state in any way and so you can do it . /// at will. 31,612 ( 0.00%) pub fn resolve_vars_if_possible(&self, value: T) -> T . where . T: TypeFoldable<'tcx>, . { 668,276 ( 0.01%) if !value.needs_infer() { 465,107 ( 0.01%) return value; // Avoid duplicated subst-folding. . } 686,197 ( 0.01%) let mut r = resolve::OpportunisticVarResolver::new(self); 855,417 ( 0.01%) value.fold_with(&mut r) 30,590 ( 0.00%) } . . /// Returns the first unresolved variable contained in `T`. In the . /// process of visiting `T`, this will resolve (where possible) . /// type variables in `T`, but it never constructs the final, . /// resolved type, so it's more efficient than . /// `resolve_vars_if_possible()`. . pub fn unresolved_type_vars(&self, value: &T) -> Option<(Ty<'tcx>, Option)> . where . T: TypeFoldable<'tcx>, . { 376 ( 0.00%) value.visit_with(&mut resolve::UnresolvedTypeFinder::new(self)).break_value() . } . . pub fn probe_const_var( . &self, . vid: ty::ConstVid<'tcx>, . ) -> Result<&'tcx ty::Const<'tcx>, ty::UniverseIndex> { . match self.inner.borrow_mut().const_unification_table().probe_value(vid).val { . ConstVariableValue::Known { value } => Ok(value), -- line 1426 ---------------------------------------- -- line 1490 ---------------------------------------- . expected: &'tcx ty::Const<'tcx>, . actual: &'tcx ty::Const<'tcx>, . err: TypeError<'tcx>, . ) -> DiagnosticBuilder<'tcx> { . let trace = TypeTrace::consts(cause, true, expected, actual); . self.report_and_explain_type_error(trace, &err) . } . 77,895 ( 0.00%) pub fn replace_bound_vars_with_fresh_vars( . &self, . span: Span, . lbrct: LateBoundRegionConversionTime, . value: ty::Binder<'tcx, T>, . ) -> (T, BTreeMap>) . where . T: TypeFoldable<'tcx>, . { . let fld_r = 456,397 ( 0.01%) |br: ty::BoundRegion| self.next_region_var(LateBoundRegion(span, br.kind, lbrct)); . let fld_t = |_| { . self.next_ty_var(TypeVariableOrigin { . kind: TypeVariableOriginKind::MiscVariable, . span, . }) . }; . let fld_c = |_, ty| { . self.next_const_var( . ty, . ConstVariableOrigin { kind: ConstVariableOriginKind::MiscVariable, span }, . ) . }; 442,407 ( 0.01%) self.tcx.replace_bound_vars(value, fld_r, fld_t, fld_c) 51,930 ( 0.00%) } . . /// See the [`region_constraints::RegionConstraintCollector::verify_generic_bound`] method. 6,616 ( 0.00%) pub fn verify_generic_bound( . &self, . origin: SubregionOrigin<'tcx>, . kind: GenericKind<'tcx>, . a: ty::Region<'tcx>, . bound: VerifyBound<'tcx>, . ) { . debug!("verify_generic_bound({:?}, {:?} <: {:?})", kind, a, bound); . 2,481 ( 0.00%) self.inner . .borrow_mut() . .unwrap_region_constraints() 14,059 ( 0.00%) .verify_generic_bound(origin, kind, a, bound); 5,789 ( 0.00%) } . . /// Obtains the latest type of the given closure; this may be a . /// closure in the current function, in which case its . /// `ClosureKind` may not yet be known. 2,516 ( 0.00%) pub fn closure_kind(&self, closure_substs: SubstsRef<'tcx>) -> Option { 5,032 ( 0.00%) let closure_kind_ty = closure_substs.as_closure().kind_ty(); . let closure_kind_ty = self.shallow_resolve(closure_kind_ty); 3,774 ( 0.00%) closure_kind_ty.to_opt_closure_kind() . } . . /// Clears the selection, evaluation, and projection caches. This is useful when . /// repeatedly attempting to select an `Obligation` while changing only . /// its `ParamEnv`, since `FulfillmentContext` doesn't use probing. . pub fn clear_caches(&self) { . self.selection_cache.clear(); . self.evaluation_cache.clear(); . self.inner.borrow_mut().projection_cache().clear(); . } . . pub fn universe(&self) -> ty::UniverseIndex { 1,260,991 ( 0.02%) self.universe.get() 464,487 ( 0.01%) } . . /// Creates and return a fresh universe that extends all previous . /// universes. Updates `self.universe` to that new universe. 1,402 ( 0.00%) pub fn create_next_universe(&self) -> ty::UniverseIndex { 3,754 ( 0.00%) let u = self.universe.get().next_universe(); . self.universe.set(u); . u 1,402 ( 0.00%) } . . /// Resolves and evaluates a constant. . /// . /// The constant can be located on a trait like `::C`, in which case the given . /// substitutions and environment are used to resolve the constant. Alternatively if the . /// constant has generic parameters in scope the substitutions are used to evaluate the value of . /// the constant. For example in `fn foo() { let _ = [0; bar::()]; }` the repeat count . /// constant `bar::()` requires a substitution for `T`, if the substitution for `T` is still . /// too generic for the constant to be evaluated then `Err(ErrorHandled::TooGeneric)` is . /// returned. . /// . /// This handles inferences variables within both `param_env` and `substs` by . /// performing the operation on their respective canonical forms. 208 ( 0.00%) pub fn const_eval_resolve( . &self, . param_env: ty::ParamEnv<'tcx>, . unevaluated: ty::Unevaluated<'tcx>, . span: Option, . ) -> EvalToConstValueResult<'tcx> { 16 ( 0.00%) let substs = self.resolve_vars_if_possible(unevaluated.substs); . . // Postpone the evaluation of constants whose substs depend on inference . // variables . if substs.has_infer_types_or_consts() { . return Err(ErrorHandled::TooGeneric); . } . 16 ( 0.00%) let param_env_erased = self.tcx.erase_regions(param_env); . let substs_erased = self.tcx.erase_regions(substs); . . let unevaluated = ty::Unevaluated { . def: unevaluated.def, . substs: substs_erased, 32 ( 0.00%) promoted: unevaluated.promoted, . }; . . // The return value is the evaluated value which doesn't contain any reference to inference . // variables, thus we don't need to substitute back the original values. 192 ( 0.00%) self.tcx.const_eval_resolve(param_env_erased, unevaluated, span) 144 ( 0.00%) } . . /// If `typ` is a type variable of some kind, resolve it one level . /// (but do not resolve types found in the result). If `typ` is . /// not a type variable, just return it unmodified. . // FIXME(eddyb) inline into `ShallowResolver::visit_ty`. 7,444,640 ( 0.11%) fn shallow_resolve_ty(&self, typ: Ty<'tcx>) -> Ty<'tcx> { 3,857,208 ( 0.06%) match *typ.kind() { . ty::Infer(ty::TyVar(v)) => { . // Not entirely obvious: if `typ` is a type variable, . // it can be resolved to an int/float variable, which . // can then be recursively resolved, hence the . // recursion. Note though that we prevent type . // variables from unifying to other type variables . // directly (though they may be embedded . // structurally), and we prevent cycles in any case, . // so this recursion should always be of very limited . // depth. . // . // Note: if these two lines are combined into one we get . // dynamic borrow errors on `self.inner`. 1,940,972 ( 0.03%) let known = self.inner.borrow_mut().type_variables().probe(v).known(); . known.map_or(typ, |t| self.shallow_resolve_ty(t)) . } . 38,772 ( 0.00%) ty::Infer(ty::IntVar(v)) => self . .inner . .borrow_mut() . .int_unification_table() . .probe_value(v) 12,441 ( 0.00%) .map(|v| v.to_type(self.tcx)) . .unwrap_or(typ), . 196 ( 0.00%) ty::Infer(ty::FloatVar(v)) => self . .inner . .borrow_mut() . .float_unification_table() . .probe_value(v) 72 ( 0.00%) .map(|v| v.to_type(self.tcx)) . .unwrap_or(typ), . . _ => typ, . } 8,375,220 ( 0.12%) } . . /// `ty_or_const_infer_var_changed` is equivalent to one of these two: . /// * `shallow_resolve(ty) != ty` (where `ty.kind = ty::Infer(_)`) . /// * `shallow_resolve(ct) != ct` (where `ct.kind = ty::ConstKind::Infer(_)`) . /// . /// However, `ty_or_const_infer_var_changed` is more efficient. It's always . /// inlined, despite being large, because it has only two call sites that . /// are extremely hot (both in `traits::fulfill`'s checking of `stalled_on` -- line 1659 ---------------------------------------- -- line 1662 ---------------------------------------- . #[inline(always)] . pub fn ty_or_const_infer_var_changed(&self, infer_var: TyOrConstInferVar<'tcx>) -> bool { . match infer_var { . TyOrConstInferVar::Ty(v) => { . use self::type_variable::TypeVariableValue; . . // If `inlined_probe` returns a `Known` value, it never equals . // `ty::Infer(ty::TyVar(v))`. 2,573,584 ( 0.04%) match self.inner.borrow_mut().type_variables().inlined_probe(v) { . TypeVariableValue::Unknown { .. } => false, . TypeVariableValue::Known { .. } => true, . } . } . . TyOrConstInferVar::TyInt(v) => { . // If `inlined_probe_value` returns a value it's always a . // `ty::Int(_)` or `ty::UInt(_)`, which never matches a . // `ty::Infer(_)`. 5,320 ( 0.00%) self.inner.borrow_mut().int_unification_table().inlined_probe_value(v).is_some() . } . . TyOrConstInferVar::TyFloat(v) => { . // If `probe_value` returns a value it's always a . // `ty::Float(_)`, which never matches a `ty::Infer(_)`. . // . // Not `inlined_probe_value(v)` because this call site is colder. 18 ( 0.00%) self.inner.borrow_mut().float_unification_table().probe_value(v).is_some() . } . . TyOrConstInferVar::Const(v) => { . // If `probe_value` returns a `Known` value, it never equals . // `ty::ConstKind::Infer(ty::InferConst::Var(v))`. . // . // Not `inlined_probe_value(v)` because this call site is colder. . match self.inner.borrow_mut().const_unification_table().probe_value(v).val { -- line 1696 ---------------------------------------- -- line 1716 ---------------------------------------- . /// Equivalent to `ty::ConstKind::Infer(ty::InferConst::Var(_))`. . Const(ConstVid<'tcx>), . } . . impl<'tcx> TyOrConstInferVar<'tcx> { . /// Tries to extract an inference variable from a type or a constant, returns `None` . /// for types other than `ty::Infer(_)` (or `InferTy::Fresh*`) and . /// for constants other than `ty::ConstKind::Infer(_)` (or `InferConst::Fresh`). 23,883 ( 0.00%) pub fn maybe_from_generic_arg(arg: GenericArg<'tcx>) -> Option { . match arg.unpack() { . GenericArgKind::Type(ty) => Self::maybe_from_ty(ty), . GenericArgKind::Const(ct) => Self::maybe_from_const(ct), . GenericArgKind::Lifetime(_) => None, . } 23,883 ( 0.00%) } . . /// Tries to extract an inference variable from a type, returns `None` . /// for types other than `ty::Infer(_)` (or `InferTy::Fresh*`). 2,418 ( 0.00%) pub fn maybe_from_ty(ty: Ty<'tcx>) -> Option { 236,103 ( 0.00%) match *ty.kind() { 52,090 ( 0.00%) ty::Infer(ty::TyVar(v)) => Some(TyOrConstInferVar::Ty(v)), 472 ( 0.00%) ty::Infer(ty::IntVar(v)) => Some(TyOrConstInferVar::TyInt(v)), 4 ( 0.00%) ty::Infer(ty::FloatVar(v)) => Some(TyOrConstInferVar::TyFloat(v)), . _ => None, . } 2,418 ( 0.00%) } . . /// Tries to extract an inference variable from a constant, returns `None` . /// for constants other than `ty::ConstKind::Infer(_)` (or `InferConst::Fresh`). . pub fn maybe_from_const(ct: &'tcx ty::Const<'tcx>) -> Option { . match ct.val { . ty::ConstKind::Infer(InferConst::Var(v)) => Some(TyOrConstInferVar::Const(v)), . _ => None, . } -- line 1749 ---------------------------------------- -- line 1755 ---------------------------------------- . } . . impl<'a, 'tcx> TypeFolder<'tcx> for ShallowResolver<'a, 'tcx> { . fn tcx<'b>(&'b self) -> TyCtxt<'tcx> { . self.infcx.tcx . } . . fn fold_ty(&mut self, ty: Ty<'tcx>) -> Ty<'tcx> { 1,424,238 ( 0.02%) self.infcx.shallow_resolve_ty(ty) . } . 18,052 ( 0.00%) fn fold_const(&mut self, ct: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> { 10,786 ( 0.00%) if let ty::Const { val: ty::ConstKind::Infer(InferConst::Var(vid)), .. } = ct { 4,400 ( 0.00%) self.infcx . .inner . .borrow_mut() . .const_unification_table() 2,640 ( 0.00%) .probe_value(*vid) . .val . .known() . .unwrap_or(ct) . } else { . ct . } 22,565 ( 0.00%) } . } . . impl<'tcx> TypeTrace<'tcx> { . pub fn span(&self) -> Span { 494 ( 0.00%) self.cause.span . } . . pub fn types( . cause: &ObligationCause<'tcx>, . a_is_expected: bool, . a: Ty<'tcx>, . b: Ty<'tcx>, . ) -> TypeTrace<'tcx> { -- line 1792 ---------------------------------------- -- line 1800 ---------------------------------------- . b: &'tcx ty::Const<'tcx>, . ) -> TypeTrace<'tcx> { . TypeTrace { cause: cause.clone(), values: Consts(ExpectedFound::new(a_is_expected, a, b)) } . } . } . . impl<'tcx> SubregionOrigin<'tcx> { . pub fn span(&self) -> Span { 1,235 ( 0.00%) match *self { 247 ( 0.00%) Subtype(ref a) => a.span(), . RelateObjectBound(a) => a, . RelateParamBound(a, ..) => a, . RelateRegionParamBound(a) => a, . Reborrow(a) => a, . ReborrowUpvar(a, _) => a, . DataBorrowed(_, a) => a, . ReferenceOutlivesReferent(_, a) => a, . CompareImplMethodObligation { span, .. } => span, -- line 1817 ---------------------------------------- -- line 1818 ---------------------------------------- . CompareImplTypeObligation { span, .. } => span, . } . } . . pub fn from_obligation_cause(cause: &traits::ObligationCause<'tcx>, default: F) -> Self . where . F: FnOnce() -> Self, . { 97,657 ( 0.00%) match *cause.code() { 16,058 ( 0.00%) traits::ObligationCauseCode::ReferenceOutlivesReferent(ref_type) => { 80,290 ( 0.00%) SubregionOrigin::ReferenceOutlivesReferent(ref_type, cause.span) . } . . traits::ObligationCauseCode::CompareImplMethodObligation { . impl_item_def_id, . trait_item_def_id, . } => SubregionOrigin::CompareImplMethodObligation { . span: cause.span, . impl_item_def_id, -- line 1836 ---------------------------------------- 6,681,855 ( 0.10%) -------------------------------------------------------------------------------- -- 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, . hygiene_data: Lock, . source_map: Lock>>, . } . . 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(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(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(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(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(f: F) -> R . where . F: FnOnce(&SessionGlobals) -> R, . { 3,079,568 ( 0.04%) SESSION_GLOBALS.with(f) . } . . #[inline] . pub fn create_default_session_globals_then(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. 134 ( 0.00%) #[derive(Debug, Eq, PartialEq, Clone, Ord, PartialOrd)] 1,264 ( 0.00%) #[derive(Decodable)] . pub enum RealFileName { 8 ( 0.00%) 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 . local_path: Option, . /// `virtual_name` is the stable path rustc will store internally within -- line 175 ---------------------------------------- -- line 179 ---------------------------------------- . } . . impl Hash for RealFileName { . fn hash(&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 4,002 ( 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 Encodable for RealFileName { . fn encode(&self, encoder: &mut S) -> Result<(), S::Error> { 88 ( 0.00%) encoder.emit_enum(|encoder| match *self { . RealFileName::LocalPath(ref local_path) => { 352 ( 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 213 ---------------------------------------- . } . } . . impl RealFileName { . /// 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. . pub fn local_path(&self) -> Option<&Path> { 6 ( 0.00%) match self { . RealFileName::LocalPath(p) => Some(p), . RealFileName::Remapped { local_path: p, virtual_name: _ } => { . 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 { 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 { 3,620 ( 0.00%) match self { . RealFileName::LocalPath(p) . | RealFileName::Remapped { local_path: _, virtual_name: p } => &p, . } 45 ( 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 { 56 ( 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> { 336 ( 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. 8,507 ( 0.00%) #[derive(Debug, Eq, PartialEq, Clone, Ord, PartialOrd, Hash)] 8,201 ( 0.00%) #[derive(Decodable, Encodable)] . pub enum FileName { . Real(RealFileName), . /// Call to `quote!`. 2 ( 0.00%) QuoteExpansion(u64), . /// Command line. . Anon(u64), . /// Hack in `src/librustc_ast/parse.rs`. . // FIXME(jseyfried) . MacroExpansion(u64), . ProcMacroSourceCode(u64), . /// Strings provided as `--cfg [cfgspec]` stored in a `crate_cfg`. . CfgSpec(u64), -- line 285 ---------------------------------------- -- 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 for FileName { 308 ( 0.00%) fn from(p: PathBuf) -> Self { 88 ( 0.00%) assert!(!p.to_string_lossy().ends_with('>')); 264 ( 0.00%) FileName::Real(RealFileName::LocalPath(p)) 308 ( 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<'_> { 224 ( 0.00%) fn fmt(&self, fmt: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { . use FileName::*; 336 ( 0.00%) match *self.inner { . Real(ref name) => { 336 ( 0.00%) write!(fmt, "{}", name.to_string_lossy(self.display_pref)) . } . QuoteExpansion(_) => write!(fmt, ""), . MacroExpansion(_) => write!(fmt, ""), . Anon(_) => write!(fmt, ""), . ProcMacroSourceCode(_) => write!(fmt, ""), . CfgSpec(_) => write!(fmt, ""), . CliCrateAttr(_) => write!(fmt, ""), . Custom(ref s) => write!(fmt, "<{}>", s), . DocTest(ref path, _) => write!(fmt, "{}", path.display()), . InlineAsm(_) => write!(fmt, ""), . } 280 ( 0.00%) } . } . . impl FileNameDisplay<'_> { 1,120 ( 0.00%) pub fn to_string_lossy(&self) -> Cow<'_, str> { 840 ( 0.00%) match self.inner { 280 ( 0.00%) FileName::Real(ref inner) => inner.to_string_lossy(self.display_pref), . _ => Cow::from(format!("{}", self)), . } 1,120 ( 0.00%) } . } . . impl FileName { . pub fn is_real(&self) -> bool { . use FileName::*; 1,346 ( 0.00%) match *self { . Real(_) => true, . Anon(_) . | MacroExpansion(_) . | ProcMacroSourceCode(_) . | CfgSpec(_) . | CliCrateAttr(_) . | Custom(_) . | QuoteExpansion(_) . | DocTest(_, _) . | InlineAsm(_) => false, . } . } . 280 ( 0.00%) pub fn prefer_remapped(&self) -> FileNameDisplay<'_> { . FileNameDisplay { inner: self, display_pref: FileNameDisplayPreference::Remapped } 560 ( 0.00%) } . . // This may include transient local filesystem information. . // Must not be embedded in build outputs. 44 ( 0.00%) pub fn prefer_local(&self) -> FileNameDisplay<'_> { . FileNameDisplay { inner: self, display_pref: FileNameDisplayPreference::Local } 88 ( 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 383 ---------------------------------------- . } . . pub fn proc_macro_source_code(src: &str) -> FileName { . let mut hasher = StableHasher::new(); . src.hash(&mut hasher); . FileName::ProcMacroSourceCode(hasher.finish()) . } . 10 ( 0.00%) pub fn cfg_spec_source_code(src: &str) -> FileName { . let mut hasher = StableHasher::new(); . src.hash(&mut hasher); 4 ( 0.00%) FileName::QuoteExpansion(hasher.finish()) 10 ( 0.00%) } . . pub fn cli_crate_attr_source_code(src: &str) -> FileName { . let mut hasher = StableHasher::new(); . src.hash(&mut hasher); . FileName::CliCrateAttr(hasher.finish()) . } . . pub fn doc_test_source_code(path: PathBuf, line: isize) -> FileName { -- line 403 ---------------------------------------- -- 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 { 54 ( 0.00%) pub lo: BytePos, 54 ( 0.00%) pub hi: BytePos, . /// Information about where the macro came from, if this piece of . /// code was created by a macro expansion. 57 ( 0.00%) pub ctxt: SyntaxContext, 18 ( 0.00%) pub parent: Option, . } . . // 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) -> 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 { 831,046 ( 0.01%) self.lo.0 == 0 && self.hi.0 == 0 . } . /// Returns `true` if `self` fully encloses `other`. . pub fn contains(self, other: Self) -> bool { 6,669 ( 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 { 193,504 ( 0.00%) fn partial_cmp(&self, rhs: &Self) -> Option { 145,128 ( 0.00%) PartialOrd::partial_cmp(&self.data(), &rhs.data()) 193,504 ( 0.00%) } . } . impl Ord for Span { . fn cmp(&self, rhs: &Self) -> Ordering { . Ord::cmp(&self.data(), &rhs.data()) . } . } . . /// A collection of `Span`s. . /// . /// Spans have two orthogonal attributes: . /// . /// - They can be *primary spans*. In this case they are the locus of . /// the error, and would be rendered with `^^^`. . /// - They can have a *label*. In this case, the label is written next . /// to the mark in the snippet when we render. 73 ( 0.00%) #[derive(Clone, Debug, Hash, PartialEq, Eq, Encodable, Decodable)] . pub struct MultiSpan { . primary_spans: Vec, 18 ( 0.00%) span_labels: Vec<(Span, String)>, . } . . impl Span { . #[inline] . pub fn lo(self) -> BytePos { . self.data().lo . } . #[inline] 392,886 ( 0.01%) pub fn with_lo(self, lo: BytePos) -> Span { . self.data().with_lo(lo) 261,924 ( 0.00%) } . #[inline] 14,280 ( 0.00%) pub fn hi(self) -> BytePos { . self.data().hi 14,280 ( 0.00%) } . #[inline] 51,093 ( 0.00%) pub fn with_hi(self, hi: BytePos) -> Span { . self.data().with_hi(hi) 34,062 ( 0.00%) } . #[inline] . pub fn ctxt(self) -> SyntaxContext { . self.data_untracked().ctxt . } . #[inline] 44,045 ( 0.00%) pub fn with_ctxt(self, ctxt: SyntaxContext) -> Span { . self.data_untracked().with_ctxt(ctxt) 26,427 ( 0.00%) } . #[inline] . pub fn parent(self) -> Option { . self.data().parent . } . #[inline] 1,359 ( 0.00%) pub fn with_parent(self, ctxt: Option) -> Span { . self.data().with_parent(ctxt) 906 ( 0.00%) } . . /// Returns `true` if this is a dummy span with any hygienic context. . #[inline] . pub fn is_dummy(self) -> bool { . self.data_untracked().is_dummy() . } . . /// Returns `true` if this span comes from a macro or desugaring. . #[inline] 12 ( 0.00%) pub fn from_expansion(self) -> bool { . self.ctxt() != SyntaxContext::root() 8 ( 0.00%) } . . /// Returns `true` if `span` originates in a derive-macro's expansion. . pub fn in_derive_expansion(self) -> bool { . matches!(self.ctxt().outer_expn_data().kind, ExpnKind::Macro(MacroKind::Derive, _)) . } . . /// Gate suggestions that would not be appropriate in a context the user didn't write. . pub fn can_be_used_for_suggestions(self) -> bool { -- line 586 ---------------------------------------- -- 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] 2,187 ( 0.00%) pub fn shrink_to_hi(self) -> Span { . let span = self.data_untracked(); . span.with_lo(span.hi) 1,458 ( 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`. 20,007 ( 0.00%) pub fn contains(self, other: Span) -> bool { . let span = self.data(); . let other = other.data(); . span.contains(other) 13,338 ( 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 . } . . /// Returns `true` if the spans are equal with regards to the source text. . /// . /// Use this instead of `==` when either span could be generated code, . /// and you only care that they point to the same bytes of source text. 45 ( 0.00%) pub fn source_equal(self, other: Span) -> bool { . let span = self.data(); . let other = other.data(); 15 ( 0.00%) span.lo == other.lo && span.hi == other.hi 30 ( 0.00%) } . . /// Returns `Some(span)`, where the start is trimmed by the end of `other`. . pub fn trim_start(self, other: Span) -> Option { . let span = self.data(); . let other = other.data(); . if span.hi > other.hi { Some(span.with_lo(cmp::max(span.lo, other.hi))) } else { None } . } . -- line 655 ---------------------------------------- -- 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 { . 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`. 14,740 ( 0.00%) pub fn find_ancestor_inside(mut self, outer: Span) -> Option { 7,370 ( 0.00%) while !outer.contains(self) { . self = self.parent_callsite()?; . } . Some(self) 16,214 ( 0.00%) } . . /// Edition of the crate from which this span came. 73,002 ( 0.00%) pub fn edition(self) -> edition::Edition { . self.ctxt().edition() 48,668 ( 0.00%) } . . #[inline] . pub fn rust_2015(self) -> bool { 13,542 ( 0.00%) self.edition() == edition::Edition::Edition2015 . } . . #[inline] . pub fn rust_2018(self) -> bool { 10,634 ( 0.00%) self.edition() >= edition::Edition::Edition2018 . } . . #[inline] . pub fn rust_2021(self) -> bool { 12,732 ( 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. 15 ( 0.00%) pub fn source_callee(self) -> Option { . fn source_callee(expn_data: ExpnData) -> ExpnData { . let next_expn_data = expn_data.call_site.ctxt().outer_expn_data(); . if !next_expn_data.is_root() { source_callee(next_expn_data) } else { expn_data } . } . let expn_data = self.ctxt().outer_expn_data(); 6 ( 0.00%) if !expn_data.is_root() { Some(source_callee(expn_data)) } else { None } 12 ( 0.00%) } . . /// 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]`). 14,965 ( 0.00%) pub fn allows_unstable(self, feature: Symbol) -> bool { 2,993 ( 0.00%) self.ctxt() . .outer_expn_data() . .allow_internal_unstable . .map_or(false, |features| features.iter().any(|&f| f == feature)) 11,972 ( 0.00%) } . . /// Checks if this span arises from a compiler desugaring of kind `kind`. 73,395 ( 0.00%) pub fn is_desugaring(self, kind: DesugaringKind) -> bool { 62,910 ( 0.00%) match self.ctxt().outer_expn_data().kind { . ExpnKind::Desugaring(k) => k == kind, . _ => false, . } 52,425 ( 0.00%) } . . /// Returns the compiler desugaring that created this span, or `None` . /// if this span is not from a desugaring. 1,440 ( 0.00%) pub fn desugaring_kind(self) -> Option { 1,728 ( 0.00%) match self.ctxt().outer_expn_data().kind { . ExpnKind::Desugaring(k) => Some(k), . _ => None, . } 1,152 ( 0.00%) } . . /// Checks if a span is "internal" to a macro in which `unsafe` . /// can be used without triggering the `unsafe_code` lint. . // (that is, a macro marked with `#[allow_internal_unsafe]`). 424 ( 0.00%) pub fn allows_unsafe(self) -> bool { 106 ( 0.00%) self.ctxt().outer_expn_data().allow_internal_unsafe 424 ( 0.00%) } . 12 ( 0.00%) pub fn macro_backtrace(mut self) -> impl Iterator { . let mut prev_span = DUMMY_SP; . std::iter::from_fn(move || { . loop { 48 ( 0.00%) let expn_data = self.ctxt().outer_expn_data(); 19 ( 0.00%) if expn_data.is_root() { 4 ( 0.00%) return None; . } . 20 ( 0.00%) let is_recursive = expn_data.call_site.source_equal(prev_span); . 2 ( 0.00%) prev_span = self; 2 ( 0.00%) self = expn_data.call_site; . . // Don't print recursive invocations. 10 ( 0.00%) if !is_recursive { 44 ( 0.00%) return Some(expn_data); . } . } . }) 24 ( 0.00%) } . . /// Returns a `Span` that would enclose both `self` and `end`. . /// . /// ```text . /// ____ ___ . /// self lorem ipsum end . /// ^^^^^^^^^^^^^^^^^^^^ . /// ``` 1,505,064 ( 0.02%) 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. 269,616 ( 0.00%) if span_data.ctxt != end_data.ctxt { 4,032 ( 0.00%) if span_data.ctxt == SyntaxContext::root() { . return end; 3,659 ( 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 }, 930,069 ( 0.01%) if span_data.parent == end_data.parent { span_data.parent } else { None }, . ) 1,231,416 ( 0.02%) } . . /// Returns a `Span` between the end of `self` to the beginning of `end`. . /// . /// ```text . /// ____ ___ . /// self lorem ipsum end . /// ^^^^^^^^^^^^^ . /// ``` 3,696 ( 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 }, 2,352 ( 0.00%) if span.parent == end.parent { span.parent } else { None }, . ) 2,688 ( 0.00%) } . . /// Returns a `Span` from the beginning of `self` until the beginning of `end`. . /// . /// ```text . /// ____ ___ . /// self lorem ipsum end . /// ^^^^^^^^^^^^^^^^^ . /// ``` 8,030 ( 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. 1,460 ( 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 }, 5,110 ( 0.00%) if span_data.parent == end_data.parent { span_data.parent } else { None }, . ) 6,570 ( 0.00%) } . 5,819 ( 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, . ) 3,703 ( 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 { 16,210 ( 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 { 318 ( 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). 99,168 ( 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)) 57,848 ( 0.00%) } . . #[inline] . pub fn apply_mark(self, expn_id: ExpnId, transparency: Transparency) -> Span { . let span = self.data(); 423,162 ( 0.01%) span.with_ctxt(span.ctxt.apply_mark(expn_id, transparency)) . } . . #[inline] . pub fn remove_mark(&mut self) -> ExpnId { 192 ( 0.00%) let mut span = self.data(); 192 ( 0.00%) let mark = span.ctxt.remove_mark(); 768 ( 0.00%) *self = Span::new(span.lo, span.hi, span.ctxt, span.parent); . mark . } . . #[inline] . pub fn adjust(&mut self, expn_id: ExpnId) -> Option { . 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] 273,789 ( 0.00%) pub fn normalize_to_macros_2_0_and_adjust(&mut self, expn_id: ExpnId) -> Option { 182,526 ( 0.00%) let mut span = self.data(); 151,055 ( 0.00%) let mark = span.ctxt.normalize_to_macros_2_0_and_adjust(expn_id); 273,789 ( 0.00%) *self = Span::new(span.lo, span.hi, span.ctxt, span.parent); . mark 303,160 ( 0.00%) } . . #[inline] . pub fn glob_adjust(&mut self, expn_id: ExpnId, glob_span: Span) -> Option> { 2,452 ( 0.00%) let mut span = self.data(); 3,678 ( 0.00%) let mark = span.ctxt.glob_adjust(expn_id, glob_span); 9,808 ( 0.00%) *self = Span::new(span.lo, span.hi, span.ctxt, span.parent); . mark . } . . #[inline] 25,902 ( 0.00%) pub fn reverse_glob_adjust( . &mut self, . expn_id: ExpnId, . glob_span: Span, . ) -> Option> { 19,914 ( 0.00%) let mut span = self.data(); 19,682 ( 0.00%) let mark = span.ctxt.reverse_glob_adjust(expn_id, glob_span); 36,486 ( 0.00%) *self = Span::new(span.lo, span.hi, span.ctxt, span.parent); . mark 28,780 ( 0.00%) } . . #[inline] 191,104 ( 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()) 167,216 ( 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, . } . . impl Default for Span { . fn default() -> Self { . DUMMY_SP 46 ( 0.00%) } . } . . impl Encodable 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>(source_map: Lrc, 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 1044 ---------------------------------------- . fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { . (*SPAN_DEBUG)(Span::new(self.lo, self.hi, self.ctxt, self.parent), f) . } . } . . impl MultiSpan { . #[inline] . pub fn new() -> MultiSpan { 4 ( 0.00%) MultiSpan { primary_spans: vec![], span_labels: vec![] } . } . 5 ( 0.00%) pub fn from_span(primary_span: Span) -> MultiSpan { 8,290 ( 0.00%) MultiSpan { primary_spans: vec![primary_span], span_labels: vec![] } 5 ( 0.00%) } . 5 ( 0.00%) pub fn from_spans(mut vec: Vec) -> MultiSpan { . vec.sort(); 325 ( 0.00%) MultiSpan { primary_spans: vec, span_labels: vec![] } 5 ( 0.00%) } . 18 ( 0.00%) pub fn push_span_label(&mut self, span: Span, label: String) { 6 ( 0.00%) self.span_labels.push((span, label)); 15 ( 0.00%) } . . /// Selects the first primary span (if any). . pub fn primary_span(&self) -> Option { . self.primary_spans.first().cloned() 1,182 ( 0.00%) } . . /// Returns all primary spans. . pub fn primary_spans(&self) -> &[Span] { . &self.primary_spans 87 ( 0.00%) } . . /// Returns `true` if any of the primary spans are displayable. 42 ( 0.00%) pub fn has_primary_spans(&self) -> bool { 9 ( 0.00%) self.primary_spans.iter().any(|sp| !sp.is_dummy()) 49 ( 0.00%) } . . /// Returns `true` if this contains only a dummy primary span with any hygienic context. . pub fn is_dummy(&self) -> bool { . let mut is_dummy = true; . for span in &self.primary_spans { . if !span.is_dummy() { . is_dummy = false; . } -- line 1089 ---------------------------------------- -- line 1110 ---------------------------------------- . replacements_occurred . } . . /// Returns the strings to highlight. We always ensure that there . /// is an entry for each of the primary spans -- for each primary . /// span `P`, if there is at least one label with span `P`, we return . /// those labels (marked as primary). But otherwise we return . /// `SpanLabel` instances with empty labels. 182 ( 0.00%) pub fn span_labels(&self) -> Vec { 29 ( 0.00%) let is_primary = |span| self.primary_spans.contains(&span); . . let mut span_labels = self . .span_labels . .iter() 9 ( 0.00%) .map(|&(span, ref label)| SpanLabel { . span, . is_primary: is_primary(span), 6 ( 0.00%) label: Some(label.clone()), . }) . .collect::>(); . 16 ( 0.00%) for &span in &self.primary_spans { . if !span_labels.iter().any(|sl| sl.span == span) { . span_labels.push(SpanLabel { span, is_primary: true, label: None }); . } . } . . span_labels 182 ( 0.00%) } . . /// Returns `true` if any of the span labels is displayable. 24 ( 0.00%) pub fn has_span_labels(&self) -> bool { . self.span_labels.iter().any(|(sp, _)| !sp.is_dummy()) 28 ( 0.00%) } . } . . impl From for MultiSpan { 8,285 ( 0.00%) fn from(span: Span) -> MultiSpan { . MultiSpan::from_span(span) 8,285 ( 0.00%) } . } . . impl From> for MultiSpan { 320 ( 0.00%) fn from(spans: Vec) -> MultiSpan { 256 ( 0.00%) MultiSpan::from_spans(spans) 320 ( 0.00%) } . } . . /// Identifies an offset of a multi-byte character in a `SourceFile`. 11 ( 0.00%) #[derive(Copy, Clone, Encodable, Decodable, Eq, PartialEq, Debug)] . 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`. 312 ( 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 for NonNarrowChar { . type Output = Self; . . fn add(self, rhs: BytePos) -> Self { 540 ( 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 for NonNarrowChar { . type Output = Self; . 156 ( 0.00%) fn sub(self, rhs: BytePos) -> Self { 540 ( 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), . } 468 ( 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, . } . 132 ( 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> { 11,243 ( 0.00%) match self { . ExternalSource::Foreign { kind: ExternalSourceKind::Present(ref src), .. } => Some(src), . _ => None, . } . } . } . . #[derive(Debug)] . pub struct OffsetOverflowError; . 1,282 ( 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. 264 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, Debug)] 2,564 ( 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 { 3 ( 0.00%) 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 => { 147 ( 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)); . } . } . hash . } . . /// Check if the stored hash matches the hash of the string. . pub fn matches(&self, src: &str) -> bool { 3 ( 0.00%) Self::new(self.kind, src) == *self . } . . /// The bytes of the hash. . pub fn hash_bytes(&self) -> &[u8] { . let len = self.hash_len(); . &self.value[..len] . } . . fn hash_len(&self) -> usize { 144 ( 0.00%) match self.kind { . SourceFileHashAlgorithm::Md5 => 16, . SourceFileHashAlgorithm::Sha1 => 20, . SourceFileHashAlgorithm::Sha256 => 32, . } . } . } . . /// A single source in the [`SourceMap`]. 2,552 ( 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., ``). . pub name: FileName, . /// The complete source code. 44 ( 0.00%) pub src: Option>, . /// 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, . /// 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, . /// Locations of multi-byte characters in the source code. . pub multibyte_chars: Vec, . /// Width of characters that are not narrow in the source code. . pub non_narrow_chars: Vec, . /// Locations of characters removed during normalization. . pub normalized_pos: Vec, . /// A hash of the filename, used for speeding up hashing in incremental compilation. 44 ( 0.00%) pub name_hash: u128, . /// Indicates which crate this `SourceFile` was imported from. 44 ( 0.00%) pub cnum: CrateNum, . } . . impl Encodable 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)?; . 176 ( 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 { 88 ( 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); . 88 ( 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))?; 132 ( 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))?; 484 ( 0.00%) s.emit_struct_field("cnum", false, |s| self.cnum.encode(s)) . }) . } . } . . impl Decodable for SourceFile { 5,769 ( 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 = d.read_struct_field("lines", |d| { . let num_lines: u32 = Decodable::decode(d); 641 ( 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 { 984,938 ( 0.01%) 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 = . d.read_struct_field("multibyte_chars", |d| Decodable::decode(d)); . let non_narrow_chars: Vec = . d.read_struct_field("non_narrow_chars", |d| Decodable::decode(d)); 1,282 ( 0.00%) let name_hash: u128 = d.read_struct_field("name_hash", |d| Decodable::decode(d)); . let normalized_pos: Vec = . d.read_struct_field("normalized_pos", |d| Decodable::decode(d)); . let cnum: CrateNum = d.read_struct_field("cnum", |d| Decodable::decode(d)); 7,051 ( 0.00%) SourceFile { 5,128 ( 0.00%) name, . start_pos, . end_pos, . src: None, 2,564 ( 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,564 ( 0.00%) lines, 2,564 ( 0.00%) multibyte_chars, 2,564 ( 0.00%) non_narrow_chars, 2,564 ( 0.00%) normalized_pos, . name_hash, . cnum, . } . }) 5,769 ( 0.00%) } . } . . impl fmt::Debug for SourceFile { . fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result { . write!(fmt, "SourceFile({:?})", self.name) . } . } . . impl SourceFile { 506 ( 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); 138 ( 0.00%) let normalized_pos = normalize_src(&mut src, start_pos); . . let name_hash = { . let mut hasher: StableHasher = StableHasher::new(); 92 ( 0.00%) name.hash(&mut hasher); . hasher.finish::() . }; 92 ( 0.00%) let end_pos = start_pos.to_usize() + src.len(); 138 ( 0.00%) assert!(end_pos <= u32::MAX as usize); . 552 ( 0.00%) let (lines, multibyte_chars, non_narrow_chars) = 92 ( 0.00%) analyze_source_file::analyze_source_file(&src, start_pos); . 782 ( 0.00%) SourceFile { . name, . src: Some(Lrc::new(src)), 506 ( 0.00%) src_hash, . external_src: Lock::new(ExternalSource::Unneeded), . start_pos, . end_pos: Pos::from_usize(end_pos), 184 ( 0.00%) lines, 184 ( 0.00%) multibyte_chars, 184 ( 0.00%) non_narrow_chars, 184 ( 0.00%) normalized_pos, . name_hash, . cnum: LOCAL_CRATE, . } 414 ( 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. 10,745 ( 0.00%) pub fn add_external_src(&self, get_src: F) -> bool . where . F: FnOnce() -> Option, . { 1,543 ( 0.00%) if matches!( 3,070 ( 0.00%) *self.external_src.borrow(), . ExternalSource::Foreign { kind: ExternalSourceKind::AbsentOk, .. } . ) { 3 ( 0.00%) 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 9 ( 0.00%) if let ExternalSource::Foreign { . kind: src_kind @ ExternalSourceKind::AbsentOk, .. . } = &mut *external_src . { 15 ( 0.00%) if let Some(mut src) = src { . // The src_hash needs to be computed on the pre-normalized src. 3 ( 0.00%) if self.src_hash.matches(&src) { 9 ( 0.00%) normalize_src(&mut src, BytePos::from_usize(0)); 24 ( 0.00%) *src_kind = ExternalSourceKind::Present(Lrc::new(src)); . return true; . } . } else { . *src_kind = ExternalSourceKind::AbsentErr; . } . . false . } else { . self.src.is_some() || external_src.get_source().is_some() . } . } else { 1,532 ( 0.00%) self.src.is_some() || self.external_src.borrow().get_source().is_some() . } 13,815 ( 0.00%) } . . /// Gets a line from the list of pre-computed line-beginnings. . /// The line number here is 0-based. 182 ( 0.00%) pub fn get_line(&self, line_number: usize) -> Option> { 154 ( 0.00%) 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. . let slice = &src[begin..]; . match slice.find('\n') { . Some(e) => &slice[..e], . None => slice, . } 176 ( 0.00%) } . . let begin = { 26 ( 0.00%) let line = self.lines.get(line_number)?; 26 ( 0.00%) let begin: BytePos = *line - self.start_pos; . begin.to_usize() . }; . 78 ( 0.00%) if let Some(ref src) = self.src { 80 ( 0.00%) Some(Cow::from(get_until_newline(src, begin))) 10 ( 0.00%) } else if let Some(src) = self.external_src.borrow().get_source() { 18 ( 0.00%) Some(Cow::Owned(String::from(get_until_newline(src, begin)))) . } else { 8 ( 0.00%) None . } 208 ( 0.00%) } . . pub fn is_real_file(&self) -> bool { . self.name.is_real() 673 ( 0.00%) } . . pub fn is_imported(&self) -> bool { . self.src.is_none() 26,536 ( 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 { 63,992 ( 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 { 153,297 ( 0.00%) if self.is_empty() { . return self.start_pos..self.end_pos; . } . 99,159 ( 0.00%) assert!(line_index < self.lines.len()); 142,944 ( 0.00%) if line_index == (self.lines.len() - 1) { 1,312 ( 0.00%) self.lines[line_index]..self.end_pos . } else { 94,390 ( 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 1678 ---------------------------------------- . . #[inline] . pub fn is_empty(&self) -> bool { . self.start_pos == self.end_pos . } . . /// Calculates the original byte position relative to the start of the file . /// based on the given byte position. 18 ( 0.00%) pub fn original_relative_byte_pos(&self, pos: BytePos) -> BytePos { . // Diff before any records is 0. Otherwise use the previously recorded . // diff as that applies to the following characters until a new diff . // is recorded. . let diff = match self.normalized_pos.binary_search_by(|np| np.pos.cmp(&pos)) { . Ok(i) => self.normalized_pos[i].diff, . Err(i) if i == 0 => 0, . Err(i) => self.normalized_pos[i - 1].diff, . }; . 72 ( 0.00%) BytePos::from_u32(pos.0 - self.start_pos.0 + diff) 54 ( 0.00%) } . . /// Converts an absolute `BytePos` to a `CharPos` relative to the `SourceFile`. 1,248 ( 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; . 3,744 ( 0.00%) for mbc in self.multibyte_chars.iter() { . debug!("{}-byte char at {:?}", mbc.bytes, mbc.pos); 32 ( 0.00%) if mbc.pos < bpos { . // Every character is at least one byte, so we only . // count the actual extra bytes. 48 ( 0.00%) total_extra_bytes += mbc.bytes as u32 - 1; . // We should never see a byte position in the middle of a . // character. 40 ( 0.00%) assert!(bpos.to_u32() >= mbc.pos.to_u32() + mbc.bytes as u32); . } else { . break; . } . } . 7,488 ( 0.00%) assert!(self.start_pos.to_u32() + total_extra_bytes <= bpos.to_u32()); 6,240 ( 0.00%) CharPos(bpos.to_usize() - self.start_pos.to_usize() - total_extra_bytes as usize) 2,496 ( 0.00%) } . . /// Looks up the file's (1-based) line number and (0-based `CharPos`) column offset, for a . /// given `BytePos`. 4,368 ( 0.00%) pub fn lookup_file_pos(&self, pos: BytePos) -> (usize, CharPos) { 1,248 ( 0.00%) let chpos = self.bytepos_to_file_charpos(pos); 621 ( 0.00%) match self.lookup_line(pos) { . Some(a) => { . let line = a + 1; // Line numbers start at 1 624 ( 0.00%) let linebpos = self.lines[a]; 1,248 ( 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); 624 ( 0.00%) assert!(chpos >= linechpos); . (line, col) . } . None => (0, chpos), . } 4,992 ( 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`. 4,992 ( 0.00%) pub fn lookup_file_pos_with_col_display(&self, pos: BytePos) -> (usize, CharPos, usize) { 1,872 ( 0.00%) let (line, col_or_chpos) = self.lookup_file_pos(pos); 1,248 ( 0.00%) if line > 0 { . let col = col_or_chpos; 624 ( 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(); 3,120 ( 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) . } 4,368 ( 0.00%) } . } . . /// Normalizes the source code and records the normalizations. 490 ( 0.00%) fn normalize_src(src: &mut String, start_pos: BytePos) -> Vec { . 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 441 ( 0.00%) } . . /// Removes UTF-8 BOM, if any. . fn remove_bom(src: &mut String, normalized_pos: &mut Vec) { 49 ( 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) { 49 ( 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])* 259,848 ( 0.00%) $vis struct $ident($inner_vis $inner_ty); . . impl Pos for $ident { . #[inline(always)] . fn from_usize(n: usize) -> $ident { 14,844 ( 0.00%) $ident(n as $inner_ty) . } . . #[inline(always)] . fn to_usize(&self) -> usize { 291,371 ( 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 { 2,756,619 ( 0.04%) $ident(self.0 + rhs.0) . } . } . . impl Sub for $ident { . type Output = $ident; . . #[inline(always)] . fn sub(self, rhs: $ident) -> $ident { 3,935,026 ( 0.06%) $ident(self.0 - rhs.0) . } . } . )* . }; . } . . impl_pos! { . /// A byte offset. -- line 1931 ---------------------------------------- -- line 1946 ---------------------------------------- . impl Encodable for BytePos { . fn encode(&self, s: &mut S) -> Result<(), S::Error> { . s.emit_u32(self.0) . } . } . . impl Decodable for BytePos { . fn decode(d: &mut D) -> BytePos { 730,706 ( 0.01%) BytePos(d.read_u32()) . } . } . . // _____________________________________________________________________________ . // Loc, SourceFileAndLine, SourceFileAndBytePos . // . . /// A source code location used for error reporting. 12 ( 0.00%) #[derive(Debug, Clone)] . pub struct Loc { . /// Information about the original source. . pub file: Lrc, . /// The (1-based) line number. 3 ( 0.00%) pub line: usize, . /// The (0-based) column offset. . pub col: CharPos, . /// The (0-based) column offset when displayed. 3 ( 0.00%) pub col_display: usize, . } . . // Used to be structural records. . #[derive(Debug)] . pub struct SourceFileAndLine { . pub sf: Lrc, . /// Index of line, starting from 0. . pub line: usize, -- line 1980 ---------------------------------------- -- line 2037 ---------------------------------------- . pub source_len: usize, . pub begin_pos: BytePos, . pub end_pos: BytePos, . } . . /// 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 { 11 ( 0.00%) pub start: usize, . pub end: usize, . } . . impl InnerSpan { 2,920 ( 0.00%) pub fn new(start: usize, end: usize) -> InnerSpan { . InnerSpan { start, end } 1,460 ( 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. 1,631,203 ( 0.02%) 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; . 278,318 ( 0.00%) if !ctx.hash_spans() { . return; . } . 1,352,885 ( 0.02%) let span = self.data_untracked(); 563,244 ( 0.01%) span.ctxt.hash_stable(ctx, hasher); 699,087 ( 0.01%) span.parent.hash_stable(ctx, hasher); . 470,798 ( 0.01%) if span.is_dummy() { . Hash::hash(&TAG_INVALID_SPAN, hasher); . return; . } . 456,578 ( 0.01%) 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. 913,156 ( 0.01%) let (file, line_lo, col_lo, line_hi, col_hi) = match ctx.span_data_to_lines_and_cols(&span) . { 456,578 ( 0.01%) 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. . 228,289 ( 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; 228,289 ( 0.00%) let len = (span.hi - span.lo).0; . Hash::hash(&col_line, hasher); . Hash::hash(&len, hasher); 1,864,232 ( 0.03%) } . } 5,213,951 ( 0.08%) -------------------------------------------------------------------------------- -- 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, usize)>, . pos: BytePos, . time_stamp: usize, . ) { 45,021 ( 0.00%) if let Some((file, file_idx)) = new_file_and_idx { 41,352 ( 0.00%) self.file = file; 51,645 ( 0.00%) self.file_index = file_idx; . } . 16,649 ( 0.00%) let line_index = self.file.lookup_line(pos).unwrap(); . let line_bounds = self.file.line_bounds(line_index); 95,296 ( 0.00%) self.line_number = line_index + 1; 149,434 ( 0.00%) self.line = line_bounds; . self.touch(time_stamp); . } . . #[inline] . fn touch(&mut self, time_stamp: usize) { 419,283 ( 0.01%) 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> { 18,838 ( 0.00%) pub fn new(source_map: &'sm SourceMap) -> CachingSourceMapView<'sm> { . let files = source_map.files(); 9,419 ( 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, . }; . 47,095 ( 0.00%) CachingSourceMapView { . source_map, 65,933 ( 0.00%) line_cache: [entry.clone(), entry.clone(), entry], . time_stamp: 0, . } 37,676 ( 0.00%) } . . pub fn byte_pos_to_line_and_col( . &mut self, . pos: BytePos, . ) -> Option<(Lrc, 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)) . } . 1,598,023 ( 0.02%) pub fn span_data_to_lines_and_cols( . &mut self, . span_data: &SpanData, . ) -> Option<(Lrc, usize, BytePos, usize, BytePos)> { 913,156 ( 0.01%) self.time_stamp += 1; . . // Check if lo and hi are in the cached lines. 228,289 ( 0.00%) let lo_cache_idx = self.cache_entry_index(span_data.lo); 228,289 ( 0.00%) let hi_cache_idx = self.cache_entry_index(span_data.hi); . 383,184 ( 0.01%) 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 = { 381,988 ( 0.01%) let lo = &self.line_cache[lo_cache_idx as usize]; . let hi = &self.line_cache[hi_cache_idx as usize]; . 1,145,964 ( 0.02%) if lo.file_index != hi.file_index { . return None; . } . . ( 381,988 ( 0.01%) lo.file.clone(), . lo.line_number, . span_data.lo - lo.line.start, 190,994 ( 0.00%) hi.line_number, . span_data.hi - hi.line.start, . ) . }; . 190,994 ( 0.00%) self.line_cache[lo_cache_idx as usize].touch(self.time_stamp); 190,994 ( 0.00%) self.line_cache[hi_cache_idx as usize].touch(self.time_stamp); . 763,976 ( 0.01%) return Some(result); . } . . // No cache hit or cache hit for only one of span lo and hi. 73,394 ( 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. 291,556 ( 0.00%) let new_file_and_idx = if !file_contains(&self.line_cache[oldest].file, span_data.lo) { 103,230 ( 0.00%) let new_file_and_idx = self.file_for_position(span_data.lo)?; 123,876 ( 0.00%) if !file_contains(&new_file_and_idx.0, span_data.hi) { . return None; . } . 82,584 ( 0.00%) Some(new_file_and_idx) . } else { . let file = &self.line_cache[oldest].file; 49,947 ( 0.00%) if !file_contains(&file, span_data.hi) { . return None; . } . 49,947 ( 0.00%) None . }; . . // Update the cache entries. 186,475 ( 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); . 98,502 ( 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); 1,196 ( 0.00%) let hi = &mut self.line_cache[hi_cache_idx as usize]; 1,794 ( 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]; 3,863 ( 0.00%) hi.update(new_file_and_idx, span_data.hi, self.time_stamp); 7,726 ( 0.00%) let lo = &mut self.line_cache[lo_cache_idx as usize]; 15,452 ( 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. 74,590 ( 0.00%) assert!(span_data.lo >= lo.line.start); 37,295 ( 0.00%) assert!(span_data.lo <= lo.line.end); 74,590 ( 0.00%) assert!(span_data.hi >= hi.line.start); 37,295 ( 0.00%) assert!(span_data.hi <= hi.line.end); 186,475 ( 0.00%) assert!(lo.file.contains(span_data.lo)); 111,885 ( 0.00%) assert!(lo.file.contains(span_data.hi)); 111,885 ( 0.00%) assert_eq!(lo.file_index, hi.file_index); . 111,885 ( 0.00%) Some(( 37,295 ( 0.00%) lo.file.clone(), . lo.line_number, . span_data.lo - lo.line.start, 37,295 ( 0.00%) hi.line_number, . span_data.hi - hi.line.start, . )) 2,054,601 ( 0.03%) } . . fn cache_entry_index(&self, pos: BytePos) -> isize { . for (idx, cache_entry) in self.line_cache.iter().enumerate() { 2,535,640 ( 0.04%) 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() { 197,004 ( 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() { 84,822 ( 0.00%) if idx != avoid_idx 54,372 ( 0.00%) && self.line_cache[idx].time_stamp < self.line_cache[oldest].time_stamp . { . oldest = idx; . } . } . . oldest . } . 103,230 ( 0.00%) fn file_for_position(&self, pos: BytePos) -> Option<(Lrc, usize)> { 20,646 ( 0.00%) if !self.source_map.files().is_empty() { 41,292 ( 0.00%) let file_idx = self.source_map.lookup_source_file_idx(pos); . let file = &self.source_map.files()[file_idx]; . 165,168 ( 0.00%) if file_contains(file, pos) { . return Some((file.clone(), file_idx)); . } . } . . None 103,230 ( 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 ---------------------------------------- 3,275,816 ( 0.05%) -------------------------------------------------------------------------------- -- 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>) -> 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)] 9,257,752 ( 0.13%) fn intern_ty(&self, kind: TyKind<'tcx>) -> Ty<'tcx> { . self.type_ 5,786,095 ( 0.08%) .intern(kind, |kind| { 288,792 ( 0.00%) let flags = super::flags::FlagComputation::for_kind(&kind); . . let ty_struct = TyS { 577,584 ( 0.01%) kind, . flags: flags.flags, . outer_exclusive_binder: flags.outer_exclusive_binder, . }; . . Interned(self.arena.alloc(ty_struct)) . }) . .0 10,414,971 ( 0.15%) } . . #[inline(never)] 3,017,320 ( 0.04%) fn intern_predicate( . &self, . kind: Binder<'tcx, PredicateKind<'tcx>>, . ) -> &'tcx PredicateInner<'tcx> { . self.predicate 2,640,155 ( 0.04%) .intern(kind, |kind| { 611,982 ( 0.01%) 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 3,394,485 ( 0.05%) } . } . . 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) { 1,160,594 ( 0.02%) 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) . } . 854,025 ( 0.01%) pub fn get(&self, id: hir::HirId) -> Option<&V> { 170,159 ( 0.00%) validate_hir_id_for_typeck_results(self.hir_owner, id); 170,159 ( 0.00%) self.data.get(&id.local_id) 684,906 ( 0.01%) } . . pub fn iter(&self) -> hash_map::Iter<'_, hir::ItemLocalId, V> { . self.data.iter() . } . } . . impl<'a, V> ::std::ops::Index for LocalTableInContext<'a, V> { . type Output = V; . 6,240 ( 0.00%) fn index(&self, key: hir::HirId) -> &V { 2 ( 0.00%) self.get(key).expect("LocalTableInContext: key not found") 4,160 ( 0.00%) } . } . . pub struct LocalTableInContextMut<'a, V> { . hir_owner: LocalDefId, . data: &'a mut ItemLocalMap, . } . . impl<'a, V> LocalTableInContextMut<'a, V> { -- line 292 ---------------------------------------- -- line 328 ---------------------------------------- . /// ``` . /// . /// Here, we would store the type `T`, the span of the value `x`, the "scope-span" for . /// the scope that contains `x`, the expr `T` evaluated from, and the span of `foo.await`. . #[derive(TyEncodable, TyDecodable, Clone, Debug, Eq, Hash, PartialEq, HashStable)] . #[derive(TypeFoldable)] . pub struct GeneratorInteriorTypeCause<'tcx> { . /// Type of the captured binding. 22 ( 0.00%) pub ty: Ty<'tcx>, . /// Span of the binding that was captured. 7 ( 0.00%) pub span: Span, . /// Span of the scope of the captured binding. 35 ( 0.00%) pub scope_span: Option, . /// Span of `.await` or `yield` expression. 35 ( 0.00%) pub yield_span: Span, . /// Expr which the type evaluated from. 49 ( 0.00%) pub expr: Option, . } . . #[derive(TyEncodable, TyDecodable, Debug)] . pub struct TypeckResults<'tcx> { . /// The `HirId::owner` all `ItemLocalId`s in this table are relative to. . pub hir_owner: LocalDefId, . . /// Resolved definitions for `::X` associated paths and -- line 352 ---------------------------------------- -- 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>, . } . . impl<'tcx> TypeckResults<'tcx> { 23,622 ( 0.00%) pub fn new(hir_owner: LocalDefId) -> TypeckResults<'tcx> { 279,527 ( 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(), . } 23,622 ( 0.00%) } . . /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node. 189,696 ( 0.00%) pub fn qpath_res(&self, qpath: &hir::QPath<'_>, id: hir::HirId) -> Res { 126,464 ( 0.00%) match *qpath { 290,982 ( 0.00%) hir::QPath::Resolved(_, ref path) => path.res, . hir::QPath::TypeRelative(..) | hir::QPath::LangItem(..) => self . .type_dependent_def(id) 88,410 ( 0.00%) .map_or(Res::Err, |(kind, def_id)| Res::Def(kind, def_id)), . } 316,160 ( 0.00%) } . 2,182 ( 0.00%) pub fn type_dependent_defs( . &self, . ) -> LocalTableInContext<'_, Result<(DefKind, DefId), ErrorReported>> { 13,754 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.type_dependent_defs } 2,182 ( 0.00%) } . 22,801 ( 0.00%) pub fn type_dependent_def(&self, id: HirId) -> Option<(DefKind, DefId)> { 46,253 ( 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()) 45,602 ( 0.00%) } . 34,868 ( 0.00%) pub fn type_dependent_def_id(&self, id: HirId) -> Option { . self.type_dependent_def(id).map(|(_, def_id)| def_id) 34,868 ( 0.00%) } . 76,486 ( 0.00%) pub fn type_dependent_defs_mut( . &mut self, . ) -> LocalTableInContextMut<'_, Result<(DefKind, DefId), ErrorReported>> { 76,486 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.type_dependent_defs } 76,486 ( 0.00%) } . . pub fn field_indices(&self) -> LocalTableInContext<'_, usize> { 16,623 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.field_indices } 3,591 ( 0.00%) } . . pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> { 22,902 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.field_indices } 11,451 ( 0.00%) } . . pub fn user_provided_types(&self) -> LocalTableInContext<'_, CanonicalUserType<'tcx>> { 31,360 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.user_provided_types } 15,680 ( 0.00%) } . . pub fn user_provided_types_mut( . &mut self, . ) -> LocalTableInContextMut<'_, CanonicalUserType<'tcx>> { 7,764 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.user_provided_types } 3,882 ( 0.00%) } . . pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> { 158,104 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.node_types } 79,052 ( 0.00%) } . . pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> { 272,988 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.node_types } 136,494 ( 0.00%) } . 1,235,652 ( 0.02%) pub fn node_type(&self, id: hir::HirId) -> Ty<'tcx> { 205,942 ( 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))) . }) 1,029,710 ( 0.01%) } . 268,224 ( 0.00%) pub fn node_type_opt(&self, id: hir::HirId) -> Option> { 268,224 ( 0.00%) validate_hir_id_for_typeck_results(self.hir_owner, id); . self.node_types.get(&id.local_id).cloned() 536,448 ( 0.01%) } . . pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, SubstsRef<'tcx>> { 33,350 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.node_substs } 16,675 ( 0.00%) } . 92,720 ( 0.00%) pub fn node_substs(&self, id: hir::HirId) -> SubstsRef<'tcx> { 92,720 ( 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()) 185,440 ( 0.00%) } . 58,709 ( 0.00%) pub fn node_substs_opt(&self, id: hir::HirId) -> Option> { 58,709 ( 0.00%) validate_hir_id_for_typeck_results(self.hir_owner, id); . self.node_substs.get(&id.local_id).cloned() 117,418 ( 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> { 23,308 ( 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> { 246,688 ( 0.00%) self.node_type(expr.hir_id) . } . . pub fn expr_ty_opt(&self, expr: &hir::Expr<'_>) -> Option> { 236,721 ( 0.00%) self.node_type_opt(expr.hir_id) . } . . pub fn adjustments(&self) -> LocalTableInContext<'_, Vec>> { 115,474 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.adjustments } 57,737 ( 0.00%) } . . pub fn adjustments_mut( . &mut self, . ) -> LocalTableInContextMut<'_, Vec>> { 173,808 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.adjustments } 86,904 ( 0.00%) } . 107,958 ( 0.00%) pub fn expr_adjustments(&self, expr: &hir::Expr<'_>) -> &[ty::adjustment::Adjustment<'tcx>] { 215,916 ( 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[..]) 215,916 ( 0.00%) } . . /// Returns the type of `expr`, considering any `Adjustment` . /// entry recorded for that expression. 14,270 ( 0.00%) pub fn expr_ty_adjusted(&self, expr: &hir::Expr<'_>) -> Ty<'tcx> { 2,854 ( 0.00%) self.expr_adjustments(expr).last().map_or_else(|| self.expr_ty(expr), |adj| adj.target) 6,648 ( 0.00%) } . 6,845 ( 0.00%) pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr<'_>) -> Option> { 1,369 ( 0.00%) self.expr_adjustments(expr).last().map(|adj| adj.target).or_else(|| self.expr_ty_opt(expr)) 3,912 ( 0.00%) } . 11,572 ( 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. 23,144 ( 0.00%) if let hir::ExprKind::Path(_) = expr.kind { . return false; . } . 30,080 ( 0.00%) matches!(self.type_dependent_defs().get(expr.hir_id), Some(Ok((DefKind::AssocFn, _)))) 23,144 ( 0.00%) } . 46,365 ( 0.00%) pub fn extract_binding_mode(&self, s: &Session, id: HirId, sp: Span) -> Option { . self.pat_binding_modes().get(id).copied().or_else(|| { . s.delay_span_bug(sp, "missing binding mode"); . None . }) 61,820 ( 0.00%) } . . pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> { 40,133 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.pat_binding_modes } 12,339 ( 0.00%) } . . pub fn pat_binding_modes_mut(&mut self) -> LocalTableInContextMut<'_, BindingMode> { 20,612 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.pat_binding_modes } 10,306 ( 0.00%) } . . pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec>> { 51,576 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.pat_adjustments } 25,788 ( 0.00%) } . . pub fn pat_adjustments_mut(&mut self) -> LocalTableInContextMut<'_, Vec>> { 16,318 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.pat_adjustments } 8,159 ( 0.00%) } . . /// For a given closure, returns the iterator of `ty::CapturedPlace`s that are captured . /// by the closure. 7,212 ( 0.00%) pub fn closure_min_captures_flattened( . &self, . closure_def_id: DefId, . ) -> impl Iterator> { . self.closure_min_captures . .get(&closure_def_id) . .map(|closure_min_captures| closure_min_captures.values().flat_map(|v| v.iter())) . .into_iter() . .flatten() 9,015 ( 0.00%) } . . pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, HirPlace<'tcx>)> { 2,278 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.closure_kind_origins } 1,139 ( 0.00%) } . . pub fn closure_kind_origins_mut( . &mut self, . ) -> LocalTableInContextMut<'_, (Span, HirPlace<'tcx>)> { 4 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.closure_kind_origins } 2 ( 0.00%) } . . pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> { 6,438 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.liberated_fn_sigs } 3,219 ( 0.00%) } . . pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> { 4,160 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.liberated_fn_sigs } 2,080 ( 0.00%) } . . pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec>> { 2,282 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.fru_field_types } 1,141 ( 0.00%) } . . pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec>> { 8 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.fru_field_types } 4 ( 0.00%) } . 474 ( 0.00%) pub fn is_coercion_cast(&self, hir_id: hir::HirId) -> bool { 158 ( 0.00%) validate_hir_id_for_typeck_results(self.hir_owner, hir_id); . self.coercion_casts.contains(&hir_id.local_id) 316 ( 0.00%) } . . pub fn set_coercion_cast(&mut self, id: ItemLocalId) { . self.coercion_casts.insert(id); . } . . pub fn coercion_casts(&self) -> &ItemLocalSet { 1,139 ( 0.00%) &self.coercion_casts 1,139 ( 0.00%) } . } . . impl<'a, 'tcx> HashStable> 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>; . 3,540 ( 0.00%) #[derive(Clone, Debug, TyEncodable, TyDecodable, HashStable, TypeFoldable, Lift)] . pub struct CanonicalUserTypeAnnotation<'tcx> { . pub user_ty: CanonicalUserType<'tcx>, . pub span: Span, 2,027 ( 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. 5,159 ( 0.00%) pub fn is_identity(&self) -> bool { 10,318 ( 0.00%) match self.value { . UserType::Ty(_) => false, . UserType::TypeOf(_, user_substs) => { 5,159 ( 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() { 10,096 ( 0.00%) GenericArgKind::Type(ty) => match ty.kind() { . ty::Bound(debruijn, b) => { . // We only allow a `ty::INNERMOST` index in substitutions. 4,814 ( 0.00%) assert_eq!(*debruijn, ty::INNERMOST); . cvar == b.var . } . _ => false, . }, . 154 ( 0.00%) GenericArgKind::Lifetime(r) => match r { . ty::ReLateBound(debruijn, br) => { . // We only allow a `ty::INNERMOST` index in substitutions. . assert_eq!(*debruijn, ty::INNERMOST); . cvar == br.var . } . _ => false, . }, . -- line 867 ---------------------------------------- -- line 872 ---------------------------------------- . cvar == b . } . _ => false, . }, . } . }) . } . } 10,318 ( 0.00%) } . } . . /// A user-given type annotation attached to a constant. These arise . /// from constants that are named via paths, like `Foo::::new` and . /// so forth. 12,162 ( 0.00%) #[derive(Copy, Clone, Debug, PartialEq, TyEncodable, TyDecodable)] 69,265 ( 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>, . . output_filenames: Arc, . } . . impl<'tcx> TyCtxt<'tcx> { 51,430 ( 0.00%) pub fn typeck_opt_const_arg( . self, . def: ty::WithOptConstParam, . ) -> &'tcx TypeckResults<'tcx> { 20,572 ( 0.00%) if let Some(param_did) = def.const_param_did { . self.typeck_const_arg((def.did, param_did)) . } else { . self.typeck(def.did) . } 41,144 ( 0.00%) } . 3,753 ( 0.00%) pub fn alloc_steal_thir(self, thir: Thir<'tcx>) -> &'tcx Steal> { 1,251 ( 0.00%) self.arena.alloc(Steal::new(thir)) 5,004 ( 0.00%) } . 19,975 ( 0.00%) pub fn alloc_steal_mir(self, mir: Body<'tcx>) -> &'tcx Steal> { 3,995 ( 0.00%) self.arena.alloc(Steal::new(mir)) 27,965 ( 0.00%) } . 5,004 ( 0.00%) pub fn alloc_steal_promoted( . self, . promoted: IndexVec>, . ) -> &'tcx Steal>> { 1,251 ( 0.00%) self.arena.alloc(Steal::new(promoted)) 6,255 ( 0.00%) } . 3,123 ( 0.00%) pub fn alloc_adt_def( . self, . did: DefId, . kind: AdtKind, . variants: IndexVec, . repr: ReprOptions, . ) -> &'tcx ty::AdtDef { 5,552 ( 0.00%) self.intern_adt_def(ty::AdtDef::new(self, did, kind, variants, repr)) 1,388 ( 0.00%) } . . /// Allocates a read-only byte or string literal for `mir::interpret`. 10 ( 0.00%) pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId { . // Create an allocation that just contains these bytes. 2 ( 0.00%) let alloc = interpret::Allocation::from_bytes_byte_aligned_immutable(bytes); 26 ( 0.00%) let alloc = self.intern_const_alloc(alloc); . self.create_memory_alloc(alloc) 10 ( 0.00%) } . . /// 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? 31,904 ( 0.00%) pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound, Bound) { 15,952 ( 0.00%) let attrs = self.get_attrs(def_id); 67,796 ( 0.00%) let get = |name| { 15,952 ( 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); 96 ( 0.00%) if let Some( . &[ . ast::NestedMetaItem::Literal(ast::Lit { 48 ( 0.00%) kind: ast::LitKind::Int(a, _), .. . }), . ], 24 ( 0.00%) ) = 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 . } 79,760 ( 0.00%) }; 23,928 ( 0.00%) ( 23,928 ( 0.00%) get(sym::rustc_layout_scalar_valid_range_start), 11,964 ( 0.00%) get(sym::rustc_layout_scalar_valid_range_end), . ) 31,904 ( 0.00%) } . . pub fn lift>(self, value: T) -> Option { . 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, . arena: &'tcx WorkerLocal>, . 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 }) . } . 707 ( 0.00%) pub fn consider_optimizing String>(self, msg: T) -> bool { 101 ( 0.00%) let cname = self.crate_name(LOCAL_CRATE); 808 ( 0.00%) self.sess.consider_optimizing(cname.as_str(), msg) 808 ( 0.00%) } . . /// Obtain all lang items of this crate and all dependencies (recursively) 2,644,075 ( 0.04%) pub fn lang_items(self) -> &'tcx rustc_hir::lang_items::LanguageItems { . self.get_lang_items(()) 3,399,525 ( 0.05%) } . . /// 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. 616 ( 0.00%) pub fn get_diagnostic_item(self, name: Symbol) -> Option { . self.all_diagnostic_items(()).name_to_id.get(&name).copied() 704 ( 0.00%) } . . /// Obtain the diagnostic item's name 114,569 ( 0.00%) pub fn get_diagnostic_name(self, id: DefId) -> Option { . self.diagnostic_items(id.krate).id_to_name.get(&id).copied() 130,936 ( 0.00%) } . . /// Check whether the diagnostic item with the given `name` has the given `DefId`. 134,862 ( 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) 154,128 ( 0.00%) } . 17,080 ( 0.00%) pub fn stability(self) -> &'tcx stability::Index<'tcx> { . self.stability_index(()) 21,960 ( 0.00%) } . 1,175,958 ( 0.02%) pub fn features(self) -> &'tcx rustc_feature::Features { . self.features_query(()) 1,343,952 ( 0.02%) } . 1 ( 0.00%) pub fn def_key(self, id: DefId) -> rustc_hir::definitions::DefKey { . // Accessing the DefKey is ok, since it is part of DefPathHash. 97,020 ( 0.00%) if let Some(id) = id.as_local() { . self.untracked_resolutions.definitions.def_key(id) . } else { 35,971 ( 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. 9,867 ( 0.00%) if let Some(def_id) = def_id.as_local() { . self.untracked_resolutions.definitions.def_path_hash(def_id) . } else { 336 ( 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 { 98,354 ( 0.00%) &*self.untracked_resolutions.cstore 49,177 ( 0.00%) } . . /// 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> { 207 ( 0.00%) let resolutions = &self.gcx.untracked_resolutions; 1,034 ( 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.) 2,278 ( 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=...` . 3,417 ( 0.00%) if self.features().nll { . return BorrowckMode::Mir; . } . 1,139 ( 0.00%) self.sess.opts.borrowck_mode 4,556 ( 0.00%) } . . /// If `true`, we should use lazy normalization for constants, otherwise . /// we still evaluate them eagerly. . #[inline] . pub fn lazy_normalization(self) -> bool { 989 ( 0.00%) let features = self.features(); . // Note: We only use lazy normalization for generic const expressions. 643 ( 0.00%) features.generic_const_exprs . } . . #[inline] . pub fn local_crate_exports_generics(self) -> bool { . debug_assert!(self.sess.opts.share_generics()); . . self.sess.crate_types().iter().any(|crate_type| { . match crate_type { -- line 1442 ---------------------------------------- -- 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")`). 7,348 ( 0.00%) pub fn article_and_description(self, def_id: DefId) -> (&'static str, &'static str) { 5,344 ( 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"), . }, 12,024 ( 0.00%) def_kind => (def_kind.article(), def_kind.descr(def_id)), . } 6,012 ( 0.00%) } . . pub fn type_length_limit(self) -> Limit { . self.limits(()).type_length_limit . } . 869,652 ( 0.01%) pub fn recursion_limit(self) -> Limit { . self.limits(()).recursion_limit 993,888 ( 0.01%) } . . pub fn move_size_limit(self) -> Limit { . self.limits(()).move_size_limit . } . 1,484 ( 0.00%) pub fn const_eval_limit(self) -> Limit { . self.limits(()).const_eval_limit 1,696 ( 0.00%) } . . pub fn all_traits(self) -> impl Iterator + '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>, . . /// 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>>, -- 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 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 R, R>(value: usize, f: F) -> R { . let old = get_tlv(); 193,170 ( 0.00%) 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: F) -> R . where . F: for<'a, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'tcx>>) -> R, . { . let context = get_tlv(); 750,998 ( 0.01%) if context == 0 { . f(None) . } else { . // We could get an `ImplicitCtxt` pointer from another thread. . // Ensure that `ImplicitCtxt` is `Sync`. . sync::assert_sync::>(); . . 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 { 369,704 ( 0.01%) assert!(ptr_eq(context.tcx.gcx, tcx.gcx)); . let context: &ImplicitCtxt<'_, '_> = mem::transmute(context); 369,424 ( 0.01%) f(context) . }) . } . . /// Allows access to the `TyCtxt` in the current `ImplicitCtxt`. . /// Panics if there is no `ImplicitCtxt` available. . #[inline] . pub fn with(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> for Interned<'tcx, TyS<'tcx>> { . fn borrow<'a>(&'a self) -> &'a TyKind<'tcx> { 1,035,163 ( 0.02%) &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(&self, s: &mut H) { . // The `Borrow` trait requires that `x.borrow().hash(s) == x.hash(s)`. 688,116 ( 0.01%) self.0.kind().hash(s) . } . } . . impl<'tcx> Borrow>> for Interned<'tcx, PredicateInner<'tcx>> { . fn borrow<'a>(&'a self) -> &'a Binder<'tcx, PredicateKind<'tcx>> { 287,224 ( 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(&self, s: &mut H) { . // The `Borrow` trait requires that `x.borrow().hash(s) == x.hash(s)`. 114,684 ( 0.00%) self.0.kind.hash(s) . } . } . . impl<'tcx, T> Borrow<[T]> for Interned<'tcx, List> { . fn borrow<'a>(&'a self) -> &'a [T] { 906,081 ( 0.01%) &self.0[..] . } . } . . impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List> { . fn eq(&self, other: &Interned<'tcx, List>) -> 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> {} . . impl<'tcx, T: Hash> Hash for Interned<'tcx, List> { . fn hash(&self, s: &mut H) { . // The `Borrow` trait requires that `x.borrow().hash(s) == x.hash(s)`. 176,708 ( 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 { 377,276 ( 0.01%) &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(&self, s: &mut H) { . // The `Borrow` trait requires that `x.borrow().hash(s) == . // x.hash(s)`. 71,182 ( 0.00%) self.0.hash(s) . } . } . . impl<'tcx> TyCtxt<'tcx> { 3,134,613 ( 0.05%) pub fn $method(self, v: $ty) -> &'tcx $ty { 1,626,069 ( 0.02%) self.interners.$name.intern(v, |v| { 18,164 ( 0.00%) Interned(self.interners.arena.alloc(v)) . }).0 3,524,076 ( 0.05%) } . })+ . } . } . . 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> { 10,295,229 ( 0.15%) $(pub fn $method(self, v: &[$ty]) -> &'tcx List<$ty> { . self.interners.$field.intern_ref(v, || { . Interned(List::from_arena(&*self.arena, v)) . }).0 9,201,636 ( 0.13%) })+ . } . ); . } . . 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 2129 ---------------------------------------- . /// unsafe. . pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> { . assert_eq!(sig.unsafety(), hir::Unsafety::Normal); . self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig { unsafety: hir::Unsafety::Unsafe, ..sig })) . } . . /// Given the def_id of a Trait `trait_def_id` and the name of an associated item `assoc_name` . /// returns true if the `trait_def_id` defines an associated item of name `assoc_name`. 12 ( 0.00%) pub fn trait_may_define_assoc_type(self, trait_def_id: DefId, assoc_name: Ident) -> bool { . self.super_traits_of(trait_def_id).any(|trait_did| { . self.associated_items(trait_did) . .find_by_name_and_kind(self, assoc_name, ty::AssocKind::Type, trait_did) . .is_some() . }) 9 ( 0.00%) } . . /// Computes the def-ids of the transitive supertraits of `trait_def_id`. This (intentionally) . /// does not compute the full elaborated super-predicates but just the set of def-ids. It is used . /// to identify which traits may define a given associated type to help avoid cycle errors. . /// Returns a `DefId` iterator. . fn super_traits_of(self, trait_def_id: DefId) -> impl Iterator + 'tcx { . let mut set = FxHashSet::default(); 2 ( 0.00%) let mut stack = vec![trait_def_id]; . . set.insert(trait_def_id); . 9 ( 0.00%) iter::from_fn(move || -> Option { 6 ( 0.00%) let trait_did = stack.pop()?; 3 ( 0.00%) let generic_predicates = self.super_predicates_of(trait_did); . . for (predicate, _) in generic_predicates.predicates { 6 ( 0.00%) if let ty::PredicateKind::Trait(data) = predicate.kind().skip_binder() { 4 ( 0.00%) if set.insert(data.def_id()) { . stack.push(data.def_id()); . } . } . } . . Some(trait_did) . }) . } -- line 2169 ---------------------------------------- -- 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> { 372,948 ( 0.01%) 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> { 8,057,391 ( 0.12%) self.interners.intern_ty(st) . } . . #[inline] . pub fn mk_predicate(self, binder: Binder<'tcx, PredicateKind<'tcx>>) -> Predicate<'tcx> { 4,123,538 ( 0.06%) let inner = self.interners.intern_predicate(binder); . Predicate { inner } . } . . #[inline] 3,213,256 ( 0.05%) pub fn reuse_or_mk_predicate( . self, . pred: Predicate<'tcx>, . binder: Binder<'tcx, PredicateKind<'tcx>>, . ) -> Predicate<'tcx> { 210,142 ( 0.00%) if pred.kind() != binder { self.mk_predicate(binder) } else { pred } 3,213,256 ( 0.05%) } . . pub fn mk_mach_int(self, tm: IntTy) -> Ty<'tcx> { 1,172 ( 0.00%) 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, . } 1,172 ( 0.00%) } . . pub fn mk_mach_uint(self, tm: UintTy) -> Ty<'tcx> { 3,926 ( 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, . } 3,926 ( 0.00%) } . . pub fn mk_mach_float(self, tm: FloatTy) -> Ty<'tcx> { 38 ( 0.00%) match tm { . FloatTy::F32 => self.types.f32, . FloatTy::F64 => self.types.f64, . } 38 ( 0.00%) } . . #[inline] . pub fn mk_static_str(self) -> Ty<'tcx> { 3,988 ( 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)) . } . . #[inline] . pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> { . self.mk_ty(Foreign(def_id)) . } . 600 ( 0.00%) fn mk_generic_adt(self, wrapper_def_id: DefId, ty_param: Ty<'tcx>) -> Ty<'tcx> { . let adt_def = self.adt_def(wrapper_def_id); . let substs = 1,125 ( 0.00%) InternalSubsts::for_item(self, wrapper_def_id, |param, substs| match param.kind { . GenericParamDefKind::Lifetime | GenericParamDefKind::Const { .. } => bug!(), 75 ( 0.00%) GenericParamDefKind::Type { has_default, .. } => { 300 ( 0.00%) if param.index == 0 { . ty_param.into() . } else { 75 ( 0.00%) assert!(has_default); 225 ( 0.00%) self.type_of(param.def_id).subst(self, substs).into() . } . } . }); 75 ( 0.00%) self.mk_ty(Adt(adt_def, substs)) 600 ( 0.00%) } . . #[inline] . pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> { 375 ( 0.00%) let def_id = self.require_lang_item(LangItem::OwnedBox, None); 825 ( 0.00%) self.mk_generic_adt(def_id, ty) . } . . #[inline] . pub fn mk_lang_item(self, ty: Ty<'tcx>, item: LangItem) -> Option> { . let def_id = self.lang_items().require(item).ok()?; . Some(self.mk_generic_adt(def_id, ty)) . } . -- line 2293 ---------------------------------------- -- line 2329 ---------------------------------------- . } . . #[inline] . pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> { . self.mk_ptr(TypeAndMut { ty, mutbl: hir::Mutability::Not }) . } . . #[inline] 18,566 ( 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))) 19,376 ( 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> { 2,312 ( 0.00%) let kinds: Vec<_> = ts.iter().map(|&t| GenericArg::from(t)).collect(); 4,609 ( 0.00%) self.mk_ty(Tuple(self.intern_substs(&kinds))) . } . . pub fn mk_tup], Ty<'tcx>>>(self, iter: I) -> I::Output { 78,972 ( 0.00%) iter.intern_with(|ts| { 40,537 ( 0.00%) let kinds: Vec<_> = ts.iter().map(|&t| GenericArg::from(t)).collect(); 98,310 ( 0.00%) self.mk_ty(Tuple(self.intern_substs(&kinds))) 71,010 ( 0.00%) }) . } . . #[inline] . pub fn mk_unit(self) -> Ty<'tcx> { 2,260 ( 0.00%) self.types.unit . } . . #[inline] . pub fn mk_diverging_default(self) -> Ty<'tcx> { 176 ( 0.00%) 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> { 11,130 ( 0.00%) self.mk_ty(FnPtr(fty)) . } . . #[inline] . pub fn mk_dynamic( . self, . obj: &'tcx List>>, . reg: ty::Region<'tcx>, . ) -> Ty<'tcx> { -- line 2384 ---------------------------------------- -- line 2412 ---------------------------------------- . . #[inline] . pub fn mk_ty_var(self, v: TyVid) -> Ty<'tcx> { . self.mk_ty_infer(TyVar(v)) . } . . #[inline] . pub fn mk_const_var(self, v: ConstVid<'tcx>, ty: Ty<'tcx>) -> &'tcx Const<'tcx> { 4,314 ( 0.00%) self.mk_const(ty::Const { val: ty::ConstKind::Infer(InferConst::Var(v)), ty }) . } . . #[inline] . pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> { . self.mk_ty_infer(IntVar(v)) . } . . #[inline] -- line 2428 ---------------------------------------- -- 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 }) . } . 24,297 ( 0.00%) pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> GenericArg<'tcx> { 13,391 ( 0.00%) match param.kind { . GenericParamDefKind::Lifetime => { 11,892 ( 0.00%) self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into() . } 2,978 ( 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() . } . } 24,297 ( 0.00%) } . . #[inline] . pub fn mk_opaque(self, def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> { . self.mk_ty(Opaque(def_id, substs)) . } . 657 ( 0.00%) pub fn mk_place_field(self, place: Place<'tcx>, f: Field, ty: Ty<'tcx>) -> Place<'tcx> { 657 ( 0.00%) self.mk_place_elem(place, PlaceElem::Field(f, ty)) 1,314 ( 0.00%) } . 50 ( 0.00%) pub fn mk_place_deref(self, place: Place<'tcx>) -> Place<'tcx> { 150 ( 0.00%) self.mk_place_elem(place, PlaceElem::Deref) 100 ( 0.00%) } . 40 ( 0.00%) pub fn mk_place_downcast( . self, . place: Place<'tcx>, . adt_def: &'tcx AdtDef, . variant_index: VariantIdx, . ) -> Place<'tcx> { 40 ( 0.00%) self.mk_place_elem( . place, 80 ( 0.00%) PlaceElem::Downcast(Some(adt_def.variants[variant_index].name), variant_index), . ) 80 ( 0.00%) } . 15 ( 0.00%) pub fn mk_place_downcast_unnamed( . self, . place: Place<'tcx>, . variant_index: VariantIdx, . ) -> Place<'tcx> { 15 ( 0.00%) self.mk_place_elem(place, PlaceElem::Downcast(None, variant_index)) 30 ( 0.00%) } . . pub fn mk_place_index(self, place: Place<'tcx>, index: Local) -> Place<'tcx> { . self.mk_place_elem(place, PlaceElem::Index(index)) . } . . /// This method copies `Place`'s projection, add an element and reintern it. Should not be used . /// to build a full `Place` it's just a convenient way to grab a projection and modify it in . /// flight. 6,975 ( 0.00%) 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) } 7,750 ( 0.00%) } . 14,063 ( 0.00%) pub fn intern_poly_existential_predicates( . self, . eps: &[ty::Binder<'tcx, ExistentialPredicate<'tcx>>], . ) -> &'tcx List>> { 2,009 ( 0.00%) assert!(!eps.is_empty()); . assert!( . eps.array_windows() 3,875 ( 0.00%) .all(|[a, b]| a.skip_binder().stable_cmp(self, &b.skip_binder()) . != Ordering::Greater) . ); 8,036 ( 0.00%) self._intern_poly_existential_predicates(eps) 16,072 ( 0.00%) } . . pub fn intern_predicates(self, preds: &[Predicate<'tcx>]) -> &'tcx List> { . // FIXME consider asking the input slice to be sorted to avoid . // re-interning permutations, in which case that would be asserted . // here. 18,123 ( 0.00%) if preds.is_empty() { . // The macro-generated method below asserts we don't intern an empty slice. . List::empty() . } else { 3,883 ( 0.00%) self._intern_predicates(preds) . } 28,600 ( 0.00%) } . . pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List> { 168,651 ( 0.00%) if ts.is_empty() { List::empty() } else { self._intern_type_list(ts) } 770 ( 0.00%) } . . pub fn intern_substs(self, ts: &[GenericArg<'tcx>]) -> &'tcx List> { 1,689,001 ( 0.02%) if ts.is_empty() { List::empty() } else { self._intern_substs(ts) } 165,696 ( 0.00%) } . . pub fn intern_projs(self, ps: &[ProjectionKind]) -> &'tcx List { . if ps.is_empty() { List::empty() } else { self._intern_projs(ps) } . } . . pub fn intern_place_elems(self, ts: &[PlaceElem<'tcx>]) -> &'tcx List> { 49,285 ( 0.00%) if ts.is_empty() { List::empty() } else { self._intern_place_elems(ts) } 25,226 ( 0.00%) } . . pub fn intern_canonical_var_infos( . self, . ts: &[CanonicalVarInfo<'tcx>], . ) -> CanonicalVarInfos<'tcx> { 103,513 ( 0.00%) if ts.is_empty() { List::empty() } else { self._intern_canonical_var_infos(ts) } 3,650 ( 0.00%) } . . pub fn intern_bound_variable_kinds( . self, . ts: &[ty::BoundVariableKind], . ) -> &'tcx List { 18,453 ( 0.00%) if ts.is_empty() { List::empty() } else { self._intern_bound_variable_kinds(ts) } 24,870 ( 0.00%) } . . pub fn mk_fn_sig( . self, . inputs: I, . output: I::Item, . c_variadic: bool, . unsafety: hir::Unsafety, . abi: abi::Abi, . ) -> , ty::FnSig<'tcx>>>::Output . where . I: Iterator, ty::FnSig<'tcx>>>, . { . inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig { 8,600 ( 0.00%) inputs_and_output: self.intern_type_list(xs), 1,512 ( 0.00%) c_variadic, 2,148 ( 0.00%) unsafety, 1,752 ( 0.00%) abi, 1,080 ( 0.00%) }) . } . . pub fn mk_poly_existential_predicates< . I: InternAs< . [ty::Binder<'tcx, ExistentialPredicate<'tcx>>], . &'tcx List>>, . >, . >( . self, . iter: I, . ) -> I::Output { 7,770 ( 0.00%) iter.intern_with(|xs| self.intern_poly_existential_predicates(xs)) . } . . pub fn mk_predicates], &'tcx List>>>( . self, . iter: I, . ) -> I::Output { 22 ( 0.00%) iter.intern_with(|xs| self.intern_predicates(xs)) . } . . pub fn mk_type_list], &'tcx List>>>(self, iter: I) -> I::Output { 14,576 ( 0.00%) iter.intern_with(|xs| self.intern_type_list(xs)) . } . . pub fn mk_substs], &'tcx List>>>( . self, . iter: I, . ) -> I::Output { 913,276 ( 0.01%) iter.intern_with(|xs| self.intern_substs(xs)) . } . . pub fn mk_place_elems], &'tcx List>>>( . self, . iter: I, . ) -> I::Output { 46,124 ( 0.00%) iter.intern_with(|xs| self.intern_place_elems(xs)) . } . 91,331 ( 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())) 182,662 ( 0.00%) } . . pub fn mk_bound_variable_kinds< . I: InternAs<[ty::BoundVariableKind], &'tcx List>, . >( . self, . iter: I, . ) -> I::Output { 85,936 ( 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. 700,756 ( 0.01%) pub fn maybe_lint_level_root_bounded(self, mut id: HirId, bound: HirId) -> HirId { 700,756 ( 0.01%) let hir = self.hir(); . loop { 1,844,340 ( 0.03%) if id == bound { . return bound; . } . 2,598,079 ( 0.04%) 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); 1,544,016 ( 0.02%) if next == id { . bug!("lint traversal reached the root of the crate"); . } . id = next; . } 1,001,080 ( 0.01%) } . 19,832 ( 0.00%) pub fn lint_level_at_node( . self, . lint: &'static Lint, . mut id: hir::HirId, . ) -> (Level, LintLevelSource) { . let sets = self.lint_levels(()); . loop { 110,315 ( 0.00%) if let Some(pair) = sets.level_and_source(lint, id, self.sess) { . return pair; . } 8,401 ( 0.00%) let next = self.hir().get_parent_node(id); 25,203 ( 0.00%) if next == id { . bug!("lint traversal reached the root of the crate"); . } . id = next; . } 19,832 ( 0.00%) } . 868 ( 0.00%) pub fn struct_span_lint_hir( . self, . lint: &'static Lint, . hir_id: HirId, . span: impl Into, . decorate: impl for<'a> FnOnce(LintDiagnosticBuilder<'a>), . ) { 4,103 ( 0.00%) let (level, src) = self.lint_level_at_node(lint, hir_id); 1,291 ( 0.00%) struct_lint_level(self.sess, lint, level, src, Some(span.into()), decorate); 496 ( 0.00%) } . . 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); . } . 34,531 ( 0.00%) pub fn in_scope_traits(self, id: HirId) -> Option<&'tcx [TraitCandidate]> { 9,866 ( 0.00%) let map = self.in_scope_traits_map(id.owner)?; . let candidates = map.get(&id.local_id)?; 9,866 ( 0.00%) Some(&*candidates) 39,464 ( 0.00%) } . 40,579 ( 0.00%) pub fn named_region(self, id: HirId) -> Option { . debug!(?id, "named_region"); . self.named_region_map(id.owner).and_then(|map| map.get(&id.local_id).cloned()) 52,173 ( 0.00%) } . 4,401 ( 0.00%) pub fn is_late_bound(self, id: HirId) -> bool { . self.is_late_bound_map(id.owner) 187 ( 0.00%) .map_or(false, |(owner, set)| owner == id.owner && set.contains(&id.local_id)) 3,912 ( 0.00%) } . 26,607 ( 0.00%) pub fn object_lifetime_defaults(self, id: HirId) -> Option> { . self.object_lifetime_defaults_map(id.owner) 34,209 ( 0.00%) } . 17,280 ( 0.00%) pub fn late_bound_vars(self, id: HirId) -> &'tcx List { . 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(), . ) 17,280 ( 0.00%) } . . pub fn lifetime_scope(self, id: HirId) -> Option { . 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 1,320 ( 0.00%) pub fn is_const_fn(self, def_id: DefId) -> bool { 132 ( 0.00%) if self.is_const_fn_raw(def_id) { 55 ( 0.00%) match self.lookup_const_stability(def_id) { 60 ( 0.00%) Some(stability) if stability.level.is_unstable() => { . // has a `rustc_const_unstable` attribute, check whether the user enabled the . // corresponding feature gate. 6 ( 0.00%) 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 . } 1,188 ( 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 InternAs<[T], R> for I . where . E: InternIteratorElement, . I: Iterator, . { . type Output = E::Output; 150,616 ( 0.00%) fn intern_with(self, f: F) -> Self::Output . where . F: FnOnce(&[T]) -> R, . { 4,130,572 ( 0.06%) E::intern_with(self, f) 138,150 ( 0.00%) } . } . . pub trait InternIteratorElement: Sized { . type Output; . fn intern_with, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output; . } . . impl InternIteratorElement for T { . type Output = R; 489,089 ( 0.01%) fn intern_with, 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`. 632,488 ( 0.01%) match iter.size_hint() { . (0, Some(0)) => { 6 ( 0.00%) assert!(iter.next().is_none()); . f(&[]) . } . (1, Some(1)) => { . let t0 = iter.next().unwrap(); 75 ( 0.00%) assert!(iter.next().is_none()); 98,144 ( 0.00%) f(&[t0]) . } . (2, Some(2)) => { . let t0 = iter.next().unwrap(); . let t1 = iter.next().unwrap(); 764 ( 0.00%) assert!(iter.next().is_none()); 69,669 ( 0.00%) f(&[t0, t1]) . } 3,072 ( 0.00%) _ => f(&iter.collect::>()), . } 532,495 ( 0.01%) } . } . . impl<'a, T, R> InternIteratorElement for &'a T . where . T: Clone + 'a, . { . type Output = R; 11,207 ( 0.00%) fn intern_with, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output { . // This code isn't hot. 432 ( 0.00%) f(&iter.cloned().collect::>()) 9,356 ( 0.00%) } . } . . impl InternIteratorElement for Result { . type Output = Result; 1,521,256 ( 0.02%) fn intern_with, 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. 1,161,054 ( 0.02%) Ok(match iter.size_hint() { . (0, Some(0)) => { . assert!(iter.next().is_none()); . f(&[]) . } . (1, Some(1)) => { 4,618 ( 0.00%) let t0 = iter.next().unwrap()?; 357 ( 0.00%) assert!(iter.next().is_none()); 66,851 ( 0.00%) f(&[t0]) . } . (2, Some(2)) => { 2,894 ( 0.00%) let t0 = iter.next().unwrap()?; 2,894 ( 0.00%) let t1 = iter.next().unwrap()?; 3,216 ( 0.00%) assert!(iter.next().is_none()); 115,398 ( 0.00%) f(&[t0, t1]) . } 54,681 ( 0.00%) _ => f(&iter.collect::, _>>()?), . }) 1,720,027 ( 0.03%) } . } . . // We are comparing types with different invariant lifetimes, so `ptr::eq` . // won't work for us. . fn ptr_eq(t: *const T, u: *const U) -> bool { 369,704 ( 0.01%) 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()) . }; . 20 ( 0.00%) providers.lookup_stability = |tcx, id| tcx.stability().local_stability(id.expect_local()); 2 ( 0.00%) providers.lookup_const_stability = 72 ( 0.00%) |tcx, id| tcx.stability().local_const_stability(id.expect_local()); 2 ( 0.00%) providers.lookup_deprecation_entry = 19,432 ( 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()) . }; . } 3,803,008 ( 0.06%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/ops/function.rs -------------------------------------------------------------------------------- Ir -- line 62 ---------------------------------------- . message = "expected a `{Fn}<{Args}>` closure, found `{Self}`", . label = "expected an `Fn<{Args}>` closure, found `{Self}`" . )] . #[fundamental] // so that regex can rely that `&str: !FnMut` . #[must_use = "closures are lazy and do nothing unless called"] . pub trait Fn: FnMut { . /// Performs the call operation. . #[unstable(feature = "fn_traits", issue = "29625")] 6,808 ( 0.00%) extern "rust-call" fn call(&self, args: Args) -> Self::Output; . } . . /// The version of the call operator that takes a mutable receiver. . /// . /// Instances of `FnMut` can be called repeatedly and may mutate state. . /// . /// `FnMut` is implemented automatically by closures which take mutable . /// references to captured variables, as well as all types that implement -- line 78 ---------------------------------------- -- line 142 ---------------------------------------- . message = "expected a `{FnMut}<{Args}>` closure, found `{Self}`", . label = "expected an `FnMut<{Args}>` closure, found `{Self}`" . )] . #[fundamental] // so that regex can rely that `&str: !FnMut` . #[must_use = "closures are lazy and do nothing unless called"] . pub trait FnMut: FnOnce { . /// Performs the call operation. . #[unstable(feature = "fn_traits", issue = "29625")] 289,309 ( 0.00%) extern "rust-call" fn call_mut(&mut self, args: Args) -> Self::Output; . } . . /// The version of the call operator that takes a by-value receiver. . /// . /// Instances of `FnOnce` can be called, but might not be callable multiple . /// times. Because of this, if the only thing known about a type is that it . /// implements `FnOnce`, it can only be called once. . /// -- line 158 ---------------------------------------- -- line 219 ---------------------------------------- . pub trait FnOnce { . /// The returned type after the call operator is used. . #[lang = "fn_once_output"] . #[stable(feature = "fn_once_output", since = "1.12.0")] . type Output; . . /// Performs the call operation. . #[unstable(feature = "fn_traits", issue = "29625")] 1,546,107 ( 0.02%) extern "rust-call" fn call_once(self, args: Args) -> Self::Output; . } . . mod impls { . #[stable(feature = "rust1", since = "1.0.0")] . impl Fn for &F . where . F: Fn, . { . extern "rust-call" fn call(&self, args: A) -> F::Output { 4 ( 0.00%) (**self).call(args) . } . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl FnMut for &F . where . F: Fn, . { -- line 245 ---------------------------------------- -- line 251 ---------------------------------------- . #[stable(feature = "rust1", since = "1.0.0")] . impl FnOnce for &F . where . F: Fn, . { . type Output = F::Output; . . extern "rust-call" fn call_once(self, args: A) -> F::Output { 2 ( 0.00%) (*self).call(args) . } . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl FnMut for &mut F . where . F: FnMut, . { 177,250 ( 0.00%) extern "rust-call" fn call_mut(&mut self, args: A) -> F::Output { 1,759,424 ( 0.03%) (*self).call_mut(args) 214,830 ( 0.00%) } . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl FnOnce for &mut F . where . F: FnMut, . { . type Output = F::Output; 5,714,438 ( 0.08%) extern "rust-call" fn call_once(self, args: A) -> F::Output { 587,183 ( 0.01%) (*self).call_mut(args) 7,437,357 ( 0.11%) } . } . } 262,642 ( 0.00%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_const_eval/src/interpret/visitor.rs -------------------------------------------------------------------------------- Ir -- line 70 ---------------------------------------- . } . . #[inline(always)] . fn project_field( . &self, . ecx: &InterpCx<'mir, 'tcx, M>, . field: usize, . ) -> InterpResult<'tcx, Self> { 111 ( 0.00%) ecx.operand_field(self, field) . } . } . . impl<'mir, 'tcx: 'mir, M: Machine<'mir, 'tcx>> Value<'mir, 'tcx, M> . for MPlaceTy<'tcx, M::PointerTag> . { . #[inline(always)] . fn layout(&self) -> TyAndLayout<'tcx> { -- line 86 ---------------------------------------- -- line 87 ---------------------------------------- . self.layout . } . . #[inline(always)] . fn to_op( . &self, . _ecx: &InterpCx<'mir, 'tcx, M>, . ) -> InterpResult<'tcx, OpTy<'tcx, M::PointerTag>> { 6 ( 0.00%) Ok((*self).into()) . } . . #[inline(always)] . fn from_mem_place(mplace: MPlaceTy<'tcx, M::PointerTag>) -> Self { . mplace . } . . #[inline(always)] -- line 103 ---------------------------------------- -- line 170 ---------------------------------------- . /// we are descending through. . #[inline(always)] . fn visit_field( . &mut self, . _old_val: &Self::V, . _field: usize, . new_val: &Self::V, . ) -> InterpResult<'tcx> { 3,145,832 ( 0.05%) self.visit_value(new_val) . } . /// Called when recursing into an enum variant. . /// This gives the visitor the chance to track the stack of nested fields that . /// we are descending through. . #[inline(always)] . fn visit_variant( . &mut self, . _old_val: &Self::V, . _variant: VariantIdx, . new_val: &Self::V, . ) -> InterpResult<'tcx> { . self.visit_value(new_val) . } . . // Default recursors. Not meant to be overloaded. 262 ( 0.00%) fn walk_aggregate( . &mut self, . v: &Self::V, . fields: impl Iterator>, . ) -> InterpResult<'tcx> { . // Now iterate over it. 328 ( 0.00%) for (idx, field_val) in fields.enumerate() { 11,535,297 ( 0.17%) self.visit_field(v, idx, &field_val?)?; . } . Ok(()) 295 ( 0.00%) } 324 ( 0.00%) fn walk_value(&mut self, v: &Self::V) -> InterpResult<'tcx> . { . trace!("walk_value: type: {}", v.layout().ty); . . // Special treatment for special types, where the (static) layout is not sufficient. 3,146,340 ( 0.05%) match *v.layout().ty.kind() { . // If it is a trait object, switch to the real type that was used to create it. . ty::Dynamic(..) => { . // immediate trait objects are not a thing . let op = v.to_op(self.ecx())?; . let dest = op.assert_mem_place(); . let inner = self.ecx().unpack_dyn_trait(&dest)?.1; . trace!("walk_value: dyn object layout: {:#?}", inner.layout); . // recurse with the inner type -- line 218 ---------------------------------------- -- line 220 ---------------------------------------- . }, . // Slices do not need special handling here: they have `Array` field . // placement with length 0, so we enter the `Array` case below which . // indirectly uses the metadata to determine the actual length. . _ => {}, . }; . . // Visit the fields of this value. 3,146,442 ( 0.05%) match v.layout().fields { . FieldsShape::Primitive => {}, . FieldsShape::Union(fields) => { . self.visit_union(v, fields)?; . }, . FieldsShape::Arbitrary { ref offsets, .. } => { . // FIXME: We collect in a vec because otherwise there are lifetime . // errors: Projecting to a field needs access to `ecx`. . let fields: Vec> = 62 ( 0.00%) (0..offsets.len()).map(|i| { 74 ( 0.00%) v.project_field(self.ecx(), i) . }) . .collect(); . self.visit_aggregate(v, fields.into_iter())?; . }, . FieldsShape::Array { .. } => { . // Let's get an mplace first. 30 ( 0.00%) let op = v.to_op(self.ecx())?; . let mplace = op.assert_mem_place(); . // Now we can go over all the fields. . // This uses the *run-time length*, i.e., if we are a slice, . // the dynamic info from the metadata is used. 24 ( 0.00%) let iter = self.ecx().mplace_array_fields(&mplace)? . .map(|f| f.and_then(|f| { . Ok(Value::from_mem_place(f)) . })); . self.visit_aggregate(v, iter)?; . } . } . 3,146,304 ( 0.05%) match v.layout().variants { . // If this is a multi-variant layout, find the right variant and proceed . // with *its* fields. . Variants::Multiple { .. } => { . let op = v.to_op(self.ecx())?; . let idx = self.read_discriminant(&op)?; . let inner = v.project_downcast(self.ecx(), idx)?; . trace!("walk_value: variant layout: {:#?}", inner.layout()); . // recurse with the inner type . self.visit_variant(v, idx, &inner) . } . // For single-variant layouts, we already did anything there is to do. . Variants::Single { .. } => Ok(()) . } 324 ( 0.00%) } . } . } . } . . make_value_visitor!(ValueVisitor,); . make_value_visitor!(MutValueVisitor, mut); 183 ( 0.00%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/alloc/src/vec/into_iter.rs -------------------------------------------------------------------------------- Ir -- line 51 ---------------------------------------- . /// let vec = vec!['a', 'b', 'c']; . /// let mut into_iter = vec.into_iter(); . /// assert_eq!(into_iter.as_slice(), &['a', 'b', 'c']); . /// let _ = into_iter.next().unwrap(); . /// assert_eq!(into_iter.as_slice(), &['b', 'c']); . /// ``` . #[stable(feature = "vec_into_iter_as_slice", since = "1.15.0")] . pub fn as_slice(&self) -> &[T] { 101,558 ( 0.00%) unsafe { slice::from_raw_parts(self.ptr, self.len()) } . } . . /// Returns the remaining items of this iterator as a mutable slice. . /// . /// # Examples . /// . /// ``` . /// let vec = vec!['a', 'b', 'c']; -- line 67 ---------------------------------------- -- line 80 ---------------------------------------- . /// Returns a reference to the underlying allocator. . #[unstable(feature = "allocator_api", issue = "32838")] . #[inline] . pub fn allocator(&self) -> &A { . &self.alloc . } . . fn as_raw_mut_slice(&mut self) -> *mut [T] { 2,083,115 ( 0.03%) ptr::slice_from_raw_parts_mut(self.ptr as *mut T, self.len()) . } . . /// Drops remaining elements and relinquishes the backing allocation. . /// . /// This is roughly equivalent to the following, but more efficient . /// . /// ``` . /// # let mut into_iter = Vec::::with_capacity(10).into_iter(); -- line 96 ---------------------------------------- -- line 99 ---------------------------------------- . /// ``` . #[cfg(not(no_global_oom_handling))] . pub(super) fn forget_allocation_drop_remaining(&mut self) { . let remaining = self.as_raw_mut_slice(); . . // overwrite the individual fields instead of creating a new . // struct and then overwriting &mut self. . // this creates less assembly 4,243 ( 0.00%) self.cap = 0; 8,486 ( 0.00%) self.buf = unsafe { NonNull::new_unchecked(RawVec::NEW.ptr()) }; 5,571 ( 0.00%) self.ptr = self.buf.as_ptr(); 5,494 ( 0.00%) self.end = self.buf.as_ptr(); . . unsafe { . ptr::drop_in_place(remaining); . } . } . } . . #[stable(feature = "vec_intoiter_as_ref", since = "1.46.0")] -- line 118 ---------------------------------------- -- line 128 ---------------------------------------- . unsafe impl Sync for IntoIter {} . . #[stable(feature = "rust1", since = "1.0.0")] . impl Iterator for IntoIter { . type Item = T; . . #[inline] . fn next(&mut self) -> Option { 5,076,107 ( 0.07%) if self.ptr as *const _ == self.end { 315,761 ( 0.00%) None 133 ( 0.00%) } else if mem::size_of::() == 0 { . // purposefully don't use 'ptr.offset' because for . // vectors with 0-size elements this would return the . // same pointer. . self.ptr = unsafe { arith_offset(self.ptr as *const i8, 1) as *mut T }; . . // Make up a value of this ZST. . Some(unsafe { mem::zeroed() }) . } else { . let old = self.ptr; 501,006 ( 0.01%) self.ptr = unsafe { self.ptr.offset(1) }; . 320,960 ( 0.00%) Some(unsafe { ptr::read(old) }) . } 8 ( 0.00%) } . . #[inline] . fn size_hint(&self) -> (usize, Option) { . let exact = if mem::size_of::() == 0 { . (self.end as usize).wrapping_sub(self.ptr as usize) . } else { . unsafe { self.end.offset_from(self.ptr) as usize } . }; 3 ( 0.00%) (exact, Some(exact)) . } . . #[inline] . fn advance_by(&mut self, n: usize) -> Result<(), usize> { . let step_size = self.len().min(n); . let to_drop = ptr::slice_from_raw_parts_mut(self.ptr as *mut T, step_size); . if mem::size_of::() == 0 { . // SAFETY: due to unchecked casts of unsigned amounts to signed offsets the wraparound -- line 169 ---------------------------------------- -- line 181 ---------------------------------------- . if step_size < n { . return Err(step_size); . } . Ok(()) . } . . #[inline] . fn count(self) -> usize { 2 ( 0.00%) self.len() . } . . #[doc(hidden)] . unsafe fn __iterator_get_unchecked(&mut self, i: usize) -> Self::Item . where . Self: TrustedRandomAccessNoCoerce, . { . // SAFETY: the caller must guarantee that `i` is in bounds of the -- line 197 ---------------------------------------- -- line 207 ---------------------------------------- . } . } . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl DoubleEndedIterator for IntoIter { . #[inline] . fn next_back(&mut self) -> Option { 207,303 ( 0.00%) if self.end == self.ptr { . None . } else if mem::size_of::() == 0 { . // See above for why 'ptr.offset' isn't used . self.end = unsafe { arith_offset(self.end as *const i8, -1) as *mut T }; . . // Make up a value of this ZST. . Some(unsafe { mem::zeroed() }) . } else { 39,552 ( 0.00%) self.end = unsafe { self.end.offset(-1) }; . 13,405 ( 0.00%) Some(unsafe { ptr::read(self.end) }) . } . } . . #[inline] . fn advance_back_by(&mut self, n: usize) -> Result<(), usize> { . let step_size = self.len().min(n); . if mem::size_of::() == 0 { . // SAFETY: same as for advance_by() -- line 234 ---------------------------------------- -- line 295 ---------------------------------------- . #[cfg(test)] . fn clone(&self) -> Self { . crate::slice::to_vec(self.as_slice(), self.alloc.clone()).into_iter() . } . } . . #[stable(feature = "rust1", since = "1.0.0")] . unsafe impl<#[may_dangle] T, A: Allocator> Drop for IntoIter { 6,510,310 ( 0.09%) fn drop(&mut self) { . struct DropGuard<'a, T, A: Allocator>(&'a mut IntoIter); . . impl Drop for DropGuard<'_, T, A> { . fn drop(&mut self) { . unsafe { . // `IntoIter::alloc` is not used anymore after this . let alloc = ptr::read(&self.0.alloc); . // RawVec handles deallocation 1,285,192 ( 0.02%) let _ = RawVec::from_raw_parts_in(self.0.buf.as_ptr(), self.0.cap, alloc); . } . } . } . . let guard = DropGuard(self); . // destroy the remaining elements . unsafe { 314 ( 0.00%) ptr::drop_in_place(guard.0.as_raw_mut_slice()); . } . // now `guard` will be dropped and do the rest 5,656,941 ( 0.08%) } . } . . #[unstable(issue = "none", feature = "inplace_iteration")] . #[doc(hidden)] . unsafe impl InPlaceIterable for IntoIter {} . . #[unstable(issue = "none", feature = "inplace_iteration")] . #[doc(hidden)] -- line 331 ---------------------------------------- 1,797,133 ( 0.03%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/type_variable.rs -------------------------------------------------------------------------------- Ir -- line 44 ---------------------------------------- . /// Convert from a specific kind of undo to the more general UndoLog . impl<'tcx> From for UndoLog<'tcx> { . fn from(l: Instantiate) -> Self { . UndoLog::Values(sv::UndoLog::Other(l)) . } . } . . impl<'tcx> Rollback> for TypeVariableStorage<'tcx> { 233,046 ( 0.00%) fn reverse(&mut self, undo: UndoLog<'tcx>) { 982,118 ( 0.01%) match undo { 183,112 ( 0.00%) UndoLog::EqRelation(undo) => self.eq_relations.reverse(undo), 106,264 ( 0.00%) UndoLog::SubRelation(undo) => self.sub_relations.reverse(undo), 176,716 ( 0.00%) UndoLog::Values(undo) => self.values.reverse(undo), . } 466,092 ( 0.01%) } . } . . pub struct TypeVariableStorage<'tcx> { . values: sv::SnapshotVecStorage, . . /// Two variables are unified in `eq_relations` when we have a . /// constraint `?X == ?Y`. This table also stores, for each key, . /// the known value. -- line 66 ---------------------------------------- -- line 136 ---------------------------------------- . DynReturnFn, . LatticeVariable, . } . . pub(crate) struct TypeVariableData { . origin: TypeVariableOrigin, . } . 1,828,934 ( 0.03%) #[derive(Copy, Clone, Debug)] . pub enum TypeVariableValue<'tcx> { . Known { value: Ty<'tcx> }, . Unknown { universe: ty::UniverseIndex }, . } . . impl<'tcx> TypeVariableValue<'tcx> { . /// If this value is known, returns the type it is known to be. . /// Otherwise, `None`. . pub fn known(&self) -> Option> { 1,123,076 ( 0.02%) match *self { . TypeVariableValue::Unknown { .. } => None, . TypeVariableValue::Known { value } => Some(value), . } . } . . pub fn is_unknown(&self) -> bool { . match *self { . TypeVariableValue::Unknown { .. } => true, -- line 162 ---------------------------------------- -- line 166 ---------------------------------------- . } . . pub(crate) struct Instantiate; . . pub(crate) struct Delegate; . . impl<'tcx> TypeVariableStorage<'tcx> { . pub fn new() -> TypeVariableStorage<'tcx> { 118,341 ( 0.00%) TypeVariableStorage { . values: sv::SnapshotVecStorage::new(), . eq_relations: ut::UnificationTableStorage::new(), . sub_relations: ut::UnificationTableStorage::new(), . } . } . . #[inline] . pub(crate) fn with_log<'a>( -- line 182 ---------------------------------------- -- line 188 ---------------------------------------- . } . . impl<'tcx> TypeVariableTable<'_, 'tcx> { . /// Returns the origin that was given when `vid` was created. . /// . /// Note that this function does not return care whether . /// `vid` has been unified with something else or not. . pub fn var_origin(&self, vid: ty::TyVid) -> &TypeVariableOrigin { 2,512 ( 0.00%) &self.storage.values.get(vid.as_usize()).origin . } . . /// Records that `a == b`, depending on `dir`. . /// . /// Precondition: neither `a` nor `b` are known. . pub fn equate(&mut self, a: ty::TyVid, b: ty::TyVid) { . debug_assert!(self.probe(a).is_unknown()); . debug_assert!(self.probe(b).is_unknown()); 22,302 ( 0.00%) self.eq_relations().union(a, b); 19,116 ( 0.00%) self.sub_relations().union(a, b); . } . . /// Records that `a <: b`, depending on `dir`. . /// . /// Precondition: neither `a` nor `b` are known. . pub fn sub(&mut self, a: ty::TyVid, b: ty::TyVid) { . debug_assert!(self.probe(a).is_unknown()); . debug_assert!(self.probe(b).is_unknown()); 14,018 ( 0.00%) self.sub_relations().union(a, b); . } . . /// Instantiates `vid` with the type `ty`. . /// . /// Precondition: `vid` must not have been previously instantiated. 416,045 ( 0.01%) pub fn instantiate(&mut self, vid: ty::TyVid, ty: Ty<'tcx>) { . let vid = self.root_var(vid); . debug_assert!(self.probe(vid).is_unknown()); . debug_assert!( . self.eq_relations().probe_value(vid).is_unknown(), . "instantiating type variable `{:?}` twice: new-value = {:?}, old-value={:?}", . vid, . ty, . self.eq_relations().probe_value(vid) . ); 582,463 ( 0.01%) self.eq_relations().union_value(vid, TypeVariableValue::Known { value: ty }); . . // Hack: we only need this so that `types_escaping_snapshot` . // can see what has been unified; see the Delegate impl for . // more details. . self.undo_log.push(Instantiate); 416,045 ( 0.01%) } . . /// Creates a new type variable. . /// . /// - `diverging`: indicates if this is a "diverging" type . /// variable, e.g., one created as the type of a `return` . /// expression. The code in this module doesn't care if a . /// variable is diverging, but the main Rust type-checker will . /// sometimes "unify" such variables with the `!` or `()` types. . /// - `origin`: indicates *why* the type variable was created. . /// The code in this module doesn't care, but it can be useful . /// for improving error messages. 542,112 ( 0.01%) pub fn new_var( . &mut self, . universe: ty::UniverseIndex, . origin: TypeVariableOrigin, . ) -> ty::TyVid { 813,168 ( 0.01%) let eq_key = self.eq_relations().new_key(TypeVariableValue::Unknown { universe }); . 451,760 ( 0.01%) let sub_key = self.sub_relations().new_key(()); 90,352 ( 0.00%) assert_eq!(eq_key.vid, sub_key); . 813,168 ( 0.01%) let index = self.values().push(TypeVariableData { origin }); 361,408 ( 0.01%) assert_eq!(eq_key.vid.as_u32(), index as u32); . . debug!("new_var(index={:?}, universe={:?}, origin={:?}", eq_key.vid, universe, origin,); . . eq_key.vid 632,464 ( 0.01%) } . . /// Returns the number of type variables created thus far. . pub fn num_vars(&self) -> usize { 6,246 ( 0.00%) self.storage.values.len() . } . . /// Returns the "root" variable of `vid` in the `eq_relations` . /// equivalence table. All type variables that have been equated . /// will yield the same root variable (per the union-find . /// algorithm), so `root_var(a) == root_var(b)` implies that `a == . /// b` (transitively). . pub fn root_var(&mut self, vid: ty::TyVid) -> ty::TyVid { 320,043 ( 0.00%) self.eq_relations().find(vid).vid . } . . /// Returns the "root" variable of `vid` in the `sub_relations` . /// equivalence table. All type variables that have been are . /// related via equality or subtyping will yield the same root . /// variable (per the union-find algorithm), so `sub_root_var(a) . /// == sub_root_var(b)` implies that: . /// . /// exists X. (a <: X || X <: a) && (b <: X || X <: b) 1,590 ( 0.00%) pub fn sub_root_var(&mut self, vid: ty::TyVid) -> ty::TyVid { 260,769 ( 0.00%) self.sub_relations().find(vid) 3,180 ( 0.00%) } . . /// Returns `true` if `a` and `b` have same "sub-root" (i.e., exists some . /// type X such that `forall i in {a, b}. (i <: X || X <: i)`. . pub fn sub_unified(&mut self, a: ty::TyVid, b: ty::TyVid) -> bool { . self.sub_root_var(a) == self.sub_root_var(b) . } . . /// Retrieves the type to which `vid` has been instantiated, if . /// any. 4,132,410 ( 0.06%) pub fn probe(&mut self, vid: ty::TyVid) -> TypeVariableValue<'tcx> { . self.inlined_probe(vid) 4,132,410 ( 0.06%) } . . /// An always-inlined variant of `probe`, for very hot call sites. . #[inline(always)] . pub fn inlined_probe(&mut self, vid: ty::TyVid) -> TypeVariableValue<'tcx> { 2,673,154 ( 0.04%) self.eq_relations().inlined_probe_value(vid) . } . . /// If `t` is a type-inference variable, and it has been . /// instantiated, then return the with which it was . /// instantiated. Otherwise, returns `t`. . pub fn replace_if_possible(&mut self, t: Ty<'tcx>) -> Ty<'tcx> { 1,012,218 ( 0.01%) match *t.kind() { 670,683 ( 0.01%) ty::Infer(ty::TyVar(v)) => match self.probe(v) { . TypeVariableValue::Unknown { .. } => t, . TypeVariableValue::Known { value } => value, . }, . _ => t, . } . } . . #[inline] -- line 323 ---------------------------------------- -- line 324 ---------------------------------------- . fn values( . &mut self, . ) -> sv::SnapshotVec, &mut InferCtxtUndoLogs<'tcx>> { . self.storage.values.with_log(self.undo_log) . } . . #[inline] . fn eq_relations(&mut self) -> super::UnificationTable<'_, 'tcx, TyVidEqKey<'tcx>> { 3,536,882 ( 0.05%) self.storage.eq_relations.with_log(self.undo_log) . } . . #[inline] . fn sub_relations(&mut self) -> super::UnificationTable<'_, 'tcx, ty::TyVid> { 190,320 ( 0.00%) self.storage.sub_relations.with_log(self.undo_log) . } . . /// Returns a range of the type variables created during the snapshot. 31,230 ( 0.00%) pub fn vars_since_snapshot( . &mut self, . value_count: usize, . ) -> (Range, Vec) { . let range = TyVid::from_usize(value_count)..TyVid::from_usize(self.num_vars()); 37,476 ( 0.00%) ( . range.start..range.end, . (range.start.as_usize()..range.end.as_usize()) . .map(|index| self.storage.values.get(index).origin) . .collect(), . ) 37,476 ( 0.00%) } . . /// Returns indices of all variables that are not yet . /// instantiated. . pub fn unsolved_variables(&mut self) -> Vec { . (0..self.storage.values.len()) . .filter_map(|i| { . let vid = ty::TyVid::from_usize(i); 233,896 ( 0.00%) match self.probe(vid) { . TypeVariableValue::Unknown { .. } => Some(vid), . TypeVariableValue::Known { .. } => None, . } . }) . .collect() . } . } . -- line 368 ---------------------------------------- -- line 391 ---------------------------------------- . /// These structs (a newtyped TyVid) are used as the unification key . /// for the `eq_relations`; they carry a `TypeVariableValue` along . /// with them. . #[derive(Copy, Clone, Debug, PartialEq, Eq)] . pub(crate) struct TyVidEqKey<'tcx> { . vid: ty::TyVid, . . // in the table, we map each ty-vid to one of these: 2,679,455 ( 0.04%) phantom: PhantomData>, . } . . impl<'tcx> From for TyVidEqKey<'tcx> { . #[inline] // make this function eligible for inlining - it is quite hot. . fn from(vid: ty::TyVid) -> Self { . TyVidEqKey { vid, phantom: PhantomData } . } . } -- line 407 ---------------------------------------- -- line 419 ---------------------------------------- . "TyVidEqKey" . } . } . . impl<'tcx> ut::UnifyValue for TypeVariableValue<'tcx> { . type Error = ut::NoError; . . fn unify_values(value1: &Self, value2: &Self) -> Result { 348,746 ( 0.01%) match (value1, value2) { . // We never equate two type variables, both of which . // have known types. Instead, we recursively equate . // those types. . (&TypeVariableValue::Known { .. }, &TypeVariableValue::Known { .. }) => { . bug!("equating two type variables, both of which have known types") . } . . // If one side is known, prefer that one. . (&TypeVariableValue::Known { .. }, &TypeVariableValue::Unknown { .. }) => Ok(*value1), . (&TypeVariableValue::Unknown { .. }, &TypeVariableValue::Known { .. }) => Ok(*value2), . . // If both sides are *unknown*, it hardly matters, does it? . ( 3,182 ( 0.00%) &TypeVariableValue::Unknown { universe: universe1 }, 3,182 ( 0.00%) &TypeVariableValue::Unknown { universe: universe2 }, . ) => { . // If we unify two unbound variables, ?T and ?U, then whatever . // value they wind up taking (which must be the same value) must . // be nameable by both universes. Therefore, the resulting . // universe is the minimum of the two universes, because that is . // the one which contains the fewest names in scope. . let universe = cmp::min(universe1, universe2); 12,728 ( 0.00%) Ok(TypeVariableValue::Unknown { universe }) . } . } . } . } 225,942 ( 0.00%) -------------------------------------------------------------------------------- -- 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 { 6,732,271 ( 0.10%) 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)); 415,016 ( 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::(), mem::size_of::()); 138,861,312 ( 2.02%) 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" . ); . 974,340 ( 0.01%) self.stride += Group::WIDTH; 974,340 ( 0.01%) self.pos += self.stride; 839,593 ( 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 { . 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. 464,522 ( 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. 967,600 ( 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. 232,446 ( 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 { 1,291,979 ( 0.02%) 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. 336,174 ( 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 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 = 933,583 ( 0.01%) size.checked_mul(buckets)?.checked_add(ctrl_align - 1)? & !(ctrl_align - 1); 1,260,064 ( 0.02%) 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 { 7,634 ( 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 { 16,791 ( 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 { . debug_assert!(buckets.is_power_of_two()); . . Ok(Self { 1,145 ( 0.00%) table: RawTableInner::new_uninitialized( . alloc, . TableLayout::new::(), . 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 { . Ok(Self { 40,053 ( 0.00%) table: RawTableInner::fallible_with_capacity( . alloc, . TableLayout::new::(), . 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")] 110,825 ( 0.00%) pub unsafe fn erase_no_drop(&mut self, item: &Bucket) { 110,825 ( 0.00%) let index = self.bucket_index(item); . self.table.erase(index); 221,650 ( 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) { . // Erase the element from the table first since drop might panic. 56,138 ( 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 { 165,512 ( 0.00%) self.erase_no_drop(&item); 1,335 ( 0.00%) item.read() . } . . /// Finds and removes an element from the table, returning it. . #[cfg_attr(feature = "inline-more", inline)] 2,537,739 ( 0.04%) pub fn remove_entry(&mut self, hash: u64, eq: impl FnMut(&T) -> bool) -> Option { . // Avoid `Option::map` because it bloats LLVM IR. 2,330 ( 0.00%) match self.find(hash, eq) { 46,560 ( 0.00%) Some(bucket) => Some(unsafe { self.remove(bucket) }), 618,491 ( 0.01%) None => None, . } 3,378,450 ( 0.05%) } . . /// 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) { 42,412 ( 0.00%) if mem::needs_drop::() && !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) { 1,253,789 ( 0.02%) if additional > self.table.growth_left { . // Avoid `Result::unwrap_or_else` because it bloats LLVM IR. 828,650 ( 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)] 1,850,945 ( 0.03%) 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::(), . if mem::needs_drop::() { . Some(mem::transmute(ptr::drop_in_place:: as unsafe fn(*mut T))) . } else { . None . }, . ) . } 1,291,280 ( 0.02%) } . . /// 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)] 8,632,026 ( 0.13%) pub fn insert(&mut self, hash: u64, value: T, hasher: impl Fn(&T) -> u64) -> Bucket { . 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. 22,963 ( 0.00%) let old_ctrl = *self.table.ctrl(index); 6,661,573 ( 0.10%) 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 . } 6,364,858 ( 0.09%) } . . /// 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)] 3,229,704 ( 0.05%) pub fn insert_entry(&mut self, hash: u64, value: T, hasher: impl Fn(&T) -> u64) -> &mut T { 866 ( 0.00%) unsafe { self.insert(hash, value, hasher).as_mut() } 2,422,278 ( 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"))] 17,810 ( 0.00%) pub unsafe fn insert_no_grow(&mut self, hash: u64, value: T) -> Bucket { 1,082,537 ( 0.02%) let (index, old_ctrl) = self.table.prepare_insert_slot(hash); 49,884 ( 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. 2,361,708 ( 0.03%) self.table.growth_left -= special_is_empty(old_ctrl) as usize; . . bucket.write(value); 1,889,733 ( 0.03%) self.table.items += 1; . bucket 35,607 ( 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] 11,455 ( 0.00%) pub fn find(&self, hash: u64, mut eq: impl FnMut(&T) -> bool) -> Option> { 27,734 ( 0.00%) let result = self.table.find_inner(hash, &mut |index| unsafe { 90,620 ( 0.00%) eq(self.bucket(index).as_ref()) 12,835 ( 0.00%) }); . . // Avoid `Option::map` because it bloats LLVM IR. . match result { 4,368 ( 0.00%) Some(index) => Some(unsafe { self.bucket(index) }), . None => None, . } 11,656 ( 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. 76,992 ( 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] 135 ( 0.00%) pub fn get_mut(&mut self, hash: u64, eq: impl FnMut(&T) -> bool) -> Option<&mut T> { . // Avoid `Option::map` because it bloats LLVM IR. 8,250 ( 0.00%) match self.find(hash, eq) { . Some(bucket) => Some(unsafe { bucket.as_mut() }), . None => None, . } 180 ( 0.00%) } . . /// 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. . /// . /// At most one mutable reference will be returned to any entry. `None` will be returned if any . /// of the hashes are duplicates. `None` will be returned if the hash is not found. . /// -- line 859 ---------------------------------------- -- 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 { 3,646,263 ( 0.05%) self.len() == 0 . } . . /// Returns the number of buckets in the table. . #[inline] . pub fn buckets(&self) -> usize { . 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. . #[inline] . pub unsafe fn iter(&self) -> RawIter { 24 ( 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()), 451,234 ( 0.01%) 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) -> RawIntoIter { . debug_assert_eq!(iter.len(), self.len()); . . let alloc = self.table.alloc.clone(); 19,488 ( 0.00%) let allocation = self.into_allocation(); 14,616 ( 0.00%) RawIntoIter { 24,360 ( 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, Layout)> { 9,024 ( 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::(self.table.buckets()) { . Some(lco) => lco, . None => unsafe { hint::unreachable_unchecked() }, . }; . Some(( 1,272 ( 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 RawTableInner { . #[inline] . const fn new_in(alloc: A) -> Self { 2,770,989 ( 0.04%) 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 RawTableInner { . #[cfg_attr(feature = "inline-more", inline)] 1,699,429 ( 0.02%) unsafe fn new_uninitialized( . alloc: A, . table_layout: TableLayout, . buckets: usize, . fallibility: Fallibility, . ) -> Result { . 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::() < 8 && layout.size() > isize::MAX as usize { . return Err(fallibility.capacity_overflow()); . } . 382,958 ( 0.01%) let ptr: NonNull = 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)); 936,858 ( 0.01%) Ok(Self { . ctrl, 388,633 ( 0.01%) bucket_mask: buckets - 1, . items: 0, . growth_left: bucket_mask_to_capacity(buckets - 1), . alloc, . }) 1,237,048 ( 0.02%) } . . #[inline] 93,431 ( 0.00%) fn fallible_with_capacity( . alloc: A, . table_layout: TableLayout, . capacity: usize, . fallibility: Fallibility, . ) -> Result { 24,212 ( 0.00%) if capacity == 0 { 22,836 ( 0.00%) Ok(Self::new_in(alloc)) . } else { . unsafe { . let buckets = . capacity_to_buckets(capacity).ok_or_else(|| fallibility.capacity_overflow())?; . 768,324 ( 0.01%) let result = Self::new_uninitialized(alloc, table_layout, buckets, fallibility)?; . result.ctrl(0).write_bytes(EMPTY, result.num_ctrl_bytes()); . 43,874 ( 0.00%) Ok(result) . } . } 93,431 ( 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] 397,217 ( 0.01%) unsafe fn prepare_insert_slot(&self, hash: u64) -> (usize, u8) { . let index = self.find_insert_slot(hash); 397,217 ( 0.01%) let old_ctrl = *self.ctrl(index); . self.set_ctrl_h2(index, hash); . (index, old_ctrl) 794,434 ( 0.01%) } . . /// 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)); 4,356,787 ( 0.06%) if let Some(bit) = group.match_empty_or_deleted().lowest_set_bit() { 12,733,359 ( 0.19%) 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). 5,906,317 ( 0.09%) 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 { . let h2_hash = h2(hash); . let mut probe_seq = self.probe_seq(hash); . 351,824 ( 0.01%) loop { . let group = unsafe { Group::load(self.ctrl(probe_seq.pos)) }; . 14,292,728 ( 0.21%) for bit in group.match_byte(h2_hash) { 27,296,001 ( 0.40%) let index = (probe_seq.pos + bit) & self.bucket_mask; . 16,816,526 ( 0.24%) if likely(eq(index)) { . return Some(index); . } . } . 4,541,737 ( 0.07%) if likely(group.match_empty().any_bit_set()) { . return None; . } . . probe_seq.move_next(self.bucket_mask); . } . } . . #[allow(clippy::mut_mut)] . #[inline] . unsafe fn prepare_rehash_in_place(&mut self) { . // Bulk convert all full control bytes to DELETED, and all DELETED . // control bytes to EMPTY. This effectively frees up all buckets . // containing a DELETED entry. 9 ( 0.00%) for i in (0..self.buckets()).step_by(Group::WIDTH) { . let group = Group::load_aligned(self.ctrl(i)); . let group = group.convert_special_to_empty_and_full_to_deleted(); . group.store_aligned(self.ctrl(i)); . } . . // Fix up the trailing control bytes. See the comments in set_ctrl . // for the handling of tables smaller than the group width. 9 ( 0.00%) if self.buckets() < Group::WIDTH { . self.ctrl(0) . .copy_to(self.ctrl(Group::WIDTH), self.buckets()); . } else { . self.ctrl(0) . .copy_to(self.ctrl(self.buckets()), Group::WIDTH); . } . } . -- line 1220 ---------------------------------------- -- 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(); 16,178,096 ( 0.24%) base.sub((index + 1) * size_of) . } . . #[inline] . unsafe fn data_end(&self) -> NonNull { . 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 { 77,054,948 ( 1.12%) 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) { 8,323,275 ( 0.12%) self.growth_left -= special_is_empty(old_ctrl) as usize; . self.set_ctrl_h2(index, hash); 6,658,620 ( 0.10%) 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; 108 ( 0.00%) probe_index(i) == probe_index(new_i) . } . . /// Sets a control byte to the hash, and possibly also the replicated control byte at . /// the end of the array. . #[inline] . unsafe fn set_ctrl_h2(&self, index: usize, hash: u64) { . self.set_ctrl(index, h2(hash)); . } -- line 1289 ---------------------------------------- -- 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] | . // --------------------------------------------- 12,305,799 ( 0.18%) let index2 = ((index.wrapping_sub(Group::WIDTH)) & self.bucket_mask) + Group::WIDTH; . 4,101,933 ( 0.06%) *self.ctrl(index) = ctrl; 4,104,088 ( 0.06%) *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 { 1,260,683 ( 0.02%) self.bucket_mask + 1 . } . . #[inline] . fn num_ctrl_bytes(&self) -> usize { 1,194,042 ( 0.02%) self.bucket_mask + 1 + Group::WIDTH . } . . #[inline] . fn is_empty_singleton(&self) -> bool { 5,064,450 ( 0.07%) self.bucket_mask == 0 . } . . #[allow(clippy::mut_mut)] . #[inline] . unsafe fn prepare_resize( . &self, . table_layout: TableLayout, . capacity: usize, . fallibility: Fallibility, . ) -> Result, TryReserveError> { . debug_assert!(self.items <= capacity); . . // Allocate and initialize the new table. 5,424 ( 0.00%) let mut new_table = RawTableInner::fallible_with_capacity( . self.alloc.clone(), . table_layout, . capacity, . fallibility, . )?; 507,611 ( 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_| { 226,750 ( 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, . ) -> Result<(), TryReserveError> { . // Avoid `Option::ok_or_else` because it bloats LLVM IR. 453,507 ( 0.01%) let new_items = match self.items.checked_add(additional) { . Some(new_items) => new_items, . None => return Err(fallibility.capacity_overflow()), . }; 453,506 ( 0.01%) let full_capacity = bucket_mask_to_capacity(self.bucket_mask); 968,460 ( 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); 6 ( 0.00%) Ok(()) . } else { . // Otherwise, conservatively resize to at least the next size up . // to avoid churning deletes into frequent rehashes. . self.resize_inner( 226,750 ( 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> { 12,933 ( 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() { 2,490,609 ( 0.04%) 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); . 226,750 ( 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 1496 ---------------------------------------- . } . self_.growth_left = bucket_mask_to_capacity(self_.bucket_mask) - self_.items; . }); . . // At this point, DELETED elements are elements that we haven't . // rehashed yet. Find them and re-insert them at their ideal . // position. . 'outer: for i in 0..guard.buckets() { 192 ( 0.00%) if *guard.ctrl(i) != DELETED { . continue; . } . . let i_p = guard.bucket_ptr(i, size_of); . . 'inner: loop { . // Hash the current item . let hash = hasher(*guard, i); -- line 1512 ---------------------------------------- -- line 1515 ---------------------------------------- . let new_i = guard.find_insert_slot(hash); . let new_i_p = guard.bucket_ptr(new_i, size_of); . . // Probing works by scanning through all of the control . // bytes in groups, which may not be aligned to the group . // size. If both the new and old position fall within the . // same unaligned group, then there is no benefit in moving . // it and we can just continue to the next item. 36 ( 0.00%) if likely(guard.is_in_same_group(i, new_i, hash)) { . guard.set_ctrl_h2(i, hash); . continue 'outer; . } . . // We are moving the current item to a new position. Write . // our H2 to the control byte of the new position. . let prev_ctrl = guard.replace_ctrl_h2(new_i, hash); . if prev_ctrl == EMPTY { -- line 1531 ---------------------------------------- -- line 1541 ---------------------------------------- . // swapped into the old slot. . debug_assert_eq!(prev_ctrl, DELETED); . ptr::swap_nonoverlapping(i_p, new_i_p, size_of); . continue 'inner; . } . } . } . 9 ( 0.00%) guard.growth_left = bucket_mask_to_capacity(guard.bucket_mask) - guard.items; . . mem::forget(guard); . } . . #[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( 155,916 ( 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) { 68,595 ( 0.00%) if !self.is_empty_singleton() { . unsafe { . self.ctrl(0).write_bytes(EMPTY, self.num_ctrl_bytes()); . } . } 75,137 ( 0.00%) self.items = 0; 68,595 ( 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))); 341,730 ( 0.00%) 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. 1,366,920 ( 0.02%) let ctrl = if empty_before.leading_zeros() + empty_after.trailing_zeros() >= Group::WIDTH { . DELETED . } else { 1,641,410 ( 0.02%) self.growth_left += 1; . EMPTY . }; . self.set_ctrl(index, ctrl); 1,366,920 ( 0.02%) self.items -= 1; . } . } . . impl Clone for RawTable { 44,792 ( 0.00%) fn clone(&self) -> Self { 5,849 ( 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) . } . } 50,391 ( 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; 458 ( 0.00%) self.table.growth_left = source.table.growth_left; . } . } . . impl RawTable { . /// 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 { . #[cfg_attr(feature = "inline-more", inline)] 2,208,853 ( 0.03%) fn drop(&mut self) { 2,143,793 ( 0.03%) if !self.table.is_empty_singleton() { . unsafe { . self.drop_elements(); . self.free_buckets(); . } . } 2,390,508 ( 0.03%) } . } . #[cfg(not(feature = "nightly"))] . impl Drop for RawTable { . #[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 IntoIterator for RawTable { . type Item = T; . type IntoIter = RawIntoIter; . . #[cfg_attr(feature = "inline-more", inline)] 19,488 ( 0.00%) fn into_iter(self) -> RawIntoIter { . unsafe { . let iter = self.iter(); . self.into_iter_from(iter) . } 24,360 ( 0.00%) } . } . . /// Iterator over a sub-range of a table. Unlike `RawIter` this iterator does . /// not track an item count. . pub(crate) struct RawIterRange { . // 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 Iterator for RawIterRange { . type Item = Bucket; . . #[cfg_attr(feature = "inline-more", inline)] . fn next(&mut self) -> Option> { . unsafe { . loop { 979,010 ( 0.01%) if let Some(index) = self.current_group.lowest_set_bit() { 146,953 ( 0.00%) self.current_group = self.current_group.remove_lowest_bit(); 225,712 ( 0.00%) return Some(self.data.next_n(index)); . } . 897,929 ( 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). 23,212 ( 0.00%) self.current_group = Group::load_aligned(self.next_ctrl).match_full(); 22,008 ( 0.00%) self.data = self.data.next_n(Group::WIDTH); 40,292 ( 0.00%) self.next_ctrl = self.next_ctrl.add(Group::WIDTH); . } . } . } . . #[inline] . fn size_hint(&self) -> (usize, Option) { . // 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) { 11,100 ( 0.00%) if mem::needs_drop::() && self.len() != 0 { . for item in self { . item.drop(); . } . } . } . } . . impl Clone for RawIter { -- line 2118 ---------------------------------------- -- line 2124 ---------------------------------------- . } . } . } . . impl Iterator for RawIter { . type Item = Bucket; . . #[cfg_attr(feature = "inline-more", inline)] 163,133 ( 0.00%) fn next(&mut self) -> Option> { 445,600 ( 0.01%) if let Some(b) = self.iter.next() { 1,456,375 ( 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 . } 326,266 ( 0.00%) } . . #[inline] . fn size_hint(&self) -> (usize, Option) { . (self.items, Some(self.items)) . } . } . . impl ExactSizeIterator for RawIter {} -- line 2151 ---------------------------------------- -- line 2177 ---------------------------------------- . T: Sync, . A: Sync, . { . } . . #[cfg(feature = "nightly")] . unsafe impl<#[may_dangle] T, A: Allocator + Clone> Drop for RawIntoIter { . #[cfg_attr(feature = "inline-more", inline)] 6,596 ( 0.00%) fn drop(&mut self) { . unsafe { . // Drop all remaining elements . self.iter.drop_elements(); . . // Free the table 42,704 ( 0.00%) if let Some((ptr, layout)) = self.allocation { . self.alloc.deallocate(ptr, layout); . } . } 790 ( 0.00%) } . } . #[cfg(not(feature = "nightly"))] . impl Drop for RawIntoIter { . #[cfg_attr(feature = "inline-more", inline)] . fn drop(&mut self) { . unsafe { . // Drop all remaining elements . self.iter.drop_elements(); -- line 2203 ---------------------------------------- -- line 2209 ---------------------------------------- . } . } . } . . impl Iterator for RawIntoIter { . type Item = T; . . #[cfg_attr(feature = "inline-more", inline)] 1,434 ( 0.00%) fn next(&mut self) -> Option { 639 ( 0.00%) unsafe { Some(self.iter.next()?.read()) } 2,868 ( 0.00%) } . . #[inline] . fn size_hint(&self) -> (usize, Option) { 3 ( 0.00%) self.iter.size_hint() . } . } . . impl ExactSizeIterator for RawIntoIter {} . impl FusedIterator for RawIntoIter {} . . /// 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 Drop for RawDrain<'_, T, A> { . #[cfg_attr(feature = "inline-more", inline)] 22,728 ( 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. 2,841 ( 0.00%) self.orig_table . .as_ptr() . .copy_from_nonoverlapping(&*self.table, 1); . } 22,728 ( 0.00%) } . } . . impl Iterator for RawDrain<'_, T, A> { . type Item = T; . . #[cfg_attr(feature = "inline-more", inline)] . fn next(&mut self) -> Option { . unsafe { -- line 2289 ---------------------------------------- 42,840,769 ( 0.62%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_ast/src/token.rs -------------------------------------------------------------------------------- Ir -- line 12 ---------------------------------------- . use rustc_data_structures::sync::Lrc; . use rustc_macros::HashStable_Generic; . use rustc_span::symbol::{kw, sym}; . use rustc_span::symbol::{Ident, Symbol}; . use rustc_span::{self, edition::Edition, Span, DUMMY_SP}; . use std::borrow::Cow; . use std::{fmt, mem}; . 83,318 ( 0.00%) #[derive(Clone, Copy, PartialEq, Encodable, Decodable, Debug, HashStable_Generic)] . pub enum CommentKind { . Line, . Block, . } . 996 ( 0.00%) #[derive(Clone, PartialEq, Encodable, Decodable, Hash, Debug, Copy)] . #[derive(HashStable_Generic)] . pub enum BinOpToken { . Plus, . Minus, . Star, . Slash, . Percent, . Caret, . And, . Or, . Shl, . Shr, . } . . /// A delimiter token. 99,359 ( 0.00%) #[derive(Clone, PartialEq, Eq, Encodable, Decodable, Hash, Debug, Copy)] . #[derive(HashStable_Generic)] . pub enum DelimToken { . /// A round parenthesis (i.e., `(` or `)`). . Paren, . /// A square bracket (i.e., `[` or `]`). . Bracket, . /// A curly brace (i.e., `{` or `}`). . Brace, . /// An empty delimiter. . NoDelim, . } . 8,618 ( 0.00%) #[derive(Clone, Copy, PartialEq, Encodable, Decodable, Debug, HashStable_Generic)] . pub enum LitKind { . Bool, // AST only, must never appear in a `Token` . Byte, . Char, . Integer, . Float, . Str, . StrRaw(u16), // raw string delimited by `n` hash symbols . ByteStr, . ByteStrRaw(u16), // raw byte string delimited by `n` hash symbols . Err, . } . . /// A literal token. 91,783 ( 0.00%) #[derive(Clone, Copy, PartialEq, Encodable, Decodable, Debug, HashStable_Generic)] . pub struct Lit { 47 ( 0.00%) pub kind: LitKind, 47 ( 0.00%) pub symbol: Symbol, 47 ( 0.00%) pub suffix: Option, . } . . impl fmt::Display for Lit { 1,025 ( 0.00%) fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { 1,845 ( 0.00%) let Lit { kind, symbol, suffix } = *self; . match kind { . Byte => write!(f, "b'{}'", symbol)?, . Char => write!(f, "'{}'", symbol)?, 3 ( 0.00%) Str => write!(f, "\"{}\"", symbol)?, . StrRaw(n) => write!( . f, . "r{delim}\"{string}\"{delim}", . delim = "#".repeat(n as usize), . string = symbol . )?, 3 ( 0.00%) ByteStr => write!(f, "b\"{}\"", symbol)?, . ByteStrRaw(n) => write!( . f, . "br{delim}\"{string}\"{delim}", . delim = "#".repeat(n as usize), . string = symbol . )?, 609 ( 0.00%) Integer | Float | Bool | Err => write!(f, "{}", symbol)?, . } . 410 ( 0.00%) if let Some(suffix) = suffix { . write!(f, "{}", suffix)?; . } . . Ok(()) 1,025 ( 0.00%) } . } . . impl LitKind { . /// An English article for the literal token kind. . pub fn article(self) -> &'static str { . match self { . Integer | Err => "an", . _ => "a", -- line 113 ---------------------------------------- -- line 123 ---------------------------------------- . Float => "float", . Str | StrRaw(..) => "string", . ByteStr | ByteStrRaw(..) => "byte string", . Err => "error", . } . } . . crate fn may_have_suffix(self) -> bool { 34 ( 0.00%) matches!(self, Integer | Float | Err) . } . } . . impl Lit { . pub fn new(kind: LitKind, symbol: Symbol, suffix: Option) -> Lit { . Lit { kind, symbol, suffix } 28,709 ( 0.00%) } . } . 4,716 ( 0.00%) pub fn ident_can_begin_expr(name: Symbol, span: Span, is_raw: bool) -> bool { 8,253 ( 0.00%) let ident_token = Token::new(Ident(name, is_raw), span); . 3,089 ( 0.00%) !ident_token.is_reserved_ident() . || ident_token.is_path_segment_keyword() . || [ . kw::Async, . kw::Do, . kw::Box, . kw::Break, . kw::Const, . kw::Continue, -- line 152 ---------------------------------------- -- line 161 ---------------------------------------- . kw::True, . kw::Try, . kw::Unsafe, . kw::While, . kw::Yield, . kw::Static, . ] . .contains(&name) 5,895 ( 0.00%) } . . fn ident_can_begin_type(name: Symbol, span: Span, is_raw: bool) -> bool { 7,860 ( 0.00%) let ident_token = Token::new(Ident(name, is_raw), span); . 2,734 ( 0.00%) !ident_token.is_reserved_ident() . || ident_token.is_path_segment_keyword() . || [kw::Underscore, kw::For, kw::Impl, kw::Fn, kw::Unsafe, kw::Extern, kw::Typeof, kw::Dyn] . .contains(&name) . } . 16,829,529 ( 0.24%) #[derive(Clone, PartialEq, Encodable, Decodable, Debug, HashStable_Generic)] . pub enum TokenKind { . /* Expression-operator symbols. */ . Eq, . Lt, . Le, . EqEq, . Ne, . Ge, . Gt, . AndAnd, . OrOr, . Not, . Tilde, 135,528 ( 0.00%) BinOp(BinOpToken), 114 ( 0.00%) BinOpEq(BinOpToken), . . /* Structural symbols */ . At, . Dot, . DotDot, . DotDotDot, . DotDotEq, . Comma, -- line 203 ---------------------------------------- -- line 208 ---------------------------------------- . LArrow, . FatArrow, . Pound, . Dollar, . Question, . /// Used by proc macros for representing lifetimes, not generated by lexer right now. . SingleQuote, . /// An opening delimiter (e.g., `{`). 268,803 ( 0.00%) OpenDelim(DelimToken), . /// A closing delimiter (e.g., `}`). 84,459 ( 0.00%) CloseDelim(DelimToken), . . /* Literals */ 53,343 ( 0.00%) Literal(Lit), . . /// Identifier token. . /// Do not forget about `NtIdent` when you want to match on identifiers. . /// It's recommended to use `Token::(ident,uninterpolate,uninterpolated_span)` to . /// treat regular and interpolated identifiers in the same way. 115,385 ( 0.00%) Ident(Symbol, /* is_raw */ bool), . /// Lifetime identifier token. . /// Do not forget about `NtLifetime` when you want to match on lifetime identifiers. . /// It's recommended to use `Token::(lifetime,uninterpolate,uninterpolated_span)` to . /// treat regular and interpolated lifetime identifiers in the same way. 918 ( 0.00%) Lifetime(Symbol), . 12,812 ( 0.00%) Interpolated(Lrc), . . /// A doc comment token. . /// `Symbol` is the doc comment's data excluding its "quotes" (`///`, `/**`, etc) . /// similarly to symbols in string literal tokens. 6,234 ( 0.00%) DocComment(CommentKind, ast::AttrStyle, Symbol), . . Eof, . } . . // `TokenKind` is used a lot. Make sure it doesn't unintentionally get bigger. . #[cfg(all(target_arch = "x86_64", target_pointer_width = "64"))] . rustc_data_structures::static_assert_size!(TokenKind, 16); . 1,115,343 ( 0.02%) #[derive(Clone, PartialEq, Encodable, Decodable, Debug, HashStable_Generic)] . pub struct Token { 72,448 ( 0.00%) pub kind: TokenKind, 30 ( 0.00%) pub span: Span, . } . . impl TokenKind { . pub fn lit(kind: LitKind, symbol: Symbol, suffix: Option) -> TokenKind { . Literal(Lit::new(kind, symbol, suffix)) . } . . // An approximation to proc-macro-style single-character operators used by rustc parser. . // If the operator token can be broken into two tokens, the first of which is single-character, . // then this function performs that operation, otherwise it returns `None`. 19,720 ( 0.00%) pub fn break_two_token_op(&self) -> Option<(TokenKind, TokenKind)> { 80,034 ( 0.00%) Some(match *self { . Le => (Lt, Eq), . EqEq => (Eq, Eq), . Ne => (Not, Eq), . Ge => (Gt, Eq), . AndAnd => (BinOp(And), BinOp(And)), . OrOr => (BinOp(Or), BinOp(Or)), . BinOp(Shl) => (Lt, Lt), . BinOp(Shr) => (Gt, Gt), -- line 271 ---------------------------------------- -- line 280 ---------------------------------------- . BinOpEq(Shl) => (Lt, Le), . BinOpEq(Shr) => (Gt, Ge), . DotDot => (Dot, Dot), . DotDotDot => (Dot, DotDot), . ModSep => (Colon, Colon), . RArrow => (BinOp(Minus), Gt), . LArrow => (Lt, BinOp(Minus)), . FatArrow => (Eq, Gt), 19,591 ( 0.00%) _ => return None, . }) 19,720 ( 0.00%) } . . /// Returns tokens that are likely to be typed accidentally instead of the current token. . /// Enables better error recovery when the wrong token is found. . pub fn similar_tokens(&self) -> Option> { . match *self { . Comma => Some(vec![Dot, Lt, Semi]), . Semi => Some(vec![Colon, Comma]), . FatArrow => Some(vec![Eq, RArrow]), . _ => None, . } . } . . pub fn should_end_const_arg(&self) -> bool { 4,912 ( 0.00%) matches!(self, Gt | Ge | BinOp(Shr) | BinOpEq(Shr)) 1,039 ( 0.00%) } . } . . impl Token { 117,938 ( 0.00%) pub fn new(kind: TokenKind, span: Span) -> Self { 435,263 ( 0.01%) Token { kind, span } 117,938 ( 0.00%) } . . /// Some token that will be thrown away later. 23,831 ( 0.00%) pub fn dummy() -> Self { . Token::new(TokenKind::Question, DUMMY_SP) 23,831 ( 0.00%) } . . /// Recovers a `Token` from an `Ident`. This creates a raw identifier if necessary. . pub fn from_ast_ident(ident: Ident) -> Self { 5,360 ( 0.00%) Token::new(Ident(ident.name, ident.is_raw_guess()), ident.span) . } . . /// Return this token by value and leave a dummy token in its place. 71,444 ( 0.00%) pub fn take(&mut self) -> Self { . mem::replace(self, Token::dummy()) 71,444 ( 0.00%) } . . /// For interpolated tokens, returns a span of the fragment to which the interpolated . /// token refers. For all other tokens this is just a regular span. . /// It is particularly important to use this for identifiers and lifetimes . /// for which spans affect name resolution and edition checks. . /// Note that keywords are also identifiers, so they should use this . /// if they keep spans or perform edition checks. . pub fn uninterpolated_span(&self) -> Span { 10,834 ( 0.00%) match &self.kind { 14 ( 0.00%) Interpolated(nt) => nt.span(), 5,410 ( 0.00%) _ => self.span, . } 5,410 ( 0.00%) } . . pub fn is_op(&self) -> bool { 214,332 ( 0.00%) !matches!( 71,444 ( 0.00%) self.kind, . OpenDelim(..) . | CloseDelim(..) . | Literal(..) . | DocComment(..) . | Ident(..) . | Lifetime(..) . | Interpolated(..) . | Eof . ) 71,444 ( 0.00%) } . . pub fn is_like_plus(&self) -> bool { 45,736 ( 0.00%) matches!(self.kind, BinOp(Plus) | BinOpEq(Plus)) 9,060 ( 0.00%) } . . /// Returns `true` if the token can appear at the start of an expression. 1,874 ( 0.00%) pub fn can_begin_expr(&self) -> bool { 9,460 ( 0.00%) match self.uninterpolate().kind { 10,611 ( 0.00%) Ident(name, is_raw) => 3,537 ( 0.00%) ident_can_begin_expr(name, self.span, is_raw), // value name or keyword . OpenDelim(..) | // tuple, array or block . Literal(..) | // literal . Not | // operator not . BinOp(Minus) | // unary minus . BinOp(Star) | // dereference . BinOp(Or) | OrOr | // closure . BinOp(And) | // reference . AndAnd | // double reference . // DotDotDot is no longer supported, but we need some way to display the error . DotDot | DotDotDot | DotDotEq | // range notation . Lt | BinOp(Shl) | // associated path . ModSep | // global path . Lifetime(..) | // labeled loop . Pound => true, // expression attributes 2,240 ( 0.00%) Interpolated(ref nt) => matches!(**nt, NtLiteral(..) | . NtExpr(..) | . NtBlock(..) | . NtPath(..)), . _ => false, . } 3,748 ( 0.00%) } . . /// Returns `true` if the token can appear at the start of a type. 8,460 ( 0.00%) pub fn can_begin_type(&self) -> bool { 12,516 ( 0.00%) match self.uninterpolate().kind { 11,790 ( 0.00%) Ident(name, is_raw) => 1,310 ( 0.00%) ident_can_begin_type(name, self.span, is_raw), // type name or keyword . OpenDelim(Paren) | // tuple . OpenDelim(Bracket) | // array . Not | // never . BinOp(Star) | // raw pointer . BinOp(And) | // reference . AndAnd | // double reference . Question | // maybe bound in trait object . Lifetime(..) | // lifetime bound in trait object . Lt | BinOp(Shl) | // associated path . ModSep => true, // global path 4,576 ( 0.00%) Interpolated(ref nt) => matches!(**nt, NtTy(..) | NtPath(..)), . _ => false, . } 12,690 ( 0.00%) } . . /// Returns `true` if the token can appear at the start of a const param. . pub fn can_begin_const_arg(&self) -> bool { 5,290 ( 0.00%) match self.kind { . OpenDelim(Brace) => true, . Interpolated(ref nt) => matches!(**nt, NtExpr(..) | NtBlock(..) | NtLiteral(..)), 1,058 ( 0.00%) _ => self.can_begin_literal_maybe_minus(), . } . } . . /// Returns `true` if the token can appear at the start of a generic bound. . pub fn can_begin_bound(&self) -> bool { . self.is_path_start() . || self.is_lifetime() . || self.is_keyword(kw::For) -- line 419 ---------------------------------------- -- line 427 ---------------------------------------- . } . . /// Returns `true` if the token is any literal, a minus (which can prefix a literal, . /// for example a '-42', or one of the boolean idents). . /// . /// In other words, would this token be a valid start of `parse_literal_maybe_minus`? . /// . /// Keep this in sync with and `Lit::from_token`, excluding unary negation. 2,450 ( 0.00%) pub fn can_begin_literal_maybe_minus(&self) -> bool { 16,471 ( 0.00%) match self.uninterpolate().kind { . Literal(..) | BinOp(Minus) => true, 3,204 ( 0.00%) Ident(name, false) if name.is_bool_lit() => true, 8,008 ( 0.00%) Interpolated(ref nt) => match &**nt { . NtLiteral(_) => true, . NtExpr(e) => match &e.kind { . ast::ExprKind::Lit(_) => true, . ast::ExprKind::Unary(ast::UnOp::Neg, e) => { . matches!(&e.kind, ast::ExprKind::Lit(_)) . } . _ => false, . }, . _ => false, . }, . _ => false, . } 4,900 ( 0.00%) } . . // A convenience function for matching on identifiers during parsing. . // Turns interpolated identifier (`$i: ident`) or lifetime (`$l: lifetime`) token . // into the regular identifier or lifetime token it refers to, . // otherwise returns the original token. 31,976 ( 0.00%) pub fn uninterpolate(&self) -> Cow<'_, Token> { 1,510,832 ( 0.02%) match &self.kind { 40,411 ( 0.00%) Interpolated(nt) => match **nt { 77 ( 0.00%) NtIdent(ident, is_raw) => { 196 ( 0.00%) Cow::Owned(Token::new(Ident(ident.name, is_raw), ident.span)) . } . NtLifetime(ident) => Cow::Owned(Token::new(Lifetime(ident.name), ident.span)), . _ => Cow::Borrowed(self), . }, . _ => Cow::Borrowed(self), . } 31,976 ( 0.00%) } . . /// Returns an identifier if this token is an identifier. 161,217 ( 0.00%) pub fn ident(&self) -> Option<(Ident, /* is_raw */ bool)> { . let token = self.uninterpolate(); 1,042,719 ( 0.02%) match token.kind { 4,400,118 ( 0.06%) Ident(name, is_raw) => Some((Ident::new(name, token.span), is_raw)), . _ => None, . } 1,258,172 ( 0.02%) } . . /// Returns a lifetime identifier if this token is a lifetime. 20,475 ( 0.00%) pub fn lifetime(&self) -> Option { . let token = self.uninterpolate(); 48,746 ( 0.00%) match token.kind { 3,450 ( 0.00%) Lifetime(name) => Some(Ident::new(name, token.span)), . _ => None, . } 143,325 ( 0.00%) } . . /// Returns `true` if the token is an identifier. . pub fn is_ident(&self) -> bool { . self.ident().is_some() 10,610 ( 0.00%) } . . /// Returns `true` if the token is a lifetime. 3,898 ( 0.00%) pub fn is_lifetime(&self) -> bool { . self.lifetime().is_some() 7,796 ( 0.00%) } . . /// Returns `true` if the token is an identifier whose name is the given . /// string slice. 15,390 ( 0.00%) pub fn is_ident_named(&self, name: Symbol) -> bool { . self.ident().map_or(false, |(ident, _)| ident.name == name) 30,780 ( 0.00%) } . . /// Returns `true` if the token is an interpolated path. . fn is_path(&self) -> bool { 105,996 ( 0.00%) if let Interpolated(ref nt) = self.kind { 38 ( 0.00%) if let NtPath(..) = **nt { . return true; . } . } . false . } . . /// Would `maybe_whole_expr` in `parser.rs` return `Ok(..)`? . /// That is, is this a pre-parsed expression dropped into the token stream . /// (which happens while parsing the result of macro expansion)? . pub fn is_whole_expr(&self) -> bool { 20 ( 0.00%) if let Interpolated(ref nt) = self.kind { . if let NtExpr(_) | NtLiteral(_) | NtPath(_) | NtIdent(..) | NtBlock(_) = **nt { . return true; . } . } . . false 10 ( 0.00%) } . . // Is the token an interpolated block (`$b:block`)? . pub fn is_whole_block(&self) -> bool { 1,690 ( 0.00%) if let Interpolated(ref nt) = self.kind { . if let NtBlock(..) = **nt { . return true; . } . } . false 845 ( 0.00%) } . . /// Returns `true` if the token is either the `mut` or `const` keyword. . pub fn is_mutability(&self) -> bool { . self.is_keyword(kw::Mut) || self.is_keyword(kw::Const) . } . 6,782 ( 0.00%) pub fn is_qpath_start(&self) -> bool { 59,830 ( 0.00%) self == &Lt || self == &BinOp(Shl) . } . 106,096 ( 0.00%) pub fn is_path_start(&self) -> bool { 157,531 ( 0.00%) self == &ModSep . || self.is_qpath_start() . || self.is_path() . || self.is_path_segment_keyword() 23,159 ( 0.00%) || self.is_ident() && !self.is_reserved_ident() 132,620 ( 0.00%) } . . /// Returns `true` if the token is a given keyword, `kw`. 261,920 ( 0.00%) pub fn is_keyword(&self, kw: Symbol) -> bool { . self.is_non_raw_ident_where(|id| id.name == kw) 523,840 ( 0.01%) } . 3,783 ( 0.00%) pub fn is_path_segment_keyword(&self) -> bool { . self.is_non_raw_ident_where(Ident::is_path_segment_keyword) . } . . // Returns true for reserved identifiers used internally for elided lifetimes, . // unnamed method parameters, crate root module, error recovery etc. 1,113 ( 0.00%) pub fn is_special_ident(&self) -> bool { . self.is_non_raw_ident_where(Ident::is_special) . } . . /// Returns `true` if the token is a keyword used in the language. 1,116 ( 0.00%) pub fn is_used_keyword(&self) -> bool { . self.is_non_raw_ident_where(Ident::is_used_keyword) . } . . /// Returns `true` if the token is a keyword reserved for possible future use. 1,113 ( 0.00%) pub fn is_unused_keyword(&self) -> bool { . self.is_non_raw_ident_where(Ident::is_unused_keyword) . } . . /// Returns `true` if the token is either a special identifier or a keyword. . pub fn is_reserved_ident(&self) -> bool { . self.is_non_raw_ident_where(Ident::is_reserved) . } . . /// Returns `true` if the token is the identifier `true` or `false`. 3,809 ( 0.00%) pub fn is_bool_lit(&self) -> bool { 7,618 ( 0.00%) self.is_non_raw_ident_where(|id| id.name.is_bool_lit()) . } . . pub fn is_numeric_lit(&self) -> bool { . matches!( . self.kind, . Literal(Lit { kind: LitKind::Integer, .. }) | Literal(Lit { kind: LitKind::Float, .. }) . ) . } . . /// Returns `true` if the token is a non-raw identifier for which `pred` holds. 232 ( 0.00%) pub fn is_non_raw_ident_where(&self, pred: impl FnOnce(Ident) -> bool) -> bool { 1,972,728 ( 0.03%) match self.ident() { 22,424 ( 0.00%) Some((id, false)) => pred(id), . _ => false, . } 290 ( 0.00%) } . 200,360 ( 0.00%) pub fn glue(&self, joint: &Token) -> Option { 100,180 ( 0.00%) let kind = match self.kind { 2,364 ( 0.00%) Eq => match joint.kind { . Eq => EqEq, . Gt => FatArrow, . _ => return None, . }, 291 ( 0.00%) Lt => match joint.kind { . Eq => Le, . Lt => BinOp(Shl), . Le => BinOpEq(Shl), . BinOp(Minus) => LArrow, . _ => return None, . }, 2,699 ( 0.00%) Gt => match joint.kind { . Eq => Ge, . Gt => BinOp(Shr), . Ge => BinOpEq(Shr), . _ => return None, . }, 74 ( 0.00%) Not => match joint.kind { . Eq => Ne, . _ => return None, . }, 6,662 ( 0.00%) BinOp(op) => match joint.kind { . Eq => BinOpEq(op), 118 ( 0.00%) BinOp(And) if op == And => AndAnd, 48 ( 0.00%) BinOp(Or) if op == Or => OrOr, 656 ( 0.00%) Gt if op == Minus => RArrow, . _ => return None, . }, 429 ( 0.00%) Dot => match joint.kind { . Dot => DotDot, . DotDot => DotDotDot, . _ => return None, . }, 48 ( 0.00%) DotDot => match joint.kind { . Dot => DotDotDot, . Eq => DotDotEq, . _ => return None, . }, 4,674 ( 0.00%) Colon => match joint.kind { . Colon => ModSep, . _ => return None, . }, . SingleQuote => match joint.kind { . Ident(name, false) => Lifetime(Symbol::intern(&format!("'{}", name))), . _ => return None, . }, . . Le | EqEq | Ne | Ge | AndAnd | OrOr | Tilde | BinOpEq(..) | At | DotDotDot . | DotDotEq | Comma | Semi | ModSep | RArrow | LArrow | FatArrow | Pound | Dollar . | Question | OpenDelim(..) | CloseDelim(..) | Literal(..) | Ident(..) . | Lifetime(..) | Interpolated(..) | DocComment(..) | Eof => return None, . }; . 52,481 ( 0.00%) Some(Token::new(kind, self.span.to(joint.span))) 180,324 ( 0.00%) } . } . . impl PartialEq for Token { . fn eq(&self, rhs: &TokenKind) -> bool { 929,579 ( 0.01%) self.kind == *rhs . } . } . . #[derive(Clone, Encodable, Decodable)] . /// For interpolation during macro expansion. . pub enum Nonterminal { . NtItem(P), . NtBlock(P), -- line 675 ---------------------------------------- -- line 711 ---------------------------------------- . Path, . Vis, . TT, . } . . impl NonterminalKind { . /// The `edition` closure is used to get the edition for the given symbol. Doing . /// `span.edition()` is expensive, so we do it lazily. 428 ( 0.00%) pub fn from_symbol( . symbol: Symbol, . edition: impl FnOnce() -> Edition, . ) -> Option { 920 ( 0.00%) Some(match symbol { . sym::item => NonterminalKind::Item, . sym::block => NonterminalKind::Block, . sym::stmt => NonterminalKind::Stmt, . sym::pat => match edition() { . Edition::Edition2015 | Edition::Edition2018 => { . NonterminalKind::PatParam { inferred: true } . } . Edition::Edition2021 => NonterminalKind::PatWithOr, -- line 731 ---------------------------------------- -- line 737 ---------------------------------------- . sym::lifetime => NonterminalKind::Lifetime, . sym::literal => NonterminalKind::Literal, . sym::meta => NonterminalKind::Meta, . sym::path => NonterminalKind::Path, . sym::vis => NonterminalKind::Vis, . sym::tt => NonterminalKind::TT, . _ => return None, . }) 428 ( 0.00%) } . fn symbol(self) -> Symbol { . match self { . NonterminalKind::Item => sym::item, . NonterminalKind::Block => sym::block, . NonterminalKind::Stmt => sym::stmt, . NonterminalKind::PatParam { inferred: false } => sym::pat_param, . NonterminalKind::PatParam { inferred: true } | NonterminalKind::PatWithOr => sym::pat, . NonterminalKind::Expr => sym::expr, -- line 753 ---------------------------------------- -- line 765 ---------------------------------------- . . impl fmt::Display for NonterminalKind { . fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { . write!(f, "{}", self.symbol()) . } . } . . impl Nonterminal { 7 ( 0.00%) pub fn span(&self) -> Span { 35 ( 0.00%) match self { . NtItem(item) => item.span, . NtBlock(block) => block.span, . NtStmt(stmt) => stmt.span, . NtPat(pat) => pat.span, . NtExpr(expr) | NtLiteral(expr) => expr.span, . NtTy(ty) => ty.span, 7 ( 0.00%) NtIdent(ident, _) | NtLifetime(ident) => ident.span, . NtMeta(attr_item) => attr_item.span(), . NtPath(path) => path.span, . NtVis(vis) => vis.span, . NtTT(tt) => tt.span(), . } 14 ( 0.00%) } . } . . impl PartialEq for Nonterminal { . fn eq(&self, rhs: &Self) -> bool { . match (self, rhs) { . (NtIdent(ident_lhs, is_raw_lhs), NtIdent(ident_rhs, is_raw_rhs)) => { . ident_lhs == ident_rhs && is_raw_lhs == is_raw_rhs . } -- line 795 ---------------------------------------- 5,707,300 ( 0.08%) -------------------------------------------------------------------------------- -- 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 and . // . 10,527,200 ( 0.15%) if layout.align() <= MIN_ALIGN && layout.align() <= layout.size() { 7,895,400 ( 0.11%) 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. 229,300 ( 0.00%) if layout.align() <= MIN_ALIGN && layout.align() <= layout.size() { 343,950 ( 0.01%) 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) { 2,689,114 ( 0.04%) libc::free(ptr as *mut libc::c_void) . } . . #[inline] . unsafe fn realloc(&self, ptr: *mut u8, layout: Layout, new_size: usize) -> *mut u8 { 997,444 ( 0.01%) if layout.align() <= MIN_ALIGN && layout.align() <= new_size { 1,994,888 ( 0.03%) 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/compiler/rustc_middle/src/ty/relate.rs -------------------------------------------------------------------------------- Ir -- line 28 ---------------------------------------- . . /// Returns a static string we can use for printouts. . fn tag(&self) -> &'static str; . . /// Returns `true` if the value `a` is the "expected" type in the . /// relation. Just affects error messages. . fn a_is_expected(&self) -> bool; . 13,418 ( 0.00%) fn with_cause(&mut self, _cause: Cause, f: F) -> R . where . F: FnOnce(&mut Self) -> R, . { . f(self) 11,831 ( 0.00%) } . . /// Generic relation routine suitable for most anything. 1,610,357 ( 0.02%) fn relate>(&mut self, a: T, b: T) -> RelateResult<'tcx, T> { 888,291 ( 0.01%) Relate::relate(self, a, b) 1,322,237 ( 0.02%) } . . /// Relate the two substitutions for the given item. The default . /// is to look up the variance for the item and proceed . /// accordingly. 262,180 ( 0.00%) fn relate_item_substs( . &mut self, . item_def_id: DefId, . a_subst: SubstsRef<'tcx>, . b_subst: SubstsRef<'tcx>, . ) -> RelateResult<'tcx, SubstsRef<'tcx>> { . debug!( . "relate_item_substs(item_def_id={:?}, a_subst={:?}, b_subst={:?})", . item_def_id, a_subst, b_subst . ); . . let tcx = self.tcx(); . let opt_variances = tcx.variances_of(item_def_id); 104,872 ( 0.00%) relate_substs(self, Some((item_def_id, opt_variances)), a_subst, b_subst) 235,962 ( 0.00%) } . . /// Switch variance for the purpose of relating `a` and `b`. . fn relate_with_variance>( . &mut self, . variance: ty::Variance, . info: ty::VarianceDiagInfo<'tcx>, . a: T, . b: T, -- line 73 ---------------------------------------- -- line 108 ---------------------------------------- . a: Self, . b: Self, . ) -> RelateResult<'tcx, Self>; . } . . /////////////////////////////////////////////////////////////////////////// . // Relate impls . 596,997 ( 0.01%) pub fn relate_type_and_mut<'tcx, R: TypeRelation<'tcx>>( . relation: &mut R, . a: ty::TypeAndMut<'tcx>, . b: ty::TypeAndMut<'tcx>, . base_ty: Ty<'tcx>, . ) -> RelateResult<'tcx, ty::TypeAndMut<'tcx>> { . debug!("{}.mts({:?}, {:?})", relation.tag(), a, b); 106,494 ( 0.00%) if a.mutbl != b.mutbl { 3,156 ( 0.00%) Err(TypeError::Mutability) . } else { . let mutbl = a.mutbl; . let (variance, info) = match mutbl { . ast::Mutability::Not => (ty::Covariant, ty::VarianceDiagInfo::None), . ast::Mutability::Mut => { . (ty::Invariant, ty::VarianceDiagInfo::Invariant { ty: base_ty, param_index: 0 }) . } . }; 46,086 ( 0.00%) let ty = relation.relate_with_variance(variance, info, a.ty, b.ty)?; 262,026 ( 0.00%) Ok(ty::TypeAndMut { ty, mutbl }) . } 600,281 ( 0.01%) } . 270 ( 0.00%) pub fn relate_substs<'tcx, R: TypeRelation<'tcx>>( . relation: &mut R, . variances: Option<(DefId, &[ty::Variance])>, . a_subst: SubstsRef<'tcx>, . b_subst: SubstsRef<'tcx>, . ) -> RelateResult<'tcx, SubstsRef<'tcx>> { 359,516 ( 0.01%) let tcx = relation.tcx(); 168,420 ( 0.00%) let mut cached_ty = None; . . let params = iter::zip(a_subst, b_subst).enumerate().map(|(i, (a, b))| { 1,015,100 ( 0.01%) let (variance, variance_info) = match variances { 107,826 ( 0.00%) Some((ty_def_id, variances)) => { 161,739 ( 0.00%) let variance = variances[i]; 53,913 ( 0.00%) let variance_info = if variance == ty::Invariant { . let ty = 18,923 ( 0.00%) cached_ty.get_or_insert_with(|| tcx.type_of(ty_def_id).subst(tcx, a_subst)); . ty::VarianceDiagInfo::Invariant { ty, param_index: i.try_into().unwrap() } . } else { . ty::VarianceDiagInfo::default() . }; . (variance, variance_info) . } . None => (ty::Invariant, ty::VarianceDiagInfo::default()), . }; 237,111 ( 0.00%) relation.relate_with_variance(variance, variance_info, a, b) . }); . . tcx.mk_substs(params) 324 ( 0.00%) } . . impl<'tcx> Relate<'tcx> for ty::FnSig<'tcx> { 42,926 ( 0.00%) fn relate>( . relation: &mut R, . a: ty::FnSig<'tcx>, . b: ty::FnSig<'tcx>, . ) -> RelateResult<'tcx, ty::FnSig<'tcx>> { . let tcx = relation.tcx(); . 19,812 ( 0.00%) if a.c_variadic != b.c_variadic { . return Err(TypeError::VariadicMismatch(expected_found( . relation, . a.c_variadic, . b.c_variadic, . ))); . } 16,278 ( 0.00%) let unsafety = relation.relate(a.unsafety, b.unsafety)?; . let abi = relation.relate(a.abi, b.abi)?; . 28,183 ( 0.00%) if a.inputs().len() != b.inputs().len() { . return Err(TypeError::ArgCount); . } . 29,718 ( 0.00%) let inputs_and_output = iter::zip(a.inputs(), b.inputs()) 12,727 ( 0.00%) .map(|(&a, &b)| ((a, b), false)) 26,416 ( 0.00%) .chain(iter::once(((a.output(), b.output()), true))) 4,370 ( 0.00%) .map(|((a, b), is_output)| { 4,370 ( 0.00%) if is_output { 2,420 ( 0.00%) relation.relate(a, b) . } else { . relation.relate_with_variance( . ty::Contravariant, . ty::VarianceDiagInfo::default(), . a, . b, . ) . } . }) . .enumerate() 20,290 ( 0.00%) .map(|(i, r)| match r { . Err(TypeError::Sorts(exp_found) | TypeError::ArgumentSorts(exp_found, _)) => { . Err(TypeError::ArgumentSorts(exp_found, i)) . } . Err(TypeError::Mutability | TypeError::ArgumentMutability(_)) => { . Err(TypeError::ArgumentMutability(i)) . } 28,906 ( 0.00%) r => r, . }); 24,649 ( 0.00%) Ok(ty::FnSig { . inputs_and_output: tcx.mk_type_list(inputs_and_output)?, 3,302 ( 0.00%) c_variadic: a.c_variadic, . unsafety, . abi, . }) 29,718 ( 0.00%) } . } . . impl<'tcx> Relate<'tcx> for ty::BoundConstness { . fn relate>( . relation: &mut R, . a: ty::BoundConstness, . b: ty::BoundConstness, . ) -> RelateResult<'tcx, ty::BoundConstness> { 8 ( 0.00%) if a != b { . Err(TypeError::ConstnessMismatch(expected_found(relation, a, b))) . } else { . Ok(a) . } . } . } . . impl<'tcx> Relate<'tcx> for ast::Unsafety { . fn relate>( . relation: &mut R, . a: ast::Unsafety, . b: ast::Unsafety, . ) -> RelateResult<'tcx, ast::Unsafety> { 3,302 ( 0.00%) if a != b { . Err(TypeError::UnsafetyMismatch(expected_found(relation, a, b))) . } else { . Ok(a) . } . } . } . . impl<'tcx> Relate<'tcx> for abi::Abi { -- line 252 ---------------------------------------- -- line 255 ---------------------------------------- . a: abi::Abi, . b: abi::Abi, . ) -> RelateResult<'tcx, abi::Abi> { . if a == b { Ok(a) } else { Err(TypeError::AbiMismatch(expected_found(relation, a, b))) } . } . } . . impl<'tcx> Relate<'tcx> for ty::ProjectionTy<'tcx> { 9,490 ( 0.00%) fn relate>( . relation: &mut R, . a: ty::ProjectionTy<'tcx>, . b: ty::ProjectionTy<'tcx>, . ) -> RelateResult<'tcx, ty::ProjectionTy<'tcx>> { 2,055 ( 0.00%) if a.item_def_id != b.item_def_id { . Err(TypeError::ProjectionMismatched(expected_found( . relation, . a.item_def_id, . b.item_def_id, . ))) . } else { . let substs = relation.relate(a.substs, b.substs)?; 2,664 ( 0.00%) Ok(ty::ProjectionTy { item_def_id: a.item_def_id, substs: &substs }) . } 6,125 ( 0.00%) } . } . . impl<'tcx> Relate<'tcx> for ty::ExistentialProjection<'tcx> { 4,061 ( 0.00%) fn relate>( . relation: &mut R, . a: ty::ExistentialProjection<'tcx>, . b: ty::ExistentialProjection<'tcx>, . ) -> RelateResult<'tcx, ty::ExistentialProjection<'tcx>> { 2,842 ( 0.00%) if a.item_def_id != b.item_def_id { . Err(TypeError::ProjectionMismatched(expected_found( . relation, . a.item_def_id, . b.item_def_id, . ))) . } else { . let term = relation.relate_with_variance( . ty::Invariant, . ty::VarianceDiagInfo::default(), 1,321 ( 0.00%) a.term, 1,525 ( 0.00%) b.term, . )?; 1,071 ( 0.00%) let substs = relation.relate_with_variance( . ty::Invariant, . ty::VarianceDiagInfo::default(), 406 ( 0.00%) a.substs, 406 ( 0.00%) b.substs, . )?; 3,867 ( 0.00%) Ok(ty::ExistentialProjection { item_def_id: a.item_def_id, substs, term }) . } 3,654 ( 0.00%) } . } . . impl<'tcx> Relate<'tcx> for ty::TraitRef<'tcx> { 676,733 ( 0.01%) fn relate>( . relation: &mut R, . a: ty::TraitRef<'tcx>, . b: ty::TraitRef<'tcx>, . ) -> RelateResult<'tcx, ty::TraitRef<'tcx>> { . // Different traits cannot be related. 145,461 ( 0.00%) if a.def_id != b.def_id { 603 ( 0.00%) Err(TypeError::Traits(expected_found(relation, a.def_id, b.def_id))) . } else { 48,420 ( 0.00%) let substs = relate_substs(relation, None, a.substs, b.substs)?; 117,704 ( 0.00%) Ok(ty::TraitRef { def_id: a.def_id, substs }) . } 434,963 ( 0.01%) } . } . . impl<'tcx> Relate<'tcx> for ty::ExistentialTraitRef<'tcx> { 3,619 ( 0.00%) fn relate>( . relation: &mut R, . a: ty::ExistentialTraitRef<'tcx>, . b: ty::ExistentialTraitRef<'tcx>, . ) -> RelateResult<'tcx, ty::ExistentialTraitRef<'tcx>> { . // Different traits cannot be related. 5,748 ( 0.00%) if a.def_id != b.def_id { . Err(TypeError::Traits(expected_found(relation, a.def_id, b.def_id))) . } else { 2,566 ( 0.00%) let substs = relate_substs(relation, None, a.substs, b.substs)?; 3,214 ( 0.00%) Ok(ty::ExistentialTraitRef { def_id: a.def_id, substs }) . } 2,303 ( 0.00%) } . } . . #[derive(Copy, Debug, Clone, TypeFoldable)] . struct GeneratorWitness<'tcx>(&'tcx ty::List>); . . impl<'tcx> Relate<'tcx> for GeneratorWitness<'tcx> { . fn relate>( . relation: &mut R, . a: GeneratorWitness<'tcx>, . b: GeneratorWitness<'tcx>, . ) -> RelateResult<'tcx, GeneratorWitness<'tcx>> { 12 ( 0.00%) assert_eq!(a.0.len(), b.0.len()); . let tcx = relation.tcx(); . let types = tcx.mk_type_list(iter::zip(a.0, b.0).map(|(a, b)| relation.relate(a, b)))?; . Ok(GeneratorWitness(types)) . } . } . . impl<'tcx> Relate<'tcx> for Ty<'tcx> { . #[inline] . fn relate>( . relation: &mut R, . a: Ty<'tcx>, . b: Ty<'tcx>, . ) -> RelateResult<'tcx, Ty<'tcx>> { 1,157,708 ( 0.02%) relation.tys(a, b) . } . } . . /// The main "type relation" routine. Note that this does not handle . /// inference artifacts, so you should filter those out before calling . /// it. 2,515,872 ( 0.04%) pub fn super_relate_tys<'tcx, R: TypeRelation<'tcx>>( . relation: &mut R, . a: Ty<'tcx>, . b: Ty<'tcx>, . ) -> RelateResult<'tcx, Ty<'tcx>> { . let tcx = relation.tcx(); . debug!("super_relate_tys: a={:?} b={:?}", a, b); 5,584,338 ( 0.08%) match (a.kind(), b.kind()) { . (&ty::Infer(_), _) | (_, &ty::Infer(_)) => { . // The caller should handle these cases! . bug!("var types encountered in super_relate_tys") . } . . (ty::Bound(..), _) | (_, ty::Bound(..)) => { . bug!("bound types encountered in super_relate_tys") . } -- line 388 ---------------------------------------- -- line 391 ---------------------------------------- . . (&ty::Never, _) . | (&ty::Char, _) . | (&ty::Bool, _) . | (&ty::Int(_), _) . | (&ty::Uint(_), _) . | (&ty::Float(_), _) . | (&ty::Str, _) 38,286 ( 0.00%) if a == b => . { . Ok(a) . } . 12,130 ( 0.00%) (&ty::Param(ref a_p), &ty::Param(ref b_p)) if a_p.index == b_p.index => Ok(a), . . (ty::Placeholder(p1), ty::Placeholder(p2)) if p1 == p2 => Ok(a), . 1,146,550 ( 0.02%) (&ty::Adt(a_def, a_substs), &ty::Adt(b_def, b_substs)) if a_def == b_def => { 356,981 ( 0.01%) let substs = relation.relate_item_substs(a_def.did, a_substs, b_substs)?; . Ok(tcx.mk_adt(a_def, substs)) . } . . (&ty::Foreign(a_id), &ty::Foreign(b_id)) if a_id == b_id => Ok(tcx.mk_foreign(a_id)), . 13,671 ( 0.00%) (&ty::Dynamic(a_obj, a_region), &ty::Dynamic(b_obj, b_region)) => { 3,856 ( 0.00%) let region_bound = relation.with_cause(Cause::ExistentialRegionBound, |relation| { . relation.relate_with_variance( . ty::Contravariant, . ty::VarianceDiagInfo::default(), 1,928 ( 0.00%) a_region, . b_region, . ) . })?; . Ok(tcx.mk_dynamic(relation.relate(a_obj, b_obj)?, region_bound)) . } . 32 ( 0.00%) (&ty::Generator(a_id, a_substs, movability), &ty::Generator(b_id, b_substs, _)) 40 ( 0.00%) if a_id == b_id => . { . // All Generator types with the same id represent . // the (anonymous) type of the same generator expression. So . // all of their regions should be equated. 16 ( 0.00%) let substs = relation.relate(a_substs, b_substs)?; . Ok(tcx.mk_generator(a_id, substs, movability)) . } . 15 ( 0.00%) (&ty::GeneratorWitness(a_types), &ty::GeneratorWitness(b_types)) => { . // Wrap our types with a temporary GeneratorWitness struct . // inside the binder so we can related them . let a_types = a_types.map_bound(GeneratorWitness); . let b_types = b_types.map_bound(GeneratorWitness); . // Then remove the GeneratorWitness for the result . let types = relation.relate(a_types, b_types)?.map_bound(|witness| witness.0); . Ok(tcx.mk_generator_witness(types)) . } . 7,056 ( 0.00%) (&ty::Closure(a_id, a_substs), &ty::Closure(b_id, b_substs)) if a_id == b_id => { . // All Closure types with the same id represent . // the (anonymous) type of the same closure expression. So . // all of their regions should be equated. 1,764 ( 0.00%) let substs = relation.relate(a_substs, b_substs)?; . Ok(tcx.mk_closure(a_id, &substs)) . } . 3,892 ( 0.00%) (&ty::RawPtr(a_mt), &ty::RawPtr(b_mt)) => { 2,265 ( 0.00%) let mt = relate_type_and_mut(relation, a_mt, b_mt, a)?; . Ok(tcx.mk_ptr(mt)) . } . 1,017,467 ( 0.01%) (&ty::Ref(a_r, a_ty, a_mutbl), &ty::Ref(b_r, b_ty, b_mutbl)) => { 451,822 ( 0.01%) let r = relation.relate_with_variance( . ty::Contravariant, . ty::VarianceDiagInfo::default(), . a_r, . b_r, . )?; . let a_mt = ty::TypeAndMut { ty: a_ty, mutbl: a_mutbl }; . let b_mt = ty::TypeAndMut { ty: b_ty, mutbl: b_mutbl }; 672,312 ( 0.01%) let mt = relate_type_and_mut(relation, a_mt, b_mt, a)?; . Ok(tcx.mk_ref(r, mt)) . } . 44,995 ( 0.00%) (&ty::Array(a_t, sz_a), &ty::Array(b_t, sz_b)) => { 10,899 ( 0.00%) let t = relation.relate(a_t, b_t)?; 18,000 ( 0.00%) match relation.relate(sz_a, sz_b) { 17,112 ( 0.00%) Ok(sz) => Ok(tcx.mk_ty(ty::Array(t, sz))), . Err(err) => { . // Check whether the lengths are both concrete/known values, . // but are unequal, for better diagnostics. . // . // It might seem dubious to eagerly evaluate these constants here, . // we however cannot end up with errors in `Relate` during both . // `type_of` and `predicates_of`. This means that evaluating the . // constants should not cause cycle errors here. 16,480 ( 0.00%) let sz_a = sz_a.try_eval_usize(tcx, relation.param_env()); 9,888 ( 0.00%) let sz_b = sz_b.try_eval_usize(tcx, relation.param_env()); 19,776 ( 0.00%) match (sz_a, sz_b) { 13,184 ( 0.00%) (Some(sz_a_val), Some(sz_b_val)) if sz_a_val != sz_b_val => Err( . TypeError::FixedArraySize(expected_found(relation, sz_a_val, sz_b_val)), . ), . _ => Err(err), . } . } . } . } . 27,310 ( 0.00%) (&ty::Slice(a_t), &ty::Slice(b_t)) => { 3,108 ( 0.00%) let t = relation.relate(a_t, b_t)?; . Ok(tcx.mk_slice(t)) . } . 35,602 ( 0.00%) (&ty::Tuple(as_), &ty::Tuple(bs)) => { 35,602 ( 0.00%) if as_.len() == bs.len() { . Ok(tcx.mk_tup( 190,740 ( 0.00%) iter::zip(as_, bs).map(|(a, b)| relation.relate(a.expect_ty(), b.expect_ty())), . )?) . } else if !(as_.is_empty() || bs.is_empty()) { . Err(TypeError::TupleSize(expected_found(relation, as_.len(), bs.len()))) . } else { . Err(TypeError::Sorts(expected_found(relation, a, b))) . } . } . 5,742 ( 0.00%) (&ty::FnDef(a_def_id, a_substs), &ty::FnDef(b_def_id, b_substs)) 9,570 ( 0.00%) if a_def_id == b_def_id => . { 7,656 ( 0.00%) let substs = relation.relate_item_substs(a_def_id, a_substs, b_substs)?; . Ok(tcx.mk_fn_def(a_def_id, substs)) . } . . (&ty::FnPtr(a_fty), &ty::FnPtr(b_fty)) => { 27,800 ( 0.00%) let fty = relation.relate(a_fty, b_fty)?; . Ok(tcx.mk_fn_ptr(fty)) . } . . // these two are already handled downstream in case of lazy normalization 100 ( 0.00%) (&ty::Projection(a_data), &ty::Projection(b_data)) => { . let projection_ty = relation.relate(a_data, b_data)?; . Ok(tcx.mk_projection(projection_ty.item_def_id, projection_ty.substs)) . } . 108 ( 0.00%) (&ty::Opaque(a_def_id, a_substs), &ty::Opaque(b_def_id, b_substs)) 270 ( 0.00%) if a_def_id == b_def_id => . { 324 ( 0.00%) let substs = relate_substs(relation, None, a_substs, b_substs)?; . Ok(tcx.mk_opaque(a_def_id, substs)) . } . . _ => Err(TypeError::Sorts(expected_found(relation, a, b))), . } 2,830,356 ( 0.04%) } . . /// The main "const relation" routine. Note that this does not handle . /// inference artifacts, so you should filter those out before calling . /// it. 53,190 ( 0.00%) pub fn super_relate_consts<'tcx, R: TypeRelation<'tcx>>( . relation: &mut R, . a: &'tcx ty::Const<'tcx>, . b: &'tcx ty::Const<'tcx>, . ) -> RelateResult<'tcx, &'tcx ty::Const<'tcx>> { . debug!("{}.super_relate_consts(a = {:?}, b = {:?})", relation.tag(), a, b); . let tcx = relation.tcx(); . . // FIXME(oli-obk): once const generics can have generic types, this assertion . // will likely get triggered. Move to `normalize_erasing_regions` at that point. 10,638 ( 0.00%) let a_ty = tcx.erase_regions(a.ty); 10,638 ( 0.00%) let b_ty = tcx.erase_regions(b.ty); 5,319 ( 0.00%) if a_ty != b_ty { . relation.tcx().sess.delay_span_bug( . DUMMY_SP, . &format!("cannot relate constants of different types: {} != {}", a_ty, b_ty), . ); . } . . let eagerly_eval = |x: &'tcx ty::Const<'tcx>| x.eval(tcx, relation.param_env()); 5,319 ( 0.00%) let a = eagerly_eval(a); 10,638 ( 0.00%) let b = eagerly_eval(b); . . // Currently, the values that can be unified are primitive types, . // and those that derive both `PartialEq` and `Eq`, corresponding . // to structural-match types. 58,509 ( 0.00%) let is_match = match (a.val, b.val) { . (ty::ConstKind::Infer(_), _) | (_, ty::ConstKind::Infer(_)) => { . // The caller should handle these cases! . bug!("var types encountered in super_relate_consts: {:?} {:?}", a, b) . } . . (ty::ConstKind::Error(_), _) => return Ok(a), . (_, ty::ConstKind::Error(_)) => return Ok(b), . -- line 580 ---------------------------------------- -- line 608 ---------------------------------------- . substs, . promoted: au.promoted, . }), . ty: a.ty, . })); . } . _ => false, . }; 28,618 ( 0.00%) if is_match { Ok(a) } else { Err(TypeError::ConstMismatch(expected_found(relation, a, b))) } 47,871 ( 0.00%) } . . fn check_const_value_eq<'tcx, R: TypeRelation<'tcx>>( . relation: &mut R, . a_val: ConstValue<'tcx>, . b_val: ConstValue<'tcx>, . // FIXME(oli-obk): these arguments should go away with valtrees . a: &'tcx ty::Const<'tcx>, . b: &'tcx ty::Const<'tcx>, . // FIXME(oli-obk): this should just be `bool` with valtrees . ) -> RelateResult<'tcx, bool> { 5,319 ( 0.00%) let tcx = relation.tcx(); 58,509 ( 0.00%) Ok(match (a_val, b_val) { 117,018 ( 0.00%) (ConstValue::Scalar(Scalar::Int(a_val)), ConstValue::Scalar(Scalar::Int(b_val))) => { 5,319 ( 0.00%) a_val == b_val . } . ( . ConstValue::Scalar(Scalar::Ptr(a_val, _a_size)), . ConstValue::Scalar(Scalar::Ptr(b_val, _b_size)), . ) => { . a_val == b_val . || match (tcx.global_alloc(a_val.provenance), tcx.global_alloc(b_val.provenance)) { . (GlobalAlloc::Function(a_instance), GlobalAlloc::Function(b_instance)) => { -- line 639 ---------------------------------------- -- line 672 ---------------------------------------- . } . } . . _ => false, . }) . } . . impl<'tcx> Relate<'tcx> for &'tcx ty::List>> { 19,630 ( 0.00%) fn relate>( . relation: &mut R, . a: Self, . b: Self, . ) -> RelateResult<'tcx, Self> { 1,963 ( 0.00%) let tcx = relation.tcx(); . . // FIXME: this is wasteful, but want to do a perf run to see how slow it is. . // We need to perform this deduplication as we sometimes generate duplicate projections . // in `a`. . let mut a_v: Vec<_> = a.into_iter().collect(); . let mut b_v: Vec<_> = b.into_iter().collect(); . // `skip_binder` here is okay because `stable_cmp` doesn't look at binders 6,028 ( 0.00%) a_v.sort_by(|a, b| a.skip_binder().stable_cmp(tcx, &b.skip_binder())); . a_v.dedup(); . b_v.sort_by(|a, b| a.skip_binder().stable_cmp(tcx, &b.skip_binder())); . b_v.dedup(); 5,889 ( 0.00%) if a_v.len() != b_v.len() { 32 ( 0.00%) return Err(TypeError::ExistentialMismatch(expected_found(relation, a, b))); . } . 7,820 ( 0.00%) let v = iter::zip(a_v, b_v).map(|(ep_a, ep_b)| { . use crate::ty::ExistentialPredicate::*; 12,994 ( 0.00%) match (ep_a.skip_binder(), ep_b.skip_binder()) { 6,840 ( 0.00%) (Trait(a), Trait(b)) => Ok(ep_a 245 ( 0.00%) .rebind(Trait(relation.relate(ep_a.rebind(a), ep_b.rebind(b))?.skip_binder()))), 1,211 ( 0.00%) (Projection(a), Projection(b)) => Ok(ep_a.rebind(Projection( 1,148 ( 0.00%) relation.relate(ep_a.rebind(a), ep_b.rebind(b))?.skip_binder(), . ))), 2,569 ( 0.00%) (AutoTrait(a), AutoTrait(b)) if a == b => Ok(ep_a.rebind(AutoTrait(a))), . _ => Err(TypeError::ExistentialMismatch(expected_found(relation, a, b))), . } . }); 3,910 ( 0.00%) tcx.mk_poly_existential_predicates(v) 15,704 ( 0.00%) } . } . . impl<'tcx> Relate<'tcx> for ty::ClosureSubsts<'tcx> { . fn relate>( . relation: &mut R, . a: ty::ClosureSubsts<'tcx>, . b: ty::ClosureSubsts<'tcx>, . ) -> RelateResult<'tcx, ty::ClosureSubsts<'tcx>> { -- line 722 ---------------------------------------- -- line 737 ---------------------------------------- . } . . impl<'tcx> Relate<'tcx> for SubstsRef<'tcx> { . fn relate>( . relation: &mut R, . a: SubstsRef<'tcx>, . b: SubstsRef<'tcx>, . ) -> RelateResult<'tcx, SubstsRef<'tcx>> { 1,981 ( 0.00%) relate_substs(relation, None, a, b) . } . } . . impl<'tcx> Relate<'tcx> for ty::Region<'tcx> { . fn relate>( . relation: &mut R, . a: ty::Region<'tcx>, . b: ty::Region<'tcx>, . ) -> RelateResult<'tcx, ty::Region<'tcx>> { 519,773 ( 0.01%) relation.regions(a, b) . } . } . . impl<'tcx> Relate<'tcx> for &'tcx ty::Const<'tcx> { . fn relate>( . relation: &mut R, . a: &'tcx ty::Const<'tcx>, . b: &'tcx ty::Const<'tcx>, . ) -> RelateResult<'tcx, &'tcx ty::Const<'tcx>> { 22,296 ( 0.00%) relation.consts(a, b) . } . } . . impl<'tcx, T: Relate<'tcx>> Relate<'tcx> for ty::Binder<'tcx, T> { . fn relate>( . relation: &mut R, . a: ty::Binder<'tcx, T>, . b: ty::Binder<'tcx, T>, . ) -> RelateResult<'tcx, ty::Binder<'tcx, T>> { 47,688 ( 0.00%) relation.binders(a, b) . } . } . . impl<'tcx> Relate<'tcx> for GenericArg<'tcx> { 806,779 ( 0.01%) fn relate>( . relation: &mut R, . a: GenericArg<'tcx>, . b: GenericArg<'tcx>, . ) -> RelateResult<'tcx, GenericArg<'tcx>> { 1,008,914 ( 0.01%) match (a.unpack(), b.unpack()) { . (GenericArgKind::Lifetime(a_lt), GenericArgKind::Lifetime(b_lt)) => { . Ok(relation.relate(a_lt, b_lt)?.into()) . } . (GenericArgKind::Type(a_ty), GenericArgKind::Type(b_ty)) => { 6,573 ( 0.00%) Ok(relation.relate(a_ty, b_ty)?.into()) . } . (GenericArgKind::Const(a_ct), GenericArgKind::Const(b_ct)) => { . Ok(relation.relate(a_ct, b_ct)?.into()) . } . (GenericArgKind::Lifetime(unpacked), x) => { . bug!("impossible case reached: can't relate: {:?} with {:?}", unpacked, x) . } . (GenericArgKind::Type(unpacked), x) => { . bug!("impossible case reached: can't relate: {:?} with {:?}", unpacked, x) . } . (GenericArgKind::Const(unpacked), x) => { . bug!("impossible case reached: can't relate: {:?} with {:?}", unpacked, x) . } . } 855,887 ( 0.01%) } . } . . impl<'tcx> Relate<'tcx> for ty::ImplPolarity { . fn relate>( . relation: &mut R, . a: ty::ImplPolarity, . b: ty::ImplPolarity, . ) -> RelateResult<'tcx, ty::ImplPolarity> { 8 ( 0.00%) if a != b { . Err(TypeError::PolarityMismatch(expected_found(relation, a, b))) . } else { . Ok(a) . } . } . } . . impl<'tcx> Relate<'tcx> for ty::TraitPredicate<'tcx> { 2,882 ( 0.00%) fn relate>( . relation: &mut R, . a: ty::TraitPredicate<'tcx>, . b: ty::TraitPredicate<'tcx>, . ) -> RelateResult<'tcx, ty::TraitPredicate<'tcx>> { 48 ( 0.00%) Ok(ty::TraitPredicate { 1,325 ( 0.00%) trait_ref: relation.relate(a.trait_ref, b.trait_ref)?, 48 ( 0.00%) constness: relation.relate(a.constness, b.constness)?, 16 ( 0.00%) polarity: relation.relate(a.polarity, b.polarity)?, . }) 2,363 ( 0.00%) } . } . . impl<'tcx> Relate<'tcx> for ty::Term<'tcx> { 1,218 ( 0.00%) fn relate>( . relation: &mut R, . a: Self, . b: Self, . ) -> RelateResult<'tcx, Self> { 2,842 ( 0.00%) Ok(match (a, b) { 459 ( 0.00%) (Term::Ty(a), Term::Ty(b)) => relation.relate(a, b)?.into(), . (Term::Const(a), Term::Const(b)) => relation.relate(a, b)?.into(), . _ => return Err(TypeError::Mismatch), . }) 1,624 ( 0.00%) } . } . . impl<'tcx> Relate<'tcx> for ty::ProjectionPredicate<'tcx> { . fn relate>( . relation: &mut R, . a: ty::ProjectionPredicate<'tcx>, . b: ty::ProjectionPredicate<'tcx>, . ) -> RelateResult<'tcx, ty::ProjectionPredicate<'tcx>> { -- line 855 ---------------------------------------- -- line 862 ---------------------------------------- . . /////////////////////////////////////////////////////////////////////////// . // Error handling . . pub fn expected_found<'tcx, R, T>(relation: &mut R, a: T, b: T) -> ExpectedFound . where . R: TypeRelation<'tcx>, . { 398 ( 0.00%) ExpectedFound::new(relation.a_is_expected(), a, b) . } 6,284,058 ( 0.09%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_parse/src/lexer/mod.rs -------------------------------------------------------------------------------- Ir -- line 26 ---------------------------------------- . pub struct UnmatchedBrace { . pub expected_delim: token::DelimToken, . pub found_delim: Option, . pub found_span: Span, . pub unclosed_span: Option, . pub candidate_span: Option, . } . 644 ( 0.00%) crate fn parse_token_trees<'a>( . sess: &'a ParseSess, . src: &'a str, . start_pos: BytePos, . override_span: Option, . ) -> (PResult<'a, TokenStream>, Vec) { . StringReader { sess, start_pos, pos: start_pos, end_src_index: src.len(), src, override_span } . .into_token_trees() 414 ( 0.00%) } . . struct StringReader<'a> { . sess: &'a ParseSess, . /// Initial position, read-only. . start_pos: BytePos, . /// The absolute offset within the source_map of the current character. . pos: BytePos, . /// Stop reading src at this index. -- line 50 ---------------------------------------- -- line 51 ---------------------------------------- . end_src_index: usize, . /// Source text to tokenize. . src: &'a str, . override_span: Option, . } . . impl<'a> StringReader<'a> { . fn mk_sp(&self, lo: BytePos, hi: BytePos) -> Span { 131,258 ( 0.00%) self.override_span.unwrap_or_else(|| Span::with_root_ctxt(lo, hi)) . } . . /// Returns the next token, and info about preceding whitespace, if any. 669,844 ( 0.01%) fn next_token(&mut self) -> (Spacing, Token) { . let mut spacing = Spacing::Joint; . . // Skip `#!` at the start of the file 191,384 ( 0.00%) let start_src_index = self.src_index(self.pos); 287,076 ( 0.00%) let text: &str = &self.src[start_src_index..self.end_src_index]; . let is_beginning_of_file = self.pos == self.start_pos; 95,692 ( 0.00%) if is_beginning_of_file { 184 ( 0.00%) if let Some(shebang_len) = rustc_lexer::strip_shebang(text) { . self.pos = self.pos + BytePos::from_usize(shebang_len); . spacing = Spacing::Alone; . } . } . . // Skip trivial (whitespace & comments) tokens . loop { 173,270 ( 0.00%) let start_src_index = self.src_index(self.pos); 403,443 ( 0.01%) let text: &str = &self.src[start_src_index..self.end_src_index]; . 134,481 ( 0.00%) if text.is_empty() { . let span = self.mk_sp(self.pos, self.pos); 230 ( 0.00%) return (spacing, Token::new(token::Eof, span)); . } . 403,305 ( 0.01%) let token = rustc_lexer::first_token(text); . 268,870 ( 0.00%) let start = self.pos; 134,435 ( 0.00%) self.pos = self.pos + BytePos::from_usize(token.len); . . debug!("next_token: {:?}({:?})", token.kind, self.str_from(start)); . 1,083,392 ( 0.02%) match self.cook_lexer_token(token.kind, start) { 765,168 ( 0.01%) Some(kind) => { . let span = self.mk_sp(start, self.pos); 573,876 ( 0.01%) return (spacing, Token::new(kind, span)); . } . None => spacing = Spacing::Alone, . } . } 861,228 ( 0.01%) } . . /// Report a fatal lexical error with a given span. . fn fatal_span(&self, sp: Span, m: &str) -> FatalError { . self.sess.span_diagnostic.span_fatal(sp, m) . } . . /// Report a lexical error with a given span. . fn err_span(&self, sp: Span, m: &str) { -- line 110 ---------------------------------------- -- line 130 ---------------------------------------- . ) -> DiagnosticBuilder<'a> { . self.sess . .span_diagnostic . .struct_span_fatal(self.mk_sp(from_pos, to_pos), &format!("{}: {}", m, escaped_char(c))) . } . . /// Detect usages of Unicode codepoints changing the direction of the text on screen and loudly . /// complain about it. 5,257 ( 0.00%) fn lint_unicode_text_flow(&self, start: BytePos) { . // Opening delimiter of the length 2 is not included into the comment text. . let content_start = start + BytePos(2); . let content = self.str_from(content_start); . if contains_text_flow_control_chars(content) { . let span = self.mk_sp(start, self.pos); . self.sess.buffer_lint_with_diagnostic( . &TEXT_DIRECTION_CODEPOINT_IN_COMMENT, . span, . ast::CRATE_NODE_ID, . "unicode codepoint changing visible direction of text present in comment", . BuiltinLintDiagnostics::UnicodeTextFlow(span, content.to_string()), . ); . } 6,008 ( 0.00%) } . . /// Turns simple `rustc_lexer::TokenKind` enum into a rich . /// `rustc_ast::TokenKind`. This turns strings into interned . /// symbols and runs additional validation. . fn cook_lexer_token(&self, token: rustc_lexer::TokenKind, start: BytePos) -> Option { 672,175 ( 0.01%) Some(match token { 2,729 ( 0.00%) rustc_lexer::TokenKind::LineComment { doc_style } => { . // Skip non-doc comments 11,392 ( 0.00%) let doc_style = if let Some(doc_style) = doc_style { . doc_style . } else { . self.lint_unicode_text_flow(start); . return None; . }; . . // Opening delimiter of the length 3 is not included into the symbol. . let content_start = start + BytePos(3); . let content = self.str_from(content_start); 9,890 ( 0.00%) self.cook_doc_comment(content_start, content, CommentKind::Line, doc_style) . } . rustc_lexer::TokenKind::BlockComment { doc_style, terminated } => { . if !terminated { . let msg = match doc_style { . Some(_) => "unterminated block doc-comment", . None => "unterminated block comment", . }; . let last_bpos = self.pos; -- line 179 ---------------------------------------- -- line 198 ---------------------------------------- . let content_end = self.pos - BytePos(if terminated { 2 } else { 0 }); . let content = self.str_from_to(content_start, content_end); . self.cook_doc_comment(content_start, content, CommentKind::Block, doc_style) . } . rustc_lexer::TokenKind::Whitespace => return None, . rustc_lexer::TokenKind::Ident . | rustc_lexer::TokenKind::RawIdent . | rustc_lexer::TokenKind::UnknownPrefix => { 142,080 ( 0.00%) let is_raw_ident = token == rustc_lexer::TokenKind::RawIdent; 177,600 ( 0.00%) let is_unknown_prefix = token == rustc_lexer::TokenKind::UnknownPrefix; . let mut ident_start = start; 71,040 ( 0.00%) if is_raw_ident { . ident_start = ident_start + BytePos(2); . } 106,560 ( 0.00%) if is_unknown_prefix { . self.report_unknown_prefix(start); . } 177,600 ( 0.00%) let sym = nfc_normalize(self.str_from(ident_start)); . let span = self.mk_sp(start, self.pos); 142,080 ( 0.00%) self.sess.symbol_gallery.insert(sym, span); 71,040 ( 0.00%) if is_raw_ident { . if !sym.can_be_raw() { . self.err_span(span, &format!("`{}` cannot be a raw identifier", sym)); . } . self.sess.raw_identifier_spans.borrow_mut().push(span); . } 248,640 ( 0.00%) token::Ident(sym, is_raw_ident) . } . rustc_lexer::TokenKind::InvalidIdent . // Do not recover an identifier with emoji if the codepoint is a confusable . // with a recoverable substitution token, like `âž–`. . if UNICODE_ARRAY . .iter() . .find(|&&(c, _, _)| { . let sym = self.str_from(start); -- line 232 ---------------------------------------- -- line 234 ---------------------------------------- . }) . .is_none() => . { . let sym = nfc_normalize(self.str_from(start)); . let span = self.mk_sp(start, self.pos); . self.sess.bad_unicode_identifiers.borrow_mut().entry(sym).or_default().push(span); . token::Ident(sym, false) . } 33,312 ( 0.00%) rustc_lexer::TokenKind::Literal { kind, suffix_start } => { . let suffix_start = start + BytePos(suffix_start as u32); . let (kind, symbol) = self.cook_lexer_literal(start, suffix_start, kind); 6,246 ( 0.00%) let suffix = if suffix_start < self.pos { . let string = self.str_from(suffix_start); . if string == "_" { . self.sess . .span_diagnostic . .struct_span_warn( . self.mk_sp(suffix_start, self.pos), . "underscore literal suffix is not allowed", . ) -- line 253 ---------------------------------------- -- line 259 ---------------------------------------- . .note( . "see issue #42326 \ . \ . for more information", . ) . .emit(); . None . } else { 90 ( 0.00%) Some(Symbol::intern(string)) . } . } else { . None . }; 16,656 ( 0.00%) token::Literal(token::Lit { kind, symbol, suffix }) . } 466 ( 0.00%) rustc_lexer::TokenKind::Lifetime { starts_with_number } => { . // Include the leading `'` in the real identifier, for macro . // expansion purposes. See #12512 for the gory details of why . // this is necessary. . let lifetime_name = self.str_from(start); 233 ( 0.00%) if starts_with_number { . self.err_span_(start, self.pos, "lifetimes cannot start with a number"); . } 699 ( 0.00%) let ident = Symbol::intern(lifetime_name); 932 ( 0.00%) token::Lifetime(ident) . } . rustc_lexer::TokenKind::Semi => token::Semi, . rustc_lexer::TokenKind::Comma => token::Comma, . rustc_lexer::TokenKind::Dot => token::Dot, . rustc_lexer::TokenKind::OpenParen => token::OpenDelim(token::Paren), . rustc_lexer::TokenKind::CloseParen => token::CloseDelim(token::Paren), . rustc_lexer::TokenKind::OpenBrace => token::OpenDelim(token::Brace), . rustc_lexer::TokenKind::CloseBrace => token::CloseDelim(token::Brace), -- line 291 ---------------------------------------- -- line 324 ---------------------------------------- . err.help("source files must contain UTF-8 encoded text, unexpected null bytes might occur when a different encoding is used"); . } . err.emit(); . token? . } . }) . } . 23,736 ( 0.00%) fn cook_doc_comment( . &self, . content_start: BytePos, . content: &str, . comment_kind: CommentKind, . doc_style: DocStyle, . ) -> TokenKind { 1,978 ( 0.00%) if content.contains('\r') { . for (idx, _) in content.char_indices().filter(|&(_, c)| c == '\r') { . self.err_span_( . content_start + BytePos(idx as u32), . content_start + BytePos(idx as u32 + 1), . match comment_kind { . CommentKind::Line => "bare CR not allowed in doc-comment", . CommentKind::Block => "bare CR not allowed in block doc-comment", . }, -- line 347 ---------------------------------------- -- line 349 ---------------------------------------- . } . } . . let attr_style = match doc_style { . DocStyle::Outer => AttrStyle::Outer, . DocStyle::Inner => AttrStyle::Inner, . }; . 5,934 ( 0.00%) token::DocComment(comment_kind, attr_style, Symbol::intern(content)) 29,670 ( 0.00%) } . . fn cook_lexer_literal( . &self, . start: BytePos, . suffix_start: BytePos, . kind: rustc_lexer::LiteralKind, . ) -> (token::LitKind, Symbol) { . // prefix means `"` or `br"` or `r###"`, ... . let (lit_kind, mode, prefix_len, postfix_len) = match kind { 2 ( 0.00%) rustc_lexer::LiteralKind::Char { terminated } => { 2 ( 0.00%) if !terminated { . self.sess.span_diagnostic.span_fatal_with_code( . self.mk_sp(start, suffix_start), . "unterminated character literal", . error_code!(E0762), . ) . } . (token::Char, Mode::Char, 1, 1) // ' ' . } -- line 377 ---------------------------------------- -- line 380 ---------------------------------------- . self.sess.span_diagnostic.span_fatal_with_code( . self.mk_sp(start + BytePos(1), suffix_start), . "unterminated byte constant", . error_code!(E0763), . ) . } . (token::Byte, Mode::Byte, 2, 1) // b' ' . } 814 ( 0.00%) rustc_lexer::LiteralKind::Str { terminated } => { 814 ( 0.00%) if !terminated { . self.sess.span_diagnostic.span_fatal_with_code( . self.mk_sp(start, suffix_start), . "unterminated double quote string", . error_code!(E0765), . ) . } . (token::Str, Mode::Str, 1, 1) // " " . } 5 ( 0.00%) rustc_lexer::LiteralKind::ByteStr { terminated } => { 5 ( 0.00%) if !terminated { . self.sess.span_diagnostic.span_fatal_with_code( . self.mk_sp(start + BytePos(1), suffix_start), . "unterminated double quote byte string", . error_code!(E0766), . ) . } . (token::ByteStr, Mode::ByteStr, 2, 1) // b" " . } -- line 407 ---------------------------------------- -- line 410 ---------------------------------------- . let n = u32::from(n_hashes); . (token::StrRaw(n_hashes), Mode::RawStr, 2 + n, 1 + n) // r##" "## . } . rustc_lexer::LiteralKind::RawByteStr { n_hashes, err } => { . self.report_raw_str_error(start, err); . let n = u32::from(n_hashes); . (token::ByteStrRaw(n_hashes), Mode::RawByteStr, 3 + n, 1 + n) // br##" "## . } 2,408 ( 0.00%) rustc_lexer::LiteralKind::Int { base, empty_int } => { 1,204 ( 0.00%) return if empty_int { . self.sess . .span_diagnostic . .struct_span_err_with_code( . self.mk_sp(start, suffix_start), . "no valid digits found for number", . error_code!(E0768), . ) . .emit(); . (token::Integer, sym::integer(0)) . } else { . self.validate_int_literal(base, start, suffix_start); 3,612 ( 0.00%) (token::Integer, self.symbol_from_to(start, suffix_start)) . }; . } 57 ( 0.00%) rustc_lexer::LiteralKind::Float { base, empty_exponent } => { 57 ( 0.00%) if empty_exponent { . self.err_span_(start, self.pos, "expected at least one digit in exponent"); . } . 399 ( 0.00%) match base { . Base::Hexadecimal => self.err_span_( . start, . suffix_start, . "hexadecimal float literal is not supported", . ), . Base::Octal => { . self.err_span_(start, suffix_start, "octal float literal is not supported") . } . Base::Binary => { . self.err_span_(start, suffix_start, "binary float literal is not supported") . } . _ => (), . } . 171 ( 0.00%) let id = self.symbol_from_to(start, suffix_start); . return (token::Float, id); . } . }; . let content_start = start + BytePos(prefix_len); . let content_end = suffix_start - BytePos(postfix_len); 2,463 ( 0.00%) let id = self.symbol_from_to(content_start, content_end); . self.validate_literal_escape(mode, content_start, content_end, prefix_len, postfix_len); . (lit_kind, id) . } . . #[inline] . fn src_index(&self, pos: BytePos) -> usize { . (pos - self.start_pos).to_usize() . } . . /// Slice of the source text from `start` up to but excluding `self.pos`, . /// meaning the slice does not include the character `self.ch`. . fn str_from(&self, start: BytePos) -> &str { 237,932 ( 0.00%) self.str_from_to(start, self.pos) . } . . /// As symbol_from, with an explicit endpoint. . fn symbol_from_to(&self, start: BytePos, end: BytePos) -> Symbol { . debug!("taking an ident from {:?} to {:?}", start, end); 18,793 ( 0.00%) Symbol::intern(self.str_from_to(start, end)) . } . . /// Slice of the source text spanning from `start` up to but excluding `end`. 41,408 ( 0.00%) fn str_from_to(&self, start: BytePos, end: BytePos) -> &str { . &self.src[self.src_index(start)..self.src_index(end)] 165,632 ( 0.00%) } . . fn report_raw_str_error(&self, start: BytePos, opt_err: Option) { . match opt_err { . Some(RawStrError::InvalidStarter { bad_char }) => { . self.report_non_started_raw_string(start, bad_char) . } . Some(RawStrError::NoTerminator { expected, found, possible_terminator_offset }) => self . .report_unterminated_raw_string(start, expected, possible_terminator_offset, found), -- line 493 ---------------------------------------- -- line 609 ---------------------------------------- . fn validate_literal_escape( . &self, . mode: Mode, . content_start: BytePos, . content_end: BytePos, . prefix_len: u32, . postfix_len: u32, . ) { 4,926 ( 0.00%) let lit_content = self.str_from_to(content_start, content_end); 223,966 ( 0.00%) unescape::unescape_literal(lit_content, mode, &mut |range, result| { . // Here we only check for errors. The actual unescaping is done later. 51,476 ( 0.00%) if let Err(err) = result { . let span_with_quotes = self . .mk_sp(content_start - BytePos(prefix_len), content_end + BytePos(postfix_len)); . let (start, end) = (range.start as u32, range.end as u32); . let lo = content_start + BytePos(start); . let hi = lo + BytePos(end - start); . let span = self.mk_sp(lo, hi); . emit_unescape_error( . &self.sess.span_diagnostic, -- line 628 ---------------------------------------- -- line 629 ---------------------------------------- . lit_content, . span_with_quotes, . span, . mode, . range, . err, . ); . } 231,642 ( 0.00%) }); . } . . fn validate_int_literal(&self, base: Base, content_start: BytePos, content_end: BytePos) { 4,806 ( 0.00%) let base = match base { . Base::Binary => 2, . Base::Octal => 8, . _ => return, . }; 30 ( 0.00%) let s = self.str_from_to(content_start + BytePos(2), content_end); 180 ( 0.00%) for (idx, c) in s.char_indices() { . let idx = idx as u32; 328 ( 0.00%) if c != '_' && c.to_digit(base).is_none() { . let lo = content_start + BytePos(2 + idx); . let hi = content_start + BytePos(2 + idx + c.len_utf8() as u32); . self.err_span_(lo, hi, &format!("invalid digit for a base {} literal", base)); . } . } . } . } . 319,680 ( 0.00%) pub fn nfc_normalize(string: &str) -> Symbol { . use unicode_normalization::{is_nfc_quick, IsNormalized, UnicodeNormalization}; 71,040 ( 0.00%) match is_nfc_quick(string.chars()) { 355,200 ( 0.01%) IsNormalized::Yes => Symbol::intern(string), . _ => { . let normalized_str: String = string.chars().nfc().collect(); . Symbol::intern(&normalized_str) . } . } . } 418,234 ( 0.01%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/../../stdarch/crates/core_arch/src/x86/sse2.rs -------------------------------------------------------------------------------- Ir -- line 94 ---------------------------------------- . /// Adds packed 32-bit integers in `a` and `b`. . /// . /// [Intel's documentation](https://software.intel.com/sites/landingpage/IntrinsicsGuide/#text=_mm_add_epi32) . #[inline] . #[target_feature(enable = "sse2")] . #[cfg_attr(test, assert_instr(paddd))] . #[stable(feature = "simd_x86", since = "1.27.0")] . pub unsafe fn _mm_add_epi32(a: __m128i, b: __m128i) -> __m128i { 17 ( 0.00%) transmute(simd_add(a.as_i32x4(), b.as_i32x4())) . } . . /// Adds packed 64-bit integers in `a` and `b`. . /// . /// [Intel's documentation](https://software.intel.com/sites/landingpage/IntrinsicsGuide/#text=_mm_add_epi64) . #[inline] . #[target_feature(enable = "sse2")] . #[cfg_attr(test, assert_instr(paddq))] -- line 110 ---------------------------------------- -- line 767 ---------------------------------------- . /// `b`. . /// . /// [Intel's documentation](https://software.intel.com/sites/landingpage/IntrinsicsGuide/#text=_mm_or_si128) . #[inline] . #[target_feature(enable = "sse2")] . #[cfg_attr(test, assert_instr(orps))] . #[stable(feature = "simd_x86", since = "1.27.0")] . pub unsafe fn _mm_or_si128(a: __m128i, b: __m128i) -> __m128i { 6 ( 0.00%) simd_or(a, b) . } . . /// Computes the bitwise XOR of 128 bits (representing integer data) in `a` and . /// `b`. . /// . /// [Intel's documentation](https://software.intel.com/sites/landingpage/IntrinsicsGuide/#text=_mm_xor_si128) . #[inline] . #[target_feature(enable = "sse2")] -- line 783 ---------------------------------------- -- line 790 ---------------------------------------- . /// Compares packed 8-bit integers in `a` and `b` for equality. . /// . /// [Intel's documentation](https://software.intel.com/sites/landingpage/IntrinsicsGuide/#text=_mm_cmpeq_epi8) . #[inline] . #[target_feature(enable = "sse2")] . #[cfg_attr(test, assert_instr(pcmpeqb))] . #[stable(feature = "simd_x86", since = "1.27.0")] . pub unsafe fn _mm_cmpeq_epi8(a: __m128i, b: __m128i) -> __m128i { 1,137,927 ( 0.02%) transmute::(simd_eq(a.as_i8x16(), b.as_i8x16())) . } . . /// Compares packed 16-bit integers in `a` and `b` for equality. . /// . /// [Intel's documentation](https://software.intel.com/sites/landingpage/IntrinsicsGuide/#text=_mm_cmpeq_epi16) . #[inline] . #[target_feature(enable = "sse2")] . #[cfg_attr(test, assert_instr(pcmpeqw))] -- line 806 ---------------------------------------- -- line 823 ---------------------------------------- . /// Compares packed 8-bit integers in `a` and `b` for greater-than. . /// . /// [Intel's documentation](https://software.intel.com/sites/landingpage/IntrinsicsGuide/#text=_mm_cmpgt_epi8) . #[inline] . #[target_feature(enable = "sse2")] . #[cfg_attr(test, assert_instr(pcmpgtb))] . #[stable(feature = "simd_x86", since = "1.27.0")] . pub unsafe fn _mm_cmpgt_epi8(a: __m128i, b: __m128i) -> __m128i { 12 ( 0.00%) transmute::(simd_gt(a.as_i8x16(), b.as_i8x16())) . } . . /// Compares packed 16-bit integers in `a` and `b` for greater-than. . /// . /// [Intel's documentation](https://software.intel.com/sites/landingpage/IntrinsicsGuide/#text=_mm_cmpgt_epi16) . #[inline] . #[target_feature(enable = "sse2")] . #[cfg_attr(test, assert_instr(pcmpgtw))] -- line 839 ---------------------------------------- -- line 856 ---------------------------------------- . /// Compares packed 8-bit integers in `a` and `b` for less-than. . /// . /// [Intel's documentation](https://software.intel.com/sites/landingpage/IntrinsicsGuide/#text=_mm_cmplt_epi8) . #[inline] . #[target_feature(enable = "sse2")] . #[cfg_attr(test, assert_instr(pcmpgtb))] . #[stable(feature = "simd_x86", since = "1.27.0")] . pub unsafe fn _mm_cmplt_epi8(a: __m128i, b: __m128i) -> __m128i { 71,246 ( 0.00%) transmute::(simd_lt(a.as_i8x16(), b.as_i8x16())) . } . . /// Compares packed 16-bit integers in `a` and `b` for less-than. . /// . /// [Intel's documentation](https://software.intel.com/sites/landingpage/IntrinsicsGuide/#text=_mm_cmplt_epi16) . #[inline] . #[target_feature(enable = "sse2")] . #[cfg_attr(test, assert_instr(pcmpgtw))] -- line 872 ---------------------------------------- -- line 1174 ---------------------------------------- . /// `mem_addr` must be aligned on a 16-byte boundary. . /// . /// [Intel's documentation](https://software.intel.com/sites/landingpage/IntrinsicsGuide/#text=_mm_load_si128) . #[inline] . #[target_feature(enable = "sse2")] . #[cfg_attr(test, assert_instr(movaps))] . #[stable(feature = "simd_x86", since = "1.27.0")] . pub unsafe fn _mm_load_si128(mem_addr: *const __m128i) -> __m128i { 414,998 ( 0.01%) *mem_addr . } . . /// Loads 128-bits of integer data from memory into a new vector. . /// . /// `mem_addr` does not need to be aligned on any particular boundary. . /// . /// [Intel's documentation](https://software.intel.com/sites/landingpage/IntrinsicsGuide/#text=_mm_loadu_si128) . #[inline] -- line 1190 ---------------------------------------- -- line 1224 ---------------------------------------- . /// `mem_addr` must be aligned on a 16-byte boundary. . /// . /// [Intel's documentation](https://software.intel.com/sites/landingpage/IntrinsicsGuide/#text=_mm_store_si128) . #[inline] . #[target_feature(enable = "sse2")] . #[cfg_attr(test, assert_instr(movaps))] . #[stable(feature = "simd_x86", since = "1.27.0")] . pub unsafe fn _mm_store_si128(mem_addr: *mut __m128i, a: __m128i) { 6 ( 0.00%) *mem_addr = a; . } . . /// Stores 128-bits of integer data from `a` into memory. . /// . /// `mem_addr` does not need to be aligned on any particular boundary. . /// . /// [Intel's documentation](https://software.intel.com/sites/landingpage/IntrinsicsGuide/#text=_mm_storeu_si128) . #[inline] . #[target_feature(enable = "sse2")] . #[cfg_attr(test, assert_instr(movups))] // FIXME movdqu expected . #[stable(feature = "simd_x86", since = "1.27.0")] . pub unsafe fn _mm_storeu_si128(mem_addr: *mut __m128i, a: __m128i) { 16 ( 0.00%) storeudq(mem_addr as *mut i8, a); . } . . /// Stores the lower 64-bit integer `a` to a memory location. . /// . /// `mem_addr` does not need to be aligned on any particular boundary. . /// . /// [Intel's documentation](https://software.intel.com/sites/landingpage/IntrinsicsGuide/#text=_mm_storel_epi64) . #[inline] -- line 1253 ---------------------------------------- -- line 1373 ---------------------------------------- . /// Returns a mask of the most significant bit of each element in `a`. . /// . /// [Intel's documentation](https://software.intel.com/sites/landingpage/IntrinsicsGuide/#text=_mm_movemask_epi8) . #[inline] . #[target_feature(enable = "sse2")] . #[cfg_attr(test, assert_instr(pmovmskb))] . #[stable(feature = "simd_x86", since = "1.27.0")] . pub unsafe fn _mm_movemask_epi8(a: __m128i) -> i32 { 69,009,089 ( 1.00%) pmovmskb(a.as_i8x16()) . } . . /// Shuffles 32-bit integers in `a` using the control in `IMM8`. . /// . /// [Intel's documentation](https://software.intel.com/sites/landingpage/IntrinsicsGuide/#text=_mm_shuffle_epi32) . #[inline] . #[target_feature(enable = "sse2")] . #[cfg_attr(test, assert_instr(pshufd, IMM8 = 9))] -- line 1389 ---------------------------------------- -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/mir/interpret/pointer.rs -------------------------------------------------------------------------------- Ir -- line 10 ---------------------------------------- . // Pointer arithmetic . //////////////////////////////////////////////////////////////////////////////// . . pub trait PointerArithmetic: HasDataLayout { . // These are not supposed to be overridden. . . #[inline(always)] . fn pointer_size(&self) -> Size { 118 ( 0.00%) self.data_layout().pointer_size . } . . #[inline] . fn machine_usize_max(&self) -> u64 { . self.pointer_size().unsigned_int_max().try_into().unwrap() . } . . #[inline] -- line 26 ---------------------------------------- -- line 49 ---------------------------------------- . } . . /// Helper function: truncate given value-"overflowed flag" pair to pointer size and . /// update "overflowed flag" if there was an overflow. . /// This should be called by all the other methods before returning! . #[inline] . fn truncate_to_ptr(&self, (val, over): (u64, bool)) -> (u64, bool) { . let val = u128::from(val); 9,438,384 ( 0.14%) let max_ptr_plus_1 = 1u128 << self.pointer_size().bits(); . (u64::try_from(val % max_ptr_plus_1).unwrap(), over || val >= max_ptr_plus_1) . } . . #[inline] . fn overflowing_offset(&self, val: u64, i: u64) -> (u64, bool) { . // We do not need to check if i fits in a machine usize. If it doesn't, . // either the wrapping_add will wrap or res will not fit in a pointer. . let res = val.overflowing_add(i); -- line 65 ---------------------------------------- -- line 78 ---------------------------------------- . let (val, over) = self.truncate_to_ptr(res); . (val, over || i < self.machine_isize_min()) . } . } . . #[inline] . fn offset<'tcx>(&self, val: u64, i: u64) -> InterpResult<'tcx, u64> { . let (res, over) = self.overflowing_offset(val, i); 5,243,546 ( 0.08%) if over { throw_ub!(PointerArithOverflow) } else { Ok(res) } . } . . #[inline] . fn signed_offset<'tcx>(&self, val: u64, i: i64) -> InterpResult<'tcx, u64> { . let (res, over) = self.overflowing_signed_offset(val, i); . if over { throw_ub!(PointerArithOverflow) } else { Ok(res) } . } . } -- line 94 ---------------------------------------- -- line 145 ---------------------------------------- . fn get_alloc_id(self) -> AllocId { . self . } . } . . /// Represents a pointer in the Miri engine. . /// . /// Pointers are "tagged" with provenance information; typically the `AllocId` they belong to. 1 ( 0.00%) #[derive(Copy, Clone, Eq, PartialEq, Ord, PartialOrd, TyEncodable, TyDecodable, Hash)] . #[derive(HashStable)] . pub struct Pointer { . pub(super) offset: Size, // kept private to avoid accidental misinterpretation (meaning depends on `Tag` type) . pub provenance: Tag, . } . . static_assert_size!(Pointer, 16); . -- line 161 ---------------------------------------- -- line 189 ---------------------------------------- . fn from(ptr: Pointer) -> Self { . let (tag, offset) = ptr.into_parts(); . Pointer::new(Some(tag), offset) . } . } . . impl Pointer> { . pub fn into_pointer_or_addr(self) -> Result, Size> { 583 ( 0.00%) match self.provenance { . Some(tag) => Ok(Pointer::new(tag, self.offset)), . None => Err(self.offset), . } . } . } . . impl Pointer> { . #[inline(always)] -- line 205 ---------------------------------------- -- line 222 ---------------------------------------- . (self.provenance, self.offset) . } . . pub fn map_provenance(self, f: impl FnOnce(Tag) -> Tag) -> Self { . Pointer { provenance: f(self.provenance), ..self } . } . . #[inline] 3 ( 0.00%) pub fn offset(self, i: Size, cx: &impl HasDataLayout) -> InterpResult<'tcx, Self> { 5 ( 0.00%) Ok(Pointer { 198 ( 0.00%) offset: Size::from_bytes(cx.data_layout().offset(self.offset.bytes(), i.bytes())?), . ..self . }) 4 ( 0.00%) } . . #[inline] . pub fn overflowing_offset(self, i: Size, cx: &impl HasDataLayout) -> (Self, bool) { . let (res, over) = cx.data_layout().overflowing_offset(self.offset.bytes(), i.bytes()); . let ptr = Pointer { offset: Size::from_bytes(res), ..self }; . (ptr, over) . } . -- line 243 ---------------------------------------- 4,195,023 ( 0.06%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/combine.rs -------------------------------------------------------------------------------- Ir -- line 56 ---------------------------------------- . #[derive(Copy, Clone, Debug)] . pub enum RelationDir { . SubtypeOf, . SupertypeOf, . EqTo, . } . . impl<'infcx, 'tcx> InferCtxt<'infcx, 'tcx> { 953,181 ( 0.01%) pub fn super_combine_tys( . &self, . relation: &mut R, . a: Ty<'tcx>, . b: Ty<'tcx>, . ) -> RelateResult<'tcx, Ty<'tcx>> . where . R: TypeRelation<'tcx>, . { . let a_is_expected = relation.a_is_expected(); . 1,038,106 ( 0.02%) match (a.kind(), b.kind()) { . // Relate integral variables to other types 90 ( 0.00%) (&ty::Infer(ty::IntVar(a_id)), &ty::Infer(ty::IntVar(b_id))) => { 495 ( 0.00%) self.inner . .borrow_mut() . .int_unification_table() . .unify_var_var(a_id, b_id) . .map_err(|e| int_unification_error(a_is_expected, e))?; . Ok(a) . } 1,142 ( 0.00%) (&ty::Infer(ty::IntVar(v_id)), &ty::Int(v)) => { 2,284 ( 0.00%) self.unify_integral_variable(a_is_expected, v_id, IntType(v)) . } . (&ty::Int(v), &ty::Infer(ty::IntVar(v_id))) => { . self.unify_integral_variable(!a_is_expected, v_id, IntType(v)) . } 1,496 ( 0.00%) (&ty::Infer(ty::IntVar(v_id)), &ty::Uint(v)) => { 2,992 ( 0.00%) self.unify_integral_variable(a_is_expected, v_id, UintType(v)) . } 41 ( 0.00%) (&ty::Uint(v), &ty::Infer(ty::IntVar(v_id))) => { 82 ( 0.00%) self.unify_integral_variable(!a_is_expected, v_id, UintType(v)) . } . . // Relate floating-point variables to other types . (&ty::Infer(ty::FloatVar(a_id)), &ty::Infer(ty::FloatVar(b_id))) => { . self.inner . .borrow_mut() . .float_unification_table() . .unify_var_var(a_id, b_id) . .map_err(|e| float_unification_error(relation.a_is_expected(), e))?; . Ok(a) . } 20 ( 0.00%) (&ty::Infer(ty::FloatVar(v_id)), &ty::Float(v)) => { 20 ( 0.00%) self.unify_float_variable(a_is_expected, v_id, v) . } 2 ( 0.00%) (&ty::Float(v), &ty::Infer(ty::FloatVar(v_id))) => { 2 ( 0.00%) self.unify_float_variable(!a_is_expected, v_id, v) . } . . // All other cases of inference are errors . (&ty::Infer(_), _) | (_, &ty::Infer(_)) => { 49,535 ( 0.00%) Err(TypeError::Sorts(ty::relate::expected_found(relation, a, b))) . } . 967,776 ( 0.01%) _ => ty::relate::super_relate_tys(relation, a, b), . } 953,181 ( 0.01%) } . 45,252 ( 0.00%) pub fn super_combine_consts( . &self, . relation: &mut R, . a: &'tcx ty::Const<'tcx>, . b: &'tcx ty::Const<'tcx>, . ) -> RelateResult<'tcx, &'tcx ty::Const<'tcx>> . where . R: ConstEquateRelation<'tcx>, . { . debug!("{}.consts({:?}, {:?})", relation.tag(), a, b); 37,020 ( 0.00%) if a == b { . return Ok(a); . } . 11,289 ( 0.00%) let a = replace_if_possible(&mut self.inner.borrow_mut().const_unification_table(), a); 11,289 ( 0.00%) let b = replace_if_possible(&mut self.inner.borrow_mut().const_unification_table(), b); . . let a_is_expected = relation.a_is_expected(); . 50,842 ( 0.00%) match (a.val, b.val) { . ( . ty::ConstKind::Infer(InferConst::Var(a_vid)), . ty::ConstKind::Infer(InferConst::Var(b_vid)), . ) => { . self.inner . .borrow_mut() . .const_unification_table() . .unify_var_var(a_vid, b_vid) -- line 150 ---------------------------------------- -- line 158 ---------------------------------------- . bug!("tried to combine ConstKind::Infer/ConstKind::Infer(InferConst::Var)") . } . . (ty::ConstKind::Infer(InferConst::Var(vid)), _) => { . return self.unify_const_variable(relation.param_env(), vid, b, a_is_expected); . } . . (_, ty::ConstKind::Infer(InferConst::Var(vid))) => { 2,300 ( 0.00%) return self.unify_const_variable(relation.param_env(), vid, a, !a_is_expected); . } 14 ( 0.00%) (ty::ConstKind::Unevaluated(..), _) if self.tcx.lazy_normalization() => { . // FIXME(#59490): Need to remove the leak check to accommodate . // escaping bound variables here. . if !a.has_escaping_bound_vars() && !b.has_escaping_bound_vars() { . relation.const_equate_obligation(a, b); . } . return Ok(b); . } . (_, ty::ConstKind::Unevaluated(..)) if self.tcx.lazy_normalization() => { -- line 176 ---------------------------------------- -- line 179 ---------------------------------------- . if !a.has_escaping_bound_vars() && !b.has_escaping_bound_vars() { . relation.const_equate_obligation(a, b); . } . return Ok(a); . } . _ => {} . } . 16,515 ( 0.00%) ty::relate::super_relate_consts(relation, a, b) 33,939 ( 0.00%) } . . /// Unifies the const variable `target_vid` with the given constant. . /// . /// This also tests if the given const `ct` contains an inference variable which was previously . /// unioned with `target_vid`. If this is the case, inferring `target_vid` to `ct` . /// would result in an infinite type as we continuously replace an inference variable . /// in `ct` with `ct` itself. . /// -- line 196 ---------------------------------------- -- line 216 ---------------------------------------- . /// of `fn bind` (meaning that its substs contain `N`). . /// . /// `bind(arr)` now infers that the type of `arr` must be `[u8; N]`. . /// The assignment `arr = bind(arr)` now tries to equate `N` with `3 + 4`. . /// . /// As `3 + 4` contains `N` in its substs, this must not succeed. . /// . /// See `src/test/ui/const-generics/occurs-check/` for more examples where this is relevant. 8,740 ( 0.00%) #[instrument(level = "debug", skip(self))] . fn unify_const_variable( . &self, . param_env: ty::ParamEnv<'tcx>, . target_vid: ty::ConstVid<'tcx>, . ct: &'tcx ty::Const<'tcx>, . vid_is_expected: bool, . ) -> RelateResult<'tcx, &'tcx ty::Const<'tcx>> { . let (for_universe, span) = { . let mut inner = self.inner.borrow_mut(); 1,840 ( 0.00%) let variable_table = &mut inner.const_unification_table(); 920 ( 0.00%) let var_value = variable_table.probe_value(target_vid); 920 ( 0.00%) match var_value.val { . ConstVariableValue::Known { value } => { . bug!("instantiating {:?} which has a known value {:?}", target_vid, value) . } . ConstVariableValue::Unknown { universe } => (universe, var_value.origin.span), . } . }; 3,680 ( 0.00%) let value = ConstInferUnifier { infcx: self, span, param_env, for_universe, target_vid } . .relate(ct, ct)?; . 1,840 ( 0.00%) self.inner . .borrow_mut() . .const_unification_table() . .unify_var_value( . target_vid, 2,760 ( 0.00%) ConstVarValue { . origin: ConstVariableOrigin { . kind: ConstVariableOriginKind::ConstInference, . span: DUMMY_SP, . }, . val: ConstVariableValue::Known { value }, . }, . ) . .map(|()| value) . .map_err(|e| const_unification_error(vid_is_expected, e)) . } . 16,074 ( 0.00%) fn unify_integral_variable( . &self, . vid_is_expected: bool, . vid: ty::IntVid, . val: ty::IntVarValue, . ) -> RelateResult<'tcx, Ty<'tcx>> { 21,432 ( 0.00%) self.inner . .borrow_mut() . .int_unification_table() . .unify_var_value(vid, Some(val)) . .map_err(|e| int_unification_error(vid_is_expected, e))?; 5,358 ( 0.00%) match val { 1,142 ( 0.00%) IntType(v) => Ok(self.tcx.mk_mach_int(v)), 5,753 ( 0.00%) UintType(v) => Ok(self.tcx.mk_mach_uint(v)), . } 21,432 ( 0.00%) } . 55 ( 0.00%) fn unify_float_variable( . &self, . vid_is_expected: bool, . vid: ty::FloatVid, . val: ty::FloatTy, . ) -> RelateResult<'tcx, Ty<'tcx>> { 77 ( 0.00%) self.inner . .borrow_mut() . .float_unification_table() . .unify_var_value(vid, Some(ty::FloatVarValue(val))) . .map_err(|e| float_unification_error(vid_is_expected, e))?; 66 ( 0.00%) Ok(self.tcx.mk_mach_float(val)) 77 ( 0.00%) } . } . . impl<'infcx, 'tcx> CombineFields<'infcx, 'tcx> { . pub fn tcx(&self) -> TyCtxt<'tcx> { 136,048 ( 0.00%) self.infcx.tcx . } . . pub fn equate<'a>(&'a mut self, a_is_expected: bool) -> Equate<'a, 'infcx, 'tcx> { . Equate::new(self, a_is_expected) . } . 160,338 ( 0.00%) pub fn sub<'a>(&'a mut self, a_is_expected: bool) -> Sub<'a, 'infcx, 'tcx> { . Sub::new(self, a_is_expected) 80,169 ( 0.00%) } . . pub fn lub<'a>(&'a mut self, a_is_expected: bool) -> Lub<'a, 'infcx, 'tcx> { . Lub::new(self, a_is_expected) . } . 161,828 ( 0.00%) pub fn glb<'a>(&'a mut self, a_is_expected: bool) -> Glb<'a, 'infcx, 'tcx> { . Glb::new(self, a_is_expected) 80,914 ( 0.00%) } . . /// Here, `dir` is either `EqTo`, `SubtypeOf`, or `SupertypeOf`. . /// The idea is that we should ensure that the type `a_ty` is equal . /// to, a subtype of, or a supertype of (respectively) the type . /// to which `b_vid` is bound. . /// . /// Since `b_vid` has not yet been instantiated with a type, we . /// will first instantiate `b_vid` with a *generalized* version . /// of `a_ty`. Generalization introduces other inference . /// variables wherever subtyping could occur. 897,820 ( 0.01%) pub fn instantiate( . &mut self, . a_ty: Ty<'tcx>, . dir: RelationDir, . b_vid: ty::TyVid, . a_is_expected: bool, . ) -> RelateResult<'tcx, ()> { . use self::RelationDir::*; . -- line 333 ---------------------------------------- -- line 342 ---------------------------------------- . // - `a_ty == &'x ?1`, where `'x` is some free region and `?1` is an . // inference variable, . // - and `dir` == `SubtypeOf`. . // . // Then the generalized form `b_ty` would be `&'?2 ?3`, where . // `'?2` and `?3` are fresh region/type inference . // variables. (Down below, we will relate `a_ty <: b_ty`, . // adding constraints like `'x: '?2` and `?1 <: ?3`.) 81,619 ( 0.00%) let Generalization { ty: b_ty, needs_wf } = self.generalize(a_ty, b_vid, dir)?; . debug!( . "instantiate(a_ty={:?}, dir={:?}, b_vid={:?}, generalized b_ty={:?})", . a_ty, dir, b_vid, b_ty . ); 571,333 ( 0.01%) self.infcx.inner.borrow_mut().type_variables().instantiate(b_vid, b_ty); . 81,619 ( 0.00%) if needs_wf { . self.obligations.push(Obligation::new( . self.trace.cause.clone(), . self.param_env, . ty::Binder::dummy(ty::PredicateKind::WellFormed(b_ty.into())) . .to_predicate(self.infcx.tcx), . )); . } . . // Finally, relate `b_ty` to `a_ty`, as described in previous comment. . // . // FIXME(#16847): This code is non-ideal because all these subtype . // relations wind up attributed to the same spans. We need . // to associate causes/spans with each of the relations in . // the stack to get this right. 292,364 ( 0.00%) match dir { 230,150 ( 0.00%) EqTo => self.equate(a_is_expected).relate(a_ty, b_ty), 85,280 ( 0.00%) SubtypeOf => self.sub(a_is_expected).relate(a_ty, b_ty), 37,066 ( 0.00%) SupertypeOf => self.sub(a_is_expected).relate_with_variance( . ty::Contravariant, . ty::VarianceDiagInfo::default(), . a_ty, . b_ty, . ), . }?; . 81,619 ( 0.00%) Ok(()) 652,960 ( 0.01%) } . . /// Attempts to generalize `ty` for the type variable `for_vid`. . /// This checks for cycle -- that is, whether the type `ty` . /// references `for_vid`. The `dir` is the "direction" for which we . /// a performing the generalization (i.e., are we producing a type . /// that can be used as a supertype etc). . /// . /// Preconditions: -- line 392 ---------------------------------------- -- line 401 ---------------------------------------- . debug!("generalize(ty={:?}, for_vid={:?}, dir={:?}", ty, for_vid, dir); . // Determine the ambient variance within which `ty` appears. . // The surrounding equation is: . // . // ty [op] ty2 . // . // where `op` is either `==`, `<:`, or `:>`. This maps quite . // naturally. 326,480 ( 0.00%) let ambient_variance = match dir { . RelationDir::EqTo => ty::Invariant, . RelationDir::SubtypeOf => ty::Covariant, . RelationDir::SupertypeOf => ty::Contravariant, . }; . . debug!("generalize: ambient_variance = {:?}", ambient_variance); . 816,200 ( 0.01%) let for_universe = match self.infcx.inner.borrow_mut().type_variables().probe(for_vid) { . v @ TypeVariableValue::Known { .. } => { . bug!("instantiating {:?} which has a known value {:?}", for_vid, v,) . } . TypeVariableValue::Unknown { universe } => universe, . }; . . debug!("generalize: for_universe = {:?}", for_universe); . debug!("generalize: trace = {:?}", self.trace); . 816,200 ( 0.01%) let mut generalize = Generalizer { . infcx: self.infcx, . cause: &self.trace.cause, . for_vid_sub_root: self.infcx.inner.borrow_mut().type_variables().sub_root_var(for_vid), . for_universe, . ambient_variance, . needs_wf: false, . root_ty: ty, 81,620 ( 0.00%) param_env: self.param_env, . cache: SsoHashMap::new(), . }; . 163,240 ( 0.00%) let ty = match generalize.relate(ty, ty) { 81,619 ( 0.00%) Ok(ty) => ty, . Err(e) => { . debug!("generalize: failure {:?}", e); 6 ( 0.00%) return Err(e); . } . }; 81,619 ( 0.00%) let needs_wf = generalize.needs_wf; . debug!("generalize: success {{ {:?}, {:?} }}", ty, needs_wf); . Ok(Generalization { ty, needs_wf }) . } . . pub fn add_const_equate_obligation( . &mut self, . a_is_expected: bool, . a: &'tcx ty::Const<'tcx>, -- line 454 ---------------------------------------- -- line 528 ---------------------------------------- . /// will force the calling code to check that `WF(Foo)` . /// holds, which in turn implies that `?C::Item == ?D`. So once . /// `?C` is constrained, that should suffice to restrict `?D`. . needs_wf: bool, . } . . impl<'tcx> TypeRelation<'tcx> for Generalizer<'_, 'tcx> { . fn tcx(&self) -> TyCtxt<'tcx> { 223,666 ( 0.00%) self.infcx.tcx . } . fn param_env(&self) -> ty::ParamEnv<'tcx> { 1,551 ( 0.00%) self.param_env . } . . fn tag(&self) -> &'static str { . "Generalizer" . } . . fn a_is_expected(&self) -> bool { . true . } . 14,294 ( 0.00%) fn binders( . &mut self, . a: ty::Binder<'tcx, T>, . b: ty::Binder<'tcx, T>, . ) -> RelateResult<'tcx, ty::Binder<'tcx, T>> . where . T: Relate<'tcx>, . { 21,139 ( 0.00%) Ok(a.rebind(self.relate(a.skip_binder(), b.skip_binder())?)) 14,297 ( 0.00%) } . 823,262 ( 0.01%) fn relate_item_substs( . &mut self, . item_def_id: DefId, . a_subst: SubstsRef<'tcx>, . b_subst: SubstsRef<'tcx>, . ) -> RelateResult<'tcx, SubstsRef<'tcx>> { 74,842 ( 0.00%) if self.ambient_variance == ty::Variance::Invariant { . // Avoid fetching the variance if we are in an invariant . // context; no need, and it can induce dependency cycles . // (e.g., #41849). 45,432 ( 0.00%) relate::relate_substs(self, None, a_subst, b_subst) . } else { . let tcx = self.tcx(); . let opt_variances = tcx.variances_of(item_def_id); 147,050 ( 0.00%) relate::relate_substs(self, Some((item_def_id, &opt_variances)), a_subst, b_subst) . } 673,578 ( 0.01%) } . 163,593 ( 0.00%) fn relate_with_variance>( . &mut self, . variance: ty::Variance, . _info: ty::VarianceDiagInfo<'tcx>, . a: T, . b: T, . ) -> RelateResult<'tcx, T> { 193 ( 0.00%) let old_ambient_variance = self.ambient_variance; 468,324 ( 0.01%) self.ambient_variance = self.ambient_variance.xform(variance); . . let result = self.relate(a, b); 88,620 ( 0.00%) self.ambient_variance = old_ambient_variance; . result 127,239 ( 0.00%) } . 1,440,018 ( 0.02%) fn tys(&mut self, t: Ty<'tcx>, t2: Ty<'tcx>) -> RelateResult<'tcx, Ty<'tcx>> { 160,002 ( 0.00%) assert_eq!(t, t2); // we are abusing TypeRelation here; both LHS and RHS ought to be == . 960,012 ( 0.01%) if let Some(result) = self.cache.get(&t) { 20,644 ( 0.00%) return result.clone(); . } . debug!("generalize: t={:?}", t); . . // Check to see whether the type we are generalizing references . // any other type variable related to `vid` via . // subtyping. This is basically our "occurs check", preventing . // us from creating infinitely sized types. 489,841 ( 0.01%) let result = match *t.kind() { 3,713 ( 0.00%) ty::Infer(ty::TyVar(vid)) => { 3,713 ( 0.00%) let vid = self.infcx.inner.borrow_mut().type_variables().root_var(vid); 3,713 ( 0.00%) let sub_vid = self.infcx.inner.borrow_mut().type_variables().sub_root_var(vid); 3,713 ( 0.00%) if sub_vid == self.for_vid_sub_root { . // If sub-roots are equal, then `for_vid` and . // `vid` are related via subtyping. 5 ( 0.00%) Err(TypeError::CyclicTy(self.root_ty)) . } else { 22,272 ( 0.00%) let probe = self.infcx.inner.borrow_mut().type_variables().probe(vid); 7,424 ( 0.00%) match probe { . TypeVariableValue::Known { value: u } => { . debug!("generalize: known value {:?}", u); . self.relate(u, u) . } . TypeVariableValue::Unknown { universe } => { 14,305 ( 0.00%) match self.ambient_variance { . // Invariant: no need to make a fresh type variable. . ty::Invariant => { 5,410 ( 0.00%) if self.for_universe.can_name(universe) { 4,188 ( 0.00%) return Ok(t); . } . } . . // Bivariant: make a fresh var, but we . // may need a WF predicate. See . // comment on `needs_wf` field for . // more info. . ty::Bivariant => self.needs_wf = true, . . // Co/contravariant: this will be . // sufficiently constrained later on. . ty::Covariant | ty::Contravariant => (), . } . . let origin = 16,326 ( 0.00%) *self.infcx.inner.borrow_mut().type_variables().var_origin(vid); 12,698 ( 0.00%) let new_var_id = self . .infcx . .inner . .borrow_mut() . .type_variables() 12,698 ( 0.00%) .new_var(self.for_universe, origin); . let u = self.tcx().mk_ty_var(new_var_id); . . // Record that we replaced `vid` with `new_var_id` as part of a generalization . // operation. This is needed to detect cyclic types. To see why, see the . // docs in the `type_variables` module. 9,070 ( 0.00%) self.infcx.inner.borrow_mut().type_variables().sub(vid, new_var_id); . debug!("generalize: replacing original vid={:?} with new={:?}", vid, u); 3,628 ( 0.00%) Ok(u) . } . } . } . } . ty::Infer(ty::IntVar(_) | ty::FloatVar(_)) => { . // No matter what mode we are in, . // integer/floating-point types must be equal to be . // relatable. 760 ( 0.00%) Ok(t) . } 451,104 ( 0.01%) _ => relate::super_relate_tys(self, t, t), . }; . 1,537,940 ( 0.02%) self.cache.insert(t, result.clone()); 922,764 ( 0.01%) return result; 1,440,018 ( 0.02%) } . 243,256 ( 0.00%) fn regions( . &mut self, . r: ty::Region<'tcx>, . r2: ty::Region<'tcx>, . ) -> RelateResult<'tcx, ty::Region<'tcx>> { 27,153 ( 0.00%) assert_eq!(r, r2); // we are abusing TypeRelation here; both LHS and RHS ought to be == . . debug!("generalize: regions r={:?}", r); . 54,306 ( 0.00%) match *r { . // Never make variables for regions bound within the type itself, . // nor for erased regions. . ty::ReLateBound(..) | ty::ReErased => { . return Ok(r); . } . . ty::RePlaceholder(..) . | ty::ReVar(..) -- line 691 ---------------------------------------- -- line 697 ---------------------------------------- . } . } . . // If we are in an invariant context, we can re-use the region . // as is, unless it happens to be in some universe that we . // can't name. (In the case of a region *variable*, we could . // use it if we promoted it into our universe, but we don't . // bother.) 55,602 ( 0.00%) if let ty::Invariant = self.ambient_variance { 48,222 ( 0.00%) let r_universe = self.infcx.universe_of_region(r); 112,339 ( 0.00%) if self.for_universe.can_name(r_universe) { . return Ok(r); . } . } . . // FIXME: This is non-ideal because we don't give a . // very descriptive origin for this region variable. 118,881 ( 0.00%) Ok(self.infcx.next_region_var_in_universe(MiscVariable(self.cause.span), self.for_universe)) 243,256 ( 0.00%) } . 14,319 ( 0.00%) fn consts( . &mut self, . c: &'tcx ty::Const<'tcx>, . c2: &'tcx ty::Const<'tcx>, . ) -> RelateResult<'tcx, &'tcx ty::Const<'tcx>> { 4,646 ( 0.00%) assert_eq!(c, c2); // we are abusing TypeRelation here; both LHS and RHS ought to be == . . match c.val { . ty::ConstKind::Infer(InferConst::Var(vid)) => { 40 ( 0.00%) let mut inner = self.infcx.inner.borrow_mut(); 160 ( 0.00%) let variable_table = &mut inner.const_unification_table(); 40 ( 0.00%) let var_value = variable_table.probe_value(vid); 80 ( 0.00%) match var_value.val { . ConstVariableValue::Known { value: u } => { . drop(inner); . self.relate(u, u) . } 40 ( 0.00%) ConstVariableValue::Unknown { universe } => { 200 ( 0.00%) if self.for_universe.can_name(universe) { . Ok(c) . } else { . let new_var_id = variable_table.new_key(ConstVarValue { . origin: var_value.origin, . val: ConstVariableValue::Unknown { universe: self.for_universe }, . }); . Ok(self.tcx().mk_const_var(new_var_id, c.ty)) . } . } . } . } . ty::ConstKind::Unevaluated(ty::Unevaluated { def, substs, promoted }) 7 ( 0.00%) if self.tcx().lazy_normalization() => . { . assert_eq!(promoted, None); . let substs = self.relate_with_variance( . ty::Variance::Invariant, . ty::VarianceDiagInfo::default(), . substs, . substs, . )?; . Ok(self.tcx().mk_const(ty::Const { . ty: c.ty, . val: ty::ConstKind::Unevaluated(ty::Unevaluated { def, substs, promoted }), . })) . } 7,755 ( 0.00%) _ => relate::super_relate_consts(self, c, c), . } 14,319 ( 0.00%) } . } . . pub trait ConstEquateRelation<'tcx>: TypeRelation<'tcx> { . /// Register an obligation that both constants must be equal to each other. . /// . /// If they aren't equal then the relation doesn't hold. . fn const_equate_obligation(&mut self, a: &'tcx ty::Const<'tcx>, b: &'tcx ty::Const<'tcx>); . } -- line 772 ---------------------------------------- -- line 824 ---------------------------------------- . target_vid: ty::ConstVid<'tcx>, . } . . // We use `TypeRelation` here to propagate `RelateResult` upwards. . // . // Both inputs are expected to be the same. . impl<'tcx> TypeRelation<'tcx> for ConstInferUnifier<'_, 'tcx> { . fn tcx(&self) -> TyCtxt<'tcx> { 1,840 ( 0.00%) self.infcx.tcx . } . . fn param_env(&self) -> ty::ParamEnv<'tcx> { 460 ( 0.00%) self.param_env . } . . fn tag(&self) -> &'static str { . "ConstInferUnifier" . } . . fn a_is_expected(&self) -> bool { . true -- line 844 ---------------------------------------- -- line 937 ---------------------------------------- . return Ok(r); . } else { . // FIXME: This is non-ideal because we don't give a . // very descriptive origin for this region variable. . Ok(self.infcx.next_region_var_in_universe(MiscVariable(self.span), self.for_universe)) . } . } . 8,740 ( 0.00%) #[tracing::instrument(level = "debug", skip(self))] . fn consts( . &mut self, . c: &'tcx ty::Const<'tcx>, . _c: &'tcx ty::Const<'tcx>, . ) -> RelateResult<'tcx, &'tcx ty::Const<'tcx>> { . debug_assert_eq!(c, _c); . debug!("ConstInferUnifier: c={:?}", c); . 2,300 ( 0.00%) match c.val { . ty::ConstKind::Infer(InferConst::Var(vid)) => { . // Check if the current unification would end up . // unifying `target_vid` with a const which contains . // an inference variable which is unioned with `target_vid`. . // . // Not doing so can easily result in stack overflows. . if self . .infcx -- line 962 ---------------------------------------- -- line 1000 ---------------------------------------- . substs, . substs, . )?; . Ok(self.tcx().mk_const(ty::Const { . ty: c.ty, . val: ty::ConstKind::Unevaluated(ty::Unevaluated { def, substs, promoted }), . })) . } 2,300 ( 0.00%) _ => relate::super_relate_consts(self, c, c), . } . } . } 1,441,454 ( 0.02%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/cell.rs -------------------------------------------------------------------------------- Ir -- line 346 ---------------------------------------- . /// . /// let c = Cell::new(5); . /// . /// c.set(10); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn set(&self, val: T) { 6,777 ( 0.00%) let old = self.replace(val); 5,012 ( 0.00%) drop(old); . } . . /// Swaps the values of two `Cell`s. . /// Difference with `std::mem::swap` is that this function doesn't require `&mut` reference. . /// . /// # Examples . /// . /// ``` -- line 363 ---------------------------------------- -- line 434 ---------------------------------------- . /// . /// let five = c.get(); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn get(&self) -> T { . // SAFETY: This can cause data races if called from a separate thread, . // but `Cell` is `!Sync` so this won't happen. 800,587 ( 0.01%) unsafe { *self.value.get() } . } . . /// Updates the contained value using a function and returns the new value. . /// . /// # Examples . /// . /// ``` . /// #![feature(cell_update)] -- line 450 ---------------------------------------- -- line 689 ---------------------------------------- . . #[inline(always)] . fn is_writing(x: BorrowFlag) -> bool { . x < UNUSED . } . . #[inline(always)] . fn is_reading(x: BorrowFlag) -> bool { 1,600,518 ( 0.02%) x > UNUSED . } . . impl RefCell { . /// Creates a new `RefCell` containing `value`. . /// . /// # Examples . /// . /// ``` -- line 705 ---------------------------------------- -- line 706 ---------------------------------------- . /// use std::cell::RefCell; . /// . /// let c = RefCell::new(5); . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_stable(feature = "const_refcell_new", since = "1.24.0")] . #[inline] . pub const fn new(value: T) -> RefCell { 197,458 ( 0.00%) RefCell { 178,460 ( 0.00%) value: UnsafeCell::new(value), . borrow: Cell::new(UNUSED), . #[cfg(feature = "debug_refcell")] . borrowed_at: Cell::new(None), . } . } . . /// Consumes the `RefCell`, returning the wrapped value. . /// -- line 723 ---------------------------------------- -- line 731 ---------------------------------------- . /// let five = c.into_inner(); . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_cell_into_inner", issue = "78729")] . #[inline] . pub const fn into_inner(self) -> T { . // Since this function takes `self` (the `RefCell`) by value, the . // compiler statically verifies that it is not currently borrowed. 8,324 ( 0.00%) self.value.into_inner() . } . . /// Replaces the wrapped value with a new one, returning the old value, . /// without deinitializing either one. . /// . /// This function corresponds to [`std::mem::replace`](../mem/fn.replace.html). . /// . /// # Panics -- line 747 ---------------------------------------- -- line 845 ---------------------------------------- . /// let c = RefCell::new(5); . /// . /// let m = c.borrow_mut(); . /// let b = c.borrow(); // this causes a panic . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . #[inline] . #[track_caller] 21,979 ( 0.00%) pub fn borrow(&self) -> Ref<'_, T> { . self.try_borrow().expect("already mutably borrowed") 65,937 ( 0.00%) } . . /// Immutably borrows the wrapped value, returning an error if the value is currently mutably . /// borrowed. . /// . /// The borrow lasts until the returned `Ref` exits scope. Multiple immutable borrows can be . /// taken out at the same time. . /// . /// This is the non-panicking variant of [`borrow`](#method.borrow). -- line 863 ---------------------------------------- -- line 937 ---------------------------------------- . /// let c = RefCell::new(5); . /// let m = c.borrow(); . /// . /// let b = c.borrow_mut(); // this causes a panic . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . #[inline] . #[track_caller] 84,082 ( 0.00%) pub fn borrow_mut(&self) -> RefMut<'_, T> { . self.try_borrow_mut().expect("already borrowed") 252,246 ( 0.00%) } . . /// Mutably borrows the wrapped value, returning an error if the value is currently borrowed. . /// . /// The borrow lasts until the returned `RefMut` or all `RefMut`s derived . /// from it exit scope. The value cannot be borrowed while this borrow is . /// active. . /// . /// This is the non-panicking variant of [`borrow_mut`](#method.borrow_mut). -- line 955 ---------------------------------------- -- line 975 ---------------------------------------- . match BorrowRefMut::new(&self.borrow) { . Some(b) => { . #[cfg(feature = "debug_refcell")] . { . self.borrowed_at.set(Some(crate::panic::Location::caller())); . } . . // SAFETY: `BorrowRef` guarantees unique access. 24 ( 0.00%) Ok(RefMut { value: unsafe { &mut *self.value.get() }, borrow: b }) . } . None => Err(BorrowMutError { . // If a borrow occurred, then we must already have an outstanding borrow, . // so `borrowed_at` will be `Some` . #[cfg(feature = "debug_refcell")] . location: self.borrowed_at.get().unwrap(), . }), . } -- line 991 ---------------------------------------- -- line 1254 ---------------------------------------- . . struct BorrowRef<'b> { . borrow: &'b Cell, . } . . impl<'b> BorrowRef<'b> { . #[inline] . fn new(borrow: &'b Cell) -> Option> { 2,003,401 ( 0.03%) let b = borrow.get().wrapping_add(1); 1,269,526 ( 0.02%) if !is_reading(b) { . // Incrementing borrow can result in a non-reading value (<= 0) in these cases: . // 1. It was < 0, i.e. there are writing borrows, so we can't allow a read borrow . // due to Rust's reference aliasing rules . // 2. It was isize::MAX (the max amount of reading borrows) and it overflowed . // into isize::MIN (the max amount of writing borrows) so we can't allow . // an additional read borrow because isize can't represent so many read borrows . // (this can only happen if you mem::forget more than a small constant amount of . // `Ref`s, which is not good practice) -- line 1271 ---------------------------------------- -- line 1279 ---------------------------------------- . Some(BorrowRef { borrow }) . } . } . } . . impl Drop for BorrowRef<'_> { . #[inline] . fn drop(&mut self) { 801,769 ( 0.01%) let borrow = self.borrow.get(); . debug_assert!(is_reading(borrow)); 1,599,701 ( 0.02%) self.borrow.set(borrow - 1); . } . } . . impl Clone for BorrowRef<'_> { . #[inline] . fn clone(&self) -> Self { . // Since this Ref exists, we know the borrow flag . // is a reading borrow. -- line 1297 ---------------------------------------- -- line 1645 ---------------------------------------- . . struct BorrowRefMut<'b> { . borrow: &'b Cell, . } . . impl Drop for BorrowRefMut<'_> { . #[inline] . fn drop(&mut self) { 12,889,844 ( 0.19%) let borrow = self.borrow.get(); . debug_assert!(is_writing(borrow)); 25,435,888 ( 0.37%) self.borrow.set(borrow + 1); . } . } . . impl<'b> BorrowRefMut<'b> { . #[inline] . fn new(borrow: &'b Cell) -> Option> { . // NOTE: Unlike BorrowRefMut::clone, new is called to create the initial . // mutable reference, and so there must currently be no existing . // references. Thus, while clone increments the mutable refcount, here . // we explicitly only allow going from UNUSED to UNUSED - 1. 26,579,645 ( 0.39%) match borrow.get() { . UNUSED => { . borrow.set(UNUSED - 1); . Some(BorrowRefMut { borrow }) . } . _ => None, . } . } . -- line 1674 ---------------------------------------- -- line 1711 ---------------------------------------- . self.value . } . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl DerefMut for RefMut<'_, T> { . #[inline] . fn deref_mut(&mut self) -> &mut T { 2,149 ( 0.00%) self.value . } . } . . #[unstable(feature = "coerce_unsized", issue = "27732")] . impl<'b, T: ?Sized + Unsize, U: ?Sized> CoerceUnsized> for RefMut<'b, T> {} . . #[stable(feature = "std_guard_impls", since = "1.20.0")] . impl fmt::Display for RefMut<'_, T> { -- line 1727 ---------------------------------------- -- line 1909 ---------------------------------------- . /// ``` . #[inline(always)] . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_stable(feature = "const_unsafecell_get", since = "1.32.0")] . pub const fn get(&self) -> *mut T { . // We can just cast the pointer from `UnsafeCell` to `T` because of . // #[repr(transparent)]. This exploits libstd's special status, there is . // no guarantee for user code that this will work in future versions of the compiler! 8,558,131 ( 0.12%) self as *const UnsafeCell as *const T as *mut T . } . . /// Returns a mutable reference to the underlying data. . /// . /// This call borrows the `UnsafeCell` mutably (at compile-time) which . /// guarantees that we possess the only reference. . /// . /// # Examples -- line 1925 ---------------------------------------- 18,959,455 ( 0.28%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_borrowck/src/lib.rs -------------------------------------------------------------------------------- Ir -- line 97 ---------------------------------------- . . /// If true, the capture is behind a reference. . by_ref: bool, . } . . const DEREF_PROJECTION: &[PlaceElem<'_>; 1] = &[ProjectionElem::Deref]; . . pub fn provide(providers: &mut Providers) { 4 ( 0.00%) *providers = Providers { . mir_borrowck: |tcx, did| { 1,261 ( 0.00%) if let Some(def) = ty::WithOptConstParam::try_lookup(did, tcx) { . tcx.mir_borrowck_const_arg(def) . } else { 5,004 ( 0.00%) mir_borrowck(tcx, ty::WithOptConstParam::unknown(did)) . } . }, . mir_borrowck_const_arg: |tcx, (did, param_did)| { . mir_borrowck(tcx, ty::WithOptConstParam { did, const_param_did: Some(param_did) }) . }, . ..*providers . }; 1 ( 0.00%) } . 12,510 ( 0.00%) fn mir_borrowck<'tcx>( . tcx: TyCtxt<'tcx>, . def: ty::WithOptConstParam, . ) -> &'tcx BorrowCheckResult<'tcx> { . let (input_body, promoted) = tcx.mir_promoted(def); . debug!("run query mir_borrowck: {}", tcx.def_path_str(def.did.to_def_id())); . 16,263 ( 0.00%) let opt_closure_req = tcx.infer_ctxt().with_opaque_type_inference(def.did).enter(|infcx| { . let input_body: &Body<'_> = &input_body.borrow(); . let promoted: &IndexVec<_, _> = &promoted.borrow(); 17,514 ( 0.00%) do_mir_borrowck(&infcx, input_body, promoted, false).0 5,004 ( 0.00%) }); . debug!("mir_borrowck done"); . 1,251 ( 0.00%) tcx.arena.alloc(opt_closure_req) 10,008 ( 0.00%) } . . /// Perform the actual borrow checking. . /// . /// If `return_body_with_facts` is true, then return the body with non-erased . /// region ids on which the borrow checking was performed together with Polonius . /// facts. 27,522 ( 0.00%) #[instrument(skip(infcx, input_body, input_promoted), level = "debug")] . fn do_mir_borrowck<'a, 'tcx>( . infcx: &InferCtxt<'a, 'tcx>, . input_body: &Body<'tcx>, . input_promoted: &IndexVec>, . return_body_with_facts: bool, . ) -> (BorrowCheckResult<'tcx>, Option>>) { 12,510 ( 0.00%) let def = input_body.source.with_opt_param().as_local().unwrap(); . . debug!(?def); . 2,502 ( 0.00%) let tcx = infcx.tcx; . let param_env = tcx.param_env(def.did); 1,251 ( 0.00%) let id = tcx.hir().local_def_id_to_hir_id(def.did); . 2,502 ( 0.00%) let mut local_names = IndexVec::from_elem(None, &input_body.local_decls); . for var_debug_info in &input_body.var_debug_info { 18,705 ( 0.00%) if let VarDebugInfoContents::Place(place) = var_debug_info.value { 10,400 ( 0.00%) if let Some(local) = place.as_local() { 15,486 ( 0.00%) if let Some(prev_name) = local_names[local] { . if var_debug_info.name != prev_name { . span_bug!( . var_debug_info.source_info.span, . "local {:?} has many names (`{}` vs `{}`)", . local, . prev_name, . var_debug_info.name . ); . } . } 15,486 ( 0.00%) local_names[local] = Some(var_debug_info.name); . } . } . } . . // Gather the upvars of a closure, if any. 5,004 ( 0.00%) let tables = tcx.typeck_opt_const_arg(def); 2,502 ( 0.00%) if let Some(ErrorReported) = tables.tainted_by_errors { . infcx.set_tainted_by_errors(); . } 5,004 ( 0.00%) let upvars: Vec<_> = tables . .closure_min_captures_flattened(def.did.to_def_id()) . .map(|captured_place| { . let capture = captured_place.info.capture_kind; 76 ( 0.00%) let by_ref = match capture { . ty::UpvarCapture::ByValue => false, . ty::UpvarCapture::ByRef(..) => true, . }; . Upvar { place: captured_place.clone(), by_ref } . }) . .collect(); . . // Replace all regions with fresh inference variables. This . // requires first making our own copy of the MIR. This copy will . // be modified (in place) to contain non-lexical lifetimes. It . // will have a lifetime tied to the inference context. 2,502 ( 0.00%) let mut body_owned = input_body.clone(); . let mut promoted = input_promoted.clone(); . let free_regions = 3,753 ( 0.00%) nll::replace_regions_in_mir(infcx, param_env, &mut body_owned, &mut promoted); . let body = &body_owned; // no further changes . 1,251 ( 0.00%) let location_table_owned = LocationTable::new(body); . let location_table = &location_table_owned; . . let mut errors_buffer = Vec::new(); 3,753 ( 0.00%) let (move_data, move_errors): (MoveData<'tcx>, Vec<(Place<'tcx>, MoveError<'tcx>)>) = 8,757 ( 0.00%) match MoveData::gather_moves(&body, tcx, param_env) { 7,506 ( 0.00%) Ok(move_data) => (move_data, Vec::new()), . Err((move_data, move_errors)) => (move_data, move_errors), . }; . let promoted_errors = promoted . .iter_enumerated() 10,620 ( 0.00%) .map(|(idx, body)| (idx, MoveData::gather_moves(&body, tcx, param_env))); . 7,506 ( 0.00%) let mdpe = MoveDataParamEnv { move_data, param_env }; . 10,008 ( 0.00%) let mut flow_inits = MaybeInitializedPlaces::new(tcx, &body, &mdpe) 1,251 ( 0.00%) .into_engine(tcx, &body) . .pass_name("borrowck") . .iterate_to_fixpoint() . .into_results_cursor(&body); . 15,012 ( 0.00%) let locals_are_invalidated_at_exit = tcx.hir().body_owner_kind(id).is_fn_or_closure(); . let borrow_set = 12,510 ( 0.00%) Rc::new(BorrowSet::build(tcx, body, locals_are_invalidated_at_exit, &mdpe.move_data)); . 6,255 ( 0.00%) let use_polonius = return_body_with_facts || infcx.tcx.sess.opts.debugging_opts.polonius; . . // Compute non-lexical lifetimes. . let nll::NllOutput { 3,753 ( 0.00%) regioncx, 5,004 ( 0.00%) opaque_type_values, 2,502 ( 0.00%) polonius_input, 3,753 ( 0.00%) polonius_output, 5,004 ( 0.00%) opt_closure_req, 12,510 ( 0.00%) nll_errors, 22,518 ( 0.00%) } = nll::compute_regions( . infcx, 20,016 ( 0.00%) free_regions, . body, . &promoted, . location_table, . param_env, . &mut flow_inits, . &mdpe.move_data, . &borrow_set, . &upvars, . use_polonius, . ); . . // Dump MIR results into a file, if that is enabled. This let us . // write unit-tests, as well as helping with debugging. 3,753 ( 0.00%) nll::dump_mir_results(infcx, &body, ®ioncx, &opt_closure_req); . . // We also have a `#[rustc_regions]` annotation that causes us to dump . // information. 2,502 ( 0.00%) nll::dump_annotation( . infcx, . &body, . ®ioncx, . &opt_closure_req, . &opaque_type_values, . &mut errors_buffer, . ); . . // The various `flow_*` structures can be large. We drop `flow_inits` here . // so it doesn't overlap with the others below. This reduces peak memory . // usage significantly on some benchmarks. 20,016 ( 0.00%) drop(flow_inits); . 1,251 ( 0.00%) let regioncx = Rc::new(regioncx); . 7,506 ( 0.00%) let flow_borrows = Borrows::new(tcx, body, ®ioncx, &borrow_set) 1,251 ( 0.00%) .into_engine(tcx, body) . .pass_name("borrowck") . .iterate_to_fixpoint(); 7,506 ( 0.00%) let flow_uninits = MaybeUninitializedPlaces::new(tcx, body, &mdpe) 1,251 ( 0.00%) .into_engine(tcx, body) . .pass_name("borrowck") . .iterate_to_fixpoint(); 7,506 ( 0.00%) let flow_ever_inits = EverInitializedPlaces::new(tcx, body, &mdpe) 1,251 ( 0.00%) .into_engine(tcx, body) . .pass_name("borrowck") . .iterate_to_fixpoint(); . 2,950 ( 0.00%) let movable_generator = !matches!( 7,954 ( 0.00%) tcx.hir().get(id), . Node::Expr(&hir::Expr { . kind: hir::ExprKind::Closure(.., Some(hir::Movability::Static)), . .. . }) . ); . 7,434 ( 0.00%) for (idx, move_data_results) in promoted_errors { . let promoted_body = &promoted[idx]; . 2,124 ( 0.00%) if let Err((move_data, move_errors)) = move_data_results { . let mut promoted_mbcx = MirBorrowckCtxt { . infcx, . param_env, . body: promoted_body, . move_data: &move_data, . location_table, // no need to create a real one for the promoted, it is not used . movable_generator, . fn_self_span_reported: Default::default(), -- line 307 ---------------------------------------- -- line 325 ---------------------------------------- . }; . promoted_mbcx.report_move_errors(move_errors); . errors_buffer = promoted_mbcx.errors_buffer; . }; . } . . let dominators = body.dominators(); . 56,295 ( 0.00%) let mut mbcx = MirBorrowckCtxt { . infcx, . param_env, . body, . move_data: &mdpe.move_data, . location_table, . movable_generator, . locals_are_invalidated_at_exit, . fn_self_span_reported: Default::default(), . access_place_error_reported: Default::default(), . reservation_error_reported: Default::default(), . reservation_warnings: Default::default(), . move_error_reported: BTreeMap::new(), . uninitialized_error_reported: Default::default(), 5,004 ( 0.00%) errors_buffer, 1,251 ( 0.00%) regioncx: Rc::clone(®ioncx), . used_mut: Default::default(), . used_mut_upvars: SmallVec::new(), 1,251 ( 0.00%) borrow_set: Rc::clone(&borrow_set), 7,506 ( 0.00%) dominators, 5,004 ( 0.00%) upvars, 5,004 ( 0.00%) local_names, . region_names: RefCell::default(), . next_region_name: RefCell::new(1), . polonius_output, . }; . . // Compute and report region errors, if any. 3,753 ( 0.00%) mbcx.report_region_errors(nll_errors); . . let results = BorrowckResults { 7,506 ( 0.00%) ever_inits: flow_ever_inits, 10,008 ( 0.00%) uninits: flow_uninits, 13,761 ( 0.00%) borrows: flow_borrows, . }; . 7,506 ( 0.00%) mbcx.report_move_errors(move_errors); . 1,251 ( 0.00%) rustc_mir_dataflow::visit_results( . body, 1,251 ( 0.00%) traversal::reverse_postorder(body).map(|(bb, _)| bb), . &results, . &mut mbcx, . ); . . // Convert any reservation warnings into lints. . let reservation_warnings = mem::take(&mut mbcx.reservation_warnings); . for (_, (place, span, location, bk, borrow)) in reservation_warnings { . let mut initial_diag = mbcx.report_conflicting_borrow(location, (place, span), bk, &borrow); -- line 381 ---------------------------------------- -- line 406 ---------------------------------------- . // For each non-user used mutable variable, check if it's been assigned from . // a user-declared local. If so, then put that local into the used_mut set. . // Note that this set is expected to be small - only upvars from closures . // would have a chance of erroneously adding non-user-defined mutable vars . // to the set. . let temporary_used_locals: FxHashSet = mbcx . .used_mut . .iter() 1,251 ( 0.00%) .filter(|&local| !mbcx.body.local_decls[*local].is_user_variable()) . .cloned() . .collect(); . // For the remaining unused locals that are marked as mutable, we avoid linting any that . // were never initialized. These locals may have been removed as unreachable code; or will be . // linted as unused variables. . let unused_mut_locals = 1,251 ( 0.00%) mbcx.body.mut_vars_iter().filter(|local| !mbcx.used_mut.contains(local)).collect(); 5,004 ( 0.00%) mbcx.gather_used_muts(temporary_used_locals, unused_mut_locals); . . debug!("mbcx.used_mut: {:?}", mbcx.used_mut); 5,004 ( 0.00%) let used_mut = mbcx.used_mut; 1,251 ( 0.00%) for local in mbcx.body.mut_vars_and_args_iter().filter(|local| !used_mut.contains(local)) { 150 ( 0.00%) let local_decl = &mbcx.body.local_decls[local]; 900 ( 0.00%) let lint_root = match &mbcx.body.source_scopes[local_decl.source_info.scope].local_data { . ClearCrossCrate::Set(data) => data.lint_root, . _ => continue, . }; . . // Skip over locals that begin with an underscore or have no name 450 ( 0.00%) match mbcx.local_names[local] { . Some(name) => { . if name.as_str().starts_with('_') { . continue; . } . } . None => continue, . } . -- line 442 ---------------------------------------- -- line 455 ---------------------------------------- . String::new(), . Applicability::MachineApplicable, . ) . .emit(); . }) . } . . // Buffer any move errors that we collected and de-duplicated. 11,259 ( 0.00%) for (_, (_, diag)) in mbcx.move_error_reported { . diag.buffer(&mut mbcx.errors_buffer); . } . 1,251 ( 0.00%) if !mbcx.errors_buffer.is_empty() { . mbcx.errors_buffer.sort_by_key(|diag| diag.sort_span); . . for diag in mbcx.errors_buffer.drain(..) { . mbcx.infcx.tcx.sess.diagnostic().emit_diagnostic(&diag); . } . } . . let result = BorrowCheckResult { 5,004 ( 0.00%) concrete_opaque_types: opaque_type_values, 6,255 ( 0.00%) closure_requirements: opt_closure_req, 7,506 ( 0.00%) used_mut_upvars: mbcx.used_mut_upvars, . }; . 2,502 ( 0.00%) let body_with_facts = if return_body_with_facts { . let output_facts = mbcx.polonius_output.expect("Polonius output was not computed"); . Some(Box::new(BodyWithBorrowckFacts { . body: body_owned, . input_facts: *polonius_input.expect("Polonius input facts were not generated"), . output_facts, . location_table: location_table_owned, . })) . } else { . None . }; . . debug!("do_mir_borrowck: result = {:#?}", result); . 17,514 ( 0.00%) (result, body_with_facts) 15,012 ( 0.00%) } . . /// A `Body` with information computed by the borrow checker. This struct is . /// intended to be consumed by compiler consumers. . /// . /// We need to include the MIR body here because the region identifiers must . /// match the ones in the Polonius facts. . pub struct BodyWithBorrowckFacts<'tcx> { . /// A mir body that contains region identifiers. -- line 504 ---------------------------------------- -- line 608 ---------------------------------------- . // Check that: . // 1. assignments are always made to mutable locations (FIXME: does that still really go here?) . // 2. loans made in overlapping scopes do not conflict . // 3. assignments do not affect things loaned out as immutable . // 4. moves do not affect things loaned out in any way . impl<'cx, 'tcx> rustc_mir_dataflow::ResultsVisitor<'cx, 'tcx> for MirBorrowckCtxt<'cx, 'tcx> { . type FlowState = Flows<'cx, 'tcx>; . 902,817 ( 0.01%) fn visit_statement_before_primary_effect( . &mut self, . flow_state: &Flows<'cx, 'tcx>, . stmt: &'cx Statement<'tcx>, . location: Location, . ) { . debug!("MirBorrowckCtxt::process_statement({:?}, {:?}): {:?}", location, stmt, flow_state); . let span = stmt.source_info.span; . . self.check_activations(location, span, flow_state); . 501,565 ( 0.01%) match &stmt.kind { 58,744 ( 0.00%) StatementKind::Assign(box (lhs, ref rhs)) => { . self.consume_rvalue(location, (rhs, span), flow_state); . 117,488 ( 0.00%) self.mutate_place(location, (*lhs, span), Shallow(None), flow_state); . } 2,646 ( 0.00%) StatementKind::FakeRead(box (_, ref place)) => { . // Read for match doesn't access any memory and is used to . // assert that a place is safe and live. So we don't have to . // do any checks here. . // . // FIXME: Remove check that the place is initialized. This is . // needed for now because matches don't have never patterns yet. . // So this is the only place we prevent . // let x: !; . // match x {}; . // from compiling. 10,584 ( 0.00%) self.check_if_path_or_subpath_is_moved( . location, . InitializationRequiringAction::Use, 23,814 ( 0.00%) (place.as_ref(), span), . flow_state, . ); . } . StatementKind::SetDiscriminant { place, variant_index: _ } => { . self.mutate_place(location, (**place, span), Shallow(None), flow_state); . } . StatementKind::CopyNonOverlapping(box rustc_middle::mir::CopyNonOverlapping { . .. -- line 655 ---------------------------------------- -- line 663 ---------------------------------------- . | StatementKind::Coverage(..) . | StatementKind::AscribeUserType(..) . | StatementKind::Retag { .. } . | StatementKind::StorageLive(..) => { . // `Nop`, `AscribeUserType`, `Retag`, and `StorageLive` are irrelevant . // to borrow check. . } . StatementKind::StorageDead(local) => { 211,164 ( 0.00%) self.access_place( . location, 387,134 ( 0.01%) (Place::from(*local), span), . (Shallow(None), Write(WriteKind::StorageDeadOrDrop)), . LocalMutationIsAllowed::Yes, . flow_state, . ); . } . } 802,504 ( 0.01%) } . 213,216 ( 0.00%) fn visit_terminator_before_primary_effect( . &mut self, . flow_state: &Flows<'cx, 'tcx>, . term: &'cx Terminator<'tcx>, . loc: Location, . ) { . debug!("MirBorrowckCtxt::process_terminator({:?}, {:?}): {:?}", loc, term, flow_state); . let span = term.source_info.span; . . self.check_activations(loc, span, flow_state); . 133,260 ( 0.00%) match term.kind { 8,556 ( 0.00%) TerminatorKind::SwitchInt { ref discr, switch_ty: _, targets: _ } => { 8,556 ( 0.00%) self.consume_operand(loc, (discr, span), flow_state); . } 13,740 ( 0.00%) TerminatorKind::Drop { place, target: _, unwind: _ } => { . debug!( . "visit_terminator_drop \ . loc: {:?} term: {:?} place: {:?} span: {:?}", . loc, term, place, span . ); . 41,220 ( 0.00%) self.access_place( . loc, 61,830 ( 0.00%) (place, span), . (AccessDepth::Drop, Write(WriteKind::StorageDeadOrDrop)), . LocalMutationIsAllowed::Yes, . flow_state, . ); . } . TerminatorKind::DropAndReplace { 92 ( 0.00%) place: drop_place, 46 ( 0.00%) value: ref new_value, . target: _, . unwind: _, . } => { 736 ( 0.00%) self.mutate_place(loc, (drop_place, span), Deep, flow_state); . self.consume_operand(loc, (new_value, span), flow_state); . } . TerminatorKind::Call { 28,767 ( 0.00%) ref func, . ref args, . ref destination, . cleanup: _, . from_hir_call: _, . fn_span: _, . } => { 76,712 ( 0.00%) self.consume_operand(loc, (func, span), flow_state); . for arg in args { 82,806 ( 0.00%) self.consume_operand(loc, (arg, span), flow_state); . } 38,174 ( 0.00%) if let Some((dest, _ /*bb*/)) = *destination { 112,884 ( 0.00%) self.mutate_place(loc, (dest, span), Deep, flow_state); . } . } 2,502 ( 0.00%) TerminatorKind::Assert { ref cond, expected: _, ref msg, target: _, cleanup: _ } => { 417 ( 0.00%) self.consume_operand(loc, (cond, span), flow_state); . use rustc_middle::mir::AssertKind; 1,038 ( 0.00%) if let AssertKind::BoundsCheck { ref len, ref index } = *msg { 680 ( 0.00%) self.consume_operand(loc, (len, span), flow_state); . self.consume_operand(loc, (index, span), flow_state); . } . } . 5 ( 0.00%) TerminatorKind::Yield { ref value, resume: _, resume_arg, drop: _ } => { 11 ( 0.00%) self.consume_operand(loc, (value, span), flow_state); 11 ( 0.00%) self.mutate_place(loc, (resume_arg, span), Deep, flow_state); . } . . TerminatorKind::InlineAsm { . template: _, . ref operands, . options: _, . line_spans: _, . destination: _, -- line 756 ---------------------------------------- -- line 790 ---------------------------------------- . | TerminatorKind::Resume . | TerminatorKind::Return . | TerminatorKind::GeneratorDrop . | TerminatorKind::FalseEdge { real_target: _, imaginary_target: _ } . | TerminatorKind::FalseUnwind { real_target: _, unwind: _ } => { . // no data used, thus irrelevant to borrowck . } . } 195,192 ( 0.00%) } . 186,564 ( 0.00%) fn visit_terminator_after_primary_effect( . &mut self, . flow_state: &Flows<'cx, 'tcx>, . term: &'cx Terminator<'tcx>, . loc: Location, . ) { 26,652 ( 0.00%) let span = term.source_info.span; . 106,608 ( 0.00%) match term.kind { . TerminatorKind::Yield { value: _, resume: _, resume_arg: _, drop: _ } => { 2 ( 0.00%) if self.movable_generator { . // Look for any active borrows to locals . let borrow_set = self.borrow_set.clone(); . for i in flow_state.borrows.iter() { . let borrow = &borrow_set[i]; . self.check_for_local_borrow(borrow, span); . } . } . } . . TerminatorKind::Resume | TerminatorKind::Return | TerminatorKind::GeneratorDrop => { . // Returning from the function implicitly kills storage for all locals and statics. . // Often, the storage will already have been killed by an explicit . // StorageDead, but we don't always emit those (notably on unwind paths), . // so this "extra check" serves as a kind of backup. 4,398 ( 0.00%) let borrow_set = self.borrow_set.clone(); . for i in flow_state.borrows.iter() { . let borrow = &borrow_set[i]; . self.check_for_invalidation_at_exit(loc, borrow, span); . } . } . . TerminatorKind::Abort . | TerminatorKind::Assert { .. } -- line 833 ---------------------------------------- -- line 836 ---------------------------------------- . | TerminatorKind::DropAndReplace { .. } . | TerminatorKind::FalseEdge { real_target: _, imaginary_target: _ } . | TerminatorKind::FalseUnwind { real_target: _, unwind: _ } . | TerminatorKind::Goto { .. } . | TerminatorKind::SwitchInt { .. } . | TerminatorKind::Unreachable . | TerminatorKind::InlineAsm { .. } => {} . } 213,216 ( 0.00%) } . } . . use self::AccessDepth::{Deep, Shallow}; . use self::ReadOrWrite::{Activation, Read, Reservation, Write}; . . #[derive(Copy, Clone, PartialEq, Eq, Debug)] . enum ArtificialField { . ArrayLength, -- line 852 ---------------------------------------- -- line 913 ---------------------------------------- . /// When checking permissions for a place access, this flag is used to indicate that an immutable . /// local place can be mutated. . // . // FIXME: @nikomatsakis suggested that this flag could be removed with the following modifications: . // - Merge `check_access_permissions()` and `check_if_reassignment_to_immutable_state()`. . // - Split `is_mutable()` into `is_assignable()` (can be directly assigned) and . // `is_declared_mutable()`. . // - Take flow state into consideration in `is_assignable()` for local variables. 29,135 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, Debug)] . enum LocalMutationIsAllowed { . Yes, . /// We want use of immutable upvars to cause a "write to immutable upvar" . /// error, not an "reassignment" error. . ExceptUpvars, . No, . } . -- line 929 ---------------------------------------- -- line 970 ---------------------------------------- . } . . /// Checks an access to the given place to see if it is allowed. Examines the set of borrows . /// that are in scope, as well as which paths have been initialized, to ensure that (a) the . /// place is initialized and (b) it is not borrowed in some way that would prevent this . /// access. . /// . /// Returns `true` if an error is reported. 1,795,152 ( 0.03%) fn access_place( . &mut self, . location: Location, . place_span: (Place<'tcx>, Span), . kind: (AccessDepth, ReadOrWrite), . is_local_mutation_allowed: LocalMutationIsAllowed, . flow_state: &Flows<'cx, 'tcx>, . ) { . let (sd, rw) = kind; . 448,788 ( 0.01%) if let Activation(_, borrow_index) = rw { 2,324 ( 0.00%) if self.reservation_error_reported.contains(&place_span.0) { . debug!( . "skipping access_place for activation of invalid reservation \ . place: {:?} borrow_index: {:?}", . place_span.0, borrow_index . ); . return; . } . } . . // Check is_empty() first because it's the common case, and doing that . // way we avoid the clone() call. 112,197 ( 0.00%) if !self.access_place_error_reported.is_empty() . && self.access_place_error_reported.contains(&(place_span.0, place_span.1)) . { . debug!( . "access_place: suppressing error place_span=`{:?}` kind=`{:?}`", . place_span, kind . ); . return; . } . 673,182 ( 0.01%) let mutability_error = self.check_access_permissions( 448,788 ( 0.01%) place_span, . rw, . is_local_mutation_allowed, . flow_state, . location, . ); . let conflict_error = 1,234,167 ( 0.02%) self.check_access_for_conflict(location, place_span, sd, rw, flow_state); . 336,591 ( 0.00%) if let (Activation(_, borrow_idx), true) = (kind.1, conflict_error) { . // Suppress this warning when there's an error being emitted for the . // same borrow: fixing the error is likely to fix the warning. . self.reservation_warnings.remove(&borrow_idx); . } . 336,591 ( 0.00%) if conflict_error || mutability_error { . debug!("access_place: logging error place_span=`{:?}` kind=`{:?}`", place_span, kind); . . self.access_place_error_reported.insert((place_span.0, place_span.1)); . } 897,576 ( 0.01%) } . . fn check_access_for_conflict( . &mut self, . location: Location, . place_span: (Place<'tcx>, Span), . sd: AccessDepth, . rw: ReadOrWrite, . flow_state: &Flows<'cx, 'tcx>, . ) -> bool { . debug!( . "check_access_for_conflict(location={:?}, place_span={:?}, sd={:?}, rw={:?})", . location, place_span, sd, rw, . ); . 112,197 ( 0.00%) let mut error_reported = false; 336,591 ( 0.00%) let tcx = self.infcx.tcx; . let body = self.body; 224,394 ( 0.00%) let borrow_set = self.borrow_set.clone(); . . // Use polonius output if it has been enabled. 224,394 ( 0.00%) let polonius_output = self.polonius_output.clone(); . let borrows_in_scope = if let Some(polonius) = &polonius_output { . let location = self.location_table.start_index(location); . Either::Left(polonius.errors_at(location).iter().copied()) . } else { . Either::Right(flow_state.borrows.iter()) . }; . 1,458,561 ( 0.02%) each_borrow_involving_path( . self, . tcx, . body, . location, 673,182 ( 0.01%) (sd, place_span.0), . &borrow_set, 673,182 ( 0.01%) borrows_in_scope, 1,250,204 ( 0.02%) |this, borrow_index, borrow| match (rw, borrow.kind) { . // Obviously an activation is compatible with its own . // reservation (or even prior activating uses of same . // borrow); so don't check if they interfere. . // . // NOTE: *reservations* do conflict with themselves; . // thus aren't injecting unsoundenss w/ this check.) 1,162 ( 0.00%) (Activation(_, activating), _) if activating == borrow_index => { . debug!( . "check_access_for_conflict place_span: {:?} sd: {:?} rw: {:?} \ . skipping {:?} b/c activation of same borrow_index", . place_span, . sd, . rw, . (borrow_index, borrow), . ); -- line 1084 ---------------------------------------- -- line 1179 ---------------------------------------- . } . } . Control::Break . } . }, . ); . . error_reported 336,591 ( 0.00%) } . 388,260 ( 0.01%) fn mutate_place( . &mut self, . location: Location, . place_span: (Place<'tcx>, Span), . kind: AccessDepth, . flow_state: &Flows<'cx, 'tcx>, . ) { . // Write of P[i] or *P requires P init'd. 349,434 ( 0.01%) self.check_if_assigned_path_is_moved(location, place_span, flow_state); . . // Special case: you can assign an immutable local variable . // (e.g., `x = ...`) so long as it has never been initialized . // before (at this point in the flow). 38,826 ( 0.00%) if let Some(local) = place_span.0.as_local() { 154,572 ( 0.00%) if let Mutability::Not = self.body.local_decls[local].mutability { . // check for reassignments to immutable local variables . self.check_if_reassignment_to_immutable_state( . location, local, place_span, flow_state, . ); . return; . } . } . . // Otherwise, use the normal access permission rules. 330,840 ( 0.00%) self.access_place( . location, 110,280 ( 0.00%) place_span, . (kind, Write(WriteKind::Mutate)), . LocalMutationIsAllowed::No, . flow_state, . ); 310,608 ( 0.00%) } . . fn consume_rvalue( . &mut self, . location: Location, . (rvalue, span): (&'cx Rvalue<'tcx>, Span), . flow_state: &Flows<'cx, 'tcx>, . ) { 176,232 ( 0.00%) match *rvalue { 39,867 ( 0.00%) Rvalue::Ref(_ /*rgn*/, bk, place) => { 156,324 ( 0.00%) let access_kind = match bk { . BorrowKind::Shallow => { . (Shallow(Some(ArtificialField::ShallowBorrow)), Read(ReadKind::Borrow(bk))) . } . BorrowKind::Shared => (Deep, Read(ReadKind::Borrow(bk))), . BorrowKind::Unique | BorrowKind::Mut { .. } => { . let wk = WriteKind::MutableBorrow(bk); 3,144 ( 0.00%) if allow_two_phase_borrow(bk) { . (Deep, Reservation(wk)) . } else { . (Deep, Write(wk)) . } . } . }; . 279,069 ( 0.00%) self.access_place( . location, 53,156 ( 0.00%) (place, span), . access_kind, . LocalMutationIsAllowed::No, . flow_state, . ); . . let action = if bk == BorrowKind::Shallow { . InitializationRequiringAction::MatchOn . } else { . InitializationRequiringAction::Borrow . }; . 93,023 ( 0.00%) self.check_if_path_or_subpath_is_moved( . location, . action, 93,023 ( 0.00%) (place.as_ref(), span), . flow_state, . ); . } . 18 ( 0.00%) Rvalue::AddressOf(mutability, place) => { 6 ( 0.00%) let access_kind = match mutability { . Mutability::Mut => ( . Deep, . Write(WriteKind::MutableBorrow(BorrowKind::Mut { . allow_two_phase_borrow: false, . })), . ), . Mutability::Not => (Deep, Read(ReadKind::Borrow(BorrowKind::Shared))), . }; . 51 ( 0.00%) self.access_place( . location, 12 ( 0.00%) (place, span), . access_kind, . LocalMutationIsAllowed::No, . flow_state, . ); . 21 ( 0.00%) self.check_if_path_or_subpath_is_moved( . location, . InitializationRequiringAction::Borrow, 21 ( 0.00%) (place.as_ref(), span), . flow_state, . ); . } . . Rvalue::ThreadLocalRef(_) => {} . . Rvalue::Use(ref operand) . | Rvalue::Repeat(ref operand, _) -- line 1297 ---------------------------------------- -- line 1302 ---------------------------------------- . } . . Rvalue::Len(place) | Rvalue::Discriminant(place) => { . let af = match *rvalue { . Rvalue::Len(..) => Some(ArtificialField::ArrayLength), . Rvalue::Discriminant(..) => None, . _ => unreachable!(), . }; 14,400 ( 0.00%) self.access_place( . location, 3,600 ( 0.00%) (place, span), . (Shallow(af), Read(ReadKind::Copy)), . LocalMutationIsAllowed::No, . flow_state, . ); 6,300 ( 0.00%) self.check_if_path_or_subpath_is_moved( . location, . InitializationRequiringAction::Use, 6,300 ( 0.00%) (place.as_ref(), span), . flow_state, . ); . } . . Rvalue::BinaryOp(_bin_op, box (ref operand1, ref operand2)) . | Rvalue::CheckedBinaryOp(_bin_op, box (ref operand1, ref operand2)) => { 8,700 ( 0.00%) self.consume_operand(location, (operand1, span), flow_state); 6,090 ( 0.00%) self.consume_operand(location, (operand2, span), flow_state); . } . . Rvalue::NullaryOp(_op, _ty) => { . // nullary ops take no dynamic input; no borrowck effect. . } . . Rvalue::Aggregate(ref aggregate_kind, ref operands) => { . // We need to report back the list of mutable upvars that were . // moved into the closure and subsequently used by the closure, . // in order to populate our used_mut set. 7,347 ( 0.00%) match **aggregate_kind { . AggregateKind::Closure(def_id, _) | AggregateKind::Generator(def_id, _, _) => { . let BorrowCheckResult { used_mut_upvars, .. } = 448 ( 0.00%) self.infcx.tcx.mir_borrowck(def_id.expect_local()); . debug!("{:?} used_mut_upvars={:?}", def_id, used_mut_upvars); . for field in used_mut_upvars { 2 ( 0.00%) self.propagate_closure_used_mut_upvar(&operands[field.index()]); . } . } . AggregateKind::Adt(..) . | AggregateKind::Array(..) . | AggregateKind::Tuple { .. } => (), . } . . for operand in operands { -- line 1353 ---------------------------------------- -- line 1391 ---------------------------------------- . . // Handle(b) . this.used_mut.insert(place.local); . }; . . // This relies on the current way that by-value . // captures of a closure are copied/moved directly . // when generating MIR. 6 ( 0.00%) match *operand { . Operand::Move(place) | Operand::Copy(place) => { 2 ( 0.00%) match place.as_local() { 2 ( 0.00%) Some(local) if !self.body.local_decls[local].is_user_variable() => { 2 ( 0.00%) if self.body.local_decls[local].ty.is_mutable_ptr() { . // The variable will be marked as mutable by the borrow. . return; . } . // This is an edge case where we have a `move` closure . // inside a non-move closure, and the inner closure . // contains a mutation: . // . // let mut i = 0; -- line 1411 ---------------------------------------- -- line 1448 ---------------------------------------- . } . _ => propagate_closure_used_mut_place(self, place), . } . } . Operand::Constant(..) => {} . } . } . 476,160 ( 0.01%) fn consume_operand( . &mut self, . location: Location, . (operand, span): (&'cx Operand<'tcx>, Span), . flow_state: &Flows<'cx, 'tcx>, . ) { 212,820 ( 0.00%) match *operand { 11,916 ( 0.00%) Operand::Copy(place) => { . // copy of place: check if this is "copy of frozen path" . // (FIXME: see check_loans.rs) 23,986 ( 0.00%) self.access_place( . location, 19,860 ( 0.00%) (place, span), . (Deep, Read(ReadKind::Copy)), . LocalMutationIsAllowed::No, . flow_state, . ); . . // Finally, check if path was already moved. 154 ( 0.00%) self.check_if_path_or_subpath_is_moved( . location, . InitializationRequiringAction::Use, 132 ( 0.00%) (place.as_ref(), span), . flow_state, . ); . } 69,711 ( 0.00%) Operand::Move(place) => { . // move of place: check if this is move of already borrowed path 177,425 ( 0.00%) self.access_place( . location, 116,185 ( 0.00%) (place, span), . (Deep, Write(WriteKind::Move)), . LocalMutationIsAllowed::Yes, . flow_state, . ); . . // Finally, check if path was already moved. 19,688 ( 0.00%) self.check_if_path_or_subpath_is_moved( . location, . InitializationRequiringAction::Use, 14,766 ( 0.00%) (place.as_ref(), span), . flow_state, . ); . } . Operand::Constant(_) => {} . } 317,440 ( 0.00%) } . . /// Checks whether a borrow of this place is invalidated when the function . /// exits . fn check_for_invalidation_at_exit( . &mut self, . location: Location, . borrow: &BorrowData<'tcx>, . span: Span, . ) { . debug!("check_for_invalidation_at_exit({:?})", borrow); 14 ( 0.00%) let place = borrow.borrowed_place; . let mut root_place = PlaceRef { local: place.local, projection: &[] }; . . // FIXME(nll-rfc#40): do more precise destructor tracking here. For now . // we just know that all locals are dropped at function exit (otherwise . // we'll have a memory leak) and assume that all statics have a destructor. . // . // FIXME: allow thread-locals to borrow other thread locals? . . let (might_be_alive, will_be_dropped) = 98 ( 0.00%) if self.body.local_decls[root_place.local].is_ref_to_thread_local() { . // Thread-locals might be dropped after the function exits . // We have to dereference the outer reference because . // borrows don't conflict behind shared references. . root_place.projection = DEREF_PROJECTION; . (true, true) . } else { . (false, self.locals_are_invalidated_at_exit) . }; . 70 ( 0.00%) if !will_be_dropped { . debug!("place_is_invalidated_at_exit({:?}) - won't be dropped", place); . return; . } . . let sd = if might_be_alive { Deep } else { Shallow(None) }; . 168 ( 0.00%) if places_conflict::borrow_conflicts_with_place( 28 ( 0.00%) self.infcx.tcx, . &self.body, . place, . borrow.kind, 56 ( 0.00%) root_place, . sd, . places_conflict::PlaceConflictBias::Overlap, . ) { . debug!("check_for_invalidation_at_exit({:?}): INVALID", place); . // FIXME: should be talking about the region lifetime instead . // of just a span here. . let span = self.infcx.tcx.sess.source_map().end_point(span); . self.report_borrowed_value_does_not_live_long_enough( -- line 1553 ---------------------------------------- -- line 1573 ---------------------------------------- . err.buffer(&mut self.errors_buffer); . } . } . . fn check_activations(&mut self, location: Location, span: Span, flow_state: &Flows<'cx, 'tcx>) { . // Two-phase borrow support: For each activation that is newly . // generated at this statement, check if it interferes with . // another borrow. 253,930 ( 0.00%) let borrow_set = self.borrow_set.clone(); 482,370 ( 0.01%) for &borrow_index in borrow_set.activations_at_location(location) { . let borrow = &borrow_set[borrow_index]; . . // only mutable borrows should be 2-phase 5,810 ( 0.00%) assert!(match borrow.kind { . BorrowKind::Shared | BorrowKind::Shallow => false, . BorrowKind::Unique | BorrowKind::Mut { .. } => true, . }); . 13,944 ( 0.00%) self.access_place( . location, 6,972 ( 0.00%) (borrow.borrowed_place, span), 10,458 ( 0.00%) (Deep, Activation(WriteKind::MutableBorrow(borrow.kind), borrow_index)), . LocalMutationIsAllowed::No, . flow_state, . ); . // We do not need to call `check_if_path_or_subpath_is_moved` . // again, as we already called it when we made the . // initial reservation. . } . } -- line 1602 ---------------------------------------- -- line 1606 ---------------------------------------- . location: Location, . local: Local, . place_span: (Place<'tcx>, Span), . flow_state: &Flows<'cx, 'tcx>, . ) { . debug!("check_if_reassignment_to_immutable_state({:?})", local); . . // Check if any of the initializiations of `local` have happened yet: 67,536 ( 0.00%) if let Some(init_index) = self.is_local_ever_initialized(local, flow_state) { . // And, if so, report an error. . let init = &self.move_data.inits[init_index]; . let span = init.span(&self.body); . self.report_illegal_reassignment(location, place_span, span, place_span.0); . } . } . 574,782 ( 0.01%) fn check_if_full_path_is_moved( . &mut self, . location: Location, . desired_action: InitializationRequiringAction, . place_span: (PlaceRef<'tcx>, Span), . flow_state: &Flows<'cx, 'tcx>, . ) { . let maybe_uninits = &flow_state.uninits; . -- line 1630 ---------------------------------------- -- line 1660 ---------------------------------------- . // Therefore, if we seek out the *closest* prefix for which we . // have a MovePath, that should capture the initialization . // state for the place scenario. . // . // This code covers scenarios 1, 2, and 3. . . debug!("check_if_full_path_is_moved place: {:?}", place_span.0); . let (prefix, mpi) = self.move_path_closest_to(place_span.0); 44,214 ( 0.00%) if maybe_uninits.contains(mpi) { . self.report_use_of_moved_or_uninitialized( . location, . desired_action, . (prefix, place_span.0, place_span.1), . mpi, . ); . } // Only query longest prefix with a MovePath, not further . // ancestors; dataflow recurs on children when parents . // move (to support partial (re)inits). . // . // (I.e., querying parents breaks scenario 7; but may want . // to do such a query based on partial-init feature-gate.) 353,712 ( 0.01%) } . . /// Subslices correspond to multiple move paths, so we iterate through the . /// elements of the base array. For each element we check . /// . /// * Does this element overlap with our slice. . /// * Is any part of it uninitialized. . fn check_if_subslice_element_is_moved( . &mut self, -- line 1689 ---------------------------------------- -- line 1719 ---------------------------------------- . return; // don't bother finding other problems. . } . } . } . } . } . } . 484,836 ( 0.01%) fn check_if_path_or_subpath_is_moved( . &mut self, . location: Location, . desired_action: InitializationRequiringAction, . place_span: (PlaceRef<'tcx>, Span), . flow_state: &Flows<'cx, 'tcx>, . ) { 88,152 ( 0.00%) let maybe_uninits = &flow_state.uninits; . . // Bad scenarios: . // . // 1. Move of `a.b.c`, use of `a` or `a.b` . // partial initialization support, one might have `a.x` . // initialized but not `a.b`. . // 2. All bad scenarios from `check_if_full_path_is_moved` . // -- line 1742 ---------------------------------------- -- line 1743 ---------------------------------------- . // OK scenarios: . // . // 3. Move of `a.b.c`, use of `a.b.d` . // 4. Uninitialized `a.x`, initialized `a.b`, use of `a.b` . // 5. Copied `(a.b: &_)`, use of `*(a.b).c`; note that `a.b` . // must have been initialized for the use to be sound. . // 6. Move of `a.b.c` then reinit of `a.b.c.d`, use of `a.b.c.d` . 308,532 ( 0.00%) self.check_if_full_path_is_moved(location, desired_action, place_span, flow_state); . 52,072 ( 0.00%) if let Some((place_base, ProjectionElem::Subslice { from, to, from_end: false })) = 44,076 ( 0.00%) place_span.0.last_projection() . { . let place_ty = place_base.ty(self.body(), self.infcx.tcx); . if let ty::Array(..) = place_ty.ty.kind() { . self.check_if_subslice_element_is_moved( . location, . desired_action, . (place_base, place_span.1), . maybe_uninits, -- line 1762 ---------------------------------------- -- line 1772 ---------------------------------------- . // . // (Distinct from handling of scenarios 1+2+4 above because . // `place` does not interfere with suffixes of its prefixes, . // e.g., `a.b.c` does not interfere with `a.b.d`) . // . // This code covers scenario 1. . . debug!("check_if_path_or_subpath_is_moved place: {:?}", place_span.0); 176,304 ( 0.00%) if let Some(mpi) = self.move_path_for_place(place_span.0) { 129,220 ( 0.00%) let uninit_mpi = self . .move_data . .find_in_move_path_or_its_descendants(mpi, |mpi| maybe_uninits.contains(mpi)); . 64,610 ( 0.00%) if let Some(uninit_mpi) = uninit_mpi { . self.report_use_of_moved_or_uninitialized( . location, . desired_action, . (place_span.0, place_span.0, place_span.1), . uninit_mpi, . ); . return; // don't bother finding other problems. . } . } 352,608 ( 0.01%) } . . /// Currently MoveData does not store entries for all places in . /// the input MIR. For example it will currently filter out . /// places that are Copy; thus we do not track places of shared . /// reference type. This routine will walk up a place along its . /// prefixes, searching for a foundational place that *is* . /// tracked in the MoveData. . /// . /// An Err result includes a tag indicated why the search failed. . /// Currently this can only occur if the place is built off of a . /// static variable, as we do not track those in the MoveData. . fn move_path_closest_to(&mut self, place: PlaceRef<'tcx>) -> (PlaceRef<'tcx>, MovePathIndex) { 574,782 ( 0.01%) match self.move_data.rev_lookup.find(place) { . LookupResult::Parent(Some(mpi)) | LookupResult::Exact(mpi) => { . (self.move_data.move_paths[mpi].place.as_ref(), mpi) . } . LookupResult::Parent(None) => panic!("should have move path for every Local"), . } . } . . fn move_path_for_place(&mut self, place: PlaceRef<'tcx>) -> Option { . // If returns None, then there is no move path corresponding . // to a direct owner of `place` (which means there is nothing . // that borrowck tracks for its analysis). . 397,252 ( 0.01%) match self.move_data.rev_lookup.find(place) { . LookupResult::Parent(_) => None, . LookupResult::Exact(mpi) => Some(mpi), . } . } . . fn check_if_assigned_path_is_moved( . &mut self, . location: Location, . (place, span): (Place<'tcx>, Span), . flow_state: &Flows<'cx, 'tcx>, . ) { . debug!("check_if_assigned_path_is_moved place: {:?}", place); . . // None case => assigning to `x` does not require `x` be initialized. 183 ( 0.00%) for (place_base, elem) in place.iter_projections().rev() { 1,016 ( 0.00%) match elem { . ProjectionElem::Index(_/*operand*/) | . ProjectionElem::ConstantIndex { .. } | . // assigning to P[i] requires P to be valid. . ProjectionElem::Downcast(_/*adt_def*/, _/*variant_idx*/) => . // assigning to (P->variant) is okay if assigning to `P` is okay . // . // FIXME: is this true even if P is an adt with a dtor? . { } . . // assigning to (*P) requires P to be initialized . ProjectionElem::Deref => { 966 ( 0.00%) self.check_if_full_path_is_moved( . location, InitializationRequiringAction::Use, 828 ( 0.00%) (place_base, span), flow_state); . // (base initialized; no need to . // recur further) . break; . } . . ProjectionElem::Subslice { .. } => { . panic!("we don't allow assignments to subslices, location: {:?}", . location); . } . . ProjectionElem::Field(..) => { . // if type of `P` has a dtor, then . // assigning to `P.f` requires `P` itself . // be already initialized . let tcx = self.infcx.tcx; 100 ( 0.00%) let base_ty = place_base.ty(self.body(), tcx).ty; 303 ( 0.00%) match base_ty.kind() { 594 ( 0.00%) ty::Adt(def, _) if def.has_dtor(tcx) => { 174 ( 0.00%) self.check_if_path_or_subpath_is_moved( . location, InitializationRequiringAction::Assignment, 174 ( 0.00%) (place_base, span), flow_state); . . // (base initialized; no need to . // recur further) . break; . } . . // Once `let s; s.x = V; read(s.x);`, . // is allowed, remove this match arm. -- line 1880 ---------------------------------------- -- line 1931 ---------------------------------------- . . // Shallow so that we'll stop at any dereference; we'll . // report errors about issues with such bases elsewhere. . let maybe_uninits = &flow_state.uninits; . . // Find the shortest uninitialized prefix you can reach . // without going over a Deref. . let mut shortest_uninit_seen = None; 1,578 ( 0.00%) for prefix in this.prefixes(base, PrefixSet::Shallow) { 103 ( 0.00%) let mpi = match this.move_path_for_place(prefix) { . Some(mpi) => mpi, . None => continue, . }; . 16 ( 0.00%) if maybe_uninits.contains(mpi) { . debug!( . "check_parent_of_field updating shortest_uninit_seen from {:?} to {:?}", . shortest_uninit_seen, . Some((prefix, mpi)) . ); . shortest_uninit_seen = Some((prefix, mpi)); . } else { . debug!("check_parent_of_field {:?} is definitely initialized", (prefix, mpi)); . } . } . 213 ( 0.00%) if let Some((prefix, mpi)) = shortest_uninit_seen { . // Check for a reassignment into an uninitialized field of a union (for example, . // after a move out). In this case, do not report an error here. There is an . // exception, if this is the first assignment into the union (that is, there is . // no move out from an earlier location) then this is an attempt at initialization . // of the union - we should error in that case. . let tcx = this.infcx.tcx; . if base.ty(this.body(), tcx).ty.is_union() { . if this.move_data.path_map[mpi].iter().any(|moi| { -- line 1965 ---------------------------------------- -- line 1979 ---------------------------------------- . } . } . . /// Checks the permissions for the given place and read or write kind . /// . /// Returns `true` if an error is reported. . fn check_access_permissions( . &mut self, 224,394 ( 0.00%) (place, span): (Place<'tcx>, Span), . kind: ReadOrWrite, . is_local_mutation_allowed: LocalMutationIsAllowed, . flow_state: &Flows<'cx, 'tcx>, . location: Location, . ) -> bool { . debug!( . "check_access_permissions({:?}, {:?}, is_local_mutation_allowed: {:?})", . place, kind, is_local_mutation_allowed . ); . . let error_access; . let the_place_err; . 1,736,111 ( 0.03%) match kind { . Reservation(WriteKind::MutableBorrow( . borrow_kind @ (BorrowKind::Unique | BorrowKind::Mut { .. }), . )) . | Write(WriteKind::MutableBorrow( . borrow_kind @ (BorrowKind::Unique | BorrowKind::Mut { .. }), . )) => { 15,730 ( 0.00%) let is_local_mutation_allowed = match borrow_kind { . BorrowKind::Unique => LocalMutationIsAllowed::Yes, . BorrowKind::Mut { .. } => is_local_mutation_allowed, . BorrowKind::Shared | BorrowKind::Shallow => unreachable!(), . }; 11,011 ( 0.00%) match self.is_mutable(place.as_ref(), is_local_mutation_allowed) { . Ok(root_place) => { . self.add_used_mut(root_place, flow_state); . return false; . } . Err(place_err) => { . error_access = AccessKind::MutableBorrow; . the_place_err = place_err; . } . } . } . Reservation(WriteKind::Mutate) | Write(WriteKind::Mutate) => { 192,990 ( 0.00%) match self.is_mutable(place.as_ref(), is_local_mutation_allowed) { . Ok(root_place) => { . self.add_used_mut(root_place, flow_state); . return false; . } . Err(place_err) => { . error_access = AccessKind::Mutate; . the_place_err = place_err; . } -- line 2033 ---------------------------------------- -- line 2041 ---------------------------------------- . | WriteKind::MutableBorrow(BorrowKind::Shallow), . ) . | Write( . WriteKind::Move . | WriteKind::StorageDeadOrDrop . | WriteKind::MutableBorrow(BorrowKind::Shared) . | WriteKind::MutableBorrow(BorrowKind::Shallow), . ) => { 130,602 ( 0.00%) if let (Err(_), true) = ( 457,107 ( 0.01%) self.is_mutable(place.as_ref(), is_local_mutation_allowed), . self.errors_buffer.is_empty(), . ) { . // rust-lang/rust#46908: In pure NLL mode this code path should be . // unreachable, but we use `delay_span_bug` because we can hit this when . // dereferencing a non-Copy raw pointer *and* have `-Ztreat-err-as-bug` . // enabled. We don't want to ICE for that case, as other errors will have . // been emitted (#52262). . self.infcx.tcx.sess.delay_span_bug( -- line 2058 ---------------------------------------- -- line 2094 ---------------------------------------- . if previously_initialized { . self.report_mutability_error(place, span, the_place_err, error_access, location); . true . } else { . false . } . } . 196,145 ( 0.00%) fn is_local_ever_initialized( . &self, . local: Local, . flow_state: &Flows<'cx, 'tcx>, . ) -> Option { 117,687 ( 0.00%) let mpi = self.move_data.rev_lookup.find_local(local); 39,229 ( 0.00%) let ii = &self.move_data.init_path_map[mpi]; 163,999 ( 0.00%) for &index in ii { 92,624 ( 0.00%) if flow_state.ever_inits.contains(index) { . return Some(index); . } . } . None 156,916 ( 0.00%) } . . /// Adds the place into the used mutable variables set 116,572 ( 0.00%) fn add_used_mut(&mut self, root_place: RootPlace<'tcx>, flow_state: &Flows<'cx, 'tcx>) { 16 ( 0.00%) match root_place { 87,429 ( 0.00%) RootPlace { place_local: local, place_projection: [], is_local_mutation_allowed } => { . // If the local may have been initialized, and it is now currently being . // mutated, then it is justified to be annotated with the `mut` . // keyword, since the mutation may be a possible reassignment. 57,108 ( 0.00%) if is_local_mutation_allowed != LocalMutationIsAllowed::Yes 83,919 ( 0.00%) && self.is_local_ever_initialized(local, flow_state).is_some() . { . self.used_mut.insert(local); . } . } . RootPlace { . place_local: _, . place_projection: _, . is_local_mutation_allowed: LocalMutationIsAllowed::Yes, . } => {} . RootPlace { 8 ( 0.00%) place_local, 8 ( 0.00%) place_projection: place_projection @ [.., _], . is_local_mutation_allowed: _, . } => { 16 ( 0.00%) if let Some(field) = self.is_upvar_field_projection(PlaceRef { . local: place_local, . projection: place_projection, . }) { 2 ( 0.00%) self.used_mut_upvars.push(field); . } . } . } 110,928 ( 0.00%) } . . /// Whether this value can be written or borrowed mutably. . /// Returns the root place if the place passed in is a projection. 1,075,503 ( 0.02%) fn is_mutable( . &self, . place: PlaceRef<'tcx>, . is_local_mutation_allowed: LocalMutationIsAllowed, . ) -> Result, PlaceRef<'tcx>> { . debug!("is_mutable: place={:?}, is_local...={:?}", place, is_local_mutation_allowed); 299,989 ( 0.00%) match place.last_projection() { . None => { 94,438 ( 0.00%) let local = &self.body.local_decls[place.local]; 283,314 ( 0.00%) match local.mutability { 31,828 ( 0.00%) Mutability::Not => match is_local_mutation_allowed { 95,484 ( 0.00%) LocalMutationIsAllowed::Yes => Ok(RootPlace { . place_local: place.local, . place_projection: place.projection, . is_local_mutation_allowed: LocalMutationIsAllowed::Yes, . }), . LocalMutationIsAllowed::ExceptUpvars => Ok(RootPlace { . place_local: place.local, . place_projection: place.projection, . is_local_mutation_allowed: LocalMutationIsAllowed::ExceptUpvars, . }), . LocalMutationIsAllowed::No => Err(place), . }, 157,048 ( 0.00%) Mutability::Mut => Ok(RootPlace { . place_local: place.local, . place_projection: place.projection, . is_local_mutation_allowed, . }), . } . } . Some((place_base, elem)) => { 10,005 ( 0.00%) match elem { . ProjectionElem::Deref => { 2,454 ( 0.00%) let base_ty = place_base.ty(self.body(), self.infcx.tcx).ty; . . // Check the kind of deref to decide 7,344 ( 0.00%) match base_ty.kind() { . ty::Ref(_, _, mutbl) => { 2,388 ( 0.00%) match mutbl { . // Shared borrowed data is never mutable . hir::Mutability::Not => Err(place), . // Mutably borrowed data is mutable, but only if we have a . // unique path to the `&mut` . hir::Mutability::Mut => { 2,388 ( 0.00%) let mode = match self.is_upvar_field_projection(place) { 10 ( 0.00%) Some(field) if self.upvars[field.index()].by_ref => { . is_local_mutation_allowed . } . _ => LocalMutationIsAllowed::Yes, . }; . 7,164 ( 0.00%) self.is_mutable(place_base, mode) . } . } . } . ty::RawPtr(tnm) => { 12 ( 0.00%) match tnm.mutbl { . // `*const` raw pointers are not mutable . hir::Mutability::Not => Err(place), . // `*mut` raw pointers are always mutable, regardless of . // context. The users have to check by themselves. . hir::Mutability::Mut => Ok(RootPlace { . place_local: place.local, . place_projection: place.projection, . is_local_mutation_allowed, . }), . } . } . // `Box` owns its content, so mutable if its location is mutable 27 ( 0.00%) _ if base_ty.is_box() => { . self.is_mutable(place_base, is_local_mutation_allowed) . } . // Deref should only be for reference, pointers or boxes . _ => bug!("Deref of unexpected type: {:?}", base_ty), . } . } . // All other projections are owned by their base path, so mutable if . // base path is mutable . ProjectionElem::Field(..) . | ProjectionElem::Index(..) . | ProjectionElem::ConstantIndex { .. } . | ProjectionElem::Subslice { .. } . | ProjectionElem::Downcast(..) => { . let upvar_field_projection = self.is_upvar_field_projection(place); 4,216 ( 0.00%) if let Some(field) = upvar_field_projection { . let upvar = &self.upvars[field.index()]; . debug!( . "is_mutable: upvar.mutability={:?} local_mutation_is_allowed={:?} \ . place={:?}, place_base={:?}", . upvar, is_local_mutation_allowed, place, place_base . ); 50 ( 0.00%) match (upvar.place.mutability, is_local_mutation_allowed) { . ( . Mutability::Not, . LocalMutationIsAllowed::No . | LocalMutationIsAllowed::ExceptUpvars, . ) => Err(place), . (Mutability::Not, LocalMutationIsAllowed::Yes) . | (Mutability::Mut, _) => { . // Subtle: this is an upvar -- line 2251 ---------------------------------------- -- line 2270 ---------------------------------------- . // fn main() { . // let var = Vec::new(); . // foo(move || { . // var.push(1); . // }); . // } . // ``` . let _ = 90 ( 0.00%) self.is_mutable(place_base, is_local_mutation_allowed)?; . Ok(RootPlace { . place_local: place.local, . place_projection: place.projection, . is_local_mutation_allowed, . }) . } . } . } else { . self.is_mutable(place_base, is_local_mutation_allowed) . } . } . } . } . } 782,184 ( 0.01%) } . . /// If `place` is a field projection, and the field is being projected from a closure type, . /// then returns the index of the field being projected. Note that this closure will always . /// be `self` in the current MIR, because that is the only time we directly access the fields . /// of a closure type. . fn is_upvar_field_projection(&self, place_ref: PlaceRef<'tcx>) -> Option { 29,782 ( 0.00%) path_utils::is_upvar_field_projection(self.infcx.tcx, &self.upvars, place_ref, self.body()) . } . } . . /// The degree of overlap between 2 places for borrow-checking. . enum Overlap { . /// The places might partially overlap - in this case, we give . /// up and say that they might conflict. This occurs when . /// different fields of a union are borrowed. For example, -- line 2308 ---------------------------------------- 3,393,511 ( 0.05%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/iter/adapters/enumerate.rs -------------------------------------------------------------------------------- Ir -- line 38 ---------------------------------------- . /// debug assertions are enabled, a panic is guaranteed. . /// . /// # Panics . /// . /// Might panic if the index of the element overflows a `usize`. . #[inline] . #[rustc_inherit_overflow_checks] . fn next(&mut self) -> Option<(usize, ::Item)> { 2,362,262 ( 0.03%) let a = self.iter.next()?; 1,373,561 ( 0.02%) let i = self.count; 6,565,461 ( 0.10%) self.count += 1; 8,550,943 ( 0.12%) Some((i, a)) . } . . #[inline] . fn size_hint(&self) -> (usize, Option) { 340,595 ( 0.00%) self.iter.size_hint() . } . . #[inline] . #[rustc_inherit_overflow_checks] . fn nth(&mut self, n: usize) -> Option<(usize, I::Item)> { . let a = self.iter.nth(n)?; 4,544 ( 0.00%) let i = self.count + n; 4,578 ( 0.00%) self.count = i + 1; . Some((i, a)) . } . . #[inline] . fn count(self) -> usize { . self.iter.count() . } . -- line 70 ---------------------------------------- -- line 76 ---------------------------------------- . R: Try, . { . #[inline] . fn enumerate<'a, T, Acc, R>( . count: &'a mut usize, . mut fold: impl FnMut(Acc, (usize, T)) -> R + 'a, . ) -> impl FnMut(Acc, T) -> R + 'a { . #[rustc_inherit_overflow_checks] 36,822 ( 0.00%) move |acc, item| { 62,837 ( 0.00%) let acc = fold(acc, (*count, item)); 356,070 ( 0.01%) *count += 1; . acc . } . } . 250 ( 0.00%) self.iter.try_fold(init, enumerate(&mut self.count, fold)) . } . . #[inline] . fn fold(self, init: Acc, fold: Fold) -> Acc . where . Fold: FnMut(Acc, Self::Item) -> Acc, . { . #[inline] . fn enumerate( . mut count: usize, . mut fold: impl FnMut(Acc, (usize, T)) -> Acc, . ) -> impl FnMut(Acc, T) -> Acc { . #[rustc_inherit_overflow_checks] 145,044 ( 0.00%) move |acc, item| { 142 ( 0.00%) let acc = fold(acc, (count, item)); 163,601 ( 0.00%) count += 1; . acc . } . } . 653,218 ( 0.01%) self.iter.fold(init, enumerate(self.count, fold)) . } . . #[inline] . #[rustc_inherit_overflow_checks] . fn advance_by(&mut self, n: usize) -> Result<(), usize> { . match self.iter.advance_by(n) { . ret @ Ok(_) => { . self.count += n; -- line 120 ---------------------------------------- -- line 131 ---------------------------------------- . #[doc(hidden)] . unsafe fn __iterator_get_unchecked(&mut self, idx: usize) -> ::Item . where . Self: TrustedRandomAccessNoCoerce, . { . // SAFETY: the caller must uphold the contract for . // `Iterator::__iterator_get_unchecked`. . let value = unsafe { try_get_unchecked(&mut self.iter, idx) }; 144 ( 0.00%) (self.count + idx, value) . } . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl DoubleEndedIterator for Enumerate . where . I: ExactSizeIterator + DoubleEndedIterator, . { -- line 147 ---------------------------------------- -- line 172 ---------------------------------------- . { . // Can safely add and subtract the count, as `ExactSizeIterator` promises . // that the number of elements fits into a `usize`. . fn enumerate( . mut count: usize, . mut fold: impl FnMut(Acc, (usize, T)) -> R, . ) -> impl FnMut(Acc, T) -> R { . move |acc, item| { 134,871 ( 0.00%) count -= 1; . fold(acc, (count, item)) . } . } . 31,562 ( 0.00%) let count = self.count + self.iter.len(); . self.iter.try_rfold(init, enumerate(count, fold)) . } . . #[inline] . fn rfold(self, init: Acc, fold: Fold) -> Acc . where . Fold: FnMut(Acc, Self::Item) -> Acc, . { -- line 193 ---------------------------------------- 1,389,807 ( 0.02%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_ast/src/tokenstream.rs -------------------------------------------------------------------------------- Ir -- line 32 ---------------------------------------- . /// . /// If the syntax extension is an MBE macro, it will attempt to match its . /// LHS token tree against the provided token tree, and if it finds a . /// match, will transcribe the RHS token tree, splicing in any captured . /// `macro_parser::matched_nonterminals` into the `SubstNt`s it finds. . /// . /// The RHS of an MBE macro is the only place `SubstNt`s are substituted. . /// Nothing special happens to misnamed or misplaced `SubstNt`s. 2,133,275 ( 0.03%) #[derive(Debug, Clone, PartialEq, Encodable, Decodable, HashStable_Generic)] . pub enum TokenTree { . /// A single token. 686,696 ( 0.01%) Token(Token), . /// A delimited sequence of token trees. 55,694 ( 0.00%) Delimited(DelimSpan, DelimToken, TokenStream), . } . . #[derive(Copy, Clone)] . pub enum CanSynthesizeMissingTokens { . Yes, . No, . } . -- line 53 ---------------------------------------- -- line 71 ---------------------------------------- . delim == delim2 && tts.eq_unspanned(&tts2) . } . _ => false, . } . } . . /// Retrieves the `TokenTree`'s span. . pub fn span(&self) -> Span { 16,056 ( 0.00%) match self { 5,754 ( 0.00%) TokenTree::Token(token) => token.span, 11,272 ( 0.00%) TokenTree::Delimited(sp, ..) => sp.entire(), . } 5,211 ( 0.00%) } . . /// Modify the `TokenTree`'s span in-place. . pub fn set_span(&mut self, span: Span) { 16,056 ( 0.00%) match self { 5,211 ( 0.00%) TokenTree::Token(token) => token.span = span, 5,634 ( 0.00%) TokenTree::Delimited(dspan, ..) => *dspan = DelimSpan::from_single(span), . } 8,028 ( 0.00%) } . 2,976 ( 0.00%) pub fn token(kind: TokenKind, span: Span) -> TokenTree { 192,956 ( 0.00%) TokenTree::Token(Token::new(kind, span)) 2,976 ( 0.00%) } . . /// Returns the opening delimiter as a token tree. 22,981 ( 0.00%) pub fn open_tt(span: DelimSpan, delim: DelimToken) -> TokenTree { 68,943 ( 0.00%) TokenTree::token(token::OpenDelim(delim), span.open) 22,981 ( 0.00%) } . . /// Returns the closing delimiter as a token tree. 22,282 ( 0.00%) pub fn close_tt(span: DelimSpan, delim: DelimToken) -> TokenTree { 66,846 ( 0.00%) TokenTree::token(token::CloseDelim(delim), span.close) 22,282 ( 0.00%) } . 10,710 ( 0.00%) pub fn uninterpolate(self) -> TokenTree { 7,140 ( 0.00%) match self { 32,130 ( 0.00%) TokenTree::Token(token) => TokenTree::Token(token.uninterpolate().into_owned()), . tt => tt, . } 14,280 ( 0.00%) } . } . . impl HashStable for TokenStream . where . CTX: crate::HashStableContext, . { 11,745 ( 0.00%) fn hash_stable(&self, hcx: &mut CTX, hasher: &mut StableHasher) { 43,425 ( 0.00%) for sub_tt in self.trees() { . sub_tt.hash_stable(hcx, hasher); . } 10,440 ( 0.00%) } . } . . pub trait CreateTokenStream: sync::Send + sync::Sync { . fn create_token_stream(&self) -> AttrAnnotatedTokenStream; . } . . impl CreateTokenStream for AttrAnnotatedTokenStream { . fn create_token_stream(&self) -> AttrAnnotatedTokenStream { -- line 131 ---------------------------------------- -- line 135 ---------------------------------------- . . /// A lazy version of [`TokenStream`], which defers creation . /// of an actual `TokenStream` until it is needed. . /// `Box` is here only to reduce the structure size. . #[derive(Clone)] . pub struct LazyTokenStream(Lrc>); . . impl LazyTokenStream { 2,852 ( 0.00%) pub fn new(inner: impl CreateTokenStream + 'static) -> LazyTokenStream { . LazyTokenStream(Lrc::new(Box::new(inner))) 2,852 ( 0.00%) } . . pub fn create_token_stream(&self) -> AttrAnnotatedTokenStream { 86 ( 0.00%) self.0.create_token_stream() . } . } . . impl fmt::Debug for LazyTokenStream { . fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { . write!(f, "LazyTokenStream({:?})", self.create_token_stream()) . } . } -- line 156 ---------------------------------------- -- line 177 ---------------------------------------- . /// A `AttrAnnotatedTokenStream` is similar to a `TokenStream`, but with extra . /// information about the tokens for attribute targets. This is used . /// during expansion to perform early cfg-expansion, and to process attributes . /// during proc-macro invocations. . #[derive(Clone, Debug, Default, Encodable, Decodable)] . pub struct AttrAnnotatedTokenStream(pub Lrc>); . . /// Like `TokenTree`, but for `AttrAnnotatedTokenStream` 2,373 ( 0.00%) #[derive(Clone, Debug, Encodable, Decodable)] . pub enum AttrAnnotatedTokenTree { 1,242 ( 0.00%) Token(Token), 48 ( 0.00%) Delimited(DelimSpan, DelimToken, AttrAnnotatedTokenStream), . /// Stores the attributes for an attribute target, . /// along with the tokens for that attribute target. . /// See `AttributesData` for more information . Attributes(AttributesData), . } . . impl AttrAnnotatedTokenStream { 46,030 ( 0.00%) pub fn new(tokens: Vec<(AttrAnnotatedTokenTree, Spacing)>) -> AttrAnnotatedTokenStream { . AttrAnnotatedTokenStream(Lrc::new(tokens)) 46,030 ( 0.00%) } . . /// Converts this `AttrAnnotatedTokenStream` to a plain `TokenStream . /// During conversion, `AttrAnnotatedTokenTree::Attributes` get 'flattened' . /// back to a `TokenStream` of the form `outer_attr attr_target`. . /// If there are inner attributes, they are inserted into the proper . /// place in the attribute target tokens. 11 ( 0.00%) pub fn to_tokenstream(&self) -> TokenStream { 74 ( 0.00%) let trees: Vec<_> = self . .0 . .iter() 2,109 ( 0.00%) .flat_map(|tree| match &tree.0 { 1,186 ( 0.00%) AttrAnnotatedTokenTree::Token(inner) => { 2,965 ( 0.00%) smallvec![(TokenTree::Token(inner.clone()), tree.1)].into_iter() . } 1,260 ( 0.00%) AttrAnnotatedTokenTree::Delimited(span, delim, stream) => smallvec![( 189 ( 0.00%) TokenTree::Delimited(*span, *delim, stream.to_tokenstream()), 63 ( 0.00%) tree.1, . )] . .into_iter(), . AttrAnnotatedTokenTree::Attributes(data) => { . let mut outer_attrs = Vec::new(); . let mut inner_attrs = Vec::new(); . for attr in &data.attrs { 8 ( 0.00%) match attr.style { . crate::AttrStyle::Outer => { . outer_attrs.push(attr); . } . crate::AttrStyle::Inner => { . inner_attrs.push(attr); . } . } . } . 6 ( 0.00%) let mut target_tokens: Vec<_> = data . .tokens . .create_token_stream() . .to_tokenstream() . .0 . .iter() . .cloned() . .collect(); 3 ( 0.00%) if !inner_attrs.is_empty() { . let mut found = false; . // Check the last two trees (to account for a trailing semi) . for (tree, _) in target_tokens.iter_mut().rev().take(2) { . if let TokenTree::Delimited(span, delim, delim_tokens) = tree { . // Inner attributes are only supported on extern blocks, functions, impls, . // and modules. All of these have their inner attributes placed at . // the beginning of the rightmost outermost braced group: . // e.g. fn foo() { #![my_attr} } -- line 248 ---------------------------------------- -- line 269 ---------------------------------------- . . assert!( . found, . "Failed to find trailing delimited group in: {:?}", . target_tokens . ); . } . let mut flat: SmallVec<[_; 1]> = SmallVec::new(); 47 ( 0.00%) for attr in outer_attrs { . // FIXME: Make this more efficient 24 ( 0.00%) flat.extend(attr.tokens().to_tokenstream().0.clone().iter().cloned()); . } 24 ( 0.00%) flat.extend(target_tokens); 30 ( 0.00%) flat.into_iter() 3 ( 0.00%) } . }) . .collect(); . TokenStream::new(trees) 22 ( 0.00%) } . } . . /// Stores the tokens for an attribute target, along . /// with its attributes. . /// . /// This is constructed during parsing when we need to capture . /// tokens. . /// -- line 295 ---------------------------------------- -- line 298 ---------------------------------------- . /// and a `tokens` field storing the (unparesd) tokens `struct Foo {}` . #[derive(Clone, Debug, Encodable, Decodable)] . pub struct AttributesData { . /// Attributes, both outer and inner. . /// These are stored in the original order that they were parsed in. . pub attrs: AttrVec, . /// The underlying tokens for the attribute target that `attrs` . /// are applied to 28 ( 0.00%) pub tokens: LazyTokenStream, . } . . /// A `TokenStream` is an abstract sequence of tokens, organized into [`TokenTree`]s. . /// . /// The goal is for procedural macros to work with `TokenStream`s and `TokenTree`s . /// instead of a representation of the abstract syntax tree. . /// Today's `TokenTree`s can still contain AST via `token::Interpolated` for . /// backwards compatibility. -- line 314 ---------------------------------------- -- line 316 ---------------------------------------- . pub struct TokenStream(pub(crate) Lrc>); . . pub type TreeAndSpacing = (TokenTree, Spacing); . . // `TokenStream` is used a lot. Make sure it doesn't unintentionally get bigger. . #[cfg(all(target_arch = "x86_64", target_pointer_width = "64"))] . rustc_data_structures::static_assert_size!(TokenStream, 8); . 213,262 ( 0.00%) #[derive(Clone, Copy, Debug, PartialEq, Encodable, Decodable)] . pub enum Spacing { . Alone, . Joint, . } . . impl TokenStream { . /// Given a `TokenStream` with a `Stream` of only two arguments, return a new `TokenStream` . /// separating the two arguments with a comma for diagnostic suggestions. -- line 332 ---------------------------------------- -- line 365 ---------------------------------------- . return Some((TokenStream::new(new_stream), sp)); . } . None . } . } . . impl From<(AttrAnnotatedTokenTree, Spacing)> for AttrAnnotatedTokenStream { . fn from((tree, spacing): (AttrAnnotatedTokenTree, Spacing)) -> AttrAnnotatedTokenStream { 10 ( 0.00%) AttrAnnotatedTokenStream::new(vec![(tree, spacing)]) . } . } . . impl From for TokenStream { . fn from(tree: TokenTree) -> TokenStream { 900 ( 0.00%) TokenStream::new(vec![(tree, Spacing::Alone)]) . } . } . . impl From for TreeAndSpacing { . fn from(tree: TokenTree) -> TreeAndSpacing { 107,156 ( 0.00%) (tree, Spacing::Alone) . } . } . . impl iter::FromIterator for TokenStream { . fn from_iter>(iter: I) -> Self { . TokenStream::new(iter.into_iter().map(Into::into).collect::>()) . } . } -- line 393 ---------------------------------------- -- line 401 ---------------------------------------- . } . . impl TokenStream { . pub fn new(streams: Vec) -> TokenStream { . TokenStream(Lrc::new(streams)) . } . . pub fn is_empty(&self) -> bool { 13,256 ( 0.00%) self.0.is_empty() 13,256 ( 0.00%) } . . pub fn len(&self) -> usize { 254,120 ( 0.00%) self.0.len() 2,854 ( 0.00%) } . . pub fn from_streams(mut streams: SmallVec<[TokenStream; 2]>) -> TokenStream { . match streams.len() { . 0 => TokenStream::default(), . 1 => streams.pop().unwrap(), . _ => { . // We are going to extend the first stream in `streams` with . // the elements from the subsequent streams. This requires -- line 422 ---------------------------------------- -- line 448 ---------------------------------------- . . // Create the final `TokenStream`. . TokenStream(first_stream_lrc) . } . } . } . . pub fn trees(&self) -> Cursor { 3,202 ( 0.00%) self.clone().into_trees() 6,404 ( 0.00%) } . 31,196 ( 0.00%) pub fn into_trees(self) -> Cursor { . Cursor::new(self) 62,392 ( 0.00%) } . . /// Compares two `TokenStream`s, checking equality without regarding span information. . pub fn eq_unspanned(&self, other: &TokenStream) -> bool { . let mut t1 = self.trees(); . let mut t2 = other.trees(); . for (t1, t2) in iter::zip(&mut t1, &mut t2) { . if !t1.eq_unspanned(&t2) { . return false; . } . } . t1.next().is_none() && t2.next().is_none() . } . . pub fn map_enumerated TokenTree>(self, mut f: F) -> TokenStream { 2,838 ( 0.00%) TokenStream(Lrc::new( . self.0 . .iter() . .enumerate() 48,168 ( 0.00%) .map(|(i, (tree, is_joint))| (f(i, tree), *is_joint)) . .collect(), . )) . } . } . . // 99.5%+ of the time we have 1 or 2 elements in this vector. . #[derive(Clone)] . pub struct TokenStreamBuilder(SmallVec<[TokenStream; 2]>); -- line 488 ---------------------------------------- -- line 572 ---------------------------------------- . pub struct Cursor { . pub stream: TokenStream, . index: usize, . } . . impl Iterator for Cursor { . type Item = TokenTree; . 57,993 ( 0.00%) fn next(&mut self) -> Option { 134,289 ( 0.00%) self.next_with_spacing().map(|(tree, _)| tree) 77,324 ( 0.00%) } . } . . impl Cursor { . fn new(stream: TokenStream) -> Self { . Cursor { stream, index: 0 } . } . 1,145,405 ( 0.02%) pub fn next_with_spacing(&mut self) -> Option { 745,236 ( 0.01%) if self.index < self.stream.len() { 372,076 ( 0.01%) self.index += 1; 1,199,394 ( 0.02%) Some(self.stream.0[self.index - 1].clone()) . } else { 115,478 ( 0.00%) None . } 1,374,486 ( 0.02%) } . . pub fn index(&self) -> usize { . self.index . } . . pub fn append(&mut self, new_stream: TokenStream) { . if new_stream.is_empty() { . return; . } . let index = self.index; . let stream = mem::take(&mut self.stream); . *self = TokenStream::from_streams(smallvec![stream, new_stream]).into_trees(); . self.index = index; . } . 115,784 ( 0.00%) pub fn look_ahead(&self, n: usize) -> Option<&TokenTree> { 231,568 ( 0.00%) self.stream.0[self.index..].get(n).map(|(tree, _)| tree) 231,568 ( 0.00%) } . } . 137,615 ( 0.00%) #[derive(Debug, Copy, Clone, PartialEq, Encodable, Decodable, HashStable_Generic)] . pub struct DelimSpan { . pub open: Span, . pub close: Span, . } . . impl DelimSpan { 106 ( 0.00%) pub fn from_single(sp: Span) -> Self { . DelimSpan { open: sp, close: sp } 212 ( 0.00%) } . 24,406 ( 0.00%) pub fn from_pair(open: Span, close: Span) -> Self { . DelimSpan { open, close } 12,203 ( 0.00%) } . . pub fn dummy() -> Self { . Self::from_single(DUMMY_SP) 29,154 ( 0.00%) } . 105,224 ( 0.00%) pub fn entire(self) -> Span { . self.open.with_hi(self.close.hi()) 78,918 ( 0.00%) } . } 65,557 ( 0.00%) -------------------------------------------------------------------------------- The following files chosen for auto-annotation could not be found: -------------------------------------------------------------------------------- ./elf/dl-lookup.c ./malloc/malloc.c ./string/../sysdeps/x86_64/multiarch/memmove-vec-unaligned-erms.S -------------------------------------------------------------------------------- Ir -------------------------------------------------------------------------------- 2,787,845,760 (40.56%) events annotated