-------------------------------------------------------------------------------- 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 reqwest --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="__tls" --cfg feature="default" --cfg feature="default-tls" --cfg feature="hyper-tls" --cfg feature="native-tls-crate" --cfg feature="tokio-native-tls" -C metadata=b7c2681a97888d0c -C extra-filename=-b7c2681a97888d0c --out-dir /usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps -L dependency=/usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps --extern base64=/usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps/libbase64-a0b2bff3c386e84e.rmeta --extern bytes=/usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps/libbytes-0538d4e007b92ef5.rmeta --extern encoding_rs=/usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps/libencoding_rs-329d70bc39ad95cf.rmeta --extern futures_core=/usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps/libfutures_core-3deb98774204e9fe.rmeta --extern futures_util=/usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps/libfutures_util-afe93e68f44503e4.rmeta --extern h2=/usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps/libh2-f65fb687c9e04ffd.rmeta --extern http=/usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps/libhttp-b9e06774612d0680.rmeta --extern http_body=/usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps/libhttp_body-0dc2172aee55f4d0.rmeta --extern hyper=/usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps/libhyper-662c91aeda718640.rmeta --extern hyper_tls=/usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps/libhyper_tls-7fae9d567b14fdb9.rmeta --extern ipnet=/usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps/libipnet-cffe9405ccf73812.rmeta --extern lazy_static=/usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps/liblazy_static-d93c3fbc102a1a19.rmeta --extern log=/usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps/liblog-ffcd0f6d1dad8496.rmeta --extern mime=/usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps/libmime-e77ba2423ca1fd0b.rmeta --extern native_tls_crate=/usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps/libnative_tls-f231e564fdcd8e13.rmeta --extern percent_encoding=/usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps/libpercent_encoding-6dc59570925b5fc1.rmeta --extern pin_project_lite=/usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps/libpin_project_lite-59182566af91ca39.rmeta --extern serde=/usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps/libserde-2b80b4683533dc11.rmeta --extern serde_urlencoded=/usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps/libserde_urlencoded-a3a4807e926b7a31.rmeta --extern tokio=/usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps/libtokio-84c0bb0a51abb397.rmeta --extern tokio_native_tls=/usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps/libtokio_native_tls-77d6aff47d7f8f55.rmeta --extern url=/usr/home/liquid/tmp/.tmpjDyIwP/target/debug/deps/liburl-6504b36c224af005.rmeta -L native=/usr/home/liquid/.linuxbrew/Cellar/openssl@1.1/1.1.1m/lib -Adeprecated -Aunknown-lints -Zincremental-verify-ich Data file: results/cgout-w-profiling-reqwest-0.11.9-Check-Full Events recorded: Ir Events shown: Ir Event sort order: Ir Thresholds: 0.1 Include dirs: User annotated: Auto-annotation: on -------------------------------------------------------------------------------- Ir -------------------------------------------------------------------------------- 2,032,298,046 (100.0%) PROGRAM TOTALS -------------------------------------------------------------------------------- Ir file:function -------------------------------------------------------------------------------- 66,891,388 ( 3.29%) ./malloc/malloc.c:_int_free 58,115,876 ( 2.86%) ./malloc/malloc.c:_int_malloc 40,113,217 ( 1.97%) ./malloc/malloc.c:malloc 33,289,111 ( 1.64%) ./string/../sysdeps/x86_64/multiarch/memmove-vec-unaligned-erms.S:__memcpy_avx_unaligned_erms 25,629,470 ( 1.26%) ./elf/dl-lookup.c:_dl_lookup_symbol_x 19,783,330 ( 0.97%) ./elf/dl-lookup.c:do_lookup_x 19,592,630 ( 0.96%) ./malloc/malloc.c:free 13,627,300 ( 0.67%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:, (), core::hash::BuildHasherDefault>>::from_hash::>::{closure#0}> 10,218,799 ( 0.50%) ./malloc/malloc.c:malloc_consolidate 7,197,798 ( 0.35%) ./malloc/malloc.c:realloc 7,024,109 ( 0.35%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs:::eq 6,916,721 ( 0.34%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/num/uint_macros.rs:::short_write_process_buffer:: 6,464,402 ( 0.32%) ./malloc/malloc.c:unlink_chunk.constprop.0 6,320,828 ( 0.31%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/map.rs:, (), core::hash::BuildHasherDefault>>::from_hash::>::{closure#0}> 6,160,355 ( 0.30%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs:::intern_ty 5,952,378 ( 0.29%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs:::hash:: 5,811,127 ( 0.29%) /usr/home/liquid/rust/worktree-benchmarking/library/std/src/sys/unix/alloc.rs:__rdl_alloc 5,701,588 ( 0.28%) ./elf/../sysdeps/x86_64/dl-machine.h:_dl_relocate_object 5,652,493 ( 0.28%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/opaque.rs:>::decode 5,649,445 ( 0.28%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/mod.rs:::shallow_resolve_ty 5,537,427 ( 0.27%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:>>::from_key_hashed_nocheck:: 5,446,716 ( 0.27%) /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}> 5,304,424 ( 0.26%) /usr/home/liquid/rust/worktree-benchmarking/library/alloc/src/vec/mod.rs:>::decode 5,111,820 ( 0.25%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/map.rs:>, (), core::hash::BuildHasherDefault>>::from_hash::>>::{closure#0}> 5,055,738 ( 0.25%) ./malloc/malloc.c:_int_realloc 4,832,031 ( 0.24%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/lib.rs:>::decode 4,794,450 ( 0.24%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_parse/src/parser/mod.rs:::next 4,750,152 ( 0.23%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs:::_intern_substs 4,744,250 ( 0.23%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/caching_source_map_view.rs:::span_data_to_lines_and_cols 4,639,788 ( 0.23%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/sip128.rs:::short_write_process_buffer:: 4,598,672 ( 0.23%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_parse/src/parser/mod.rs:::bump 4,472,797 ( 0.22%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/iter/macros.rs:::_intern_substs 4,429,889 ( 0.22%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_metadata/src/rmeta/decoder.rs:>::decode 4,321,424 ( 0.21%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_parse/src/lexer/mod.rs:::next_token 4,239,386 ( 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}> 3,914,206 ( 0.19%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/leb128.rs:::read_u32 3,885,555 ( 0.19%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/leb128.rs:::read_u32 3,881,821 ( 0.19%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:)>>::remove_entry::>::{closure#0}> 3,863,494 ( 0.19%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_parse/src/parser/mod.rs:::check 3,537,099 ( 0.17%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/mod.rs:::lookup_source_file_idx 3,516,180 ( 0.17%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs:::hash:: 3,459,989 ( 0.17%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/lib.rs:>::hash_stable 3,382,253 ( 0.17%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_ast/src/tokenstream.rs:::next_with_spacing 3,312,829 ( 0.16%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/obligation_forest/mod.rs:>::process_obligations::> 3,284,485 ( 0.16%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_lexer/src/lib.rs:::advance_token 3,254,991 ( 0.16%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_parse/src/lexer/tokentrees.rs:::parse_token_tree 3,240,216 ( 0.16%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/type_variable.rs:::probe 3,235,687 ( 0.16%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs:, (), core::hash::BuildHasherDefault>>::from_hash::>::{closure#0}> 3,213,331 ( 0.16%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_index/src/bit_set.rs:>::union_row_with 3,198,197 ( 0.16%) ./string/../sysdeps/x86_64/multiarch/memcmp-avx2-movbe.S:__memcmp_avx2_movbe 3,174,609 ( 0.16%) /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 3,067,936 ( 0.15%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/rustc-hash-1.1.0/src/lib.rs:<&str as core::hash::Hash>::hash:: 3,040,748 ( 0.15%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_borrowck/src/lib.rs:::access_place 2,983,604 ( 0.15%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/mod.rs:::hash:: 2,927,064 ( 0.14%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/subst.rs:::fold_ty 2,869,189 ( 0.14%) /usr/home/liquid/rust/worktree-benchmarking/library/alloc/src/collections/btree/search.rs:>::search_tree:: 2,810,053 ( 0.14%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/mod.rs:>::decode 2,800,562 ( 0.14%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_ast/src/token.rs:::is_keyword 2,800,061 ( 0.14%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/stacker-0.1.14/src/lib.rs:stacker::remaining_stack 2,777,090 ( 0.14%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/mod.rs:::attrs 2,742,716 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs:::eq 2,718,056 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_ast/src/token.rs:::clone 2,657,503 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/mir/traversal.rs:::traverse_successor 2,612,174 ( 0.13%) ./elf/do-rel.h:_dl_relocate_object 2,606,875 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs:::intern_predicate 2,602,799 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_ast/src/token.rs:::eq 2,589,565 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/undo_log.rs:::rollback_to 2,537,486 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/sip128.rs:>::hash_stable 2,469,750 ( 0.12%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/md-5-0.9.1/src/utils.rs:md5::utils::compress 2,463,119 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/hir/map/mod.rs:::find_parent_node 2,452,936 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_privacy/src/lib.rs: as rustc_middle::ty::fold::TypeVisitor>::visit_ty 2,370,803 ( 0.12%) /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}> 2,344,220 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/iter/macros.rs:, >::decode::{closure#0}>, ::imported_source_files::{closure#3}::{closure#0}> as core::iter::traits::iterator::Iterator>::fold::<(), core::iter::traits::iterator::Iterator::for_each::call as alloc::vec::spec_extend::SpecExtend, >::decode::{closure#0}>, ::imported_source_files::{closure#3}::{closure#0}>>>::spec_extend::{closure#0}>::{closure#0}> 2,335,094 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/iter/macros.rs:::new_imported_source_file 2,327,288 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/lib.rs:::new_imported_source_file 2,318,006 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/leb128.rs:::read_usize 2,315,360 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/hir/map/mod.rs:::attrs 2,301,136 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_mir_transform/src/simplify.rs:::simplify 2,279,865 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_expand/src/mbe/macro_parser.rs:rustc_expand::mbe::macro_parser::parse_tt 2,274,440 ( 0.11%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:>::prepare_insert_slot 2,272,345 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/relate.rs:rustc_middle::ty::relate::super_relate_tys:: 2,199,874 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/freshen.rs:::fold_ty 2,160,208 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/num/uint_macros.rs:md5::utils::compress 2,142,749 ( 0.11%) ./malloc/malloc.c:calloc 2,109,862 ( 0.10%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/obligation_forest/mod.rs:>::register_obligation_at 2,102,650 ( 0.10%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_parse/src/parser/mod.rs:::bump_with 2,082,224 ( 0.10%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/leb128.rs:::read_usize 2,070,631 ( 0.10%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/graph/scc/mod.rs:, rustc_borrowck::constraints::ConstraintSccIndex>>::start_walk_from 2,069,678 ( 0.10%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_ast/src/token.rs:::clone 2,055,078 ( 0.10%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/rustc_entry.rs:, core::hash::BuildHasherDefault>>::rustc_entry 2,038,409 ( 0.10%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/map.rs:>>::from_key_hashed_nocheck:: -------------------------------------------------------------------------------- -- 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> { 63,944 ( 0.00%) fn reverse(&mut self, undo: UndoLog<'tcx>) { 269,712 ( 0.01%) match undo { 50,008 ( 0.00%) UndoLog::EqRelation(undo) => self.eq_relations.reverse(undo), 29,000 ( 0.00%) UndoLog::SubRelation(undo) => self.sub_relations.reverse(undo), 48,880 ( 0.00%) UndoLog::Values(undo) => self.values.reverse(undo), . } 127,888 ( 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, . } . 401,494 ( 0.02%) #[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> { 244,222 ( 0.01%) 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> { 48,762 ( 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 { 476 ( 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()); 3,283 ( 0.00%) self.eq_relations().union(a, b); 2,814 ( 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()); 2,890 ( 0.00%) self.sub_relations().union(a, b); . } . . /// Instantiates `vid` with the type `ty`. . /// . /// Precondition: `vid` must not have been previously instantiated. 100,505 ( 0.00%) 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) . ); 140,707 ( 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); 100,505 ( 0.00%) } . . /// 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. 135,834 ( 0.01%) pub fn new_var( . &mut self, . universe: ty::UniverseIndex, . origin: TypeVariableOrigin, . ) -> ty::TyVid { 203,751 ( 0.01%) let eq_key = self.eq_relations().new_key(TypeVariableValue::Unknown { universe }); . 113,195 ( 0.01%) let sub_key = self.sub_relations().new_key(()); 22,639 ( 0.00%) assert_eq!(eq_key.vid, sub_key); . 203,751 ( 0.01%) let index = self.values().push(TypeVariableData { origin }); 90,556 ( 0.00%) assert_eq!(eq_key.vid.as_u32(), index as u32); . . debug!("new_var(index={:?}, universe={:?}, origin={:?}", eq_key.vid, universe, origin,); . . eq_key.vid 158,473 ( 0.01%) } . . /// Returns the number of type variables created thus far. . pub fn num_vars(&self) -> usize { 1,346 ( 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 { 77,622 ( 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) 296 ( 0.00%) pub fn sub_root_var(&mut self, vid: ty::TyVid) -> ty::TyVid { 62,541 ( 0.00%) self.sub_relations().find(vid) 592 ( 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. 900,060 ( 0.04%) pub fn probe(&mut self, vid: ty::TyVid) -> TypeVariableValue<'tcx> { . self.inlined_probe(vid) 900,060 ( 0.04%) } . . /// An always-inlined variant of `probe`, for very hot call sites. . #[inline(always)] . pub fn inlined_probe(&mut self, vid: ty::TyVid) -> TypeVariableValue<'tcx> { 512,240 ( 0.03%) 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> { 226,842 ( 0.01%) match *t.kind() { 151,097 ( 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>> { 750,606 ( 0.04%) self.storage.eq_relations.with_log(self.undo_log) . } . . #[inline] . fn sub_relations(&mut self) -> super::UnificationTable<'_, 'tcx, ty::TyVid> { 45,861 ( 0.00%) self.storage.sub_relations.with_log(self.undo_log) . } . . /// Returns a range of the type variables created during the snapshot. 6,730 ( 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()); 8,076 ( 0.00%) ( . range.start..range.end, . (range.start.as_usize()..range.end.as_usize()) . .map(|index| self.storage.values.get(index).origin) . .collect(), . ) 8,076 ( 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); 40,804 ( 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: 475,678 ( 0.02%) 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 { 82,729 ( 0.00%) 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? . ( 465 ( 0.00%) &TypeVariableValue::Unknown { universe: universe1 }, 465 ( 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); 1,860 ( 0.00%) Ok(TypeVariableValue::Unknown { universe }) . } . } . } . } 49,476 ( 0.00%) -------------------------------------------------------------------------------- -- 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, . { 771,870 ( 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. 41 ( 0.00%) #[derive(Debug, Eq, PartialEq, Clone, Ord, PartialOrd)] 2,476 ( 0.00%) #[derive(Decodable)] . pub enum RealFileName { . LocalPath(PathBuf), . /// For remapped paths (namely paths into libstd that have been mapped . /// to the appropriate spot on the local host's file system, and local file . /// system paths that have been remapped with `FilePathMapping`), . Remapped { . /// `local_path` is the (host-dependent) local path to the file. This is . /// None if the file was imported from another crate -- line 173 ---------------------------------------- -- line 179 ---------------------------------------- . } . . impl Hash for RealFileName { . fn hash(&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 6,481 ( 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> { 30 ( 0.00%) encoder.emit_enum(|encoder| match *self { . RealFileName::LocalPath(ref local_path) => { 120 ( 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> { 8 ( 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 { 5,164 ( 0.00%) match self { . RealFileName::LocalPath(p) . | RealFileName::Remapped { local_path: _, virtual_name: p } => &p, . } 16 ( 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 { 15 ( 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> { 29 ( 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. 13,499 ( 0.00%) #[derive(Debug, Eq, PartialEq, Clone, Ord, PartialOrd, Hash)] 15,096 ( 0.00%) #[derive(Decodable, Encodable)] . pub enum FileName { . Real(RealFileName), . /// Call to `quote!`. 6 ( 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 { 105 ( 0.00%) fn from(p: PathBuf) -> Self { 30 ( 0.00%) assert!(!p.to_string_lossy().ends_with('>')); 90 ( 0.00%) FileName::Real(RealFileName::LocalPath(p)) 105 ( 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<'_> { 60 ( 0.00%) fn fmt(&self, fmt: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { . use FileName::*; 90 ( 0.00%) match *self.inner { . Real(ref name) => { 90 ( 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, ""), . } 75 ( 0.00%) } . } . . impl FileNameDisplay<'_> { 56 ( 0.00%) pub fn to_string_lossy(&self) -> Cow<'_, str> { 42 ( 0.00%) match self.inner { 14 ( 0.00%) FileName::Real(ref inner) => inner.to_string_lossy(self.display_pref), . _ => Cow::from(format!("{}", self)), . } 56 ( 0.00%) } . } . . impl FileName { . pub fn is_real(&self) -> bool { . use FileName::*; 2,188 ( 0.00%) match *self { . Real(_) => true, . Anon(_) . | MacroExpansion(_) . | ProcMacroSourceCode(_) . | CfgSpec(_) . | CliCrateAttr(_) . | Custom(_) . | QuoteExpansion(_) . | DocTest(_, _) . | InlineAsm(_) => false, . } . } . 14 ( 0.00%) pub fn prefer_remapped(&self) -> FileNameDisplay<'_> { . FileNameDisplay { inner: self, display_pref: FileNameDisplayPreference::Remapped } 28 ( 0.00%) } . . // This may include transient local filesystem information. . // Must not be embedded in build outputs. 15 ( 0.00%) pub fn prefer_local(&self) -> FileNameDisplay<'_> { . FileNameDisplay { inner: self, display_pref: FileNameDisplayPreference::Local } 30 ( 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()) . } . 30 ( 0.00%) pub fn cfg_spec_source_code(src: &str) -> FileName { . let mut hasher = StableHasher::new(); . src.hash(&mut hasher); 12 ( 0.00%) FileName::QuoteExpansion(hasher.finish()) 30 ( 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 { 895 ( 0.00%) pub lo: BytePos, 895 ( 0.00%) pub hi: BytePos, . /// Information about where the macro came from, if this piece of . /// code was created by a macro expansion. 2,676 ( 0.00%) pub ctxt: SyntaxContext, 892 ( 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 { 247,991 ( 0.01%) self.lo.0 == 0 && self.hi.0 == 0 . } . /// Returns `true` if `self` fully encloses `other`. . pub fn contains(self, other: Self) -> bool { 1,116 ( 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 { 96,408 ( 0.00%) fn partial_cmp(&self, rhs: &Self) -> Option { 72,306 ( 0.00%) PartialOrd::partial_cmp(&self.data(), &rhs.data()) 96,408 ( 0.00%) } . } . impl Ord for Span { . fn cmp(&self, rhs: &Self) -> Ordering { . Ord::cmp(&self.data(), &rhs.data()) . } . } . . /// A collection of `Span`s. -- line 520 ---------------------------------------- -- line 532 ---------------------------------------- . } . . impl Span { . #[inline] . pub fn lo(self) -> BytePos { . self.data().lo . } . #[inline] 82,296 ( 0.00%) pub fn with_lo(self, lo: BytePos) -> Span { . self.data().with_lo(lo) 54,864 ( 0.00%) } . #[inline] 6,652 ( 0.00%) pub fn hi(self) -> BytePos { . self.data().hi 6,652 ( 0.00%) } . #[inline] 21,492 ( 0.00%) pub fn with_hi(self, hi: BytePos) -> Span { . self.data().with_hi(hi) 14,328 ( 0.00%) } . #[inline] . pub fn ctxt(self) -> SyntaxContext { . self.data_untracked().ctxt . } . #[inline] 8,650 ( 0.00%) pub fn with_ctxt(self, ctxt: SyntaxContext) -> Span { . self.data_untracked().with_ctxt(ctxt) 5,190 ( 0.00%) } . #[inline] . pub fn parent(self) -> Option { . self.data().parent . } . #[inline] 54 ( 0.00%) pub fn with_parent(self, ctxt: Option) -> Span { . self.data().with_parent(ctxt) 36 ( 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] 6 ( 0.00%) pub fn from_expansion(self) -> bool { . self.ctxt() != SyntaxContext::root() 4 ( 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] 354 ( 0.00%) pub fn shrink_to_hi(self) -> Span { . let span = self.data_untracked(); . span.with_lo(span.hi) 236 ( 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`. 3,348 ( 0.00%) pub fn contains(self, other: Span) -> bool { . let span = self.data(); . let other = other.data(); . span.contains(other) 2,232 ( 0.00%) } . . /// Returns `true` if `self` touches `other`. . pub fn overlaps(self, other: Span) -> bool { . let span = self.data(); . let other = other.data(); . span.lo < other.hi && other.lo < span.hi . } . -- line 638 ---------------------------------------- -- line 657 ---------------------------------------- . /// the macro callsite that expanded to it. . pub fn source_callsite(self) -> Span { . let expn_data = self.ctxt().outer_expn_data(); . if !expn_data.is_root() { expn_data.call_site.source_callsite() } else { self } . } . . /// The `Span` for the tokens in the previous macro expansion from which `self` was generated, . /// if any. 400 ( 0.00%) pub fn parent_callsite(self) -> Option { . let expn_data = self.ctxt().outer_expn_data(); 160 ( 0.00%) if !expn_data.is_root() { Some(expn_data.call_site) } else { None } 960 ( 0.00%) } . . /// Walk down the expansion ancestors to find a span that's contained within `outer`. 2,210 ( 0.00%) pub fn find_ancestor_inside(mut self, outer: Span) -> Option { 1,445 ( 0.00%) while !outer.contains(self) { 400 ( 0.00%) self = self.parent_callsite()?; . } . Some(self) 2,431 ( 0.00%) } . . /// Edition of the crate from which this span came. 23,361 ( 0.00%) pub fn edition(self) -> edition::Edition { . self.ctxt().edition() 15,574 ( 0.00%) } . . #[inline] . pub fn rust_2015(self) -> bool { 4,549 ( 0.00%) self.edition() == edition::Edition::Edition2015 . } . . #[inline] . pub fn rust_2018(self) -> bool { 3,976 ( 0.00%) self.edition() >= edition::Edition::Edition2018 . } . . #[inline] . pub fn rust_2021(self) -> bool { 3,042 ( 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. 10 ( 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(); 4 ( 0.00%) if !expn_data.is_root() { Some(source_callee(expn_data)) } else { None } 8 ( 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]`). 1,885 ( 0.00%) pub fn allows_unstable(self, feature: Symbol) -> bool { 377 ( 0.00%) self.ctxt() . .outer_expn_data() . .allow_internal_unstable . .map_or(false, |features| features.iter().any(|&f| f == feature)) 1,508 ( 0.00%) } . . /// Checks if this span arises from a compiler desugaring of kind `kind`. 12,817 ( 0.00%) pub fn is_desugaring(self, kind: DesugaringKind) -> bool { 10,986 ( 0.00%) match self.ctxt().outer_expn_data().kind { . ExpnKind::Desugaring(k) => k == kind, . _ => false, . } 9,155 ( 0.00%) } . . /// Returns the compiler desugaring that created this span, or `None` . /// if this span is not from a desugaring. 215 ( 0.00%) pub fn desugaring_kind(self) -> Option { 258 ( 0.00%) match self.ctxt().outer_expn_data().kind { . ExpnKind::Desugaring(k) => Some(k), . _ => None, . } 172 ( 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]`). 64 ( 0.00%) pub fn allows_unsafe(self) -> bool { 16 ( 0.00%) self.ctxt().outer_expn_data().allow_internal_unsafe 64 ( 0.00%) } . . pub fn macro_backtrace(mut self) -> impl Iterator { . let mut prev_span = DUMMY_SP; . std::iter::from_fn(move || { . loop { . let expn_data = self.ctxt().outer_expn_data(); . if expn_data.is_root() { . return None; -- line 752 ---------------------------------------- -- line 767 ---------------------------------------- . . /// Returns a `Span` that would enclose both `self` and `end`. . /// . /// ```text . /// ____ ___ . /// self lorem ipsum end . /// ^^^^^^^^^^^^^^^^^^^^ . /// ``` 519,684 ( 0.03%) 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. 93,659 ( 0.00%) if span_data.ctxt != end_data.ctxt { 829 ( 0.00%) if span_data.ctxt == SyntaxContext::root() { . return end; 698 ( 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 }, 325,234 ( 0.02%) if span_data.parent == end_data.parent { span_data.parent } else { None }, . ) 425,196 ( 0.02%) } . . /// Returns a `Span` between the end of `self` to the beginning of `end`. . /// . /// ```text . /// ____ ___ . /// self lorem ipsum end . /// ^^^^^^^^^^^^^ . /// ``` 1,562 ( 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 }, 994 ( 0.00%) if span.parent == end.parent { span.parent } else { None }, . ) 1,136 ( 0.00%) } . . /// Returns a `Span` from the beginning of `self` until the beginning of `end`. . /// . /// ```text . /// ____ ___ . /// self lorem ipsum end . /// ^^^^^^^^^^^^^^^^^ . /// ``` 3,795 ( 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. 690 ( 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 }, 2,415 ( 0.00%) if span_data.parent == end_data.parent { span_data.parent } else { None }, . ) 3,105 ( 0.00%) } . 440 ( 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, . ) 280 ( 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 { 1,652 ( 0.00%) self.with_ctxt_from_mark(expn_id, Transparency::Opaque) . } . . /// Equivalent of `Span::call_site` from the proc macro API, . /// except that the location is taken from the `self` span. . pub fn with_call_site_ctxt(self, expn_id: ExpnId) -> Span { 8 ( 0.00%) self.with_ctxt_from_mark(expn_id, Transparency::Transparent) . } . . /// Equivalent of `Span::mixed_site` from the proc macro API, . /// except that the location is taken from the `self` span. . pub fn with_mixed_site_ctxt(self, expn_id: ExpnId) -> Span { . self.with_ctxt_from_mark(expn_id, Transparency::SemiTransparent) . } . . /// Produces a span with the same location as `self` and context produced by a macro with the . /// given ID and transparency, assuming that macro was defined directly and not produced by . /// some other macro (which is the case for built-in and procedural macros). 9,960 ( 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)) 5,810 ( 0.00%) } . . #[inline] . pub fn apply_mark(self, expn_id: ExpnId, transparency: Transparency) -> Span { . let span = self.data(); 96,597 ( 0.00%) span.with_ctxt(span.ctxt.apply_mark(expn_id, transparency)) . } . . #[inline] . pub fn remove_mark(&mut self) -> ExpnId { . let mut span = self.data(); . let mark = span.ctxt.remove_mark(); . *self = Span::new(span.lo, span.hi, span.ctxt, span.parent); . mark -- line 897 ---------------------------------------- -- line 901 ---------------------------------------- . pub fn adjust(&mut self, expn_id: ExpnId) -> Option { . 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] 68,724 ( 0.00%) pub fn normalize_to_macros_2_0_and_adjust(&mut self, expn_id: ExpnId) -> Option { 45,816 ( 0.00%) let mut span = self.data(); 37,820 ( 0.00%) let mark = span.ctxt.normalize_to_macros_2_0_and_adjust(expn_id); 68,724 ( 0.00%) *self = Span::new(span.lo, span.hi, span.ctxt, span.parent); . mark 76,000 ( 0.00%) } . . #[inline] . pub fn glob_adjust(&mut self, expn_id: ExpnId, glob_span: Span) -> Option> { . let mut span = self.data(); . let mark = span.ctxt.glob_adjust(expn_id, glob_span); . *self = Span::new(span.lo, span.hi, span.ctxt, span.parent); . mark . } -- line 922 ---------------------------------------- -- line 929 ---------------------------------------- . ) -> Option> { . let mut span = self.data(); . let mark = span.ctxt.reverse_glob_adjust(expn_id, glob_span); . *self = Span::new(span.lo, span.hi, span.ctxt, span.parent); . mark . } . . #[inline] 55,296 ( 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()) 48,384 ( 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 726 ( 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 1047 ---------------------------------------- . } . . impl MultiSpan { . #[inline] . pub fn new() -> MultiSpan { . MultiSpan { primary_spans: vec![], span_labels: vec![] } . } . 30 ( 0.00%) pub fn from_span(primary_span: Span) -> MultiSpan { 5,960 ( 0.00%) MultiSpan { primary_spans: vec![primary_span], span_labels: vec![] } 30 ( 0.00%) } . . pub fn from_spans(mut vec: Vec) -> MultiSpan { . vec.sort(); 465 ( 0.00%) MultiSpan { primary_spans: vec, span_labels: vec![] } . } . 72 ( 0.00%) pub fn push_span_label(&mut self, span: Span, label: String) { 24 ( 0.00%) self.span_labels.push((span, label)); 60 ( 0.00%) } . . /// Selects the first primary span (if any). . pub fn primary_span(&self) -> Option { . self.primary_spans.first().cloned() 820 ( 0.00%) } . . /// Returns all primary spans. . pub fn primary_spans(&self) -> &[Span] { . &self.primary_spans 30 ( 0.00%) } . . /// Returns `true` if any of the primary spans are displayable. . pub fn has_primary_spans(&self) -> bool { . self.primary_spans.iter().any(|sp| !sp.is_dummy()) . } . . /// Returns `true` if this contains only a dummy primary span with any hygienic context. . pub fn is_dummy(&self) -> bool { -- line 1084 ---------------------------------------- -- line 1139 ---------------------------------------- . . /// Returns `true` if any of the span labels is displayable. . pub fn has_span_labels(&self) -> bool { . self.span_labels.iter().any(|(sp, _)| !sp.is_dummy()) . } . } . . impl From for MultiSpan { 5,930 ( 0.00%) fn from(span: Span) -> MultiSpan { . MultiSpan::from_span(span) 5,930 ( 0.00%) } . } . . impl From> for MultiSpan { 465 ( 0.00%) fn from(spans: Vec) -> MultiSpan { 372 ( 0.00%) MultiSpan::from_spans(spans) 465 ( 0.00%) } . } . . /// Identifies an offset of a multi-byte character in a `SourceFile`. . #[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`. 316 ( 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 { 548 ( 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; . 158 ( 0.00%) fn sub(self, rhs: BytePos) -> Self { 548 ( 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), . } 474 ( 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, . } . 45 ( 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> { 1,031 ( 0.00%) match self { . ExternalSource::Foreign { kind: ExternalSourceKind::Present(ref src), .. } => Some(src), . _ => None, . } . } . } . . #[derive(Debug)] . pub struct OffsetOverflowError; . 2,494 ( 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. 90 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, Debug)] 4,988 ( 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 { 4 ( 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 => { 75 ( 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 { 4 ( 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 { 71 ( 0.00%) match self.kind { . SourceFileHashAlgorithm::Md5 => 16, . SourceFileHashAlgorithm::Sha1 => 20, . SourceFileHashAlgorithm::Sha256 => 32, . } . } . } . . /// A single source in the [`SourceMap`]. 870 ( 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. 15 ( 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. 15 ( 0.00%) pub name_hash: u128, . /// Indicates which crate this `SourceFile` was imported from. 15 ( 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)?; . 60 ( 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 { 30 ( 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); . 30 ( 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))?; 45 ( 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))?; 165 ( 0.00%) s.emit_struct_field("cnum", false, |s| self.cnum.encode(s)) . }) . } . } . . impl Decodable for SourceFile { 11,223 ( 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); 1,247 ( 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 { 1,688,070 ( 0.08%) 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)); 2,494 ( 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)); 13,717 ( 0.00%) SourceFile { 9,976 ( 0.00%) name, . start_pos, . end_pos, . src: None, 4,988 ( 0.00%) src_hash, . // Unused - the metadata decoder will construct . // a new SourceFile, filling in `external_src` properly . external_src: Lock::new(ExternalSource::Unneeded), 4,988 ( 0.00%) lines, 4,988 ( 0.00%) multibyte_chars, 4,988 ( 0.00%) non_narrow_chars, 4,988 ( 0.00%) normalized_pos, . name_hash, . cnum, . } . }) 11,223 ( 0.00%) } . } . . impl fmt::Debug for SourceFile { . fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result { . write!(fmt, "SourceFile({:?})", self.name) . } . } . . impl SourceFile { 231 ( 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); 63 ( 0.00%) let normalized_pos = normalize_src(&mut src, start_pos); . . let name_hash = { . let mut hasher: StableHasher = StableHasher::new(); 42 ( 0.00%) name.hash(&mut hasher); . hasher.finish::() . }; 42 ( 0.00%) let end_pos = start_pos.to_usize() + src.len(); 63 ( 0.00%) assert!(end_pos <= u32::MAX as usize); . 252 ( 0.00%) let (lines, multibyte_chars, non_narrow_chars) = 42 ( 0.00%) analyze_source_file::analyze_source_file(&src, start_pos); . 357 ( 0.00%) SourceFile { . name, . src: Some(Lrc::new(src)), 231 ( 0.00%) src_hash, . external_src: Lock::new(ExternalSource::Unneeded), . start_pos, . end_pos: Pos::from_usize(end_pos), 84 ( 0.00%) lines, 84 ( 0.00%) multibyte_chars, 84 ( 0.00%) non_narrow_chars, 84 ( 0.00%) normalized_pos, . name_hash, . cnum: LOCAL_CRATE, . } 189 ( 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. 2,464 ( 0.00%) pub fn add_external_src(&self, get_src: F) -> bool . where . F: FnOnce() -> Option, . { 402 ( 0.00%) if matches!( 704 ( 0.00%) *self.external_src.borrow(), . ExternalSource::Foreign { kind: ExternalSourceKind::AbsentOk, .. } . ) { 4 ( 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 12 ( 0.00%) if let ExternalSource::Foreign { . kind: src_kind @ ExternalSourceKind::AbsentOk, .. . } = &mut *external_src . { 20 ( 0.00%) if let Some(mut src) = src { . // The src_hash needs to be computed on the pre-normalized src. 4 ( 0.00%) if self.src_hash.matches(&src) { 12 ( 0.00%) normalize_src(&mut src, BytePos::from_usize(0)); 32 ( 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 { 348 ( 0.00%) self.src.is_some() || self.external_src.borrow().get_source().is_some() . } 3,168 ( 0.00%) } . . /// Gets a line from the list of pre-computed line-beginnings. . /// The line number here is 0-based. . pub fn get_line(&self, line_number: usize) -> Option> { . fn get_until_newline(src: &str, begin: usize) -> &str { . // We can't use `lines.get(line_number+1)` because we might . // be parsing when we call this function and thus the current . // line is the last one we have line info for. -- line 1610 ---------------------------------------- -- line 1627 ---------------------------------------- . Some(Cow::Owned(String::from(get_until_newline(src, begin)))) . } else { . None . } . } . . pub fn is_real_file(&self) -> bool { . self.name.is_real() 1,094 ( 0.00%) } . . pub fn is_imported(&self) -> bool { . self.src.is_none() 15,619 ( 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 { 18,695 ( 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 { 36,134 ( 0.00%) if self.is_empty() { . return self.start_pos..self.end_pos; . } . 24,474 ( 0.00%) assert!(line_index < self.lines.len()); 34,305 ( 0.00%) if line_index == (self.lines.len() - 1) { 119 ( 0.00%) self.lines[line_index]..self.end_pos . } else { 22,788 ( 0.00%) self.lines[line_index]..self.lines[line_index + 1] . } . } . . /// Returns whether or not the file contains the given `SourceMap` byte . /// position. The position one past the end of the file is considered to be . /// contained by the file. This implies that files for which `is_empty` . /// returns true still contain one byte position according to this function. . #[inline] -- line 1674 ---------------------------------------- -- line 1692 ---------------------------------------- . Err(i) if i == 0 => 0, . Err(i) => self.normalized_pos[i - 1].diff, . }; . . BytePos::from_u32(pos.0 - self.start_pos.0 + diff) . } . . /// Converts an absolute `BytePos` to a `CharPos` relative to the `SourceFile`. 58 ( 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; . 174 ( 0.00%) for mbc in self.multibyte_chars.iter() { . debug!("{}-byte char at {:?}", mbc.bytes, mbc.pos); . if mbc.pos < bpos { . // Every character is at least one byte, so we only . // count the actual extra bytes. . total_extra_bytes += mbc.bytes as u32 - 1; . // We should never see a byte position in the middle of a . // character. . assert!(bpos.to_u32() >= mbc.pos.to_u32() + mbc.bytes as u32); . } else { . break; . } . } . 348 ( 0.00%) assert!(self.start_pos.to_u32() + total_extra_bytes <= bpos.to_u32()); 290 ( 0.00%) CharPos(bpos.to_usize() - self.start_pos.to_usize() - total_extra_bytes as usize) 116 ( 0.00%) } . . /// Looks up the file's (1-based) line number and (0-based `CharPos`) column offset, for a . /// given `BytePos`. 203 ( 0.00%) pub fn lookup_file_pos(&self, pos: BytePos) -> (usize, CharPos) { 58 ( 0.00%) let chpos = self.bytepos_to_file_charpos(pos); 28 ( 0.00%) match self.lookup_line(pos) { . Some(a) => { . let line = a + 1; // Line numbers start at 1 29 ( 0.00%) let linebpos = self.lines[a]; 58 ( 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); 29 ( 0.00%) assert!(chpos >= linechpos); . (line, col) . } . None => (0, chpos), . } 232 ( 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`. 232 ( 0.00%) pub fn lookup_file_pos_with_col_display(&self, pos: BytePos) -> (usize, CharPos, usize) { 87 ( 0.00%) let (line, col_or_chpos) = self.lookup_file_pos(pos); 58 ( 0.00%) if line > 0 { . let col = col_or_chpos; 29 ( 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(); 145 ( 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) . } 203 ( 0.00%) } . } . . /// Normalizes the source code and records the normalizations. 250 ( 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 225 ( 0.00%) } . . /// Removes UTF-8 BOM, if any. . fn remove_bom(src: &mut String, normalized_pos: &mut Vec) { 25 ( 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) { 25 ( 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])* 83,622 ( 0.00%) $vis struct $ident($inner_vis $inner_ty); . . impl Pos for $ident { . #[inline(always)] . fn from_usize(n: usize) -> $ident { 6,941 ( 0.00%) $ident(n as $inner_ty) . } . . #[inline(always)] . fn to_usize(&self) -> usize { 142,262 ( 0.01%) 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 { 3,712,698 ( 0.18%) $ident(self.0 + rhs.0) . } . } . . impl Sub for $ident { . type Output = $ident; . . #[inline(always)] . fn sub(self, rhs: $ident) -> $ident { 2,792,694 ( 0.14%) $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 { 501,542 ( 0.02%) BytePos(d.read_u32()) . } . } . . // _____________________________________________________________________________ . // Loc, SourceFileAndLine, SourceFileAndBytePos . // . . /// A source code location used for error reporting. -- line 1962 ---------------------------------------- -- 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 { 1 ( 0.00%) pub start: usize, . pub end: usize, . } . . impl InnerSpan { 242 ( 0.00%) pub fn new(start: usize, end: usize) -> InnerSpan { . InnerSpan { start, end } 121 ( 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. 455,182 ( 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; . 84,466 ( 0.00%) if !ctx.hash_spans() { . return; . } . 370,716 ( 0.02%) let span = self.data_untracked(); 136,774 ( 0.01%) span.ctxt.hash_stable(ctx, hasher); 195,078 ( 0.01%) span.parent.hash_stable(ctx, hasher); . 131,348 ( 0.01%) if span.is_dummy() { . Hash::hash(&TAG_INVALID_SPAN, hasher); . return; . } . 127,460 ( 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. 254,920 ( 0.01%) let (file, line_lo, col_lo, line_hi, col_hi) = match ctx.span_data_to_lines_and_cols(&span) . { 127,460 ( 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. . 63,730 ( 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; 63,730 ( 0.00%) let len = (span.hi - span.lo).0; . Hash::hash(&col_line, hasher); . Hash::hash(&len, hasher); 520,208 ( 0.03%) } . } 3,697,186 ( 0.18%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_index/src/bit_set.rs -------------------------------------------------------------------------------- Ir -- line 44 ---------------------------------------- . } . Some((start, end)) . } . . macro_rules! bit_relations_inherent_impls { . () => { . /// Sets `self = self | other` and returns `true` if `self` changed . /// (i.e., if new bits were added). 349,092 ( 0.02%) pub fn union(&mut self, other: &Rhs) -> bool . where . Self: BitRelations, . { . >::union(self, other) 288,077 ( 0.01%) } . . /// Sets `self = self - other` and returns `true` if `self` changed. . /// (i.e., if any bits were removed). 131,290 ( 0.01%) pub fn subtract(&mut self, other: &Rhs) -> bool . where . Self: BitRelations, . { . >::subtract(self, other) 131,290 ( 0.01%) } . . /// Sets `self = self & other` and return `true` if `self` changed. . /// (i.e., if any bits were removed). . pub fn intersect(&mut self, other: &Rhs) -> bool . where . Self: BitRelations, . { . >::intersect(self, other) -- line 74 ---------------------------------------- -- line 84 ---------------------------------------- . /// just be `usize`. . /// . /// All operations that involve an element will panic if the element is equal . /// to or greater than the domain size. All operations that involve two bitsets . /// will panic if the bitsets have differing domain sizes. . /// . #[derive(Eq, PartialEq, Hash, Decodable, Encodable)] . pub struct BitSet { 9 ( 0.00%) domain_size: usize, 9 ( 0.00%) words: Vec, 9 ( 0.00%) marker: PhantomData, . } . . impl BitSet { . /// Gets the domain size. . pub fn domain_size(&self) -> usize { 39,951 ( 0.00%) self.domain_size . } . } . . impl BitSet { . /// Creates a new, empty bitset with a given `domain_size`. . #[inline] . pub fn new_empty(domain_size: usize) -> BitSet { . let num_words = num_words(domain_size); 47,494 ( 0.00%) BitSet { domain_size, words: vec![0; num_words], marker: PhantomData } . } . . /// Creates a new, filled bitset with a given `domain_size`. . #[inline] . pub fn new_filled(domain_size: usize) -> BitSet { . let num_words = num_words(domain_size); 8,833 ( 0.00%) let mut result = BitSet { domain_size, words: vec![!0; num_words], marker: PhantomData }; . result.clear_excess_bits(); . result . } . . /// Clear all elements. . #[inline] . pub fn clear(&mut self) { . for word in &mut self.words { 1,932 ( 0.00%) *word = 0; . } . } . . /// Clear excess bits in the final word. . fn clear_excess_bits(&mut self) { 2,873 ( 0.00%) let num_bits_in_final_word = self.domain_size % WORD_BITS; 8,316 ( 0.00%) if num_bits_in_final_word > 0 { 7,815 ( 0.00%) let mask = (1 << num_bits_in_final_word) - 1; 13,749 ( 0.00%) let final_word_idx = self.words.len() - 1; 4,155 ( 0.00%) self.words[final_word_idx] &= mask; . } . } . . /// Count the number of set bits in the set. . pub fn count(&self) -> usize { . self.words.iter().map(|e| e.count_ones() as usize).sum() . } . . /// Returns `true` if `self` contains `elem`. . #[inline] . pub fn contains(&self, elem: T) -> bool { 110,533 ( 0.01%) assert!(elem.index() < self.domain_size); . let (word_index, mask) = word_index_and_mask(elem); 116,634 ( 0.01%) (self.words[word_index] & mask) != 0 . } . . /// Is `self` is a (non-strict) superset of `other`? . #[inline] . pub fn superset(&self, other: &BitSet) -> bool { 42 ( 0.00%) assert_eq!(self.domain_size, other.domain_size); 129 ( 0.00%) self.words.iter().zip(&other.words).all(|(a, b)| (a & b) == *b) . } . . /// Is the set empty? . #[inline] . pub fn is_empty(&self) -> bool { 111 ( 0.00%) self.words.iter().all(|a| *a == 0) . } . . /// Insert `elem`. Returns whether the set has changed. . #[inline] . pub fn insert(&mut self, elem: T) -> bool { 711,721 ( 0.04%) assert!(elem.index() < self.domain_size); . let (word_index, mask) = word_index_and_mask(elem); . let word_ref = &mut self.words[word_index]; 266,264 ( 0.01%) let word = *word_ref; 532,528 ( 0.03%) let new_word = word | mask; 346,986 ( 0.02%) *word_ref = new_word; 292,464 ( 0.01%) new_word != word . } . . #[inline] . pub fn insert_range(&mut self, elems: impl RangeBounds) { . let Some((start, end)) = inclusive_start_end(elems, self.domain_size) else { . return; . }; . -- line 182 ---------------------------------------- -- line 199 ---------------------------------------- . } else { . self.words[start_word_index] |= end_mask | (end_mask - start_mask); . } . } . . /// Sets all bits to true. . pub fn insert_all(&mut self) { . for word in &mut self.words { 24,626 ( 0.00%) *word = !0; . } . self.clear_excess_bits(); . } . . /// Returns `true` if the set has changed. . #[inline] . pub fn remove(&mut self, elem: T) -> bool { 289,522 ( 0.01%) assert!(elem.index() < self.domain_size); . let (word_index, mask) = word_index_and_mask(elem); . let word_ref = &mut self.words[word_index]; 40,077 ( 0.00%) let word = *word_ref; 303,502 ( 0.01%) let new_word = word & !mask; 153,565 ( 0.01%) *word_ref = new_word; 80,154 ( 0.00%) new_word != word . } . . /// Gets a slice of the underlying words. . pub fn words(&self) -> &[Word] { . &self.words . } . . /// Iterates over the indices of set bits in a sorted order. -- line 229 ---------------------------------------- -- line 308 ---------------------------------------- . } . . bit_relations_inherent_impls! {} . } . . // dense REL dense . impl BitRelations> for BitSet { . fn union(&mut self, other: &BitSet) -> bool { 183,129 ( 0.01%) assert_eq!(self.domain_size, other.domain_size); 114,503 ( 0.01%) bitwise(&mut self.words, &other.words, |a, b| a | b) . } . . fn subtract(&mut self, other: &BitSet) -> bool { . assert_eq!(self.domain_size, other.domain_size); 2,075 ( 0.00%) bitwise(&mut self.words, &other.words, |a, b| a & !b) . } . . fn intersect(&mut self, other: &BitSet) -> bool { 20,809 ( 0.00%) assert_eq!(self.domain_size, other.domain_size); 8,006 ( 0.00%) bitwise(&mut self.words, &other.words, |a, b| a & b) . } . } . . // Applies a function to mutate a bitset, and returns true if any . // of the applications return true . fn sequential_update( . mut self_update: impl FnMut(T) -> bool, . it: impl Iterator, . ) -> bool { . let mut changed = false; 57,619 ( 0.00%) for elem in it { 172,857 ( 0.01%) changed |= self_update(elem); . } . changed 104,176 ( 0.01%) } . . // Optimization of intersection for SparseBitSet that's generic . // over the RHS . fn sparse_intersect( . set: &mut SparseBitSet, . other_contains: impl Fn(&T) -> bool, . ) -> bool { . let size = set.elems.len(); -- line 350 ---------------------------------------- -- line 413 ---------------------------------------- . HybridBitSet::Dense(dense) => dense.intersect(other), . } . } . } . . // dense REL hybrid . impl BitRelations> for BitSet { . fn union(&mut self, other: &HybridBitSet) -> bool { 105,032 ( 0.01%) assert_eq!(self.domain_size, other.domain_size()); 52,516 ( 0.00%) match other { . HybridBitSet::Sparse(sparse) => { . sequential_update(|elem| self.insert(elem), sparse.iter().cloned()) . } . HybridBitSet::Dense(dense) => self.union(dense), . } . } . . fn subtract(&mut self, other: &HybridBitSet) -> bool { 105,032 ( 0.01%) assert_eq!(self.domain_size, other.domain_size()); 52,516 ( 0.00%) match other { . HybridBitSet::Sparse(sparse) => { . sequential_update(|elem| self.remove(elem), sparse.iter().cloned()) . } . HybridBitSet::Dense(dense) => self.subtract(dense), . } . } . . fn intersect(&mut self, other: &HybridBitSet) -> bool { -- line 440 ---------------------------------------- -- line 455 ---------------------------------------- . HybridBitSet::Dense(dense) => self.intersect(dense), . } . } . } . . // hybrid REL hybrid . impl BitRelations> for HybridBitSet { . fn union(&mut self, other: &HybridBitSet) -> bool { 6,324 ( 0.00%) assert_eq!(self.domain_size(), other.domain_size()); 2,108 ( 0.00%) match self { . HybridBitSet::Sparse(_) => { 2,108 ( 0.00%) match other { . HybridBitSet::Sparse(other_sparse) => { . // Both sets are sparse. Add the elements in . // `other_sparse` to `self` one at a time. This . // may or may not cause `self` to be densified. . let mut changed = false; . for elem in other_sparse.iter() { 6,450 ( 0.00%) changed |= self.insert(*elem); . } . changed . } . . HybridBitSet::Dense(other_dense) => self.union(other_dense), . } . } . -- line 481 ---------------------------------------- -- line 508 ---------------------------------------- . HybridBitSet::Dense(other_dense) => self_dense.intersect(other_dense), . }, . } . } . } . . impl Clone for BitSet { . fn clone(&self) -> Self { 17,983 ( 0.00%) BitSet { domain_size: self.domain_size, words: self.words.clone(), marker: PhantomData } . } . 337,610 ( 0.02%) fn clone_from(&mut self, from: &Self) { 213,760 ( 0.01%) if self.domain_size != from.domain_size { . self.words.resize(from.domain_size, 0); . self.domain_size = from.domain_size; . } . . self.words.copy_from_slice(&from.words); . } . } . -- line 528 ---------------------------------------- -- line 599 ---------------------------------------- . } . } . } . . impl<'a, T: Idx> Iterator for BitIter<'a, T> { . type Item = T; . fn next(&mut self) -> Option { . loop { 267,843 ( 0.01%) if self.word != 0 { . // Get the position of the next set bit in the current word, . // then clear the bit. . let bit_pos = self.word.trailing_zeros() as usize; . let bit = 1 << bit_pos; . self.word ^= bit; 196,471 ( 0.01%) return Some(T::new(bit_pos + self.offset)); . } . . // Move onto the next word. `wrapping_add()` is needed to handle . // the degenerate initial value given to `offset` in `new()`. . let word = self.iter.next()?; 36,192 ( 0.00%) self.word = *word; . self.offset = self.offset.wrapping_add(WORD_BITS); . } . } . } . . #[inline] . fn bitwise(out_vec: &mut [Word], in_vec: &[Word], op: Op) -> bool . where . Op: Fn(Word, Word) -> Word, . { 282,664 ( 0.01%) assert_eq!(out_vec.len(), in_vec.len()); . let mut changed = 0; 118,476 ( 0.01%) for (out_elem, in_elem) in iter::zip(out_vec, in_vec) { 185,418 ( 0.01%) let old_val = *out_elem; 54,252 ( 0.00%) let new_val = op(old_val, *in_elem); 142,066 ( 0.01%) *out_elem = new_val; . // This is essentially equivalent to a != with changed being a bool, but . // in practice this code gets auto-vectorized by the compiler for most . // operators. Using != here causes us to generate quite poor code as the . // compiler tries to go back to a boolean on each loop iteration. 359,603 ( 0.02%) changed |= old_val ^ new_val; . } 2,378 ( 0.00%) changed != 0 . } . . const SPARSE_MAX: usize = 8; . . /// A fixed-size bitset type with a sparse representation and a maximum of . /// `SPARSE_MAX` elements. The elements are stored as a sorted `ArrayVec` with . /// no duplicates. . /// . /// This type is used by `HybridBitSet`; do not use directly. . #[derive(Clone, Debug)] . pub struct SparseBitSet { 35,750 ( 0.00%) domain_size: usize, . elems: ArrayVec, . } . . impl SparseBitSet { . fn new_empty(domain_size: usize) -> Self { . SparseBitSet { domain_size, elems: ArrayVec::new() } . } . . fn len(&self) -> usize { 119,318 ( 0.01%) self.elems.len() . } . . fn is_empty(&self) -> bool { . self.elems.len() == 0 . } . . fn contains(&self, elem: T) -> bool { 1,302 ( 0.00%) assert!(elem.index() < self.domain_size); . self.elems.contains(&elem) . } . . fn insert(&mut self, elem: T) -> bool { 118,702 ( 0.01%) assert!(elem.index() < self.domain_size); 54,822 ( 0.00%) let changed = if let Some(i) = self.elems.iter().position(|&e| e.index() >= elem.index()) { 25,606 ( 0.00%) if self.elems[i] == elem { . // `elem` is already in the set. . false . } else { . // `elem` is smaller than one or more existing elements. . self.elems.insert(i, elem); . true . } . } else { . // `elem` is larger than all existing elements. . self.elems.push(elem); . true . }; 118,702 ( 0.01%) assert!(self.len() <= SPARSE_MAX); . changed . } . . fn remove(&mut self, elem: T) -> bool { 94,938 ( 0.00%) assert!(elem.index() < self.domain_size); . if let Some(i) = self.elems.iter().position(|&e| e == elem) { 15,636 ( 0.00%) self.elems.remove(i); . true . } else { . false . } . } . . fn to_dense(&self) -> BitSet { . let mut dense = BitSet::new_empty(self.domain_size); . for elem in self.elems.iter() { 2,264 ( 0.00%) dense.insert(*elem); . } . dense . } . . fn iter(&self) -> slice::Iter<'_, T> { 9,764 ( 0.00%) self.elems.iter() . } . . bit_relations_inherent_impls! {} . } . . impl SparseBitSet { . fn last_set_in(&self, range: impl RangeBounds) -> Option { . let mut last_leq = None; -- line 723 ---------------------------------------- -- line 738 ---------------------------------------- . /// number of elements, but a large `domain_size`, and are cleared frequently. . /// . /// `T` is an index type, typically a newtyped `usize` wrapper, but it can also . /// just be `usize`. . /// . /// All operations that involve an element will panic if the element is equal . /// to or greater than the domain size. All operations that involve two bitsets . /// will panic if the bitsets have differing domain sizes. 324,130 ( 0.02%) #[derive(Clone)] . pub enum HybridBitSet { . Sparse(SparseBitSet), . Dense(BitSet), . } . . impl fmt::Debug for HybridBitSet { . fn fmt(&self, w: &mut fmt::Formatter<'_>) -> fmt::Result { . match self { -- line 754 ---------------------------------------- -- line 767 ---------------------------------------- . match self { . HybridBitSet::Sparse(sparse) => sparse.domain_size, . HybridBitSet::Dense(dense) => dense.domain_size, . } . } . . pub fn clear(&mut self) { . let domain_size = self.domain_size(); 6,344 ( 0.00%) *self = HybridBitSet::new_empty(domain_size); . } . . pub fn contains(&self, elem: T) -> bool { 756 ( 0.00%) match self { . HybridBitSet::Sparse(sparse) => sparse.contains(elem), . HybridBitSet::Dense(dense) => dense.contains(elem), . } . } . . pub fn superset(&self, other: &HybridBitSet) -> bool { . match (self, other) { . (HybridBitSet::Dense(self_dense), HybridBitSet::Dense(other_dense)) => { -- line 787 ---------------------------------------- -- line 799 ---------------------------------------- . HybridBitSet::Sparse(sparse) => sparse.is_empty(), . HybridBitSet::Dense(dense) => dense.is_empty(), . } . } . . /// Returns the previous element present in the bitset from `elem`, . /// inclusively of elem. That is, will return `Some(elem)` if elem is in the . /// bitset. 9,764 ( 0.00%) pub fn last_set_in(&self, range: impl RangeBounds) -> Option . where . T: Ord, . { 9,764 ( 0.00%) match self { . HybridBitSet::Sparse(sparse) => sparse.last_set_in(range), . HybridBitSet::Dense(dense) => dense.last_set_in(range), . } 14,646 ( 0.00%) } . 542,268 ( 0.03%) pub fn insert(&mut self, elem: T) -> bool { . // No need to check `elem` against `self.domain_size` here because all . // the match cases check it, one way or another. 120,504 ( 0.01%) match self { 119,318 ( 0.01%) HybridBitSet::Sparse(sparse) if sparse.len() < SPARSE_MAX => { . // The set is sparse and has space for `elem`. . sparse.insert(elem) . } . HybridBitSet::Sparse(sparse) if sparse.contains(elem) => { . // The set is sparse and does not have space for `elem`, but . // that doesn't matter because `elem` is already present. . false . } . HybridBitSet::Sparse(sparse) => { . // The set is sparse and full. Convert to a dense set. . let mut dense = sparse.to_dense(); . let changed = dense.insert(elem); 283 ( 0.00%) assert!(changed); 1,698 ( 0.00%) *self = HybridBitSet::Dense(dense); . changed . } . HybridBitSet::Dense(dense) => dense.insert(elem), . } 482,016 ( 0.02%) } . . pub fn insert_range(&mut self, elems: impl RangeBounds) { . // No need to check `elem` against `self.domain_size` here because all . // the match cases check it, one way or another. . let start = match elems.start_bound().cloned() { . Bound::Included(start) => start.index(), . Bound::Excluded(start) => start.index() + 1, . Bound::Unbounded => 0, -- line 848 ---------------------------------------- -- line 879 ---------------------------------------- . match self { . HybridBitSet::Sparse(_) => { . *self = HybridBitSet::Dense(BitSet::new_filled(domain_size)); . } . HybridBitSet::Dense(dense) => dense.insert_all(), . } . } . 47,002 ( 0.00%) pub fn remove(&mut self, elem: T) -> bool { . // Note: we currently don't bother going from Dense back to Sparse. 95,266 ( 0.00%) match self { . HybridBitSet::Sparse(sparse) => sparse.remove(elem), . HybridBitSet::Dense(dense) => dense.remove(elem), . } 94,004 ( 0.00%) } . . /// Converts to a dense set, consuming itself in the process. . pub fn to_dense(self) -> BitSet { . match self { . HybridBitSet::Sparse(sparse) => sparse.to_dense(), . HybridBitSet::Dense(dense) => dense, . } . } . . pub fn iter(&self) -> HybridIter<'_, T> { 4,430 ( 0.00%) match self { 7,095 ( 0.00%) HybridBitSet::Sparse(sparse) => HybridIter::Sparse(sparse.iter()), . HybridBitSet::Dense(dense) => HybridIter::Dense(dense.iter()), . } . } . . bit_relations_inherent_impls! {} . } . . pub enum HybridIter<'a, T: Idx> { -- line 913 ---------------------------------------- -- line 935 ---------------------------------------- . /// to or greater than the domain size. . #[derive(Clone, Debug, PartialEq)] . pub struct GrowableBitSet { . bit_set: BitSet, . } . . impl GrowableBitSet { . /// Ensure that the set can hold at least `min_domain_size` elements. 103,733 ( 0.01%) pub fn ensure(&mut self, min_domain_size: usize) { 29,638 ( 0.00%) if self.bit_set.domain_size < min_domain_size { 250 ( 0.00%) self.bit_set.domain_size = min_domain_size; . } . . let min_num_words = num_words(min_domain_size); 59,276 ( 0.00%) if self.bit_set.words.len() < min_num_words { . self.bit_set.words.resize(min_num_words, 0) . } 88,914 ( 0.00%) } . . pub fn new_empty() -> GrowableBitSet { 1,758 ( 0.00%) GrowableBitSet { bit_set: BitSet::new_empty(0) } . } . . pub fn with_capacity(capacity: usize) -> GrowableBitSet { 4 ( 0.00%) GrowableBitSet { bit_set: BitSet::new_empty(capacity) } . } . . /// Returns `true` if the set has changed. . #[inline] . pub fn insert(&mut self, elem: T) -> bool { 73,068 ( 0.00%) self.ensure(elem.index() + 1); . self.bit_set.insert(elem) . } . . /// Returns `true` if the set has changed. . #[inline] . pub fn remove(&mut self, elem: T) -> bool { 318 ( 0.00%) self.ensure(elem.index() + 1); . self.bit_set.remove(elem) . } . . #[inline] . pub fn is_empty(&self) -> bool { . self.bit_set.is_empty() . } . . #[inline] . pub fn contains(&self, elem: T) -> bool { . let (word_index, mask) = word_index_and_mask(elem); 2,032 ( 0.00%) self.bit_set.words.get(word_index).map_or(false, |word| (word & mask) != 0) . } . } . . /// A fixed-size 2D bit matrix type with a dense representation. . /// . /// `R` and `C` are index types used to identify rows and columns respectively; . /// typically newtyped `usize` wrappers, but they can also just be `usize`. . /// . /// All operations that involve a row and/or column index will panic if the . /// index exceeds the relevant bound. 126 ( 0.00%) #[derive(Clone, Eq, PartialEq, Hash, Decodable, Encodable)] . pub struct BitMatrix { . num_rows: usize, . num_columns: usize, . words: Vec, . marker: PhantomData<(R, C)>, . } . . impl BitMatrix { . /// Creates a new `rows x columns` matrix, initially empty. . pub fn new(num_rows: usize, num_columns: usize) -> BitMatrix { . // For every element, we need one bit for every other . // element. Round up to an even number of words. . let words_per_row = num_words(num_columns); 4,458 ( 0.00%) BitMatrix { . num_rows, . num_columns, 3,018 ( 0.00%) words: vec![0; num_rows * words_per_row], . marker: PhantomData, . } . } . . /// Creates a new matrix, with `row` used as the value for every row. . pub fn from_row_n(row: &BitSet, num_rows: usize) -> BitMatrix { . let num_columns = row.domain_size(); 9 ( 0.00%) let words_per_row = num_words(num_columns); 27 ( 0.00%) assert_eq!(words_per_row, row.words().len()); 36 ( 0.00%) BitMatrix { . num_rows, . num_columns, . words: iter::repeat(row.words()).take(num_rows).flatten().cloned().collect(), . marker: PhantomData, . } . } . . pub fn rows(&self) -> impl Iterator { . (0..self.num_rows).map(R::new) . } . . /// The range of bits for a given row. . fn range(&self, row: R) -> (usize, usize) { . let words_per_row = num_words(self.num_columns); 140,461 ( 0.01%) let start = row.index() * words_per_row; 131,430 ( 0.01%) (start, start + words_per_row) . } . . /// Sets the cell at `(row, column)` to true. Put another way, insert . /// `column` to the bitset for `row`. . /// . /// Returns `true` if this changed the matrix. 524 ( 0.00%) pub fn insert(&mut self, row: R, column: C) -> bool { 33,906 ( 0.00%) assert!(row.index() < self.num_rows && column.index() < self.num_columns); . let (start, _) = self.range(row); . let (word_index, mask) = word_index_and_mask(column); . let words = &mut self.words[..]; 34,200 ( 0.00%) let word = words[start + word_index]; 13,680 ( 0.00%) let new_word = word | mask; 6,840 ( 0.00%) words[start + word_index] = new_word; 13,680 ( 0.00%) word != new_word 1,048 ( 0.00%) } . . /// Do the bits from `row` contain `column`? Put another way, is . /// the matrix cell at `(row, column)` true? Put yet another way, . /// if the matrix represents (transitive) reachability, can . /// `row` reach `column`? 3,297 ( 0.00%) pub fn contains(&self, row: R, column: C) -> bool { 16,485 ( 0.00%) assert!(row.index() < self.num_rows && column.index() < self.num_columns); . let (start, _) = self.range(row); . let (word_index, mask) = word_index_and_mask(column); 16,485 ( 0.00%) (self.words[start + word_index] & mask) != 0 6,594 ( 0.00%) } . . /// Returns those indices that are true in rows `a` and `b`. This . /// is an *O*(*n*) operation where *n* is the number of elements . /// (somewhat independent from the actual size of the . /// intersection, in particular). . pub fn intersect_rows(&self, row1: R, row2: R) -> Vec { . assert!(row1.index() < self.num_rows && row2.index() < self.num_rows); . let (row1_start, row1_end) = self.range(row1); -- line 1073 ---------------------------------------- -- line 1090 ---------------------------------------- . . /// Adds the bits from row `read` to the bits from row `write`, and . /// returns `true` if anything changed. . /// . /// This is used when computing transitive reachability because if . /// you have an edge `write -> read`, because in that case . /// `write` can reach everything that `read` can (and . /// potentially more). 6,022 ( 0.00%) pub fn union_rows(&mut self, read: R, write: R) -> bool { 31,580 ( 0.00%) assert!(read.index() < self.num_rows && write.index() < self.num_rows); 6,316 ( 0.00%) let (read_start, read_end) = self.range(read); . let (write_start, write_end) = self.range(write); . let words = &mut self.words[..]; . let mut changed = false; . for (read_index, write_index) in iter::zip(read_start..read_end, write_start..write_end) { 33,932 ( 0.00%) let word = words[write_index]; 18,948 ( 0.00%) let new_word = word | words[read_index]; 6,316 ( 0.00%) words[write_index] = new_word; 31,874 ( 0.00%) changed |= word != new_word; . } . changed 18,066 ( 0.00%) } . . /// Adds the bits from `with` to the bits from row `write`, and . /// returns `true` if anything changed. 79,522 ( 0.00%) pub fn union_row_with(&mut self, with: &BitSet, write: R) -> bool { 79,522 ( 0.00%) assert!(write.index() < self.num_rows); 119,283 ( 0.01%) assert_eq!(with.domain_size(), self.num_columns); . let (write_start, write_end) = self.range(write); . let mut changed = false; . for (read_index, write_index) in iter::zip(0..with.words().len(), write_start..write_end) { . let word = self.words[write_index]; 365,900 ( 0.02%) let new_word = word | with.words()[read_index]; 182,950 ( 0.01%) self.words[write_index] = new_word; 914,750 ( 0.05%) changed |= word != new_word; . } . changed 159,044 ( 0.01%) } . . /// Sets every cell in `row` to true. 18 ( 0.00%) pub fn insert_all_into_row(&mut self, row: R) { 36 ( 0.00%) assert!(row.index() < self.num_rows); 18 ( 0.00%) let (start, end) = self.range(row); . let words = &mut self.words[..]; . for index in start..end { 54 ( 0.00%) words[index] = !0; . } . self.clear_excess_bits(row); 36 ( 0.00%) } . . /// Clear excess bits in the final word of the row. . fn clear_excess_bits(&mut self, row: R) { . let num_bits_in_final_word = self.num_columns % WORD_BITS; 36 ( 0.00%) if num_bits_in_final_word > 0 { 18 ( 0.00%) let mask = (1 << num_bits_in_final_word) - 1; . let (_, end) = self.range(row); 36 ( 0.00%) let final_word_idx = end - 1; 18 ( 0.00%) self.words[final_word_idx] &= mask; . } . } . . /// Gets a slice of the underlying words. . pub fn words(&self) -> &[Word] { . &self.words . } . -- line 1155 ---------------------------------------- -- line 1209 ---------------------------------------- . /// Creates a new empty sparse bit matrix with no rows or columns. . pub fn new(num_columns: usize) -> Self { . Self { num_columns, rows: IndexVec::new() } . } . . fn ensure_row(&mut self, row: R) -> &mut HybridBitSet { . // Instantiate any missing rows up to and including row `row` with an empty HybridBitSet. . // Then replace row `row` with a full HybridBitSet if necessary. 3,388 ( 0.00%) self.rows.get_or_insert_with(row, || HybridBitSet::new_empty(self.num_columns)) . } . . /// Sets the cell at `(row, column)` to true. Put another way, insert . /// `column` to the bitset for `row`. . /// . /// Returns `true` if this changed the matrix. . pub fn insert(&mut self, row: R, column: C) -> bool { 6,183 ( 0.00%) self.ensure_row(row).insert(column) . } . . /// Sets the cell at `(row, column)` to false. Put another way, delete . /// `column` from the bitset for `row`. Has no effect if `row` does not . /// exist. . /// . /// Returns `true` if this changed the matrix. . pub fn remove(&mut self, row: R, column: C) -> bool { -- line 1233 ---------------------------------------- -- line 1255 ---------------------------------------- . . /// Adds the bits from row `read` to the bits from row `write`, and . /// returns `true` if anything changed. . /// . /// This is used when computing transitive reachability because if . /// you have an edge `write -> read`, because in that case . /// `write` can reach everything that `read` can (and . /// potentially more). 250,278 ( 0.01%) pub fn union_rows(&mut self, read: R, write: R) -> bool { 35,754 ( 0.00%) if read == write || self.row(read).is_none() { . return false; . } . . self.ensure_row(write); 11,594 ( 0.00%) if let (Some(read_row), Some(write_row)) = self.rows.pick2_mut(read, write) { . write_row.union(read_row) . } else { . unreachable!() . } 321,786 ( 0.02%) } . . /// Insert all bits in the given row. . pub fn insert_all_into_row(&mut self, row: R) { . self.ensure_row(row).insert_all(); . } . . pub fn rows(&self) -> impl Iterator { . self.rows.indices() -- line 1282 ---------------------------------------- -- line 1284 ---------------------------------------- . . /// Iterates through all the columns set to true in a given row of . /// the matrix. . pub fn iter<'a>(&'a self, row: R) -> impl Iterator + 'a { . self.row(row).into_iter().flat_map(|r| r.iter()) . } . . pub fn row(&self, row: R) -> Option<&HybridBitSet> { 92,159 ( 0.00%) if let Some(Some(row)) = self.rows.get(row) { Some(row) } else { None } . } . . /// Interescts `row` with `set`. `set` can be either `BitSet` or . /// `HybridBitSet`. Has no effect if `row` does not exist. . /// . /// Returns true if the row was changed. . pub fn intersect_row(&mut self, row: R, set: &Set) -> bool . where -- line 1300 ---------------------------------------- -- line 1329 ---------------------------------------- . HybridBitSet: BitRelations, . { . self.ensure_row(row).union(set) . } . } . . #[inline] . fn num_words(domain_size: T) -> usize { 421,932 ( 0.02%) (domain_size.index() + WORD_BITS - 1) / WORD_BITS . } . . #[inline] . fn word_index_and_mask(elem: T) -> (usize, Word) { . let elem = elem.index(); 1,050,879 ( 0.05%) let word_index = elem / WORD_BITS; 180,514 ( 0.01%) let mask = 1 << (elem % WORD_BITS); . (word_index, mask) . } . . #[inline] . fn max_bit(word: Word) -> usize { . WORD_BITS - 1 - word.leading_zeros() as usize . } . -- line 1352 ---------------------------------------- 2,069,115 ( 0.10%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/md-5-0.9.1/src/utils.rs -------------------------------------------------------------------------------- Ir . #![allow(clippy::many_single_char_names)] . use crate::consts::RC; . use core::convert::TryInto; . . #[inline(always)] . fn op_f(w: u32, x: u32, y: u32, z: u32, m: u32, c: u32, s: u32) -> u32 { 704,702 ( 0.03%) ((x & y) | (!x & z)) . .wrapping_add(w) . .wrapping_add(m) . .wrapping_add(c) . .rotate_left(s) . .wrapping_add(x) . } . #[inline(always)] . fn op_g(w: u32, x: u32, y: u32, z: u32, m: u32, c: u32, s: u32) -> u32 { 671,772 ( 0.03%) ((x & z) | (y & !z)) . .wrapping_add(w) . .wrapping_add(m) . .wrapping_add(c) . .rotate_left(s) . .wrapping_add(x) . } . . #[inline(always)] . fn op_h(w: u32, x: u32, y: u32, z: u32, m: u32, c: u32, s: u32) -> u32 { 329,300 ( 0.02%) (x ^ y ^ z) . .wrapping_add(w) . .wrapping_add(m) . .wrapping_add(c) . .rotate_left(s) . .wrapping_add(x) . } . . #[inline(always)] . fn op_i(w: u32, x: u32, y: u32, z: u32, m: u32, c: u32, s: u32) -> u32 { 421,504 ( 0.02%) (y ^ (x | !z)) . .wrapping_add(w) . .wrapping_add(m) . .wrapping_add(c) . .rotate_left(s) . .wrapping_add(x) . } . . #[inline] 59,274 ( 0.00%) pub fn compress(state: &mut [u32; 4], input: &[u8; 64]) { 13,172 ( 0.00%) let mut a = state[0]; 6,586 ( 0.00%) let mut b = state[1]; 6,586 ( 0.00%) let mut c = state[2]; 6,586 ( 0.00%) let mut d = state[3]; . . let mut data = [0u32; 16]; . for (o, chunk) in data.iter_mut().zip(input.chunks_exact(4)) { 164,650 ( 0.01%) *o = u32::from_le_bytes(chunk.try_into().unwrap()); . } . . // round 1 . a = op_f(a, b, c, d, data[0], RC[0], 7); . d = op_f(d, a, b, c, data[1], RC[1], 12); . c = op_f(c, d, a, b, data[2], RC[2], 17); . b = op_f(b, c, d, a, data[3], RC[3], 22); . -- line 61 ---------------------------------------- -- line 132 ---------------------------------------- . c = op_i(c, d, a, b, data[6], RC[58], 15); . b = op_i(b, c, d, a, data[13], RC[59], 21); . . a = op_i(a, b, c, d, data[4], RC[60], 6); . d = op_i(d, a, b, c, data[11], RC[61], 10); . c = op_i(c, d, a, b, data[2], RC[62], 15); . b = op_i(b, c, d, a, data[9], RC[63], 21); . 13,172 ( 0.00%) state[0] = state[0].wrapping_add(a); 6,586 ( 0.00%) state[1] = state[1].wrapping_add(b); 6,586 ( 0.00%) state[2] = state[2].wrapping_add(c); 6,586 ( 0.00%) state[3] = state[3].wrapping_add(d); 52,688 ( 0.00%) } -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/rustc_entry.rs -------------------------------------------------------------------------------- Ir -- line 26 ---------------------------------------- . /// } . /// . /// assert_eq!(letters[&'s'], 2); . /// assert_eq!(letters[&'t'], 3); . /// assert_eq!(letters[&'u'], 1); . /// assert_eq!(letters.get(&'y'), None); . /// ``` . #[cfg_attr(feature = "inline-more", inline)] 2,905,227 ( 0.14%) pub fn rustc_entry(&mut self, key: K) -> RustcEntry<'_, K, V, A> { . let hash = make_insert_hash(&self.hash_builder, &key); 1,245 ( 0.00%) if let Some(elem) = self.table.find(hash, |q| q.0.eq(&key)) { 226,590 ( 0.01%) RustcEntry::Occupied(RustcOccupiedEntry { 174,731 ( 0.01%) key: Some(key), . elem, . table: &mut self.table, . }) . } else { . // Ideally we would put this in VacantEntry::insert, but Entry is not . // generic over the BuildHasher and adding a generic parameter would be . // a breaking change. . self.reserve(1); . 671,270 ( 0.03%) RustcEntry::Vacant(RustcVacantEntry { . hash, 182,129 ( 0.01%) key, . table: &mut self.table, . }) . } 2,244,066 ( 0.11%) } . } . . /// A view into a single entry in a map, which may either be vacant or occupied. . /// . /// This `enum` is constructed from the [`entry`] method on [`HashMap`]. . /// . /// [`HashMap`]: struct.HashMap.html . /// [`entry`]: struct.HashMap.html#method.rustc_entry -- line 62 ---------------------------------------- -- line 405 ---------------------------------------- . /// if let RustcEntry::Occupied(o) = map.rustc_entry("poneyland") { . /// *o.into_mut() += 10; . /// } . /// . /// assert_eq!(map["poneyland"], 22); . /// ``` . #[cfg_attr(feature = "inline-more", inline)] . pub fn into_mut(self) -> &'a mut V { 17,902 ( 0.00%) unsafe { &mut self.elem.as_mut().1 } . } . . /// Sets the value of the entry, and returns the entry's old value. . /// . /// # Examples . /// . /// ``` . /// use hashbrown::HashMap; -- line 421 ---------------------------------------- -- line 568 ---------------------------------------- . /// let mut map: HashMap<&str, u32> = HashMap::new(); . /// . /// if let RustcEntry::Vacant(o) = map.rustc_entry("poneyland") { . /// o.insert(37); . /// } . /// assert_eq!(map["poneyland"], 37); . /// ``` . #[cfg_attr(feature = "inline-more", inline)] 17,852 ( 0.00%) pub fn insert(self, value: V) -> &'a mut V { . unsafe { 146,291 ( 0.01%) let bucket = self.table.insert_no_grow(self.hash, (self.key, value)); 7,935 ( 0.00%) &mut bucket.as_mut().1 . } 23,860 ( 0.00%) } . . /// Sets the value of the entry with the RustcVacantEntry's key, . /// and returns a RustcOccupiedEntry. . /// . /// # Examples . /// . /// ``` . /// use hashbrown::HashMap; -- line 589 ---------------------------------------- 652,175 ( 0.03%) -------------------------------------------------------------------------------- -- 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 { 4,160 ( 0.00%) pub fn new(graph: &(impl DirectedGraph + WithNumNodes + WithSuccessors)) -> Self { . SccsConstruction::construct(graph) 4,176 ( 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 { 32,324 ( 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 { 24 ( 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]; 86,080 ( 0.00%) &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. 10,749 ( 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, . } . 2,300 ( 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(); . 5,104 ( 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) 90,774 ( 0.00%) .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(); . 2,784 ( 0.00%) Sccs { scc_indices, scc_data: this.scc_data } . } . 136,161 ( 0.01%) fn start_walk_from(&mut self, node: G::Node) -> WalkReturn { 60,516 ( 0.00%) if let Some(result) = self.inspect_node(node) { . result . } else { . self.walk_unvisited_node(node) . } 151,290 ( 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. 184,860 ( 0.01%) fn inspect_node(&mut self, node: G::Node) -> Option> { 369,720 ( 0.02%) Some(match self.find_state(node) { 78,666 ( 0.00%) NodeState::InCycle { scc_index } => WalkReturn::Complete { scc_index }, . 14,592 ( 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 . ), . }) 323,505 ( 0.02%) } . . /// 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]); 363,794 ( 0.02%) match self.node_states[node] { 104,888 ( 0.01%) NodeState::InCycle { scc_index } => break NodeState::InCycle { scc_index }, 19,456 ( 0.00%) NodeState::BeingVisited { depth } => break NodeState::BeingVisited { depth }, 15,129 ( 0.00%) NodeState::NotVisited => break NodeState::NotVisited, 6,083 ( 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. 6,083 ( 0.00%) assert!(node != parent, "Node can not be in cycle with itself"); . // Store the previous node as an inverted list link 30,415 ( 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. 71,322 ( 0.00%) if previous_node == node { . return node_state; . } . // Update to previous node in the link. 12,166 ( 0.00%) match self.node_states[previous_node] { 6,083 ( 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. 24,332 ( 0.00%) match node_state { . // Path compression, make current node point to the same root. . NodeState::InCycle { .. } => { 8,760 ( 0.00%) self.node_states[node] = node_state; . } . // Still visiting nodes, compress to cycle to the node . // at that depth. 1,703 ( 0.00%) NodeState::BeingVisited { depth } => { 3,406 ( 0.00%) self.node_states[node] = 1,703 ( 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) . } . } . } 92,430 ( 0.00%) } . . /// 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); . 3,220 ( 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; . 15,129 ( 0.00%) 'recurse: while let Some(frame) = stack.last_mut() { . let VisitingNodeFrame { 59,582 ( 0.00%) node, . depth, . iter, 59,596 ( 0.00%) successors_len, . min_depth, . min_cycle_root, . successor_node, . } = frame; . 29,798 ( 0.00%) let node = *node; 59,610 ( 0.00%) let depth = *depth; . 89,394 ( 0.00%) 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. 60,516 ( 0.00%) 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. 30,258 ( 0.00%) *successors_len = successors_stack.len(); . // Set and return a reference, this is currently empty. 60,507 ( 0.00%) iter.get_or_insert(self.graph.successors(node)) . } . }; . . // Now that iter is initialized, this is a constant for this frame. 59,596 ( 0.00%) 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); 93,258 ( 0.00%) (successor_node, self.inspect_node(successor_node)) . }); . 121,782 ( 0.01%) for (successor_node, walk) in returned_walk.chain(successor_walk) { 164,532 ( 0.01%) match walk { . Some(WalkReturn::Cycle { min_depth: successor_min_depth }) => { . // Track the minimum depth we can reach. 18,488 ( 0.00%) assert!(successor_min_depth <= depth); 23,009 ( 0.00%) if successor_min_depth < *min_depth { . debug!(?node, ?successor_min_depth); 13,558 ( 0.00%) *min_depth = successor_min_depth; 4,521 ( 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 => { 29,338 ( 0.00%) let depth = depth + 1; . debug!(?depth, ?successor_node); . // Remember which node the return value will come from. 14,669 ( 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()); 30,258 ( 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..) 21,842 ( 0.00%) .filter(move |&i| duplicate_set.insert(i)) . }; . let scc_index = self.scc_data.create_scc(deduplicated_successors); 64,494 ( 0.00%) 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. 26,280 ( 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. 4,140 ( 0.00%) self.successors_stack = successors_stack; . debug_assert_eq!(self.successors_stack.len(), 0); . . return_value.unwrap() . } . } 659,447 ( 0.03%) -------------------------------------------------------------------------------- -- 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); . 50,092 ( 0.00%) if count == 8 { . ptr::copy_nonoverlapping(src, dst, 8); . return; . } . . let mut i = 0; 62,838 ( 0.00%) if i + 3 < count { . ptr::copy_nonoverlapping(src.add(i), dst.add(i), 4); . i += 4; . } . 134,908 ( 0.01%) if i + 1 < count { . ptr::copy_nonoverlapping(src.add(i), dst.add(i), 2); 18,158 ( 0.00%) i += 2 . } . 62,838 ( 0.00%) if i < count { 39,846 ( 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::(); 530,938 ( 0.03%) let nbuf = self.nbuf; . debug_assert!(size <= 8); . debug_assert!(nbuf < BUFFER_SIZE); . debug_assert!(nbuf + size < BUFFER_WITH_SPILL_SIZE); . 3,521,475 ( 0.17%) 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); . } . 1,087,859 ( 0.05%) self.nbuf = nbuf + size; . . return; . } . 167,723 ( 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)] 50,928 ( 0.00%) unsafe fn short_write_process_buffer(&mut self, x: T) { . let size = mem::size_of::(); 50,928 ( 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 { 509,280 ( 0.03%) let elem = self.buf.get_unchecked(i).assume_init().to_le(); 407,424 ( 0.02%) self.state.v3 ^= elem; . Sip24Rounds::c_rounds(&mut self.state); 458,352 ( 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. 237,800 ( 0.01%) self.nbuf = if size == 1 { 0 } else { nbuf + size - BUFFER_SIZE }; 203,712 ( 0.01%) self.processed += BUFFER_SIZE; 101,856 ( 0.01%) } . . // A write function for byte slices. . #[inline] . fn slice_write(&mut self, msg: &[u8]) { . let length = msg.len(); 17,382 ( 0.00%) let nbuf = self.nbuf; . debug_assert!(nbuf < BUFFER_SIZE); . 184,646 ( 0.01%) if nbuf + length < BUFFER_SIZE { . unsafe { . let dst = (self.buf.as_mut_ptr() as *mut u8).add(nbuf); . 66,820 ( 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); . } . } . 33,496 ( 0.00%) self.nbuf = nbuf + length; . . return; . } . 23,467 ( 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)] 16,050 ( 0.00%) unsafe fn slice_write_process_buffer(&mut self, msg: &[u8]) { . let length = msg.len(); 3,210 ( 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. 9,630 ( 0.00%) let valid_in_elem = nbuf % ELEM_SIZE; 3,210 ( 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. 6,420 ( 0.00%) let last = nbuf / ELEM_SIZE + 1; . . for i in 0..last { 23,030 ( 0.00%) let elem = self.buf.get_unchecked(i).assume_init().to_le(); 26,240 ( 0.00%) self.state.v3 ^= elem; . Sip24Rounds::c_rounds(&mut self.state); 46,060 ( 0.00%) self.state.v0 ^= elem; . } . . // Process the remaining element-sized chunks of input. . let mut processed = needed_in_elem; 6,420 ( 0.00%) let input_left = length - processed; 4,344 ( 0.00%) let elems_left = input_left / ELEM_SIZE; . let extra_bytes_left = input_left % ELEM_SIZE; . . for _ in 0..elems_left { 3,133 ( 0.00%) let elem = (msg.as_ptr().add(processed) as *const u64).read_unaligned().to_le(); 3,133 ( 0.00%) self.state.v3 ^= elem; . Sip24Rounds::c_rounds(&mut self.state); 3,133 ( 0.00%) self.state.v0 ^= elem; 6,266 ( 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); . 3,210 ( 0.00%) self.nbuf = extra_bytes_left; 16,050 ( 0.00%) self.processed += nbuf + processed; 19,260 ( 0.00%) } . . #[inline] . pub fn finish128(mut self) -> (u64, u64) { . debug_assert!(self.nbuf < BUFFER_SIZE); . . // Process full elements in buffer. 29,571 ( 0.00%) let last = self.nbuf / ELEM_SIZE; . . // Since we're consuming self, avoid updating members for a potential . // performance gain. 39,428 ( 0.00%) let mut state = self.state; . . for i in 0..last { 28,505 ( 0.00%) let elem = unsafe { self.buf.get_unchecked(i).assume_init().to_le() }; 28,505 ( 0.00%) state.v3 ^= elem; . Sip24Rounds::c_rounds(&mut state); 28,505 ( 0.00%) state.v0 ^= elem; . } . . // Get remaining partial element. 19,714 ( 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); 8,530 ( 0.00%) self.buf.get_unchecked(last).assume_init().to_le() . } . } else { . 0 . }; . . // Finalize the hash. 28,244 ( 0.00%) let length = self.processed + self.nbuf; 19,712 ( 0.00%) let b: u64 = ((length as u64 & 0xff) << 56) | elem; . 9,856 ( 0.00%) state.v3 ^= b; . Sip24Rounds::c_rounds(&mut state); 9,856 ( 0.00%) state.v0 ^= b; . 9,856 ( 0.00%) state.v2 ^= 0xee; . Sip24Rounds::d_rounds(&mut state); 30,974 ( 0.00%) let _0 = state.v0 ^ state.v1 ^ state.v2 ^ state.v3; . 11,260 ( 0.00%) state.v1 ^= 0xdd; . Sip24Rounds::d_rounds(&mut state); 11,260 ( 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) { 1,948,350 ( 0.10%) compress!(state); 2,109,666 ( 0.10%) compress!(state); . } . . #[inline] . fn d_rounds(state: &mut State) { 61,944 ( 0.00%) compress!(state); 61,944 ( 0.00%) compress!(state); 61,944 ( 0.00%) compress!(state); 52,089 ( 0.00%) compress!(state); . } . } 429,428 ( 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> { 479,465 ( 0.02%) TypeFreshener { . infcx, . ty_freshen_count: 0, . const_freshen_count: 0, . ty_freshen_map: Default::default(), . const_freshen_map: Default::default(), . keep_static, . } . } . 114,096 ( 0.01%) fn freshen_ty( . &mut self, . opt_ty: Option>, . key: ty::InferTy, . freshener: F, . ) -> Ty<'tcx> . where . F: FnOnce(u32) -> ty::InferTy, . { 28,524 ( 0.00%) if let Some(ty) = opt_ty { . return ty.fold_with(self); . } . 16,448 ( 0.00%) match self.ty_freshen_map.entry(key) { 1,086 ( 0.00%) Entry::Occupied(entry) => *entry.get(), . Entry::Vacant(entry) => { 7,138 ( 0.00%) let index = self.ty_freshen_count; 28,552 ( 0.00%) self.ty_freshen_count += 1; 14,276 ( 0.00%) let t = self.infcx.tcx.mk_ty_infer(freshener(index)); . entry.insert(t); . t . } . } 74,016 ( 0.00%) } . . 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> { 139,296 ( 0.01%) self.infcx.tcx 24,987 ( 0.00%) } . . fn fold_region(&mut self, r: ty::Region<'tcx>) -> ty::Region<'tcx> { 95,404 ( 0.00%) 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 => { 7,046 ( 0.00%) if self.keep_static { . r . } else { . self.tcx().lifetimes.re_erased . } . } . } 106 ( 0.00%) } . 631,398 ( 0.03%) fn fold_ty(&mut self, t: Ty<'tcx>) -> Ty<'tcx> { 315,699 ( 0.02%) if !t.needs_infer() && !t.has_erasable_regions() { . return t; . } . . let tcx = self.infcx.tcx; . 246,420 ( 0.01%) match *t.kind() { 14,119 ( 0.00%) ty::Infer(ty::TyVar(v)) => { 112,952 ( 0.01%) let opt_ty = self.infcx.inner.borrow_mut().type_variables().probe(v).known(); 127,071 ( 0.01%) self.freshen_ty(opt_ty, ty::TyVar(v), ty::FreshTy) . } . 572 ( 0.00%) ty::Infer(ty::IntVar(v)) => self.freshen_ty( 1,144 ( 0.00%) self.infcx . .inner . .borrow_mut() . .int_unification_table() . .probe_value(v) . .map(|v| v.to_type(tcx)), . ty::IntVar(v), . ty::FreshIntTy, . ), -- line 170 ---------------------------------------- -- line 210 ---------------------------------------- . | ty::Dynamic(..) . | ty::Never . | ty::Tuple(..) . | ty::Projection(..) . | ty::Foreign(..) . | ty::Param(..) . | ty::Closure(..) . | ty::GeneratorWitness(..) 276,800 ( 0.01%) | ty::Opaque(..) => t.super_fold_with(self), . . ty::Placeholder(..) | ty::Bound(..) => bug!("unexpected type {:?}", t), . } 395,598 ( 0.02%) } . 2,520 ( 0.00%) fn fold_const(&mut self, ct: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> { 2,520 ( 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(_) => {} . } . 3,360 ( 0.00%) ct.super_fold_with(self) . } . } 170,114 ( 0.01%) -------------------------------------------------------------------------------- -- 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> { 178,763 ( 0.01%) DefIdVisitorSkeleton { . def_id_visitor: self, . visited_opaque_tys: Default::default(), . dummy: Default::default(), . } . } 2,850 ( 0.00%) fn visit(&mut self, ty_fragment: impl TypeFoldable<'tcx>) -> ControlFlow { . ty_fragment.visit_with(&mut self.skeleton()) 4,750 ( 0.00%) } 924 ( 0.00%) fn visit_trait(&mut self, trait_ref: TraitRef<'tcx>) -> ControlFlow { . self.skeleton().visit_trait(trait_ref) 924 ( 0.00%) } . fn visit_projection_ty( . &mut self, . projection: ty::ProjectionTy<'tcx>, . ) -> ControlFlow { 64 ( 0.00%) self.skeleton().visit_projection_ty(projection) . } . fn visit_predicates( . &mut self, . predicates: ty::GenericPredicates<'tcx>, . ) -> ControlFlow { 1,948 ( 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 { 154 ( 0.00%) let TraitRef { def_id, substs } = trait_ref; 37,713 ( 0.00%) self.def_id_visitor.visit_def_id(def_id, "trait", &trait_ref.print_only_trait_path())?; 154 ( 0.00%) if self.def_id_visitor.shallow() { ControlFlow::CONTINUE } else { substs.visit_with(self) } . } . 9,530 ( 0.00%) fn visit_projection_ty( . &mut self, . projection: ty::ProjectionTy<'tcx>, . ) -> ControlFlow { 7,624 ( 0.00%) let (trait_ref, assoc_substs) = 1,906 ( 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)) . } 8,577 ( 0.00%) } . . fn visit_predicate(&mut self, predicate: ty::Predicate<'tcx>) -> ControlFlow { 1,478 ( 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 }) => { 296 ( 0.00%) term.visit_with(self)?; 1,424 ( 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 . } . }) . } . 14,434 ( 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)) 16,496 ( 0.00%) } . } . . impl<'tcx, V> TypeVisitor<'tcx> for DefIdVisitorSkeleton<'_, 'tcx, V> . where . V: DefIdVisitor<'tcx> + ?Sized, . { . type BreakTy = V::BreakTy; . 606,486 ( 0.03%) fn visit_ty(&mut self, ty: Ty<'tcx>) -> ControlFlow { 67,563 ( 0.00%) let tcx = self.def_id_visitor.tcx(); . // InternalSubsts are not visited here because they are visited below in `super_visit_with`. 333,099 ( 0.02%) match *ty.kind() { 105,683 ( 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, ..) => { 463,136 ( 0.02%) 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. 106,053 ( 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. 165,680 ( 0.01%) if let Some(assoc_item) = tcx.opt_associated_item(def_id) { 9,102 ( 0.00%) if let ty::ImplContainer(impl_def_id) = assoc_item.container { 1,884 ( 0.00%) tcx.type_of(impl_def_id).visit_with(self)?; . } . } . } 1,236 ( 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. 6,057 ( 0.00%) return self.visit_projection_ty(proj); . } 901 ( 0.00%) ty::Dynamic(predicates, ..) => { . // All traits in the list are considered the "primary" part of the type . // and are visited by shallow visitors. 9,496 ( 0.00%) for predicate in predicates { 15,542 ( 0.00%) let trait_ref = match predicate.skip_binder() { 5,142 ( 0.00%) ty::ExistentialPredicate::Trait(trait_ref) => trait_ref, 1,258 ( 0.00%) ty::ExistentialPredicate::Projection(proj) => proj.trait_ref(tcx), . ty::ExistentialPredicate::AutoTrait(def_id) => { 5,655 ( 0.00%) ty::ExistentialTraitRef { def_id, substs: InternalSubsts::empty() } . } . }; 1,714 ( 0.00%) let ty::ExistentialTraitRef { def_id, substs: _ } = trait_ref; 24,546 ( 0.00%) self.def_id_visitor.visit_def_id(def_id, "trait", &trait_ref)?; . } . } 2,324 ( 0.00%) ty::Opaque(def_id, ..) => { . // Skip repeated `Opaque`s to avoid infinite recursion. 2,324 ( 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. 228 ( 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 { 182,244 ( 0.01%) ty.super_visit_with(self) . } 578,360 ( 0.03%) } . . fn visit_const(&mut self, c: &'tcx Const<'tcx>) -> ControlFlow { 2,358 ( 0.00%) self.visit_ty(c.ty)?; 393 ( 0.00%) let tcx = self.def_id_visitor.tcx(); 2,751 ( 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 { 488 ( 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 { 1,515 ( 0.00%) self.tcx.hir() . } . fn visit_vis(&mut self, vis: &'tcx hir::Visibility<'tcx>) { 3,772 ( 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 { 7,216 ( 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. 6,650 ( 0.00%) fn of_impl(def_id: LocalDefId, tcx: TyCtxt<'_>, access_levels: &AccessLevels) -> Self { 3,040 ( 0.00%) let mut find = FindMin { tcx, access_levels, min: Self::MAX }; 950 ( 0.00%) find.visit(tcx.type_of(def_id)); 2,850 ( 0.00%) if let Some(trait_ref) = tcx.impl_trait_ref(def_id) { 154 ( 0.00%) find.visit_trait(trait_ref); . } 668 ( 0.00%) find.min 7,600 ( 0.00%) } . } . impl VisibilityLike for ty::Visibility { . const MAX: Self = ty::Visibility::Public; 3,479 ( 0.00%) fn new_min(find: &FindMin<'_, '_, Self>, def_id: DefId) -> Self { 1,491 ( 0.00%) min(find.tcx.visibility(def_id), find.min, find.tcx) 4,970 ( 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; 3,984 ( 0.00%) fn new_min(find: &FindMin<'_, '_, Self>, def_id: DefId) -> Self { . cmp::min( 3,984 ( 0.00%) if let Some(def_id) = def_id.as_local() { 1,568 ( 0.00%) find.access_levels.map.get(&def_id).copied() . } else { . Self::MAX . }, 2,380 ( 0.00%) find.min, . ) 5,312 ( 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> { 18,748 ( 0.00%) fn get(&self, def_id: LocalDefId) -> Option { . self.access_levels.map.get(&def_id).copied() 18,748 ( 0.00%) } . . fn update_with_hir_id( . &mut self, . hir_id: hir::HirId, . level: Option, . ) -> Option { 2,408 ( 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 { 17,951 ( 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()); 380 ( 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, . } 4,986 ( 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. . 12 ( 0.00%) let hir_id = self.tcx.hir().local_def_id_to_hir_id(local_def_id); 36 ( 0.00%) let attrs = self.tcx.hir().attrs(hir_id); 84 ( 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 { 6,060 ( 0.00%) self.tcx.hir() . } . 24,264 ( 0.00%) fn visit_item(&mut self, item: &'tcx hir::Item<'tcx>) { 5,392 ( 0.00%) let item_level = match item.kind { . hir::ItemKind::Impl { .. } => { . let impl_level = 4,560 ( 0.00%) Option::::of_impl(item.def_id, self.tcx, &self.access_levels); 760 ( 0.00%) self.update(item.def_id, impl_level) . } 7,744 ( 0.00%) _ => self.get(item.def_id), . }; . . // Update levels of nested things. 13,580 ( 0.00%) match item.kind { . hir::ItemKind::Enum(ref def, _) => { 68 ( 0.00%) for variant in def.variants { 468 ( 0.00%) let variant_level = self.update_with_hir_id(variant.id, item_level); 624 ( 0.00%) if let Some(ctor_hir_id) = variant.data.ctor_hir_id() { . self.update_with_hir_id(ctor_hir_id, item_level); . } 312 ( 0.00%) for field in variant.data.fields() { 248 ( 0.00%) self.update_with_hir_id(field.hir_id, variant_level); . } . } . } . hir::ItemKind::Impl(ref impl_) => { 2,280 ( 0.00%) for impl_item_ref in impl_.items { 5,876 ( 0.00%) if impl_.of_trait.is_some() 1,584 ( 0.00%) || self.tcx.visibility(impl_item_ref.id.def_id) == ty::Visibility::Public . { 2,384 ( 0.00%) self.update(impl_item_ref.id.def_id, item_level); . } . } . } 144 ( 0.00%) hir::ItemKind::Trait(.., trait_item_refs) => { . for trait_item_ref in trait_item_refs { 56 ( 0.00%) self.update(trait_item_ref.id.def_id, item_level); . } . } . hir::ItemKind::Struct(ref def, _) | hir::ItemKind::Union(ref def, _) => { 976 ( 0.00%) if let Some(ctor_hir_id) = def.ctor_hir_id() { . self.update_with_hir_id(ctor_hir_id, item_level); . } 488 ( 0.00%) for field in def.fields() { 2,624 ( 0.00%) if field.vis.node.is_pub() { 16 ( 0.00%) self.update_with_hir_id(field.hir_id, item_level); . } . } . } . hir::ItemKind::Macro(ref macro_def) => { 24 ( 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. 13,480 ( 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 176 ( 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)); 132 ( 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(..) => { 268 ( 0.00%) if item_level.is_some() { 16 ( 0.00%) self.reach(item.def_id, item_level).generics().predicates().ty(); . } . } 30 ( 0.00%) hir::ItemKind::Trait(.., trait_item_refs) => { 48 ( 0.00%) if item_level.is_some() { 120 ( 0.00%) self.reach(item.def_id, item_level).generics().predicates(); . . for trait_item_ref in trait_item_refs { 30 ( 0.00%) let mut reach = self.reach(trait_item_ref.id.def_id, item_level); 60 ( 0.00%) reach.generics().predicates(); . 15 ( 0.00%) if trait_item_ref.kind == AssocItemKind::Type . && !trait_item_ref.defaultness.has_value() . { . // No type to visit. . } else { 30 ( 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_) => { 760 ( 0.00%) if item_level.is_some() { 3,640 ( 0.00%) self.reach(item.def_id, item_level).generics().predicates().ty().trait_ref(); . 364 ( 0.00%) for impl_item_ref in impl_.items { 3,060 ( 0.00%) let impl_item_level = self.get(impl_item_ref.id.def_id); 2,952 ( 0.00%) if impl_item_level.is_some() { 8,190 ( 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, _) => { 68 ( 0.00%) if item_level.is_some() { 96 ( 0.00%) self.reach(item.def_id, item_level).generics().predicates(); . } 68 ( 0.00%) for variant in def.variants { 1,404 ( 0.00%) let variant_level = self.get(self.tcx.hir().local_def_id(variant.id)); 156 ( 0.00%) if variant_level.is_some() { 42 ( 0.00%) for field in variant.data.fields() { 288 ( 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. 42 ( 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, _) => { 244 ( 0.00%) if item_level.is_some() { 656 ( 0.00%) self.reach(item.def_id, item_level).generics().predicates(); 164 ( 0.00%) for field in struct_def.fields() { 1,190 ( 0.00%) let def_id = self.tcx.hir().local_def_id(field.hir_id); 510 ( 0.00%) let field_level = self.get(def_id); 170 ( 0.00%) if field_level.is_some() { . self.reach(def_id, field_level).ty(); . } . } . } . } . } . . let orig_level = mem::replace(&mut self.prev_level, item_level); 8,088 ( 0.00%) intravisit::walk_item(self, item); 2,696 ( 0.00%) self.prev_level = orig_level; 21,568 ( 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<'_, '_> { 9,513 ( 0.00%) fn generics(&mut self) -> &mut Self { 5,436 ( 0.00%) for param in &self.ev.tcx.generics_of(self.item_def_id).params { 2,186 ( 0.00%) match param.kind { . GenericParamDefKind::Lifetime => {} 186 ( 0.00%) GenericParamDefKind::Type { has_default, .. } => { 186 ( 0.00%) if has_default { . 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 12,231 ( 0.00%) } . 6,795 ( 0.00%) fn predicates(&mut self) -> &mut Self { 4,077 ( 0.00%) self.visit_predicates(self.ev.tcx.predicates_of(self.item_def_id)); . self 8,154 ( 0.00%) } . 6,250 ( 0.00%) fn ty(&mut self) -> &mut Self { 3,782 ( 0.00%) self.visit(self.ev.tcx.type_of(self.item_def_id)); . self 7,500 ( 0.00%) } . . fn trait_ref(&mut self) -> &mut Self { 2,184 ( 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> { 25,656 ( 0.00%) self.ev.tcx . } 32,610 ( 0.00%) fn visit_def_id( . &mut self, . def_id: DefId, . _kind: &str, . _descr: &dyn fmt::Display, . ) -> ControlFlow { 19,690 ( 0.00%) if let Some(def_id) = def_id.as_local() { 14,923 ( 0.00%) if let (ty::Visibility::Public, _) | (_, Some(AccessLevel::ReachableFromImplTrait)) = 3,735 ( 0.00%) (self.tcx().visibility(def_id.to_def_id()), self.access_level) . { . self.ev.update(def_id, self.access_level); . } . } . ControlFlow::CONTINUE 45,654 ( 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. 4,770 ( 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, . ) { 954 ( 0.00%) if def.is_enum() { . return; . } . . // definition of the field . let ident = Ident::new(kw::Empty, use_ctxt); 620 ( 0.00%) let hir_id = self.tcx.hir().local_def_id_to_hir_id(self.current_item); 2,170 ( 0.00%) let def_id = self.tcx.adjust_ident_and_get_scope(ident, def.did, hir_id).1; 310 ( 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(); . } 3,816 ( 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 { 1,041 ( 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 = 2,419 ( 0.00%) self.maybe_typeck_results.replace(self.tcx.typeck_body(body)); 2,736 ( 0.00%) let body = self.tcx.hir().body(body); . self.visit_body(body); 165 ( 0.00%) self.maybe_typeck_results = old_maybe_typeck_results; . } . . fn visit_item(&mut self, item: &'tcx hir::Item<'tcx>) { 674 ( 0.00%) let orig_current_item = mem::replace(&mut self.current_item, item.def_id); 2,004 ( 0.00%) intravisit::walk_item(self, item); 674 ( 0.00%) self.current_item = orig_current_item; . } . 74,016 ( 0.00%) fn visit_expr(&mut self, expr: &'tcx hir::Expr<'tcx>) { 16,448 ( 0.00%) if let hir::ExprKind::Struct(qpath, fields, ref base) = expr.kind { 582 ( 0.00%) let res = self.typeck_results().qpath_res(qpath, expr.hir_id); 291 ( 0.00%) let adt = self.typeck_results().expr_ty(expr).ty_adt_def().unwrap(); 873 ( 0.00%) let variant = adt.variant_of_res(res); 388 ( 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| { . self.tcx.field_index(f.hir_id, self.typeck_results()) == vf_index . }); . let (use_ctxt, span) = match field { . Some(field) => (field.ident.span, field.span), . None => (base.span, base.span), . }; . self.check_field(use_ctxt, span, adt, variant_field, true); . } . } else { . for field in fields { 262 ( 0.00%) let use_ctxt = field.ident.span; 1,785 ( 0.00%) let index = self.tcx.field_index(field.hir_id, self.typeck_results()); 2,882 ( 0.00%) self.check_field(use_ctxt, field.span, adt, &variant.fields[index], false); . } . } . } . 82,240 ( 0.00%) intravisit::walk_expr(self, expr); . } . 15,824 ( 0.00%) fn visit_pat(&mut self, pat: &'tcx hir::Pat<'tcx>) { 4,156 ( 0.00%) if let PatKind::Struct(ref qpath, fields, _) = pat.kind { 1,400 ( 0.00%) let res = self.typeck_results().qpath_res(qpath, pat.hir_id); 800 ( 0.00%) let adt = self.typeck_results().pat_ty(pat).ty_adt_def().unwrap(); 1,600 ( 0.00%) let variant = adt.variant_of_res(res); . for field in fields { 215 ( 0.00%) let use_ctxt = field.ident.span; 1,588 ( 0.00%) let index = self.tcx.field_index(field.hir_id, self.typeck_results()); 2,150 ( 0.00%) self.check_field(use_ctxt, field.span, adt, &variant.fields[index], false); . } . } . 17,802 ( 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. 75,488 ( 0.00%) fn check_expr_pat_type(&mut self, id: hir::HirId, span: Span) -> bool { 10,784 ( 0.00%) self.span = span; 10,784 ( 0.00%) let typeck_results = self.typeck_results(); . let result: ControlFlow<()> = try { 43,136 ( 0.00%) self.visit(typeck_results.node_type(id))?; 86,272 ( 0.00%) self.visit(typeck_results.node_substs(id))?; 97,056 ( 0.00%) if let Some(adjustments) = typeck_results.adjustments().get(id) { . adjustments.iter().try_for_each(|adjustment| self.visit(adjustment.target))?; . } . }; . result.is_break() 86,272 ( 0.00%) } . . fn check_def_id(&mut self, def_id: DefId, kind: &str, descr: &dyn fmt::Display) -> bool { 64,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 { 1,041 ( 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` . } . 4,560 ( 0.00%) fn visit_nested_body(&mut self, body: hir::BodyId) { . let old_maybe_typeck_results = 1,368 ( 0.00%) self.maybe_typeck_results.replace(self.tcx.typeck_body(body)); 2,736 ( 0.00%) let body = self.tcx.hir().body(body); . self.visit_body(body); 456 ( 0.00%) self.maybe_typeck_results = old_maybe_typeck_results; 3,648 ( 0.00%) } . . fn visit_generic_arg(&mut self, generic_arg: &'tcx hir::GenericArg<'tcx>) { 4,437 ( 0.00%) match generic_arg { 2,388 ( 0.00%) hir::GenericArg::Type(t) => self.visit_ty(t), . hir::GenericArg::Infer(inf) => self.visit_infer(inf), . hir::GenericArg::Lifetime(_) | hir::GenericArg::Const(_) => {} . } . } . 21,021 ( 0.00%) fn visit_ty(&mut self, hir_ty: &'tcx hir::Ty<'tcx>) { 6,006 ( 0.00%) self.span = hir_ty.span; 9,009 ( 0.00%) if let Some(typeck_results) = self.maybe_typeck_results { . // Types in bodies. 1,290 ( 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. 7,719 ( 0.00%) if self.visit(rustc_typeck::hir_ty_to_ty(self.tcx, hir_ty)).is_break() { . return; . } . } . 9,009 ( 0.00%) intravisit::walk_ty(self, hir_ty); 18,018 ( 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); . } . 2,632 ( 0.00%) fn visit_trait_ref(&mut self, trait_ref: &'tcx hir::TraitRef<'tcx>) { 987 ( 0.00%) self.span = trait_ref.path.span; 329 ( 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. 329 ( 0.00%) let bounds = rustc_typeck::hir_trait_to_predicates( 329 ( 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`. 987 ( 0.00%) self.tcx.types.never, . ); . 2,961 ( 0.00%) for (trait_predicate, _, _) in bounds.trait_bounds { 2,303 ( 0.00%) if self.visit_trait(trait_predicate.skip_binder()).is_break() { . return; . } . } . 2,081 ( 0.00%) for (poly_predicate, _) in bounds.projection_bounds { 96 ( 0.00%) let pred = poly_predicate.skip_binder(); . let poly_pred_term = self.visit(pred.term); 64 ( 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); 2,632 ( 0.00%) } . . // Check types of expressions 74,016 ( 0.00%) fn visit_expr(&mut self, expr: &'tcx hir::Expr<'tcx>) { 74,016 ( 0.00%) if self.check_expr_pat_type(expr.hir_id, expr.span) { . // Do not check nested expressions if the error already happened. . return; . } 53,974 ( 0.00%) match expr.kind { 393 ( 0.00%) hir::ExprKind::Assign(_, rhs, _) | hir::ExprKind::Match(rhs, ..) => { . // Do not report duplicate errors for `x = y` and `match x { ... }`. 2,198 ( 0.00%) if self.check_expr_pat_type(rhs.hir_id, rhs.span) { . return; . } . } 781 ( 0.00%) hir::ExprKind::MethodCall(segment, ..) => { . // Method calls have to be checked specially. 1,562 ( 0.00%) self.span = segment.ident.span; 4,686 ( 0.00%) if let Some(def_id) = self.typeck_results().type_dependent_def_id(expr.hir_id) { 2,343 ( 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"); . } . } . _ => {} . } . 24,672 ( 0.00%) intravisit::walk_expr(self, expr); 65,792 ( 0.00%) } . . // 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.) 60,260 ( 0.00%) fn visit_qpath(&mut self, qpath: &'tcx hir::QPath<'tcx>, id: hir::HirId, span: Span) { 12,052 ( 0.00%) let def = match qpath { 15,936 ( 0.00%) hir::QPath::Resolved(_, path) => match path.res { 17,586 ( 0.00%) Res::Def(kind, def_id) => Some((kind, def_id)), . _ => None, . }, 714 ( 0.00%) hir::QPath::TypeRelative(..) | hir::QPath::LangItem(..) => self . .maybe_typeck_results 6,156 ( 0.00%) .and_then(|typeck_results| typeck_results.type_dependent_def(id)), . }; . let def = def.filter(|(kind, _)| { 7,230 ( 0.00%) matches!( . kind, . DefKind::AssocFn | DefKind::AssocConst | DefKind::AssocTy | DefKind::Static . ) . }); . if let Some((kind, def_id)) = def { . let is_local_static = 2,448 ( 0.00%) if let DefKind::Static = kind { def_id.is_local() } else { false }; 1,428 ( 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; . } . } . 66,286 ( 0.00%) intravisit::walk_qpath(self, qpath, id, span); . } . . // Check types of patterns. . fn visit_pat(&mut self, pattern: &'tcx hir::Pat<'tcx>) { 13,170 ( 0.00%) if self.check_expr_pat_type(pattern.hir_id, pattern.span) { . // Do not check nested patterns if the error already happened. . return; . } . 7,006 ( 0.00%) intravisit::walk_pat(self, pattern); . } . 1,355 ( 0.00%) fn visit_local(&mut self, local: &'tcx hir::Local<'tcx>) { 813 ( 0.00%) if let Some(init) = local.init { 1,876 ( 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); 1,056 ( 0.00%) } . . // Check types in item interfaces. . fn visit_item(&mut self, item: &'tcx hir::Item<'tcx>) { 674 ( 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(); 2,004 ( 0.00%) intravisit::walk_item(self, item); 674 ( 0.00%) self.maybe_typeck_results = old_maybe_typeck_results; 844 ( 0.00%) self.current_item = orig_current_item; . } . } . . impl<'tcx> DefIdVisitor<'tcx> for TypePrivacyVisitor<'tcx> { . fn tcx(&self) -> TyCtxt<'tcx> { 108,055 ( 0.01%) self.tcx . } 484,005 ( 0.02%) 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 . } 290,403 ( 0.01%) } . } . . /////////////////////////////////////////////////////////////////////////////// . /// 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> { 483 ( 0.00%) fn path_is_private_type(&self, path: &hir::Path<'_>) -> bool { 1,566 ( 0.00%) let did = match path.res { . Res::PrimTy(..) | Res::SelfTy(..) | Res::Err => return false, 2,316 ( 0.00%) res => res.def_id(), . }; . . // A path can only be private if: . // it's in this crate... 386 ( 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). 1,487 ( 0.00%) match self.tcx.hir().find(self.tcx.hir().local_def_id_to_hir_id(did)) { 1,032 ( 0.00%) Some(Node::Item(item)) => !item.vis.node.is_pub(), . Some(_) | None => false, . } . } else { . false . } 966 ( 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<'_>) { 138 ( 0.00%) if let hir::GenericBound::Trait(ref trait_ref, _) = *bound { 63 ( 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 { 745 ( 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>) { 18 ( 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<'_>) { 826 ( 0.00%) if let hir::TyKind::Path(hir::QPath::Resolved(_, path)) = ty.kind { 648 ( 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 { 2 ( 0.00%) if self.at_outer_type { 66 ( 0.00%) self.outer_type_is_public_path = true; . } . } 141 ( 0.00%) self.at_outer_type = false; 142 ( 0.00%) intravisit::walk_ty(self, ty) 280 ( 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 { 703 ( 0.00%) self.tcx.hir() . } . 5,265 ( 0.00%) fn visit_item(&mut self, item: &'tcx hir::Item<'tcx>) { 2,340 ( 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 { .. } => {} . 12 ( 0.00%) hir::ItemKind::Trait(.., bounds, _) => { 28 ( 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: . { 660 ( 0.00%) let mut visitor = ObsoleteCheckTypeForPrivatenessVisitor { . inner: self, . contains_private: false, . at_outer_type: true, . outer_type_is_public_path: false, . }; 165 ( 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| { 405 ( 0.00%) if let Some(def_id) = tr.path.res.def_id().as_local() { 39 ( 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() 30 ( 0.00%) || impl_.items.iter().any(|impl_item_ref| { 232 ( 0.00%) let impl_item = self.tcx.hir().impl_item(impl_item_ref.id); 261 ( 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, . } . }); . 294 ( 0.00%) if !self_contains_private && not_private_trait && trait_or_some_public_method { . intravisit::walk_generics(self, &impl_.generics); . 110 ( 0.00%) match impl_.of_trait { . None => { 12 ( 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. 858 ( 0.00%) let impl_item = self.tcx.hir().impl_item(impl_item_ref.id); 775 ( 0.00%) match impl_item.kind { . hir::ImplItemKind::Const(..) | hir::ImplItemKind::Fn(..) 364 ( 0.00%) if self 143 ( 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. 129 ( 0.00%) intravisit::walk_path(self, tr.path); . . // Those in 3. are warned with this call. 43 ( 0.00%) for impl_item_ref in impl_.items { 215 ( 0.00%) let impl_item = self.tcx.hir().impl_item(impl_item_ref.id); 368 ( 0.00%) if let hir::ImplItemKind::TyAlias(ty) = impl_item.kind { . self.visit_ty(ty); . } . } . } . } 330 ( 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; 2 ( 0.00%) for impl_item_ref in impl_.items { 24 ( 0.00%) if self.access_levels.is_reachable(impl_item_ref.id.def_id) 12 ( 0.00%) || self.tcx.visibility(impl_item_ref.id.def_id) . == ty::Visibility::Public . { . let impl_item = self.tcx.hir().impl_item(impl_item_ref.id); . match impl_item_ref.kind { . AssocItemKind::Const => { . found_pub_static = true; . intravisit::walk_impl_item(self, impl_item); . } -- line 1571 ---------------------------------------- -- line 1572 ---------------------------------------- . AssocItemKind::Fn { has_self: false } => { . found_pub_static = true; . intravisit::walk_impl_item(self, impl_item); . } . _ => {} . } . } . } 2 ( 0.00%) if found_pub_static { . 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. 2,598 ( 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. 610 ( 0.00%) intravisit::walk_item(self, item); 4,192 ( 0.00%) } . 1,064 ( 0.00%) fn visit_generics(&mut self, generics: &'tcx hir::Generics<'tcx>) { . for param in generics.params { 33 ( 0.00%) for bound in param.bounds { . self.check_generic_bound(bound); . } . } 133 ( 0.00%) for predicate in generics.where_clause.predicates { 42 ( 0.00%) match predicate { . hir::WherePredicate::BoundPredicate(bound_pred) => { 14 ( 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,064 ( 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>) { 1,374 ( 0.00%) if let hir::TyKind::Path(hir::QPath::Resolved(_, path)) = t.kind { 968 ( 0.00%) if self.path_is_private_type(path) { . self.old_error_set.insert(t.hir_id); . } . } 2,089 ( 0.00%) intravisit::walk_ty(self, t) . } . 16 ( 0.00%) fn visit_variant( . &mut self, . v: &'tcx hir::Variant<'tcx>, . g: &'tcx hir::Generics<'tcx>, . item_id: hir::HirId, . ) { 20 ( 0.00%) if self.access_levels.is_reachable(self.tcx.hir().local_def_id(v.id)) { 2 ( 0.00%) self.in_variant = true; . intravisit::walk_variant(self, v, g, item_id); 2 ( 0.00%) self.in_variant = false; . } 14 ( 0.00%) } . 160 ( 0.00%) fn visit_field_def(&mut self, s: &'tcx hir::FieldDef<'tcx>) { 192 ( 0.00%) if s.vis.node.is_pub() || self.in_variant { . intravisit::walk_field_def(self, s); . } 112 ( 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<'_> { 4,123 ( 0.00%) fn generics(&mut self) -> &mut Self { 1,767 ( 0.00%) for param in &self.tcx.generics_of(self.item_def_id).params { 853 ( 0.00%) match param.kind { . GenericParamDefKind::Lifetime => {} 95 ( 0.00%) GenericParamDefKind::Type { has_default, .. } => { 95 ( 0.00%) if has_default { . 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 4,712 ( 0.00%) } . 2,890 ( 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`. 1,156 ( 0.00%) self.visit_predicates(self.tcx.explicit_predicates_of(self.item_def_id)); . self 3,468 ( 0.00%) } . 55 ( 0.00%) fn bounds(&mut self) -> &mut Self { . self.visit_predicates(ty::GenericPredicates { . parent: None, 22 ( 0.00%) predicates: self.tcx.explicit_item_bounds(self.item_def_id), . }); . self 55 ( 0.00%) } . 3,215 ( 0.00%) fn ty(&mut self) -> &mut Self { 1,286 ( 0.00%) self.visit(self.tcx.type_of(self.item_def_id)); . self 3,215 ( 0.00%) } . . fn check_def_id(&mut self, def_id: DefId, kind: &str, descr: &dyn fmt::Display) -> bool { 12,571 ( 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() . }, . ); . } . 5,839 ( 0.00%) let hir_id = match def_id.as_local() { 1,460 ( 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); 2,078 ( 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 { 8,757 ( 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> { 4,147 ( 0.00%) self.tcx . } 46,704 ( 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 . } 26,271 ( 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> { 6,164 ( 0.00%) SearchInterfaceForPrivateItemsVisitor { 576 ( 0.00%) tcx: self.tcx, . item_def_id: def_id, . required_visibility, 971 ( 0.00%) has_pub_restricted: self.has_pub_restricted, . has_old_errors: self.old_error_set_ancestry.contains(&def_id), . in_assoc_ty: false, . } . } . 5,005 ( 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); . 770 ( 0.00%) let (check_ty, is_assoc_ty) = match assoc_item_kind { . AssocItemKind::Const | AssocItemKind::Fn { .. } => (true, false), 56 ( 0.00%) AssocItemKind::Type => (defaultness.has_value(), true), . }; 770 ( 0.00%) check.in_assoc_ty = is_assoc_ty; 1,540 ( 0.00%) check.generics().predicates(); 56 ( 0.00%) if check_ty { 385 ( 0.00%) check.ty(); . } 3,080 ( 0.00%) } . } . . impl<'tcx> Visitor<'tcx> for PrivateItemsInPublicInterfacesVisitor<'tcx> { . type NestedFilter = nested_filter::OnlyBodies; . . fn nested_visit_map(&mut self) -> Self::Map { 389 ( 0.00%) self.tcx.hir() . } . 6,066 ( 0.00%) fn visit_item(&mut self, item: &'tcx hir::Item<'tcx>) { 674 ( 0.00%) let tcx = self.tcx; 674 ( 0.00%) let item_visibility = tcx.visibility(item.def_id); . 3,370 ( 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(..) => { 402 ( 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. 55 ( 0.00%) self.check(item.def_id, item_visibility).generics().bounds(); . } 48 ( 0.00%) hir::ItemKind::Trait(.., trait_item_refs) => { 48 ( 0.00%) self.check(item.def_id, item_visibility).generics().predicates(); . . for trait_item_ref in trait_item_refs { 42 ( 0.00%) self.check_assoc_item( 7 ( 0.00%) trait_item_ref.id.def_id, . trait_item_ref.kind, . trait_item_ref.defaultness, . item_visibility, . ); . 34 ( 0.00%) if let AssocItemKind::Type = trait_item_ref.kind { . 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, _) => { 68 ( 0.00%) self.check(item.def_id, item_visibility).generics().predicates(); . 17 ( 0.00%) for variant in def.variants { 39 ( 0.00%) for field in variant.data.fields() { 324 ( 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, _) => { 244 ( 0.00%) self.check(item.def_id, item_visibility).generics().predicates(); . 183 ( 0.00%) for field in struct_def.fields() { 984 ( 0.00%) let def_id = tcx.hir().local_def_id(field.hir_id); . let field_visibility = tcx.visibility(def_id); 492 ( 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_) => { 760 ( 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 380 ( 0.00%) if impl_.of_trait.is_none() { 180 ( 0.00%) self.check(item.def_id, impl_vis).generics().predicates(); . } 190 ( 0.00%) for impl_item_ref in impl_.items { 275 ( 0.00%) let impl_item_vis = if impl_.of_trait.is_none() { 198 ( 0.00%) min(tcx.visibility(impl_item_ref.id.def_id), impl_vis, tcx) . } else { . impl_vis . }; 2,070 ( 0.00%) self.check_assoc_item( 378 ( 0.00%) impl_item_ref.id.def_id, . impl_item_ref.kind, . impl_item_ref.defaultness, . impl_item_vis, . ); . } . } . } 5,392 ( 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%) } . 12,456 ( 0.00%) fn visibility(tcx: TyCtxt<'_>, def_id: DefId) -> ty::Visibility { 1,384 ( 0.00%) let def_id = def_id.expect_local(); . match tcx.resolutions(()).visibilities.get(&def_id) { 2,018 ( 0.00%) Some(vis) => *vis, . None => { . let hir_id = tcx.hir().local_def_id_to_hir_id(def_id); 4,380 ( 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(..), .. }) => { 270 ( 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 { 150 ( 0.00%) vis, . kind: hir::ItemKind::Use(..) | hir::ItemKind::OpaqueTy(..), . .. 900 ( 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) => { 2,340 ( 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), .. }), . .. 180 ( 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, . ), . } . } . } 11,072 ( 0.00%) } . 144 ( 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 = 72 ( 0.00%) NamePrivacyVisitor { tcx, maybe_typeck_results: None, current_item: module_def_id }; 162 ( 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 = 108 ( 0.00%) TypePrivacyVisitor { tcx, maybe_typeck_results: None, current_item: module_def_id, span }; . intravisit::walk_mod(&mut visitor, module, hir_id); 144 ( 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); 8 ( 0.00%) if visitor.changed { 9 ( 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 { . if !old_error_set_ancestry.insert(id) { . break; . } . let parent = tcx.hir().get_parent_node(id); . 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%) } 356,989 ( 0.02%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/leb128.rs -------------------------------------------------------------------------------- Ir -- line 17 ---------------------------------------- . #[inline] . pub fn $fn_name( . out: &mut [::std::mem::MaybeUninit; max_leb128_len!($int_ty)], . mut value: $int_ty, . ) -> &[u8] { . let mut i = 0; . . loop { 492,770 ( 0.02%) if value < 0x80 { . unsafe { 191,911 ( 0.01%) *out.get_unchecked_mut(i).as_mut_ptr() = value as u8; . } . 266,784 ( 0.01%) i += 1; . break; . } else { . unsafe { 299,064 ( 0.01%) *out.get_unchecked_mut(i).as_mut_ptr() = ((value & 0x7f) | 0x80) as u8; . } . 104,457 ( 0.01%) value >>= 7; . i += 1; . } . } . . unsafe { ::std::mem::MaybeUninit::slice_assume_init_ref(&out.get_unchecked(..i)) } . } . }; . } -- line 45 ---------------------------------------- -- line 53 ---------------------------------------- . macro_rules! impl_read_unsigned_leb128 { . ($fn_name:ident, $int_ty:ty) => { . #[inline] . pub fn $fn_name(slice: &[u8], position: &mut usize) -> $int_ty { . // The first iteration of this loop is unpeeled. This is a . // performance win because this code is hot and integer values less . // than 128 are very common, typically occurring 50-80% or more of . // the time, even for u64 and u128. 5,025,960 ( 0.25%) let byte = slice[*position]; 2,512,980 ( 0.12%) *position += 1; 2,512,980 ( 0.12%) if (byte & 0x80) == 0 { 122 ( 0.00%) return byte as $int_ty; . } 2,508 ( 0.00%) let mut result = (byte & 0x7F) as $int_ty; . let mut shift = 7; . loop { 1,728,177 ( 0.09%) let byte = slice[*position]; 1,135,218 ( 0.06%) *position += 1; 1,152,118 ( 0.06%) if (byte & 0x80) == 0 { 954,051 ( 0.05%) result |= (byte as $int_ty) << shift; . return result; . } else { . result |= ((byte & 0x7F) as $int_ty) << shift; . } . shift += 7; . } . } . }; -- line 80 ---------------------------------------- 1,879,209 ( 0.09%) -------------------------------------------------------------------------------- -- 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. 109,254 ( 0.01%) 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. 477,150 ( 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`. 177 ( 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 { 138,687 ( 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 { 208,528 ( 0.01%) assume(!self.ptr.as_ptr().is_null()); . if mem::size_of::() != 0 { 98,683 ( 0.00%) assume(!self.end.is_null()); . } 35,388,582 ( 1.74%) if is_empty!(self) { . None . } else { 19 ( 0.00%) Some(next_unchecked!(self)) . } . } . } . . #[inline] . fn size_hint(&self) -> (usize, Option) { 1,149,762 ( 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> { 19,187 ( 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() { 4,592 ( 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, . { 1,734 ( 0.00%) while let Some(x) = self.next() { 26,678 ( 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] 1,136 ( 0.00%) fn any(&mut self, mut f: F) -> bool . where . Self: Sized, . F: FnMut(Self::Item) -> bool, . { 417,770 ( 0.02%) while let Some(x) = self.next() { 453,488 ( 0.02%) if f(x) { . return true; . } . } . false 1,136 ( 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, . { 20,340 ( 0.00%) while let Some(x) = self.next() { 110,161 ( 0.01%) if predicate(&x) { . return Some(x); . } . } . None 38,626 ( 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, . { 53,914 ( 0.00%) while let Some(x) = self.next() { 157,934 ( 0.01%) if let Some(y) = f(x) { 23,180 ( 0.00%) return Some(y); . } . } . None 5,594 ( 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() { 390,304 ( 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; 10,236 ( 0.00%) while let Some(x) = self.next_back() { 139,775 ( 0.01%) i -= 1; 115,987 ( 0.01%) if predicate(x) { . // SAFETY: `i` must be lower than `n` since it starts at `n` . // and is only decreasing. . unsafe { assume(i < n) }; . return Some(i); . } . } . None . } -- line 326 ---------------------------------------- -- line 332 ---------------------------------------- . // the returned references is guaranteed to refer to an element . // of the slice and thus guaranteed to be valid. . // . // Also note that the caller also guarantees that we're never . // called with the same index again, and that no other methods . // that will access this subslice are called, so it is valid . // for the returned reference to be mutable in the case of . // `IterMut` 74,839 ( 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 { 1 ( 0.00%) assume(!self.ptr.as_ptr().is_null()); . if mem::size_of::() != 0 { 82 ( 0.00%) assume(!self.end.is_null()); . } 792,166 ( 0.04%) if is_empty!(self) { . None . } else { . Some(next_back_unchecked!(self)) . } . } . } . . #[inline] -- line 369 ---------------------------------------- 6,767,197 ( 0.33%) -------------------------------------------------------------------------------- -- 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>> { 5,320 ( 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>> { 110 ( 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 { 71,294 ( 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), . .. . }) 12,372 ( 0.00%) | Node::Expr(Expr { kind: ExprKind::Closure(.., body, _, _), .. }) => Some(*body), . 72 ( 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>); . 6,951 ( 0.00%) fn next(&mut self) -> Option { 1,021 ( 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); . 3,075 ( 0.00%) if parent_id == self.current_id { . self.current_id = CRATE_HIR_ID; . return None; . } . 2,078 ( 0.00%) self.current_id = parent_id; 8,212 ( 0.00%) if let Some(node) = self.map.find(parent_id) { 3,972 ( 0.00%) return Some((parent_id, node)); . } . // If this `HirId` doesn't have an entry, skip it and look for its `parent_id`. . } 8,937 ( 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>); . 64,350 ( 0.00%) fn next(&mut self) -> Option { 21,450 ( 0.00%) if self.current_id.local_id.index() != 0 { 3,582 ( 0.00%) self.current_id.local_id = ItemLocalId::new(0); 14,328 ( 0.00%) if let Some(node) = self.map.tcx.hir_owner(self.current_id.owner) { . return Some((self.current_id.owner, node.node)); . } . } 3,568 ( 0.00%) if self.current_id == CRATE_HIR_ID { 6 ( 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 . }); 7,130 ( 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`. 7,130 ( 0.00%) if let Some(node) = self.map.tcx.hir_owner(self.current_id.owner) { . return Some((self.current_id.owner, node.node)); . } . } 57,200 ( 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] 116,124 ( 0.01%) pub fn local_def_id(&self, hir_id: HirId) -> LocalDefId { 21,552 ( 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) . ) . }) 87,093 ( 0.00%) } . . #[inline] 57,472 ( 0.00%) pub fn opt_local_def_id(&self, hir_id: HirId) -> Option { 18,773 ( 0.00%) if hir_id.local_id == ItemLocalId::new(0) { . Some(hir_id.owner) . } else { 9,912 ( 0.00%) self.tcx . .hir_owner_nodes(hir_id.owner)? . .local_id_to_def_id . .get(&hir_id.local_id) . .copied() . } 64,656 ( 0.00%) } . . #[inline] 58 ( 0.00%) pub fn local_def_id_to_hir_id(&self, def_id: LocalDefId) -> HirId { . // FIXME(#85914) is this access safe for incr. comp.? 4,647 ( 0.00%) self.tcx.untracked_resolutions.definitions.local_def_id_to_hir_id(def_id) 116 ( 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%) } . 14,189 ( 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); 26,351 ( 0.00%) let def_kind = match self.find(hir_id)? { 2,696 ( 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, . }, 14 ( 0.00%) Node::TraitItem(item) => match item.kind { . TraitItemKind::Const(..) => DefKind::AssocConst, . TraitItemKind::Fn(..) => DefKind::AssocFn, . TraitItemKind::Type(..) => DefKind::AssocTy, . }, 378 ( 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`? 245 ( 0.00%) assert_ne!(variant_data.ctor_hir_id(), None); . 317 ( 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!(), . }; 98 ( 0.00%) DefKind::Ctor(ctor_of, def::CtorKind::from_hir(variant_data)) 196 ( 0.00%) } . Node::AnonConst(_) => { 8 ( 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, 225 ( 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)), . }, 510 ( 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, . }; 6,220 ( 0.00%) Some(def_kind) 20,270 ( 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)) . } . 799,864 ( 0.04%) pub fn find_parent_node(&self, id: HirId) -> Option { 99,983 ( 0.00%) if id.local_id == ItemLocalId::from_u32(0) { . Some(self.tcx.hir_owner_parent(id.owner)) . } else { 189,550 ( 0.01%) let owner = self.tcx.hir_owner_nodes(id.owner)?; 94,775 ( 0.00%) let node = owner.nodes[id.local_id].as_ref()?; 284,325 ( 0.01%) let hir_id = HirId { owner: id.owner, local_id: node.parent }; . Some(hir_id) . } 799,864 ( 0.04%) } . 3,361 ( 0.00%) pub fn get_parent_node(&self, hir_id: HirId) -> HirId { 518,158 ( 0.03%) self.find_parent_node(hir_id).unwrap() 6,722 ( 0.00%) } . . /// Retrieves the `Node` corresponding to `id`, returning `None` if cannot be found. 486,584 ( 0.02%) pub fn find(&self, id: HirId) -> Option> { 60,823 ( 0.00%) if id.local_id == ItemLocalId::from_u32(0) { . let owner = self.tcx.hir_owner(id.owner)?; 39,034 ( 0.00%) Some(owner.node.into()) . } else { 42,538 ( 0.00%) let owner = self.tcx.hir_owner_nodes(id.owner)?; 21,269 ( 0.00%) let node = owner.nodes[id.local_id].as_ref()?; 63,807 ( 0.00%) Some(node.node) . } 486,584 ( 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> { 9,676 ( 0.00%) self.find(self.local_def_id_to_hir_id(id)) . } . . /// Retrieves the `Node` corresponding to `id`, panicking if it cannot be found. 42,384 ( 0.00%) pub fn get(&self, id: HirId) -> Node<'hir> { 21,720 ( 0.00%) self.find(id).unwrap_or_else(|| bug!("couldn't find hir id {} in the HIR map", id)) 28,256 ( 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)) . } . 1,286 ( 0.00%) pub fn get_if_local(&self, id: DefId) -> Option> { 643 ( 0.00%) id.as_local().and_then(|id| self.find(self.local_def_id_to_hir_id(id))) 1,286 ( 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, . } . } . 134,946 ( 0.01%) pub fn item(&self, id: ItemId) -> &'hir Item<'hir> { 38,556 ( 0.00%) self.tcx.hir_owner(id.def_id).unwrap().node.expect_item() 154,224 ( 0.01%) } . 1,372 ( 0.00%) pub fn trait_item(&self, id: TraitItemId) -> &'hir TraitItem<'hir> { 392 ( 0.00%) self.tcx.hir_owner(id.def_id).unwrap().node.expect_trait_item() 1,568 ( 0.00%) } . 79,702 ( 0.00%) pub fn impl_item(&self, id: ImplItemId) -> &'hir ImplItem<'hir> { 22,772 ( 0.00%) self.tcx.hir_owner(id.def_id).unwrap().node.expect_impl_item() 91,088 ( 0.00%) } . . pub fn foreign_item(&self, id: ForeignItemId) -> &'hir ForeignItem<'hir> { . self.tcx.hir_owner(id.def_id).unwrap().node.expect_foreign_item() . } . 113,596 ( 0.01%) pub fn body(&self, id: BodyId) -> &'hir Body<'hir> { 32,456 ( 0.00%) self.tcx.hir_owner_nodes(id.hir_id.owner).unwrap().bodies[&id.hir_id.local_id] 129,824 ( 0.01%) } . 3,192 ( 0.00%) pub fn fn_decl_by_hir_id(&self, hir_id: HirId) -> Option<&'hir FnDecl<'hir>> { 3,192 ( 0.00%) if let Some(node) = self.find(hir_id) { . fn_decl(node) . } else { . bug!("no node for hir_id `{}`", hir_id) . } 2,128 ( 0.00%) } . 48 ( 0.00%) pub fn fn_sig_by_hir_id(&self, hir_id: HirId) -> Option<&'hir FnSig<'hir>> { 48 ( 0.00%) if let Some(node) = self.find(hir_id) { . fn_sig(node) . } else { . bug!("no node for hir_id `{}`", hir_id) . } 48 ( 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`. 73,048 ( 0.00%) pub fn body_owner(&self, BodyId { hir_id }: BodyId) -> HirId { . let parent = self.get_parent_node(hir_id); 54,786 ( 0.00%) assert!(self.find(parent).map_or(false, |n| is_body_owner(n, hir_id))); . parent 73,048 ( 0.00%) } . 22,775 ( 0.00%) pub fn body_owner_def_id(&self, id: BodyId) -> LocalDefId { 35,920 ( 0.00%) self.local_def_id(self.body_owner(id)) 22,775 ( 0.00%) } . . /// Given a `HirId`, returns the `BodyId` associated with it, . /// if the node is a body owner, otherwise returns `None`. 3,691 ( 0.00%) pub fn maybe_body_owned_by(&self, hir_id: HirId) -> Option { 11,986 ( 0.00%) self.find(hir_id).map(associated_body).flatten() 11,073 ( 0.00%) } . . /// Given a body owner's id, returns the `BodyId` associated with it. 8,217 ( 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) . ); . }) 6,391 ( 0.00%) } . 395 ( 0.00%) pub fn body_param_names(&self, id: BodyId) -> impl Iterator + 'hir { 3,517 ( 0.00%) self.body(id).params.iter().map(|arg| match arg.pat.kind { 1,166 ( 0.00%) PatKind::Binding(_, _, ident, _) => ident, . _ => Ident::empty(), . }) 1,185 ( 0.00%) } . . /// Returns the `BodyOwnerKind` of this `LocalDefId`. . /// . /// Panics if `LocalDefId` does not have an associated body. 13,731 ( 0.00%) pub fn body_owner_kind(&self, id: HirId) -> BodyOwnerKind { 36,075 ( 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, 36 ( 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), . } 13,731 ( 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. 14,992 ( 0.00%) pub fn body_const_context(&self, did: LocalDefId) -> Option { . let hir_id = self.local_def_id_to_hir_id(did); 22,488 ( 0.00%) let ccx = match self.body_owner_kind(hir_id) { . BodyOwnerKind::Const => ConstContext::Const, 54 ( 0.00%) BodyOwnerKind::Static(mt) => ConstContext::Static(mt), . 1,580 ( 0.00%) BodyOwnerKind::Fn if self.tcx.is_constructor(did.to_def_id()) => return None, 1,580 ( 0.00%) BodyOwnerKind::Fn if self.tcx.is_const_fn_raw(did.to_def_id()) => ConstContext::ConstFn, . BodyOwnerKind::Fn 3,160 ( 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) 16,866 ( 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)| { 6,063 ( 0.00%) let bodies = &owner_info.as_ref()?.nodes.bodies; . Some(bodies.iter().map(move |&(local_id, _)| { 46 ( 0.00%) let hir_id = HirId { owner, local_id }; . let body_id = BodyId { hir_id }; 4,422 ( 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); 12,126 ( 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 }; 4,104 ( 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 { 6 ( 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 { 20 ( 0.00%) match self.get(id) { . Node::Item(&Item { kind: ItemKind::Trait(..) | ItemKind::TraitAlias(..), .. }) => { . kw::SelfUpper . } 20 ( 0.00%) Node::GenericParam(param) => param.name.ident().name, . _ => bug!("ty_param_name: {} not a type parameter", self.node_to_string(id)), . } 60 ( 0.00%) } . 1,251 ( 0.00%) pub fn trait_impls(&self, trait_did: DefId) -> &'hir [LocalDefId] { 139 ( 0.00%) self.tcx.all_local_trait_impls(()).get(&trait_did).map_or(&[], |xs| &xs[..]) 1,251 ( 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) . } . 448 ( 0.00%) pub fn get_module(&self, module: LocalDefId) -> (&'hir Mod<'hir>, Span, HirId) { . let hir_id = HirId::make_owner(module); 320 ( 0.00%) match self.tcx.hir_owner(module).map(|o| o.node) { 102 ( 0.00%) Some(OwnerNode::Item(&Item { span, kind: ItemKind::Mod(ref m), .. })) => { . (m, span, hir_id) . } 39 ( 0.00%) Some(OwnerNode::Crate(item)) => (item, item.inner, hir_id), . node => panic!("not a module: {:?}", node), . } 576 ( 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>) { 40 ( 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() { 8,084 ( 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 { 8,355 ( 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) { 38,160 ( 0.00%) match owner.node() { 31,678 ( 0.00%) OwnerNode::Item(item) => visitor.visit_item(item), . OwnerNode::ForeignItem(item) => visitor.visit_foreign_item(item), 1,134 ( 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) { 674 ( 0.00%) Some(OwnerNode::Item(item)) => visitor.visit_item(item), . Some(OwnerNode::ForeignItem(item)) => visitor.visit_foreign_item(item), 378 ( 0.00%) Some(OwnerNode::ImplItem(item)) => visitor.visit_impl_item(item), 7 ( 0.00%) Some(OwnerNode::TraitItem(item)) => visitor.visit_trait_item(item), . Some(OwnerNode::Crate(_)) | None => {} . }) . } . 1,548 ( 0.00%) pub fn visit_item_likes_in_module(&self, module: LocalDefId, visitor: &mut V) . where . V: ItemLikeVisitor<'hir>, . { 198 ( 0.00%) let module = self.tcx.hir_module_items(module); . 216 ( 0.00%) for id in module.items.iter() { 30,330 ( 0.00%) visitor.visit_item(self.item(*id)); . } . 216 ( 0.00%) for id in module.trait_items.iter() { 280 ( 0.00%) visitor.visit_trait_item(self.trait_item(*id)); . } . 216 ( 0.00%) for id in module.impl_items.iter() { 14,742 ( 0.00%) visitor.visit_impl_item(self.impl_item(*id)); . } . 216 ( 0.00%) for id in module.foreign_items.iter() { . visitor.visit_foreign_item(self.foreign_item(*id)); . } 1,584 ( 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); . 144 ( 0.00%) while let Some(id) = queue.pop_front() { . f(id); 54 ( 0.00%) let items = self.tcx.hir_module_items(id); 576 ( 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`. 964 ( 0.00%) pub fn parent_iter(self, current_id: HirId) -> ParentHirIterator<'hir> { . ParentHirIterator { current_id, map: self } 3,872 ( 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 } 20,776 ( 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 . /// } . /// ``` 36 ( 0.00%) pub fn get_return_block(&self, id: HirId) -> Option { 4 ( 0.00%) let mut iter = self.parent_iter(id).peekable(); . let mut ignore_tail = false; 16 ( 0.00%) if let Some(node) = self.find(id) { 16 ( 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; . } . } 48 ( 0.00%) while let Some((hir_id, node)) = iter.next() { 196 ( 0.00%) if let (Some((_, next_node)), false) = (iter.peek(), ignore_tail) { 3 ( 0.00%) match next_node { . Node::Block(Block { expr: None, .. }) => return None, . // The current node is not the tail expression of its parent. 3 ( 0.00%) Node::Block(Block { expr: Some(e), .. }) if hir_id != e.hir_id => return None, . _ => {} . } . } 210 ( 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 40 ( 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. 6,152 ( 0.00%) pub fn get_parent_item(&self, hir_id: HirId) -> LocalDefId { 55,403 ( 0.00%) if let Some((def_id, _node)) = self.parent_owner_iter(hir_id).next() { . def_id . } else { . CRATE_DEF_ID . } 12,304 ( 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 { 7,118 ( 0.00%) for (def_id, node) in self.parent_owner_iter(hir_id) { 3,932 ( 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 885 ---------------------------------------- . } . } . bug!( . "expected foreign mod or inlined parent, found {}", . self.node_to_string(HirId::make_owner(parent)) . ) . } . 24,549 ( 0.00%) pub fn expect_item(&self, id: LocalDefId) -> &'hir Item<'hir> { 10,521 ( 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))), . } 28,056 ( 0.00%) } . 5,292 ( 0.00%) pub fn expect_impl_item(&self, id: LocalDefId) -> &'hir ImplItem<'hir> { 2,268 ( 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))), . } 6,048 ( 0.00%) } . 98 ( 0.00%) pub fn expect_trait_item(&self, id: LocalDefId) -> &'hir TraitItem<'hir> { 42 ( 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))), . } 112 ( 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))) . } . } . } . 112 ( 0.00%) pub fn expect_expr(&self, id: HirId) -> &'hir Expr<'hir> { 42 ( 0.00%) match self.find(id) { . Some(Node::Expr(expr)) => expr, . _ => bug!("expected expr, found {}", self.node_to_string(id)), . } 98 ( 0.00%) } . 7,227 ( 0.00%) pub fn opt_name(&self, id: HirId) -> Option { 2,521 ( 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, 2,241 ( 0.00%) Node::GenericParam(param) => param.name.ident().name, 112 ( 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, . }) 4,015 ( 0.00%) } . 6,200 ( 0.00%) pub fn name(&self, id: HirId) -> Symbol { 2,465 ( 0.00%) match self.opt_name(id) { . Some(name) => name, . None => bug!("no name for {}", self.node_to_string(id)), . } 4,650 ( 0.00%) } . . /// Given a node ID, gets a list of attributes associated with the AST . /// corresponding to the node-ID. 1,012,970 ( 0.05%) pub fn attrs(&self, id: HirId) -> &'hir [ast::Attribute] { 144,710 ( 0.01%) self.tcx.hir_attrs(id.owner).get(id.local_id) 1,157,680 ( 0.06%) } . . /// Gets the span of the definition of the specified HIR node. . /// This is used by `tcx.get_span` 11,373 ( 0.00%) pub fn span(&self, hir_id: HirId) -> Span { 33,223 ( 0.00%) self.opt_span(hir_id) . .unwrap_or_else(|| bug!("hir::map::Map::span: id not in map: {:?}", hir_id)) 11,373 ( 0.00%) } . 89,439 ( 0.00%) pub fn opt_span(&self, hir_id: HirId) -> Option { 89,439 ( 0.00%) let span = match self.find(hir_id)? { . Node::Param(param) => param.span, 1,716 ( 0.00%) Node::Item(item) => match &item.kind { . ItemKind::Fn(sig, _, _) => sig.span, 1,324 ( 0.00%) _ => item.span, . }, . Node::ForeignItem(foreign_item) => foreign_item.span, 42 ( 0.00%) Node::TraitItem(trait_item) => match &trait_item.kind { 42 ( 0.00%) TraitItemKind::Fn(sig, _) => sig.span, . _ => trait_item.span, . }, 2,856 ( 0.00%) Node::ImplItem(impl_item) => match &impl_item.kind { 2,768 ( 0.00%) ImplItemKind::Fn(sig, _) => sig.span, 88 ( 0.00%) _ => impl_item.span, . }, 78 ( 0.00%) Node::Variant(variant) => variant.span, 382 ( 0.00%) Node::Field(field) => field.span, 42 ( 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, 512 ( 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) 127,770 ( 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), . } . } . 422 ( 0.00%) pub fn span_if_local(&self, id: DefId) -> Option { 3,155 ( 0.00%) id.as_local().and_then(|id| self.opt_span(self.local_def_id_to_hir_id(id))) 633 ( 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> { 9,995 ( 0.00%) self.body(id) . } . . fn item(&self, id: ItemId) -> &'hir Item<'hir> { 9,915 ( 0.00%) self.item(id) . } . . fn trait_item(&self, id: TraitItemId) -> &'hir TraitItem<'hir> { 112 ( 0.00%) self.trait_item(id) . } . . fn impl_item(&self, id: ImplItemId) -> &'hir ImplItem<'hir> { 6,048 ( 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) 44 ( 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| { 410 ( 0.00%) let stable_crate_id = tcx.resolutions(()).cstore.stable_crate_id(cnum); 82 ( 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), . } . } . 162 ( 0.00%) pub(super) fn hir_module_items(tcx: TyCtxt<'_>, module_id: LocalDefId) -> ModuleItems { 108 ( 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(), . }; . 90 ( 0.00%) let (hir_mod, span, hir_id) = tcx.hir().get_module(module_id); . collector.visit_mod(hir_mod, span, hir_id); . 288 ( 0.00%) let ModuleCollector { submodules, items, trait_items, impl_items, foreign_items, .. } = . collector; 198 ( 0.00%) return ModuleItems { 72 ( 0.00%) submodules: submodules.into_boxed_slice(), 72 ( 0.00%) items: items.into_boxed_slice(), 72 ( 0.00%) trait_items: trait_items.into_boxed_slice(), 72 ( 0.00%) impl_items: impl_items.into_boxed_slice(), 72 ( 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 { 1,497 ( 0.00%) self.tcx.hir() . } . 3,370 ( 0.00%) fn visit_item(&mut self, item: &'hir Item<'hir>) { 2,022 ( 0.00%) self.items.push(item.item_id()); 1,348 ( 0.00%) if let ItemKind::Mod(..) = item.kind { . // If this declares another module, do not recurse inside it. 17 ( 0.00%) self.submodules.push(item.def_id); . } else { 3,942 ( 0.00%) intravisit::walk_item(self, item) . } 68 ( 0.00%) } . . fn visit_trait_item(&mut self, item: &'hir TraitItem<'hir>) { 21 ( 0.00%) self.trait_items.push(item.trait_item_id()); 21 ( 0.00%) intravisit::walk_trait_item(self, item) . } . . fn visit_impl_item(&mut self, item: &'hir ImplItem<'hir>) { 1,134 ( 0.00%) self.impl_items.push(item.impl_item_id()); 1,134 ( 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) . } . } 144 ( 0.00%) } 510,143 ( 0.03%) -------------------------------------------------------------------------------- -- 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)] 2,133,304 ( 0.10%) fn intern_ty(&self, kind: TyKind<'tcx>) -> Ty<'tcx> { . self.type_ 1,333,315 ( 0.07%) .intern(kind, |kind| { 83,934 ( 0.00%) let flags = super::flags::FlagComputation::for_kind(&kind); . . let ty_struct = TyS { 167,868 ( 0.01%) kind, . flags: flags.flags, . outer_exclusive_binder: flags.outer_exclusive_binder, . }; . . Interned(self.arena.alloc(ty_struct)) . }) . .0 2,399,967 ( 0.12%) } . . #[inline(never)] 800,104 ( 0.04%) fn intern_predicate( . &self, . kind: Binder<'tcx, PredicateKind<'tcx>>, . ) -> &'tcx PredicateInner<'tcx> { . self.predicate 700,091 ( 0.03%) .intern(kind, |kind| { 177,054 ( 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 900,117 ( 0.04%) } . } . . 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) { 240,556 ( 0.01%) if hir_id.owner != hir_owner { . invalid_hir_id_for_typeck_results(hir_owner, hir_id); . } . } . . #[cold] . #[inline(never)] . fn invalid_hir_id_for_typeck_results(hir_owner: LocalDefId, hir_id: hir::HirId) { . ty::tls::with(|tcx| { -- line 253 ---------------------------------------- -- line 261 ---------------------------------------- . } . . impl<'a, V> LocalTableInContext<'a, V> { . pub fn contains_key(&self, id: hir::HirId) -> bool { . validate_hir_id_for_typeck_results(self.hir_owner, id); . self.data.contains_key(&id.local_id) . } . 177,505 ( 0.01%) pub fn get(&self, id: hir::HirId) -> Option<&V> { 35,533 ( 0.00%) validate_hir_id_for_typeck_results(self.hir_owner, id); 35,533 ( 0.00%) self.data.get(&id.local_id) 142,412 ( 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; . 2,640 ( 0.00%) fn index(&self, key: hir::HirId) -> &V { . self.get(key).expect("LocalTableInContext: key not found") 1,760 ( 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. 317 ( 0.00%) pub ty: Ty<'tcx>, . /// Span of the binding that was captured. 109 ( 0.00%) pub span: Span, . /// Span of the scope of the captured binding. 496 ( 0.00%) pub scope_span: Option, . /// Span of `.await` or `yield` expression. 495 ( 0.00%) pub yield_span: Span, . /// Expr which the type evaluated from. 693 ( 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> { 9,282 ( 0.00%) pub fn new(hir_owner: LocalDefId) -> TypeckResults<'tcx> { 109,837 ( 0.01%) 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(), . } 9,282 ( 0.00%) } . . /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node. 42,423 ( 0.00%) pub fn qpath_res(&self, qpath: &hir::QPath<'_>, id: hir::HirId) -> Res { 28,282 ( 0.00%) match *qpath { 64,638 ( 0.00%) hir::QPath::Resolved(_, ref path) => path.res, . hir::QPath::TypeRelative(..) | hir::QPath::LangItem(..) => self . .type_dependent_def(id) 20,208 ( 0.00%) .map_or(Res::Err, |(kind, def_id)| Res::Def(kind, def_id)), . } 70,705 ( 0.00%) } . 341 ( 0.00%) pub fn type_dependent_defs( . &self, . ) -> LocalTableInContext<'_, Result<(DefKind, DefId), ErrorReported>> { 1,897 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.type_dependent_defs } 341 ( 0.00%) } . 4,450 ( 0.00%) pub fn type_dependent_def(&self, id: HirId) -> Option<(DefKind, DefId)> { 10,248 ( 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()) 8,900 ( 0.00%) } . 9,720 ( 0.00%) pub fn type_dependent_def_id(&self, id: HirId) -> Option { . self.type_dependent_def(id).map(|(_, def_id)| def_id) 9,720 ( 0.00%) } . 14,874 ( 0.00%) pub fn type_dependent_defs_mut( . &mut self, . ) -> LocalTableInContextMut<'_, Result<(DefKind, DefId), ErrorReported>> { 14,874 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.type_dependent_defs } 14,874 ( 0.00%) } . . pub fn field_indices(&self) -> LocalTableInContext<'_, usize> { 4,195 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.field_indices } 1,029 ( 0.00%) } . . pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> { 5,286 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.field_indices } 2,643 ( 0.00%) } . . pub fn user_provided_types(&self) -> LocalTableInContext<'_, CanonicalUserType<'tcx>> { 7,028 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.user_provided_types } 3,514 ( 0.00%) } . . pub fn user_provided_types_mut( . &mut self, . ) -> LocalTableInContextMut<'_, CanonicalUserType<'tcx>> { 1,012 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.user_provided_types } 506 ( 0.00%) } . . pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> { 30,762 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.node_types } 15,381 ( 0.00%) } . . pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> { 53,294 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.node_types } 26,647 ( 0.00%) } . 240,390 ( 0.01%) pub fn node_type(&self, id: hir::HirId) -> Ty<'tcx> { 40,065 ( 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))) . }) 200,325 ( 0.01%) } . 57,131 ( 0.00%) pub fn node_type_opt(&self, id: hir::HirId) -> Option> { 57,131 ( 0.00%) validate_hir_id_for_typeck_results(self.hir_owner, id); . self.node_types.get(&id.local_id).cloned() 114,262 ( 0.01%) } . . pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, SubstsRef<'tcx>> { 5,994 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.node_substs } 2,997 ( 0.00%) } . 17,536 ( 0.00%) pub fn node_substs(&self, id: hir::HirId) -> SubstsRef<'tcx> { 17,536 ( 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()) 35,072 ( 0.00%) } . 11,667 ( 0.00%) pub fn node_substs_opt(&self, id: hir::HirId) -> Option> { 11,667 ( 0.00%) validate_hir_id_for_typeck_results(self.hir_owner, id); . self.node_substs.get(&id.local_id).cloned() 23,334 ( 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> { 5,964 ( 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> { 47,219 ( 0.00%) self.node_type(expr.hir_id) . } . . pub fn expr_ty_opt(&self, expr: &hir::Expr<'_>) -> Option> { 64,887 ( 0.00%) self.node_type_opt(expr.hir_id) . } . . pub fn adjustments(&self) -> LocalTableInContext<'_, Vec>> { 21,904 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.adjustments } 10,952 ( 0.00%) } . . pub fn adjustments_mut( . &mut self, . ) -> LocalTableInContextMut<'_, Vec>> { 33,104 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.adjustments } 16,552 ( 0.00%) } . 24,199 ( 0.00%) pub fn expr_adjustments(&self, expr: &hir::Expr<'_>) -> &[ty::adjustment::Adjustment<'tcx>] { 48,398 ( 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[..]) 48,398 ( 0.00%) } . . /// Returns the type of `expr`, considering any `Adjustment` . /// entry recorded for that expression. 3,140 ( 0.00%) pub fn expr_ty_adjusted(&self, expr: &hir::Expr<'_>) -> Ty<'tcx> { 628 ( 0.00%) self.expr_adjustments(expr).last().map_or_else(|| self.expr_ty(expr), |adj| adj.target) 860 ( 0.00%) } . 4,490 ( 0.00%) pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr<'_>) -> Option> { 898 ( 0.00%) self.expr_adjustments(expr).last().map(|adj| adj.target).or_else(|| self.expr_ty_opt(expr)) 900 ( 0.00%) } . 1,556 ( 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. 3,112 ( 0.00%) if let hir::ExprKind::Path(_) = expr.kind { . return false; . } . 3,568 ( 0.00%) matches!(self.type_dependent_defs().get(expr.hir_id), Some(Ok((DefKind::AssocFn, _)))) 3,112 ( 0.00%) } . 12,282 ( 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 . }) 16,376 ( 0.00%) } . . pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> { 10,588 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.pat_binding_modes } 3,247 ( 0.00%) } . . pub fn pat_binding_modes_mut(&mut self) -> LocalTableInContextMut<'_, BindingMode> { 5,136 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.pat_binding_modes } 2,568 ( 0.00%) } . . pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec>> { 14,584 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.pat_adjustments } 7,292 ( 0.00%) } . . pub fn pat_adjustments_mut(&mut self) -> LocalTableInContextMut<'_, Vec>> { 4,144 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.pat_adjustments } 2,072 ( 0.00%) } . . /// For a given closure, returns the iterator of `ty::CapturedPlace`s that are captured . /// by the closure. 2,680 ( 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() 3,350 ( 0.00%) } . . pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, HirPlace<'tcx>)> { 822 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.closure_kind_origins } 411 ( 0.00%) } . . pub fn closure_kind_origins_mut( . &mut self, . ) -> LocalTableInContextMut<'_, (Span, HirPlace<'tcx>)> { . LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.closure_kind_origins } . } . . pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> { 2,582 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.liberated_fn_sigs } 1,291 ( 0.00%) } . . pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> { 1,760 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.liberated_fn_sigs } 880 ( 0.00%) } . . pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec>> { 822 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.fru_field_types } 411 ( 0.00%) } . . pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec>> { . LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.fru_field_types } . } . 18 ( 0.00%) pub fn is_coercion_cast(&self, hir_id: hir::HirId) -> bool { 6 ( 0.00%) validate_hir_id_for_typeck_results(self.hir_owner, hir_id); . self.coercion_casts.contains(&hir_id.local_id) 12 ( 0.00%) } . . pub fn set_coercion_cast(&mut self, id: ItemLocalId) { . self.coercion_casts.insert(id); . } . . pub fn coercion_casts(&self) -> &ItemLocalSet { 411 ( 0.00%) &self.coercion_casts 411 ( 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>; . 408 ( 0.00%) #[derive(Clone, Debug, TyEncodable, TyDecodable, HashStable, TypeFoldable, Lift)] . pub struct CanonicalUserTypeAnnotation<'tcx> { . pub user_ty: CanonicalUserType<'tcx>, . pub span: Span, 260 ( 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. 1,097 ( 0.00%) pub fn is_identity(&self) -> bool { 2,194 ( 0.00%) match self.value { . UserType::Ty(_) => false, . UserType::TypeOf(_, user_substs) => { 1,097 ( 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() { 2,528 ( 0.00%) GenericArgKind::Type(ty) => match ty.kind() { . ty::Bound(debruijn, b) => { . // We only allow a `ty::INNERMOST` index in substitutions. 1,245 ( 0.00%) assert_eq!(*debruijn, ty::INNERMOST); . cvar == b.var . } . _ => false, . }, . 58 ( 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, . }, . } . }) . } . } 2,194 ( 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. 1,560 ( 0.00%) #[derive(Copy, Clone, Debug, PartialEq, TyEncodable, TyDecodable)] 12,653 ( 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> { 18,460 ( 0.00%) pub fn typeck_opt_const_arg( . self, . def: ty::WithOptConstParam, . ) -> &'tcx TypeckResults<'tcx> { 7,384 ( 0.00%) if let Some(param_did) = def.const_param_did { . self.typeck_const_arg((def.did, param_did)) . } else { . self.typeck(def.did) . } 14,768 ( 0.00%) } . 1,368 ( 0.00%) pub fn alloc_steal_thir(self, thir: Thir<'tcx>) -> &'tcx Steal> { 456 ( 0.00%) self.arena.alloc(Steal::new(thir)) 1,824 ( 0.00%) } . 6,965 ( 0.00%) pub fn alloc_steal_mir(self, mir: Body<'tcx>) -> &'tcx Steal> { 1,393 ( 0.00%) self.arena.alloc(Steal::new(mir)) 9,751 ( 0.00%) } . 1,824 ( 0.00%) pub fn alloc_steal_promoted( . self, . promoted: IndexVec>, . ) -> &'tcx Steal>> { 456 ( 0.00%) self.arena.alloc(Steal::new(promoted)) 2,280 ( 0.00%) } . 4,392 ( 0.00%) pub fn alloc_adt_def( . self, . did: DefId, . kind: AdtKind, . variants: IndexVec, . repr: ReprOptions, . ) -> &'tcx ty::AdtDef { 7,808 ( 0.00%) self.intern_adt_def(ty::AdtDef::new(self, did, kind, variants, repr)) 1,952 ( 0.00%) } . . /// Allocates a read-only byte or string literal for `mir::interpret`. 40 ( 0.00%) pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId { . // Create an allocation that just contains these bytes. 8 ( 0.00%) let alloc = interpret::Allocation::from_bytes_byte_aligned_immutable(bytes); 104 ( 0.00%) let alloc = self.intern_const_alloc(alloc); . self.create_memory_alloc(alloc) 40 ( 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? 9,104 ( 0.00%) pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound, Bound) { 4,552 ( 0.00%) let attrs = self.get_attrs(def_id); 19,346 ( 0.00%) let get = |name| { 4,552 ( 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); 224 ( 0.00%) if let Some( . &[ . ast::NestedMetaItem::Literal(ast::Lit { 112 ( 0.00%) kind: ast::LitKind::Int(a, _), .. . }), . ], 56 ( 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 . } 22,760 ( 0.00%) }; 6,828 ( 0.00%) ( 6,828 ( 0.00%) get(sym::rustc_layout_scalar_valid_range_start), 3,414 ( 0.00%) get(sym::rustc_layout_scalar_valid_range_end), . ) 9,104 ( 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 }) . } . 1,071 ( 0.00%) pub fn consider_optimizing String>(self, msg: T) -> bool { 153 ( 0.00%) let cname = self.crate_name(LOCAL_CRATE); 1,220 ( 0.00%) self.sess.consider_optimizing(cname.as_str(), msg) 1,224 ( 0.00%) } . . /// Obtain all lang items of this crate and all dependencies (recursively) 835,422 ( 0.04%) pub fn lang_items(self) -> &'tcx rustc_hir::lang_items::LanguageItems { . self.get_lang_items(()) 1,074,114 ( 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. 105 ( 0.00%) pub fn get_diagnostic_item(self, name: Symbol) -> Option { . self.all_diagnostic_items(()).name_to_id.get(&name).copied() 120 ( 0.00%) } . . /// Obtain the diagnostic item's name 20,272 ( 0.00%) pub fn get_diagnostic_name(self, id: DefId) -> Option { . self.diagnostic_items(id.krate).id_to_name.get(&id).copied() 23,168 ( 0.00%) } . . /// Check whether the diagnostic item with the given `name` has the given `DefId`. 29,358 ( 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) 33,552 ( 0.00%) } . 8,134 ( 0.00%) pub fn stability(self) -> &'tcx stability::Index<'tcx> { . self.stability_index(()) 10,458 ( 0.00%) } . 277,557 ( 0.01%) pub fn features(self) -> &'tcx rustc_feature::Features { . self.features_query(()) 317,208 ( 0.02%) } . 12 ( 0.00%) pub fn def_key(self, id: DefId) -> rustc_hir::definitions::DefKey { . // Accessing the DefKey is ok, since it is part of DefPathHash. 33,214 ( 0.00%) if let Some(id) = id.as_local() { . self.untracked_resolutions.definitions.def_key(id) . } else { 9,769 ( 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. 4,361 ( 0.00%) if let Some(def_id) = def_id.as_local() { . self.untracked_resolutions.definitions.def_path_hash(def_id) . } else { 340 ( 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 { 105,690 ( 0.01%) &*self.untracked_resolutions.cstore 52,845 ( 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> { 17 ( 0.00%) let resolutions = &self.gcx.untracked_resolutions; 84 ( 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.) 822 ( 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=...` . 1,233 ( 0.00%) if self.features().nll { . return BorrowckMode::Mir; . } . 411 ( 0.00%) self.sess.opts.borrowck_mode 1,644 ( 0.00%) } . . /// If `true`, we should use lazy normalization for constants, otherwise . /// we still evaluate them eagerly. . #[inline] . pub fn lazy_normalization(self) -> bool { 6 ( 0.00%) let features = self.features(); . // Note: We only use lazy normalization for generic const expressions. 4 ( 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")`). 4,136 ( 0.00%) pub fn article_and_description(self, def_id: DefId) -> (&'static str, &'static str) { 3,008 ( 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"), . }, 6,768 ( 0.00%) def_kind => (def_kind.article(), def_kind.descr(def_id)), . } 3,384 ( 0.00%) } . . pub fn type_length_limit(self) -> Limit { . self.limits(()).type_length_limit . } . 334,173 ( 0.02%) pub fn recursion_limit(self) -> Limit { . self.limits(()).recursion_limit 381,912 ( 0.02%) } . . pub fn move_size_limit(self) -> Limit { . self.limits(()).move_size_limit . } . 497 ( 0.00%) pub fn const_eval_limit(self) -> Limit { . self.limits(()).const_eval_limit 568 ( 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(); 111,992 ( 0.01%) let _reset = rustc_data_structures::OnDrop(move || TLV.with(|tlv| tlv.set(old))); . TLV.with(|tlv| tlv.set(value)); . f() . } . . /// Gets the pointer to the current `ImplicitCtxt`. . #[cfg(not(parallel_compiler))] . #[inline] . fn get_tlv() -> usize { -- line 1761 ---------------------------------------- -- line 1763 ---------------------------------------- . } . . /// Sets `context` as the new current `ImplicitCtxt` for the duration of the function `f`. . #[inline] . pub fn enter_context<'a, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'tcx>, f: F) -> R . where . F: FnOnce(&ImplicitCtxt<'a, 'tcx>) -> R, . { 1 ( 0.00%) set_tlv(context as *const _ as usize, || f(&context)) . } . . /// Allows access to the current `ImplicitCtxt` in a closure if one is available. . #[inline] . pub fn with_context_opt(f: F) -> R . where . F: for<'a, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'tcx>>) -> R, . { . let context = get_tlv(); 462,129 ( 0.02%) 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 { 227,878 ( 0.01%) assert!(ptr_eq(context.tcx.gcx, tcx.gcx)); . let context: &ImplicitCtxt<'_, '_> = mem::transmute(context); 227,444 ( 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> { 231,095 ( 0.01%) &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)`. 172,020 ( 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>> { 74,190 ( 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)`. 57,340 ( 0.00%) self.0.kind.hash(s) . } . } . . impl<'tcx, T> Borrow<[T]> for Interned<'tcx, List> { . fn borrow<'a>(&'a self) -> &'a [T] { 259,344 ( 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)`. 74,564 ( 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 { 74,955 ( 0.00%) &self.0 . } . } . . impl<'tcx> PartialEq for Interned<'tcx, $ty> { . fn eq(&self, other: &Self) -> bool { . // The `Borrow` trait requires that `x.borrow() == y.borrow()` . // equals `x == y`. . self.0 == other.0 -- line 2068 ---------------------------------------- -- line 2070 ---------------------------------------- . } . . impl<'tcx> Eq for Interned<'tcx, $ty> {} . . impl<'tcx> Hash for Interned<'tcx, $ty> { . fn hash(&self, s: &mut H) { . // The `Borrow` trait requires that `x.borrow().hash(s) == . // x.hash(s)`. 35,391 ( 0.00%) self.0.hash(s) . } . } . . impl<'tcx> TyCtxt<'tcx> { 648,581 ( 0.03%) pub fn $method(self, v: $ty) -> &'tcx $ty { 334,648 ( 0.02%) self.interners.$name.intern(v, |v| { 6,984 ( 0.00%) Interned(self.interners.arena.alloc(v)) . }).0 728,604 ( 0.04%) } . })+ . } . } . . 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> { 2,981,598 ( 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 2,660,697 ( 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`. 144 ( 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() . }) 108 ( 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(); 24 ( 0.00%) let mut stack = vec![trait_def_id]; . . set.insert(trait_def_id); . 108 ( 0.00%) iter::from_fn(move || -> Option { 34 ( 0.00%) let trait_did = stack.pop()?; 17 ( 0.00%) let generic_predicates = self.super_predicates_of(trait_did); . . for (predicate, _) in generic_predicates.predicates { 30 ( 0.00%) if let ty::PredicateKind::Trait(data) = predicate.kind().skip_binder() { 20 ( 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> { 92,584 ( 0.00%) if *r == kind { r } else { self.mk_region(kind) } . } . . #[allow(rustc::usage_of_ty_tykind)] . #[inline] . pub fn mk_ty(self, st: TyKind<'tcx>) -> Ty<'tcx> { 1,842,392 ( 0.09%) self.interners.intern_ty(st) . } . . #[inline] . pub fn mk_predicate(self, binder: Binder<'tcx, PredicateKind<'tcx>>) -> Predicate<'tcx> { 1,078,581 ( 0.05%) let inner = self.interners.intern_predicate(binder); . Predicate { inner } . } . . #[inline] 954,136 ( 0.05%) pub fn reuse_or_mk_predicate( . self, . pred: Predicate<'tcx>, . binder: Binder<'tcx, PredicateKind<'tcx>>, . ) -> Predicate<'tcx> { 63,161 ( 0.00%) if pred.kind() != binder { self.mk_predicate(binder) } else { pred } 954,136 ( 0.05%) } . . pub fn mk_mach_int(self, tm: IntTy) -> Ty<'tcx> { 90 ( 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, . } 90 ( 0.00%) } . . pub fn mk_mach_uint(self, tm: UintTy) -> Ty<'tcx> { 302 ( 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, . } 302 ( 0.00%) } . . pub fn mk_mach_float(self, tm: FloatTy) -> Ty<'tcx> { . match tm { . FloatTy::F32 => self.types.f32, . FloatTy::F64 => self.types.f64, . } . } . . #[inline] . pub fn mk_static_str(self) -> Ty<'tcx> { 558 ( 0.00%) self.mk_imm_ref(self.lifetimes.re_static, self.types.str_) . } . . #[inline] . pub fn mk_adt(self, def: &'tcx AdtDef, substs: SubstsRef<'tcx>) -> Ty<'tcx> { . // Take a copy of substs so that we own the vectors inside. . self.mk_ty(Adt(def, substs)) . } . -- line 2259 ---------------------------------------- -- line 2329 ---------------------------------------- . } . . #[inline] . pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> { . self.mk_ptr(TypeAndMut { ty, mutbl: hir::Mutability::Not }) . } . . #[inline] 2,023 ( 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))) 2,120 ( 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> { 44 ( 0.00%) let kinds: Vec<_> = ts.iter().map(|&t| GenericArg::from(t)).collect(); 736 ( 0.00%) self.mk_ty(Tuple(self.intern_substs(&kinds))) . } . . pub fn mk_tup], Ty<'tcx>>>(self, iter: I) -> I::Output { 6,404 ( 0.00%) iter.intern_with(|ts| { 2,750 ( 0.00%) let kinds: Vec<_> = ts.iter().map(|&t| GenericArg::from(t)).collect(); 11,922 ( 0.00%) self.mk_ty(Tuple(self.intern_substs(&kinds))) 5,742 ( 0.00%) }) . } . . #[inline] . pub fn mk_unit(self) -> Ty<'tcx> { 465 ( 0.00%) self.types.unit . } . . #[inline] . pub fn mk_diverging_default(self) -> Ty<'tcx> { . if self.features().never_type_fallback { self.types.never } else { self.types.unit } . } . . #[inline] . pub fn mk_fn_def(self, def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> { . self.mk_ty(FnDef(def_id, substs)) . } . . #[inline] . pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> { 1,334 ( 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> { 438 ( 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 }) . } . 8,386 ( 0.00%) pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> GenericArg<'tcx> { 5,744 ( 0.00%) match param.kind { . GenericParamDefKind::Lifetime => { 738 ( 0.00%) self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into() . } 2,150 ( 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() . } . } 8,386 ( 0.00%) } . . #[inline] . pub fn mk_opaque(self, def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> { . self.mk_ty(Opaque(def_id, substs)) . } . 455 ( 0.00%) pub fn mk_place_field(self, place: Place<'tcx>, f: Field, ty: Ty<'tcx>) -> Place<'tcx> { 455 ( 0.00%) self.mk_place_elem(place, PlaceElem::Field(f, ty)) 910 ( 0.00%) } . . pub fn mk_place_deref(self, place: Place<'tcx>) -> Place<'tcx> { . self.mk_place_elem(place, PlaceElem::Deref) . } . 81 ( 0.00%) pub fn mk_place_downcast( . self, . place: Place<'tcx>, . adt_def: &'tcx AdtDef, . variant_index: VariantIdx, . ) -> Place<'tcx> { 81 ( 0.00%) self.mk_place_elem( . place, 162 ( 0.00%) PlaceElem::Downcast(Some(adt_def.variants[variant_index].name), variant_index), . ) 162 ( 0.00%) } . 518 ( 0.00%) pub fn mk_place_downcast_unnamed( . self, . place: Place<'tcx>, . variant_index: VariantIdx, . ) -> Place<'tcx> { 518 ( 0.00%) self.mk_place_elem(place, PlaceElem::Downcast(None, variant_index)) 1,036 ( 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. 10,620 ( 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) } 11,800 ( 0.00%) } . 22,323 ( 0.00%) pub fn intern_poly_existential_predicates( . self, . eps: &[ty::Binder<'tcx, ExistentialPredicate<'tcx>>], . ) -> &'tcx List>> { 3,272 ( 0.00%) assert!(!eps.is_empty()); . assert!( . eps.array_windows() 29,687 ( 0.00%) .all(|[a, b]| a.skip_binder().stable_cmp(self, &b.skip_binder()) . != Ordering::Greater) . ); 13,088 ( 0.00%) self._intern_poly_existential_predicates(eps) 25,512 ( 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. 8,349 ( 0.00%) if preds.is_empty() { . // The macro-generated method below asserts we don't intern an empty slice. . List::empty() . } else { 2,626 ( 0.00%) self._intern_predicates(preds) . } 11,496 ( 0.00%) } . . pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List> { 33,992 ( 0.00%) if ts.is_empty() { List::empty() } else { self._intern_type_list(ts) } 728 ( 0.00%) } . . pub fn intern_substs(self, ts: &[GenericArg<'tcx>]) -> &'tcx List> { 498,938 ( 0.02%) if ts.is_empty() { List::empty() } else { self._intern_substs(ts) } 57,806 ( 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> { 20,498 ( 0.00%) if ts.is_empty() { List::empty() } else { self._intern_place_elems(ts) } 4,336 ( 0.00%) } . . pub fn intern_canonical_var_infos( . self, . ts: &[CanonicalVarInfo<'tcx>], . ) -> CanonicalVarInfos<'tcx> { 27,210 ( 0.00%) if ts.is_empty() { List::empty() } else { self._intern_canonical_var_infos(ts) } 3,096 ( 0.00%) } . . pub fn intern_bound_variable_kinds( . self, . ts: &[ty::BoundVariableKind], . ) -> &'tcx List { 11,428 ( 0.00%) if ts.is_empty() { List::empty() } else { self._intern_bound_variable_kinds(ts) } 17,594 ( 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 { 3,489 ( 0.00%) inputs_and_output: self.intern_type_list(xs), 656 ( 0.00%) c_variadic, 916 ( 0.00%) unsafety, 792 ( 0.00%) abi, 350 ( 0.00%) }) . } . . pub fn mk_poly_existential_predicates< . I: InternAs< . [ty::Binder<'tcx, ExistentialPredicate<'tcx>>], . &'tcx List>>, . >, . >( . self, . iter: I, . ) -> I::Output { 7,244 ( 0.00%) iter.intern_with(|xs| self.intern_poly_existential_predicates(xs)) . } . . pub fn mk_predicates], &'tcx List>>>( . self, . iter: I, . ) -> I::Output { 56 ( 0.00%) iter.intern_with(|xs| self.intern_predicates(xs)) . } . . pub fn mk_type_list], &'tcx List>>>(self, iter: I) -> I::Output { 4,581 ( 0.00%) iter.intern_with(|xs| self.intern_type_list(xs)) . } . . pub fn mk_substs], &'tcx List>>>( . self, . iter: I, . ) -> I::Output { 442,905 ( 0.02%) iter.intern_with(|xs| self.intern_substs(xs)) . } . . pub fn mk_place_elems], &'tcx List>>>( . self, . iter: I, . ) -> I::Output { 1,368 ( 0.00%) iter.intern_with(|xs| self.intern_place_elems(xs)) . } . 21,129 ( 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())) 42,258 ( 0.00%) } . . pub fn mk_bound_variable_kinds< . I: InternAs<[ty::BoundVariableKind], &'tcx List>, . >( . self, . iter: I, . ) -> I::Output { 61,052 ( 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. 130,508 ( 0.01%) pub fn maybe_lint_level_root_bounded(self, mut id: HirId, bound: HirId) -> HirId { 130,508 ( 0.01%) let hir = self.hir(); . loop { 291,837 ( 0.01%) if id == bound { . return bound; . } . 398,284 ( 0.02%) 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); 235,905 ( 0.01%) if next == id { . bug!("lint traversal reached the root of the crate"); . } . id = next; . } 186,440 ( 0.01%) } . 10,888 ( 0.00%) pub fn lint_level_at_node( . self, . lint: &'static Lint, . mut id: hir::HirId, . ) -> (Level, LintLevelSource) { . let sets = self.lint_levels(()); . loop { 84,772 ( 0.00%) if let Some(pair) = sets.level_and_source(lint, id, self.sess) { . return pair; . } 7,302 ( 0.00%) let next = self.hir().get_parent_node(id); 21,906 ( 0.00%) if next == id { . bug!("lint traversal reached the root of the crate"); . } . id = next; . } 10,888 ( 0.00%) } . 882 ( 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>), . ) { 3,559 ( 0.00%) let (level, src) = self.lint_level_at_node(lint, hir_id); 1,181 ( 0.00%) struct_lint_level(self.sess, lint, level, src, Some(span.into()), decorate); 504 ( 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); . } . 7,756 ( 0.00%) pub fn in_scope_traits(self, id: HirId) -> Option<&'tcx [TraitCandidate]> { 2,216 ( 0.00%) let map = self.in_scope_traits_map(id.owner)?; . let candidates = map.get(&id.local_id)?; 2,216 ( 0.00%) Some(&*candidates) 8,864 ( 0.00%) } . 13,006 ( 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()) 16,722 ( 0.00%) } . 1,089 ( 0.00%) pub fn is_late_bound(self, id: HirId) -> bool { . self.is_late_bound_map(id.owner) 85 ( 0.00%) .map_or(false, |(owner, set)| owner == id.owner && set.contains(&id.local_id)) 968 ( 0.00%) } . 11,368 ( 0.00%) pub fn object_lifetime_defaults(self, id: HirId) -> Option> { . self.object_lifetime_defaults_map(id.owner) 14,616 ( 0.00%) } . 10,116 ( 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(), . ) 10,116 ( 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 990 ( 0.00%) pub fn is_const_fn(self, def_id: DefId) -> bool { 99 ( 0.00%) if self.is_const_fn_raw(def_id) { 20 ( 0.00%) match self.lookup_const_stability(def_id) { 24 ( 0.00%) Some(stability) if stability.level.is_unstable() => { . // has a `rustc_const_unstable` attribute, check whether the user enabled the . // corresponding feature gate. 8 ( 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 . } 891 ( 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; 160,088 ( 0.01%) fn intern_with(self, f: F) -> Self::Output . where . F: FnOnce(&[T]) -> R, . { 1,373,081 ( 0.07%) E::intern_with(self, f) 159,444 ( 0.01%) } . } . . 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; 184,074 ( 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`. 248,666 ( 0.01%) match iter.size_hint() { . (0, Some(0)) => { 15 ( 0.00%) assert!(iter.next().is_none()); . f(&[]) . } . (1, Some(1)) => { . let t0 = iter.next().unwrap(); 36 ( 0.00%) assert!(iter.next().is_none()); 36,407 ( 0.00%) f(&[t0]) . } . (2, Some(2)) => { . let t0 = iter.next().unwrap(); . let t1 = iter.next().unwrap(); 300 ( 0.00%) assert!(iter.next().is_none()); 25,219 ( 0.00%) f(&[t0, t1]) . } 1,444 ( 0.00%) _ => f(&iter.collect::>()), . } 161,272 ( 0.01%) } . } . . impl<'a, T, R> InternIteratorElement for &'a T . where . T: Clone + 'a, . { . type Output = R; 6,165 ( 0.00%) fn intern_with, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output { . // This code isn't hot. 140 ( 0.00%) f(&iter.cloned().collect::>()) 5,062 ( 0.00%) } . } . . impl InternIteratorElement for Result { . type Output = Result; 481,941 ( 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. 351,636 ( 0.02%) Ok(match iter.size_hint() { . (0, Some(0)) => { . assert!(iter.next().is_none()); . f(&[]) . } . (1, Some(1)) => { 2,142 ( 0.00%) let t0 = iter.next().unwrap()?; 18 ( 0.00%) assert!(iter.next().is_none()); 24,509 ( 0.00%) f(&[t0]) . } . (2, Some(2)) => { 294 ( 0.00%) let t0 = iter.next().unwrap()?; 294 ( 0.00%) let t1 = iter.next().unwrap()?; 441 ( 0.00%) assert!(iter.next().is_none()); 27,170 ( 0.00%) f(&[t0, t1]) . } 11,933 ( 0.00%) _ => f(&iter.collect::, _>>()?), . }) 537,557 ( 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 { 227,878 ( 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()) . }; . 11 ( 0.00%) providers.lookup_stability = |tcx, id| tcx.stability().local_stability(id.expect_local()); 2 ( 0.00%) providers.lookup_const_stability = 9 ( 0.00%) |tcx, id| tcx.stability().local_const_stability(id.expect_local()); 2 ( 0.00%) providers.lookup_deprecation_entry = 9,272 ( 0.00%) |tcx, id| tcx.stability().local_deprecation_entry(id.expect_local()); 2 ( 0.00%) providers.extern_mod_stmt_cnum = . |tcx, id| tcx.resolutions(()).extern_crate_map.get(&id).cloned(); 3 ( 0.00%) providers.output_filenames = |tcx, ()| tcx.output_filenames.clone(); 3 ( 0.00%) providers.features_query = |tcx, ()| tcx.sess.features_untracked(); 2 ( 0.00%) providers.is_panic_runtime = |tcx, cnum| { . assert_eq!(cnum, LOCAL_CRATE); . tcx.sess.contains_name(tcx.hir().krate_attrs(), sym::panic_runtime) . }; 2 ( 0.00%) providers.is_compiler_builtins = |tcx, cnum| { . assert_eq!(cnum, LOCAL_CRATE); . tcx.sess.contains_name(tcx.hir().krate_attrs(), sym::compiler_builtins) . }; 2 ( 0.00%) providers.has_panic_handler = |tcx, cnum| { 1 ( 0.00%) assert_eq!(cnum, LOCAL_CRATE); . // We want to check if the panic handler was defined in this crate 3 ( 0.00%) tcx.lang_items().panic_impl().map_or(false, |did| did.is_local()) . }; . } 1,230,038 ( 0.06%) -------------------------------------------------------------------------------- -- 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 { 574,159 ( 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> { 5,744 ( 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> { 1,864 ( 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])> { 78 ( 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])> { 29,502 ( 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> { 309,460 ( 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> { 603,006 ( 0.03%) 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 { 727,911 ( 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 { 19 ( 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) { 19,686 ( 0.00%) let _ = &self[a]; 38,222 ( 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 { 2,989 ( 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]) { 90 ( 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]) { 51,348 ( 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. 5,924 ( 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, . { 722 ( 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(); 178,223 ( 0.01%) 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()); 47,538 ( 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; 2,128,281 ( 0.10%) while left < right { 2,843,482 ( 0.14%) 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. 656,765 ( 0.03%) let cmp = f(unsafe { self.get_unchecked(mid) }); . . // The reason why we use if/else control flow rather than match . // is because match reorders comparison operations, which is perf sensitive. . // This is x86 asm for u8: https://rust.godbolt.org/z/8Y8Pra. 823,981 ( 0.04%) if cmp == Less { 1,400,817 ( 0.07%) left = mid + 1; 381,210 ( 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); . } . 2,389,260 ( 0.12%) 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, . ); . } . 142,014 ( 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 3380 ---------------------------------------- . } . a << k . } . 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! 6 ( 0.00%) let us_len = self.len() / ts * us; . // And how many `T`s will be in the trailing slice! 5,542 ( 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::()) }; 5,542 ( 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), 5,548 ( 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")] 17 ( 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) 34 ( 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 ---------------------------------------- 1,845,458 ( 0.09%) -------------------------------------------------------------------------------- -- 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}; . 32,908 ( 0.00%) #[derive(Clone, Copy, PartialEq, Encodable, Decodable, Debug, HashStable_Generic)] . pub enum CommentKind { . Line, . Block, . } . 1,301 ( 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. 45,578 ( 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, . } . 3,308 ( 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. 19,237 ( 0.00%) #[derive(Clone, Copy, PartialEq, Encodable, Decodable, Debug, HashStable_Generic)] . pub struct Lit { . pub kind: LitKind, . pub symbol: Symbol, . pub suffix: Option, . } . . impl fmt::Display for Lit { 10 ( 0.00%) fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { 18 ( 0.00%) let Lit { kind, symbol, suffix } = *self; . match kind { . Byte => write!(f, "b'{}'", symbol)?, . Char => write!(f, "'{}'", symbol)?, . Str => write!(f, "\"{}\"", symbol)?, . StrRaw(n) => write!( . f, . "r{delim}\"{string}\"{delim}", . delim = "#".repeat(n as usize), -- line 87 ---------------------------------------- -- line 89 ---------------------------------------- . )?, . ByteStr => write!(f, "b\"{}\"", symbol)?, . ByteStrRaw(n) => write!( . f, . "br{delim}\"{string}\"{delim}", . delim = "#".repeat(n as usize), . string = symbol . )?, 6 ( 0.00%) Integer | Float | Bool | Err => write!(f, "{}", symbol)?, . } . 4 ( 0.00%) if let Some(suffix) = suffix { . write!(f, "{}", suffix)?; . } . . Ok(()) 10 ( 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 { 4 ( 0.00%) matches!(self, Integer | Float | Err) . } . } . . impl Lit { . pub fn new(kind: LitKind, symbol: Symbol, suffix: Option) -> Lit { . Lit { kind, symbol, suffix } 2,548 ( 0.00%) } . } . 528 ( 0.00%) pub fn ident_can_begin_expr(name: Symbol, span: Span, is_raw: bool) -> bool { 924 ( 0.00%) let ident_token = Token::new(Ident(name, is_raw), span); . 400 ( 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) 660 ( 0.00%) } . . fn ident_can_begin_type(name: Symbol, span: Span, is_raw: bool) -> bool { 4,296 ( 0.00%) let ident_token = Token::new(Ident(name, is_raw), span); . 1,570 ( 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) . } . 6,427,972 ( 0.32%) #[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, 49,536 ( 0.00%) BinOp(BinOpToken), 18 ( 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., `{`). 89,160 ( 0.00%) OpenDelim(DelimToken), . /// A closing delimiter (e.g., `}`). 28,440 ( 0.00%) CloseDelim(DelimToken), . . /* Literals */ 14,339 ( 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. 51,230 ( 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. 1,665 ( 0.00%) Lifetime(Symbol), . 5,593 ( 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. 4,545 ( 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); . 620,926 ( 0.03%) #[derive(Clone, PartialEq, Encodable, Decodable, Debug, HashStable_Generic)] . pub struct Token { 33,204 ( 0.00%) pub kind: TokenKind, 917 ( 0.00%) pub span: Span, . } . . impl TokenKind { . pub fn lit(kind: LitKind, symbol: Symbol, suffix: Option) -> TokenKind { . Literal(Lit::new(kind, symbol, suffix)) 20 ( 0.00%) } . . // 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`. 6,394 ( 0.00%) pub fn break_two_token_op(&self) -> Option<(TokenKind, TokenKind)> { 26,892 ( 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), 6,247 ( 0.00%) _ => return None, . }) 6,394 ( 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 { 3,506 ( 0.00%) matches!(self, Gt | Ge | BinOp(Shr) | BinOpEq(Shr)) 677 ( 0.00%) } . } . . impl Token { 56,991 ( 0.00%) pub fn new(kind: TokenKind, span: Span) -> Self { 190,904 ( 0.01%) Token { kind, span } 56,991 ( 0.00%) } . . /// Some token that will be thrown away later. 5,513 ( 0.00%) pub fn dummy() -> Self { . Token::new(TokenKind::Question, DUMMY_SP) 5,513 ( 0.00%) } . . /// Recovers a `Token` from an `Ident`. This creates a raw identifier if necessary. . pub fn from_ast_ident(ident: Ident) -> Self { 1,248 ( 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. 35,525 ( 0.00%) pub fn take(&mut self) -> Self { . mem::replace(self, Token::dummy()) 35,525 ( 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 { 4,076 ( 0.00%) match &self.kind { 86 ( 0.00%) Interpolated(nt) => nt.span(), 1,995 ( 0.00%) _ => self.span, . } 1,995 ( 0.00%) } . . pub fn is_op(&self) -> bool { 106,575 ( 0.01%) !matches!( 35,525 ( 0.00%) self.kind, . OpenDelim(..) . | CloseDelim(..) . | Literal(..) . | DocComment(..) . | Ident(..) . | Lifetime(..) . | Interpolated(..) . | Eof . ) 35,525 ( 0.00%) } . . pub fn is_like_plus(&self) -> bool { 21,452 ( 0.00%) matches!(self.kind, BinOp(Plus) | BinOpEq(Plus)) 4,192 ( 0.00%) } . . /// Returns `true` if the token can appear at the start of an expression. 167 ( 0.00%) pub fn can_begin_expr(&self) -> bool { 835 ( 0.00%) match self.uninterpolate().kind { 1,188 ( 0.00%) Ident(name, is_raw) => 396 ( 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 152 ( 0.00%) Interpolated(ref nt) => matches!(**nt, NtLiteral(..) | . NtExpr(..) | . NtBlock(..) | . NtPath(..)), . _ => false, . } 334 ( 0.00%) } . . /// Returns `true` if the token can appear at the start of a type. 4,512 ( 0.00%) pub fn can_begin_type(&self) -> bool { 6,810 ( 0.00%) match self.uninterpolate().kind { 6,444 ( 0.00%) Ident(name, is_raw) => 716 ( 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 1,034 ( 0.00%) Interpolated(ref nt) => matches!(**nt, NtTy(..) | NtPath(..)), . _ => false, . } 6,768 ( 0.00%) } . . /// Returns `true` if the token can appear at the start of a const param. . pub fn can_begin_const_arg(&self) -> bool { 3,975 ( 0.00%) match self.kind { . OpenDelim(Brace) => true, 320 ( 0.00%) Interpolated(ref nt) => matches!(**nt, NtExpr(..) | NtBlock(..) | NtLiteral(..)), 755 ( 0.00%) _ => self.can_begin_literal_maybe_minus(), . } 40 ( 0.00%) } . . /// 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) . || self == &Question . || self == &OpenDelim(Paren) -- line 421 ---------------------------------------- -- 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. 761 ( 0.00%) pub fn can_begin_literal_maybe_minus(&self) -> bool { 7,158 ( 0.00%) match self.uninterpolate().kind { . Literal(..) | BinOp(Minus) => true, 2,388 ( 0.00%) Ident(name, false) if name.is_bool_lit() => true, . 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, . } 1,522 ( 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. 8,950 ( 0.00%) pub fn uninterpolate(&self) -> Cow<'_, Token> { 601,497 ( 0.03%) match &self.kind { 32,434 ( 0.00%) Interpolated(nt) => match **nt { 9,416 ( 0.00%) NtIdent(ident, is_raw) => { 23,587 ( 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), . } 8,950 ( 0.00%) } . . /// Returns an identifier if this token is an identifier. 72,635 ( 0.00%) pub fn ident(&self) -> Option<(Ident, /* is_raw */ bool)> { . let token = self.uninterpolate(); 407,423 ( 0.02%) match token.kind { 1,792,408 ( 0.09%) Ident(name, is_raw) => Some((Ident::new(name, token.span), is_raw)), . _ => None, . } 533,560 ( 0.03%) } . . /// Returns a lifetime identifier if this token is a lifetime. 18,399 ( 0.00%) pub fn lifetime(&self) -> Option { . let token = self.uninterpolate(); 41,370 ( 0.00%) match token.kind { 2,808 ( 0.00%) Lifetime(name) => Some(Ident::new(name, token.span)), . _ => None, . } 128,793 ( 0.01%) } . . /// Returns `true` if the token is an identifier. . pub fn is_ident(&self) -> bool { . self.ident().is_some() 4,746 ( 0.00%) } . . /// Returns `true` if the token is a lifetime. 2,286 ( 0.00%) pub fn is_lifetime(&self) -> bool { . self.lifetime().is_some() 4,572 ( 0.00%) } . . /// Returns `true` if the token is an identifier whose name is the given . /// string slice. 3,679 ( 0.00%) pub fn is_ident_named(&self, name: Symbol) -> bool { . self.ident().map_or(false, |(ident, _)| ident.name == name) 7,358 ( 0.00%) } . . /// Returns `true` if the token is an interpolated path. . fn is_path(&self) -> bool { 32,944 ( 0.00%) if let Interpolated(ref nt) = self.kind { 316 ( 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 { 8 ( 0.00%) if let Interpolated(ref nt) = self.kind { . if let NtExpr(_) | NtLiteral(_) | NtPath(_) | NtIdent(..) | NtBlock(_) = **nt { . return true; . } . } . . false 4 ( 0.00%) } . . // Is the token an interpolated block (`$b:block`)? . pub fn is_whole_block(&self) -> bool { 368 ( 0.00%) if let Interpolated(ref nt) = self.kind { . if let NtBlock(..) = **nt { . return true; . } . } . false 184 ( 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) . } . 1,926 ( 0.00%) pub fn is_qpath_start(&self) -> bool { 18,402 ( 0.00%) self == &Lt || self == &BinOp(Shl) . } . 32,956 ( 0.00%) pub fn is_path_start(&self) -> bool { 49,032 ( 0.00%) self == &ModSep . || self.is_qpath_start() . || self.is_path() . || self.is_path_segment_keyword() 6,901 ( 0.00%) || self.is_ident() && !self.is_reserved_ident() 41,195 ( 0.00%) } . . /// Returns `true` if the token is a given keyword, `kw`. 98,560 ( 0.00%) pub fn is_keyword(&self, kw: Symbol) -> bool { . self.is_non_raw_ident_where(|id| id.name == kw) 197,120 ( 0.01%) } . 1,468 ( 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. 790 ( 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. 791 ( 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. 790 ( 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`. 1,528 ( 0.00%) pub fn is_bool_lit(&self) -> bool { 3,056 ( 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. 80 ( 0.00%) pub fn is_non_raw_ident_where(&self, pred: impl FnOnce(Ident) -> bool) -> bool { 701,829 ( 0.03%) match self.ident() { 6,800 ( 0.00%) Some((id, false)) => pred(id), . _ => false, . } 100 ( 0.00%) } . 106,120 ( 0.01%) pub fn glue(&self, joint: &Token) -> Option { 53,060 ( 0.00%) let kind = match self.kind { 1,563 ( 0.00%) Eq => match joint.kind { . Eq => EqEq, . Gt => FatArrow, . _ => return None, . }, 289 ( 0.00%) Lt => match joint.kind { . Eq => Le, . Lt => BinOp(Shl), . Le => BinOpEq(Shl), . BinOp(Minus) => LArrow, . _ => return None, . }, 2,039 ( 0.00%) Gt => match joint.kind { . Eq => Ge, . Gt => BinOp(Shr), . Ge => BinOpEq(Shr), . _ => return None, . }, 14 ( 0.00%) Not => match joint.kind { . Eq => Ne, . _ => return None, . }, 3,332 ( 0.00%) BinOp(op) => match joint.kind { . Eq => BinOpEq(op), 27 ( 0.00%) BinOp(And) if op == And => AndAnd, 17 ( 0.00%) BinOp(Or) if op == Or => OrOr, 391 ( 0.00%) Gt if op == Minus => RArrow, . _ => return None, . }, 194 ( 0.00%) Dot => match joint.kind { . Dot => DotDot, . DotDot => DotDotDot, . _ => return None, . }, . DotDot => match joint.kind { . Dot => DotDotDot, . Eq => DotDotEq, . _ => return None, . }, 3,826 ( 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, . }; . 37,219 ( 0.00%) Some(Token::new(kind, self.span.to(joint.span))) 95,508 ( 0.00%) } . } . . impl PartialEq for Token { . fn eq(&self, rhs: &TokenKind) -> bool { 316,942 ( 0.02%) self.kind == *rhs . } . } . 28 ( 0.00%) #[derive(Clone, Encodable, Decodable)] . /// For interpolation during macro expansion. . pub enum Nonterminal { . NtItem(P), . NtBlock(P), . NtStmt(ast::Stmt), . NtPat(P), 8 ( 0.00%) NtExpr(P), . NtTy(P), . NtIdent(Ident, /* is_raw */ bool), . NtLifetime(Ident), . NtLiteral(P), . /// Stuff inside brackets for attributes . NtMeta(P), . NtPath(ast::Path), . NtVis(ast::Visibility), -- line 686 ---------------------------------------- -- 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. 1,640 ( 0.00%) pub fn from_symbol( . symbol: Symbol, . edition: impl FnOnce() -> Edition, . ) -> Option { 3,928 ( 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, . }) 1,640 ( 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 { 43 ( 0.00%) pub fn span(&self) -> Span { 215 ( 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, 43 ( 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(), . } 86 ( 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 ---------------------------------------- 2,326,625 ( 0.11%) -------------------------------------------------------------------------------- -- 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. 411 ( 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. 411 ( 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 }, . } 822 ( 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> { 81,270 ( 0.00%) fn new() -> InferCtxtInner<'tcx> { 552,636 ( 0.03%) 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(), 48,762 ( 0.00%) region_constraint_storage: Some(RegionConstraintStorage::new()), . region_obligations: vec![], . opaque_types: Default::default(), . opaque_types_vars: Default::default(), . } 97,524 ( 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> { 7,057 ( 0.00%) self.projection_cache.with_log(&mut self.undo_log) . } . . #[inline] . fn type_variables(&mut self) -> type_variable::TypeVariableTable<'_, 'tcx> { 350,250 ( 0.02%) 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>, . >, . > { 1,679 ( 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, -- line 258 ---------------------------------------- -- line 268 ---------------------------------------- . &mut self, . ) -> ut::UnificationTable< . ut::InPlace< . ty::ConstVid<'tcx>, . &mut ut::UnificationStorage>, . &mut InferCtxtUndoLogs<'tcx>, . >, . > { 1,782 ( 0.00%) self.const_unification_storage.with_log(&mut self.undo_log) . } . . #[inline] . pub fn unwrap_region_constraints(&mut self) -> RegionConstraintCollector<'_, 'tcx> { 76,005 ( 0.00%) self.region_constraint_storage . .as_mut() . .expect("region constraints already solved") 92,577 ( 0.00%) .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. 116,688 ( 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 110,222 ( 0.01%) #[derive(Clone, Debug)] . pub enum SubregionOrigin<'tcx> { . /// Arose from a subtyping relation 6,104 ( 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. 1,122 ( 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 916 ( 0.00%) DataBorrowed(Ty<'tcx>, Span), . . /// (&'a &'b T) where a >= b 973 ( 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> { 16,254 ( 0.00%) fn infer_ctxt(self) -> InferCtxtBuilder<'tcx> { 48,762 ( 0.00%) InferCtxtBuilder { tcx: self, defining_use_anchor: None, fresh_typeck_results: None } 16,254 ( 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. 10,224 ( 0.00%) pub fn with_fresh_in_progress_typeck_results(mut self, table_owner: LocalDefId) -> Self { 12,496 ( 0.00%) self.fresh_typeck_results = Some(RefCell::new(ty::TypeckResults::new(table_owner))); 5,680 ( 0.00%) self.with_opaque_type_inference(table_owner) 7,952 ( 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. 934 ( 0.00%) pub fn with_opaque_type_inference(mut self, defining_use_anchor: LocalDefId) -> Self { 467 ( 0.00%) self.defining_use_anchor = Some(defining_use_anchor); 3,206 ( 0.00%) self 1,401 ( 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`). 43,772 ( 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| { 54,236 ( 0.00%) let (value, subst) = 3,287 ( 0.00%) infcx.instantiate_canonical_with_fresh_inference_vars(span, canonical); 81,520 ( 0.00%) f(infcx, value, subst) . }) 47,274 ( 0.00%) } . 67,168 ( 0.00%) pub fn enter(&mut self, f: impl for<'a> FnOnce(InferCtxt<'a, 'tcx>) -> R) -> R { 46,002 ( 0.00%) let InferCtxtBuilder { tcx, defining_use_anchor, ref fresh_typeck_results } = *self; . let in_progress_typeck_results = fresh_typeck_results.as_ref(); 675,762 ( 0.03%) f(InferCtxt { . tcx, . defining_use_anchor, . in_progress_typeck_results, 16,254 ( 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), 16,254 ( 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), . }) 72,222 ( 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 { 758 ( 0.00%) let InferOk { value, obligations } = self; 3,112 ( 0.00%) for obligation in obligations { 104 ( 0.00%) fulfill_cx.register_predicate_obligation(infcx, obligation); . } . value . } . } . . impl<'tcx> InferOk<'tcx, ()> { 12,041 ( 0.00%) pub fn into_obligations(self) -> PredicateObligations<'tcx> { 48,164 ( 0.00%) self.obligations 12,041 ( 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() 21,388 ( 0.00%) } . 169,248 ( 0.01%) pub fn freshen>(&self, t: T) -> T { 190,404 ( 0.01%) t.fold_with(&mut self.freshener()) 190,404 ( 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`. 276 ( 0.00%) pub fn type_var_origin(&'a self, ty: Ty<'tcx>) -> Option { 552 ( 0.00%) match *ty.kind() { 138 ( 0.00%) ty::Infer(ty::TyVar(vid)) => { 552 ( 0.00%) Some(*self.inner.borrow_mut().type_variables().var_origin(vid)) . } . _ => None, . } 552 ( 0.00%) } . 21,156 ( 0.00%) pub fn freshener<'b>(&'b self) -> TypeFreshener<'b, 'tcx> { . freshen::TypeFreshener::new(self, false) 21,156 ( 0.00%) } . . /// Like `freshener`, but does not replace `'static` regions. 74,737 ( 0.00%) pub fn freshener_keep_static<'b>(&'b self) -> TypeFreshener<'b, 'tcx> { . freshen::TypeFreshener::new(self, true) 74,737 ( 0.00%) } . 1,972 ( 0.00%) pub fn unsolved_variables(&self) -> Vec> { 986 ( 0.00%) let mut inner = self.inner.borrow_mut(); 986 ( 0.00%) let mut vars: Vec> = inner . .type_variables() . .unsolved_variables() . .into_iter() 276 ( 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 }) 54 ( 0.00%) .filter(|&vid| inner.int_unification_table().probe_value(vid).is_none()) . .map(|v| self.tcx.mk_int_var(v)), . ); . vars.extend( . (0..inner.float_unification_table().len()) . .map(|i| ty::FloatVid { index: i as u32 }) . .filter(|&vid| inner.float_unification_table().probe_value(vid).is_none()) . .map(|v| self.tcx.mk_float_var(v)), . ); . vars 3,451 ( 0.00%) } . 38,245 ( 0.00%) fn combine_fields( . &'a self, . trace: TypeTrace<'tcx>, . param_env: ty::ParamEnv<'tcx>, . ) -> CombineFields<'a, 'tcx> { 153,336 ( 0.01%) CombineFields { . infcx: self, 383,340 ( 0.02%) trace, . cause: None, . param_env, . obligations: PredicateObligations::new(), . } 38,245 ( 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. 248 ( 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); 8,169 ( 0.00%) let result = func(self); . self.in_snapshot.set(flag); . result 279 ( 0.00%) } . 222,930 ( 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(); . 668,790 ( 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. 111,465 ( 0.01%) _in_progress_typeck_results: self . .in_progress_typeck_results . .map(|typeck_results| typeck_results.borrow()), . } 445,860 ( 0.02%) } . 437,250 ( 0.02%) #[instrument(skip(self, snapshot), level = "debug")] . fn rollback_to(&self, cause: &str, snapshot: CombinedSnapshot<'a, 'tcx>) { . let CombinedSnapshot { 39,750 ( 0.00%) undo_snapshot, 39,750 ( 0.00%) region_constraints_snapshot, 39,750 ( 0.00%) universe, 39,750 ( 0.00%) was_in_snapshot, 79,500 ( 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(); 39,750 ( 0.00%) inner.rollback_to(undo_snapshot); . inner.unwrap_region_constraints().rollback_to(region_constraints_snapshot); . } . 1,075,725 ( 0.05%) #[instrument(skip(self, snapshot), level = "debug")] . fn commit_from(&self, snapshot: CombinedSnapshot<'a, 'tcx>) { . let CombinedSnapshot { 71,715 ( 0.00%) undo_snapshot, . region_constraints_snapshot: _, . universe: _, 71,715 ( 0.00%) was_in_snapshot, 143,430 ( 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. 102,460 ( 0.01%) #[instrument(skip(self, f), level = "debug")] 129,899 ( 0.01%) pub fn commit_unconditionally(&self, f: F) -> R . where . F: FnOnce(&CombinedSnapshot<'a, 'tcx>) -> R, . { 11,809 ( 0.00%) let snapshot = self.start_snapshot(); 57,523 ( 0.00%) let r = f(&snapshot); 82,663 ( 0.00%) self.commit_from(snapshot); 65,277 ( 0.00%) r . } . . /// Execute `f` and commit the bindings if closure `f` returns `Ok(_)`. 436,349 ( 0.02%) #[instrument(skip(self, f), level = "debug")] 537,004 ( 0.03%) pub fn commit_if_ok(&self, f: F) -> Result . where . F: FnOnce(&CombinedSnapshot<'a, 'tcx>) -> Result, . { 77,189 ( 0.00%) let snapshot = self.start_snapshot(); 247,993 ( 0.01%) let r = f(&snapshot); . debug!("commit_if_ok() -- r.is_ok() = {}", r.is_ok()); 72,067 ( 0.00%) match r { . Ok(_) => { 432,501 ( 0.02%) self.commit_from(snapshot); . } . Err(_) => { 107,166 ( 0.01%) self.rollback_to("commit_if_ok -- error", snapshot); . } . } 417,573 ( 0.02%) r . } . . /// Execute `f` then unroll any bindings it creates. 207,068 ( 0.01%) #[instrument(skip(self, f), level = "debug")] 241,441 ( 0.01%) pub fn probe(&self, f: F) -> R . where . F: FnOnce(&CombinedSnapshot<'a, 'tcx>) -> R, . { 56,461 ( 0.00%) let snapshot = self.start_snapshot(); 89,460 ( 0.00%) let r = f(&snapshot); 262,258 ( 0.01%) self.rollback_to("probe", snapshot); 30,488 ( 0.00%) r . } . . /// If `should_skip` is true, then execute `f` then unroll any bindings it creates. 180 ( 0.00%) #[instrument(skip(self, f), level = "debug")] 240 ( 0.00%) pub fn probe_maybe_skip_leak_check(&self, should_skip: bool, f: F) -> R . where . F: FnOnce(&CombinedSnapshot<'a, 'tcx>) -> R, . { 40 ( 0.00%) let snapshot = self.start_snapshot(); 20 ( 0.00%) let was_skip_leak_check = self.skip_leak_check.get(); 40 ( 0.00%) if should_skip { . self.skip_leak_check.set(true); . } 80 ( 0.00%) let r = f(&snapshot); 180 ( 0.00%) self.rollback_to("probe", snapshot); . self.skip_leak_check.set(was_skip_leak_check); 240 ( 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 20,228 ( 0.00%) pub fn region_constraints_added_in_snapshot( . &self, . snapshot: &CombinedSnapshot<'a, 'tcx>, . ) -> Option { 40,456 ( 0.00%) self.inner . .borrow_mut() . .unwrap_region_constraints() . .region_constraints_added_in_snapshot(&snapshot.undo_snapshot) 30,342 ( 0.00%) } . . pub fn add_given(&self, sub: ty::Region<'tcx>, sup: ty::RegionVid) { . self.inner.borrow_mut().unwrap_region_constraints().add_given(sub, sup); . } . 420 ( 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. . }) . }) 315 ( 0.00%) } . 6,264 ( 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. . }) . }) 4,698 ( 0.00%) } . 40,980 ( 0.00%) #[instrument(skip(self), level = "debug")] . pub fn sub_regions( . &self, . origin: SubregionOrigin<'tcx>, . a: ty::Region<'tcx>, . b: ty::Region<'tcx>, . ) { 36,882 ( 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`. 30 ( 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>>, . ) { 30 ( 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.) 21 ( 0.00%) pub fn coerce_predicate( . &self, . cause: &ObligationCause<'tcx>, . param_env: ty::ParamEnv<'tcx>, . predicate: ty::PolyCoercePredicate<'tcx>, . ) -> Option> { 14 ( 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, . }); 35 ( 0.00%) self.subtype_predicate(cause, param_env, subtype_predicate) 28 ( 0.00%) } . 4,428 ( 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. 369 ( 0.00%) let r_a = self.shallow_resolve(predicate.skip_binder().a); 369 ( 0.00%) let r_b = self.shallow_resolve(predicate.skip_binder().b); 2,630 ( 0.00%) match (r_a.kind(), r_b.kind()) { 600 ( 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); 600 ( 0.00%) return None; . } . _ => {} . } . . Some(self.commit_if_ok(|_snapshot| { 69 ( 0.00%) let ty::SubtypePredicate { a_is_expected, a, b } = . self.replace_bound_vars_with_placeholders(predicate); . 138 ( 0.00%) let ok = self.at(cause, param_env).sub_exp(a_is_expected, a, b)?; . . Ok(ok.unit()) . })) 3,321 ( 0.00%) } . 11,472 ( 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) . }); 9,560 ( 0.00%) self.sub_regions(origin, r_b, r_a); // `b : a` ==> `a <= b` . Ok(()) . }) 7,648 ( 0.00%) } . . /// Number of type variables created so far. 82 ( 0.00%) pub fn num_ty_vars(&self) -> usize { . self.inner.borrow_mut().type_variables().num_vars() 164 ( 0.00%) } . 13,454 ( 0.00%) pub fn next_ty_var_id(&self, origin: TypeVariableOrigin) -> TyVid { 67,270 ( 0.00%) self.inner.borrow_mut().type_variables().new_var(self.universe(), origin) 20,181 ( 0.00%) } . 12,460 ( 0.00%) pub fn next_ty_var(&self, origin: TypeVariableOrigin) -> Ty<'tcx> { 46,592 ( 0.00%) self.tcx.mk_ty_var(self.next_ty_var_id(origin)) 18,690 ( 0.00%) } . 1,450 ( 0.00%) pub fn next_ty_var_in_universe( . &self, . origin: TypeVariableOrigin, . universe: ty::UniverseIndex, . ) -> Ty<'tcx> { 7,975 ( 0.00%) let vid = self.inner.borrow_mut().type_variables().new_var(universe, origin); 725 ( 0.00%) self.tcx.mk_ty_var(vid) 2,175 ( 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 { 100 ( 0.00%) self.inner.borrow_mut().int_unification_table().new_key(None) . } . 60 ( 0.00%) pub fn next_int_var(&self) -> Ty<'tcx> { . self.tcx.mk_int_var(self.next_int_var_id()) 80 ( 0.00%) } . . fn next_float_var_id(&self) -> FloatVid { . self.inner.borrow_mut().float_unification_table().new_key(None) . } . . pub fn next_float_var(&self) -> Ty<'tcx> { . self.tcx.mk_float_var(self.next_float_var_id()) . } . . /// 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. 6,251 ( 0.00%) pub fn next_region_var(&self, origin: RegionVariableOrigin) -> ty::Region<'tcx> { 151,638 ( 0.01%) self.next_region_var_in_universe(origin, self.universe()) 12,502 ( 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. 62,972 ( 0.00%) pub fn next_region_var_in_universe( . &self, . origin: RegionVariableOrigin, . universe: ty::UniverseIndex, . ) -> ty::Region<'tcx> { . let region_var = 409,318 ( 0.02%) self.inner.borrow_mut().unwrap_region_constraints().new_region_var(universe, origin); 157,430 ( 0.01%) self.tcx.mk_region(ty::ReVar(region_var)) 94,458 ( 0.00%) } . . /// 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. 9,014 ( 0.00%) pub fn universe_of_region(&self, r: ty::Region<'tcx>) -> ty::UniverseIndex { . self.inner.borrow_mut().unwrap_region_constraints().universe(r) 13,521 ( 0.00%) } . . /// Number of region variables created so far. 3,738 ( 0.00%) pub fn num_region_vars(&self) -> usize { . self.inner.borrow_mut().unwrap_region_constraints().num_region_vars() 5,607 ( 0.00%) } . . /// Just a convenient wrapper of `next_region_var` for using during NLL. 12,729 ( 0.00%) pub fn next_nll_region_var(&self, origin: NllRegionVariableOrigin) -> ty::Region<'tcx> { . self.next_region_var(RegionVariableOrigin::Nll(origin)) 25,458 ( 0.00%) } . . /// Just a convenient wrapper of `next_region_var` for using during NLL. 333 ( 0.00%) pub fn next_nll_region_var_in_universe( . &self, . origin: NllRegionVariableOrigin, . universe: ty::UniverseIndex, . ) -> ty::Region<'tcx> { 2,683 ( 0.00%) self.next_region_var_in_universe(RegionVariableOrigin::Nll(origin), universe) 666 ( 0.00%) } . 163,432 ( 0.01%) pub fn var_for_def(&self, span: Span, param: &ty::GenericParamDef) -> GenericArg<'tcx> { 91,131 ( 0.00%) match param.kind { . GenericParamDefKind::Lifetime => { . // Create a region inference variable for the given . // region parameter definition. 5,507 ( 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)`. 59,396 ( 0.00%) let ty_var_id = self.inner.borrow_mut().type_variables().new_var( . self.universe(), 74,245 ( 0.00%) TypeVariableOrigin { . kind: TypeVariableOriginKind::TypeParameterDefinition( 14,849 ( 0.00%) param.name, 14,849 ( 0.00%) Some(param.def_id), . ), . span, . }, . ); . 14,849 ( 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 = 803 ( 0.00%) self.inner.borrow_mut().const_unification_table().new_key(ConstVarValue { . origin, . val: ConstVariableValue::Unknown { universe: self.universe() }, . }); 73 ( 0.00%) self.tcx.mk_const_var(const_var_id, self.tcx.type_of(param.def_id)).into() . } . } 584 ( 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. 38,805 ( 0.00%) pub fn fresh_substs_for_item(&self, span: Span, def_id: DefId) -> SubstsRef<'tcx> { 172,215 ( 0.01%) InternalSubsts::for_item(self.tcx, def_id, |param, _| self.var_for_def(span, param)) 25,870 ( 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). 1,142 ( 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() . ); . 34,465 ( 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() 1,713 ( 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`. 35,546 ( 0.00%) pub fn resolve_regions( . &self, . region_context: DefId, . outlives_env: &OutlivesEnvironment<'tcx>, . mode: RegionckMode, . ) -> Vec> { 96,482 ( 0.00%) let (var_infos, data) = { . let mut inner = self.inner.borrow_mut(); . let inner = &mut *inner; 5,078 ( 0.00%) assert!( 15,234 ( 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() 5,078 ( 0.00%) }; . . let region_rels = 5,078 ( 0.00%) &RegionRelations::new(self.tcx, region_context, outlives_env.free_region_map()); . 45,702 ( 0.00%) let (lexical_region_resolutions, errors) = 121,872 ( 0.01%) lexical_region_resolve::resolve(region_rels, var_infos, data, mode); . 20,312 ( 0.00%) let old_value = self.lexical_region_resolutions.replace(Some(lexical_region_resolutions)); 5,078 ( 0.00%) assert!(old_value.is_none()); . . errors 45,702 ( 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`. 50,780 ( 0.00%) pub fn resolve_regions_and_report_errors( . &self, . region_context: DefId, . outlives_env: &OutlivesEnvironment<'tcx>, . mode: RegionckMode, . ) { 10,156 ( 0.00%) let errors = self.resolve_regions(region_context, outlives_env, mode); . 15,234 ( 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. 10,156 ( 0.00%) self.report_region_errors(&errors); . } 25,390 ( 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. 66 ( 0.00%) pub fn take_and_reset_region_constraints(&self) -> RegionConstraintData<'tcx> { 22 ( 0.00%) assert!( . self.inner.borrow().region_obligations.is_empty(), . "region_obligations not empty: {:#?}", . self.inner.borrow().region_obligations . ); . 88 ( 0.00%) self.inner.borrow_mut().unwrap_region_constraints().take_and_reset_data() 110 ( 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(); 15,968 ( 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. 2,280 ( 0.00%) pub fn take_region_var_origins(&self) -> VarInfos { . let mut inner = self.inner.borrow_mut(); 8,664 ( 0.00%) let (var_infos, data) = inner . .region_constraint_storage . .take() . .expect("regions already resolved") . .with_log(&mut inner.undo_log) 456 ( 0.00%) .into_infos_and_data(); 456 ( 0.00%) assert!(data.is_empty()); . var_infos 3,648 ( 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)`. 6,508 ( 0.00%) pub fn probe_ty_var(&self, vid: TyVid) -> Result, ty::UniverseIndex> { . use self::type_variable::TypeVariableValue; . 19,524 ( 0.00%) match self.inner.borrow_mut().type_variables().probe(vid) { . TypeVariableValue::Known { value } => Ok(value), . TypeVariableValue::Unknown { universe } => Err(universe), . } 22,778 ( 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>, . { 144,493 ( 0.01%) value.fold_with(&mut ShallowResolver { infcx: self }) . } . 10,054 ( 0.00%) pub fn root_var(&self, var: ty::TyVid) -> ty::TyVid { . self.inner.borrow_mut().type_variables().root_var(var) 15,081 ( 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. 1,548 ( 0.00%) pub fn resolve_vars_if_possible(&self, value: T) -> T . where . T: TypeFoldable<'tcx>, . { 160,044 ( 0.01%) if !value.needs_infer() { 144,553 ( 0.01%) return value; // Avoid duplicated subst-folding. . } 147,790 ( 0.01%) let mut r = resolve::OpportunisticVarResolver::new(self); 175,423 ( 0.01%) value.fold_with(&mut r) 1,795 ( 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>, . { 7,364 ( 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) . } . 10,170 ( 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 = 68,302 ( 0.00%) |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 }, . ) . }; 137,990 ( 0.01%) self.tcx.replace_bound_vars(value, fld_r, fld_t, fld_c) 6,780 ( 0.00%) } . . /// See the [`region_constraints::RegionConstraintCollector::verify_generic_bound`] method. 2,224 ( 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); . 834 ( 0.00%) self.inner . .borrow_mut() . .unwrap_region_constraints() 4,726 ( 0.00%) .verify_generic_bound(origin, kind, a, bound); 1,946 ( 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. 490 ( 0.00%) pub fn closure_kind(&self, closure_substs: SubstsRef<'tcx>) -> Option { 980 ( 0.00%) let closure_kind_ty = closure_substs.as_closure().kind_ty(); . let closure_kind_ty = self.shallow_resolve(closure_kind_ty); 735 ( 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 { 288,828 ( 0.01%) self.universe.get() 94,299 ( 0.00%) } . . /// Creates and return a fresh universe that extends all previous . /// universes. Updates `self.universe` to that new universe. 490 ( 0.00%) pub fn create_next_universe(&self) -> ty::UniverseIndex { 722 ( 0.00%) let u = self.universe.get().next_universe(); . self.universe.set(u); . u 490 ( 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 -- line 1576 ---------------------------------------- -- line 1606 ---------------------------------------- . // variables, thus we don't need to substitute back the original values. . self.tcx.const_eval_resolve(param_env_erased, unevaluated, span) . } . . /// 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`. 1,605,832 ( 0.08%) fn shallow_resolve_ty(&self, typ: Ty<'tcx>) -> Ty<'tcx> { 849,418 ( 0.04%) 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`. 431,968 ( 0.02%) let known = self.inner.borrow_mut().type_variables().probe(v).known(); . known.map_or(typ, |t| self.shallow_resolve_ty(t)) . } . 2,424 ( 0.00%) ty::Infer(ty::IntVar(v)) => self . .inner . .borrow_mut() . .int_unification_table() . .probe_value(v) 777 ( 0.00%) .map(|v| v.to_type(self.tcx)) . .unwrap_or(typ), . . ty::Infer(ty::FloatVar(v)) => self . .inner . .borrow_mut() . .float_unification_table() . .probe_value(v) . .map(|v| v.to_type(self.tcx)) . .unwrap_or(typ), . . _ => typ, . } 1,806,561 ( 0.09%) } . . /// `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))`. 384,585 ( 0.02%) 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(_)`. 132 ( 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. . self.inner.borrow_mut().float_unification_table().probe_value(v).is_some() -- line 1688 ---------------------------------------- -- 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`). 4,127 ( 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, . } 4,127 ( 0.00%) } . . /// Tries to extract an inference variable from a type, returns `None` . /// for types other than `ty::Infer(_)` (or `InferTy::Fresh*`). 570 ( 0.00%) pub fn maybe_from_ty(ty: Ty<'tcx>) -> Option { 42,183 ( 0.00%) match *ty.kind() { 9,354 ( 0.00%) ty::Infer(ty::TyVar(v)) => Some(TyOrConstInferVar::Ty(v)), 20 ( 0.00%) ty::Infer(ty::IntVar(v)) => Some(TyOrConstInferVar::TyInt(v)), . ty::Infer(ty::FloatVar(v)) => Some(TyOrConstInferVar::TyFloat(v)), . _ => None, . } 570 ( 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> { 307,787 ( 0.02%) self.infcx.shallow_resolve_ty(ty) . } . 1,860 ( 0.00%) fn fold_const(&mut self, ct: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> { 1,092 ( 0.00%) if let ty::Const { val: ty::ConstKind::Infer(InferConst::Var(vid)), .. } = ct { 405 ( 0.00%) self.infcx . .inner . .borrow_mut() . .const_unification_table() 243 ( 0.00%) .probe_value(*vid) . .val . .known() . .unwrap_or(ct) . } else { . ct . } 2,325 ( 0.00%) } . } . . impl<'tcx> TypeTrace<'tcx> { . pub fn span(&self) -> Span { 52 ( 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 { 130 ( 0.00%) match *self { 26 ( 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, . { 19,534 ( 0.00%) match *cause.code() { 3,065 ( 0.00%) traits::ObligationCauseCode::ReferenceOutlivesReferent(ref_type) => { 15,325 ( 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 ---------------------------------------- 1,404,879 ( 0.07%) -------------------------------------------------------------------------------- -- 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> { 25,440 ( 0.00%) pub fn new(body: &'a Body<'tcx>, root: BasicBlock) -> Preorder<'a, 'tcx> { 2,544 ( 0.00%) let worklist = vec![root]; . 7,632 ( 0.00%) Preorder { . body, . visited: BitSet::new_empty(body.basic_blocks().len()), 10,176 ( 0.00%) worklist, . root_is_start_block: root == START_BLOCK, . } 22,896 ( 0.00%) } . } . 2,946 ( 0.00%) pub fn preorder<'a, 'tcx>(body: &'a Body<'tcx>) -> Preorder<'a, 'tcx> { 9,372 ( 0.00%) Preorder::new(body, START_BLOCK) 4,419 ( 0.00%) } . . impl<'a, 'tcx> Iterator for Preorder<'a, 'tcx> { . type Item = (BasicBlock, &'a BasicBlockData<'tcx>); . 549,461 ( 0.03%) fn next(&mut self) -> Option<(BasicBlock, &'a BasicBlockData<'tcx>)> { 68,145 ( 0.00%) while let Some(idx) = self.worklist.pop() { 68,145 ( 0.00%) if !self.visited.insert(idx) { . continue; . } . 47,407 ( 0.00%) let data = &self.body[idx]; . 237,035 ( 0.01%) if let Some(ref term) = data.terminator { . self.worklist.extend(term.successors()); . } . . return Some((idx, data)); . } . . None 449,559 ( 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> { 23,968 ( 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]; . 23,968 ( 0.00%) if let Some(ref term) = data.terminator { . po.visited.insert(root); 13,696 ( 0.00%) po.visit_stack.push((root, term.successors())); 6,848 ( 0.00%) po.traverse_successor(); . } . . po 30,816 ( 0.00%) } . 428,057 ( 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 { 419,020 ( 0.02%) let bb = if let Some(&mut (_, ref mut iter)) = self.visit_stack.last_mut() { 242,415 ( 0.01%) if let Some(&bb) = iter.next() { . bb . } else { . break; . } . } else { . break; . }; . 80,805 ( 0.00%) if self.visited.insert(bb) { 380,121 ( 0.02%) if let Some(term) = &self.body[bb].terminator { 217,212 ( 0.01%) self.visit_stack.push((bb, term.successors())); . } . } . } 489,208 ( 0.02%) } . } . 114 ( 0.00%) pub fn postorder<'a, 'tcx>(body: &'a Body<'tcx>) -> Postorder<'a, 'tcx> { 114 ( 0.00%) Postorder::new(body, START_BLOCK) 171 ( 0.00%) } . . impl<'a, 'tcx> Iterator for Postorder<'a, 'tcx> { . type Item = (BasicBlock, &'a BasicBlockData<'tcx>); . 9,708 ( 0.00%) fn next(&mut self) -> Option<(BasicBlock, &'a BasicBlockData<'tcx>)> { . let next = self.visit_stack.pop(); 57,727 ( 0.00%) if next.is_some() { 112,087 ( 0.01%) self.traverse_successor(); . } . 57,727 ( 0.00%) next.map(|(bb, _)| (bb, &self.body[bb])) 16,180 ( 0.00%) } . 330 ( 0.00%) fn size_hint(&self) -> (usize, Option) { . // All the blocks, minus the number of blocks we've visited. 11,554 ( 0.00%) let upper = self.body.basic_blocks().len() - self.visited.count(); . 11,554 ( 0.00%) let lower = if self.root_is_start_block { . // We will visit all remaining blocks exactly once. . upper . } else { . self.visit_stack.len() . }; . 198 ( 0.00%) (lower, Some(upper)) 462 ( 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> { 6,734 ( 0.00%) let blocks: Vec<_> = Postorder::new(body, root).map(|(bb, _)| bb).collect(); . 3,367 ( 0.00%) let len = blocks.len(); . 16,835 ( 0.00%) ReversePostorder { body, blocks, idx: len } . } . } . 20,202 ( 0.00%) pub fn reverse_postorder<'a, 'tcx>(body: &'a Body<'tcx>) -> ReversePostorder<'a, 'tcx> { . ReversePostorder::new(body, START_BLOCK) 16,835 ( 0.00%) } . . impl<'a, 'tcx> Iterator for ReversePostorder<'a, 'tcx> { . type Item = (BasicBlock, &'a BasicBlockData<'tcx>); . 57,915 ( 0.00%) fn next(&mut self) -> Option<(BasicBlock, &'a BasicBlockData<'tcx>)> { 231,660 ( 0.01%) if self.idx == 0 { . return None; . } 109,096 ( 0.01%) self.idx -= 1; . . self.blocks.get(self.idx).map(|&bb| (bb, &self.body[bb])) 115,830 ( 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`. 6,426 ( 0.00%) pub fn reachable_as_bitset<'tcx>(body: &Body<'tcx>) -> BitSet { . let mut iter = preorder(body); . (&mut iter).for_each(drop); 4,284 ( 0.00%) iter.visited 6,426 ( 0.00%) } 584,494 ( 0.03%) -------------------------------------------------------------------------------- -- 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 { 2,283 ( 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> { 276,195 ( 0.01%) fn reverse(&mut self, undo: UndoLog<'tcx>) { 460,325 ( 0.02%) match undo { 639,440 ( 0.03%) UndoLog::TypeVariables(undo) => self.type_variable_storage.reverse(undo), 158 ( 0.00%) UndoLog::ConstUnificationTable(undo) => self.const_unification_storage.reverse(undo), 388 ( 0.00%) UndoLog::IntUnificationTable(undo) => self.int_unification_storage.reverse(undo), . UndoLog::FloatUnificationTable(undo) => self.float_unification_storage.reverse(undo), . UndoLog::RegionConstraintCollector(undo) => { 104,895 ( 0.01%) self.region_constraint_storage.as_mut().unwrap().reverse(undo) . } . UndoLog::RegionUnificationTable(undo) => { 24,376 ( 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(); . } . } 368,260 ( 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 { 32,508 ( 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) { 81,524 ( 0.00%) if self.in_snapshot() { 18,264 ( 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> { 238,500 ( 0.01%) pub fn rollback_to(&mut self, snapshot: Snapshot<'tcx>) { . debug!("rollback_to({})", snapshot.undo_len); . self.undo_log.assert_open_snapshot(&snapshot); . 355,695 ( 0.02%) while self.undo_log.logs.len() > snapshot.undo_len { . let undo = self.undo_log.logs.pop().unwrap(); 1,104,780 ( 0.05%) self.reverse(undo); . } . 91,325 ( 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. 24,310 ( 0.00%) assert!(snapshot.undo_len == 0); . self.undo_log.logs.clear(); . } . 131,405 ( 0.01%) self.undo_log.num_open_snapshots -= 1; 278,250 ( 0.01%) } . . pub fn commit(&mut self, snapshot: Snapshot<'tcx>) { . debug!("commit({})", snapshot.undo_len); . 215,145 ( 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. 51,872 ( 0.00%) assert!(snapshot.undo_len == 0); . self.undo_log.logs.clear(); . } . 241,081 ( 0.01%) self.undo_log.num_open_snapshots -= 1; . } . } . . impl<'tcx> InferCtxtUndoLogs<'tcx> { . pub fn start_snapshot(&mut self) -> Snapshot<'tcx> { 445,860 ( 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 { 35,845 ( 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 { 27 ( 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. 119,250 ( 0.01%) assert!(self.logs.len() >= snapshot.undo_len); 119,250 ( 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 ---------------------------------------- 152,304 ( 0.01%) -------------------------------------------------------------------------------- -- 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)] 34,521 ( 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 { 455,792 ( 0.02%) Node { . obligation, . state: Cell::new(NodeState::Pending), 62,225 ( 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`. 323,180 ( 0.02%) #[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 { 69,226 ( 0.00%) Self { stalled: true, errors: vec![] } . } . . fn mark_not_stalled(&mut self) { 28,256 ( 0.00%) self.stalled = false; . } . . fn is_stalled(&self) -> bool { 11,750 ( 0.00%) self.stalled . } . . fn record_completed(&mut self, _outcome: &Self::Obligation) { . // do nothing . } . . fn record_error(&mut self, error: Self::Error) { 720 ( 0.00%) self.errors.push(error) . } . } . . #[derive(Debug, PartialEq, Eq)] . pub struct Error { . pub error: E, . pub backtrace: Vec, . } . . impl ObligationForest { 11,160 ( 0.00%) pub fn new() -> ObligationForest { 133,920 ( 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(), . } 11,160 ( 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. 278,044 ( 0.01%) let _ = self.register_obligation_at(obligation, None); . } . . // Returns Err(()) if we already know this obligation failed. 448,360 ( 0.02%) fn register_obligation_at(&mut self, obligation: O, parent: Option) -> Result<(), ()> { 81,520 ( 0.00%) let cache_key = obligation.as_cache_key(); 81,520 ( 0.00%) if self.done_cache.contains(&cache_key) { . debug!("register_obligation_at: ignoring already done obligation: {:?}", obligation); . return Ok(()); . } . 210,696 ( 0.01%) match self.active_cache.entry(cache_key) { . Entry::Occupied(o) => { 13,258 ( 0.00%) let node = &mut self.nodes[*o.get()]; 13,258 ( 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. 14,028 ( 0.00%) if !node.dependents.contains(&parent_index) { . node.dependents.push(parent_index); . } . } 19,887 ( 0.00%) if let NodeState::Error = node.state.get() { Err(()) } else { Ok(()) } . } 85,461 ( 0.00%) Entry::Vacant(v) => { 170,922 ( 0.01%) let obligation_tree_id = match parent { 22,492 ( 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 { 28,487 ( 0.00%) let new_index = self.nodes.len(); . v.insert(new_index); . self.nodes.push(Node::new(parent, obligation, obligation_tree_id)); . Ok(()) . } . } . } 366,840 ( 0.02%) } . . /// Converts all remaining obligations to the given error. 111,860 ( 0.01%) 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(); . 31,960 ( 0.00%) self.compress(|_| assert!(false)); . errors 95,880 ( 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, . { 204 ( 0.00%) self.nodes . .iter() . .filter(|node| node.state.get() == NodeState::Pending) . .map(|node| f(&node.obligation)) . .collect() . } . 588 ( 0.00%) fn insert_into_error_cache(&mut self, index: usize) { . let node = &self.nodes[index]; 84 ( 0.00%) self.error_cache 252 ( 0.00%) .entry(node.obligation_tree_id) . .or_default() . .insert(node.obligation.as_cache_key()); 672 ( 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)] 311,517 ( 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; 145,735 ( 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. 222,244 ( 0.01%) if node.state.get() != NodeState::Pending { 8,851 ( 0.00%) index += 1; . continue; . } . 154,114 ( 0.01%) match processor.process_obligation(&mut node.obligation) { . ProcessResult::Unchanged => { . // No change in state. . } 112,844 ( 0.01%) ProcessResult::Changed(children) => { . // We are not (yet) stalled. . outcome.mark_not_stalled(); . node.state.set(NodeState::Success); . 151,588 ( 0.01%) for child in children { 329,324 ( 0.02%) let st = self.register_obligation_at(child, Some(index)); 38,744 ( 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(); 1,485 ( 0.00%) outcome.record_error(Error { error: err, backtrace: self.error_at(index) }); . } . } 204,542 ( 0.01%) index += 1; . } . . // There's no need to perform marking, cycle processing and compression when nothing . // changed. 11,750 ( 0.00%) if !outcome.is_stalled() { . self.mark_successes(); . self.process_cycles(processor); 13,372 ( 0.00%) self.compress(|obl| outcome.record_completed(obl)); . } . . outcome 311,517 ( 0.02%) } . . /// Returns a vector of obligations for `p` and all of its . /// ancestors, putting them into the error state in the process. 315 ( 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]; 84 ( 0.00%) node.state.set(NodeState::Error); . trace.push(node.obligation.clone()); 168 ( 0.00%) if node.has_parent { . // The first dependent is the parent, which is treated . // specially. . error_stack.extend(node.dependents.iter().skip(1)); 39 ( 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 360 ( 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 { 138,110 ( 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 { 54,634 ( 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) { 4,453 ( 0.00%) for &index in node.dependents.iter() { . let node = &self.nodes[index]; 4,453 ( 0.00%) let state = node.state.get(); 4,453 ( 0.00%) if state == NodeState::Success { . // This call site is cold. 8,865 ( 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)] 20,685 ( 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) 23,640 ( 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, . { 6,686 ( 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. 54,634 ( 0.00%) if node.state.get() == NodeState::Success { 134,685 ( 0.01%) self.find_cycles_from_node(&mut stack, processor, index); . } . } . . debug_assert!(stack.is_empty()); 53,488 ( 0.00%) self.reused_node_vec = stack; . } . 380,214 ( 0.02%) fn find_cycles_from_node

(&self, stack: &mut Vec, processor: &mut P, index: usize) . where . P: ObligationProcessor, . { . let node = &self.nodes[index]; 84,492 ( 0.00%) if node.state.get() == NodeState::Success { 4,204 ( 0.00%) match stack.iter().rposition(|&n| n == index) { . None => { . stack.push(index); 15,309 ( 0.00%) for &dep_index in node.dependents.iter() { 61,236 ( 0.00%) self.find_cycles_from_node(stack, processor, dep_index); . } . stack.pop(); . node.state.set(NodeState::Done); . } . Some(rpos) => { . // Cycle detected. 1,899 ( 0.00%) processor.process_backedge( . stack[rpos..].iter().map(|&i| &self.nodes[i].obligation), . PhantomData, . ); . } . } . } 337,968 ( 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)] 165,348 ( 0.01%) fn compress(&mut self, mut outcome_cb: impl FnMut(&O)) { 22,666 ( 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]; 299,914 ( 0.01%) match node.state.get() { . NodeState::Pending | NodeState::Waiting => { 52,756 ( 0.00%) if dead_nodes > 0 { 21,156 ( 0.00%) self.nodes.swap(index, index - dead_nodes); 35,260 ( 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. 106,908 ( 0.01%) if let Some((predicate, _)) = 84,516 ( 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); 56,344 ( 0.00%) node_rewrites[index] = orig_nodes_len; 56,344 ( 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. 252 ( 0.00%) self.active_cache.remove(&node.obligation.as_cache_key()); 168 ( 0.00%) self.insert_into_error_cache(index); 168 ( 0.00%) node_rewrites[index] = orig_nodes_len; 168 ( 0.00%) dead_nodes += 1; . } . NodeState::Success => unreachable!(), . } . } . . if dead_nodes > 0 { . // Remove the dead nodes and rewrite indices. 13,152 ( 0.00%) self.nodes.truncate(orig_nodes_len - dead_nodes); 6,576 ( 0.00%) self.apply_rewrites(&node_rewrites); . } . . node_rewrites.truncate(0); 90,664 ( 0.00%) self.reused_node_vec = node_rewrites; 181,328 ( 0.01%) } . . #[inline(never)] 59,184 ( 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; 29,187 ( 0.00%) while let Some(dependent) = node.dependents.get_mut(i) { 16,012 ( 0.00%) let new_index = node_rewrites[*dependent]; 8,006 ( 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 { 4,003 ( 0.00%) *dependent = new_index; 8,006 ( 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| { 123,856 ( 0.01%) let new_index = node_rewrites[*index]; 61,928 ( 0.00%) if new_index >= orig_nodes_len { . false . } else { 25,184 ( 0.00%) *index = new_index; . true . } . }); 52,608 ( 0.00%) } . } 726,327 ( 0.04%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/alloc/src/vec/mod.rs -------------------------------------------------------------------------------- Ir -- line 417 ---------------------------------------- . /// # #![allow(unused_mut)] . /// let mut vec: Vec = Vec::new(); . /// ``` . #[inline] . #[rustc_const_stable(feature = "const_vec_new", since = "1.39.0")] . #[stable(feature = "rust1", since = "1.0.0")] . #[must_use] . pub const fn new() -> Self { 3,526,540 ( 0.17%) Vec { buf: RawVec::NEW, len: 0 } 393 ( 0.00%) } . . /// Constructs a new, empty `Vec` with the specified capacity. . /// . /// The vector will be able to hold exactly `capacity` elements without . /// reallocating. If `capacity` is 0, the vector will not allocate. . /// . /// It is important to note that although the returned vector has the . /// *capacity* specified, the vector will have a zero *length*. For an -- line 434 ---------------------------------------- -- line 601 ---------------------------------------- . /// vec.push(11); . /// assert_eq!(vec.len(), 11); . /// assert!(vec.capacity() >= 11); . /// ``` . #[cfg(not(no_global_oom_handling))] . #[inline] . #[unstable(feature = "allocator_api", issue = "32838")] . pub fn with_capacity_in(capacity: usize, alloc: A) -> Self { 1,124,359 ( 0.06%) Vec { buf: RawVec::with_capacity_in(capacity, alloc), len: 0 } . } . . /// Creates a `Vec` directly from the raw components of another vector. . /// . /// # Safety . /// . /// This is highly unsafe, due to the number of invariants that aren't . /// checked: -- line 617 ---------------------------------------- -- line 677 ---------------------------------------- . /// // Put everything back together into a Vec . /// let rebuilt = Vec::from_raw_parts_in(p, len, cap, alloc.clone()); . /// assert_eq!(rebuilt, [4, 5, 6]); . /// } . /// ``` . #[inline] . #[unstable(feature = "allocator_api", issue = "32838")] . pub unsafe fn from_raw_parts_in(ptr: *mut T, length: usize, capacity: usize, alloc: A) -> Self { 60,866 ( 0.00%) unsafe { Vec { buf: RawVec::from_raw_parts_in(ptr, capacity, alloc), len: length } } . } . . /// Decomposes a `Vec` into its raw components. . /// . /// Returns the raw pointer to the underlying data, the length of . /// the vector (in elements), and the allocated capacity of the . /// data (in elements). These are the same arguments in the same . /// order as the arguments to [`from_raw_parts`]. -- line 693 ---------------------------------------- -- line 778 ---------------------------------------- . /// . /// ``` . /// let vec: Vec = Vec::with_capacity(10); . /// assert_eq!(vec.capacity(), 10); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn capacity(&self) -> usize { 227,147 ( 0.01%) self.buf.capacity() . } . . /// Reserves capacity for at least `additional` more elements to be inserted . /// in the given `Vec`. The collection may reserve more space to avoid . /// frequent reallocations. After calling `reserve`, capacity will be . /// greater than or equal to `self.len() + additional`. Does nothing if . /// capacity is already sufficient. . /// -- line 794 ---------------------------------------- -- line 801 ---------------------------------------- . /// ``` . /// let mut vec = vec![1]; . /// vec.reserve(10); . /// assert!(vec.capacity() >= 11); . /// ``` . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn reserve(&mut self, additional: usize) { 333,451 ( 0.02%) self.buf.reserve(self.len, additional); . } . . /// Reserves the minimum capacity for exactly `additional` more elements to . /// be inserted in the given `Vec`. After calling `reserve_exact`, . /// capacity will be greater than or equal to `self.len() + additional`. . /// Does nothing if the capacity is already sufficient. . /// . /// Note that the allocator may give the collection more space than it -- line 817 ---------------------------------------- -- line 829 ---------------------------------------- . /// ``` . /// let mut vec = vec![1]; . /// vec.reserve_exact(10); . /// assert!(vec.capacity() >= 11); . /// ``` . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn reserve_exact(&mut self, additional: usize) { 11,794 ( 0.00%) self.buf.reserve_exact(self.len, additional); . } . . /// Tries to reserve capacity for at least `additional` more elements to be inserted . /// in the given `Vec`. The collection may reserve more space to avoid . /// frequent reallocations. After calling `try_reserve`, capacity will be . /// greater than or equal to `self.len() + additional`. Does nothing if . /// capacity is already sufficient. . /// -- line 845 ---------------------------------------- -- line 930 ---------------------------------------- . /// assert!(vec.capacity() >= 3); . /// ``` . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn shrink_to_fit(&mut self) { . // The capacity is never less than the length, and there's nothing to do when . // they are equal, so we can avoid the panic case in `RawVec::shrink_to_fit` . // by only calling it with a greater capacity. 43,352 ( 0.00%) if self.capacity() > self.len { 5,448 ( 0.00%) self.buf.shrink_to_fit(self.len); . } . } . . /// Shrinks the capacity of the vector with a lower bound. . /// . /// The capacity will remain at least as large as both the length . /// and the supplied value. . /// -- line 947 ---------------------------------------- -- line 990 ---------------------------------------- . /// let slice = vec.into_boxed_slice(); . /// assert_eq!(slice.into_vec().capacity(), 3); . /// ``` . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn into_boxed_slice(mut self) -> Box<[T], A> { . unsafe { . self.shrink_to_fit(); 15,237 ( 0.00%) let me = ManuallyDrop::new(self); . let buf = ptr::read(&me.buf); . let len = me.len(); . buf.into_box(len).assume_init() . } . } . . /// Shortens the vector, keeping the first `len` elements and dropping . /// the rest. -- line 1006 ---------------------------------------- -- line 1040 ---------------------------------------- . /// let mut vec = vec![1, 2, 3]; . /// vec.truncate(0); . /// assert_eq!(vec, []); . /// ``` . /// . /// [`clear`]: Vec::clear . /// [`drain`]: Vec::drain . #[stable(feature = "rust1", since = "1.0.0")] 433,212 ( 0.02%) pub fn truncate(&mut self, len: usize) { . // This is safe because: . // . // * the slice passed to `drop_in_place` is valid; the `len > self.len` . // case avoids creating an invalid slice, and . // * the `len` of the vector is shrunk before calling `drop_in_place`, . // such that no value will be dropped twice in case `drop_in_place` . // were to panic once (if it panics twice, the program aborts). . unsafe { . // Note: It's intentional that this is `>` and not `>=`. . // Changing it to `>=` has negative performance . // implications in some cases. See #78884 for more. 311,233 ( 0.02%) if len > self.len { . return; . } . let remaining_len = self.len - len; . let s = ptr::slice_from_raw_parts_mut(self.as_mut_ptr().add(len), remaining_len); 251,245 ( 0.01%) self.len = len; 6,576 ( 0.00%) ptr::drop_in_place(s); . } 519,854 ( 0.03%) } . . /// Extracts a slice containing the entire vector. . /// . /// Equivalent to `&s[..]`. . /// . /// # Examples . /// . /// ``` -- line 1076 ---------------------------------------- -- line 1126 ---------------------------------------- . /// ``` . /// . /// [`as_mut_ptr`]: Vec::as_mut_ptr . #[stable(feature = "vec_as_ptr", since = "1.37.0")] . #[inline] . pub fn as_ptr(&self) -> *const T { . // We shadow the slice method of the same name to avoid going through . // `deref`, which creates an intermediate reference. 4,195,784 ( 0.21%) let ptr = self.buf.ptr(); . unsafe { . assume(!ptr.is_null()); . } . ptr . } . . /// Returns an unsafe mutable pointer to the vector's buffer. . /// -- line 1142 ---------------------------------------- -- line 1162 ---------------------------------------- . /// } . /// assert_eq!(&*x, &[0, 1, 2, 3]); . /// ``` . #[stable(feature = "vec_as_ptr", since = "1.37.0")] . #[inline] . pub fn as_mut_ptr(&mut self) -> *mut T { . // We shadow the slice method of the same name to avoid going through . // `deref_mut`, which creates an intermediate reference. 3,884,294 ( 0.19%) let ptr = self.buf.ptr(); . unsafe { . assume(!ptr.is_null()); . } . ptr . } . . /// Returns a reference to the underlying allocator. . #[unstable(feature = "allocator_api", issue = "32838")] -- line 1178 ---------------------------------------- -- line 1259 ---------------------------------------- . /// . /// Normally, here, one would use [`clear`] instead to correctly drop . /// the contents and thus not leak memory. . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub unsafe fn set_len(&mut self, new_len: usize) { . debug_assert!(new_len <= self.capacity()); . 634,762 ( 0.03%) self.len = new_len; 6,084 ( 0.00%) } . . /// Removes an element from the vector and returns it. . /// . /// The removed element is replaced by the last element of the vector. . /// . /// This does not preserve ordering, but is *O*(1). . /// If you need to preserve the element order, use [`remove`] instead. . /// -- line 1276 ---------------------------------------- -- line 1305 ---------------------------------------- . assert_failed(index, len); . } . unsafe { . // We replace self[index] with the last element. Note that if the . // bounds check above succeeds there must be a last element (which . // can be self[index] itself). . let value = ptr::read(self.as_ptr().add(index)); . let base_ptr = self.as_mut_ptr(); 43 ( 0.00%) ptr::copy(base_ptr.add(len - 1), base_ptr.add(index), 1); . self.set_len(len - 1); . value . } . } . . /// Inserts an element at position `index` within the vector, shifting all . /// elements after it to the right. . /// -- line 1321 ---------------------------------------- -- line 1329 ---------------------------------------- . /// let mut vec = vec![1, 2, 3]; . /// vec.insert(1, 4); . /// assert_eq!(vec, [1, 4, 2, 3]); . /// vec.insert(4, 5); . /// assert_eq!(vec, [1, 4, 2, 3, 5]); . /// ``` . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "rust1", since = "1.0.0")] 12,250 ( 0.00%) pub fn insert(&mut self, index: usize, element: T) { . #[cold] . #[inline(never)] . fn assert_failed(index: usize, len: usize) -> ! { . panic!("insertion index (is {}) should be <= len (is {})", index, len); . } . 1,861 ( 0.00%) let len = self.len(); 3,928 ( 0.00%) if index > len { . assert_failed(index, len); . } . . // space for the new element 5,142 ( 0.00%) if len == self.buf.capacity() { . self.reserve(1); . } . . unsafe { . // infallible . // The spot to put the new value . { . let p = self.as_mut_ptr().add(index); . // Shift everything over to make space. (Duplicating the . // `index`th element into two consecutive places.) 7,005 ( 0.00%) ptr::copy(p, p.offset(1), len - index); . // Write it in, overwriting the first copy of the `index`th . // element. . ptr::write(p, element); . } 4,928 ( 0.00%) self.set_len(len + 1); . } 10,500 ( 0.00%) } . . /// Removes and returns the element at position `index` within the vector, . /// shifting all elements after it to the left. . /// . /// Note: Because this shifts over the remaining elements, it has a . /// worst-case performance of *O*(*n*). If you don't need the order of elements . /// to be preserved, use [`swap_remove`] instead. If you'd like to remove . /// elements from the beginning of the `Vec`, consider using -- line 1376 ---------------------------------------- -- line 1395 ---------------------------------------- . pub fn remove(&mut self, index: usize) -> T { . #[cold] . #[inline(never)] . #[track_caller] . fn assert_failed(index: usize, len: usize) -> ! { . panic!("removal index (is {}) should be < len (is {})", index, len); . } . 658 ( 0.00%) let len = self.len(); 2,290 ( 0.00%) if index >= len { . assert_failed(index, len); . } . unsafe { . // infallible . let ret; . { . // the place we are taking from. . let ptr = self.as_mut_ptr().add(index); . // copy it out, unsafely having a copy of the value on . // the stack and in the vector at the same time. 5,322 ( 0.00%) ret = ptr::read(ptr); . . // Shift everything down to fill in that spot. 1,474 ( 0.00%) ptr::copy(ptr.offset(1), ptr, len - index - 1); . } 897 ( 0.00%) self.set_len(len - 1); . ret . } . } . . /// Retains only the elements specified by the predicate. . /// . /// In other words, remove all elements `e` such that `f(&e)` returns `false`. . /// This method operates in place, visiting each element exactly once in the -- line 1428 ---------------------------------------- -- line 1442 ---------------------------------------- . /// ``` . /// let mut vec = vec![1, 2, 3, 4, 5]; . /// let keep = [false, true, true, false, true]; . /// let mut iter = keep.iter(); . /// vec.retain(|_| *iter.next().unwrap()); . /// assert_eq!(vec, [2, 3, 5]); . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] 311,779 ( 0.02%) pub fn retain(&mut self, mut f: F) . where . F: FnMut(&T) -> bool, . { 18,340 ( 0.00%) self.retain_mut(|elem| f(elem)); 303,824 ( 0.01%) } . . /// Retains only the elements specified by the predicate, passing a mutable reference to it. . /// . /// In other words, remove all elements `e` such that `f(&mut e)` returns `false`. . /// This method operates in place, visiting each element exactly once in the . /// original order, and preserves the order of the retained elements. . /// . /// # Examples -- line 1463 ---------------------------------------- -- line 1474 ---------------------------------------- . /// }); . /// assert_eq!(vec, [2, 3, 4]); . /// ``` . #[unstable(feature = "vec_retain_mut", issue = "90829")] . pub fn retain_mut(&mut self, mut f: F) . where . F: FnMut(&mut T) -> bool, . { 39,470 ( 0.00%) let original_len = self.len(); . // Avoid double drop if the drop guard is not executed, . // since we may make some holes during the process. . unsafe { self.set_len(0) }; . . // Vec: [Kept, Kept, Hole, Hole, Hole, Hole, Unchecked, Unchecked] . // |<- processed len ->| ^- next to check . // |<- deleted cnt ->| . // |<- original_len ->| -- line 1490 ---------------------------------------- -- line 1499 ---------------------------------------- . v: &'a mut Vec, . processed_len: usize, . deleted_cnt: usize, . original_len: usize, . } . . impl Drop for BackshiftOnDrop<'_, T, A> { . fn drop(&mut self) { 32,380 ( 0.00%) if self.deleted_cnt > 0 { . // SAFETY: Trailing unchecked items must be valid since we never touch them. . unsafe { . ptr::copy( . self.v.as_ptr().add(self.processed_len), 25,936 ( 0.00%) self.v.as_mut_ptr().add(self.processed_len - self.deleted_cnt), . self.original_len - self.processed_len, . ); . } . } . // SAFETY: After filling holes, all items are in contiguous memory. . unsafe { 2 ( 0.00%) self.v.set_len(self.original_len - self.deleted_cnt); . } . } . } . . let mut g = BackshiftOnDrop { v: self, processed_len: 0, deleted_cnt: 0, original_len }; . . fn process_loop( . original_len: usize, . f: &mut F, . g: &mut BackshiftOnDrop<'_, T, A>, . ) where . F: FnMut(&mut T) -> bool, . { 415,421 ( 0.02%) while g.processed_len != original_len { . // SAFETY: Unchecked element must be valid. . let cur = unsafe { &mut *g.v.as_mut_ptr().add(g.processed_len) }; 114,879 ( 0.01%) if !f(cur) { . // Advance early to avoid double drop if `drop_in_place` panicked. 11,402 ( 0.00%) g.processed_len += 1; 6,766 ( 0.00%) g.deleted_cnt += 1; . // SAFETY: We never touch this element again after dropped. 1,032 ( 0.00%) unsafe { ptr::drop_in_place(cur) }; . // We already advanced the counter. . if DELETED { . continue; . } else { . break; . } . } . if DELETED { . // SAFETY: `deleted_cnt` > 0, so the hole slot must not overlap with current element. . // We use copy for move, and never touch this element again. . unsafe { 9,339 ( 0.00%) let hole_slot = g.v.as_mut_ptr().add(g.processed_len - g.deleted_cnt); . ptr::copy_nonoverlapping(cur, hole_slot, 1); . } . } 7,270 ( 0.00%) g.processed_len += 1; . } . } . . // Stage 1: Nothing was deleted. . process_loop::(original_len, &mut f, &mut g); . . // Stage 2: Some elements were deleted. . process_loop::(original_len, &mut f, &mut g); -- line 1565 ---------------------------------------- -- line 1606 ---------------------------------------- . /// ``` . /// let mut vec = vec!["foo", "bar", "Bar", "baz", "bar"]; . /// . /// vec.dedup_by(|a, b| a.eq_ignore_ascii_case(b)); . /// . /// assert_eq!(vec, ["foo", "bar", "baz", "bar"]); . /// ``` . #[stable(feature = "dedup_by", since = "1.16.0")] 38,255 ( 0.00%) pub fn dedup_by(&mut self, mut same_bucket: F) . where . F: FnMut(&mut T, &mut T) -> bool, . { 5,667 ( 0.00%) let len = self.len(); 13,578 ( 0.00%) if len <= 1 { . return; . } . . /* INVARIANT: vec.len() > read >= write > write-1 >= 0 */ . struct FillGapOnDrop<'a, T, A: core::alloc::Allocator> { . /* Offset of the element we want to check if it is duplicate */ . read: usize, . -- line 1627 ---------------------------------------- -- line 1670 ---------------------------------------- . let ptr = gap.vec.as_mut_ptr(); . . /* Drop items while going through Vec, it should be more efficient than . * doing slice partition_dedup + truncate */ . . /* SAFETY: Because of the invariant, read_ptr, prev_ptr and write_ptr . * are always in-bounds and read_ptr never aliases prev_ptr */ . unsafe { 33,179 ( 0.00%) while gap.read < len { . let read_ptr = ptr.add(gap.read); . let prev_ptr = ptr.add(gap.write.wrapping_sub(1)); . 1,108 ( 0.00%) if same_bucket(&mut *read_ptr, &mut *prev_ptr) { . // Increase `gap.read` now since the drop may panic. . gap.read += 1; . /* We have found duplicate, drop it in-place */ . ptr::drop_in_place(read_ptr); . } else { . let write_ptr = ptr.add(gap.write); . . /* Because `read_ptr` can be equal to `write_ptr`, we either . * have to use `copy` or conditional `copy_nonoverlapping`. . * Looks like the first option is faster. */ . ptr::copy(read_ptr, write_ptr, 1); . . /* We have filled that place, so go further */ 27,528 ( 0.00%) gap.write += 1; . gap.read += 1; . } . } . . /* Technically we could let `gap` clean up with its Drop, but . * when `same_bucket` is guaranteed to not panic, this bloats a little . * the codegen, so we just do it manually */ . gap.vec.set_len(gap.write); . mem::forget(gap); . } 43,720 ( 0.00%) } . . /// Appends an element to the back of a collection. . /// . /// # Panics . /// . /// Panics if the new capacity exceeds `isize::MAX` bytes. . /// . /// # Examples -- line 1715 ---------------------------------------- -- line 1717 ---------------------------------------- . /// ``` . /// let mut vec = vec![1, 2]; . /// vec.push(3); . /// assert_eq!(vec, [1, 2, 3]); . /// ``` . #[cfg(not(no_global_oom_handling))] . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] 885 ( 0.00%) pub fn push(&mut self, value: T) { . // This will panic or abort if we would allocate > isize::MAX bytes . // or if the length increment would overflow for zero-sized types. 6,179,995 ( 0.30%) if self.len == self.buf.capacity() { 497,324 ( 0.02%) self.buf.reserve_for_push(self.len); . } . unsafe { 223,225 ( 0.01%) let end = self.as_mut_ptr().add(self.len); . ptr::write(end, value); 8,003,548 ( 0.39%) self.len += 1; . } 708 ( 0.00%) } . . /// Removes the last element from a vector and returns it, or [`None`] if it . /// is empty. . /// . /// If you'd like to pop the first element, consider using . /// [`VecDeque::pop_front`] instead. . /// . /// [`VecDeque::pop_front`]: crate::collections::VecDeque::pop_front -- line 1744 ---------------------------------------- -- line 1748 ---------------------------------------- . /// ``` . /// let mut vec = vec![1, 2, 3]; . /// assert_eq!(vec.pop(), Some(3)); . /// assert_eq!(vec, [1, 2]); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn pop(&mut self) -> Option { 1,256,656 ( 0.06%) if self.len == 0 { 90 ( 0.00%) None . } else { . unsafe { 949,894 ( 0.05%) self.len -= 1; 177,377 ( 0.01%) Some(ptr::read(self.as_ptr().add(self.len()))) . } . } . } . . /// Moves all the elements of `other` into `Self`, leaving `other` empty. . /// . /// # Panics . /// -- line 1769 ---------------------------------------- -- line 1776 ---------------------------------------- . /// let mut vec2 = vec![4, 5, 6]; . /// vec.append(&mut vec2); . /// assert_eq!(vec, [1, 2, 3, 4, 5, 6]); . /// assert_eq!(vec2, []); . /// ``` . #[cfg(not(no_global_oom_handling))] . #[inline] . #[stable(feature = "append", since = "1.4.0")] 1,099 ( 0.00%) pub fn append(&mut self, other: &mut Self) { . unsafe { . self.append_elements(other.as_slice() as _); . other.set_len(0); . } 942 ( 0.00%) } . . /// Appends elements to `Self` from other buffer. . #[cfg(not(no_global_oom_handling))] . #[inline] . unsafe fn append_elements(&mut self, other: *const [T]) { . let count = unsafe { (*other).len() }; . self.reserve(count); 25,269 ( 0.00%) let len = self.len(); . unsafe { ptr::copy_nonoverlapping(other as *const T, self.as_mut_ptr().add(len), count) }; 391,099 ( 0.02%) self.len += count; . } . . /// Creates a draining iterator that removes the specified range in the vector . /// and yields the removed items. . /// . /// When the iterator **is** dropped, all elements in the range are removed . /// from the vector, even if the iterator was not fully consumed. If the . /// iterator **is not** dropped (with [`mem::forget`] for example), it is -- line 1807 ---------------------------------------- -- line 1834 ---------------------------------------- . // When the Drain is first created, it shortens the length of . // the source vector to make sure no uninitialized or moved-from elements . // are accessible at all if the Drain's destructor never gets to run. . // . // Drain will ptr::read out the values to remove. . // When finished, remaining tail of the vec is copied back to cover . // the hole, and the vector length is restored to the new length. . // 31,627 ( 0.00%) let len = self.len(); . let Range { start, end } = slice::range(range, ..len); . . unsafe { . // set self.vec length's to start, to be safe in case Drain is leaked . self.set_len(start); . // Use the borrow in the IterMut to indicate borrowing behavior of the . // whole Drain iterator (like &mut T). 186 ( 0.00%) let range_slice = slice::from_raw_parts_mut(self.as_mut_ptr().add(start), end - start); 40,983 ( 0.00%) Drain { . tail_start: end, 134 ( 0.00%) tail_len: len - end, . iter: range_slice.iter(), . vec: NonNull::from(self), . } . } . } . . /// Clears the vector, removing all values. . /// -- line 1861 ---------------------------------------- -- line 1869 ---------------------------------------- . /// . /// v.clear(); . /// . /// assert!(v.is_empty()); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn clear(&mut self) { 763,423 ( 0.04%) self.truncate(0) . } . . /// Returns the number of elements in the vector, also referred to . /// as its 'length'. . /// . /// # Examples . /// . /// ``` -- line 1885 ---------------------------------------- -- line 1900 ---------------------------------------- . /// let mut v = Vec::new(); . /// assert!(v.is_empty()); . /// . /// v.push(1); . /// assert!(!v.is_empty()); . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . pub fn is_empty(&self) -> bool { 489,267 ( 0.02%) self.len() == 0 . } . . /// Splits the collection into two at the given index. . /// . /// Returns a newly allocated vector containing the elements in the range . /// `[at, len)`. After the call, the original vector will be left containing . /// the elements `[0, at)` with its previous capacity unchanged. . /// -- line 1916 ---------------------------------------- -- line 1935 ---------------------------------------- . A: Clone, . { . #[cold] . #[inline(never)] . fn assert_failed(at: usize, len: usize) -> ! { . panic!("`at` split index (is {}) should be <= len (is {})", at, len); . } . 2,002 ( 0.00%) if at > self.len() { . assert_failed(at, self.len()); . } . 1,640 ( 0.00%) if at == 0 { . // the new vector can take over the original buffer and avoid the copy . return mem::replace( . self, . Vec::with_capacity_in(self.capacity(), self.allocator().clone()), . ); . } . 4 ( 0.00%) let other_len = self.len - at; . let mut other = Vec::with_capacity_in(other_len, self.allocator().clone()); . . // Unsafely `set_len` and copy items to `other`. . unsafe { . self.set_len(at); . other.set_len(other_len); . . ptr::copy_nonoverlapping(self.as_ptr().add(at), other.as_mut_ptr(), other.len()); -- line 1963 ---------------------------------------- -- line 1988 ---------------------------------------- . /// . /// let mut vec = vec![]; . /// let mut p = 1; . /// vec.resize_with(4, || { p *= 2; p }); . /// assert_eq!(vec, [2, 4, 8, 16]); . /// ``` . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "vec_resize_with", since = "1.33.0")] 34,487 ( 0.00%) pub fn resize_with(&mut self, new_len: usize, f: F) . where . F: FnMut() -> T, . { 4,639 ( 0.00%) let len = self.len(); 9,278 ( 0.00%) if new_len > len { 32,867 ( 0.00%) self.extend_with(new_len - len, ExtendFunc(f)); . } else { . self.truncate(new_len); . } 29,848 ( 0.00%) } . . /// Consumes and leaks the `Vec`, returning a mutable reference to the contents, . /// `&'a mut [T]`. Note that the type `T` must outlive the chosen lifetime . /// `'a`. If the type has only static references, or none at all, then this . /// may be chosen to be `'static`. . /// . /// As of Rust 1.57, this method does not reallocate or shrink the `Vec`, . /// so the leaked allocation may include unused capacity that is not part -- line 2014 ---------------------------------------- -- line 2070 ---------------------------------------- . #[stable(feature = "vec_spare_capacity", since = "1.60.0")] . #[inline] . pub fn spare_capacity_mut(&mut self) -> &mut [MaybeUninit] { . // Note: . // This method is not implemented in terms of `split_at_spare_mut`, . // to prevent invalidation of pointers to the buffer. . unsafe { . slice::from_raw_parts_mut( 6 ( 0.00%) self.as_mut_ptr().add(self.len) as *mut MaybeUninit, 190 ( 0.00%) self.buf.capacity() - self.len, . ) . } . } . . /// Returns vector content as a slice of `T`, along with the remaining spare . /// capacity of the vector as a slice of `MaybeUninit`. . /// . /// The returned spare capacity slice can be used to fill the vector with data -- line 2087 ---------------------------------------- -- line 2189 ---------------------------------------- . /// assert_eq!(vec, ["hello", "world", "world"]); . /// . /// let mut vec = vec![1, 2, 3, 4]; . /// vec.resize(2, 0); . /// assert_eq!(vec, [1, 2]); . /// ``` . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "vec_resize", since = "1.5.0")] 9,560 ( 0.00%) pub fn resize(&mut self, new_len: usize, value: T) { 956 ( 0.00%) let len = self.len(); . 2,868 ( 0.00%) if new_len > len { 5,913 ( 0.00%) self.extend_with(new_len - len, ExtendElement(value)) . } else { . self.truncate(new_len); . } 1,156 ( 0.00%) } . . /// Clones and appends all elements in a slice to the `Vec`. . /// . /// Iterates over the slice `other`, clones each element, and then appends . /// it to this `Vec`. The `other` slice is traversed in-order. . /// . /// Note that this function is same as [`extend`] except that it is . /// specialized to work with slices instead. If and when Rust gets -- line 2213 ---------------------------------------- -- line 2271 ---------------------------------------- . trait ExtendWith { . fn next(&mut self) -> T; . fn last(self) -> T; . } . . struct ExtendElement(T); . impl ExtendWith for ExtendElement { . fn next(&mut self) -> T { 176 ( 0.00%) self.0.clone() . } . fn last(self) -> T { . self.0 . } . } . . struct ExtendFunc(F); . impl T> ExtendWith for ExtendFunc { -- line 2287 ---------------------------------------- -- line 2291 ---------------------------------------- . fn last(mut self) -> T { . (self.0)() . } . } . . impl Vec { . #[cfg(not(no_global_oom_handling))] . /// Extend the vector by `n` values, using the given generator. 253,307 ( 0.01%) fn extend_with>(&mut self, n: usize, mut value: E) { . self.reserve(n); . . unsafe { 6,738 ( 0.00%) let mut ptr = self.as_mut_ptr().add(self.len()); . // Use SetLenOnDrop to work around bug where compiler . // might not realize the store through `ptr` through self.set_len() . // don't alias. . let mut local_len = SetLenOnDrop::new(&mut self.len); . . // Write all elements except the last one . for _ in 1..n { . ptr::write(ptr, value.next()); . ptr = ptr.offset(1); . // Increment the length in every step in case next() panics . local_len.increment_len(1); . } . 280,209 ( 0.01%) if n > 0 { . // We can write the last element directly without cloning needlessly . ptr::write(ptr, value.last()); . local_len.increment_len(1); . } . . // len set by scope guard . } 195,259 ( 0.01%) } . } . . impl Vec { . /// Removes consecutive repeated elements in the vector according to the . /// [`PartialEq`] trait implementation. . /// . /// If the vector is sorted, this removes all duplicates. . /// -- line 2333 ---------------------------------------- -- line 2338 ---------------------------------------- . /// . /// vec.dedup(); . /// . /// assert_eq!(vec, [1, 2, 3, 2]); . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . #[inline] . pub fn dedup(&mut self) { 5,468 ( 0.00%) self.dedup_by(|a, b| a == b) . } . } . . //////////////////////////////////////////////////////////////////////////////// . // Internal methods and functions . //////////////////////////////////////////////////////////////////////////////// . . #[doc(hidden)] . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "rust1", since = "1.0.0")] 53,524 ( 0.00%) pub fn from_elem(elem: T, n: usize) -> Vec { 295,407 ( 0.01%) ::from_elem(elem, n, Global) 65,343 ( 0.00%) } . . #[doc(hidden)] . #[cfg(not(no_global_oom_handling))] . #[unstable(feature = "allocator_api", issue = "32838")] . pub fn from_elem_in(elem: T, n: usize, alloc: A) -> Vec { . ::from_elem(elem, n, alloc) . } . -- line 2367 ---------------------------------------- -- line 2424 ---------------------------------------- . // Common trait implementations for Vec . //////////////////////////////////////////////////////////////////////////////// . . #[stable(feature = "rust1", since = "1.0.0")] . impl ops::Deref for Vec { . type Target = [T]; . . fn deref(&self) -> &[T] { 6,492,311 ( 0.32%) unsafe { slice::from_raw_parts(self.as_ptr(), self.len) } 323 ( 0.00%) } . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl ops::DerefMut for Vec { . fn deref_mut(&mut self) -> &mut [T] { 1,683,125 ( 0.08%) unsafe { slice::from_raw_parts_mut(self.as_mut_ptr(), self.len) } . } . } . . #[cfg(not(no_global_oom_handling))] . trait SpecCloneFrom { . fn clone_from(this: &mut Self, other: &Self); . } . -- line 2447 ---------------------------------------- -- line 2468 ---------------------------------------- . this.extend_from_slice(other); . } . } . . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "rust1", since = "1.0.0")] . impl Clone for Vec { . #[cfg(not(test))] 309,945 ( 0.02%) fn clone(&self) -> Self { . let alloc = self.allocator().clone(); 2 ( 0.00%) <[T]>::to_vec_in(&**self, alloc) 387,079 ( 0.02%) } . . // HACK(japaric): with cfg(test) the inherent `[T]::to_vec` method, which is . // required for this method definition, is not available. Instead use the . // `slice::to_vec` function which is only available with cfg(test) . // NB see the slice::hack module in slice.rs for more information . #[cfg(test)] . fn clone(&self) -> Self { . let alloc = self.allocator().clone(); -- line 2487 ---------------------------------------- -- line 2518 ---------------------------------------- . message = "vector indices are of type `usize` or ranges of `usize`", . label = "vector indices are of type `usize` or ranges of `usize`" . )] . impl, A: Allocator> Index for Vec { . type Output = I::Output; . . #[inline] . fn index(&self, index: I) -> &Self::Output { 218,181 ( 0.01%) Index::index(&**self, index) . } . } . . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_on_unimplemented( . message = "vector indices are of type `usize` or ranges of `usize`", . label = "vector indices are of type `usize` or ranges of `usize`" . )] . impl, A: Allocator> IndexMut for Vec { . #[inline] . fn index_mut(&mut self, index: I) -> &mut Self::Output { 1,132 ( 0.00%) IndexMut::index_mut(&mut **self, index) . } . } . . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "rust1", since = "1.0.0")] . impl FromIterator for Vec { . #[inline] . fn from_iter>(iter: I) -> Vec { 1,751,894 ( 0.09%) >::from_iter(iter.into_iter()) . } . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl IntoIterator for Vec { . type Item = T; . type IntoIter = IntoIter; . -- line 2555 ---------------------------------------- -- line 2564 ---------------------------------------- . /// for s in v.into_iter() { . /// // s has type String, not &String . /// println!("{}", s); . /// } . /// ``` . #[inline] . fn into_iter(self) -> IntoIter { . unsafe { 716,427 ( 0.04%) let mut me = ManuallyDrop::new(self); . let alloc = ptr::read(me.allocator()); . let begin = me.as_mut_ptr(); . let end = if mem::size_of::() == 0 { . arith_offset(begin as *const i8, me.len() as isize) as *const T . } else { . begin.add(me.len()) as *const T . }; . let cap = me.buf.capacity(); 278,485 ( 0.01%) IntoIter { . buf: NonNull::new_unchecked(begin), . phantom: PhantomData, . cap, . alloc, . ptr: begin, . end, . } . } -- line 2589 ---------------------------------------- -- line 2591 ---------------------------------------- . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl<'a, T, A: Allocator> IntoIterator for &'a Vec { . type Item = &'a T; . type IntoIter = slice::Iter<'a, T>; . . fn into_iter(self) -> slice::Iter<'a, T> { 7,338 ( 0.00%) self.iter() . } . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl<'a, T, A: Allocator> IntoIterator for &'a mut Vec { . type Item = &'a mut T; . type IntoIter = slice::IterMut<'a, T>; . . fn into_iter(self) -> slice::IterMut<'a, T> { 2,494 ( 0.00%) self.iter_mut() . } . } . . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "rust1", since = "1.0.0")] . impl Extend for Vec { . #[inline] 4,136 ( 0.00%) fn extend>(&mut self, iter: I) { 857,472 ( 0.04%) >::spec_extend(self, iter.into_iter()) 4,136 ( 0.00%) } . . #[inline] . fn extend_one(&mut self, item: T) { 540 ( 0.00%) self.push(item); . } . . #[inline] . fn extend_reserve(&mut self, additional: usize) { . self.reserve(additional); . } . } . -- line 2631 ---------------------------------------- -- line 2636 ---------------------------------------- . fn extend_desugared>(&mut self, mut iterator: I) { . // This is the case for a general iterator. . // . // This function should be the moral equivalent of: . // . // for item in iterator { . // self.push(item); . // } 172,854 ( 0.01%) while let Some(element) = iterator.next() { 31,055 ( 0.00%) let len = self.len(); 368,377 ( 0.02%) if len == self.capacity() { 889 ( 0.00%) let (lower, _) = iterator.size_hint(); . self.reserve(lower.saturating_add(1)); . } . unsafe { . ptr::write(self.as_mut_ptr().add(len), element); . // Since next() executes user code which can panic we have to bump the length . // after each step. . // NB can't overflow since we would have had to alloc the address space 267,265 ( 0.01%) self.set_len(len + 1); . } . } 3,043 ( 0.00%) } . . /// Creates a splicing iterator that replaces the specified range in the vector . /// with the given `replace_with` iterator and yields the removed items. . /// `replace_with` does not need to be the same length as `range`. . /// . /// `range` is removed even if the iterator is not consumed until the end. . /// . /// It is unspecified how many elements are removed from the vector -- line 2666 ---------------------------------------- -- line 2693 ---------------------------------------- . #[cfg(not(no_global_oom_handling))] . #[inline] . #[stable(feature = "vec_splice", since = "1.21.0")] . pub fn splice(&mut self, range: R, replace_with: I) -> Splice<'_, I::IntoIter, A> . where . R: RangeBounds, . I: IntoIterator, . { 753 ( 0.00%) Splice { drain: self.drain(range), replace_with: replace_with.into_iter() } . } . . /// Creates an iterator which uses a closure to determine if an element should be removed. . /// . /// If the closure returns true, then the element is removed and yielded. . /// If the closure returns false, the element will remain in the vector and will not be yielded . /// by the iterator. . /// -- line 2709 ---------------------------------------- -- line 2745 ---------------------------------------- . /// assert_eq!(evens, vec![2, 4, 6, 8, 14]); . /// assert_eq!(odds, vec![1, 3, 5, 9, 11, 13, 15]); . /// ``` . #[unstable(feature = "drain_filter", reason = "recently added", issue = "43244")] . pub fn drain_filter(&mut self, filter: F) -> DrainFilter<'_, T, F, A> . where . F: FnMut(&mut T) -> bool, . { 3,512 ( 0.00%) let old_len = self.len(); . . // Guard against us getting leaked (leak amplification) . unsafe { . self.set_len(0); . } . 13,048 ( 0.00%) DrainFilter { vec: self, idx: 0, del: 0, old_len, pred: filter, panic_flag: false } . } . } . . /// Extend implementation that copies elements out of references before pushing them onto the Vec. . /// . /// This implementation is specialized for slice iterators, where it uses [`copy_from_slice`] to . /// append the entire slice at once. . /// -- line 2768 ---------------------------------------- -- line 2803 ---------------------------------------- . #[inline] . fn cmp(&self, other: &Self) -> Ordering { . Ord::cmp(&**self, &**other) . } . } . . #[stable(feature = "rust1", since = "1.0.0")] . unsafe impl<#[may_dangle] T, A: Allocator> Drop for Vec { 973,832 ( 0.05%) fn drop(&mut self) { . unsafe { . // use drop for [T] . // use a raw slice to refer to the elements of the vector as weakest necessary type; . // could avoid questions of validity in certain cases 414,693 ( 0.02%) ptr::drop_in_place(ptr::slice_from_raw_parts_mut(self.as_mut_ptr(), self.len)) . } . // RawVec handles deallocation 1,147,766 ( 0.06%) } . } . . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_default_impls", issue = "87864")] . impl const Default for Vec { . /// Creates an empty `Vec`. . fn default() -> Vec { . Vec::new() -- line 2827 ---------------------------------------- -- line 2976 ---------------------------------------- . /// newly-allocated buffer with exactly the right capacity. . /// . /// # Examples . /// . /// ``` . /// assert_eq!(Box::from(vec![1, 2, 3]), vec![1, 2, 3].into_boxed_slice()); . /// ``` . fn from(v: Vec) -> Self { 4 ( 0.00%) v.into_boxed_slice() . } . } . . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "rust1", since = "1.0.0")] . impl From<&str> for Vec { . /// Allocate a `Vec` and fill it with a UTF-8 string. . /// -- line 2992 ---------------------------------------- 1,877,179 ( 0.09%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_parse/src/lexer/tokentrees.rs -------------------------------------------------------------------------------- Ir -- line 8 ---------------------------------------- . }; . use rustc_ast_pretty::pprust::token_to_string; . use rustc_data_structures::fx::FxHashMap; . use rustc_errors::PResult; . use rustc_span::Span; . . impl<'a> StringReader<'a> { . pub(super) fn into_token_trees(self) -> (PResult<'a, TokenStream>, Vec) { 399 ( 0.00%) let mut tt_reader = TokenTreesReader { . string_reader: self, 21 ( 0.00%) token: Token::dummy(), . open_braces: Vec::new(), . unmatched_braces: Vec::new(), . matching_delim_spans: Vec::new(), . last_unclosed_found_span: None, . last_delim_empty_block_spans: FxHashMap::default(), . matching_block_spans: Vec::new(), . }; 21 ( 0.00%) let res = tt_reader.parse_all_token_trees(); 126 ( 0.00%) (res, tt_reader.unmatched_braces) . } . } . . struct TokenTreesReader<'a> { . string_reader: StringReader<'a>, . token: Token, . /// Stack of open delimiters and their spans. Used for error message. . open_braces: Vec<(token::DelimToken, Span)>, -- line 35 ---------------------------------------- -- line 43 ---------------------------------------- . last_delim_empty_block_spans: FxHashMap, . /// Collect the spans of braces (Open, Close). Used only . /// for detecting if blocks are empty and only braces. . matching_block_spans: Vec<(Span, Span)>, . } . . impl<'a> TokenTreesReader<'a> { . // Parse a stream of tokens into a list of `TokenTree`s, up to an `Eof`. 168 ( 0.00%) fn parse_all_token_trees(&mut self) -> PResult<'a, TokenStream> { . let mut buf = TokenStreamBuilder::default(); . . self.bump(); 7,092 ( 0.00%) while self.token != token::Eof { 28,200 ( 0.00%) buf.push(self.parse_token_tree()?); . } . . Ok(buf.into_token_stream()) 189 ( 0.00%) } . . // Parse a stream of tokens into a list of `TokenTree`s, up to a `CloseDelim`. . fn parse_token_trees_until_close_delim(&mut self) -> TokenStream { . let mut buf = TokenStreamBuilder::default(); . loop { 87,708 ( 0.00%) if let token::CloseDelim(..) = self.token.kind { . return buf.into_token_stream(); . } . 189,635 ( 0.01%) match self.parse_token_tree() { 341,343 ( 0.02%) Ok(tree) => buf.push(tree), . Err(mut e) => { . e.emit(); . return buf.into_token_stream(); . } . } . } . } . 373,068 ( 0.02%) fn parse_token_tree(&mut self) -> PResult<'a, TreeAndSpacing> { 82,904 ( 0.00%) let sm = self.string_reader.sess.source_map(); . 349,360 ( 0.02%) match self.token.kind { . token::Eof => { . let msg = "this file contains an unclosed delimiter"; . let mut err = . self.string_reader.sess.span_diagnostic.struct_span_err(self.token.span, msg); . for &(_, sp) in &self.open_braces { . err.span_label(sp, "unclosed delimiter"); . self.unmatched_braces.push(UnmatchedBrace { . expected_delim: token::DelimToken::Brace, -- line 91 ---------------------------------------- -- line 113 ---------------------------------------- . err.span_label( . *close_sp, . "...as it matches this but it has different indentation", . ); . } . } . Err(err) . } 5,927 ( 0.00%) token::OpenDelim(delim) => { . // The span for beginning of the delimited section 5,927 ( 0.00%) let pre_span = self.token.span; . . // Parse the open delimiter. 41,489 ( 0.00%) self.open_braces.push((delim, self.token.span)); . self.bump(); . . // Parse the token trees within the delimiters. . // We stop at any delimiter so we can try to recover if the user . // uses an incorrect delimiter. 5,927 ( 0.00%) let tts = self.parse_token_trees_until_close_delim(); . . // Expand to cover the entire delimited token tree 29,635 ( 0.00%) let delim_span = DelimSpan::from_pair(pre_span, self.token.span); . 11,854 ( 0.00%) match self.token.kind { . // Correct delimiter. 11,854 ( 0.00%) token::CloseDelim(d) if d == delim => { . let (open_brace, open_brace_span) = self.open_braces.pop().unwrap(); 11,854 ( 0.00%) let close_brace_span = self.token.span; . 17,781 ( 0.00%) if tts.is_empty() { 3,195 ( 0.00%) let empty_block_span = open_brace_span.to(close_brace_span); 4,260 ( 0.00%) if !sm.is_multiline(empty_block_span) { . // Only track if the block is in the form of `{}`, otherwise it is . // likely that it was written on purpose. . self.last_delim_empty_block_spans.insert(delim, empty_block_span); . } . } . . //only add braces 23,708 ( 0.00%) if let (DelimToken::Brace, DelimToken::Brace) = (open_brace, delim) { . self.matching_block_spans.push((open_brace_span, close_brace_span)); . } . 5,927 ( 0.00%) if self.open_braces.is_empty() { . // Clear up these spans to avoid suggesting them as we've found . // properly matched delimiters so far for an entire block. . self.matching_delim_spans.clear(); . } else { . self.matching_delim_spans.push(( . open_brace, . open_brace_span, . close_brace_span, -- line 165 ---------------------------------------- -- line 218 ---------------------------------------- . token::Eof => { . // Silently recover, the EOF token will be seen again . // and an error emitted then. Thus we don't pop from . // self.open_braces here. . } . _ => {} . } . 41,489 ( 0.00%) Ok(TokenTree::Delimited(delim_span, delim, tts).into()) . } . token::CloseDelim(delim) => { . // An unexpected closing delimiter (i.e., there is no . // matching opening delimiter). . let token_str = token_to_string(&self.token); . let msg = format!("unexpected closing delimiter: `{}`", token_str); . let mut err = . self.string_reader.sess.span_diagnostic.struct_span_err(self.token.span, &msg); -- line 234 ---------------------------------------- -- line 253 ---------------------------------------- . err.span_label(parent.1, "...matches this closing brace"); . } . } . . err.span_label(self.token.span, "unexpected closing delimiter"); . Err(err) . } . _ => { 177,625 ( 0.01%) let tt = TokenTree::Token(self.token.take()); . let mut spacing = self.bump(); 71,050 ( 0.00%) if !self.token.is_op() { . spacing = Alone; . } 213,150 ( 0.01%) Ok((tt, spacing)) . } . } 331,616 ( 0.02%) } . . fn bump(&mut self) -> Spacing { 396,902 ( 0.02%) let (spacing, token) = self.string_reader.next_token(); 207,449 ( 0.01%) self.token = token; . spacing . } . } . 5,927 ( 0.00%) #[derive(Default)] . struct TokenStreamBuilder { . buf: Vec, . } . . impl TokenStreamBuilder { 538,876 ( 0.03%) fn push(&mut self, (tree, joint): TreeAndSpacing) { 258,233 ( 0.01%) if let Some((TokenTree::Token(prev_token), Joint)) = self.buf.last() { 21,224 ( 0.00%) if let TokenTree::Token(token) = &tree { 43,288 ( 0.00%) if let Some(glued) = prev_token.glue(token) { . self.buf.pop(); 34,356 ( 0.00%) self.buf.push((TokenTree::Token(glued), joint)); . return; . } . } . } 192,945 ( 0.01%) self.buf.push((tree, joint)) 331,616 ( 0.02%) } . . fn into_token_stream(self) -> TokenStream { 59,459 ( 0.00%) TokenStream::new(self.buf) . } . } 147,493 ( 0.01%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_expand/src/mbe/macro_parser.rs -------------------------------------------------------------------------------- Ir -- line 90 ---------------------------------------- . use std::collections::hash_map::Entry::{Occupied, Vacant}; . use std::mem; . use std::ops::{Deref, DerefMut}; . . // To avoid costly uniqueness checks, we require that `MatchSeq` always has a nonempty body. . . /// Either a sequence of token trees or a single one. This is used as the representation of the . /// sequence of tokens that make up a matcher. 29,526 ( 0.00%) #[derive(Clone)] . enum TokenTreeOrTokenTreeSlice<'tt> { 24 ( 0.00%) Tt(TokenTree), 6,543 ( 0.00%) TtSeq(&'tt [TokenTree]), . } . . impl<'tt> TokenTreeOrTokenTreeSlice<'tt> { . /// Returns the number of constituent top-level token trees of `self` (top-level in that it . /// will not recursively descend into subtrees). . fn len(&self) -> usize { 128,909 ( 0.01%) match *self { 22,678 ( 0.00%) TtSeq(ref v) => v.len(), . Tt(ref tt) => tt.len(), . } . } . . /// The `index`-th token tree of `self`. . fn get_tt(&self, index: usize) -> TokenTree { 13,686 ( 0.00%) match *self { 42,276 ( 0.00%) TtSeq(ref v) => v[index].clone(), 38,987 ( 0.00%) Tt(ref tt) => tt.get_tt(index), . } . } . } . . /// An unzipping of `TokenTree`s... see the `stack` field of `MatcherPos`. . /// . /// This is used by `inner_parse_loop` to keep track of delimited submatchers that we have . /// descended into. 3,510 ( 0.00%) #[derive(Clone)] . struct MatcherTtFrame<'tt> { . /// The "parent" matcher that we are descending into. . elts: TokenTreeOrTokenTreeSlice<'tt>, . /// The position of the "dot" in `elts` at the time we descended. 1,755 ( 0.00%) idx: usize, . } . . type NamedMatchVec = SmallVec<[NamedMatch; 4]>; . . /// Represents a single "position" (aka "matcher position", aka "item"), as . /// described in the module documentation. . /// . /// Here: -- line 140 ---------------------------------------- -- line 147 ---------------------------------------- . /// position refers to. . /// . /// It is important to distinguish these two lifetimes because we have a . /// `SmallVec>` below, and the destructor of . /// that is considered to possibly access the data from its elements (it lacks . /// a `#[may_dangle]` attribute). As a result, the compiler needs to know that . /// all the elements in that `SmallVec` strictly outlive the root stack slot . /// lifetime. By separating `'tt` from `'root`, we can show that. 152,609 ( 0.01%) #[derive(Clone)] . struct MatcherPos<'root, 'tt> { . /// The token or sequence of tokens that make up the matcher . top_elts: TokenTreeOrTokenTreeSlice<'tt>, . . /// The position of the "dot" in this matcher 3,247 ( 0.00%) idx: usize, . . /// For each named metavar in the matcher, we keep track of token trees matched against the . /// metavar by the black box parser. In particular, there may be more than one match per . /// metavar if we are in a repetition (each repetition matches each of the variables). . /// Moreover, matchers and repetitions can be nested; the `matches` field is shared (hence the . /// `Rc`) among all "nested" matchers. `match_lo`, `match_cur`, and `match_hi` keep track of . /// the current position of the `self` matcher position in the shared `matches` list. . /// . /// Also, note that while we are descending into a sequence, matchers are given their own . /// `matches` vector. Only once we reach the end of a full repetition of the sequence do we add . /// all bound matches from the submatcher into the shared top-level `matches` vector. If `sep` . /// and `up` are `Some`, then `matches` is _not_ the shared top-level list. Instead, if one . /// wants the shared `matches`, one should use `up.matches`. 12,988 ( 0.00%) matches: Box<[Lrc]>, . /// The position in `matches` corresponding to the first metavar in this matcher's sequence of . /// token trees. In other words, the first metavar in the first token of `top_elts` corresponds . /// to `matches[match_lo]`. 3,247 ( 0.00%) match_lo: usize, . /// The position in `matches` corresponding to the metavar we are currently trying to match . /// against the source token stream. `match_lo <= match_cur <= match_hi`. . match_cur: usize, . /// Similar to `match_lo` except `match_hi` is the position in `matches` of the _last_ metavar . /// in this matcher. 3,247 ( 0.00%) match_hi: usize, . . // The following fields are used if we are matching a repetition. If we aren't, they should be . // `None`. . /// The KleeneOp of this sequence if we are in a repetition. 3,247 ( 0.00%) seq_op: Option, . . /// The separator if we are in a repetition. . sep: Option, . . /// The "parent" matcher position if we are in a repetition. That is, the matcher position just . /// before we enter the sequence. 6,494 ( 0.00%) up: Option>, . . /// Specifically used to "unzip" token trees. By "unzip", we mean to unwrap the delimiters from . /// a delimited token tree (e.g., something wrapped in `(` `)`) or to get the contents of a doc . /// comment... . /// . /// When matching against matchers with nested delimited submatchers (e.g., `pat ( pat ( .. ) . /// pat ) pat`), we need to keep track of the matchers we are descending into. This stack does . /// that where the bottom of the stack is the outermost matcher. . /// Also, throughout the comments, this "descent" is often referred to as "unzipping"... . stack: SmallVec<[MatcherTtFrame<'tt>; 1]>, . } . . impl<'root, 'tt> MatcherPos<'root, 'tt> { . /// Adds `m` as a named match for the `idx`-th metavar. . fn push_match(&mut self, idx: usize, m: NamedMatch) { 24,072 ( 0.00%) let matches = Lrc::make_mut(&mut self.matches[idx]); . matches.push(m); . } . } . . // Lots of MatcherPos instances are created at runtime. Allocating them on the . // heap is slow. Furthermore, using SmallVec to allocate them all . // on the stack is also slow, because MatcherPos is quite a large type and . // instances get moved around a lot between vectors, which requires lots of -- line 221 ---------------------------------------- -- line 226 ---------------------------------------- . // and this type is used to encapsulate both cases. . enum MatcherPosHandle<'root, 'tt> { . Ref(&'root mut MatcherPos<'root, 'tt>), . Box(Box>), . } . . impl<'root, 'tt> Clone for MatcherPosHandle<'root, 'tt> { . // This always produces a new Box. 12,988 ( 0.00%) fn clone(&self) -> Self { 6,494 ( 0.00%) MatcherPosHandle::Box(match *self { 3,057 ( 0.00%) MatcherPosHandle::Ref(ref r) => Box::new((**r).clone()), . MatcherPosHandle::Box(ref b) => b.clone(), . }) 19,482 ( 0.00%) } . } . . impl<'root, 'tt> Deref for MatcherPosHandle<'root, 'tt> { . type Target = MatcherPos<'root, 'tt>; . fn deref(&self) -> &Self::Target { . match *self { . MatcherPosHandle::Ref(ref r) => r, . MatcherPosHandle::Box(ref b) => b, -- line 247 ---------------------------------------- -- line 272 ---------------------------------------- . . /// A `ParseResult` where the `Success` variant contains a mapping of . /// `MacroRulesNormalizedIdent`s to `NamedMatch`es. This represents the mapping . /// of metavars to the token trees they bind to. . crate type NamedParseResult = ParseResult>; . . /// Count how many metavars are named in the given matcher `ms`. . pub(super) fn count_names(ms: &[TokenTree]) -> usize { 237,268 ( 0.01%) ms.iter().fold(0, |count, elt| { 118,634 ( 0.01%) count 355,902 ( 0.02%) + match *elt { 30,260 ( 0.00%) TokenTree::Sequence(_, ref seq) => seq.num_captures, 17,295 ( 0.00%) TokenTree::Delimited(_, ref delim) => count_names(&delim.tts), . TokenTree::MetaVar(..) => 0, . TokenTree::MetaVarDecl(..) => 1, . TokenTree::Token(..) => 0, . } 296,585 ( 0.01%) }) . } . . /// `len` `Vec`s (initially shared and empty) that will store matches of metavars. . fn create_matches(len: usize) -> Box<[Lrc]> { 15,602 ( 0.00%) if len == 0 { . vec![] . } else { . let empty_matches = Lrc::new(SmallVec::new()); . vec![empty_matches; len] . } . .into_boxed_slice() . } . . /// Generates the top-level matcher position in which the "dot" is before the first token of the . /// matcher `ms`. . fn initial_matcher_pos<'root, 'tt>(ms: &'tt [TokenTree]) -> MatcherPos<'root, 'tt> { . let match_idx_hi = count_names(ms); . let matches = create_matches(match_idx_hi); 65,910 ( 0.00%) MatcherPos { . // Start with the top level matcher given to us . top_elts: TtSeq(ms), // "elts" is an abbr. for "elements" . // The "dot" is before the first token of the matcher . idx: 0, . . // Initialize `matches` to a bunch of empty `Vec`s -- one for each metavar in `top_elts`. . // `match_lo` for `top_elts` is 0 and `match_hi` is `matches.len()`. `match_cur` is 0 since . // we haven't actually matched anything yet. -- line 316 ---------------------------------------- -- line 340 ---------------------------------------- . /// particular token tree. . /// . /// The width of each `MatchedSeq` in the `NamedMatch`, and the identity of . /// the `MatchedNonterminal`s, will depend on the token tree it was applied . /// to: each `MatchedSeq` corresponds to a single `TTSeq` in the originating . /// token tree. The depth of the `NamedMatch` structure will therefore depend . /// only on the nesting depth of `ast::TTSeq`s in the originating . /// token tree it was derived from. 1,436 ( 0.00%) #[derive(Debug, Clone)] . crate enum NamedMatch { . MatchedSeq(Lrc), . MatchedNonterminal(Lrc), . } . . /// Takes a sequence of token trees `ms` representing a matcher which successfully matched input . /// and an iterator of items that matched input and produces a `NamedParseResult`. . fn nameize>( -- line 356 ---------------------------------------- -- line 357 ---------------------------------------- . sess: &ParseSess, . ms: &[TokenTree], . mut res: I, . ) -> NamedParseResult { . // Recursively descend into each type of matcher (e.g., sequences, delimited, metavars) and make . // sure that each metavar has _exactly one_ binding. If a metavar does not have exactly one . // binding, then there is an error. If it does, then we insert the binding into the . // `NamedParseResult`. 44,011 ( 0.00%) fn n_rec>( . sess: &ParseSess, . m: &TokenTree, . res: &mut I, . ret_val: &mut FxHashMap, . ) -> Result<(), (rustc_span::Span, String)> { 22,561 ( 0.00%) match *m { . TokenTree::Sequence(_, ref seq) => { 925 ( 0.00%) for next_m in &seq.tts { 8,634 ( 0.00%) n_rec(sess, next_m, res.by_ref(), ret_val)? . } . } . TokenTree::Delimited(_, ref delim) => { 621 ( 0.00%) for next_m in &delim.tts { 4,650 ( 0.00%) n_rec(sess, next_m, res.by_ref(), ret_val)?; . } . } . TokenTree::MetaVarDecl(span, _, None) => { . if sess.missing_fragment_specifiers.borrow_mut().remove(&span).is_some() { . return Err((span, "missing fragment specifier".to_string())); . } . } 7,668 ( 0.00%) TokenTree::MetaVarDecl(sp, bind_name, _) => match ret_val 5,112 ( 0.00%) .entry(MacroRulesNormalizedIdent::new(bind_name)) . { . Vacant(spot) => { . spot.insert(res.next().unwrap()); . } . Occupied(..) => return Err((sp, format!("duplicated bind name: {}", bind_name))), . }, . TokenTree::MetaVar(..) | TokenTree::Token(..) => (), . } . 4,001 ( 0.00%) Ok(()) 32,008 ( 0.00%) } . . let mut ret_val = FxHashMap::default(); . for m in ms { 16,071 ( 0.00%) match n_rec(sess, m, res.by_ref(), &mut ret_val) { . Ok(_) => {} . Err((sp, msg)) => return Error(sp, msg), . } . } . 3,744 ( 0.00%) Success(ret_val) . } . . /// Performs a token equality check, ignoring syntax context (that is, an unhygienic comparison) . fn token_name_eq(t1: &Token, t2: &Token) -> bool { 69,365 ( 0.00%) if let (Some((ident1, is_raw1)), Some((ident2, is_raw2))) = (t1.ident(), t2.ident()) { 4,101 ( 0.00%) ident1.name == ident2.name && is_raw1 == is_raw2 62,286 ( 0.00%) } else if let (Some(ident1), Some(ident2)) = (t1.lifetime(), t2.lifetime()) { . ident1.name == ident2.name . } else { 26,467 ( 0.00%) t1.kind == t2.kind . } . } . . /// Process the matcher positions of `cur_items` until it is empty. In the process, this will . /// produce more items in `next_items`, `eof_items`, and `bb_items`. . /// . /// For more info about the how this happens, see the module-level doc comments and the inline . /// comments of this function. -- line 427 ---------------------------------------- -- line 443 ---------------------------------------- . sess: &ParseSess, . cur_items: &mut SmallVec<[MatcherPosHandle<'root, 'tt>; 1]>, . next_items: &mut Vec>, . eof_items: &mut SmallVec<[MatcherPosHandle<'root, 'tt>; 1]>, . bb_items: &mut SmallVec<[MatcherPosHandle<'root, 'tt>; 1]>, . token: &Token, . ) -> ParseResult<()> { . // Pop items from `cur_items` until it is empty. 85,556 ( 0.00%) while let Some(mut item) = cur_items.pop() { . // When unzipped trees end, remove them. This corresponds to backtracking out of a . // delimited submatcher into which we already descended. In backtracking out again, we need . // to advance the "dot" past the delimiters in the outer matcher. 266,680 ( 0.01%) while item.idx >= item.top_elts.len() { 2,018 ( 0.00%) match item.stack.pop() { . Some(MatcherTtFrame { elts, idx }) => { 9,081 ( 0.00%) item.top_elts = elts; 4,036 ( 0.00%) item.idx = idx + 1; . } . None => break, . } . } . . // Get the current position of the "dot" (`idx`) in `item` and the number of token trees in . // the matcher (`len`). . let idx = item.idx; . let len = item.top_elts.len(); . . // If `idx >= len`, then we are at or past the end of the matcher of `item`. 54,894 ( 0.00%) if idx >= len { . // We are repeating iff there is a parent. If the matcher is inside of a repetition, . // then we could be at the end of a sequence or at the beginning of the next . // repetition. 3,335 ( 0.00%) if item.up.is_some() { . // At this point, regardless of whether there is a separator, we should add all . // matches from the complete repetition of the sequence to the shared, top-level . // `matches` list (actually, `up.matches`, which could itself not be the top-level, . // but anyway...). Moreover, we add another item to `cur_items` in which the "dot" . // is at the end of the `up` matcher. This ensures that the "dot" in the `up` . // matcher is also advanced sufficiently. . // . // NOTE: removing the condition `idx == len` allows trailing separators. 4,112 ( 0.00%) if idx == len { . // Get the `up` matcher . let mut new_pos = item.up.clone().unwrap(); . . // Add matches from this repetition to the `matches` of `up` 3,788 ( 0.00%) for idx in item.match_lo..item.match_hi { 10,770 ( 0.00%) let sub = item.matches[idx].clone(); 6,462 ( 0.00%) new_pos.push_match(idx, MatchedSeq(sub)); . } . . // Move the "dot" past the repetition in `up` 3,642 ( 0.00%) new_pos.match_cur = item.match_hi; 11,364 ( 0.00%) new_pos.idx += 1; . cur_items.push(new_pos); . } . . // Check if we need a separator. 1,894 ( 0.00%) if idx == len && item.sep.is_some() { . // We have a separator, and it is the current token. We can advance past the . // separator token. 454 ( 0.00%) if item.sep.as_ref().map_or(false, |sep| token_name_eq(token, sep)) { 1,134 ( 0.00%) item.idx += 1; . next_items.push(item); . } . } . // We don't need a separator. Move the "dot" back to the beginning of the matcher . // and try to match again UNLESS we are only allowed to have _one_ repetition. 1,829 ( 0.00%) else if item.seq_op != Some(mbe::KleeneOp::ZeroOrOne) { 3,456 ( 0.00%) item.match_cur = item.match_lo; 6,912 ( 0.00%) item.idx = 0; . cur_items.push(item); . } . } . // If we are not in a repetition, then being at the end of a matcher means that we have . // reached the potential end of the input. . else { . eof_items.push(item); . } . } . // We are in the middle of a matcher. . else { . // Look at what token in the matcher we are trying to match the current token (`token`) . // against. Depending on that, we may generate new items. 98,413 ( 0.00%) match item.top_elts.get_tt(idx) { . // Need to descend into a sequence 6,157 ( 0.00%) TokenTree::Sequence(sp, seq) => { . // Examine the case where there are 0 matches of this sequence. We are . // implicitly disallowing OneOrMore from having 0 matches here. Thus, that will . // result in a "no rules expected token" error by virtue of this matcher not . // working. 2,624 ( 0.00%) if seq.kleene.op == mbe::KleeneOp::ZeroOrMore . || seq.kleene.op == mbe::KleeneOp::ZeroOrOne . { 2,310 ( 0.00%) let mut new_item = item.clone(); 4,620 ( 0.00%) new_item.match_cur += seq.num_captures; 5,775 ( 0.00%) new_item.idx += 1; 6,930 ( 0.00%) for idx in item.match_cur..item.match_cur + seq.num_captures { 3,054 ( 0.00%) new_item.push_match(idx, MatchedSeq(Lrc::new(smallvec![]))); . } . cur_items.push(new_item); . } . 1,312 ( 0.00%) let matches = create_matches(item.matches.len()); 15,744 ( 0.00%) cur_items.push(MatcherPosHandle::Box(Box::new(MatcherPos { 1,312 ( 0.00%) stack: smallvec![], . sep: seq.separator.clone(), 1,312 ( 0.00%) seq_op: Some(seq.kleene.op), . idx: 0, 6,560 ( 0.00%) matches, 2,624 ( 0.00%) match_lo: item.match_cur, . match_cur: item.match_cur, 2,624 ( 0.00%) match_hi: item.match_cur + seq.num_captures, . up: Some(item), 9,184 ( 0.00%) top_elts: Tt(TokenTree::Sequence(sp, seq)), . }))); . } . . // We need to match a metavar (but the identifier is invalid)... this is an error . TokenTree::MetaVarDecl(span, _, None) => { . if sess.missing_fragment_specifiers.borrow_mut().remove(&span).is_some() { . return Error(span, "missing fragment specifier".to_string()); . } -- line 565 ---------------------------------------- -- line 568 ---------------------------------------- . // We need to match a metavar with a valid ident... call out to the black-box . // parser by adding an item to `bb_items`. . TokenTree::MetaVarDecl(_, _, Some(kind)) => { . // Built-in nonterminals never start with these tokens, so we can eliminate . // them from consideration. . // . // We use the span of the metavariable declaration to determine any . // edition-specific matching behavior for non-terminals. 18,460 ( 0.00%) if Parser::nonterminal_may_begin_with(kind, token) { . bb_items.push(item); . } . } . . // We need to descend into a delimited submatcher or a doc comment. To do this, we . // push the current matcher onto a stack and push a new item containing the . // submatcher onto `cur_items`. . // . // At the beginning of the loop, if we reach the end of the delimited submatcher, . // we pop the stack to backtrack out of the descent. 5,490 ( 0.00%) seq @ (TokenTree::Delimited(..) . | TokenTree::Token(Token { kind: DocComment(..), .. })) => { . let lower_elts = mem::replace(&mut item.top_elts, Tt(seq)); 1,098 ( 0.00%) let idx = item.idx; 7,686 ( 0.00%) item.stack.push(MatcherTtFrame { elts: lower_elts, idx }); 4,392 ( 0.00%) item.idx = 0; . cur_items.push(item); . } . . // We just matched a normal token. We can just advance the parser. 51,342 ( 0.00%) TokenTree::Token(t) if token_name_eq(&t, token) => { 47,600 ( 0.00%) item.idx += 1; . next_items.push(item); . } . . // There was another token that was not `token`... This means we can't add any . // rules. NOTE that this is not necessarily an error unless _all_ items in . // `cur_items` end up doing this. There may still be some other matchers that do . // end up working out. . TokenTree::Token(..) | TokenTree::MetaVar(..) => {} . } 96,732 ( 0.00%) } 33,912 ( 0.00%) } . . // Yay a successful parse (so far)! . Success(()) . } . . /// Use the given sequence of token trees (`ms`) as a matcher. Match the token . /// stream from the given `parser` against it and return the match. 43,940 ( 0.00%) pub(super) fn parse_tt( . parser: &mut Cow<'_, Parser<'_>>, . ms: &[TokenTree], . macro_name: Ident, . ) -> NamedParseResult { . // A queue of possible matcher positions. We initialize it with the matcher position in which . // the "dot" is before the first token of the first token tree in `ms`. `inner_parse_loop` then . // processes all of these possible matcher positions and produces possible next positions into . // `next_items`. After some post-processing, the contents of `next_items` replenish `cur_items` . // and we start over again. . // . // This MatcherPos instance is allocated on the stack. All others -- and . // there are frequently *no* others! -- are allocated on the heap. . let mut initial = initial_matcher_pos(ms); 21,970 ( 0.00%) let mut cur_items = smallvec![MatcherPosHandle::Ref(&mut initial)]; . let mut next_items = Vec::new(); . . loop { . // Matcher positions black-box parsed by parser.rs (`parser`) . let mut bb_items = SmallVec::new(); . . // Matcher positions that would be valid if the macro invocation was over now . let mut eof_items = SmallVec::new(); 14,058 ( 0.00%) assert!(next_items.is_empty()); . . // Process `cur_items` until either we have finished the input or we need to get some . // parsing from the black-box parser done. The result is that `next_items` will contain a . // bunch of possible next matcher positions in `next_items`. . match inner_parse_loop( . parser.sess, . &mut cur_items, . &mut next_items, -- line 648 ---------------------------------------- -- line 652 ---------------------------------------- . ) { . Success(_) => {} . Failure(token, msg) => return Failure(token, msg), . Error(sp, msg) => return Error(sp, msg), . ErrorReported => return ErrorReported, . } . . // inner parse loop handled all cur_items, so it's empty 14,058 ( 0.00%) assert!(cur_items.is_empty()); . . // We need to do some post processing after the `inner_parser_loop`. . // . // Error messages here could be improved with links to original rules. . . // If we reached the EOF, check that there is EXACTLY ONE possible matcher. Otherwise, . // either the parse is ambiguous (which should never happen) or there is a syntax error. 70,290 ( 0.00%) if parser.token == token::Eof { 1,682 ( 0.00%) if eof_items.len() == 1 { . let matches = 2,110 ( 0.00%) eof_items[0].matches.iter_mut().map(|dv| Lrc::make_mut(dv).pop().unwrap()); 1,248 ( 0.00%) return nameize(parser.sess, ms, matches); . } else if eof_items.len() > 1 { . return Error( . parser.token.span, . "ambiguity: multiple successful parses".to_string(), . ); . } else { 81 ( 0.00%) return Failure( 27 ( 0.00%) Token::new( . token::Eof, 36 ( 0.00%) if parser.token.span.is_dummy() { . parser.token.span . } else { . parser.token.span.shrink_to_hi() . }, . ), . "missing tokens in macro arguments", . ); . } . } . // Performance hack: eof_items may share matchers via Rc with other things that we want . // to modify. Dropping eof_items now may drop these refcounts to 1, preventing an . // unnecessary implicit clone later in Rc::make_mut. 54,532 ( 0.00%) drop(eof_items); . . // If there are no possible next positions AND we aren't waiting for the black-box parser, . // then there is a syntax error. 51,686 ( 0.00%) if bb_items.is_empty() && next_items.is_empty() { 51,597 ( 0.00%) return Failure(parser.token.clone(), "no rules expected this token in macro call"); . } . // Another possibility is that we need to call out to parse some rust nonterminal . // (black-box) parser. However, if there is not EXACTLY ONE of these, something is wrong. 11,384 ( 0.00%) else if (!bb_items.is_empty() && !next_items.is_empty()) || bb_items.len() > 1 { . let nts = bb_items . .iter() . .map(|item| match item.top_elts.get_tt(item.idx) { . TokenTree::MetaVarDecl(_, bind, Some(kind)) => format!("{} ('{}')", kind, bind), . _ => panic!(), . }) . .collect::>() . .join(" or "); -- line 712 ---------------------------------------- -- line 721 ---------------------------------------- . n => format!("built-in NTs {} or {} other options.", nts, n), . } . ), . ); . } . // Dump all possible `next_items` into `cur_items` for the next iteration. . else if !next_items.is_empty() { . // Now process the next token 20,454 ( 0.00%) cur_items.extend(next_items.drain(..)); 6,818 ( 0.00%) parser.to_mut().bump(); . } . // Finally, we have the case where we need to call the black-box parser to get some . // nonterminal. . else { . assert_eq!(bb_items.len(), 1); . 5,692 ( 0.00%) let mut item = bb_items.pop().unwrap(); 21,241 ( 0.00%) if let TokenTree::MetaVarDecl(span, _, Some(kind)) = item.top_elts.get_tt(item.idx) { 2,846 ( 0.00%) let match_cur = item.match_cur; . // We use the span of the metavariable declaration to determine any . // edition-specific matching behavior for non-terminals. 17,232 ( 0.00%) let nt = match parser.to_mut().parse_nonterminal(kind) { . Err(mut err) => { . err.span_label( . span, . format!("while parsing argument for this `{}` macro fragment", kind), . ) . .emit(); . return ErrorReported; . } 17,076 ( 0.00%) Ok(nt) => nt, . }; 11,384 ( 0.00%) item.push_match(match_cur, MatchedNonterminal(Lrc::new(nt))); 11,384 ( 0.00%) item.idx += 1; 17,076 ( 0.00%) item.match_cur += 1; . } else { . unreachable!() . } . cur_items.push(item); . } . 19,328 ( 0.00%) assert!(!cur_items.is_empty()); . } 39,546 ( 0.00%) } 345,200 ( 0.02%) -------------------------------------------------------------------------------- -- 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")] 146 ( 0.00%) pub fn from_str_radix(src: &str, radix: u32) -> Result { 73 ( 0.00%) from_str_radix(src, radix) 219 ( 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 { 350,880 ( 0.02%) 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 { 607,786 ( 0.03%) 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 { 561,710 ( 0.03%) intrinsics::cttz(self) as u32 . } . . /// Returns the number of leading ones in the binary representation of `self`. . /// . /// # Examples . /// . /// Basic usage: . /// -- line 155 ---------------------------------------- -- line 204 ---------------------------------------- . #[doc = concat!("assert_eq!(n.rotate_left(", $rot, "), m);")] . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_stable(feature = "const_math", since = "1.32.0")] . #[must_use = "this returns the result of the operation, \ . without modifying the original"] . #[inline(always)] . pub const fn rotate_left(self, n: u32) -> Self { 11,042,415 ( 0.54%) 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 { 16 ( 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`. 1,249,801 ( 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`. 107,681 ( 0.01%) 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 { 200,839 ( 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 { 5,024 ( 0.00%) intrinsics::saturating_sub(self, rhs) . } . . /// Saturating integer multiplication. Computes `self * rhs`, . /// saturating at the numeric bounds instead of overflowing. . /// . /// # Examples . /// . /// Basic usage: -- line 1100 ---------------------------------------- -- line 1175 ---------------------------------------- . #[doc = concat!("assert_eq!(200", stringify!($SelfT), ".wrapping_add(", stringify!($SelfT), "::MAX), 199);")] . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_stable(feature = "const_wrapping_math", since = "1.32.0")] . #[must_use = "this returns the result of the operation, \ . without modifying the original"] . #[inline(always)] . pub const fn wrapping_add(self, rhs: Self) -> Self { 5,936,735 ( 0.29%) 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 { 2,362,338 ( 0.12%) intrinsics::wrapping_sub(self, rhs) . } . . /// Wrapping (modular) multiplication. Computes `self * . /// rhs`, wrapping around at the boundary of the type. . /// . /// # Examples . /// . /// Basic usage: -- line 1233 ---------------------------------------- -- line 1240 ---------------------------------------- . /// assert_eq!(25u8.wrapping_mul(12), 44); . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_stable(feature = "const_wrapping_math", since = "1.32.0")] . #[must_use = "this returns the result of the operation, \ . without modifying the original"] . #[inline(always)] . pub const fn wrapping_mul(self, rhs: Self) -> Self { 8,368,804 ( 0.41%) 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 { 12 ( 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 1491 ---------------------------------------- . #[doc = concat!("assert_eq!(5", stringify!($SelfT), ".overflowing_add(2), (7, false));")] . #[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)] 1 ( 0.00%) pub const fn overflowing_add(self, rhs: Self) -> (Self, bool) { 923,918 ( 0.05%) let (a, b) = intrinsics::add_with_overflow(self as $ActualT, rhs as $ActualT); . (a as Self, b) 2 ( 0.00%) } . . /// 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. . /// . #[doc = concat!("This can be thought of as a ", stringify!($BITS), "-bit \"full adder\", in the electronics sense.")] -- line 1510 ---------------------------------------- -- 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)] 4 ( 0.00%) pub const fn overflowing_sub(self, rhs: Self) -> (Self, bool) { 304,332 ( 0.01%) let (a, b) = intrinsics::sub_with_overflow(self as $ActualT, rhs as $ActualT); . (a as Self, b) 8 ( 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 1674 ---------------------------------------- . /// assert_eq!(1_000_000_000u32.overflowing_mul(10), (1410065408, true)); . /// ``` . #[stable(feature = "wrapping", since = "1.7.0")] . #[rustc_const_stable(feature = "const_wrapping_math", since = "1.32.0")] . #[must_use = "this returns the result of the operation, \ . without modifying the original"] . #[inline(always)] . pub const fn overflowing_mul(self, rhs: Self) -> (Self, bool) { 1,828,783 ( 0.09%) let (a, b) = intrinsics::mul_with_overflow(self as $ActualT, rhs as $ActualT); . (a as Self, b) . } . . /// Calculates the divisor when `self` is divided by `rhs`. . /// . /// Returns a tuple of the divisor along with a boolean indicating . /// whether an arithmetic overflow would occur. Note that for unsigned . /// integers overflow never occurs, so the second value is always -- line 1690 ---------------------------------------- -- line 2132 ---------------------------------------- . #[doc = concat!("assert!(16", stringify!($SelfT), ".is_power_of_two());")] . #[doc = concat!("assert!(!10", stringify!($SelfT), ".is_power_of_two());")] . /// ``` . #[must_use] . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_stable(feature = "const_is_power_of_two", since = "1.32.0")] . #[inline(always)] . pub const fn is_power_of_two(self) -> bool { 546 ( 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 { 14,608 ( 0.00%) if self <= 1 { return 0; } . 24,149 ( 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. 72,229 ( 0.00%) let z = unsafe { intrinsics::ctlz_nonzero(p) }; 24,191 ( 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 { 33,602 ( 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 ---------------------------------------- 124,453 ( 0.01%) -------------------------------------------------------------------------------- -- 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, . { 466 ( 0.00%) let mut next_child = move_data.move_paths[path].first_child; 1,392 ( 0.00%) while let Some(child_index) = next_child { . let move_path_children = &move_data.move_paths[child_index]; 1,158 ( 0.00%) if let Some(&elem) = move_path_children.place.projection.last() { 1,960 ( 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; 503,538 ( 0.02%) 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 . } 445,680 ( 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), . { 12,248 ( 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), . { 745,152 ( 0.04%) fn is_terminal_path<'tcx>( . tcx: TyCtxt<'tcx>, . body: &Body<'tcx>, . move_data: &MoveData<'tcx>, . path: MovePathIndex, . ) -> bool { 186,288 ( 0.01%) place_contents_drop_state_cannot_differ(tcx, body, move_data.move_paths[path].place) 745,152 ( 0.04%) } . 925,479 ( 0.05%) 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), . { 18,634 ( 0.00%) each_child(move_path_index); . 652,932 ( 0.03%) if is_terminal_path(tcx, body, move_data, move_path_index) { . return; . } . 63,997 ( 0.00%) let mut next_child_index = move_data.move_paths[move_path_index].first_child; 176,774 ( 0.01%) while let Some(child_index) = next_child_index { 74,466 ( 0.00%) on_all_children_bits(tcx, body, move_data, child_index, each_child); 12,411 ( 0.00%) next_child_index = move_data.move_paths[child_index].next_sibling; . } 737,650 ( 0.04%) } 488,639 ( 0.02%) 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), . { 15,925 ( 0.00%) on_all_children_bits(tcx, body, &ctxt.move_data, path, |child| { 11,208 ( 0.00%) let place = &ctxt.move_data.move_paths[path].place; 2,802 ( 0.00%) let ty = place.ty(body, tcx).ty; . debug!("on_all_drop_children_bits({:?}, {:?} : {:?})", path, place, ty); . 1,956 ( 0.00%) let erased_ty = tcx.erase_regions(ty); 17,459 ( 0.00%) if erased_ty.needs_drop(tcx, ctxt.param_env) { 2,801 ( 0.00%) each_child(child); . } else { . debug!("on_all_drop_children_bits - skipping") . } . }) . } . 11,787 ( 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; 1,068 ( 0.00%) for arg in body.args_iter() { 2,820 ( 0.00%) let place = mir::Place::from(arg); 4,230 ( 0.00%) let lookup_result = move_data.rev_lookup.find(place.as_ref()); . on_lookup_result_bits(tcx, body, move_data, lookup_result, |mpi| { 1,682 ( 0.00%) callback(mpi, DropFlagState::Present) . }); . } 8,544 ( 0.00%) } . 1,059,240 ( 0.05%) 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 72,727 ( 0.00%) for mi in &move_data.loc_map[loc] { 214,057 ( 0.01%) let path = mi.move_path_index(move_data); . debug!("moving out of path {:?}", move_data.move_paths[path]); . 63,354 ( 0.00%) on_all_children_bits(tcx, body, move_data, path, |mpi| callback(mpi, DropFlagState::Absent)) . } . . debug!("drop_flag_effects: assignment for location({:?})", loc); . 18,634 ( 0.00%) for_location_inits(tcx, body, move_data, loc, |mpi| callback(mpi, DropFlagState::Present)); 747,608 ( 0.04%) } . . 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), . { 72,727 ( 0.00%) for ii in &move_data.init_loc_map[loc] { 95,264 ( 0.00%) let init = move_data.inits[*ii]; 59,056 ( 0.00%) 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. 10,836 ( 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), . ) { 4,515 ( 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]; 4,423 ( 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. 738 ( 0.00%) let (downcast, base_proj) = variant_path.place.projection.split_last().unwrap(); 2,952 ( 0.00%) assert_eq!(enum_place.projection.len(), base_proj.len()); . 2,214 ( 0.00%) let variant_idx = match *downcast { . mir::ProjectionElem::Downcast(_, idx) => idx, . _ => unreachable!(), . }; . 738 ( 0.00%) if variant_idx != active_variant { . on_all_children_bits(tcx, body, move_data, variant_mpi, |mpi| { 750 ( 0.00%) handle_inactive_variant(mpi) . }); . } . } 7,224 ( 0.00%) } 691,248 ( 0.03%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_lexer/src/lib.rs -------------------------------------------------------------------------------- Ir -- line 38 ---------------------------------------- . #[derive(Debug)] . pub struct Token { . pub kind: TokenKind, . pub len: usize, . } . . impl Token { . fn new(kind: TokenKind, len: usize) -> Token { 586,152 ( 0.03%) Token { kind, len } . } . } . . /// Enum representing common lexeme types. . // perf note: Changing all `usize` to `u32` doesn't change performance. See #77629 171,440 ( 0.01%) #[derive(Clone, Copy, Debug, PartialEq, Eq, PartialOrd, Ord)] . pub enum TokenKind { . // Multi-char tokens: . /// "// comment" . LineComment { doc_style: Option }, . /// `/* block comment */` . /// . /// Block comments can be recursive, so the sequence like `/* /* */` . /// will not be considered terminated and will result in a parsing error. -- line 60 ---------------------------------------- -- line 192 ---------------------------------------- . /// Literal starts with "0x". . Hexadecimal, . /// Literal doesn't contain a prefix. . Decimal, . } . . /// `rustc` allows files to have a shebang, e.g. "#!/usr/bin/rustrun", . /// but shebang isn't a part of rust syntax. 147 ( 0.00%) pub fn strip_shebang(input: &str) -> Option { . // Shebang must start with `#!` literally, without any preceding whitespace. . // For simplicity we consider any line starting with `#!` a shebang, . // regardless of restrictions put on shebangs by specific platforms. . if let Some(input_tail) = input.strip_prefix("#!") { . // Ok, this is a shebang but if the next non-whitespace token is `[`, . // then it may be valid Rust code, so consider it Rust code. . let next_non_whitespace_token = tokenize(input_tail).map(|tok| tok.kind).find(|tok| { . !matches!( . tok, . TokenKind::Whitespace . | TokenKind::LineComment { doc_style: None } . | TokenKind::BlockComment { doc_style: None, .. } . ) . }); 2 ( 0.00%) if next_non_whitespace_token != Some(TokenKind::OpenBracket) { . // No other choice than to consider this a shebang. . return Some(2 + input_tail.lines().next().unwrap_or_default().len()); . } . } . None 168 ( 0.00%) } . . /// Parses the first token from the provided input string. 195,378 ( 0.01%) pub fn first_token(input: &str) -> Token { . debug_assert!(!input.is_empty()); 65,126 ( 0.00%) Cursor::new(input).advance_token() 260,504 ( 0.01%) } . . /// Creates an iterator that produces tokens from the input string. . pub fn tokenize(input: &str) -> impl Iterator + '_ { . let mut cursor = Cursor::new(input); . std::iter::from_fn(move || { 2 ( 0.00%) if cursor.is_eof() { . None . } else { . cursor.reset_len_consumed(); 28 ( 0.00%) Some(cursor.advance_token()) . } . }) . } . . /// True if `c` is considered a whitespace according to Rust language definition. . /// See [Rust language reference](https://doc.rust-lang.org/reference/whitespace.html) . /// for definitions of these classes. . pub fn is_whitespace(c: char) -> bool { . // This is Pattern_White_Space. . // . // Note that this set is stable (ie, it doesn't change with different . // Unicode versions), so it's ok to just hard-code the values. . 186,990 ( 0.01%) matches!( . c, . // Usual ASCII suspects . '\u{0009}' // \t . | '\u{000A}' // \n . | '\u{000B}' // vertical tab . | '\u{000C}' // form feed . | '\u{000D}' // \r . | '\u{0020}' // space -- line 259 ---------------------------------------- -- line 269 ---------------------------------------- . | '\u{2028}' // LINE SEPARATOR . | '\u{2029}' // PARAGRAPH SEPARATOR . ) . } . . /// True if `c` is valid as a first character of an identifier. . /// See [Rust language reference](https://doc.rust-lang.org/reference/identifiers.html) for . /// a formal definition of valid identifier name. 45 ( 0.00%) pub fn is_id_start(c: char) -> bool { . // This is XID_Start OR '_' (which formally is not a XID_Start). 2,280 ( 0.00%) c == '_' || unicode_xid::UnicodeXID::is_xid_start(c) 45 ( 0.00%) } . . /// True if `c` is valid as a non-first character of an identifier. . /// See [Rust language reference](https://doc.rust-lang.org/reference/identifiers.html) for . /// a formal definition of valid identifier name. . pub fn is_id_continue(c: char) -> bool { . unicode_xid::UnicodeXID::is_xid_continue(c) . } . . /// The passed string is lexically an identifier. 15 ( 0.00%) pub fn is_ident(string: &str) -> bool { . let mut chars = string.chars(); . if let Some(start) = chars.next() { . is_id_start(start) && chars.all(is_id_continue) . } else { . false . } 21 ( 0.00%) } . . impl Cursor<'_> { . /// Parses a token from the input string. 521,024 ( 0.03%) fn advance_token(&mut self) -> Token { . let first_char = self.bump().unwrap(); 240,882 ( 0.01%) let token_kind = match first_char { . // Slash, comment or block comment. 6,758 ( 0.00%) '/' => match self.first() { . '/' => self.line_comment(), . '*' => self.block_comment(), . _ => Slash, . }, . . // Whitespace sequence. . c if is_whitespace(c) => self.whitespace(), . . // Raw identifier, raw string literal or identifier. 2,416 ( 0.00%) 'r' => match (self.first(), self.second()) { . ('#', c1) if is_id_start(c1) => self.raw_ident(), . ('#', _) | ('"', _) => { . let (n_hashes, err) = self.raw_double_quoted_string(1); . let suffix_start = self.len_consumed(); . if err.is_none() { . self.eat_literal_suffix(); . } . let kind = RawStr { n_hashes, err }; . Literal { kind, suffix_start } . } . _ => self.ident_or_unknown_prefix(), . }, . . // Byte literal, byte string literal, raw byte string literal or identifier. 4,045 ( 0.00%) 'b' => match (self.first(), self.second()) { . ('\'', _) => { . self.bump(); 21 ( 0.00%) let terminated = self.single_quoted_string(); . let suffix_start = self.len_consumed(); 14 ( 0.00%) if terminated { . self.eat_literal_suffix(); . } . let kind = Byte { terminated }; 14 ( 0.00%) Literal { kind, suffix_start } . } . ('"', _) => { . self.bump(); 72 ( 0.00%) let terminated = self.double_quoted_string(); . let suffix_start = self.len_consumed(); 48 ( 0.00%) if terminated { . self.eat_literal_suffix(); . } . let kind = ByteStr { terminated }; 48 ( 0.00%) Literal { kind, suffix_start } . } . ('r', '"') | ('r', '#') => { . self.bump(); . let (n_hashes, err) = self.raw_double_quoted_string(2); . let suffix_start = self.len_consumed(); . if err.is_none() { . self.eat_literal_suffix(); . } -- line 357 ---------------------------------------- -- line 361 ---------------------------------------- . _ => self.ident_or_unknown_prefix(), . }, . . // Identifier (this should be checked after other variant that can . // start as identifier). . c if is_id_start(c) => self.ident_or_unknown_prefix(), . . // Numeric literal. 86,157 ( 0.00%) c @ '0'..='9' => { . let literal_kind = self.number(c); . let suffix_start = self.len_consumed(); . self.eat_literal_suffix(); 405 ( 0.00%) TokenKind::Literal { kind: literal_kind, suffix_start } . } . . // One-symbol tokens. 2,654 ( 0.00%) ';' => Semi, 4,010 ( 0.00%) ',' => Comma, 4,146 ( 0.00%) '.' => Dot, 8,066 ( 0.00%) '(' => OpenParen, 8,066 ( 0.00%) ')' => CloseParen, 2,750 ( 0.00%) '{' => OpenBrace, 2,750 ( 0.00%) '}' => CloseBrace, 1,042 ( 0.00%) '[' => OpenBracket, 1,038 ( 0.00%) ']' => CloseBracket, . '@' => At, 874 ( 0.00%) '#' => Pound, . '~' => Tilde, 204 ( 0.00%) '?' => Question, 9,304 ( 0.00%) ':' => Colon, 80 ( 0.00%) '$' => Dollar, 2,826 ( 0.00%) '=' => Eq, 618 ( 0.00%) '!' => Bang, 1,422 ( 0.00%) '<' => Lt, 2,766 ( 0.00%) '>' => Gt, 766 ( 0.00%) '-' => Minus, 1,358 ( 0.00%) '&' => And, 304 ( 0.00%) '|' => Or, 172 ( 0.00%) '+' => Plus, 104 ( 0.00%) '*' => Star, 6 ( 0.00%) '^' => Caret, . '%' => Percent, . . // Lifetime or character literal. 246 ( 0.00%) '\'' => self.lifetime_or_char(), . . // String literal. . '"' => { 2,679 ( 0.00%) let terminated = self.double_quoted_string(); . let suffix_start = self.len_consumed(); 1,786 ( 0.00%) if terminated { . self.eat_literal_suffix(); . } . let kind = Str { terminated }; 1,786 ( 0.00%) Literal { kind, suffix_start } . } . // Identifier starting with an emoji. Only lexed for graceful error recovery. . c if !c.is_ascii() && unic_emoji_char::is_emoji(c) => { . self.fake_ident_or_unknown_prefix() . } . _ => Unknown, . }; . Token::new(token_kind, self.len_consumed()) 586,152 ( 0.03%) } . . fn line_comment(&mut self) -> TokenKind { . debug_assert!(self.prev() == '/' && self.first() == '/'); . self.bump(); . 4,212 ( 0.00%) let doc_style = match self.first() { . // `//!` is an inner line doc comment. . '!' => Some(DocStyle::Inner), . // `////` (more than 3 slashes) is not considered a doc comment. 3,816 ( 0.00%) '/' if self.second() != '/' => Some(DocStyle::Outer), . _ => None, . }; . 56,502 ( 0.00%) self.eat_while(|c| c != '\n'); 5,067 ( 0.00%) LineComment { doc_style } . } . . fn block_comment(&mut self) -> TokenKind { . debug_assert!(self.prev() == '/' && self.first() == '*'); . self.bump(); . 4 ( 0.00%) let doc_style = match self.first() { . // `/*!` is an inner block doc comment. . '!' => Some(DocStyle::Inner), . // `/***` (more than 2 stars) is not considered a doc comment. . // `/**/` is not considered a doc comment. . '*' if !matches!(self.second(), '*' | '/') => Some(DocStyle::Outer), . _ => None, . }; . . let mut depth = 1usize; 35,154 ( 0.00%) while let Some(c) = self.bump() { . match c { 110 ( 0.00%) '/' if self.first() == '*' => { . self.bump(); . depth += 1; . } 2 ( 0.00%) '*' if self.first() == '/' => { . self.bump(); 2 ( 0.00%) depth -= 1; 2 ( 0.00%) if depth == 0 { . // This block comment is closed, so for a construction like "/* */ */" . // there will be a successfully parsed block comment "/* */" . // and " */" will be processed separately. . break; . } . } . _ => (), . } . } . 5 ( 0.00%) BlockComment { doc_style, terminated: depth == 0 } . } . . fn whitespace(&mut self) -> TokenKind { . debug_assert!(is_whitespace(self.prev())); . self.eat_while(is_whitespace); 17,544 ( 0.00%) Whitespace . } . . fn raw_ident(&mut self) -> TokenKind { . debug_assert!(self.prev() == 'r' && self.first() == '#' && is_id_start(self.second())); . // Eat "#" symbol. . self.bump(); . // Eat the identifier part of RawIdent. . self.eat_identifier(); . RawIdent . } . 85,720 ( 0.00%) fn ident_or_unknown_prefix(&mut self) -> TokenKind { . debug_assert!(is_id_start(self.prev())); . // Start is already eaten, eat the rest of identifier. 34,288 ( 0.00%) self.eat_while(is_id_continue); . // Known prefixes must have been handled earlier. So if . // we see a prefix here, it is definitely an unknown prefix. 34,288 ( 0.00%) match self.first() { . '#' | '"' | '\'' => UnknownPrefix, 17,144 ( 0.00%) c if !c.is_ascii() && unic_emoji_char::is_emoji(c) => { . self.fake_ident_or_unknown_prefix() . } 17,144 ( 0.00%) _ => Ident, . } 68,576 ( 0.00%) } . . fn fake_ident_or_unknown_prefix(&mut self) -> TokenKind { . // Start is already eaten, eat the rest of identifier. . self.eat_while(|c| { . unicode_xid::UnicodeXID::is_xid_continue(c) . || (!c.is_ascii() && unic_emoji_char::is_emoji(c)) . || c == '\u{200d}' . }); -- line 515 ---------------------------------------- -- line 519 ---------------------------------------- . '#' | '"' | '\'' => UnknownPrefix, . _ => InvalidIdent, . } . } . . fn number(&mut self, first_digit: char) -> LiteralKind { . debug_assert!('0' <= self.prev() && self.prev() <= '9'); . let mut base = Base::Decimal; 162 ( 0.00%) if first_digit == '0' { . // Attempt to parse encoding base. 217 ( 0.00%) let has_digits = match self.first() { . 'b' => { . base = Base::Binary; . self.bump(); . self.eat_decimal_digits() . } . 'o' => { . base = Base::Octal; . self.bump(); -- line 537 ---------------------------------------- -- line 538 ---------------------------------------- . self.eat_decimal_digits() . } . 'x' => { . base = Base::Hexadecimal; . self.bump(); . self.eat_hexadecimal_digits() . } . // Not a base prefix. 132 ( 0.00%) '0'..='9' | '_' | '.' | 'e' | 'E' => { . self.eat_decimal_digits(); . true . } . // Just a 0. . _ => return Int { base, empty_int: false }, . }; . // Base prefix was provided, but there were no digits . // after it, e.g. "0x". -- line 554 ---------------------------------------- -- line 555 ---------------------------------------- . if !has_digits { . return Int { base, empty_int: true }; . } . } else { . // No base prefix, parse number in the usual way. . self.eat_decimal_digits(); . }; . 236 ( 0.00%) match self.first() { . // Don't be greedy if this is actually an . // integer literal followed by field/method access or a range pattern . // (`0..2` and `12.foo()`) 26 ( 0.00%) '.' if self.second() != '.' && !is_id_start(self.second()) => { . // might have stuff after the ., and if it does, it needs to start . // with a number . self.bump(); . let mut empty_exponent = false; . if self.first().is_digit(10) { . self.eat_decimal_digits(); . match self.first() { . 'e' | 'E' => { -- line 575 ---------------------------------------- -- line 585 ---------------------------------------- . self.bump(); . let empty_exponent = !self.eat_float_exponent(); . Float { base, empty_exponent } . } . _ => Int { base, empty_int: false }, . } . } . 574 ( 0.00%) fn lifetime_or_char(&mut self) -> TokenKind { . debug_assert!(self.prev() == '\''); . 164 ( 0.00%) let can_be_a_lifetime = if self.second() == '\'' { . // It's surely not a lifetime. . false . } else { . // If the first symbol is valid for identifier, it can be a lifetime. . // Also check if it's a number for a better error reporting (so '0 will . // be reported as invalid lifetime and not as unterminated char literal). . is_id_start(self.first()) || self.first().is_digit(10) . }; . . if !can_be_a_lifetime { 24 ( 0.00%) let terminated = self.single_quoted_string(); . let suffix_start = self.len_consumed(); 16 ( 0.00%) if terminated { . self.eat_literal_suffix(); . } . let kind = Char { terminated }; 32 ( 0.00%) return Literal { kind, suffix_start }; . } . . // Either a lifetime or a character literal with . // length greater than 1. . . let starts_with_number = self.first().is_digit(10); . . // Skip the literal contents. . // First symbol can be a number (which isn't a valid identifier start), . // so skip it without any checks. . self.bump(); 148 ( 0.00%) self.eat_while(is_id_continue); . . // Check if after skipping literal contents we've met a closing . // single quote (which means that user attempted to create a . // string with single quotes). 148 ( 0.00%) if self.first() == '\'' { . self.bump(); . let kind = Char { terminated: true }; . Literal { kind, suffix_start: self.len_consumed() } . } else { 148 ( 0.00%) Lifetime { starts_with_number } . } 492 ( 0.00%) } . . fn single_quoted_string(&mut self) -> bool { . debug_assert!(self.prev() == '\''); . // Check if it's a one-symbol literal. 50 ( 0.00%) if self.second() == '\'' && self.first() != '\\' { . self.bump(); . self.bump(); . return true; . } . . // Literal has more than one symbol. . . // Parse until either quotes are terminated or error is detected. . loop { 55 ( 0.00%) match self.first() { . // Quotes are terminated, finish parsing. . '\'' => { . self.bump(); . return true; . } . // Probably beginning of the comment, which we don't want to include . // to the error report. . '/' => break, -- line 660 ---------------------------------------- -- line 670 ---------------------------------------- . // Skip the character. . _ => { . self.bump(); . } . } . } . // String was not terminated. . false 15 ( 0.00%) } . . /// Eats double-quoted string and returns true . /// if string is terminated. . fn double_quoted_string(&mut self) -> bool { . debug_assert!(self.prev() == '"'); . while let Some(c) = self.bump() { 46,605 ( 0.00%) match c { . '"' => { . return true; . } 274 ( 0.00%) '\\' if self.first() == '\\' || self.first() == '"' => { . // Bump again to skip escaped character. . self.bump(); . } . _ => (), . } . } . // End of file reached. . false 917 ( 0.00%) } . . /// Eats the double-quoted string and returns `n_hashes` and an error if encountered. . fn raw_double_quoted_string(&mut self, prefix_len: usize) -> (u16, Option) { . // Wrap the actual function to handle the error with too many hashes. . // This way, it eats the whole raw string. . let (n_hashes, err) = self.raw_string_unvalidated(prefix_len); . // Only up to 65535 `#`s are allowed in raw strings . match u16::try_from(n_hashes) { -- line 706 ---------------------------------------- -- line 773 ---------------------------------------- . max_hashes = n_end_hashes; . } . } . } . . fn eat_decimal_digits(&mut self) -> bool { . let mut has_digits = false; . loop { 146 ( 0.00%) match self.first() { . '_' => { . self.bump(); . } 219 ( 0.00%) '0'..='9' => { . has_digits = true; . self.bump(); . } . _ => break, . } . } . has_digits 90 ( 0.00%) } . . fn eat_hexadecimal_digits(&mut self) -> bool { . let mut has_digits = false; . loop { 52 ( 0.00%) match self.first() { . '_' => { . self.bump(); . } 99 ( 0.00%) '0'..='9' | 'a'..='f' | 'A'..='F' => { . has_digits = true; . self.bump(); . } . _ => break, . } . } . has_digits 6 ( 0.00%) } . . /// Eats the float exponent. Returns true if at least one digit was met, . /// and returns false otherwise. . fn eat_float_exponent(&mut self) -> bool { . debug_assert!(self.prev() == 'e' || self.prev() == 'E'); . if self.first() == '-' || self.first() == '+' { . self.bump(); . } . self.eat_decimal_digits() . } . . // Eats the suffix of the literal, e.g. "_u8". . fn eat_literal_suffix(&mut self) { 2,026 ( 0.00%) self.eat_identifier(); . } . . // Eats the identifier. 3,039 ( 0.00%) fn eat_identifier(&mut self) { . if !is_id_start(self.first()) { . return; . } . self.bump(); . 15 ( 0.00%) self.eat_while(is_id_continue); 4,040 ( 0.00%) } . } 933,337 ( 0.05%) -------------------------------------------------------------------------------- -- 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}; . 16,559 ( 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); . } . } . } . }; . } . 229,150 ( 0.01%) #[derive(Clone)] . pub struct Parser<'a> { 8,452 ( 0.00%) pub sess: &'a ParseSess, . /// The current token. 8,030 ( 0.00%) pub token: Token, . /// The spacing for the current token 4,069 ( 0.00%) pub token_spacing: Spacing, . /// The previous token. 12,045 ( 0.00%) pub prev_token: Token, 4,123 ( 0.00%) pub capture_cfg: bool, 8,300 ( 0.00%) restrictions: Restrictions, 8,138 ( 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, 8,138 ( 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. 8,138 ( 0.00%) unmatched_angle_bracket_count: u32, 12,207 ( 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. 4,069 ( 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` 4,069 ( 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, . } . 16,644 ( 0.00%) #[derive(Clone)] . struct CaptureState { 16,276 ( 0.00%) capturing: Capturing, 4,069 ( 0.00%) replace_ranges: Vec, . inner_attr_ranges: FxHashMap, . } . . impl<'a> Drop for Parser<'a> { . fn drop(&mut self) { 17,295 ( 0.00%) emit_unclosed_delims(&mut self.unclosed_delims, &self.sess); . } . } . 148,090 ( 0.01%) #[derive(Clone)] . struct TokenCursor { . frame: TokenCursorFrame, 34,361 ( 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. 10,984 ( 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, . } . 67,500 ( 0.00%) #[derive(Clone)] . struct TokenCursorFrame { 17,900 ( 0.00%) delim: token::DelimToken, . span: DelimSpan, . open_delim: bool, 35,800 ( 0.00%) tree_cursor: tokenstream::Cursor, . close_delim: bool, . } . . impl TokenCursorFrame { . fn new(span: DelimSpan, delim: DelimToken, tts: TokenStream) -> Self { 7,365 ( 0.00%) TokenCursorFrame { . delim, . span, . open_delim: false, 14,841 ( 0.00%) tree_cursor: tts.into_trees(), . close_delim: false, . } . } . } . . impl TokenCursor { 1,051,092 ( 0.05%) fn next(&mut self) -> (Token, Spacing) { . loop { 520,610 ( 0.03%) let (tree, spacing) = if !self.frame.open_delim { 11,891 ( 0.00%) self.frame.open_delim = true; 59,455 ( 0.00%) TokenTree::open_tt(self.frame.span, self.frame.delim).into() 1,015,434 ( 0.05%) } else if let Some(tree) = self.frame.tree_cursor.next_with_spacing() { . tree 49,980 ( 0.00%) } else if !self.frame.close_delim { 11,665 ( 0.00%) self.frame.close_delim = true; 58,325 ( 0.00%) TokenTree::close_tt(self.frame.span, self.frame.delim).into() 23,220 ( 0.00%) } else if let Some(frame) = self.stack.pop() { 150,930 ( 0.01%) self.frame = frame; . continue; . } else { 30,870 ( 0.00%) (TokenTree::Token(Token::new(token::Eof, DUMMY_SP)), Spacing::Alone) . }; . 198,956 ( 0.01%) match tree { . TokenTree::Token(token) => { 700,728 ( 0.03%) return (token, spacing); . } . TokenTree::Delimited(sp, delim, tts) => { . let frame = TokenCursorFrame::new(sp, delim, tts); . self.stack.push(mem::replace(&mut self.frame, frame)); . } . } . } 700,728 ( 0.03%) } . 220,580 ( 0.01%) fn next_desugared(&mut self) -> (Token, Spacing) { 66,182 ( 0.00%) let (data, attr_style, sp) = match self.next() { 12 ( 0.00%) (Token { kind: token::DocComment(_, attr_style, data), span }, _) => { . (data, attr_style, span) . } 110,270 ( 0.01%) 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; 1,570 ( 0.00%) for ch in data.as_str().chars() { . count = match ch { . '"' => 1, . '#' if count > 0 => count + 1, . _ => 0, . }; . num_of_hashes = cmp::max(num_of_hashes, count); . } . 16 ( 0.00%) let delim_span = DelimSpan::from_single(sp); 20 ( 0.00%) let body = TokenTree::Delimited( . delim_span, . token::Bracket, 48 ( 0.00%) [ 28 ( 0.00%) TokenTree::token(token::Ident(sym::doc, false), sp), 16 ( 0.00%) TokenTree::token(token::Eq, sp), 32 ( 0.00%) TokenTree::token(TokenKind::lit(token::StrRaw(num_of_hashes), data, None), sp), . ] . .iter() . .cloned() . .collect::(), 4 ( 0.00%) ); . . self.stack.push(mem::replace( . &mut self.frame, . TokenCursorFrame::new( . delim_span, . token::NoDelim, 4 ( 0.00%) if attr_style == AttrStyle::Inner { . [TokenTree::token(token::Pound, sp), TokenTree::token(token::Not, sp), body] . .iter() . .cloned() . .collect::() . } else { 48 ( 0.00%) [TokenTree::token(token::Pound, sp), body] . .iter() . .cloned() . .collect::() . }, . ), . )); . 12 ( 0.00%) self.next() 198,522 ( 0.01%) } . } . 29,450 ( 0.00%) #[derive(Debug, Clone, PartialEq)] . enum TokenType { 23,560 ( 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 { 159 ( 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> { 1,580 ( 0.00%) Some(match token.kind { 3,160 ( 0.00%) _ if token.is_special_ident() => "reserved identifier", 3,160 ( 0.00%) _ if token.is_used_keyword() => "keyword", 3,160 ( 0.00%) _ if token.is_unused_keyword() => "reserved keyword", . token::DocComment(..) => "doc comment", . _ => return None, . }) . } . 5,530 ( 0.00%) pub(super) fn token_descr(token: &Token) -> String { 1,580 ( 0.00%) let token_str = pprust::token_to_string(token); . match token_descr_opt(token) { . Some(prefix) => format!("{} `{}`", prefix, token_str), 5,530 ( 0.00%) _ => format!("`{}`", token_str), . } 3,950 ( 0.00%) } . . impl<'a> Parser<'a> { 20,622 ( 0.00%) pub fn new( . sess: &'a ParseSess, . tokens: TokenStream, . desugar_doc_comments: bool, . subparser_name: Option<&'static str>, . ) -> Self { 1,473 ( 0.00%) let mut start_frame = TokenCursorFrame::new(DelimSpan::dummy(), token::NoDelim, tokens); 2,946 ( 0.00%) start_frame.open_delim = true; . start_frame.close_delim = true; . 45,663 ( 0.00%) let mut parser = Parser { . sess, 1,473 ( 0.00%) token: Token::dummy(), . token_spacing: Spacing::Alone, 1,473 ( 0.00%) prev_token: Token::dummy(), . capture_cfg: false, . restrictions: Restrictions::empty(), . expected_tokens: Vec::new(), . token_cursor: TokenCursor { 8,838 ( 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. 2,946 ( 0.00%) parser.bump(); . . parser 13,257 ( 0.00%) } . . fn next_tok(&mut self, fallback_span: Span) -> (Token, Spacing) { . loop { 503,868 ( 0.02%) let (mut next, spacing) = if self.desugar_doc_comments { 88,232 ( 0.00%) self.token_cursor.next_desugared() . } else { 185,760 ( 0.01%) self.token_cursor.next() . }; 335,912 ( 0.02%) 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 83,978 ( 0.00%) self.token_cursor.break_last_token = false; 335,912 ( 0.02%) if next.span.is_dummy() { . // Tweak the location for better diagnostics, but keep syntactic context intact. 5,992 ( 0.00%) next.span = fallback_span.with_ctxt(next.span.ctxt()); . } 286,486 ( 0.01%) if matches!( 167,956 ( 0.01%) next.kind, . token::OpenDelim(token::NoDelim) | token::CloseDelim(token::NoDelim) . ) { . continue; . } 335,880 ( 0.02%) 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`. 64,233 ( 0.00%) pub fn expect(&mut self, t: &TokenKind) -> PResult<'a, bool /* recovered */> { 7,137 ( 0.00%) if self.expected_tokens.is_empty() { 6,354 ( 0.00%) if self.token == *t { 5,295 ( 0.00%) self.bump(); . Ok(false) . } else { . self.unexpected_try_recover(t) . } . } else { 72,936 ( 0.00%) self.expect_one_of(slice::from_ref(t), &[]) . } 107,055 ( 0.01%) } . . /// 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. 89,196 ( 0.00%) pub fn expect_one_of( . &mut self, . edible: &[TokenKind], . inedible: &[TokenKind], . ) -> PResult<'a, bool /* recovered */> { 14,866 ( 0.00%) if edible.contains(&self.token.kind) { 19,653 ( 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) . } 111,495 ( 0.01%) } . . // Public for rustfmt usage. . pub fn parse_ident(&mut self) -> PResult<'a, Ident> { 55,185 ( 0.00%) self.parse_ident_common(true) . } . . fn ident_or_err(&mut self) -> PResult<'a, (Ident, /* is_raw */ bool)> { 42,813 ( 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(), . }) . } . 97,972 ( 0.00%) fn parse_ident_common(&mut self, recover: bool) -> PResult<'a, Ident> { 13,996 ( 0.00%) let (ident, is_raw) = self.ident_or_err()?; 83,976 ( 0.00%) if !is_raw && ident.is_reserved() { . let mut err = self.expected_ident_found(); . if recover { . err.emit(); . } else { . return Err(err); . } . } 55,984 ( 0.00%) self.bump(); . Ok(ident) 139,960 ( 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. 1,163,393 ( 0.06%) fn check(&mut self, tok: &TokenKind) -> bool { 510,331 ( 0.03%) let is_present = self.token == *tok; 346,042 ( 0.02%) if !is_present { 720,691 ( 0.04%) self.expected_tokens.push(TokenType::Token(tok.clone())); . } . is_present 1,163,393 ( 0.06%) } . . /// Consumes a token 'tok' if it exists. Returns whether the given token was present. 212 ( 0.00%) pub fn eat(&mut self, tok: &TokenKind) -> bool { 244,467 ( 0.01%) let is_present = self.check(tok); 158,567 ( 0.01%) if is_present { 32,990 ( 0.00%) self.bump() . } . is_present 265 ( 0.00%) } . . /// If the next token is the given keyword, returns `true` without eating it. . /// An expectation is also added for diagnostics purposes. 42,490 ( 0.00%) fn check_keyword(&mut self, kw: Symbol) -> bool { 9,331 ( 0.00%) self.expected_tokens.push(TokenType::Keyword(kw)); 286,099 ( 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. 87,755 ( 0.00%) pub fn eat_keyword(&mut self, kw: Symbol) -> bool { 64,760 ( 0.00%) if self.check_keyword(kw) { 6,776 ( 0.00%) self.bump(); . true . } else { . false . } 87,755 ( 0.00%) } . . fn eat_keyword_noexpect(&mut self, kw: Symbol) -> bool { 9,958 ( 0.00%) if self.token.is_keyword(kw) { 2,203 ( 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. 990 ( 0.00%) fn expect_keyword(&mut self, kw: Symbol) -> PResult<'a, ()> { . if !self.eat_keyword(kw) { self.unexpected() } else { Ok(()) } 792 ( 0.00%) } . . /// Is the given keyword `kw` followed by a non-reserved identifier? 50,120 ( 0.00%) fn is_kw_followed_by_ident(&self, kw: Symbol) -> bool { 25,060 ( 0.00%) self.token.is_keyword(kw) && self.look_ahead(1, |t| t.is_ident() && !t.is_reserved_ident()) 56,385 ( 0.00%) } . 71,226 ( 0.00%) fn check_or_expected(&mut self, ok: bool, typ: TokenType) -> bool { 26,820 ( 0.00%) if ok { . true . } else { 14,200 ( 0.00%) self.expected_tokens.push(typ); . false . } 71,226 ( 0.00%) } . . fn check_ident(&mut self) -> bool { 14,555 ( 0.00%) self.check_or_expected(self.token.is_ident(), TokenType::Ident) . } . 24,112 ( 0.00%) fn check_path(&mut self) -> bool { 56,207 ( 0.00%) self.check_or_expected(self.token.is_path_start(), TokenType::Path) 30,140 ( 0.00%) } . . fn check_type(&mut self) -> bool { 6,870 ( 0.00%) self.check_or_expected(self.token.can_begin_type(), TokenType::Type) . } . . fn check_const_arg(&mut self) -> bool { 6,360 ( 0.00%) self.check_or_expected(self.token.can_begin_const_arg(), TokenType::Const) . } . 16,011 ( 0.00%) fn check_inline_const(&self, dist: usize) -> bool { 8,895 ( 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, . }) 16,011 ( 0.00%) } . . /// Checks to see if the next token is either `+` or `+=`. . /// Otherwise returns `false`. . fn check_plus(&mut self) -> bool { 7,404 ( 0.00%) self.check_or_expected( 3,702 ( 0.00%) self.token.is_like_plus(), 3,702 ( 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. 104,376 ( 0.01%) fn break_and_eat(&mut self, expected: TokenKind) -> bool { 60,886 ( 0.00%) if self.token.kind == expected { 4,608 ( 0.00%) self.bump(); . return true; . } 31,970 ( 0.00%) match self.token.kind.break_two_token_op() { 985 ( 0.00%) Some((first, second)) if first == expected => { 544 ( 0.00%) let first_span = self.sess.source_map().start_point(self.token.span); 680 ( 0.00%) let second_span = self.token.span.with_lo(first_span.hi()); 1,224 ( 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` 136 ( 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,904 ( 0.00%) self.bump_with((Token::new(second, second_span), self.token_spacing)); . true . } . _ => { 18,774 ( 0.00%) self.expected_tokens.push(TokenType::Token(expected)); . false . } . } 103,325 ( 0.01%) } . . /// Eats `+` possibly breaking tokens like `+=` in process. . fn eat_plus(&mut self) -> bool { 944 ( 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, ()> { 3,300 ( 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, ()> { 318 ( 0.00%) if self.break_and_eat(token::BinOp(token::Or)) { Ok(()) } else { self.unexpected() } . } . . /// Eats `<` possibly breaking tokens like `<<` in process. 5,108 ( 0.00%) fn eat_lt(&mut self) -> bool { 22,358 ( 0.00%) let ate = self.break_and_eat(token::Lt); 14,702 ( 0.00%) if ate { . // See doc comment for `unmatched_angle_bracket_count`. 3,552 ( 0.00%) self.unmatched_angle_bracket_count += 1; 3,706 ( 0.00%) self.max_angle_bracket_count += 1; . debug!("eat_lt: (increment) count={:?}", self.unmatched_angle_bracket_count); . } . ate 5,108 ( 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, ()> { 5,208 ( 0.00%) if self.break_and_eat(token::Gt) { . // See doc comment for `unmatched_angle_bracket_count`. 2,604 ( 0.00%) if self.unmatched_angle_bracket_count > 0 { 1,736 ( 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 { 18,993 ( 0.00%) TokenExpectType::Expect => self.check(k), 795 ( 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) { 20,128 ( 0.00%) if let token::CloseDelim(..) | token::Eof = self.token.kind { . break; . } 15,283 ( 0.00%) if let Some(ref t) = sep.sep { 17,898 ( 0.00%) if first { . first = false; . } else { 7,563 ( 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; . } . } . } . } . } . } 7,164 ( 0.00%) if sep.trailing_sep_allowed && self.expect_any_with_type(kets, expect) { . trailing = true; . break; . } . 5,132 ( 0.00%) let t = f(self)?; 5,335 ( 0.00%) v.push(t); . } . 13,800 ( 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)> { 14,320 ( 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. 22,210 ( 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 */)> { 9,130 ( 0.00%) let (val, trailing, recovered) = self.parse_seq_to_before_end(ket, sep, f)?; 4,458 ( 0.00%) if !recovered { . self.eat(ket); . } 24,136 ( 0.00%) Ok((val, trailing)) 17,768 ( 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)> { 8,378 ( 0.00%) self.expect(bra)?; 17,768 ( 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( 3,317 ( 0.00%) &token::OpenDelim(delim), 4,436 ( 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. 1,093,378 ( 0.05%) fn bump_with(&mut self, (next_token, next_spacing): (Token, Spacing)) { . // Bumping after EOF is a bad sign, usually an infinite loop. 504,636 ( 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. 336,424 ( 0.02%) self.prev_token = mem::replace(&mut self.token, next_token); 84,106 ( 0.00%) self.token_spacing = next_spacing; . . // Diagnostics. 84,106 ( 0.00%) self.expected_tokens.clear(); . } . . /// Advance the parser by one token. 671,760 ( 0.03%) pub fn bump(&mut self) { 335,880 ( 0.02%) let next_token = self.next_tok(self.token.span); 503,820 ( 0.02%) self.bump_with(next_token); 671,760 ( 0.03%) } . . /// Look-ahead `dist` tokens of `self.token` and get access to that token there. . /// When `dist == 0` then the current token is looked at. 312 ( 0.00%) pub fn look_ahead(&self, dist: usize, looker: impl FnOnce(&Token) -> R) -> R { 6,056 ( 0.00%) if dist == 0 { 2,452 ( 0.00%) return looker(&self.token); . } . 21,061 ( 0.00%) let frame = &self.token_cursor.frame; 23,258 ( 0.00%) if frame.delim != DelimToken::NoDelim { . let all_normal = (0..dist).all(|i| { 63,985 ( 0.00%) let token = frame.tree_cursor.look_ahead(i); 84,790 ( 0.00%) !matches!(token, Some(TokenTree::Delimited(_, DelimToken::NoDelim, _))) . }); . if all_normal { 104,151 ( 0.01%) return match frame.tree_cursor.look_ahead(dist - 1) { 36,681 ( 0.00%) Some(tree) => match tree { 16,994 ( 0.00%) TokenTree::Token(token) => looker(token), . TokenTree::Delimited(dspan, delim, _) => { 11,600 ( 0.00%) looker(&Token::new(token::OpenDelim(*delim), dspan.open)) . } . }, 17,888 ( 0.00%) None => looker(&Token::new(token::CloseDelim(frame.delim), frame.span.close)), . }; . } . } . . let mut cursor = self.token_cursor.clone(); . let mut i = 0; 2,570 ( 0.00%) let mut token = Token::dummy(); 1,594 ( 0.00%) while i < dist { 18,692 ( 0.00%) token = cursor.next().0; 8,292 ( 0.00%) if matches!( 5,166 ( 0.00%) token.kind, . token::OpenDelim(token::NoDelim) | token::CloseDelim(token::NoDelim) . ) { . continue; . } 785 ( 0.00%) i += 1; . } 251 ( 0.00%) return looker(&token); 342 ( 0.00%) } . . /// Returns whether any of the given keywords are `dist` tokens ahead of the current one. 24,822 ( 0.00%) fn is_keyword_ahead(&self, dist: usize, kws: &[Symbol]) -> bool { 6,773 ( 0.00%) self.look_ahead(dist, |t| kws.iter().any(|&kw| t.is_keyword(kw))) 24,822 ( 0.00%) } . . /// Parses asyncness: `async` or nothing. . fn parse_asyncness(&mut self) -> Async { . if self.eat_keyword(kw::Async) { 65 ( 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. 1,332 ( 0.00%) fn parse_unsafety(&mut self) -> Unsafe { . if self.eat_keyword(kw::Unsafe) { 5 ( 0.00%) Unsafe::Yes(self.prev_token.uninterpolated_span()) . } else { . Unsafe::No . } 5,328 ( 0.00%) } . . /// Parses constness: `const` or nothing. 13,064 ( 0.00%) fn parse_constness(&mut self) -> Const { . // Avoid const blocks to be parsed as const items 3,871 ( 0.00%) if self.look_ahead(1, |t| t != &token::OpenDelim(DelimToken::Brace)) . && self.eat_keyword(kw::Const) . { 60 ( 0.00%) Const::Yes(self.prev_token.uninterpolated_span()) . } else { . Const::No . } 22,862 ( 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). 236 ( 0.00%) fn parse_mutability(&mut self) -> Mutability { . if self.eat_keyword(kw::Mut) { Mutability::Mut } else { Mutability::Not } 1,455 ( 0.00%) } . . /// Possibly parses mutability (`const` or `mut`). . 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 . } . } . . fn parse_field_name(&mut self) -> PResult<'a, Ident> { 610 ( 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 { 915 ( 0.00%) self.parse_ident_common(true) . } . } . . fn parse_mac_args(&mut self) -> PResult<'a, P> { 1,716 ( 0.00%) self.parse_mac_args_common(true).map(P) . } . . fn parse_attr_args(&mut self) -> PResult<'a, MacArgs> { 1,908 ( 0.00%) self.parse_mac_args_common(false) . } . 11,637 ( 0.00%) fn parse_mac_args_common(&mut self, delimited_only: bool) -> PResult<'a, MacArgs> { 10,344 ( 0.00%) Ok( 7,339 ( 0.00%) if self.check(&token::OpenDelim(DelimToken::Paren)) 663 ( 0.00%) || self.check(&token::OpenDelim(DelimToken::Bracket)) 648 ( 0.00%) || self.check(&token::OpenDelim(DelimToken::Brace)) . { 4,808 ( 0.00%) match self.parse_token_tree() { 6,010 ( 0.00%) TokenTree::Delimited(dspan, delim, tokens) => . // We've confirmed above that there is a delimiter so unwrapping is OK. . { 2,404 ( 0.00%) MacArgs::Delimited(dspan, MacDelimiter::from_token(delim).unwrap(), tokens) . } . _ => unreachable!(), . } 182 ( 0.00%) } else if !delimited_only { . if self.eat(&token::Eq) { 5 ( 0.00%) let eq_span = self.prev_token.span; . . // Collect tokens because they are used during lowering to HIR. 5 ( 0.00%) let expr = self.parse_expr_force_collect()?; 5 ( 0.00%) let span = expr.span; . 25 ( 0.00%) let token_kind = token::Interpolated(Lrc::new(token::NtExpr(expr))); 45 ( 0.00%) MacArgs::Eq(eq_span, Token::new(token_kind, span)) . } else { . MacArgs::Empty . } . } else { . return self.unexpected(); . }, . ) 9,051 ( 0.00%) } . . fn parse_or_use_outer_attributes( . &mut self, . already_parsed_attrs: Option, . ) -> PResult<'a, AttrWrapper> { 15,989 ( 0.00%) if let Some(attrs) = already_parsed_attrs { . Ok(attrs) . } else { 8,750 ( 0.00%) self.parse_outer_attributes() . } . } . . /// Parses a single token tree from the input. 22,984 ( 0.00%) pub(crate) fn parse_token_tree(&mut self) -> TokenTree { 13,027 ( 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. 67,040 ( 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. 46,642 ( 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; 3,542 ( 0.00%) let stream = frame.tree_cursor.stream.clone(); 3,542 ( 0.00%) let span = frame.span; 1,771 ( 0.00%) let delim = frame.delim; . // Consume close delimiter 3,542 ( 0.00%) self.bump(); 8,855 ( 0.00%) TokenTree::Delimited(span, delim, stream) . } . token::CloseDelim(_) | token::Eof => unreachable!(), . _ => { 2,204 ( 0.00%) self.bump(); 5,510 ( 0.00%) TokenTree::Token(self.prev_token.clone()) . } . } 20,111 ( 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) -- line 1234 ---------------------------------------- -- line 1244 ---------------------------------------- . } . TokenStream::new(result) . } . . /// 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 { 5,844 ( 0.00%) let old = self.restrictions; 7,406 ( 0.00%) self.restrictions = res; . let res = f(self); 7,414 ( 0.00%) self.restrictions = old; . res . } . 23,920 ( 0.00%) fn is_crate_vis(&self) -> bool { 14,950 ( 0.00%) self.token.is_keyword(kw::Crate) && self.look_ahead(1, |t| t != &token::ModSep) 26,910 ( 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. 22,660 ( 0.00%) pub fn parse_visibility(&mut self, fbt: FollowedByType) -> PResult<'a, Visibility> { 6,973 ( 0.00%) maybe_whole!(self, NtVis, |x| x); . 2,027 ( 0.00%) self.expected_tokens.push(TokenType::Keyword(kw::Crate)); 8,108 ( 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". 1,737 ( 0.00%) return Ok(Visibility { 5,211 ( 0.00%) span: self.token.span.shrink_to_lo(), . kind: VisibilityKind::Inherited, . tokens: None, . }); . } 290 ( 0.00%) let lo = self.prev_token.span; . 1,450 ( 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. 875 ( 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)`. 231 ( 0.00%) self.bump(); // `(` 154 ( 0.00%) self.bump(); // `crate` 231 ( 0.00%) self.expect(&token::CloseDelim(token::Paren))?; // `)` 77 ( 0.00%) let vis = VisibilityKind::Crate(CrateSugar::PubCrate); . return Ok(Visibility { 231 ( 0.00%) span: lo.to(self.prev_token.span), . kind: vis, . tokens: None, . }); 182 ( 0.00%) } else if self.is_keyword_ahead(1, &[kw::In]) { . // Parse `pub(in path)`. . self.bump(); // `(` . self.bump(); // `in` . let path = self.parse_path(PathStyle::Mod)?; // `path` . self.expect(&token::CloseDelim(token::Paren))?; // `)` . let vis = VisibilityKind::Restricted { path: P(path), id: ast::DUMMY_NODE_ID }; . return Ok(Visibility { . 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. . } . } . 561 ( 0.00%) Ok(Visibility { span: lo, kind: VisibilityKind::Public, tokens: None }) 20,394 ( 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 { 477 ( 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, . } . } . 980 ( 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, 227 ( 0.00%) |this, _attrs| Ok((f(this)?, TrailingToken::None)), . ) 980 ( 0.00%) } . . /// `::{` or `::*` 93,016 ( 0.00%) fn is_import_coupler(&mut self) -> bool { 46,508 ( 0.00%) self.check(&token::ModSep) . && self.look_ahead(1, |t| { 34,533 ( 0.00%) *t == token::OpenDelim(token::Brace) || *t == token::BinOp(token::Star) . }) 88,092 ( 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) . } . 44,336 ( 0.00%) pub fn emit_unclosed_delims(unclosed_delims: &mut Vec, sess: &ParseSess) { 22,168 ( 0.00%) *sess.reached_eof.borrow_mut() |= . unclosed_delims.iter().any(|unmatched_delim| unmatched_delim.found_delim.is_none()); 22,168 ( 0.00%) for unmatched in unclosed_delims.drain(..) { . if let Some(mut e) = make_unclosed_delims_error(unmatched, sess) { . e.emit(); . } . } 44,336 ( 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 1,472 ( 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 ---------------------------------------- 495,722 ( 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. 1,128,915 ( 0.06%) #[derive(Debug, Clone, PartialEq, Encodable, Decodable, HashStable_Generic)] . pub enum TokenTree { . /// A single token. 311,693 ( 0.02%) Token(Token), . /// A delimited sequence of token trees. 29,990 ( 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 { 2,962 ( 0.00%) match self { 1,491 ( 0.00%) TokenTree::Token(token) => token.span, 1,380 ( 0.00%) TokenTree::Delimited(sp, ..) => sp.entire(), . } 1,137 ( 0.00%) } . . /// Modify the `TokenTree`'s span in-place. . pub fn set_span(&mut self, span: Span) { 2,962 ( 0.00%) match self { 1,137 ( 0.00%) TokenTree::Token(token) => token.span = span, 688 ( 0.00%) TokenTree::Delimited(dspan, ..) => *dspan = DelimSpan::from_single(span), . } 1,481 ( 0.00%) } . 1,250 ( 0.00%) pub fn token(kind: TokenKind, span: Span) -> TokenTree { 99,224 ( 0.00%) TokenTree::Token(Token::new(kind, span)) 1,250 ( 0.00%) } . . /// Returns the opening delimiter as a token tree. 11,891 ( 0.00%) pub fn open_tt(span: DelimSpan, delim: DelimToken) -> TokenTree { 35,673 ( 0.00%) TokenTree::token(token::OpenDelim(delim), span.open) 11,891 ( 0.00%) } . . /// Returns the closing delimiter as a token tree. 11,665 ( 0.00%) pub fn close_tt(span: DelimSpan, delim: DelimToken) -> TokenTree { 34,995 ( 0.00%) TokenTree::token(token::CloseDelim(delim), span.close) 11,665 ( 0.00%) } . 4,989 ( 0.00%) pub fn uninterpolate(self) -> TokenTree { 3,326 ( 0.00%) match self { 14,967 ( 0.00%) TokenTree::Token(token) => TokenTree::Token(token.uninterpolate().into_owned()), . tt => tt, . } 6,652 ( 0.00%) } . } . . impl HashStable for TokenStream . where . CTX: crate::HashStableContext, . { 3,573 ( 0.00%) fn hash_stable(&self, hcx: &mut CTX, hasher: &mut StableHasher) { 13,396 ( 0.00%) for sub_tt in self.trees() { . sub_tt.hash_stable(hcx, hasher); . } 3,176 ( 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 { 152 ( 0.00%) pub fn new(inner: impl CreateTokenStream + 'static) -> LazyTokenStream { . LazyTokenStream(Lrc::new(Box::new(inner))) 152 ( 0.00%) } . . pub fn create_token_stream(&self) -> AttrAnnotatedTokenStream { 169 ( 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` 574 ( 0.00%) #[derive(Clone, Debug, Encodable, Decodable)] . pub enum AttrAnnotatedTokenTree { 168 ( 0.00%) Token(Token), 30 ( 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 { 16,782 ( 0.00%) pub fn new(tokens: Vec<(AttrAnnotatedTokenTree, Spacing)>) -> AttrAnnotatedTokenStream { . AttrAnnotatedTokenStream(Lrc::new(tokens)) 16,782 ( 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. 18 ( 0.00%) pub fn to_tokenstream(&self) -> TokenStream { 103 ( 0.00%) let trees: Vec<_> = self . .0 . .iter() 1,637 ( 0.00%) .flat_map(|tree| match &tree.0 { 798 ( 0.00%) AttrAnnotatedTokenTree::Token(inner) => { 1,995 ( 0.00%) smallvec![(TokenTree::Token(inner.clone()), tree.1)].into_iter() . } 1,700 ( 0.00%) AttrAnnotatedTokenTree::Delimited(span, delim, stream) => smallvec![( 255 ( 0.00%) TokenTree::Delimited(*span, *delim, stream.to_tokenstream()), 85 ( 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 { 10 ( 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(); 49 ( 0.00%) for attr in outer_attrs { . // FIXME: Make this more efficient 30 ( 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) 36 ( 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 64 ( 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); . 109,931 ( 0.01%) #[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 { 25 ( 0.00%) AttrAnnotatedTokenStream::new(vec![(tree, spacing)]) . } . } . . impl From for TokenStream { . fn from(tree: TokenTree) -> TokenStream { 1,250 ( 0.00%) TokenStream::new(vec![(tree, Spacing::Alone)]) . } . } . . impl From for TreeAndSpacing { . fn from(tree: TokenTree) -> TreeAndSpacing { 40,368 ( 0.00%) (tree, Spacing::Alone) . } . } . . impl iter::FromIterator for TokenStream { . fn from_iter>(iter: I) -> Self { 8 ( 0.00%) TokenStream::new(iter.into_iter().map(Into::into).collect::>()) . } . } . . impl Eq for TokenStream {} . . impl PartialEq for TokenStream { . fn eq(&self, other: &TokenStream) -> bool { . self.trees().eq(other.trees()) -- line 399 ---------------------------------------- -- line 401 ---------------------------------------- . } . . impl TokenStream { . pub fn new(streams: Vec) -> TokenStream { . TokenStream(Lrc::new(streams)) . } . . pub fn is_empty(&self) -> bool { 6,000 ( 0.00%) self.0.is_empty() 6,000 ( 0.00%) } . . pub fn len(&self) -> usize { 121,737 ( 0.01%) self.0.len() 378 ( 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 { 2,858 ( 0.00%) self.clone().into_trees() 5,716 ( 0.00%) } . 14,058 ( 0.00%) pub fn into_trees(self) -> Cursor { . Cursor::new(self) 28,116 ( 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 { 329 ( 0.00%) TokenStream(Lrc::new( . self.0 . .iter() . .enumerate() 8,886 ( 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; . 49,830 ( 0.00%) fn next(&mut self) -> Option { 102,685 ( 0.01%) self.next_with_spacing().map(|(tree, _)| tree) 66,440 ( 0.00%) } . } . . impl Cursor { . fn new(stream: TokenStream) -> Self { . Cursor { stream, index: 0 } . } . 521,855 ( 0.03%) pub fn next_with_spacing(&mut self) -> Option { 362,943 ( 0.02%) if self.index < self.stream.len() { 179,888 ( 0.01%) self.index += 1; 538,097 ( 0.03%) Some(self.stream.0[self.index - 1].clone()) . } else { 55,000 ( 0.00%) None . } 626,226 ( 0.03%) } . . 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; . } . 42,724 ( 0.00%) pub fn look_ahead(&self, n: usize) -> Option<&TokenTree> { 85,448 ( 0.00%) self.stream.0[self.index..].get(n).map(|(tree, _)| tree) 85,448 ( 0.00%) } . } . 61,671 ( 0.00%) #[derive(Debug, Copy, Clone, PartialEq, Encodable, Decodable, HashStable_Generic)] . pub struct DelimSpan { . pub open: Span, . pub close: Span, . } . . impl DelimSpan { 16 ( 0.00%) pub fn from_single(sp: Span) -> Self { . DelimSpan { open: sp, close: sp } 32 ( 0.00%) } . 12,064 ( 0.00%) pub fn from_pair(open: Span, close: Span) -> Self { . DelimSpan { open, close } 6,032 ( 0.00%) } . . pub fn dummy() -> Self { . Self::from_single(DUMMY_SP) 5,733 ( 0.00%) } . 22,296 ( 0.00%) pub fn entire(self) -> Span { . self.open.with_hi(self.close.hi()) 16,722 ( 0.00%) } . } 24,863 ( 0.00%) -------------------------------------------------------------------------------- -- 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). 458 ( 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, 99,627 ( 0.00%) PartialEq, . Eq, . Hash, . TyEncodable, 27,076 ( 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"), . } . } . } . 433,684 ( 0.02%) #[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, . } . 119,884 ( 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. 31,170 ( 0.00%) pub fn and(&mut self, constness: hir::Constness) -> hir::Constness { 46,755 ( 0.00%) match (constness, self) { . (hir::Constness::Const, BoundConstness::ConstIfConst) => hir::Constness::Const, . (_, this) => { 54,340 ( 0.00%) *this = BoundConstness::NotConst; . hir::Constness::NotConst . } . } 15,585 ( 0.00%) } . } . . impl fmt::Display for BoundConstness { . fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { . match self { . Self::NotConst => f.write_str("normal"), . Self::ConstIfConst => f.write_str("`~const`"), . } -- line 256 ---------------------------------------- -- line 275 ---------------------------------------- . /// Tuple containing the types of closure captures after the feature `capture_disjoint_fields` . pub after_feature_tys: Ty<'tcx>, . } . . pub trait DefIdTree: Copy { . fn parent(self, id: DefId) -> Option; . . fn is_descendant_of(self, mut descendant: DefId, ancestor: DefId) -> bool { 10 ( 0.00%) if descendant.krate != ancestor.krate { . return false; . } . 24,079 ( 0.00%) while descendant != ancestor { 36,854 ( 0.00%) match self.parent(descendant) { . Some(parent) => descendant = parent, . None => return false, . } . } . true . } . } . . impl<'tcx> DefIdTree for TyCtxt<'tcx> { 19,534 ( 0.00%) fn parent(self, id: DefId) -> Option { . self.def_key(id).parent.map(|index| DefId { index, ..id }) 29,301 ( 0.00%) } . } . . impl Visibility { 300 ( 0.00%) pub fn from_hir(visibility: &hir::Visibility<'_>, id: hir::HirId, tcx: TyCtxt<'_>) -> Self { 900 ( 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 => { 536 ( 0.00%) Visibility::Restricted(tcx.parent_module(id).to_def_id()) . } . } 300 ( 0.00%) } . . /// Returns `true` if an item with this visibility is accessible from the given block. 63,630 ( 0.00%) pub fn is_accessible_from(self, module: DefId, tree: T) -> bool { 279,779 ( 0.01%) 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. 7,921 ( 0.00%) Visibility::Restricted(other) if other.krate != module.krate => return false, . Visibility::Restricted(module) => module, . }; . . tree.is_descendant_of(module, restriction) 63,630 ( 0.00%) } . . /// Returns `true` if this visibility is at least as accessible as the given visibility 4,968 ( 0.00%) pub fn is_at_least(self, vis: Visibility, tree: T) -> bool { 19,930 ( 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) 4,968 ( 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 { 30,712 ( 0.00%) matches!(self, Visibility::Public) 15,355 ( 0.00%) } . } . . /// The crate variances map is computed during typeck and contains the . /// variance of every item in the local crate. You should not use it . /// directly, because to do so will make your pass dependent on the . /// HIR of every item in the local crate. Instead, use . /// `tcx.variances_of()` to get the variance for a *particular* . /// item. -- line 365 ---------------------------------------- -- line 509 ---------------------------------------- . #[derive(Clone, Copy, Lift)] . pub struct Predicate<'tcx> { . inner: &'tcx PredicateInner<'tcx>, . } . . impl<'tcx> PartialEq for Predicate<'tcx> { . fn eq(&self, other: &Self) -> bool { . // `self.kind` is always interned. 110,171 ( 0.01%) ptr::eq(self.inner, other.inner) 103,053 ( 0.01%) } . } . . 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>> { 794,904 ( 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); . } . } . 3,504,782 ( 0.17%) #[derive(Clone, Copy, PartialEq, Eq, Hash, TyEncodable, TyDecodable)] 2,455,457 ( 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. 549 ( 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. 1,237 ( 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. 21,708 ( 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,412 ( 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)); 21,708 ( 0.00%) tcx.reuse_or_mk_predicate(self, ty::Binder::bind_with_vars(new, bound_vars)) 16,884 ( 0.00%) } . } . 8,261 ( 0.00%) #[derive(Clone, Copy, PartialEq, Eq, Hash, TyEncodable, TyDecodable)] 192,465 ( 0.01%) #[derive(HashStable, TypeFoldable)] . pub struct TraitPredicate<'tcx> { . pub trait_ref: TraitRef<'tcx>, . 385,412 ( 0.02%) pub constness: BoundConstness, . 382,847 ( 0.02%) pub polarity: ImplPolarity, . } . . pub type PolyTraitPredicate<'tcx> = ty::Binder<'tcx, TraitPredicate<'tcx>>; . . impl<'tcx> TraitPredicate<'tcx> { 312,896 ( 0.02%) pub fn remap_constness(&mut self, tcx: TyCtxt<'tcx>, param_env: &mut ParamEnv<'tcx>) { 274,456 ( 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` 672 ( 0.00%) param_env.remap_constness_with(self.constness) . } else { 38,776 ( 0.00%) *param_env = param_env.with_constness(self.constness.and(param_env.constness())) . } 234,672 ( 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 { 58,494 ( 0.00%) self.trait_ref.def_id 29,247 ( 0.00%) } . 48,012 ( 0.00%) pub fn self_ty(self) -> Ty<'tcx> { 144,036 ( 0.01%) self.trait_ref.self_ty() 96,024 ( 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() 61,266 ( 0.00%) } . 1,866 ( 0.00%) pub fn self_ty(self) -> ty::Binder<'tcx, Ty<'tcx>> { 7,464 ( 0.00%) self.map_bound(|trait_ref| trait_ref.self_ty()) 3,732 ( 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 . }); . } . } . 198 ( 0.00%) #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)] 32,444 ( 0.00%) #[derive(HashStable, TypeFoldable)] 42,100 ( 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)] 2,825 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub struct SubtypePredicate<'tcx> { 4,804 ( 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)] 7 ( 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>>; . 41,405 ( 0.00%) #[derive(Debug, Copy, Clone, PartialEq, Eq, Hash, PartialOrd, Ord, TyEncodable, TyDecodable)] 28,215 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub enum Term<'tcx> { 2,384 ( 0.00%) Ty(Ty<'tcx>), . Const(&'tcx Const<'tcx>), . } . . impl<'tcx> From> for Term<'tcx> { . fn from(ty: Ty<'tcx>) -> Self { . Term::Ty(ty) 2,961 ( 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> { 3,596 ( 0.00%) if let Term::Ty(ty) = self { Some(ty) } else { None } 1,798 ( 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)] 4,680 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub struct ProjectionPredicate<'tcx> { . pub projection_ty: ProjectionTy<'tcx>, 14,206 ( 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 { 176 ( 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. 168 ( 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. 1,060 ( 0.00%) self.skip_binder().projection_ty.item_def_id 530 ( 0.00%) } . } . . pub trait ToPolyTraitRef<'tcx> { . fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx>; . } . . impl<'tcx> ToPolyTraitRef<'tcx> for PolyTraitPredicate<'tcx> { 5,891 ( 0.00%) fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx> { 5,891 ( 0.00%) self.map_bound_ref(|trait_pred| trait_pred.trait_ref) 5,891 ( 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> { 16,885 ( 0.00%) fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> { 84,425 ( 0.00%) self.map_bound(PredicateKind::Trait).to_predicate(tcx) 33,770 ( 0.00%) } . } . . impl<'tcx> ToPredicate<'tcx> for PolyRegionOutlivesPredicate<'tcx> { 58 ( 0.00%) fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> { 116 ( 0.00%) self.map_bound(PredicateKind::RegionOutlives).to_predicate(tcx) 116 ( 0.00%) } . } . . impl<'tcx> ToPredicate<'tcx> for PolyTypeOutlivesPredicate<'tcx> { 133 ( 0.00%) fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> { 266 ( 0.00%) self.map_bound(PredicateKind::TypeOutlives).to_predicate(tcx) 266 ( 0.00%) } . } . . impl<'tcx> ToPredicate<'tcx> for PolyProjectionPredicate<'tcx> { 364 ( 0.00%) fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> { 1,820 ( 0.00%) self.map_bound(PredicateKind::Projection).to_predicate(tcx) 728 ( 0.00%) } . } . . impl<'tcx> Predicate<'tcx> { 27,928 ( 0.00%) pub fn to_opt_poly_trait_pred(self) -> Option> { . let predicate = self.kind(); 83,784 ( 0.00%) match predicate.skip_binder() { 63,150 ( 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,334 ( 0.00%) | PredicateKind::TypeWellFormedFromEnv(..) => None, . } 27,928 ( 0.00%) } . 1,734 ( 0.00%) pub fn to_opt_type_outlives(self) -> Option> { . let predicate = self.kind(); 3,468 ( 0.00%) match predicate.skip_binder() { 135 ( 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(..) 1,689 ( 0.00%) | PredicateKind::TypeWellFormedFromEnv(..) => None, . } 1,734 ( 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]]`. 62,665 ( 0.00%) #[derive(Clone, Debug, TypeFoldable)] . pub struct InstantiatedPredicates<'tcx> { . pub predicates: Vec>, . pub spans: Vec, . } . . impl<'tcx> InstantiatedPredicates<'tcx> { 146 ( 0.00%) pub fn empty() -> InstantiatedPredicates<'tcx> { 42,964 ( 0.00%) InstantiatedPredicates { predicates: vec![], spans: vec![] } 146 ( 0.00%) } . . pub fn is_empty(&self) -> bool { . self.predicates.is_empty() 28 ( 0.00%) } . } . 77 ( 0.00%) #[derive(Copy, Clone, Debug, PartialEq, Eq, HashStable, TyEncodable, TyDecodable, TypeFoldable)] . pub struct OpaqueTypeKey<'tcx> { . pub def_id: DefId, 14 ( 0.00%) 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 . /// visible. Universes are arranged into a tree: the root universe . /// contains names that are always visible. Each child then adds a new . /// set of names that are visible, in addition to those of its parent. -- line 1046 ---------------------------------------- -- 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. 24,254 ( 0.00%) pub fn next_universe(self) -> UniverseIndex { . UniverseIndex::from_u32(self.private.checked_add(1).unwrap()) 72,762 ( 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 { 47,664 ( 0.00%) self.private >= other.private 23,832 ( 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 { 272 ( 0.00%) self.private < other.private 136 ( 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 { 4,631 ( 0.00%) pub universe: UniverseIndex, 2,579 ( 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`. 2,329 ( 0.00%) #[derive(Copy, Clone, Debug, TypeFoldable, Lift, TyEncodable, TyDecodable)] . #[derive(PartialEq, Eq, PartialOrd, Ord)] . #[derive(Hash, HashStable)] . pub struct WithOptConstParam { 5,275 ( 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`. 4,608 ( 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 } 9,344 ( 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> { 1,393 ( 0.00%) if self.const_param_did.is_none() { 2,305 ( 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 } . } . 64 ( 0.00%) pub fn def_id_for_type_of(self) -> DefId { 51 ( 0.00%) if let Some(did) = self.const_param_did { did } else { self.did.to_def_id() } 16 ( 0.00%) } . } . . impl WithOptConstParam { 988 ( 0.00%) pub fn as_local(self) -> Option> { . self.did . .as_local() . .map(|did| WithOptConstParam { did, const_param_did: self.const_param_did }) 988 ( 0.00%) } . . pub fn as_const_arg(self) -> Option<(LocalDefId, DefId)> { 1,708 ( 0.00%) if let Some(param_did) = self.const_param_did { 714 ( 0.00%) if let Some(did) = self.did.as_local() { . return Some((did, param_did)); . } . } . . None 732 ( 0.00%) } . . pub fn is_local(self) -> bool { . self.did.is_local() . } . 394 ( 0.00%) pub fn def_id_for_type_of(self) -> DefId { . self.const_param_did.unwrap_or(self.did) 394 ( 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 { 64,632 ( 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 { 624,765 ( 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 }) } . } . 30 ( 0.00%) pub fn with_user_facing(mut self) -> Self { . self.packed.set_tag(ParamTag { reveal: Reveal::UserFacing, ..self.packed.tag() }); . self 30 ( 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) { 8,024 ( 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 5,368 ( 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(), . ) 6,039 ( 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. 83,860 ( 0.00%) pub fn and>(self, value: T) -> ParamEnvAnd<'tcx, T> { . match self.reveal() { . Reveal::UserFacing => ParamEnvAnd { param_env: self, value }, . . Reveal::All => { 5,324 ( 0.00%) if value.is_global() { . ParamEnvAnd { param_env: self.without_caller_bounds(), value } . } else { . ParamEnvAnd { param_env: self, value } . } . } . } 81,906 ( 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,330 ( 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) . } . } . 1,804 ( 0.00%) #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, TypeFoldable)] . pub struct ParamEnvAnd<'tcx, T> { 23,439 ( 0.00%) pub param_env: ParamEnv<'tcx>, 370,519 ( 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(); 2,434 ( 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, . } . 3,397 ( 0.00%) bitflags! { 6,174 ( 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. 289,972 ( 0.01%) #[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. 6,608 ( 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; 826 ( 0.00%) if is_field_list_non_exhaustive { . flags |= VariantFlags::IS_FIELD_LIST_NON_EXHAUSTIVE; . } . 2,478 ( 0.00%) if recovered { . flags |= VariantFlags::IS_RECOVERED; . } . 7,434 ( 0.00%) VariantDef { . def_id: variant_did.unwrap_or(parent_did), . ctor_def_id, . name, . discr, 3,304 ( 0.00%) fields, . ctor_kind, . flags, . } 3,304 ( 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` 4,340 ( 0.00%) pub fn ident(&self, tcx: TyCtxt<'_>) -> Ident { 2,480 ( 0.00%) Ident::new(self.name, tcx.def_ident_span(self.def_id).unwrap()) 5,580 ( 0.00%) } . } . 186,656 ( 0.01%) #[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), . } . 362,420 ( 0.02%) #[derive(Debug, HashStable, TyEncodable, TyDecodable)] . pub struct FieldDef { . pub did: DefId, . pub name: Symbol, . pub vis: Visibility, . } . 2,018 ( 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, 266,964 ( 0.01%) #[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,014 ( 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 234 ( 0.00%) if let Some(user_seed) = tcx.sess.opts.debugging_opts.layout_seed { . field_shuffle_seed ^= user_seed; . } . 312 ( 0.00%) for attr in tcx.get_attrs(did).iter() { 905 ( 0.00%) for r in attr::find_repr_attrs(&tcx.sess, attr) { . flags.insert(match r { . attr::ReprC => ReprFlags::IS_C, . attr::ReprPacked(pack) => { . let pack = Align::from_bytes(pack as u64).unwrap(); . min_pack = Some(if let Some(min_pack) = min_pack { . min_pack.min(pack) . } else { . pack -- line 1740 ---------------------------------------- -- line 1753 ---------------------------------------- . ReprFlags::empty() . } . }); . } . } . . // If `-Z randomize-layout` was enabled for the type definition then we can . // consider performing layout randomization 624 ( 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. 468 ( 0.00%) if !tcx.consider_optimizing(|| format!("Reorder fields of {:?}", tcx.def_path_str(did))) { . flags.insert(ReprFlags::IS_LINEAR); . } . 156 ( 0.00%) Self { int: size, align: max_align, pack: min_pack, flags, field_shuffle_seed } 2,184 ( 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 { 2,519 ( 0.00%) self.int.unwrap_or(attr::SignedInt(ast::IntTy::Isize)) 1,390 ( 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 { 370 ( 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 { 1,002 ( 0.00%) if let Some(pack) = self.pack { . if pack.bytes() == 1 { . return true; . } . } . 2,016 ( 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 { 498 ( 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`]. 96,383 ( 0.00%) pub fn ty(&self, tcx: TyCtxt<'tcx>, subst: SubstsRef<'tcx>) -> Ty<'tcx> { 27,538 ( 0.00%) tcx.type_of(self.did).subst(tcx, subst) 110,152 ( 0.01%) } . . /// Computes the `Ident` of this variant by looking up the `Span` 21,497 ( 0.00%) pub fn ident(&self, tcx: TyCtxt<'_>) -> Ident { 12,284 ( 0.00%) Ident::new(self.name, tcx.def_ident_span(self.did).unwrap()) 27,639 ( 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> { 21,032 ( 0.00%) pub fn typeck_body(self, body: hir::BodyId) -> &'tcx TypeckResults<'tcx> { 5,258 ( 0.00%) self.typeck(self.hir().body_owner_def_id(body)) 21,032 ( 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()) . } . 126 ( 0.00%) fn item_name_from_def_id(self, def_id: DefId) -> Option { 14 ( 0.00%) if def_id.index == CRATE_DEF_INDEX { . Some(self.crate_name(def_id.krate)) . } else { 42 ( 0.00%) let def_key = self.def_key(def_id); 70 ( 0.00%) match def_key.disambiguated_data.data { . // The name of a constructor is that of its parent. . rustc_hir::definitions::DefPathData::Ctor => self.item_name_from_def_id(DefId { . krate: def_id.krate, . index: def_key.parent.unwrap(), . }), 28 ( 0.00%) _ => def_key.disambiguated_data.data.get_opt_name(), . } . } 112 ( 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 98 ( 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. 14 ( 0.00%) self.item_name_from_def_id(id).unwrap_or_else(|| { . bug!("item_name: no name for {:?}", self.def_path(id)); . }) 70 ( 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)) . } . 395,520 ( 0.02%) pub fn opt_associated_item(self, def_id: DefId) -> Option<&'tcx AssocItem> { 158,208 ( 0.01%) if let DefKind::AssocConst | DefKind::AssocFn | DefKind::AssocTy = self.def_kind(def_id) { . Some(self.associated_item(def_id)) . } else { . None . } 355,968 ( 0.02%) } . 2,137 ( 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") 4,274 ( 0.00%) } . 18 ( 0.00%) pub fn find_field_index(self, ident: Ident, variant: &VariantDef) -> Option { . variant . .fields . .iter() 44 ( 0.00%) .position(|field| self.hygienic_eq(ident, field.ident(self), variant.def_id)) 18 ( 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. 3,700 ( 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()) 740 ( 0.00%) || self.impl_trait_ref(def_id2).map_or(false, |tr| tr.references_error()) . { . return Some(ImplOverlapKind::Permitted { marker: false }); . } . 3,700 ( 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 = { 3,700 ( 0.00%) let is_marker_impl = |def_id: DefId| -> bool { 1,110 ( 0.00%) let trait_ref = self.impl_trait_ref(def_id); 1,110 ( 0.00%) trait_ref.map_or(false, |tr| self.trait_def(tr.def_id).is_marker) 2,960 ( 0.00%) }; 1,480 ( 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 { 1,480 ( 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 . } 2,960 ( 0.00%) } . . /// Returns `ty::VariantDef` if `res` refers to a struct, . /// or variant or their constructors, panics otherwise. 1,589 ( 0.00%) pub fn expect_variant_res(self, res: Res) -> &'tcx VariantDef { 2,724 ( 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), . } 1,816 ( 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. 151,050 ( 0.01%) pub fn get_attrs(self, did: DefId) -> Attributes<'tcx> { 45,315 ( 0.00%) if let Some(did) = did.as_local() { 38,061 ( 0.00%) self.hir().attrs(self.hir().local_def_id_to_hir_id(did)) . } else { . self.item_attrs(did) . } 120,840 ( 0.01%) } . . /// Determines whether an item is annotated with an attribute. 17,440 ( 0.00%) pub fn has_attr(self, did: DefId, attr: Symbol) -> bool { 54,288 ( 0.00%) self.sess.contains_name(&self.get_attrs(did), attr) . } . . /// Determines whether an item is annotated with `doc(hidden)`. 1,792 ( 0.00%) pub fn is_doc_hidden(self, did: DefId) -> bool { 256 ( 0.00%) self.get_attrs(did) . .iter() 201 ( 0.00%) .filter_map(|attr| if attr.has_name(sym::doc) { attr.meta_item_list() } else { None }) . .any(|items| items.iter().any(|item| item.has_name(sym::hidden))) 2,048 ( 0.00%) } . . /// Returns `true` if this is an `auto trait`. 38,311 ( 0.00%) pub fn trait_is_auto(self, trait_def_id: DefId) -> bool { 5,473 ( 0.00%) self.trait_def(trait_def_id).has_auto_impl 43,784 ( 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`. 10,290 ( 0.00%) pub fn trait_id_of_impl(self, def_id: DefId) -> Option { . self.impl_trait_ref(def_id).map(|tr| tr.def_id) 13,230 ( 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`. 372 ( 0.00%) pub fn impl_of_method(self, def_id: DefId) -> Option { 1,488 ( 0.00%) self.opt_associated_item(def_id).and_then(|trait_item| match trait_item.container { . TraitContainer(_) => None, . ImplContainer(def_id) => Some(def_id), . }) 744 ( 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. 13,976 ( 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. 1,747 ( 0.00%) use_name.name == def_name.name 5,121 ( 0.00%) && use_name . .span . .ctxt() . .hygienic_eq(def_name.span.ctxt(), self.expn_that_defined(def_parent_def_id)) 13,976 ( 0.00%) } . 4,293 ( 0.00%) pub fn adjust_ident(self, mut ident: Ident, scope: DefId) -> Ident { 954 ( 0.00%) ident.span.normalize_to_macros_2_0_and_adjust(self.expn_that_defined(scope)); 954 ( 0.00%) ident 3,816 ( 0.00%) } . 20,133 ( 0.00%) pub fn adjust_ident_and_get_scope( . self, . mut ident: Ident, . scope: DefId, . block: hir::HirId, . ) -> (Ident, DefId) { 2,237 ( 0.00%) let scope = ident . .span . .normalize_to_macros_2_0_and_adjust(self.expn_that_defined(scope)) 126 ( 0.00%) .and_then(|actual_expansion| actual_expansion.expn_data().parent_module) 8,696 ( 0.00%) .unwrap_or_else(|| self.parent_module(block).to_def_id()); 13,422 ( 0.00%) (ident, scope) 20,133 ( 0.00%) } . 3,731 ( 0.00%) pub fn is_object_safe(self, key: DefId) -> bool { . self.object_safety_violations(key).is_empty() 4,264 ( 0.00%) } . } . . /// Yields the parent function's `LocalDefId` if `def_id` is an `impl Trait` definition. 5,802 ( 0.00%) pub fn is_impl_trait_defn(tcx: TyCtxt<'_>, def_id: DefId) -> Option { 5,802 ( 0.00%) let def_id = def_id.as_local()?; 5,112 ( 0.00%) if let Node::Item(item) = tcx.hir().get_by_def_id(def_id) { 1,614 ( 0.00%) if let hir::ItemKind::OpaqueTy(ref opaque_ty) = item.kind { 282 ( 0.00%) return match opaque_ty.origin { . hir::OpaqueTyOrigin::FnReturn(parent) | hir::OpaqueTyOrigin::AsyncFn(parent) => { . Some(parent) . } . hir::OpaqueTyOrigin::TyAlias => None, . }; . } . } . None 7,736 ( 0.00%) } . . pub fn int_ty(ity: ast::IntTy) -> IntTy { . match ity { . ast::IntTy::Isize => IntTy::Isize, . ast::IntTy::I8 => IntTy::I8, . ast::IntTy::I16 => IntTy::I16, . ast::IntTy::I32 => IntTy::I32, . ast::IntTy::I64 => IntTy::I64, -- line 2216 ---------------------------------------- -- line 2231 ---------------------------------------- . . pub fn float_ty(fty: ast::FloatTy) -> FloatTy { . match fty { . ast::FloatTy::F32 => FloatTy::F32, . ast::FloatTy::F64 => FloatTy::F64, . } . } . 186 ( 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, . } 186 ( 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 ---------------------------------------- 2,999,996 ( 0.15%) -------------------------------------------------------------------------------- -- 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, . } . 294 ( 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() 189 ( 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 { 64,565 ( 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. 331,800 ( 0.02%) fn next_token(&mut self) -> (Spacing, Token) { . let mut spacing = Spacing::Joint; . . // Skip `#!` at the start of the file 94,800 ( 0.00%) let start_src_index = self.src_index(self.pos); 142,200 ( 0.01%) let text: &str = &self.src[start_src_index..self.end_src_index]; . let is_beginning_of_file = self.pos == self.start_pos; 47,400 ( 0.00%) if is_beginning_of_file { 84 ( 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 { 82,894 ( 0.00%) let start_src_index = self.src_index(self.pos); 195,441 ( 0.01%) let text: &str = &self.src[start_src_index..self.end_src_index]; . 65,147 ( 0.00%) if text.is_empty() { . let span = self.mk_sp(self.pos, self.pos); 105 ( 0.00%) return (spacing, Token::new(token::Eof, span)); . } . 195,378 ( 0.01%) let token = rustc_lexer::first_token(text); . 130,252 ( 0.01%) let start = self.pos; 65,126 ( 0.00%) self.pos = self.pos + BytePos::from_usize(token.len); . . debug!("next_token: {:?}({:?})", token.kind, self.str_from(start)); . 526,956 ( 0.03%) match self.cook_lexer_token(token.kind, start) { 379,032 ( 0.02%) Some(kind) => { . let span = self.mk_sp(start, self.pos); 284,274 ( 0.01%) return (spacing, Token::new(kind, span)); . } . None => spacing = Spacing::Alone, . } . } 426,600 ( 0.02%) } . . /// 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. 1,421 ( 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()), . ); . } 1,624 ( 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 { 325,630 ( 0.02%) Some(match token { 1,689 ( 0.00%) rustc_lexer::TokenKind::LineComment { doc_style } => { . // Skip non-doc comments 7,839 ( 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); 7,435 ( 0.00%) self.cook_doc_comment(content_start, content, CommentKind::Line, doc_style) . } 2 ( 0.00%) rustc_lexer::TokenKind::BlockComment { doc_style, terminated } => { 1 ( 0.00%) if !terminated { . let msg = match doc_style { . Some(_) => "unterminated block doc-comment", . None => "unterminated block comment", . }; . let last_bpos = self.pos; . self.sess.span_diagnostic.span_fatal_with_code( . self.mk_sp(start, last_bpos), . msg, . error_code!(E0758), . ); . } . . // Skip non-doc comments 1 ( 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 and closing delimiter of the length 2 . // are not included into the symbol. -- line 196 ---------------------------------------- -- 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 => { 68,576 ( 0.00%) let is_raw_ident = token == rustc_lexer::TokenKind::RawIdent; 85,720 ( 0.00%) let is_unknown_prefix = token == rustc_lexer::TokenKind::UnknownPrefix; . let mut ident_start = start; 34,288 ( 0.00%) if is_raw_ident { . ident_start = ident_start + BytePos(2); . } 51,432 ( 0.00%) if is_unknown_prefix { . self.report_unknown_prefix(start); . } 85,720 ( 0.00%) let sym = nfc_normalize(self.str_from(ident_start)); . let span = self.mk_sp(start, self.pos); 68,576 ( 0.00%) self.sess.symbol_gallery.insert(sym, span); 34,288 ( 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); . } 120,008 ( 0.01%) 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) . } 16,208 ( 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); 3,039 ( 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 { 15 ( 0.00%) Some(Symbol::intern(string)) . } . } else { . None . }; 8,104 ( 0.00%) token::Literal(token::Lit { kind, symbol, suffix }) . } 148 ( 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); 74 ( 0.00%) if starts_with_number { . self.err_span_(start, self.pos, "lifetimes cannot start with a number"); . } 222 ( 0.00%) let ident = Symbol::intern(lifetime_name); 296 ( 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? . } . }) . } . 17,844 ( 0.00%) fn cook_doc_comment( . &self, . content_start: BytePos, . content: &str, . comment_kind: CommentKind, . doc_style: DocStyle, . ) -> TokenKind { 1,487 ( 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, . }; . 4,461 ( 0.00%) token::DocComment(comment_kind, attr_style, Symbol::intern(content)) 22,305 ( 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 { 8 ( 0.00%) rustc_lexer::LiteralKind::Char { terminated } => { 8 ( 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) // ' ' . } 7 ( 0.00%) rustc_lexer::LiteralKind::Byte { terminated } => { 7 ( 0.00%) if !terminated { . 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' ' . } 893 ( 0.00%) rustc_lexer::LiteralKind::Str { terminated } => { 893 ( 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) // " " . } 24 ( 0.00%) rustc_lexer::LiteralKind::ByteStr { terminated } => { 24 ( 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##" "## . } 162 ( 0.00%) rustc_lexer::LiteralKind::Int { base, empty_int } => { 81 ( 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); 243 ( 0.00%) (token::Integer, self.symbol_from_to(start, suffix_start)) . }; . } . rustc_lexer::LiteralKind::Float { base, empty_exponent } => { . if empty_exponent { . self.err_span_(start, self.pos, "expected at least one digit in exponent"); . } . . match base { -- line 439 ---------------------------------------- -- line 452 ---------------------------------------- . } . . 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,796 ( 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 { 116,316 ( 0.01%) 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); 11,751 ( 0.00%) Symbol::intern(self.str_from_to(start, end)) . } . . /// Slice of the source text spanning from `start` up to but excluding `end`. 20,856 ( 0.00%) fn str_from_to(&self, start: BytePos, end: BytePos) -> &str { . &self.src[self.src_index(start)..self.src_index(end)] 83,424 ( 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, . ) { 5,592 ( 0.00%) let lit_content = self.str_from_to(content_start, content_end); 104,200 ( 0.01%) unescape::unescape_literal(lit_content, mode, &mut |range, result| { . // Here we only check for errors. The actual unescaping is done later. 20,924 ( 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, . ); . } 94,158 ( 0.00%) }); . } . . fn validate_int_literal(&self, base: Base, content_start: BytePos, content_end: BytePos) { 324 ( 0.00%) let base = match base { . Base::Binary => 2, . Base::Octal => 8, . _ => return, . }; . let s = self.str_from_to(content_start + BytePos(2), content_end); . for (idx, c) in s.char_indices() { . let idx = idx as u32; . if c != '_' && c.to_digit(base).is_none() { -- line 649 ---------------------------------------- -- line 650 ---------------------------------------- . 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)); . } . } . } . } . 154,296 ( 0.01%) pub fn nfc_normalize(string: &str) -> Symbol { . use unicode_normalization::{is_nfc_quick, IsNormalized, UnicodeNormalization}; 34,288 ( 0.00%) match is_nfc_quick(string.chars()) { 171,440 ( 0.01%) IsNormalized::Yes => Symbol::intern(string), . _ => { . let normalized_str: String = string.chars().nfc().collect(); . Symbol::intern(&normalized_str) . } . } . } 215,836 ( 0.01%) -------------------------------------------------------------------------------- -- 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 . // . 3,320,644 ( 0.16%) if layout.align() <= MIN_ALIGN && layout.align() <= layout.size() { 2,490,483 ( 0.12%) 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. 78,352 ( 0.00%) if layout.align() <= MIN_ALIGN && layout.align() <= layout.size() { 117,528 ( 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) { 849,738 ( 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 { 306,488 ( 0.02%) if layout.align() <= MIN_ALIGN && layout.align() <= new_size { 612,976 ( 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_mir_transform/src/simplify.rs -------------------------------------------------------------------------------- Ir -- line 38 ---------------------------------------- . use std::convert::TryInto; . . pub struct SimplifyCfg { . label: String, . } . . impl SimplifyCfg { . pub fn new(label: &str) -> Self { 8,559 ( 0.00%) SimplifyCfg { label: format!("SimplifyCfg-{}", label) } . } . } . 10,080 ( 0.00%) pub fn simplify_cfg<'tcx>(tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) { 4,032 ( 0.00%) CfgSimplifier::new(body).simplify(); 3,024 ( 0.00%) remove_dead_blocks(tcx, body); . . // FIXME: Should probably be moved into some kind of pass manager . body.basic_blocks_mut().raw.shrink_to_fit(); 4,152 ( 0.00%) } . . impl<'tcx> MirPass<'tcx> for SimplifyCfg { 990 ( 0.00%) fn name(&self) -> Cow<'_, str> { 2,970 ( 0.00%) Cow::Borrowed(&self.label) 990 ( 0.00%) } . 990 ( 0.00%) fn run_pass(&self, tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) { . debug!("SimplifyCfg({:?}) - simplifying {:?}", self.label, body.source); 2,016 ( 0.00%) simplify_cfg(tcx, body); . } . } . . pub struct CfgSimplifier<'a, 'tcx> { . basic_blocks: &'a mut IndexVec>, . pred_count: IndexVec, . } . . impl<'a, 'tcx> CfgSimplifier<'a, 'tcx> { 7,056 ( 0.00%) pub fn new(body: &'a mut Body<'tcx>) -> Self { 2,016 ( 0.00%) let mut pred_count = IndexVec::from_elem(0u32, body.basic_blocks()); . . // we can't use mir.predecessors() here because that counts . // dead blocks, which we don't want to. 3,024 ( 0.00%) pred_count[START_BLOCK] = 1; . 92,116 ( 0.00%) for (_, data) in traversal::preorder(body) { 56,991 ( 0.00%) if let Some(ref term) = data.terminator { 83,013 ( 0.00%) for &tgt in term.successors() { 130,110 ( 0.01%) pred_count[tgt] += 1; . } . } . } . . let basic_blocks = body.basic_blocks_mut(); . 4,032 ( 0.00%) CfgSimplifier { basic_blocks, pred_count } 8,064 ( 0.00%) } . 8,064 ( 0.00%) pub fn simplify(mut self) { 1,008 ( 0.00%) self.strip_nops(); . . // Vec of the blocks that should be merged. We store the indices here, instead of the . // statements itself to avoid moving the (relatively) large statements twice. . // We do not push the statements directly into the target block (`bb`) as that is slower . // due to additional reallocations . let mut merged_blocks = Vec::new(); . loop { . let mut changed = false; . 2,258 ( 0.00%) for bb in self.basic_blocks.indices() { 60,042 ( 0.00%) if self.pred_count[bb] == 0 { . continue; . } . . debug!("simplifying {:?}", bb); . . let mut terminator = . self.basic_blocks[bb].terminator.take().expect("invalid terminator state"); . 76,317 ( 0.00%) for successor in terminator.successors_mut() { . self.collapse_goto_chain(successor, &mut changed); . } . . let mut inner_changed = true; . merged_blocks.clear(); 78,139 ( 0.00%) while inner_changed { . inner_changed = false; . inner_changed |= self.simplify_branch(&mut terminator); 26,350 ( 0.00%) inner_changed |= self.merge_successor(&mut merged_blocks, &mut terminator); 79,050 ( 0.00%) changed |= inner_changed; . } . . let statements_to_merge = 27,231 ( 0.00%) merged_blocks.iter().map(|&i| self.basic_blocks[i].statements.len()).sum(); . 1,388 ( 0.00%) if statements_to_merge > 0 { . let mut statements = std::mem::take(&mut self.basic_blocks[bb].statements); . statements.reserve(statements_to_merge); 715 ( 0.00%) for &from in &merged_blocks { 1,430 ( 0.00%) statements.append(&mut self.basic_blocks[from].statements); . } 4,617 ( 0.00%) self.basic_blocks[bb].statements = statements; . } . 788,609 ( 0.04%) self.basic_blocks[bb].terminator = Some(terminator); . } . 2,258 ( 0.00%) if !changed { . break; . } . } 8,064 ( 0.00%) } . . /// This function will return `None` if . /// * the block has statements . /// * the block has a terminator other than `goto` . /// * the block has no terminator (meaning some other part of the current optimization stole it) . fn take_terminator_if_simple_goto(&mut self, bb: BasicBlock) -> Option> { 258,858 ( 0.01%) match self.basic_blocks[bb] { . BasicBlockData { . ref statements, . terminator: . ref mut terminator @ Some(Terminator { kind: TerminatorKind::Goto { .. }, .. }), . .. 9,777 ( 0.00%) } if statements.is_empty() => terminator.take(), . // if `terminator` is None, this means we are in a loop. In that . // case, let all the loop collapse to its entry. . _ => None, . } . } . . /// Collapse a goto chain starting from `start` . fn collapse_goto_chain(&mut self, start: &mut BasicBlock, changed: &mut bool) { . // Using `SmallVec` here, because in some logs on libcore oli-obk saw many single-element . // goto chains. We should probably benchmark different sizes. . let mut terminators: SmallVec<[_; 1]> = Default::default(); 107,730 ( 0.01%) let mut current = *start; 128,250 ( 0.01%) while let Some(terminator) = self.take_terminator_if_simple_goto(current) { 2,160 ( 0.00%) let target = match terminator { 1,080 ( 0.00%) Terminator { kind: TerminatorKind::Goto { target }, .. } => target, . _ => unreachable!(), . }; 20,520 ( 0.00%) terminators.push((current, terminator)); . current = target; . } . let last = current; 35,910 ( 0.00%) *start = last; 16,200 ( 0.00%) while let Some((current, mut terminator)) = terminators.pop() { 2,160 ( 0.00%) let target = match terminator { . Terminator { kind: TerminatorKind::Goto { ref mut target }, .. } => target, . _ => unreachable!(), . }; 2,160 ( 0.00%) *changed |= *target != last; 2,160 ( 0.00%) *target = last; . debug!("collapsing goto chain from {:?} to {:?}", current, target); . 2,160 ( 0.00%) if self.pred_count[current] == 1 { . // This is the last reference to current, so the pred-count to . // to target is moved into the current block. . self.pred_count[current] = 0; . } else { 1,052 ( 0.00%) self.pred_count[*target] += 1; 789 ( 0.00%) self.pred_count[current] -= 1; . } 35,640 ( 0.00%) self.basic_blocks[current].terminator = Some(terminator); . } . } . . // merge a block with 1 `goto` predecessor to its parent . fn merge_successor( . &mut self, . merged_blocks: &mut Vec, . terminator: &mut Terminator<'tcx>, . ) -> bool { 63,028 ( 0.00%) let target = match terminator.kind { 26,512 ( 0.00%) TerminatorKind::Goto { target } if self.pred_count[target] == 1 => target, . _ => return false, . }; . . debug!("merging block {:?} into {:?}", target, terminator); 20,608 ( 0.00%) *terminator = match self.basic_blocks[target].terminator.take() { . Some(terminator) => terminator, . None => { . // unreachable loop - this should not be possible, as we . // don't strand blocks, but handle it correctly. . return false; . } . }; . . merged_blocks.push(target); 2,688 ( 0.00%) self.pred_count[target] = 0; . . true . } . . // turn a branch with all successors identical to a goto . fn simplify_branch(&mut self, terminator: &mut Terminator<'tcx>) -> bool { 79,050 ( 0.00%) match terminator.kind { . TerminatorKind::SwitchInt { .. } => {} . _ => return false, . }; . . let first_succ = { 11,544 ( 0.00%) if let Some(&first_succ) = terminator.successors().next() { 5,772 ( 0.00%) if terminator.successors().all(|s| *s == first_succ) { 222 ( 0.00%) let count = terminator.successors().count(); 444 ( 0.00%) self.pred_count[first_succ] -= (count - 1) as u32; . first_succ . } else { . return false; . } . } else { . return false; . } . }; . . debug!("simplifying branch {:?}", terminator); 444 ( 0.00%) terminator.kind = TerminatorKind::Goto { target: first_succ }; . true . } . . fn strip_nops(&mut self) { . for blk in self.basic_blocks.iter_mut() { 84,829 ( 0.00%) blk.statements.retain(|stmt| !matches!(stmt.kind, StatementKind::Nop)) . } . } . } . 10,490 ( 0.00%) pub fn remove_dead_blocks<'tcx>(tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) { 1,049 ( 0.00%) let reachable = traversal::reachable_as_bitset(body); . let num_blocks = body.basic_blocks().len(); 2,098 ( 0.00%) if num_blocks == reachable.count() { . return; . } . . let basic_blocks = body.basic_blocks_mut(); . let mut replacements: Vec<_> = (0..num_blocks).map(BasicBlock::new).collect(); . let mut used_blocks = 0; 11,311 ( 0.00%) for alive_index in reachable.iter() { . let alive_index = alive_index.index(); 11,311 ( 0.00%) replacements[alive_index] = BasicBlock::new(used_blocks); 22,622 ( 0.00%) if alive_index != used_blocks { . // Swap the next alive block data with the current available slot. Since . // alive_index is non-decreasing this is a valid operation. . basic_blocks.raw.swap(alive_index, used_blocks); . } 11,311 ( 0.00%) used_blocks += 1; . } . 1,000 ( 0.00%) if tcx.sess.instrument_coverage() { . save_unreachable_coverage(basic_blocks, used_blocks); . } . . basic_blocks.raw.truncate(used_blocks); . . for block in basic_blocks { 22,622 ( 0.00%) for target in block.terminator_mut().successors_mut() { 64,456 ( 0.00%) *target = replacements[target.index()]; . } . } 8,392 ( 0.00%) } . . /// Some MIR transforms can determine at compile time that a sequences of . /// statements will never be executed, so they can be dropped from the MIR. . /// For example, an `if` or `else` block that is guaranteed to never be executed . /// because its condition can be evaluated at compile time, such as by const . /// evaluation: `if false { ... }`. . /// . /// Those statements are bypassed by redirecting paths in the CFG around the -- line 305 ---------------------------------------- -- line 363 ---------------------------------------- . })), . }) . } . } . . pub struct SimplifyLocals; . . impl<'tcx> MirPass<'tcx> for SimplifyLocals { 18 ( 0.00%) fn is_enabled(&self, sess: &rustc_session::Session) -> bool { 27 ( 0.00%) sess.mir_opt_level() > 0 18 ( 0.00%) } . 9 ( 0.00%) fn run_pass(&self, tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) { . trace!("running SimplifyLocals on {:?}", body.source); 9 ( 0.00%) simplify_locals(body, tcx); . } . } . 63 ( 0.00%) pub fn simplify_locals<'tcx>(body: &mut Body<'tcx>, tcx: TyCtxt<'tcx>) { . // First, we're going to get a count of *actual* uses for every `Local`. . let mut used_locals = UsedLocals::new(body); . . // Next, we're going to remove any `Local` with zero actual uses. When we remove those . // `Locals`, we're also going to subtract any uses of other `Locals` from the `used_locals` . // count. For example, if we removed `_2 = discriminant(_1)`, then we'll subtract one from . // `use_counts[_1]`. That in turn might make `_1` unused, so we loop until we hit a . // fixedpoint where there are no more unused locals. -- line 389 ---------------------------------------- -- line 390 ---------------------------------------- . remove_unused_definitions(&mut used_locals, body); . . // Finally, we'll actually do the work of shrinking `body.local_decls` and remapping the `Local`s. . let map = make_local_map(&mut body.local_decls, &used_locals); . . // Only bother running the `LocalUpdater` if we actually found locals to remove. . if map.iter().any(Option::is_none) { . // Update references to all vars and tmps now 54 ( 0.00%) let mut updater = LocalUpdater { map, tcx }; . updater.visit_body(body); . . body.local_decls.shrink_to_fit(); . } 72 ( 0.00%) } . . /// Construct the mapping while swapping out unused stuff out from the `vec`. . fn make_local_map( . local_decls: &mut IndexVec, . used_locals: &UsedLocals, . ) -> IndexVec> { 18 ( 0.00%) let mut map: IndexVec> = IndexVec::from_elem(None, &*local_decls); . let mut used = Local::new(0); . 9 ( 0.00%) for alive_index in local_decls.indices() { . // `is_used` treats the `RETURN_PLACE` and arguments as used. 1,029 ( 0.00%) if !used_locals.is_used(alive_index) { . continue; . } . 719 ( 0.00%) map[alive_index] = Some(used); 719 ( 0.00%) if alive_index != used { . local_decls.swap(alive_index, used); . } . used.increment_by(1); . } . local_decls.truncate(used.index()); . map . } . -- line 428 ---------------------------------------- -- line 431 ---------------------------------------- . increment: bool, . arg_count: u32, . use_count: IndexVec, . } . . impl UsedLocals { . /// Determines which locals are used & unused in the given body. . fn new(body: &Body<'_>) -> Self { 63 ( 0.00%) let mut this = Self { . increment: true, 9 ( 0.00%) arg_count: body.arg_count.try_into().unwrap(), 27 ( 0.00%) use_count: IndexVec::from_elem(0, &body.local_decls), . }; . this.visit_body(body); . this . } . . /// Checks if local is used. . /// . /// Return place and arguments are always considered used. . fn is_used(&self, local: Local) -> bool { . trace!("is_used({:?}): use_count: {:?}", local, self.use_count[local]); 6,747 ( 0.00%) local.as_u32() <= self.arg_count || self.use_count[local] != 0 . } . . /// Updates the use counts to reflect the removal of given statement. . fn statement_removed(&mut self, statement: &Statement<'_>) { 159 ( 0.00%) self.increment = false; . . // The location of the statement is irrelevant. . let location = Location { block: START_BLOCK, statement_index: 0 }; 795 ( 0.00%) self.visit_statement(statement, location); . } . . /// Visits a left-hand side of an assignment. 5,700 ( 0.00%) fn visit_lhs(&mut self, place: &Place<'_>, location: Location) { 4,560 ( 0.00%) if place.is_indirect() { . // A use, not a definition. . self.visit_place(place, PlaceContext::MutatingUse(MutatingUseContext::Store), location); . } else { . // A definition. The base local itself is not visited, so this occurrence is not counted . // toward its use count. There might be other locals still, used in an indexing . // projection. . self.super_projection( . place.as_ref(), . PlaceContext::MutatingUse(MutatingUseContext::Projection), . location, . ); . } 4,560 ( 0.00%) } . } . . impl<'tcx> Visitor<'tcx> for UsedLocals { 5,700 ( 0.00%) fn visit_statement(&mut self, statement: &Statement<'tcx>, location: Location) { 5,700 ( 0.00%) match statement.kind { . StatementKind::CopyNonOverlapping(..) . | StatementKind::Retag(..) . | StatementKind::Coverage(..) . | StatementKind::FakeRead(..) . | StatementKind::AscribeUserType(..) => { . self.super_statement(statement, location); . } . . StatementKind::Nop => {} . . StatementKind::StorageLive(_local) | StatementKind::StorageDead(_local) => {} . 1,065 ( 0.00%) StatementKind::Assign(box (ref place, ref rvalue)) => { 3,195 ( 0.00%) self.visit_lhs(place, location); . self.visit_rvalue(rvalue, location); . } . . StatementKind::SetDiscriminant { ref place, variant_index: _ } => { 525 ( 0.00%) self.visit_lhs(place, location); . } . } 1,485 ( 0.00%) } . . fn visit_local(&mut self, local: &Local, _ctx: PlaceContext, _location: Location) { 4,356 ( 0.00%) if self.increment { 4,914 ( 0.00%) self.use_count[*local] += 1; . } else { 210 ( 0.00%) assert_ne!(self.use_count[*local], 0); 70 ( 0.00%) self.use_count[*local] -= 1; . } . } . } . . /// Removes unused definitions. Updates the used locals to reflect the changes made. . fn remove_unused_definitions(used_locals: &mut UsedLocals, body: &mut Body<'_>) { . // The use counts are updated as we remove the statements. A local might become unused . // during the retain operation, leading to a temporary inconsistency (storage statements or . // definitions referencing the local might remain). For correctness it is crucial that this . // computation reaches a fixed point. . . let mut modified = true; 171 ( 0.00%) while modified { 18 ( 0.00%) modified = false; . . for data in body.basic_blocks_mut() { . // Remove unnecessary StorageLive and StorageDead annotations. 4,824 ( 0.00%) data.statements.retain(|statement| { 11,118 ( 0.00%) let keep = match &statement.kind { . StatementKind::StorageLive(local) | StatementKind::StorageDead(local) => { . used_locals.is_used(*local) . } 3,306 ( 0.00%) StatementKind::Assign(box (place, _)) => used_locals.is_used(place.local), . . StatementKind::SetDiscriminant { ref place, .. } => { 300 ( 0.00%) used_locals.is_used(place.local) . } . _ => true, . }; . 1,359 ( 0.00%) if !keep { . trace!("removing statement {:?}", statement); 159 ( 0.00%) modified = true; . used_locals.statement_removed(statement); . } . . keep . }); . } . } . } -- line 555 ---------------------------------------- -- line 560 ---------------------------------------- . } . . impl<'tcx> MutVisitor<'tcx> for LocalUpdater<'tcx> { . fn tcx(&self) -> TyCtxt<'tcx> { . self.tcx . } . . fn visit_local(&mut self, l: &mut Local, _: PlaceContext, _: Location) { 6,619 ( 0.00%) *l = self.map[*l].unwrap(); . } . } 308,872 ( 0.02%) -------------------------------------------------------------------------------- -- 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, . ) { 12,814 ( 0.00%) if let Some((file, file_idx)) = new_file_and_idx { 8,300 ( 0.00%) self.file = file; 11,113 ( 0.00%) self.file_index = file_idx; . } . 4,964 ( 0.00%) let line_index = self.file.lookup_line(pos).unwrap(); . let line_bounds = self.file.line_bounds(line_index); 22,870 ( 0.00%) self.line_number = line_index + 1; 34,530 ( 0.00%) self.line = line_bounds; . self.touch(time_stamp); . } . . #[inline] . fn touch(&mut self, time_stamp: usize) { 117,854 ( 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> { 4,274 ( 0.00%) pub fn new(source_map: &'sm SourceMap) -> CachingSourceMapView<'sm> { . let files = source_map.files(); 2,137 ( 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, . }; . 10,685 ( 0.00%) CachingSourceMapView { . source_map, 14,959 ( 0.00%) line_cache: [entry.clone(), entry.clone(), entry], . time_stamp: 0, . } 8,548 ( 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)) . } . 446,110 ( 0.02%) pub fn span_data_to_lines_and_cols( . &mut self, . span_data: &SpanData, . ) -> Option<(Lrc, usize, BytePos, usize, BytePos)> { 254,920 ( 0.01%) self.time_stamp += 1; . . // Check if lo and hi are in the cached lines. 63,730 ( 0.00%) let lo_cache_idx = self.cache_entry_index(span_data.lo); 63,730 ( 0.00%) let hi_cache_idx = self.cache_entry_index(span_data.hi); . 109,094 ( 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 = { 108,248 ( 0.01%) let lo = &self.line_cache[lo_cache_idx as usize]; . let hi = &self.line_cache[hi_cache_idx as usize]; . 324,744 ( 0.02%) if lo.file_index != hi.file_index { . return None; . } . . ( 108,248 ( 0.01%) lo.file.clone(), . lo.line_number, . span_data.lo - lo.line.start, 54,124 ( 0.00%) hi.line_number, . span_data.hi - hi.line.start, . ) . }; . 54,124 ( 0.00%) self.line_cache[lo_cache_idx as usize].touch(self.time_stamp); 54,124 ( 0.00%) self.line_cache[hi_cache_idx as usize].touch(self.time_stamp); . 216,496 ( 0.01%) return Some(result); . } . . // No cache hit or cache hit for only one of span lo and hi. 18,366 ( 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. 75,396 ( 0.00%) let new_file_and_idx = if !file_contains(&self.line_cache[oldest].file, span_data.lo) { 23,210 ( 0.00%) let new_file_and_idx = self.file_for_position(span_data.lo)?; 27,852 ( 0.00%) if !file_contains(&new_file_and_idx.0, span_data.hi) { . return None; . } . 18,568 ( 0.00%) Some(new_file_and_idx) . } else { . let file = &self.line_cache[oldest].file; 14,892 ( 0.00%) if !file_contains(&file, span_data.hi) { . return None; . } . 14,892 ( 0.00%) None . }; . . // Update the cache entries. 48,030 ( 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); . 22,737 ( 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); 846 ( 0.00%) let hi = &mut self.line_cache[hi_cache_idx as usize]; 1,269 ( 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]; 1,604 ( 0.00%) hi.update(new_file_and_idx, span_data.hi, self.time_stamp); 3,208 ( 0.00%) let lo = &mut self.line_cache[lo_cache_idx as usize]; 6,416 ( 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. 19,212 ( 0.00%) assert!(span_data.lo >= lo.line.start); 9,606 ( 0.00%) assert!(span_data.lo <= lo.line.end); 19,212 ( 0.00%) assert!(span_data.hi >= hi.line.start); 9,606 ( 0.00%) assert!(span_data.hi <= hi.line.end); 48,030 ( 0.00%) assert!(lo.file.contains(span_data.lo)); 28,818 ( 0.00%) assert!(lo.file.contains(span_data.hi)); 28,818 ( 0.00%) assert_eq!(lo.file_index, hi.file_index); . 28,818 ( 0.00%) Some(( 9,606 ( 0.00%) lo.file.clone(), . lo.line_number, . span_data.lo - lo.line.start, 9,606 ( 0.00%) hi.line_number, . span_data.hi - hi.line.start, . )) 573,570 ( 0.03%) } . . fn cache_entry_index(&self, pos: BytePos) -> isize { . for (idx, cache_entry) in self.line_cache.iter().enumerate() { 664,219 ( 0.03%) 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() { 45,474 ( 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() { 23,040 ( 0.00%) if idx != avoid_idx 12,546 ( 0.00%) && self.line_cache[idx].time_stamp < self.line_cache[oldest].time_stamp . { . oldest = idx; . } . } . . oldest . } . 23,210 ( 0.00%) fn file_for_position(&self, pos: BytePos) -> Option<(Lrc, usize)> { 4,642 ( 0.00%) if !self.source_map.files().is_empty() { 9,284 ( 0.00%) let file_idx = self.source_map.lookup_source_file_idx(pos); . let file = &self.source_map.files()[file_idx]; . 37,136 ( 0.00%) if file_contains(file, pos) { . return Some((file.clone(), file_idx)); . } . } . . None 23,210 ( 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 ---------------------------------------- 875,930 ( 0.04%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_metadata/src/rmeta/decoder.rs -------------------------------------------------------------------------------- Ir -- line 176 ---------------------------------------- . } . fn sess(self) -> Option<&'tcx Session> { . None . } . fn tcx(self) -> Option> { . None . } . 18,300 ( 0.00%) fn decoder(self, pos: usize) -> DecodeContext<'a, 'tcx> { 6,100 ( 0.00%) let tcx = self.tcx(); 1,217,840 ( 0.06%) DecodeContext { 129,303 ( 0.01%) opaque: opaque::Decoder::new(self.blob(), pos), 6,100 ( 0.00%) cdata: self.cdata(), . blob: self.blob(), 36,900 ( 0.00%) sess: self.sess().or(tcx.map(|tcx| tcx.sess)), . tcx, . last_source_file_index: 0, . lazy_state: LazyState::NoNode, . alloc_decoding_session: self . .cdata() 109,961 ( 0.01%) .map(|cdata| cdata.cdata.alloc_decoding_state.new_decoding_session()), . } 18,300 ( 0.00%) } . } . . impl<'a, 'tcx> Metadata<'a, 'tcx> for &'a MetadataBlob { . #[inline] . fn blob(self) -> &'a MetadataBlob { . self . } . } -- line 206 ---------------------------------------- -- line 255 ---------------------------------------- . } . #[inline] . fn tcx(self) -> Option> { . Some(self.1) . } . } . . impl<'a, 'tcx, T: Decodable>> Lazy { 152,193 ( 0.01%) fn decode>(self, metadata: M) -> T { 79,745 ( 0.00%) let mut dcx = metadata.decoder(self.position.get()); 358,775 ( 0.02%) dcx.lazy_state = LazyState::NodeStart(self.position); 147,789 ( 0.01%) T::decode(&mut dcx) 194,832 ( 0.01%) } . } . . impl<'a: 'x, 'tcx: 'x, 'x, T: Decodable>> Lazy<[T]> { . fn decode>( . self, . metadata: M, . ) -> impl ExactSizeIterator + Captures<'a> + Captures<'tcx> + 'x { 245 ( 0.00%) let mut dcx = metadata.decoder(self.position.get()); 70 ( 0.00%) dcx.lazy_state = LazyState::NodeStart(self.position); 60,195 ( 0.00%) (0..self.meta).map(move |_| T::decode(&mut dcx)) . } . } . . impl<'a, 'tcx> DecodeContext<'a, 'tcx> { . #[inline] . fn tcx(&self) -> TyCtxt<'tcx> { . debug_assert!(self.tcx.is_some(), "missing TyCtxt in DecodeContext"); . self.tcx.unwrap() -- line 285 ---------------------------------------- -- line 292 ---------------------------------------- . . #[inline] . pub fn cdata(&self) -> CrateMetadataRef<'a> { . debug_assert!(self.cdata.is_some(), "missing CrateMetadata in DecodeContext"); . self.cdata.unwrap() . } . . fn map_encoded_cnum_to_current(&self, cnum: CrateNum) -> CrateNum { 273,765 ( 0.01%) if cnum == LOCAL_CRATE { self.cdata().cnum } else { self.cdata().cnum_map[cnum] } . } . 131,878 ( 0.01%) fn read_lazy_with_meta(&mut self, meta: T::Meta) -> Lazy { . let distance = self.read_usize(); 125,940 ( 0.01%) let position = match self.lazy_state { . LazyState::NoNode => bug!("read_lazy_with_meta: outside of a metadata node"), 21,345 ( 0.00%) LazyState::NodeStart(start) => { . let start = start.get(); 42,690 ( 0.00%) assert!(distance <= start); . start - distance . } 37,143 ( 0.00%) LazyState::Previous(last_pos) => last_pos.get() + distance, . }; 67,452 ( 0.00%) self.lazy_state = LazyState::Previous(NonZeroUsize::new(position).unwrap()); . Lazy::from_position_and_meta(NonZeroUsize::new(position).unwrap(), meta) 131,878 ( 0.01%) } . . #[inline] . pub fn read_raw_bytes(&mut self, len: usize) -> &'a [u8] { . self.opaque.read_raw_bytes(len) . } . } . . impl<'a, 'tcx> TyDecoder<'tcx> for DecodeContext<'a, 'tcx> { -- line 324 ---------------------------------------- -- line 326 ---------------------------------------- . . #[inline] . fn tcx(&self) -> TyCtxt<'tcx> { . self.tcx.expect("missing TyCtxt in DecodeContext") . } . . #[inline] . fn peek_byte(&self) -> u8 { 177,165 ( 0.01%) self.opaque.data[self.opaque.position()] . } . . #[inline] . fn position(&self) -> usize { . self.opaque.position() . } . 172,823 ( 0.01%) fn cached_ty_for_shorthand(&mut self, shorthand: usize, or_insert_with: F) -> Ty<'tcx> . where . F: FnOnce(&mut Self) -> Ty<'tcx>, . { 24,689 ( 0.00%) let tcx = self.tcx(); . 24,689 ( 0.00%) let key = ty::CReaderCacheKey { cnum: Some(self.cdata().cnum), pos: shorthand }; . 74,564 ( 0.00%) if let Some(&ty) = tcx.ty_rcache.borrow().get(&key) { . return ty; . } . 6,048 ( 0.00%) let ty = or_insert_with(self); . tcx.ty_rcache.borrow_mut().insert(key, ty); . ty 222,201 ( 0.01%) } . . fn with_position(&mut self, pos: usize, f: F) -> R . where . F: FnOnce(&mut Self) -> R, . { . let new_opaque = opaque::Decoder::new(self.opaque.data, pos); . let old_opaque = mem::replace(&mut self.opaque, new_opaque); . let old_state = mem::replace(&mut self.lazy_state, LazyState::NoNode); . let r = f(self); 33,600 ( 0.00%) self.opaque = old_opaque; 6,720 ( 0.00%) self.lazy_state = old_state; . r . } . . fn decode_alloc_id(&mut self) -> rustc_middle::mir::interpret::AllocId { . if let Some(alloc_decoding_session) = self.alloc_decoding_session { . alloc_decoding_session.decode_alloc_id(self) . } else { . bug!("Attempting to decode interpret::AllocId without CrateMetadata") . } . } . } . . impl<'a, 'tcx> Decodable> for CrateNum { . fn decode(d: &mut DecodeContext<'a, 'tcx>) -> CrateNum { 162,411 ( 0.01%) let cnum = CrateNum::from_u32(d.read_u32()); . d.map_encoded_cnum_to_current(cnum) . } . } . . impl<'a, 'tcx> Decodable> for DefIndex { 1,179 ( 0.00%) fn decode(d: &mut DecodeContext<'a, 'tcx>) -> DefIndex { 309,977 ( 0.02%) DefIndex::from_u32(d.read_u32()) 2,358 ( 0.00%) } . } . . impl<'a, 'tcx> Decodable> for ExpnIndex { . fn decode(d: &mut DecodeContext<'a, 'tcx>) -> ExpnIndex { . ExpnIndex::from_u32(d.read_u32()) . } . } . . impl<'a, 'tcx> Decodable> for SyntaxContext { 323,876 ( 0.02%) fn decode(decoder: &mut DecodeContext<'a, 'tcx>) -> SyntaxContext { 80,969 ( 0.00%) let cdata = decoder.cdata(); 80,969 ( 0.00%) let sess = decoder.sess.unwrap(); 161,938 ( 0.01%) let cname = cdata.root.name; . rustc_span::hygiene::decode_syntax_context(decoder, &cdata.hygiene_context, |_, id| { . debug!("SpecializedDecoder: decoding {}", id); 5,808 ( 0.00%) cdata . .root . .syntax_contexts . .get(cdata, id) . .unwrap_or_else(|| panic!("Missing SyntaxContext {:?} for crate {:?}", id, cname)) . .decode((cdata, sess)) . }) 404,845 ( 0.02%) } . } . . impl<'a, 'tcx> Decodable> for ExpnId { 27,412 ( 0.00%) fn decode(decoder: &mut DecodeContext<'a, 'tcx>) -> ExpnId { 3,916 ( 0.00%) let local_cdata = decoder.cdata(); 3,916 ( 0.00%) let sess = decoder.sess.unwrap(); . . let cnum = CrateNum::decode(decoder); . let index = u32::decode(decoder); . . let expn_id = rustc_span::hygiene::decode_expn_id(cnum, index, |expn_id| { . let ExpnId { krate: cnum, local_id: index } = expn_id; . // Lookup local `ExpnData`s in our own crate data. Foreign `ExpnData`s . // are stored in the owning crate, to avoid duplication. . debug_assert_ne!(cnum, LOCAL_CRATE); 1,561 ( 0.00%) let crate_data = if cnum == local_cdata.cnum { . local_cdata . } else { . local_cdata.cstore.get_crate_data(cnum) . }; 7,805 ( 0.00%) let expn_data = crate_data . .root . .expn_data . .get(crate_data, index) . .unwrap() . .decode((crate_data, sess)); 7,805 ( 0.00%) let expn_hash = crate_data . .root . .expn_hashes . .get(crate_data, index) . .unwrap() . .decode((crate_data, sess)); 15,610 ( 0.00%) (expn_data, expn_hash) . }); . expn_id 31,328 ( 0.00%) } . } . . impl<'a, 'tcx> Decodable> for Span { 612,904 ( 0.03%) fn decode(decoder: &mut DecodeContext<'a, 'tcx>) -> Span { 76,613 ( 0.00%) let ctxt = SyntaxContext::decode(decoder); . let tag = u8::decode(decoder); . 153,226 ( 0.01%) if tag == TAG_PARTIAL_SPAN { . return DUMMY_SP.with_ctxt(ctxt); . } . . debug_assert!(tag == TAG_VALID_SPAN_LOCAL || tag == TAG_VALID_SPAN_FOREIGN); . . let lo = BytePos::decode(decoder); . let len = BytePos::decode(decoder); . let hi = lo + len; . 229,686 ( 0.01%) let Some(sess) = decoder.sess else { . bug!("Cannot decode Span without Session.") . }; . . // There are two possibilities here: . // 1. This is a 'local span', which is located inside a `SourceFile` . // that came from this crate. In this case, we use the source map data . // encoded in this crate. This branch should be taken nearly all of the time. . // 2. This is a 'foreign span', which is located inside a `SourceFile` -- line 476 ---------------------------------------- -- line 492 ---------------------------------------- . // a transitive dependency. . // . // When we encode a foreign span, we adjust its 'lo' and 'high' values . // to be based on the *foreign* crate (e.g. crate C), not the crate . // we are writing metadata for (e.g. crate B). This allows us to . // treat the 'local' and 'foreign' cases almost identically during deserialization: . // we can call `imported_source_files` for the proper crate, and binary search . // through the returned slice using our span. 182,653 ( 0.01%) let imported_source_files = if tag == TAG_VALID_SPAN_LOCAL { . decoder.cdata().imported_source_files(sess) . } else { . // When we encode a proc-macro crate, all `Span`s should be encoded . // with `TAG_VALID_SPAN_LOCAL` 2,565 ( 0.00%) if decoder.cdata().root.is_proc_macro_crate() { . // Decode `CrateNum` as u32 - using `CrateNum::decode` will ICE . // since we don't have `cnum_map` populated. . let cnum = u32::decode(decoder); . panic!( . "Decoding of crate {:?} tried to access proc-macro dep {:?}", . decoder.cdata().root.name, . cnum . ); -- line 513 ---------------------------------------- -- line 518 ---------------------------------------- . "SpecializedDecoder::specialized_decode: loading source files from cnum {:?}", . cnum . ); . . // Decoding 'foreign' spans should be rare enough that it's . // not worth it to maintain a per-CrateNum cache for `last_source_file_index`. . // We just set it to 0, to ensure that we don't try to access something out . // of bounds for our initial 'guess' 5,130 ( 0.00%) decoder.last_source_file_index = 0; . 2,565 ( 0.00%) let foreign_data = decoder.cdata().cstore.get_crate_data(cnum); . foreign_data.imported_source_files(sess) . }; . . let source_file = { . // Optimize for the case that most spans within a translated item . // originate from the same source_file. 229,686 ( 0.01%) let last_source_file = &imported_source_files[decoder.last_source_file_index]; . 299,984 ( 0.01%) if lo >= last_source_file.original_start_pos && lo <= last_source_file.original_end_pos . { . last_source_file . } else { . let index = imported_source_files . .binary_search_by_key(&lo, |source_file| source_file.original_start_pos) 59,036 ( 0.00%) .unwrap_or_else(|index| index - 1); . . // Don't try to cache the index for foreign spans, . // as this would require a map from CrateNums to indices 29,529 ( 0.00%) if tag == TAG_VALID_SPAN_LOCAL { 29,221 ( 0.00%) decoder.last_source_file_index = index; . } 59,058 ( 0.00%) &imported_source_files[index] . } . }; . . // Make sure our binary search above is correct. . debug_assert!( . lo >= source_file.original_start_pos && lo <= source_file.original_end_pos, . "Bad binary search: lo={:?} source_file.original_start_pos={:?} source_file.original_end_pos={:?}", . lo, -- line 558 ---------------------------------------- -- line 565 ---------------------------------------- . hi >= source_file.original_start_pos && hi <= source_file.original_end_pos, . "Bad binary search: hi={:?} source_file.original_start_pos={:?} source_file.original_end_pos={:?}", . hi, . source_file.original_start_pos, . source_file.original_end_pos . ); . . let lo = 306,248 ( 0.02%) (lo + source_file.translated_source_file.start_pos) - source_file.original_start_pos; . let hi = . (hi + source_file.translated_source_file.start_pos) - source_file.original_start_pos; . . // Do not try to decode parent for foreign spans. . Span::new(lo, hi, ctxt, None) 689,517 ( 0.03%) } . } . . impl<'a, 'tcx> Decodable> for &'tcx [thir::abstract_const::Node<'tcx>] { . fn decode(d: &mut DecodeContext<'a, 'tcx>) -> Self { . ty::codec::RefDecodable::decode(d) . } . } . -- line 587 ---------------------------------------- -- line 590 ---------------------------------------- . ty::codec::RefDecodable::decode(d) . } . } . . impl<'a, 'tcx, T: Decodable>> Decodable> . for Lazy . { . fn decode(decoder: &mut DecodeContext<'a, 'tcx>) -> Self { 38,464 ( 0.00%) decoder.read_lazy_with_meta(()) . } . } . . impl<'a, 'tcx, T: Decodable>> Decodable> . for Lazy<[T]> . { . fn decode(decoder: &mut DecodeContext<'a, 'tcx>) -> Self { . let len = decoder.read_usize(); 45,792 ( 0.00%) if len == 0 { Lazy::empty() } else { decoder.read_lazy_with_meta(len) } . } . } . . impl<'a, 'tcx, I: Idx, T: Decodable>> Decodable> . for Lazy> . where . Option: FixedSizeEncoding, . { . fn decode(decoder: &mut DecodeContext<'a, 'tcx>) -> Self { . let len = decoder.read_usize(); 47,827 ( 0.00%) decoder.read_lazy_with_meta(len) . } . } . . implement_ty_decoder!(DecodeContext<'a, 'tcx>); . . impl<'tcx> MetadataBlob { . crate fn new(metadata_ref: MetadataRef) -> MetadataBlob { . MetadataBlob(Lrc::new(metadata_ref)) -- line 626 ---------------------------------------- -- line 630 ---------------------------------------- . self.blob().starts_with(METADATA_HEADER) . } . . crate fn get_rustc_version(&self) -> String { . Lazy::::from_position(NonZeroUsize::new(METADATA_HEADER.len() + 4).unwrap()) . .decode(self) . } . 849 ( 0.00%) crate fn get_root(&self) -> CrateRoot<'tcx> { 283 ( 0.00%) let slice = &self.blob()[..]; . let offset = METADATA_HEADER.len(); 1,415 ( 0.00%) let pos = (((slice[offset + 0] as u32) << 24) 566 ( 0.00%) | ((slice[offset + 1] as u32) << 16) 1,132 ( 0.00%) | ((slice[offset + 2] as u32) << 8) 849 ( 0.00%) | ((slice[offset + 3] as u32) << 0)) as usize; . Lazy::>::from_position(NonZeroUsize::new(pos).unwrap()).decode(self) 1,415 ( 0.00%) } . . crate fn list_crate_metadata(&self, out: &mut dyn io::Write) -> io::Result<()> { . let root = self.get_root(); . writeln!(out, "Crate info:")?; . writeln!(out, "name {}{}", root.name, root.extra_filename)?; . writeln!(out, "hash {} stable_crate_id {:?}", root.hash, root.stable_crate_id)?; . writeln!(out, "proc_macro {:?}", root.proc_macro_data.is_some())?; . writeln!(out, "=External Dependencies=")?; -- line 654 ---------------------------------------- -- line 666 ---------------------------------------- . } . write!(out, "\n")?; . Ok(()) . } . } . . impl CrateRoot<'_> { . crate fn is_proc_macro_crate(&self) -> bool { 162 ( 0.00%) self.proc_macro_data.is_some() . } . . crate fn name(&self) -> Symbol { 38 ( 0.00%) self.name . } . . crate fn hash(&self) -> Svh { 99 ( 0.00%) self.hash . } . . crate fn stable_crate_id(&self) -> StableCrateId { 170 ( 0.00%) self.stable_crate_id . } . . crate fn triple(&self) -> &TargetTriple { . &self.triple . } . . crate fn decode_crate_deps<'a>( . &self, . metadata: &'a MetadataBlob, . ) -> impl ExactSizeIterator + Captures<'a> { 160 ( 0.00%) self.crate_deps.decode(metadata) . } . } . . impl<'a, 'tcx> CrateMetadataRef<'a> { . fn raw_proc_macro(self, id: DefIndex) -> &'a ProcMacro { . // DefIndex's in root.proc_macro_data have a one-to-one correspondence . // with items in 'raw_proc_macros'. . let pos = self -- line 705 ---------------------------------------- -- line 709 ---------------------------------------- . .unwrap() . .macros . .decode(self) . .position(|i| i == id) . .unwrap(); . &self.raw_proc_macros.unwrap()[pos] . } . 201,586 ( 0.01%) fn opt_item_ident(self, item_index: DefIndex, sess: &Session) -> Option { 150,408 ( 0.01%) let name = self.def_key(item_index).disambiguated_data.data.get_opt_name()?; 72,065 ( 0.00%) let span = match self.root.tables.ident_span.get(self, item_index) { . Some(lazy_span) => lazy_span.decode((self, sess)), . None => { . // FIXME: this weird case of a name with no span is specific to `extern crate` . // items, which are supposed to be treated like `use` items and only be encoded . // to metadata as `Export`s, return `None` because that's what all the callers . // expect in this case. 873 ( 0.00%) assert_eq!(self.def_kind(item_index), DefKind::ExternCrate); . return None; . } . }; . Some(Ident::new(name, span)) 258,084 ( 0.01%) } . 1,061 ( 0.00%) fn item_ident(self, item_index: DefIndex, sess: &Session) -> Ident { 20,000 ( 0.00%) self.opt_item_ident(item_index, sess).expect("no encoded ident for item") 2,122 ( 0.00%) } . . fn maybe_kind(self, item_id: DefIndex) -> Option { 38,668 ( 0.00%) self.root.tables.kind.get(self, item_id).map(|k| k.decode(self)) . } . 154,672 ( 0.01%) fn kind(self, item_id: DefIndex) -> EntryKind { . self.maybe_kind(item_id).unwrap_or_else(|| { . bug!( . "CrateMetadata::kind({:?}): id not found, in crate {:?} with number {}", . item_id, . self.root.name, . self.cnum, . ) . }) 116,004 ( 0.01%) } . 68,831 ( 0.00%) fn def_kind(self, item_id: DefIndex) -> DefKind { 46,482 ( 0.00%) self.root.tables.def_kind.get(self, item_id).map(|k| k.decode(self)).unwrap_or_else(|| { . bug!( . "CrateMetadata::def_kind({:?}): id not found, in crate {:?} with number {}", . item_id, . self.root.name, . self.cnum, . ) . }) 39,332 ( 0.00%) } . 9,549 ( 0.00%) fn get_span(self, index: DefIndex, sess: &Session) -> Span { 28,344 ( 0.00%) self.root . .tables . .span . .get(self, index) . .unwrap_or_else(|| panic!("Missing span for {:?}", index)) . .decode((self, sess)) 5,305 ( 0.00%) } . . fn load_proc_macro(self, id: DefIndex, sess: &Session) -> SyntaxExtension { . let (name, kind, helper_attrs) = match *self.raw_proc_macro(id) { . ProcMacro::CustomDerive { trait_name, attributes, client } => { . let helper_attrs = . attributes.iter().cloned().map(Symbol::intern).collect::>(); . ( . trait_name, -- line 778 ---------------------------------------- -- line 795 ---------------------------------------- . self.get_span(id, sess), . helper_attrs, . self.root.edition, . Symbol::intern(name), . &attrs, . ) . } . 1,040 ( 0.00%) fn get_trait_def(self, item_id: DefIndex, sess: &Session) -> ty::TraitDef { 320 ( 0.00%) match self.kind(item_id) { 80 ( 0.00%) EntryKind::Trait(data) => { 480 ( 0.00%) let data = data.decode((self, sess)); 1,280 ( 0.00%) ty::TraitDef::new( . self.local_def_id(item_id), 160 ( 0.00%) data.unsafety, 160 ( 0.00%) data.paren_sugar, 160 ( 0.00%) data.has_auto_impl, 160 ( 0.00%) data.is_marker, 80 ( 0.00%) data.skip_array_during_method_dispatch, 80 ( 0.00%) data.specialization_kind, 320 ( 0.00%) self.def_path_hash(item_id), 80 ( 0.00%) data.must_implement_one_of, . ) . } . EntryKind::TraitAlias => ty::TraitDef::new( . self.local_def_id(item_id), . hir::Unsafety::Normal, . false, . false, . false, . false, . ty::trait_def::TraitSpecializationKind::None, . self.def_path_hash(item_id), . None, . ), . _ => bug!("def-index does not refer to trait or trait alias"), . } 720 ( 0.00%) } . 6,534 ( 0.00%) fn get_variant( . self, . kind: &EntryKind, . index: DefIndex, . parent_did: DefId, . sess: &Session, . ) -> ty::VariantDef { 2,904 ( 0.00%) let data = match kind { . EntryKind::Variant(data) | EntryKind::Struct(data, _) | EntryKind::Union(data, _) => { 3,630 ( 0.00%) data.decode(self) . } . _ => bug!(), . }; . 2,122 ( 0.00%) let adt_kind = match kind { . EntryKind::Variant(_) => ty::AdtKind::Enum, . EntryKind::Struct(..) => ty::AdtKind::Struct, . EntryKind::Union(..) => ty::AdtKind::Union, . _ => bug!(), . }; . . let variant_did = . if adt_kind == ty::AdtKind::Enum { Some(self.local_def_id(index)) } else { None }; 1,452 ( 0.00%) let ctor_did = data.ctor.map(|index| self.local_def_id(index)); . 15,972 ( 0.00%) ty::VariantDef::new( . self.item_ident(index, sess).name, . variant_did, . ctor_did, 2,904 ( 0.00%) data.discr, 4,356 ( 0.00%) self.root . .tables . .children . .get(self, index) . .unwrap_or_else(Lazy::empty) . .decode(self) . .map(|index| ty::FieldDef { 813 ( 0.00%) did: self.local_def_id(index), 1,626 ( 0.00%) name: self.item_ident(index, sess).name, 1,626 ( 0.00%) vis: self.get_visibility(index), . }) . .collect(), . data.ctor_kind, . adt_kind, . parent_did, . false, 726 ( 0.00%) data.is_non_exhaustive, . ) 6,534 ( 0.00%) } . 6,150 ( 0.00%) fn get_adt_def(self, item_id: DefIndex, tcx: TyCtxt<'tcx>) -> &'tcx ty::AdtDef { 1,640 ( 0.00%) let kind = self.kind(item_id); 820 ( 0.00%) let did = self.local_def_id(item_id); . 1,900 ( 0.00%) let (adt_kind, repr) = match kind { . EntryKind::Enum(repr) => (ty::AdtKind::Enum, repr), . EntryKind::Struct(_, repr) => (ty::AdtKind::Struct, repr), . EntryKind::Union(_, repr) => (ty::AdtKind::Union, repr), . _ => bug!("get_adt_def called on a non-ADT {:?}", did), . }; . . let variants = if let ty::AdtKind::Enum = adt_kind { 375 ( 0.00%) self.root . .tables . .children . .get(self, item_id) . .unwrap_or_else(Lazy::empty) . .decode(self) 6,647 ( 0.00%) .map(|index| self.get_variant(&self.kind(index), index, did, tcx.sess)) . .collect() . } else { 2,680 ( 0.00%) std::iter::once(self.get_variant(&kind, item_id, did, tcx.sess)).collect() . }; . 6,115 ( 0.00%) tcx.alloc_adt_def(did, adt_kind, variants, repr) 2,870 ( 0.00%) } . . fn get_explicit_predicates( . self, . item_id: DefIndex, . tcx: TyCtxt<'tcx>, . ) -> ty::GenericPredicates<'tcx> { 6,810 ( 0.00%) self.root.tables.explicit_predicates.get(self, item_id).unwrap().decode((self, tcx)) . } . . fn get_inferred_outlives( . self, . item_id: DefIndex, . tcx: TyCtxt<'tcx>, . ) -> &'tcx [(ty::Predicate<'tcx>, Span)] { 6,810 ( 0.00%) self.root . .tables . .inferred_outlives . .get(self, item_id) 64 ( 0.00%) .map(|predicates| tcx.arena.alloc_from_iter(predicates.decode((self, tcx)))) . .unwrap_or_default() . } . . fn get_super_predicates( . self, . item_id: DefIndex, . tcx: TyCtxt<'tcx>, . ) -> ty::GenericPredicates<'tcx> { 380 ( 0.00%) self.root.tables.super_predicates.get(self, item_id).unwrap().decode((self, tcx)) . } . . fn get_explicit_item_bounds( . self, . item_id: DefIndex, . tcx: TyCtxt<'tcx>, . ) -> &'tcx [(ty::Predicate<'tcx>, Span)] { 100 ( 0.00%) self.root . .tables . .explicit_item_bounds . .get(self, item_id) 76 ( 0.00%) .map(|bounds| tcx.arena.alloc_from_iter(bounds.decode((self, tcx)))) . .unwrap_or_default() . } . . fn get_generics(self, item_id: DefIndex, sess: &Session) -> ty::Generics { 17,601 ( 0.00%) self.root.tables.generics.get(self, item_id).unwrap().decode((self, sess)) . } . . fn get_type(self, id: DefIndex, tcx: TyCtxt<'tcx>) -> Ty<'tcx> { 21,265 ( 0.00%) self.root . .tables . .ty . .get(self, id) . .unwrap_or_else(|| panic!("Not a type: {:?}", id)) . .decode((self, tcx)) . } . . fn get_stability(self, id: DefIndex) -> Option { 1,375 ( 0.00%) self.root.tables.stability.get(self, id).map(|stab| stab.decode(self)) . } . . fn get_const_stability(self, id: DefIndex) -> Option { 40 ( 0.00%) self.root.tables.const_stability.get(self, id).map(|stab| stab.decode(self)) . } . . fn get_deprecation(self, id: DefIndex) -> Option { 2,620 ( 0.00%) self.root.tables.deprecation.get(self, id).map(|depr| depr.decode(self)) . } . 708 ( 0.00%) fn get_visibility(self, id: DefIndex) -> ty::Visibility { 37,026 ( 0.00%) self.root.tables.visibility.get(self, id).unwrap().decode(self) 472 ( 0.00%) } . . fn get_impl_data(self, id: DefIndex) -> ImplData { 75,840 ( 0.00%) match self.kind(id) { 63,200 ( 0.00%) EntryKind::Impl(data) => data.decode(self), . _ => bug!(), . } . } . . fn get_parent_impl(self, id: DefIndex) -> Option { 36,036 ( 0.00%) self.get_impl_data(id).parent_impl . } . . fn get_impl_polarity(self, id: DefIndex) -> ty::ImplPolarity { 549 ( 0.00%) self.get_impl_data(id).polarity . } . . fn get_impl_defaultness(self, id: DefIndex) -> hir::Defaultness { 45 ( 0.00%) self.get_impl_data(id).defaultness . } . . fn get_impl_constness(self, id: DefIndex) -> hir::Constness { 34 ( 0.00%) self.get_impl_data(id).constness . } . . fn get_trait_item_def_id(self, id: DefIndex) -> Option { 13,105 ( 0.00%) self.root.tables.trait_item_def_id.get(self, id).map(|d| d.decode(self)) . } . . fn get_coerce_unsized_info(self, id: DefIndex) -> Option { . self.get_impl_data(id).coerce_unsized_info . } . . fn get_impl_trait(self, id: DefIndex, tcx: TyCtxt<'tcx>) -> Option> { 148,530 ( 0.01%) self.root.tables.impl_trait_ref.get(self, id).map(|tr| tr.decode((self, tcx))) . } . . fn get_expn_that_defined(self, id: DefIndex, sess: &Session) -> ExpnId { 4,515 ( 0.00%) self.root.tables.expn_that_defined.get(self, id).unwrap().decode((self, sess)) . } . . fn get_const_param_default( . self, . tcx: TyCtxt<'tcx>, . id: DefIndex, . ) -> rustc_middle::ty::Const<'tcx> { . self.root.tables.const_defaults.get(self, id).unwrap().decode((self, tcx)) -- line 1026 ---------------------------------------- -- line 1028 ---------------------------------------- . . /// Iterates over all the stability attributes in the given crate. . fn get_lib_features(self, tcx: TyCtxt<'tcx>) -> &'tcx [(Symbol, Option)] { . tcx.arena.alloc_from_iter(self.root.lib_features.decode(self)) . } . . /// Iterates over the language items in the given crate. . fn get_lang_items(self, tcx: TyCtxt<'tcx>) -> &'tcx [(DefId, usize)] { 246 ( 0.00%) tcx.arena.alloc_from_iter( 164 ( 0.00%) self.root . .lang_items . .decode(self) 564 ( 0.00%) .map(|(def_index, index)| (self.local_def_id(def_index), index)), . ) . } . . /// Iterates over the diagnostic items in the given crate. . fn get_diagnostic_items(self) -> DiagnosticItems { . let mut id_to_name = FxHashMap::default(); 164 ( 0.00%) let name_to_id = self . .root . .diagnostic_items . .decode(self) . .map(|(name, def_index)| { 130 ( 0.00%) let id = self.local_def_id(def_index); 130 ( 0.00%) id_to_name.insert(id, name); . (name, id) . }) . .collect(); 738 ( 0.00%) DiagnosticItems { id_to_name, name_to_id } . } . . /// Iterates over all named children of the given module, . /// including both proper items and reexports. . /// Module here is understood in name resolution sense - it can be a `mod` item, . /// or a crate root, or an enum, or a trait. 5,423 ( 0.00%) fn for_each_module_child( . self, . id: DefIndex, . mut callback: impl FnMut(ModChild), . sess: &Session, . ) { 2,548 ( 0.00%) if let Some(data) = &self.root.proc_macro_data { . // If we are loading as a proc macro, we want to return . // the view of this crate as a proc macro crate. . if id == CRATE_DEF_INDEX { . for def_index in data.macros.decode(self) { . let raw_macro = self.raw_proc_macro(def_index); . let res = Res::Def( . DefKind::Macro(macro_kind(raw_macro)), . self.local_def_id(def_index), -- line 1078 ---------------------------------------- -- line 1085 ---------------------------------------- . span: ident.span, . }); . } . } . return; . } . . // Iterate over all children. 4,603 ( 0.00%) if let Some(children) = self.root.tables.children.get(self, id) { 18,941 ( 0.00%) for child_index in children.decode((self, sess)) { 109,011 ( 0.01%) if let Some(ident) = self.opt_item_ident(child_index, sess) { 18,143 ( 0.00%) let kind = self.def_kind(child_index); 9,890 ( 0.00%) if matches!(kind, DefKind::Macro(..)) { . // FIXME: Macros are currently encoded twice, once as items and once as . // reexports. We ignore the items here and only use the reexports. . continue; . } . let def_id = self.local_def_id(child_index); . let res = Res::Def(kind, def_id); . let vis = self.get_visibility(child_index); . let span = self.get_span(child_index, sess); . . callback(ModChild { ident, res, vis, span }); . . // For non-re-export structs and variants add their constructors to children. . // Re-export lists automatically contain constructors when necessary. 30,632 ( 0.00%) match kind { . DefKind::Struct => { 478 ( 0.00%) if let Some((ctor_def_id, ctor_kind)) = . self.get_ctor_def_id_and_kind(child_index) . { . let ctor_res = . Res::Def(DefKind::Ctor(CtorOf::Struct, ctor_kind), ctor_def_id); . let vis = self.get_visibility(ctor_def_id.index); . callback(ModChild { ident, res: ctor_res, vis, span }); . } . } . DefKind::Variant => { . // Braced variants, unlike structs, generate unusable names in . // value namespace, they are reserved for possible future use. . // It's ok to use the variant's id as a ctor id since an . // error will be reported on any use of such resolution anyway. 1,212 ( 0.00%) let (ctor_def_id, ctor_kind) = self . .get_ctor_def_id_and_kind(child_index) . .unwrap_or((def_id, CtorKind::Fictive)); . let ctor_res = . Res::Def(DefKind::Ctor(CtorOf::Variant, ctor_kind), ctor_def_id); . let mut vis = self.get_visibility(ctor_def_id.index); 420 ( 0.00%) if ctor_def_id == def_id && vis.is_public() { . // For non-exhaustive variants lower the constructor visibility to . // within the crate. We only need this for fictive constructors, . // for other constructors correct visibilities . // were already encoded in metadata. 12 ( 0.00%) let mut attrs = self.get_item_attrs(def_id.index, sess); 2 ( 0.00%) if attrs.any(|item| item.has_name(sym::non_exhaustive)) { . let crate_def_id = self.local_def_id(CRATE_DEF_INDEX); . vis = ty::Visibility::Restricted(crate_def_id); . } . } . callback(ModChild { ident, res: ctor_res, vis, span }); . } . _ => {} . } . } . } . } . 6,067 ( 0.00%) match self.kind(id) { 580 ( 0.00%) EntryKind::Mod(exports) => { 7,012 ( 0.00%) for exp in exports.decode((self, sess)) { . callback(exp); . } . } . EntryKind::Enum(..) | EntryKind::Trait(..) => {} . _ => bug!("`for_each_module_child` is called on a non-module: {:?}", self.def_kind(id)), . } 3,944 ( 0.00%) } . . fn is_ctfe_mir_available(self, id: DefIndex) -> bool { 108 ( 0.00%) self.root.tables.mir_for_ctfe.get(self, id).is_some() . } . . fn is_item_mir_available(self, id: DefIndex) -> bool { . self.root.tables.mir.get(self, id).is_some() . } . . fn module_expansion(self, id: DefIndex, sess: &Session) -> ExpnId { 5,236 ( 0.00%) match self.kind(id) { . EntryKind::Mod(_) | EntryKind::Enum(_) | EntryKind::Trait(_) => { . self.get_expn_that_defined(id, sess) . } . _ => panic!("Expected module, found {:?}", self.local_def_id(id)), . } . } . . fn get_optimized_mir(self, tcx: TyCtxt<'tcx>, id: DefIndex) -> Body<'tcx> { -- line 1180 ---------------------------------------- -- line 1184 ---------------------------------------- . .get(self, id) . .unwrap_or_else(|| { . bug!("get_optimized_mir: missing MIR for `{:?}`", self.local_def_id(id)) . }) . .decode((self, tcx)) . } . . fn get_mir_for_ctfe(self, tcx: TyCtxt<'tcx>, id: DefIndex) -> Body<'tcx> { 135 ( 0.00%) self.root . .tables . .mir_for_ctfe . .get(self, id) . .unwrap_or_else(|| { . bug!("get_mir_for_ctfe: missing MIR for `{:?}`", self.local_def_id(id)) . }) . .decode((self, tcx)) . } -- line 1200 ---------------------------------------- -- line 1227 ---------------------------------------- . .get(self, id) . .unwrap_or_else(|| { . bug!("get_promoted_mir: missing MIR for `{:?}`", self.local_def_id(id)) . }) . .decode((self, tcx)) . } . . fn mir_const_qualif(self, id: DefIndex) -> mir::ConstQualifs { 205 ( 0.00%) match self.kind(id) { . EntryKind::AnonConst(qualif, _) . | EntryKind::Const(qualif, _) . | EntryKind::AssocConst( . AssocContainer::ImplDefault . | AssocContainer::ImplFinal . | AssocContainer::TraitWithDefault, 22 ( 0.00%) qualif, . _, . ) => qualif, . _ => bug!("mir_const_qualif: unexpected kind"), . } . } . . fn get_fn_has_self_parameter(self, id: DefIndex) -> bool { 1,400 ( 0.00%) match self.kind(id) { 1,120 ( 0.00%) EntryKind::AssocFn(data) => data.decode(self).has_self, . _ => false, . } . } . . fn get_associated_item_def_ids(self, tcx: TyCtxt<'tcx>, id: DefIndex) -> &'tcx [DefId] { 2,667 ( 0.00%) if let Some(children) = self.root.tables.children.get(self, id) { 1,143 ( 0.00%) tcx.arena.alloc_from_iter( 381 ( 0.00%) children.decode((self, tcx.sess)).map(|child_index| self.local_def_id(child_index)), . ) . } else { . &[] . } . } . 26,736 ( 0.00%) fn get_associated_item(self, id: DefIndex, sess: &Session) -> ty::AssocItem { 15,596 ( 0.00%) let def_key = self.def_key(id); . let parent = self.local_def_id(def_key.parent.unwrap()); . let ident = self.item_ident(id, sess); . 16,314 ( 0.00%) let (kind, container, has_self) = match self.kind(id) { 412 ( 0.00%) EntryKind::AssocConst(container, _, _) => (ty::AssocKind::Const, container, false), 1,972 ( 0.00%) EntryKind::AssocFn(data) => { . let data = data.decode(self); 13,804 ( 0.00%) (ty::AssocKind::Fn, data.container, data.has_self) . } 306 ( 0.00%) EntryKind::AssocType(container) => (ty::AssocKind::Type, container, false), . _ => bug!("cannot get associated-item of `{:?}`", def_key), . }; . 40,104 ( 0.00%) ty::AssocItem { . name: ident.name, . kind, . vis: self.get_visibility(id), . defaultness: container.defaultness(), . def_id: self.local_def_id(id), . trait_item_def_id: self.get_trait_item_def_id(id), . container: container.with_def_id(parent), . fn_has_self_parameter: has_self, . } 20,052 ( 0.00%) } . . fn get_item_variances(self, id: DefIndex) -> impl Iterator + 'a { 795 ( 0.00%) self.root.tables.variances.get(self, id).unwrap_or_else(Lazy::empty).decode(self) . } . . fn get_ctor_def_id_and_kind(self, node_id: DefIndex) -> Option<(DefId, CtorKind)> { 12,342 ( 0.00%) match self.kind(node_id) { . EntryKind::Struct(data, _) | EntryKind::Variant(data) => { 5,376 ( 0.00%) let vdata = data.decode(self); 2,530 ( 0.00%) vdata.ctor.map(|index| (self.local_def_id(index), vdata.ctor_kind)) . } . _ => None, . } 5,504 ( 0.00%) } . 2,244 ( 0.00%) fn get_item_attrs( . self, . id: DefIndex, . sess: &'a Session, . ) -> impl Iterator + 'a { 5,031 ( 0.00%) self.root . .tables . .attributes . .get(self, id) . .unwrap_or_else(|| { . // Structure and variant constructors don't have any attributes encoded for them, . // but we assume that someone passing a constructor ID actually wants to look at . // the attributes on the corresponding struct or variant. . let def_key = self.def_key(id); -- line 1320 ---------------------------------------- -- line 1322 ---------------------------------------- . let parent_id = def_key.parent.expect("no parent for a constructor"); . self.root . .tables . .attributes . .get(self, parent_id) . .expect("no encoded attributes for a structure or variant") . }) . .decode((self, sess)) 1,683 ( 0.00%) } . . fn get_struct_field_names( . self, . id: DefIndex, . sess: &'a Session, . ) -> impl Iterator> + 'a { 3,085 ( 0.00%) self.root . .tables . .children . .get(self, id) . .unwrap_or_else(Lazy::empty) . .decode(self) 10,610 ( 0.00%) .map(move |index| respan(self.get_span(index, sess), self.item_ident(index, sess).name)) . } . . fn get_struct_field_visibilities(self, id: DefIndex) -> impl Iterator + 'a { 625 ( 0.00%) self.root . .tables . .children . .get(self, id) . .unwrap_or_else(Lazy::empty) . .decode(self) 236 ( 0.00%) .map(move |field_index| self.get_visibility(field_index)) . } . . fn get_inherent_implementations_for_type( . self, . tcx: TyCtxt<'tcx>, . id: DefIndex, . ) -> &'tcx [DefId] { 324 ( 0.00%) tcx.arena.alloc_from_iter( 405 ( 0.00%) self.root . .tables . .inherent_impls . .get(self, id) . .unwrap_or_else(Lazy::empty) . .decode(self) 2,366 ( 0.00%) .map(|index| self.local_def_id(index)), . ) . } . . fn get_traits(self) -> impl Iterator + 'a { . self.root.traits.decode(self).map(move |index| self.local_def_id(index)) . } . . fn get_trait_impls(self) -> impl Iterator)> + 'a { -- line 1376 ---------------------------------------- -- line 1380 ---------------------------------------- . index: *trait_index, . }; . impls.decode(self).map(move |(impl_index, simplified_self_ty)| { . (trait_def_id, self.local_def_id(impl_index), simplified_self_ty) . }) . }) . } . 64,206 ( 0.00%) fn get_implementations_of_trait( . self, . tcx: TyCtxt<'tcx>, . trait_def_id: DefId, . ) -> &'tcx [(DefId, Option)] { 7,134 ( 0.00%) if self.trait_impls.is_empty() { . return &[]; . } . . // Do a reverse lookup beforehand to avoid touching the crate_num . // hash map in the loop below. 8,378 ( 0.00%) let key = match self.reverse_translate_def_id(trait_def_id) { . Some(def_id) => (def_id.krate.as_u32(), def_id.index), . None => return &[], . }; . . if let Some(impls) = self.trait_impls.get(&key) { 3,532 ( 0.00%) tcx.arena.alloc_from_iter( 1,766 ( 0.00%) impls . .decode(self) 15,558 ( 0.00%) .map(|(idx, simplified_self_ty)| (self.local_def_id(idx), simplified_self_ty)), . ) . } else { . &[] . } 57,072 ( 0.00%) } . . fn get_trait_of_item(self, id: DefIndex) -> Option { 1,176 ( 0.00%) let def_key = self.def_key(id); 1,470 ( 0.00%) match def_key.disambiguated_data.data { . DefPathData::TypeNs(..) | DefPathData::ValueNs(..) => (), . // Not an associated item . _ => return None, . } 2,619 ( 0.00%) def_key.parent.and_then(|parent_index| match self.kind(parent_index) { . EntryKind::Trait(_) | EntryKind::TraitAlias => Some(self.local_def_id(parent_index)), . _ => None, . }) . } . . fn get_native_libraries(self, sess: &'a Session) -> impl Iterator + 'a { 164 ( 0.00%) self.root.native_libraries.decode((self, sess)) . } . . fn get_proc_macro_quoted_span(self, index: usize, sess: &Session) -> Span { . self.root . .tables . .proc_macro_quoted_spans . .get(self, index) . .unwrap_or_else(|| panic!("Missing proc macro quoted span: {:?}", index)) -- line 1437 ---------------------------------------- -- line 1450 ---------------------------------------- . self.root.dylib_dependency_formats.decode(self).enumerate().flat_map(|(i, link)| { . let cnum = CrateNum::new(i + 1); . link.map(|link| (self.cnum_map[cnum], link)) . }), . ) . } . . fn get_missing_lang_items(self, tcx: TyCtxt<'tcx>) -> &'tcx [lang_items::LangItem] { 410 ( 0.00%) tcx.arena.alloc_from_iter(self.root.lang_items_missing.decode(self)) . } . . fn get_fn_param_names(self, tcx: TyCtxt<'tcx>, id: DefIndex) -> &'tcx [Ident] { . let param_names = match self.kind(id) { . EntryKind::Fn(data) | EntryKind::ForeignFn(data) => data.decode(self).param_names, . EntryKind::AssocFn(data) => data.decode(self).fn_data.param_names, . _ => Lazy::empty(), . }; -- line 1466 ---------------------------------------- -- line 1479 ---------------------------------------- . EntryKind::AnonConst(_, data) . | EntryKind::Const(_, data) . | EntryKind::AssocConst(_, _, data) => data.decode(self).0, . _ => bug!(), . } . } . . fn get_macro(self, id: DefIndex, sess: &Session) -> MacroDef { 270 ( 0.00%) match self.kind(id) { 45 ( 0.00%) EntryKind::MacroDef(macro_def) => macro_def.decode((self, sess)), . _ => bug!(), . } . } . . // This replicates some of the logic of the crate-local `is_const_fn_raw` query, because we . // don't serialize constness for tuple variant and tuple struct constructors. . fn is_const_fn_raw(self, id: DefIndex) -> bool { 441 ( 0.00%) let constness = match self.kind(id) { 90 ( 0.00%) EntryKind::AssocFn(data) => data.decode(self).fn_data.constness, 24 ( 0.00%) EntryKind::Fn(data) => data.decode(self).constness, . EntryKind::ForeignFn(data) => data.decode(self).constness, . EntryKind::Variant(..) | EntryKind::Struct(..) => hir::Constness::Const, . _ => hir::Constness::NotConst, . }; . constness == hir::Constness::Const . } . . fn asyncness(self, id: DefIndex) -> hir::IsAsync { -- line 1506 ---------------------------------------- -- line 1508 ---------------------------------------- . EntryKind::Fn(data) => data.decode(self).asyncness, . EntryKind::AssocFn(data) => data.decode(self).fn_data.asyncness, . EntryKind::ForeignFn(data) => data.decode(self).asyncness, . _ => bug!("asyncness: expected function kind"), . } . } . . fn is_foreign_item(self, id: DefIndex) -> bool { 11 ( 0.00%) match self.kind(id) { . EntryKind::ForeignImmStatic | EntryKind::ForeignMutStatic | EntryKind::ForeignFn(_) => { . true . } . _ => false, . } . } . . fn static_mutability(self, id: DefIndex) -> Option { 220 ( 0.00%) match self.kind(id) { . EntryKind::ImmStatic | EntryKind::ForeignImmStatic => Some(hir::Mutability::Not), . EntryKind::MutStatic | EntryKind::ForeignMutStatic => Some(hir::Mutability::Mut), . _ => None, . } . } . . fn generator_kind(self, id: DefIndex) -> Option { . match self.kind(id) { . EntryKind::Generator(data) => Some(data), . _ => None, . } . } . . fn fn_sig(self, id: DefIndex, tcx: TyCtxt<'tcx>) -> ty::PolyFnSig<'tcx> { 1,735 ( 0.00%) self.root.tables.fn_sig.get(self, id).unwrap().decode((self, tcx)) . } . . #[inline] 195,706 ( 0.01%) fn def_key(self, index: DefIndex) -> DefKey { 55,916 ( 0.00%) *self . .def_key_cache . .lock() . .entry(index) 69,130 ( 0.00%) .or_insert_with(|| self.root.tables.def_keys.get(self, index).unwrap().decode(self)) 223,664 ( 0.01%) } . . // Returns the path leading to the thing with this `id`. . fn def_path(self, id: DefIndex) -> DefPath { . debug!("def_path(cnum={:?}, id={:?})", self.cnum, id); . DefPath::make(self.cnum, id, |parent| self.def_key(parent)) . } . . fn def_path_hash_unlocked( . self, . index: DefIndex, . def_path_hashes: &mut FxHashMap, . ) -> DefPathHash { 45,336 ( 0.00%) *def_path_hashes.entry(index).or_insert_with(|| { 2,090 ( 0.00%) self.root.tables.def_path_hashes.get(self, index).unwrap().decode(self) . }) . } . . #[inline] 158,676 ( 0.01%) fn def_path_hash(self, index: DefIndex) -> DefPathHash { . let mut def_path_hashes = self.def_path_hash_cache.lock(); . self.def_path_hash_unlocked(index, &mut def_path_hashes) 181,344 ( 0.01%) } . . #[inline] . fn def_path_hash_to_def_index(self, hash: DefPathHash) -> DefIndex { . self.def_path_hash_map.def_path_hash_to_def_index(&hash) . } . . fn expn_hash_to_expn_id(self, sess: &Session, index_guess: u32, hash: ExpnHash) -> ExpnId { . debug_assert_eq!(ExpnId::from_hash(hash), None); -- line 1580 ---------------------------------------- -- line 1635 ---------------------------------------- . /// Proc macro crates don't currently export spans, so this function does not have . /// to work for them. . fn imported_source_files(self, sess: &Session) -> &'a [ImportedSourceFile] { . // Translate the virtual `/rustc/$hash` prefix back to a real directory . // that should hold actual sources, where possible. . // . // NOTE: if you update this, you might need to also update bootstrap's code for generating . // the `rust-src` component in `Src::run` in `src/bootstrap/dist.rs`. 153,124 ( 0.01%) let virtual_rust_source_base_dir = option_env!("CFG_VIRTUAL_RUST_SOURCE_BASE_DIR") . .map(Path::new) . .filter(|_| { . // Only spend time on further checks if we have what to translate *to*. . sess.opts.real_rust_source_base_dir.is_some() . }) . .filter(|virtual_dir| { . // Don't translate away `/rustc/$hash` if we're still remapping to it, . // since that means we're still building `std`/`rustc` that need it, . // and we don't want the real path to leak into codegen/debuginfo. . !sess.opts.remap_path_prefix.iter().any(|(_from, to)| to == virtual_dir) . }); 153,124 ( 0.01%) let try_to_translate_virtual_to_real = |name: &mut rustc_span::FileName| { . debug!( . "try_to_translate_virtual_to_real(name={:?}): \ . virtual_rust_source_base_dir={:?}, real_rust_source_base_dir={:?}", . name, virtual_rust_source_base_dir, sess.opts.real_rust_source_base_dir, . ); . 6,235 ( 0.00%) if let Some(virtual_dir) = virtual_rust_source_base_dir { . if let Some(real_dir) = &sess.opts.real_rust_source_base_dir { . if let rustc_span::FileName::Real(old_name) = name { . if let rustc_span::RealFileName::Remapped { local_path: _, virtual_name } = . old_name . { . if let Ok(rest) = virtual_name.strip_prefix(virtual_dir) { . let virtual_name = virtual_name.clone(); . -- line 1670 ---------------------------------------- -- line 1709 ---------------------------------------- . *old_name = new_name; . } . } . } . } . } . }; . 150,559 ( 0.01%) self.cdata.source_map_import_info.get_or_init(|| { 147 ( 0.00%) let external_source_map = self.root.source_map.decode(self); . . external_source_map . .map(|source_file_to_import| { . // We can't reuse an existing SourceFile, so allocate a new one . // containing the information we need. . let rustc_span::SourceFile { 26,187 ( 0.00%) mut name, 7,482 ( 0.00%) src_hash, 1,247 ( 0.00%) start_pos, 2,494 ( 0.00%) end_pos, 6,235 ( 0.00%) mut lines, 6,235 ( 0.00%) mut multibyte_chars, 7,482 ( 0.00%) mut non_narrow_chars, 6,235 ( 0.00%) mut normalized_pos, 7,482 ( 0.00%) name_hash, . .. . } = source_file_to_import; . . // If this file is under $sysroot/lib/rustlib/src/ but has not been remapped . // during rust bootstrapping by `remap-debuginfo = true`, and the user . // wish to simulate that behaviour by -Z simulate-remapped-rust-src-base, . // then we change `name` to a similar state as if the rust was bootstrapped . // with `remap-debuginfo = true`. . // This is useful for testing so that tests about the effects of . // `try_to_translate_virtual_to_real` don't have to worry about how the . // compiler is bootstrapped. 2,494 ( 0.00%) if let Some(virtual_dir) = . &sess.opts.debugging_opts.simulate_remapped_rust_src_base . { . if let Some(real_dir) = &sess.opts.real_rust_source_base_dir { . if let rustc_span::FileName::Real(ref mut old_name) = name { . if let rustc_span::RealFileName::LocalPath(local) = old_name { . if let Ok(rest) = local.strip_prefix(real_dir) { . *old_name = rustc_span::RealFileName::Remapped { . local_path: None, -- line 1753 ---------------------------------------- -- line 1767 ---------------------------------------- . let source_length = (end_pos - start_pos).to_usize(); . . // Translate line-start positions and multibyte character . // position into frame of reference local to file. . // `SourceMap::new_imported_source_file()` will then translate those . // coordinates to their new global frame of reference when the . // offset of the SourceFile is known. . for pos in &mut lines { 1,513,412 ( 0.07%) *pos = *pos - start_pos; . } . for mbc in &mut multibyte_chars { 1,898 ( 0.00%) mbc.pos = mbc.pos - start_pos; . } . for swc in &mut non_narrow_chars { 948 ( 0.00%) *swc = *swc - start_pos; . } . for np in &mut normalized_pos { 32,790 ( 0.00%) np.pos = np.pos - start_pos; . } . 22,446 ( 0.00%) let local_version = sess.source_map().new_imported_source_file( 16,211 ( 0.00%) name, 8,729 ( 0.00%) src_hash, . name_hash, . source_length, 2,494 ( 0.00%) self.cnum, 6,235 ( 0.00%) lines, 7,482 ( 0.00%) multibyte_chars, 6,235 ( 0.00%) non_narrow_chars, 4,988 ( 0.00%) normalized_pos, . start_pos, . end_pos, . ); . debug!( . "CrateMetaData::imported_source_files alloc \ . source_file {:?} original (start_pos {:?} end_pos {:?}) \ . translated (start_pos {:?} end_pos {:?})", . local_version.name, -- line 1804 ---------------------------------------- -- line 1808 ---------------------------------------- . local_version.end_pos . ); . . ImportedSourceFile { . original_start_pos: start_pos, . original_end_pos: end_pos, . translated_source_file: local_version, . } 3,741 ( 0.00%) }) . .collect() . }) . } . } . . impl CrateMetadata { 984 ( 0.00%) crate fn new( . sess: &Session, . blob: MetadataBlob, . root: CrateRoot<'static>, . raw_proc_macros: Option<&'static [ProcMacro]>, . cnum: CrateNum, . cnum_map: CrateNumMap, . dep_kind: CrateDepKind, . source: CrateSource, . private_dep: bool, . host_hash: Option, . ) -> CrateMetadata { 246 ( 0.00%) let trait_impls = root . .impls . .decode((&blob, sess)) . .map(|trait_impls| (trait_impls.trait_id, trait_impls.impls)) . .collect(); . let alloc_decoding_state = 246 ( 0.00%) AllocDecodingState::new(root.interpret_alloc_index.decode(&blob).collect()); . let dependencies = Lock::new(cnum_map.iter().cloned().collect()); . . // Pre-decode the DefPathHash->DefIndex table. This is a cheap operation . // that does not copy any data. It just does some data verification. 82 ( 0.00%) let def_path_hash_map = root.def_path_hash_map.decode(&blob); . 1,886 ( 0.00%) CrateMetadata { 82 ( 0.00%) blob, 246 ( 0.00%) root, 328 ( 0.00%) trait_impls, . raw_proc_macros, . source_map_import_info: OnceCell::new(), 328 ( 0.00%) def_path_hash_map, . expn_hash_map: Default::default(), 574 ( 0.00%) alloc_decoding_state, . cnum, 328 ( 0.00%) cnum_map, 410 ( 0.00%) dependencies, . dep_kind: Lock::new(dep_kind), 984 ( 0.00%) source, . private_dep, . host_hash, . extern_crate: Lock::new(None), . hygiene_context: Default::default(), . def_key_cache: Default::default(), . def_path_hash_cache: Default::default(), . } 738 ( 0.00%) } . . crate fn dependencies(&self) -> LockGuard<'_, Vec> { . self.dependencies.borrow() . } . . crate fn add_dependency(&self, cnum: CrateNum) { . self.dependencies.borrow_mut().push(cnum); . } . . crate fn update_extern_crate(&self, new_extern_crate: ExternCrate) -> bool { . let mut extern_crate = self.extern_crate.borrow_mut(); . let update = Some(new_extern_crate.rank()) > extern_crate.as_ref().map(ExternCrate::rank); . if update { 435 ( 0.00%) *extern_crate = Some(new_extern_crate); . } . update . } . . crate fn source(&self) -> &CrateSource { 2,624 ( 0.00%) &self.source . } . . crate fn dep_kind(&self) -> CrateDepKind { . *self.dep_kind.lock() . } . . crate fn update_dep_kind(&self, f: impl FnOnce(CrateDepKind) -> CrateDepKind) { 1,820 ( 0.00%) self.dep_kind.with_lock(|dep_kind| *dep_kind = f(*dep_kind)) . } . . crate fn panic_strategy(&self) -> PanicStrategy { . self.root.panic_strategy . } . . crate fn needs_panic_runtime(&self) -> bool { . self.root.needs_panic_runtime -- line 1905 ---------------------------------------- -- line 1909 ---------------------------------------- . self.root.panic_runtime . } . . crate fn is_profiler_runtime(&self) -> bool { . self.root.profiler_runtime . } . . crate fn needs_allocator(&self) -> bool { 5 ( 0.00%) self.root.needs_allocator . } . . crate fn has_global_allocator(&self) -> bool { . self.root.has_global_allocator . } . . crate fn has_default_lib_allocator(&self) -> bool { . self.root.has_default_lib_allocator . } . . crate fn is_proc_macro_crate(&self) -> bool { . self.root.is_proc_macro_crate() . } . . crate fn name(&self) -> Symbol { 16,765 ( 0.00%) self.root.name . } . . crate fn stable_crate_id(&self) -> StableCrateId { . self.root.stable_crate_id . } . . crate fn hash(&self) -> Svh { . self.root.hash . } . . fn num_def_ids(&self) -> usize { . self.root.tables.def_keys.size() . } . . fn local_def_id(&self, index: DefIndex) -> DefId { 46,765 ( 0.00%) DefId { krate: self.cnum, index } . } . . // Translate a DefId from the current compilation environment to a DefId . // for an external crate. . fn reverse_translate_def_id(&self, did: DefId) -> Option { . for (local, &global) in self.cnum_map.iter_enumerated() { 60,879 ( 0.00%) if global == did.krate { . return Some(DefId { krate: local, index: did.index }); . } . } . . None . } . } . -- line 1964 ---------------------------------------- 1,641,729 ( 0.08%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/rustc-hash-1.1.0/src/lib.rs -------------------------------------------------------------------------------- Ir -- line 71 ---------------------------------------- . fn default() -> FxHasher { . FxHasher { hash: 0 } . } . } . . impl FxHasher { . #[inline] . fn add_to_hash(&mut self, i: usize) { 1,585,621 ( 0.08%) self.hash = self.hash.rotate_left(5).bitxor(i).wrapping_mul(K); . } . } . . impl Hasher for FxHasher { . #[inline] 9,506 ( 0.00%) fn write(&mut self, mut bytes: &[u8]) { . #[cfg(target_pointer_width = "32")] . let read_usize = |bytes: &[u8]| u32::from_ne_bytes(bytes[..4].try_into().unwrap()); . #[cfg(target_pointer_width = "64")] . let read_usize = |bytes: &[u8]| u64::from_ne_bytes(bytes[..8].try_into().unwrap()); . 159,869 ( 0.01%) let mut hash = FxHasher { hash: self.hash }; . assert!(size_of::() <= 8); 2,084,023 ( 0.10%) while bytes.len() >= size_of::() { . hash.add_to_hash(read_usize(bytes) as usize); . bytes = &bytes[size_of::()..]; . } 320,948 ( 0.02%) if (size_of::() > 4) && (bytes.len() >= 4) { . hash.add_to_hash(u32::from_ne_bytes(bytes[..4].try_into().unwrap()) as usize); . bytes = &bytes[4..]; . } 320,948 ( 0.02%) if (size_of::() > 2) && bytes.len() >= 2 { . hash.add_to_hash(u16::from_ne_bytes(bytes[..2].try_into().unwrap()) as usize); . bytes = &bytes[2..]; . } 356,667 ( 0.02%) if (size_of::() > 1) && bytes.len() >= 1 { 76,151 ( 0.00%) hash.add_to_hash(bytes[0] as usize); . } 12,715 ( 0.00%) self.hash = hash.hash; 9,506 ( 0.00%) } . . #[inline] . fn write_u8(&mut self, i: u8) { 527 ( 0.00%) self.add_to_hash(i as usize); . } . . #[inline] . fn write_u16(&mut self, i: u16) { 1,659 ( 0.00%) self.add_to_hash(i as usize); . } . . #[inline] . fn write_u32(&mut self, i: u32) { 2,449,594 ( 0.12%) self.add_to_hash(i as usize); . } . . #[cfg(target_pointer_width = "32")] . #[inline] . fn write_u64(&mut self, i: u64) { . self.add_to_hash(i as usize); . self.add_to_hash((i >> 32) as usize); . } -- line 131 ---------------------------------------- 6 ( 0.00%) -------------------------------------------------------------------------------- -- 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; . 17,309 ( 0.00%) fn with_cause(&mut self, _cause: Cause, f: F) -> R . where . F: FnOnce(&mut Self) -> R, . { . f(self) 15,227 ( 0.00%) } . . /// Generic relation routine suitable for most anything. 270,760 ( 0.01%) fn relate>(&mut self, a: T, b: T) -> RelateResult<'tcx, T> { 279,936 ( 0.01%) Relate::relate(self, a, b) 222,306 ( 0.01%) } . . /// Relate the two substitutions for the given item. The default . /// is to look up the variance for the item and proceed . /// accordingly. 58,700 ( 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); 23,480 ( 0.00%) relate_substs(self, Some((item_def_id, opt_variances)), a_subst, b_subst) 52,830 ( 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 . 102,805 ( 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); 19,159 ( 0.00%) if a.mutbl != b.mutbl { 366 ( 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 }) . } . }; 7,008 ( 0.00%) let ty = relation.relate_with_variance(variance, info, a.ty, b.ty)?; 46,752 ( 0.00%) Ok(ty::TypeAndMut { ty, mutbl }) . } 103,057 ( 0.01%) } . 1,715 ( 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>> { 119,089 ( 0.01%) let tcx = relation.tcx(); 54,590 ( 0.00%) let mut cached_ty = None; . . let params = iter::zip(a_subst, b_subst).enumerate().map(|(i, (a, b))| { 285,393 ( 0.01%) let (variance, variance_info) = match variances { 24,700 ( 0.00%) Some((ty_def_id, variances)) => { 37,050 ( 0.00%) let variance = variances[i]; 12,350 ( 0.00%) let variance_info = if variance == ty::Invariant { . let ty = 4,069 ( 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()), . }; 64,313 ( 0.00%) relation.relate_with_variance(variance, variance_info, a, b) . }); . . tcx.mk_substs(params) 2,058 ( 0.00%) } . . impl<'tcx> Relate<'tcx> for ty::FnSig<'tcx> { 5,785 ( 0.00%) fn relate>( . relation: &mut R, . a: ty::FnSig<'tcx>, . b: ty::FnSig<'tcx>, . ) -> RelateResult<'tcx, ty::FnSig<'tcx>> { . let tcx = relation.tcx(); . 2,670 ( 0.00%) if a.c_variadic != b.c_variadic { . return Err(TypeError::VariadicMismatch(expected_found( . relation, . a.c_variadic, . b.c_variadic, . ))); . } 2,234 ( 0.00%) let unsafety = relation.relate(a.unsafety, b.unsafety)?; . let abi = relation.relate(a.abi, b.abi)?; . 3,778 ( 0.00%) if a.inputs().len() != b.inputs().len() { . return Err(TypeError::ArgCount); . } . 4,005 ( 0.00%) let inputs_and_output = iter::zip(a.inputs(), b.inputs()) 1,772 ( 0.00%) .map(|(&a, &b)| ((a, b), false)) 3,560 ( 0.00%) .chain(iter::once(((a.output(), b.output()), true))) 592 ( 0.00%) .map(|((a, b), is_output)| { 592 ( 0.00%) if is_output { 528 ( 0.00%) relation.relate(a, b) . } else { . relation.relate_with_variance( . ty::Contravariant, . ty::VarianceDiagInfo::default(), . a, . b, . ) . } . }) . .enumerate() 2,675 ( 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)) . } 3,795 ( 0.00%) r => r, . }); 3,342 ( 0.00%) Ok(ty::FnSig { . inputs_and_output: tcx.mk_type_list(inputs_and_output)?, 445 ( 0.00%) c_variadic: a.c_variadic, . unsafety, . abi, . }) 4,005 ( 0.00%) } . } . . impl<'tcx> Relate<'tcx> for ty::BoundConstness { . fn relate>( . relation: &mut R, . a: ty::BoundConstness, . b: ty::BoundConstness, . ) -> RelateResult<'tcx, ty::BoundConstness> { -- line 229 ---------------------------------------- -- line 236 ---------------------------------------- . } . . impl<'tcx> Relate<'tcx> for ast::Unsafety { . fn relate>( . relation: &mut R, . a: ast::Unsafety, . b: ast::Unsafety, . ) -> RelateResult<'tcx, ast::Unsafety> { 445 ( 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> { 12,032 ( 0.00%) fn relate>( . relation: &mut R, . a: ty::ProjectionTy<'tcx>, . b: ty::ProjectionTy<'tcx>, . ) -> RelateResult<'tcx, ty::ProjectionTy<'tcx>> { 3,053 ( 0.00%) if a.item_def_id != b.item_def_id { 6 ( 0.00%) Err(TypeError::ProjectionMismatched(expected_found( . relation, . a.item_def_id, . b.item_def_id, . ))) . } else { . let substs = relation.relate(a.substs, b.substs)?; 3,836 ( 0.00%) Ok(ty::ProjectionTy { item_def_id: a.item_def_id, substs: &substs }) . } 8,271 ( 0.00%) } . } . . impl<'tcx> Relate<'tcx> for ty::ExistentialProjection<'tcx> { 4,468 ( 0.00%) fn relate>( . relation: &mut R, . a: ty::ExistentialProjection<'tcx>, . b: ty::ExistentialProjection<'tcx>, . ) -> RelateResult<'tcx, ty::ExistentialProjection<'tcx>> { 2,982 ( 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,317 ( 0.00%) a.term, 1,634 ( 0.00%) b.term, . )?; 518 ( 0.00%) let substs = relation.relate_with_variance( . ty::Invariant, . ty::VarianceDiagInfo::default(), 426 ( 0.00%) a.substs, 426 ( 0.00%) b.substs, . )?; 4,155 ( 0.00%) Ok(ty::ExistentialProjection { item_def_id: a.item_def_id, substs, term }) . } 3,834 ( 0.00%) } . } . . impl<'tcx> Relate<'tcx> for ty::TraitRef<'tcx> { 221,564 ( 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. 47,539 ( 0.00%) if a.def_id != b.def_id { 165 ( 0.00%) Err(TypeError::Traits(expected_found(relation, a.def_id, b.def_id))) . } else { 15,828 ( 0.00%) let substs = relate_substs(relation, None, a.substs, b.substs)?; 47,096 ( 0.00%) Ok(ty::TraitRef { def_id: a.def_id, substs }) . } 142,415 ( 0.01%) } . } . . impl<'tcx> Relate<'tcx> for ty::ExistentialTraitRef<'tcx> { 3,663 ( 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. 7,252 ( 0.00%) if a.def_id != b.def_id { 3 ( 0.00%) Err(TypeError::Traits(expected_found(relation, a.def_id, b.def_id))) . } else { 2,959 ( 0.00%) let substs = relate_substs(relation, None, a.substs, b.substs)?; 4,452 ( 0.00%) Ok(ty::ExistentialTraitRef { def_id: a.def_id, substs }) . } 2,331 ( 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>> { 108 ( 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>> { 262,185 ( 0.01%) 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. 557,360 ( 0.03%) 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); 1,246,344 ( 0.06%) 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, _) 3,858 ( 0.00%) if a == b => . { . Ok(a) . } . 9,286 ( 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), . 339,122 ( 0.02%) (&ty::Adt(a_def, a_substs), &ty::Adt(b_def, b_substs)) if a_def == b_def => { 106,598 ( 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)), . 18,544 ( 0.00%) (&ty::Dynamic(a_obj, a_region), &ty::Dynamic(b_obj, b_region)) => { 4,892 ( 0.00%) let region_bound = relation.with_cause(Cause::ExistentialRegionBound, |relation| { . relation.relate_with_variance( . ty::Contravariant, . ty::VarianceDiagInfo::default(), 2,446 ( 0.00%) a_region, . b_region, . ) . })?; . Ok(tcx.mk_dynamic(relation.relate(a_obj, b_obj)?, region_bound)) . } . 248 ( 0.00%) (&ty::Generator(a_id, a_substs, movability), &ty::Generator(b_id, b_substs, _)) 310 ( 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. 124 ( 0.00%) let substs = relation.relate(a_substs, b_substs)?; . Ok(tcx.mk_generator(a_id, substs, movability)) . } . 135 ( 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)) . } . 912 ( 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. 228 ( 0.00%) let substs = relation.relate(a_substs, b_substs)?; . Ok(tcx.mk_closure(a_id, &substs)) . } . 60 ( 0.00%) (&ty::RawPtr(a_mt), &ty::RawPtr(b_mt)) => { . let mt = relate_type_and_mut(relation, a_mt, b_mt, a)?; . Ok(tcx.mk_ptr(mt)) . } . 186,382 ( 0.01%) (&ty::Ref(a_r, a_ty, a_mutbl), &ty::Ref(b_r, b_ty, b_mutbl)) => { 77,112 ( 0.00%) 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 }; 117,672 ( 0.01%) let mt = relate_type_and_mut(relation, a_mt, b_mt, a)?; . Ok(tcx.mk_ref(r, mt)) . } . 3,040 ( 0.00%) (&ty::Array(a_t, sz_a), &ty::Array(b_t, sz_b)) => { 1,152 ( 0.00%) let t = relation.relate(a_t, b_t)?; 1,216 ( 0.00%) match relation.relate(sz_a, sz_b) { 1,824 ( 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. -- line 484 ---------------------------------------- -- line 489 ---------------------------------------- . TypeError::FixedArraySize(expected_found(relation, sz_a_val, sz_b_val)), . ), . _ => Err(err), . } . } . } . } . 2,505 ( 0.00%) (&ty::Slice(a_t), &ty::Slice(b_t)) => { 334 ( 0.00%) let t = relation.relate(a_t, b_t)?; . Ok(tcx.mk_slice(t)) . } . 4,122 ( 0.00%) (&ty::Tuple(as_), &ty::Tuple(bs)) => { 4,122 ( 0.00%) if as_.len() == bs.len() { . Ok(tcx.mk_tup( 11,632 ( 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))) . } . } . 1,710 ( 0.00%) (&ty::FnDef(a_def_id, a_substs), &ty::FnDef(b_def_id, b_substs)) 2,850 ( 0.00%) if a_def_id == b_def_id => . { 2,280 ( 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)) => { 4,032 ( 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 2,250 ( 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)) . } . 686 ( 0.00%) (&ty::Opaque(a_def_id, a_substs), &ty::Opaque(b_def_id, b_substs)) 1,715 ( 0.00%) if a_def_id == b_def_id => . { 2,058 ( 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))), . } 627,030 ( 0.03%) } . . /// The main "const relation" routine. Note that this does not handle . /// inference artifacts, so you should filter those out before calling . /// it. 2,240 ( 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. 448 ( 0.00%) let a_ty = tcx.erase_regions(a.ty); 448 ( 0.00%) let b_ty = tcx.erase_regions(b.ty); 224 ( 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()); 224 ( 0.00%) let a = eagerly_eval(a); 448 ( 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. 2,464 ( 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, . }; 1,344 ( 0.00%) if is_match { Ok(a) } else { Err(TypeError::ConstMismatch(expected_found(relation, a, b))) } 2,016 ( 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> { 224 ( 0.00%) let tcx = relation.tcx(); 2,464 ( 0.00%) Ok(match (a_val, b_val) { 4,928 ( 0.00%) (ConstValue::Scalar(Scalar::Int(a_val)), ConstValue::Scalar(Scalar::Int(b_val))) => { 224 ( 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>> { 27,320 ( 0.00%) fn relate>( . relation: &mut R, . a: Self, . b: Self, . ) -> RelateResult<'tcx, Self> { 2,732 ( 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 35,304 ( 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(); 8,196 ( 0.00%) if a_v.len() != b_v.len() { 208 ( 0.00%) return Err(TypeError::ExistentialMismatch(expected_found(relation, a, b))); . } . 10,720 ( 0.00%) let v = iter::zip(a_v, b_v).map(|(ep_a, ep_b)| { . use crate::ty::ExistentialPredicate::*; 44,306 ( 0.00%) match (ep_a.skip_binder(), ep_b.skip_binder()) { 2,840 ( 0.00%) (Trait(a), Trait(b)) => Ok(ep_a 1,970 ( 0.00%) .rebind(Trait(relation.relate(ep_a.rebind(a), ep_b.rebind(b))?.skip_binder()))), . (Projection(a), Projection(b)) => Ok(ep_a.rebind(Projection( 2,999 ( 0.00%) relation.relate(ep_a.rebind(a), ep_b.rebind(b))?.skip_binder(), . ))), 27,179 ( 0.00%) (AutoTrait(a), AutoTrait(b)) if a == b => Ok(ep_a.rebind(AutoTrait(a))), . _ => Err(TypeError::ExistentialMismatch(expected_found(relation, a, b))), . } . }); 5,360 ( 0.00%) tcx.mk_poly_existential_predicates(v) 21,856 ( 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,619 ( 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>> { 103,128 ( 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>> { 2,400 ( 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>> { 32,626 ( 0.00%) relation.binders(a, b) . } . } . . impl<'tcx> Relate<'tcx> for GenericArg<'tcx> { 226,960 ( 0.01%) fn relate>( . relation: &mut R, . a: GenericArg<'tcx>, . b: GenericArg<'tcx>, . ) -> RelateResult<'tcx, GenericArg<'tcx>> { 296,442 ( 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)) => { 2,410 ( 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) . } . } 244,850 ( 0.01%) } . } . . impl<'tcx> Relate<'tcx> for ty::ImplPolarity { . fn relate>( . relation: &mut R, . a: ty::ImplPolarity, . b: ty::ImplPolarity, . ) -> RelateResult<'tcx, ty::ImplPolarity> { -- line 813 ---------------------------------------- -- line 815 ---------------------------------------- . Err(TypeError::PolarityMismatch(expected_found(relation, a, b))) . } else { . Ok(a) . } . } . } . . impl<'tcx> Relate<'tcx> for ty::TraitPredicate<'tcx> { 693 ( 0.00%) fn relate>( . relation: &mut R, . a: ty::TraitPredicate<'tcx>, . b: ty::TraitPredicate<'tcx>, . ) -> RelateResult<'tcx, ty::TraitPredicate<'tcx>> { . Ok(ty::TraitPredicate { 315 ( 0.00%) trait_ref: relation.relate(a.trait_ref, b.trait_ref)?, . constness: relation.relate(a.constness, b.constness)?, . polarity: relation.relate(a.polarity, b.polarity)?, . }) 567 ( 0.00%) } . } . . impl<'tcx> Relate<'tcx> for ty::Term<'tcx> { 1,278 ( 0.00%) fn relate>( . relation: &mut R, . a: Self, . b: Self, . ) -> RelateResult<'tcx, Self> { 2,982 ( 0.00%) Ok(match (a, b) { 222 ( 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,704 ( 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>, . { 110 ( 0.00%) ExpectedFound::new(relation.a_is_expected(), a, b) . } 1,425,502 ( 0.07%) -------------------------------------------------------------------------------- -- 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. 565,464 ( 0.03%) 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), 29,321 ( 0.00%) GoDown(handle) => match handle.force() { . Leaf(leaf) => return GoDown(leaf), . Internal(internal) => internal.descend(), . }, . } . } 302,431 ( 0.01%) } . . /// 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()); 344,795 ( 0.02%) for (offset, k) in unsafe { keys.get_unchecked(start_index..) }.iter().enumerate() { 1,265,220 ( 0.06%) 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 ---------------------------------------- 658,407 ( 0.03%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/opaque.rs -------------------------------------------------------------------------------- Ir -- line 14 ---------------------------------------- . . pub type EncodeResult = Result<(), !>; . . pub struct Encoder { . pub data: Vec, . } . . impl Encoder { 1 ( 0.00%) pub fn new(data: Vec) -> Encoder { 4 ( 0.00%) Encoder { data } 1 ( 0.00%) } . 1 ( 0.00%) pub fn into_inner(self) -> Vec { 4 ( 0.00%) self.data 1 ( 0.00%) } . . #[inline] . pub fn position(&self) -> usize { 28,014 ( 0.00%) self.data.len() . } . } . . macro_rules! write_leb128 { . ($enc:expr, $value:expr, $int_ty:ty, $fun:ident) => {{ . const MAX_ENCODED_LEN: usize = max_leb128_len!($int_ty); . let old_len = $enc.data.len(); . -- line 40 ---------------------------------------- -- line 67 ---------------------------------------- . . #[inline] . fn emit_unit(&mut self) -> EncodeResult { . Ok(()) . } . . #[inline] . fn emit_usize(&mut self, v: usize) -> EncodeResult { 630,621 ( 0.03%) write_leb128!(self, v, usize, write_usize_leb128) . } . . #[inline] . fn emit_u128(&mut self, v: u128) -> EncodeResult { 4,956 ( 0.00%) write_leb128!(self, v, u128, write_u128_leb128) . } . . #[inline] . fn emit_u64(&mut self, v: u64) -> EncodeResult { 5,978 ( 0.00%) write_leb128!(self, v, u64, write_u64_leb128) . } . . #[inline] . fn emit_u32(&mut self, v: u32) -> EncodeResult { 591,722 ( 0.03%) write_leb128!(self, v, u32, write_u32_leb128) . } . . #[inline] . fn emit_u16(&mut self, v: u16) -> EncodeResult { . self.data.extend_from_slice(&v.to_le_bytes()); . Ok(()) . } . -- line 98 ---------------------------------------- -- line 131 ---------------------------------------- . #[inline] . fn emit_i8(&mut self, v: i8) -> EncodeResult { . let as_u8: u8 = unsafe { std::mem::transmute(v) }; . self.emit_u8(as_u8) . } . . #[inline] . fn emit_bool(&mut self, v: bool) -> EncodeResult { 7,862 ( 0.00%) self.emit_u8(if v { 1 } else { 0 }) . } . . #[inline] . fn emit_f64(&mut self, v: f64) -> EncodeResult { . let as_u64: u64 = v.to_bits(); . self.emit_u64(as_u64) . } . -- line 147 ---------------------------------------- -- line 549 ---------------------------------------- . #[inline] . pub fn advance(&mut self, bytes: usize) { . self.position += bytes; . } . . #[inline] . pub fn read_raw_bytes(&mut self, bytes: usize) -> &'a [u8] { . let start = self.position; 82 ( 0.00%) self.position += bytes; 82 ( 0.00%) &self.data[start..self.position] . } . } . . macro_rules! read_leb128 { . ($dec:expr, $fun:ident) => {{ leb128::$fun($dec.data, &mut $dec.position) }}; . } . . impl<'a> serialize::Decoder for Decoder<'a> { . #[inline] . fn read_unit(&mut self) -> () { . () . } . . #[inline] . fn read_u128(&mut self) -> u128 { 1,315 ( 0.00%) read_leb128!(self, read_u128_leb128) . } . . #[inline] . fn read_u64(&mut self) -> u64 { 9,403 ( 0.00%) read_leb128!(self, read_u64_leb128) . } . . #[inline] 156,094 ( 0.01%) fn read_u32(&mut self) -> u32 { 587,422 ( 0.03%) read_leb128!(self, read_u32_leb128) 312,188 ( 0.02%) } . . #[inline] . fn read_u16(&mut self) -> u16 { 622,531 ( 0.03%) let bytes = [self.data[self.position], self.data[self.position + 1]]; 88,933 ( 0.00%) let value = u16::from_le_bytes(bytes); 178,580 ( 0.01%) self.position += 2; . value . } . . #[inline] . fn read_u8(&mut self) -> u8 { 4,809,682 ( 0.24%) let value = self.data[self.position]; 970,310 ( 0.05%) self.position += 1; . value . } . . #[inline] 658,118 ( 0.03%) fn read_usize(&mut self) -> usize { 658,350 ( 0.03%) read_leb128!(self, read_usize_leb128) 1,316,236 ( 0.06%) } . . #[inline] . fn read_i128(&mut self) -> i128 { . read_leb128!(self, read_i128_leb128) . } . . #[inline] . fn read_i64(&mut self) -> i64 { -- line 613 ---------------------------------------- -- line 637 ---------------------------------------- . #[inline] . fn read_isize(&mut self) -> isize { . read_leb128!(self, read_isize_leb128) . } . . #[inline] . fn read_bool(&mut self) -> bool { . let value = self.read_u8(); 56,294 ( 0.00%) value != 0 . } . . #[inline] . fn read_f64(&mut self) -> f64 { . let bits = self.read_u64(); . f64::from_bits(bits) . } . -- line 653 ---------------------------------------- -- line 660 ---------------------------------------- . #[inline] . fn read_char(&mut self) -> char { . let bits = self.read_u32(); . std::char::from_u32(bits).unwrap() . } . . #[inline] . fn read_str(&mut self) -> Cow<'_, str> { 102,973 ( 0.01%) let len = self.read_usize(); 608,512 ( 0.03%) let sentinel = self.data[self.position + len]; 152,302 ( 0.01%) assert!(sentinel == STR_SENTINEL); . let s = unsafe { . std::str::from_utf8_unchecked(&self.data[self.position..self.position + len]) . }; 380,755 ( 0.02%) self.position += len + 1; 81,147 ( 0.00%) Cow::Borrowed(s) . } . . #[inline] . fn read_raw_bytes_into(&mut self, s: &mut [u8]) { 418 ( 0.00%) let start = self.position; 6,355 ( 0.00%) self.position += s.len(); 418 ( 0.00%) s.copy_from_slice(&self.data[start..self.position]); . } . } . . // Specializations for contiguous byte sequences follow. The default implementations for slices . // encode and decode each element individually. This isn't necessary for `u8` slices when using . // opaque encoders and decoders, because each `u8` is unchanged by encoding and decoding. . // Therefore, we can use more efficient implementations that process the entire sequence at once. . -- line 690 ---------------------------------------- 1,714,569 ( 0.08%) -------------------------------------------------------------------------------- -- 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> { 667 ( 0.00%) pub ty: Ty<'tcx>, 3,335 ( 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 { 27,712 ( 0.00%) pub scope: DefId, 44,949 ( 0.00%) pub bound_region: BoundRegionKind, . } . 274,930 ( 0.01%) #[derive(Clone, PartialEq, PartialOrd, Eq, Ord, Hash, TyEncodable, TyDecodable, Copy)] . #[derive(HashStable)] . pub enum BoundRegionKind { . /// An anonymous region parameter for a given fn (&T) 16,182 ( 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. 698 ( 0.00%) BrNamed(DefId, Symbol), . . /// Anonymous region for the implicit env pointer parameter . /// to a closure . BrEnv, . } . 1,321 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, Hash, TyEncodable, TyDecodable, Debug, PartialOrd, Ord)] . #[derive(HashStable)] . pub struct BoundRegion { 55,344 ( 0.00%) pub var: BoundVar, 42,212 ( 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. 8,453,576 ( 0.42%) #[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. 1,258,331 ( 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]`. 14,845 ( 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`. 801,551 ( 0.04%) 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`. 111,440 ( 0.01%) 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`. 8,504 ( 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. 2,636 ( 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. 36 ( 0.00%) pub fn new( . tcx: TyCtxt<'tcx>, . parts: ClosureSubstsParts<'tcx, Ty<'tcx>>, . ) -> ClosureSubsts<'tcx> { . ClosureSubsts { . substs: tcx.mk_substs( 72 ( 0.00%) parts.parent_substs.iter().copied().chain( 144 ( 0.00%) [parts.closure_kind_ty, parts.closure_sig_as_fn_ptr_ty, parts.tupled_upvars_ty] . .iter() . .map(|&ty| ty.into()), . ), . ), . } 72 ( 0.00%) } . . /// Divides the closure substs into their respective components. . /// The ordering assumed here must match that used by `ClosureSubsts::new` above. 482 ( 0.00%) fn split(self) -> ClosureSubstsParts<'tcx, GenericArg<'tcx>> { . match self.substs[..] { 4,282 ( 0.00%) [ 1,174 ( 0.00%) ref parent_substs @ .., 1,154 ( 0.00%) closure_kind_ty, 641 ( 0.00%) closure_sig_as_fn_ptr_ty, 832 ( 0.00%) tupled_upvars_ty, 1,928 ( 0.00%) ] => ClosureSubstsParts { . parent_substs, . closure_kind_ty, . closure_sig_as_fn_ptr_ty, . tupled_upvars_ty, . }, . _ => bug!("closure substs missing synthetics"), . } 1,446 ( 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. 4 ( 0.00%) pub fn is_valid(self) -> bool { 8 ( 0.00%) self.substs.len() >= 3 8 ( 0.00%) && matches!(self.split().tupled_upvars_ty.expect_ty().kind(), Tuple(_)) 8 ( 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] 54 ( 0.00%) pub fn upvar_tys(self) -> impl Iterator> + 'tcx { 171 ( 0.00%) match self.tupled_upvars_ty().kind() { . TyKind::Error(_) => None, 118 ( 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() 36 ( 0.00%) } . . /// Returns the tuple type representing the upvars for this closure. . #[inline] . pub fn tupled_upvars_ty(self) -> Ty<'tcx> { 2,149 ( 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)`. 246 ( 0.00%) pub fn kind_ty(self) -> Ty<'tcx> { . self.split().closure_kind_ty.expect_ty() 492 ( 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()`. 8 ( 0.00%) pub fn kind(self) -> ty::ClosureKind { 8 ( 0.00%) self.kind_ty().to_opt_closure_kind().unwrap() 16 ( 0.00%) } . . /// Extracts the signature from the closure. 295 ( 0.00%) pub fn sig(self) -> ty::PolyFnSig<'tcx> { . let ty = self.sig_as_fn_ptr_ty(); 590 ( 0.00%) match ty.kind() { 1,180 ( 0.00%) ty::FnPtr(sig) => *sig, . _ => bug!("closure_sig_as_fn_ptr_ty is not a fn-ptr: {:?}", ty.kind()), . } 885 ( 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. 9 ( 0.00%) pub fn new( . tcx: TyCtxt<'tcx>, . parts: GeneratorSubstsParts<'tcx, Ty<'tcx>>, . ) -> GeneratorSubsts<'tcx> { . GeneratorSubsts { . substs: tcx.mk_substs( 18 ( 0.00%) parts.parent_substs.iter().copied().chain( 27 ( 0.00%) [ 9 ( 0.00%) parts.resume_ty, . parts.yield_ty, 9 ( 0.00%) parts.return_ty, . parts.witness, 9 ( 0.00%) parts.tupled_upvars_ty, . ] . .iter() . .map(|&ty| ty.into()), . ), . ), . } 18 ( 0.00%) } . . /// Divides the generator substs into their respective components. . /// The ordering assumed here must match that used by `GeneratorSubsts::new` above. 371 ( 0.00%) fn split(self) -> GeneratorSubstsParts<'tcx, GenericArg<'tcx>> { . match self.substs[..] { 5,020 ( 0.00%) [ref parent_substs @ .., resume_ty, yield_ty, return_ty, witness, tupled_upvars_ty] => { 1,855 ( 0.00%) GeneratorSubstsParts { . parent_substs, . resume_ty, . yield_ty, . return_ty, . witness, . tupled_upvars_ty, . } . } . _ => bug!("generator substs missing synthetics"), . } 1,113 ( 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. 9 ( 0.00%) pub fn is_valid(self) -> bool { 18 ( 0.00%) self.substs.len() >= 5 18 ( 0.00%) && matches!(self.split().tupled_upvars_ty.expect_ty().kind(), Tuple(_)) 18 ( 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. 62 ( 0.00%) pub fn witness(self) -> Ty<'tcx> { . self.split().witness.expect_ty() 124 ( 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] 294 ( 0.00%) pub fn upvar_tys(self) -> impl Iterator> + 'tcx { 372 ( 0.00%) match self.tupled_upvars_ty().kind() { . TyKind::Error(_) => None, 248 ( 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() 196 ( 0.00%) } . . /// Returns the tuple type representing the upvars for this generator. . #[inline] . pub fn tupled_upvars_ty(self) -> Ty<'tcx> { 1,425 ( 0.00%) self.split().tupled_upvars_ty.expect_ty() . } . . /// Returns the type representing the resume type of the generator. 24 ( 0.00%) pub fn resume_ty(self) -> Ty<'tcx> { . self.split().resume_ty.expect_ty() 48 ( 0.00%) } . . /// Returns the type representing the yield type of the generator. 15 ( 0.00%) pub fn yield_ty(self) -> Ty<'tcx> { . self.split().yield_ty.expect_ty() 30 ( 0.00%) } . . /// Returns the type representing the return type of the generator. 15 ( 0.00%) pub fn return_ty(self) -> Ty<'tcx> { . self.split().return_ty.expect_ty() 30 ( 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. 416 ( 0.00%) pub fn poly_sig(self) -> PolyGenSig<'tcx> { 104 ( 0.00%) ty::Binder::dummy(self.sig()) 416 ( 0.00%) } . . /// Returns the "generator signature", which consists of its resume, yield . /// and return types. 113 ( 0.00%) pub fn sig(self) -> GenSig<'tcx> { 339 ( 0.00%) ty::GenSig { . resume_ty: self.resume_ty(), . yield_ty: self.yield_ty(), . return_ty: self.return_ty(), . } 339 ( 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> { 36 ( 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] 342 ( 0.00%) pub fn prefix_tys(self) -> impl Iterator> { . self.upvar_tys() 228 ( 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 { 124 ( 0.00%) let tupled_tys = match self { 124 ( 0.00%) UpvarSubsts::Closure(substs) => substs.as_closure().tupled_upvars_ty(), 45 ( 0.00%) UpvarSubsts::Generator(substs) => substs.as_generator().tupled_upvars_ty(), . }; . 276 ( 0.00%) match tupled_tys.kind() { . TyKind::Error(_) => None, 231 ( 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> { 214 ( 0.00%) match self { 169 ( 0.00%) UpvarSubsts::Closure(substs) => substs.as_closure().tupled_upvars_ty(), 73 ( 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() . } . } . 362,338 ( 0.02%) #[derive(Debug, Copy, Clone, PartialEq, PartialOrd, Ord, Eq, Hash, TyEncodable, TyDecodable)] 192,832 ( 0.01%) #[derive(HashStable, TypeFoldable)] . pub enum ExistentialPredicate<'tcx> { . /// E.g., `Iterator`. . Trait(ExistentialTraitRef<'tcx>), . /// E.g., `Iterator::Item = T`. . Projection(ExistentialProjection<'tcx>), . /// E.g., `Send`. 13,251 ( 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. 74,105 ( 0.00%) pub fn stable_cmp(&self, tcx: TyCtxt<'tcx>, other: &Self) -> Ordering { . use self::ExistentialPredicate::*; 111,574 ( 0.01%) 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, . } 88,926 ( 0.00%) } . } . . impl<'tcx> Binder<'tcx, ExistentialPredicate<'tcx>> { 10,521 ( 0.00%) pub fn with_self_ty(&self, tcx: TyCtxt<'tcx>, self_ty: Ty<'tcx>) -> ty::Predicate<'tcx> { . use crate::ty::ToPredicate; 8,253 ( 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) => { 18 ( 0.00%) self.rebind(p.with_self_ty(tcx, self_ty)).to_predicate(tcx) . } . ExistentialPredicate::AutoTrait(did) => { 1,752 ( 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) . } . } 9,352 ( 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. 188 ( 0.00%) pub fn principal(&self) -> Option>> { 2,595 ( 0.00%) self[0] 2,031 ( 0.00%) .map_bound(|this| match this { . ExistentialPredicate::Trait(tr) => Some(tr), . _ => None, 752 ( 0.00%) }) . .transpose() 564 ( 0.00%) } . 575 ( 0.00%) pub fn principal_def_id(&self) -> Option { . self.principal().map(|trait_ref| trait_ref.skip_binder().def_id) 1,150 ( 0.00%) } . . #[inline] . pub fn projection_bounds<'a>( . &'a self, . ) -> impl Iterator>> + 'a { . self.iter().filter_map(|predicate| { 417 ( 0.00%) predicate 644 ( 0.00%) .map_bound(|pred| match pred { 100 ( 0.00%) ExistentialPredicate::Projection(projection) => Some(projection), . _ => None, . }) . .transpose() . }) . } . . #[inline] . pub fn auto_traits<'a>(&'a self) -> impl Iterator + 'a { 93 ( 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. 37,963 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)] 851,604 ( 0.04%) #[derive(HashStable, TypeFoldable)] . pub struct TraitRef<'tcx> { 6,959 ( 0.00%) pub def_id: DefId, 647,922 ( 0.03%) pub substs: SubstsRef<'tcx>, . } . . impl<'tcx> TraitRef<'tcx> { 1,428 ( 0.00%) pub fn new(def_id: DefId, substs: SubstsRef<'tcx>) -> TraitRef<'tcx> { . TraitRef { def_id, substs } 5,712 ( 0.00%) } . . /// Returns a `TraitRef` of the form `P0: Foo` where `Pi` . /// are the parameters defined on trait. 2,826 ( 0.00%) pub fn identity(tcx: TyCtxt<'tcx>, def_id: DefId) -> Binder<'tcx, TraitRef<'tcx>> { 1,256 ( 0.00%) ty::Binder::dummy(TraitRef { . def_id, 1,884 ( 0.00%) substs: InternalSubsts::identity_for_item(tcx, def_id), . }) 2,512 ( 0.00%) } . . #[inline] . pub fn self_ty(&self) -> Ty<'tcx> { . self.substs.type_at(0) . } . 1,296 ( 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); . 162 ( 0.00%) ty::TraitRef { def_id: trait_id, substs: tcx.intern_substs(&substs[..defs.params.len()]) } 1,782 ( 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 { 6,462 ( 0.00%) self.skip_binder().def_id 2,154 ( 0.00%) } . 2,245 ( 0.00%) pub fn to_poly_trait_predicate(&self) -> ty::PolyTraitPredicate<'tcx> { 4,490 ( 0.00%) self.map_bound(|trait_ref| ty::TraitPredicate { . trait_ref, . constness: ty::BoundConstness::NotConst, . polarity: ty::ImplPolarity::Positive, . }) 2,245 ( 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). 240 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)] 44,693 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub struct ExistentialTraitRef<'tcx> { 6,418 ( 0.00%) pub def_id: DefId, 54,778 ( 0.00%) pub substs: SubstsRef<'tcx>, . } . . impl<'tcx> ExistentialTraitRef<'tcx> { 756 ( 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..]), . } 756 ( 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. 170 ( 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()); . 85 ( 0.00%) ty::TraitRef { def_id: self.def_id, substs: tcx.mk_substs_trait(self_ty, self.substs) } 425 ( 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. 189 ( 0.00%) pub fn with_self_ty(&self, tcx: TyCtxt<'tcx>, self_ty: Ty<'tcx>) -> ty::PolyTraitRef<'tcx> { 189 ( 0.00%) self.map_bound(|trait_ref| trait_ref.with_self_ty(tcx, self_ty)) 252 ( 0.00%) } . } . 34,310 ( 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. 296,587 ( 0.01%) #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)] 509,562 ( 0.03%) 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. 24,421 ( 0.00%) pub fn dummy(value: T) -> Binder<'tcx, T> { 91,499 ( 0.00%) assert!(!value.has_escaping_bound_vars()); 212,078 ( 0.01%) Binder(value, ty::List::empty()) 24,256 ( 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); . } 25,360 ( 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 { 1,200,750 ( 0.06%) self.0 . } . . pub fn bound_vars(&self) -> &'tcx List { 2,421 ( 0.00%) self.1 . } . . pub fn as_ref(&self) -> Binder<'tcx, &T> { 6,322 ( 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,440 ( 0.00%) pub fn map_bound>(self, f: F) -> Binder<'tcx, U> . where . F: FnOnce(T) -> U, . { 72,764 ( 0.00%) let value = f(self.0); . if cfg!(debug_assertions) { . let mut validator = ValidateBoundVars::new(self.1); . value.visit_with(&mut validator); . } 238,579 ( 0.01%) Binder(value, self.1) 1,512 ( 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); . } 14,511 ( 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); . } 18,208 ( 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>, . { 140,937 ( 0.01%) if self.0.has_escaping_bound_vars() { None } else { Some(self.skip_binder()) } 570 ( 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`. 1,227 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)] 40,573 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub struct ProjectionTy<'tcx> { . /// The parameters of the associated item. 26,720 ( 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`. 25,048 ( 0.00%) pub item_def_id: DefId, . } . . impl<'tcx> ProjectionTy<'tcx> { 16,408 ( 0.00%) pub fn trait_def_id(&self, tcx: TyCtxt<'tcx>) -> DefId { 4,688 ( 0.00%) tcx.associated_item(self.item_def_id).container.id() 18,752 ( 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 6,671 ( 0.00%) pub fn trait_ref_and_own_substs( . &self, . tcx: TyCtxt<'tcx>, . ) -> (ty::TraitRef<'tcx>, &'tcx [ty::GenericArg<'tcx>]) { 2,859 ( 0.00%) let def_id = tcx.associated_item(self.item_def_id).container.id(); . let trait_generics = tcx.generics_of(def_id); 4,765 ( 0.00%) ( . ty::TraitRef { def_id, substs: self.substs.truncate_to(tcx, trait_generics) }, . &self.substs[trait_generics.count()..], . ) 8,577 ( 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. 20,619 ( 0.00%) pub fn trait_ref(&self, tcx: TyCtxt<'tcx>) -> ty::TraitRef<'tcx> { 2,291 ( 0.00%) let def_id = self.trait_def_id(tcx); 2,291 ( 0.00%) ty::TraitRef { def_id, substs: self.substs.truncate_to(tcx, tcx.generics_of(def_id)) } 25,201 ( 0.00%) } . 4,438 ( 0.00%) pub fn self_ty(&self) -> Ty<'tcx> { 13,314 ( 0.00%) self.substs.type_at(0) 8,876 ( 0.00%) } . } . 466 ( 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. 34,660 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)] 20,462 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub struct FnSig<'tcx> { 3,098 ( 0.00%) pub inputs_and_output: &'tcx List>, 24,889 ( 0.00%) pub c_variadic: bool, 4,673 ( 0.00%) pub unsafety: hir::Unsafety, 25,040 ( 0.00%) pub abi: abi::Abi, . } . . impl<'tcx> FnSig<'tcx> { 19,775 ( 0.00%) pub fn inputs(&self) -> &'tcx [Ty<'tcx>] { 87,095 ( 0.00%) &self.inputs_and_output[..self.inputs_and_output.len() - 1] 39,550 ( 0.00%) } . 12,999 ( 0.00%) pub fn output(&self) -> Ty<'tcx> { 96,951 ( 0.00%) self.inputs_and_output[self.inputs_and_output.len() - 1] 25,998 ( 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>]> { 2,656 ( 0.00%) self.map_bound_ref_unchecked(|fn_sig| fn_sig.inputs()) . } . #[inline] . pub fn input(&self, index: usize) -> ty::Binder<'tcx, Ty<'tcx>> { 7,392 ( 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) 431 ( 0.00%) } . #[inline] . pub fn output(&self) -> ty::Binder<'tcx, Ty<'tcx>> { 5,422 ( 0.00%) self.map_bound_ref(|fn_sig| fn_sig.output()) . } . pub fn c_variadic(&self) -> bool { 860 ( 0.00%) self.skip_binder().c_variadic 430 ( 0.00%) } . pub fn unsafety(&self) -> hir::Unsafety { 3,522 ( 0.00%) self.skip_binder().unsafety 1,761 ( 0.00%) } . pub fn abi(&self) -> abi::Abi { 7,432 ( 0.00%) self.skip_binder().abi 1,858 ( 0.00%) } . } . . pub type CanonicalPolyFnSig<'tcx> = Canonical<'tcx, Binder<'tcx, FnSig<'tcx>>>; . 152 ( 0.00%) #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)] . #[derive(HashStable)] . pub struct ParamTy { 326 ( 0.00%) pub index: u32, . pub name: Symbol, . } . . impl<'tcx> ParamTy { 232 ( 0.00%) pub fn new(index: u32, name: Symbol) -> ParamTy { . ParamTy { index, name } 116 ( 0.00%) } . . pub fn for_def(def: &ty::GenericParamDef) -> ParamTy { 74 ( 0.00%) ParamTy::new(def.index, def.name) 37 ( 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 { 98 ( 0.00%) pub index: u32, 98 ( 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 2,818,504 ( 0.14%) #[derive(Clone, PartialEq, Eq, Hash, Copy, TyEncodable, TyDecodable, PartialOrd, Ord)] 184 ( 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. 83,458 ( 0.00%) ReLateBound(ty::DebruijnIndex, BoundRegion), . . /// When checking a function body, the types of all arguments and so forth . /// that refer to bound region parameters are modified to refer to free . /// region parameters. . ReFree(FreeRegion), . . /// Static data that has an "infinite" lifetime. Top in the region lattice. . ReStatic, -- line 1465 ---------------------------------------- -- line 1478 ---------------------------------------- . /// regions visible from `U`, but not less than regions not visible . /// from `U`. . ReEmpty(ty::UniverseIndex), . . /// Erased region, used by trait selection, in MIR and during codegen. . ReErased, . } . 19,080 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, Hash, TyEncodable, TyDecodable, Debug, PartialOrd, Ord)] . pub struct EarlyBoundRegion { 1,376 ( 0.00%) pub def_id: DefId, 12,538 ( 0.00%) pub index: u32, 9,639 ( 0.00%) pub name: Symbol, . } . . /// A **`const`** **v**ariable **ID**. . #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)] . pub struct ConstVid<'tcx> { 1,221 ( 0.00%) pub index: u32, 177 ( 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, 2,636 ( 0.00%) pub kind: BoundTyKind, . } . 44,884 ( 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`. 78 ( 0.00%) #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)] 7,455 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub struct ExistentialProjection<'tcx> { 2,520 ( 0.00%) pub item_def_id: DefId, 9,822 ( 0.00%) pub substs: SubstsRef<'tcx>, 2,384 ( 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. 637 ( 0.00%) pub fn trait_ref(&self, tcx: TyCtxt<'tcx>) -> ty::ExistentialTraitRef<'tcx> { 273 ( 0.00%) let def_id = tcx.associated_item(self.item_def_id).container.id(); 182 ( 0.00%) let subst_count = tcx.generics_of(def_id).count() - 1; 91 ( 0.00%) let substs = tcx.intern_substs(&self.substs[..subst_count]); . ty::ExistentialTraitRef { def_id, substs } 819 ( 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, . } . } . 90 ( 0.00%) pub fn erase_self_ty( . tcx: TyCtxt<'tcx>, . projection_predicate: ty::ProjectionPredicate<'tcx>, . ) -> Self { . // Assert there is a Self. 54 ( 0.00%) projection_predicate.projection_ty.substs.type_at(0); . 72 ( 0.00%) Self { 36 ( 0.00%) item_def_id: projection_predicate.projection_ty.item_def_id, . substs: tcx.intern_substs(&projection_predicate.projection_ty.substs[1..]), 18 ( 0.00%) term: projection_predicate.term, . } 126 ( 0.00%) } . } . . impl<'tcx> PolyExistentialProjection<'tcx> { 160 ( 0.00%) pub fn with_self_ty( . &self, . tcx: TyCtxt<'tcx>, . self_ty: Ty<'tcx>, . ) -> ty::PolyProjectionPredicate<'tcx> { 160 ( 0.00%) self.map_bound(|p| p.with_self_ty(tcx, self_ty)) 192 ( 0.00%) } . . pub fn item_def_id(&self) -> DefId { 94 ( 0.00%) self.skip_binder().item_def_id 47 ( 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 { 2,761 ( 0.00%) matches!(*self, ty::ReLateBound(..)) . } . . #[inline] . pub fn is_placeholder(&self) -> bool { 1 ( 0.00%) matches!(*self, ty::RePlaceholder(..)) . } . . #[inline] . pub fn bound_at_or_above_binder(&self, index: ty::DebruijnIndex) -> bool { 70,713 ( 0.00%) match *self { . ty::ReLateBound(debruijn, _) => debruijn >= index, . _ => false, . } . } . . pub fn type_flags(&self) -> TypeFlags { . let mut flags = TypeFlags::empty(); . 135,480 ( 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 4,970 ( 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 { 3,230 ( 0.00%) match self.kind() { 707 ( 0.00%) Tuple(ref tys) => tys.is_empty(), . _ => false, . } . } . . #[inline] . pub fn is_never(&self) -> bool { 27,551 ( 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 { 47,277 ( 0.00%) matches!(self.kind(), Infer(TyVar(_))) . } . . #[inline] . pub fn ty_vid(&self) -> Option { 32,970 ( 0.00%) match self.kind() { 4,790 ( 0.00%) &Infer(TyVar(vid)) => Some(vid), . _ => None, . } . } . . #[inline] . pub fn is_ty_infer(&self) -> bool { 135 ( 0.00%) matches!(self.kind(), Infer(_)) . } . . #[inline] . pub fn is_phantom_data(&self) -> bool { 5 ( 0.00%) if let Adt(def, _) = self.kind() { def.is_phantom_data() } else { false } . } . . #[inline] . pub fn is_bool(&self) -> bool { . *self.kind() == Bool . } . . /// Returns `true` if this type is a `str`. . #[inline] . pub fn is_str(&self) -> bool { . *self.kind() == Str . } . . #[inline] . pub fn is_param(&self, index: u32) -> bool { 117 ( 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 { 140 ( 0.00%) matches!(self.kind(), Array(..)) . } . . #[inline] . pub fn is_simd(&self) -> bool { . match self.kind() { . Adt(def, _) => def.repr.simd(), . _ => false, . } . } . 168 ( 0.00%) pub fn sequence_element_type(&self, tcx: TyCtxt<'tcx>) -> Ty<'tcx> { 336 ( 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), . } 168 ( 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 { 4 ( 0.00%) matches!(self.kind(), Ref(..)) . } . . #[inline] . pub fn is_mutable_ptr(&self) -> bool { . matches!( . self.kind(), . RawPtr(TypeAndMut { mutbl: hir::Mutability::Mut, .. }) . | Ref(_, _, hir::Mutability::Mut) -- line 1854 ---------------------------------------- -- line 1861 ---------------------------------------- . match self.kind() { . Ref(_, _, mutability) => Some(*mutability), . _ => None, . } . } . . #[inline] . pub fn is_unsafe_ptr(&self) -> bool { 1,978 ( 0.00%) matches!(self.kind(), RawPtr(_)) . } . . /// Tests if this is any kind of primitive pointer type (reference, raw pointer, fn pointer). . #[inline] . pub fn is_any_ptr(&self) -> bool { . self.is_region_ptr() || self.is_unsafe_ptr() || self.is_fn_ptr() . } . . #[inline] . pub fn is_box(&self) -> bool { 36,446 ( 0.00%) match self.kind() { 10,062 ( 0.00%) Adt(def, _) => def.is_box(), . _ => false, . } . } . . /// Panics if called on any type other than `Box`. 642 ( 0.00%) pub fn boxed_ty(&self) -> Ty<'tcx> { 642 ( 0.00%) match self.kind() { 1,605 ( 0.00%) Adt(def, substs) if def.is_box() => substs.type_at(0), . _ => bug!("`boxed_ty` is called on non-box type {:?}", self), . } 642 ( 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 { 308 ( 0.00%) matches!( 701 ( 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 { 2 ( 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 { 294 ( 0.00%) matches!(self.kind(), Adt(adt_def, _) if adt_def.is_enum()) . } . . #[inline] . pub fn is_union(&self) -> bool { 6,740 ( 0.00%) matches!(self.kind(), Adt(adt_def, _) if adt_def.is_union()) . } . . #[inline] . pub fn is_closure(&self) -> bool { 1,542 ( 0.00%) matches!(self.kind(), Closure(..)) . } . . #[inline] . pub fn is_generator(&self) -> bool { 2,320 ( 0.00%) matches!(self.kind(), Generator(..)) . } . . #[inline] . pub fn is_integral(&self) -> bool { 3,000 ( 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 { 6,156 ( 0.00%) matches!(self.kind(), Infer(FreshTy(_) | FreshIntTy(_) | FreshFloatTy(_))) . } . . #[inline] . pub fn is_char(&self) -> bool { . matches!(self.kind(), Char) . } . . #[inline] -- line 1963 ---------------------------------------- -- line 1967 ---------------------------------------- . . #[inline] . pub fn is_signed(&self) -> bool { . matches!(self.kind(), Int(_)) . } . . #[inline] . pub fn is_ptr_sized_integral(&self) -> bool { 165 ( 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. 6,431 ( 0.00%) pub fn builtin_deref(&self, explicit: bool) -> Option> { 41,189 ( 0.00%) match self.kind() { 1,680 ( 0.00%) Adt(def, _) if def.is_box() => { 850 ( 0.00%) Some(TypeAndMut { ty: self.boxed_ty(), mutbl: hir::Mutability::Not }) . } 23,192 ( 0.00%) Ref(_, ty, mutbl) => Some(TypeAndMut { ty, mutbl: *mutbl }), 8 ( 0.00%) RawPtr(mt) if explicit => Some(*mt), . _ => None, . } 12,862 ( 0.00%) } . . /// Returns the type of `ty[i]`. . pub fn builtin_index(&self) -> Option> { 41 ( 0.00%) match self.kind() { . Array(ty, _) | Slice(ty) => Some(ty), . _ => None, . } 8 ( 0.00%) } . 42,488 ( 0.00%) pub fn fn_sig(&self, tcx: TyCtxt<'tcx>) -> PolyFnSig<'tcx> { 21,244 ( 0.00%) match self.kind() { 15,933 ( 0.00%) FnDef(def_id, substs) => tcx.fn_sig(*def_id).subst(tcx, substs), . FnPtr(f) => *f, . Error(_) => { . // ignore errors (#54954) . ty::Binder::dummy(FnSig::fake()) . } . Closure(..) => bug!( . "to get the signature of a closure, use `substs.as_closure().sig()` not `fn_sig()`", . ), . _ => bug!("Ty::fn_sig() called on non-fn type: {:?}", self), . } 47,799 ( 0.00%) } . . #[inline] . pub fn is_fn(&self) -> bool { 693 ( 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 { 6 ( 0.00%) matches!(self.kind(), Opaque(..)) . } . . #[inline] . pub fn ty_adt_def(&self) -> Option<&'tcx AdtDef> { 3,923 ( 0.00%) match self.kind() { . Adt(adt, _) => Some(adt), . _ => None, . } . } . . /// Iterates over tuple fields. . /// Panics when called on anything but a tuple. 255 ( 0.00%) pub fn tuple_fields(&self) -> impl DoubleEndedIterator> { 1,304 ( 0.00%) match self.kind() { 1,235 ( 0.00%) Tuple(substs) => substs.iter().map(|field| field.expect_ty()), . _ => bug!("tuple_fields called on non-tuple"), . } 510 ( 0.00%) } . . /// Get the `i`-th element of a tuple. . /// Panics when called on anything but a tuple. 46 ( 0.00%) pub fn tuple_element_ty(&self, i: usize) -> Option> { 92 ( 0.00%) match self.kind() { 92 ( 0.00%) Tuple(substs) => substs.iter().nth(i).map(|field| field.expect_ty()), . _ => bug!("tuple_fields called on non-tuple"), . } 92 ( 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] 200 ( 0.00%) pub fn discriminant_for_variant( . &self, . tcx: TyCtxt<'tcx>, . variant_index: VariantIdx, . ) -> Option> { 540 ( 0.00%) match self.kind() { 216 ( 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 . } 108 ( 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, . } 160 ( 0.00%) } . . /// Returns the type of the discriminant of this type. 5,580 ( 0.00%) pub fn discriminant_ty(&'tcx self, tcx: TyCtxt<'tcx>) -> Ty<'tcx> { 2,790 ( 0.00%) match self.kind() { 4,320 ( 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 2127 ---------------------------------------- . | ty::FnDef(..) . | ty::FnPtr(..) . | ty::Dynamic(..) . | ty::Closure(..) . | ty::GeneratorWitness(..) . | ty::Never . | ty::Tuple(_) . | ty::Error(_) 12 ( 0.00%) | 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) . } . } 4,464 ( 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. 650 ( 0.00%) pub fn to_opt_closure_kind(&self) -> Option { 1,300 ( 0.00%) match self.kind() { 1,292 ( 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), . } 650 ( 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`. 116,730 ( 0.01%) pub fn is_trivially_sized(&self, tcx: TyCtxt<'tcx>) -> bool { 77,820 ( 0.00%) match self.kind() { . ty::Infer(ty::IntVar(_) | ty::FloatVar(_)) . | ty::Uint(_) . | ty::Int(_) . | ty::Bool . | ty::Float(_) . | ty::FnDef(..) . | ty::FnPtr(_) . | ty::RawPtr(..) -- line 2246 ---------------------------------------- -- line 2250 ---------------------------------------- . | ty::GeneratorWitness(..) . | ty::Array(..) . | ty::Closure(..) . | ty::Never . | ty::Error(_) => true, . . ty::Str | ty::Slice(_) | ty::Dynamic(..) | ty::Foreign(..) => false, . 1,369 ( 0.00%) ty::Tuple(tys) => tys.iter().all(|ty| ty.expect_ty().is_trivially_sized(tcx)), . 12,525 ( 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) . } . } 116,730 ( 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. 38,412 ( 0.00%) pub fn xform(self, other: VarianceDiagInfo<'tcx>) -> VarianceDiagInfo<'tcx> { . // For now, just use the first `VarianceDiagInfo::Invariant` that we see 57,618 ( 0.00%) match self { . VarianceDiagInfo::None => other, . VarianceDiagInfo::Invariant { .. } => self, . } 19,206 ( 0.00%) } . } 11,393,508 ( 0.56%) -------------------------------------------------------------------------------- -- 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 { 656 ( 0.00%) fn clone(&self) -> Self { 20,227 ( 0.00%) HashMap { . hash_builder: self.hash_builder.clone(), 4,070 ( 0.00%) table: self.table.clone(), . } 738 ( 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, . { 102,075 ( 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, . { 339,577 ( 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, . { 396,949 ( 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)] 4 ( 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) 8 ( 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 { 208,983 ( 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 { 274 ( 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 { 16,288 ( 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 { 87,641 ( 0.00%) self.len() == 0 . } . . /// Clears the map, returning all key-value pairs as an iterator. Keeps the . /// allocated memory for reuse. . /// . /// # Examples . /// . /// ``` -- line 696 ---------------------------------------- -- line 790 ---------------------------------------- . /// use hashbrown::HashMap; . /// . /// let mut a = HashMap::new(); . /// a.insert(1, "a"); . /// a.clear(); . /// assert!(a.is_empty()); . /// ``` . #[cfg_attr(feature = "inline-more", inline)] 6 ( 0.00%) pub fn clear(&mut self) { . self.table.clear(); 6 ( 0.00%) } . . /// Creates a consuming iterator visiting all the keys in arbitrary order. . /// The map cannot be used after calling this. . /// The iterator element type is `K`. . /// . /// # Examples . /// . /// ``` -- line 808 ---------------------------------------- -- line 963 ---------------------------------------- . /// } . /// . /// assert_eq!(letters[&'s'], 2); . /// assert_eq!(letters[&'t'], 3); . /// assert_eq!(letters[&'u'], 1); . /// assert_eq!(letters.get(&'y'), None); . /// ``` . #[cfg_attr(feature = "inline-more", inline)] 4,036 ( 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)) { 650 ( 0.00%) Entry::Occupied(OccupiedEntry { . hash, . key: Some(key), . elem, . table: self, . }) . } else { 4,395 ( 0.00%) Entry::Vacant(VacantEntry { . hash, . key, . table: self, . }) . } 5,045 ( 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. 707,162 ( 0.03%) 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, . { 953,068 ( 0.05%) if self.table.is_empty() { . None . } else { 2 ( 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)] 356,608 ( 0.02%) pub fn contains_key(&self, k: &Q) -> bool . where . K: Borrow, . Q: Hash + Eq, . { . self.get_inner(k).is_some() 450,624 ( 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)] 649 ( 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. 3,183 ( 0.00%) match self.get_inner_mut(k) { . Some(&mut (_, ref mut v)) => Some(v), . None => None, . } 1,298 ( 0.00%) } . . #[inline] . fn get_inner_mut(&mut self, k: &Q) -> Option<&mut (K, V)> . where . K: Borrow, . Q: Hash + Eq, . { 1,070 ( 0.00%) if self.table.is_empty() { . None . } else { . let hash = make_hash::(&self.hash_builder, k); 1,648 ( 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)] 3,334,173 ( 0.16%) pub fn insert(&mut self, k: K, v: V) -> Option { . let hash = make_insert_hash::(&self.hash_builder, &k); 2,417 ( 0.00%) if let Some((_, item)) = self.table.get_mut(hash, equivalent_key(&k)) { 2 ( 0.00%) Some(mem::replace(item, v)) . } else { 1,652,590 ( 0.08%) self.table 1,617,125 ( 0.08%) .insert(hash, (k, v), make_hasher::(&self.hash_builder)); 175,688 ( 0.01%) None . } 3,104,178 ( 0.15%) } . . /// 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)] 61,538 ( 0.00%) pub fn remove(&mut self, k: &Q) -> Option . where . K: Borrow, . Q: Hash + Eq, . { . // Avoid `Option::map` because it bloats LLVM IR. 848,442 ( 0.04%) match self.remove_entry(k) { 27,286 ( 0.00%) Some((_, v)) => Some(v), 51,112 ( 0.00%) None => None, . } 140,561 ( 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); 272,379 ( 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 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, . { 2,077,804 ( 0.10%) 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)] 5,304,803 ( 0.26%) 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) 5,714,095 ( 0.28%) } . . #[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, . { 599,362 ( 0.03%) match self.map.table.find(hash, |(k, _)| is_match(k)) { 3,171,530 ( 0.16%) Some(elem) => RawEntryMut::Occupied(RawOccupiedEntryMut { . elem, . table: &mut self.map.table, . hash_builder: &self.map.hash_builder, . }), 419,718 ( 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)] 1,221,463 ( 0.06%) pub fn from_key_hashed_nocheck(self, hash: u64, k: &Q) -> Option<(&'a K, &'a V)> . where . K: Borrow, . Q: Eq, . { 1,538,757 ( 0.08%) self.from_hash(hash, equivalent(k)) 2,222,419 ( 0.11%) } . . #[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, . { 2,114,202 ( 0.10%) 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, . { 692,902 ( 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)] 1,740 ( 0.00%) fn into_iter(self) -> IntoIter { 34,959 ( 0.00%) IntoIter { 18,589 ( 0.00%) inner: self.table.into_iter(), . } 5,220 ( 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. 119,989 ( 0.01%) match self.inner.next() { . Some(x) => unsafe { . let r = x.as_ref(); 1,482 ( 0.00%) Some((&r.0, &r.1)) . }, . None => None, . } . } . #[cfg_attr(feature = "inline-more", inline)] . fn size_hint(&self) -> (usize, Option) { 188 ( 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(); 18 ( 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,038 ( 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)] 534 ( 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,068 ( 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; 275 ( 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)] 38,171 ( 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. 30,721 ( 0.00%) let iter = iter.into_iter(); 19,174 ( 0.00%) let reserve = if self.is_empty() { . iter.size_hint().0 . } else { 1,855 ( 0.00%) (iter.size_hint().0 + 1) / 2 . }; . self.reserve(reserve); . iter.for_each(move |(k, v)| { 97,468 ( 0.00%) self.insert(k, v); . }); 24,972 ( 0.00%) } . . #[inline] . #[cfg(feature = "nightly")] . fn extend_one(&mut self, (k, v): (K, V)) { . self.insert(k, v); . } . . #[inline] -- line 4588 ---------------------------------------- 2,220,495 ( 0.11%) -------------------------------------------------------------------------------- -- 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> { 312,696 ( 0.02%) ptr: NonZeroUsize, 834,171 ( 0.04%) 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; . 91,970 ( 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> { 24,102 ( 0.00%) fn pack(self) -> GenericArg<'tcx> { 24,102 ( 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) . } . }; . 136,266 ( 0.01%) GenericArg { ptr: unsafe { NonZeroUsize::new_unchecked(ptr | tag) }, marker: PhantomData } 24,102 ( 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), -- line 75 ---------------------------------------- -- line 85 ---------------------------------------- . . impl<'tcx> PartialOrd for GenericArg<'tcx> { . fn partial_cmp(&self, other: &GenericArg<'_>) -> Option { . Some(self.cmp(&other)) . } . } . . impl<'tcx> From> for GenericArg<'tcx> { 82,721 ( 0.00%) fn from(r: ty::Region<'tcx>) -> GenericArg<'tcx> { . GenericArgKind::Lifetime(r).pack() 82,721 ( 0.00%) } . } . . impl<'tcx> From> for GenericArg<'tcx> { 428,390 ( 0.02%) fn from(ty: Ty<'tcx>) -> GenericArg<'tcx> { . GenericArgKind::Type(ty).pack() 428,390 ( 0.02%) } . } . . impl<'tcx> From<&'tcx ty::Const<'tcx>> for GenericArg<'tcx> { 89 ( 0.00%) fn from(c: &'tcx ty::Const<'tcx>) -> GenericArg<'tcx> { . GenericArgKind::Const(c).pack() 89 ( 0.00%) } . } . . impl<'tcx> GenericArg<'tcx> { . #[inline] . pub fn unpack(self) -> GenericArgKind<'tcx> { . let ptr = self.ptr.get(); . unsafe { 5,666,425 ( 0.28%) match ptr & TAG_MASK { 72,650 ( 0.00%) REGION_TAG => GenericArgKind::Lifetime(&*((ptr & !TAG_MASK) as *const _)), 1,346,081 ( 0.07%) TYPE_TAG => GenericArgKind::Type(&*((ptr & !TAG_MASK) as *const _)), 323 ( 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"), . } 14,834 ( 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> { 4,671 ( 0.00%) self.unpack().encode(e) . } . } . . impl<'tcx, D: TyDecoder<'tcx>> Decodable for GenericArg<'tcx> { 120,510 ( 0.01%) fn decode(d: &mut D) -> GenericArg<'tcx> { 120,510 ( 0.01%) 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. 1,423 ( 0.00%) pub fn as_closure(&'a self) -> ClosureSubsts<'a> { . ClosureSubsts { substs: self } 1,423 ( 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. 16,600 ( 0.00%) pub fn identity_for_item(tcx: TyCtxt<'tcx>, def_id: DefId) -> SubstsRef<'tcx> { 3,280 ( 0.00%) Self::for_item(tcx, def_id, |param, _| tcx.mk_param_from_def(param)) 14,940 ( 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. 140,655 ( 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); 52,609 ( 0.00%) Self::fill_item(&mut substs, tcx, defs, &mut mk_kind); 31,464 ( 0.00%) tcx.intern_substs(&substs) 141,615 ( 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)) . }) . } . 199,778 ( 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>, . { 83,049 ( 0.00%) if let Some(def_id) = defs.parent { . let parent_defs = tcx.generics_of(def_id); 12,372 ( 0.00%) Self::fill_item(substs, tcx, parent_defs, mk_kind); . } . Self::fill_single(substs, defs, mk_kind) 158,992 ( 0.01%) } . 224 ( 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); 112,754 ( 0.01%) assert_eq!(param.index as usize, substs.len()); . substs.push(kind); . } 224 ( 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> { 252,060 ( 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. 11,648 ( 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); 3,328 ( 0.00%) tcx.mk_substs(target_substs.iter().chain(self.iter().skip(defs.params.len()))) 13,312 ( 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> { 51,464 ( 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`. 1,422,320 ( 0.07%) match self.len() { . 1 => { 253,584 ( 0.01%) let param0 = self[0].try_fold_with(folder)?; 837,696 ( 0.04%) if param0 == self[0] { Ok(self) } else { Ok(folder.tcx().intern_substs(&[param0])) } . } . 2 => { 140,069 ( 0.01%) let param0 = self[0].try_fold_with(folder)?; 315,205 ( 0.02%) let param1 = self[1].try_fold_with(folder)?; 319,779 ( 0.02%) if param0 == self[0] && param1 == self[1] { . Ok(self) . } else { 247,389 ( 0.01%) Ok(folder.tcx().intern_substs(&[param0, param1])) . } . } . 0 => Ok(self), . _ => { . let params: SmallVec<[_; 8]> = 30,288 ( 0.00%) self.iter().map(|k| k.try_fold_with(folder)).collect::>()?; 1,975 ( 0.00%) if params[..] == self[..] { . Ok(self) . } else { 4,540 ( 0.00%) Ok(folder.tcx().intern_substs(¶ms)) . } . } . } 86,920 ( 0.00%) } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { 264,277 ( 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 { 612,314 ( 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> { 91,841 ( 0.00%) self.tcx . } . . fn fold_binder>( . &mut self, . t: ty::Binder<'tcx, T>, . ) -> ty::Binder<'tcx, T> { 133,728 ( 0.01%) self.binders_passed += 1; 36,611 ( 0.00%) let t = t.super_fold_with(self); 133,728 ( 0.01%) self.binders_passed -= 1; . t . } . 131,364 ( 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()`. 43,788 ( 0.00%) match *r { 33,096 ( 0.00%) ty::ReEarlyBound(data) => { 33,096 ( 0.00%) let rk = self.substs.get(data.index as usize).map(|k| k.unpack()); . match rk { 16,548 ( 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, . } 153,258 ( 0.01%) } . 470,649 ( 0.02%) fn fold_ty(&mut self, t: Ty<'tcx>) -> Ty<'tcx> { 156,883 ( 0.01%) if !t.needs_subst() { . return t; . } . 230,730 ( 0.01%) match *t.kind() { 389,420 ( 0.02%) ty::Param(p) => self.ty_for_param(p, t), 224,886 ( 0.01%) _ => t.super_fold_with(self), . } 597,010 ( 0.03%) } . 952 ( 0.00%) fn fold_const(&mut self, c: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> { 712 ( 0.00%) if let ty::ConstKind::Param(p) = c.val { . self.const_for_param(p, c) . } else { 432 ( 0.00%) c.super_fold_with(self) . } 704 ( 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. 155,768 ( 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. 176 ( 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() . ); . 274,985 ( 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> { 39,684 ( 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)] 4,853 ( 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. 1,994 ( 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, 675 ( 0.00%) pub self_ty: Ty<'tcx>, . } 2,215,247 ( 0.11%) -------------------------------------------------------------------------------- -- 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. 553,766 ( 0.03%) let enough_space = match remaining_stack() { . Some(remaining) => remaining >= red_zone, . None => false, . }; 763,653 ( 0.04%) if enough_space { 56,258 ( 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. 509,102 ( 0.03%) pub fn remaining_stack() -> Option { . let current_ptr = current_stack_ptr(); 509,102 ( 0.03%) get_stack_limit().map(|limit| current_ptr - limit) 1,018,204 ( 0.05%) } . . psm_stack_information! ( . yes { . fn current_stack_ptr() -> usize { 509,102 ( 0.03%) 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 ---------------------------------------- 318,712 ( 0.02%) -------------------------------------------------------------------------------- -- 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| { 478 ( 0.00%) if let Some(def) = ty::WithOptConstParam::try_lookup(did, tcx) { . tcx.mir_borrowck_const_arg(def) . } else { 1,824 ( 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%) } . 4,560 ( 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())); . 5,928 ( 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(); 6,384 ( 0.00%) do_mir_borrowck(&infcx, input_body, promoted, false).0 1,824 ( 0.00%) }); . debug!("mir_borrowck done"); . 456 ( 0.00%) tcx.arena.alloc(opt_closure_req) 3,648 ( 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. 10,032 ( 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>>) { 4,560 ( 0.00%) let def = input_body.source.with_opt_param().as_local().unwrap(); . . debug!(?def); . 912 ( 0.00%) let tcx = infcx.tcx; . let param_env = tcx.param_env(def.did); 456 ( 0.00%) let id = tcx.hir().local_def_id_to_hir_id(def.did); . 912 ( 0.00%) let mut local_names = IndexVec::from_elem(None, &input_body.local_decls); . for var_debug_info in &input_body.var_debug_info { 5,151 ( 0.00%) if let VarDebugInfoContents::Place(place) = var_debug_info.value { 2,590 ( 0.00%) if let Some(local) = place.as_local() { 3,843 ( 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 . ); . } . } 3,843 ( 0.00%) local_names[local] = Some(var_debug_info.name); . } . } . } . . // Gather the upvars of a closure, if any. 1,824 ( 0.00%) let tables = tcx.typeck_opt_const_arg(def); 912 ( 0.00%) if let Some(ErrorReported) = tables.tainted_by_errors { . infcx.set_tainted_by_errors(); . } 1,824 ( 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; 28 ( 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. 912 ( 0.00%) let mut body_owned = input_body.clone(); . let mut promoted = input_promoted.clone(); . let free_regions = 1,368 ( 0.00%) nll::replace_regions_in_mir(infcx, param_env, &mut body_owned, &mut promoted); . let body = &body_owned; // no further changes . 456 ( 0.00%) let location_table_owned = LocationTable::new(body); . let location_table = &location_table_owned; . . let mut errors_buffer = Vec::new(); 1,368 ( 0.00%) let (move_data, move_errors): (MoveData<'tcx>, Vec<(Place<'tcx>, MoveError<'tcx>)>) = 3,192 ( 0.00%) match MoveData::gather_moves(&body, tcx, param_env) { 2,736 ( 0.00%) Ok(move_data) => (move_data, Vec::new()), . Err((move_data, move_errors)) => (move_data, move_errors), . }; . let promoted_errors = promoted . .iter_enumerated() 1,120 ( 0.00%) .map(|(idx, body)| (idx, MoveData::gather_moves(&body, tcx, param_env))); . 2,736 ( 0.00%) let mdpe = MoveDataParamEnv { move_data, param_env }; . 3,648 ( 0.00%) let mut flow_inits = MaybeInitializedPlaces::new(tcx, &body, &mdpe) 456 ( 0.00%) .into_engine(tcx, &body) . .pass_name("borrowck") . .iterate_to_fixpoint() . .into_results_cursor(&body); . 5,472 ( 0.00%) let locals_are_invalidated_at_exit = tcx.hir().body_owner_kind(id).is_fn_or_closure(); . let borrow_set = 4,560 ( 0.00%) Rc::new(BorrowSet::build(tcx, body, locals_are_invalidated_at_exit, &mdpe.move_data)); . 2,280 ( 0.00%) let use_polonius = return_body_with_facts || infcx.tcx.sess.opts.debugging_opts.polonius; . . // Compute non-lexical lifetimes. . let nll::NllOutput { 1,368 ( 0.00%) regioncx, 1,824 ( 0.00%) opaque_type_values, 912 ( 0.00%) polonius_input, 1,368 ( 0.00%) polonius_output, 1,824 ( 0.00%) opt_closure_req, 4,560 ( 0.00%) nll_errors, 8,208 ( 0.00%) } = nll::compute_regions( . infcx, 7,296 ( 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. 1,368 ( 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. 912 ( 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. 7,296 ( 0.00%) drop(flow_inits); . 456 ( 0.00%) let regioncx = Rc::new(regioncx); . 2,736 ( 0.00%) let flow_borrows = Borrows::new(tcx, body, ®ioncx, &borrow_set) 456 ( 0.00%) .into_engine(tcx, body) . .pass_name("borrowck") . .iterate_to_fixpoint(); 2,736 ( 0.00%) let flow_uninits = MaybeUninitializedPlaces::new(tcx, body, &mdpe) 456 ( 0.00%) .into_engine(tcx, body) . .pass_name("borrowck") . .iterate_to_fixpoint(); 2,736 ( 0.00%) let flow_ever_inits = EverInitializedPlaces::new(tcx, body, &mdpe) 456 ( 0.00%) .into_engine(tcx, body) . .pass_name("borrowck") . .iterate_to_fixpoint(); . 1,092 ( 0.00%) let movable_generator = !matches!( 2,916 ( 0.00%) tcx.hir().get(id), . Node::Expr(&hir::Expr { . kind: hir::ExprKind::Closure(.., Some(hir::Movability::Static)), . .. . }) . ); . 784 ( 0.00%) for (idx, move_data_results) in promoted_errors { . let promoted_body = &promoted[idx]; . 224 ( 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(); . 20,520 ( 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(), 1,824 ( 0.00%) errors_buffer, 456 ( 0.00%) regioncx: Rc::clone(®ioncx), . used_mut: Default::default(), . used_mut_upvars: SmallVec::new(), 456 ( 0.00%) borrow_set: Rc::clone(&borrow_set), 2,736 ( 0.00%) dominators, 1,824 ( 0.00%) upvars, 1,824 ( 0.00%) local_names, . region_names: RefCell::default(), . next_region_name: RefCell::new(1), . polonius_output, . }; . . // Compute and report region errors, if any. 1,368 ( 0.00%) mbcx.report_region_errors(nll_errors); . . let results = BorrowckResults { 2,736 ( 0.00%) ever_inits: flow_ever_inits, 3,648 ( 0.00%) uninits: flow_uninits, 5,016 ( 0.00%) borrows: flow_borrows, . }; . 2,736 ( 0.00%) mbcx.report_move_errors(move_errors); . 456 ( 0.00%) rustc_mir_dataflow::visit_results( . body, 456 ( 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() 456 ( 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 = 456 ( 0.00%) mbcx.body.mut_vars_iter().filter(|local| !mbcx.used_mut.contains(local)).collect(); 1,824 ( 0.00%) mbcx.gather_used_muts(temporary_used_locals, unused_mut_locals); . . debug!("mbcx.used_mut: {:?}", mbcx.used_mut); 1,824 ( 0.00%) let used_mut = mbcx.used_mut; 456 ( 0.00%) for local in mbcx.body.mut_vars_and_args_iter().filter(|local| !used_mut.contains(local)) { 48 ( 0.00%) let local_decl = &mbcx.body.local_decls[local]; 288 ( 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 144 ( 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. 4,104 ( 0.00%) for (_, (_, diag)) in mbcx.move_error_reported { . diag.buffer(&mut mbcx.errors_buffer); . } . 456 ( 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 { 1,824 ( 0.00%) concrete_opaque_types: opaque_type_values, 2,280 ( 0.00%) closure_requirements: opt_closure_req, 2,736 ( 0.00%) used_mut_upvars: mbcx.used_mut_upvars, . }; . 912 ( 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); . 6,384 ( 0.00%) (result, body_with_facts) 5,472 ( 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>; . 155,286 ( 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); . 86,270 ( 0.00%) match &stmt.kind { 9,690 ( 0.00%) StatementKind::Assign(box (lhs, ref rhs)) => { . self.consume_rvalue(location, (rhs, span), flow_state); . 19,380 ( 0.00%) self.mutate_place(location, (*lhs, span), Shallow(None), flow_state); . } 521 ( 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. 2,084 ( 0.00%) self.check_if_path_or_subpath_is_moved( . location, . InitializationRequiringAction::Use, 4,689 ( 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) => { 39,882 ( 0.00%) self.access_place( . location, 73,117 ( 0.00%) (Place::from(*local), span), . (Shallow(None), Write(WriteKind::StorageDeadOrDrop)), . LocalMutationIsAllowed::Yes, . flow_state, . ); . } . } 138,032 ( 0.01%) } . 53,984 ( 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); . 33,740 ( 0.00%) match term.kind { 1,564 ( 0.00%) TerminatorKind::SwitchInt { ref discr, switch_ty: _, targets: _ } => { 1,564 ( 0.00%) self.consume_operand(loc, (discr, span), flow_state); . } 4,638 ( 0.00%) TerminatorKind::Drop { place, target: _, unwind: _ } => { . debug!( . "visit_terminator_drop \ . loc: {:?} term: {:?} place: {:?} span: {:?}", . loc, term, place, span . ); . 13,914 ( 0.00%) self.access_place( . loc, 20,871 ( 0.00%) (place, span), . (AccessDepth::Drop, Write(WriteKind::StorageDeadOrDrop)), . LocalMutationIsAllowed::Yes, . flow_state, . ); . } . TerminatorKind::DropAndReplace { 60 ( 0.00%) place: drop_place, 30 ( 0.00%) value: ref new_value, . target: _, . unwind: _, . } => { 480 ( 0.00%) self.mutate_place(loc, (drop_place, span), Deep, flow_state); . self.consume_operand(loc, (new_value, span), flow_state); . } . TerminatorKind::Call { 4,914 ( 0.00%) ref func, . ref args, . ref destination, . cleanup: _, . from_hir_call: _, . fn_span: _, . } => { 13,104 ( 0.00%) self.consume_operand(loc, (func, span), flow_state); . for arg in args { 14,082 ( 0.00%) self.consume_operand(loc, (arg, span), flow_state); . } 6,546 ( 0.00%) if let Some((dest, _ /*bb*/)) = *destination { 19,584 ( 0.00%) self.mutate_place(loc, (dest, span), Deep, flow_state); . } . } 36 ( 0.00%) TerminatorKind::Assert { ref cond, expected: _, ref msg, target: _, cleanup: _ } => { 6 ( 0.00%) self.consume_operand(loc, (cond, span), flow_state); . use rustc_middle::mir::AssertKind; 15 ( 0.00%) if let AssertKind::BoundsCheck { ref len, ref index } = *msg { 10 ( 0.00%) self.consume_operand(loc, (len, span), flow_state); . self.consume_operand(loc, (index, span), flow_state); . } . } . 70 ( 0.00%) TerminatorKind::Yield { ref value, resume: _, resume_arg, drop: _ } => { 154 ( 0.00%) self.consume_operand(loc, (value, span), flow_state); 154 ( 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 . } . } 50,608 ( 0.00%) } . 47,236 ( 0.00%) fn visit_terminator_after_primary_effect( . &mut self, . flow_state: &Flows<'cx, 'tcx>, . term: &'cx Terminator<'tcx>, . loc: Location, . ) { 6,748 ( 0.00%) let span = term.source_info.span; . 26,992 ( 0.00%) match term.kind { . TerminatorKind::Yield { value: _, resume: _, resume_arg: _, drop: _ } => { 28 ( 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. 1,702 ( 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 { .. } => {} . } 53,984 ( 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. 5,453 ( 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. 336,640 ( 0.02%) 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; . 84,160 ( 0.00%) if let Activation(_, borrow_index) = rw { 786 ( 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. 21,040 ( 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; . } . 126,240 ( 0.01%) let mutability_error = self.check_access_permissions( 84,160 ( 0.00%) place_span, . rw, . is_local_mutation_allowed, . flow_state, . location, . ); . let conflict_error = 231,440 ( 0.01%) self.check_access_for_conflict(location, place_span, sd, rw, flow_state); . 63,120 ( 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); . } . 63,120 ( 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)); . } 168,320 ( 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, . ); . 21,040 ( 0.00%) let mut error_reported = false; 63,120 ( 0.00%) let tcx = self.infcx.tcx; . let body = self.body; 42,080 ( 0.00%) let borrow_set = self.borrow_set.clone(); . . // Use polonius output if it has been enabled. 42,080 ( 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()) . }; . 273,520 ( 0.01%) each_borrow_involving_path( . self, . tcx, . body, . location, 126,240 ( 0.01%) (sd, place_span.0), . &borrow_set, 126,240 ( 0.01%) borrows_in_scope, 236,694 ( 0.01%) |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.) 393 ( 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 1093 ---------------------------------------- . . (Write(WriteKind::Move), BorrowKind::Shallow) => { . // Handled by initialization checks. . Control::Continue . } . . (Read(kind), BorrowKind::Unique | BorrowKind::Mut { .. }) => { . // Reading from mere reservations of mutable-borrows is OK. 6 ( 0.00%) if !is_active(&this.dominators, borrow, location) { 9 ( 0.00%) assert!(allow_two_phase_borrow(borrow.kind)); . return Control::Continue; . } . . error_reported = true; . match kind { . ReadKind::Copy => { . this.report_use_while_mutably_borrowed(location, place_span, borrow) . .buffer(&mut this.errors_buffer); -- line 1110 ---------------------------------------- -- line 1179 ---------------------------------------- . } . } . Control::Break . } . }, . ); . . error_reported 63,120 ( 0.00%) } . 65,210 ( 0.00%) 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. 58,689 ( 0.00%) 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). 6,521 ( 0.00%) if let Some(local) = place_span.0.as_local() { 25,860 ( 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. 58,548 ( 0.00%) self.access_place( . location, 19,516 ( 0.00%) place_span, . (kind, Write(WriteKind::Mutate)), . LocalMutationIsAllowed::No, . flow_state, . ); 52,168 ( 0.00%) } . . fn consume_rvalue( . &mut self, . location: Location, . (rvalue, span): (&'cx Rvalue<'tcx>, Span), . flow_state: &Flows<'cx, 'tcx>, . ) { 29,070 ( 0.00%) match *rvalue { 6,135 ( 0.00%) Rvalue::Ref(_ /*rgn*/, bk, place) => { 23,392 ( 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); 1,148 ( 0.00%) if allow_two_phase_borrow(bk) { . (Deep, Reservation(wk)) . } else { . (Deep, Write(wk)) . } . } . }; . 42,945 ( 0.00%) self.access_place( . location, 8,180 ( 0.00%) (place, span), . access_kind, . LocalMutationIsAllowed::No, . flow_state, . ); . . let action = if bk == BorrowKind::Shallow { . InitializationRequiringAction::MatchOn . } else { . InitializationRequiringAction::Borrow . }; . 14,315 ( 0.00%) self.check_if_path_or_subpath_is_moved( . location, . action, 14,315 ( 0.00%) (place.as_ref(), span), . flow_state, . ); . } . . Rvalue::AddressOf(mutability, place) => { . let access_kind = match mutability { . Mutability::Mut => ( . Deep, -- line 1270 ---------------------------------------- -- line 1302 ---------------------------------------- . } . . Rvalue::Len(place) | Rvalue::Discriminant(place) => { . let af = match *rvalue { . Rvalue::Len(..) => Some(ArtificialField::ArrayLength), . Rvalue::Discriminant(..) => None, . _ => unreachable!(), . }; 3,776 ( 0.00%) self.access_place( . location, 944 ( 0.00%) (place, span), . (Shallow(af), Read(ReadKind::Copy)), . LocalMutationIsAllowed::No, . flow_state, . ); 1,652 ( 0.00%) self.check_if_path_or_subpath_is_moved( . location, . InitializationRequiringAction::Use, 1,652 ( 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)) => { 240 ( 0.00%) self.consume_operand(location, (operand1, span), flow_state); 168 ( 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. 1,563 ( 0.00%) match **aggregate_kind { . AggregateKind::Closure(def_id, _) | AggregateKind::Generator(def_id, _, _) => { . let BorrowCheckResult { used_mut_upvars, .. } = 180 ( 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 { . self.propagate_closure_used_mut_upvar(&operands[field.index()]); . } . } . AggregateKind::Adt(..) . | AggregateKind::Array(..) . | AggregateKind::Tuple { .. } => (), -- line 1350 ---------------------------------------- -- line 1448 ---------------------------------------- . } . _ => propagate_closure_used_mut_place(self, place), . } . } . Operand::Constant(..) => {} . } . } . 77,928 ( 0.00%) fn consume_operand( . &mut self, . location: Location, . (operand, span): (&'cx Operand<'tcx>, Span), . flow_state: &Flows<'cx, 'tcx>, . ) { 36,456 ( 0.00%) match *operand { 1,107 ( 0.00%) Operand::Copy(place) => { . // copy of place: check if this is "copy of frozen path" . // (FIXME: see check_loans.rs) 2,242 ( 0.00%) self.access_place( . location, 1,845 ( 0.00%) (place, span), . (Deep, Read(ReadKind::Copy)), . LocalMutationIsAllowed::No, . flow_state, . ); . . // Finally, check if path was already moved. 28 ( 0.00%) self.check_if_path_or_subpath_is_moved( . location, . InitializationRequiringAction::Use, 24 ( 0.00%) (place.as_ref(), span), . flow_state, . ); . } 12,456 ( 0.00%) Operand::Move(place) => { . // move of place: check if this is move of already borrowed path 32,052 ( 0.00%) self.access_place( . location, 20,760 ( 0.00%) (place, span), . (Deep, Write(WriteKind::Move)), . LocalMutationIsAllowed::Yes, . flow_state, . ); . . // Finally, check if path was already moved. 3,984 ( 0.00%) self.check_if_path_or_subpath_is_moved( . location, . InitializationRequiringAction::Use, 2,988 ( 0.00%) (place.as_ref(), span), . flow_state, . ); . } . Operand::Constant(_) => {} . } 51,952 ( 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); 25 ( 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) = 175 ( 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) . }; . 125 ( 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) }; . 300 ( 0.00%) if places_conflict::borrow_conflicts_with_place( 50 ( 0.00%) self.infcx.tcx, . &self.body, . place, . borrow.kind, 100 ( 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. 48,004 ( 0.00%) let borrow_set = self.borrow_set.clone(); 89,653 ( 0.00%) for &borrow_index in borrow_set.activations_at_location(location) { . let borrow = &borrow_set[borrow_index]; . . // only mutable borrows should be 2-phase 1,965 ( 0.00%) assert!(match borrow.kind { . BorrowKind::Shared | BorrowKind::Shallow => false, . BorrowKind::Unique | BorrowKind::Mut { .. } => true, . }); . 4,716 ( 0.00%) self.access_place( . location, 2,358 ( 0.00%) (borrow.borrowed_place, span), 3,537 ( 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: 9,852 ( 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); . } . } . 95,524 ( 0.00%) 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); 7,348 ( 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.) 58,784 ( 0.00%) } . . /// 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. . } . } . } . } . } . } . 80,553 ( 0.00%) 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>, . ) { 14,646 ( 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` . 51,261 ( 0.00%) self.check_if_full_path_is_moved(location, desired_action, place_span, flow_state); . 8,676 ( 0.00%) if let Some((place_base, ProjectionElem::Subslice { from, to, from_end: false })) = 7,323 ( 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); 29,292 ( 0.00%) if let Some(mpi) = self.move_path_for_place(place_span.0) { 21,684 ( 0.00%) let uninit_mpi = self . .move_data . .find_in_move_path_or_its_descendants(mpi, |mpi| maybe_uninits.contains(mpi)); . 10,842 ( 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. . } . } 58,584 ( 0.00%) } . . /// 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) { 95,524 ( 0.00%) 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). . 66,659 ( 0.00%) 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. 56 ( 0.00%) for (place_base, elem) in place.iter_projections().rev() { 368 ( 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 => { 175 ( 0.00%) self.check_if_full_path_is_moved( . location, InitializationRequiringAction::Use, 150 ( 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; 67 ( 0.00%) let base_ty = place_base.ty(self.body(), tcx).ty; 201 ( 0.00%) match base_ty.kind() { 402 ( 0.00%) ty::Adt(def, _) if def.has_dtor(tcx) => { . self.check_if_path_or_subpath_is_moved( . location, InitializationRequiringAction::Assignment, . (place_base, span), flow_state); . . // (base initialized; no need to . // recur further) . break; . } -- line 1877 ---------------------------------------- -- 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,721 ( 0.00%) for prefix in this.prefixes(base, PrefixSet::Shallow) { 262 ( 0.00%) let mpi = match this.move_path_for_place(prefix) { . Some(mpi) => mpi, . None => continue, . }; . 84 ( 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)); . } . } . 201 ( 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, 42,080 ( 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; . 335,286 ( 0.02%) match kind { . Reservation(WriteKind::MutableBorrow( . borrow_kind @ (BorrowKind::Unique | BorrowKind::Mut { .. }), . )) . | Write(WriteKind::MutableBorrow( . borrow_kind @ (BorrowKind::Unique | BorrowKind::Mut { .. }), . )) => { 5,740 ( 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!(), . }; 4,018 ( 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) => { 34,153 ( 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), . ) => { 26,236 ( 0.00%) if let (Err(_), true) = ( 91,826 ( 0.00%) 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 . } . } . 33,405 ( 0.00%) fn is_local_ever_initialized( . &self, . local: Local, . flow_state: &Flows<'cx, 'tcx>, . ) -> Option { 20,043 ( 0.00%) let mpi = self.move_data.rev_lookup.find_local(local); 6,681 ( 0.00%) let ii = &self.move_data.init_path_map[mpi]; 28,079 ( 0.00%) for &index in ii { 16,072 ( 0.00%) if flow_state.ever_inits.contains(index) { . return Some(index); . } . } . None 26,724 ( 0.00%) } . . /// Adds the place into the used mutable variables set 21,812 ( 0.00%) fn add_used_mut(&mut self, root_place: RootPlace<'tcx>, flow_state: &Flows<'cx, 'tcx>) { . match root_place { 16,359 ( 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. 10,492 ( 0.00%) if is_local_mutation_allowed != LocalMutationIsAllowed::Yes 15,117 ( 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, -- line 2133 ---------------------------------------- -- line 2140 ---------------------------------------- . if let Some(field) = self.is_upvar_field_projection(PlaceRef { . local: place_local, . projection: place_projection, . }) { . self.used_mut_upvars.push(field); . } . } . } 20,416 ( 0.00%) } . . /// Whether this value can be written or borrowed mutably. . /// Returns the root place if the place passed in is a projection. 215,380 ( 0.01%) 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); 60,758 ( 0.00%) match place.last_projection() { . None => { 18,571 ( 0.00%) let local = &self.body.local_decls[place.local]; 55,713 ( 0.00%) match local.mutability { 7,248 ( 0.00%) Mutability::Not => match is_local_mutation_allowed { 21,744 ( 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), . }, 29,894 ( 0.00%) Mutability::Mut => Ok(RootPlace { . place_local: place.local, . place_projection: place.projection, . is_local_mutation_allowed, . }), . } . } . Some((place_base, elem)) => { 3,027 ( 0.00%) match elem { . ProjectionElem::Deref => { 836 ( 0.00%) let base_ty = place_base.ty(self.body(), self.infcx.tcx).ty; . . // Check the kind of deref to decide 2,508 ( 0.00%) match base_ty.kind() { . ty::Ref(_, _, mutbl) => { 828 ( 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 => { 828 ( 0.00%) let mode = match self.is_upvar_field_projection(place) { . Some(field) if self.upvars[field.index()].by_ref => { . is_local_mutation_allowed . } . _ => LocalMutationIsAllowed::Yes, . }; . 2,484 ( 0.00%) self.is_mutable(place_base, mode) . } . } . } . ty::RawPtr(tnm) => { . match tnm.mutbl { . // `*const` raw pointers are not mutable . hir::Mutability::Not => Err(place), . // `*mut` raw pointers are always mutable, regardless of -- line 2211 ---------------------------------------- -- line 2213 ---------------------------------------- . 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 4 ( 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); 1,182 ( 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 . ); 85 ( 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 _ = 153 ( 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) . } . } . } . } . } 156,640 ( 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 { 9,045 ( 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 ---------------------------------------- 641,194 ( 0.03%) -------------------------------------------------------------------------------- -- 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 { 2,453,394 ( 0.12%) 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)); 190,346 ( 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::()); 36,168,262 ( 1.78%) 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" . ); . 309,134 ( 0.02%) self.stride += Group::WIDTH; 309,134 ( 0.02%) self.pos += self.stride; 255,083 ( 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. 155,574 ( 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. 326,180 ( 0.02%) 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. 75,306 ( 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 { 419,519 ( 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. 90,964 ( 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 = 301,376 ( 0.01%) size.checked_mul(buckets)?.checked_add(ctrl_align - 1)? & !(ctrl_align - 1); 417,399 ( 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 { 1,762 ( 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 { 12,207 ( 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 { 220 ( 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 { 16,421 ( 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")] 28,256 ( 0.00%) pub unsafe fn erase_no_drop(&mut self, item: &Bucket) { 28,256 ( 0.00%) let index = self.bucket_index(item); . self.table.erase(index); 56,512 ( 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. 11,560 ( 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 { 44,952 ( 0.00%) self.erase_no_drop(&item); 252 ( 0.00%) item.read() . } . . /// Finds and removes an element from the table, returning it. . #[cfg_attr(feature = "inline-more", inline)] 862,215 ( 0.04%) pub fn remove_entry(&mut self, hash: u64, eq: impl FnMut(&T) -> bool) -> Option { . // Avoid `Option::map` because it bloats LLVM IR. 860 ( 0.00%) match self.find(hash, eq) { 9,318 ( 0.00%) Some(bucket) => Some(unsafe { self.remove(bucket) }), 164,907 ( 0.01%) None => None, . } 1,207,668 ( 0.06%) } . . /// Marks all table buckets as empty without dropping their contents. . #[cfg_attr(feature = "inline-more", inline)] . pub fn clear_no_drop(&mut self) { . self.table.clear_no_drop(); . } . . /// Removes all elements from the table without freeing the backing memory. . #[cfg_attr(feature = "inline-more", inline)] . pub fn clear(&mut self) { . // Ensure that the table is reset even if one of the drops panic . let mut self_ = guard(self, |self_| self_.clear_no_drop()); . unsafe { 1 ( 0.00%) self_.drop_elements(); . } . } . 7 ( 0.00%) unsafe fn drop_elements(&mut self) { 16,984 ( 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) { 491,598 ( 0.02%) if additional > self.table.growth_left { . // Avoid `Result::unwrap_or_else` because it bloats LLVM IR. 266,852 ( 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)] 617,873 ( 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 . }, . ) . } 423,392 ( 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)] 3,226,084 ( 0.16%) 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. 7,549 ( 0.00%) let old_ctrl = *self.table.ctrl(index); 2,238,253 ( 0.11%) 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 . } 2,381,938 ( 0.12%) } . . /// 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)] 987,856 ( 0.05%) pub fn insert_entry(&mut self, hash: u64, value: T, hasher: impl Fn(&T) -> u64) -> &mut T { 1,567 ( 0.00%) unsafe { self.insert(hash, value, hasher).as_mut() } 740,892 ( 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"))] 4,926 ( 0.00%) pub unsafe fn insert_no_grow(&mut self, hash: u64, value: T) -> Bucket { 530,216 ( 0.03%) let (index, old_ctrl) = self.table.prepare_insert_slot(hash); 19,404 ( 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. 1,124,736 ( 0.06%) self.table.growth_left -= special_is_empty(old_ctrl) as usize; . . bucket.write(value); 890,834 ( 0.04%) self.table.items += 1; . bucket 9,823 ( 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] 4,819 ( 0.00%) pub fn find(&self, hash: u64, mut eq: impl FnMut(&T) -> bool) -> Option> { 4,723 ( 0.00%) let result = self.table.find_inner(hash, &mut |index| unsafe { 52,470 ( 0.00%) eq(self.bucket(index).as_ref()) 1,397 ( 0.00%) }); . . // Avoid `Option::map` because it bloats LLVM IR. . match result { 417 ( 0.00%) Some(index) => Some(unsafe { self.bucket(index) }), . None => None, . } 5,390 ( 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. 23,915 ( 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] 2,187 ( 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. 3,147 ( 0.00%) match self.find(hash, eq) { . Some(bucket) => Some(unsafe { bucket.as_mut() }), . None => None, . } 2,916 ( 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 { 969,057 ( 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 { 7 ( 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()), 132,587 ( 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(); 8,520 ( 0.00%) let allocation = self.into_allocation(); 6,390 ( 0.00%) RawIntoIter { 10,650 ( 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)> { 3,870 ( 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(( 766 ( 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 { 842,731 ( 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)] 528,115 ( 0.03%) 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()); . } . 123,912 ( 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)); 294,402 ( 0.01%) Ok(Self { . ctrl, 126,898 ( 0.01%) bucket_mask: buckets - 1, . items: 0, . growth_left: bucket_mask_to_capacity(buckets - 1), . alloc, . }) 384,788 ( 0.02%) } . . #[inline] 42,799 ( 0.00%) fn fallible_with_capacity( . alloc: A, . table_layout: TableLayout, . capacity: usize, . fallibility: Fallibility, . ) -> Result { 11,008 ( 0.00%) if capacity == 0 { 10,505 ( 0.00%) Ok(Self::new_in(alloc)) . } else { . unsafe { . let buckets = . capacity_to_buckets(capacity).ok_or_else(|| fallibility.capacity_overflow())?; . 237,817 ( 0.01%) let result = Self::new_uninitialized(alloc, table_layout, buckets, fallibility)?; . result.ctrl(0).write_bytes(EMPTY, result.num_ctrl_bytes()); . 19,928 ( 0.00%) Ok(result) . } . } 42,799 ( 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] 185,443 ( 0.01%) unsafe fn prepare_insert_slot(&self, hash: u64) -> (usize, u8) { . let index = self.find_insert_slot(hash); 185,443 ( 0.01%) let old_ctrl = *self.ctrl(index); . self.set_ctrl_h2(index, hash); . (index, old_ctrl) 370,886 ( 0.02%) } . . /// Searches for an empty or deleted bucket which is suitable for inserting . /// a new element. . /// . /// There must be at least 1 empty bucket in the table. . #[inline] . fn find_insert_slot(&self, hash: u64) -> usize { . let mut probe_seq = self.probe_seq(hash); . loop { . unsafe { . let group = Group::load(self.ctrl(probe_seq.pos)); 1,587,663 ( 0.08%) if let Some(bit) = group.match_empty_or_deleted().lowest_set_bit() { 4,638,305 ( 0.23%) 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). 2,104,505 ( 0.10%) 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); . 77,660 ( 0.00%) loop { . let group = unsafe { Group::load(self.ctrl(probe_seq.pos)) }; . 4,121,281 ( 0.20%) for bit in group.match_byte(h2_hash) { 7,480,726 ( 0.37%) let index = (probe_seq.pos + bit) & self.bucket_mask; . 4,934,137 ( 0.24%) if likely(eq(index)) { . return Some(index); . } . } . 1,440,846 ( 0.07%) if likely(group.match_empty().any_bit_set()) { . return None; . } . . probe_seq.move_next(self.bucket_mask); . } . } . . #[allow(clippy::mut_mut)] -- line 1198 ---------------------------------------- -- line 1225 ---------------------------------------- . Bucket::from_base_index(self.data_end(), index) . } . . #[inline] . unsafe fn bucket_ptr(&self, index: usize, size_of: usize) -> *mut u8 { . debug_assert_ne!(self.bucket_mask, 0); . debug_assert!(index < self.buckets()); . let base: *mut u8 = self.data_end().as_ptr(); 5,941,456 ( 0.29%) 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 { 24,445,884 ( 1.20%) 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) { 2,796,625 ( 0.14%) self.growth_left -= special_is_empty(old_ctrl) as usize; . self.set_ctrl_h2(index, hash); 2,237,300 ( 0.11%) self.items += 1; . } . . #[inline] . fn is_in_same_group(&self, i: usize, new_i: usize, hash: u64) -> bool { . let probe_seq_pos = self.probe_seq(hash).pos; . let probe_index = . |pos: usize| (pos.wrapping_sub(probe_seq_pos) & self.bucket_mask) / Group::WIDTH; . probe_index(i) == probe_index(new_i) -- line 1281 ---------------------------------------- -- line 1312 ---------------------------------------- . // replicate the buckets at the end of the trailing group. For example . // with 2 buckets and a group size of 4, the control bytes will look . // like this: . // . // Real | Replicated . // --------------------------------------------- . // | [A] | [B] | [EMPTY] | [EMPTY] | [A] | [B] | . // --------------------------------------------- 4,477,059 ( 0.22%) let index2 = ((index.wrapping_sub(Group::WIDTH)) & self.bucket_mask) + Group::WIDTH; . 1,492,353 ( 0.07%) *self.ctrl(index) = ctrl; 1,493,250 ( 0.07%) *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 { 386,126 ( 0.02%) self.bucket_mask + 1 . } . . #[inline] . fn num_ctrl_bytes(&self) -> usize { 309,080 ( 0.02%) self.bucket_mask + 1 + Group::WIDTH . } . . #[inline] . fn is_empty_singleton(&self) -> bool { 1,555,381 ( 0.08%) 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. 3,888 ( 0.00%) let mut new_table = RawTableInner::fallible_with_capacity( . self.alloc.clone(), . table_layout, . capacity, . fallibility, . )?; 163,530 ( 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_| { 75,759 ( 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. 151,520 ( 0.01%) let new_items = match self.items.checked_add(additional) { . Some(new_items) => new_items, . None => return Err(fallibility.capacity_overflow()), . }; 151,518 ( 0.01%) let full_capacity = bucket_mask_to_capacity(self.bucket_mask); 319,878 ( 0.02%) if new_items <= full_capacity / 2 { . // Rehash in-place without re-allocating if we have plenty of spare . // capacity that is locked up due to DELETED entries. . self.rehash_in_place(hasher, layout.size, drop); . Ok(()) . } else { . // Otherwise, conservatively resize to at least the next size up . // to avoid churning deletes into frequent rehashes. . self.resize_inner( 75,759 ( 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> { 9,438 ( 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() { 908,214 ( 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); . 75,759 ( 0.00%) Ok(()) . } . . /// Rehashes the contents of the table in place (i.e. without changing the . /// allocation). . /// . /// If `hasher` panics then some the table's contents may be lost. . /// . /// This uses dynamic dispatch to reduce the amount of -- line 1470 ---------------------------------------- -- line 1554 ---------------------------------------- . #[inline] . unsafe fn free_buckets(&mut self, table_layout: TableLayout) { . // Avoid `Option::unwrap_or_else` because it bloats LLVM IR. . let (layout, ctrl_offset) = match table_layout.calculate_layout_for(self.buckets()) { . Some(lco) => lco, . None => hint::unreachable_unchecked(), . }; . self.alloc.deallocate( 50,613 ( 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) { 11,167 ( 0.00%) if !self.is_empty_singleton() { . unsafe { . self.ctrl(0).write_bytes(EMPTY, self.num_ctrl_bytes()); . } . } 12,976 ( 0.00%) self.items = 0; 11,167 ( 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))); 151,344 ( 0.01%) let index_before = index.wrapping_sub(Group::WIDTH) & self.bucket_mask; . let empty_before = Group::load(self.ctrl(index_before)).match_empty(); . let empty_after = Group::load(self.ctrl(index)).match_empty(); . . // If we are inside a continuous block of Group::WIDTH full or deleted . // cells then a probe window may have seen a full block when trying to . // insert. We therefore need to keep that block non-empty so that . // lookups will continue searching to the next probe window. . // . // Note that in this context `leading_zeros` refers to the bytes at the . // end of a group, while `trailing_zeros` refers to the bytes at the . // beginning of a group. 605,376 ( 0.03%) let ctrl = if empty_before.leading_zeros() + empty_after.trailing_zeros() >= Group::WIDTH { . DELETED . } else { 744,150 ( 0.04%) self.growth_left += 1; . EMPTY . }; . self.set_ctrl(index, ctrl); 605,376 ( 0.03%) self.items -= 1; . } . } . . impl Clone for RawTable { 32,568 ( 0.00%) fn clone(&self) -> Self { 4,153 ( 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) . } . } 36,639 ( 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; 88 ( 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)] 828,290 ( 0.04%) fn drop(&mut self) { 663,706 ( 0.03%) if !self.table.is_empty_singleton() { . unsafe { . self.drop_elements(); . self.free_buckets(); . } . } 889,738 ( 0.04%) } . } . #[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)] 8,520 ( 0.00%) fn into_iter(self) -> RawIntoIter { . unsafe { . let iter = self.iter(); . self.into_iter_from(iter) . } 10,650 ( 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 { 336,823 ( 0.02%) if let Some(index) = self.current_group.lowest_set_bit() { 37,961 ( 0.00%) self.current_group = self.current_group.remove_lowest_bit(); 55,365 ( 0.00%) return Some(self.data.next_n(index)); . } . 258,993 ( 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). 8,693 ( 0.00%) self.current_group = Group::load_aligned(self.next_ctrl).match_full(); 4,434 ( 0.00%) self.data = self.data.next_n(Group::WIDTH); 20,010 ( 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) { 2,789 ( 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)] 40,262 ( 0.00%) fn next(&mut self) -> Option> { 185,002 ( 0.01%) if let Some(b) = self.iter.next() { 447,217 ( 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 . } 80,524 ( 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)] 3,870 ( 0.00%) fn drop(&mut self) { . unsafe { . // Drop all remaining elements . self.iter.drop_elements(); . . // Free the table 18,329 ( 0.00%) if let Some((ptr, layout)) = self.allocation { . self.alloc.deallocate(ptr, layout); . } . } 418 ( 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,028 ( 0.00%) fn next(&mut self) -> Option { 903 ( 0.00%) unsafe { Some(self.iter.next()?.read()) } 2,056 ( 0.00%) } . . #[inline] . fn size_hint(&self) -> (usize, Option) { 18 ( 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)] 2,952 ( 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. 369 ( 0.00%) self.orig_table . .as_ptr() . .copy_from_nonoverlapping(&*self.table, 1); . } 2,952 ( 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 ---------------------------------------- 14,068,644 ( 0.69%) -------------------------------------------------------------------------------- The following files chosen for auto-annotation could not be found: -------------------------------------------------------------------------------- ./elf/../sysdeps/x86_64/dl-machine.h ./elf/dl-lookup.c ./elf/do-rel.h ./malloc/malloc.c ./string/../sysdeps/x86_64/multiarch/memcmp-avx2-movbe.S ./string/../sysdeps/x86_64/multiarch/memmove-vec-unaligned-erms.S -------------------------------------------------------------------------------- Ir -------------------------------------------------------------------------------- 687,204,825 (33.81%) events annotated