-------------------------------------------------------------------------------- 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 redis --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="acl" --cfg feature="default" --cfg feature="geospatial" --cfg feature="script" --cfg feature="sha1" --cfg feature="streams" -C metadata=510932a99435521f -C extra-filename=-510932a99435521f --out-dir /usr/home/liquid/tmp/.tmpQw849K/target/debug/deps -L dependency=/usr/home/liquid/tmp/.tmpQw849K/target/debug/deps --extern async_trait=/usr/home/liquid/tmp/.tmpQw849K/target/debug/deps/libasync_trait-f18bdeb59fc4b736.so --extern combine=/usr/home/liquid/tmp/.tmpQw849K/target/debug/deps/libcombine-2a6e86424085adb1.rmeta --extern dtoa=/usr/home/liquid/tmp/.tmpQw849K/target/debug/deps/libdtoa-6bb473cfcf9dbbdb.rmeta --extern itoa=/usr/home/liquid/tmp/.tmpQw849K/target/debug/deps/libitoa-25191d13c1ce5986.rmeta --extern percent_encoding=/usr/home/liquid/tmp/.tmpQw849K/target/debug/deps/libpercent_encoding-6dc59570925b5fc1.rmeta --extern sha1=/usr/home/liquid/tmp/.tmpQw849K/target/debug/deps/libsha1-92becd8dbfade7cc.rmeta --extern url=/usr/home/liquid/tmp/.tmpQw849K/target/debug/deps/liburl-6504b36c224af005.rmeta -Adeprecated -Aunknown-lints -Zincremental-verify-ich Data file: results/cgout-w-profiling-redis-0.21.5-Check-Full Events recorded: Ir Events shown: Ir Event sort order: Ir Thresholds: 0.1 Include dirs: User annotated: Auto-annotation: on -------------------------------------------------------------------------------- Ir -------------------------------------------------------------------------------- 8,362,577,258 (100.0%) PROGRAM TOTALS -------------------------------------------------------------------------------- Ir file:function -------------------------------------------------------------------------------- 213,972,910 ( 2.56%) ./malloc/malloc.c:_int_free 196,772,379 ( 2.35%) ./malloc/malloc.c:_int_malloc 130,112,206 ( 1.56%) ./malloc/malloc.c:malloc 104,986,091 ( 1.26%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:, (), core::hash::BuildHasherDefault>>::from_hash::>::{closure#0}> 91,589,322 ( 1.10%) ./string/../sysdeps/x86_64/multiarch/memmove-vec-unaligned-erms.S:__memcpy_avx_unaligned_erms 79,707,031 ( 0.95%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/ena-0.14.0/src/unify/mod.rs:>, &mut rustc_infer::infer::undo_log::InferCtxtUndoLogs>>>::uninlined_get_root_key 70,213,899 ( 0.84%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/mod.rs:::shallow_resolve_ty 63,783,435 ( 0.76%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/obligation_forest/mod.rs:>::process_obligations::> 62,451,193 ( 0.75%) ./malloc/malloc.c:free 56,472,335 ( 0.68%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs:::eq 54,936,280 ( 0.66%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_trait_selection/src/traits/fulfill.rs:>::process_obligations::> 48,647,553 ( 0.58%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/map.rs:, (), core::hash::BuildHasherDefault>>::from_hash::>::{closure#0}> 47,746,080 ( 0.57%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/type_variable.rs:::probe 47,363,428 ( 0.57%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs:::intern_ty 45,508,675 ( 0.54%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs:::hash:: 41,357,002 ( 0.49%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/map.rs:>, (), core::hash::BuildHasherDefault>>::from_hash::>>::{closure#0}> 38,605,070 ( 0.46%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/freshen.rs:::fold_ty 38,461,206 ( 0.46%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs:::_intern_substs 38,397,187 ( 0.46%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/mod.rs:>::process_obligations::> 37,001,426 ( 0.44%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/iter/macros.rs:::_intern_substs 35,442,399 ( 0.42%) /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}> 35,326,902 ( 0.42%) ./malloc/malloc.c:malloc_consolidate 34,218,326 ( 0.41%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:>, (), core::hash::BuildHasherDefault>>::from_hash::>>::{closure#0}> 31,817,792 ( 0.38%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/fold.rs:<&rustc_middle::ty::TyS as rustc_middle::ty::fold::TypeFoldable>::super_fold_with:: 31,069,756 ( 0.37%) /usr/home/liquid/rust/worktree-benchmarking/library/alloc/src/vec/mod.rs:>::process_obligations::> 30,339,161 ( 0.36%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/subst.rs:<&rustc_middle::ty::list::List as rustc_middle::ty::fold::TypeFoldable>::try_fold_with:: 27,919,563 ( 0.33%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/type_variable.rs:>::process_obligations::> 27,523,246 ( 0.33%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/obligation_forest/mod.rs:>::apply_rewrites 27,387,780 ( 0.33%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/intrinsics.rs:>::compress::<>::process_obligations>::{closure#0}> 26,991,232 ( 0.32%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/fold.rs:<&rustc_middle::ty::list::List as rustc_middle::ty::fold::TypeFoldable>::try_fold_with:: 25,660,719 ( 0.31%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/combine.rs:::tys 25,490,952 ( 0.30%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/cell.rs:>::process_obligations::> 24,806,391 ( 0.30%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs:, (), core::hash::BuildHasherDefault>>::from_hash::>::{closure#0}> 24,267,152 ( 0.29%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/relate.rs:rustc_middle::ty::relate::super_relate_tys:: 23,378,895 ( 0.28%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs:::reuse_or_mk_predicate 23,340,492 ( 0.28%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/num/uint_macros.rs:::short_write_process_buffer:: 21,851,380 ( 0.26%) ./malloc/malloc.c:unlink_chunk.constprop.0 21,699,481 ( 0.26%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/mod.rs:::hash:: 21,525,318 ( 0.26%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/mod.rs:::reuse_or_mk_predicate 21,490,202 ( 0.26%) ./malloc/malloc.c:realloc 21,242,460 ( 0.25%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_trait_selection/src/traits/select/mod.rs:>::process_obligations::> 21,195,612 ( 0.25%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/ena-0.14.0/src/unify/mod.rs:>::process_obligations::> 21,149,496 ( 0.25%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/fold.rs:::try_fold_with:: 20,340,402 ( 0.24%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/obligation_forest/mod.rs:>::compress::<>::process_obligations>::{closure#0}> 20,252,714 ( 0.24%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/ena-0.14.0/src/snapshot_vec.rs:>::process_obligations::> 20,079,659 ( 0.24%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_trait_selection/src/traits/fulfill.rs:::progress_changed_obligations 20,067,797 ( 0.24%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/iter/macros.rs:>::process_obligations::> 19,820,045 ( 0.24%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/ena-0.14.0/src/unify/mod.rs:::probe 19,377,215 ( 0.23%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/structural_impls.rs:<&rustc_middle::ty::TyS as rustc_middle::ty::fold::TypeFoldable>::super_fold_with:: 18,666,333 ( 0.22%) /usr/home/liquid/rust/worktree-benchmarking/library/std/src/sys/unix/alloc.rs:__rdl_alloc 17,843,744 ( 0.21%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/subst.rs:<&rustc_middle::ty::list::List as rustc_middle::ty::fold::TypeFoldable>::try_fold_with:: 17,747,034 ( 0.21%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs:::intern_predicate 16,906,456 ( 0.20%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/equate.rs:::tys 16,345,445 ( 0.20%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/mod.rs:::try_fold_with:: 16,211,456 ( 0.19%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/subst.rs:::fold_ty 16,192,970 ( 0.19%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:>>::from_key_hashed_nocheck:: 16,065,225 ( 0.19%) /usr/home/liquid/rust/worktree-benchmarking/library/alloc/src/collections/btree/search.rs:>::search_tree:: 15,656,976 ( 0.19%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/sip128.rs:::short_write_process_buffer:: 15,624,260 ( 0.19%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/obligation_forest/mod.rs:>::register_obligation_at 15,460,842 ( 0.18%) /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}> 15,250,383 ( 0.18%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/bitmask.rs:, (), core::hash::BuildHasherDefault>>::from_hash::>::{closure#0}> 15,173,197 ( 0.18%) ./malloc/malloc.c:_int_realloc 14,712,244 ( 0.18%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/ops/bit.rs:::hash:: 14,059,734 ( 0.17%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/sharded.rs:::intern_ty 13,848,640 ( 0.17%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/sso/map.rs:>>::insert 13,830,852 ( 0.17%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/caching_source_map_view.rs:::span_data_to_lines_and_cols 13,771,244 ( 0.16%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/ptr/mod.rs:core::ptr::drop_in_place:: 13,768,174 ( 0.16%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs:::hash:: 13,658,285 ( 0.16%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:>::reserve_rehash::>::{closure#0}> 13,262,800 ( 0.16%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/ena-0.14.0/src/snapshot_vec.rs:::probe 13,231,628 ( 0.16%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:>, ())>>::insert_entry::>, rustc_middle::ty::context::Interned>, (), core::hash::BuildHasherDefault>::{closure#0}> 13,206,435 ( 0.16%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:, ())>>::insert_entry::, rustc_middle::ty::context::Interned, (), core::hash::BuildHasherDefault>::{closure#0}> 13,150,909 ( 0.16%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:>::apply_rewrites 12,978,125 ( 0.16%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:, ())>>::reserve_rehash::, rustc_middle::ty::context::Interned, (), core::hash::BuildHasherDefault>::{closure#0}> 12,977,282 ( 0.16%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:, ())>>::reserve_rehash::, rustc_middle::ty::context::Interned, (), core::hash::BuildHasherDefault>::{closure#0}> 12,941,274 ( 0.15%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_trait_selection/src/traits/project.rs:::fold_ty 12,924,307 ( 0.15%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/fold.rs:<&rustc_middle::ty::list::List as rustc_middle::ty::fold::TypeFoldable>::try_fold_with:: 12,688,135 ( 0.15%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:, ())>>::insert_entry::, rustc_middle::ty::context::Interned, (), core::hash::BuildHasherDefault>::{closure#0}> 12,521,793 ( 0.15%) ./string/../sysdeps/x86_64/multiarch/memcmp-avx2-movbe.S:__memcmp_avx2_movbe 12,497,867 ( 0.15%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/iter/adapters/zip.rs:>, (), core::hash::BuildHasherDefault>>::from_hash::>>::{closure#0}> 12,397,116 ( 0.15%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs:::eq 12,384,162 ( 0.15%) /usr/home/liquid/rust/worktree-benchmarking/library/std/src/collections/hash/map.rs:::intern_ty 12,323,139 ( 0.15%) /usr/home/liquid/rust/worktree-benchmarking/library/alloc/src/vec/into_iter.rs:> as core::ops::drop::Drop>::drop 12,251,218 ( 0.15%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/num/uint_macros.rs:::_intern_substs 12,193,450 ( 0.15%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:, ())>>::insert::, rustc_infer::traits::Obligation, (), core::hash::BuildHasherDefault>::{closure#0}> 12,060,101 ( 0.14%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:>, ())>>::reserve_rehash::>, rustc_middle::ty::context::Interned>, (), core::hash::BuildHasherDefault>::{closure#0}> 12,022,316 ( 0.14%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/freshen.rs:::freshen_ty:: 11,909,903 ( 0.14%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/resolve.rs:::fold_ty 11,865,788 ( 0.14%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/subst.rs:>::from 11,664,843 ( 0.14%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/mod.rs:::attrs 11,526,215 ( 0.14%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/bitmask.rs:>, (), core::hash::BuildHasherDefault>>::from_hash::>>::{closure#0}> 11,512,885 ( 0.14%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/rustc_entry.rs:>>::rustc_entry 11,371,586 ( 0.14%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs:::candidate_from_obligation 11,102,049 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/region_constraints/mod.rs:>::search_tree:: 11,068,573 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/iter/macros.rs:>::register_obligation_at 11,009,940 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/mod.rs:::start_snapshot 10,991,075 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/mod.rs:::remap_constness 10,867,171 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_borrowck/src/lib.rs:::access_place 10,725,011 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_trait_selection/src/traits/project.rs:rustc_trait_selection::traits::project::opt_normalize_projection_type 10,568,355 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_type_ir/src/lib.rs:::hash:: 10,426,602 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/undo_log.rs:::rollback_to 10,403,678 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/mod.rs:::commit_from 10,358,803 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/subst.rs:<&rustc_middle::ty::list::List as rustc_middle::ty::fold::TypeFoldable>::try_fold_with:: 10,320,135 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/cell.rs:::intern_ty 10,305,124 ( 0.12%) ./elf/dl-lookup.c:_dl_lookup_symbol_x 10,281,667 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_parse/src/parser/mod.rs:::next 10,184,274 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/lib.rs:>::hash_stable 10,121,370 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/cell.rs:::_intern_substs 10,121,370 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/library/std/src/collections/hash/map.rs:::_intern_substs 10,083,887 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/index.rs:>::process_obligations::> 10,004,846 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_parse/src/parser/mod.rs:::bump 9,961,235 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/ptr/mod.rs:::commit_from 9,955,360 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/num/uint_macros.rs:::hash:: 9,922,014 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/walk.rs:::next 9,898,470 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/ptr/mod.rs:>::process_obligations::> 9,641,068 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/combine.rs:::instantiate 9,623,057 ( 0.12%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:, ())>>::reserve_rehash::, rustc_infer::traits::Obligation, (), core::hash::BuildHasherDefault>::{closure#0}> 9,608,030 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/flags.rs:::for_predicate 9,604,372 ( 0.11%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/smallvec-1.7.0/src/lib.rs: as core::iter::traits::collect::Extend>::extend::>, <&rustc_middle::ty::list::List as rustc_middle::ty::fold::TypeFoldable>::try_super_fold_with::{closure#0}>, !>> 9,590,656 ( 0.11%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:>::register_obligation_at 9,538,036 ( 0.11%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/map.rs:::_intern_substs 9,506,363 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/flags.rs:::add_substs 9,501,707 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/type_variable.rs:>, &mut rustc_infer::infer::undo_log::InferCtxtUndoLogs>>>::uninlined_get_root_key 9,452,184 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_trait_selection/src/traits/select/mod.rs:::select_from_obligation 9,381,433 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_parse/src/parser/mod.rs:::check 9,199,751 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/obligation_forest/mod.rs:>::find_cycles_from_node:: 9,186,292 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_trait_selection/src/traits/select/mod.rs:::select 9,174,044 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/structural_impls.rs:<&rustc_middle::ty::TyS as rustc_middle::ty::fold::TypeFoldable>::super_fold_with:: 9,048,690 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/library/alloc/src/vec/mod.rs:::probe 9,026,885 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_trait_selection/src/traits/select/mod.rs:::candidate_from_obligation 8,985,487 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/ptr/mut_ptr.rs:, (), core::hash::BuildHasherDefault>>::from_hash::>::{closure#0}> 8,969,383 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/cell.rs:::start_snapshot 8,880,232 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/num/uint_macros.rs:::hash:: 8,855,670 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/traits/project.rs:::try_start 8,787,209 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/iter/traits/iterator.rs:::candidate_from_obligation 8,691,742 ( 0.10%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:>::new_uninitialized 8,620,497 ( 0.10%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:>>::from_key_hashed_nocheck:: 8,598,201 ( 0.10%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/index.rs:>::compress::<>::process_obligations>::{closure#0}> 8,579,560 ( 0.10%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/canonical/canonicalizer.rs:::fold_ty 8,552,856 ( 0.10%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/fold.rs:<&rustc_middle::ty::TyS as rustc_middle::ty::fold::TypeFoldable>::super_fold_with:: 8,518,837 ( 0.10%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/fold.rs:::has_escaping_bound_vars 8,489,796 ( 0.10%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:, usize)>>::remove_entry::, rustc_middle::ty::ParamEnvAnd, usize>::{closure#0}> 8,413,042 ( 0.10%) /usr/home/liquid/rust/worktree-benchmarking/library/alloc/src/vec/mod.rs:>, &mut rustc_infer::infer::undo_log::InferCtxtUndoLogs>>>::uninlined_get_root_key 8,413,042 ( 0.10%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/ena-0.14.0/src/snapshot_vec.rs:>, &mut rustc_infer::infer::undo_log::InferCtxtUndoLogs>>>::uninlined_get_root_key 8,395,779 ( 0.10%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/mod.rs:::lookup_source_file_idx 8,369,786 ( 0.10%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/rustc_entry.rs:>>::rustc_entry -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/alloc/src/vec/into_iter.rs -------------------------------------------------------------------------------- Ir -- line 51 ---------------------------------------- . /// let vec = vec!['a', 'b', 'c']; . /// let mut into_iter = vec.into_iter(); . /// assert_eq!(into_iter.as_slice(), &['a', 'b', 'c']); . /// let _ = into_iter.next().unwrap(); . /// assert_eq!(into_iter.as_slice(), &['b', 'c']); . /// ``` . #[stable(feature = "vec_into_iter_as_slice", since = "1.15.0")] . pub fn as_slice(&self) -> &[T] { 57,024 ( 0.00%) unsafe { slice::from_raw_parts(self.ptr, self.len()) } . } . . /// Returns the remaining items of this iterator as a mutable slice. . /// . /// # Examples . /// . /// ``` . /// let vec = vec!['a', 'b', 'c']; -- line 67 ---------------------------------------- -- line 80 ---------------------------------------- . /// Returns a reference to the underlying allocator. . #[unstable(feature = "allocator_api", issue = "32838")] . #[inline] . pub fn allocator(&self) -> &A { . &self.alloc . } . . fn as_raw_mut_slice(&mut self) -> *mut [T] { 2,703,796 ( 0.03%) ptr::slice_from_raw_parts_mut(self.ptr as *mut T, self.len()) . } . . /// Drops remaining elements and relinquishes the backing allocation. . /// . /// This is roughly equivalent to the following, but more efficient . /// . /// ``` . /// # let mut into_iter = Vec::::with_capacity(10).into_iter(); -- line 96 ---------------------------------------- -- line 99 ---------------------------------------- . /// ``` . #[cfg(not(no_global_oom_handling))] . pub(super) fn forget_allocation_drop_remaining(&mut self) { . let remaining = self.as_raw_mut_slice(); . . // overwrite the individual fields instead of creating a new . // struct and then overwriting &mut self. . // this creates less assembly 3,152 ( 0.00%) self.cap = 0; 6,304 ( 0.00%) self.buf = unsafe { NonNull::new_unchecked(RawVec::NEW.ptr()) }; 3,907 ( 0.00%) self.ptr = self.buf.as_ptr(); 4,310 ( 0.00%) self.end = self.buf.as_ptr(); . . unsafe { . ptr::drop_in_place(remaining); . } . } . } . . #[stable(feature = "vec_intoiter_as_ref", since = "1.46.0")] -- line 118 ---------------------------------------- -- line 128 ---------------------------------------- . unsafe impl Sync for IntoIter {} . . #[stable(feature = "rust1", since = "1.0.0")] . impl Iterator for IntoIter { . type Item = T; . . #[inline] . fn next(&mut self) -> Option { 5,641,408 ( 0.07%) if self.ptr as *const _ == self.end { 259,675 ( 0.00%) None 150 ( 0.00%) } else if mem::size_of::() == 0 { . // purposefully don't use 'ptr.offset' because for . // vectors with 0-size elements this would return the . // same pointer. . self.ptr = unsafe { arith_offset(self.ptr as *const i8, 1) as *mut T }; . . // Make up a value of this ZST. . Some(unsafe { mem::zeroed() }) . } else { . let old = self.ptr; 582,629 ( 0.01%) self.ptr = unsafe { self.ptr.offset(1) }; . 201,637 ( 0.00%) Some(unsafe { ptr::read(old) }) . } . } . . #[inline] . fn size_hint(&self) -> (usize, Option) { . let exact = if mem::size_of::() == 0 { . (self.end as usize).wrapping_sub(self.ptr as usize) . } else { . unsafe { self.end.offset_from(self.ptr) as usize } . }; 3 ( 0.00%) (exact, Some(exact)) . } . . #[inline] . fn advance_by(&mut self, n: usize) -> Result<(), usize> { . let step_size = self.len().min(n); . let to_drop = ptr::slice_from_raw_parts_mut(self.ptr as *mut T, step_size); . if mem::size_of::() == 0 { . // SAFETY: due to unchecked casts of unsigned amounts to signed offsets the wraparound -- line 169 ---------------------------------------- -- line 181 ---------------------------------------- . if step_size < n { . return Err(step_size); . } . Ok(()) . } . . #[inline] . fn count(self) -> usize { 2 ( 0.00%) self.len() . } . . #[doc(hidden)] . unsafe fn __iterator_get_unchecked(&mut self, i: usize) -> Self::Item . where . Self: TrustedRandomAccessNoCoerce, . { . // SAFETY: the caller must guarantee that `i` is in bounds of the -- line 197 ---------------------------------------- -- line 207 ---------------------------------------- . } . } . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl DoubleEndedIterator for IntoIter { . #[inline] . fn next_back(&mut self) -> Option { 111,846 ( 0.00%) if self.end == self.ptr { . None . } else if mem::size_of::() == 0 { . // See above for why 'ptr.offset' isn't used . self.end = unsafe { arith_offset(self.end as *const i8, -1) as *mut T }; . . // Make up a value of this ZST. . Some(unsafe { mem::zeroed() }) . } else { 30,750 ( 0.00%) self.end = unsafe { self.end.offset(-1) }; . 2,580 ( 0.00%) Some(unsafe { ptr::read(self.end) }) . } . } . . #[inline] . fn advance_back_by(&mut self, n: usize) -> Result<(), usize> { . let step_size = self.len().min(n); . if mem::size_of::() == 0 { . // SAFETY: same as for advance_by() -- line 234 ---------------------------------------- -- line 295 ---------------------------------------- . #[cfg(test)] . fn clone(&self) -> Self { . crate::slice::to_vec(self.as_slice(), self.alloc.clone()).into_iter() . } . } . . #[stable(feature = "rust1", since = "1.0.0")] . unsafe impl<#[may_dangle] T, A: Allocator> Drop for IntoIter { 8,467,474 ( 0.10%) fn drop(&mut self) { . struct DropGuard<'a, T, A: Allocator>(&'a mut IntoIter); . . impl Drop for DropGuard<'_, T, A> { . fn drop(&mut self) { . unsafe { . // `IntoIter::alloc` is not used anymore after this . let alloc = ptr::read(&self.0.alloc); . // RawVec handles deallocation 1,470,978 ( 0.02%) let _ = RawVec::from_raw_parts_in(self.0.buf.as_ptr(), self.0.cap, alloc); . } . } . } . . let guard = DropGuard(self); . // destroy the remaining elements . unsafe { 143 ( 0.00%) ptr::drop_in_place(guard.0.as_raw_mut_slice()); . } . // now `guard` will be dropped and do the rest 7,388,089 ( 0.09%) } . } . . #[unstable(issue = "none", feature = "inplace_iteration")] . #[doc(hidden)] . unsafe impl InPlaceIterable for IntoIter {} . . #[unstable(issue = "none", feature = "inplace_iteration")] . #[doc(hidden)] -- line 331 ---------------------------------------- 1,698,072 ( 0.02%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_type_ir/src/lib.rs -------------------------------------------------------------------------------- Ir -- line 5 ---------------------------------------- . #[macro_use] . extern crate rustc_macros; . . use rustc_data_structures::stable_hasher::{HashStable, StableHasher}; . use rustc_data_structures::unify::{EqUnifyValue, UnifyKey}; . use std::fmt; . use std::mem::discriminant; . 12,535,001 ( 0.15%) bitflags! { . /// Flags that we track on types. These flags are propagated upwards . /// through the type during type construction, so that we can quickly check . /// whether the type has various kinds of types in it without recursing . /// over the type itself. . pub struct TypeFlags: u32 { . // Does this have parameters? Used to determine whether substitution is . // required. . /// Does this have `Param`? -- line 21 ---------------------------------------- -- line 163 ---------------------------------------- . /// for<'a> fn(&'a x) . /// . /// and you wanted to change it to . /// . /// for<'a> fn(for<'b> fn(&'a x)) . /// . /// you would need to shift the index for `'a` into a new binder. . #[must_use] 6,532 ( 0.00%) pub fn shifted_in(self, amount: u32) -> DebruijnIndex { 750,896 ( 0.01%) DebruijnIndex::from_u32(self.as_u32() + amount) 19,596 ( 0.00%) } . . /// Update this index in place by shifting it "in" through . /// `amount` number of binders. 368,916 ( 0.00%) pub fn shift_in(&mut self, amount: u32) { 368,916 ( 0.00%) *self = self.shifted_in(amount); 737,832 ( 0.01%) } . . /// Returns the resulting index when this value is moved out from . /// `amount` number of new binders. . #[must_use] 4,406 ( 0.00%) pub fn shifted_out(self, amount: u32) -> DebruijnIndex { 746,644 ( 0.01%) DebruijnIndex::from_u32(self.as_u32() - amount) 13,218 ( 0.00%) } . . /// Update in place by shifting out from `amount` binders. 368,916 ( 0.00%) pub fn shift_out(&mut self, amount: u32) { 737,832 ( 0.01%) *self = self.shifted_out(amount); 737,832 ( 0.01%) } . . /// Adjusts any De Bruijn indices so as to make `to_binder` the . /// innermost binder. That is, if we have something bound at `to_binder`, . /// it will now be bound at INNERMOST. This is an appropriate thing to do . /// when moving a region out from inside binders: . /// . /// ``` . /// for<'a> fn(for<'b> for<'c> fn(&'a u32), _) -- line 199 ---------------------------------------- -- line 210 ---------------------------------------- . /// If we invoke `shift_out_to_binder` and the region is in fact . /// bound by one of the binders we are shifting out of, that is an . /// error (and should fail an assertion failure). . pub fn shifted_out_to_binder(self, to_binder: DebruijnIndex) -> Self { . self.shifted_out(to_binder.as_u32() - INNERMOST.as_u32()) . } . } . 203 ( 0.00%) #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)] 1,124 ( 0.00%) #[derive(Encodable, Decodable)] . pub enum IntTy { . Isize, . I8, . I16, . I32, . I64, . I128, . } -- line 227 ---------------------------------------- -- line 244 ---------------------------------------- . IntTy::I8 => 8, . IntTy::I16 => 16, . IntTy::I32 => 32, . IntTy::I64 => 64, . IntTy::I128 => 128, . }) . } . 11 ( 0.00%) pub fn normalize(&self, target_width: u32) -> Self { 33 ( 0.00%) match self { 2 ( 0.00%) IntTy::Isize => match target_width { . 16 => IntTy::I16, . 32 => IntTy::I32, . 64 => IntTy::I64, . _ => unreachable!(), . }, . _ => *self, . } 22 ( 0.00%) } . } . 211 ( 0.00%) #[derive(Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Copy, Debug)] 1,838 ( 0.00%) #[derive(Encodable, Decodable)] . pub enum UintTy { . Usize, . U8, . U16, . U32, . U64, . U128, . } -- line 274 ---------------------------------------- -- line 291 ---------------------------------------- . UintTy::U8 => 8, . UintTy::U16 => 16, . UintTy::U32 => 32, . UintTy::U64 => 64, . UintTy::U128 => 128, . }) . } . 581 ( 0.00%) pub fn normalize(&self, target_width: u32) -> Self { 1,743 ( 0.00%) match self { 912 ( 0.00%) UintTy::Usize => match target_width { . 16 => UintTy::U16, . 32 => UintTy::U32, . 64 => UintTy::U64, . _ => unreachable!(), . }, . _ => *self, . } 1,162 ( 0.00%) } . } . 57 ( 0.00%) #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)] 416 ( 0.00%) #[derive(Encodable, Decodable)] . pub enum FloatTy { . F32, . F64, . } . . impl FloatTy { . pub fn name_str(self) -> &'static str { . match self { -- line 321 ---------------------------------------- -- line 327 ---------------------------------------- . pub fn bit_width(self) -> u64 { . match self { . FloatTy::F32 => 32, . FloatTy::F64 => 64, . } . } . } . 2 ( 0.00%) #[derive(Clone, Copy, PartialEq, Eq)] . pub enum IntVarValue { . IntType(IntTy), . UintType(UintTy), . } . . #[derive(Clone, Copy, PartialEq, Eq)] . pub struct FloatVarValue(pub FloatTy); . -- line 343 ---------------------------------------- -- line 346 ---------------------------------------- . pub struct TyVid { . DEBUG_FORMAT = "_#{}t" . } . } . . /// An **int**egral (`u32`, `i32`, `usize`, etc.) type **v**ariable **ID**. . #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Encodable, Decodable)] . pub struct IntVid { 50,330 ( 0.00%) pub index: u32, . } . . /// An **float**ing-point (`f32` or `f64`) type **v**ariable **ID**. . #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Encodable, Decodable)] . pub struct FloatVid { . pub index: u32, . } . . /// A placeholder for a type that hasn't been inferred yet. . /// . /// E.g., if we have an empty array (`[]`), then we create a fresh . /// type variable for the element type since we won't know until it's . /// used what the element type is supposed to be. 9,031,716 ( 0.11%) #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Encodable, Decodable)] . pub enum InferTy { . /// A type variable. . TyVar(TyVid), . /// An integral type variable (`{integer}`). . /// . /// These are created when the compiler sees an integer literal like . /// `1` that could be several different types (`u8`, `i32`, `u32`, etc.). . /// We don't know until it's used what type it's supposed to be, so -- line 376 ---------------------------------------- -- line 396 ---------------------------------------- . FreshFloatTy(u32), . } . . /// Raw `TyVid` are used as the unification key for `sub_relations`; . /// they carry no values. . impl UnifyKey for TyVid { . type Value = (); . fn index(&self) -> u32 { 583,012 ( 0.01%) self.as_u32() 583,012 ( 0.01%) } . fn from_index(i: u32) -> TyVid { . TyVid::from_u32(i) 319,868 ( 0.00%) } . fn tag() -> &'static str { . "TyVid" . } . } . . impl EqUnifyValue for IntVarValue {} . . impl UnifyKey for IntVid { . type Value = Option; . #[inline] // make this function eligible for inlining - it is quite hot. . fn index(&self) -> u32 { . self.index . } 18,175 ( 0.00%) fn from_index(i: u32) -> IntVid { . IntVid { index: i } 18,175 ( 0.00%) } . fn tag() -> &'static str { . "IntVid" . } . } . . impl EqUnifyValue for FloatVarValue {} . . impl UnifyKey for FloatVid { -- line 432 ---------------------------------------- -- line 437 ---------------------------------------- . fn from_index(i: u32) -> FloatVid { . FloatVid { index: i } . } . fn tag() -> &'static str { . "FloatVid" . } . } . 145,444 ( 0.00%) #[derive(Copy, Clone, PartialEq, Decodable, Encodable, Hash)] . pub enum Variance { . Covariant, // T <: T iff A <: B -- e.g., function return type . Invariant, // T <: T iff B == A -- e.g., type of mutable cell . Contravariant, // T <: T iff B <: A -- e.g., function param type . Bivariant, // T <: T -- e.g., unused type parameter . } . . impl Variance { -- line 453 ---------------------------------------- -- line 482 ---------------------------------------- . /// `Contravariant.xform(Covariant)` or `Contravariant`. The same . /// is true for its `i32` argument. In the `*mut T` case, the . /// variance of `Vec` is `Contravariant.xform(Invariant)`, . /// and hence the outermost type is `Invariant` with respect to . /// `Vec` (and its `i32` argument). . /// . /// Source: Figure 1 of "Taming the Wildcards: . /// Combining Definition- and Use-Site Variance" published in PLDI'11. 450,011 ( 0.01%) pub fn xform(self, v: Variance) -> Variance { 2,520,147 ( 0.03%) match (self, v) { . // Figure 1, column 1. . (Variance::Covariant, Variance::Covariant) => Variance::Covariant, . (Variance::Covariant, Variance::Contravariant) => Variance::Contravariant, . (Variance::Covariant, Variance::Invariant) => Variance::Invariant, . (Variance::Covariant, Variance::Bivariant) => Variance::Bivariant, . . // Figure 1, column 2. . (Variance::Contravariant, Variance::Covariant) => Variance::Contravariant, -- line 499 ---------------------------------------- -- line 502 ---------------------------------------- . (Variance::Contravariant, Variance::Bivariant) => Variance::Bivariant, . . // Figure 1, column 3. . (Variance::Invariant, _) => Variance::Invariant, . . // Figure 1, column 4. . (Variance::Bivariant, _) => Variance::Bivariant, . } 450,011 ( 0.01%) } . } . . impl HashStable for DebruijnIndex { . fn hash_stable(&self, ctx: &mut CTX, hasher: &mut StableHasher) { . self.as_u32().hash_stable(ctx, hasher); . } . } . -- line 518 ---------------------------------------- 10,280,853 ( 0.12%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs -------------------------------------------------------------------------------- Ir -- line 22 ---------------------------------------- . . use super::BuiltinImplConditions; . use super::IntercrateAmbiguityCause; . use super::OverflowError; . use super::SelectionCandidate::{self, *}; . use super::{EvaluatedCandidate, SelectionCandidateSet, SelectionContext, TraitObligationStack}; . . impl<'cx, 'tcx> SelectionContext<'cx, 'tcx> { 1,866,504 ( 0.02%) #[instrument(level = "debug", skip(self))] 2,333,130 ( 0.03%) pub(super) fn candidate_from_obligation<'o>( . &mut self, . stack: &TraitObligationStack<'o, 'tcx>, . ) -> SelectionResult<'tcx, SelectionCandidate<'tcx>> { . // Watch out for overflow. This intentionally bypasses (and does . // not update) the cache. 466,626 ( 0.01%) self.check_recursion_limit(&stack.obligation, &stack.obligation)?; . . // Check the cache. Note that we freshen the trait-ref . // separately rather than using `stack.fresh_trait_ref` -- . // this is because we want the unbound variables to be . // replaced with fresh types starting from index 0. 2,099,817 ( 0.03%) let cache_fresh_trait_pred = self.infcx.freshen(stack.obligation.predicate); . debug!(?cache_fresh_trait_pred); . debug_assert!(!stack.obligation.predicate.has_escaping_bound_vars()); . 3,503,690 ( 0.04%) if let Some(c) = 699,939 ( 0.01%) self.check_candidate_cache(stack.obligation.param_env, cache_fresh_trait_pred) . { . debug!(candidate = ?c, "CACHE HIT"); . return c; . } . . // If no match, compute result and insert into cache. . // . // FIXME(nikomatsakis) -- this cache is not taking into . // account cycles that may have occurred in forming the . // candidate. I don't know of any specific problems that . // result but it seems awfully suspicious. 96,450 ( 0.00%) let (candidate, dep_node) = 48,225 ( 0.00%) self.in_task(|this| this.candidate_from_obligation_no_cache(stack)); . . debug!(?candidate, "CACHE MISS"); . self.insert_candidate_cache( 32,150 ( 0.00%) stack.obligation.param_env, 64,300 ( 0.00%) cache_fresh_trait_pred, . dep_node, . candidate.clone(), . ); 192,900 ( 0.00%) candidate . } . 160,750 ( 0.00%) fn candidate_from_obligation_no_cache<'o>( . &mut self, . stack: &TraitObligationStack<'o, 'tcx>, . ) -> SelectionResult<'tcx, SelectionCandidate<'tcx>> { 340 ( 0.00%) if let Some(conflict) = self.is_knowable(stack) { . debug!("coherence stage: not knowable"); . if self.intercrate_ambiguity_causes.is_some() { . debug!("evaluate_stack: intercrate_ambiguity_causes is some"); . // Heuristics: show the diagnostics when there are no candidates in crate. . if let Ok(candidate_set) = self.assemble_candidates(stack) { . let mut no_candidates_apply = true; . . for c in candidate_set.vec.iter() { -- line 85 ---------------------------------------- -- line 109 ---------------------------------------- . debug!(?cause, "evaluate_stack: pushing cause"); . self.intercrate_ambiguity_causes.as_mut().unwrap().push(cause); . } . } . } . return Ok(None); . } . 48,225 ( 0.00%) let candidate_set = self.assemble_candidates(stack)?; . 32,150 ( 0.00%) if candidate_set.ambiguous { . debug!("candidate set contains ambig"); 1,700 ( 0.00%) return Ok(None); . } . . let candidates = candidate_set.vec; . . debug!(?stack, ?candidates, "assembled {} candidates", candidates.len()); . . // At this point, we know that each of the entries in the . // candidate set is *individually* applicable. Now we have to . // figure out if they contain mutual incompatibilities. This . // frequently arises if we have an unconstrained input type -- . // for example, we are looking for `$0: Eq` where `$0` is some . // unconstrained type variable. In that case, we'll get a . // candidate which assumes $0 == int, one that assumes `$0 == . // usize`, etc. This spells an ambiguity. . 60,900 ( 0.00%) let mut candidates = self.filter_impls(candidates, stack.obligation); . . // If there is more than one candidate, first winnow them down . // by considering extra conditions (nested obligations and so . // forth). We don't winnow if there is exactly one . // candidate. This is a relatively minor distinction but it . // can lead to better inference and error-reporting. An . // example would be if there was an impl: . // . // impl Vec { fn push_clone(...) { ... } } . // . // and we were to see some code `foo.push_clone()` where `boo` . // is a `Vec` and `Bar` does not implement `Clone`. If . // we were to winnow, we'd wind up with zero candidates. . // Instead, we select the right impl now but report "`Bar` does . // not implement `Clone`". 30,450 ( 0.00%) if candidates.len() == 1 { 34,878 ( 0.00%) return self.filter_reservation_impls(candidates.pop().unwrap(), stack.obligation); . } . . // Winnow, but record the exact outcome of evaluation, which . // is needed for specialization. Propagate overflow if it occurs. 21,594 ( 0.00%) let mut candidates = candidates . .into_iter() . .map(|c| match self.evaluate_candidate(stack, &c) { 16,194 ( 0.00%) Ok(eval) if eval.may_apply() => { 20,816 ( 0.00%) Ok(Some(EvaluatedCandidate { candidate: c, evaluation: eval })) . } . Ok(_) => Ok(None), . Err(OverflowError::Canonical) => Err(Overflow), . Err(OverflowError::ErrorReporting) => Err(ErrorReporting), . }) . .flat_map(Result::transpose) . .collect::, _>>()?; . . debug!(?stack, ?candidates, "winnowed to {} candidates", candidates.len()); . 3,599 ( 0.00%) let needs_infer = stack.obligation.predicate.has_infer_types_or_consts(); . 10,797 ( 0.00%) let sized_predicate = self.tcx().lang_items().sized_trait() 7,198 ( 0.00%) == Some(stack.obligation.predicate.skip_binder().def_id()); . . // If there are STILL multiple candidates, we can further . // reduce the list by dropping duplicates -- including . // resolving specializations. 10,797 ( 0.00%) if candidates.len() > 1 { . let mut i = 0; 2,716 ( 0.00%) while i < candidates.len() { 4,405 ( 0.00%) let is_dup = (0..candidates.len()).filter(|&j| i != j).any(|j| { . self.candidate_should_be_dropped_in_favor_of( . sized_predicate, . &candidates[i], . &candidates[j], . needs_infer, . ) . }); . if is_dup { . debug!(candidate = ?candidates[i], "Dropping candidate #{}/{}", i, candidates.len()); . candidates.swap_remove(i); . } else { . debug!(candidate = ?candidates[i], "Retaining candidate #{}/{}", i, candidates.len()); 1,802 ( 0.00%) i += 1; . . // If there are *STILL* multiple candidates, give up . // and report ambiguity. 2,703 ( 0.00%) if i > 1 { . debug!("multiple matches, ambig"); 1,776 ( 0.00%) return Err(Ambiguous( . candidates . .into_iter() 1,295 ( 0.00%) .filter_map(|c| match c.candidate { . SelectionCandidate::ImplCandidate(def_id) => Some(def_id), . _ => None, . }) . .collect(), . )); . } . } . } -- line 215 ---------------------------------------- -- line 219 ---------------------------------------- . // that we know of, anyway. Note that in the case where there . // are unbound type variables within the obligation, it might . // be the case that you could still satisfy the obligation . // from another crate by instantiating the type variables with . // a type from another crate that does have an impl. This case . // is checked for in `evaluate_stack` (and hence users . // who might care about this case, like coherence, should use . // that function). 3,451 ( 0.00%) if candidates.is_empty() { . // If there's an error type, 'downgrade' our result from . // `Err(Unimplemented)` to `Ok(None)`. This helps us avoid . // emitting additional spurious errors, since we're guaranteed . // to have emitted at least one. 5,498 ( 0.00%) if stack.obligation.references_error() { . debug!("no results for error type, treating as ambiguous"); 2,749 ( 0.00%) return Ok(None); . } . return Err(Unimplemented); . } . . // Just one candidate left. 2,106 ( 0.00%) self.filter_reservation_impls(candidates.pop().unwrap().candidate, stack.obligation) 151,577 ( 0.00%) } . 128,600 ( 0.00%) #[instrument(skip(self, stack), level = "debug")] 160,750 ( 0.00%) pub(super) fn assemble_candidates<'o>( . &mut self, . stack: &TraitObligationStack<'o, 'tcx>, . ) -> Result, SelectionError<'tcx>> { 16,075 ( 0.00%) let TraitObligationStack { obligation, .. } = *stack; 305,425 ( 0.00%) let obligation = &Obligation { 16,075 ( 0.00%) param_env: obligation.param_env, . cause: obligation.cause.clone(), 48,225 ( 0.00%) recursion_depth: obligation.recursion_depth, 192,900 ( 0.00%) predicate: self.infcx().resolve_vars_if_possible(obligation.predicate), . }; . 33,810 ( 0.00%) if obligation.predicate.skip_binder().self_ty().is_ty_var() { . // Self is a type variable (e.g., `_: AsRef`). . // . // This is somewhat problematic, as the current scheme can't really . // handle it turning to be a projection. This does end up as truly . // ambiguous in most cases anyway. . // . // Take the fast path out - this also improves . // performance by preventing assemble_candidates_from_impls from . // matching every impl for this trait. 2,169 ( 0.00%) return Ok(SelectionCandidateSet { vec: vec![], ambiguous: true }); . } . 46,056 ( 0.00%) let mut candidates = SelectionCandidateSet { vec: Vec::new(), ambiguous: false }; . . // The only way to prove a NotImplemented(T: Foo) predicate is via a negative impl. . // There are no compiler built-in rules for this. 30,704 ( 0.00%) if obligation.polarity() == ty::ImplPolarity::Negative { . self.assemble_candidates_for_trait_alias(obligation, &mut candidates); . self.assemble_candidates_from_impls(obligation, &mut candidates); . } else { 15,352 ( 0.00%) self.assemble_candidates_for_trait_alias(obligation, &mut candidates); . . // Other bounds. Consider both in-scope bounds from fn decl . // and applicable impls. There is a certain set of precedence rules here. 92,112 ( 0.00%) let def_id = obligation.predicate.def_id(); 15,352 ( 0.00%) let lang_items = self.tcx().lang_items(); . 49,942 ( 0.00%) if lang_items.copy_trait() == Some(def_id) { . debug!(obligation_self_ty = ?obligation.predicate.skip_binder().self_ty()); . . // User-defined copy impls are permitted, but only for . // structs and enums. 1,943 ( 0.00%) self.assemble_candidates_from_impls(obligation, &mut candidates); . . // For other types, we'll use the builtin rules. 7,772 ( 0.00%) let copy_conditions = self.copy_clone_conditions(obligation); 19,430 ( 0.00%) self.assemble_builtin_bound_candidates(copy_conditions, &mut candidates); 40,239 ( 0.00%) } else if lang_items.discriminant_kind_trait() == Some(def_id) { . // `DiscriminantKind` is automatically implemented for every type. . candidates.vec.push(DiscriminantKindCandidate); 40,209 ( 0.00%) } else if lang_items.pointee_trait() == Some(def_id) { . // `Pointee` is automatically implemented for every type. . candidates.vec.push(PointeeCandidate); 48,507 ( 0.00%) } else if lang_items.sized_trait() == Some(def_id) { . // Sized is never implementable by end-users, it is . // always automatically computed. 4,149 ( 0.00%) let sized_conditions = self.sized_conditions(obligation); 41,490 ( 0.00%) self.assemble_builtin_bound_candidates(sized_conditions, &mut candidates); 29,038 ( 0.00%) } else if lang_items.unsize_trait() == Some(def_id) { 1,276 ( 0.00%) self.assemble_candidates_for_unsizing(obligation, &mut candidates); 25,965 ( 0.00%) } else if lang_items.drop_trait() == Some(def_id) . && obligation.predicate.skip_binder().constness == ty::BoundConstness::ConstIfConst . { 190 ( 0.00%) self.assemble_const_drop_candidates(obligation, &mut candidates); . } else { 25,896 ( 0.00%) if lang_items.clone_trait() == Some(def_id) { . // Same builtin conditions as `Copy`, i.e., every type which has builtin support . // for `Copy` also has builtin support for `Clone`, and tuples/arrays of `Clone` . // types have builtin support for `Clone`. 324 ( 0.00%) let clone_conditions = self.copy_clone_conditions(obligation); 729 ( 0.00%) self.assemble_builtin_bound_candidates(clone_conditions, &mut candidates); . } . 8,578 ( 0.00%) self.assemble_generator_candidates(obligation, &mut candidates); 8,578 ( 0.00%) self.assemble_closure_candidates(obligation, &mut candidates); 8,578 ( 0.00%) self.assemble_fn_pointer_candidates(obligation, &mut candidates); 25,734 ( 0.00%) self.assemble_candidates_from_impls(obligation, &mut candidates); . self.assemble_candidates_from_object_ty(obligation, &mut candidates); . } . . self.assemble_candidates_from_projected_tys(obligation, &mut candidates); . self.assemble_candidates_from_caller_bounds(stack, &mut candidates)?; . // Auto implementations have lower priority, so we only . // consider triggering a default if there is no other impl that can apply. 15,352 ( 0.00%) if candidates.vec.is_empty() { . self.assemble_candidates_from_auto_impls(obligation, &mut candidates); . } . } . debug!("candidate list size: {}", candidates.vec.len()); 199,576 ( 0.00%) Ok(candidates) . } . . #[tracing::instrument(level = "debug", skip(self, candidates))] . fn assemble_candidates_from_projected_tys( . &mut self, . obligation: &TraitObligation<'tcx>, . candidates: &mut SelectionCandidateSet<'tcx>, . ) { . // Before we go into the whole placeholder thing, just . // quickly check if the self-type is a projection at all. 137,016 ( 0.00%) match obligation.predicate.skip_binder().trait_ref.self_ty().kind() { . ty::Projection(_) | ty::Opaque(..) => {} . ty::Infer(ty::TyVar(_)) => { . span_bug!( . obligation.cause.span, . "Self=_ should have been handled by assemble_candidates" . ); . } . _ => return, . } . 1,366 ( 0.00%) let result = self . .infcx 683 ( 0.00%) .probe(|_| self.match_projection_obligation_against_definition_bounds(obligation)); . 1,366 ( 0.00%) candidates.vec.extend(result.into_iter().map(ProjectionCandidate)); . } . . /// Given an obligation like ``, searches the obligations that the caller . /// supplied to find out whether it is listed among them. . /// . /// Never affects the inference environment. . #[tracing::instrument(level = "debug", skip(self, stack, candidates))] . fn assemble_candidates_from_caller_bounds<'o>( . &mut self, . stack: &TraitObligationStack<'o, 'tcx>, . candidates: &mut SelectionCandidateSet<'tcx>, . ) -> Result<(), SelectionError<'tcx>> { . debug!(?stack.obligation); . 61,408 ( 0.00%) let all_bounds = stack . .obligation . .param_env . .caller_bounds() . .iter() 266,184 ( 0.00%) .filter_map(|o| o.to_opt_poly_trait_pred()); . . // Micro-optimization: filter out predicates relating to different traits. . let matching_bounds = 1,465,848 ( 0.02%) all_bounds.filter(|p| p.def_id() == stack.obligation.predicate.def_id()); . . // Keep only those bounds which may apply, and propagate overflow if it occurs. . for bound in matching_bounds { . // FIXME(oli-obk): it is suspicious that we are dropping the constness and . // polarity here. 36,024 ( 0.00%) let wc = self.evaluate_where_clause(stack, bound.map_bound(|t| t.trait_ref))?; 72,048 ( 0.00%) if wc.may_apply() { . candidates.vec.push(ParamCandidate(bound)); . } . } . . Ok(()) . } . 68,624 ( 0.00%) fn assemble_generator_candidates( . &mut self, . obligation: &TraitObligation<'tcx>, . candidates: &mut SelectionCandidateSet<'tcx>, . ) { 102,936 ( 0.00%) if self.tcx().lang_items().gen_trait() != Some(obligation.predicate.def_id()) { . return; . } . . // Okay to skip binder because the substs on generator types never . // touch bound regions, they just capture the in-scope . // type/region parameters. . let self_ty = obligation.self_ty().skip_binder(); . match self_ty.kind() { -- line 414 ---------------------------------------- -- line 418 ---------------------------------------- . candidates.vec.push(GeneratorCandidate); . } . ty::Infer(ty::TyVar(_)) => { . debug!("assemble_generator_candidates: ambiguous self-type"); . candidates.ambiguous = true; . } . _ => {} . } 60,046 ( 0.00%) } . . /// Checks for the artificial impl that the compiler will create for an obligation like `X : . /// FnMut<..>` where `X` is a closure type. . /// . /// Note: the type parameters on a closure candidate are modeled as *output* type . /// parameters and hence do not affect whether this trait is a match or not. They will be . /// unified during the confirmation step. 60,046 ( 0.00%) fn assemble_closure_candidates( . &mut self, . obligation: &TraitObligation<'tcx>, . candidates: &mut SelectionCandidateSet<'tcx>, . ) { 94,358 ( 0.00%) let kind = match self.tcx().fn_trait_kind_from_lang_item(obligation.predicate.def_id()) { . Some(k) => k, . None => { . return; . } . }; . . // Okay to skip binder because the substs on closure types never . // touch bound regions, they just capture the in-scope . // type/region parameters 3,545 ( 0.00%) match *obligation.self_ty().skip_binder().kind() { 520 ( 0.00%) ty::Closure(_, closure_substs) => { . debug!(?kind, ?obligation, "assemble_unboxed_candidates"); 2,080 ( 0.00%) match self.infcx.closure_kind(closure_substs) { . Some(closure_kind) => { . debug!(?closure_kind, "assemble_unboxed_candidates"); 2,600 ( 0.00%) if closure_kind.extends(kind) { . candidates.vec.push(ClosureCandidate); . } . } . None => { . debug!("assemble_unboxed_candidates: closure_kind not yet known"); . candidates.vec.push(ClosureCandidate); . } . } . } . ty::Infer(ty::TyVar(_)) => { . debug!("assemble_unboxed_closure_candidates: ambiguous self-type"); . candidates.ambiguous = true; . } . _ => {} . } 51,468 ( 0.00%) } . . /// Implements one of the `Fn()` family for a fn pointer. 77,202 ( 0.00%) fn assemble_fn_pointer_candidates( . &mut self, . obligation: &TraitObligation<'tcx>, . candidates: &mut SelectionCandidateSet<'tcx>, . ) { . // We provide impl of all fn traits for fn pointers. 85,780 ( 0.00%) if self.tcx().fn_trait_kind_from_lang_item(obligation.predicate.def_id()).is_none() { . return; . } . . // Okay to skip binder because what we are inspecting doesn't involve bound regions. 1,310 ( 0.00%) let self_ty = obligation.self_ty().skip_binder(); 4,361 ( 0.00%) match *self_ty.kind() { . ty::Infer(ty::TyVar(_)) => { . debug!("assemble_fn_pointer_candidates: ambiguous self-type"); . candidates.ambiguous = true; // Could wind up being a fn() type. . } . // Provide an impl, but only for suitable `fn` pointers. . ty::FnPtr(_) => { . if let ty::FnSig { . unsafety: hir::Unsafety::Normal, -- line 494 ---------------------------------------- -- line 496 ---------------------------------------- . c_variadic: false, . .. . } = self_ty.fn_sig(self.tcx()).skip_binder() . { . candidates.vec.push(FnPointerCandidate { is_const: false }); . } . } . // Provide an impl for suitable functions, rejecting `#[target_feature]` functions (RFC 2396). 112 ( 0.00%) ty::FnDef(def_id, _) => { 168 ( 0.00%) if let ty::FnSig { . unsafety: hir::Unsafety::Normal, . abi: Abi::Rust, . c_variadic: false, . .. 112 ( 0.00%) } = self_ty.fn_sig(self.tcx()).skip_binder() . { 108 ( 0.00%) if self.tcx().codegen_fn_attrs(def_id).target_features.is_empty() { . candidates . .vec 224 ( 0.00%) .push(FnPointerCandidate { is_const: self.tcx().is_const_fn(def_id) }); . } . } . } . _ => {} . } 68,624 ( 0.00%) } . . /// Searches for impls that might apply to `obligation`. 105,210 ( 0.00%) fn assemble_candidates_from_impls( . &mut self, . obligation: &TraitObligation<'tcx>, . candidates: &mut SelectionCandidateSet<'tcx>, . ) { . debug!(?obligation, "assemble_candidates_from_impls"); . . // Essentially any user-written impl will match with an error type, . // so creating `ImplCandidates` isn't useful. However, we might . // end up finding a candidate elsewhere (e.g. a `BuiltinCandidate` for `Sized) . // This helps us avoid overflow: see issue #72839 . // Since compilation is already guaranteed to fail, this is just . // to try to show the 'nicest' possible errors to the user. . // We don't check for errors in the `ParamEnv` - in practice, . // it seems to cause us to be overly aggressive in deciding . // to give up searching for candidates, leading to spurious errors. 21,042 ( 0.00%) if obligation.predicate.references_error() { . return; . } . 31,563 ( 0.00%) self.tcx().for_each_relevant_impl( 84,168 ( 0.00%) obligation.predicate.def_id(), . obligation.predicate.skip_binder().trait_ref.self_ty(), 52,605 ( 0.00%) |impl_def_id| { 147,608 ( 0.00%) self.infcx.probe(|_| { 134,562 ( 0.00%) if let Ok(_substs) = self.match_impl(impl_def_id, obligation) { 11,928 ( 0.00%) candidates.vec.push(ImplCandidate(impl_def_id)); . } . }); . }, . ); 84,168 ( 0.00%) } . . fn assemble_candidates_from_auto_impls( . &mut self, . obligation: &TraitObligation<'tcx>, . candidates: &mut SelectionCandidateSet<'tcx>, . ) { . // Okay to skip binder here because the tests we do below do not involve bound regions. 3,665 ( 0.00%) let self_ty = obligation.self_ty().skip_binder(); . debug!(?self_ty, "assemble_candidates_from_auto_impls"); . 21,990 ( 0.00%) let def_id = obligation.predicate.def_id(); . 14,660 ( 0.00%) if self.tcx().trait_is_auto(def_id) { 2,367 ( 0.00%) match self_ty.kind() { . ty::Dynamic(..) => { . // For object types, we don't know what the closed . // over types are. This means we conservatively . // say nothing; a candidate may be added by . // `assemble_candidates_from_object_ty`. . } . ty::Foreign(..) => { . // Since the contents of foreign types is unknown, -- line 577 ---------------------------------------- -- line 625 ---------------------------------------- . obligation: &TraitObligation<'tcx>, . candidates: &mut SelectionCandidateSet<'tcx>, . ) { . debug!( . self_ty = ?obligation.self_ty().skip_binder(), . "assemble_candidates_from_object_ty", . ); . 68,624 ( 0.00%) self.infcx.probe(|_snapshot| { . // The code below doesn't care about regions, and the . // self-ty here doesn't escape this probe, so just erase . // any LBR. 8,578 ( 0.00%) let self_ty = self.tcx().erase_late_bound_regions(obligation.self_ty()); 42,962 ( 0.00%) let poly_trait_ref = match self_ty.kind() { . ty::Dynamic(ref data, ..) => { 272 ( 0.00%) if data.auto_traits().any(|did| did == obligation.predicate.def_id()) { . debug!( . "assemble_candidates_from_object_ty: matched builtin bound, \ . pushing candidate" . ); . candidates.vec.push(BuiltinObjectCandidate); . return; . } . 168 ( 0.00%) if let Some(principal) = data.principal() { 70 ( 0.00%) if !self.infcx.tcx.features().object_safe_for_dispatch { . principal.with_self_ty(self.tcx(), self_ty) . } else if self.tcx().is_object_safe(principal.def_id()) { . principal.with_self_ty(self.tcx(), self_ty) . } else { . return; . } . } else { . // Only auto trait bounds exist. -- line 658 ---------------------------------------- -- line 664 ---------------------------------------- . candidates.ambiguous = true; // could wind up being an object type . return; . } . _ => return, . }; . . debug!(?poly_trait_ref, "assemble_candidates_from_object_ty"); . 182 ( 0.00%) let poly_trait_predicate = self.infcx().resolve_vars_if_possible(obligation.predicate); . let placeholder_trait_predicate = 224 ( 0.00%) self.infcx().replace_bound_vars_with_placeholders(poly_trait_predicate); . . // Count only those upcast versions that match the trait-ref . // we are looking for. Specifically, do not only check for the . // correct trait, but also the correct type parameters. . // For example, we may be trying to upcast `Foo` to `Bar`, . // but `Foo` is declared as `trait Foo: Bar`. 98 ( 0.00%) let candidate_supertraits = util::supertraits(self.tcx(), poly_trait_ref) . .enumerate() . .filter(|&(_, upcast_trait_ref)| { 110 ( 0.00%) self.infcx.probe(|_| { 66 ( 0.00%) self.match_normalize_trait_ref( . obligation, 88 ( 0.00%) upcast_trait_ref, 88 ( 0.00%) placeholder_trait_predicate.trait_ref, . ) . .is_ok() . }) . }) . .map(|(idx, _)| ObjectCandidate(idx)); . . candidates.vec.extend(candidate_supertraits); . }) -- line 696 ---------------------------------------- -- line 739 ---------------------------------------- . }; . . let def_id = data.principal_def_id()?; . . return Some((normalized_ty, def_id)); . } . . /// Searches for unsizing that might apply to `obligation`. 6,380 ( 0.00%) fn assemble_candidates_for_unsizing( . &mut self, . obligation: &TraitObligation<'tcx>, . candidates: &mut SelectionCandidateSet<'tcx>, . ) { . // We currently never consider higher-ranked obligations e.g. . // `for<'a> &'a T: Unsize` to be implemented. This is not . // because they are a priori invalid, and we could potentially add support . // for them later, it's just that there isn't really a strong need for it. -- line 755 ---------------------------------------- -- line 758 ---------------------------------------- . // . // That said, one might try to write a fn with a where clause like . // for<'a> Foo<'a, T>: Unsize> . // where the `'a` is kind of orthogonal to the relevant part of the `Unsize`. . // Still, you'd be more likely to write that where clause as . // T: Trait . // so it seems ok if we (conservatively) fail to accept that `Unsize` . // obligation above. Should be possible to extend this in the future. 3,190 ( 0.00%) let source = match obligation.self_ty().no_bound_vars() { 638 ( 0.00%) Some(t) => t, . None => { . // Don't add any candidates if there are bound regions. . return; . } . }; 1,914 ( 0.00%) let target = obligation.predicate.skip_binder().trait_ref.substs.type_at(1); . . debug!(?source, ?target, "assemble_candidates_for_unsizing"); . 8,909 ( 0.00%) match (source.kind(), target.kind()) { . // Trait+Kx+'a -> Trait+Ky+'b (upcasts). . (&ty::Dynamic(ref data_a, ..), &ty::Dynamic(ref data_b, ..)) => { . // Upcast coercions permit several things: . // . // 1. Dropping auto traits, e.g., `Foo + Send` to `Foo` . // 2. Tightening the region bound, e.g., `Foo + 'a` to `Foo + 'b` if `'a: 'b` . // 3. Tightening trait to its super traits, eg. `Foo` to `Bar` if `Foo: Bar` . // . // Note that neither of the first two of these changes requires any . // change at runtime. The third needs to change pointer metadata at runtime. . // . // We always perform upcasting coercions when we can because of reason . // #2 (region bounds). 12 ( 0.00%) let auto_traits_compatible = data_b . .auto_traits() . // All of a's auto traits need to be in b's auto traits. 8 ( 0.00%) .all(|b| data_a.auto_traits().any(|a| a == b)); 8 ( 0.00%) if auto_traits_compatible { 20 ( 0.00%) let principal_def_id_a = data_a.principal_def_id(); 12 ( 0.00%) let principal_def_id_b = data_b.principal_def_id(); 12 ( 0.00%) if principal_def_id_a == principal_def_id_b { . // no cyclic . candidates.vec.push(BuiltinUnsizeCandidate); . } else if principal_def_id_a.is_some() && principal_def_id_b.is_some() { . // not casual unsizing, now check whether this is trait upcasting coercion. . let principal_a = data_a.principal().unwrap(); . let target_trait_did = principal_def_id_b.unwrap(); . let source_trait_ref = principal_a.with_self_ty(self.tcx(), source); . if let Some((deref_output_ty, deref_output_trait_did)) = self -- line 806 ---------------------------------------- -- line 843 ---------------------------------------- . candidates.vec.push(BuiltinUnsizeCandidate); . } . . // Ambiguous handling is below `T` -> `Trait`, because inference . // variables can still implement `Unsize` and nested . // obligations will have the final say (likely deferred). . (&ty::Infer(ty::TyVar(_)), _) | (_, &ty::Infer(ty::TyVar(_))) => { . debug!("assemble_candidates_for_unsizing: ambiguous"); 250 ( 0.00%) candidates.ambiguous = true; . } . . // `[T; n]` -> `[T]` . (&ty::Array(..), &ty::Slice(_)) => { . candidates.vec.push(BuiltinUnsizeCandidate); . } . . // `Struct` -> `Struct` 359 ( 0.00%) (&ty::Adt(def_id_a, _), &ty::Adt(def_id_b, _)) if def_id_a.is_struct() => { 515 ( 0.00%) if def_id_a == def_id_b { . candidates.vec.push(BuiltinUnsizeCandidate); . } . } . . // `(.., T)` -> `(.., U)` . (&ty::Tuple(tys_a), &ty::Tuple(tys_b)) => { . if tys_a.len() == tys_b.len() { . candidates.vec.push(BuiltinUnsizeCandidate); . } . } . . _ => {} . }; 5,104 ( 0.00%) } . 214,928 ( 0.00%) #[tracing::instrument(level = "debug", skip(self, obligation, candidates))] . fn assemble_candidates_for_trait_alias( . &mut self, . obligation: &TraitObligation<'tcx>, . candidates: &mut SelectionCandidateSet<'tcx>, . ) { . // Okay to skip binder here because the tests we do below do not involve bound regions. 30,704 ( 0.00%) let self_ty = obligation.self_ty().skip_binder(); . debug!(?self_ty); . 122,816 ( 0.00%) let def_id = obligation.predicate.def_id(); . 61,408 ( 0.00%) if self.tcx().is_trait_alias(def_id) { . candidates.vec.push(TraitAliasCandidate(def_id)); . } . } . . /// Assembles the trait which are built-in to the language itself: . /// `Copy`, `Clone` and `Sized`. 49,384 ( 0.00%) #[tracing::instrument(level = "debug", skip(self, candidates))] . fn assemble_builtin_bound_candidates( . &mut self, . conditions: BuiltinImplConditions<'tcx>, . candidates: &mut SelectionCandidateSet<'tcx>, . ) { 23,811 ( 0.00%) match conditions { . BuiltinImplConditions::Where(nested) => { . candidates . .vec . .push(BuiltinCandidate { has_nested: !nested.skip_binder().is_empty() }); . } . BuiltinImplConditions::None => {} . BuiltinImplConditions::Ambiguous => { 2 ( 0.00%) candidates.ambiguous = true; . } . } . } . 304 ( 0.00%) fn assemble_const_drop_candidates( . &mut self, . obligation: &TraitObligation<'tcx>, . candidates: &mut SelectionCandidateSet<'tcx>, . ) { . // If the predicate is `~const Drop` in a non-const environment, we don't actually need . // to check anything. We'll short-circuit checking any obligations in confirmation, too. . if obligation.param_env.constness() == hir::Constness::NotConst { . candidates.vec.push(ConstDropCandidate(None)); -- line 923 ---------------------------------------- -- line 979 ---------------------------------------- . candidates.vec.push(ConstDropCandidate(None)); . } . } . . ty::Infer(_) => { . candidates.ambiguous = true; . } . } 304 ( 0.00%) } . } 954,598 ( 0.01%) -------------------------------------------------------------------------------- -- 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). 20,255 ( 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, 580,699 ( 0.01%) PartialEq, . Eq, . Hash, . TyEncodable, 17,468 ( 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"), . } . } . } . 201,758 ( 0.00%) #[derive(Clone, Debug, PartialEq, Eq, Copy, Hash, TyEncodable, TyDecodable, HashStable)] . pub enum Visibility { . /// Visible everywhere (including in other crates). . Public, . /// Visible only in the given crate-local module. . Restricted(DefId), . /// Not visible anywhere in the local crate. This is the visibility of private external items. . Invisible, . } . 1,244,288 ( 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. 76,816 ( 0.00%) pub fn and(&mut self, constness: hir::Constness) -> hir::Constness { 115,224 ( 0.00%) match (constness, self) { . (hir::Constness::Const, BoundConstness::ConstIfConst) => hir::Constness::Const, . (_, this) => { 299,988 ( 0.00%) *this = BoundConstness::NotConst; . hir::Constness::NotConst . } . } 38,408 ( 0.00%) } . } . . impl fmt::Display for BoundConstness { . fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { . match self { . Self::NotConst => f.write_str("normal"), . Self::ConstIfConst => f.write_str("`~const`"), . } -- line 256 ---------------------------------------- -- line 274 ---------------------------------------- . pub before_feature_tys: Ty<'tcx>, . /// Tuple containing the types of closure captures after the feature `capture_disjoint_fields` . pub after_feature_tys: Ty<'tcx>, . } . . pub trait DefIdTree: Copy { . fn parent(self, id: DefId) -> Option; . 7 ( 0.00%) fn is_descendant_of(self, mut descendant: DefId, ancestor: DefId) -> bool { 44 ( 0.00%) if descendant.krate != ancestor.krate { . return false; . } . 11,682 ( 0.00%) while descendant != ancestor { 10,162 ( 0.00%) match self.parent(descendant) { . Some(parent) => descendant = parent, . None => return false, . } . } . true 8 ( 0.00%) } . } . . impl<'tcx> DefIdTree for TyCtxt<'tcx> { 17,470 ( 0.00%) fn parent(self, id: DefId) -> Option { . self.def_key(id).parent.map(|index| DefId { index, ..id }) 26,205 ( 0.00%) } . } . . impl Visibility { 308 ( 0.00%) pub fn from_hir(visibility: &hir::Visibility<'_>, id: hir::HirId, tcx: TyCtxt<'_>) -> Self { 924 ( 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 => { 480 ( 0.00%) Visibility::Restricted(tcx.parent_module(id).to_def_id()) . } . } 308 ( 0.00%) } . . /// Returns `true` if an item with this visibility is accessible from the given block. 117,054 ( 0.00%) pub fn is_accessible_from(self, module: DefId, tree: T) -> bool { 641,453 ( 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. 5,629 ( 0.00%) Visibility::Restricted(other) if other.krate != module.krate => return false, . Visibility::Restricted(module) => module, . }; . 2 ( 0.00%) tree.is_descendant_of(module, restriction) 117,054 ( 0.00%) } . . /// Returns `true` if this visibility is at least as accessible as the given visibility 3,888 ( 0.00%) pub fn is_at_least(self, vis: Visibility, tree: T) -> bool { 36,140 ( 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) 3,888 ( 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 { 13,124 ( 0.00%) matches!(self, Visibility::Public) 6,562 ( 0.00%) } . } . . /// The crate variances map is computed during typeck and contains the . /// variance of every item in the local crate. You should not use it . /// directly, because to do so will make your pass dependent on the . /// HIR of every item in the local crate. Instead, use . /// `tcx.variances_of()` to get the variance for a *particular* . /// item. -- line 365 ---------------------------------------- -- line 434 ---------------------------------------- . } . . // `TyS` is used a lot. Make sure it doesn't unintentionally get bigger. . #[cfg(all(target_arch = "x86_64", target_pointer_width = "64"))] . static_assert_size!(TyS<'_>, 40); . . impl<'tcx> Ord for TyS<'tcx> { . fn cmp(&self, other: &TyS<'tcx>) -> Ordering { 2 ( 0.00%) self.kind().cmp(other.kind()) . } . } . . impl<'tcx> PartialOrd for TyS<'tcx> { . fn partial_cmp(&self, other: &TyS<'tcx>) -> Option { . Some(self.kind().cmp(other.kind())) . } . } -- line 450 ---------------------------------------- -- line 509 ---------------------------------------- . #[derive(Clone, Copy, Lift)] . pub struct Predicate<'tcx> { . inner: &'tcx PredicateInner<'tcx>, . } . . impl<'tcx> PartialEq for Predicate<'tcx> { . fn eq(&self, other: &Self) -> bool { . // `self.kind` is always interned. 1,117,936 ( 0.01%) ptr::eq(self.inner, other.inner) 979,045 ( 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>> { 9,253,048 ( 0.11%) 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); . } . } . 27,492,047 ( 0.33%) #[derive(Clone, Copy, PartialEq, Eq, Hash, TyEncodable, TyDecodable)] 25,783,931 ( 0.31%) #[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. 34,144 ( 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. 5,317 ( 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. 62,919 ( 0.00%) pub fn subst_supertrait( . self, . tcx: TyCtxt<'tcx>, . trait_ref: &ty::PolyTraitRef<'tcx>, . ) -> Predicate<'tcx> { . // The interaction between HRTB and supertraits is not entirely . // obvious. Let me walk you (and myself) through an example. . // . // Let's start with an easy case. Consider two traits: -- line 661 ---------------------------------------- -- line 731 ---------------------------------------- . // ['x, 'b] . let bound_pred = self.kind(); . let pred_bound_vars = bound_pred.bound_vars(); . let trait_bound_vars = trait_ref.bound_vars(); . // 1) Self: Bar1<'a, '^0.0> -> Self: Bar1<'a, '^0.1> . let shifted_pred = . tcx.shift_bound_var_indices(trait_bound_vars.len(), bound_pred.skip_binder()); . // 2) Self: Bar1<'a, '^0.1> -> T: Bar1<'^0.0, '^0.1> 6,991 ( 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)); 62,919 ( 0.00%) tcx.reuse_or_mk_predicate(self, ty::Binder::bind_with_vars(new, bound_vars)) 48,937 ( 0.00%) } . } . 257,891 ( 0.00%) #[derive(Clone, Copy, PartialEq, Eq, Hash, TyEncodable, TyDecodable)] 2,273,296 ( 0.03%) #[derive(HashStable, TypeFoldable)] . pub struct TraitPredicate<'tcx> { . pub trait_ref: TraitRef<'tcx>, . 2,801,455 ( 0.03%) pub constness: BoundConstness, . 3,756,915 ( 0.04%) pub polarity: ImplPolarity, . } . . pub type PolyTraitPredicate<'tcx> = ty::Binder<'tcx, TraitPredicate<'tcx>>; . . impl<'tcx> TraitPredicate<'tcx> { 2,093,560 ( 0.03%) pub fn remap_constness(&mut self, tcx: TyCtxt<'tcx>, param_env: &mut ParamEnv<'tcx>) { 1,832,095 ( 0.02%) 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` 230 ( 0.00%) param_env.remap_constness_with(self.constness) . } else { 261,580 ( 0.00%) *param_env = param_env.with_constness(self.constness.and(param_env.constness())) . } 1,570,170 ( 0.02%) } . . /// 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 { 159,922 ( 0.00%) self.trait_ref.def_id 79,961 ( 0.00%) } . 142,092 ( 0.00%) pub fn self_ty(self) -> Ty<'tcx> { 426,276 ( 0.01%) self.trait_ref.self_ty() 284,184 ( 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() 333,900 ( 0.00%) } . 822 ( 0.00%) pub fn self_ty(self) -> ty::Binder<'tcx, Ty<'tcx>> { 3,288 ( 0.00%) self.map_bound(|trait_ref| trait_ref.self_ty()) 1,644 ( 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 . }); . } . } . 45 ( 0.00%) #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)] 93,585 ( 0.00%) #[derive(HashStable, TypeFoldable)] 97,401 ( 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)] 16,854 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub struct SubtypePredicate<'tcx> { 25,695 ( 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)] 82 ( 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>>; . 903,044 ( 0.01%) #[derive(Debug, Copy, Clone, PartialEq, Eq, Hash, PartialOrd, Ord, TyEncodable, TyDecodable)] 1,205,672 ( 0.01%) #[derive(HashStable, TypeFoldable)] . pub enum Term<'tcx> { 2,514 ( 0.00%) Ty(Ty<'tcx>), . Const(&'tcx Const<'tcx>), . } . . impl<'tcx> From> for Term<'tcx> { . fn from(ty: Ty<'tcx>) -> Self { . Term::Ty(ty) 133,710 ( 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> { 112,890 ( 0.00%) if let Term::Ty(ty) = self { Some(ty) } else { None } 56,445 ( 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. 147 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, Hash, TyEncodable, TyDecodable)] 325,023 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub struct ProjectionPredicate<'tcx> { . pub projection_ty: ProjectionTy<'tcx>, 295,037 ( 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 { 200 ( 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. 14,943 ( 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. 157,328 ( 0.00%) self.skip_binder().projection_ty.item_def_id 78,664 ( 0.00%) } . } . . pub trait ToPolyTraitRef<'tcx> { . fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx>; . } . . impl<'tcx> ToPolyTraitRef<'tcx> for PolyTraitPredicate<'tcx> { 110,819 ( 0.00%) fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx> { 110,819 ( 0.00%) self.map_bound_ref(|trait_pred| trait_pred.trait_ref) 110,819 ( 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> { 39,587 ( 0.00%) fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> { 197,935 ( 0.00%) self.map_bound(PredicateKind::Trait).to_predicate(tcx) 79,174 ( 0.00%) } . } . . impl<'tcx> ToPredicate<'tcx> for PolyRegionOutlivesPredicate<'tcx> { 13 ( 0.00%) fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> { 26 ( 0.00%) self.map_bound(PredicateKind::RegionOutlives).to_predicate(tcx) 26 ( 0.00%) } . } . . impl<'tcx> ToPredicate<'tcx> for PolyTypeOutlivesPredicate<'tcx> { 348 ( 0.00%) fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> { 696 ( 0.00%) self.map_bound(PredicateKind::TypeOutlives).to_predicate(tcx) 696 ( 0.00%) } . } . . impl<'tcx> ToPredicate<'tcx> for PolyProjectionPredicate<'tcx> { 39,822 ( 0.00%) fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> { 199,110 ( 0.00%) self.map_bound(PredicateKind::Projection).to_predicate(tcx) 79,644 ( 0.00%) } . } . . impl<'tcx> Predicate<'tcx> { 277,168 ( 0.00%) pub fn to_opt_poly_trait_pred(self) -> Option> { . let predicate = self.kind(); 831,504 ( 0.01%) match predicate.skip_binder() { 638,230 ( 0.01%) 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(..) 10,938 ( 0.00%) | PredicateKind::TypeWellFormedFromEnv(..) => None, . } 277,168 ( 0.00%) } . 43,763 ( 0.00%) pub fn to_opt_type_outlives(self) -> Option> { . let predicate = self.kind(); 87,526 ( 0.00%) match predicate.skip_binder() { 45 ( 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(..) 43,748 ( 0.00%) | PredicateKind::TypeWellFormedFromEnv(..) => None, . } 43,763 ( 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]]`. 193,725 ( 0.00%) #[derive(Clone, Debug, TypeFoldable)] . pub struct InstantiatedPredicates<'tcx> { . pub predicates: Vec>, . pub spans: Vec, . } . . impl<'tcx> InstantiatedPredicates<'tcx> { 781 ( 0.00%) pub fn empty() -> InstantiatedPredicates<'tcx> { 106,420 ( 0.00%) InstantiatedPredicates { predicates: vec![], spans: vec![] } 781 ( 0.00%) } . . pub fn is_empty(&self) -> bool { . self.predicates.is_empty() 5 ( 0.00%) } . } . 21 ( 0.00%) #[derive(Copy, Clone, Debug, PartialEq, Eq, HashStable, TyEncodable, TyDecodable, TypeFoldable)] . pub struct OpaqueTypeKey<'tcx> { . pub def_id: DefId, . pub substs: SubstsRef<'tcx>, . } . . rustc_index::newtype_index! { . /// "Universes" are used during type- and trait-checking in the . /// presence of `for<..>` binders to control what sets of names are -- line 1043 ---------------------------------------- -- line 1091 ---------------------------------------- . /// ``` . /// for<'a> fn(&'a u32) . /// ``` . /// . /// Once we "enter" into this `for<'a>` quantifier, we are in a . /// new universe that extends `U` -- in this new universe, we can . /// name the region `'a`, but that region was not nameable from . /// `U` because it was not in scope there. 252,209 ( 0.00%) pub fn next_universe(self) -> UniverseIndex { . UniverseIndex::from_u32(self.private.checked_add(1).unwrap()) 756,627 ( 0.01%) } . . /// 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 { 356,070 ( 0.00%) self.private >= other.private 178,035 ( 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 { 1,816 ( 0.00%) self.private < other.private 908 ( 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 { 61,259 ( 0.00%) pub universe: UniverseIndex, 20,370 ( 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`. 1,250 ( 0.00%) #[derive(Copy, Clone, Debug, TypeFoldable, Lift, TyEncodable, TyDecodable)] . #[derive(PartialEq, Eq, PartialOrd, Ord)] . #[derive(Hash, HashStable)] . pub struct WithOptConstParam { 10,433 ( 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`. 6,855 ( 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 } 27,018 ( 0.00%) } . } . . impl WithOptConstParam { . /// Returns `Some((did, param_did))` if `def_id` is a const argument, . /// `None` otherwise. . #[inline(always)] . pub fn try_lookup(did: LocalDefId, tcx: TyCtxt<'_>) -> Option<(LocalDefId, DefId)> { . tcx.opt_const_param_of(did).map(|param_did| (did, param_did)) . } . . /// In case `self` is unknown but `self.did` is a const argument, this returns . /// a `WithOptConstParam` with the correct `const_param_did`. . #[inline(always)] . pub fn try_upgrade(self, tcx: TyCtxt<'_>) -> Option> { 3,509 ( 0.00%) if self.const_param_did.is_none() { 5,825 ( 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 } . } . 140 ( 0.00%) pub fn def_id_for_type_of(self) -> DefId { 405 ( 0.00%) if let Some(did) = self.const_param_did { did } else { self.did.to_def_id() } 35 ( 0.00%) } . } . . impl WithOptConstParam { 2,322 ( 0.00%) pub fn as_local(self) -> Option> { . self.did . .as_local() . .map(|did| WithOptConstParam { did, const_param_did: self.const_param_did }) 2,322 ( 0.00%) } . . pub fn as_const_arg(self) -> Option<(LocalDefId, DefId)> { 7,499 ( 0.00%) if let Some(param_did) = self.const_param_did { 3,745 ( 0.00%) if let Some(did) = self.did.as_local() { . return Some((did, param_did)); . } . } . . None 18 ( 0.00%) } . . pub fn is_local(self) -> bool { . self.did.is_local() . } . 763 ( 0.00%) pub fn def_id_for_type_of(self) -> DefId { . self.const_param_did.unwrap_or(self.did) 763 ( 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 { 163,395 ( 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 { 3,861,152 ( 0.05%) 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 }) } . } . 3 ( 0.00%) pub fn with_user_facing(mut self) -> Self { . self.packed.set_tag(ParamTag { reveal: Reveal::UserFacing, ..self.packed.tag() }); . self 3 ( 0.00%) } . . #[inline] . pub fn with_constness(mut self, constness: hir::Constness) -> Self { . self.packed.set_tag(ParamTag { constness, ..self.packed.tag() }); . self . } . . #[inline] -- line 1424 ---------------------------------------- -- line 1430 ---------------------------------------- . #[inline] . pub fn without_const(mut self) -> Self { . self.packed.set_tag(ParamTag { constness: hir::Constness::NotConst, ..self.packed.tag() }); . self . } . . #[inline] . pub fn remap_constness_with(&mut self, mut constness: ty::BoundConstness) { 37,931 ( 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 2,976 ( 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(), . ) 3,348 ( 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. 162,425 ( 0.00%) pub fn and>(self, value: T) -> ParamEnvAnd<'tcx, T> { . match self.reveal() { . Reveal::UserFacing => ParamEnvAnd { param_env: self, value }, . . Reveal::All => { 376 ( 0.00%) if value.is_global() { . ParamEnvAnd { param_env: self.without_caller_bounds(), value } . } else { . ParamEnvAnd { param_env: self, value } . } . } . } 153,158 ( 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> { 5,748 ( 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) . } . } . 6,891 ( 0.00%) #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, TypeFoldable)] . pub struct ParamEnvAnd<'tcx, T> { 83,706 ( 0.00%) pub param_env: ParamEnv<'tcx>, 2,415,140 ( 0.03%) 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(); 11,254 ( 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, . } . 6,163 ( 0.00%) bitflags! { 4,833 ( 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. 178,845 ( 0.00%) #[derive(Debug, HashStable, TyEncodable, TyDecodable)] . pub struct VariantDef { . /// `DefId` that identifies the variant itself. . /// If this variant belongs to a struct or union, then this is a copy of its `DefId`. . pub def_id: DefId, . /// `DefId` that identifies the variant's constructor. . /// If this variant is a struct variant, then this is `None`. . pub ctor_def_id: Option, . /// Variant or struct name. -- line 1571 ---------------------------------------- -- line 1592 ---------------------------------------- . /// `parent_did` is the `DefId` of the `AdtDef` representing the enum or struct that . /// owns this variant. It is used for checking if a struct has `#[non_exhaustive]` w/out having . /// to go through the redirect of checking the ctor's attributes - but compiling a small crate . /// requires loading the `AdtDef`s for all the structs in the universe (e.g., coherence for any . /// built-in trait), and we do not want to load attributes twice. . /// . /// If someone speeds up attribute loading to not be a performance concern, they can . /// remove this hack and use the constructor `DefId` everywhere. 2,872 ( 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; 359 ( 0.00%) if is_field_list_non_exhaustive { . flags |= VariantFlags::IS_FIELD_LIST_NON_EXHAUSTIVE; . } . 1,077 ( 0.00%) if recovered { . flags |= VariantFlags::IS_RECOVERED; . } . 3,231 ( 0.00%) VariantDef { . def_id: variant_did.unwrap_or(parent_did), . ctor_def_id, . name, . discr, 1,436 ( 0.00%) fields, . ctor_kind, . flags, . } 1,436 ( 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` 15,127 ( 0.00%) pub fn ident(&self, tcx: TyCtxt<'_>) -> Ident { 8,644 ( 0.00%) Ident::new(self.name, tcx.def_ident_span(self.def_id).unwrap()) 19,449 ( 0.00%) } . } . 106,072 ( 0.00%) #[derive(Copy, Clone, Debug, PartialEq, Eq, TyEncodable, TyDecodable, HashStable)] . pub enum VariantDiscr { . /// Explicit value for this variant, i.e., `X = 123`. . /// The `DefId` corresponds to the embedded constant. . Explicit(DefId), . . /// The previous variant's discriminant plus one. . /// For efficiency reasons, the distance from the . /// last `Explicit` discriminant is being stored, . /// or `0` for the first variant, if it has none. . Relative(u32), . } . 231,013 ( 0.00%) #[derive(Debug, HashStable, TyEncodable, TyDecodable)] . pub struct FieldDef { . pub did: DefId, . pub name: Symbol, . pub vis: Visibility, . } . 511 ( 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, 143,010 ( 0.00%) #[derive(Copy, Clone, Debug, Eq, PartialEq, TyEncodable, TyDecodable, Default, HashStable)] . pub struct ReprOptions { . pub int: Option, . pub align: Option, . pub pack: Option, . pub flags: ReprFlags, . /// The seed to be used for randomizing a type's layout . /// . /// Note: This could technically be a `[u8; 16]` (a `u128`) which would -- line 1705 ---------------------------------------- -- line 1706 ---------------------------------------- . /// be the "most accurate" hash as it'd encompass the item and crate . /// hash without loss, but it does pay the price of being larger. . /// Everything's a tradeoff, a `u64` seed should be sufficient for our . /// purposes (primarily `-Z randomize-layout`) . pub field_shuffle_seed: u64, . } . . impl ReprOptions { 689 ( 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 159 ( 0.00%) if let Some(user_seed) = tcx.sess.opts.debugging_opts.layout_seed { . field_shuffle_seed ^= user_seed; . } . 212 ( 0.00%) for attr in tcx.get_attrs(did).iter() { 955 ( 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 424 ( 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. 318 ( 0.00%) if !tcx.consider_optimizing(|| format!("Reorder fields of {:?}", tcx.def_path_str(did))) { . flags.insert(ReprFlags::IS_LINEAR); . } . 106 ( 0.00%) Self { int: size, align: max_align, pack: min_pack, flags, field_shuffle_seed } 1,484 ( 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 { 3,447 ( 0.00%) self.int.unwrap_or(attr::SignedInt(ast::IntTy::Isize)) 2,069 ( 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 { 75 ( 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 { 320 ( 0.00%) if let Some(pack) = self.pack { . if pack.bytes() == 1 { . return true; . } . } . 640 ( 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 { 160 ( 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`]. 95,263 ( 0.00%) pub fn ty(&self, tcx: TyCtxt<'tcx>, subst: SubstsRef<'tcx>) -> Ty<'tcx> { 27,218 ( 0.00%) tcx.type_of(self.did).subst(tcx, subst) 108,872 ( 0.00%) } . . /// Computes the `Ident` of this variant by looking up the `Span` 15,785 ( 0.00%) pub fn ident(&self, tcx: TyCtxt<'_>) -> Ident { 9,020 ( 0.00%) Ident::new(self.name, tcx.def_ident_span(self.did).unwrap()) 20,295 ( 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> { 54,160 ( 0.00%) pub fn typeck_body(self, body: hir::BodyId) -> &'tcx TypeckResults<'tcx> { 13,540 ( 0.00%) self.typeck(self.hir().body_owner_def_id(body)) 54,160 ( 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()) . } . 432 ( 0.00%) fn item_name_from_def_id(self, def_id: DefId) -> Option { 48 ( 0.00%) if def_id.index == CRATE_DEF_INDEX { . Some(self.crate_name(def_id.krate)) . } else { 144 ( 0.00%) let def_key = self.def_key(def_id); 240 ( 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(), . }), 96 ( 0.00%) _ => def_key.disambiguated_data.data.get_opt_name(), . } . } 384 ( 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 336 ( 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. 48 ( 0.00%) self.item_name_from_def_id(id).unwrap_or_else(|| { . bug!("item_name: no name for {:?}", self.def_path(id)); . }) 240 ( 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)) . } . 981,530 ( 0.01%) pub fn opt_associated_item(self, def_id: DefId) -> Option<&'tcx AssocItem> { 392,612 ( 0.00%) if let DefKind::AssocConst | DefKind::AssocFn | DefKind::AssocTy = self.def_kind(def_id) { . Some(self.associated_item(def_id)) . } else { . None . } 883,377 ( 0.01%) } . 3,717 ( 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") 7,434 ( 0.00%) } . . pub fn find_field_index(self, ident: Ident, variant: &VariantDef) -> Option { . variant . .fields . .iter() . .position(|field| self.hygienic_eq(ident, field.ident(self), variant.def_id)) . } . . /// Returns `true` if the impls are the same polarity and the trait either . /// has no items or is annotated `#[marker]` and prevents item overrides. 22,220 ( 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()) 4,444 ( 0.00%) || self.impl_trait_ref(def_id2).map_or(false, |tr| tr.references_error()) . { . return Some(ImplOverlapKind::Permitted { marker: false }); . } . 22,220 ( 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 = { 22,220 ( 0.00%) let is_marker_impl = |def_id: DefId| -> bool { 6,666 ( 0.00%) let trait_ref = self.impl_trait_ref(def_id); 6,666 ( 0.00%) trait_ref.map_or(false, |tr| self.trait_def(tr.def_id).is_marker) 17,776 ( 0.00%) }; 8,888 ( 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 { 8,888 ( 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 . } 17,776 ( 0.00%) } . . /// Returns `ty::VariantDef` if `res` refers to a struct, . /// or variant or their constructors, panics otherwise. 3,150 ( 0.00%) pub fn expect_variant_res(self, res: Res) -> &'tcx VariantDef { 5,400 ( 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), . } 3,600 ( 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. 361,490 ( 0.00%) pub fn get_attrs(self, did: DefId) -> Attributes<'tcx> { 108,447 ( 0.00%) if let Some(did) = did.as_local() { 97,836 ( 0.00%) self.hir().attrs(self.hir().local_def_id_to_hir_id(did)) . } else { . self.item_attrs(did) . } 289,192 ( 0.00%) } . . /// Determines whether an item is annotated with an attribute. 48,252 ( 0.00%) pub fn has_attr(self, did: DefId, attr: Symbol) -> bool { 147,330 ( 0.00%) self.sess.contains_name(&self.get_attrs(did), attr) . } . . /// Determines whether an item is annotated with `doc(hidden)`. 3,731 ( 0.00%) pub fn is_doc_hidden(self, did: DefId) -> bool { 533 ( 0.00%) self.get_attrs(did) . .iter() 82 ( 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))) 4,264 ( 0.00%) } . . /// Returns `true` if this is an `auto trait`. 36,225 ( 0.00%) pub fn trait_is_auto(self, trait_def_id: DefId) -> bool { 5,175 ( 0.00%) self.trait_def(trait_def_id).has_auto_impl 41,400 ( 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`. 54,936 ( 0.00%) pub fn trait_id_of_impl(self, def_id: DefId) -> Option { . self.impl_trait_ref(def_id).map(|tr| tr.def_id) 70,632 ( 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`. 850 ( 0.00%) pub fn impl_of_method(self, def_id: DefId) -> Option { 3,400 ( 0.00%) self.opt_associated_item(def_id).and_then(|trait_item| match trait_item.container { . TraitContainer(_) => None, . ImplContainer(def_id) => Some(def_id), . }) 1,700 ( 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. 40,392 ( 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. 5,049 ( 0.00%) use_name.name == def_name.name 14,817 ( 0.00%) && use_name . .span . .ctxt() . .hygienic_eq(def_name.span.ctxt(), self.expn_that_defined(def_parent_def_id)) 40,392 ( 0.00%) } . 8,631 ( 0.00%) pub fn adjust_ident(self, mut ident: Ident, scope: DefId) -> Ident { 1,918 ( 0.00%) ident.span.normalize_to_macros_2_0_and_adjust(self.expn_that_defined(scope)); 1,918 ( 0.00%) ident 7,672 ( 0.00%) } . 41,724 ( 0.00%) pub fn adjust_ident_and_get_scope( . self, . mut ident: Ident, . scope: DefId, . block: hir::HirId, . ) -> (Ident, DefId) { 4,636 ( 0.00%) let scope = ident . .span . .normalize_to_macros_2_0_and_adjust(self.expn_that_defined(scope)) . .and_then(|actual_expansion| actual_expansion.expn_data().parent_module) 18,544 ( 0.00%) .unwrap_or_else(|| self.parent_module(block).to_def_id()); 27,816 ( 0.00%) (ident, scope) 41,724 ( 0.00%) } . 4,480 ( 0.00%) pub fn is_object_safe(self, key: DefId) -> bool { . self.object_safety_violations(key).is_empty() 5,120 ( 0.00%) } . } . . /// Yields the parent function's `LocalDefId` if `def_id` is an `impl Trait` definition. 6,690 ( 0.00%) pub fn is_impl_trait_defn(tcx: TyCtxt<'_>, def_id: DefId) -> Option { 6,690 ( 0.00%) let def_id = def_id.as_local()?; 7,424 ( 0.00%) if let Node::Item(item) = tcx.hir().get_by_def_id(def_id) { 1,342 ( 0.00%) if let hir::ItemKind::OpaqueTy(ref opaque_ty) = item.kind { 78 ( 0.00%) return match opaque_ty.origin { . hir::OpaqueTyOrigin::FnReturn(parent) | hir::OpaqueTyOrigin::AsyncFn(parent) => { . Some(parent) . } . hir::OpaqueTyOrigin::TyAlias => None, . }; . } . } . None 8,920 ( 0.00%) } . . pub fn int_ty(ity: ast::IntTy) -> IntTy { . match ity { . ast::IntTy::Isize => IntTy::Isize, . ast::IntTy::I8 => IntTy::I8, . ast::IntTy::I16 => IntTy::I16, . ast::IntTy::I32 => IntTy::I32, . ast::IntTy::I64 => IntTy::I64, -- line 2216 ---------------------------------------- -- line 2224 ---------------------------------------- . ast::UintTy::U8 => UintTy::U8, . ast::UintTy::U16 => UintTy::U16, . ast::UintTy::U32 => UintTy::U32, . ast::UintTy::U64 => UintTy::U64, . ast::UintTy::U128 => UintTy::U128, . } . } . 51 ( 0.00%) pub fn float_ty(fty: ast::FloatTy) -> FloatTy { . match fty { . ast::FloatTy::F32 => FloatTy::F32, . ast::FloatTy::F64 => FloatTy::F64, . } 51 ( 0.00%) } . 873 ( 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, . } 873 ( 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 ---------------------------------------- 23,029,899 ( 0.28%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/ptr/mod.rs -------------------------------------------------------------------------------- Ir -- line 180 ---------------------------------------- . /// assert_eq!(v, &[0.into()]); . /// . /// // Ensure that the last item was dropped. . /// assert!(weak.upgrade().is_none()); . /// ``` . #[stable(feature = "drop_in_place", since = "1.8.0")] . #[lang = "drop_in_place"] . #[allow(unconditional_recursion)] 85,013,543 ( 1.02%) pub unsafe fn drop_in_place(to_drop: *mut T) { . // Code here does not matter - this is replaced by the . // real drop glue by the compiler. . . // SAFETY: see comment above . unsafe { drop_in_place(to_drop) } . } . . /// Creates a null raw pointer. -- line 196 ---------------------------------------- -- line 366 ---------------------------------------- . let mut tmp = MaybeUninit::::uninit(); . . // Perform the swap . // SAFETY: the caller must guarantee that `x` and `y` are . // valid for writes and properly aligned. `tmp` cannot be . // overlapping either `x` or `y` because `tmp` was just allocated . // on the stack as a separate allocated object. . unsafe { 134 ( 0.00%) copy_nonoverlapping(x, tmp.as_mut_ptr(), 1); 134 ( 0.00%) copy(y, x, 1); // `x` and `y` may overlap . copy_nonoverlapping(tmp.as_ptr(), y, 1); . } . } . . /// Swaps `count * size_of::()` bytes between the two regions of memory . /// beginning at `x` and `y`. The two regions must *not* overlap. . /// . /// # Safety -- line 383 ---------------------------------------- -- line 448 ---------------------------------------- . return; . } . } . . // Direct swapping, for the cases not going through the block optimization. . // SAFETY: the caller must guarantee that `x` and `y` are valid . // for writes, properly aligned, and non-overlapping. . unsafe { 21 ( 0.00%) let z = read(x); . copy_nonoverlapping(y, x, 1); . write(y, z); . } . } . . #[inline] . #[rustc_const_unstable(feature = "const_swap", issue = "83163")] . const unsafe fn swap_nonoverlapping_bytes(x: *mut u8, y: *mut u8, len: usize) { -- line 464 ---------------------------------------- -- line 693 ---------------------------------------- . let mut tmp = MaybeUninit::::uninit(); . // SAFETY: the caller must guarantee that `src` is valid for reads. . // `src` cannot overlap `tmp` because `tmp` was just allocated on . // the stack as a separate allocated object. . // . // Also, since we just wrote a valid value into `tmp`, it is guaranteed . // to be properly initialized. . unsafe { 1,628,287 ( 0.02%) copy_nonoverlapping(src, tmp.as_mut_ptr(), 1); 9,189,744 ( 0.11%) tmp.assume_init() . } . } . . /// Reads the value from `src` without moving it. This leaves the . /// memory in `src` unchanged. . /// . /// Unlike [`read`], `read_unaligned` works with unaligned pointers. . /// -- line 710 ---------------------------------------- -- line 884 ---------------------------------------- . #[rustc_const_unstable(feature = "const_intrinsic_copy", issue = "80697")] . fn copy_nonoverlapping(src: *const T, dst: *mut T, count: usize); . } . . // SAFETY: the caller must guarantee that `dst` is valid for writes. . // `dst` cannot overlap `src` because the caller has mutable access . // to `dst` while `src` is owned by this function. . unsafe { 130,946,350 ( 1.57%) copy_nonoverlapping(&src as *const T, dst, 1); . intrinsics::forget(src); . } . } . . /// Overwrites a memory location with the given value without reading or . /// dropping the old value. . /// . /// Unlike [`write()`], the pointer may be unaligned. -- line 900 ---------------------------------------- -- line 1206 ---------------------------------------- . if stride == 1 { . // `stride == 1` case can be computed more simply through `-p (mod a)`, but doing so . // inhibits LLVM's ability to select instructions like `lea`. Instead we compute . // . // round_up_to_next_alignment(p, a) - p . // . // which distributes operations around the load-bearing, but pessimizing `and` sufficiently . // for LLVM to be able to utilize the various optimizations it knows about. 6,139 ( 0.00%) return wrapping_sub( 60,086 ( 0.00%) wrapping_add(p as usize, a_minus_one) & wrapping_sub(0, a), . p as usize, . ); . } . . let pmoda = p as usize & a_minus_one; . if pmoda == 0 { . // Already aligned. Yay! . return 0; -- line 1223 ---------------------------------------- -- line 1348 ---------------------------------------- . /// assert!(std::ptr::eq( . /// &wrapper as &dyn Trait as *const dyn Trait as *const u8, . /// &wrapper.member as &dyn Trait as *const dyn Trait as *const u8, . /// )); . /// ``` . #[stable(feature = "ptr_eq", since = "1.17.0")] . #[inline] . pub fn eq(a: *const T, b: *const T) -> bool { 12,875,397 ( 0.15%) a == b . } . . /// Hash a raw pointer. . /// . /// This can be used to hash a `&T` reference (which coerces to `*const T` implicitly) . /// by its address rather than the value it points to . /// (which is what the `Hash for &T` implementation does). . /// -- line 1364 ---------------------------------------- 11,332,046 ( 0.14%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/alloc/src/collections/btree/search.rs -------------------------------------------------------------------------------- Ir -- line 40 ---------------------------------------- . . impl NodeRef { . /// Looks up a given key in a (sub)tree headed by the node, recursively. . /// Returns a `Found` with the handle of the matching KV, if any. Otherwise, . /// returns a `GoDown` with the handle of the leaf edge where the key belongs. . /// . /// The result is meaningful only if the tree is ordered by key, like the tree . /// in a `BTreeMap` is. 2,322,141 ( 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), 127,371 ( 0.00%) GoDown(handle) => match handle.force() { . Leaf(leaf) => return GoDown(leaf), . Internal(internal) => internal.descend(), . }, . } . } 1,230,901 ( 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()); 1,761,559 ( 0.02%) for (offset, k) in unsafe { keys.get_unchecked(start_index..) }.iter().enumerate() { 7,754,736 ( 0.09%) 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 ---------------------------------------- 3,742,260 ( 0.04%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/mod.rs -------------------------------------------------------------------------------- Ir -- line 108 ---------------------------------------- . suppress_errors: bool, . }, . } . . impl RegionckMode { . /// Indicates that the MIR borrowck will repeat these region . /// checks, so we should ignore errors if NLL is (unconditionally) . /// enabled. 1,102 ( 0.00%) pub fn for_item_body(tcx: TyCtxt<'_>) -> Self { . // FIXME(Centril): Once we actually remove `::Migrate` also make . // this always `true` and then proceed to eliminate the dead code. 1,102 ( 0.00%) match tcx.borrowck_mode() { . // If we're on Migrate mode, report AST region errors . BorrowckMode::Migrate => RegionckMode::Erase { suppress_errors: false }, . . // If we're on MIR, don't report AST region errors as they should be reported by NLL . BorrowckMode::Mir => RegionckMode::Erase { suppress_errors: true }, . } 2,204 ( 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> { 141,035 ( 0.00%) fn new() -> InferCtxtInner<'tcx> { 959,038 ( 0.01%) 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(), 84,621 ( 0.00%) region_constraint_storage: Some(RegionConstraintStorage::new()), . region_obligations: vec![], . opaque_types: Default::default(), . opaque_types_vars: Default::default(), . } 169,242 ( 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> { 269,167 ( 0.00%) self.projection_cache.with_log(&mut self.undo_log) . } . . #[inline] . fn type_variables(&mut self) -> type_variable::TypeVariableTable<'_, 'tcx> { 7,348,943 ( 0.09%) 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>, . >, . > { 59,453 ( 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>, . >, . > { 10,448 ( 0.00%) self.const_unification_storage.with_log(&mut self.undo_log) . } . . #[inline] . pub fn unwrap_region_constraints(&mut self) -> RegionConstraintCollector<'_, 'tcx> { 269,903 ( 0.00%) self.region_constraint_storage . .as_mut() . .expect("region constraints already solved") 332,296 ( 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. 458,952 ( 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 521,119 ( 0.01%) #[derive(Clone, Debug)] . pub enum SubregionOrigin<'tcx> { . /// Arose from a subtyping relation 31,383 ( 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. 2,663 ( 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 2,660 ( 0.00%) DataBorrowed(Ty<'tcx>, Span), . . /// (&'a &'b T) where a >= b 2,816 ( 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> { 28,207 ( 0.00%) fn infer_ctxt(self) -> InferCtxtBuilder<'tcx> { 84,621 ( 0.00%) InferCtxtBuilder { tcx: self, defining_use_anchor: None, fresh_typeck_results: None } 28,207 ( 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. 22,896 ( 0.00%) pub fn with_fresh_in_progress_typeck_results(mut self, table_owner: LocalDefId) -> Self { 27,984 ( 0.00%) self.fresh_typeck_results = Some(RefCell::new(ty::TypeckResults::new(table_owner))); 12,720 ( 0.00%) self.with_opaque_type_inference(table_owner) 17,808 ( 0.00%) } . . /// Whenever the `InferCtxt` should be able to handle defining uses of opaque types, . /// you need to call this function. Otherwise the opaque type will be treated opaquely. . /// . /// It is only meant to be called in two places, for typeck . /// (via `with_fresh_in_progress_typeck_results`) and for the inference context used . /// in mir borrowck. 2,322 ( 0.00%) pub fn with_opaque_type_inference(mut self, defining_use_anchor: LocalDefId) -> Self { 1,161 ( 0.00%) self.defining_use_anchor = Some(defining_use_anchor); 7,410 ( 0.00%) self 3,483 ( 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`). 64,315 ( 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| { 96,660 ( 0.00%) let (value, subst) = 6,540 ( 0.00%) infcx.instantiate_canonical_with_fresh_inference_vars(span, canonical); 143,695 ( 0.00%) f(infcx, value, subst) . }) 69,270 ( 0.00%) } . 113,024 ( 0.00%) pub fn enter(&mut self, f: impl for<'a> FnOnce(InferCtxt<'a, 'tcx>) -> R) -> R { 80,898 ( 0.00%) let InferCtxtBuilder { tcx, defining_use_anchor, ref fresh_typeck_results } = *self; . let in_progress_typeck_results = fresh_typeck_results.as_ref(); 1,168,056 ( 0.01%) f(InferCtxt { . tcx, . defining_use_anchor, . in_progress_typeck_results, 28,207 ( 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), 28,207 ( 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), . }) 122,974 ( 0.00%) } . } . . impl<'tcx, T> InferOk<'tcx, T> { . pub fn unit(self) -> InferOk<'tcx, ()> { . InferOk { value: (), obligations: self.obligations } . } . . /// Extracts `value`, registering any obligations into `fulfill_cx`. . pub fn into_value_registering_obligations( . self, . infcx: &InferCtxt<'_, 'tcx>, . fulfill_cx: &mut dyn TraitEngine<'tcx>, . ) -> T { 2,690 ( 0.00%) let InferOk { value, obligations } = self; 10,264 ( 0.00%) for obligation in obligations { 377 ( 0.00%) fulfill_cx.register_predicate_obligation(infcx, obligation); . } . value . } . } . . impl<'tcx> InferOk<'tcx, ()> { 34,358 ( 0.00%) pub fn into_obligations(self) -> PredicateObligations<'tcx> { 137,432 ( 0.00%) self.obligations 34,358 ( 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() 78,948 ( 0.00%) } . 1,866,504 ( 0.02%) pub fn freshen>(&self, t: T) -> T { 2,099,817 ( 0.03%) t.fold_with(&mut self.freshener()) 2,099,817 ( 0.03%) } . . /// 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`. 572 ( 0.00%) pub fn type_var_origin(&'a self, ty: Ty<'tcx>) -> Option { 1,144 ( 0.00%) match *ty.kind() { 282 ( 0.00%) ty::Infer(ty::TyVar(vid)) => { 1,128 ( 0.00%) Some(*self.inner.borrow_mut().type_variables().var_origin(vid)) . } 4 ( 0.00%) _ => None, . } 1,144 ( 0.00%) } . 233,313 ( 0.00%) pub fn freshener<'b>(&'b self) -> TypeFreshener<'b, 'tcx> { . freshen::TypeFreshener::new(self, false) 233,313 ( 0.00%) } . . /// Like `freshener`, but does not replace `'static` regions. 210,103 ( 0.00%) pub fn freshener_keep_static<'b>(&'b self) -> TypeFreshener<'b, 'tcx> { . freshen::TypeFreshener::new(self, true) 210,103 ( 0.00%) } . 4,728 ( 0.00%) pub fn unsolved_variables(&self) -> Vec> { 2,364 ( 0.00%) let mut inner = self.inner.borrow_mut(); 2,364 ( 0.00%) let mut vars: Vec> = inner . .type_variables() . .unsolved_variables() . .into_iter() 573 ( 0.00%) .map(|t| self.tcx.mk_ty_var(t)) . .collect(); . vars.extend( . (0..inner.int_unification_table().len()) . .map(|i| ty::IntVid { index: i as u32 }) 1,474 ( 0.00%) .filter(|&vid| inner.int_unification_table().probe_value(vid).is_none()) 4 ( 0.00%) .map(|v| self.tcx.mk_int_var(v)), . ); . vars.extend( . (0..inner.float_unification_table().len()) . .map(|i| ty::FloatVid { index: i as u32 }) . .filter(|&vid| inner.float_unification_table().probe_value(vid).is_none()) . .map(|v| self.tcx.mk_float_var(v)), . ); . vars 8,274 ( 0.00%) } . 283,634 ( 0.00%) fn combine_fields( . &'a self, . trace: TypeTrace<'tcx>, . param_env: ty::ParamEnv<'tcx>, . ) -> CombineFields<'a, 'tcx> { 1,140,552 ( 0.01%) CombineFields { . infcx: self, 2,851,380 ( 0.03%) trace, . cause: None, . param_env, . obligations: PredicateObligations::new(), . } 283,634 ( 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. 24 ( 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); 26,541 ( 0.00%) let result = func(self); . self.in_snapshot.set(flag); . result 27 ( 0.00%) } . 1,467,992 ( 0.02%) 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(); . 4,403,976 ( 0.05%) 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. 733,996 ( 0.01%) _in_progress_typeck_results: self . .in_progress_typeck_results . .map(|typeck_results| typeck_results.borrow()), . } 2,935,984 ( 0.04%) } . 2,050,774 ( 0.02%) #[instrument(skip(self, snapshot), level = "debug")] . fn rollback_to(&self, cause: &str, snapshot: CombinedSnapshot<'a, 'tcx>) { . let CombinedSnapshot { 186,434 ( 0.00%) undo_snapshot, 186,434 ( 0.00%) region_constraints_snapshot, 186,434 ( 0.00%) universe, 186,434 ( 0.00%) was_in_snapshot, 372,868 ( 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(); 186,434 ( 0.00%) inner.rollback_to(undo_snapshot); . inner.unwrap_region_constraints().rollback_to(region_constraints_snapshot); . } . 8,213,430 ( 0.10%) #[instrument(skip(self, snapshot), level = "debug")] . fn commit_from(&self, snapshot: CombinedSnapshot<'a, 'tcx>) { . let CombinedSnapshot { 547,562 ( 0.01%) undo_snapshot, . region_constraints_snapshot: _, . universe: _, 547,562 ( 0.01%) was_in_snapshot, 1,095,124 ( 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. 416,288 ( 0.00%) #[instrument(skip(self, f), level = "debug")] 516,725 ( 0.01%) pub fn commit_unconditionally(&self, f: F) -> R . where . F: FnOnce(&CombinedSnapshot<'a, 'tcx>) -> R, . { 46,975 ( 0.00%) let snapshot = self.start_snapshot(); 161,984 ( 0.00%) let r = f(&snapshot); 328,825 ( 0.00%) self.commit_from(snapshot); 308,439 ( 0.00%) r . } . . /// Execute `f` and commit the bindings if closure `f` returns `Ok(_)`. 4,619,912 ( 0.06%) #[instrument(skip(self, f), level = "debug")] 5,666,945 ( 0.07%) pub fn commit_if_ok(&self, f: F) -> Result . where . F: FnOnce(&CombinedSnapshot<'a, 'tcx>) -> Result, . { 651,077 ( 0.01%) let snapshot = self.start_snapshot(); 2,469,875 ( 0.03%) let r = f(&snapshot); . debug!("commit_if_ok() -- r.is_ok() = {}", r.is_ok()); 405,732 ( 0.00%) match r { . Ok(_) => { 3,767,177 ( 0.05%) self.commit_from(snapshot); . } . Err(_) => { 884,577 ( 0.01%) self.rollback_to("commit_if_ok -- error", snapshot); . } . } 3,216,311 ( 0.04%) r . } . . /// Execute `f` then unroll any bindings it creates. 572,394 ( 0.01%) #[instrument(skip(self, f), level = "debug")] 655,287 ( 0.01%) pub fn probe(&self, f: F) -> R . where . F: FnOnce(&CombinedSnapshot<'a, 'tcx>) -> R, . { 206,235 ( 0.00%) let snapshot = self.start_snapshot(); 263,759 ( 0.00%) let r = f(&snapshot); 889,568 ( 0.01%) self.rollback_to("probe", snapshot); 107,226 ( 0.00%) r . } . . /// If `should_skip` is true, then execute `f` then unroll any bindings it creates. 5,715 ( 0.00%) #[instrument(skip(self, f), level = "debug")] 7,620 ( 0.00%) pub fn probe_maybe_skip_leak_check(&self, should_skip: bool, f: F) -> R . where . F: FnOnce(&CombinedSnapshot<'a, 'tcx>) -> R, . { 1,270 ( 0.00%) let snapshot = self.start_snapshot(); 635 ( 0.00%) let was_skip_leak_check = self.skip_leak_check.get(); 1,270 ( 0.00%) if should_skip { . self.skip_leak_check.set(true); . } 2,540 ( 0.00%) let r = f(&snapshot); 5,715 ( 0.00%) self.rollback_to("probe", snapshot); . self.skip_leak_check.set(was_skip_leak_check); 7,620 ( 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 64,274 ( 0.00%) pub fn region_constraints_added_in_snapshot( . &self, . snapshot: &CombinedSnapshot<'a, 'tcx>, . ) -> Option { 128,548 ( 0.00%) self.inner . .borrow_mut() . .unwrap_region_constraints() . .region_constraints_added_in_snapshot(&snapshot.undo_snapshot) 96,411 ( 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); . } . 648 ( 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. . }) . }) 486 ( 0.00%) } . 18,012 ( 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. . }) . }) 13,509 ( 0.00%) } . 112,170 ( 0.00%) #[instrument(skip(self), level = "debug")] . pub fn sub_regions( . &self, . origin: SubregionOrigin<'tcx>, . a: ty::Region<'tcx>, . b: ty::Region<'tcx>, . ) { 100,953 ( 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`. 25 ( 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>>, . ) { 25 ( 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.) 246 ( 0.00%) pub fn coerce_predicate( . &self, . cause: &ObligationCause<'tcx>, . param_env: ty::ParamEnv<'tcx>, . predicate: ty::PolyCoercePredicate<'tcx>, . ) -> Option> { 164 ( 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, . }); 410 ( 0.00%) self.subtype_predicate(cause, param_env, subtype_predicate) 328 ( 0.00%) } . 32,052 ( 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. 2,671 ( 0.00%) let r_a = self.shallow_resolve(predicate.skip_binder().a); 2,671 ( 0.00%) let r_b = self.shallow_resolve(predicate.skip_binder().b); 17,528 ( 0.00%) match (r_a.kind(), r_b.kind()) { 3,604 ( 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); 3,604 ( 0.00%) return None; . } . _ => {} . } . . Some(self.commit_if_ok(|_snapshot| { 869 ( 0.00%) let ty::SubtypePredicate { a_is_expected, a, b } = . self.replace_bound_vars_with_placeholders(predicate); . 1,738 ( 0.00%) let ok = self.at(cause, param_env).sub_exp(a_is_expected, a, b)?; . . Ok(ok.unit()) . })) 24,039 ( 0.00%) } . 25,980 ( 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) . }); 21,650 ( 0.00%) self.sub_regions(origin, r_b, r_a); // `b : a` ==> `a <= b` . Ok(()) . }) 17,320 ( 0.00%) } . . /// Number of type variables created so far. 80 ( 0.00%) pub fn num_ty_vars(&self) -> usize { . self.inner.borrow_mut().type_variables().num_vars() 160 ( 0.00%) } . 116,384 ( 0.00%) pub fn next_ty_var_id(&self, origin: TypeVariableOrigin) -> TyVid { 581,920 ( 0.01%) self.inner.borrow_mut().type_variables().new_var(self.universe(), origin) 174,576 ( 0.00%) } . 34,804 ( 0.00%) pub fn next_ty_var(&self, origin: TypeVariableOrigin) -> Ty<'tcx> { 366,556 ( 0.00%) self.tcx.mk_ty_var(self.next_ty_var_id(origin)) 52,206 ( 0.00%) } . 4,304 ( 0.00%) pub fn next_ty_var_in_universe( . &self, . origin: TypeVariableOrigin, . universe: ty::UniverseIndex, . ) -> Ty<'tcx> { 23,672 ( 0.00%) let vid = self.inner.borrow_mut().type_variables().new_var(universe, origin); 2,152 ( 0.00%) self.tcx.mk_ty_var(vid) 6,456 ( 0.00%) } . . pub fn next_const_var( . &self, . ty: Ty<'tcx>, . origin: ConstVariableOrigin, . ) -> &'tcx ty::Const<'tcx> { . self.tcx.mk_const_var(self.next_const_var_id(origin), ty) . } -- line 1074 ---------------------------------------- -- line 1090 ---------------------------------------- . pub fn next_const_var_id(&self, origin: ConstVariableOrigin) -> ConstVid<'tcx> { . self.inner.borrow_mut().const_unification_table().new_key(ConstVarValue { . origin, . val: ConstVariableValue::Unknown { universe: self.universe() }, . }) . } . . fn next_int_var_id(&self) -> IntVid { 2,435 ( 0.00%) self.inner.borrow_mut().int_unification_table().new_key(None) . } . 1,461 ( 0.00%) pub fn next_int_var(&self) -> Ty<'tcx> { . self.tcx.mk_int_var(self.next_int_var_id()) 1,948 ( 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. 22,872 ( 0.00%) pub fn next_region_var(&self, origin: RegionVariableOrigin) -> ty::Region<'tcx> { 591,314 ( 0.01%) self.next_region_var_in_universe(origin, self.universe()) 45,744 ( 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. 243,404 ( 0.00%) pub fn next_region_var_in_universe( . &self, . origin: RegionVariableOrigin, . universe: ty::UniverseIndex, . ) -> ty::Region<'tcx> { . let region_var = 1,582,126 ( 0.02%) self.inner.borrow_mut().unwrap_region_constraints().new_region_var(universe, origin); 608,510 ( 0.01%) self.tcx.mk_region(ty::ReVar(region_var)) 365,106 ( 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. 128,284 ( 0.00%) pub fn universe_of_region(&self, r: ty::Region<'tcx>) -> ty::UniverseIndex { . self.inner.borrow_mut().unwrap_region_constraints().universe(r) 192,426 ( 0.00%) } . . /// Number of region variables created so far. 9,376 ( 0.00%) pub fn num_region_vars(&self) -> usize { . self.inner.borrow_mut().unwrap_region_constraints().num_region_vars() 14,064 ( 0.00%) } . . /// Just a convenient wrapper of `next_region_var` for using during NLL. 42,856 ( 0.00%) pub fn next_nll_region_var(&self, origin: NllRegionVariableOrigin) -> ty::Region<'tcx> { . self.next_region_var(RegionVariableOrigin::Nll(origin)) 85,712 ( 0.00%) } . . /// Just a convenient wrapper of `next_region_var` for using during NLL. 3,110 ( 0.00%) pub fn next_nll_region_var_in_universe( . &self, . origin: NllRegionVariableOrigin, . universe: ty::UniverseIndex, . ) -> ty::Region<'tcx> { 23,110 ( 0.00%) self.next_region_var_in_universe(RegionVariableOrigin::Nll(origin), universe) 6,220 ( 0.00%) } . 1,023,520 ( 0.01%) pub fn var_for_def(&self, span: Span, param: &ty::GenericParamDef) -> GenericArg<'tcx> { 579,440 ( 0.01%) match param.kind { . GenericParamDefKind::Lifetime => { . // Create a region inference variable for the given . // region parameter definition. 30,130 ( 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)`. 389,320 ( 0.00%) let ty_var_id = self.inner.borrow_mut().type_variables().new_var( . self.universe(), 486,650 ( 0.01%) TypeVariableOrigin { . kind: TypeVariableOriginKind::TypeParameterDefinition( 97,330 ( 0.00%) param.name, 97,330 ( 0.00%) Some(param.def_id), . ), . span, . }, . ); . 97,330 ( 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 = 5,280 ( 0.00%) self.inner.borrow_mut().const_unification_table().new_key(ConstVarValue { . origin, . val: ConstVariableValue::Unknown { universe: self.universe() }, . }); 480 ( 0.00%) self.tcx.mk_const_var(const_var_id, self.tcx.type_of(param.def_id)).into() . } . } 3,840 ( 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. 182,751 ( 0.00%) pub fn fresh_substs_for_item(&self, span: Span, def_id: DefId) -> SubstsRef<'tcx> { 971,182 ( 0.01%) InternalSubsts::for_item(self.tcx, def_id, |param, _| self.var_for_def(span, param)) 121,834 ( 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). 2,812 ( 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() . ); . 57,914 ( 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() 4,218 ( 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`. 56,084 ( 0.00%) pub fn resolve_regions( . &self, . region_context: DefId, . outlives_env: &OutlivesEnvironment<'tcx>, . mode: RegionckMode, . ) -> Vec> { 152,228 ( 0.00%) let (var_infos, data) = { . let mut inner = self.inner.borrow_mut(); . let inner = &mut *inner; 8,012 ( 0.00%) assert!( 24,036 ( 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() 8,012 ( 0.00%) }; . . let region_rels = 8,012 ( 0.00%) &RegionRelations::new(self.tcx, region_context, outlives_env.free_region_map()); . 72,108 ( 0.00%) let (lexical_region_resolutions, errors) = 192,288 ( 0.00%) lexical_region_resolve::resolve(region_rels, var_infos, data, mode); . 32,048 ( 0.00%) let old_value = self.lexical_region_resolutions.replace(Some(lexical_region_resolutions)); 8,012 ( 0.00%) assert!(old_value.is_none()); . . errors 72,108 ( 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`. 80,120 ( 0.00%) pub fn resolve_regions_and_report_errors( . &self, . region_context: DefId, . outlives_env: &OutlivesEnvironment<'tcx>, . mode: RegionckMode, . ) { 16,024 ( 0.00%) let errors = self.resolve_regions(region_context, outlives_env, mode); . 24,036 ( 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. 16,024 ( 0.00%) self.report_region_errors(&errors); . } 40,060 ( 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. 33 ( 0.00%) pub fn take_and_reset_region_constraints(&self) -> RegionConstraintData<'tcx> { 11 ( 0.00%) assert!( . self.inner.borrow().region_obligations.is_empty(), . "region_obligations not empty: {:#?}", . self.inner.borrow().region_obligations . ); . 44 ( 0.00%) self.inner.borrow_mut().unwrap_region_constraints().take_and_reset_data() 55 ( 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(); 33,536 ( 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. 5,790 ( 0.00%) pub fn take_region_var_origins(&self) -> VarInfos { . let mut inner = self.inner.borrow_mut(); 22,002 ( 0.00%) let (var_infos, data) = inner . .region_constraint_storage . .take() . .expect("regions already resolved") . .with_log(&mut inner.undo_log) 1,158 ( 0.00%) .into_infos_and_data(); 1,158 ( 0.00%) assert!(data.is_empty()); . var_infos 9,264 ( 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)`. 23,790 ( 0.00%) pub fn probe_ty_var(&self, vid: TyVid) -> Result, ty::UniverseIndex> { . use self::type_variable::TypeVariableValue; . 71,370 ( 0.00%) match self.inner.borrow_mut().type_variables().probe(vid) { . TypeVariableValue::Known { value } => Ok(value), . TypeVariableValue::Unknown { universe } => Err(universe), . } 83,265 ( 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>, . { 679,167 ( 0.01%) value.fold_with(&mut ShallowResolver { infcx: self }) . } . 106,882 ( 0.00%) pub fn root_var(&self, var: ty::TyVid) -> ty::TyVid { . self.inner.borrow_mut().type_variables().root_var(var) 160,323 ( 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. 13,700 ( 0.00%) pub fn resolve_vars_if_possible(&self, value: T) -> T . where . T: TypeFoldable<'tcx>, . { 1,190,572 ( 0.01%) if !value.needs_infer() { 420,422 ( 0.01%) return value; // Avoid duplicated subst-folding. . } 1,348,432 ( 0.02%) let mut r = resolve::OpportunisticVarResolver::new(self); 990,235 ( 0.01%) value.fold_with(&mut r) 12,680 ( 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 -- line 1415 ---------------------------------------- -- 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) . } . 41,013 ( 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 = 252,829 ( 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 }, . ) . }; 2,228,200 ( 0.03%) self.tcx.replace_bound_vars(value, fld_r, fld_t, fld_c) 27,342 ( 0.00%) } . . /// See the [`region_constraints::RegionConstraintCollector::verify_generic_bound`] method. 20,976 ( 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); . 7,866 ( 0.00%) self.inner . .borrow_mut() . .unwrap_region_constraints() 44,574 ( 0.00%) .verify_generic_bound(origin, kind, a, bound); 18,354 ( 0.00%) } . . /// Obtains the latest type of the given closure; this may be a . /// closure in the current function, in which case its . /// `ClosureKind` may not yet be known. 2,804 ( 0.00%) pub fn closure_kind(&self, closure_substs: SubstsRef<'tcx>) -> Option { 5,608 ( 0.00%) let closure_kind_ty = closure_substs.as_closure().kind_ty(); . let closure_kind_ty = self.shallow_resolve(closure_kind_ty); 4,206 ( 0.00%) closure_kind_ty.to_opt_closure_kind() . } . . /// Clears the selection, evaluation, and projection caches. This is useful when . /// repeatedly attempting to select an `Obligation` while changing only . /// its `ParamEnv`, since `FulfillmentContext` doesn't use probing. . pub fn clear_caches(&self) { . self.selection_cache.clear(); . self.evaluation_cache.clear(); . self.inner.borrow_mut().projection_cache().clear(); . } . . pub fn universe(&self) -> ty::UniverseIndex { 1,598,149 ( 0.02%) self.universe.get() 475,891 ( 0.01%) } . . /// Creates and return a fresh universe that extends all previous . /// universes. Updates `self.universe` to that new universe. 3,210 ( 0.00%) pub fn create_next_universe(&self) -> ty::UniverseIndex { 4,760 ( 0.00%) let u = self.universe.get().next_universe(); . self.universe.set(u); . u 3,210 ( 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`. 18,963,872 ( 0.23%) fn shallow_resolve_ty(&self, typ: Ty<'tcx>) -> Ty<'tcx> { 10,431,528 ( 0.12%) 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`. 6,210,336 ( 0.07%) let known = self.inner.borrow_mut().type_variables().probe(v).known(); . known.map_or(typ, |t| self.shallow_resolve_ty(t)) . } . 45,044 ( 0.00%) ty::Infer(ty::IntVar(v)) => self . .inner . .borrow_mut() . .int_unification_table() . .probe_value(v) 11,700 ( 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, . } 21,334,356 ( 0.26%) } . . /// `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))`. 21,278,011 ( 0.25%) 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(_)`. 31,302 ( 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`). 134,612 ( 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, . } 134,612 ( 0.00%) } . . /// Tries to extract an inference variable from a type, returns `None` . /// for types other than `ty::Infer(_)` (or `InferTy::Fresh*`). 3,558 ( 0.00%) pub fn maybe_from_ty(ty: Ty<'tcx>) -> Option { 1,241,939 ( 0.01%) match *ty.kind() { 275,054 ( 0.00%) ty::Infer(ty::TyVar(v)) => Some(TyOrConstInferVar::Ty(v)), 1,164 ( 0.00%) ty::Infer(ty::IntVar(v)) => Some(TyOrConstInferVar::TyInt(v)), . ty::Infer(ty::FloatVar(v)) => Some(TyOrConstInferVar::TyFloat(v)), . _ => None, . } 3,558 ( 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 1751 ---------------------------------------- . } . . struct ShallowResolver<'a, 'tcx> { . infcx: &'a InferCtxt<'a, 'tcx>, . } . . impl<'a, 'tcx> TypeFolder<'tcx> for ShallowResolver<'a, 'tcx> { . fn tcx<'b>(&'b self) -> TyCtxt<'tcx> { 10 ( 0.00%) self.infcx.tcx 5 ( 0.00%) } . . fn fold_ty(&mut self, ty: Ty<'tcx>) -> Ty<'tcx> { 3,347,822 ( 0.04%) self.infcx.shallow_resolve_ty(ty) . } . 8,216 ( 0.00%) fn fold_const(&mut self, ct: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> { 5,882 ( 0.00%) if let ty::Const { val: ty::ConstKind::Infer(InferConst::Var(vid)), .. } = ct { 4,435 ( 0.00%) self.infcx . .inner . .borrow_mut() . .const_unification_table() 2,661 ( 0.00%) .probe_value(*vid) . .val . .known() . .unwrap_or(ct) . } else { . ct . } 10,270 ( 0.00%) } . } . . impl<'tcx> TypeTrace<'tcx> { . pub fn span(&self) -> Span { 252 ( 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 { 630 ( 0.00%) match *self { 126 ( 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, . { 46,239 ( 0.00%) match *cause.code() { 9,036 ( 0.00%) traits::ObligationCauseCode::ReferenceOutlivesReferent(ref_type) => { 45,180 ( 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 ---------------------------------------- 27,388,091 ( 0.33%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/fold.rs -------------------------------------------------------------------------------- Ir -- line 46 ---------------------------------------- . /// . /// To implement this conveniently, use the derive macro located in `rustc_macros`. . pub trait TypeFoldable<'tcx>: fmt::Debug + Clone { . /// Consumers may find this more convenient to use with infallible folders than . /// [`try_super_fold_with`][`TypeFoldable::try_super_fold_with`], to which the . /// provided default definition delegates. Implementors **should not** override . /// this provided default definition, to ensure that the two methods are coherent . /// (provide a definition of `try_super_fold_with` instead). 29,784,261 ( 0.36%) fn super_fold_with>(self, folder: &mut F) -> Self { 1,034,802 ( 0.01%) self.try_super_fold_with(folder).into_ok() 30,743,901 ( 0.37%) } . /// Consumers may find this more convenient to use with infallible folders than . /// [`try_fold_with`][`TypeFoldable::try_fold_with`], to which the provided . /// default definition delegates. Implementors **should not** override this . /// provided default definition, to ensure that the two methods are coherent . /// (provide a definition of `try_fold_with` instead). 788,877 ( 0.01%) fn fold_with>(self, folder: &mut F) -> Self { 291,389 ( 0.00%) self.try_fold_with(folder).into_ok() 723,961 ( 0.01%) } . . fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result; . 40,699,315 ( 0.49%) fn try_fold_with>(self, folder: &mut F) -> Result { 10,318,627 ( 0.12%) self.try_super_fold_with(folder) 39,130,246 ( 0.47%) } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow; 1,276,737 ( 0.02%) fn visit_with>(&self, visitor: &mut V) -> ControlFlow { 1,437,589 ( 0.02%) self.super_visit_with(visitor) 770,543 ( 0.01%) } . . /// Returns `true` if `self` has any late-bound regions that are either . /// bound by `binder` or bound by some binder outside of `binder`. . /// If `binder` is `ty::INNERMOST`, this indicates whether . /// there are any late-bound regions that appear free. . fn has_vars_bound_at_or_above(&self, binder: ty::DebruijnIndex) -> bool { 1,713,244 ( 0.02%) self.visit_with(&mut HasEscapingVarsVisitor { outer_index: binder }).is_break() . } . . /// Returns `true` if this `self` has any regions that escape `binder` (and . /// hence are not bound by it). . fn has_vars_bound_above(&self, binder: ty::DebruijnIndex) -> bool { 150 ( 0.00%) self.has_vars_bound_at_or_above(binder.shifted_in(1)) . } . 3,821,635 ( 0.05%) fn has_escaping_bound_vars(&self) -> bool { 600,207 ( 0.01%) self.has_vars_bound_at_or_above(ty::INNERMOST) 3,827,105 ( 0.05%) } . 151,909 ( 0.00%) #[instrument(level = "trace")] . fn has_type_flags(&self, flags: TypeFlags) -> bool { 218,009 ( 0.00%) self.visit_with(&mut HasTypeFlagsVisitor { flags }).break_value() == Some(FoundFlags) . } . fn has_projections(&self) -> bool { 16,924 ( 0.00%) self.has_type_flags(TypeFlags::HAS_PROJECTION) . } . fn has_opaque_types(&self) -> bool { . self.has_type_flags(TypeFlags::HAS_TY_OPAQUE) . } 50,504 ( 0.00%) fn references_error(&self) -> bool { . self.has_type_flags(TypeFlags::HAS_ERROR) 50,504 ( 0.00%) } . fn has_param_types_or_consts(&self) -> bool { 8,919 ( 0.00%) self.has_type_flags(TypeFlags::HAS_TY_PARAM | TypeFlags::HAS_CT_PARAM) . } . fn has_infer_regions(&self) -> bool { . self.has_type_flags(TypeFlags::HAS_RE_INFER) . } . fn has_infer_types(&self) -> bool { . self.has_type_flags(TypeFlags::HAS_TY_INFER) . } . fn has_infer_types_or_consts(&self) -> bool { 1,305,396 ( 0.02%) self.has_type_flags(TypeFlags::HAS_TY_INFER | TypeFlags::HAS_CT_INFER) . } 95,723 ( 0.00%) fn needs_infer(&self) -> bool { 942,752 ( 0.01%) self.has_type_flags(TypeFlags::NEEDS_INFER) 96,466 ( 0.00%) } . fn has_placeholders(&self) -> bool { . self.has_type_flags( . TypeFlags::HAS_RE_PLACEHOLDER . | TypeFlags::HAS_TY_PLACEHOLDER . | TypeFlags::HAS_CT_PLACEHOLDER, . ) . } . fn needs_subst(&self) -> bool { -- line 133 ---------------------------------------- -- line 146 ---------------------------------------- . /// True if there are any un-erased free regions. . fn has_erasable_regions(&self) -> bool { . self.has_type_flags(TypeFlags::HAS_FREE_REGIONS) . } . . /// Indicates whether this value references only 'global' . /// generic parameters that are the same regardless of what fn we are . /// in. This is used for caching. 2,135 ( 0.00%) fn is_global(&self) -> bool { 566,430 ( 0.01%) !self.has_type_flags(TypeFlags::HAS_FREE_LOCAL_NAMES) 2,562 ( 0.00%) } . . /// True if there are any late-bound regions . fn has_late_bound_regions(&self) -> bool { . self.has_type_flags(TypeFlags::HAS_RE_LATE_BOUND) . } . . /// Indicates whether this value still has parameters/placeholders/inference variables . /// which could be replaced later, in a way that would change the results of `impl` -- line 164 ---------------------------------------- -- line 194 ---------------------------------------- . . fn tcx<'a>(&'a self) -> TyCtxt<'tcx>; . . fn fold_binder(&mut self, t: Binder<'tcx, T>) -> Binder<'tcx, T> . where . T: TypeFoldable<'tcx>, . Self: TypeFolder<'tcx, Error = !>, . { 8,613,020 ( 0.10%) t.super_fold_with(self) . } . . fn fold_ty(&mut self, t: Ty<'tcx>) -> Ty<'tcx> . where . Self: TypeFolder<'tcx, Error = !>, . { 352,005 ( 0.00%) t.super_fold_with(self) . } . . fn fold_region(&mut self, r: ty::Region<'tcx>) -> ty::Region<'tcx> . where . Self: TypeFolder<'tcx, Error = !>, . { . r.super_fold_with(self) . } . . fn fold_const(&mut self, c: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> . where . Self: TypeFolder<'tcx, Error = !>, . { 21,498 ( 0.00%) c.super_fold_with(self) . } . . fn fold_predicate(&mut self, p: ty::Predicate<'tcx>) -> ty::Predicate<'tcx> . where . Self: TypeFolder<'tcx, Error = !>, . { 86,288 ( 0.00%) p.super_fold_with(self) . } . . fn fold_mir_const(&mut self, c: mir::ConstantKind<'tcx>) -> mir::ConstantKind<'tcx> . where . Self: TypeFolder<'tcx, Error = !>, . { . bug!("most type folders should not be folding MIR datastructures: {:?}", c) . } -- line 238 ---------------------------------------- -- line 247 ---------------------------------------- . /// A blanket implementation of this trait (that defers to the relevant . /// method of [`TypeFolder`]) is provided for all infallible folders in . /// order to ensure the two APIs are coherent. . pub trait FallibleTypeFolder<'tcx>: TypeFolder<'tcx> { . fn try_fold_binder(&mut self, t: Binder<'tcx, T>) -> Result, Self::Error> . where . T: TypeFoldable<'tcx>, . { 85,112 ( 0.00%) t.try_super_fold_with(self) . } . . fn try_fold_ty(&mut self, t: Ty<'tcx>) -> Result, Self::Error> { . t.try_super_fold_with(self) . } . . fn try_fold_region(&mut self, r: ty::Region<'tcx>) -> Result, Self::Error> { . r.try_super_fold_with(self) -- line 263 ---------------------------------------- -- line 269 ---------------------------------------- . ) -> Result<&'tcx ty::Const<'tcx>, Self::Error> { . c.try_super_fold_with(self) . } . . fn try_fold_predicate( . &mut self, . p: ty::Predicate<'tcx>, . ) -> Result, Self::Error> { 19,863 ( 0.00%) p.try_super_fold_with(self) . } . . fn try_fold_mir_const( . &mut self, . c: mir::ConstantKind<'tcx>, . ) -> Result, Self::Error> { . bug!("most type folders should not be folding MIR datastructures: {:?}", c) . } -- line 285 ---------------------------------------- -- line 286 ---------------------------------------- . } . . // Blanket implementation of fallible trait for infallible folders . // delegates to infallible methods to prevent incoherence . impl<'tcx, F> FallibleTypeFolder<'tcx> for F . where . F: TypeFolder<'tcx, Error = !>, . { 842,070 ( 0.01%) fn try_fold_binder(&mut self, t: Binder<'tcx, T>) -> Result, Self::Error> . where . T: TypeFoldable<'tcx>, . { 1,649,808 ( 0.02%) Ok(self.fold_binder(t)) 1,257,707 ( 0.02%) } . 846,842 ( 0.01%) fn try_fold_ty(&mut self, t: Ty<'tcx>) -> Result, Self::Error> { 12,647,652 ( 0.15%) Ok(self.fold_ty(t)) 1,122,388 ( 0.01%) } . 55,224 ( 0.00%) fn try_fold_region(&mut self, r: ty::Region<'tcx>) -> Result, Self::Error> { 770,303 ( 0.01%) Ok(self.fold_region(r)) 55,224 ( 0.00%) } . 27,625 ( 0.00%) fn try_fold_const( . &mut self, . c: &'tcx ty::Const<'tcx>, . ) -> Result<&'tcx ty::Const<'tcx>, Self::Error> { 168,920 ( 0.00%) Ok(self.fold_const(c)) 27,370 ( 0.00%) } . . fn try_fold_predicate( . &mut self, . p: ty::Predicate<'tcx>, . ) -> Result, Self::Error> { . Ok(self.fold_predicate(p)) . } . -- line 322 ---------------------------------------- -- line 330 ---------------------------------------- . . pub trait TypeVisitor<'tcx>: Sized { . type BreakTy = !; . . fn visit_binder>( . &mut self, . t: &Binder<'tcx, T>, . ) -> ControlFlow { 2,532 ( 0.00%) t.super_visit_with(self) . } . . fn visit_ty(&mut self, t: Ty<'tcx>) -> ControlFlow { 83,189 ( 0.00%) t.super_visit_with(self) . } . . fn visit_region(&mut self, r: ty::Region<'tcx>) -> ControlFlow { . r.super_visit_with(self) . } . 16 ( 0.00%) fn visit_const(&mut self, c: &'tcx ty::Const<'tcx>) -> ControlFlow { 15 ( 0.00%) c.super_visit_with(self) 14 ( 0.00%) } . . fn visit_unevaluated_const(&mut self, uv: ty::Unevaluated<'tcx>) -> ControlFlow { . uv.super_visit_with(self) . } . . fn visit_predicate(&mut self, p: ty::Predicate<'tcx>) -> ControlFlow { . p.super_visit_with(self) . } -- line 359 ---------------------------------------- -- line 376 ---------------------------------------- . . impl<'tcx, F, G, H> TypeFolder<'tcx> for BottomUpFolder<'tcx, F, G, H> . where . F: FnMut(Ty<'tcx>) -> Ty<'tcx>, . G: FnMut(ty::Region<'tcx>) -> ty::Region<'tcx>, . H: FnMut(&'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx>, . { . fn tcx<'b>(&'b self) -> TyCtxt<'tcx> { 108 ( 0.00%) self.tcx . } . . fn fold_ty(&mut self, ty: Ty<'tcx>) -> Ty<'tcx> { 8,290 ( 0.00%) let t = ty.super_fold_with(self); . (self.ty_op)(t) . } . . fn fold_region(&mut self, r: ty::Region<'tcx>) -> ty::Region<'tcx> { . let r = r.super_fold_with(self); . (self.lt_op)(r) . } . . fn fold_const(&mut self, ct: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> { 23 ( 0.00%) let ct = ct.super_fold_with(self); . (self.ct_op)(ct) . } . } . . /////////////////////////////////////////////////////////////////////////// . // Region folder . . impl<'tcx> TyCtxt<'tcx> { -- line 406 ---------------------------------------- -- line 415 ---------------------------------------- . ) -> T . where . T: TypeFoldable<'tcx>, . { . value.fold_with(&mut RegionFolder::new(self, skipped_regions, &mut f)) . } . . /// Invoke `callback` on every region appearing free in `value`. 6,457 ( 0.00%) pub fn for_each_free_region( . self, . value: &impl TypeFoldable<'tcx>, . mut callback: impl FnMut(ty::Region<'tcx>), . ) { . self.any_free_region_meets(value, |r| { 77,632 ( 0.00%) callback(r); . false . }); 5,573 ( 0.00%) } . . /// Returns `true` if `callback` returns true for every region appearing free in `value`. . pub fn all_free_regions_meet( . self, . value: &impl TypeFoldable<'tcx>, . mut callback: impl FnMut(ty::Region<'tcx>) -> bool, . ) -> bool { 14,073 ( 0.00%) !self.any_free_region_meets(value, |r| !callback(r)) . } . . /// Returns `true` if `callback` returns true for some region appearing free in `value`. . pub fn any_free_region_meets( . self, . value: &impl TypeFoldable<'tcx>, . callback: impl FnMut(ty::Region<'tcx>) -> bool, . ) -> bool { -- line 448 ---------------------------------------- -- line 473 ---------------------------------------- . F: FnMut(ty::Region<'tcx>) -> bool, . { . type BreakTy = (); . . fn visit_binder>( . &mut self, . t: &Binder<'tcx, T>, . ) -> ControlFlow { 8,828 ( 0.00%) self.outer_index.shift_in(1); 2,704 ( 0.00%) let result = t.as_ref().skip_binder().visit_with(self); 2,028 ( 0.00%) self.outer_index.shift_out(1); . result . } . 70,460 ( 0.00%) fn visit_region(&mut self, r: ty::Region<'tcx>) -> ControlFlow { 121,208 ( 0.00%) match *r { 1,752 ( 0.00%) ty::ReLateBound(debruijn, _) if debruijn < self.outer_index => { . ControlFlow::CONTINUE . } . _ => { . if (self.callback)(r) { . ControlFlow::BREAK . } else { . ControlFlow::CONTINUE . } . } . } 98,644 ( 0.00%) } . . fn visit_ty(&mut self, ty: Ty<'tcx>) -> ControlFlow { . // We're only interested in types involving regions 96,236 ( 0.00%) if ty.flags().intersects(TypeFlags::HAS_FREE_REGIONS) { 107,772 ( 0.00%) ty.super_visit_with(self) . } else { . ControlFlow::CONTINUE . } . } . } . 164,635 ( 0.00%) value.visit_with(&mut RegionVisitor { outer_index: ty::INNERMOST, callback }).is_break() . } . } . . /// Folds over the substructure of a type, visiting its component . /// types and all regions that occur *free* within it. . /// . /// That is, `Ty` can contain function or method types that bind . /// regions at the call site (`ReLateBound`), and occurrences of -- line 520 ---------------------------------------- -- line 540 ---------------------------------------- . . impl<'a, 'tcx> RegionFolder<'a, 'tcx> { . #[inline] . pub fn new( . tcx: TyCtxt<'tcx>, . skipped_regions: &'a mut bool, . fold_region_fn: &'a mut dyn FnMut(ty::Region<'tcx>, ty::DebruijnIndex) -> ty::Region<'tcx>, . ) -> RegionFolder<'a, 'tcx> { 476,568 ( 0.01%) RegionFolder { tcx, skipped_regions, current_index: ty::INNERMOST, fold_region_fn } . } . } . . impl<'a, 'tcx> TypeFolder<'tcx> for RegionFolder<'a, 'tcx> { . fn tcx<'b>(&'b self) -> TyCtxt<'tcx> { 421,863 ( 0.01%) self.tcx 421,863 ( 0.01%) } . . fn fold_binder>( . &mut self, . t: ty::Binder<'tcx, T>, . ) -> ty::Binder<'tcx, T> { 12,529 ( 0.00%) self.current_index.shift_in(1); 9,464 ( 0.00%) let t = t.super_fold_with(self); 10,743 ( 0.00%) self.current_index.shift_out(1); . t . } . 5,644 ( 0.00%) #[instrument(skip(self), level = "debug")] . fn fold_region(&mut self, r: ty::Region<'tcx>) -> ty::Region<'tcx> { 86,266 ( 0.00%) match *r { 5,644 ( 0.00%) ty::ReLateBound(debruijn, _) if debruijn < self.current_index => { . debug!(?self.current_index, "skipped bound region"); 5,644 ( 0.00%) *self.skipped_regions = true; . r . } . _ => { . debug!(?self.current_index, "folding free region"); 241,866 ( 0.00%) (self.fold_region_fn)(r, self.current_index) . } . } . } . } . . /////////////////////////////////////////////////////////////////////////// . // Bound vars replacer . -- line 585 ---------------------------------------- -- line 592 ---------------------------------------- . current_index: ty::DebruijnIndex, . . fld_r: Option<&'a mut (dyn FnMut(ty::BoundRegion) -> ty::Region<'tcx> + 'a)>, . fld_t: Option<&'a mut (dyn FnMut(ty::BoundTy) -> Ty<'tcx> + 'a)>, . fld_c: Option<&'a mut (dyn FnMut(ty::BoundVar, Ty<'tcx>) -> &'tcx ty::Const<'tcx> + 'a)>, . } . . impl<'a, 'tcx> BoundVarReplacer<'a, 'tcx> { 187,190 ( 0.00%) fn new( . tcx: TyCtxt<'tcx>, . fld_r: Option<&'a mut (dyn FnMut(ty::BoundRegion) -> ty::Region<'tcx> + 'a)>, . fld_t: Option<&'a mut (dyn FnMut(ty::BoundTy) -> Ty<'tcx> + 'a)>, . fld_c: Option<&'a mut (dyn FnMut(ty::BoundVar, Ty<'tcx>) -> &'tcx ty::Const<'tcx> + 'a)>, . ) -> Self { 657,894 ( 0.01%) BoundVarReplacer { tcx, current_index: ty::INNERMOST, fld_r, fld_t, fld_c } 93,595 ( 0.00%) } . } . . impl<'a, 'tcx> TypeFolder<'tcx> for BoundVarReplacer<'a, 'tcx> { . fn tcx<'b>(&'b self) -> TyCtxt<'tcx> { 186,435 ( 0.00%) self.tcx 68,025 ( 0.00%) } . . fn fold_binder>( . &mut self, . t: ty::Binder<'tcx, T>, . ) -> ty::Binder<'tcx, T> { 249,676 ( 0.00%) self.current_index.shift_in(1); 361,940 ( 0.00%) let t = t.super_fold_with(self); 219,659 ( 0.00%) self.current_index.shift_out(1); . t . } . 619,980 ( 0.01%) fn fold_ty(&mut self, t: Ty<'tcx>) -> Ty<'tcx> { 487,854 ( 0.01%) match *t.kind() { 13,137 ( 0.00%) ty::Bound(debruijn, bound_ty) if debruijn == self.current_index => { 2,628 ( 0.00%) if let Some(fld_t) = self.fld_t.as_mut() { . let ty = fld_t(bound_ty); 2,628 ( 0.00%) return ty::fold::shift_vars(self.tcx, &ty, self.current_index.as_u32()); . } . } 482,598 ( 0.01%) _ if t.has_vars_bound_at_or_above(self.current_index) => { 587,642 ( 0.01%) return t.super_fold_with(self); . } . _ => {} . } . t 476,604 ( 0.01%) } . 318,016 ( 0.00%) fn fold_region(&mut self, r: ty::Region<'tcx>) -> ty::Region<'tcx> { 283,482 ( 0.00%) match *r { 282,946 ( 0.00%) ty::ReLateBound(debruijn, br) if debruijn == self.current_index => { 141,377 ( 0.00%) if let Some(fld_r) = self.fld_r.as_mut() { . let region = fld_r(br); 284,602 ( 0.00%) return if let ty::ReLateBound(debruijn1, br) = *region { . // If the callback returns a late-bound region, . // that region should always use the INNERMOST . // debruijn index. Then we adjust it to the . // correct depth. 924 ( 0.00%) assert_eq!(debruijn1, ty::INNERMOST); 9,014 ( 0.00%) self.tcx.mk_region(ty::ReLateBound(debruijn, br)) . } else { . region . }; . } . } . _ => {} . } . r 318,016 ( 0.00%) } . . fn fold_const(&mut self, ct: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> { 225 ( 0.00%) match *ct { . ty::Const { val: ty::ConstKind::Bound(debruijn, bound_const), ty } . if debruijn == self.current_index => . { . if let Some(fld_c) = self.fld_c.as_mut() { . let ct = fld_c(bound_const, ty); . return ty::fold::shift_vars(self.tcx, &ct, self.current_index.as_u32()); . } . } 75 ( 0.00%) _ if ct.has_vars_bound_at_or_above(self.current_index) => { . return ct.super_fold_with(self); . } . _ => {} . } . ct . } . } . -- line 681 ---------------------------------------- -- line 697 ---------------------------------------- . mut fld_r: F, . ) -> (T, BTreeMap>) . where . F: FnMut(ty::BoundRegion) -> ty::Region<'tcx>, . T: TypeFoldable<'tcx>, . { . let mut region_map = BTreeMap::new(); . let mut real_fld_r = 320,311 ( 0.00%) |br: ty::BoundRegion| *region_map.entry(br).or_insert_with(|| fld_r(br)); 8,300 ( 0.00%) let value = value.skip_binder(); 77,704 ( 0.00%) let value = if !value.has_escaping_bound_vars() { 137,328 ( 0.00%) value . } else { 44,590 ( 0.00%) let mut replacer = BoundVarReplacer::new(self, Some(&mut real_fld_r), None, None); 913 ( 0.00%) value.fold_with(&mut replacer) . }; 268,410 ( 0.00%) (value, region_map) . } . . /// Replaces all escaping bound vars. The `fld_r` closure replaces escaping . /// bound regions; the `fld_t` closure replaces escaping bound types and the `fld_c` . /// closure replaces escaping bound consts. 672,105 ( 0.01%) pub fn replace_escaping_bound_vars( . self, . value: T, . mut fld_r: F, . mut fld_t: G, . mut fld_c: H, . ) -> T . where . F: FnMut(ty::BoundRegion) -> ty::Region<'tcx>, . G: FnMut(ty::BoundTy) -> Ty<'tcx>, . H: FnMut(ty::BoundVar, Ty<'tcx>) -> &'tcx ty::Const<'tcx>, . T: TypeFoldable<'tcx>, . { 121,880 ( 0.00%) if !value.has_escaping_bound_vars() { 305,446 ( 0.00%) value . } else { . let mut replacer = 1,064,783 ( 0.01%) BoundVarReplacer::new(self, Some(&mut fld_r), Some(&mut fld_t), Some(&mut fld_c)); 53,642 ( 0.00%) value.fold_with(&mut replacer) . } 459,392 ( 0.01%) } . . /// Replaces all types or regions bound by the given `Binder`. The `fld_r` . /// closure replaces bound regions while the `fld_t` closure replaces bound . /// types. 4,431,062 ( 0.05%) pub fn replace_bound_vars( . self, . value: Binder<'tcx, T>, . mut fld_r: F, . fld_t: G, . fld_c: H, . ) -> (T, BTreeMap>) . where . F: FnMut(ty::BoundRegion) -> ty::Region<'tcx>, . G: FnMut(ty::BoundTy) -> Ty<'tcx>, . H: FnMut(ty::BoundVar, Ty<'tcx>) -> &'tcx ty::Const<'tcx>, . T: TypeFoldable<'tcx>, . { . let mut region_map = BTreeMap::new(); 474,889 ( 0.01%) let real_fld_r = |br: ty::BoundRegion| *region_map.entry(br).or_insert_with(|| fld_r(br)); 4,219,984 ( 0.05%) let value = self.replace_escaping_bound_vars(value.skip_binder(), real_fld_r, fld_t, fld_c); 3,215,736 ( 0.04%) (value, region_map) 3,276,926 ( 0.04%) } . . /// Replaces any late-bound regions bound in `value` with . /// free variants attached to `all_outlive_scope`. 36,652 ( 0.00%) pub fn liberate_late_bound_regions( . self, . all_outlive_scope: DefId, . value: ty::Binder<'tcx, T>, . ) -> T . where . T: TypeFoldable<'tcx>, . { . self.replace_late_bound_regions(value, |br| { 48,594 ( 0.00%) self.mk_region(ty::ReFree(ty::FreeRegion { 7,476 ( 0.00%) scope: all_outlive_scope, . bound_region: br.kind, . })) . }) . .0 19,992 ( 0.00%) } . . pub fn shift_bound_var_indices(self, bound_vars: usize, value: T) -> T . where . T: TypeFoldable<'tcx>, . { . self.replace_escaping_bound_vars( 104,865 ( 0.00%) value, . |r| { . self.mk_region(ty::ReLateBound( . ty::INNERMOST, . ty::BoundRegion { . var: ty::BoundVar::from_usize(r.var.as_usize() + bound_vars), . kind: r.kind, . }, . )) -- line 795 ---------------------------------------- -- line 843 ---------------------------------------- . fn collect_late_bound_regions( . self, . value: &Binder<'tcx, T>, . just_constraint: bool, . ) -> FxHashSet . where . T: TypeFoldable<'tcx>, . { 4,528 ( 0.00%) let mut collector = LateBoundRegionsCollector::new(just_constraint); . let result = value.as_ref().skip_binder().visit_with(&mut collector); . assert!(result.is_continue()); // should never have stopped early 8,912 ( 0.00%) collector.regions . } . . /// Replaces any late-bound regions bound in `value` with `'erased`. Useful in codegen but also . /// method lookup and a few other places where precise region relationships are not required. . pub fn erase_late_bound_regions(self, value: Binder<'tcx, T>) -> T . where . T: TypeFoldable<'tcx>, . { 12,148 ( 0.00%) self.replace_late_bound_regions(value, |_| self.lifetimes.re_erased).0 . } . . /// Rewrite any late-bound regions so that they are anonymous. Region numbers are . /// assigned starting at 0 and increasing monotonically in the order traversed . /// by the fold operation. . /// . /// The chief purpose of this function is to canonicalize regions so that two . /// `FnSig`s or `TraitRef`s which are equivalent up to region naming will become . /// structurally identical. For example, `for<'a, 'b> fn(&'a isize, &'b isize)` and . /// `for<'a, 'b> fn(&'b isize, &'a isize)` will become identical after anonymization. 165,447 ( 0.00%) pub fn anonymize_late_bound_regions(self, sig: Binder<'tcx, T>) -> Binder<'tcx, T> . where . T: TypeFoldable<'tcx>, . { 118,865 ( 0.00%) let mut counter = 0; 1,950 ( 0.00%) let inner = self . .replace_late_bound_regions(sig, |_| { . let br = ty::BoundRegion { 1,706 ( 0.00%) var: ty::BoundVar::from_u32(counter), . kind: ty::BrAnon(counter), . }; 6,824 ( 0.00%) let r = self.mk_region(ty::ReLateBound(ty::INNERMOST, br)); 4,265 ( 0.00%) counter += 1; . r . }) . .0; 23,773 ( 0.00%) let bound_vars = self.mk_bound_variable_kinds( 71,319 ( 0.00%) (0..counter).map(|i| ty::BoundVariableKind::Region(ty::BrAnon(i))), . ); 138,066 ( 0.00%) Binder::bind_with_vars(inner, bound_vars) 142,324 ( 0.00%) } . } . . pub struct ValidateBoundVars<'tcx> { . bound_vars: &'tcx ty::List, . binder_index: ty::DebruijnIndex, . // We may encounter the same variable at different levels of binding, so . // this can't just be `Ty` . visited: SsoHashSet<(ty::DebruijnIndex, Ty<'tcx>)>, -- line 902 ---------------------------------------- -- line 1004 ---------------------------------------- . tcx: TyCtxt<'tcx>, . current_index: ty::DebruijnIndex, . amount: u32, . } . . impl<'tcx> Shifter<'tcx> { . pub fn new(tcx: TyCtxt<'tcx>, amount: u32) -> Self { . Shifter { tcx, current_index: ty::INNERMOST, amount } 5,266 ( 0.00%) } . } . . impl<'tcx> TypeFolder<'tcx> for Shifter<'tcx> { . fn tcx<'b>(&'b self) -> TyCtxt<'tcx> { 20 ( 0.00%) self.tcx . } . . fn fold_binder>( . &mut self, . t: ty::Binder<'tcx, T>, . ) -> ty::Binder<'tcx, T> { . self.current_index.shift_in(1); . let t = t.super_fold_with(self); . self.current_index.shift_out(1); . t . } . . fn fold_region(&mut self, r: ty::Region<'tcx>) -> ty::Region<'tcx> { 20 ( 0.00%) match *r { . ty::ReLateBound(debruijn, br) => { 40 ( 0.00%) if self.amount == 0 || debruijn < self.current_index { . r . } else { 10 ( 0.00%) let debruijn = debruijn.shifted_in(self.amount); . let shifted = ty::ReLateBound(debruijn, br); 100 ( 0.00%) self.tcx.mk_region(shifted) . } . } . _ => r, . } . } . . fn fold_ty(&mut self, ty: Ty<'tcx>) -> Ty<'tcx> { 5,306 ( 0.00%) match *ty.kind() { . ty::Bound(debruijn, bound_ty) => { . if self.amount == 0 || debruijn < self.current_index { . ty . } else { . let debruijn = debruijn.shifted_in(self.amount); . self.tcx.mk_ty(ty::Bound(debruijn, bound_ty)) . } . } . 7,968 ( 0.00%) _ => ty.super_fold_with(self), . } . } . . fn fold_const(&mut self, ct: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> { . if let ty::Const { val: ty::ConstKind::Bound(debruijn, bound_ct), ty } = *ct { . if self.amount == 0 || debruijn < self.current_index { . ct . } else { -- line 1064 ---------------------------------------- -- line 1073 ---------------------------------------- . . pub fn shift_region<'tcx>( . tcx: TyCtxt<'tcx>, . region: ty::Region<'tcx>, . amount: u32, . ) -> ty::Region<'tcx> { . match region { . ty::ReLateBound(debruijn, br) if amount > 0 => { 7,332 ( 0.00%) tcx.mk_region(ty::ReLateBound(debruijn.shifted_in(amount), *br)) . } . _ => region, . } . } . . pub fn shift_vars<'tcx, T>(tcx: TyCtxt<'tcx>, value: T, amount: u32) -> T . where . T: TypeFoldable<'tcx>, . { . debug!("shift_vars(value={:?}, amount={})", value, amount); . 5,278 ( 0.00%) value.fold_with(&mut Shifter::new(tcx, amount)) . } . . #[derive(Debug, PartialEq, Eq, Copy, Clone)] . struct FoundEscapingVars; . . /// An "escaping var" is a bound var whose binder is not part of `t`. A bound var can be a . /// bound region or a bound type. . /// -- line 1101 ---------------------------------------- -- line 1128 ---------------------------------------- . . impl<'tcx> TypeVisitor<'tcx> for HasEscapingVarsVisitor { . type BreakTy = FoundEscapingVars; . . fn visit_binder>( . &mut self, . t: &Binder<'tcx, T>, . ) -> ControlFlow { 100,108 ( 0.00%) self.outer_index.shift_in(1); . let result = t.super_visit_with(self); 128,606 ( 0.00%) self.outer_index.shift_out(1); . result . } . . #[inline] . fn visit_ty(&mut self, t: Ty<'tcx>) -> ControlFlow { . // If the outer-exclusive-binder is *strictly greater* than . // `outer_index`, that means that `t` contains some content . // bound at `outer_index` or above (because -- line 1146 ---------------------------------------- -- line 1160 ---------------------------------------- . // visited. . if r.bound_at_or_above_binder(self.outer_index) { . ControlFlow::Break(FoundEscapingVars) . } else { . ControlFlow::CONTINUE . } . } . 6 ( 0.00%) fn visit_const(&mut self, ct: &'tcx ty::Const<'tcx>) -> ControlFlow { . // we don't have a `visit_infer_const` callback, so we have to . // hook in here to catch this case (annoying...), but . // otherwise we do want to remember to visit the rest of the . // const, as it has types/regions embedded in a lot of other . // places. 13 ( 0.00%) match ct.val { . ty::ConstKind::Bound(debruijn, _) if debruijn >= self.outer_index => { . ControlFlow::Break(FoundEscapingVars) . } 6 ( 0.00%) _ => ct.super_visit_with(self), . } 6 ( 0.00%) } . . #[inline] . fn visit_predicate(&mut self, predicate: ty::Predicate<'tcx>) -> ControlFlow { . if predicate.inner.outer_exclusive_binder > self.outer_index { . ControlFlow::Break(FoundEscapingVars) . } else { . ControlFlow::CONTINUE . } -- line 1188 ---------------------------------------- -- line 1210 ---------------------------------------- . #[instrument(level = "trace")] . fn visit_ty(&mut self, t: Ty<'_>) -> ControlFlow { . debug!( . "HasTypeFlagsVisitor: t={:?} t.flags={:?} self.flags={:?}", . t, . t.flags(), . self.flags . ); 2,238,687 ( 0.03%) if t.flags().intersects(self.flags) { . ControlFlow::Break(FoundFlags) . } else { . ControlFlow::CONTINUE . } . } . . #[inline] . #[instrument(skip(self), level = "trace")] . fn visit_region(&mut self, r: ty::Region<'tcx>) -> ControlFlow { 20,934 ( 0.00%) let flags = r.type_flags(); . trace!(r.flags=?flags); . if flags.intersects(self.flags) { . ControlFlow::Break(FoundFlags) . } else { . ControlFlow::CONTINUE . } . } . . #[inline] . #[instrument(level = "trace")] . fn visit_const(&mut self, c: &'tcx ty::Const<'tcx>) -> ControlFlow { 13,579 ( 0.00%) let flags = FlagComputation::for_const(c); . trace!(r.flags=?flags); 6,042 ( 0.00%) if flags.intersects(self.flags) { . ControlFlow::Break(FoundFlags) . } else { . ControlFlow::CONTINUE . } . } . . #[inline] . #[instrument(level = "trace")] . fn visit_unevaluated_const(&mut self, uv: ty::Unevaluated<'tcx>) -> ControlFlow { 36 ( 0.00%) let flags = FlagComputation::for_unevaluated_const(uv); . trace!(r.flags=?flags); . if flags.intersects(self.flags) { . ControlFlow::Break(FoundFlags) . } else { . ControlFlow::CONTINUE . } . } . -- line 1260 ---------------------------------------- -- line 1285 ---------------------------------------- . /// them constraints `'a == 'b`. But if you have `<&'a u32 as . /// Trait>::Foo` and `<&'b u32 as Trait>::Foo`, normalizing those . /// types may mean that `'a` and `'b` don't appear in the results, . /// so they are not considered *constrained*. . just_constrained: bool, . } . . impl LateBoundRegionsCollector { 2,228 ( 0.00%) fn new(just_constrained: bool) -> Self { 15,596 ( 0.00%) LateBoundRegionsCollector { . current_index: ty::INNERMOST, . regions: Default::default(), . just_constrained, . } 2,228 ( 0.00%) } . } . . impl<'tcx> TypeVisitor<'tcx> for LateBoundRegionsCollector { . fn visit_binder>( . &mut self, . t: &Binder<'tcx, T>, . ) -> ControlFlow { 39 ( 0.00%) self.current_index.shift_in(1); 39 ( 0.00%) let result = t.super_visit_with(self); 39 ( 0.00%) self.current_index.shift_out(1); . result . } . 10,557 ( 0.00%) fn visit_ty(&mut self, t: Ty<'tcx>) -> ControlFlow { . // if we are only looking for "constrained" region, we have to . // ignore the inputs to a projection, as they may not appear . // in the normalized form 9,890 ( 0.00%) if self.just_constrained { 11,353 ( 0.00%) if let ty::Projection(..) | ty::Opaque(..) = t.kind() { . return ControlFlow::CONTINUE; . } . } . 11,168 ( 0.00%) t.super_visit_with(self) 7,170 ( 0.00%) } . . fn visit_const(&mut self, c: &'tcx ty::Const<'tcx>) -> ControlFlow { . // if we are only looking for "constrained" region, we have to . // ignore the inputs of an unevaluated const, as they may not appear . // in the normalized form 132 ( 0.00%) if self.just_constrained { 132 ( 0.00%) if let ty::ConstKind::Unevaluated(..) = c.val { . return ControlFlow::CONTINUE; . } . } . . c.super_visit_with(self) . } . . fn visit_region(&mut self, r: ty::Region<'tcx>) -> ControlFlow { 6,937 ( 0.00%) if let ty::ReLateBound(debruijn, br) = *r { 1,345 ( 0.00%) if debruijn == self.current_index { . self.regions.insert(br.kind); . } . } . ControlFlow::CONTINUE . } . } 1,724,103 ( 0.02%) -------------------------------------------------------------------------------- -- 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 { 10,491,309 ( 0.13%) 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)); 704,226 ( 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::()); 185,546,084 ( 2.22%) 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" . ); . 1,307,978 ( 0.02%) self.stride += Group::WIDTH; 1,307,978 ( 0.02%) self.pos += self.stride; 1,070,849 ( 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. 772,804 ( 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. 1,606,285 ( 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. 390,870 ( 0.00%) let adjusted_cap = cap.checked_mul(8)? / 7; . . // Any overflows will have been caught by the checked_mul. Also, any . // rounding errors from the division above will be cleaned up by . // next_power_of_two (which can't overflow because of the previous division). . Some(adjusted_cap.next_power_of_two()) . } . . /// Returns the maximum effective capacity for the given bucket mask, taking . /// the maximum load factor into account. . #[inline] . fn bucket_mask_to_capacity(bucket_mask: usize) -> usize { 1,967,067 ( 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. 386,540 ( 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 = 1,546,068 ( 0.02%) size.checked_mul(buckets)?.checked_add(ctrl_align - 1)? & !(ctrl_align - 1); 2,104,776 ( 0.03%) 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 { 2,306 ( 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 { 4,011 ( 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 { 285 ( 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 { 14,858 ( 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")] 209,362 ( 0.00%) pub unsafe fn erase_no_drop(&mut self, item: &Bucket) { 209,362 ( 0.00%) let index = self.bucket_index(item); . self.table.erase(index); 418,724 ( 0.01%) } . . /// 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. 262,186 ( 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 { 156,538 ( 0.00%) self.erase_no_drop(&item); 260 ( 0.00%) item.read() . } . . /// Finds and removes an element from the table, returning it. . #[cfg_attr(feature = "inline-more", inline)] 2,879,541 ( 0.03%) pub fn remove_entry(&mut self, hash: u64, eq: impl FnMut(&T) -> bool) -> Option { . // Avoid `Option::map` because it bloats LLVM IR. 3,554 ( 0.00%) match self.find(hash, eq) { 29,321 ( 0.00%) Some(bucket) => Some(unsafe { self.remove(bucket) }), 583,325 ( 0.01%) None => None, . } 3,278,123 ( 0.04%) } . . /// 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) { 67,862 ( 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) { 2,133,971 ( 0.03%) if additional > self.table.growth_left { . // Avoid `Result::unwrap_or_else` because it bloats LLVM IR. 1,533,536 ( 0.02%) 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)] 3,108,433 ( 0.04%) 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 . }, . ) . } 2,218,360 ( 0.03%) } . . /// 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)] 10,027,228 ( 0.12%) 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. 26,137 ( 0.00%) let old_ctrl = *self.table.ctrl(index); 8,993,764 ( 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 . } 7,416,710 ( 0.09%) } . . /// Attempts to insert a new element without growing the table and return its raw bucket. . /// . /// Returns an `Err` containing the given element if inserting it would require growing the . /// table. . /// . /// This does not check if the given element already exists in the table. . #[cfg(feature = "raw")] -- line 749 ---------------------------------------- -- line 760 ---------------------------------------- . } . } . } . . /// Inserts a new element into the table, and returns a mutable reference to it. . /// . /// This does not check if the given element already exists in the table. . #[cfg_attr(feature = "inline-more", inline)] 7,132,136 ( 0.09%) pub fn insert_entry(&mut self, hash: u64, value: T, hasher: impl Fn(&T) -> u64) -> &mut T { 578 ( 0.00%) unsafe { self.insert(hash, value, hasher).as_mut() } 5,349,102 ( 0.06%) } . . /// 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"))] 15,974 ( 0.00%) pub unsafe fn insert_no_grow(&mut self, hash: u64, value: T) -> Bucket { 1,847,377 ( 0.02%) let (index, old_ctrl) = self.table.prepare_insert_slot(hash); 287,385 ( 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. 3,748,497 ( 0.04%) self.table.growth_left -= special_is_empty(old_ctrl) as usize; . . bucket.write(value); 3,242,244 ( 0.04%) self.table.items += 1; . bucket 31,923 ( 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] 15,288 ( 0.00%) pub fn find(&self, hash: u64, mut eq: impl FnMut(&T) -> bool) -> Option> { 18,161 ( 0.00%) let result = self.table.find_inner(hash, &mut |index| unsafe { 46,545 ( 0.00%) eq(self.bucket(index).as_ref()) 7,382 ( 0.00%) }); . . // Avoid `Option::map` because it bloats LLVM IR. . match result { 2,038 ( 0.00%) Some(index) => Some(unsafe { self.bucket(index) }), . None => None, . } 15,288 ( 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. 93,228 ( 0.00%) match self.find(hash, eq) { . Some(bucket) => Some(unsafe { bucket.as_ref() }), . None => None, . } . } . . /// Gets a mutable reference to an element in the table. . #[inline] . pub fn get_mut(&mut self, hash: u64, eq: impl FnMut(&T) -> bool) -> Option<&mut T> { . // Avoid `Option::map` because it bloats LLVM IR. 12,982 ( 0.00%) match self.find(hash, eq) { . Some(bucket) => Some(unsafe { bucket.as_mut() }), . None => None, . } . } . . /// Attempts to get mutable references to `N` entries in the table at once. . /// . /// Returns an array of length `N` with the results of each query. -- line 855 ---------------------------------------- -- line 920 ---------------------------------------- . #[inline] . pub fn len(&self) -> usize { . self.table.items . } . . /// Returns `true` if the table contains no elements. . #[inline] . pub fn is_empty(&self) -> bool { 3,449,170 ( 0.04%) 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 { 9 ( 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()), 288,977 ( 0.00%) items: self.table.items, . } . } . . /// Returns an iterator over occupied buckets that could match a given hash. . /// . /// `RawTable` only stores 7 bits of the hash value, so this iterator may . /// return items that have a hash value different than the one provided. You . /// should always validate the returned values before using them. -- line 954 ---------------------------------------- -- line 995 ---------------------------------------- . /// Iteration starts at the provided iterator's current location. . /// . /// It is up to the caller to ensure that the iterator is valid for this . /// `RawTable` and covers all items that remain in the table. . pub unsafe fn into_iter_from(self, iter: RawIter) -> RawIntoIter { . debug_assert_eq!(iter.len(), self.len()); . . let alloc = self.table.alloc.clone(); 14,108 ( 0.00%) let allocation = self.into_allocation(); 10,581 ( 0.00%) RawIntoIter { 17,635 ( 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)> { 7,532 ( 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(( 747 ( 0.00%) unsafe { NonNull::new_unchecked(self.table.ctrl.as_ptr().sub(ctrl_offset)) }, . layout, . )) . }; . mem::forget(self); . alloc . } . } . -- line 1033 ---------------------------------------- -- line 1042 ---------------------------------------- . T: Sync, . A: Sync, . { . } . . impl RawTableInner { . #[inline] . const fn new_in(alloc: A) -> Self { 2,772,688 ( 0.03%) 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)] 3,007,275 ( 0.04%) 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()); . } . 610,766 ( 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)); 1,646,550 ( 0.02%) Ok(Self { . ctrl, 660,884 ( 0.01%) bucket_mask: buckets - 1, . items: 0, . growth_left: bucket_mask_to_capacity(buckets - 1), . alloc, . }) 2,187,800 ( 0.03%) } . . #[inline] 38,638 ( 0.00%) fn fallible_with_capacity( . alloc: A, . table_layout: TableLayout, . capacity: usize, . fallibility: Fallibility, . ) -> Result { 10,486 ( 0.00%) if capacity == 0 { 8,792 ( 0.00%) Ok(Self::new_in(alloc)) . } else { . unsafe { . let buckets = . capacity_to_buckets(capacity).ok_or_else(|| fallibility.capacity_overflow())?; . 1,364,547 ( 0.02%) let result = Self::new_uninitialized(alloc, table_layout, buckets, fallibility)?; . result.ctrl(0).write_bytes(EMPTY, result.num_ctrl_bytes()); . 19,587 ( 0.00%) Ok(result) . } . } 38,638 ( 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] 688,272 ( 0.01%) unsafe fn prepare_insert_slot(&self, hash: u64) -> (usize, u8) { . let index = self.find_insert_slot(hash); 688,272 ( 0.01%) let old_ctrl = *self.ctrl(index); . self.set_ctrl_h2(index, hash); . (index, old_ctrl) 1,376,544 ( 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)); 6,616,521 ( 0.08%) if let Some(bit) = group.match_empty_or_deleted().lowest_set_bit() { 19,256,273 ( 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). 8,665,398 ( 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); . 610,824 ( 0.01%) loop { . let group = unsafe { Group::load(self.ctrl(probe_seq.pos)) }; . 16,187,093 ( 0.19%) for bit in group.match_byte(h2_hash) { 31,597,757 ( 0.38%) let index = (probe_seq.pos + bit) & self.bucket_mask; . 15,746,259 ( 0.19%) if likely(eq(index)) { . return Some(index); . } . } . 5,025,782 ( 0.06%) if likely(group.match_empty().any_bit_set()) { . return None; . } . . probe_seq.move_next(self.bucket_mask); . } . } . . #[allow(clippy::mut_mut)] . #[inline] . unsafe fn prepare_rehash_in_place(&mut self) { . // Bulk convert all full control bytes to DELETED, and all DELETED . // control bytes to EMPTY. This effectively frees up all buckets . // containing a DELETED entry. 10 ( 0.00%) for i in (0..self.buckets()).step_by(Group::WIDTH) { . let group = Group::load_aligned(self.ctrl(i)); . let group = group.convert_special_to_empty_and_full_to_deleted(); . group.store_aligned(self.ctrl(i)); . } . . // Fix up the trailing control bytes. See the comments in set_ctrl . // for the handling of tables smaller than the group width. 6 ( 0.00%) if self.buckets() < Group::WIDTH { . self.ctrl(0) . .copy_to(self.ctrl(Group::WIDTH), self.buckets()); . } else { . self.ctrl(0) . .copy_to(self.ctrl(self.buckets()), Group::WIDTH); . } . } . -- line 1220 ---------------------------------------- -- line 1225 ---------------------------------------- . Bucket::from_base_index(self.data_end(), index) . } . . #[inline] . unsafe fn bucket_ptr(&self, index: usize, size_of: usize) -> *mut u8 { . debug_assert_ne!(self.bucket_mask, 0); . debug_assert!(index < self.buckets()); . let base: *mut u8 = self.data_end().as_ptr(); 26,345,288 ( 0.32%) 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 { 95,314,035 ( 1.14%) 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) { 11,240,565 ( 0.13%) self.growth_left -= special_is_empty(old_ctrl) as usize; . self.set_ctrl_h2(index, hash); 8,992,452 ( 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; 60 ( 0.00%) probe_index(i) == probe_index(new_i) . } . . /// Sets a control byte to the hash, and possibly also the replicated control byte at . /// the end of the array. . #[inline] . unsafe fn set_ctrl_h2(&self, index: usize, hash: u64) { . self.set_ctrl(index, h2(hash)); . } -- line 1289 ---------------------------------------- -- line 1312 ---------------------------------------- . // replicate the buckets at the end of the trailing group. For example . // with 2 buckets and a group size of 4, the control bytes will look . // like this: . // . // Real | Replicated . // --------------------------------------------- . // | [A] | [B] | [EMPTY] | [EMPTY] | [A] | [B] | . // --------------------------------------------- 18,736,500 ( 0.22%) let index2 = ((index.wrapping_sub(Group::WIDTH)) & self.bucket_mask) + Group::WIDTH; . 6,245,500 ( 0.07%) *self.ctrl(index) = ctrl; 6,248,788 ( 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 { 1,282,666 ( 0.02%) self.bucket_mask + 1 . } . . #[inline] . fn num_ctrl_bytes(&self) -> usize { 1,736,749 ( 0.02%) self.bucket_mask + 1 + Group::WIDTH . } . . #[inline] . fn is_empty_singleton(&self) -> bool { 5,363,170 ( 0.06%) 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,759 ( 0.00%) let mut new_table = RawTableInner::fallible_with_capacity( . self.alloc.clone(), . table_layout, . capacity, . fallibility, . )?; 951,972 ( 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_| { 384,389 ( 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. 768,784 ( 0.01%) let new_items = match self.items.checked_add(additional) { . Some(new_items) => new_items, . None => return Err(fallibility.capacity_overflow()), . }; 768,782 ( 0.01%) let full_capacity = bucket_mask_to_capacity(self.bucket_mask); 1,769,860 ( 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); 4 ( 0.00%) Ok(()) . } else { . // Otherwise, conservatively resize to at least the next size up . // to avoid churning deletes into frequent rehashes. . self.resize_inner( 384,389 ( 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> { 8,920 ( 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() { 4,074,024 ( 0.05%) if !is_full(*self.ctrl(i)) { . continue; . } . . // This may panic. . let hash = hasher(self, i); . . // We can use a simpler version of insert() here since: . // - there are no DELETED entries. -- line 1444 ---------------------------------------- -- line 1454 ---------------------------------------- . } . . // We successfully copied all elements without panicking. Now replace . // self with the new table. The old table will have its memory freed but . // the items will not be dropped (since they have been moved into the . // new table). . mem::swap(self, &mut new_table); . 384,389 ( 0.00%) Ok(()) . } . . /// Rehashes the contents of the table in place (i.e. without changing the . /// allocation). . /// . /// If `hasher` panics then some the table's contents may be lost. . /// . /// This uses dynamic dispatch to reduce the amount of -- line 1470 ---------------------------------------- -- line 1496 ---------------------------------------- . } . self_.growth_left = bucket_mask_to_capacity(self_.bucket_mask) - self_.items; . }); . . // At this point, DELETED elements are elements that we haven't . // rehashed yet. Find them and re-insert them at their ideal . // position. . 'outer: for i in 0..guard.buckets() { 256 ( 0.00%) if *guard.ctrl(i) != DELETED { . continue; . } . . let i_p = guard.bucket_ptr(i, size_of); . . 'inner: loop { . // Hash the current item . let hash = hasher(*guard, i); -- line 1512 ---------------------------------------- -- line 1515 ---------------------------------------- . let new_i = guard.find_insert_slot(hash); . let new_i_p = guard.bucket_ptr(new_i, size_of); . . // Probing works by scanning through all of the control . // bytes in groups, which may not be aligned to the group . // size. If both the new and old position fall within the . // same unaligned group, then there is no benefit in moving . // it and we can just continue to the next item. 20 ( 0.00%) if likely(guard.is_in_same_group(i, new_i, hash)) { . guard.set_ctrl_h2(i, hash); . continue 'outer; . } . . // We are moving the current item to a new position. Write . // our H2 to the control byte of the new position. . let prev_ctrl = guard.replace_ctrl_h2(new_i, hash); . if prev_ctrl == EMPTY { -- line 1531 ---------------------------------------- -- line 1541 ---------------------------------------- . // swapped into the old slot. . debug_assert_eq!(prev_ctrl, DELETED); . ptr::swap_nonoverlapping(i_p, new_i_p, size_of); . continue 'inner; . } . } . } . 6 ( 0.00%) guard.growth_left = bucket_mask_to_capacity(guard.bucket_mask) - guard.items; . . mem::forget(guard); . } . . #[inline] . unsafe fn free_buckets(&mut self, table_layout: TableLayout) { . // Avoid `Option::unwrap_or_else` because it bloats LLVM IR. . let (layout, ctrl_offset) = match table_layout.calculate_layout_for(self.buckets()) { . Some(lco) => lco, . None => hint::unreachable_unchecked(), . }; . self.alloc.deallocate( 267,764 ( 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) { 38,829 ( 0.00%) if !self.is_empty_singleton() { . unsafe { . self.ctrl(0).write_bytes(EMPTY, self.num_ctrl_bytes()); . } . } 43,369 ( 0.00%) self.items = 0; 38,829 ( 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))); 379,790 ( 0.00%) let index_before = index.wrapping_sub(Group::WIDTH) & self.bucket_mask; . let empty_before = Group::load(self.ctrl(index_before)).match_empty(); . let empty_after = Group::load(self.ctrl(index)).match_empty(); . . // If we are inside a continuous block of Group::WIDTH full or deleted . // cells then a probe window may have seen a full block when trying to . // insert. We therefore need to keep that block non-empty so that . // lookups will continue searching to the next probe window. . // . // Note that in this context `leading_zeros` refers to the bytes at the . // end of a group, while `trailing_zeros` refers to the bytes at the . // beginning of a group. 1,519,160 ( 0.02%) let ctrl = if empty_before.leading_zeros() + empty_after.trailing_zeros() >= Group::WIDTH { . DELETED . } else { 1,853,255 ( 0.02%) self.growth_left += 1; . EMPTY . }; . self.set_ctrl(index, ctrl); 1,519,160 ( 0.02%) self.items -= 1; . } . } . . impl Clone for RawTable { 10,712 ( 0.00%) fn clone(&self) -> Self { 1,419 ( 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) . } . } 12,051 ( 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; 114 ( 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)] 1,690,267 ( 0.02%) fn drop(&mut self) { 2,128,863 ( 0.03%) if !self.table.is_empty_singleton() { . unsafe { . self.drop_elements(); . self.free_buckets(); . } . } 1,683,772 ( 0.02%) } . } . #[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)] 14,108 ( 0.00%) fn into_iter(self) -> RawIntoIter { . unsafe { . let iter = self.iter(); . self.into_iter_from(iter) . } 17,635 ( 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 { 1,801,669 ( 0.02%) if let Some(index) = self.current_group.lowest_set_bit() { 99,725 ( 0.00%) self.current_group = self.current_group.remove_lowest_bit(); 152,025 ( 0.00%) return Some(self.data.next_n(index)); . } . 1,154,653 ( 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). 16,133 ( 0.00%) self.current_group = Group::load_aligned(self.next_ctrl).match_full(); 13,718 ( 0.00%) self.data = self.data.next_n(Group::WIDTH); 32,620 ( 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) { 3,240 ( 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)] 106,194 ( 0.00%) fn next(&mut self) -> Option> { 1,123,554 ( 0.01%) if let Some(b) = self.iter.next() { 5,001,789 ( 0.06%) 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 . } 212,388 ( 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,446 ( 0.00%) fn drop(&mut self) { . unsafe { . // Drop all remaining elements . self.iter.drop_elements(); . . // Free the table 36,518 ( 0.00%) if let Some((ptr, layout)) = self.allocation { . self.alloc.deallocate(ptr, layout); . } . } 238 ( 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,426 ( 0.00%) fn next(&mut self) -> Option { 633 ( 0.00%) unsafe { Some(self.iter.next()?.read()) } 2,852 ( 0.00%) } . . #[inline] . fn size_hint(&self) -> (usize, Option) { 16 ( 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)] 4,920 ( 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. 615 ( 0.00%) self.orig_table . .as_ptr() . .copy_from_nonoverlapping(&*self.table, 1); . } 4,920 ( 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 ---------------------------------------- 68,520,196 ( 0.82%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/traits/project.rs -------------------------------------------------------------------------------- Ir -- line 15 ---------------------------------------- . pub(crate) type UndoLog<'tcx> = . snapshot_map::UndoLog, ProjectionCacheEntry<'tcx>>; . . #[derive(Clone)] . pub struct MismatchedProjectionTypes<'tcx> { . pub err: ty::error::TypeError<'tcx>, . } . 133,623 ( 0.00%) #[derive(Clone, TypeFoldable)] . pub struct Normalized<'tcx, T> { 293,898 ( 0.00%) pub value: T, 430,535 ( 0.01%) pub obligations: Vec>, . } . . pub type NormalizedTy<'tcx> = Normalized<'tcx, Ty<'tcx>>; . . impl<'tcx, T> Normalized<'tcx, T> { . pub fn with(self, value: U) -> Normalized<'tcx, U> { . Normalized { value, obligations: self.obligations } . } -- line 34 ---------------------------------------- -- line 76 ---------------------------------------- . } . . #[derive(Copy, Clone, Debug, Hash, PartialEq, Eq)] . pub struct ProjectionCacheKey<'tcx> { . ty: ty::ProjectionTy<'tcx>, . } . . impl<'tcx> ProjectionCacheKey<'tcx> { 455,700 ( 0.01%) pub fn new(ty: ty::ProjectionTy<'tcx>) -> Self { . Self { ty } 227,850 ( 0.00%) } . } . 1,117,032 ( 0.01%) #[derive(Clone, Debug)] . pub enum ProjectionCacheEntry<'tcx> { . InProgress, . Ambiguous, . Recur, . Error, . NormalizedTy { . ty: NormalizedTy<'tcx>, . /// If we were able to successfully evaluate the -- line 97 ---------------------------------------- -- line 121 ---------------------------------------- . /// When we are not performing evaluation . /// (e.g. in `FulfillmentContext`), we ignore this field, . /// and always re-process the cached sub-obligations . /// (which may have been cleared out - see the above . /// paragraph). . /// This ensures that we do not lose any regions . /// constraints that arise from processing the . /// sub-obligations. 266,230 ( 0.00%) complete: Option, . }, . } . . impl<'tcx> ProjectionCacheStorage<'tcx> { . #[inline] . pub(crate) fn with_log<'a>( . &'a mut self, . undo_log: &'a mut InferCtxtUndoLogs<'tcx>, -- line 137 ---------------------------------------- -- line 145 ---------------------------------------- . fn map( . &mut self, . ) -> SnapshotMapRef< . '_, . ProjectionCacheKey<'tcx>, . ProjectionCacheEntry<'tcx>, . InferCtxtUndoLogs<'tcx>, . > { 295,665 ( 0.00%) self.map.with_log(self.undo_log) . } . . pub fn clear(&mut self) { . self.map().clear(); . } . . /// Try to start normalize `key`; returns an error if . /// normalization already occurred (this error corresponds to a . /// cache hit, so it's actually a good thing). 1,819,912 ( 0.02%) pub fn try_start( . &mut self, . key: ProjectionCacheKey<'tcx>, . ) -> Result<(), ProjectionCacheEntry<'tcx>> { 723,784 ( 0.01%) let mut map = self.map(); 682,467 ( 0.01%) if let Some(entry) = map.get(&key) { 1,303,204 ( 0.02%) return Err(entry.clone()); . } . 82,634 ( 0.00%) map.insert(key, ProjectionCacheEntry::InProgress); 82,634 ( 0.00%) Ok(()) 1,592,423 ( 0.02%) } . . /// Indicates that `key` was normalized to `value`. 133,371 ( 0.00%) pub fn insert_ty(&mut self, key: ProjectionCacheKey<'tcx>, value: NormalizedTy<'tcx>) { . debug!( . "ProjectionCacheEntry::insert_ty: adding cache entry: key={:?}, value={:?}", . key, value . ); 44,457 ( 0.00%) let mut map = self.map(); 88,914 ( 0.00%) if let Some(ProjectionCacheEntry::Recur) = map.get(&key) { . debug!("Not overwriting Recur"); . return; . } . let fresh_key = 88,914 ( 0.00%) map.insert(key, ProjectionCacheEntry::NormalizedTy { ty: value, complete: None }); . assert!(!fresh_key, "never started projecting `{:?}`", key); 103,733 ( 0.00%) } . . /// Mark the relevant projection cache key as having its derived obligations . /// complete, so they won't have to be re-computed (this is OK to do in a . /// snapshot - if the snapshot is rolled back, the obligations will be . /// marked as incomplete again). 1,910 ( 0.00%) pub fn complete(&mut self, key: ProjectionCacheKey<'tcx>, result: EvaluationResult) { 573 ( 0.00%) let mut map = self.map(); 1,207 ( 0.00%) match map.get(&key) { 252 ( 0.00%) Some(&ProjectionCacheEntry::NormalizedTy { ref ty, complete: _ }) => { . info!("ProjectionCacheEntry::complete({:?}) - completing {:?}", key, ty); . let mut ty = ty.clone(); 126 ( 0.00%) if result == EvaluationResult::EvaluatedToOk { 378 ( 0.00%) ty.obligations = vec![]; . } 1,008 ( 0.00%) map.insert(key, ProjectionCacheEntry::NormalizedTy { ty, complete: Some(result) }); . } 65 ( 0.00%) ref value => { . // Type inference could "strand behind" old cache entries. Leave . // them alone for now. . info!("ProjectionCacheEntry::complete({:?}) - ignoring {:?}", key, value); . } . }; 1,528 ( 0.00%) } . 510 ( 0.00%) pub fn is_complete(&mut self, key: ProjectionCacheKey<'tcx>) -> Option { 1,292 ( 0.00%) self.map().get(&key).and_then(|res| match res { . ProjectionCacheEntry::NormalizedTy { ty: _, complete } => *complete, . _ => None, . }) 340 ( 0.00%) } . . /// Indicates that trying to normalize `key` resulted in . /// ambiguity. No point in trying it again then until we gain more . /// type information (in which case, the "fully resolved" key will . /// be different). 238,284 ( 0.00%) pub fn ambiguous(&mut self, key: ProjectionCacheKey<'tcx>) { 79,428 ( 0.00%) let fresh = self.map().insert(key, ProjectionCacheEntry::Ambiguous); . assert!(!fresh, "never started projecting `{:?}`", key); 158,856 ( 0.00%) } . . /// Indicates that while trying to normalize `key`, `key` was required to . /// be normalized again. Selection or evaluation should eventually report . /// an error here. . pub fn recur(&mut self, key: ProjectionCacheKey<'tcx>) { . let fresh = self.map().insert(key, ProjectionCacheEntry::Recur); . assert!(!fresh, "never started projecting `{:?}`", key); . } . . /// Indicates that trying to normalize `key` resulted in . /// error. 198 ( 0.00%) pub fn error(&mut self, key: ProjectionCacheKey<'tcx>) { 66 ( 0.00%) let fresh = self.map().insert(key, ProjectionCacheEntry::Error); . assert!(!fresh, "never started projecting `{:?}`", key); 132 ( 0.00%) } . } . . impl<'tcx> Rollback> for ProjectionCacheStorage<'tcx> { . fn reverse(&mut self, undo: UndoLog<'tcx>) { . self.map.reverse(undo); . } . } 307,500 ( 0.00%) -------------------------------------------------------------------------------- -- 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, . ) { 34,877 ( 0.00%) if let Some((file, file_idx)) = new_file_and_idx { 17,028 ( 0.00%) self.file = file; 23,928 ( 0.00%) self.file_index = file_idx; . } . 18,111 ( 0.00%) let line_index = self.file.lookup_line(pos).unwrap(); . let line_bounds = self.file.line_bounds(line_index); 63,526 ( 0.00%) self.line_number = line_index + 1; 95,420 ( 0.00%) self.line = line_bounds; . self.touch(time_stamp); . } . . #[inline] . fn touch(&mut self, time_stamp: usize) { 343,077 ( 0.00%) self.time_stamp = time_stamp; . } . } . . #[derive(Clone)] . pub struct CachingSourceMapView<'sm> { . source_map: &'sm SourceMap, . line_cache: [CacheEntry; 3], . time_stamp: usize, . } . . impl<'sm> CachingSourceMapView<'sm> { 8,424 ( 0.00%) pub fn new(source_map: &'sm SourceMap) -> CachingSourceMapView<'sm> { . let files = source_map.files(); 4,212 ( 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, . }; . 21,060 ( 0.00%) CachingSourceMapView { . source_map, 29,484 ( 0.00%) line_cache: [entry.clone(), entry.clone(), entry], . time_stamp: 0, . } 16,848 ( 0.00%) } . . pub fn byte_pos_to_line_and_col( . &mut self, . pos: BytePos, . ) -> Option<(Lrc, usize, BytePos)> { . self.time_stamp += 1; . . // Check if the position is in one of the cached lines -- line 85 ---------------------------------------- -- line 106 ---------------------------------------- . }; . . let cache_entry = &mut self.line_cache[oldest]; . cache_entry.update(new_file_and_idx, pos, self.time_stamp); . . Some((cache_entry.file.clone(), cache_entry.line_number, pos - cache_entry.line.start)) . } . 1,300,124 ( 0.02%) pub fn span_data_to_lines_and_cols( . &mut self, . span_data: &SpanData, . ) -> Option<(Lrc, usize, BytePos, usize, BytePos)> { 742,928 ( 0.01%) self.time_stamp += 1; . . // Check if lo and hi are in the cached lines. 185,732 ( 0.00%) let lo_cache_idx = self.cache_entry_index(span_data.lo); 185,732 ( 0.00%) let hi_cache_idx = self.cache_entry_index(span_data.hi); . 316,728 ( 0.00%) if lo_cache_idx != -1 && hi_cache_idx != -1 { . // Cache hit for span lo and hi. Check if they belong to the same file. . let result = { 314,690 ( 0.00%) let lo = &self.line_cache[lo_cache_idx as usize]; . let hi = &self.line_cache[hi_cache_idx as usize]; . 944,070 ( 0.01%) if lo.file_index != hi.file_index { . return None; . } . . ( 314,690 ( 0.00%) lo.file.clone(), . lo.line_number, . span_data.lo - lo.line.start, 157,345 ( 0.00%) hi.line_number, . span_data.hi - hi.line.start, . ) . }; . 157,345 ( 0.00%) self.line_cache[lo_cache_idx as usize].touch(self.time_stamp); 157,345 ( 0.00%) self.line_cache[hi_cache_idx as usize].touch(self.time_stamp); . 629,380 ( 0.01%) return Some(result); . } . . // No cache hit or cache hit for only one of span lo and hi. 54,736 ( 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. 224,552 ( 0.00%) let new_file_and_idx = if !file_contains(&self.line_cache[oldest].file, span_data.lo) { 51,380 ( 0.00%) let new_file_and_idx = self.file_for_position(span_data.lo)?; 61,656 ( 0.00%) if !file_contains(&new_file_and_idx.0, span_data.hi) { . return None; . } . 41,104 ( 0.00%) Some(new_file_and_idx) . } else { . let file = &self.line_cache[oldest].file; 54,333 ( 0.00%) if !file_contains(&file, span_data.hi) { . return None; . } . 54,333 ( 0.00%) None . }; . . // Update the cache entries. 141,935 ( 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); . 72,369 ( 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); 2,038 ( 0.00%) let hi = &mut self.line_cache[hi_cache_idx as usize]; 3,057 ( 0.00%) hi.touch(self.time_stamp); . (oldest, hi_cache_idx as usize) . } . // Oldest cache entry is for span_data.hi line. . (_, -1) => { . let hi = &mut self.line_cache[oldest]; 3,245 ( 0.00%) hi.update(new_file_and_idx, span_data.hi, self.time_stamp); 6,490 ( 0.00%) let lo = &mut self.line_cache[lo_cache_idx as usize]; 12,980 ( 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. 56,774 ( 0.00%) assert!(span_data.lo >= lo.line.start); 28,387 ( 0.00%) assert!(span_data.lo <= lo.line.end); 56,774 ( 0.00%) assert!(span_data.hi >= hi.line.start); 28,387 ( 0.00%) assert!(span_data.hi <= hi.line.end); 141,935 ( 0.00%) assert!(lo.file.contains(span_data.lo)); 85,161 ( 0.00%) assert!(lo.file.contains(span_data.hi)); 85,161 ( 0.00%) assert_eq!(lo.file_index, hi.file_index); . 85,161 ( 0.00%) Some(( 28,387 ( 0.00%) lo.file.clone(), . lo.line_number, . span_data.lo - lo.line.start, 28,387 ( 0.00%) hi.line_number, . span_data.hi - hi.line.start, . )) 1,671,588 ( 0.02%) } . . fn cache_entry_index(&self, pos: BytePos) -> isize { . for (idx, cache_entry) in self.line_cache.iter().enumerate() { 2,056,151 ( 0.02%) 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() { 144,738 ( 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() { 45,512 ( 0.00%) if idx != avoid_idx 24,026 ( 0.00%) && self.line_cache[idx].time_stamp < self.line_cache[oldest].time_stamp . { . oldest = idx; . } . } . . oldest . } . 51,380 ( 0.00%) fn file_for_position(&self, pos: BytePos) -> Option<(Lrc, usize)> { 10,276 ( 0.00%) if !self.source_map.files().is_empty() { 20,552 ( 0.00%) let file_idx = self.source_map.lookup_source_file_idx(pos); . let file = &self.source_map.files()[file_idx]; . 82,208 ( 0.00%) if file_contains(file, pos) { . return Some((file.clone(), file_idx)); . } . } . . None 51,380 ( 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 ---------------------------------------- 2,498,591 ( 0.03%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_trait_selection/src/traits/fulfill.rs -------------------------------------------------------------------------------- Ir -- line 33 ---------------------------------------- . . impl<'tcx> ForestObligation for PendingPredicateObligation<'tcx> { . /// Note that we include both the `ParamEnv` and the `Predicate`, . /// as the `ParamEnv` can influence whether fulfillment succeeds . /// or fails. . type CacheKey = ty::ParamEnvAnd<'tcx, ty::Predicate<'tcx>>; . . fn as_cache_key(&self) -> Self::CacheKey { 1,912,698 ( 0.02%) self.obligation.param_env.and(self.obligation.predicate) . } . } . . /// The fulfillment context is used to drive trait resolution. It . /// consists of a list of obligations that must be (eventually) . /// satisfied. The job is to track which are satisfied, which yielded . /// errors, and which are still pending. At any point, users can call . /// `select_where_possible`, and the fulfillment context will try to do -- line 49 ---------------------------------------- -- line 95 ---------------------------------------- . } . . // `PendingPredicateObligation` is used a lot. Make sure it doesn't unintentionally get bigger. . #[cfg(all(target_arch = "x86_64", target_pointer_width = "64"))] . static_assert_size!(PendingPredicateObligation<'_>, 72); . . impl<'a, 'tcx> FulfillmentContext<'tcx> { . /// Creates a new fulfillment context. 12,404 ( 0.00%) pub fn new() -> FulfillmentContext<'tcx> { 151,492 ( 0.00%) FulfillmentContext { 16,450 ( 0.00%) predicates: ObligationForest::new(), . relationships: FxHashMap::default(), . register_region_obligations: true, . usable_in_snapshot: false, . } 12,404 ( 0.00%) } . . pub fn new_in_snapshot() -> FulfillmentContext<'tcx> { 381 ( 0.00%) FulfillmentContext { 127 ( 0.00%) predicates: ObligationForest::new(), . relationships: FxHashMap::default(), . register_region_obligations: true, . usable_in_snapshot: true, . } . } . . pub fn new_ignoring_regions() -> FulfillmentContext<'tcx> { 20,388 ( 0.00%) FulfillmentContext { 5,097 ( 0.00%) predicates: ObligationForest::new(), . relationships: FxHashMap::default(), . register_region_obligations: false, . usable_in_snapshot: false, . } . } . . /// Attempts to select obligations using `selcx`. . fn select(&mut self, selcx: &mut SelectionContext<'a, 'tcx>) -> Vec> { 148,620 ( 0.00%) let span = debug_span!("select", obligation_forest_size = ?self.predicates.len()); . let _enter = span.enter(); . . let mut errors = Vec::new(); . . loop { . debug!("select: starting another iteration"); . . // Process pending obligations. . let outcome: Outcome<_, _> = 671,713 ( 0.01%) self.predicates.process_obligations(&mut FulfillProcessor { . selcx, 95,959 ( 0.00%) register_region_obligations: self.register_region_obligations, . }); . debug!("select: outcome={:#?}", outcome); . . // FIXME: if we kept the original cache key, we could mark projection . // obligations as complete for the projection cache here. . . errors.extend(outcome.errors.into_iter().map(to_fulfillment_error)); . . // If nothing new was added, no need to keep looping. 191,918 ( 0.00%) if outcome.stalled { . break; . } . } . . debug!( . "select({} predicates remaining, {} errors) done", . self.predicates.len(), . errors.len() -- line 162 ---------------------------------------- -- line 169 ---------------------------------------- . impl<'tcx> TraitEngine<'tcx> for FulfillmentContext<'tcx> { . /// "Normalize" a projection type `::X` by . /// creating a fresh type variable `$0` as well as a projection . /// predicate `::X == $0`. When the . /// inference engine runs, it will attempt to find an impl of . /// `SomeTrait` or a where-clause that lets us unify `$0` with . /// something concrete. If this fails, we'll unify `$0` with . /// `projection_ty` again. 2,794 ( 0.00%) #[tracing::instrument(level = "debug", skip(self, infcx, param_env, cause))] . fn normalize_projection_type( . &mut self, . infcx: &InferCtxt<'_, 'tcx>, . param_env: ty::ParamEnv<'tcx>, . projection_ty: ty::ProjectionTy<'tcx>, . cause: ObligationCause<'tcx>, . ) -> Ty<'tcx> { . debug_assert!(!projection_ty.has_escaping_bound_vars()); . . // FIXME(#20304) -- cache . . let mut selcx = SelectionContext::new(infcx); . let mut obligations = vec![]; 1,143 ( 0.00%) let normalized_ty = project::normalize_projection_type( . &mut selcx, . param_env, . projection_ty, 635 ( 0.00%) cause, . 0, . &mut obligations, . ); . self.register_predicate_obligations(infcx, obligations); . . debug!(?normalized_ty); . . normalized_ty . } . 473,688 ( 0.01%) fn register_predicate_obligation( . &mut self, . infcx: &InferCtxt<'_, 'tcx>, . obligation: PredicateObligation<'tcx>, . ) { . // this helps to reduce duplicate errors, as well as making . // debug output much nicer to read and so on. 236,844 ( 0.00%) let obligation = infcx.resolve_vars_if_possible(obligation); . . debug!(?obligation, "register_predicate_obligation"); . 473,688 ( 0.01%) assert!(!infcx.is_in_snapshot() || self.usable_in_snapshot); . 236,844 ( 0.00%) super::relationships::update(self, infcx, &obligation); . . self.predicates . .register_obligation(PendingPredicateObligation { obligation, stalled_on: vec![] }); 394,740 ( 0.00%) } . 270,736 ( 0.00%) fn select_all_or_error(&mut self, infcx: &InferCtxt<'_, 'tcx>) -> Vec> { . { 33,842 ( 0.00%) let errors = self.select_where_possible(infcx); 33,842 ( 0.00%) if !errors.is_empty() { . return errors; . } . } . 169,210 ( 0.00%) self.predicates.to_errors(CodeAmbiguity).into_iter().map(to_fulfillment_error).collect() 236,894 ( 0.00%) } . 743,100 ( 0.01%) fn select_where_possible( . &mut self, . infcx: &InferCtxt<'_, 'tcx>, . ) -> Vec> { . let mut selcx = SelectionContext::new(infcx); . self.select(&mut selcx) 668,790 ( 0.01%) } . 576 ( 0.00%) fn pending_obligations(&self) -> Vec> { . self.predicates.map_pending_obligations(|o| o.obligation.clone()) 768 ( 0.00%) } . . fn relationships(&mut self) -> &mut FxHashMap { 80 ( 0.00%) &mut self.relationships 80 ( 0.00%) } . } . . struct FulfillProcessor<'a, 'b, 'tcx> { . selcx: &'a mut SelectionContext<'b, 'tcx>, . register_region_obligations: bool, . } . . fn mk_pending(os: Vec>) -> Vec> { -- line 258 ---------------------------------------- -- line 275 ---------------------------------------- . #[inline(always)] . fn process_obligation( . &mut self, . pending_obligation: &mut Self::Obligation, . ) -> ProcessResult { . // If we were stalled on some unresolved variables, first check whether . // any of them have been resolved; if not, don't bother doing more work . // yet. 21,915,168 ( 0.26%) let change = match pending_obligation.stalled_on.len() { . // Match arms are in order of frequency, which matters because this . // code is so hot. 1 and 0 dominate; 2+ is fairly rare. . 1 => { 9,776,238 ( 0.12%) let infer_var = pending_obligation.stalled_on[0]; 3,258,746 ( 0.04%) self.selcx.infcx().ty_or_const_infer_var_changed(infer_var) . } . 0 => { . // In this case we haven't changed, but wish to make a change. . true . } . _ => { . // This `for` loop was once a call to `all()`, but this lower-level . // form was a perf win. See #64545 for details. 865,893 ( 0.01%) (|| { 2,969,238 ( 0.04%) for &infer_var in &pending_obligation.stalled_on { 15,638 ( 0.00%) if self.selcx.infcx().ty_or_const_infer_var_changed(infer_var) { . return true; . } . } . false . })() . } . }; . 15 ( 0.00%) if !change { . debug!( . "process_predicate: pending obligation {:?} still stalled on {:?}", . self.selcx.infcx().resolve_vars_if_possible(pending_obligation.obligation.clone()), . pending_obligation.stalled_on . ); . return ProcessResult::Unchanged; . } . 972,918 ( 0.01%) self.progress_changed_obligations(pending_obligation) . } . 273 ( 0.00%) fn process_backedge<'c, I>( . &mut self, . cycle: I, . _marker: PhantomData<&'c PendingPredicateObligation<'tcx>>, . ) where . I: Clone + Iterator>, . { 39 ( 0.00%) if self.selcx.coinductive_match(cycle.clone().map(|s| s.obligation.predicate)) { . debug!("process_child_obligations: coinductive match"); . } else { . let cycle: Vec<_> = cycle.map(|c| c.obligation.clone()).collect(); . self.selcx.infcx().report_overflow_error_cycle(&cycle); . } 312 ( 0.00%) } . } . . impl<'a, 'b, 'tcx> FulfillProcessor<'a, 'b, 'tcx> { . // The code calling this method is extremely hot and only rarely . // actually uses this, so move this part of the code . // out of that loop. . #[inline(never)] 3,243,060 ( 0.04%) fn progress_changed_obligations( . &mut self, . pending_obligation: &mut PendingPredicateObligation<'tcx>, . ) -> ProcessResult, FulfillmentErrorCode<'tcx>> { . pending_obligation.stalled_on.truncate(0); . . let obligation = &mut pending_obligation.obligation; . 972,918 ( 0.01%) if obligation.predicate.has_infer_types_or_consts() { 273,070 ( 0.00%) obligation.predicate = 819,210 ( 0.01%) self.selcx.infcx().resolve_vars_if_possible(obligation.predicate); . } . . debug!(?obligation, ?obligation.cause, "process_obligation"); . . let infcx = self.selcx.infcx(); . 102,472 ( 0.00%) let binder = obligation.predicate.kind(); 2,270,142 ( 0.03%) match binder.no_bound_vars() { 4,279 ( 0.00%) None => match binder.skip_binder() { . // Evaluation will discard candidates using the leak check. . // This means we need to pass it the bound version of our . // predicate. . ty::PredicateKind::Trait(trait_ref) => { . let trait_obligation = obligation.with(binder.rebind(trait_ref)); . 820 ( 0.00%) self.process_trait_obligation( . obligation, 2,460 ( 0.00%) trait_obligation, . &mut pending_obligation.stalled_on, . ) . } . ty::PredicateKind::Projection(data) => { . let project_obligation = obligation.with(binder.rebind(data)); . 736 ( 0.00%) self.process_projection_obligation( . obligation, 2,208 ( 0.00%) project_obligation, . &mut pending_obligation.stalled_on, . ) . } . ty::PredicateKind::RegionOutlives(_) . | ty::PredicateKind::TypeOutlives(_) . | ty::PredicateKind::WellFormed(_) . | ty::PredicateKind::ObjectSafe(_) . | ty::PredicateKind::ClosureKind(..) -- line 386 ---------------------------------------- -- line 397 ---------------------------------------- . ty::PredicateKind::TypeWellFormedFromEnv(..) => { . bug!("TypeWellFormedFromEnv is only used for Chalk") . } . }, . Some(pred) => match pred { . ty::PredicateKind::Trait(data) => { . let trait_obligation = obligation.with(Binder::dummy(data)); . 955,275 ( 0.01%) self.process_trait_obligation( . obligation, 4,203,210 ( 0.05%) trait_obligation, . &mut pending_obligation.stalled_on, . ) . } . . ty::PredicateKind::RegionOutlives(data) => { 12,990 ( 0.00%) match infcx.region_outlives_predicate(&obligation.cause, Binder::dummy(data)) { 8,660 ( 0.00%) Ok(()) => ProcessResult::Changed(vec![]), . Err(_) => ProcessResult::Error(CodeSelectionError(Unimplemented)), . } . } . . ty::PredicateKind::TypeOutlives(ty::OutlivesPredicate(t_a, r_b)) => { 19,208 ( 0.00%) if self.register_region_obligations { 48,020 ( 0.00%) self.selcx.infcx().register_region_obligation_with_cause( . t_a, . r_b, . &obligation.cause, . ); . } . ProcessResult::Changed(vec![]) . } . . ty::PredicateKind::Projection(ref data) => { . let project_obligation = obligation.with(Binder::dummy(*data)); . 436,260 ( 0.01%) self.process_projection_obligation( . obligation, 1,308,780 ( 0.02%) project_obligation, . &mut pending_obligation.stalled_on, . ) . } . . ty::PredicateKind::ObjectSafe(trait_def_id) => { 1,172 ( 0.00%) if !self.selcx.tcx().is_object_safe(trait_def_id) { . ProcessResult::Error(CodeSelectionError(Unimplemented)) . } else { . ProcessResult::Changed(vec![]) . } . } . . ty::PredicateKind::ClosureKind(_, closure_substs, kind) => { 1,899 ( 0.00%) match self.selcx.infcx().closure_kind(closure_substs) { . Some(closure_kind) => { 3,798 ( 0.00%) if closure_kind.extends(kind) { . ProcessResult::Changed(vec![]) . } else { . ProcessResult::Error(CodeSelectionError(Unimplemented)) . } . } . None => ProcessResult::Unchanged, . } . } . . ty::PredicateKind::WellFormed(arg) => { 211,869 ( 0.00%) match wf::obligations( . self.selcx.infcx(), 60,534 ( 0.00%) obligation.param_env, 60,534 ( 0.00%) obligation.cause.body_id, 90,801 ( 0.00%) obligation.recursion_depth + 1, . arg, . obligation.cause.span, . ) { . None => { 26,460 ( 0.00%) pending_obligation.stalled_on = 46,305 ( 0.00%) vec![TyOrConstInferVar::maybe_from_generic_arg(arg).unwrap()]; 13,230 ( 0.00%) ProcessResult::Unchanged . } 70,956 ( 0.00%) Some(os) => ProcessResult::Changed(mk_pending(os)), . } . } . . ty::PredicateKind::Subtype(subtype) => { 20,528 ( 0.00%) match self.selcx.infcx().subtype_predicate( . &obligation.cause, . obligation.param_env, . Binder::dummy(subtype), . ) { . None => { . // None means that both are unresolved. 8,695 ( 0.00%) pending_obligation.stalled_on = vec![ 1,739 ( 0.00%) TyOrConstInferVar::maybe_from_ty(subtype.a).unwrap(), 3,478 ( 0.00%) TyOrConstInferVar::maybe_from_ty(subtype.b).unwrap(), . ]; . ProcessResult::Unchanged . } . Some(Ok(ok)) => ProcessResult::Changed(mk_pending(ok.obligations)), . Some(Err(err)) => { . let expected_found = . ExpectedFound::new(subtype.a_is_expected, subtype.a, subtype.b); . ProcessResult::Error(FulfillmentErrorCode::CodeSubtypeError( -- line 497 ---------------------------------------- -- line 498 ---------------------------------------- . expected_found, . err, . )) . } . } . } . . ty::PredicateKind::Coerce(coerce) => { 656 ( 0.00%) match self.selcx.infcx().coerce_predicate( . &obligation.cause, . obligation.param_env, . Binder::dummy(coerce), . ) { . None => { . // None means that both are unresolved. 200 ( 0.00%) pending_obligation.stalled_on = vec![ 40 ( 0.00%) TyOrConstInferVar::maybe_from_ty(coerce.a).unwrap(), 80 ( 0.00%) TyOrConstInferVar::maybe_from_ty(coerce.b).unwrap(), . ]; . ProcessResult::Unchanged . } . Some(Ok(ok)) => ProcessResult::Changed(mk_pending(ok.obligations)), . Some(Err(err)) => { . let expected_found = ExpectedFound::new(false, coerce.a, coerce.b); . ProcessResult::Error(FulfillmentErrorCode::CodeSubtypeError( . expected_found, -- line 523 ---------------------------------------- -- line 639 ---------------------------------------- . } . } . } . ty::PredicateKind::TypeWellFormedFromEnv(..) => { . bug!("TypeWellFormedFromEnv is only used for Chalk") . } . }, . } 2,918,754 ( 0.03%) } . 3,633,940 ( 0.04%) #[instrument(level = "debug", skip(self, obligation, stalled_on))] . fn process_trait_obligation( . &mut self, . obligation: &PredicateObligation<'tcx>, . trait_obligation: TraitObligation<'tcx>, . stalled_on: &mut Vec>, . ) -> ProcessResult, FulfillmentErrorCode<'tcx>> { 191,260 ( 0.00%) let infcx = self.selcx.infcx(); 573,780 ( 0.01%) if obligation.predicate.is_global() { . // no type variables present, can use evaluation for better caching. . // FIXME: consider caching errors too. 39,260 ( 0.00%) if infcx.predicate_must_hold_considering_regions(obligation) { . debug!( . "selecting trait at depth {} evaluated to holds", . obligation.recursion_depth . ); 39,102 ( 0.00%) return ProcessResult::Changed(vec![]); . } . } . 1,201,963 ( 0.01%) match self.selcx.select(&trait_obligation) { . Ok(Some(impl_source)) => { . debug!("selecting trait at depth {} yielded Ok(Some)", obligation.recursion_depth); 1,879,902 ( 0.02%) ProcessResult::Changed(mk_pending(impl_source.nested_obligations())) . } . Ok(None) => { . debug!("selecting trait at depth {} yielded Ok(None)", obligation.recursion_depth); . . // This is a bit subtle: for the most part, the . // only reason we can fail to make progress on . // trait selection is because we don't have enough . // information about the types in the trait. . stalled_on.clear(); . stalled_on.extend(substs_infer_vars( . self.selcx, 67,270 ( 0.00%) trait_obligation.predicate.map_bound(|pred| pred.trait_ref.substs), . )); . . debug!( . "process_predicate: pending obligation {:?} now stalled on {:?}", . infcx.resolve_vars_if_possible(obligation.clone()), . stalled_on . ); . 67,270 ( 0.00%) ProcessResult::Unchanged . } . Err(selection_err) => { . debug!("selecting trait at depth {} yielded Err", obligation.recursion_depth); . . ProcessResult::Error(CodeSelectionError(selection_err)) . } . } . } . 961,796 ( 0.01%) fn process_projection_obligation( . &mut self, . obligation: &PredicateObligation<'tcx>, . project_obligation: PolyProjectionObligation<'tcx>, . stalled_on: &mut Vec>, . ) -> ProcessResult, FulfillmentErrorCode<'tcx>> { 87,436 ( 0.00%) let tcx = self.selcx.tcx(); . 262,308 ( 0.00%) if obligation.predicate.is_global() { . // no type variables present, can use evaluation for better caching. . // FIXME: consider caching errors too. 142 ( 0.00%) if self.selcx.infcx().predicate_must_hold_considering_regions(obligation) { 426 ( 0.00%) if let Some(key) = ProjectionCacheKey::from_poly_projection_predicate( . &mut self.selcx, 497 ( 0.00%) project_obligation.predicate, . ) { . // If `predicate_must_hold_considering_regions` succeeds, then we've . // evaluated all sub-obligations. We can therefore mark the 'root' . // obligation as complete, and skip evaluating sub-obligations. 426 ( 0.00%) self.selcx . .infcx() . .inner . .borrow_mut() . .projection_cache() . .complete(key, EvaluationResult::EvaluatedToOk); . } 142 ( 0.00%) return ProcessResult::Changed(vec![]); . } else { . tracing::debug!("Does NOT hold: {:?}", obligation); . } . } . 611,555 ( 0.01%) match project::poly_project_and_unify_type(self.selcx, &project_obligation) { . Ok(Ok(Some(os))) => ProcessResult::Changed(mk_pending(os)), . Ok(Ok(None)) => { . stalled_on.clear(); . stalled_on.extend(substs_infer_vars( . self.selcx, 39,328 ( 0.00%) project_obligation.predicate.map_bound(|pred| pred.projection_ty.substs), . )); 39,328 ( 0.00%) ProcessResult::Unchanged . } . // Let the caller handle the recursion . Ok(Err(project::InProgress)) => ProcessResult::Changed(mk_pending(vec![ . project_obligation.with(project_obligation.predicate.to_predicate(tcx)), . ])), . Err(e) => ProcessResult::Error(CodeProjectionError(e)), . } 699,488 ( 0.01%) } . } . . /// Returns the set of inference variables contained in `substs`. . fn substs_infer_vars<'a, 'tcx>( . selcx: &mut SelectionContext<'a, 'tcx>, . substs: ty::Binder<'tcx, SubstsRef<'tcx>>, . ) -> impl Iterator> { . selcx . .infcx() . .resolve_vars_if_possible(substs) . .skip_binder() // ok because this check doesn't care about regions . .iter() . .filter(|arg| arg.has_infer_types_or_consts()) . .flat_map(|arg| { 639,630 ( 0.01%) let mut walker = arg.walk(); 1,151,889 ( 0.01%) while let Some(c) = walker.next() { 128,057 ( 0.00%) if !c.has_infer_types_or_consts() { . walker.visited.remove(&c); 80 ( 0.00%) walker.skip_current_subtree(); . } . } . walker.visited.into_iter() . }) . .filter_map(TyOrConstInferVar::maybe_from_generic_arg) . } . . fn to_fulfillment_error<'tcx>( -- line 778 ---------------------------------------- 17,926,668 ( 0.21%) -------------------------------------------------------------------------------- -- 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> { 4,236,487 ( 0.05%) ptr: NonZeroUsize, 8,438,704 ( 0.10%) 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; . 66,902 ( 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> { 17,433 ( 0.00%) fn pack(self) -> GenericArg<'tcx> { 17,433 ( 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) . } . }; . 656,205 ( 0.01%) GenericArg { ptr: unsafe { NonZeroUsize::new_unchecked(ptr | tag) }, marker: PhantomData } 17,433 ( 0.00%) } . } . . impl<'tcx> fmt::Debug for GenericArg<'tcx> { . fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { . match self.unpack() { . GenericArgKind::Lifetime(lt) => lt.fmt(f), . GenericArgKind::Type(ty) => ty.fmt(f), . GenericArgKind::Const(ct) => ct.fmt(f), . } . } . } . . impl<'tcx> Ord for GenericArg<'tcx> { 3 ( 0.00%) fn cmp(&self, other: &GenericArg<'_>) -> Ordering { 2 ( 0.00%) self.unpack().cmp(&other.unpack()) . } . } . . impl<'tcx> PartialOrd for GenericArg<'tcx> { . fn partial_cmp(&self, other: &GenericArg<'_>) -> Option { . Some(self.cmp(&other)) . } . } . . impl<'tcx> From> for GenericArg<'tcx> { 551,369 ( 0.01%) fn from(r: ty::Region<'tcx>) -> GenericArg<'tcx> { . GenericArgKind::Lifetime(r).pack() 551,369 ( 0.01%) } . } . . impl<'tcx> From> for GenericArg<'tcx> { 5,932,894 ( 0.07%) fn from(ty: Ty<'tcx>) -> GenericArg<'tcx> { . GenericArgKind::Type(ty).pack() 5,932,894 ( 0.07%) } . } . . impl<'tcx> From<&'tcx ty::Const<'tcx>> for GenericArg<'tcx> { 1,318 ( 0.00%) fn from(c: &'tcx ty::Const<'tcx>) -> GenericArg<'tcx> { . GenericArgKind::Const(c).pack() 1,318 ( 0.00%) } . } . . impl<'tcx> GenericArg<'tcx> { . #[inline] . pub fn unpack(self) -> GenericArgKind<'tcx> { . let ptr = self.ptr.get(); . unsafe { 50,991,195 ( 0.61%) match ptr & TAG_MASK { 256,802 ( 0.00%) REGION_TAG => GenericArgKind::Lifetime(&*((ptr & !TAG_MASK) as *const _)), 13,494,316 ( 0.16%) TYPE_TAG => GenericArgKind::Type(&*((ptr & !TAG_MASK) as *const _)), 2,101 ( 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"), . } 195,848 ( 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> { 11,373 ( 0.00%) self.unpack().encode(e) . } . } . . impl<'tcx, D: TyDecoder<'tcx>> Decodable for GenericArg<'tcx> { 87,165 ( 0.00%) fn decode(d: &mut D) -> GenericArg<'tcx> { 87,165 ( 0.00%) GenericArgKind::decode(d).pack() . } . } . . /// A substitution mapping generic parameters to new values. . pub type InternalSubsts<'tcx> = List>; . . pub type SubstsRef<'tcx> = &'tcx InternalSubsts<'tcx>; . . impl<'a, 'tcx> InternalSubsts<'tcx> { . /// Interpret these substitutions as the substitutions of a closure type. . /// Closure substitutions have a particular structure controlled by the . /// compiler that encodes information like the signature and closure kind; . /// see `ty::ClosureSubsts` struct for more comments. 15,932 ( 0.00%) pub fn as_closure(&'a self) -> ClosureSubsts<'a> { . ClosureSubsts { substs: self } 15,932 ( 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. 32,200 ( 0.00%) pub fn identity_for_item(tcx: TyCtxt<'tcx>, def_id: DefId) -> SubstsRef<'tcx> { 23,524 ( 0.00%) Self::for_item(tcx, def_id, |param, _| tcx.mk_param_from_def(param)) 28,980 ( 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. 629,218 ( 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); 223,377 ( 0.00%) Self::fill_item(&mut substs, tcx, defs, &mut mk_kind); 140,918 ( 0.00%) tcx.intern_substs(&substs) 634,140 ( 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)) . }) . } . 825,441 ( 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>, . { 341,231 ( 0.00%) if let Some(def_id) = defs.parent { . let parent_defs = tcx.generics_of(def_id); 43,149 ( 0.00%) Self::fill_item(substs, tcx, parent_defs, mk_kind); . } . Self::fill_single(substs, defs, mk_kind) 658,360 ( 0.01%) } . 40 ( 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); 689,767 ( 0.01%) assert_eq!(param.index as usize, substs.len()); . substs.push(kind); . } 40 ( 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> { 935,121 ( 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. 57,022 ( 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); 16,292 ( 0.00%) tcx.mk_substs(target_substs.iter().chain(self.iter().skip(defs.params.len()))) 65,168 ( 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> { 1,668,667 ( 0.02%) 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`. 16,562,890 ( 0.20%) match self.len() { . 1 => { 2,902,112 ( 0.03%) let param0 = self[0].try_fold_with(folder)?; 8,408,659 ( 0.10%) if param0 == self[0] { Ok(self) } else { Ok(folder.tcx().intern_substs(&[param0])) } . } . 2 => { 1,628,582 ( 0.02%) let param0 = self[0].try_fold_with(folder)?; 3,432,500 ( 0.04%) let param1 = self[1].try_fold_with(folder)?; 3,367,266 ( 0.04%) if param0 == self[0] && param1 == self[1] { . Ok(self) . } else { 2,518,546 ( 0.03%) Ok(folder.tcx().intern_substs(&[param0, param1])) . } . } . 0 => Ok(self), . _ => { . let params: SmallVec<[_; 8]> = 1,880,636 ( 0.02%) self.iter().map(|k| k.try_fold_with(folder)).collect::>()?; 101,983 ( 0.00%) if params[..] == self[..] { . Ok(self) . } else { 425,427 ( 0.01%) Ok(folder.tcx().intern_substs(¶ms)) . } . } . } 2,010,572 ( 0.02%) } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { 1,058,251 ( 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 { 2,351,303 ( 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> { 433,940 ( 0.01%) self.tcx . } . . fn fold_binder>( . &mut self, . t: ty::Binder<'tcx, T>, . ) -> ty::Binder<'tcx, T> { 880,400 ( 0.01%) self.binders_passed += 1; 210,987 ( 0.00%) let t = t.super_fold_with(self); 880,400 ( 0.01%) self.binders_passed -= 1; . t . } . 415,674 ( 0.00%) 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()`. 138,558 ( 0.00%) match *r { 113,438 ( 0.00%) ty::ReEarlyBound(data) => { 113,438 ( 0.00%) let rk = self.substs.get(data.index as usize).map(|k| k.unpack()); . match rk { 56,719 ( 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, . } 484,953 ( 0.01%) } . 2,295,819 ( 0.03%) fn fold_ty(&mut self, t: Ty<'tcx>) -> Ty<'tcx> { 765,273 ( 0.01%) if !t.needs_subst() { . return t; . } . 1,350,230 ( 0.02%) match *t.kind() { 2,422,170 ( 0.03%) ty::Param(p) => self.ty_for_param(p, t), 1,144,086 ( 0.01%) _ => t.super_fold_with(self), . } 2,872,960 ( 0.03%) } . 38,164 ( 0.00%) fn fold_const(&mut self, c: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> { 15,374 ( 0.00%) if let ty::ConstKind::Param(p) = c.val { . self.const_for_param(p, c) . } else { 41,022 ( 0.00%) c.super_fold_with(self) . } 7,152 ( 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. 968,868 ( 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. 1,788 ( 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() . ); . 1,781,871 ( 0.02%) 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> { 128,804 ( 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)] 19,889 ( 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. 4,384 ( 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, 2,271 ( 0.00%) pub self_ty: Ty<'tcx>, . } 21,068,146 ( 0.25%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_trait_selection/src/traits/project.rs -------------------------------------------------------------------------------- Ir -- line 47 ---------------------------------------- . pub enum ProjectionTyError<'tcx> { . /// ...we found multiple sources of information and couldn't resolve the ambiguity. . TooManyCandidates, . . /// ...an error occurred matching `T : TraitRef` . TraitSelectionError(SelectionError<'tcx>), . } . 15 ( 0.00%) #[derive(PartialEq, Eq, Debug)] . enum ProjectionTyCandidate<'tcx> { . /// From a where-clause in the env or object type 14,874 ( 0.00%) ParamEnv(ty::PolyProjectionPredicate<'tcx>), . . /// From the definition of `Trait` when you have something like <::B as Trait2>::C 289 ( 0.00%) TraitDef(ty::PolyProjectionPredicate<'tcx>), . . /// Bounds specified on an object type 6 ( 0.00%) Object(ty::PolyProjectionPredicate<'tcx>), . . /// From an "impl" (or a "pseudo-impl" returned by select) . Select(Selection<'tcx>), . } . . enum ProjectionTyCandidateSet<'tcx> { . None, . Single(ProjectionTyCandidate<'tcx>), . Ambiguous, . Error(SelectionError<'tcx>), . } . . impl<'tcx> ProjectionTyCandidateSet<'tcx> { . fn mark_ambiguous(&mut self) { 79,184 ( 0.00%) *self = ProjectionTyCandidateSet::Ambiguous; . } . . fn mark_error(&mut self, err: SelectionError<'tcx>) { 308 ( 0.00%) *self = ProjectionTyCandidateSet::Error(err); . } . . // Returns true if the push was successful, or false if the candidate . // was discarded -- this could be because of ambiguity, or because . // a higher-priority candidate is already there. 162,720 ( 0.00%) fn push_candidate(&mut self, candidate: ProjectionTyCandidate<'tcx>) -> bool { . use self::ProjectionTyCandidate::*; . use self::ProjectionTyCandidateSet::*; . . // This wacky variable is just used to try and . // make code readable and avoid confusing paths. . // It is assigned a "value" of `()` only on those . // paths in which we wish to convert `*self` to . // ambiguous (and return false, because the candidate . // was not used). On other paths, it is not assigned, . // and hence if those paths *could* reach the code that . // comes after the match, this fn would not compile. . let convert_to_ambiguous; . 162,720 ( 0.00%) match self { . None => { 352,495 ( 0.00%) *self = Single(candidate); . return true; . } . . Single(current) => { . // Duplicates can happen inside ParamEnv. In the case, we . // perform a lazy deduplication. . if current == &candidate { . return false; -- line 113 ---------------------------------------- -- line 115 ---------------------------------------- . . // Prefer where-clauses. As in select, if there are multiple . // candidates, we prefer where-clause candidates over impls. This . // may seem a bit surprising, since impls are the source of . // "truth" in some sense, but in fact some of the impls that SEEM . // applicable are not, because of nested obligations. Where . // clauses are the safer choice. See the comment on . // `select::SelectionCandidate` and #21974 for more details. 80 ( 0.00%) match (current, candidate) { . (ParamEnv(..), ParamEnv(..)) => convert_to_ambiguous = (), . (ParamEnv(..), _) => return false, . (_, ParamEnv(..)) => unreachable!(), . (_, _) => convert_to_ambiguous = (), . } . } . . Ambiguous | Error(..) => { -- line 131 ---------------------------------------- -- line 133 ---------------------------------------- . } . } . . // We only ever get here when we moved from a single candidate . // to ambiguous. . let () = convert_to_ambiguous; . *self = Ambiguous; . false 189,840 ( 0.00%) } . } . . /// Evaluates constraints of the form: . /// . /// for<...> ::U == V . /// . /// If successful, this may result in additional obligations. Also returns . /// the projection cache key used to track these additional obligations. -- line 149 ---------------------------------------- -- line 164 ---------------------------------------- . pub(super) fn poly_project_and_unify_type<'cx, 'tcx>( . selcx: &mut SelectionContext<'cx, 'tcx>, . obligation: &PolyProjectionObligation<'tcx>, . ) -> Result< . Result>>, InProgress>, . MismatchedProjectionTypes<'tcx>, . > { . let infcx = selcx.infcx(); 528,376 ( 0.01%) infcx.commit_if_ok(|_snapshot| { . let placeholder_predicate = 527,778 ( 0.01%) infcx.replace_bound_vars_with_placeholders(obligation.predicate); . . let placeholder_obligation = obligation.with(placeholder_predicate); 175,926 ( 0.00%) let result = project_and_unify_type(selcx, &placeholder_obligation)?; 87,963 ( 0.00%) Ok(result) . }) . } . . /// Evaluates constraints of the form: . /// . /// ::U == V . /// . /// If successful, this may result in additional obligations. . /// . /// See [poly_project_and_unify_type] for an explanation of the return value. 879,630 ( 0.01%) fn project_and_unify_type<'cx, 'tcx>( . selcx: &mut SelectionContext<'cx, 'tcx>, . obligation: &ProjectionObligation<'tcx>, . ) -> Result< . Result>>, InProgress>, . MismatchedProjectionTypes<'tcx>, . > { . debug!(?obligation, "project_and_unify_type"); . . let mut obligations = vec![]; 703,704 ( 0.01%) let normalized_ty = match opt_normalize_projection_type( . selcx, 87,963 ( 0.00%) obligation.param_env, 175,926 ( 0.00%) obligation.predicate.projection_ty, . obligation.cause.clone(), 175,926 ( 0.00%) obligation.recursion_depth, . &mut obligations, . ) { . Ok(Some(n)) => n, 159,020 ( 0.00%) Ok(None) => return Ok(Ok(None)), . Err(InProgress) => return Ok(Err(InProgress)), . }; . . debug!(?normalized_ty, ?obligations, "project_and_unify_type result"); . . let infcx = selcx.infcx(); . // FIXME(associated_const_equality): Handle consts here as well as types. 96,416 ( 0.00%) let obligation_pred_ty = obligation.predicate.term.ty().unwrap(); 144,624 ( 0.00%) match infcx.at(&obligation.cause, obligation.param_env).eq(normalized_ty, obligation_pred_ty) { . Ok(InferOk { obligations: inferred_obligations, value: () }) => { . obligations.extend(inferred_obligations); 337,456 ( 0.00%) Ok(Ok(Some(obligations))) . } . Err(err) => { . debug!("project_and_unify_type: equating types encountered error {:?}", err); . Err(MismatchedProjectionTypes { err }) . } . } 791,667 ( 0.01%) } . . /// Normalizes any associated type projections in `value`, replacing . /// them with a fully resolved type where possible. The return value . /// combines the normalized result and any additional obligations that . /// were incurred as result. 692,250 ( 0.01%) pub fn normalize<'a, 'b, 'tcx, T>( . selcx: &'a mut SelectionContext<'b, 'tcx>, . param_env: ty::ParamEnv<'tcx>, . cause: ObligationCause<'tcx>, . value: T, . ) -> Normalized<'tcx, T> . where . T: TypeFoldable<'tcx>, . { . let mut obligations = Vec::new(); . let value = normalize_to(selcx, param_env, cause, value, &mut obligations); 456,227 ( 0.01%) Normalized { value, obligations } 623,025 ( 0.01%) } . . pub fn normalize_to<'a, 'b, 'tcx, T>( . selcx: &'a mut SelectionContext<'b, 'tcx>, . param_env: ty::ParamEnv<'tcx>, . cause: ObligationCause<'tcx>, . value: T, . obligations: &mut Vec>, . ) -> T . where . T: TypeFoldable<'tcx>, . { 530,518 ( 0.01%) normalize_with_depth_to(selcx, param_env, cause, 0, value, obligations) . } . . /// As `normalize`, but with a custom depth. 131,030 ( 0.00%) pub fn normalize_with_depth<'a, 'b, 'tcx, T>( . selcx: &'a mut SelectionContext<'b, 'tcx>, . param_env: ty::ParamEnv<'tcx>, . cause: ObligationCause<'tcx>, . depth: usize, . value: T, . ) -> Normalized<'tcx, T> . where . T: TypeFoldable<'tcx>, . { . let mut obligations = Vec::new(); 896,338 ( 0.01%) let value = normalize_with_depth_to(selcx, param_env, cause, depth, value, &mut obligations); 529,035 ( 0.01%) Normalized { value, obligations } 113,598 ( 0.00%) } . 2,595,753 ( 0.03%) #[instrument(level = "info", skip(selcx, param_env, cause, obligations))] 3,651,622 ( 0.04%) pub fn normalize_with_depth_to<'a, 'b, 'tcx, T>( . selcx: &'a mut SelectionContext<'b, 'tcx>, . param_env: ty::ParamEnv<'tcx>, . cause: ObligationCause<'tcx>, . depth: usize, . value: T, . obligations: &mut Vec>, . ) -> T . where . T: TypeFoldable<'tcx>, . { . debug!(obligations.len = obligations.len()); 2,415,280 ( 0.03%) let mut normalizer = AssocTypeNormalizer::new(selcx, param_env, cause, depth, obligations); 1,797,411 ( 0.02%) let result = ensure_sufficient_stack(|| normalizer.fold(value)); . debug!(?result, obligations.len = normalizer.obligations.len()); . debug!(?normalizer.obligations,); 389,978 ( 0.00%) result 726,444 ( 0.01%) } . . pub(crate) fn needs_normalization<'tcx, T: TypeFoldable<'tcx>>(value: &T, reveal: Reveal) -> bool { . match reveal { . Reveal::UserFacing => value . .has_type_flags(ty::TypeFlags::HAS_TY_PROJECTION | ty::TypeFlags::HAS_CT_PROJECTION), . Reveal::All => value.has_type_flags( . ty::TypeFlags::HAS_TY_PROJECTION . | ty::TypeFlags::HAS_TY_OPAQUE -- line 302 ---------------------------------------- -- line 310 ---------------------------------------- . param_env: ty::ParamEnv<'tcx>, . cause: ObligationCause<'tcx>, . obligations: &'a mut Vec>, . depth: usize, . universes: Vec>, . } . . impl<'a, 'b, 'tcx> AssocTypeNormalizer<'a, 'b, 'tcx> { 62,611 ( 0.00%) fn new( . selcx: &'a mut SelectionContext<'b, 'tcx>, . param_env: ty::ParamEnv<'tcx>, . cause: ObligationCause<'tcx>, . depth: usize, . obligations: &'a mut Vec>, . ) -> AssocTypeNormalizer<'a, 'b, 'tcx> { 2,160,191 ( 0.03%) AssocTypeNormalizer { selcx, param_env, cause, obligations, depth, universes: vec![] } 62,611 ( 0.00%) } . 2,335,662 ( 0.03%) fn fold>(&mut self, value: T) -> T { 1,334,648 ( 0.02%) let value = self.selcx.infcx().resolve_vars_if_possible(value); . debug!(?value); . 439,016 ( 0.01%) assert!( . !value.has_escaping_bound_vars(), . "Normalizing {:?} without wrapping in a `Binder`", . value . ); . 803,427 ( 0.01%) if !needs_normalization(&value, self.param_env.reveal()) { 217,266 ( 0.00%) value . } else { 32,672 ( 0.00%) value.fold_with(self) . } 2,233,931 ( 0.03%) } . } . . impl<'a, 'b, 'tcx> TypeFolder<'tcx> for AssocTypeNormalizer<'a, 'b, 'tcx> { . fn tcx<'c>(&'c self) -> TyCtxt<'tcx> { 59,962 ( 0.00%) self.selcx.tcx() 2,416 ( 0.00%) } . . fn fold_binder>( . &mut self, . t: ty::Binder<'tcx, T>, . ) -> ty::Binder<'tcx, T> { . self.universes.push(None); 989 ( 0.00%) let t = t.super_fold_with(self); . self.universes.pop(); . t . } . 4,130,744 ( 0.05%) fn fold_ty(&mut self, ty: Ty<'tcx>) -> Ty<'tcx> { 1,032,686 ( 0.01%) if !needs_normalization(&ty, self.param_env.reveal()) { . return ty; . } . . // We try to be a little clever here as a performance optimization in . // cases where there are nested projections under binders. . // For example: . // ``` . // for<'a> fn(::One<'a, Box::Two<'a>>>>) -- line 370 ---------------------------------------- -- line 381 ---------------------------------------- . // . // This is possible because the inner `'a` will already be a placeholder . // when we need to normalize the inner projection . // . // On the other hand, this does add a bit of complexity, since we only . // replace bound vars if the current type is a `Projection` and we need . // to make sure we don't forget to fold the substs regardless. . 801,423 ( 0.01%) match *ty.kind() { . // This is really important. While we *can* handle this, this has . // severe performance implications for large opaque types with . // late-bound regions. See `issue-88862` benchmark. . ty::Opaque(def_id, substs) if !substs.has_escaping_bound_vars() => { . // Only normalize `impl Trait` after type-checking, usually in codegen. . match self.param_env.reveal() { . Reveal::UserFacing => ty.super_fold_with(self), . -- line 397 ---------------------------------------- -- line 421 ---------------------------------------- . ty::Projection(data) if !data.has_escaping_bound_vars() => { . // This branch is *mostly* just an optimization: when we don't . // have escaping bound vars, we don't need to replace them with . // placeholders (see branch below). *Also*, we know that we can . // register an obligation to *later* project, since we know . // there won't be bound vars there. . . let data = data.super_fold_with(self); 833,406 ( 0.01%) let normalized_ty = normalize_projection_type( 138,901 ( 0.00%) self.selcx, 138,901 ( 0.00%) self.param_env, . data, . self.cause.clone(), 138,901 ( 0.00%) self.depth, 138,901 ( 0.00%) &mut self.obligations, . ); . debug!( . ?self.depth, . ?ty, . ?normalized_ty, . obligations.len = ?self.obligations.len(), . "AssocTypeNormalizer: normalized type" . ); -- line 443 ---------------------------------------- -- line 490 ---------------------------------------- . obligations.len = ?self.obligations.len(), . "AssocTypeNormalizer: normalized type" . ); . normalized_ty . } . . _ => ty.super_fold_with(self), . } 4,647,087 ( 0.06%) } . . fn fold_const(&mut self, constant: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> { . if self.selcx.tcx().lazy_normalization() { . constant . } else { . let constant = constant.super_fold_with(self); . constant.eval(self.selcx.tcx(), self.param_env) . } -- line 506 ---------------------------------------- -- line 781 ---------------------------------------- . } . . /// The guts of `normalize`: normalize a specific projection like `::Item`. The result is always a type (and possibly . /// additional obligations). If ambiguity arises, which implies that . /// there are unresolved type variables in the projection, we will . /// substitute a fresh type variable `$X` and generate a new . /// obligation `::Item == $X` for later. 1,395,260 ( 0.02%) pub fn normalize_projection_type<'a, 'b, 'tcx>( . selcx: &'a mut SelectionContext<'b, 'tcx>, . param_env: ty::ParamEnv<'tcx>, . projection_ty: ty::ProjectionTy<'tcx>, . cause: ObligationCause<'tcx>, . depth: usize, . obligations: &mut Vec>, . ) -> Ty<'tcx> { 1,116,208 ( 0.01%) opt_normalize_projection_type( . selcx, . param_env, . projection_ty, . cause.clone(), . depth, . obligations, . ) . .ok() . .flatten() . .unwrap_or_else(move || { . // if we bottom out in ambiguity, create a type variable . // and a deferred predicate to resolve this when more type . // information is available. . 556,892 ( 0.01%) selcx.infcx().infer_projection(param_env, projection_ty, cause, depth + 1, obligations) . }) 1,255,734 ( 0.02%) } . . /// The guts of `normalize`: normalize a specific projection like `::Item`. The result is always a type (and possibly . /// additional obligations). Returns `None` in the case of ambiguity, . /// which indicates that there are unbound type variables. . /// . /// This function used to return `Option>`, which contains a . /// `Ty<'tcx>` and an obligations vector. But that obligation vector was very . /// often immediately appended to another obligations vector. So now this . /// function takes an obligations vector and appends to it directly, which is . /// slightly uglier but avoids the need for an extra short-lived allocation. 5,480,149 ( 0.07%) #[instrument(level = "debug", skip(selcx, param_env, cause, obligations))] . fn opt_normalize_projection_type<'a, 'b, 'tcx>( . selcx: &'a mut SelectionContext<'b, 'tcx>, . param_env: ty::ParamEnv<'tcx>, . projection_ty: ty::ProjectionTy<'tcx>, . cause: ObligationCause<'tcx>, . depth: usize, . obligations: &mut Vec>, . ) -> Result>, InProgress> { . let infcx = selcx.infcx(); . // Don't use the projection cache in intercrate mode - . // the `infcx` may be re-used between intercrate in non-intercrate . // mode, which could lead to using incorrect cache results. . let use_cache = !selcx.is_intercrate(); . . let projection_ty = infcx.resolve_vars_if_possible(projection_ty); 682,467 ( 0.01%) let cache_key = ProjectionCacheKey::new(projection_ty); . . // FIXME(#20304) For now, I am caching here, which is good, but it . // means we don't capture the type variables that are created in . // the case of ambiguity. Which means we may create a large stream . // of such variables. OTOH, if we move the caching up a level, we . // would not benefit from caching when proving `T: Trait` . // bounds. It might be the case that we want two distinct caches, . // or else another kind of cache entry. . 227,489 ( 0.00%) let cache_result = if use_cache { 1,364,934 ( 0.02%) infcx.inner.borrow_mut().projection_cache().try_start(cache_key) . } else { . Ok(()) . }; 1,364,934 ( 0.02%) match cache_result { . Ok(()) => debug!("no cache"), . Err(ProjectionCacheEntry::Ambiguous) => { . // If we found ambiguity the last time, that means we will continue . // to do so until some type in the key changes (and we know it . // hasn't, because we just fully resolved it). . debug!("found cache entry: ambiguous"); . return Ok(None); . } -- line 865 ---------------------------------------- -- line 882 ---------------------------------------- . infcx.inner.borrow_mut().projection_cache().recur(cache_key); . } . return Err(InProgress); . } . Err(ProjectionCacheEntry::Recur) => { . debug!("recur cache"); . return Err(InProgress); . } 266,230 ( 0.00%) Err(ProjectionCacheEntry::NormalizedTy { ty, complete: _ }) => { . // This is the hottest path in this function. . // . // If we find the value in the cache, then return it along . // with the obligations that went along with it. Note . // that, when using a fulfillment context, these . // obligations could in principle be ignored: they have . // already been registered when the cache entry was . // created (and hence the new ones will quickly be -- line 898 ---------------------------------------- -- line 908 ---------------------------------------- . let result = normalize_to_error(selcx, param_env, projection_ty, cause, depth); . obligations.extend(result.obligations); . return Ok(Some(result.value)); . } . } . . let obligation = Obligation::with_depth(cause.clone(), depth, param_env, projection_ty); . 371,853 ( 0.00%) match project_type(selcx, &obligation) { . Ok(ProjectedTy::Progress(Progress { . ty: projected_ty, 55,084 ( 0.00%) obligations: mut projected_obligations, . })) => { . // if projection succeeded, then what we get out of this . // is also non-normalized (consider: it was derived from . // an impl, where-clause etc) and hence we must . // re-normalize it . . let projected_ty = selcx.infcx().resolve_vars_if_possible(projected_ty); . debug!(?projected_ty, ?depth, ?projected_obligations); . 13,771 ( 0.00%) let mut result = if projected_ty.has_projections() { . let mut normalizer = AssocTypeNormalizer::new( . selcx, . param_env, 22,352 ( 0.00%) cause, 11,176 ( 0.00%) depth + 1, . &mut projected_obligations, . ); 11,176 ( 0.00%) let normalized_ty = normalizer.fold(projected_ty); . . debug!(?normalized_ty, ?depth); . 27,940 ( 0.00%) Normalized { value: normalized_ty, obligations: projected_obligations } . } else { 49,098 ( 0.00%) Normalized { value: projected_ty, obligations: projected_obligations } . }; . . let mut deduped: SsoHashSet<_> = Default::default(); 13,771 ( 0.00%) result.obligations.drain_filter(|projected_obligation| { . if !deduped.insert(projected_obligation.clone()) { . return true; . } . false . }); . 13,771 ( 0.00%) if use_cache { 41,313 ( 0.00%) infcx.inner.borrow_mut().projection_cache().insert_ty(cache_key, result.clone()); . } . obligations.extend(result.obligations); 13,771 ( 0.00%) Ok(Some(result.value)) . } . Ok(ProjectedTy::NoProgress(projected_ty)) => { . debug!(?projected_ty, "opt_normalize_projection_type: no progress"); 2,096 ( 0.00%) let result = Normalized { value: projected_ty, obligations: vec![] }; 1,048 ( 0.00%) if use_cache { 3,144 ( 0.00%) infcx.inner.borrow_mut().projection_cache().insert_ty(cache_key, result.clone()); . } . // No need to extend `obligations`. 1,048 ( 0.00%) Ok(Some(result.value)) . } . Err(ProjectionTyError::TooManyCandidates) => { . debug!("opt_normalize_projection_type: too many candidates"); 26,476 ( 0.00%) if use_cache { 158,856 ( 0.00%) infcx.inner.borrow_mut().projection_cache().ambiguous(cache_key); . } . Ok(None) . } . Err(ProjectionTyError::TraitSelectionError(_)) => { . debug!("opt_normalize_projection_type: ERROR"); . // if we got an error processing the `T as Trait` part, . // just return `ty::err` but add the obligation `T : . // Trait`, which when processed will cause the error to be . // reported later . 22 ( 0.00%) if use_cache { 132 ( 0.00%) infcx.inner.borrow_mut().projection_cache().error(cache_key); . } 308 ( 0.00%) let result = normalize_to_error(selcx, param_env, projection_ty, cause, depth); . obligations.extend(result.obligations); 66 ( 0.00%) Ok(Some(result.value)) . } . } . } . . /// If we are projecting `::Item`, but `T: Trait` does not . /// hold. In various error cases, we cannot generate a valid . /// normalized projection. Therefore, we create an inference variable . /// return an associated obligation that, when fulfilled, will lead to -- line 996 ---------------------------------------- -- line 1004 ---------------------------------------- . /// paths you want to take. To make things worse, it was possible for . /// cycles to arise, where you basically had a setup like ` . /// as Trait>::Foo == $0`. Here, normalizing ` as . /// Trait>::Foo> to `[type error]` would lead to an obligation of . /// ` as Trait>::Foo`. We are supposed to report . /// an error for this obligation, but we legitimately should not, . /// because it contains `[type error]`. Yuck! (See issue #29857 for . /// one case where this arose.) 264 ( 0.00%) fn normalize_to_error<'a, 'tcx>( . selcx: &mut SelectionContext<'a, 'tcx>, . param_env: ty::ParamEnv<'tcx>, . projection_ty: ty::ProjectionTy<'tcx>, . cause: ObligationCause<'tcx>, . depth: usize, . ) -> NormalizedTy<'tcx> { 22 ( 0.00%) let trait_ref = ty::Binder::dummy(projection_ty.trait_ref(selcx.tcx())); 176 ( 0.00%) let trait_obligation = Obligation { 88 ( 0.00%) cause, . recursion_depth: depth, . param_env, 22 ( 0.00%) predicate: trait_ref.without_const().to_predicate(selcx.tcx()), . }; 22 ( 0.00%) let tcx = selcx.infcx().tcx; . let def_id = projection_ty.item_def_id; 110 ( 0.00%) let new_value = selcx.infcx().next_ty_var(TypeVariableOrigin { . kind: TypeVariableOriginKind::NormalizeProjectionType, . span: tcx.def_span(def_id), . }); 242 ( 0.00%) Normalized { value: new_value, obligations: vec![trait_obligation] } 176 ( 0.00%) } . . enum ProjectedTy<'tcx> { . Progress(Progress<'tcx>), . NoProgress(Ty<'tcx>), . } . . struct Progress<'tcx> { . ty: Ty<'tcx>, -- line 1041 ---------------------------------------- -- line 1042 ---------------------------------------- . obligations: Vec>, . } . . impl<'tcx> Progress<'tcx> { . fn error(tcx: TyCtxt<'tcx>) -> Self { . Progress { ty: tcx.ty_error(), obligations: vec![] } . } . 86,580 ( 0.00%) fn with_addl_obligations(mut self, mut obligations: Vec>) -> Self { . debug!( . self.obligations.len = ?self.obligations.len(), . obligations.len = obligations.len(), . "with_addl_obligations" . ); . . debug!(?self.obligations, ?obligations, "with_addl_obligations"); . 8,658 ( 0.00%) self.obligations.append(&mut obligations); 51,948 ( 0.00%) self 35,968 ( 0.00%) } . } . . /// Computes the result of a projection type (if we can). . /// . /// IMPORTANT: . /// - `obligation` must be fully normalized 743,706 ( 0.01%) #[tracing::instrument(level = "info", skip(selcx))] . fn project_type<'cx, 'tcx>( . selcx: &mut SelectionContext<'cx, 'tcx>, . obligation: &ProjectionTyObligation<'tcx>, . ) -> Result, ProjectionTyError<'tcx>> { 123,951 ( 0.00%) if !selcx.tcx().recursion_limit().value_within_limit(obligation.recursion_depth) { . debug!("project: overflow!"); . // This should really be an immediate error, but some existing code . // relies on being able to recover from this. . return Err(ProjectionTyError::TraitSelectionError(SelectionError::Overflow)); . } . . if obligation.predicate.references_error() { . return Ok(ProjectedTy::Progress(Progress::error(selcx.tcx()))); . } . 41,317 ( 0.00%) let mut candidates = ProjectionTyCandidateSet::None; . . // Make sure that the following procedures are kept in order. ParamEnv . // needs to be first because it has highest priority, and Select checks . // the return value of push_candidate which assumes it's ran at last. 82,634 ( 0.00%) assemble_candidates_from_param_env(selcx, obligation, &mut candidates); . 80,312 ( 0.00%) assemble_candidates_from_trait_def(selcx, obligation, &mut candidates); . 82,634 ( 0.00%) assemble_candidates_from_object_ty(selcx, obligation, &mut candidates); . 33,582 ( 0.00%) if let ProjectionTyCandidateSet::Single(ProjectionTyCandidate::Object(_)) = candidates { . // Avoid normalization cycle from selection (see . // `assemble_candidates_from_object_ty`). . // FIXME(lazy_normalization): Lazy normalization should save us from . // having to special case this. . } else { 82,622 ( 0.00%) assemble_candidates_from_impls(selcx, obligation, &mut candidates); . }; . 206,555 ( 0.00%) match candidates { . ProjectionTyCandidateSet::Single(candidate) => { 302,962 ( 0.00%) Ok(ProjectedTy::Progress(confirm_candidate(selcx, obligation, candidate))) . } 5,240 ( 0.00%) ProjectionTyCandidateSet::None => Ok(ProjectedTy::NoProgress( . selcx . .tcx() 2,096 ( 0.00%) .mk_projection(obligation.predicate.item_def_id, obligation.predicate.substs), . )), . // Error occurred while trying to processing impls. 352 ( 0.00%) ProjectionTyCandidateSet::Error(e) => Err(ProjectionTyError::TraitSelectionError(e)), . // Inherent ambiguity that prevents us from even enumerating the . // candidates. 105,904 ( 0.00%) ProjectionTyCandidateSet::Ambiguous => Err(ProjectionTyError::TooManyCandidates), . } 110,180 ( 0.00%) } . . /// The first thing we have to do is scan through the parameter . /// environment to see whether there are any projection predicates . /// there that can answer this question. . fn assemble_candidates_from_param_env<'cx, 'tcx>( . selcx: &mut SelectionContext<'cx, 'tcx>, . obligation: &ProjectionTyObligation<'tcx>, . candidate_set: &mut ProjectionTyCandidateSet<'tcx>, . ) { . debug!("assemble_candidates_from_param_env(..)"); . assemble_candidates_from_predicates( . selcx, . obligation, . candidate_set, . ProjectionTyCandidate::ParamEnv, 41,317 ( 0.00%) obligation.param_env.caller_bounds().iter(), . false, . ); . } . . /// In the case of a nested projection like <::FooT as Bar>::BarT, we may find . /// that the definition of `Foo` has some clues: . /// . /// ``` -- line 1143 ---------------------------------------- -- line 1152 ---------------------------------------- . obligation: &ProjectionTyObligation<'tcx>, . candidate_set: &mut ProjectionTyCandidateSet<'tcx>, . ) { . debug!("assemble_candidates_from_trait_def(..)"); . . let tcx = selcx.tcx(); . // Check whether the self-type is itself a projection. . // If so, extract what we know from the trait and try to come up with a good answer. 442,468 ( 0.01%) let bounds = match *obligation.predicate.self_ty().kind() { 1,014 ( 0.00%) ty::Projection(ref data) => tcx.item_bounds(data.item_def_id).subst(tcx, data.substs), 858 ( 0.00%) ty::Opaque(def_id, substs) => tcx.item_bounds(def_id).subst(tcx, substs), . ty::Infer(ty::TyVar(_)) => { . // If the self-type is an inference variable, then it MAY wind up . // being a projected type, so induce an ambiguity. . candidate_set.mark_ambiguous(); . return; . } . _ => return, . }; -- line 1170 ---------------------------------------- -- line 1192 ---------------------------------------- . selcx: &mut SelectionContext<'cx, 'tcx>, . obligation: &ProjectionTyObligation<'tcx>, . candidate_set: &mut ProjectionTyCandidateSet<'tcx>, . ) { . debug!("assemble_candidates_from_object_ty(..)"); . . let tcx = selcx.tcx(); . 82,634 ( 0.00%) let self_ty = obligation.predicate.self_ty(); . let object_ty = selcx.infcx().shallow_resolve(self_ty); 206,585 ( 0.00%) let data = match object_ty.kind() { . ty::Dynamic(data, ..) => data, . ty::Infer(ty::TyVar(_)) => { . // If the self-type is an inference variable, then it MAY wind up . // being an object type, so induce an ambiguity. . candidate_set.mark_ambiguous(); . return; . } . _ => return, . }; 6 ( 0.00%) let env_predicates = data . .projection_bounds() 12 ( 0.00%) .filter(|bound| bound.item_def_id() == obligation.predicate.item_def_id) 54 ( 0.00%) .map(|p| p.with_self_ty(tcx, object_ty).to_predicate(tcx)); . . assemble_candidates_from_predicates( . selcx, . obligation, . candidate_set, . ProjectionTyCandidate::Object, . env_predicates, . false, -- line 1223 ---------------------------------------- -- line 1232 ---------------------------------------- . selcx: &mut SelectionContext<'cx, 'tcx>, . obligation: &ProjectionTyObligation<'tcx>, . candidate_set: &mut ProjectionTyCandidateSet<'tcx>, . ctor: fn(ty::PolyProjectionPredicate<'tcx>) -> ProjectionTyCandidate<'tcx>, . env_predicates: impl Iterator>, . potentially_unnormalized_candidates: bool, . ) { . let infcx = selcx.infcx(); 2,051 ( 0.00%) for predicate in env_predicates { . debug!(?predicate); . let bound_predicate = predicate.kind(); 1,099,914 ( 0.01%) if let ty::PredicateKind::Projection(data) = predicate.kind().skip_binder() { 314,644 ( 0.00%) let data = bound_predicate.rebind(data); 157,322 ( 0.00%) let same_def_id = data.projection_def_id() == obligation.predicate.item_def_id; . 110,291 ( 0.00%) let is_match = same_def_id . && infcx.probe(|_| { 47,451 ( 0.00%) selcx.match_projection_projections( . obligation, 142,323 ( 0.00%) data, . potentially_unnormalized_candidates, . ) . }); . . debug!(?data, ?is_match, ?same_def_id); . 31,630 ( 0.00%) if is_match { 166,564 ( 0.00%) candidate_set.push_candidate(ctor(data)); . . if potentially_unnormalized_candidates . && !obligation.predicate.has_infer_types_or_consts() . { . // HACK: Pick the first trait def candidate for a fully . // inferred predicate. This is to allow duplicates that . // differ only in normalization. . return; -- line 1267 ---------------------------------------- -- line 1274 ---------------------------------------- . #[tracing::instrument(level = "debug", skip(selcx, obligation, candidate_set))] . fn assemble_candidates_from_impls<'cx, 'tcx>( . selcx: &mut SelectionContext<'cx, 'tcx>, . obligation: &ProjectionTyObligation<'tcx>, . candidate_set: &mut ProjectionTyCandidateSet<'tcx>, . ) { . // If we are resolving `>::Item == Type`, . // start out by selecting the predicate `T as TraitRef<...>`: 123,933 ( 0.00%) let poly_trait_ref = ty::Binder::dummy(obligation.predicate.trait_ref(selcx.tcx())); 82,622 ( 0.00%) let trait_obligation = obligation.with(poly_trait_ref.to_poly_trait_predicate()); 371,799 ( 0.00%) let _ = selcx.infcx().commit_if_ok(|_| { 247,822 ( 0.00%) let impl_source = match selcx.select(&trait_obligation) { 148,130 ( 0.00%) Ok(Some(impl_source)) => impl_source, . Ok(None) => { . candidate_set.mark_ambiguous(); . return Err(()); . } . Err(e) => { . debug!(error = ?e, "selection error"); . candidate_set.mark_error(e); . return Err(()); . } . }; . 74,065 ( 0.00%) let eligible = match &impl_source { . super::ImplSource::Closure(_) . | super::ImplSource::Generator(_) . | super::ImplSource::FnPointer(_) . | super::ImplSource::TraitAlias(_) => { . debug!(?impl_source); . true . } . super::ImplSource::UserDefined(impl_data) => { -- line 1306 ---------------------------------------- -- line 1322 ---------------------------------------- . // . // In either case, we handle this by not adding a . // candidate for an impl if it contains a `default` . // type. . // . // NOTE: This should be kept in sync with the similar code in . // `rustc_ty_utils::instance::resolve_associated_item()`. . let node_item = 68,454 ( 0.00%) assoc_ty_def(selcx, impl_data.impl_def_id, obligation.predicate.item_def_id) . .map_err(|ErrorReported| ())?; . 22,818 ( 0.00%) if node_item.is_final() { . // Non-specializable items are always projectable. . true . } else { . // Only reveal a specializable default if we're past type-checking . // and the obligation is monomorphic, otherwise passes such as . // transmute checking and polymorphic MIR optimizations could . // get a result which isn't correct for all monomorphizations. . if obligation.param_env.reveal() == Reveal::All { -- line 1341 ---------------------------------------- -- line 1353 ---------------------------------------- . } . } . } . super::ImplSource::DiscriminantKind(..) => { . // While `DiscriminantKind` is automatically implemented for every type, . // the concrete discriminant may not be known yet. . // . // Any type with multiple potential discriminant types is therefore not eligible. 48 ( 0.00%) let self_ty = selcx.infcx().shallow_resolve(obligation.predicate.self_ty()); . 48 ( 0.00%) match self_ty.kind() { . ty::Bool . | ty::Char . | ty::Int(_) . | ty::Uint(_) . | ty::Float(_) . | ty::Adt(..) . | ty::Foreign(_) . | ty::Str -- line 1371 ---------------------------------------- -- line 1495 ---------------------------------------- . obligation.cause.span, . &format!("Cannot project an associated type from `{:?}`", impl_source), . ); . return Err(()); . } . }; . . if eligible { 167,314 ( 0.00%) if candidate_set.push_candidate(ProjectionTyCandidate::Select(impl_source)) { . Ok(()) . } else { . Err(()) . } . } else { . Err(()) . } 5,724 ( 0.00%) }); . } . . fn confirm_candidate<'cx, 'tcx>( . selcx: &mut SelectionContext<'cx, 'tcx>, . obligation: &ProjectionTyObligation<'tcx>, . candidate: ProjectionTyCandidate<'tcx>, . ) -> Progress<'tcx> { . debug!(?obligation, ?candidate, "confirm_candidate"); 68,855 ( 0.00%) let mut progress = match candidate { . ProjectionTyCandidate::ParamEnv(poly_projection) . | ProjectionTyCandidate::Object(poly_projection) => { 21,504 ( 0.00%) confirm_param_env_candidate(selcx, obligation, poly_projection, false) . } . . ProjectionTyCandidate::TraitDef(poly_projection) => { 3,757 ( 0.00%) confirm_param_env_candidate(selcx, obligation, poly_projection, true) . } . . ProjectionTyCandidate::Select(impl_source) => { 119,460 ( 0.00%) confirm_select_candidate(selcx, obligation, impl_source) . } . }; . // When checking for cycle during evaluation, we compare predicates with . // "syntactic" equality. Since normalization generally introduces a type . // with new region variables, we need to resolve them to existing variables . // when possible for this to work. See `auto-trait-projection-recursion.rs` . // for a case where this matters. 14,893 ( 0.00%) if progress.ty.has_infer_regions() { 12,222 ( 0.00%) progress.ty = OpportunisticRegionResolver::new(selcx.infcx()).fold_ty(progress.ty); . } . progress . } . . fn confirm_select_candidate<'cx, 'tcx>( . selcx: &mut SelectionContext<'cx, 'tcx>, . obligation: &ProjectionTyObligation<'tcx>, . impl_source: Selection<'tcx>, . ) -> Progress<'tcx> { 59,730 ( 0.00%) match impl_source { 38,005 ( 0.00%) super::ImplSource::UserDefined(data) => confirm_impl_candidate(selcx, obligation, data), . super::ImplSource::Generator(data) => confirm_generator_candidate(selcx, obligation, data), 24,972 ( 0.00%) super::ImplSource::Closure(data) => confirm_closure_candidate(selcx, obligation, data), 835 ( 0.00%) super::ImplSource::FnPointer(data) => confirm_fn_pointer_candidate(selcx, obligation, data), . super::ImplSource::DiscriminantKind(data) => { . confirm_discriminant_kind_candidate(selcx, obligation, data) . } . super::ImplSource::Pointee(data) => confirm_pointee_candidate(selcx, obligation, data), . super::ImplSource::Object(_) . | super::ImplSource::AutoImpl(..) . | super::ImplSource::Param(..) . | super::ImplSource::Builtin(..) -- line 1562 ---------------------------------------- -- line 1625 ---------------------------------------- . . fn confirm_discriminant_kind_candidate<'cx, 'tcx>( . selcx: &mut SelectionContext<'cx, 'tcx>, . obligation: &ProjectionTyObligation<'tcx>, . _: ImplSourceDiscriminantKindData, . ) -> Progress<'tcx> { . let tcx = selcx.tcx(); . 32 ( 0.00%) let self_ty = selcx.infcx().shallow_resolve(obligation.predicate.self_ty()); . // We get here from `poly_project_and_unify_type` which replaces bound vars . // with placeholders . debug_assert!(!self_ty.has_escaping_bound_vars()); 16 ( 0.00%) let substs = tcx.mk_substs([self_ty.into()].iter()); . 80 ( 0.00%) let discriminant_def_id = tcx.require_lang_item(LangItem::Discriminant, None); . . let predicate = ty::ProjectionPredicate { . projection_ty: ty::ProjectionTy { substs, item_def_id: discriminant_def_id }, 48 ( 0.00%) term: self_ty.discriminant_ty(tcx).into(), . }; . . // We get here from `poly_project_and_unify_type` which replaces bound vars . // with placeholders, so dummy is okay here. 192 ( 0.00%) confirm_param_env_candidate(selcx, obligation, ty::Binder::dummy(predicate), false) . } . . fn confirm_pointee_candidate<'cx, 'tcx>( . selcx: &mut SelectionContext<'cx, 'tcx>, . obligation: &ProjectionTyObligation<'tcx>, . _: ImplSourcePointeeData, . ) -> Progress<'tcx> { . let tcx = selcx.tcx(); -- line 1656 ---------------------------------------- -- line 1680 ---------------------------------------- . .with_addl_obligations(obligations) . } . . fn confirm_fn_pointer_candidate<'cx, 'tcx>( . selcx: &mut SelectionContext<'cx, 'tcx>, . obligation: &ProjectionTyObligation<'tcx>, . fn_pointer_impl_source: ImplSourceFnPointerData<'tcx, PredicateObligation<'tcx>>, . ) -> Progress<'tcx> { 167 ( 0.00%) let fn_type = selcx.infcx().shallow_resolve(fn_pointer_impl_source.fn_ty); 334 ( 0.00%) let sig = fn_type.fn_sig(selcx.tcx()); 1,670 ( 0.00%) let Normalized { value: sig, obligations } = normalize_with_depth( . selcx, 167 ( 0.00%) obligation.param_env, . obligation.cause.clone(), 501 ( 0.00%) obligation.recursion_depth + 1, 1,336 ( 0.00%) sig, . ); . 501 ( 0.00%) confirm_callable_candidate(selcx, obligation, sig, util::TupleArgumentsFlag::Yes) 1,169 ( 0.00%) .with_addl_obligations(fn_pointer_impl_source.nested) 1,169 ( 0.00%) .with_addl_obligations(obligations) . } . . fn confirm_closure_candidate<'cx, 'tcx>( . selcx: &mut SelectionContext<'cx, 'tcx>, . obligation: &ProjectionTyObligation<'tcx>, . impl_source: ImplSourceClosureData<'tcx, PredicateObligation<'tcx>>, . ) -> Progress<'tcx> { 16,648 ( 0.00%) let closure_sig = impl_source.substs.as_closure().sig(); 41,620 ( 0.00%) let Normalized { value: closure_sig, obligations } = normalize_with_depth( . selcx, 4,162 ( 0.00%) obligation.param_env, . obligation.cause.clone(), 12,486 ( 0.00%) obligation.recursion_depth + 1, 33,296 ( 0.00%) closure_sig, . ); . . debug!(?obligation, ?closure_sig, ?obligations, "confirm_closure_candidate"); . 12,486 ( 0.00%) confirm_callable_candidate(selcx, obligation, closure_sig, util::TupleArgumentsFlag::No) 29,134 ( 0.00%) .with_addl_obligations(impl_source.nested) 29,134 ( 0.00%) .with_addl_obligations(obligations) . } . . fn confirm_callable_candidate<'cx, 'tcx>( . selcx: &mut SelectionContext<'cx, 'tcx>, . obligation: &ProjectionTyObligation<'tcx>, . fn_sig: ty::PolyFnSig<'tcx>, . flag: util::TupleArgumentsFlag, . ) -> Progress<'tcx> { . let tcx = selcx.tcx(); . . debug!(?obligation, ?fn_sig, "confirm_callable_candidate"); . 21,645 ( 0.00%) let fn_once_def_id = tcx.require_lang_item(LangItem::FnOnce, None); 21,645 ( 0.00%) let fn_once_output_def_id = tcx.require_lang_item(LangItem::FnOnceOutput, None); . 43,290 ( 0.00%) let predicate = super::util::closure_trait_ref_and_return_type( . tcx, . fn_once_def_id, 8,658 ( 0.00%) obligation.predicate.self_ty(), 17,316 ( 0.00%) fn_sig, . flag, . ) . .map_bound(|(trait_ref, ret_type)| ty::ProjectionPredicate { . projection_ty: ty::ProjectionTy { . substs: trait_ref.substs, . item_def_id: fn_once_output_def_id, . }, . term: ret_type.into(), . }); . 51,948 ( 0.00%) confirm_param_env_candidate(selcx, obligation, predicate, true) . } . 74,040 ( 0.00%) fn confirm_param_env_candidate<'cx, 'tcx>( . selcx: &mut SelectionContext<'cx, 'tcx>, . obligation: &ProjectionTyObligation<'tcx>, . poly_cache_entry: ty::PolyProjectionPredicate<'tcx>, . potentially_unnormalized_candidate: bool, . ) -> Progress<'tcx> { . let infcx = selcx.infcx(); . let cause = &obligation.cause; 12,340 ( 0.00%) let param_env = obligation.param_env; . 24,680 ( 0.00%) let (cache_entry, _) = infcx.replace_bound_vars_with_fresh_vars( 18,510 ( 0.00%) cause.span, . LateBoundRegionConversionTime::HigherRankedType, . poly_cache_entry, . ); . 12,340 ( 0.00%) let cache_projection = cache_entry.projection_ty; . let mut nested_obligations = Vec::new(); 18,510 ( 0.00%) let obligation_projection = obligation.predicate; 49,360 ( 0.00%) let obligation_projection = ensure_sufficient_stack(|| { 24,680 ( 0.00%) normalize_with_depth_to( . selcx, 6,170 ( 0.00%) obligation.param_env, . obligation.cause.clone(), 18,510 ( 0.00%) obligation.recursion_depth + 1, 12,340 ( 0.00%) obligation_projection, . &mut nested_obligations, . ) . }); 12,340 ( 0.00%) let cache_projection = if potentially_unnormalized_candidate { 32,326 ( 0.00%) ensure_sufficient_stack(|| { 18,472 ( 0.00%) normalize_with_depth_to( . selcx, 4,618 ( 0.00%) obligation.param_env, . obligation.cause.clone(), 13,854 ( 0.00%) obligation.recursion_depth + 1, 9,236 ( 0.00%) cache_projection, . &mut nested_obligations, . ) . }) . } else { 3,104 ( 0.00%) cache_projection . }; . . debug!(?cache_projection, ?obligation_projection); . 12,340 ( 0.00%) match infcx.at(cause, param_env).eq(cache_projection, obligation_projection) { . Ok(InferOk { value: _, obligations }) => { . nested_obligations.extend(obligations); 12,340 ( 0.00%) assoc_ty_own_obligations(selcx, obligation, &mut nested_obligations); . // FIXME(associated_const_equality): Handle consts here as well? Maybe this progress type should just take . // a term instead. 49,360 ( 0.00%) Progress { ty: cache_entry.term.ty().unwrap(), obligations: nested_obligations } . } . Err(e) => { . let msg = format!( . "Failed to unify obligation `{:?}` with poly_projection `{:?}`: {:?}", . obligation, poly_cache_entry, e, . ); . debug!("confirm_param_env_candidate: {}", msg); . let err = infcx.tcx.ty_error_with_message(obligation.cause.span, &msg); . Progress { ty: err, obligations: vec![] } . } . } 49,360 ( 0.00%) } . . fn confirm_impl_candidate<'cx, 'tcx>( . selcx: &mut SelectionContext<'cx, 'tcx>, . obligation: &ProjectionTyObligation<'tcx>, . impl_impl_source: ImplSourceUserDefinedData<'tcx, PredicateObligation<'tcx>>, . ) -> Progress<'tcx> { . let tcx = selcx.tcx(); . 30,404 ( 0.00%) let ImplSourceUserDefinedData { impl_def_id, substs, mut nested } = impl_impl_source; 22,803 ( 0.00%) let assoc_item_id = obligation.predicate.item_def_id; 30,404 ( 0.00%) let trait_def_id = tcx.trait_id_of_impl(impl_def_id).unwrap(); . 30,404 ( 0.00%) let param_env = obligation.param_env; 53,207 ( 0.00%) let assoc_ty = match assoc_ty_def(selcx, impl_def_id, assoc_item_id) { 76,010 ( 0.00%) Ok(assoc_ty) => assoc_ty, . Err(ErrorReported) => return Progress { ty: tcx.ty_error(), obligations: nested }, . }; . 30,404 ( 0.00%) if !assoc_ty.item.defaultness.has_value() { . // This means that the impl is missing a definition for the . // associated type. This error will be reported by the type . // checker method `check_impl_items_against_trait`, so here we . // just return Error. . debug!( . "confirm_impl_candidate: no associated type {:?} for {:?}", . assoc_ty.item.name, obligation.predicate . ); -- line 1846 ---------------------------------------- -- line 1847 ---------------------------------------- . return Progress { ty: tcx.ty_error(), obligations: nested }; . } . // If we're trying to normalize ` as X>::A` using . //`impl X for Vec { type A = Box; }`, then: . // . // * `obligation.predicate.substs` is `[Vec, S]` . // * `substs` is `[u32]` . // * `substs` ends up as `[u32, S]` 45,606 ( 0.00%) let substs = obligation.predicate.substs.rebase_onto(tcx, trait_def_id, substs); . let substs = 83,611 ( 0.00%) translate_substs(selcx.infcx(), param_env, impl_def_id, substs, assoc_ty.defining_node); 7,601 ( 0.00%) let ty = tcx.type_of(assoc_ty.item.def_id); 22,803 ( 0.00%) if substs.len() != tcx.generics_of(assoc_ty.item.def_id).count() { . let err = tcx.ty_error_with_message( . obligation.cause.span, . "impl item and trait item have different parameter counts", . ); . Progress { ty: err, obligations: nested } . } else { 15,202 ( 0.00%) assoc_ty_own_obligations(selcx, obligation, &mut nested); . Progress { ty: ty.subst(tcx, substs), obligations: nested } . } . } . . // Get obligations corresponding to the predicates from the where-clause of the . // associated type itself. . // Note: `feature(generic_associated_types)` is required to write such . // predicates, even for non-generic associcated types. 123,939 ( 0.00%) fn assoc_ty_own_obligations<'cx, 'tcx>( . selcx: &mut SelectionContext<'cx, 'tcx>, . obligation: &ProjectionTyObligation<'tcx>, . nested: &mut Vec>, . ) { . let tcx = selcx.tcx(); 123,939 ( 0.00%) for predicate in tcx 27,542 ( 0.00%) .predicates_of(obligation.predicate.item_def_id) 41,313 ( 0.00%) .instantiate_own(tcx, obligation.predicate.substs) . .predicates . { . let normalized = normalize_with_depth_to( . selcx, . obligation.param_env, . obligation.cause.clone(), . obligation.recursion_depth + 1, . predicate, -- line 1891 ---------------------------------------- -- line 1893 ---------------------------------------- . ); . nested.push(Obligation::with_depth( . obligation.cause.clone(), . obligation.recursion_depth + 1, . obligation.param_env, . normalized, . )); . } 110,168 ( 0.00%) } . . /// Locate the definition of an associated type in the specialization hierarchy, . /// starting from the given impl. . /// . /// Based on the "projection mode", this lookup may in fact only examine the . /// topmost impl. See the comments for `Reveal` for more details. 136,863 ( 0.00%) fn assoc_ty_def( . selcx: &SelectionContext<'_, '_>, . impl_def_id: DefId, . assoc_ty_def_id: DefId, . ) -> Result { . let tcx = selcx.tcx(); 30,414 ( 0.00%) let trait_def_id = tcx.impl_trait_ref(impl_def_id).unwrap().def_id; . let trait_def = tcx.trait_def(trait_def_id); . . // This function may be called while we are still building the . // specialization graph that is queried below (via TraitDef::ancestors()), . // so, in order to avoid unnecessary infinite recursion, we manually look . // for the associated item at the given impl. . // If there is no such item in that impl, this function will fail with a . // cycle error if the specialization graph is currently being built. 30,414 ( 0.00%) if let Some(&impl_item_id) = tcx.impl_item_implementor_ids(impl_def_id).get(&assoc_ty_def_id) { . let item = tcx.associated_item(impl_item_id); . let impl_node = specialization_graph::Node::Impl(impl_def_id); 182,484 ( 0.00%) return Ok(specialization_graph::LeafDef { 91,242 ( 0.00%) item: *item, . defining_node: impl_node, 76,035 ( 0.00%) finalizing_node: if item.defaultness.is_default() { None } else { Some(impl_node) }, . }); . } . . let ancestors = trait_def.ancestors(tcx, impl_def_id)?; . if let Some(assoc_item) = ancestors.leaf_def(tcx, assoc_ty_def_id) { . Ok(assoc_item) . } else { . // This is saying that neither the trait nor -- line 1937 ---------------------------------------- -- line 1941 ---------------------------------------- . // if the user wrote a bad item name, it . // should have failed in astconv. . bug!( . "No associated type `{}` for {}", . tcx.item_name(assoc_ty_def_id), . tcx.def_path_str(impl_def_id) . ) . } 136,863 ( 0.00%) } . . crate trait ProjectionCacheKeyExt<'cx, 'tcx>: Sized { . fn from_poly_projection_predicate( . selcx: &mut SelectionContext<'cx, 'tcx>, . predicate: ty::PolyProjectionPredicate<'tcx>, . ) -> Option; . } . . impl<'cx, 'tcx> ProjectionCacheKeyExt<'cx, 'tcx> for ProjectionCacheKey<'tcx> { 2,541 ( 0.00%) fn from_poly_projection_predicate( . selcx: &mut SelectionContext<'cx, 'tcx>, . predicate: ty::PolyProjectionPredicate<'tcx>, . ) -> Option { . let infcx = selcx.infcx(); . // We don't do cross-snapshot caching of obligations with escaping regions, . // so there's no cache key to use 2,178 ( 0.00%) predicate.no_bound_vars().map(|predicate| { 722 ( 0.00%) ProjectionCacheKey::new( . // We don't attempt to match up with a specific type-variable state . // from a specific call to `opt_normalize_projection_type` - if . // there's no precise match, the original cache entry is "stranded" . // anyway. . infcx.resolve_vars_if_possible(predicate.projection_ty), . ) . }) 2,904 ( 0.00%) } . } 3,909,658 ( 0.05%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/canonical/canonicalizer.rs -------------------------------------------------------------------------------- Ir -- line 39 ---------------------------------------- . pub fn canonicalize_query( . &self, . value: V, . query_state: &mut OriginalQueryValues<'tcx>, . ) -> Canonicalized<'tcx, V> . where . V: TypeFoldable<'tcx>, . { 44,010 ( 0.00%) self.tcx.sess.perf_stats.queries_canonicalized.fetch_add(1, Ordering::Relaxed); . 216,567 ( 0.00%) Canonicalizer::canonicalize(value, self, self.tcx, &CanonicalizeAllFreeRegions, query_state) . } . . /// Canonicalizes a query *response* `V`. When we canonicalize a . /// query response, we only canonicalize unbound inference . /// variables, and we leave other free regions alone. So, . /// continuing with the example from `canonicalize_query`, if . /// there was an input query `T: Trait<'static>`, it would have . /// been canonicalized to -- line 57 ---------------------------------------- -- line 69 ---------------------------------------- . /// things) includes a mapping to `'?0 := 'static`. When . /// canonicalizing this query result R, we would leave this . /// reference to `'static` alone. . /// . /// To get a good understanding of what is happening here, check . /// out the [chapter in the rustc dev guide][c]. . /// . /// [c]: https://rust-lang.github.io/chalk/book/canonical_queries/canonicalization.html#canonicalizing-the-query-result 513 ( 0.00%) pub fn canonicalize_response(&self, value: V) -> Canonicalized<'tcx, V> . where . V: TypeFoldable<'tcx>, . { 21,114 ( 0.00%) let mut query_state = OriginalQueryValues::default(); 73,899 ( 0.00%) Canonicalizer::canonicalize( 123,874 ( 0.00%) value, . self, 10,557 ( 0.00%) self.tcx, . &CanonicalizeQueryResponse, . &mut query_state, . ) 399 ( 0.00%) } . 30,285 ( 0.00%) pub fn canonicalize_user_type_annotation(&self, value: V) -> Canonicalized<'tcx, V> . where . V: TypeFoldable<'tcx>, . { 9,670 ( 0.00%) let mut query_state = OriginalQueryValues::default(); 33,845 ( 0.00%) Canonicalizer::canonicalize( 27,540 ( 0.00%) value, . self, 4,835 ( 0.00%) self.tcx, . &CanonicalizeUserTypeAnnotation, . &mut query_state, . ) 23,555 ( 0.00%) } . . /// A variant of `canonicalize_query` that does not . /// canonicalize `'static`. This is useful when . /// the query implementation can perform more efficient . /// handling of `'static` regions (e.g. trait evaluation). 8,850 ( 0.00%) pub fn canonicalize_query_keep_static( . &self, . value: V, . query_state: &mut OriginalQueryValues<'tcx>, . ) -> Canonicalized<'tcx, V> . where . V: TypeFoldable<'tcx>, . { 124,288 ( 0.00%) self.tcx.sess.perf_stats.queries_canonicalized.fetch_add(1, Ordering::Relaxed); . 554,843 ( 0.01%) Canonicalizer::canonicalize( 15,308 ( 0.00%) value, . self, 62,144 ( 0.00%) self.tcx, . &CanonicalizeFreeRegionsOtherThanStatic, . query_state, . ) 8,850 ( 0.00%) } . } . . /// Controls how we canonicalize "free regions" that are not inference . /// variables. This depends on what we are canonicalizing *for* -- . /// e.g., if we are canonicalizing to create a query, we want to . /// replace those with inference variables, since we want to make a . /// maximally general query. But if we are canonicalizing a *query . /// response*, then we don't typically replace free regions, as they -- line 134 ---------------------------------------- -- line 141 ---------------------------------------- . ) -> ty::Region<'tcx>; . . fn any(&self) -> bool; . } . . struct CanonicalizeQueryResponse; . . impl CanonicalizeRegionMode for CanonicalizeQueryResponse { 130,300 ( 0.00%) fn canonicalize_free_region<'tcx>( . &self, . canonicalizer: &mut Canonicalizer<'_, 'tcx>, . r: ty::Region<'tcx>, . ) -> ty::Region<'tcx> { 78,180 ( 0.00%) match r { . ty::ReFree(_) . | ty::ReErased . | ty::ReStatic . | ty::ReEmpty(ty::UniverseIndex::ROOT) . | ty::ReEarlyBound(..) => r, . . ty::RePlaceholder(placeholder) => canonicalizer.canonical_var_for_region( . CanonicalVarInfo { kind: CanonicalVarKind::PlaceholderRegion(*placeholder) }, . r, . ), . . ty::ReVar(vid) => { 25,602 ( 0.00%) let universe = canonicalizer.region_var_universe(*vid); . canonicalizer.canonical_var_for_region( . CanonicalVarInfo { kind: CanonicalVarKind::Region(universe) }, . r, . ) . } . . ty::ReEmpty(ui) => { . bug!("canonicalizing 'empty in universe {:?}", ui) // FIXME -- line 175 ---------------------------------------- -- line 188 ---------------------------------------- . tcx.sess.delay_span_bug( . rustc_span::DUMMY_SP, . &format!("unexpected region in query response: `{:?}`", r), . ); . }); . r . } . } 130,300 ( 0.00%) } . . fn any(&self) -> bool { . false . } . } . . struct CanonicalizeUserTypeAnnotation; . . impl CanonicalizeRegionMode for CanonicalizeUserTypeAnnotation { 4,161 ( 0.00%) fn canonicalize_free_region<'tcx>( . &self, . canonicalizer: &mut Canonicalizer<'_, 'tcx>, . r: ty::Region<'tcx>, . ) -> ty::Region<'tcx> { 4,161 ( 0.00%) match r { . ty::ReEarlyBound(_) | ty::ReFree(_) | ty::ReErased | ty::ReStatic => r, . ty::ReVar(_) => canonicalizer.canonical_var_for_region_in_root_universe(r), . _ => { . // We only expect region names that the user can type. . bug!("unexpected region in query response: `{:?}`", r) . } . } 4,161 ( 0.00%) } . . fn any(&self) -> bool { . false 30,784 ( 0.00%) } . } . . struct CanonicalizeAllFreeRegions; . . impl CanonicalizeRegionMode for CanonicalizeAllFreeRegions { 37,932 ( 0.00%) fn canonicalize_free_region<'tcx>( . &self, . canonicalizer: &mut Canonicalizer<'_, 'tcx>, . r: ty::Region<'tcx>, . ) -> ty::Region<'tcx> { . canonicalizer.canonical_var_for_region_in_root_universe(r) 28,449 ( 0.00%) } . . fn any(&self) -> bool { . true 168,298 ( 0.00%) } . } . . struct CanonicalizeFreeRegionsOtherThanStatic; . . impl CanonicalizeRegionMode for CanonicalizeFreeRegionsOtherThanStatic { 147,246 ( 0.00%) fn canonicalize_free_region<'tcx>( . &self, . canonicalizer: &mut Canonicalizer<'_, 'tcx>, . r: ty::Region<'tcx>, . ) -> ty::Region<'tcx> { 98,164 ( 0.00%) if let ty::ReStatic = r { . r . } else { . canonicalizer.canonical_var_for_region_in_root_universe(r) . } 147,246 ( 0.00%) } . . fn any(&self) -> bool { . true . } . } . . struct Canonicalizer<'cx, 'tcx> { . infcx: &'cx InferCtxt<'cx, 'tcx>, -- line 263 ---------------------------------------- -- line 270 ---------------------------------------- . canonicalize_region_mode: &'cx dyn CanonicalizeRegionMode, . needs_canonical_flags: TypeFlags, . . binder_index: ty::DebruijnIndex, . } . . impl<'cx, 'tcx> TypeFolder<'tcx> for Canonicalizer<'cx, 'tcx> { . fn tcx<'b>(&'b self) -> TyCtxt<'tcx> { 457,330 ( 0.01%) self.tcx 255,456 ( 0.00%) } . . fn fold_binder(&mut self, t: ty::Binder<'tcx, T>) -> ty::Binder<'tcx, T> . where . T: TypeFoldable<'tcx>, . { 723,525 ( 0.01%) self.binder_index.shift_in(1); 1,352,695 ( 0.02%) let t = t.super_fold_with(self); 697,347 ( 0.01%) self.binder_index.shift_out(1); . t . } . 345,140 ( 0.00%) fn fold_region(&mut self, r: ty::Region<'tcx>) -> ty::Region<'tcx> { 517,710 ( 0.01%) match *r { 273 ( 0.00%) ty::ReLateBound(index, ..) => { 273 ( 0.00%) if index >= self.binder_index { . bug!("escaping late-bound region during canonicalization"); . } else { . r . } . } . . ty::ReVar(vid) => { 64,068 ( 0.00%) let resolved_vid = self . .infcx . .inner . .borrow_mut() . .unwrap_region_constraints() . .opportunistic_resolve_var(vid); . debug!( . "canonical: region var found with vid {:?}, \ . opportunistically resolved to {:?}", . vid, r . ); 256,272 ( 0.00%) let r = self.tcx.reuse_or_mk_region(r, ty::ReVar(resolved_vid)); 384,408 ( 0.00%) self.canonicalize_region_mode.canonicalize_free_region(self, r) . } . . ty::ReStatic . | ty::ReEarlyBound(..) . | ty::ReFree(_) . | ty::ReEmpty(_) . | ty::RePlaceholder(..) 219,440 ( 0.00%) | ty::ReErased => self.canonicalize_region_mode.canonicalize_free_region(self, r), . } 386,046 ( 0.00%) } . 2,637,978 ( 0.03%) fn fold_ty(&mut self, t: Ty<'tcx>) -> Ty<'tcx> { 2,236,936 ( 0.03%) match *t.kind() { 11,032 ( 0.00%) ty::Infer(ty::TyVar(vid)) => { . debug!("canonical: type var found with vid {:?}", vid); 44,128 ( 0.00%) match self.infcx.probe_ty_var(vid) { . // `t` could be a float / int variable; canonicalize that instead. . Ok(t) => { . debug!("(resolved to {:?})", t); . self.fold_ty(t) . } . . // `TyVar(vid)` is unresolved, track its universe index in the canonicalized . // result. . Err(mut ui) => { . // FIXME: perf problem described in #55921. . ui = ty::UniverseIndex::ROOT; . self.canonicalize_ty_var( 10,109 ( 0.00%) CanonicalVarInfo { . kind: CanonicalVarKind::Ty(CanonicalTyVarKind::General(ui)), . }, . t, . ) . } . } . } . -- line 351 ---------------------------------------- -- line 395 ---------------------------------------- . | ty::FnPtr(_) . | ty::Dynamic(..) . | ty::Never . | ty::Tuple(..) . | ty::Projection(..) . | ty::Foreign(..) . | ty::Param(..) . | ty::Opaque(..) => { 858,744 ( 0.01%) if t.flags().intersects(self.needs_canonical_flags) { 634,578 ( 0.01%) t.super_fold_with(self) . } else { . t . } . } . } 2,094,054 ( 0.03%) } . 2,856 ( 0.00%) fn fold_const(&mut self, ct: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> { 2,856 ( 0.00%) match ct.val { . ty::ConstKind::Infer(InferConst::Var(vid)) => { . debug!("canonical: const var found with vid {:?}", vid); . match self.infcx.probe_const_var(vid) { . Ok(c) => { . debug!("(resolved to {:?})", c); . return self.fold_const(c); . } . -- line 421 ---------------------------------------- -- line 445 ---------------------------------------- . return self.canonicalize_const_var( . CanonicalVarInfo { kind: CanonicalVarKind::PlaceholderConst(placeholder) }, . ct, . ); . } . _ => {} . } . 816 ( 0.00%) let flags = FlagComputation::for_const(ct); 408 ( 0.00%) if flags.intersects(self.needs_canonical_flags) { ct.super_fold_with(self) } else { ct } 2,448 ( 0.00%) } . } . . impl<'cx, 'tcx> Canonicalizer<'cx, 'tcx> { . /// The main `canonicalize` method, shared impl of . /// `canonicalize_query` and `canonicalize_response`. 1,370,923 ( 0.02%) fn canonicalize( . value: V, . infcx: &InferCtxt<'_, 'tcx>, . tcx: TyCtxt<'tcx>, . canonicalize_region_mode: &dyn CanonicalizeRegionMode, . query_state: &mut OriginalQueryValues<'tcx>, . ) -> Canonicalized<'tcx, V> . where . V: TypeFoldable<'tcx>, . { 601,132 ( 0.01%) let needs_canonical_flags = if canonicalize_region_mode.any() { . TypeFlags::NEEDS_INFER | . TypeFlags::HAS_FREE_REGIONS | // `HAS_RE_PLACEHOLDER` implies `HAS_FREE_REGIONS` . TypeFlags::HAS_TY_PLACEHOLDER | . TypeFlags::HAS_CT_PLACEHOLDER . } else { . TypeFlags::NEEDS_INFER . | TypeFlags::HAS_RE_PLACEHOLDER . | TypeFlags::HAS_TY_PLACEHOLDER . | TypeFlags::HAS_CT_PLACEHOLDER . }; . . // Fast path: nothing that needs to be canonicalized. 116,081 ( 0.00%) if !value.has_type_flags(needs_canonical_flags) { . let canon_value = Canonical { . max_universe: ty::UniverseIndex::ROOT, . variables: List::empty(), 73,665 ( 0.00%) value, . }; 283,058 ( 0.00%) return canon_value; . } . 439,698 ( 0.01%) let mut canonicalizer = Canonicalizer { . infcx, . tcx, . canonicalize_region_mode, . needs_canonical_flags, . variables: SmallVec::new(), . query_state, . indices: FxHashMap::default(), . binder_index: ty::INNERMOST, . }; 140,270 ( 0.00%) let out_value = value.fold_with(&mut canonicalizer); . . // Once we have canonicalized `out_value`, it should not . // contain anything that ties it to this inference context . // anymore, so it should live in the global arena. . debug_assert!(!out_value.needs_infer()); . 76,748 ( 0.00%) let canonical_variables = tcx.intern_canonical_var_infos(&canonicalizer.variables); . . let max_universe = canonical_variables . .iter() 173,763 ( 0.00%) .map(|cvar| cvar.universe()) . .max() . .unwrap_or(ty::UniverseIndex::ROOT); . 257,689 ( 0.00%) Canonical { max_universe, variables: canonical_variables, value: out_value } 899,453 ( 0.01%) } . . /// Creates a canonical variable replacing `kind` from the input, . /// or returns an existing variable if `kind` has already been . /// seen. `kind` is expected to be an unbound variable (or . /// potentially a free region). 958,360 ( 0.01%) fn canonical_var(&mut self, info: CanonicalVarInfo<'tcx>, kind: GenericArg<'tcx>) -> BoundVar { 191,672 ( 0.00%) let Canonicalizer { variables, query_state, indices, .. } = self; . 191,672 ( 0.00%) let var_values = &mut query_state.var_values; . . // This code is hot. `variables` and `var_values` are usually small . // (fewer than 8 elements ~95% of the time). They are SmallVec's to . // avoid allocations in those cases. We also don't use `indices` to . // determine if a kind has been seen before until the limit of 8 has . // been exceeded, to also avoid allocations for `indices`. 191,672 ( 0.00%) if !var_values.spilled() { . // `var_values` is stack-allocated. `indices` isn't used yet. Do a . // direct linear search of `var_values`. . if let Some(idx) = var_values.iter().position(|&k| k == kind) { . // `kind` is already present in `var_values`. . BoundVar::new(idx) . } else { . // `kind` isn't present in `var_values`. Append it. Likewise . // for `info` and `variables`. . variables.push(info); . var_values.push(kind); 300,490 ( 0.00%) assert_eq!(variables.len(), var_values.len()); . . // If `var_values` has become big enough to be heap-allocated, . // fill up `indices` to facilitate subsequent lookups. 60,098 ( 0.00%) if var_values.spilled() { 634 ( 0.00%) assert!(indices.is_empty()); 2,536 ( 0.00%) *indices = var_values . .iter() . .enumerate() . .map(|(i, &kind)| (kind, BoundVar::new(i))) . .collect(); . } . // The cv is the index of the appended element. 120,196 ( 0.00%) BoundVar::new(var_values.len() - 1) . } . } else { . // `var_values` is large. Do a hashmap search via `indices`. 19,182 ( 0.00%) *indices.entry(kind).or_insert_with(|| { . variables.push(info); . var_values.push(kind); 30,224 ( 0.00%) assert_eq!(variables.len(), var_values.len()); 15,112 ( 0.00%) BoundVar::new(variables.len() - 1) . }) . } 862,524 ( 0.01%) } . . /// Shorthand helper that creates a canonical region variable for . /// `r` (always in the root universe). The reason that we always . /// put these variables into the root universe is because this . /// method is used during **query construction:** in that case, we . /// are taking all the regions and just putting them into the most . /// generic context we can. This may generate solutions that don't . /// fit (e.g., that equate some region variable with a placeholder -- line 578 ---------------------------------------- -- line 599 ---------------------------------------- . . /// Creates a canonical variable (with the given `info`) . /// representing the region `r`; return a region referencing it. . fn canonical_var_for_region( . &mut self, . info: CanonicalVarInfo<'tcx>, . r: ty::Region<'tcx>, . ) -> ty::Region<'tcx> { 316,974 ( 0.00%) let var = self.canonical_var(info, r.into()); . let br = ty::BoundRegion { var, kind: ty::BrAnon(var.as_u32()) }; 59,547 ( 0.00%) let region = ty::ReLateBound(self.binder_index, br); 416,829 ( 0.00%) self.tcx().mk_region(region) . } . . /// Given a type variable `ty_var` of the given kind, first check . /// if `ty_var` is bound to anything; if so, canonicalize . /// *that*. Otherwise, create a new canonical variable for . /// `ty_var`. 82,328 ( 0.00%) fn canonicalize_ty_var(&mut self, info: CanonicalVarInfo<'tcx>, ty_var: Ty<'tcx>) -> Ty<'tcx> { 10,291 ( 0.00%) let infcx = self.infcx; . let bound_to = infcx.shallow_resolve(ty_var); 10,291 ( 0.00%) if bound_to != ty_var { . self.fold_ty(bound_to) . } else { 72,037 ( 0.00%) let var = self.canonical_var(info, ty_var.into()); 10,291 ( 0.00%) self.tcx().mk_ty(ty::Bound(self.binder_index, var.into())) . } 61,746 ( 0.00%) } . . /// Given a type variable `const_var` of the given kind, first check . /// if `const_var` is bound to anything; if so, canonicalize . /// *that*. Otherwise, create a new canonical variable for . /// `const_var`. . fn canonicalize_const_var( . &mut self, . info: CanonicalVarInfo<'tcx>, -- line 634 ---------------------------------------- 1,403,294 ( 0.02%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/structural_impls.rs -------------------------------------------------------------------------------- Ir -- line 685 ---------------------------------------- . } . } . . impl<'tcx, T: TypeFoldable<'tcx>, U: TypeFoldable<'tcx>> TypeFoldable<'tcx> for (T, U) { . fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result<(T, U), F::Error> { 4,770 ( 0.00%) Ok((self.0.try_fold_with(folder)?, self.1.try_fold_with(folder)?)) . } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { . self.0.visit_with(visitor)?; 961 ( 0.00%) self.1.visit_with(visitor) . } . } . . impl<'tcx, A: TypeFoldable<'tcx>, B: TypeFoldable<'tcx>, C: TypeFoldable<'tcx>> TypeFoldable<'tcx> . for (A, B, C) . { . fn try_super_fold_with>( . self, -- line 706 ---------------------------------------- -- line 826 ---------------------------------------- . fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result { . self.try_map_id(|value| value.try_fold_with(folder)) . } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { 19,638 ( 0.00%) (**self).visit_with(visitor) . } . } . . impl<'tcx, T: TypeFoldable<'tcx>> TypeFoldable<'tcx> for Vec { . fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result { 177,284 ( 0.00%) self.try_map_id(|t| t.try_fold_with(folder)) . } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { 5,160 ( 0.00%) self.iter().try_for_each(|t| t.visit_with(visitor)) . } . } . . impl<'tcx, T: TypeFoldable<'tcx>> TypeFoldable<'tcx> for Box<[T]> { . fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result { -- line 855 ---------------------------------------- -- line 857 ---------------------------------------- . } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { . self.iter().try_for_each(|t| t.visit_with(visitor)) . } . } . . impl<'tcx, T: TypeFoldable<'tcx>> TypeFoldable<'tcx> for ty::Binder<'tcx, T> { 39,826 ( 0.00%) fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result { 12,908,666 ( 0.15%) self.try_map_bound(|ty| ty.try_fold_with(folder)) 48,734 ( 0.00%) } . . fn try_fold_with>(self, folder: &mut F) -> Result { 2,141,354 ( 0.03%) folder.try_fold_binder(self) . } . 8,604 ( 0.00%) fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { 11,303 ( 0.00%) self.as_ref().skip_binder().visit_with(visitor) 7,651 ( 0.00%) } . . fn visit_with>(&self, visitor: &mut V) -> ControlFlow { . visitor.visit_binder(self) . } . } . . impl<'tcx> TypeFoldable<'tcx> for &'tcx ty::List>> { . fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result { 18,602 ( 0.00%) ty::util::fold_list(self, folder, |tcx, v| tcx.intern_poly_existential_predicates(v)) . } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { . self.iter().try_for_each(|p| p.visit_with(visitor)) . } . } . . impl<'tcx> TypeFoldable<'tcx> for &'tcx ty::List> { . fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result { 587,949 ( 0.01%) ty::util::fold_list(self, folder, |tcx, v| tcx.intern_type_list(v)) . } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { . self.iter().try_for_each(|t| t.visit_with(visitor)) . } . } . . impl<'tcx> TypeFoldable<'tcx> for &'tcx ty::List { -- line 911 ---------------------------------------- -- line 949 ---------------------------------------- . } . }, . }) . } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { . use crate::ty::InstanceDef::*; . self.substs.visit_with(visitor)?; 35 ( 0.00%) match self.def { . Item(def) => def.visit_with(visitor), . VtableShim(did) | ReifyShim(did) | Intrinsic(did) | Virtual(did, _) => { . did.visit_with(visitor) . } . FnPtrShim(did, ty) | CloneShim(did, ty) => { . did.visit_with(visitor)?; . ty.visit_with(visitor) . } -- line 965 ---------------------------------------- -- line 976 ---------------------------------------- . fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result { . Ok(Self { instance: self.instance.try_fold_with(folder)?, promoted: self.promoted }) . } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { 16 ( 0.00%) self.instance.visit_with(visitor) . } . } . . impl<'tcx> TypeFoldable<'tcx> for Ty<'tcx> { 481,426 ( 0.01%) fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result { 16,003,535 ( 0.19%) let kind = match *self.kind() { 2,610 ( 0.00%) ty::RawPtr(tm) => ty::RawPtr(tm.try_fold_with(folder)?), 94,674 ( 0.00%) ty::Array(typ, sz) => ty::Array(typ.try_fold_with(folder)?, sz.try_fold_with(folder)?), 103,612 ( 0.00%) ty::Slice(typ) => ty::Slice(typ.try_fold_with(folder)?), 4,930,714 ( 0.06%) ty::Adt(tid, substs) => ty::Adt(tid, substs.try_fold_with(folder)?), 14,370 ( 0.00%) ty::Dynamic(trait_ty, region) => { 28,392 ( 0.00%) ty::Dynamic(trait_ty.try_fold_with(folder)?, region.try_fold_with(folder)?) . } 1,279,068 ( 0.02%) ty::Tuple(ts) => ty::Tuple(ts.try_fold_with(folder)?), 312,334 ( 0.00%) ty::FnDef(def_id, substs) => ty::FnDef(def_id, substs.try_fold_with(folder)?), 1,223,286 ( 0.01%) ty::FnPtr(f) => ty::FnPtr(f.try_fold_with(folder)?), 1,261,852 ( 0.02%) ty::Ref(r, ty, mutbl) => { 2,073,684 ( 0.02%) ty::Ref(r.try_fold_with(folder)?, ty.try_fold_with(folder)?, mutbl) . } . ty::Generator(did, substs, movability) => { . ty::Generator(did, substs.try_fold_with(folder)?, movability) . } . ty::GeneratorWitness(types) => ty::GeneratorWitness(types.try_fold_with(folder)?), 1,515,008 ( 0.02%) ty::Closure(did, substs) => ty::Closure(did, substs.try_fold_with(folder)?), 1,055,002 ( 0.01%) ty::Projection(data) => ty::Projection(data.try_fold_with(folder)?), 128,828 ( 0.00%) ty::Opaque(did, substs) => ty::Opaque(did, substs.try_fold_with(folder)?), . . ty::Bool . | ty::Char . | ty::Str . | ty::Int(_) . | ty::Uint(_) . | ty::Float(_) . | ty::Error(_) -- line 1021 ---------------------------------------- -- line 1022 ---------------------------------------- . | ty::Infer(_) . | ty::Param(..) . | ty::Bound(..) . | ty::Placeholder(..) . | ty::Never . | ty::Foreign(..) => return Ok(self), . }; . 7,644,854 ( 0.09%) Ok(if *self.kind() == kind { self } else { folder.tcx().mk_ty(kind) }) 709,206 ( 0.01%) } . . fn try_fold_with>(self, folder: &mut F) -> Result { 1,064,829 ( 0.01%) folder.try_fold_ty(self) . } . 2,455,638 ( 0.03%) fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { 2,321,866 ( 0.03%) match self.kind() { . ty::RawPtr(ref tm) => tm.visit_with(visitor), 2,489 ( 0.00%) ty::Array(typ, sz) => { 7,306 ( 0.00%) typ.visit_with(visitor)?; 22,401 ( 0.00%) sz.visit_with(visitor) . } . ty::Slice(typ) => typ.visit_with(visitor), . ty::Adt(_, substs) => substs.visit_with(visitor), 327 ( 0.00%) ty::Dynamic(ref trait_ty, ref reg) => { . trait_ty.visit_with(visitor)?; 3,270 ( 0.00%) reg.visit_with(visitor) . } . ty::Tuple(ts) => ts.visit_with(visitor), . ty::FnDef(_, substs) => substs.visit_with(visitor), . ty::FnPtr(ref f) => f.visit_with(visitor), . ty::Ref(r, ty, _) => { 49,728 ( 0.00%) r.visit_with(visitor)?; . ty.visit_with(visitor) . } . ty::Generator(_did, ref substs, _) => substs.visit_with(visitor), . ty::GeneratorWitness(ref types) => types.visit_with(visitor), . ty::Closure(_did, ref substs) => substs.visit_with(visitor), 1 ( 0.00%) ty::Projection(ref data) => data.visit_with(visitor), . ty::Opaque(_, ref substs) => substs.visit_with(visitor), . . ty::Bool . | ty::Char . | ty::Str . | ty::Int(_) . | ty::Uint(_) . | ty::Float(_) -- line 1068 ---------------------------------------- -- line 1069 ---------------------------------------- . | ty::Error(_) . | ty::Infer(_) . | ty::Bound(..) . | ty::Placeholder(..) . | ty::Param(..) . | ty::Never . | ty::Foreign(..) => ControlFlow::CONTINUE, . } 2,179,519 ( 0.03%) } . . fn visit_with>(&self, visitor: &mut V) -> ControlFlow { 3,589,518 ( 0.04%) visitor.visit_ty(self) . } . } . . impl<'tcx> TypeFoldable<'tcx> for ty::Region<'tcx> { . fn try_super_fold_with>( . self, . _folder: &mut F, . ) -> Result { . Ok(self) . } . . fn try_fold_with>(self, folder: &mut F) -> Result { 89,433 ( 0.00%) folder.try_fold_region(self) . } . . fn super_visit_with>(&self, _visitor: &mut V) -> ControlFlow { . ControlFlow::CONTINUE . } . 351 ( 0.00%) fn visit_with>(&self, visitor: &mut V) -> ControlFlow { 163,268 ( 0.00%) visitor.visit_region(*self) 973 ( 0.00%) } . } . . impl<'tcx> TypeFoldable<'tcx> for ty::Predicate<'tcx> { 40,374 ( 0.00%) fn try_fold_with>(self, folder: &mut F) -> Result { . folder.try_fold_predicate(self) 33,645 ( 0.00%) } . . fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result { 2,027,547 ( 0.02%) let new = self.inner.kind.try_fold_with(folder)?; 16,271,197 ( 0.19%) Ok(folder.tcx().reuse_or_mk_predicate(self, new)) 20,187 ( 0.00%) } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { . self.inner.kind.visit_with(visitor) . } . . fn visit_with>(&self, visitor: &mut V) -> ControlFlow { 198,968 ( 0.00%) visitor.visit_predicate(*self) . } . . fn has_vars_bound_at_or_above(&self, binder: ty::DebruijnIndex) -> bool { 198,545 ( 0.00%) self.inner.outer_exclusive_binder > binder 198,545 ( 0.00%) } . . fn has_type_flags(&self, flags: ty::TypeFlags) -> bool { 1,289,579 ( 0.02%) self.inner.flags.intersects(flags) 1,289,579 ( 0.02%) } . } . . impl<'tcx> TypeFoldable<'tcx> for &'tcx ty::List> { . fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result { 222,422 ( 0.00%) ty::util::fold_list(self, folder, |tcx, v| tcx.intern_predicates(v)) . } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { 512 ( 0.00%) self.iter().try_for_each(|p| p.visit_with(visitor)) . } . } . . impl<'tcx, T: TypeFoldable<'tcx>, I: Idx> TypeFoldable<'tcx> for IndexVec { . fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result { -- line 1152 ---------------------------------------- -- line 1154 ---------------------------------------- . } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { . self.iter().try_for_each(|t| t.visit_with(visitor)) . } . } . . impl<'tcx> TypeFoldable<'tcx> for &'tcx ty::Const<'tcx> { 9 ( 0.00%) fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result { 19,320 ( 0.00%) let ty = self.ty.try_fold_with(folder)?; 244,041 ( 0.00%) let val = self.val.try_fold_with(folder)?; 73,940 ( 0.00%) if ty != self.ty || val != self.val { 38,870 ( 0.00%) Ok(folder.tcx().mk_const(ty::Const { ty, val })) . } else { . Ok(self) . } 9 ( 0.00%) } . . fn try_fold_with>(self, folder: &mut F) -> Result { 20,875 ( 0.00%) folder.try_fold_const(self) . } . 54 ( 0.00%) fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { 101 ( 0.00%) self.ty.visit_with(visitor)?; . self.val.visit_with(visitor) 58 ( 0.00%) } . 14,934 ( 0.00%) fn visit_with>(&self, visitor: &mut V) -> ControlFlow { 4,152 ( 0.00%) visitor.visit_const(self) 17,423 ( 0.00%) } . } . . impl<'tcx> TypeFoldable<'tcx> for ty::ConstKind<'tcx> { . fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result { 129,841 ( 0.00%) Ok(match self { . ty::ConstKind::Infer(ic) => ty::ConstKind::Infer(ic.try_fold_with(folder)?), . ty::ConstKind::Param(p) => ty::ConstKind::Param(p.try_fold_with(folder)?), 254 ( 0.00%) ty::ConstKind::Unevaluated(uv) => ty::ConstKind::Unevaluated(uv.try_fold_with(folder)?), . ty::ConstKind::Value(_) . | ty::ConstKind::Bound(..) . | ty::ConstKind::Placeholder(..) 63,548 ( 0.00%) | ty::ConstKind::Error(_) => self, . }) . } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { 2,255 ( 0.00%) match *self { . ty::ConstKind::Infer(ic) => ic.visit_with(visitor), . ty::ConstKind::Param(p) => p.visit_with(visitor), . ty::ConstKind::Unevaluated(uv) => uv.visit_with(visitor), . ty::ConstKind::Value(_) . | ty::ConstKind::Bound(..) . | ty::ConstKind::Placeholder(_) . | ty::ConstKind::Error(_) => ControlFlow::CONTINUE, . } -- line 1214 ---------------------------------------- -- line 1230 ---------------------------------------- . . impl<'tcx> TypeFoldable<'tcx> for ty::Unevaluated<'tcx> { . fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result { . Ok(ty::Unevaluated { . def: self.def, 1,258 ( 0.00%) substs: self.substs.try_fold_with(folder)?, . promoted: self.promoted, . }) . } . . fn visit_with>(&self, visitor: &mut V) -> ControlFlow { 5 ( 0.00%) visitor.visit_unevaluated_const(*self) . } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { 2 ( 0.00%) self.substs.visit_with(visitor) . } . } . . impl<'tcx> TypeFoldable<'tcx> for ty::Unevaluated<'tcx, ()> { . fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result { -- line 1256 ---------------------------------------- 3,219,069 ( 0.04%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/bitmask.rs -------------------------------------------------------------------------------- Ir -- line 17 ---------------------------------------- . pub struct BitMask(pub BitMaskWord); . . #[allow(clippy::use_self)] . impl BitMask { . /// Returns a new `BitMask` with all bits inverted. . #[inline] . #[must_use] . pub fn invert(self) -> Self { 451,549 ( 0.01%) BitMask(self.0 ^ BITMASK_MASK) . } . . /// Flip the bit in the mask for the entry at the given index. . /// . /// Returns the bit's previous state. . #[inline] . #[allow(clippy::cast_ptr_alignment)] . #[cfg(feature = "raw")] -- line 33 ---------------------------------------- -- line 38 ---------------------------------------- . // The bit was set if the bit is now 0. . self.0 & mask == 0 . } . . /// Returns a new `BitMask` with the lowest bit removed. . #[inline] . #[must_use] . pub fn remove_lowest_bit(self) -> Self { 249,450 ( 0.00%) BitMask(self.0 & (self.0 - 1)) . } . /// Returns whether the `BitMask` has at least one set bit. . #[inline] . pub fn any_bit_set(self) -> bool { 5,193,415 ( 0.06%) self.0 != 0 . } . . /// Returns the first set bit in the `BitMask`, if there is one. . #[inline] . pub fn lowest_set_bit(self) -> Option { 70,440,094 ( 0.84%) if self.0 == 0 { . None . } else { . Some(unsafe { self.lowest_set_bit_nonzero() }) . } . } . . /// Returns the first set bit in the `BitMask`, if there is one. The . /// bitmask must not be empty. . #[inline] . #[cfg(feature = "nightly")] . pub unsafe fn lowest_set_bit_nonzero(self) -> usize { 78,413 ( 0.00%) intrinsics::cttz_nonzero(self.0) as usize / BITMASK_STRIDE . } . #[inline] . #[cfg(not(feature = "nightly"))] . pub unsafe fn lowest_set_bit_nonzero(self) -> usize { . self.trailing_zeros() . } . . /// Returns the number of trailing zeroes in the `BitMask`. -- line 77 ---------------------------------------- -- line 110 ---------------------------------------- . /// bits. . pub struct BitMaskIter(BitMask); . . impl Iterator for BitMaskIter { . type Item = usize; . . #[inline] . fn next(&mut self) -> Option { 21,271,070 ( 0.25%) let bit = self.0.lowest_set_bit()?; . self.0 = self.0.remove_lowest_bit(); . Some(bit) . } . } 372,566 ( 0.00%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/ptr/mut_ptr.rs -------------------------------------------------------------------------------- Ir -- line 299 ---------------------------------------- . #[inline(always)] . pub const unsafe fn offset(self, count: isize) -> *mut T . where . T: Sized, . { . // SAFETY: the caller must uphold the safety contract for `offset`. . // The obtained pointer is valid for writes since the caller must . // guarantee that it points to the same allocated object as `self`. 73,474,908 ( 0.88%) unsafe { intrinsics::offset(self, count) as *mut T } . } . . /// Calculates the offset from a pointer using wrapping arithmetic. . /// `count` is in units of T; e.g., a `count` of 3 represents a pointer . /// offset of `3 * size_of::()` bytes. . /// . /// # Safety . /// -- line 315 ---------------------------------------- -- line 360 ---------------------------------------- . #[must_use = "returns a new pointer rather than modifying its argument"] . #[rustc_const_unstable(feature = "const_ptr_offset", issue = "71499")] . #[inline(always)] . pub const fn wrapping_offset(self, count: isize) -> *mut T . where . T: Sized, . { . // SAFETY: the `arith_offset` intrinsic has no prerequisites to be called. 285 ( 0.00%) unsafe { intrinsics::arith_offset(self, count) as *mut T } . } . . /// Returns `None` if the pointer is null, or else returns a unique reference to . /// the value wrapped in `Some`. If the value may be uninitialized, [`as_uninit_mut`] . /// must be used instead. . /// . /// For the shared counterpart see [`as_ref`]. . /// -- line 376 ---------------------------------------- -- line 496 ---------------------------------------- . /// of this issue. . #[unstable(feature = "const_raw_ptr_comparison", issue = "53020")] . #[rustc_const_unstable(feature = "const_raw_ptr_comparison", issue = "53020")] . #[inline] . pub const fn guaranteed_eq(self, other: *mut T) -> bool . where . T: Sized, . { 447 ( 0.00%) intrinsics::ptr_guaranteed_eq(self as *const _, other as *const _) . } . . /// Returns whether two pointers are guaranteed to be unequal. . /// . /// At runtime this function behaves like `self != other`. . /// However, in some contexts (e.g., compile-time evaluation), . /// it is not always possible to determine the inequality of two pointers, so this function may . /// spuriously return `false` for pointers that later actually turn out to be unequal. -- line 512 ---------------------------------------- -- line 1055 ---------------------------------------- . /// . /// See [`ptr::drop_in_place`] for safety concerns and examples. . /// . /// [`ptr::drop_in_place`]: crate::ptr::drop_in_place() . #[stable(feature = "pointer_methods", since = "1.26.0")] . #[inline(always)] . pub unsafe fn drop_in_place(self) { . // SAFETY: the caller must uphold the safety contract for `drop_in_place`. 134 ( 0.00%) unsafe { drop_in_place(self) } . } . . /// Overwrites a memory location with the given value without reading or . /// dropping the old value. . /// . /// See [`ptr::write`] for safety concerns and examples. . /// . /// [`ptr::write`]: crate::ptr::write() -- line 1071 ---------------------------------------- -- line 1416 ---------------------------------------- . } . } . . // Equality for pointers . #[stable(feature = "rust1", since = "1.0.0")] . impl PartialEq for *mut T { . #[inline(always)] . fn eq(&self, other: &*mut T) -> bool { 67,288 ( 0.00%) *self == *other . } . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl Eq for *mut T {} . . #[stable(feature = "rust1", since = "1.0.0")] . impl Ord for *mut T { -- line 1432 ---------------------------------------- 579,718 ( 0.01%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/flags.rs -------------------------------------------------------------------------------- Ir -- line 11 ---------------------------------------- . } . . impl FlagComputation { . fn new() -> FlagComputation { . FlagComputation { flags: TypeFlags::empty(), outer_exclusive_binder: ty::INNERMOST } . } . . #[allow(rustc::usage_of_ty_tykind)] 1,954,834 ( 0.02%) pub fn for_kind(kind: &ty::TyKind<'_>) -> FlagComputation { 279,262 ( 0.00%) let mut result = FlagComputation::new(); . result.add_kind(kind); . result 2,792,620 ( 0.03%) } . 1,428,870 ( 0.02%) pub fn for_predicate<'tcx>(binder: ty::Binder<'tcx, ty::PredicateKind<'_>>) -> FlagComputation { . let mut result = FlagComputation::new(); . result.add_predicate(binder); . result 2,000,418 ( 0.02%) } . 14,400 ( 0.00%) pub fn for_const(c: &ty::Const<'_>) -> TypeFlags { 24,451 ( 0.00%) let mut result = FlagComputation::new(); 13,641 ( 0.00%) result.add_const(c); 10,630 ( 0.00%) result.flags 14,400 ( 0.00%) } . 3 ( 0.00%) pub fn for_unevaluated_const(uv: ty::Unevaluated<'_>) -> TypeFlags { 9 ( 0.00%) let mut result = FlagComputation::new(); 3 ( 0.00%) result.add_unevaluated_const(uv); . result.flags 6 ( 0.00%) } . . fn add_flags(&mut self, flags: TypeFlags) { 1,099,102 ( 0.01%) self.flags = self.flags | flags; . } . . /// indicates that `self` refers to something at binding level `binder` . fn add_bound_var(&mut self, binder: ty::DebruijnIndex) { 9,100 ( 0.00%) let exclusive_binder = binder.shifted_in(1); . self.add_exclusive_binder(exclusive_binder); . } . . /// indicates that `self` refers to something *inside* binding . /// level `binder` -- not bound by `binder`, but bound by the next . /// binder internal to it . fn add_exclusive_binder(&mut self, exclusive_binder: ty::DebruijnIndex) { 1,846,216 ( 0.02%) self.outer_exclusive_binder = self.outer_exclusive_binder.max(exclusive_binder); . } . . /// Adds the flags/depth from a set of types that appear within the current type, but within a . /// region binder. . fn bound_computation(&mut self, value: ty::Binder<'_, T>, f: F) . where . F: FnOnce(&mut Self, T), . { 286,798 ( 0.00%) let mut computation = FlagComputation::new(); . 286,798 ( 0.00%) if !value.bound_vars().is_empty() { 2,952 ( 0.00%) computation.flags = computation.flags | TypeFlags::HAS_RE_LATE_BOUND; . } . . f(&mut computation, value.skip_binder()); . 187,985 ( 0.00%) self.add_flags(computation.flags); . . // The types that contributed to `computation` occurred within . // a region binder, so subtract one from the region depth . // within when adding the depth to `self`. 187,985 ( 0.00%) let outer_exclusive_binder = computation.outer_exclusive_binder; 286,373 ( 0.00%) if outer_exclusive_binder > ty::INNERMOST { 11,832 ( 0.00%) self.add_exclusive_binder(outer_exclusive_binder.shifted_out(1)); . } // otherwise, this binder captures nothing . } . . #[allow(rustc::usage_of_ty_tykind)] . fn add_kind(&mut self, kind: &ty::TyKind<'_>) { 1,396,310 ( 0.02%) match kind { . &ty::Bool . | &ty::Char . | &ty::Int(_) . | &ty::Float(_) . | &ty::Uint(_) . | &ty::Never . | &ty::Str . | &ty::Foreign(..) => {} -- line 95 ---------------------------------------- -- line 116 ---------------------------------------- . self.add_ty(substs.yield_ty()); . self.add_ty(substs.tupled_upvars_ty()); . } . . &ty::GeneratorWitness(ts) => { . self.bound_computation(ts, |flags, ts| flags.add_tys(ts)); . } . 2,365 ( 0.00%) &ty::Closure(_, substs) => { . let substs = substs.as_closure(); . let should_remove_further_specializable = . !self.flags.contains(TypeFlags::STILL_FURTHER_SPECIALIZABLE); 2,365 ( 0.00%) self.add_substs(substs.parent_substs()); . if should_remove_further_specializable { . self.flags -= TypeFlags::STILL_FURTHER_SPECIALIZABLE; . } . 2,365 ( 0.00%) self.add_ty(substs.sig_as_fn_ptr_ty()); 2,365 ( 0.00%) self.add_ty(substs.kind_ty()); 2,365 ( 0.00%) self.add_ty(substs.tupled_upvars_ty()); . } . 45 ( 0.00%) &ty::Bound(debruijn, _) => { . self.add_bound_var(debruijn); . } . . &ty::Placeholder(..) => { . self.add_flags(TypeFlags::HAS_TY_PLACEHOLDER); . self.add_flags(TypeFlags::STILL_FURTHER_SPECIALIZABLE); . } . . &ty::Infer(infer) => { . self.add_flags(TypeFlags::STILL_FURTHER_SPECIALIZABLE); 262,882 ( 0.00%) match infer { . ty::FreshTy(_) | ty::FreshIntTy(_) | ty::FreshFloatTy(_) => { . self.add_flags(TypeFlags::HAS_TY_FRESH) . } . . ty::TyVar(_) | ty::IntVar(_) | ty::FloatVar(_) => { . self.add_flags(TypeFlags::HAS_TY_INFER) . } . } . } . . &ty::Adt(_, substs) => { . self.add_substs(substs); . } . 36,679 ( 0.00%) &ty::Projection(data) => { . self.add_flags(TypeFlags::HAS_TY_PROJECTION); . self.add_projection_ty(data); . } . 184 ( 0.00%) &ty::Opaque(_, substs) => { . self.add_flags(TypeFlags::HAS_TY_OPAQUE); . self.add_substs(substs); . } . 1,728 ( 0.00%) &ty::Dynamic(obj, r) => { 2,048 ( 0.00%) for predicate in obj.iter() { 2,944 ( 0.00%) self.bound_computation(predicate, |computation, predicate| match predicate { 1,152 ( 0.00%) ty::ExistentialPredicate::Trait(tr) => computation.add_substs(tr.substs), . ty::ExistentialPredicate::Projection(p) => { . computation.add_existential_projection(&p); . } . ty::ExistentialPredicate::AutoTrait(_) => {} . }); . } . . self.add_region(r); . } . 2,714 ( 0.00%) &ty::Array(tt, len) => { 1,357 ( 0.00%) self.add_ty(tt); 2,714 ( 0.00%) self.add_const(len); . } . . &ty::Slice(tt) => self.add_ty(tt), . . &ty::RawPtr(ref m) => { . self.add_ty(m.ty); . } . 74,006 ( 0.00%) &ty::Ref(r, ty, _) => { . self.add_region(r); 37,003 ( 0.00%) self.add_ty(ty); . } . . &ty::Tuple(ref substs) => { 29,590 ( 0.00%) self.add_substs(substs); . } . . &ty::FnDef(_, substs) => { . self.add_substs(substs); . } . 10,022 ( 0.00%) &ty::FnPtr(fn_sig) => self.bound_computation(fn_sig, |computation, fn_sig| { . computation.add_tys(fn_sig.inputs()); 5,011 ( 0.00%) computation.add_ty(fn_sig.output()); . }), . } . } . . fn add_predicate(&mut self, binder: ty::Binder<'_, ty::PredicateKind<'_>>) { 1,714,644 ( 0.02%) self.bound_computation(binder, |computation, atom| computation.add_predicate_atom(atom)); . } . . fn add_predicate_atom(&mut self, atom: ty::PredicateKind<'_>) { 1,428,870 ( 0.02%) match atom { . ty::PredicateKind::Trait(trait_pred) => { 340,608 ( 0.00%) self.add_substs(trait_pred.trait_ref.substs); . } . ty::PredicateKind::RegionOutlives(ty::OutlivesPredicate(a, b)) => { . self.add_region(a); . self.add_region(b); . } . ty::PredicateKind::TypeOutlives(ty::OutlivesPredicate(ty, region)) => { 3,966 ( 0.00%) self.add_ty(ty); . self.add_region(region); . } . ty::PredicateKind::Subtype(ty::SubtypePredicate { a_is_expected: _, a, b }) => { . self.add_ty(a); . self.add_ty(b); . } . ty::PredicateKind::Coerce(ty::CoercePredicate { a, b }) => { . self.add_ty(a); . self.add_ty(b); . } . ty::PredicateKind::Projection(ty::ProjectionPredicate { projection_ty, term }) => { . self.add_projection_ty(projection_ty); 192,340 ( 0.00%) match term { 96,170 ( 0.00%) Term::Ty(ty) => self.add_ty(ty), . Term::Const(c) => self.add_const(c), . } . } 34,833 ( 0.00%) ty::PredicateKind::WellFormed(arg) => { 34,833 ( 0.00%) self.add_substs(slice::from_ref(&arg)); . } . ty::PredicateKind::ObjectSafe(_def_id) => {} . ty::PredicateKind::ClosureKind(_def_id, substs, _kind) => { 1,482 ( 0.00%) self.add_substs(substs); . } . ty::PredicateKind::ConstEvaluatable(uv) => { . self.add_unevaluated_const(uv); . } . ty::PredicateKind::ConstEquate(expected, found) => { . self.add_const(expected); . self.add_const(found); . } -- line 264 ---------------------------------------- -- line 269 ---------------------------------------- . } . . fn add_ty(&mut self, ty: Ty<'_>) { . self.add_flags(ty.flags()); . self.add_exclusive_binder(ty.outer_exclusive_binder); . } . . fn add_tys(&mut self, tys: &[Ty<'_>]) { 7,760 ( 0.00%) for &ty in tys { 7,760 ( 0.00%) self.add_ty(ty); . } . } . . fn add_region(&mut self, r: ty::Region<'_>) { . self.add_flags(r.type_flags()); 54,527 ( 0.00%) if let ty::ReLateBound(debruijn, _) = *r { . self.add_bound_var(debruijn); . } . } . 55,908 ( 0.00%) fn add_const(&mut self, c: &ty::Const<'_>) { 27,954 ( 0.00%) self.add_ty(c.ty); 69,885 ( 0.00%) match c.val { 38 ( 0.00%) ty::ConstKind::Unevaluated(unevaluated) => self.add_unevaluated_const(unevaluated), . ty::ConstKind::Infer(infer) => { . self.add_flags(TypeFlags::STILL_FURTHER_SPECIALIZABLE); 1,882 ( 0.00%) match infer { . InferConst::Fresh(_) => self.add_flags(TypeFlags::HAS_CT_FRESH), . InferConst::Var(_) => self.add_flags(TypeFlags::HAS_CT_INFER), . } . } . ty::ConstKind::Bound(debruijn, _) => { . self.add_bound_var(debruijn); . } . ty::ConstKind::Param(_) => { -- line 303 ---------------------------------------- -- line 306 ---------------------------------------- . } . ty::ConstKind::Placeholder(_) => { . self.add_flags(TypeFlags::HAS_CT_PLACEHOLDER); . self.add_flags(TypeFlags::STILL_FURTHER_SPECIALIZABLE); . } . ty::ConstKind::Value(_) => {} . ty::ConstKind::Error(_) => self.add_flags(TypeFlags::HAS_ERROR), . } 55,908 ( 0.00%) } . . fn add_unevaluated_const

(&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) 148 ( 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 ---------------------------------------- 5,500,741 ( 0.07%) -------------------------------------------------------------------------------- -- 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); . 114,394 ( 0.00%) if count == 8 { . ptr::copy_nonoverlapping(src, dst, 8); . return; . } . . let mut i = 0; 127,600 ( 0.00%) if i + 3 < count { . ptr::copy_nonoverlapping(src.add(i), dst.add(i), 4); . i += 4; . } . 271,506 ( 0.00%) if i + 1 < count { . ptr::copy_nonoverlapping(src.add(i), dst.add(i), 2); 33,967 ( 0.00%) i += 2 . } . 127,600 ( 0.00%) if i < count { 100,487 ( 0.00%) *dst.add(i) = *src.add(i); . i += 1; . } . . debug_assert_eq!(i, count); . } . . // # Implementation . // -- line 124 ---------------------------------------- -- line 201 ---------------------------------------- . . hasher . } . . // A specialized write function for values with size <= 8. . #[inline] . fn short_write(&mut self, x: T) { . let size = mem::size_of::(); 1,600,466 ( 0.02%) let nbuf = self.nbuf; . debug_assert!(size <= 8); . debug_assert!(nbuf < BUFFER_SIZE); . debug_assert!(nbuf + size < BUFFER_WITH_SPILL_SIZE); . 10,872,624 ( 0.13%) 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); . } . 3,363,391 ( 0.04%) self.nbuf = nbuf + size; . . return; . } . 561,467 ( 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)] 167,898 ( 0.00%) unsafe fn short_write_process_buffer(&mut self, x: T) { . let size = mem::size_of::(); 167,898 ( 0.00%) let nbuf = self.nbuf; . debug_assert!(size <= 8); . debug_assert!(nbuf < BUFFER_SIZE); . debug_assert!(nbuf + size >= BUFFER_SIZE); . debug_assert!(nbuf + size < BUFFER_WITH_SPILL_SIZE); . . // Copy first part of input into end of buffer, possibly into spill . // element. The memcpy call is optimized away because the size is known. . let dst = (self.buf.as_mut_ptr() as *mut u8).add(nbuf); . ptr::copy_nonoverlapping(&x as *const _ as *const u8, dst, size); . . // Process buffer. . for i in 0..BUFFER_CAPACITY { 1,678,980 ( 0.02%) let elem = self.buf.get_unchecked(i).assume_init().to_le(); 1,343,184 ( 0.02%) self.state.v3 ^= elem; . Sip24Rounds::c_rounds(&mut self.state); 1,511,082 ( 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. 789,558 ( 0.01%) self.nbuf = if size == 1 { 0 } else { nbuf + size - BUFFER_SIZE }; 671,592 ( 0.01%) self.processed += BUFFER_SIZE; 335,796 ( 0.00%) } . . // A write function for byte slices. . #[inline] . fn slice_write(&mut self, msg: &[u8]) { . let length = msg.len(); 18,364 ( 0.00%) let nbuf = self.nbuf; . debug_assert!(nbuf < BUFFER_SIZE); . 381,161 ( 0.00%) if nbuf + length < BUFFER_SIZE { . unsafe { . let dst = (self.buf.as_mut_ptr() as *mut u8).add(nbuf); . 135,914 ( 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); . } . } . 69,045 ( 0.00%) self.nbuf = nbuf + length; . . return; . } . 59,019 ( 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)] 35,015 ( 0.00%) unsafe fn slice_write_process_buffer(&mut self, msg: &[u8]) { . let length = msg.len(); 7,003 ( 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. 21,009 ( 0.00%) let valid_in_elem = nbuf % ELEM_SIZE; 7,003 ( 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. 14,006 ( 0.00%) let last = nbuf / ELEM_SIZE + 1; . . for i in 0..last { 51,342 ( 0.00%) let elem = self.buf.get_unchecked(i).assume_init().to_le(); 58,345 ( 0.00%) self.state.v3 ^= elem; . Sip24Rounds::c_rounds(&mut self.state); 102,684 ( 0.00%) self.state.v0 ^= elem; . } . . // Process the remaining element-sized chunks of input. . let mut processed = needed_in_elem; 14,006 ( 0.00%) let input_left = length - processed; 10,731 ( 0.00%) let elems_left = input_left / ELEM_SIZE; . let extra_bytes_left = input_left % ELEM_SIZE; . . for _ in 0..elems_left { 9,889 ( 0.00%) let elem = (msg.as_ptr().add(processed) as *const u64).read_unaligned().to_le(); 9,889 ( 0.00%) self.state.v3 ^= elem; . Sip24Rounds::c_rounds(&mut self.state); 9,889 ( 0.00%) self.state.v0 ^= elem; 19,778 ( 0.00%) processed += ELEM_SIZE; . } . . // Copy remaining input into start of buffer. . let src = msg.as_ptr().add(processed); . let dst = self.buf.as_mut_ptr() as *mut u8; . copy_nonoverlapping_small(src, dst, extra_bytes_left); . 7,003 ( 0.00%) self.nbuf = extra_bytes_left; 35,015 ( 0.00%) self.processed += nbuf + processed; 42,018 ( 0.00%) } . . #[inline] . pub fn finish128(mut self) -> (u64, u64) { . debug_assert!(self.nbuf < BUFFER_SIZE); . . // Process full elements in buffer. 52,047 ( 0.00%) let last = self.nbuf / ELEM_SIZE; . . // Since we're consuming self, avoid updating members for a potential . // performance gain. 69,396 ( 0.00%) let mut state = self.state; . . for i in 0..last { 51,941 ( 0.00%) let elem = unsafe { self.buf.get_unchecked(i).assume_init().to_le() }; 51,941 ( 0.00%) state.v3 ^= elem; . Sip24Rounds::c_rounds(&mut state); 51,941 ( 0.00%) state.v0 ^= elem; . } . . // Get remaining partial element. 34,698 ( 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); 15,856 ( 0.00%) self.buf.get_unchecked(last).assume_init().to_le() . } . } else { . 0 . }; . . // Finalize the hash. 50,554 ( 0.00%) let length = self.processed + self.nbuf; 34,696 ( 0.00%) let b: u64 = ((length as u64 & 0xff) << 56) | elem; . 17,348 ( 0.00%) state.v3 ^= b; . Sip24Rounds::c_rounds(&mut state); 17,348 ( 0.00%) state.v0 ^= b; . 17,348 ( 0.00%) state.v2 ^= 0xee; . Sip24Rounds::d_rounds(&mut state); 55,284 ( 0.00%) let _0 = state.v0 ^ state.v1 ^ state.v2 ^ state.v3; . 20,586 ( 0.00%) state.v1 ^= 0xdd; . Sip24Rounds::d_rounds(&mut state); 20,586 ( 0.00%) let _1 = state.v0 ^ state.v1 ^ state.v2 ^ state.v3; . . (_0, _1) . } . } . . impl Hasher for SipHasher128 { . #[inline] . fn write_u8(&mut self, i: u8) { -- line 414 ---------------------------------------- -- line 471 ---------------------------------------- . } . . #[derive(Debug, Clone, Default)] . struct Sip24Rounds; . . impl Sip24Rounds { . #[inline] . fn c_rounds(state: &mut State) { 6,083,723 ( 0.07%) compress!(state); 6,552,536 ( 0.08%) compress!(state); . } . . #[inline] . fn d_rounds(state: &mut State) { 110,564 ( 0.00%) compress!(state); 110,564 ( 0.00%) compress!(state); 110,564 ( 0.00%) compress!(state); 93,217 ( 0.00%) compress!(state); . } . } 1,245,831 ( 0.01%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/resolve.rs -------------------------------------------------------------------------------- Ir -- line 22 ---------------------------------------- . #[inline] . pub fn new(infcx: &'a InferCtxt<'a, 'tcx>) -> Self { . OpportunisticVarResolver { infcx } . } . } . . impl<'a, 'tcx> TypeFolder<'tcx> for OpportunisticVarResolver<'a, 'tcx> { . fn tcx<'b>(&'b self) -> TyCtxt<'tcx> { 173,204 ( 0.00%) self.infcx.tcx . } . 1,681,735 ( 0.02%) fn fold_ty(&mut self, t: Ty<'tcx>) -> Ty<'tcx> { 3,003,042 ( 0.04%) if !t.has_infer_types_or_consts() { . t // micro-optimize -- if there is nothing in this type that this fold affects... . } else { 1,987,393 ( 0.02%) let t = self.infcx.shallow_resolve(t); 7,973,834 ( 0.10%) t.super_fold_with(self) . } 1,543,977 ( 0.02%) } . 10 ( 0.00%) fn fold_const(&mut self, ct: &'tcx Const<'tcx>) -> &'tcx Const<'tcx> { 6,256 ( 0.00%) if !ct.has_infer_types_or_consts() { . ct // micro-optimize -- if there is nothing in this const that this fold affects... . } else { 887 ( 0.00%) let ct = self.infcx.shallow_resolve(ct); 3,654 ( 0.00%) ct.super_fold_with(self) . } . } . . fn fold_mir_const(&mut self, constant: mir::ConstantKind<'tcx>) -> mir::ConstantKind<'tcx> { . constant.super_fold_with(self) . } . } . -- line 55 ---------------------------------------- -- line 60 ---------------------------------------- . /// . /// If you want to resolve type and const variables as well, call . /// [InferCtxt::resolve_vars_if_possible] first. . pub struct OpportunisticRegionResolver<'a, 'tcx> { . infcx: &'a InferCtxt<'a, 'tcx>, . } . . impl<'a, 'tcx> OpportunisticRegionResolver<'a, 'tcx> { 2,037 ( 0.00%) pub fn new(infcx: &'a InferCtxt<'a, 'tcx>) -> Self { . OpportunisticRegionResolver { infcx } 2,037 ( 0.00%) } . } . . impl<'a, 'tcx> TypeFolder<'tcx> for OpportunisticRegionResolver<'a, 'tcx> { . fn tcx<'b>(&'b self) -> TyCtxt<'tcx> { 2,068,001 ( 0.02%) self.infcx.tcx 1,030,316 ( 0.01%) } . . fn fold_ty(&mut self, t: Ty<'tcx>) -> Ty<'tcx> { 12,558 ( 0.00%) if !t.has_infer_regions() { . t // micro-optimize -- if there is nothing in this type that this fold affects... . } else { 15,304 ( 0.00%) t.super_fold_with(self) . } . } . 14,815 ( 0.00%) fn fold_region(&mut self, r: ty::Region<'tcx>) -> ty::Region<'tcx> { 5,926 ( 0.00%) match *r { . ty::ReVar(rid) => { 2,747 ( 0.00%) let resolved = self . .infcx . .inner . .borrow_mut() . .unwrap_region_constraints() . .opportunistic_resolve_var(rid); 8,241 ( 0.00%) self.tcx().reuse_or_mk_region(r, ty::ReVar(resolved)) . } . _ => r, . } 17,778 ( 0.00%) } . . fn fold_const(&mut self, ct: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> { . if !ct.has_infer_regions() { . ct // micro-optimize -- if there is nothing in this const that this fold affects... . } else { . ct.super_fold_with(self) . } . } -- line 107 ---------------------------------------- -- line 165 ---------------------------------------- . . /// Full type resolution replaces all type and region variables with . /// their concrete results. If any variable cannot be replaced (never unified, etc) . /// then an `Err` result is returned. . pub fn fully_resolve<'a, 'tcx, T>(infcx: &InferCtxt<'a, 'tcx>, value: T) -> FixupResult<'tcx, T> . where . T: TypeFoldable<'tcx>, . { 165,825 ( 0.00%) value.try_fold_with(&mut FullTypeResolver { infcx }) . } . . // N.B. This type is not public because the protocol around checking the . // `err` field is not enforceable otherwise. . struct FullTypeResolver<'a, 'tcx> { . infcx: &'a InferCtxt<'a, 'tcx>, . } . . impl<'a, 'tcx> TypeFolder<'tcx> for FullTypeResolver<'a, 'tcx> { . type Error = FixupError<'tcx>; . . fn tcx<'b>(&'b self) -> TyCtxt<'tcx> { 106,448 ( 0.00%) self.infcx.tcx . } . } . . impl<'a, 'tcx> FallibleTypeFolder<'tcx> for FullTypeResolver<'a, 'tcx> { 246,670 ( 0.00%) fn try_fold_ty(&mut self, t: Ty<'tcx>) -> Result, Self::Error> { 123,335 ( 0.00%) if !t.needs_infer() { . Ok(t) // micro-optimize -- if there is nothing in this type that this fold affects... . } else { 113,890 ( 0.00%) let t = self.infcx.shallow_resolve(t); 113,890 ( 0.00%) match *t.kind() { . ty::Infer(ty::TyVar(vid)) => Err(FixupError::UnresolvedTy(vid)), . ty::Infer(ty::IntVar(vid)) => Err(FixupError::UnresolvedIntTy(vid)), . ty::Infer(ty::FloatVar(vid)) => Err(FixupError::UnresolvedFloatTy(vid)), . ty::Infer(_) => { . bug!("Unexpected type in full type resolver: {:?}", t); . } 398,615 ( 0.00%) _ => t.try_super_fold_with(self), . } . } 863,345 ( 0.01%) } . 48,364 ( 0.00%) fn try_fold_region(&mut self, r: ty::Region<'tcx>) -> Result, Self::Error> { 48,364 ( 0.00%) match *r { 21,001 ( 0.00%) ty::ReVar(rid) => Ok(self . .infcx . .lexical_region_resolutions . .borrow() . .as_ref() . .expect("region resolution not performed") . .resolve_var(rid)), . _ => Ok(r), . } 120,910 ( 0.00%) } . 2,595 ( 0.00%) fn try_fold_const( . &mut self, . c: &'tcx ty::Const<'tcx>, . ) -> Result<&'tcx ty::Const<'tcx>, Self::Error> { 519 ( 0.00%) if !c.needs_infer() { . Ok(c) // micro-optimize -- if there is nothing in this const that this fold affects... . } else { . let c = self.infcx.shallow_resolve(c); . match c.val { . ty::ConstKind::Infer(InferConst::Var(vid)) => { . return Err(FixupError::UnresolvedConst(vid)); . } . ty::ConstKind::Infer(InferConst::Fresh(_)) => { . bug!("Unexpected const in full const resolver: {:?}", c); . } . _ => {} . } . c.try_super_fold_with(self) . } 4,152 ( 0.00%) } . } 1,660,215 ( 0.02%) -------------------------------------------------------------------------------- -- 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)] 119,038 ( 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 { 3,364,832 ( 0.04%) Node { . obligation, . state: Cell::new(NodeState::Pending), 662,651 ( 0.01%) 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`. 11,139,042 ( 0.13%) #[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 { 191,918 ( 0.00%) Self { stalled: true, errors: vec![] } . } . . fn mark_not_stalled(&mut self) { 209,314 ( 0.00%) self.stalled = false; . } . . fn is_stalled(&self) -> bool { 45,521 ( 0.00%) self.stalled . } . . fn record_completed(&mut self, _outcome: &Self::Obligation) { . // do nothing . } . . fn record_error(&mut self, error: Self::Error) { . self.errors.push(error) -- line 303 ---------------------------------------- -- line 306 ---------------------------------------- . . #[derive(Debug, PartialEq, Eq)] . pub struct Error { . pub error: E, . pub backtrace: Vec, . } . . impl ObligationForest { 21,572 ( 0.00%) pub fn new() -> ObligationForest { 258,864 ( 0.00%) 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(), . } 21,572 ( 0.00%) } . . /// Returns the total number of nodes in the forest that have not . /// yet been fully resolved. . pub fn len(&self) -> usize { . self.nodes.len() . } . . /// Registers an obligation. . pub fn register_obligation(&mut self, obligation: O) { . // Ignore errors here - there is no guarantee of success. 1,026,324 ( 0.01%) let _ = self.register_obligation_at(obligation, None); . } . . // Returns Err(()) if we already know this obligation failed. 3,268,749 ( 0.04%) fn register_obligation_at(&mut self, obligation: O, parent: Option) -> Result<(), ()> { 594,318 ( 0.01%) let cache_key = obligation.as_cache_key(); 594,318 ( 0.01%) if self.done_cache.contains(&cache_key) { . debug!("register_obligation_at: ignoring already done obligation: {:?}", obligation); . return Ok(()); . } . 1,481,502 ( 0.02%) match self.active_cache.entry(cache_key) { . Entry::Occupied(o) => { 73,230 ( 0.00%) let node = &mut self.nodes[*o.get()]; 73,230 ( 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. 75,651 ( 0.00%) if !node.dependents.contains(&parent_index) { . node.dependents.push(parent_index); . } . } 109,845 ( 0.00%) if let NodeState::Error = node.state.get() { Err(()) } else { Ok(()) } . } 630,906 ( 0.01%) Entry::Vacant(v) => { 1,261,812 ( 0.02%) let obligation_tree_id = match parent { 301,566 ( 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 { 210,302 ( 0.00%) let new_index = self.nodes.len(); . v.insert(new_index); . self.nodes.push(Node::new(parent, obligation, obligation_tree_id)); . Ok(()) . } . } . } 2,674,431 ( 0.03%) } . . /// Converts all remaining obligations to the given error. 236,894 ( 0.00%) pub fn to_errors(&mut self, error: E) -> Vec> { . let errors = self . .nodes . .iter() . .enumerate() . .filter(|(_index, node)| node.state.get() == NodeState::Pending) . .map(|(index, _node)| Error { error: error.clone(), backtrace: self.error_at(index) }) . .collect(); . 67,684 ( 0.00%) self.compress(|_| assert!(false)); . errors 203,052 ( 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, . { 127 ( 0.00%) self.nodes . .iter() . .filter(|node| node.state.get() == NodeState::Pending) . .map(|node| f(&node.obligation)) . .collect() . } . . fn insert_into_error_cache(&mut self, index: usize) { . let node = &self.nodes[index]; -- line 410 ---------------------------------------- -- line 414 ---------------------------------------- . .insert(node.obligation.as_cache_key()); . } . . /// 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)] 863,631 ( 0.01%) 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; 4,443,156 ( 0.05%) 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. 8,694,394 ( 0.10%) if node.state.get() != NodeState::Pending { 589,518 ( 0.01%) index += 1; . continue; . } . 1,391,546 ( 0.02%) match processor.process_obligation(&mut node.obligation) { . ProcessResult::Unchanged => { . // No change in state. . } 837,256 ( 0.01%) ProcessResult::Changed(children) => { . // We are not (yet) stalled. . outcome.mark_not_stalled(); . node.state.set(NodeState::Success); . 1,273,678 ( 0.02%) for child in children { 3,709,587 ( 0.04%) let st = self.register_obligation_at(child, Some(index)); 436,422 ( 0.01%) if let Err(()) = st { . // Error already reported - propagate it . // to our node. . self.error_at(index); . } . } . } . ProcessResult::Error(err) => { . outcome.mark_not_stalled(); . outcome.record_error(Error { error: err, backtrace: self.error_at(index) }); . } . } 7,515,358 ( 0.09%) index += 1; . } . . // There's no need to perform marking, cycle processing and compression when nothing . // changed. 45,521 ( 0.00%) if !outcome.is_stalled() { . self.mark_successes(); . self.process_cycles(processor); 43,298 ( 0.00%) self.compress(|obl| outcome.record_completed(obl)); . } . . outcome 863,631 ( 0.01%) } . . /// Returns a vector of obligations for `p` and all of its . /// ancestors, putting them into the error state in the process. . fn error_at(&self, mut index: usize) -> Vec { . let mut error_stack: Vec = vec![]; . let mut trace = vec![]; . . loop { -- line 492 ---------------------------------------- -- line 516 ---------------------------------------- . trace . } . . /// 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 { 1,968,536 ( 0.02%) 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 { 1,688,663 ( 0.02%) 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) { 1,301,524 ( 0.02%) for &index in node.dependents.iter() { . let node = &self.nodes[index]; 1,301,524 ( 0.02%) let state = node.state.get(); 1,301,524 ( 0.02%) if state == NodeState::Success { . // This call site is cold. 641,430 ( 0.01%) 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)] 1,496,670 ( 0.02%) 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) 1,710,480 ( 0.02%) } . . /// 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, . { 21,649 ( 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. 1,688,663 ( 0.02%) if node.state.get() == NodeState::Success { 1,017,405 ( 0.01%) self.find_cycles_from_node(&mut stack, processor, index); . } . } . . debug_assert!(stack.is_empty()); 173,192 ( 0.00%) self.reused_node_vec = stack; . } . 3,390,597 ( 0.04%) fn find_cycles_from_node

(&self, stack: &mut Vec, processor: &mut P, index: usize) . where . P: ObligationProcessor, . { . let node = &self.nodes[index]; 753,466 ( 0.01%) if node.state.get() == NodeState::Success { 13,290 ( 0.00%) match stack.iter().rposition(|&n| n == index) { . None => { . stack.push(index); 173,252 ( 0.00%) for &dep_index in node.dependents.iter() { 693,008 ( 0.01%) self.find_cycles_from_node(stack, processor, dep_index); . } . stack.pop(); . node.state.set(NodeState::Done); . } . Some(rpos) => { . // Cycle detected. 117 ( 0.00%) processor.process_backedge( . stack[rpos..].iter().map(|&i| &self.nodes[i].obligation), . PhantomData, . ); . } . } . } 3,013,864 ( 0.04%) } . . /// 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)] 410,086 ( 0.00%) fn compress(&mut self, mut outcome_cb: impl FnMut(&O)) { 55,491 ( 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]; 8,529,911 ( 0.10%) match node.state.get() { . NodeState::Pending | NodeState::Waiting => { 2,958,698 ( 0.04%) if dead_nodes > 0 { 1,956,270 ( 0.02%) self.nodes.swap(index, index - dead_nodes); 3,260,450 ( 0.04%) 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. 706,163 ( 0.01%) if let Some((predicate, _)) = 627,942 ( 0.01%) 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); 418,628 ( 0.01%) node_rewrites[index] = orig_nodes_len; 418,628 ( 0.01%) 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. . self.active_cache.remove(&node.obligation.as_cache_key()); . self.insert_into_error_cache(index); . node_rewrites[index] = orig_nodes_len; -- line 658 ---------------------------------------- -- line 659 ---------------------------------------- . dead_nodes += 1; . } . NodeState::Success => unreachable!(), . } . } . . if dead_nodes > 0 { . // Remove the dead nodes and rewrite indices. 41,366 ( 0.00%) self.nodes.truncate(orig_nodes_len - dead_nodes); 20,683 ( 0.00%) self.apply_rewrites(&node_rewrites); . } . . node_rewrites.truncate(0); 221,964 ( 0.00%) self.reused_node_vec = node_rewrites; 443,928 ( 0.01%) } . . #[inline(never)] 186,147 ( 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; 2,462,824 ( 0.03%) while let Some(dependent) = node.dependents.get_mut(i) { 4,608,176 ( 0.06%) let new_index = node_rewrites[*dependent]; 2,304,088 ( 0.03%) 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 { 1,152,044 ( 0.01%) *dependent = new_index; 2,304,088 ( 0.03%) 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| { 5,767,492 ( 0.07%) let new_index = node_rewrites[*index]; 2,883,746 ( 0.03%) if new_index >= orig_nodes_len { . false . } else { 1,310,780 ( 0.02%) *index = new_index; . true . } . }); 165,464 ( 0.00%) } . } 17,942,304 ( 0.21%) -------------------------------------------------------------------------------- -- 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; . 12,696 ( 0.00%) fn with_cause(&mut self, _cause: Cause, f: F) -> R . where . F: FnOnce(&mut Self) -> R, . { . f(self) 11,189 ( 0.00%) } . . /// Generic relation routine suitable for most anything. 1,088,538 ( 0.01%) fn relate>(&mut self, a: T, b: T) -> RelateResult<'tcx, T> { 3,267,365 ( 0.04%) Relate::relate(self, a, b) 923,421 ( 0.01%) } . . /// Relate the two substitutions for the given item. The default . /// is to look up the variance for the item and proceed . /// accordingly. 152,920 ( 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); 61,168 ( 0.00%) relate_substs(self, Some((item_def_id, opt_variances)), a_subst, b_subst) 137,628 ( 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 . 626,931 ( 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); 110,832 ( 0.00%) if a.mutbl != b.mutbl { 1,138 ( 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 }) . } . }; 26,638 ( 0.00%) let ty = relation.relate_with_variance(variance, info, a.ty, b.ty)?; 266,403 ( 0.00%) Ok(ty::TypeAndMut { ty, mutbl }) . } 630,010 ( 0.01%) } . 8,825 ( 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>> { 1,071,672 ( 0.01%) let tcx = relation.tcx(); 382,924 ( 0.00%) let mut cached_ty = None; . . let params = iter::zip(a_subst, b_subst).enumerate().map(|(i, (a, b))| { 3,431,148 ( 0.04%) let (variance, variance_info) = match variances { 77,462 ( 0.00%) Some((ty_def_id, variances)) => { 116,193 ( 0.00%) let variance = variances[i]; 38,731 ( 0.00%) let variance_info = if variance == ty::Invariant { . let ty = 12,475 ( 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()), . }; 661,995 ( 0.01%) relation.relate_with_variance(variance, variance_info, a, b) . }); . . tcx.mk_substs(params) 10,590 ( 0.00%) } . . impl<'tcx> Relate<'tcx> for ty::FnSig<'tcx> { 255,437 ( 0.00%) fn relate>( . relation: &mut R, . a: ty::FnSig<'tcx>, . b: ty::FnSig<'tcx>, . ) -> RelateResult<'tcx, ty::FnSig<'tcx>> { . let tcx = relation.tcx(); . 117,894 ( 0.00%) if a.c_variadic != b.c_variadic { . return Err(TypeError::VariadicMismatch(expected_found( . relation, . a.c_variadic, . b.c_variadic, . ))); . } 80,874 ( 0.00%) let unsafety = relation.relate(a.unsafety, b.unsafety)?; . let abi = relation.relate(a.abi, b.abi)?; . 175,702 ( 0.00%) if a.inputs().len() != b.inputs().len() { . return Err(TypeError::ArgCount); . } . 176,841 ( 0.00%) let inputs_and_output = iter::zip(a.inputs(), b.inputs()) 78,455 ( 0.00%) .map(|(&a, &b)| ((a, b), false)) 157,192 ( 0.00%) .chain(iter::once(((a.output(), b.output()), true))) 37,160 ( 0.00%) .map(|((a, b), is_output)| { 37,160 ( 0.00%) if is_output { 8,236 ( 0.00%) relation.relate(a, b) . } else { . relation.relate_with_variance( . ty::Contravariant, . ty::VarianceDiagInfo::default(), . a, . b, . ) . } . }) . .enumerate() 82,794 ( 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)) . } 190,222 ( 0.00%) r => r, . }); 138,682 ( 0.00%) Ok(ty::FnSig { . inputs_and_output: tcx.mk_type_list(inputs_and_output)?, 19,649 ( 0.00%) c_variadic: a.c_variadic, . unsafety, . abi, . }) 176,841 ( 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> { 19,649 ( 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> { 690,223 ( 0.01%) fn relate>( . relation: &mut R, . a: ty::ProjectionTy<'tcx>, . b: ty::ProjectionTy<'tcx>, . ) -> RelateResult<'tcx, ty::ProjectionTy<'tcx>> { 192,404 ( 0.00%) if a.item_def_id != b.item_def_id { 123 ( 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)?; 253,900 ( 0.00%) Ok(ty::ProjectionTy { item_def_id: a.item_def_id, substs: &substs }) . } 493,104 ( 0.01%) } . } . . impl<'tcx> Relate<'tcx> for ty::ExistentialProjection<'tcx> { 3,606 ( 0.00%) fn relate>( . relation: &mut R, . a: ty::ExistentialProjection<'tcx>, . b: ty::ExistentialProjection<'tcx>, . ) -> RelateResult<'tcx, ty::ExistentialProjection<'tcx>> { 2,534 ( 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(), 888 ( 0.00%) a.term, 1,164 ( 0.00%) b.term, . )?; 322 ( 0.00%) let substs = relation.relate_with_variance( . ty::Invariant, . ty::VarianceDiagInfo::default(), 362 ( 0.00%) a.substs, 362 ( 0.00%) b.substs, . )?; 3,330 ( 0.00%) Ok(ty::ExistentialProjection { item_def_id: a.item_def_id, substs, term }) . } 3,258 ( 0.00%) } . } . . impl<'tcx> Relate<'tcx> for ty::TraitRef<'tcx> { 2,132,845 ( 0.03%) fn relate>( . relation: &mut R, . a: ty::TraitRef<'tcx>, . b: ty::TraitRef<'tcx>, . ) -> RelateResult<'tcx, ty::TraitRef<'tcx>> { . // Different traits cannot be related. 454,417 ( 0.01%) if a.def_id != b.def_id { 4,656 ( 0.00%) Err(TypeError::Traits(expected_found(relation, a.def_id, b.def_id))) . } else { 150,955 ( 0.00%) let substs = relate_substs(relation, None, a.substs, b.substs)?; 494,780 ( 0.01%) Ok(ty::TraitRef { def_id: a.def_id, substs }) . } 1,371,061 ( 0.02%) } . } . . impl<'tcx> Relate<'tcx> for ty::ExistentialTraitRef<'tcx> { 1,529 ( 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. 4,950 ( 0.00%) if a.def_id != b.def_id { . Err(TypeError::Traits(expected_found(relation, a.def_id, b.def_id))) . } else { 2,294 ( 0.00%) let substs = relate_substs(relation, None, a.substs, b.substs)?; 2,290 ( 0.00%) Ok(ty::ExistentialTraitRef { def_id: a.def_id, substs }) . } 973 ( 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, -- line 348 ---------------------------------------- -- line 358 ---------------------------------------- . . impl<'tcx> Relate<'tcx> for Ty<'tcx> { . #[inline] . fn relate>( . relation: &mut R, . a: Ty<'tcx>, . b: Ty<'tcx>, . ) -> RelateResult<'tcx, Ty<'tcx>> { 2,413,913 ( 0.03%) 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. 4,696,176 ( 0.06%) 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); 10,421,252 ( 0.12%) 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, _) 72,572 ( 0.00%) if a == b => . { . Ok(a) . } . 292,712 ( 0.00%) (&ty::Param(ref a_p), &ty::Param(ref b_p)) if a_p.index == b_p.index => Ok(a), . . (ty::Placeholder(p1), ty::Placeholder(p2)) if p1 == p2 => Ok(a), . 1,446,434 ( 0.02%) (&ty::Adt(a_def, a_substs), &ty::Adt(b_def, b_substs)) if a_def == b_def => { 462,734 ( 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)), . 11,937 ( 0.00%) (&ty::Dynamic(a_obj, a_region), &ty::Dynamic(b_obj, b_region)) => { 3,212 ( 0.00%) let region_bound = relation.with_cause(Cause::ExistentialRegionBound, |relation| { . relation.relate_with_variance( . ty::Contravariant, . ty::VarianceDiagInfo::default(), 1,606 ( 0.00%) a_region, . b_region, . ) . })?; . Ok(tcx.mk_dynamic(relation.relate(a_obj, b_obj)?, region_bound)) . } . . (&ty::Generator(a_id, a_substs, movability), &ty::Generator(b_id, b_substs, _)) . if a_id == b_id => -- line 428 ---------------------------------------- -- line 439 ---------------------------------------- . // 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)) . } . 141,112 ( 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. 35,278 ( 0.00%) let substs = relation.relate(a_substs, b_substs)?; . Ok(tcx.mk_closure(a_id, &substs)) . } . . (&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)) . } . 1,086,126 ( 0.01%) (&ty::Ref(a_r, a_ty, a_mutbl), &ty::Ref(b_r, b_ty, b_mutbl)) => { 501,095 ( 0.01%) let r = relation.relate_with_variance( . ty::Contravariant, . ty::VarianceDiagInfo::default(), . a_r, . b_r, . )?; . let a_mt = ty::TypeAndMut { ty: a_ty, mutbl: a_mutbl }; . let b_mt = ty::TypeAndMut { ty: b_ty, mutbl: b_mutbl }; 682,040 ( 0.01%) let mt = relate_type_and_mut(relation, a_mt, b_mt, a)?; . Ok(tcx.mk_ref(r, mt)) . } . 19,525 ( 0.00%) (&ty::Array(a_t, sz_a), &ty::Array(b_t, sz_b)) => { 3,501 ( 0.00%) let t = relation.relate(a_t, b_t)?; 7,810 ( 0.00%) match relation.relate(sz_a, sz_b) { 6,963 ( 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. 7,920 ( 0.00%) let sz_a = sz_a.try_eval_usize(tcx, relation.param_env()); 4,752 ( 0.00%) let sz_b = sz_b.try_eval_usize(tcx, relation.param_env()); 9,504 ( 0.00%) match (sz_a, sz_b) { 6,336 ( 0.00%) (Some(sz_a_val), Some(sz_b_val)) if sz_a_val != sz_b_val => Err( . TypeError::FixedArraySize(expected_found(relation, sz_a_val, sz_b_val)), . ), . _ => Err(err), . } . } . } . } . 113,177 ( 0.00%) (&ty::Slice(a_t), &ty::Slice(b_t)) => { 1,024 ( 0.00%) let t = relation.relate(a_t, b_t)?; . Ok(tcx.mk_slice(t)) . } . 89,574 ( 0.00%) (&ty::Tuple(as_), &ty::Tuple(bs)) => { 89,574 ( 0.00%) if as_.len() == bs.len() { . Ok(tcx.mk_tup( 284,580 ( 0.00%) iter::zip(as_, bs).map(|(a, b)| relation.relate(a.expect_ty(), b.expect_ty())), . )?) . } else if !(as_.is_empty() || bs.is_empty()) { . Err(TypeError::TupleSize(expected_found(relation, as_.len(), bs.len()))) . } else { . Err(TypeError::Sorts(expected_found(relation, a, b))) . } . } . 5,889 ( 0.00%) (&ty::FnDef(a_def_id, a_substs), &ty::FnDef(b_def_id, b_substs)) 9,815 ( 0.00%) if a_def_id == b_def_id => . { 7,852 ( 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)) => { 52,678 ( 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 210,885 ( 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)) . } . 3,530 ( 0.00%) (&ty::Opaque(a_def_id, a_substs), &ty::Opaque(b_def_id, b_substs)) 8,825 ( 0.00%) if a_def_id == b_def_id => . { 10,590 ( 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))), . } 5,283,198 ( 0.06%) } . . /// The main "const relation" routine. Note that this does not handle . /// inference artifacts, so you should filter those out before calling . /// it. 26,270 ( 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. 5,254 ( 0.00%) let a_ty = tcx.erase_regions(a.ty); 5,254 ( 0.00%) let b_ty = tcx.erase_regions(b.ty); 2,627 ( 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()); 2,627 ( 0.00%) let a = eagerly_eval(a); 5,254 ( 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. 28,897 ( 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, . }; 14,178 ( 0.00%) if is_match { Ok(a) } else { Err(TypeError::ConstMismatch(expected_found(relation, a, b))) } 23,643 ( 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> { 2,627 ( 0.00%) let tcx = relation.tcx(); 28,897 ( 0.00%) Ok(match (a_val, b_val) { 57,794 ( 0.00%) (ConstValue::Scalar(Scalar::Int(a_val)), ConstValue::Scalar(Scalar::Int(b_val))) => { 2,627 ( 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>> { 17,450 ( 0.00%) fn relate>( . relation: &mut R, . a: Self, . b: Self, . ) -> RelateResult<'tcx, Self> { 1,745 ( 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 4,004 ( 0.00%) a_v.sort_by(|a, b| a.skip_binder().stable_cmp(tcx, &b.skip_binder())); . a_v.dedup(); . b_v.sort_by(|a, b| a.skip_binder().stable_cmp(tcx, &b.skip_binder())); . b_v.dedup(); 5,235 ( 0.00%) if a_v.len() != b_v.len() { 12 ( 0.00%) return Err(TypeError::ExistentialMismatch(expected_found(relation, a, b))); . } . 6,968 ( 0.00%) let v = iter::zip(a_v, b_v).map(|(ep_a, ep_b)| { . use crate::ty::ExistentialPredicate::*; 10,260 ( 0.00%) match (ep_a.skip_binder(), ep_b.skip_binder()) { 6,060 ( 0.00%) (Trait(a), Trait(b)) => Ok(ep_a 227 ( 0.00%) .rebind(Trait(relation.relate(ep_a.rebind(a), ep_b.rebind(b))?.skip_binder()))), 294 ( 0.00%) (Projection(a), Projection(b)) => Ok(ep_a.rebind(Projection( 2,102 ( 0.00%) relation.relate(ep_a.rebind(a), ep_b.rebind(b))?.skip_binder(), . ))), 1,106 ( 0.00%) (AutoTrait(a), AutoTrait(b)) if a == b => Ok(ep_a.rebind(AutoTrait(a))), . _ => Err(TypeError::ExistentialMismatch(expected_found(relation, a, b))), . } . }); 3,484 ( 0.00%) tcx.mk_poly_existential_predicates(v) 13,960 ( 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>> { 82,122 ( 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>> { 553,243 ( 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>> { 8,860 ( 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>> { 302,616 ( 0.00%) relation.binders(a, b) . } . } . . impl<'tcx> Relate<'tcx> for GenericArg<'tcx> { 2,524,246 ( 0.03%) fn relate>( . relation: &mut R, . a: GenericArg<'tcx>, . b: GenericArg<'tcx>, . ) -> RelateResult<'tcx, GenericArg<'tcx>> { 3,496,940 ( 0.04%) 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)) => { 13,446 ( 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) . } . } 2,910,087 ( 0.03%) } . } . . 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> { 20,966 ( 0.00%) fn relate>( . relation: &mut R, . a: ty::TraitPredicate<'tcx>, . b: ty::TraitPredicate<'tcx>, . ) -> RelateResult<'tcx, ty::TraitPredicate<'tcx>> { . Ok(ty::TraitPredicate { 9,530 ( 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)?, . }) 17,154 ( 0.00%) } . } . . impl<'tcx> Relate<'tcx> for ty::Term<'tcx> { 1,086 ( 0.00%) fn relate>( . relation: &mut R, . a: Self, . b: Self, . ) -> RelateResult<'tcx, Self> { 2,534 ( 0.00%) Ok(match (a, b) { 138 ( 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,448 ( 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>, . { 3,104 ( 0.00%) ExpectedFound::new(relation.a_is_expected(), a, b) . } 11,978,085 ( 0.14%) -------------------------------------------------------------------------------- -- 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")] 1,220 ( 0.00%) pub fn from_str_radix(src: &str, radix: u32) -> Result { 610 ( 0.00%) from_str_radix(src, radix) 1,830 ( 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 { 337,515 ( 0.00%) intrinsics::ctpop(self as $ActualT) as u32 . } . . /// Returns the number of zeros in the binary representation of `self`. . /// . /// # Examples . /// . /// Basic usage: . /// -- line 96 ---------------------------------------- -- line 118 ---------------------------------------- . /// assert_eq!(n.leading_zeros(), 2); . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_stable(feature = "const_math", since = "1.32.0")] . #[must_use = "this returns the result of the operation, \ . without modifying the original"] . #[inline(always)] . pub const fn leading_zeros(self) -> u32 { 1,518,618 ( 0.02%) intrinsics::ctlz(self as $ActualT) as u32 . } . . /// Returns the number of trailing zeros in the binary representation . /// of `self`. . /// . /// # Examples . /// . /// Basic usage: -- line 134 ---------------------------------------- -- line 139 ---------------------------------------- . /// assert_eq!(n.trailing_zeros(), 3); . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_stable(feature = "const_math", since = "1.32.0")] . #[must_use = "this returns the result of the operation, \ . without modifying the original"] . #[inline(always)] . pub const fn trailing_zeros(self) -> u32 { 1,270,335 ( 0.02%) 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 { 47,817,666 ( 0.57%) 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 { 30 ( 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`. 6,236,431 ( 0.07%) 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`. 176,467 ( 0.00%) unsafe { intrinsics::unchecked_sub(self, rhs) } . } . . /// Checked integer multiplication. Computes `self * rhs`, returning . /// `None` if overflow occurred. . /// . /// # Examples . /// . /// Basic usage: -- line 541 ---------------------------------------- -- line 1035 ---------------------------------------- . #[doc = concat!("assert_eq!(", stringify!($SelfT), "::MAX.saturating_add(127), ", stringify!($SelfT), "::MAX);")] . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . #[must_use = "this returns the result of the operation, \ . without modifying the original"] . #[rustc_const_stable(feature = "const_saturating_int_methods", since = "1.47.0")] . #[inline(always)] . pub const fn saturating_add(self, rhs: Self) -> Self { 550,183 ( 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 { 24,436 ( 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 { 14,086,654 ( 0.17%) intrinsics::wrapping_add(self, rhs) . } . . /// Wrapping (modular) addition with a signed integer. Computes . /// `self + rhs`, wrapping around at the boundary of the type. . /// . /// # Examples . /// . /// Basic usage: -- line 1191 ---------------------------------------- -- line 1217 ---------------------------------------- . #[doc = concat!("assert_eq!(100", stringify!($SelfT), ".wrapping_sub(", stringify!($SelfT), "::MAX), 101);")] . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_stable(feature = "const_wrapping_math", since = "1.32.0")] . #[must_use = "this returns the result of the operation, \ . without modifying the original"] . #[inline(always)] . pub const fn wrapping_sub(self, rhs: Self) -> Self { 8,450,587 ( 0.10%) 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 { 40,632,300 ( 0.49%) intrinsics::wrapping_mul(self, rhs) . } . . /// Wrapping (modular) division. Computes `self / rhs`. . /// Wrapped division on unsigned types is just normal division. . /// There's no way wrapping could ever happen. . /// This function exists, so that all operations . /// are accounted for in the wrapping operations. . /// -- line 1256 ---------------------------------------- -- line 1492 ---------------------------------------- . #[doc = concat!("assert_eq!(", stringify!($SelfT), "::MAX.overflowing_add(1), (0, true));")] . /// ``` . #[stable(feature = "wrapping", since = "1.7.0")] . #[rustc_const_stable(feature = "const_wrapping_math", since = "1.32.0")] . #[must_use = "this returns the result of the operation, \ . without modifying the original"] . #[inline(always)] . pub const fn overflowing_add(self, rhs: Self) -> (Self, bool) { 3,490,599 ( 0.04%) let (a, b) = intrinsics::add_with_overflow(self as $ActualT, rhs as $ActualT); . (a as Self, b) . } . . /// Calculates `self + rhs + carry` without the ability to overflow. . /// . /// Performs "ternary addition" which takes in an extra bit to add, and may return an . /// additional bit of overflow. This allows for chaining together multiple additions . /// to create "big integers" which represent larger values. -- line 1508 ---------------------------------------- -- line 1588 ---------------------------------------- . #[doc = concat!("assert_eq!(0", stringify!($SelfT), ".overflowing_sub(1), (", stringify!($SelfT), "::MAX, true));")] . /// ``` . #[stable(feature = "wrapping", since = "1.7.0")] . #[rustc_const_stable(feature = "const_wrapping_math", since = "1.32.0")] . #[must_use = "this returns the result of the operation, \ . without modifying the original"] . #[inline(always)] . pub const fn overflowing_sub(self, rhs: Self) -> (Self, bool) { 1,611,182 ( 0.02%) let (a, b) = intrinsics::sub_with_overflow(self as $ActualT, rhs as $ActualT); . (a as Self, b) . } . . /// Calculates `self - rhs - borrow` without the ability to overflow. . /// . /// Performs "ternary subtraction" which takes in an extra bit to subtract, and may return . /// an additional bit of overflow. This allows for chaining together multiple subtractions . /// to create "big integers" which represent larger values. -- line 1604 ---------------------------------------- -- line 1674 ---------------------------------------- . /// assert_eq!(1_000_000_000u32.overflowing_mul(10), (1410065408, true)); . /// ``` . #[stable(feature = "wrapping", since = "1.7.0")] . #[rustc_const_stable(feature = "const_wrapping_math", since = "1.32.0")] . #[must_use = "this returns the result of the operation, \ . without modifying the original"] . #[inline(always)] . pub const fn overflowing_mul(self, rhs: Self) -> (Self, bool) { 6,018,389 ( 0.07%) 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 { 270 ( 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 { 41,836 ( 0.00%) if self <= 1 { return 0; } . 96,338 ( 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. 287,914 ( 0.00%) let z = unsafe { intrinsics::ctlz_nonzero(p) }; 97,350 ( 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 { 150,764 ( 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 ---------------------------------------- 631,838 ( 0.01%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/ops/bit.rs -------------------------------------------------------------------------------- Ir -- line 267 ---------------------------------------- . macro_rules! bitor_impl { . ($($t:ty)*) => ($( . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_ops", issue = "90080")] . impl const BitOr for $t { . type Output = $t; . . #[inline] 19,034 ( 0.00%) fn bitor(self, rhs: $t) -> $t { self | rhs } . } . . forward_ref_binop! { impl const BitOr, bitor for $t, $t } . )*) . } . . bitor_impl! { bool usize u8 u16 u32 u64 u128 isize i8 i16 i32 i64 i128 } . -- line 283 ---------------------------------------- -- line 368 ---------------------------------------- . macro_rules! bitxor_impl { . ($($t:ty)*) => ($( . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_ops", issue = "90080")] . impl const BitXor for $t { . type Output = $t; . . #[inline] 27,647,949 ( 0.33%) fn bitxor(self, other: $t) -> $t { self ^ other } . } . . forward_ref_binop! { impl const BitXor, bitxor for $t, $t } . )*) . } . . bitxor_impl! { bool usize u8 u16 u32 u64 u128 isize i8 i16 i32 i64 i128 } . -- line 384 ---------------------------------------- -- line 468 ---------------------------------------- . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_ops", issue = "90080")] . impl const Shl<$f> for $t { . type Output = $t; . . #[inline] . #[rustc_inherit_overflow_checks] . fn shl(self, other: $f) -> $t { 12 ( 0.00%) self << other . } . } . . forward_ref_binop! { impl const Shl, shl for $t, $f } . }; . } . . macro_rules! shl_impl_all { -- line 484 ---------------------------------------- 7,564,510 ( 0.09%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/intrinsics.rs -------------------------------------------------------------------------------- Ir -- line 2075 ---------------------------------------- . // SAFETY: As per our safety precondition, we may assume that the `abort` above is never reached. . // Therefore, compiletime_check and runtime_check are observably equivalent. . unsafe { . const_eval_select((src, dst, count), compiletime_check, runtime_check); . } . . // SAFETY: the safety contract for `copy_nonoverlapping` must be . // upheld by the caller. 69,174,089 ( 0.83%) unsafe { copy_nonoverlapping(src, dst, count) } . } . . /// Copies `count * size_of::()` bytes from `src` to `dst`. The source . /// and destination may overlap. . /// . /// If the source and destination will *never* overlap, . /// [`copy_nonoverlapping`] can be used instead. . /// -- line 2091 ---------------------------------------- -- line 2165 ---------------------------------------- . #[cfg(debug_assertions)] . // SAFETY: As per our safety precondition, we may assume that the `abort` above is never reached. . // Therefore, compiletime_check and runtime_check are observably equivalent. . unsafe { . const_eval_select((src, dst), compiletime_check, runtime_check); . } . . // SAFETY: the safety contract for `copy` must be upheld by the caller. 10,745,268 ( 0.13%) unsafe { copy(src, dst, count) } . } . . /// Sets `count * size_of::()` bytes of memory starting at `dst` to . /// `val`. . /// . /// `write_bytes` is similar to C's [`memset`], but sets `count * . /// size_of::()` bytes to `val`. . /// -- line 2181 ---------------------------------------- -- line 2266 ---------------------------------------- . #[cfg(debug_assertions)] . // SAFETY: runtime debug-assertions are a best-effort basis; it's fine to . // not do them during compile time . unsafe { . const_eval_select((dst,), compiletime_check, runtime_check); . } . . // SAFETY: the safety contract for `write_bytes` must be upheld by the caller. 1,724,021 ( 0.02%) unsafe { write_bytes(dst, val, count) } . } . . /// Selects which function to call depending on the context. . /// . /// If this function is evaluated at compile-time, then a call to this . /// intrinsic will be replaced with a call to `called_in_const`. It gets . /// replaced with a call to `called_at_rt` otherwise. . /// -- line 2282 ---------------------------------------- 385,285 ( 0.00%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/walk.rs -------------------------------------------------------------------------------- Ir -- line 20 ---------------------------------------- . /// . /// It's very easy to produce a deeply . /// nested type tree with a lot of . /// identical subtrees. In order to work efficiently . /// in this situation walker only visits each type once. . /// It maintains a set of visited types and . /// skips any types that are already there. . impl<'tcx> TypeWalker<'tcx> { 183,275 ( 0.00%) pub fn new(root: GenericArg<'tcx>) -> Self { 733,100 ( 0.01%) Self { stack: smallvec![root], last_subtree: 1, visited: SsoHashSet::new() } 183,275 ( 0.00%) } . . /// Skips the subtree corresponding to the last type . /// returned by `next()`. . /// . /// Example: Imagine you are walking `Foo, usize>`. . /// . /// ``` . /// let mut iter: TypeWalker = ...; . /// iter.next(); // yields Foo . /// iter.next(); // yields Bar . /// iter.skip_current_subtree(); // skips i32 . /// iter.next(); // yields usize . /// ``` . pub fn skip_current_subtree(&mut self) { 2,020 ( 0.00%) self.stack.truncate(self.last_subtree); 1,010 ( 0.00%) } . } . . impl<'tcx> Iterator for TypeWalker<'tcx> { . type Item = GenericArg<'tcx>; . 4,252,329 ( 0.05%) fn next(&mut self) -> Option> { . debug!("next(): stack={:?}", self.stack); . loop { 597,880 ( 0.01%) let next = self.stack.pop()?; 298,940 ( 0.00%) self.last_subtree = self.stack.len(); 597,880 ( 0.01%) if self.visited.insert(next) { 867,618 ( 0.01%) push_inner(&mut self.stack, next); . debug!("next: stack={:?}", self.stack); . return Some(next); . } . } 3,307,367 ( 0.04%) } . } . . impl<'tcx> GenericArg<'tcx> { . /// Iterator that walks `self` and any types reachable from . /// `self`, in depth-first order. Note that just walks the types . /// that appear in `self`, it does not descend into the fields of . /// structs or variants. For example: . /// . /// ```text . /// isize => { isize } . /// Foo> => { Foo>, Bar, isize } . /// [isize] => { [isize], isize } . /// ``` 307,382 ( 0.00%) pub fn walk(self) -> TypeWalker<'tcx> { 153,691 ( 0.00%) TypeWalker::new(self) 461,073 ( 0.01%) } . . /// Iterator that walks the immediate children of `self`. Hence . /// `Foo, u32>` yields the sequence `[Bar, u32]` . /// (but not `i32`, like `walk`). . /// . /// Iterator only walks items once. . /// It accepts visited set, updates it with all visited types . /// and skips any types that are already there. 148,610 ( 0.00%) pub fn walk_shallow( . self, . visited: &mut SsoHashSet>, . ) -> impl Iterator> { . let mut stack = SmallVec::new(); 29,722 ( 0.00%) push_inner(&mut stack, self); 59,444 ( 0.00%) stack.retain(|a| visited.insert(*a)); 326,942 ( 0.00%) stack.into_iter() 148,610 ( 0.00%) } . } . . impl<'tcx> super::TyS<'tcx> { . /// Iterator that walks `self` and any types reachable from . /// `self`, in depth-first order. Note that just walks the types . /// that appear in `self`, it does not descend into the fields of . /// structs or variants. For example: . /// . /// ```text . /// isize => { isize } . /// Foo> => { Foo>, Bar, isize } . /// [isize] => { [isize], isize } . /// ``` 59,168 ( 0.00%) pub fn walk(&'tcx self) -> TypeWalker<'tcx> { 29,584 ( 0.00%) TypeWalker::new(self.into()) 88,752 ( 0.00%) } . } . . /// We push `GenericArg`s on the stack in reverse order so as to . /// maintain a pre-order traversal. As of the time of this . /// writing, the fact that the traversal is pre-order is not . /// known to be significant to any code, but it seems like the . /// natural order one would expect (basically, the order of the . /// types as they are written). 1,913,568 ( 0.02%) fn push_inner<'tcx>(stack: &mut TypeWalkerStack<'tcx>, parent: GenericArg<'tcx>) { . match parent.unpack() { 1,474,825 ( 0.02%) GenericArgKind::Type(parent_ty) => match *parent_ty.kind() { . ty::Bool . | ty::Char . | ty::Int(_) . | ty::Uint(_) . | ty::Float(_) . | ty::Str . | ty::Infer(_) . | ty::Param(_) . | ty::Never . | ty::Error(_) . | ty::Placeholder(..) . | ty::Bound(..) . | ty::Foreign(..) => {} . 1,874 ( 0.00%) ty::Array(ty, len) => { 2,811 ( 0.00%) stack.push(len.into()); . stack.push(ty.into()); . } . ty::Slice(ty) => { . stack.push(ty.into()); . } . ty::RawPtr(mt) => { . stack.push(mt.ty.into()); . } 44,136 ( 0.00%) ty::Ref(lt, ty, _) => { 44,136 ( 0.00%) stack.push(ty.into()); . stack.push(lt.into()); . } 2,060 ( 0.00%) ty::Projection(data) => { . stack.extend(data.substs.iter().rev()); . } 2,660 ( 0.00%) ty::Dynamic(obj, lt) => { 2,660 ( 0.00%) stack.push(lt.into()); 2,660 ( 0.00%) stack.extend(obj.iter().rev().flat_map(|predicate| { . let (substs, opt_ty) = match predicate.skip_binder() { . ty::ExistentialPredicate::Trait(tr) => (tr.substs, None), . ty::ExistentialPredicate::Projection(p) => (p.substs, Some(p.term)), . ty::ExistentialPredicate::AutoTrait(_) => . // Empty iterator . { . (ty::InternalSubsts::empty(), None) . } . }; . 176 ( 0.00%) substs.iter().rev().chain(opt_ty.map(|term| match term { . ty::Term::Ty(ty) => ty.into(), . ty::Term::Const(ct) => ct.into(), . })) . })); . } . ty::Adt(_, substs) . | ty::Opaque(_, substs) . | ty::Closure(_, substs) . | ty::Generator(_, substs, _) 6,791 ( 0.00%) | ty::Tuple(substs) . | ty::FnDef(_, substs) => { . stack.extend(substs.iter().rev()); . } . ty::GeneratorWitness(ts) => { . stack.extend(ts.skip_binder().iter().rev().map(|ty| ty.into())); . } 7,558 ( 0.00%) ty::FnPtr(sig) => { 26,453 ( 0.00%) stack.push(sig.skip_binder().output().into()); 30,232 ( 0.00%) stack.extend(sig.skip_binder().inputs().iter().copied().rev().map(|ty| ty.into())); . } . }, . GenericArgKind::Lifetime(_) => {} . GenericArgKind::Const(parent_ct) => { . stack.push(parent_ct.ty.into()); 1,876 ( 0.00%) match parent_ct.val { . ty::ConstKind::Infer(_) . | ty::ConstKind::Param(_) . | ty::ConstKind::Placeholder(_) . | ty::ConstKind::Bound(..) . | ty::ConstKind::Value(_) . | ty::ConstKind::Error(_) => {} . . ty::ConstKind::Unevaluated(ct) => { . stack.extend(ct.substs.iter().rev()); . } . } . } . } 1,036,885 ( 0.01%) } 1,313,730 ( 0.02%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/std/src/collections/hash/map.rs -------------------------------------------------------------------------------- Ir -- line 270 ---------------------------------------- . /// . /// let s = RandomState::new(); . /// let mut map = HashMap::with_hasher(s); . /// map.insert(1, 2); . /// ``` . #[inline] . #[stable(feature = "hashmap_build_hasher", since = "1.7.0")] . pub fn with_hasher(hash_builder: S) -> HashMap { 2,362,281 ( 0.03%) HashMap { base: base::HashMap::with_hasher(hash_builder) } . } . . /// Creates an empty `HashMap` with the specified capacity, using `hash_builder` . /// to hash the keys. . /// . /// The hash map will be able to hold at least `capacity` elements without . /// reallocating. If `capacity` is 0, the hash map will not allocate. . /// -- line 286 ---------------------------------------- -- line 300 ---------------------------------------- . /// . /// let s = RandomState::new(); . /// let mut map = HashMap::with_capacity_and_hasher(10, s); . /// map.insert(1, 2); . /// ``` . #[inline] . #[stable(feature = "hashmap_build_hasher", since = "1.7.0")] . pub fn with_capacity_and_hasher(capacity: usize, hash_builder: S) -> HashMap { 3,990 ( 0.00%) HashMap { base: base::HashMap::with_capacity_and_hasher(capacity, hash_builder) } . } . . /// Returns the number of elements the map can hold without reallocating. . /// . /// This number is a lower bound; the `HashMap` might be able to hold . /// more, but is guaranteed to be able to hold at least this many. . /// . /// # Examples -- line 316 ---------------------------------------- -- line 468 ---------------------------------------- . /// ]); . /// . /// for (key, val) in map.iter() { . /// println!("key: {} val: {}", key, val); . /// } . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . pub fn iter(&self) -> Iter<'_, K, V> { 16,940 ( 0.00%) Iter { base: self.base.iter() } . } . . /// An iterator visiting all key-value pairs in arbitrary order, . /// with mutable references to the values. . /// The iterator element type is `(&'a K, &'a mut V)`. . /// . /// # Examples . /// -- line 484 ---------------------------------------- -- line 643 ---------------------------------------- . /// let mut a = HashMap::new(); . /// a.insert(1, "a"); . /// a.clear(); . /// assert!(a.is_empty()); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn clear(&mut self) { 1 ( 0.00%) self.base.clear(); . } . . /// Returns a reference to the map's [`BuildHasher`]. . /// . /// # Examples . /// . /// ``` . /// use std::collections::HashMap; -- line 659 ---------------------------------------- -- line 688 ---------------------------------------- . /// ``` . /// use std::collections::HashMap; . /// let mut map: HashMap<&str, i32> = HashMap::new(); . /// map.reserve(10); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn reserve(&mut self, additional: usize) { 1 ( 0.00%) self.base.reserve(additional) . } . . /// Tries to reserve capacity for at least `additional` more elements to be inserted . /// in the given `HashMap`. The collection may reserve more space to avoid . /// frequent reallocations. . /// . /// # Errors . /// -- line 704 ---------------------------------------- -- line 784 ---------------------------------------- . /// assert_eq!(letters[&'s'], 2); . /// assert_eq!(letters[&'t'], 3); . /// assert_eq!(letters[&'u'], 1); . /// assert_eq!(letters.get(&'y'), None); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn entry(&mut self, key: K) -> Entry<'_, K, V> { 4,099,087 ( 0.05%) map_entry(self.base.rustc_entry(key)) . } . . /// Returns a reference to the value corresponding to the key. . /// . /// The key may be any borrowed form of the map's key type, but . /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for . /// the key type. . /// -- line 800 ---------------------------------------- -- line 805 ---------------------------------------- . /// . /// let mut map = HashMap::new(); . /// map.insert(1, "a"); . /// assert_eq!(map.get(&1), Some(&"a")); . /// assert_eq!(map.get(&2), None); . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . #[inline] 1,159,321 ( 0.01%) pub fn get(&self, k: &Q) -> Option<&V> . where . K: Borrow, . Q: Hash + Eq, . { . self.base.get(k) 1,657,976 ( 0.02%) } . . /// Returns the key-value pair corresponding to the supplied key. . /// . /// The supplied key may be any borrowed form of the map's key type, but . /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for . /// the key type. . /// . /// # Examples -- line 827 ---------------------------------------- -- line 862 ---------------------------------------- . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn contains_key(&self, k: &Q) -> bool . where . K: Borrow, . Q: Hash + Eq, . { 76,106 ( 0.00%) self.base.contains_key(k) . } . . /// Returns a mutable reference to the value corresponding to the key. . /// . /// The key may be any borrowed form of the map's key type, but . /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for . /// the key type. . /// -- line 878 ---------------------------------------- -- line 890 ---------------------------------------- . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn get_mut(&mut self, k: &Q) -> Option<&mut V> . where . K: Borrow, . Q: Hash + Eq, . { 1,702 ( 0.00%) self.base.get_mut(k) . } . . /// Inserts a key-value pair into the map. . /// . /// If the map did not have this key present, [`None`] is returned. . /// . /// If the map did have this key present, the value is updated, and the old . /// value is returned. The key is not updated, though; this matters for -- line 906 ---------------------------------------- -- line 920 ---------------------------------------- . /// . /// map.insert(37, "b"); . /// assert_eq!(map.insert(37, "c"), Some("b")); . /// assert_eq!(map[&37], "c"); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn insert(&mut self, k: K, v: V) -> Option { 5,438,953 ( 0.07%) self.base.insert(k, v) . } . . /// Tries to insert a key-value pair into the map, and returns . /// a mutable reference to the value in the entry. . /// . /// If the map already had this key present, nothing is updated, and . /// an error containing the occupied entry and the value is returned. . /// -- line 936 ---------------------------------------- -- line 978 ---------------------------------------- . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn remove(&mut self, k: &Q) -> Option . where . K: Borrow, . Q: Hash + Eq, . { 262,043 ( 0.00%) self.base.remove(k) . } . . /// Removes a key from the map, returning the stored key and value if the . /// key was previously in the map. . /// . /// The key may be any borrowed form of the map's key type, but . /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for . /// the key type. -- line 994 ---------------------------------------- -- line 1083 ---------------------------------------- . impl Clone for HashMap . where . K: Clone, . V: Clone, . S: Clone, . { . #[inline] . fn clone(&self) -> Self { 3,155 ( 0.00%) Self { base: self.base.clone() } . } . . #[inline] . fn clone_from(&mut self, other: &Self) { . self.base.clone_from(&other.base); . } . } . -- line 1099 ---------------------------------------- -- line 1155 ---------------------------------------- . type Output = V; . . /// Returns a reference to the value corresponding to the supplied key. . /// . /// # Panics . /// . /// Panics if the key is not present in the `HashMap`. . #[inline] 29,819 ( 0.00%) fn index(&self, key: &Q) -> &V { . self.get(key).expect("no entry found for key") 36,342 ( 0.00%) } . } . . #[stable(feature = "std_collections_from_array", since = "1.56.0")] . // Note: as what is currently the most convenient built-in way to construct . // a HashMap, a simple usage of this function must not *require* the user . // to provide a type annotation in order to infer the third type parameter . // (the hasher parameter, conventionally "S"). . // To that end, this impl is defined using RandomState as the concrete -- line 1173 ---------------------------------------- -- line 1557 ---------------------------------------- . /// Creates a `RawEntryMut` from the given key and its hash. . #[inline] . #[unstable(feature = "hash_raw_entry", issue = "56167")] . pub fn from_key_hashed_nocheck(self, hash: u64, k: &Q) -> RawEntryMut<'a, K, V, S> . where . K: Borrow, . Q: Eq, . { 13,547,682 ( 0.16%) map_raw_entry(self.map.base.raw_entry_mut().from_key_hashed_nocheck(hash, k)) . } . . /// Creates a `RawEntryMut` from the given hash. . #[inline] . #[unstable(feature = "hash_raw_entry", issue = "56167")] . pub fn from_hash(self, hash: u64, is_match: F) -> RawEntryMut<'a, K, V, S> . where . for<'b> F: FnMut(&'b K) -> bool, -- line 1573 ---------------------------------------- -- line 1594 ---------------------------------------- . /// Access an entry by a key and its hash. . #[inline] . #[unstable(feature = "hash_raw_entry", issue = "56167")] . pub fn from_key_hashed_nocheck(self, hash: u64, k: &Q) -> Option<(&'a K, &'a V)> . where . K: Borrow, . Q: Hash + Eq, . { 6,117,693 ( 0.07%) self.map.base.raw_entry().from_key_hashed_nocheck(hash, k) . } . . /// Access an entry by hash. . #[inline] . #[unstable(feature = "hash_raw_entry", issue = "56167")] . pub fn from_hash(self, hash: u64, is_match: F) -> Option<(&'a K, &'a V)> . where . F: FnMut(&K) -> bool, -- line 1610 ---------------------------------------- -- line 2338 ---------------------------------------- . /// assert_eq!(map["poneyland"], 3); . /// . /// *map.entry("poneyland").or_insert(10) *= 2; . /// assert_eq!(map["poneyland"], 6); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn or_insert(self, default: V) -> &'a mut V { 39,544 ( 0.00%) match self { . Occupied(entry) => entry.into_mut(), . Vacant(entry) => entry.insert(default), . } . } . . /// Ensures a value is in the entry by inserting the result of the default function if empty, . /// and returns a mutable reference to the value in the entry. . /// -- line 2354 ---------------------------------------- -- line 2362 ---------------------------------------- . /// . /// map.entry("poneyland").or_insert_with(|| s); . /// . /// assert_eq!(map["poneyland"], "hoho".to_string()); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn or_insert_with V>(self, default: F) -> &'a mut V { 568,835 ( 0.01%) match self { . Occupied(entry) => entry.into_mut(), . Vacant(entry) => entry.insert(default()), . } . } . . /// Ensures a value is in the entry by inserting, if empty, the result of the default function. . /// This method allows for generating key-derived values for insertion by providing the default . /// function a reference to the key that was moved during the `.entry(key)` method call. -- line 2378 ---------------------------------------- -- line 2443 ---------------------------------------- . /// assert_eq!(map["poneyland"], 43); . /// ``` . #[inline] . #[stable(feature = "entry_and_modify", since = "1.26.0")] . pub fn and_modify(self, f: F) -> Self . where . F: FnOnce(&mut V), . { 72 ( 0.00%) match self { . Occupied(mut entry) => { . f(entry.get_mut()); . Occupied(entry) . } . Vacant(entry) => Vacant(entry), . } . } . -- line 2459 ---------------------------------------- -- line 2496 ---------------------------------------- . /// map.entry("poneyland").or_default(); . /// . /// assert_eq!(map["poneyland"], None); . /// # } . /// ``` . #[inline] . #[stable(feature = "entry_or_default", since = "1.28.0")] . pub fn or_default(self) -> &'a mut V { 68,460 ( 0.00%) match self { . Occupied(entry) => entry.into_mut(), . Vacant(entry) => entry.insert(Default::default()), . } . } . } . . impl<'a, K, V> OccupiedEntry<'a, K, V> { . /// Gets a reference to the key in the entry. -- line 2512 ---------------------------------------- -- line 2790 ---------------------------------------- . /// if let Entry::Vacant(o) = map.entry("poneyland") { . /// o.insert(37); . /// } . /// assert_eq!(map["poneyland"], 37); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn insert(self, value: V) -> &'a mut V { 1,007,506 ( 0.01%) self.base.insert(value) . } . . /// Sets the value of the entry with the `VacantEntry`'s key, . /// and returns an `OccupiedEntry`. . /// . /// # Examples . /// . /// ``` -- line 2806 ---------------------------------------- -- line 2823 ---------------------------------------- . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl FromIterator<(K, V)> for HashMap . where . K: Eq + Hash, . S: BuildHasher + Default, . { 31 ( 0.00%) fn from_iter>(iter: T) -> HashMap { . let mut map = HashMap::with_hasher(Default::default()); . map.extend(iter); . map 32 ( 0.00%) } . } . . /// Inserts all new key-values from the iterator and replaces values with existing . /// keys with new values returned from the iterator. . #[stable(feature = "rust1", since = "1.0.0")] . impl Extend<(K, V)> for HashMap . where . K: Eq + Hash, . S: BuildHasher, . { . #[inline] . fn extend>(&mut self, iter: T) { 169,357 ( 0.00%) self.base.extend(iter) . } . . #[inline] . fn extend_one(&mut self, (k, v): (K, V)) { . self.base.insert(k, v); . } . . #[inline] -- line 2856 ---------------------------------------- -- line 2928 ---------------------------------------- . // many hash maps are created on a thread. To solve this performance . // trap we cache the first set of randomly generated keys per-thread. . // . // Later in #36481 it was discovered that exposing a deterministic . // iteration order allows a form of DOS attack. To counter that we . // increment one of the seeds on every RandomState creation, giving . // every corresponding HashMap a different iteration order. . thread_local!(static KEYS: Cell<(u64, u64)> = { 1 ( 0.00%) Cell::new(sys::hashmap_random_keys()) . }); . . KEYS.with(|keys| { 3 ( 0.00%) let (k0, k1) = keys.get(); . keys.set((k0.wrapping_add(1), k1)); . RandomState { k0, k1 } . }) . } . } . . #[stable(feature = "hashmap_build_hasher", since = "1.7.0")] . impl BuildHasher for RandomState { -- line 2948 ---------------------------------------- -- line 2967 ---------------------------------------- . /// Creates a new `DefaultHasher`. . /// . /// This hasher is not guaranteed to be the same as all other . /// `DefaultHasher` instances, but is the same as all other `DefaultHasher` . /// instances created through `new` or `default`. . #[stable(feature = "hashmap_default_hasher", since = "1.13.0")] . #[allow(deprecated)] . #[must_use] 3 ( 0.00%) pub fn new() -> DefaultHasher { 12 ( 0.00%) DefaultHasher(SipHasher13::new_with_keys(0, 0)) 3 ( 0.00%) } . } . . #[stable(feature = "hashmap_default_hasher", since = "1.13.0")] . impl Default for DefaultHasher { . /// Creates a new `DefaultHasher` using [`new`]. . /// See its documentation for more. . /// . /// [`new`]: DefaultHasher::new -- line 2985 ---------------------------------------- -- line 2986 ---------------------------------------- . fn default() -> DefaultHasher { . DefaultHasher::new() . } . } . . #[stable(feature = "hashmap_default_hasher", since = "1.13.0")] . impl Hasher for DefaultHasher { . #[inline] 1,074 ( 0.00%) fn write(&mut self, msg: &[u8]) { . self.0.write(msg) 1,074 ( 0.00%) } . . #[inline] . fn finish(&self) -> u64 { . self.0.finish() . } . } . . #[stable(feature = "hashmap_build_hasher", since = "1.7.0")] -- line 3004 ---------------------------------------- -- line 3014 ---------------------------------------- . impl fmt::Debug for RandomState { . fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { . f.debug_struct("RandomState").finish_non_exhaustive() . } . } . . #[inline] . fn map_entry<'a, K: 'a, V: 'a>(raw: base::RustcEntry<'a, K, V>) -> Entry<'a, K, V> { 254,114 ( 0.00%) match raw { 279 ( 0.00%) base::RustcEntry::Occupied(base) => Entry::Occupied(OccupiedEntry { base }), 4,428 ( 0.00%) base::RustcEntry::Vacant(base) => Entry::Vacant(VacantEntry { base }), . } . } . . #[inline] . pub(super) fn map_try_reserve_error(err: hashbrown::TryReserveError) -> TryReserveError { . match err { . hashbrown::TryReserveError::CapacityOverflow => { . TryReserveErrorKind::CapacityOverflow.into() -- line 3032 ---------------------------------------- -- line 3036 ---------------------------------------- . } . } . } . . #[inline] . fn map_raw_entry<'a, K: 'a, V: 'a, S: 'a>( . raw: base::RawEntryMut<'a, K, V, S>, . ) -> RawEntryMut<'a, K, V, S> { 10,519,958 ( 0.13%) match raw { . base::RawEntryMut::Occupied(base) => RawEntryMut::Occupied(RawOccupiedEntryMut { base }), . base::RawEntryMut::Vacant(base) => RawEntryMut::Vacant(RawVacantEntryMut { base }), . } . } . . #[allow(dead_code)] . fn assert_covariance() { . fn map_key<'new>(v: HashMap<&'static str, u8>) -> HashMap<&'new str, u8> { -- line 3052 ---------------------------------------- 7,895,376 ( 0.09%) -------------------------------------------------------------------------------- -- 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, . { 2,822,026 ( 0.03%) 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. 37 ( 0.00%) #[derive(Debug, Eq, PartialEq, Clone, Ord, PartialOrd)] 1,176 ( 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 3,193 ( 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> { 26 ( 0.00%) encoder.emit_enum(|encoder| match *self { . RealFileName::LocalPath(ref local_path) => { 104 ( 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> { 4 ( 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 { 2,512 ( 0.00%) match self { . RealFileName::LocalPath(p) . | RealFileName::Remapped { local_path: _, virtual_name: p } => &p, . } 14 ( 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 { 13 ( 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> { 13 ( 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. 6,899 ( 0.00%) #[derive(Debug, Eq, PartialEq, Clone, Ord, PartialOrd, Hash)] 7,265 ( 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 { 91 ( 0.00%) fn from(p: PathBuf) -> Self { 26 ( 0.00%) assert!(!p.to_string_lossy().ends_with('>')); 78 ( 0.00%) FileName::Real(RealFileName::LocalPath(p)) 91 ( 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<'_> { 52 ( 0.00%) fn fmt(&self, fmt: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { . use FileName::*; 78 ( 0.00%) match *self.inner { . Real(ref name) => { 78 ( 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, ""), . } 65 ( 0.00%) } . } . . impl FileNameDisplay<'_> { . pub fn to_string_lossy(&self) -> Cow<'_, str> { . match self.inner { . FileName::Real(ref inner) => inner.to_string_lossy(self.display_pref), . _ => Cow::from(format!("{}", self)), . } . } . } . . impl FileName { . pub fn is_real(&self) -> bool { . use FileName::*; 1,196 ( 0.00%) match *self { . Real(_) => true, . Anon(_) . | MacroExpansion(_) . | ProcMacroSourceCode(_) . | CfgSpec(_) . | CliCrateAttr(_) . | Custom(_) . | QuoteExpansion(_) -- line 353 ---------------------------------------- -- line 357 ---------------------------------------- . } . . pub fn prefer_remapped(&self) -> FileNameDisplay<'_> { . FileNameDisplay { inner: self, display_pref: FileNameDisplayPreference::Remapped } . } . . // This may include transient local filesystem information. . // Must not be embedded in build outputs. 13 ( 0.00%) pub fn prefer_local(&self) -> FileNameDisplay<'_> { . FileNameDisplay { inner: self, display_pref: FileNameDisplayPreference::Local } 26 ( 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 { 19 ( 0.00%) pub lo: BytePos, 19 ( 0.00%) pub hi: BytePos, . /// Information about where the macro came from, if this piece of . /// code was created by a macro expansion. 30 ( 0.00%) pub ctxt: SyntaxContext, 10 ( 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 { 674,280 ( 0.01%) self.lo.0 == 0 && self.hi.0 == 0 . } . /// Returns `true` if `self` fully encloses `other`. . pub fn contains(self, other: Self) -> bool { 2,520 ( 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 { 90,344 ( 0.00%) fn partial_cmp(&self, rhs: &Self) -> Option { 67,758 ( 0.00%) PartialOrd::partial_cmp(&self.data(), &rhs.data()) 90,344 ( 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] 240,597 ( 0.00%) pub fn with_lo(self, lo: BytePos) -> Span { . self.data().with_lo(lo) 160,398 ( 0.00%) } . #[inline] 34,012 ( 0.00%) pub fn hi(self) -> BytePos { . self.data().hi 34,012 ( 0.00%) } . #[inline] 89,082 ( 0.00%) pub fn with_hi(self, hi: BytePos) -> Span { . self.data().with_hi(hi) 59,388 ( 0.00%) } . #[inline] . pub fn ctxt(self) -> SyntaxContext { . self.data_untracked().ctxt . } . #[inline] 25,620 ( 0.00%) pub fn with_ctxt(self, ctxt: SyntaxContext) -> Span { . self.data_untracked().with_ctxt(ctxt) 15,372 ( 0.00%) } . #[inline] . pub fn parent(self) -> Option { . self.data().parent . } . #[inline] 27 ( 0.00%) pub fn with_parent(self, ctxt: Option) -> Span { . self.data().with_parent(ctxt) 18 ( 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] 1,080 ( 0.00%) pub fn from_expansion(self) -> bool { . self.ctxt() != SyntaxContext::root() 720 ( 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] 309 ( 0.00%) pub fn shrink_to_hi(self) -> Span { . let span = self.data_untracked(); . span.with_lo(span.hi) 206 ( 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`. 7,560 ( 0.00%) pub fn contains(self, other: Span) -> bool { . let span = self.data(); . let other = other.data(); . span.contains(other) 5,040 ( 0.00%) } . . /// Returns `true` if `self` touches `other`. . pub fn overlaps(self, other: Span) -> bool { . let span = self.data(); . let other = other.data(); . span.lo < other.hi && other.lo < span.hi . } . -- line 638 ---------------------------------------- -- line 663 ---------------------------------------- . /// The `Span` for the tokens in the previous macro expansion from which `self` was generated, . /// if any. . pub fn parent_callsite(self) -> Option { . let expn_data = self.ctxt().outer_expn_data(); . if !expn_data.is_root() { Some(expn_data.call_site) } else { None } . } . . /// Walk down the expansion ancestors to find a span that's contained within `outer`. 5,870 ( 0.00%) pub fn find_ancestor_inside(mut self, outer: Span) -> Option { 2,935 ( 0.00%) while !outer.contains(self) { . self = self.parent_callsite()?; . } . Some(self) 6,457 ( 0.00%) } . . /// Edition of the crate from which this span came. 54,486 ( 0.00%) pub fn edition(self) -> edition::Edition { . self.ctxt().edition() 36,324 ( 0.00%) } . . #[inline] . pub fn rust_2015(self) -> bool { 8,898 ( 0.00%) self.edition() == edition::Edition::Edition2015 . } . . #[inline] . pub fn rust_2018(self) -> bool { 6,389 ( 0.00%) self.edition() >= edition::Edition::Edition2018 . } . . #[inline] . pub fn rust_2021(self) -> bool { 9,220 ( 0.00%) self.edition() >= edition::Edition::Edition2021 . } . . /// Returns the source callee. . /// . /// Returns `None` if the supplied span has no expansion trace, . /// else returns the `ExpnData` for the macro definition . /// corresponding to the source callsite. . pub fn source_callee(self) -> Option { -- line 703 ---------------------------------------- -- line 707 ---------------------------------------- . } . let expn_data = self.ctxt().outer_expn_data(); . if !expn_data.is_root() { Some(source_callee(expn_data)) } else { None } . } . . /// Checks if a span is "internal" to a macro in which `#[unstable]` . /// items can be used (that is, a macro marked with . /// `#[allow_internal_unstable]`). 5,595 ( 0.00%) pub fn allows_unstable(self, feature: Symbol) -> bool { 1,119 ( 0.00%) self.ctxt() . .outer_expn_data() . .allow_internal_unstable . .map_or(false, |features| features.iter().any(|&f| f == feature)) 4,476 ( 0.00%) } . . /// Checks if this span arises from a compiler desugaring of kind `kind`. 53,459 ( 0.00%) pub fn is_desugaring(self, kind: DesugaringKind) -> bool { 45,822 ( 0.00%) match self.ctxt().outer_expn_data().kind { . ExpnKind::Desugaring(k) => k == kind, . _ => false, . } 38,185 ( 0.00%) } . . /// Returns the compiler desugaring that created this span, or `None` . /// if this span is not from a desugaring. 235 ( 0.00%) pub fn desugaring_kind(self) -> Option { 282 ( 0.00%) match self.ctxt().outer_expn_data().kind { . ExpnKind::Desugaring(k) => Some(k), . _ => None, . } 188 ( 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]`). . pub fn allows_unsafe(self) -> bool { . self.ctxt().outer_expn_data().allow_internal_unsafe . } . -- line 745 ---------------------------------------- -- line 767 ---------------------------------------- . . /// Returns a `Span` that would enclose both `self` and `end`. . /// . /// ```text . /// ____ ___ . /// self lorem ipsum end . /// ^^^^^^^^^^^^^^^^^^^^ . /// ``` 1,135,574 ( 0.01%) pub fn to(self, end: Span) -> Span { . let span_data = self.data(); . let end_data = end.data(); . // FIXME(jseyfried): `self.ctxt` should always equal `end.ctxt` here (cf. issue #23480). . // Return the macro span on its own to avoid weird diagnostic output. It is preferable to . // have an incomplete span than a completely nonsensical one. 202,723 ( 0.00%) if span_data.ctxt != end_data.ctxt { 3,744 ( 0.00%) if span_data.ctxt == SyntaxContext::root() { . return end; 3,597 ( 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 }, 698,376 ( 0.01%) if span_data.parent == end_data.parent { span_data.parent } else { None }, . ) 929,106 ( 0.01%) } . . /// Returns a `Span` between the end of `self` to the beginning of `end`. . /// . /// ```text . /// ____ ___ . /// self lorem ipsum end . /// ^^^^^^^^^^^^^ . /// ``` 2,233 ( 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 }, 1,421 ( 0.00%) if span.parent == end.parent { span.parent } else { None }, . ) 1,624 ( 0.00%) } . . /// Returns a `Span` from the beginning of `self` until the beginning of `end`. . /// . /// ```text . /// ____ ___ . /// self lorem ipsum end . /// ^^^^^^^^^^^^^^^^^ . /// ``` 26,235 ( 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. 4,533 ( 0.00%) if span_data.ctxt != end_data.ctxt { 237 ( 0.00%) if span_data.ctxt == SyntaxContext::root() { . return end; 237 ( 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( . span_data.lo, . end_data.lo, . if end_data.ctxt == SyntaxContext::root() { end_data.ctxt } else { span_data.ctxt }, 15,036 ( 0.00%) if span_data.parent == end_data.parent { span_data.parent } else { None }, . ) 21,465 ( 0.00%) } . 2,464 ( 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, . ) 1,568 ( 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 { 5,710 ( 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). 34,308 ( 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)) 20,013 ( 0.00%) } . . #[inline] . pub fn apply_mark(self, expn_id: ExpnId, transparency: Transparency) -> Span { . let span = self.data(); 948,924 ( 0.01%) 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] 124,938 ( 0.00%) pub fn normalize_to_macros_2_0_and_adjust(&mut self, expn_id: ExpnId) -> Option { 83,292 ( 0.00%) let mut span = self.data(); 68,664 ( 0.00%) let mark = span.ctxt.normalize_to_macros_2_0_and_adjust(expn_id); 124,938 ( 0.00%) *self = Span::new(span.lo, span.hi, span.ctxt, span.parent); . mark 138,074 ( 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 . } . . #[inline] . pub fn reverse_glob_adjust( . &mut self, . expn_id: ExpnId, . glob_span: Span, . ) -> Option> { 72 ( 0.00%) let mut span = self.data(); 144 ( 0.00%) let mark = span.ctxt.reverse_glob_adjust(expn_id, glob_span); 288 ( 0.00%) *self = Span::new(span.lo, span.hi, span.ctxt, span.parent); . mark . } . . #[inline] 152,744 ( 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()) 133,651 ( 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 2 ( 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![] } . } . 120 ( 0.00%) pub fn from_span(primary_span: Span) -> MultiSpan { 12,465 ( 0.00%) MultiSpan { primary_spans: vec![primary_span], span_labels: vec![] } 120 ( 0.00%) } . . pub fn from_spans(mut vec: Vec) -> MultiSpan { . vec.sort(); 1,715 ( 0.00%) MultiSpan { primary_spans: vec, span_labels: vec![] } . } . 288 ( 0.00%) pub fn push_span_label(&mut self, span: Span, label: String) { 96 ( 0.00%) self.span_labels.push((span, label)); 240 ( 0.00%) } . . /// Selects the first primary span (if any). . pub fn primary_span(&self) -> Option { . self.primary_spans.first().cloned() 1,357 ( 0.00%) } . . /// Returns all primary spans. . pub fn primary_spans(&self) -> &[Span] { . &self.primary_spans 1 ( 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 { 12,345 ( 0.00%) fn from(span: Span) -> MultiSpan { . MultiSpan::from_span(span) 12,345 ( 0.00%) } . } . . impl From> for MultiSpan { 1,715 ( 0.00%) fn from(spans: Vec) -> MultiSpan { 1,372 ( 0.00%) MultiSpan::from_spans(spans) 1,715 ( 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`. 342 ( 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 { 588 ( 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; . 171 ( 0.00%) fn sub(self, rhs: BytePos) -> Self { 588 ( 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), . } 513 ( 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, . } . 39 ( 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> { 2,361 ( 0.00%) match self { . ExternalSource::Foreign { kind: ExternalSourceKind::Present(ref src), .. } => Some(src), . _ => None, . } . } . } . . #[derive(Debug)] . pub struct OffsetOverflowError; . 1,192 ( 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. 78 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, Debug)] 2,384 ( 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 { 2 ( 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 => { 63 ( 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 { 2 ( 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 { 61 ( 0.00%) match self.kind { . SourceFileHashAlgorithm::Md5 => 16, . SourceFileHashAlgorithm::Sha1 => 20, . SourceFileHashAlgorithm::Sha256 => 32, . } . } . } . . /// A single source in the [`SourceMap`]. 754 ( 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. 13 ( 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. 13 ( 0.00%) pub name_hash: u128, . /// Indicates which crate this `SourceFile` was imported from. 13 ( 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)?; . 52 ( 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 { 26 ( 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); . 26 ( 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))?; 39 ( 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))?; 143 ( 0.00%) s.emit_struct_field("cnum", false, |s| self.cnum.encode(s)) . }) . } . } . . impl Decodable for SourceFile { 5,364 ( 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); 596 ( 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 { 954,996 ( 0.01%) let diff = match bytes_per_diff { . 1 => d.read_u8() as u32, . 2 => d.read_u16() as u32, . 4 => d.read_u32(), . _ => unreachable!(), . }; . . line_start = line_start + BytePos(diff); . -- line 1480 ---------------------------------------- -- line 1483 ---------------------------------------- . } . . lines . }); . let multibyte_chars: Vec = . d.read_struct_field("multibyte_chars", |d| Decodable::decode(d)); . let non_narrow_chars: Vec = . d.read_struct_field("non_narrow_chars", |d| Decodable::decode(d)); 1,192 ( 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)); 6,556 ( 0.00%) SourceFile { 4,768 ( 0.00%) name, . start_pos, . end_pos, . src: None, 2,384 ( 0.00%) src_hash, . // Unused - the metadata decoder will construct . // a new SourceFile, filling in `external_src` properly . external_src: Lock::new(ExternalSource::Unneeded), 2,384 ( 0.00%) lines, 2,384 ( 0.00%) multibyte_chars, 2,384 ( 0.00%) non_narrow_chars, 2,384 ( 0.00%) normalized_pos, . name_hash, . cnum, . } . }) 5,364 ( 0.00%) } . } . . impl fmt::Debug for SourceFile { . fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result { . write!(fmt, "SourceFile({:?})", self.name) . } . } . . impl SourceFile { 209 ( 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); 57 ( 0.00%) let normalized_pos = normalize_src(&mut src, start_pos); . . let name_hash = { . let mut hasher: StableHasher = StableHasher::new(); 38 ( 0.00%) name.hash(&mut hasher); . hasher.finish::() . }; 38 ( 0.00%) let end_pos = start_pos.to_usize() + src.len(); 57 ( 0.00%) assert!(end_pos <= u32::MAX as usize); . 228 ( 0.00%) let (lines, multibyte_chars, non_narrow_chars) = 38 ( 0.00%) analyze_source_file::analyze_source_file(&src, start_pos); . 323 ( 0.00%) SourceFile { . name, . src: Some(Lrc::new(src)), 209 ( 0.00%) src_hash, . external_src: Lock::new(ExternalSource::Unneeded), . start_pos, . end_pos: Pos::from_usize(end_pos), 76 ( 0.00%) lines, 76 ( 0.00%) multibyte_chars, 76 ( 0.00%) non_narrow_chars, 76 ( 0.00%) normalized_pos, . name_hash, . cnum: LOCAL_CRATE, . } 171 ( 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. 5,495 ( 0.00%) pub fn add_external_src(&self, get_src: F) -> bool . where . F: FnOnce() -> Option, . { 797 ( 0.00%) if matches!( 1,570 ( 0.00%) *self.external_src.borrow(), . ExternalSource::Foreign { kind: ExternalSourceKind::AbsentOk, .. } . ) { 2 ( 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 6 ( 0.00%) if let ExternalSource::Foreign { . kind: src_kind @ ExternalSourceKind::AbsentOk, .. . } = &mut *external_src . { 10 ( 0.00%) if let Some(mut src) = src { . // The src_hash needs to be computed on the pre-normalized src. 2 ( 0.00%) if self.src_hash.matches(&src) { 6 ( 0.00%) normalize_src(&mut src, BytePos::from_usize(0)); 16 ( 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 { 783 ( 0.00%) self.src.is_some() || self.external_src.borrow().get_source().is_some() . } 7,065 ( 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() 598 ( 0.00%) } . . pub fn is_imported(&self) -> bool { . self.src.is_none() 38,015 ( 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 { 38,003 ( 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 { 98,665 ( 0.00%) if self.is_empty() { . return self.start_pos..self.end_pos; . } . 66,771 ( 0.00%) assert!(line_index < self.lines.len()); 95,289 ( 0.00%) if line_index == (self.lines.len() - 1) { 170 ( 0.00%) self.lines[line_index]..self.end_pos . } else { 63,402 ( 0.00%) self.lines[line_index]..self.lines[line_index + 1] . } . } . . /// Returns whether or not the file contains the given `SourceMap` byte . /// position. The position one past the end of the file is considered to be . /// contained by the file. This implies that files for which `is_empty` . /// returns true still contain one byte position according to this function. . #[inline] -- line 1674 ---------------------------------------- -- line 1692 ---------------------------------------- . Err(i) if i == 0 => 0, . Err(i) => self.normalized_pos[i - 1].diff, . }; . . BytePos::from_u32(pos.0 - self.start_pos.0 + diff) . } . . /// Converts an absolute `BytePos` to a `CharPos` relative to the `SourceFile`. 2 ( 0.00%) pub fn bytepos_to_file_charpos(&self, bpos: BytePos) -> CharPos { . // The number of extra bytes due to multibyte chars in the `SourceFile`. . let mut total_extra_bytes = 0; . 6 ( 0.00%) for mbc in self.multibyte_chars.iter() { . debug!("{}-byte char at {:?}", mbc.bytes, mbc.pos); . if mbc.pos < bpos { . // Every character is at least one byte, so we only . // count the actual extra bytes. . total_extra_bytes += mbc.bytes as u32 - 1; . // We should never see a byte position in the middle of a . // character. . assert!(bpos.to_u32() >= mbc.pos.to_u32() + mbc.bytes as u32); . } else { . break; . } . } . 12 ( 0.00%) assert!(self.start_pos.to_u32() + total_extra_bytes <= bpos.to_u32()); 10 ( 0.00%) CharPos(bpos.to_usize() - self.start_pos.to_usize() - total_extra_bytes as usize) 4 ( 0.00%) } . . /// Looks up the file's (1-based) line number and (0-based `CharPos`) column offset, for a . /// given `BytePos`. 7 ( 0.00%) pub fn lookup_file_pos(&self, pos: BytePos) -> (usize, CharPos) { 2 ( 0.00%) let chpos = self.bytepos_to_file_charpos(pos); . match self.lookup_line(pos) { . Some(a) => { . let line = a + 1; // Line numbers start at 1 1 ( 0.00%) let linebpos = self.lines[a]; 2 ( 0.00%) let linechpos = self.bytepos_to_file_charpos(linebpos); . let col = chpos - linechpos; . debug!("byte pos {:?} is on the line at byte pos {:?}", pos, linebpos); . debug!("char pos {:?} is on the line at char pos {:?}", chpos, linechpos); . debug!("byte is on line: {}", line); 1 ( 0.00%) assert!(chpos >= linechpos); . (line, col) . } . None => (0, chpos), . } 8 ( 0.00%) } . . /// Looks up the file's (1-based) line number, (0-based `CharPos`) column offset, and (0-based) . /// column offset when displayed, for a given `BytePos`. 8 ( 0.00%) pub fn lookup_file_pos_with_col_display(&self, pos: BytePos) -> (usize, CharPos, usize) { 3 ( 0.00%) let (line, col_or_chpos) = self.lookup_file_pos(pos); 2 ( 0.00%) if line > 0 { . let col = col_or_chpos; 1 ( 0.00%) let linebpos = self.lines[line - 1]; . let col_display = { . let start_width_idx = self . .non_narrow_chars . .binary_search_by_key(&linebpos, |x| x.pos()) . .unwrap_or_else(|x| x); . let end_width_idx = self . .non_narrow_chars . .binary_search_by_key(&pos, |x| x.pos()) . .unwrap_or_else(|x| x); . let special_chars = end_width_idx - start_width_idx; . let non_narrow: usize = self.non_narrow_chars[start_width_idx..end_width_idx] . .iter() . .map(|x| x.width()) . .sum(); 5 ( 0.00%) col.0 - special_chars + non_narrow . }; . (line, col, col_display) . } else { . let chpos = col_or_chpos; . let col_display = { . let end_width_idx = self . .non_narrow_chars . .binary_search_by_key(&pos, |x| x.pos()) . .unwrap_or_else(|x| x); . let non_narrow: usize = . self.non_narrow_chars[0..end_width_idx].iter().map(|x| x.width()).sum(); . chpos.0 - end_width_idx + non_narrow . }; . (0, chpos, col_display) . } 7 ( 0.00%) } . } . . /// Normalizes the source code and records the normalizations. 210 ( 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 189 ( 0.00%) } . . /// Removes UTF-8 BOM, if any. . fn remove_bom(src: &mut String, normalized_pos: &mut Vec) { 21 ( 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) { 21 ( 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])* 149,374 ( 0.00%) $vis struct $ident($inner_vis $inner_ty); . . impl Pos for $ident { . #[inline(always)] . fn from_usize(n: usize) -> $ident { 6,590 ( 0.00%) $ident(n as $inner_ty) . } . . #[inline(always)] . fn to_usize(&self) -> usize { 130,403 ( 0.00%) self.0 as usize . } . . #[inline(always)] . fn from_u32(n: u32) -> $ident { . $ident(n as $inner_ty) . } . . #[inline(always)] -- line 1903 ---------------------------------------- -- line 1906 ---------------------------------------- . } . } . . impl Add for $ident { . type Output = $ident; . . #[inline(always)] . fn add(self, rhs: $ident) -> $ident { 2,434,278 ( 0.03%) $ident(self.0 + rhs.0) . } . } . . impl Sub for $ident { . type Output = $ident; . . #[inline(always)] . fn sub(self, rhs: $ident) -> $ident { 3,018,690 ( 0.04%) $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 { 676,654 ( 0.01%) BytePos(d.read_u32()) . } . } . . // _____________________________________________________________________________ . // Loc, SourceFileAndLine, SourceFileAndBytePos . // . . /// A source code location used for error reporting. -- line 1962 ---------------------------------------- -- line 2042 ---------------------------------------- . /// Range inside of a `Span` used for diagnostics when we only have access to relative positions. . #[derive(Copy, Clone, PartialEq, Eq, Debug)] . pub struct InnerSpan { . pub start: usize, . pub end: usize, . } . . impl InnerSpan { 1,152 ( 0.00%) pub fn new(start: usize, end: usize) -> InnerSpan { . InnerSpan { start, end } 576 ( 0.00%) } . } . . /// Requirements for a `StableHashingContext` to be used in this crate. . /// . /// This is a hack to allow using the [`HashStable_Generic`] derive macro . /// instead of implementing everything in rustc_middle. . pub trait HashStableContext { . fn def_path_hash(&self, def_id: DefId) -> DefPathHash; -- line 2060 ---------------------------------------- -- line 2079 ---------------------------------------- . /// offsets into the `SourceMap`). Instead, we hash the (file name, line, column) . /// triple, which stays the same even if the containing `SourceFile` has moved . /// within the `SourceMap`. . /// . /// Also note that we are hashing byte offsets for the column, not unicode . /// codepoint offsets. For the purpose of the hash that's sufficient. . /// Also, hashing filenames is expensive so we avoid doing it twice when the . /// span starts and ends in the same file, which is almost always the case. 1,327,935 ( 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; . 250,143 ( 0.00%) if !ctx.hash_spans() { . return; . } . 1,077,792 ( 0.01%) let span = self.data_untracked(); 387,813 ( 0.00%) span.ctxt.hash_stable(ctx, hasher); 569,115 ( 0.01%) span.parent.hash_stable(ctx, hasher); . 383,383 ( 0.00%) if span.is_dummy() { . Hash::hash(&TAG_INVALID_SPAN, hasher); . return; . } . 371,464 ( 0.00%) if let Some(parent) = span.parent { . let def_span = ctx.def_span(parent).data_untracked(); . if def_span.contains(span) { . // This span is enclosed in a definition: only hash the relative position. . Hash::hash(&TAG_RELATIVE_SPAN, hasher); . (span.lo - def_span.lo).to_u32().hash_stable(ctx, hasher); . (span.hi - def_span.lo).to_u32().hash_stable(ctx, hasher); . return; . } . } . . // If this is not an empty or invalid span, we want to hash the last . // position that belongs to it, as opposed to hashing the first . // position past it. 742,928 ( 0.01%) let (file, line_lo, col_lo, line_hi, col_hi) = match ctx.span_data_to_lines_and_cols(&span) . { 371,464 ( 0.00%) Some(pos) => pos, . None => { . Hash::hash(&TAG_INVALID_SPAN, hasher); . return; . } . }; . . Hash::hash(&TAG_VALID_SPAN, hasher); . // We truncate the stable ID hash and line and column numbers. The chances -- line 2129 ---------------------------------------- -- line 2134 ---------------------------------------- . // hash only the length, for example, then two otherwise equal spans with . // different end locations will have the same hash. This can cause a problem . // during incremental compilation wherein a previous result for a query that . // depends on the end location of a span will be incorrectly reused when the . // end location of the span it depends on has changed (see issue #74890). A . // similar analysis applies if some query depends specifically on the length . // of the span, but we only hash the end location. So hash both. . 185,732 ( 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; 185,732 ( 0.00%) let len = (span.hi - span.lo).0; . Hash::hash(&col_line, hasher); . Hash::hash(&len, hasher); 1,517,640 ( 0.02%) } . } 4,323,732 ( 0.05%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_borrowck/src/lib.rs -------------------------------------------------------------------------------- Ir -- line 97 ---------------------------------------- . . /// If true, the capture is behind a reference. . by_ref: bool, . } . . const DEREF_PROJECTION: &[PlaceElem<'_>; 1] = &[ProjectionElem::Deref]; . . pub fn provide(providers: &mut Providers) { 4 ( 0.00%) *providers = Providers { . mir_borrowck: |tcx, did| { 1,164 ( 0.00%) if let Some(def) = ty::WithOptConstParam::try_lookup(did, tcx) { . tcx.mir_borrowck_const_arg(def) . } else { 4,632 ( 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%) } . 11,580 ( 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())); . 15,054 ( 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(); 16,212 ( 0.00%) do_mir_borrowck(&infcx, input_body, promoted, false).0 4,632 ( 0.00%) }); . debug!("mir_borrowck done"); . 1,158 ( 0.00%) tcx.arena.alloc(opt_closure_req) 9,264 ( 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. 25,476 ( 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>>) { 11,580 ( 0.00%) let def = input_body.source.with_opt_param().as_local().unwrap(); . . debug!(?def); . 2,316 ( 0.00%) let tcx = infcx.tcx; . let param_env = tcx.param_env(def.did); 1,158 ( 0.00%) let id = tcx.hir().local_def_id_to_hir_id(def.did); . 2,316 ( 0.00%) let mut local_names = IndexVec::from_elem(None, &input_body.local_decls); . for var_debug_info in &input_body.var_debug_info { 16,764 ( 0.00%) if let VarDebugInfoContents::Place(place) = var_debug_info.value { 9,001 ( 0.00%) if let Some(local) = place.as_local() { 13,476 ( 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 . ); . } . } 13,476 ( 0.00%) local_names[local] = Some(var_debug_info.name); . } . } . } . . // Gather the upvars of a closure, if any. 4,632 ( 0.00%) let tables = tcx.typeck_opt_const_arg(def); 2,316 ( 0.00%) if let Some(ErrorReported) = tables.tainted_by_errors { . infcx.set_tainted_by_errors(); . } 4,632 ( 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; 17 ( 0.00%) let by_ref = match capture { . ty::UpvarCapture::ByValue => false, . ty::UpvarCapture::ByRef(..) => true, . }; . Upvar { place: captured_place.clone(), by_ref } . }) . .collect(); . . // Replace all regions with fresh inference variables. This . // requires first making our own copy of the MIR. This copy will . // be modified (in place) to contain non-lexical lifetimes. It . // will have a lifetime tied to the inference context. 2,316 ( 0.00%) let mut body_owned = input_body.clone(); . let mut promoted = input_promoted.clone(); . let free_regions = 3,474 ( 0.00%) nll::replace_regions_in_mir(infcx, param_env, &mut body_owned, &mut promoted); . let body = &body_owned; // no further changes . 1,158 ( 0.00%) let location_table_owned = LocationTable::new(body); . let location_table = &location_table_owned; . . let mut errors_buffer = Vec::new(); 3,474 ( 0.00%) let (move_data, move_errors): (MoveData<'tcx>, Vec<(Place<'tcx>, MoveError<'tcx>)>) = 8,106 ( 0.00%) match MoveData::gather_moves(&body, tcx, param_env) { 6,948 ( 0.00%) Ok(move_data) => (move_data, Vec::new()), . Err((move_data, move_errors)) => (move_data, move_errors), . }; . let promoted_errors = promoted . .iter_enumerated() 2,480 ( 0.00%) .map(|(idx, body)| (idx, MoveData::gather_moves(&body, tcx, param_env))); . 6,948 ( 0.00%) let mdpe = MoveDataParamEnv { move_data, param_env }; . 9,264 ( 0.00%) let mut flow_inits = MaybeInitializedPlaces::new(tcx, &body, &mdpe) 1,158 ( 0.00%) .into_engine(tcx, &body) . .pass_name("borrowck") . .iterate_to_fixpoint() . .into_results_cursor(&body); . 13,896 ( 0.00%) let locals_are_invalidated_at_exit = tcx.hir().body_owner_kind(id).is_fn_or_closure(); . let borrow_set = 11,580 ( 0.00%) Rc::new(BorrowSet::build(tcx, body, locals_are_invalidated_at_exit, &mdpe.move_data)); . 5,790 ( 0.00%) let use_polonius = return_body_with_facts || infcx.tcx.sess.opts.debugging_opts.polonius; . . // Compute non-lexical lifetimes. . let nll::NllOutput { 3,474 ( 0.00%) regioncx, 4,632 ( 0.00%) opaque_type_values, 2,316 ( 0.00%) polonius_input, 3,474 ( 0.00%) polonius_output, 4,632 ( 0.00%) opt_closure_req, 11,580 ( 0.00%) nll_errors, 20,844 ( 0.00%) } = nll::compute_regions( . infcx, 18,528 ( 0.00%) free_regions, . body, . &promoted, . location_table, . param_env, . &mut flow_inits, . &mdpe.move_data, . &borrow_set, . &upvars, . use_polonius, . ); . . // Dump MIR results into a file, if that is enabled. This let us . // write unit-tests, as well as helping with debugging. 3,474 ( 0.00%) nll::dump_mir_results(infcx, &body, ®ioncx, &opt_closure_req); . . // We also have a `#[rustc_regions]` annotation that causes us to dump . // information. 2,316 ( 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. 18,528 ( 0.00%) drop(flow_inits); . 1,158 ( 0.00%) let regioncx = Rc::new(regioncx); . 6,948 ( 0.00%) let flow_borrows = Borrows::new(tcx, body, ®ioncx, &borrow_set) 1,158 ( 0.00%) .into_engine(tcx, body) . .pass_name("borrowck") . .iterate_to_fixpoint(); 6,948 ( 0.00%) let flow_uninits = MaybeUninitializedPlaces::new(tcx, body, &mdpe) 1,158 ( 0.00%) .into_engine(tcx, body) . .pass_name("borrowck") . .iterate_to_fixpoint(); 6,948 ( 0.00%) let flow_ever_inits = EverInitializedPlaces::new(tcx, body, &mdpe) 1,158 ( 0.00%) .into_engine(tcx, body) . .pass_name("borrowck") . .iterate_to_fixpoint(); . 2,540 ( 0.00%) let movable_generator = !matches!( 7,172 ( 0.00%) tcx.hir().get(id), . Node::Expr(&hir::Expr { . kind: hir::ExprKind::Closure(.., Some(hir::Movability::Static)), . .. . }) . ); . 1,736 ( 0.00%) for (idx, move_data_results) in promoted_errors { . let promoted_body = &promoted[idx]; . 496 ( 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(); . 52,110 ( 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(), 4,632 ( 0.00%) errors_buffer, 1,158 ( 0.00%) regioncx: Rc::clone(®ioncx), . used_mut: Default::default(), . used_mut_upvars: SmallVec::new(), 1,158 ( 0.00%) borrow_set: Rc::clone(&borrow_set), 6,948 ( 0.00%) dominators, 4,632 ( 0.00%) upvars, 4,632 ( 0.00%) local_names, . region_names: RefCell::default(), . next_region_name: RefCell::new(1), . polonius_output, . }; . . // Compute and report region errors, if any. 3,474 ( 0.00%) mbcx.report_region_errors(nll_errors); . . let results = BorrowckResults { 6,948 ( 0.00%) ever_inits: flow_ever_inits, 9,264 ( 0.00%) uninits: flow_uninits, 12,738 ( 0.00%) borrows: flow_borrows, . }; . 6,948 ( 0.00%) mbcx.report_move_errors(move_errors); . 1,158 ( 0.00%) rustc_mir_dataflow::visit_results( . body, 1,158 ( 0.00%) traversal::reverse_postorder(body).map(|(bb, _)| bb), . &results, . &mut mbcx, . ); . . // Convert any reservation warnings into lints. . let reservation_warnings = mem::take(&mut mbcx.reservation_warnings); . for (_, (place, span, location, bk, borrow)) in reservation_warnings { . let mut initial_diag = mbcx.report_conflicting_borrow(location, (place, span), bk, &borrow); -- line 381 ---------------------------------------- -- line 406 ---------------------------------------- . // For each non-user used mutable variable, check if it's been assigned from . // a user-declared local. If so, then put that local into the used_mut set. . // Note that this set is expected to be small - only upvars from closures . // would have a chance of erroneously adding non-user-defined mutable vars . // to the set. . let temporary_used_locals: FxHashSet = mbcx . .used_mut . .iter() 1,158 ( 0.00%) .filter(|&local| !mbcx.body.local_decls[*local].is_user_variable()) . .cloned() . .collect(); . // For the remaining unused locals that are marked as mutable, we avoid linting any that . // were never initialized. These locals may have been removed as unreachable code; or will be . // linted as unused variables. . let unused_mut_locals = 1,158 ( 0.00%) mbcx.body.mut_vars_iter().filter(|local| !mbcx.used_mut.contains(local)).collect(); 4,632 ( 0.00%) mbcx.gather_used_muts(temporary_used_locals, unused_mut_locals); . . debug!("mbcx.used_mut: {:?}", mbcx.used_mut); 4,632 ( 0.00%) let used_mut = mbcx.used_mut; 1,158 ( 0.00%) for local in mbcx.body.mut_vars_and_args_iter().filter(|local| !used_mut.contains(local)) { 72 ( 0.00%) let local_decl = &mbcx.body.local_decls[local]; 432 ( 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 216 ( 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. 10,422 ( 0.00%) for (_, (_, diag)) in mbcx.move_error_reported { . diag.buffer(&mut mbcx.errors_buffer); . } . 1,158 ( 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 { 4,632 ( 0.00%) concrete_opaque_types: opaque_type_values, 5,790 ( 0.00%) closure_requirements: opt_closure_req, 6,948 ( 0.00%) used_mut_upvars: mbcx.used_mut_upvars, . }; . 2,316 ( 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); . 16,212 ( 0.00%) (result, body_with_facts) 13,896 ( 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>; . 513,711 ( 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); . 285,395 ( 0.00%) match &stmt.kind { 32,018 ( 0.00%) StatementKind::Assign(box (lhs, ref rhs)) => { . self.consume_rvalue(location, (rhs, span), flow_state); . 64,036 ( 0.00%) self.mutate_place(location, (*lhs, span), Shallow(None), flow_state); . } 1,406 ( 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. 5,624 ( 0.00%) self.check_if_path_or_subpath_is_moved( . location, . InitializationRequiringAction::Use, 12,654 ( 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) => { 129,138 ( 0.00%) self.access_place( . location, 236,753 ( 0.00%) (Place::from(*local), span), . (Shallow(None), Write(WriteKind::StorageDeadOrDrop)), . LocalMutationIsAllowed::Yes, . flow_state, . ); . } . } 456,632 ( 0.01%) } . 175,880 ( 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); . 109,925 ( 0.00%) match term.kind { 3,328 ( 0.00%) TerminatorKind::SwitchInt { ref discr, switch_ty: _, targets: _ } => { 3,328 ( 0.00%) self.consume_operand(loc, (discr, span), flow_state); . } 19,766 ( 0.00%) TerminatorKind::Drop { place, target: _, unwind: _ } => { . debug!( . "visit_terminator_drop \ . loc: {:?} term: {:?} place: {:?} span: {:?}", . loc, term, place, span . ); . 59,298 ( 0.00%) self.access_place( . loc, 88,947 ( 0.00%) (place, span), . (AccessDepth::Drop, Write(WriteKind::StorageDeadOrDrop)), . LocalMutationIsAllowed::Yes, . flow_state, . ); . } . TerminatorKind::DropAndReplace { 62 ( 0.00%) place: drop_place, 31 ( 0.00%) value: ref new_value, . target: _, . unwind: _, . } => { 496 ( 0.00%) self.mutate_place(loc, (drop_place, span), Deep, flow_state); . self.consume_operand(loc, (new_value, span), flow_state); . } . TerminatorKind::Call { 17,562 ( 0.00%) ref func, . ref args, . ref destination, . cleanup: _, . from_hir_call: _, . fn_span: _, . } => { 46,832 ( 0.00%) self.consume_operand(loc, (func, span), flow_state); . for arg in args { 51,594 ( 0.00%) self.consume_operand(loc, (arg, span), flow_state); . } 23,391 ( 0.00%) if let Some((dest, _ /*bb*/)) = *destination { 69,948 ( 0.00%) self.mutate_place(loc, (dest, span), Deep, flow_state); . } . } 2,544 ( 0.00%) TerminatorKind::Assert { ref cond, expected: _, ref msg, target: _, cleanup: _ } => { 424 ( 0.00%) self.consume_operand(loc, (cond, span), flow_state); . use rustc_middle::mir::AssertKind; 851 ( 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); . } . } . . TerminatorKind::Yield { ref value, resume: _, resume_arg, drop: _ } => { . self.consume_operand(loc, (value, span), flow_state); . self.mutate_place(loc, (resume_arg, span), Deep, flow_state); . } -- line 749 ---------------------------------------- -- 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 . } . } 168,968 ( 0.00%) } . 153,895 ( 0.00%) fn visit_terminator_after_primary_effect( . &mut self, . flow_state: &Flows<'cx, 'tcx>, . term: &'cx Terminator<'tcx>, . loc: Location, . ) { 21,985 ( 0.00%) let span = term.source_info.span; . 87,940 ( 0.00%) match term.kind { . TerminatorKind::Yield { value: _, resume: _, resume_arg: _, drop: _ } => { . 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); . } -- line 816 ---------------------------------------- -- line 817 ---------------------------------------- . } . } . . TerminatorKind::Resume | TerminatorKind::Return | TerminatorKind::GeneratorDrop => { . // Returning from the function implicitly kills storage for all locals and statics. . // Often, the storage will already have been killed by an explicit . // StorageDead, but we don't always emit those (notably on unwind paths), . // so this "extra check" serves as a kind of backup. 4,438 ( 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 { .. } => {} . } 175,880 ( 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. 20,596 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, Debug)] . enum LocalMutationIsAllowed { . Yes, . /// We want use of immutable upvars to cause a "write to immutable upvar" . /// error, not an "reassignment" error. . ExceptUpvars, . No, . } . -- line 929 ---------------------------------------- -- line 970 ---------------------------------------- . } . . /// Checks an access to the given place to see if it is allowed. Examines the set of borrows . /// that are in scope, as well as which paths have been initialized, to ensure that (a) the . /// place is initialized and (b) it is not borrowed in some way that would prevent this . /// access. . /// . /// Returns `true` if an error is reported. 1,199,072 ( 0.01%) 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; . 299,768 ( 0.00%) if let Activation(_, borrow_index) = rw { 4,336 ( 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. 74,942 ( 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; . } . 449,652 ( 0.01%) let mutability_error = self.check_access_permissions( 299,768 ( 0.00%) place_span, . rw, . is_local_mutation_allowed, . flow_state, . location, . ); . let conflict_error = 824,362 ( 0.01%) self.check_access_for_conflict(location, place_span, sd, rw, flow_state); . 224,826 ( 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); . } . 224,826 ( 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)); . } 599,536 ( 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, . ); . 74,942 ( 0.00%) let mut error_reported = false; 224,826 ( 0.00%) let tcx = self.infcx.tcx; . let body = self.body; 149,884 ( 0.00%) let borrow_set = self.borrow_set.clone(); . . // Use polonius output if it has been enabled. 149,884 ( 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()) . }; . 974,246 ( 0.01%) each_borrow_involving_path( . self, . tcx, . body, . location, 449,652 ( 0.01%) (sd, place_span.0), . &borrow_set, 449,652 ( 0.01%) borrows_in_scope, 852,641 ( 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.) 2,168 ( 0.00%) (Activation(_, activating), _) if activating == borrow_index => { . debug!( . "check_access_for_conflict place_span: {:?} sd: {:?} rw: {:?} \ . skipping {:?} b/c activation of same borrow_index", . place_span, . sd, . rw, . (borrow_index, borrow), . ); -- line 1084 ---------------------------------------- -- line 1179 ---------------------------------------- . } . } . Control::Break . } . }, . ); . . error_reported 224,826 ( 0.00%) } . 218,690 ( 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. 196,821 ( 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). 21,869 ( 0.00%) if let Some(local) = place_span.0.as_local() { 87,248 ( 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. 208,176 ( 0.00%) self.access_place( . location, 69,392 ( 0.00%) place_span, . (kind, Write(WriteKind::Mutate)), . LocalMutationIsAllowed::No, . flow_state, . ); 174,952 ( 0.00%) } . . fn consume_rvalue( . &mut self, . location: Location, . (rvalue, span): (&'cx Rvalue<'tcx>, Span), . flow_state: &Flows<'cx, 'tcx>, . ) { 96,054 ( 0.00%) match *rvalue { 22,050 ( 0.00%) Rvalue::Ref(_ /*rgn*/, bk, place) => { 81,700 ( 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); 6,500 ( 0.00%) if allow_two_phase_borrow(bk) { . (Deep, Reservation(wk)) . } else { . (Deep, Write(wk)) . } . } . }; . 154,350 ( 0.00%) self.access_place( . location, 29,400 ( 0.00%) (place, span), . access_kind, . LocalMutationIsAllowed::No, . flow_state, . ); . . let action = if bk == BorrowKind::Shallow { . InitializationRequiringAction::MatchOn . } else { . InitializationRequiringAction::Borrow . }; . 51,450 ( 0.00%) self.check_if_path_or_subpath_is_moved( . location, . action, 51,450 ( 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!(), . }; 10,240 ( 0.00%) self.access_place( . location, 2,560 ( 0.00%) (place, span), . (Shallow(af), Read(ReadKind::Copy)), . LocalMutationIsAllowed::No, . flow_state, . ); 4,480 ( 0.00%) self.check_if_path_or_subpath_is_moved( . location, . InitializationRequiringAction::Use, 4,480 ( 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)) => { 5,450 ( 0.00%) self.consume_operand(location, (operand1, span), flow_state); 3,815 ( 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. 4,224 ( 0.00%) match **aggregate_kind { . AggregateKind::Closure(def_id, _) | AggregateKind::Generator(def_id, _, _) => { . let BorrowCheckResult { used_mut_upvars, .. } = 224 ( 0.00%) self.infcx.tcx.mir_borrowck(def_id.expect_local()); . debug!("{:?} used_mut_upvars={:?}", def_id, used_mut_upvars); . for field in used_mut_upvars { 2 ( 0.00%) self.propagate_closure_used_mut_upvar(&operands[field.index()]); . } . } . AggregateKind::Adt(..) . | AggregateKind::Array(..) . | AggregateKind::Tuple { .. } => (), . } . . for operand in operands { . self.consume_operand(location, (operand, span), flow_state); . } . } . } . } . . fn propagate_closure_used_mut_upvar(&mut self, operand: &Operand<'tcx>) { 10 ( 0.00%) let propagate_closure_used_mut_place = |this: &mut Self, place: Place<'tcx>| { . // We have three possibilities here: . // a. We are modifying something through a mut-ref . // b. We are modifying something that is local to our parent . // c. Current body is a nested closure, and we are modifying path starting from . // a Place captured by our parent closure. . . // Handle (c), the path being modified is exactly the path captured by our parent 2 ( 0.00%) if let Some(field) = this.is_upvar_field_projection(place.as_ref()) { . this.used_mut_upvars.push(field); . return; . } . 1 ( 0.00%) for (place_ref, proj) in place.iter_projections().rev() { . // Handle (a) . if proj == ProjectionElem::Deref { . match place_ref.ty(this.body(), this.infcx.tcx).ty.kind() { . // We aren't modifying a variable directly . ty::Ref(_, _, hir::Mutability::Mut) => return, . . _ => {} . } -- line 1382 ---------------------------------------- -- line 1391 ---------------------------------------- . . // Handle(b) . this.used_mut.insert(place.local); . }; . . // This relies on the current way that by-value . // captures of a closure are copied/moved directly . // when generating MIR. 6 ( 0.00%) match *operand { . Operand::Move(place) | Operand::Copy(place) => { 2 ( 0.00%) match place.as_local() { 3 ( 0.00%) Some(local) if !self.body.local_decls[local].is_user_variable() => { 1 ( 0.00%) if self.body.local_decls[local].ty.is_mutable_ptr() { . // The variable will be marked as mutable by the borrow. . return; . } . // This is an edge case where we have a `move` closure . // inside a non-move closure, and the inner closure . // contains a mutation: . // . // let mut i = 0; -- line 1411 ---------------------------------------- -- line 1448 ---------------------------------------- . } . _ => propagate_closure_used_mut_place(self, place), . } . } . Operand::Constant(..) => {} . } . } . 274,776 ( 0.00%) fn consume_operand( . &mut self, . location: Location, . (operand, span): (&'cx Operand<'tcx>, Span), . flow_state: &Flows<'cx, 'tcx>, . ) { 123,415 ( 0.00%) match *operand { 4,491 ( 0.00%) Operand::Copy(place) => { . // copy of place: check if this is "copy of frozen path" . // (FIXME: see check_loans.rs) 9,003 ( 0.00%) self.access_place( . location, 7,485 ( 0.00%) (place, span), . (Deep, Read(ReadKind::Copy)), . LocalMutationIsAllowed::No, . flow_state, . ); . . // Finally, check if path was already moved. 21 ( 0.00%) self.check_if_path_or_subpath_is_moved( . location, . InitializationRequiringAction::Use, 18 ( 0.00%) (place.as_ref(), span), . flow_state, . ); . } 43,599 ( 0.00%) Operand::Move(place) => { . // move of place: check if this is move of already borrowed path 109,369 ( 0.00%) self.access_place( . location, 72,665 ( 0.00%) (place, span), . (Deep, Write(WriteKind::Move)), . LocalMutationIsAllowed::Yes, . flow_state, . ); . . // Finally, check if path was already moved. 10,184 ( 0.00%) self.check_if_path_or_subpath_is_moved( . location, . InitializationRequiringAction::Use, 7,638 ( 0.00%) (place.as_ref(), span), . flow_state, . ); . } . Operand::Constant(_) => {} . } 183,184 ( 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); 754 ( 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) = 5,278 ( 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) . }; . 3,770 ( 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) }; . 9,048 ( 0.00%) if places_conflict::borrow_conflicts_with_place( 1,508 ( 0.00%) self.infcx.tcx, . &self.body, . place, . borrow.kind, 3,016 ( 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. 158,128 ( 0.00%) let borrow_set = self.borrow_set.clone(); 296,439 ( 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 10,840 ( 0.00%) assert!(match borrow.kind { . BorrowKind::Shared | BorrowKind::Shallow => false, . BorrowKind::Unique | BorrowKind::Mut { .. } => true, . }); . 26,016 ( 0.00%) self.access_place( . location, 13,008 ( 0.00%) (borrow.borrowed_place, span), 19,512 ( 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: 27,126 ( 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); . } . } . 330,798 ( 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); 25,446 ( 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.) 203,568 ( 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. . } . } . } . } . } . } . 279,686 ( 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>, . ) { 50,852 ( 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` . 177,982 ( 0.00%) self.check_if_full_path_is_moved(location, desired_action, place_span, flow_state); . 32,864 ( 0.00%) if let Some((place_base, ProjectionElem::Subslice { from, to, from_end: false })) = 25,426 ( 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); 101,704 ( 0.00%) if let Some(mpi) = self.move_path_for_place(place_span.0) { 74,344 ( 0.00%) let uninit_mpi = self . .move_data . .find_in_move_path_or_its_descendants(mpi, |mpi| maybe_uninits.contains(mpi)); . 37,172 ( 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. . } . } 203,408 ( 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) { 330,798 ( 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). . 229,218 ( 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. 57 ( 0.00%) for (place_base, elem) in place.iter_projections().rev() { 276 ( 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 => { 140 ( 0.00%) self.check_if_full_path_is_moved( . location, InitializationRequiringAction::Use, 120 ( 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; 49 ( 0.00%) let base_ty = place_base.ty(self.body(), tcx).ty; 151 ( 0.00%) match base_ty.kind() { 288 ( 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,093 ( 0.00%) for prefix in this.prefixes(base, PrefixSet::Shallow) { 122 ( 0.00%) let mpi = match this.move_path_for_place(prefix) { . Some(mpi) => mpi, . None => continue, . }; . 37 ( 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)); . } . } . 144 ( 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, 149,884 ( 0.00%) (place, span): (Place<'tcx>, Span), . kind: ReadOrWrite, . is_local_mutation_allowed: LocalMutationIsAllowed, . flow_state: &Flows<'cx, 'tcx>, . location: Location, . ) -> bool { . debug!( . "check_access_permissions({:?}, {:?}, is_local_mutation_allowed: {:?})", . place, kind, is_local_mutation_allowed . ); . . let error_access; . let the_place_err; . 1,202,964 ( 0.01%) match kind { . Reservation(WriteKind::MutableBorrow( . borrow_kind @ (BorrowKind::Unique | BorrowKind::Mut { .. }), . )) . | Write(WriteKind::MutableBorrow( . borrow_kind @ (BorrowKind::Unique | BorrowKind::Mut { .. }), . )) => { 32,500 ( 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!(), . }; 22,750 ( 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) => { 121,436 ( 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), . ) => { 91,878 ( 0.00%) if let (Err(_), true) = ( 321,573 ( 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 . } . } . 111,945 ( 0.00%) fn is_local_ever_initialized( . &self, . local: Local, . flow_state: &Flows<'cx, 'tcx>, . ) -> Option { 67,167 ( 0.00%) let mpi = self.move_data.rev_lookup.find_local(local); 22,389 ( 0.00%) let ii = &self.move_data.init_path_map[mpi]; 96,265 ( 0.00%) for &index in ii { 58,196 ( 0.00%) if flow_state.ever_inits.contains(index) { . return Some(index); . } . } . None 89,556 ( 0.00%) } . . /// Adds the place into the used mutable variables set 82,392 ( 0.00%) fn add_used_mut(&mut self, root_place: RootPlace<'tcx>, flow_state: &Flows<'cx, 'tcx>) { 4 ( 0.00%) match root_place { 61,794 ( 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. 38,464 ( 0.00%) if is_local_mutation_allowed != LocalMutationIsAllowed::Yes 53,604 ( 0.00%) && self.is_local_ever_initialized(local, flow_state).is_some() . { . self.used_mut.insert(local); . } . } . RootPlace { . place_local: _, . place_projection: _, . is_local_mutation_allowed: LocalMutationIsAllowed::Yes, . } => {} . RootPlace { 2 ( 0.00%) place_local, 2 ( 0.00%) place_projection: place_projection @ [.., _], . is_local_mutation_allowed: _, . } => { 4 ( 0.00%) if let Some(field) = self.is_upvar_field_projection(PlaceRef { . local: place_local, . projection: place_projection, . }) { 2 ( 0.00%) self.used_mut_upvars.push(field); . } . } . } 77,808 ( 0.00%) } . . /// Whether this value can be written or borrowed mutably. . /// Returns the root place if the place passed in is a projection. 784,971 ( 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); 223,731 ( 0.00%) match place.last_projection() { . None => { 66,537 ( 0.00%) let local = &self.body.local_decls[place.local]; 199,611 ( 0.00%) match local.mutability { 24,418 ( 0.00%) Mutability::Not => match is_local_mutation_allowed { 73,254 ( 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), . }, 108,656 ( 0.00%) Mutability::Mut => Ok(RootPlace { . place_local: place.local, . place_projection: place.projection, . is_local_mutation_allowed, . }), . } . } . Some((place_base, elem)) => { 14,472 ( 0.00%) match elem { . ProjectionElem::Deref => { 5,482 ( 0.00%) let base_ty = place_base.ty(self.body(), self.infcx.tcx).ty; . . // Check the kind of deref to decide 16,446 ( 0.00%) match base_ty.kind() { . ty::Ref(_, _, mutbl) => { 5,482 ( 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 => { 5,482 ( 0.00%) let mode = match self.is_upvar_field_projection(place) { 5 ( 0.00%) Some(field) if self.upvars[field.index()].by_ref => { . is_local_mutation_allowed . } . _ => LocalMutationIsAllowed::Yes, . }; . 16,446 ( 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 2228 ---------------------------------------- . // All other projections are owned by their base path, so mutable if . // base path is mutable . ProjectionElem::Field(..) . | ProjectionElem::Index(..) . | ProjectionElem::ConstantIndex { .. } . | ProjectionElem::Subslice { .. } . | ProjectionElem::Downcast(..) => { . let upvar_field_projection = self.is_upvar_field_projection(place); 4,166 ( 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 . ); 10 ( 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 _ = 18 ( 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) . } . } . } . } . } 570,888 ( 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 { 43,443 ( 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 ---------------------------------------- 2,252,012 ( 0.03%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/sharded.rs -------------------------------------------------------------------------------- Ir -- line 31 ---------------------------------------- . fn default() -> Self { . Self::new(T::default) . } . } . . impl Sharded { . #[inline] . pub fn new(mut value: impl FnMut() -> T) -> Self { 2 ( 0.00%) Sharded { shards: [(); SHARDS].map(|()| CacheAligned(Lock::new(value()))) } . } . . /// The shard is selected by hashing `val` with `FxHasher`. . #[inline] . pub fn get_shard_by_value(&self, val: &K) -> &Lock { . if SHARDS == 1 { &self.shards[0].0 } else { self.get_shard_by_hash(make_hash(val)) } . } . . #[inline] . pub fn get_shard_by_hash(&self, hash: u64) -> &Lock { . &self.shards[get_shard_index_by_hash(hash)].0 . } . . #[inline] . pub fn get_shard_by_index(&self, i: usize) -> &Lock { 282,366 ( 0.00%) &self.shards[i].0 . } . . pub fn lock_shards(&self) -> Vec> { . (0..SHARDS).map(|i| self.shards[i].0.lock()).collect() . } . . pub fn try_lock_shards(&self) -> Option>> { . (0..SHARDS).map(|i| self.shards[i].0.try_lock()).collect() -- line 63 ---------------------------------------- -- line 79 ---------------------------------------- . K: Borrow, . Q: Hash + Eq, . { . let hash = make_hash(value); . let mut shard = self.get_shard_by_hash(hash).lock(); . let entry = shard.raw_entry_mut().from_key_hashed_nocheck(hash, value); . . match entry { 1,925,199 ( 0.02%) RawEntryMut::Occupied(e) => *e.key(), . RawEntryMut::Vacant(e) => { . let v = make(); . e.insert_hashed_nocheck(hash, v, ()); . v . } . } . } . -- line 95 ---------------------------------------- -- line 99 ---------------------------------------- . K: Borrow, . Q: Hash + Eq, . { . let hash = make_hash(&value); . let mut shard = self.get_shard_by_hash(hash).lock(); . let entry = shard.raw_entry_mut().from_key_hashed_nocheck(hash, &value); . . match entry { 2,443,319 ( 0.03%) RawEntryMut::Occupied(e) => *e.key(), . RawEntryMut::Vacant(e) => { 3,190,132 ( 0.04%) let v = make(value); . e.insert_hashed_nocheck(hash, v, ()); . v . } . } 51 ( 0.00%) } . } . . pub trait IntoPointer { . /// Returns a pointer which outlives `self`. . fn into_pointer(&self) -> *const (); . } . . impl ShardedHashMap { -- line 122 ---------------------------------------- -- line 125 ---------------------------------------- . let shard = self.get_shard_by_hash(hash).lock(); . let value = value.into_pointer(); . shard.raw_entry().from_hash(hash, |entry| entry.into_pointer() == value).is_some() . } . } . . #[inline] . fn make_hash(val: &K) -> u64 { 9,079,836 ( 0.11%) let mut state = FxHasher::default(); 2,370,433 ( 0.03%) val.hash(&mut state); . state.finish() . } . . /// Get a shard with a pre-computed hash value. If `get_shard_by_value` is . /// ever used in combination with `get_shard_by_hash` on a single `Sharded` . /// instance, then `hash` must be computed with `FxHasher`. Otherwise, . /// `hash` can be computed with any hasher, so long as that hasher is used . /// consistently for each `Sharded` instance. -- line 142 ---------------------------------------- 3,968,359 ( 0.05%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/index.rs -------------------------------------------------------------------------------- Ir -- line 154 ---------------------------------------- . . #[stable(feature = "slice_get_slice_impls", since = "1.15.0")] . unsafe impl SliceIndex<[T]> for usize { . type Output = T; . . #[inline] . fn get(self, slice: &[T]) -> Option<&T> { . // SAFETY: `self` is checked to be in bounds. 3,015,070 ( 0.04%) if self < slice.len() { unsafe { Some(&*self.get_unchecked(slice)) } } else { None } . } . . #[inline] . fn get_mut(self, slice: &mut [T]) -> Option<&mut T> { . // SAFETY: `self` is checked to be in bounds. 6,927,888 ( 0.08%) if self < slice.len() { unsafe { Some(&mut *self.get_unchecked_mut(slice)) } } else { None } . } . . #[inline] . unsafe fn get_unchecked(self, slice: *const [T]) -> *const T { . // SAFETY: the caller guarantees that `slice` is not dangling, so it . // cannot be longer than `isize::MAX`. They also guarantee that . // `self` is in bounds of `slice` so `self` cannot overflow an `isize`, . // so the call to `add` is safe. -- line 176 ---------------------------------------- -- line 181 ---------------------------------------- . unsafe fn get_unchecked_mut(self, slice: *mut [T]) -> *mut T { . // SAFETY: see comments for `get_unchecked` above. . unsafe { slice.as_mut_ptr().add(self) } . } . . #[inline] . fn index(self, slice: &[T]) -> &T { . // N.B., use intrinsic indexing 36,271,024 ( 0.43%) &(*slice)[self] . } . . #[inline] . fn index_mut(self, slice: &mut [T]) -> &mut T { . // N.B., use intrinsic indexing 10,147,479 ( 0.12%) &mut (*slice)[self] . } . } . . #[stable(feature = "slice_get_slice_impls", since = "1.15.0")] . unsafe impl SliceIndex<[T]> for ops::Range { . type Output = [T]; . . #[inline] . fn get(self, slice: &[T]) -> Option<&[T]> { 29,659 ( 0.00%) if self.start > self.end || self.end > slice.len() { . None . } else { . // SAFETY: `self` is checked to be valid and in bounds above. . unsafe { Some(&*self.get_unchecked(slice)) } . } . } . . #[inline] -- line 213 ---------------------------------------- -- line 221 ---------------------------------------- . } . . #[inline] . unsafe fn get_unchecked(self, slice: *const [T]) -> *const [T] { . // SAFETY: the caller guarantees that `slice` is not dangling, so it . // cannot be longer than `isize::MAX`. They also guarantee that . // `self` is in bounds of `slice` so `self` cannot overflow an `isize`, . // so the call to `add` is safe. 822,005 ( 0.01%) unsafe { ptr::slice_from_raw_parts(slice.as_ptr().add(self.start), self.end - self.start) } . } . . #[inline] . unsafe fn get_unchecked_mut(self, slice: *mut [T]) -> *mut [T] { . // SAFETY: see comments for `get_unchecked` above. . unsafe { 76,881 ( 0.00%) ptr::slice_from_raw_parts_mut(slice.as_mut_ptr().add(self.start), self.end - self.start) . } . } . . #[inline] . fn index(self, slice: &[T]) -> &[T] { 154,255 ( 0.00%) if self.start > self.end { . slice_index_order_fail(self.start, self.end); 1,077,350 ( 0.01%) } else if self.end > slice.len() { . slice_end_index_len_fail(self.end, slice.len()); . } . // SAFETY: `self` is checked to be valid and in bounds above. . unsafe { &*self.get_unchecked(slice) } . } . . #[inline] . fn index_mut(self, slice: &mut [T]) -> &mut [T] { 13,735 ( 0.00%) if self.start > self.end { . slice_index_order_fail(self.start, self.end); 68,857 ( 0.00%) } else if self.end > slice.len() { . slice_end_index_len_fail(self.end, slice.len()); . } . // SAFETY: `self` is checked to be valid and in bounds above. . unsafe { &mut *self.get_unchecked_mut(slice) } . } . } . . #[stable(feature = "slice_get_slice_impls", since = "1.15.0")] -- line 263 ---------------------------------------- -- line 320 ---------------------------------------- . #[inline] . unsafe fn get_unchecked_mut(self, slice: *mut [T]) -> *mut [T] { . // SAFETY: the caller has to uphold the safety contract for `get_unchecked_mut`. . unsafe { (self.start..slice.len()).get_unchecked_mut(slice) } . } . . #[inline] . fn index(self, slice: &[T]) -> &[T] { 542,756 ( 0.01%) if self.start > slice.len() { . slice_start_index_len_fail(self.start, slice.len()); . } . // SAFETY: `self` is checked to be valid and in bounds above. . unsafe { &*self.get_unchecked(slice) } . } . . #[inline] . fn index_mut(self, slice: &mut [T]) -> &mut [T] { 29,250 ( 0.00%) if self.start > slice.len() { . slice_start_index_len_fail(self.start, slice.len()); . } . // SAFETY: `self` is checked to be valid and in bounds above. . unsafe { &mut *self.get_unchecked_mut(slice) } . } . } . . #[stable(feature = "slice_get_slice_impls", since = "1.15.0")] -- line 345 ---------------------------------------- -- line 539 ---------------------------------------- . let end = match end { . ops::Bound::Included(end) => { . end.checked_add(1).unwrap_or_else(|| slice_end_index_overflow_fail()) . } . ops::Bound::Excluded(&end) => end, . ops::Bound::Unbounded => len, . }; . 77,078 ( 0.00%) if start > end { . slice_index_order_fail(start, end); . } 504 ( 0.00%) if end > len { . slice_end_index_len_fail(end, len); . } . . ops::Range { start, end } . } . . /// Convert pair of `ops::Bound`s into `ops::Range` without performing any bounds checking and (in debug) overflow checking . fn into_range_unchecked( -- line 558 ---------------------------------------- 7,449,166 ( 0.09%) -------------------------------------------------------------------------------- -- 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> { 2,217,080 ( 0.03%) TypeFreshener { . infcx, . ty_freshen_count: 0, . const_freshen_count: 0, . ty_freshen_map: Default::default(), . const_freshen_map: Default::default(), . keep_static, . } . } . 3,542,200 ( 0.04%) fn freshen_ty( . &mut self, . opt_ty: Option>, . key: ty::InferTy, . freshener: F, . ) -> Ty<'tcx> . where . F: FnOnce(u32) -> ty::InferTy, . { 885,550 ( 0.01%) if let Some(ty) = opt_ty { . return ty.fold_with(self); . } . 852,422 ( 0.01%) match self.ty_freshen_map.entry(key) { 142,202 ( 0.00%) Entry::Occupied(entry) => *entry.get(), . Entry::Vacant(entry) => { 284,009 ( 0.00%) let index = self.ty_freshen_count; 1,136,036 ( 0.01%) self.ty_freshen_count += 1; 568,018 ( 0.01%) let t = self.infcx.tcx.mk_ty_infer(freshener(index)); . entry.insert(t); . t . } . } 3,835,899 ( 0.05%) } . . 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> { 2,436,462 ( 0.03%) self.infcx.tcx 335,773 ( 0.00%) } . . fn fold_region(&mut self, r: ty::Region<'tcx>) -> ty::Region<'tcx> { 929,680 ( 0.01%) match *r { . ty::ReLateBound(..) => { . // leave bound regions alone . r . } . . ty::ReEarlyBound(..) . | ty::ReFree(_) . | ty::ReVar(_) . | ty::RePlaceholder(..) . | ty::ReEmpty(_) . | ty::ReErased => { . // replace all free regions with 'erased . self.tcx().lifetimes.re_erased . } . ty::ReStatic => { 10,529 ( 0.00%) if self.keep_static { . r . } else { . self.tcx().lifetimes.re_erased . } . } . } 208 ( 0.00%) } . 9,519,198 ( 0.11%) fn fold_ty(&mut self, t: Ty<'tcx>) -> Ty<'tcx> { 4,759,599 ( 0.06%) if !t.needs_infer() && !t.has_erasable_regions() { . return t; . } . . let tcx = self.infcx.tcx; . 5,974,892 ( 0.07%) match *t.kind() { 440,213 ( 0.01%) ty::Infer(ty::TyVar(v)) => { 3,521,704 ( 0.04%) let opt_ty = self.infcx.inner.borrow_mut().type_variables().probe(v).known(); 3,961,917 ( 0.05%) self.freshen_ty(opt_ty, ty::TyVar(v), ty::FreshTy) . } . 10,248 ( 0.00%) ty::Infer(ty::IntVar(v)) => self.freshen_ty( 20,496 ( 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(..) 4,125,712 ( 0.05%) | ty::Opaque(..) => t.super_fold_with(self), . . ty::Placeholder(..) | ty::Bound(..) => bug!("unexpected type {:?}", t), . } 4,414,242 ( 0.05%) } . 8,208 ( 0.00%) fn fold_const(&mut self, ct: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> { 8,208 ( 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(_) => {} . } . 10,944 ( 0.00%) ct.super_fold_with(self) . } . } 3,397,062 ( 0.04%) -------------------------------------------------------------------------------- -- 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> { 197,384 ( 0.00%) fn reverse(&mut self, undo: UndoLog<'tcx>) { 826,224 ( 0.01%) match undo { 160,696 ( 0.00%) UndoLog::EqRelation(undo) => self.eq_relations.reverse(undo), 80,288 ( 0.00%) UndoLog::SubRelation(undo) => self.sub_relations.reverse(undo), 153,784 ( 0.00%) UndoLog::Values(undo) => self.values.reverse(undo), . } 394,768 ( 0.00%) } . } . . 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, . } . 5,697,656 ( 0.07%) #[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> { 3,985,594 ( 0.05%) 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> { 84,621 ( 0.00%) TypeVariableStorage { . values: sv::SnapshotVecStorage::new(), . eq_relations: ut::UnificationTableStorage::new(), . sub_relations: ut::UnificationTableStorage::new(), . } . } . . #[inline] . pub(crate) fn with_log<'a>( -- line 182 ---------------------------------------- -- line 188 ---------------------------------------- . } . . impl<'tcx> TypeVariableTable<'_, 'tcx> { . /// Returns the origin that was given when `vid` was created. . /// . /// Note that this function does not return care whether . /// `vid` has been unified with something else or not. . pub fn var_origin(&self, vid: ty::TyVid) -> &TypeVariableOrigin { 2,542 ( 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()); 292,467 ( 0.00%) self.eq_relations().union(a, b); 250,686 ( 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()); 18,508 ( 0.00%) self.sub_relations().union(a, b); . } . . /// Instantiates `vid` with the type `ty`. . /// . /// Precondition: `vid` must not have been previously instantiated. 717,190 ( 0.01%) pub fn instantiate(&mut self, vid: ty::TyVid, ty: Ty<'tcx>) { . let vid = self.root_var(vid); . debug_assert!(self.probe(vid).is_unknown()); . debug_assert!( . self.eq_relations().probe_value(vid).is_unknown(), . "instantiating type variable `{:?}` twice: new-value = {:?}, old-value={:?}", . vid, . ty, . self.eq_relations().probe_value(vid) . ); 1,004,066 ( 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); 717,190 ( 0.01%) } . . /// Creates a new type variable. . /// . /// - `diverging`: indicates if this is a "diverging" type . /// variable, e.g., one created as the type of a `return` . /// expression. The code in this module doesn't care if a . /// variable is diverging, but the main Rust type-checker will . /// sometimes "unify" such variables with the `!` or `()` types. . /// - `origin`: indicates *why* the type variable was created. . /// The code in this module doesn't care, but it can be useful . /// for improving error messages. 959,604 ( 0.01%) pub fn new_var( . &mut self, . universe: ty::UniverseIndex, . origin: TypeVariableOrigin, . ) -> ty::TyVid { 1,439,406 ( 0.02%) let eq_key = self.eq_relations().new_key(TypeVariableValue::Unknown { universe }); . 799,670 ( 0.01%) let sub_key = self.sub_relations().new_key(()); 159,934 ( 0.00%) assert_eq!(eq_key.vid, sub_key); . 1,439,406 ( 0.02%) let index = self.values().push(TypeVariableData { origin }); 639,736 ( 0.01%) assert_eq!(eq_key.vid.as_u32(), index as u32); . . debug!("new_var(index={:?}, universe={:?}, origin={:?}", eq_key.vid, universe, origin,); . . eq_key.vid 1,119,538 ( 0.01%) } . . /// Returns the number of type variables created thus far. . pub fn num_vars(&self) -> usize { 4,422 ( 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 { 723,501 ( 0.01%) 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) 863 ( 0.00%) pub fn sub_root_var(&mut self, vid: ty::TyVid) -> ty::TyVid { 563,178 ( 0.01%) self.sub_relations().find(vid) 1,726 ( 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. 13,262,800 ( 0.16%) pub fn probe(&mut self, vid: ty::TyVid) -> TypeVariableValue<'tcx> { . self.inlined_probe(vid) 13,262,800 ( 0.16%) } . . /// An always-inlined variant of `probe`, for very hot call sites. . #[inline(always)] . pub fn inlined_probe(&mut self, vid: ty::TyVid) -> TypeVariableValue<'tcx> { 13,770,802 ( 0.16%) self.eq_relations().inlined_probe_value(vid) . } . . /// If `t` is a type-inference variable, and it has been . /// instantiated, then return the with which it was . /// instantiated. Otherwise, returns `t`. . pub fn replace_if_possible(&mut self, t: Ty<'tcx>) -> Ty<'tcx> { 1,770,850 ( 0.02%) match *t.kind() { 1,473,461 ( 0.02%) 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>> { 13,240,147 ( 0.16%) self.storage.eq_relations.with_log(self.undo_log) . } . . #[inline] . fn sub_relations(&mut self) -> super::UnificationTable<'_, 'tcx, ty::TyVid> { 399,749 ( 0.00%) self.storage.sub_relations.with_log(self.undo_log) . } . . /// Returns a range of the type variables created during the snapshot. 22,110 ( 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()); 26,532 ( 0.00%) ( . range.start..range.end, . (range.start.as_usize()..range.end.as_usize()) . .map(|index| self.storage.values.get(index).origin) . .collect(), . ) 26,532 ( 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); 879,664 ( 0.01%) 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: 27,292,759 ( 0.33%) 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 { 707,837 ( 0.01%) match (value1, value2) { . // We never equate two type variables, both of which . // have known types. Instead, we recursively equate . // those types. . (&TypeVariableValue::Known { .. }, &TypeVariableValue::Known { .. }) => { . bug!("equating two type variables, both of which have known types") . } . . // If one side is known, prefer that one. . (&TypeVariableValue::Known { .. }, &TypeVariableValue::Unknown { .. }) => Ok(*value1), . (&TypeVariableValue::Unknown { .. }, &TypeVariableValue::Known { .. }) => Ok(*value2), . . // If both sides are *unknown*, it hardly matters, does it? . ( 26,817 ( 0.00%) &TypeVariableValue::Unknown { universe: universe1 }, 26,817 ( 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); 107,268 ( 0.00%) Ok(TypeVariableValue::Unknown { universe }) . } . } . } . } 467,694 ( 0.01%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_trait_selection/src/traits/select/mod.rs -------------------------------------------------------------------------------- Ir -- line 208 ---------------------------------------- . /// There is no built-in impl. There may be some other . /// candidate (a where-clause or user-defined impl). . None, . /// It is unknown whether there is an impl. . Ambiguous, . } . . impl<'cx, 'tcx> SelectionContext<'cx, 'tcx> { 414,288 ( 0.00%) pub fn new(infcx: &'cx InferCtxt<'cx, 'tcx>) -> SelectionContext<'cx, 'tcx> { 2,556,372 ( 0.03%) SelectionContext { . infcx, 387,964 ( 0.00%) freshener: infcx.freshener_keep_static(), . intercrate: false, . intercrate_ambiguity_causes: None, . allow_negative_impls: false, . query_mode: TraitQueryMode::Standard, . } 345,240 ( 0.00%) } . . pub fn intercrate(infcx: &'cx InferCtxt<'cx, 'tcx>) -> SelectionContext<'cx, 'tcx> { 10,160 ( 0.00%) SelectionContext { . infcx, 1,270 ( 0.00%) freshener: infcx.freshener_keep_static(), . intercrate: true, . intercrate_ambiguity_causes: None, . allow_negative_impls: false, . query_mode: TraitQueryMode::Standard, . } . } . . pub fn with_negative( -- line 238 ---------------------------------------- -- line 245 ---------------------------------------- . freshener: infcx.freshener_keep_static(), . intercrate: false, . intercrate_ambiguity_causes: None, . allow_negative_impls, . query_mode: TraitQueryMode::Standard, . } . } . 43,680 ( 0.00%) pub fn with_query_mode( . infcx: &'cx InferCtxt<'cx, 'tcx>, . query_mode: TraitQueryMode, . ) -> SelectionContext<'cx, 'tcx> { . debug!(?query_mode, "with_query_mode"); 87,360 ( 0.00%) SelectionContext { . infcx, 5,460 ( 0.00%) freshener: infcx.freshener_keep_static(), . intercrate: false, . intercrate_ambiguity_causes: None, . allow_negative_impls: false, . query_mode, . } 32,760 ( 0.00%) } . . /// Enables tracking of intercrate ambiguity causes. These are . /// used in coherence to give improved diagnostics. We don't do . /// this until we detect a coherence error because it can lead to . /// false overflow results (#47139) and because it costs . /// computation time. . pub fn enable_tracking_intercrate_ambiguity_causes(&mut self) { . assert!(self.intercrate); -- line 274 ---------------------------------------- -- line 281 ---------------------------------------- . /// was enabled and disables tracking at the same time. If . /// tracking is not enabled, just returns an empty vector. . pub fn take_intercrate_ambiguity_causes(&mut self) -> Vec { . assert!(self.intercrate); . self.intercrate_ambiguity_causes.take().unwrap_or_default() . } . . pub fn infcx(&self) -> &'cx InferCtxt<'cx, 'tcx> { 23,971,025 ( 0.29%) self.infcx 62,611 ( 0.00%) } . . pub fn tcx(&self) -> TyCtxt<'tcx> { 2,586,844 ( 0.03%) self.infcx.tcx . } . . pub fn is_intercrate(&self) -> bool { 1,178,762 ( 0.01%) self.intercrate . } . . /////////////////////////////////////////////////////////////////////////// . // Selection . // . // The selection phase tries to identify *how* an obligation will . // be resolved. For example, it will identify which impl or . // parameter bound is to be used. The process can be inconclusive -- line 305 ---------------------------------------- -- line 309 ---------------------------------------- . // 1. If no applicable impl or parameter bound can be found. . // 2. If the output type parameters in the obligation do not match . // those specified by the impl/bound. For example, if the obligation . // is `Vec: Iterable`, but the impl specifies . // `impl Iterable for Vec`, than an error would result. . . /// Attempts to satisfy the obligation. If successful, this will affect the surrounding . /// type environment by performing unification. 1,575,364 ( 0.02%) #[instrument(level = "debug", skip(self))] 2,025,468 ( 0.02%) pub fn select( . &mut self, . obligation: &TraitObligation<'tcx>, . ) -> SelectionResult<'tcx, Selection<'tcx>> { 1,588,620 ( 0.02%) let candidate = match self.select_from_obligation(obligation) { . Err(SelectionError::Overflow) => { . // In standard mode, overflow must have been caught and reported . // earlier. . assert!(self.query_mode == TraitQueryMode::Canonical); . return Err(SelectionError::Overflow); . } . Err(SelectionError::Ambiguous(_)) => { . return Ok(None); . } . Err(e) => { 80,192 ( 0.00%) return Err(e); . } . Ok(None) => { 279,849 ( 0.00%) return Ok(None); . } 750,846 ( 0.01%) Ok(Some(candidate)) => candidate, . }; . 1,254,150 ( 0.01%) match self.confirm_candidate(obligation, candidate) { . Err(SelectionError::Overflow) => { . assert!(self.query_mode == TraitQueryMode::Canonical); . Err(SelectionError::Overflow) . } 17,810 ( 0.00%) Err(e) => Err(e), . Ok(candidate) => { . debug!(?candidate, "confirmed"); 1,485,252 ( 0.02%) Ok(Some(candidate)) . } . } . } . 2,250,520 ( 0.03%) crate fn select_from_obligation( . &mut self, . obligation: &TraitObligation<'tcx>, . ) -> SelectionResult<'tcx, SelectionCandidate<'tcx>> { . debug_assert!(!obligation.predicate.has_escaping_bound_vars()); . . let pec = &ProvisionalEvaluationCache::default(); . let stack = self.push_stack(TraitObligationStackList::empty(pec), obligation); . 450,104 ( 0.01%) self.candidate_from_obligation(&stack) 2,025,468 ( 0.02%) } . . /////////////////////////////////////////////////////////////////////////// . // EVALUATION . // . // Tests whether an obligation can be selected or whether an impl . // can be applied to particular types. It skips the "confirmation" . // step and hence completely ignores output type parameters. . // -- line 372 ---------------------------------------- -- line 374 ---------------------------------------- . // we can be sure it does not. . . /// Evaluates whether the obligation `obligation` can be satisfied (by any means). . pub fn predicate_may_hold_fatal(&mut self, obligation: &PredicateObligation<'tcx>) -> bool { . debug!(?obligation, "predicate_may_hold_fatal"); . . // This fatal query is a stopgap that should only be used in standard mode, . // where we do not expect overflow to be propagated. 70 ( 0.00%) assert!(self.query_mode == TraitQueryMode::Standard); . 350 ( 0.00%) self.evaluate_root_obligation(obligation) . .expect("Overflow should be caught earlier in standard query mode") . .may_apply() . } . . /// Evaluates whether the obligation `obligation` can be satisfied . /// and returns an `EvaluationResult`. This is meant for the . /// *initial* call. 10,920 ( 0.00%) pub fn evaluate_root_obligation( . &mut self, . obligation: &PredicateObligation<'tcx>, . ) -> Result { . self.evaluation_probe(|this| { 16,590 ( 0.00%) this.evaluate_predicate_recursively( . TraitObligationStackList::empty(&ProvisionalEvaluationCache::default()), . obligation.clone(), . ) . }) 10,920 ( 0.00%) } . . fn evaluation_probe( . &mut self, . op: impl FnOnce(&mut Self) -> Result, . ) -> Result { 249,833 ( 0.00%) self.infcx.probe(|snapshot| -> Result { 11,060 ( 0.00%) let result = op(self)?; . 224,959 ( 0.00%) match self.infcx.leak_check(true, snapshot) { . Ok(()) => {} . Err(_) => return Ok(EvaluatedToErr), . } . 160,685 ( 0.00%) match self.infcx.region_constraints_added_in_snapshot(snapshot) { . None => Ok(result), . Some(_) => Ok(result.max(EvaluatedToOkModuloRegions)), . } . }) . } . . /// Evaluates the predicates in `predicates` recursively. Note that . /// this applies projections in the predicates, and therefore . /// is run within an inference probe. 223,560 ( 0.00%) #[instrument(skip(self, stack), level = "debug")] . fn evaluate_predicates_recursively<'o, I>( . &mut self, . stack: TraitObligationStackList<'o, 'tcx>, . predicates: I, . ) -> Result . where . I: IntoIterator> + std::fmt::Debug, . { . let mut result = EvaluatedToOk; 288,551 ( 0.00%) for obligation in predicates { 30,508 ( 0.00%) let eval = self.evaluate_predicate_recursively(stack, obligation.clone())?; 15,254 ( 0.00%) if let EvaluatedToErr = eval { . // fast-path - EvaluatedToErr is the top of the lattice, . // so we don't need to look on the other predicates. . return Ok(EvaluatedToErr); . } else { . result = cmp::max(result, eval); . } . } . Ok(result) . } . 131,570 ( 0.00%) #[instrument( . level = "debug", . skip(self, previous_stack), . fields(previous_stack = ?previous_stack.head()) 118,413 ( 0.00%) )] . fn evaluate_predicate_recursively<'o>( . &mut self, . previous_stack: TraitObligationStackList<'o, 'tcx>, . obligation: PredicateObligation<'tcx>, . ) -> Result { . // `previous_stack` stores a `TraitObligation`, while `obligation` is . // a `PredicateObligation`. These are distinct types, so we can't . // use any `Option` combinator method that would force them to be . // the same. 26,314 ( 0.00%) match previous_stack.head() { 15,226 ( 0.00%) Some(h) => self.check_recursion_limit(&obligation, h.obligation)?, 5,544 ( 0.00%) None => self.check_recursion_limit(&obligation, &obligation)?, . } . 78,942 ( 0.00%) let result = ensure_sufficient_stack(|| { 13,157 ( 0.00%) let bound_predicate = obligation.predicate.kind(); 131,570 ( 0.00%) match bound_predicate.skip_binder() { . ty::PredicateKind::Trait(t) => { . let t = bound_predicate.rebind(t); . debug_assert!(!t.has_escaping_bound_vars()); . let obligation = obligation.with(t); 185,625 ( 0.00%) self.evaluate_trait_predicate_recursively(previous_stack, obligation) . } . . ty::PredicateKind::Subtype(p) => { . let p = bound_predicate.rebind(p); . // Does this code ever run? 345 ( 0.00%) match self.infcx.subtype_predicate(&obligation.cause, obligation.param_env, p) { . Some(Ok(InferOk { mut obligations, .. })) => { . self.add_depth(obligations.iter_mut(), obligation.recursion_depth); . self.evaluate_predicates_recursively( . previous_stack, . obligations.into_iter(), . ) . } . Some(Err(_)) => Ok(EvaluatedToErr), -- line 489 ---------------------------------------- -- line 522 ---------------------------------------- . None => Ok(EvaluatedToAmbig), . }, . . ty::PredicateKind::TypeOutlives(pred) => { . // A global type with no late-bound regions can only . // contain the "'static" lifetime (any other lifetime . // would either be late-bound or local), so it is guaranteed . // to outlive any other lifetime 10 ( 0.00%) if pred.0.is_global() && !pred.0.has_late_bound_regions() { . Ok(EvaluatedToOk) . } else { . Ok(EvaluatedToOkModuloRegions) . } . } . . ty::PredicateKind::RegionOutlives(..) => { . // We do not consider region relationships when evaluating trait matches. -- line 538 ---------------------------------------- -- line 545 ---------------------------------------- . } else { . Ok(EvaluatedToErr) . } . } . . ty::PredicateKind::Projection(data) => { . let data = bound_predicate.rebind(data); . let project_obligation = obligation.with(data); 3,588 ( 0.00%) match project::poly_project_and_unify_type(self, &project_obligation) { 855 ( 0.00%) Ok(Ok(Some(mut subobligations))) => { . 'compute_res: { . // If we've previously marked this projection as 'complete', thne . // use the final cached result (either `EvaluatedToOk` or . // `EvaluatedToOkModuloRegions`), and skip re-evaluating the . // sub-obligations. 684 ( 0.00%) if let Some(key) = 1,539 ( 0.00%) ProjectionCacheKey::from_poly_projection_predicate(self, data) . { 1,360 ( 0.00%) if let Some(cached_res) = self . .infcx . .inner . .borrow_mut() . .projection_cache() . .is_complete(key) . { . break 'compute_res Ok(cached_res); . } . } . 336 ( 0.00%) self.add_depth( . subobligations.iter_mut(), 336 ( 0.00%) obligation.recursion_depth, . ); 336 ( 0.00%) let res = self.evaluate_predicates_recursively( 504 ( 0.00%) previous_stack, 840 ( 0.00%) subobligations, . ); 672 ( 0.00%) if let Ok(res) = res { 336 ( 0.00%) if res == EvaluatedToOk || res == EvaluatedToOkModuloRegions { 484 ( 0.00%) if let Some(key) = 121 ( 0.00%) ProjectionCacheKey::from_poly_projection_predicate( 847 ( 0.00%) self, data, . ) . { . // If the result is something that we can cache, then mark this . // entry as 'complete'. This will allow us to skip evaluating the . // suboligations at all the next time we evaluate the projection . // predicate. 840 ( 0.00%) self.infcx . .inner . .borrow_mut() . .projection_cache() . .complete(key, res); . } . } . } . res -- line 601 ---------------------------------------- -- line 603 ---------------------------------------- . } . Ok(Ok(None)) => Ok(EvaluatedToAmbig), . Ok(Err(project::InProgress)) => Ok(EvaluatedToRecur), . Err(_) => Ok(EvaluatedToErr), . } . } . . ty::PredicateKind::ClosureKind(_, closure_substs, kind) => { 775 ( 0.00%) match self.infcx.closure_kind(closure_substs) { . Some(closure_kind) => { 465 ( 0.00%) if closure_kind.extends(kind) { . Ok(EvaluatedToOk) . } else { . Ok(EvaluatedToErr) . } . } . None => Ok(EvaluatedToAmbig), . } . } -- line 621 ---------------------------------------- -- line 693 ---------------------------------------- . } . } . } . } . ty::PredicateKind::TypeWellFormedFromEnv(..) => { . bug!("TypeWellFormedFromEnv is only used for chalk") . } . } 13,157 ( 0.00%) }); . . debug!("finished: {:?} from {:?}", result, obligation); . . result . } . 259,875 ( 0.00%) #[instrument(skip(self, previous_stack), level = "debug")] . fn evaluate_trait_predicate_recursively<'o>( . &mut self, . previous_stack: TraitObligationStackList<'o, 'tcx>, . mut obligation: TraitObligation<'tcx>, . ) -> Result { 24,750 ( 0.00%) if !self.intercrate . && obligation.is_global() . && obligation.param_env.caller_bounds().iter().all(|bound| bound.needs_subst()) . { . // If a param env has no global bounds, global obligations do not . // depend on its particular value in order to work, so we can clear . // out the param env and get better caching. . debug!("in global"); 4,810 ( 0.00%) obligation.param_env = obligation.param_env.without_caller_bounds(); . } . . let stack = self.push_stack(previous_stack, &obligation); . let mut fresh_trait_pred = stack.fresh_trait_pred; 24,750 ( 0.00%) let mut param_env = obligation.param_env; . . fresh_trait_pred = fresh_trait_pred.map_bound(|mut pred| { 12,375 ( 0.00%) pred.remap_constness(self.tcx(), &mut param_env); 148,500 ( 0.00%) pred . }); . . debug!(?fresh_trait_pred); . 19,532 ( 0.00%) if let Some(result) = self.check_evaluation_cache(param_env, fresh_trait_pred) { . debug!(?result, "CACHE HIT"); . return Ok(result); . } . . if let Some(result) = stack.cache().get_provisional(fresh_trait_pred) { . debug!(?result, "PROVISIONAL CACHE HIT"); . stack.update_reached_depth(result.reached_depth); . return Ok(result.result); -- line 744 ---------------------------------------- -- line 748 ---------------------------------------- . // stack. If so, we don't want to insert the result into the . // main cache (it is cycle dependent) nor the provisional . // cache (which is meant for things that have completed but . // for a "backedge" -- this result *is* the backedge). . if let Some(cycle_result) = self.check_evaluation_cycle(&stack) { . return Ok(cycle_result); . } . 74,367 ( 0.00%) let (result, dep_node) = self.in_task(|this| this.evaluate_stack(&stack)); 8,263 ( 0.00%) let result = result?; . 41,315 ( 0.00%) if !result.must_apply_modulo_regions() { . stack.cache().on_failure(stack.dfn); . } . 8,263 ( 0.00%) let reached_depth = stack.reached_depth.get(); 16,526 ( 0.00%) if reached_depth >= stack.depth { . debug!(?result, "CACHE MISS"); 156,085 ( 0.00%) self.insert_evaluation_cache(param_env, fresh_trait_pred, dep_node, result); . . stack.cache().on_completion( 16,430 ( 0.00%) stack.dfn, . |fresh_trait_pred, provisional_result, provisional_dep_node| { . // Create a new `DepNode` that has dependencies on: . // * The `DepNode` for the original evaluation that resulted in a provisional cache . // entry being crated . // * The `DepNode` for the *current* evaluation, which resulted in us completing . // provisional caches entries and inserting them into the evaluation cache . // . // This ensures that when a query reads this entry from the evaluation cache, -- line 777 ---------------------------------------- -- line 782 ---------------------------------------- . // cache entry to end up with a transitive `type_of(field_def_id`)` dependency. . // . // By using `in_task`, we're also creating an edge from the *current* query . // to the newly-created `combined_dep_node`. This is probably redundant, . // but it's better to add too many dep graph edges than to add too few . // dep graph edges. . let ((), combined_dep_node) = self.in_task(|this| { . this.tcx().dep_graph.read_index(provisional_dep_node); 96 ( 0.00%) this.tcx().dep_graph.read_index(dep_node); . }); 144 ( 0.00%) self.insert_evaluation_cache( 48 ( 0.00%) param_env, 384 ( 0.00%) fresh_trait_pred, . combined_dep_node, . provisional_result.max(result), . ); . }, . ); . } else { . debug!(?result, "PROVISIONAL"); . debug!( -- line 802 ---------------------------------------- -- line 835 ---------------------------------------- . /// `self.freshener`, we can be sure that (a) this will not . /// affect the inferencer state and (b) that if we see two . /// fresh regions with the same index, they refer to the same . /// unbound type variable. . fn check_evaluation_cycle( . &mut self, . stack: &TraitObligationStack<'_, 'tcx>, . ) -> Option { 1,496 ( 0.00%) if let Some(cycle_depth) = stack . .iter() . .skip(1) // Skip top-most frame. . .find(|prev| { 19,994 ( 0.00%) stack.obligation.param_env == prev.obligation.param_env . && stack.fresh_trait_pred == prev.fresh_trait_pred . }) . .map(|stack| stack.depth) . { . debug!("evaluate_stack --> recursive at depth {}", cycle_depth); . . // If we have a stack like `A B C D E A`, where the top of . // the stack is the final `A`, then this will iterate over . // `A, E, D, C, B` -- i.e., all the participants apart . // from the cycle head. We mark them as participating in a . // cycle. This suppresses caching for those nodes. See . // `in_cycle` field for more details. 1,496 ( 0.00%) stack.update_reached_depth(cycle_depth); . . // Subtle: when checking for a coinductive cycle, we do . // not compare using the "freshened trait refs" (which . // have erased regions) but rather the fully explicit . // trait refs. This is important because it's only a cycle . // if the regions match exactly. 1,502 ( 0.00%) let cycle = stack.iter().skip(1).take_while(|s| s.depth >= cycle_depth); 748 ( 0.00%) let tcx = self.tcx(); 5,572 ( 0.00%) let cycle = cycle.map(|stack| stack.obligation.predicate.to_predicate(tcx)); 8,228 ( 0.00%) if self.coinductive_match(cycle) { . debug!("evaluate_stack --> recursive, coinductive"); . Some(EvaluatedToOk) . } else { . debug!("evaluate_stack --> recursive, inductive"); . Some(EvaluatedToRecur) . } . } else { . None . } . } . 74,367 ( 0.00%) fn evaluate_stack<'o>( . &mut self, . stack: &TraitObligationStack<'o, 'tcx>, . ) -> Result { . // In intercrate mode, whenever any of the generics are unbound, . // there can always be an impl. Even if there are no impls in . // this crate, perhaps the type would be unified with . // something from another crate that does provide an impl. . // -- line 890 ---------------------------------------- -- line 903 ---------------------------------------- . // imagine, this is just where we started. To avoid that, we . // check for unbound variables and return an ambiguous (hence possible) . // match if we've seen this trait before. . // . // This suffices to allow chains like `FnMut` implemented in . // terms of `Fn` etc, but we could probably make this more . // precise still. . let unbound_input_types = 8,263 ( 0.00%) stack.fresh_trait_pred.skip_binder().trait_ref.substs.types().any(|ty| ty.is_fresh()); . 24,789 ( 0.00%) if stack.obligation.polarity() != ty::ImplPolarity::Negative { . // This check was an imperfect workaround for a bug in the old . // intercrate mode; it should be removed when that goes away. 41,315 ( 0.00%) if unbound_input_types && self.intercrate { . debug!("evaluate_stack --> unbound argument, intercrate --> ambiguous",); . // Heuristics: show the diagnostics when there are no candidates in crate. 2 ( 0.00%) if self.intercrate_ambiguity_causes.is_some() { . debug!("evaluate_stack: intercrate_ambiguity_causes is some"); . if let Ok(candidate_set) = self.assemble_candidates(stack) { . if !candidate_set.ambiguous && candidate_set.vec.is_empty() { . let trait_ref = stack.obligation.predicate.skip_binder().trait_ref; . let self_ty = trait_ref.self_ty(); . let cause = with_no_trimmed_paths(|| { . IntercrateAmbiguityCause::DownstreamCrate { . trait_desc: trait_ref.print_only_trait_path().to_string(), -- line 927 ---------------------------------------- -- line 937 ---------------------------------------- . self.intercrate_ambiguity_causes.as_mut().unwrap().push(cause); . } . } . } . return Ok(EvaluatedToAmbig); . } . } . 16,522 ( 0.00%) if unbound_input_types . && stack.iter().skip(1).any(|prev| { 5,718 ( 0.00%) stack.obligation.param_env == prev.obligation.param_env . && self.match_fresh_trait_refs( 7,624 ( 0.00%) stack.fresh_trait_pred, 7,624 ( 0.00%) prev.fresh_trait_pred, . prev.obligation.param_env, . ) . }) . { . debug!("evaluate_stack --> unbound argument, recursive --> giving up",); . return Ok(EvaluatedToUnknown); . } . 80,632 ( 0.00%) match self.candidate_from_obligation(stack) { 35,376 ( 0.00%) Ok(Some(c)) => self.evaluate_candidate(stack, &c), . Err(SelectionError::Ambiguous(_)) => Ok(EvaluatedToAmbig), . Ok(None) => Ok(EvaluatedToAmbig), . Err(Overflow) => Err(OverflowError::Canonical), . Err(ErrorReporting) => Err(OverflowError::ErrorReporting), . Err(..) => Ok(EvaluatedToErr), . } 82,630 ( 0.00%) } . . /// For defaulted traits, we use a co-inductive strategy to solve, so . /// that recursion is ok. This routine returns `true` if the top of the . /// stack (`cycle[0]`): . /// . /// - is a defaulted trait, . /// - it also appears in the backtrace at some position `X`, . /// - all the predicates at positions `X..` between `X` and the top are -- line 975 ---------------------------------------- -- line 977 ---------------------------------------- . pub fn coinductive_match(&mut self, mut cycle: I) -> bool . where . I: Iterator>, . { . cycle.all(|predicate| self.coinductive_predicate(predicate)) . } . . fn coinductive_predicate(&self, predicate: ty::Predicate<'tcx>) -> bool { 1,670 ( 0.00%) let result = match predicate.kind().skip_binder() { 7,515 ( 0.00%) ty::PredicateKind::Trait(ref data) => self.tcx().trait_is_auto(data.def_id()), . _ => false, . }; . debug!(?predicate, ?result, "coinductive_predicate"); . result . } . . /// Further evaluates `candidate` to decide whether all type parameters match and whether nested . /// obligations are met. Returns whether `candidate` remains viable after this further -- line 994 ---------------------------------------- -- line 998 ---------------------------------------- . skip(self, stack), . fields(depth = stack.obligation.recursion_depth) . )] . fn evaluate_candidate<'o>( . &mut self, . stack: &TraitObligationStack<'o, 'tcx>, . candidate: &SelectionCandidate<'tcx>, . ) -> Result { 17,190 ( 0.00%) let mut result = self.evaluation_probe(|this| { . let candidate = (*candidate).clone(); 140,435 ( 0.00%) match this.confirm_candidate(stack.obligation, candidate) { . Ok(selection) => { . debug!(?selection); 34,380 ( 0.00%) this.evaluate_predicates_recursively( . stack.list(), 111,735 ( 0.00%) selection.nested_obligations().into_iter(), . ) . } . Err(..) => Ok(EvaluatedToErr), . } . })?; . . // If we erased any lifetimes, then we want to use . // `EvaluatedToOkModuloRegions` instead of `EvaluatedToOk` -- line 1021 ---------------------------------------- -- line 1037 ---------------------------------------- . &self, . param_env: ty::ParamEnv<'tcx>, . trait_pred: ty::PolyTraitPredicate<'tcx>, . ) -> Option { . // Neither the global nor local cache is aware of intercrate . // mode, so don't do any caching. In particular, we might . // re-use the same `InferCtxt` with both an intercrate . // and non-intercrate `SelectionContext` 24,750 ( 0.00%) if self.intercrate { . return None; . } . . let tcx = self.tcx(); . if self.can_use_global_caches(param_env) { 55,286 ( 0.00%) if let Some(res) = tcx.evaluation_cache.get(¶m_env.and(trait_pred), tcx) { . return Some(res); . } . } 39,064 ( 0.00%) self.infcx.evaluation_cache.get(¶m_env.and(trait_pred), tcx) . } . 99,156 ( 0.00%) fn insert_evaluation_cache( . &mut self, . param_env: ty::ParamEnv<'tcx>, . trait_pred: ty::PolyTraitPredicate<'tcx>, . dep_node: DepNodeIndex, . result: EvaluationResult, . ) { . // Avoid caching results that depend on more than just the trait-ref . // - the stack can create recursion. 33,052 ( 0.00%) if result.is_stack_dependent() { . return; . } . . // Neither the global nor local cache is aware of intercrate . // mode, so don't do any caching. In particular, we might . // re-use the same `InferCtxt` with both an intercrate . // and non-intercrate `SelectionContext` 16,526 ( 0.00%) if self.intercrate { . return; . } . . if self.can_use_global_caches(param_env) { . if !trait_pred.needs_infer() { . debug!(?trait_pred, ?result, "insert_evaluation_cache global"); . // This may overwrite the cache with the same value . // FIXME: Due to #50507 this overwrites the different values . // This should be changed to use HashMapExt::insert_same . // when that is fixed 5,356 ( 0.00%) self.tcx().evaluation_cache.insert(param_env.and(trait_pred), dep_node, result); . return; . } . } . . debug!(?trait_pred, ?result, "insert_evaluation_cache"); 11,348 ( 0.00%) self.infcx.evaluation_cache.insert(param_env.and(trait_pred), dep_node, result); 66,104 ( 0.00%) } . . /// For various reasons, it's possible for a subobligation . /// to have a *lower* recursion_depth than the obligation used to create it. . /// Projection sub-obligations may be returned from the projection cache, . /// which results in obligations with an 'old' `recursion_depth`. . /// Additionally, methods like `InferCtxt.subtype_predicate` produce . /// subobligations without taking in a 'parent' depth, causing the . /// generated subobligations to have a `recursion_depth` of `0`. . /// . /// To ensure that obligation_depth never decreases, we force all subobligations . /// to have at least the depth of the original obligation. 168 ( 0.00%) fn add_depth>>( . &self, . it: I, . min_depth: usize, . ) { 1,152 ( 0.00%) it.for_each(|o| o.recursion_depth = cmp::max(min_depth, o.recursion_depth) + 1); 336 ( 0.00%) } . . fn check_recursion_depth>( . &self, . depth: usize, . error_obligation: &Obligation<'tcx, T>, . ) -> Result<(), OverflowError> { 985,880 ( 0.01%) if !self.infcx.tcx.recursion_limit().value_within_limit(depth) { . match self.query_mode { . TraitQueryMode::Standard => { . if self.infcx.is_tainted_by_errors() { . return Err(OverflowError::ErrorReporting); . } . self.infcx.report_overflow_error(error_obligation, true); . } . TraitQueryMode::Canonical => { -- line 1126 ---------------------------------------- -- line 1143 ---------------------------------------- . ) -> Result<(), OverflowError> { . self.check_recursion_depth(obligation.recursion_depth, error_obligation) . } . . fn in_task(&mut self, op: OP) -> (R, DepNodeIndex) . where . OP: FnOnce(&mut Self) -> R, . { 208,975 ( 0.00%) let (result, dep_node) = 162,986 ( 0.00%) self.tcx().dep_graph.with_anon_task(self.tcx(), DepKind::TraitSelect, || op(self)); . self.tcx().dep_graph.read_index(dep_node); 192,900 ( 0.00%) (result, dep_node) . } . . /// filter_impls filters constant trait obligations and candidates that have a positive impl . /// for a negative goal and a negative impl for a positive goal . #[instrument(level = "debug", skip(self))] . fn filter_impls( . &mut self, . candidates: Vec>, . obligation: &TraitObligation<'tcx>, . ) -> Vec> { . let tcx = self.tcx(); . let mut result = Vec::with_capacity(candidates.len()); . 233,700 ( 0.00%) for candidate in candidates { . // Respect const trait obligations 42,975 ( 0.00%) if obligation.is_const() { . match candidate { . // const impl . ImplCandidate(def_id) . if tcx.impl_constness(def_id) == hir::Constness::Const => {} . // const param . ParamCandidate(trait_pred) . if trait_pred.skip_binder().constness . == ty::BoundConstness::ConstIfConst => {} -- line 1178 ---------------------------------------- -- line 1186 ---------------------------------------- . ConstDropCandidate(_) => {} . _ => { . // reject all other types of candidates . continue; . } . } . } . 28,650 ( 0.00%) if let ImplCandidate(def_id) = candidate { 11,928 ( 0.00%) if ty::ImplPolarity::Reservation == tcx.impl_polarity(def_id) 5,964 ( 0.00%) || obligation.polarity() == tcx.impl_polarity(def_id) . || self.allow_negative_impls . { . result.push(candidate); . } . } else { . result.push(candidate); . } . } . 60,900 ( 0.00%) result . } . . /// filter_reservation_impls filter reservation impl for any goal as ambiguous 209,576 ( 0.00%) #[instrument(level = "debug", skip(self))] . fn filter_reservation_impls( . &mut self, . candidate: SelectionCandidate<'tcx>, . obligation: &TraitObligation<'tcx>, . ) -> SelectionResult<'tcx, SelectionCandidate<'tcx>> { . let tcx = self.tcx(); . // Treat reservation impls as ambiguity. 33,456 ( 0.00%) if let ImplCandidate(def_id) = candidate { 8,800 ( 0.00%) if let ty::ImplPolarity::Reservation = tcx.impl_polarity(def_id) { . if let Some(intercrate_ambiguity_clauses) = &mut self.intercrate_ambiguity_causes { . let attrs = tcx.get_attrs(def_id); . let attr = tcx.sess.find_by_name(&attrs, sym::rustc_reservation_impl); . let value = attr.and_then(|a| a.value_str()); . if let Some(value) = value { . debug!( . "filter_reservation_impls: \ . reservation impl ambiguity on {:?}", -- line 1227 ---------------------------------------- -- line 1232 ---------------------------------------- . message: value.to_string(), . }, . ); . } . } . return Ok(None); . } . } 73,968 ( 0.00%) Ok(Some(candidate)) . } . . fn is_knowable<'o>(&mut self, stack: &TraitObligationStack<'o, 'tcx>) -> Option { . debug!("is_knowable(intercrate={:?})", self.intercrate); . 48,429 ( 0.00%) if !self.intercrate || stack.obligation.polarity() == ty::ImplPolarity::Negative { . return None; . } . . let obligation = &stack.obligation; 204 ( 0.00%) let predicate = self.infcx().resolve_vars_if_possible(obligation.predicate); . . // Okay to skip binder because of the nature of the . // trait-ref-is-knowable check, which does not care about . // bound regions. . let trait_ref = predicate.skip_binder().trait_ref; . 204 ( 0.00%) coherence::trait_ref_is_knowable(self.tcx(), trait_ref) . } . . /// Returns `true` if the global caches can be used. . fn can_use_global_caches(&self, param_env: ty::ParamEnv<'tcx>) -> bool { . // If there are any inference variables in the `ParamEnv`, then we . // always use a cache local to this particular scope. Otherwise, we . // switch to a global cache. . if param_env.needs_infer() { -- line 1266 ---------------------------------------- -- line 1286 ---------------------------------------- . &mut self, . mut param_env: ty::ParamEnv<'tcx>, . cache_fresh_trait_pred: ty::PolyTraitPredicate<'tcx>, . ) -> Option>> { . // Neither the global nor local cache is aware of intercrate . // mode, so don't do any caching. In particular, we might . // re-use the same `InferCtxt` with both an intercrate . // and non-intercrate `SelectionContext` 466,626 ( 0.01%) if self.intercrate { 68 ( 0.00%) return None; . } . let tcx = self.tcx(); . let mut pred = cache_fresh_trait_pred.skip_binder(); 466,490 ( 0.01%) pred.remap_constness(tcx, &mut param_env); . 233,245 ( 0.00%) if self.can_use_global_caches(param_env) { 2,244,710 ( 0.03%) if let Some(res) = tcx.selection_cache.get(¶m_env.and(pred), tcx) { 2,768,610 ( 0.03%) return Some(res); . } . } 214,251 ( 0.00%) self.infcx.selection_cache.get(¶m_env.and(pred), tcx) . } . . /// Determines whether can we safely cache the result . /// of selecting an obligation. This is almost always `true`, . /// except when dealing with certain `ParamCandidate`s. . /// . /// Ordinarily, a `ParamCandidate` will contain no inference variables, . /// since it was usually produced directly from a `DefId`. However, -- line 1314 ---------------------------------------- -- line 1325 ---------------------------------------- . fn can_cache_candidate( . &self, . result: &SelectionResult<'tcx, SelectionCandidate<'tcx>>, . ) -> bool { . // Neither the global nor local cache is aware of intercrate . // mode, so don't do any caching. In particular, we might . // re-use the same `InferCtxt` with both an intercrate . // and non-intercrate `SelectionContext` 32,150 ( 0.00%) if self.intercrate { . return false; . } 48,021 ( 0.00%) match result { . Ok(Some(SelectionCandidate::ParamCandidate(trait_ref))) => !trait_ref.needs_infer(), . _ => true, . } . } . . fn insert_candidate_cache( . &mut self, . mut param_env: ty::ParamEnv<'tcx>, . cache_fresh_trait_pred: ty::PolyTraitPredicate<'tcx>, . dep_node: DepNodeIndex, . candidate: SelectionResult<'tcx, SelectionCandidate<'tcx>>, . ) { . let tcx = self.tcx(); . let mut pred = cache_fresh_trait_pred.skip_binder(); . 32,150 ( 0.00%) pred.remap_constness(tcx, &mut param_env); . . if !self.can_cache_candidate(&candidate) { . debug!(?pred, ?candidate, "insert_candidate_cache - candidate is not cacheable"); . return; . } . 15,586 ( 0.00%) if self.can_use_global_caches(param_env) { 28,314 ( 0.00%) if let Err(Overflow) = candidate { . // Don't cache overflow globally; we only produce this in certain modes. . } else if !pred.needs_infer() { 46,004 ( 0.00%) if !candidate.needs_infer() { . debug!(?pred, ?candidate, "insert_candidate_cache global"); . // This may overwrite the cache with the same value. 310,527 ( 0.00%) tcx.selection_cache.insert(param_env.and(pred), dep_node, candidate); . return; . } . } . } . . debug!(?pred, ?candidate, "insert_candidate_cache local"); 93,955 ( 0.00%) self.infcx.selection_cache.insert(param_env.and(pred), dep_node, candidate); . } . . /// Matches a predicate against the bounds of its self type. . /// . /// Given an obligation like `::Bar: Baz` where the self type is . /// a projection, look at the bounds of `T::Bar`, see if we can find a . /// `Baz` bound. We return indexes into the list returned by . /// `tcx.item_bounds` for any applicable bounds. 6,147 ( 0.00%) fn match_projection_obligation_against_definition_bounds( . &mut self, . obligation: &TraitObligation<'tcx>, . ) -> smallvec::SmallVec<[usize; 2]> { 8,879 ( 0.00%) let poly_trait_predicate = self.infcx().resolve_vars_if_possible(obligation.predicate); . let placeholder_trait_predicate = 11,611 ( 0.00%) self.infcx().replace_bound_vars_with_placeholders(poly_trait_predicate); . debug!( . ?placeholder_trait_predicate, . "match_projection_obligation_against_definition_bounds" . ); . 683 ( 0.00%) let tcx = self.infcx.tcx; 4,272 ( 0.00%) let (def_id, substs) = match *placeholder_trait_predicate.trait_ref.self_ty().kind() { 1,788 ( 0.00%) ty::Projection(ref data) => (data.item_def_id, data.substs), 435 ( 0.00%) ty::Opaque(def_id, substs) => (def_id, substs), . _ => { . span_bug!( . obligation.cause.span, . "match_projection_obligation_against_definition_bounds() called \ . but self-ty is not a projection: {:?}", . placeholder_trait_predicate.trait_ref.self_ty() . ); . } -- line 1405 ---------------------------------------- -- line 1411 ---------------------------------------- . // unnecessary ambiguity. . let mut distinct_normalized_bounds = FxHashSet::default(); . . let matching_bounds = bounds . .iter() . .enumerate() . .filter_map(|(idx, bound)| { . let bound_predicate = bound.kind(); 5,895 ( 0.00%) if let ty::PredicateKind::Trait(pred) = bound_predicate.skip_binder() { . let bound = bound_predicate.rebind(pred.trait_ref); 27,585 ( 0.00%) if self.infcx.probe(|_| { 10,026 ( 0.00%) match self.match_normalize_trait_ref( . obligation, 7,356 ( 0.00%) bound, 7,356 ( 0.00%) placeholder_trait_predicate.trait_ref, . ) { . Ok(None) => true, . Ok(Some(normalized_trait)) . if distinct_normalized_bounds.insert(normalized_trait) => . { . true . } . _ => false, -- line 1433 ---------------------------------------- -- line 1437 ---------------------------------------- . } . } . None . }) . .collect(); . . debug!(?matching_bounds, "match_projection_obligation_against_definition_bounds"); . matching_bounds 6,147 ( 0.00%) } . . /// Equates the trait in `obligation` with trait bound. If the two traits . /// can be equated and the normalized trait bound doesn't contain inference . /// variables or placeholders, the normalized bound is returned. 24,193 ( 0.00%) fn match_normalize_trait_ref( . &mut self, . obligation: &TraitObligation<'tcx>, . trait_bound: ty::PolyTraitRef<'tcx>, . placeholder_trait_ref: ty::TraitRef<'tcx>, . ) -> Result>, ()> { . debug_assert!(!placeholder_trait_ref.has_escaping_bound_vars()); 6,805 ( 0.00%) if placeholder_trait_ref.def_id != trait_bound.def_id() { . // Avoid unnecessary normalization 2,500 ( 0.00%) return Err(()); . } . 7,332 ( 0.00%) let Normalized { value: trait_bound, obligations: _ } = ensure_sufficient_stack(|| { . project::normalize_with_depth( . self, 611 ( 0.00%) obligation.param_env, . obligation.cause.clone(), 1,833 ( 0.00%) obligation.recursion_depth + 1, 2,444 ( 0.00%) trait_bound, . ) . }); 1,833 ( 0.00%) self.infcx 1,222 ( 0.00%) .at(&obligation.cause, obligation.param_env) . .sup(ty::Binder::dummy(placeholder_trait_ref), trait_bound) . .map(|InferOk { obligations: _, value: () }| { . // This method is called within a probe, so we can't have . // inference variables and placeholders escape. . if !trait_bound.needs_infer() && !trait_bound.has_placeholders() { 500 ( 0.00%) Some(trait_bound) . } else { . None . } . }) . .map_err(|_| ()) 16,749 ( 0.00%) } . . fn evaluate_where_clause<'o>( . &mut self, . stack: &TraitObligationStack<'o, 'tcx>, . where_clause_trait_ref: ty::PolyTraitRef<'tcx>, . ) -> Result { . self.evaluation_probe(|this| { 198,132 ( 0.00%) match this.match_where_clause_trait_ref(stack.obligation, where_clause_trait_ref) { 19,320 ( 0.00%) Ok(obligations) => this.evaluate_predicates_recursively(stack.list(), obligations), . Err(()) => Ok(EvaluatedToErr), . } . }) . } . 142,335 ( 0.00%) pub(super) fn match_projection_projections( . &mut self, . obligation: &ProjectionTyObligation<'tcx>, . env_predicate: PolyProjectionPredicate<'tcx>, . potentially_unnormalized_candidates: bool, . ) -> bool { . let mut nested_obligations = Vec::new(); 79,075 ( 0.00%) let (infer_predicate, _) = self.infcx.replace_bound_vars_with_fresh_vars( 47,445 ( 0.00%) obligation.cause.span, . LateBoundRegionConversionTime::HigherRankedType, . env_predicate, . ); 31,630 ( 0.00%) let infer_projection = if potentially_unnormalized_candidates { 2,312 ( 0.00%) ensure_sufficient_stack(|| { 1,156 ( 0.00%) project::normalize_with_depth_to( . self, 289 ( 0.00%) obligation.param_env, . obligation.cause.clone(), 867 ( 0.00%) obligation.recursion_depth + 1, 578 ( 0.00%) infer_predicate.projection_ty, . &mut nested_obligations, . ) . }) . } else { 31,052 ( 0.00%) infer_predicate.projection_ty . }; . 15,815 ( 0.00%) self.infcx 31,630 ( 0.00%) .at(&obligation.cause, obligation.param_env) 31,630 ( 0.00%) .sup(obligation.predicate, infer_projection) 124,582 ( 0.00%) .map_or(false, |InferOk { obligations, value: () }| { . self.evaluate_predicates_recursively( . TraitObligationStackList::empty(&ProvisionalEvaluationCache::default()), . nested_obligations.into_iter().chain(obligations), . ) 30,338 ( 0.00%) .map_or(false, |res| res.may_apply()) . }) 142,335 ( 0.00%) } . . /////////////////////////////////////////////////////////////////////////// . // WINNOW . // . // Winnowing is the process of attempting to resolve ambiguity by . // probing further. During the winnowing process, we unify all . // type variables and then we also attempt to evaluate recursive . // bounds to see if they are satisfied. -- line 1544 ---------------------------------------- -- line 1550 ---------------------------------------- . /// See the comment for "SelectionCandidate" for more details. . fn candidate_should_be_dropped_in_favor_of( . &mut self, . sized_predicate: bool, . victim: &EvaluatedCandidate<'tcx>, . other: &EvaluatedCandidate<'tcx>, . needs_infer: bool, . ) -> bool { 2,298 ( 0.00%) if victim.candidate == other.candidate { . return true; . } . . // Check if a bound would previously have been removed when normalizing . // the param_env so that it can be given the lowest priority. See . // #50825 for the motivation for this. . let is_global = |cand: &ty::PolyTraitPredicate<'tcx>| { 2,135 ( 0.00%) cand.is_global() && !cand.has_late_bound_regions() . }; . . // (*) Prefer `BuiltinCandidate { has_nested: false }`, `PointeeCandidate`, . // `DiscriminantKindCandidate`, and `ConstDropCandidate` to anything else. . // . // This is a fix for #53123 and prevents winnowing from accidentally extending the . // lifetime of a variable. 47,446 ( 0.00%) match (&other.candidate, &victim.candidate) { . (_, AutoImplCandidate(..)) | (AutoImplCandidate(..), _) => { . bug!( . "default implementations shouldn't be recorded \ . when there are other valid candidates" . ); . } . . // (*) -- line 1582 ---------------------------------------- -- line 1621 ---------------------------------------- . . // Drop otherwise equivalent non-const fn pointer candidates . (FnPointerCandidate { .. }, FnPointerCandidate { is_const: false }) => true, . . // If obligation is a sized predicate or the where-clause bound is . // global, prefer the projection or object candidate. See issue . // #50825 and #89352. . (ObjectCandidate(_) | ProjectionCandidate(_), ParamCandidate(ref cand)) => { 12 ( 0.00%) sized_predicate || is_global(cand) . } 854 ( 0.00%) (ParamCandidate(ref cand), ObjectCandidate(_) | ProjectionCandidate(_)) => { 866 ( 0.00%) !(sized_predicate || is_global(cand)) . } . . // Global bounds from the where clause should be ignored . // here (see issue #50825). Otherwise, we have a where . // clause so don't go around looking for impls. . // Arbitrarily give param candidates priority . // over projection and object candidates. . ( 504 ( 0.00%) ParamCandidate(ref cand), . ImplCandidate(..) . | ClosureCandidate . | GeneratorCandidate . | FnPointerCandidate { .. } . | BuiltinObjectCandidate . | BuiltinUnsizeCandidate . | TraitUpcastingUnsizeCandidate(_) . | BuiltinCandidate { .. } -- line 1649 ---------------------------------------- -- line 1674 ---------------------------------------- . } . (ObjectCandidate(_), ProjectionCandidate(_)) . | (ProjectionCandidate(_), ObjectCandidate(_)) => { . bug!("Have both object and projection candidate") . } . . // Arbitrarily give projection and object candidates priority. . ( 4,596 ( 0.00%) ObjectCandidate(_) | ProjectionCandidate(_), . ImplCandidate(..) . | ClosureCandidate . | GeneratorCandidate . | FnPointerCandidate { .. } . | BuiltinObjectCandidate . | BuiltinUnsizeCandidate . | TraitUpcastingUnsizeCandidate(_) . | BuiltinCandidate { .. } -- line 1690 ---------------------------------------- -- line 1696 ---------------------------------------- . | ClosureCandidate . | GeneratorCandidate . | FnPointerCandidate { .. } . | BuiltinObjectCandidate . | BuiltinUnsizeCandidate . | TraitUpcastingUnsizeCandidate(_) . | BuiltinCandidate { .. } . | TraitAliasCandidate(..), 9,192 ( 0.00%) ObjectCandidate(_) | ProjectionCandidate(_), . ) => false, . 22,980 ( 0.00%) (&ImplCandidate(other_def), &ImplCandidate(victim_def)) => { . // See if we can toss out `victim` based on specialization. . // This requires us to know *for sure* that the `other` impl applies . // i.e., `EvaluatedToOk`. . // . // FIXME(@lcnr): Using `modulo_regions` here seems kind of scary . // to me but is required for `std` to compile, so I didn't change it . // for now. . let tcx = self.tcx(); 9,192 ( 0.00%) if other.evaluation.must_apply_modulo_regions() { 18,040 ( 0.00%) if tcx.specializes((other_def, victim_def)) { . return true; . } . } . 11,470 ( 0.00%) if other.evaluation.must_apply_considering_regions() { 8,888 ( 0.00%) match tcx.impls_are_allowed_to_overlap(other_def, victim_def) { . Some(ty::ImplOverlapKind::Permitted { marker: true }) => { . // Subtle: If the predicate we are evaluating has inference . // variables, do *not* allow discarding candidates due to . // marker trait impls. . // . // Without this restriction, we could end up accidentally . // constrainting inference variables based on an arbitrarily . // chosen trait impl. -- line 1731 ---------------------------------------- -- line 1790 ---------------------------------------- . | BuiltinUnsizeCandidate . | TraitUpcastingUnsizeCandidate(_) . | BuiltinCandidate { has_nested: true } . | TraitAliasCandidate(..), . ) => false, . } . } . 47,780 ( 0.00%) fn sized_conditions( . &mut self, . obligation: &TraitObligation<'tcx>, . ) -> BuiltinImplConditions<'tcx> { . use self::BuiltinImplConditions::{Ambiguous, None, Where}; . . // NOTE: binder moved to (*) 14,334 ( 0.00%) let self_ty = self.infcx.shallow_resolve(obligation.predicate.skip_binder().self_ty()); . 23,998 ( 0.00%) match self_ty.kind() { . ty::Infer(ty::IntVar(_) | ty::FloatVar(_)) . | ty::Uint(_) . | ty::Int(_) . | ty::Bool . | ty::Float(_) . | ty::FnDef(..) . | ty::FnPtr(_) . | ty::RawPtr(..) -- line 1815 ---------------------------------------- -- line 1817 ---------------------------------------- . | ty::Ref(..) . | ty::Generator(..) . | ty::GeneratorWitness(..) . | ty::Array(..) . | ty::Closure(..) . | ty::Never . | ty::Error(_) => { . // safe for everything 1,519 ( 0.00%) Where(ty::Binder::dummy(Vec::new())) . } . . ty::Str | ty::Slice(_) | ty::Dynamic(..) | ty::Foreign(..) => None, . . ty::Tuple(tys) => Where( . obligation . .predicate 1,517 ( 0.00%) .rebind(tys.last().into_iter().map(|k| k.expect_ty()).collect()), . ), . . ty::Adt(def, substs) => { 3,198 ( 0.00%) let sized_crit = def.sized_constraint(self.tcx()); . // (*) binder moved here 7,995 ( 0.00%) Where( . obligation.predicate.rebind({ 1,599 ( 0.00%) sized_crit.iter().map(|ty| ty.subst(self.tcx(), substs)).collect() . }), . ) . } . . ty::Projection(_) | ty::Param(_) | ty::Opaque(..) => None, . ty::Infer(ty::TyVar(_)) => Ambiguous, . . ty::Placeholder(..) . | ty::Bound(..) . | ty::Infer(ty::FreshTy(_) | ty::FreshIntTy(_) | ty::FreshFloatTy(_)) => { . bug!("asked to assemble builtin bounds of unexpected type: {:?}", self_ty); . } . } 38,224 ( 0.00%) } . 16,552 ( 0.00%) fn copy_clone_conditions( . &mut self, . obligation: &TraitObligation<'tcx>, . ) -> BuiltinImplConditions<'tcx> { . // NOTE: binder moved to (*) 4,138 ( 0.00%) let self_ty = self.infcx.shallow_resolve(obligation.predicate.skip_binder().self_ty()); . . use self::BuiltinImplConditions::{Ambiguous, None, Where}; . 10,655 ( 0.00%) match *self_ty.kind() { . ty::Infer(ty::IntVar(_)) . | ty::Infer(ty::FloatVar(_)) . | ty::FnDef(..) . | ty::FnPtr(_) 250 ( 0.00%) | ty::Error(_) => Where(ty::Binder::dummy(Vec::new())), . . ty::Uint(_) . | ty::Int(_) . | ty::Bool . | ty::Float(_) . | ty::Char . | ty::RawPtr(..) . | ty::Never -- line 1879 ---------------------------------------- -- line 1886 ---------------------------------------- . ty::Dynamic(..) . | ty::Str . | ty::Slice(..) . | ty::Generator(..) . | ty::GeneratorWitness(..) . | ty::Foreign(..) . | ty::Ref(_, _, hir::Mutability::Mut) => None, . 58 ( 0.00%) ty::Tuple(tys) => { . // (*) binder moved here 619 ( 0.00%) Where(obligation.predicate.rebind(tys.iter().map(|k| k.expect_ty()).collect())) . } . 101 ( 0.00%) ty::Closure(_, substs) => { . // (*) binder moved here 303 ( 0.00%) let ty = self.infcx.shallow_resolve(substs.as_closure().tupled_upvars_ty()); 206 ( 0.00%) if let ty::Infer(ty::TyVar(_)) = ty.kind() { . // Not yet resolved. . Ambiguous . } else { 693 ( 0.00%) Where(obligation.predicate.rebind(substs.as_closure().upvar_tys().collect())) . } . } . . ty::Adt(..) | ty::Projection(..) | ty::Param(..) | ty::Opaque(..) => { . // Fallback to whatever user-defined impls exist in this case. . None . } . -- line 1914 ---------------------------------------- -- line 1920 ---------------------------------------- . } . . ty::Placeholder(..) . | ty::Bound(..) . | ty::Infer(ty::FreshTy(_) | ty::FreshIntTy(_) | ty::FreshFloatTy(_)) => { . bug!("asked to assemble builtin bounds of unexpected type: {:?}", self_ty); . } . } 12,414 ( 0.00%) } . . /// For default impls, we need to break apart a type into its . /// "constituent types" -- meaning, the types that it contains. . /// . /// Here are some (simple) examples: . /// . /// ``` . /// (i32, u32) -> [i32, u32] -- line 1936 ---------------------------------------- -- line 1937 ---------------------------------------- . /// Foo where struct Foo { x: i32, y: u32 } -> [i32, u32] . /// Bar where struct Bar { x: T, y: u32 } -> [i32, u32] . /// Zed where enum Zed { A(T), B(u32) } -> [i32, u32] . /// ``` . fn constituent_types_for_ty( . &self, . t: ty::Binder<'tcx, Ty<'tcx>>, . ) -> ty::Binder<'tcx, Vec>> { 4,110 ( 0.00%) match *t.skip_binder().kind() { . ty::Uint(_) . | ty::Int(_) . | ty::Bool . | ty::Float(_) . | ty::FnDef(..) . | ty::FnPtr(_) . | ty::Str . | ty::Error(_) -- line 1953 ---------------------------------------- -- line 1960 ---------------------------------------- . | ty::Param(..) . | ty::Foreign(..) . | ty::Projection(..) . | ty::Bound(..) . | ty::Infer(ty::TyVar(_) | ty::FreshTy(_) | ty::FreshIntTy(_) | ty::FreshFloatTy(_)) => { . bug!("asked to assemble constituent types of unexpected type: {:?}", t); . } . 46 ( 0.00%) ty::RawPtr(ty::TypeAndMut { ty: element_ty, .. }) | ty::Ref(_, element_ty, _) => { . t.rebind(vec![element_ty]) . } . . ty::Array(element_ty, _) | ty::Slice(element_ty) => t.rebind(vec![element_ty]), . . ty::Tuple(ref tys) => { . // (T1, ..., Tn) -- meets any bound that all of T1...Tn meet 129 ( 0.00%) t.rebind(tys.iter().map(|k| k.expect_ty()).collect()) . } . . ty::Closure(_, ref substs) => { . let ty = self.infcx.shallow_resolve(substs.as_closure().tupled_upvars_ty()); . t.rebind(vec![ty]) . } . . ty::Generator(_, ref substs, _) => { -- line 1984 ---------------------------------------- -- line 1988 ---------------------------------------- . } . . ty::GeneratorWitness(types) => { . debug_assert!(!types.has_escaping_bound_vars()); . types.map_bound(|types| types.to_vec()) . } . . // For `PhantomData`, we pass `T`. 1,120 ( 0.00%) ty::Adt(def, substs) if def.is_phantom_data() => t.rebind(substs.types().collect()), . 530 ( 0.00%) ty::Adt(def, substs) => { 2,052 ( 0.00%) t.rebind(def.all_fields().map(|f| f.ty(self.tcx(), substs)).collect()) . } . . ty::Opaque(def_id, substs) => { . // We can resolve the `impl Trait` to its concrete type, . // which enforces a DAG between the functions requiring . // the auto trait bounds in question. . t.rebind(vec![self.tcx().type_of(def_id).subst(self.tcx(), substs)]) . } . } . } . 17,952 ( 0.00%) fn collect_predicates_for_types( . &mut self, . param_env: ty::ParamEnv<'tcx>, . cause: ObligationCause<'tcx>, . recursion_depth: usize, . trait_def_id: DefId, . types: ty::Binder<'tcx, Vec>>, . ) -> Vec> { . // Because the types were potentially derived from -- line 2019 ---------------------------------------- -- line 2030 ---------------------------------------- . // 2. Produce something like `&'0 i32 : Copy` . // 3. Re-bind the regions back to `for<'a> &'a i32 : Copy` . . types . .as_ref() . .skip_binder() // binder moved -\ . .iter() . .flat_map(|ty| { 6,441 ( 0.00%) let ty: ty::Binder<'tcx, Ty<'tcx>> = types.rebind(ty); // <----/ . 25,764 ( 0.00%) self.infcx.commit_unconditionally(|_| { 6,441 ( 0.00%) let placeholder_ty = self.infcx.replace_bound_vars_with_placeholders(ty); 10,735 ( 0.00%) let Normalized { value: normalized_ty, mut obligations } = 21,470 ( 0.00%) ensure_sufficient_stack(|| { . project::normalize_with_depth( . self, 2,147 ( 0.00%) param_env, . cause.clone(), 2,147 ( 0.00%) recursion_depth, 2,147 ( 0.00%) placeholder_ty, . ) . }); 23,617 ( 0.00%) let placeholder_obligation = predicate_for_trait_def( . self.tcx(), 2,147 ( 0.00%) param_env, . cause.clone(), 4,294 ( 0.00%) trait_def_id, . recursion_depth, . normalized_ty, . &[], . ); 12,882 ( 0.00%) obligations.push(placeholder_obligation); . obligations . }) . }) . .collect() 8,976 ( 0.00%) } . . /////////////////////////////////////////////////////////////////////////// . // Matching . // . // Matching is a common path used for both evaluation and . // confirmation. It basically unifies types that appear in impls . // and traits. This does affect the surrounding environment; . // therefore, when used during evaluation, match routines must be -- line 2074 ---------------------------------------- -- line 2075 ---------------------------------------- . // run inside of a `probe()` so that their side-effects are . // contained. . . fn rematch_impl( . &mut self, . impl_def_id: DefId, . obligation: &TraitObligation<'tcx>, . ) -> Normalized<'tcx, SubstsRef<'tcx>> { 198,330 ( 0.00%) match self.match_impl(impl_def_id, obligation) { 158,664 ( 0.00%) Ok(substs) => substs, . Err(()) => { . bug!( . "Impl {:?} was matchable against {:?} but now is not", . impl_def_id, . obligation . ); . } . } . } . 1,104,223 ( 0.01%) #[tracing::instrument(level = "debug", skip(self))] . fn match_impl( . &mut self, . impl_def_id: DefId, . obligation: &TraitObligation<'tcx>, . ) -> Result>, ()> { . let impl_trait_ref = self.tcx().impl_trait_ref(impl_def_id).unwrap(); . . // Before we create the substitutions and everything, first . // consider a "quick reject". This avoids creating more types . // and so forth that we need to. . if self.fast_reject_trait_refs(obligation, &impl_trait_ref) { 3,974 ( 0.00%) return Err(()); . } . . let placeholder_obligation = 392,910 ( 0.00%) self.infcx().replace_bound_vars_with_placeholders(obligation.predicate); 168,390 ( 0.00%) let placeholder_obligation_trait_ref = placeholder_obligation.trait_ref; . 280,650 ( 0.00%) let impl_substs = self.infcx.fresh_substs_for_item(obligation.cause.span, impl_def_id); . 112,260 ( 0.00%) let impl_trait_ref = impl_trait_ref.subst(self.tcx(), impl_substs); . . debug!(?impl_trait_ref); . 336,780 ( 0.00%) let Normalized { value: impl_trait_ref, obligations: mut nested_obligations } = 392,910 ( 0.00%) ensure_sufficient_stack(|| { . project::normalize_with_depth( . self, 56,130 ( 0.00%) obligation.param_env, . obligation.cause.clone(), 168,390 ( 0.00%) obligation.recursion_depth + 1, 112,260 ( 0.00%) impl_trait_ref, . ) . }); . . debug!(?impl_trait_ref, ?placeholder_obligation_trait_ref); . . let cause = ObligationCause::new( 56,130 ( 0.00%) obligation.cause.span, 112,260 ( 0.00%) obligation.cause.body_id, 505,170 ( 0.01%) ObligationCauseCode::MatchImpl(obligation.cause.clone(), impl_def_id), . ); . 112,260 ( 0.00%) let InferOk { obligations, .. } = self . .infcx 56,130 ( 0.00%) .at(&cause, obligation.param_env) . .eq(placeholder_obligation_trait_ref, impl_trait_ref) . .map_err(|e| debug!("match_impl: failed eq_trait_refs due to `{}`", e))?; . nested_obligations.extend(obligations); . 137,004 ( 0.00%) if !self.intercrate . && self.tcx().impl_polarity(impl_def_id) == ty::ImplPolarity::Reservation . { . debug!("match_impl: reservation impls only apply in intercrate mode"); . return Err(()); . } . . debug!(?impl_substs, ?nested_obligations, "match_impl: success"); 273,780 ( 0.00%) Ok(Normalized { value: impl_substs, obligations: nested_obligations }) . } . . fn fast_reject_trait_refs( . &mut self, . obligation: &TraitObligation<'_>, . impl_trait_ref: &ty::TraitRef<'_>, . ) -> bool { . // We can avoid creating type variables and doing the full . // substitution if we find that any of the input types, when . // simplified, do not match. . 174,351 ( 0.00%) iter::zip(obligation.predicate.skip_binder().trait_ref.substs, impl_trait_ref.substs).any( . |(obligation_arg, impl_arg)| { 607,894 ( 0.01%) match (obligation_arg.unpack(), impl_arg.unpack()) { . (GenericArgKind::Type(obligation_ty), GenericArgKind::Type(impl_ty)) => { . // Note, we simplify parameters for the obligation but not the . // impl so that we do not reject a blanket impl but do reject . // more concrete impls if we're searching for `T: Trait`. 809,752 ( 0.01%) let simplified_obligation_ty = fast_reject::simplify_type( . self.tcx(), . obligation_ty, . SimplifyParams::Yes, . StripReferences::No, . ); 607,314 ( 0.01%) let simplified_impl_ty = fast_reject::simplify_type( . self.tcx(), . impl_ty, . SimplifyParams::No, . StripReferences::No, . ); . 303,657 ( 0.00%) simplified_obligation_ty.is_some() . && simplified_impl_ty.is_some() . && simplified_obligation_ty != simplified_impl_ty . } . (GenericArgKind::Lifetime(_), GenericArgKind::Lifetime(_)) => { . // Lifetimes can never cause a rejection. . false . } . (GenericArgKind::Const(_), GenericArgKind::Const(_)) => { -- line 2194 ---------------------------------------- -- line 2201 ---------------------------------------- . } . }, . ) . } . . /// Normalize `where_clause_trait_ref` and try to match it against . /// `obligation`. If successful, return any predicates that . /// result from the normalization. 162,108 ( 0.00%) fn match_where_clause_trait_ref( . &mut self, . obligation: &TraitObligation<'tcx>, . where_clause_trait_ref: ty::PolyTraitRef<'tcx>, . ) -> Result>, ()> { . self.match_poly_trait_ref(obligation, where_clause_trait_ref) 144,096 ( 0.00%) } . . /// Returns `Ok` if `poly_trait_ref` being true implies that the . /// obligation is satisfied. . #[instrument(skip(self), level = "debug")] . fn match_poly_trait_ref( . &mut self, . obligation: &TraitObligation<'tcx>, . poly_trait_ref: ty::PolyTraitRef<'tcx>, . ) -> Result>, ()> { 79,525 ( 0.00%) self.infcx 18,012 ( 0.00%) .at(&obligation.cause, obligation.param_env) 238,575 ( 0.00%) .sup(obligation.predicate.to_poly_trait_ref(), poly_trait_ref) . .map(|InferOk { obligations, .. }| obligations) . .map_err(|_| ()) . } . . /////////////////////////////////////////////////////////////////////////// . // Miscellany . . fn match_fresh_trait_refs( . &self, . previous: ty::PolyTraitPredicate<'tcx>, . current: ty::PolyTraitPredicate<'tcx>, . param_env: ty::ParamEnv<'tcx>, . ) -> bool { 5,718 ( 0.00%) let mut matcher = ty::_match::Match::new(self.tcx(), param_env); . matcher.relate(previous, current).is_ok() . } . . fn push_stack<'o>( . &mut self, . previous_stack: TraitObligationStackList<'o, 'tcx>, . obligation: &'o TraitObligation<'tcx>, . ) -> TraitObligationStack<'o, 'tcx> { 1,449,312 ( 0.02%) let fresh_trait_pred = obligation.predicate.fold_with(&mut self.freshener); . . let dfn = previous_stack.cache.next_dfn(); 24,750 ( 0.00%) let depth = previous_stack.depth() + 1; 2,099,718 ( 0.03%) TraitObligationStack { . obligation, 1,199,510 ( 0.01%) fresh_trait_pred, . reached_depth: Cell::new(depth), . previous: previous_stack, . dfn, . depth, . } . } . . #[instrument(skip(self), level = "debug")] . fn closure_trait_ref_unnormalized( . &mut self, . obligation: &TraitObligation<'tcx>, . substs: SubstsRef<'tcx>, . ) -> ty::PolyTraitRef<'tcx> { 26,322 ( 0.00%) let closure_sig = substs.as_closure().sig(); . . debug!(?closure_sig); . . // (1) Feels icky to skip the binder here, but OTOH we know . // that the self-type is an unboxed closure type and hence is . // in fact unparameterized (or at least does not reference any . // regions bound in the obligation). Still probably some . // refactoring could make this nicer. 87,740 ( 0.00%) closure_trait_ref_and_return_type( . self.tcx(), 52,644 ( 0.00%) obligation.predicate.def_id(), 8,774 ( 0.00%) obligation.predicate.skip_binder().self_ty(), // (1) 35,096 ( 0.00%) closure_sig, . util::TupleArgumentsFlag::No, . ) . .map_bound(|(trait_ref, _)| trait_ref) . } . . fn generator_trait_ref_unnormalized( . &mut self, . obligation: &TraitObligation<'tcx>, -- line 2291 ---------------------------------------- -- line 2307 ---------------------------------------- . ) . .map_bound(|(trait_ref, ..)| trait_ref) . } . . /// Returns the obligations that are implied by instantiating an . /// impl or trait. The obligations are substituted and fully . /// normalized. This is used when confirming an impl or default . /// impl. 931,224 ( 0.01%) #[tracing::instrument(level = "debug", skip(self, cause, param_env))] . fn impl_or_trait_obligations( . &mut self, . cause: ObligationCause<'tcx>, . recursion_depth: usize, . param_env: ty::ParamEnv<'tcx>, . def_id: DefId, // of impl or trait . substs: SubstsRef<'tcx>, // for impl or trait . ) -> Vec> { -- line 2323 ---------------------------------------- -- line 2334 ---------------------------------------- . // V: Iterator, V: Sized, . // ::Item: Copy . // When we substitute, say, `V => IntoIter, U => $0`, the last . // obligation will normalize to `<$0 as Iterator>::Item = $1` and . // `$1: Copy`, so we must ensure the obligations are emitted in . // that order. . let predicates = tcx.predicates_of(def_id); . debug!(?predicates); 40,488 ( 0.00%) assert_eq!(predicates.parent, None); 121,464 ( 0.00%) let mut obligations = Vec::with_capacity(predicates.predicates.len()); . for (predicate, _) in predicates.predicates { . debug!(?predicate); 712,085 ( 0.01%) let predicate = normalize_with_depth_to( . self, . param_env, . cause.clone(), . recursion_depth, 142,417 ( 0.00%) predicate.subst(tcx, substs), . &mut obligations, . ); 1,424,170 ( 0.02%) obligations.push(Obligation { . cause: cause.clone(), . recursion_depth, . param_env, . predicate, . }); . } . . // We are performing deduplication here to avoid exponential blowups -- line 2362 ---------------------------------------- -- line 2363 ---------------------------------------- . // (#38528) from happening, but the real cause of the duplication is . // unknown. What we know is that the deduplication avoids exponential . // amount of predicates being propagated when processing deeply nested . // types. . // . // This code is hot enough that it's worth avoiding the allocation . // required for the FxHashSet when possible. Special-casing lengths 0, . // 1 and 2 covers roughly 75-80% of the cases. 110,862 ( 0.00%) if obligations.len() <= 1 { . // No possibility of duplicates. 25,404 ( 0.00%) } else if obligations.len() == 2 { . // Only two elements. Drop the second if they are equal. . if obligations[0] == obligations[1] { . obligations.truncate(1); . } . } else { . // Three or more elements. Use a general deduplication process. . let mut seen = FxHashSet::default(); 16,354 ( 0.00%) obligations.retain(|i| seen.insert(i.clone())); . } . 161,952 ( 0.00%) obligations . } . } . . trait TraitObligationExt<'tcx> { . fn derived_cause( . &self, . variant: fn(DerivedObligationCause<'tcx>) -> ObligationCauseCode<'tcx>, . ) -> ObligationCause<'tcx>; -- line 2392 ---------------------------------------- -- line 2408 ---------------------------------------- . */ . . let obligation = self; . . // NOTE(flaper87): As of now, it keeps track of the whole error . // chain. Ideally, we should have a way to configure this either . // by using -Z verbose or just a CLI argument. . let derived_cause = DerivedObligationCause { 167,936 ( 0.00%) parent_trait_pred: obligation.predicate, 83,294 ( 0.00%) parent_code: obligation.cause.clone_code(), . }; . let derived_code = variant(derived_cause); 501,490 ( 0.01%) ObligationCause::new(obligation.cause.span, obligation.cause.body_id, derived_code) . } . } . . impl<'o, 'tcx> TraitObligationStack<'o, 'tcx> { . fn list(&'o self) -> TraitObligationStackList<'o, 'tcx> { . TraitObligationStackList::with(self) . } . . fn cache(&self) -> &'o ProvisionalEvaluationCache<'tcx> { 32,823 ( 0.00%) self.previous.cache . } . . fn iter(&'o self) -> TraitObligationStackList<'o, 'tcx> { . self.list() . } . . /// Indicates that attempting to evaluate this stack entry . /// required accessing something from the stack at depth `reached_depth`. 1,496 ( 0.00%) fn update_reached_depth(&self, reached_depth: usize) { 748 ( 0.00%) assert!( 748 ( 0.00%) self.depth >= reached_depth, . "invoked `update_reached_depth` with something under this stack: \ . self.depth={} reached_depth={}", . self.depth, . reached_depth, . ); . debug!(reached_depth, "update_reached_depth"); . let mut p = self; 2,340 ( 0.00%) while reached_depth < p.depth { . debug!(?p.fresh_trait_pred, "update_reached_depth: marking as cycle participant"); 796 ( 0.00%) p.reached_depth.set(p.reached_depth.get().min(reached_depth)); 796 ( 0.00%) p = p.previous.head.unwrap(); . } 1,496 ( 0.00%) } . } . . /// The "provisional evaluation cache" is used to store intermediate cache results . /// when solving auto traits. Auto traits are unusual in that they can support . /// cycles. So, for example, a "proof tree" like this would be ok: . /// . /// - `Foo: Send` :- . /// - `Bar: Send` :- -- line 2462 ---------------------------------------- -- line 2540 ---------------------------------------- . /// evaluation. When we create an entry in the evaluation cache using this provisional . /// cache entry (see `on_completion`), we use this `dep_node` to ensure that future reads from . /// the cache will have all of the necessary incr comp dependencies tracked. . dep_node: DepNodeIndex, . } . . impl<'tcx> Default for ProvisionalEvaluationCache<'tcx> { . fn default() -> Self { 307,848 ( 0.00%) Self { dfn: Cell::new(0), map: Default::default() } . } . } . . impl<'tcx> ProvisionalEvaluationCache<'tcx> { . /// Get the next DFN in sequence (basically a counter). . fn next_dfn(&self) -> usize { 12,375 ( 0.00%) let result = self.dfn.get(); 49,500 ( 0.00%) self.dfn.set(result + 1); . result . } . . /// Check the provisional cache for any result for . /// `fresh_trait_ref`. If there is a hit, then you must consider . /// it an access to the stack slots at depth . /// `reached_depth` (from the returned value). . fn get_provisional( -- line 2564 ---------------------------------------- -- line 2599 ---------------------------------------- . // ... . // B // depth 1 -- reached depth = 0 . // C // depth 2 -- reached depth = 1 (should be 0) . // B . // A // depth 0 . // D (reached depth 1) . // C (cache -- reached depth = 2) . for (_k, v) in &mut *map { 96 ( 0.00%) if v.from_dfn >= from_dfn { 144 ( 0.00%) v.reached_depth = reached_depth.min(v.reached_depth); . } . } . . map.insert( . fresh_trait_pred, . ProvisionalEvaluation { from_dfn, reached_depth, result, dep_node }, . ); . } -- line 2616 ---------------------------------------- -- line 2663 ---------------------------------------- . fn on_completion( . &self, . dfn: usize, . mut op: impl FnMut(ty::PolyTraitPredicate<'tcx>, EvaluationResult, DepNodeIndex), . ) { . debug!(?dfn, "on_completion"); . . for (fresh_trait_pred, eval) in 57,673 ( 0.00%) self.map.borrow_mut().drain_filter(|_k, eval| eval.from_dfn >= dfn) . { . debug!(?fresh_trait_pred, ?eval, "on_completion"); . . op(fresh_trait_pred, eval.result, eval.dep_node); . } . } . } . -- line 2679 ---------------------------------------- -- line 2692 ---------------------------------------- . TraitObligationStackList { cache: r.cache(), head: Some(r) } . } . . fn head(&self) -> Option<&'o TraitObligationStack<'o, 'tcx>> { . self.head . } . . fn depth(&self) -> usize { 31,652 ( 0.00%) if let Some(head) = self.head { head.depth } else { 0 } . } . } . . impl<'o, 'tcx> Iterator for TraitObligationStackList<'o, 'tcx> { . type Item = &'o TraitObligationStack<'o, 'tcx>; . . fn next(&mut self) -> Option<&'o TraitObligationStack<'o, 'tcx>> { 57,591 ( 0.00%) let o = self.head?; 22,627 ( 0.00%) *self = o.previous; . Some(o) . } . } . . impl<'o, 'tcx> fmt::Debug for TraitObligationStack<'o, 'tcx> { . fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { . write!(f, "TraitObligationStack({:?})", self.obligation) . } -- line 2717 ---------------------------------------- 1,620,189 ( 0.02%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/cell.rs -------------------------------------------------------------------------------- Ir -- line 346 ---------------------------------------- . /// . /// let c = Cell::new(5); . /// . /// c.set(10); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn set(&self, val: T) { 866 ( 0.00%) let old = self.replace(val); 4,640 ( 0.00%) drop(old); . } . . /// Swaps the values of two `Cell`s. . /// Difference with `std::mem::swap` is that this function doesn't require `&mut` reference. . /// . /// # Examples . /// . /// ``` -- line 363 ---------------------------------------- -- line 434 ---------------------------------------- . /// . /// let five = c.get(); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn get(&self) -> T { . // SAFETY: This can cause data races if called from a separate thread, . // but `Cell` is `!Sync` so this won't happen. 566,716 ( 0.01%) unsafe { *self.value.get() } . } . . /// Updates the contained value using a function and returns the new value. . /// . /// # Examples . /// . /// ``` . /// #![feature(cell_update)] -- line 450 ---------------------------------------- -- line 689 ---------------------------------------- . . #[inline(always)] . fn is_writing(x: BorrowFlag) -> bool { . x < UNUSED . } . . #[inline(always)] . fn is_reading(x: BorrowFlag) -> bool { 1,333,827 ( 0.02%) x > UNUSED . } . . impl RefCell { . /// Creates a new `RefCell` containing `value`. . /// . /// # Examples . /// . /// ``` -- line 705 ---------------------------------------- -- line 706 ---------------------------------------- . /// use std::cell::RefCell; . /// . /// let c = RefCell::new(5); . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_stable(feature = "const_refcell_new", since = "1.24.0")] . #[inline] . pub const fn new(value: T) -> RefCell { 122,792 ( 0.00%) RefCell { 98,536 ( 0.00%) value: UnsafeCell::new(value), . borrow: Cell::new(UNUSED), . #[cfg(feature = "debug_refcell")] . borrowed_at: Cell::new(None), . } . } . . /// Consumes the `RefCell`, returning the wrapped value. . /// -- line 723 ---------------------------------------- -- line 731 ---------------------------------------- . /// let five = c.into_inner(); . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_cell_into_inner", issue = "78729")] . #[inline] . pub const fn into_inner(self) -> T { . // Since this function takes `self` (the `RefCell`) by value, the . // compiler statically verifies that it is not currently borrowed. 8,988 ( 0.00%) self.value.into_inner() . } . . /// Replaces the wrapped value with a new one, returning the old value, . /// without deinitializing either one. . /// . /// This function corresponds to [`std::mem::replace`](../mem/fn.replace.html). . /// . /// # Panics -- line 747 ---------------------------------------- -- line 845 ---------------------------------------- . /// let c = RefCell::new(5); . /// . /// let m = c.borrow_mut(); . /// let b = c.borrow(); // this causes a panic . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . #[inline] . #[track_caller] 14,094 ( 0.00%) pub fn borrow(&self) -> Ref<'_, T> { . self.try_borrow().expect("already mutably borrowed") 42,282 ( 0.00%) } . . /// Immutably borrows the wrapped value, returning an error if the value is currently mutably . /// borrowed. . /// . /// The borrow lasts until the returned `Ref` exits scope. Multiple immutable borrows can be . /// taken out at the same time. . /// . /// This is the non-panicking variant of [`borrow`](#method.borrow). -- line 863 ---------------------------------------- -- line 937 ---------------------------------------- . /// let c = RefCell::new(5); . /// let m = c.borrow(); . /// . /// let b = c.borrow_mut(); // this causes a panic . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . #[inline] . #[track_caller] 449,737 ( 0.01%) pub fn borrow_mut(&self) -> RefMut<'_, T> { . self.try_borrow_mut().expect("already borrowed") 1,349,211 ( 0.02%) } . . /// Mutably borrows the wrapped value, returning an error if the value is currently borrowed. . /// . /// The borrow lasts until the returned `RefMut` or all `RefMut`s derived . /// from it exit scope. The value cannot be borrowed while this borrow is . /// active. . /// . /// This is the non-panicking variant of [`borrow_mut`](#method.borrow_mut). -- line 955 ---------------------------------------- -- line 975 ---------------------------------------- . match BorrowRefMut::new(&self.borrow) { . Some(b) => { . #[cfg(feature = "debug_refcell")] . { . self.borrowed_at.set(Some(crate::panic::Location::caller())); . } . . // SAFETY: `BorrowRef` guarantees unique access. 22 ( 0.00%) Ok(RefMut { value: unsafe { &mut *self.value.get() }, borrow: b }) . } . None => Err(BorrowMutError { . // If a borrow occurred, then we must already have an outstanding borrow, . // so `borrowed_at` will be `Some` . #[cfg(feature = "debug_refcell")] . location: self.borrowed_at.get().unwrap(), . }), . } -- line 991 ---------------------------------------- -- line 1254 ---------------------------------------- . . struct BorrowRef<'b> { . borrow: &'b Cell, . } . . impl<'b> BorrowRef<'b> { . #[inline] . fn new(borrow: &'b Cell) -> Option> { 2,036,932 ( 0.02%) let b = borrow.get().wrapping_add(1); 1,158,468 ( 0.01%) if !is_reading(b) { . // Incrementing borrow can result in a non-reading value (<= 0) in these cases: . // 1. It was < 0, i.e. there are writing borrows, so we can't allow a read borrow . // due to Rust's reference aliasing rules . // 2. It was isize::MAX (the max amount of reading borrows) and it overflowed . // into isize::MIN (the max amount of writing borrows) so we can't allow . // an additional read borrow because isize can't represent so many read borrows . // (this can only happen if you mem::forget more than a small constant amount of . // `Ref`s, which is not good practice) -- line 1271 ---------------------------------------- -- line 1279 ---------------------------------------- . Some(BorrowRef { borrow }) . } . } . } . . impl Drop for BorrowRef<'_> { . #[inline] . fn drop(&mut self) { 907,460 ( 0.01%) let borrow = self.borrow.get(); . debug_assert!(is_reading(borrow)); 1,802,425 ( 0.02%) self.borrow.set(borrow - 1); . } . } . . impl Clone for BorrowRef<'_> { . #[inline] . fn clone(&self) -> Self { . // Since this Ref exists, we know the borrow flag . // is a reading borrow. -- line 1297 ---------------------------------------- -- line 1645 ---------------------------------------- . . struct BorrowRefMut<'b> { . borrow: &'b Cell, . } . . impl Drop for BorrowRefMut<'_> { . #[inline] . fn drop(&mut self) { 21,127,556 ( 0.25%) let borrow = self.borrow.get(); . debug_assert!(is_writing(borrow)); 41,313,121 ( 0.49%) self.borrow.set(borrow + 1); . } . } . . impl<'b> BorrowRefMut<'b> { . #[inline] . fn new(borrow: &'b Cell) -> Option> { . // NOTE: Unlike BorrowRefMut::clone, new is called to create the initial . // mutable reference, and so there must currently be no existing . // references. Thus, while clone increments the mutable refcount, here . // we explicitly only allow going from UNUSED to UNUSED - 1. 42,491,136 ( 0.51%) match borrow.get() { . UNUSED => { . borrow.set(UNUSED - 1); . Some(BorrowRefMut { borrow }) . } . _ => None, . } . } . -- line 1674 ---------------------------------------- -- line 1711 ---------------------------------------- . self.value . } . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl DerefMut for RefMut<'_, T> { . #[inline] . fn deref_mut(&mut self) -> &mut T { 1,919 ( 0.00%) self.value . } . } . . #[unstable(feature = "coerce_unsized", issue = "27732")] . impl<'b, T: ?Sized + Unsize, U: ?Sized> CoerceUnsized> for RefMut<'b, T> {} . . #[stable(feature = "std_guard_impls", since = "1.20.0")] . impl fmt::Display for RefMut<'_, T> { -- line 1727 ---------------------------------------- -- line 1909 ---------------------------------------- . /// ``` . #[inline(always)] . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_stable(feature = "const_unsafecell_get", since = "1.32.0")] . pub const fn get(&self) -> *mut T { . // We can just cast the pointer from `UnsafeCell` to `T` because of . // #[repr(transparent)]. This exploits libstd's special status, there is . // no guarantee for user code that this will work in future versions of the compiler! 7,362,319 ( 0.09%) self as *const UnsafeCell as *const T as *mut T . } . . /// Returns a mutable reference to the underlying data. . /// . /// This call borrows the `UnsafeCell` mutably (at compile-time) which . /// guarantees that we possess the only reference. . /// . /// # Examples -- line 1925 ---------------------------------------- 22,355,952 ( 0.27%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/iter/traits/iterator.rs -------------------------------------------------------------------------------- Ir -- line 193 ---------------------------------------- . /// assert_eq!(a.iter().count(), 5); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . fn count(self) -> usize . where . Self: Sized, . { 7,799 ( 0.00%) self.fold( . 0, . #[rustc_inherit_overflow_checks] 27,943 ( 0.00%) |count, _| count + 1, . ) . } . . /// Consumes the iterator, returning the last element. . /// . /// This method will evaluate the iterator until it returns [`None`]. While . /// doing so, it keeps track of the current element. After [`None`] is . /// returned, `last()` will then return the last element it saw. -- line 212 ---------------------------------------- -- line 266 ---------------------------------------- . /// assert_eq!(iter.advance_by(2), Ok(())); . /// assert_eq!(iter.next(), Some(&3)); . /// assert_eq!(iter.advance_by(0), Ok(())); . /// assert_eq!(iter.advance_by(100), Err(1)); // only `&4` was skipped . /// ``` . #[inline] . #[unstable(feature = "iter_advance_by", reason = "recently added", issue = "77404")] . fn advance_by(&mut self, n: usize) -> Result<(), usize> { 90 ( 0.00%) for i in 0..n { 3,470 ( 0.00%) self.next().ok_or(i)?; . } . Ok(()) . } . . /// Returns the `n`th element of the iterator. . /// . /// Like most indexing operations, the count starts from zero, so `nth(0)` . /// returns the first value, `nth(1)` the second, and so on. -- line 283 ---------------------------------------- -- line 313 ---------------------------------------- . /// Returning `None` if there are less than `n + 1` elements: . /// . /// ``` . /// let a = [1, 2, 3]; . /// assert_eq!(a.iter().nth(10), None); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] 136 ( 0.00%) fn nth(&mut self, n: usize) -> Option { . self.advance_by(n).ok()?; 3,782 ( 0.00%) self.next() . } . . /// Creates an iterator starting at the same point, but stepping by . /// the given amount at each iteration. . /// . /// Note 1: The first element of the iterator will always be returned, . /// regardless of the step given. . /// -- line 331 ---------------------------------------- -- line 441 ---------------------------------------- . /// [`OsStr`]: ../../std/ffi/struct.OsStr.html . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . fn chain(self, other: U) -> Chain . where . Self: Sized, . U: IntoIterator, . { 12,784 ( 0.00%) Chain::new(self, other.into_iter()) . } . . /// 'Zips up' two iterators into a single iterator of pairs. . /// . /// `zip()` returns a new iterator that will iterate over two other . /// iterators, returning a tuple where the first element comes from the . /// first iterator, and the second element comes from the second iterator. . /// -- line 457 ---------------------------------------- -- line 555 ---------------------------------------- . /// [`zip`]: crate::iter::zip . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . fn zip(self, other: U) -> Zip . where . Self: Sized, . U: IntoIterator, . { 232 ( 0.00%) Zip::new(self, other.into_iter()) . } . . /// Creates a new iterator which places a copy of `separator` between adjacent . /// items of the original iterator. . /// . /// In case `separator` does not implement [`Clone`] or needs to be . /// computed every time, use [`intersperse_with`]. . /// -- line 571 ---------------------------------------- -- line 714 ---------------------------------------- . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . fn map(self, f: F) -> Map . where . Self: Sized, . F: FnMut(Self::Item) -> B, . { 1,674,238 ( 0.02%) Map::new(self, f) . } . . /// Calls a closure on each element of an iterator. . /// . /// This is equivalent to using a [`for`] loop on the iterator, although . /// `break` and `continue` are not possible from a closure. It's generally . /// more idiomatic to use a `for` loop, but `for_each` may be more legible . /// when processing items at the end of longer iterator chains. In some -- line 730 ---------------------------------------- -- line 761 ---------------------------------------- . #[stable(feature = "iterator_for_each", since = "1.21.0")] . fn for_each(self, f: F) . where . Self: Sized, . F: FnMut(Self::Item), . { . #[inline] . fn call(mut f: impl FnMut(T)) -> impl FnMut((), T) { 2,995 ( 0.00%) move |(), item| f(item) . } . 3,175,410 ( 0.04%) self.fold((), call(f)); . } . . /// Creates an iterator which uses a closure to determine if an element . /// should be yielded. . /// . /// Given an element the closure must return `true` or `false`. The returned . /// iterator will yield only the elements for which the closure returns . /// true. -- line 780 ---------------------------------------- -- line 834 ---------------------------------------- . /// Note that `iter.filter(f).next()` is equivalent to `iter.find(f)`. . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . fn filter

(self, predicate: P) -> Filter . where . Self: Sized, . P: FnMut(&Self::Item) -> bool, . { 47,589 ( 0.00%) Filter::new(self, predicate) . } . . /// Creates an iterator that both filters and maps. . /// . /// The returned iterator yields only the `value`s for which the supplied . /// closure returns `Some(value)`. . /// . /// `filter_map` can be used to make chains of [`filter`] and [`map`] more -- line 850 ---------------------------------------- -- line 879 ---------------------------------------- . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . fn filter_map(self, f: F) -> FilterMap . where . Self: Sized, . F: FnMut(Self::Item) -> Option, . { 21,213 ( 0.00%) FilterMap::new(self, f) . } . . /// Creates an iterator which gives the current iteration count as well as . /// the next value. . /// . /// The iterator returned yields pairs `(i, val)`, where `i` is the . /// current index of iteration and `val` is the value returned by the . /// iterator. -- line 895 ---------------------------------------- -- line 924 ---------------------------------------- . /// assert_eq!(iter.next(), None); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . fn enumerate(self) -> Enumerate . where . Self: Sized, . { 112 ( 0.00%) Enumerate::new(self) . } . . /// Creates an iterator which can use the [`peek`] and [`peek_mut`] methods . /// to look at the next element of the iterator without consuming it. See . /// their documentation for more information. . /// . /// Note that the underlying iterator is still advanced when [`peek`] or . /// [`peek_mut`] are called for the first time: In order to retrieve the -- line 940 ---------------------------------------- -- line 995 ---------------------------------------- . /// [`peek_mut`]: Peekable::peek_mut . /// [`next`]: Iterator::next . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . fn peekable(self) -> Peekable . where . Self: Sized, . { 17 ( 0.00%) Peekable::new(self) . } . . /// Creates an iterator that [`skip`]s elements based on a predicate. . /// . /// [`skip`]: Iterator::skip . /// . /// `skip_while()` takes a closure as an argument. It will call this . /// closure on each element of the iterator, and ignore elements -- line 1011 ---------------------------------------- -- line 1399 ---------------------------------------- . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . fn flat_map(self, f: F) -> FlatMap . where . Self: Sized, . U: IntoIterator, . F: FnMut(Self::Item) -> U, . { 40 ( 0.00%) FlatMap::new(self, f) . } . . /// Creates an iterator that flattens nested structure. . /// . /// This is useful when you have an iterator of iterators or an iterator of . /// things that can be turned into iterators and you want to remove one . /// level of indirection. . /// -- line 1415 ---------------------------------------- -- line 1537 ---------------------------------------- . /// assert_eq!(iter.next(), None); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . fn fuse(self) -> Fuse . where . Self: Sized, . { 7,571 ( 0.00%) Fuse::new(self) . } . . /// Does something with each element of an iterator, passing the value on. . /// . /// When using iterators, you'll often chain several of them together. . /// While working on such code, you might want to check out what's . /// happening at various parts in the pipeline. To do that, insert . /// a call to `inspect()`. -- line 1553 ---------------------------------------- -- line 1769 ---------------------------------------- . /// [`char`]: type@char . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . #[must_use = "if you really need to exhaust the iterator, consider `.for_each(drop)` instead"] . fn collect>(self) -> B . where . Self: Sized, . { 37,935 ( 0.00%) FromIterator::from_iter(self) . } . . /// Consumes an iterator, creating two collections from it. . /// . /// The predicate passed to `partition()` can return `true`, or `false`. . /// `partition()` returns a pair, all of the elements for which it returned . /// `true`, and all of the elements for which it returned `false`. . /// -- line 1785 ---------------------------------------- -- line 1798 ---------------------------------------- . /// let (even, odd): (Vec, Vec) = a . /// .iter() . /// .partition(|&n| n % 2 == 0); . /// . /// assert_eq!(even, vec![2]); . /// assert_eq!(odd, vec![1, 3]); . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] 7,672 ( 0.00%) fn partition(self, f: F) -> (B, B) . where . Self: Sized, . B: Default + Extend, . F: FnMut(&Self::Item) -> bool, . { . #[inline] . fn extend<'a, T, B: Extend>( . mut f: impl FnMut(&T) -> bool + 'a, . left: &'a mut B, . right: &'a mut B, . ) -> impl FnMut((), T) + 'a { . move |(), x| { 1,624 ( 0.00%) if f(&x) { . left.extend_one(x); . } else { . right.extend_one(x); . } . } . } . . let mut left: B = Default::default(); . let mut right: B = Default::default(); . 448 ( 0.00%) self.fold((), extend(f, &mut left, &mut right)); . 12,112 ( 0.00%) (left, right) 8,319 ( 0.00%) } . . /// Reorders the elements of this iterator *in-place* according to the given predicate, . /// such that all those that return `true` precede all those that return `false`. . /// Returns the number of `true` elements found. . /// . /// The relative order of partitioned items is not maintained. . /// . /// # Current implementation -- line 1841 ---------------------------------------- -- line 2011 ---------------------------------------- . /// } else { . /// ControlFlow::Break(prev) . /// } . /// }); . /// assert_eq!(triangular, ControlFlow::Continue(435)); . /// ``` . #[inline] . #[stable(feature = "iterator_try_fold", since = "1.27.0")] 45,136 ( 0.00%) fn try_fold(&mut self, init: B, mut f: F) -> R . where . Self: Sized, . F: FnMut(B, Self::Item) -> R, . R: Try, . { 10,630 ( 0.00%) let mut accum = init; 8,250,794 ( 0.10%) while let Some(x) = self.next() { 30,818,357 ( 0.37%) accum = f(accum, x)?; . } 9,738 ( 0.00%) try { accum } 41,704 ( 0.00%) } . . /// An iterator method that applies a fallible function to each item in the . /// iterator, stopping at the first error and returning that error. . /// . /// This can also be thought of as the fallible form of [`for_each()`] . /// or as the stateless version of [`try_fold()`]. . /// . /// [`for_each()`]: Iterator::for_each -- line 2038 ---------------------------------------- -- line 2077 ---------------------------------------- . fn try_for_each(&mut self, f: F) -> R . where . Self: Sized, . F: FnMut(Self::Item) -> R, . R: Try, . { . #[inline] . fn call(mut f: impl FnMut(T) -> R) -> impl FnMut((), T) -> R { 13,332 ( 0.00%) move |(), x| f(x) . } . 840 ( 0.00%) self.try_fold((), call(f)) . } . . /// Folds every element into an accumulator by applying an operation, . /// returning the final result. . /// . /// `fold()` takes two arguments: an initial value, and a closure with two . /// arguments: an 'accumulator', and an element. The closure returns the value that . /// the accumulator should have for the next iteration. -- line 2096 ---------------------------------------- -- line 2188 ---------------------------------------- . /// // they're the same . /// assert_eq!(result, result2); . /// ``` . /// . /// [`reduce()`]: Iterator::reduce . #[doc(alias = "inject", alias = "foldl")] . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] 7,035 ( 0.00%) fn fold(mut self, init: B, mut f: F) -> B . where . Self: Sized, . F: FnMut(B, Self::Item) -> B, . { 9,642 ( 0.00%) let mut accum = init; 1,604,207 ( 0.02%) while let Some(x) = self.next() { 567,821 ( 0.01%) accum = f(accum, x); . } . accum 8,164 ( 0.00%) } . . /// Reduces the elements to a single one, by repeatedly applying a reducing . /// operation. . /// . /// If the iterator is empty, returns [`None`]; otherwise, returns the . /// result of the reduction. . /// . /// The reducing function is a closure with two arguments: an 'accumulator', and an element. -- line 2214 ---------------------------------------- -- line 2240 ---------------------------------------- . #[inline] . #[stable(feature = "iterator_fold_self", since = "1.51.0")] . fn reduce(mut self, f: F) -> Option . where . Self: Sized, . F: FnMut(Self::Item, Self::Item) -> Self::Item, . { . let first = self.next()?; 19,108 ( 0.00%) Some(self.fold(first, f)) . } . . /// Reduces the elements to a single one by repeatedly applying a reducing operation. If the . /// closure returns a failure, the failure is propagated back to the caller immediately. . /// . /// The return type of this method depends on the return type of the closure. If the closure . /// returns `Result`, then this function will return `Result, . /// E>`. If the closure returns `Option`, then this function will return -- line 2256 ---------------------------------------- -- line 2370 ---------------------------------------- . fn all(&mut self, f: F) -> bool . where . Self: Sized, . F: FnMut(Self::Item) -> bool, . { . #[inline] . fn check(mut f: impl FnMut(T) -> bool) -> impl FnMut((), T) -> ControlFlow<()> { . move |(), x| { 39,864 ( 0.00%) if f(x) { ControlFlow::CONTINUE } else { ControlFlow::BREAK } . } . } 37,107 ( 0.00%) self.try_fold((), check(f)) == ControlFlow::CONTINUE . } . . /// Tests if any element of the iterator matches a predicate. . /// . /// `any()` takes a closure that returns `true` or `false`. It applies . /// this closure to each element of the iterator, and if any of them return . /// `true`, then so does `any()`. If they all return `false`, it . /// returns `false`. -- line 2389 ---------------------------------------- -- line 2423 ---------------------------------------- . fn any(&mut self, f: F) -> bool . where . Self: Sized, . F: FnMut(Self::Item) -> bool, . { . #[inline] . fn check(mut f: impl FnMut(T) -> bool) -> impl FnMut((), T) -> ControlFlow<()> { . move |(), x| { 1,110 ( 0.00%) if f(x) { ControlFlow::BREAK } else { ControlFlow::CONTINUE } . } . } . . self.try_fold((), check(f)) == ControlFlow::BREAK . } . . /// Searches for an element of an iterator that satisfies a predicate. . /// -- line 2439 ---------------------------------------- -- line 2483 ---------------------------------------- . fn find

(&mut self, predicate: P) -> Option . where . Self: Sized, . P: FnMut(&Self::Item) -> bool, . { . #[inline] . fn check(mut predicate: impl FnMut(&T) -> bool) -> impl FnMut((), T) -> ControlFlow { . move |(), x| { 127,171 ( 0.00%) if predicate(&x) { ControlFlow::Break(x) } else { ControlFlow::CONTINUE } . } . } . 226,715 ( 0.00%) self.try_fold((), check(predicate)).break_value() . } . . /// Applies function to the elements of iterator and returns . /// the first non-none result. . /// . /// `iter.find_map(f)` is equivalent to `iter.filter_map(f).next()`. . /// . /// # Examples -- line 2503 ---------------------------------------- -- line 2513 ---------------------------------------- . #[stable(feature = "iterator_find_map", since = "1.30.0")] . fn find_map(&mut self, f: F) -> Option . where . Self: Sized, . F: FnMut(Self::Item) -> Option, . { . #[inline] . fn check(mut f: impl FnMut(T) -> Option) -> impl FnMut((), T) -> ControlFlow { 181,552 ( 0.00%) move |(), x| match f(x) { 25,351 ( 0.00%) Some(x) => ControlFlow::Break(x), . None => ControlFlow::CONTINUE, . } . } . 181 ( 0.00%) self.try_fold((), check(f)).break_value() . } . . /// Applies function to the elements of iterator and returns . /// the first true result or the first error. . /// . /// The return type of this method depends on the return type of the closure. . /// If you return `Result` from the closure, you'll get a `Result; E>`. . /// If you return `Option` from the closure, you'll get an `Option>`. -- line 2535 ---------------------------------------- -- line 2655 ---------------------------------------- . P: FnMut(Self::Item) -> bool, . { . #[inline] . fn check( . mut predicate: impl FnMut(T) -> bool, . ) -> impl FnMut(usize, T) -> ControlFlow { . #[rustc_inherit_overflow_checks] . move |i, x| { 31 ( 0.00%) if predicate(x) { ControlFlow::Break(i) } else { ControlFlow::Continue(i + 1) } . } . } . . self.try_fold(0, check(predicate)).break_value() . } . . /// Searches for an element in an iterator from the right, returning its . /// index. -- line 2671 ---------------------------------------- -- line 2812 ---------------------------------------- . /// # Examples . /// . /// ``` . /// let a = [-3_i32, 0, 1, 5, -10]; . /// assert_eq!(*a.iter().max_by_key(|x| x.abs()).unwrap(), -10); . /// ``` . #[inline] . #[stable(feature = "iter_cmp_by_key", since = "1.6.0")] 7 ( 0.00%) fn max_by_key(self, f: F) -> Option . where . Self: Sized, . F: FnMut(&Self::Item) -> B, . { . #[inline] . fn key(mut f: impl FnMut(&T) -> B) -> impl FnMut(T) -> (B, T) { 64 ( 0.00%) move |x| (f(&x), x) . } . . #[inline] . fn compare((x_p, _): &(B, T), (y_p, _): &(B, T)) -> Ordering { . x_p.cmp(y_p) . } . 89 ( 0.00%) let (_, x) = self.map(key(f)).max_by(compare)?; . Some(x) 8 ( 0.00%) } . . /// Returns the element that gives the maximum value with respect to the . /// specified comparison function. . /// . /// If several elements are equally maximum, the last element is . /// returned. If the iterator is empty, [`None`] is returned. . /// . /// # Examples -- line 2845 ---------------------------------------- -- line 2852 ---------------------------------------- . #[stable(feature = "iter_max_by", since = "1.15.0")] . fn max_by(self, compare: F) -> Option . where . Self: Sized, . F: FnMut(&Self::Item, &Self::Item) -> Ordering, . { . #[inline] . fn fold(mut compare: impl FnMut(&T, &T) -> Ordering) -> impl FnMut(T, T) -> T { 231 ( 0.00%) move |x, y| cmp::max_by(x, y, &mut compare) . } . 11,796 ( 0.00%) self.reduce(fold(compare)) . } . . /// Returns the element that gives the minimum value from the . /// specified function. . /// . /// If several elements are equally minimum, the first element is . /// returned. If the iterator is empty, [`None`] is returned. . /// -- line 2871 ---------------------------------------- -- line 2946 ---------------------------------------- . /// ``` . #[inline] . #[doc(alias = "reverse")] . #[stable(feature = "rust1", since = "1.0.0")] . fn rev(self) -> Rev . where . Self: Sized + DoubleEndedIterator, . { 13 ( 0.00%) Rev::new(self) . } . . /// Converts an iterator of pairs into a pair of containers. . /// . /// `unzip()` consumes an entire iterator of pairs, producing two . /// collections: one from the left elements of the pairs, and one . /// from the right elements. . /// -- line 2962 ---------------------------------------- -- line 2987 ---------------------------------------- . #[stable(feature = "rust1", since = "1.0.0")] . fn unzip(self) -> (FromA, FromB) . where . FromA: Default + Extend, . FromB: Default + Extend, . Self: Sized + Iterator, . { . let mut unzipped: (FromA, FromB) = Default::default(); 1,050 ( 0.00%) unzipped.extend(self); . unzipped . } . . /// Creates an iterator which copies all of its elements. . /// . /// This is useful when you have an iterator over `&T`, but you need an . /// iterator over `T`. . /// -- line 3003 ---------------------------------------- -- line 3017 ---------------------------------------- . /// assert_eq!(v_map, vec![1, 2, 3]); . /// ``` . #[stable(feature = "iter_copied", since = "1.36.0")] . fn copied<'a, T: 'a>(self) -> Copied . where . Self: Sized + Iterator, . T: Copy, . { 37,777 ( 0.00%) Copied::new(self) . } . . /// Creates an iterator which [`clone`]s all of its elements. . /// . /// This is useful when you have an iterator over `&T`, but you need an . /// iterator over `T`. . /// . /// [`clone`]: Clone::clone -- line 3033 ---------------------------------------- -- line 3048 ---------------------------------------- . /// assert_eq!(v_map, vec![1, 2, 3]); . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . fn cloned<'a, T: 'a>(self) -> Cloned . where . Self: Sized + Iterator, . T: Clone, . { 202,134 ( 0.00%) Cloned::new(self) . } . . /// Repeats an iterator endlessly. . /// . /// Instead of stopping at [`None`], the iterator will instead start again, . /// from the beginning. After iterating again, it will start at the . /// beginning again. And again. And again. Forever. Note that in case the . /// original iterator is empty, the resulting iterator will also be empty. -- line 3064 ---------------------------------------- -- line 3313 ---------------------------------------- . /// . /// # Examples . /// . /// ``` . /// assert_eq!([1].iter().eq([1].iter()), true); . /// assert_eq!([1].iter().eq([1, 2].iter()), false); . /// ``` . #[stable(feature = "iter_order", since = "1.5.0")] 91 ( 0.00%) fn eq(self, other: I) -> bool . where . I: IntoIterator, . Self::Item: PartialEq, . Self: Sized, . { 104 ( 0.00%) self.eq_by(other, |x, y| x == y) 104 ( 0.00%) } . . /// Determines if the elements of this [`Iterator`] are equal to those of . /// another with respect to the specified equality function. . /// . /// # Examples . /// . /// Basic usage: . /// -- line 3336 ---------------------------------------- -- line 3344 ---------------------------------------- . /// ``` . #[unstable(feature = "iter_order_by", issue = "64295")] . fn eq_by(mut self, other: I, mut eq: F) -> bool . where . Self: Sized, . I: IntoIterator, . F: FnMut(Self::Item, I::Item) -> bool, . { 130 ( 0.00%) let mut other = other.into_iter(); . . loop { 39 ( 0.00%) let x = match self.next() { . None => return other.next().is_none(), 143 ( 0.00%) Some(val) => val, . }; . 39 ( 0.00%) let y = match other.next() { . None => return false, . Some(val) => val, . }; . 6 ( 0.00%) if !eq(x, y) { . return false; . } . } . } . . /// Determines if the elements of this [`Iterator`] are unequal to those of . /// another. . /// -- line 3373 ---------------------------------------- -- line 3589 ---------------------------------------- . unreachable!("Always specialized"); . } . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl Iterator for &mut I { . type Item = I::Item; . #[inline] 298 ( 0.00%) fn next(&mut self) -> Option { 157,906 ( 0.00%) (**self).next() 447 ( 0.00%) } . fn size_hint(&self) -> (usize, Option) { 310 ( 0.00%) (**self).size_hint() . } . fn advance_by(&mut self, n: usize) -> Result<(), usize> { . (**self).advance_by(n) . } . fn nth(&mut self, n: usize) -> Option { . (**self).nth(n) . } . } -- line 3609 ---------------------------------------- 2,410,495 ( 0.03%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/iter/adapters/zip.rs -------------------------------------------------------------------------------- Ir -- line 15 ---------------------------------------- . b: B, . // index, len and a_len are only used by the specialized version of zip . index: usize, . len: usize, . a_len: usize, . } . impl Zip { . pub(in crate::iter) fn new(a: A, b: B) -> Zip { 132 ( 0.00%) ZipImpl::new(a, b) . } . fn super_nth(&mut self, mut n: usize) -> Option<(A::Item, B::Item)> { . while let Some(x) = Iterator::next(self) { . if n == 0 { . return Some(x); . } . n -= 1; . } -- line 31 ---------------------------------------- -- line 63 ---------------------------------------- . /// assert!(iter.next().is_none()); . /// ``` . #[stable(feature = "iter_zip", since = "1.59.0")] . pub fn zip(a: A, b: B) -> Zip . where . A: IntoIterator, . B: IntoIterator, . { 66,083 ( 0.00%) ZipImpl::new(a.into_iter(), b.into_iter()) . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl Iterator for Zip . where . A: Iterator, . B: Iterator, . { -- line 79 ---------------------------------------- -- line 136 ---------------------------------------- . Self: Iterator + TrustedRandomAccessNoCoerce; . } . . // Work around limitations of specialization, requiring `default` impls to be repeated . // in intermediary impls. . macro_rules! zip_impl_general_defaults { . () => { . default fn new(a: A, b: B) -> Self { 264 ( 0.00%) Zip { . a, . b, . index: 0, // unused . len: 0, // unused . a_len: 0, // unused . } . } . . #[inline] . default fn next(&mut self) -> Option<(A::Item, B::Item)> { 104,515 ( 0.00%) let x = self.a.next()?; 67,132 ( 0.00%) let y = self.b.next()?; 26,292 ( 0.00%) Some((x, y)) 12,992 ( 0.00%) } . . #[inline] . default fn nth(&mut self, n: usize) -> Option { . self.super_nth(n) . } . . #[inline] . default fn next_back(&mut self) -> Option<(A::Item, B::Item)> -- line 166 ---------------------------------------- -- line 203 ---------------------------------------- . B: Iterator, . { . type Item = (A::Item, B::Item); . . zip_impl_general_defaults! {} . . #[inline] . default fn size_hint(&self) -> (usize, Option) { 112 ( 0.00%) let (a_lower, a_upper) = self.a.size_hint(); 16 ( 0.00%) let (b_lower, b_upper) = self.b.size_hint(); . . let lower = cmp::min(a_lower, b_lower); . . let upper = match (a_upper, b_upper) { . (Some(x), Some(y)) => Some(cmp::min(x, y)), . (Some(x), None) => Some(x), . (None, Some(y)) => Some(y), . (None, None) => None, -- line 220 ---------------------------------------- -- line 236 ---------------------------------------- . where . A: TrustedRandomAccessNoCoerce + Iterator, . B: TrustedRandomAccessNoCoerce + Iterator, . { . zip_impl_general_defaults! {} . . #[inline] . default fn size_hint(&self) -> (usize, Option) { 3,484 ( 0.00%) let size = cmp::min(self.a.size(), self.b.size()); . (size, Some(size)) . } . . #[inline] . unsafe fn get_unchecked(&mut self, idx: usize) -> ::Item { 160 ( 0.00%) let idx = self.index + idx; . // SAFETY: the caller must uphold the contract for . // `Iterator::__iterator_get_unchecked`. . unsafe { (self.a.__iterator_get_unchecked(idx), self.b.__iterator_get_unchecked(idx)) } . } . } . . #[doc(hidden)] . impl ZipImpl for Zip -- line 258 ---------------------------------------- -- line 263 ---------------------------------------- . fn new(a: A, b: B) -> Self { . let a_len = a.size(); . let len = cmp::min(a_len, b.size()); . Zip { a, b, index: 0, len, a_len } . } . . #[inline] . fn next(&mut self) -> Option<(A::Item, B::Item)> { 21,718,751 ( 0.26%) if self.index < self.len { . let i = self.index; . // since get_unchecked executes code which can panic we increment the counters beforehand . // so that the same index won't be accessed twice, as required by TrustedRandomAccess 4,919,307 ( 0.06%) self.index += 1; . // SAFETY: `i` is smaller than `self.len`, thus smaller than `self.a.len()` and `self.b.len()` . unsafe { 317 ( 0.00%) Some((self.a.__iterator_get_unchecked(i), self.b.__iterator_get_unchecked(i))) . } 60 ( 0.00%) } else if A::MAY_HAVE_SIDE_EFFECT && self.index < self.a_len { . let i = self.index; . // as above, increment before executing code that may panic . self.index += 1; . self.len += 1; . // match the base implementation's potential side effects . // SAFETY: we just checked that `i` < `self.a.len()` . unsafe { . self.a.__iterator_get_unchecked(i); -- line 288 ---------------------------------------- -- line 290 ---------------------------------------- . None . } else { . None . } . } . . #[inline] . fn size_hint(&self) -> (usize, Option) { 1,402,161 ( 0.02%) let len = self.len - self.index; . (len, Some(len)) . } . . #[inline] . fn nth(&mut self, n: usize) -> Option { . let delta = cmp::min(n, self.len - self.index); . let end = self.index + delta; . while self.index < end { -- line 306 ---------------------------------------- -- line 535 ---------------------------------------- . #[unstable(feature = "trusted_random_access", issue = "none")] . #[rustc_specialization_trait] . pub unsafe trait TrustedRandomAccessNoCoerce: Sized { . // Convenience method. . fn size(&self) -> usize . where . Self: Iterator, . { 8,498 ( 0.00%) self.size_hint().0 . } . /// `true` if getting an iterator element may have side effects. . /// Remember to take inner iterators into account. . const MAY_HAVE_SIDE_EFFECT: bool; . } . . /// Like `Iterator::__iterator_get_unchecked`, but doesn't require the compiler to . /// know that `U: TrustedRandomAccess`. -- line 551 ---------------------------------------- -- line 555 ---------------------------------------- . /// Same requirements calling `get_unchecked` directly. . #[doc(hidden)] . pub(in crate::iter::adapters) unsafe fn try_get_unchecked(it: &mut I, idx: usize) -> I::Item . where . I: Iterator, . { . // SAFETY: the caller must uphold the contract for . // `Iterator::__iterator_get_unchecked`. 32,821 ( 0.00%) unsafe { it.try_get_unchecked(idx) } . } . . unsafe trait SpecTrustedRandomAccess: Iterator { . /// If `Self: TrustedRandomAccess`, it must be safe to call . /// `Iterator::__iterator_get_unchecked(self, index)`. . unsafe fn try_get_unchecked(&mut self, index: usize) -> Self::Item; . } . -- line 571 ---------------------------------------- 2,820,851 ( 0.03%) -------------------------------------------------------------------------------- -- 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. 96,657 ( 0.00%) unsafe { from_raw_parts(self.ptr.as_ptr(), len!(self)) } . } . . // Helper function for moving the start of the iterator forwards by `offset` elements, . // returning the old start. . // Unsafe because the offset must not exceed `self.len()`. . #[inline(always)] . unsafe fn post_inc_start(&mut self, offset: isize) -> * $raw_mut T { . if mem::size_of::() == 0 { . zst_shrink!(self, offset); . self.ptr.as_ptr() . } else { . let old = self.ptr.as_ptr(); . // SAFETY: the caller guarantees that `offset` doesn't exceed `self.len()`, . // so this new pointer is inside `self` and thus guaranteed to be non-null. 1,562,741 ( 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`. 50 ( 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 { 350,718 ( 0.00%) len!(self) . } . . #[inline(always)] . fn is_empty(&self) -> bool { . is_empty!(self) . } . } . -- line 128 ---------------------------------------- -- line 134 ---------------------------------------- . fn next(&mut self) -> Option<$elem> { . // could be implemented with slices, but this avoids bounds checks . . // SAFETY: `assume` calls are safe since a slice's start pointer . // must be non-null, and slices over non-ZSTs must also have a . // non-null end pointer. The call to `next_unchecked!` is safe . // since we check if the iterator is empty first. . unsafe { 459,532 ( 0.01%) assume(!self.ptr.as_ptr().is_null()); . if mem::size_of::() != 0 { 99,222 ( 0.00%) assume(!self.end.is_null()); . } 177,478,744 ( 2.12%) if is_empty!(self) { . None . } else { 10 ( 0.00%) Some(next_unchecked!(self)) . } . } . } . . #[inline] . fn size_hint(&self) -> (usize, Option) { 3,853,916 ( 0.05%) let exact = len!(self); . (exact, Some(exact)) . } . . #[inline] . fn count(self) -> usize { . len!(self) . } . . #[inline] . fn nth(&mut self, n: usize) -> Option<$elem> { 85,793 ( 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() { 14,425 ( 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, . { 6,751 ( 0.00%) while let Some(x) = self.next() { 20,875 ( 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] 240 ( 0.00%) fn any(&mut self, mut f: F) -> bool . where . Self: Sized, . F: FnMut(Self::Item) -> bool, . { 1,163,929 ( 0.01%) while let Some(x) = self.next() { 6,585,102 ( 0.08%) if f(x) { . return true; . } . } . false 240 ( 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, . { 58,627 ( 0.00%) while let Some(x) = self.next() { 487,760 ( 0.01%) if predicate(&x) { . return Some(x); . } . } . None 5,407 ( 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, . { 169,754 ( 0.00%) while let Some(x) = self.next() { 468,058 ( 0.01%) if let Some(y) = f(x) { 53,715 ( 0.00%) return Some(y); . } . } . None 10,135 ( 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() { 841,579 ( 0.01%) if predicate(x) { . // SAFETY: we are guaranteed to be in bounds by the loop invariant: . // when `i >= n`, `self.next()` returns `None` and the loop breaks. . unsafe { assume(i < n) }; . return Some(i); . } . i += 1; . } . None -- line 303 ---------------------------------------- -- line 308 ---------------------------------------- . // faster to compile. Also, the `assume` avoids a bounds check. . #[inline] . fn rposition

(&mut self, mut predicate: P) -> Option where . P: FnMut(Self::Item) -> bool, . Self: Sized + ExactSizeIterator + DoubleEndedIterator . { . let n = len!(self); . let mut i = n; 19,293 ( 0.00%) while let Some(x) = self.next_back() { 267,050 ( 0.00%) i -= 1; 201,019 ( 0.00%) if predicate(x) { . // SAFETY: `i` must be lower than `n` since it starts at `n` . // and is only decreasing. . unsafe { assume(i < n) }; . return Some(i); . } . } . None . } -- line 326 ---------------------------------------- -- line 332 ---------------------------------------- . // the returned references is guaranteed to refer to an element . // of the slice and thus guaranteed to be valid. . // . // Also note that the caller also guarantees that we're never . // called with the same index again, and that no other methods . // that will access this subslice are called, so it is valid . // for the returned reference to be mutable in the case of . // `IterMut` 1,061,704 ( 0.01%) 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 { 21 ( 0.00%) assume(!self.ptr.as_ptr().is_null()); . if mem::size_of::() != 0 { 57 ( 0.00%) assume(!self.end.is_null()); . } 2,606,701 ( 0.03%) if is_empty!(self) { . None . } else { . Some(next_back_unchecked!(self)) . } . } . } . . #[inline] -- line 369 ---------------------------------------- 23,538,471 ( 0.28%) -------------------------------------------------------------------------------- -- 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 { 10,423,961 ( 0.12%) Vec { buf: RawVec::NEW, len: 0 } 644 ( 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 { 3,511,187 ( 0.04%) 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 { 174,670 ( 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 { 410,702 ( 0.00%) 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) { 1,046,817 ( 0.01%) 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) { 39,149 ( 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. 66,067 ( 0.00%) if self.capacity() > self.len { 12,504 ( 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(); 24,241 ( 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")] 925,692 ( 0.01%) pub fn truncate(&mut self, len: usize) { . // This is safe because: . // . // * the slice passed to `drop_in_place` is valid; the `len > self.len` . // case avoids creating an invalid slice, and . // * the `len` of the vector is shrunk before calling `drop_in_place`, . // such that no value will be dropped twice in case `drop_in_place` . // were to panic once (if it panics twice, the program aborts). . unsafe { . // Note: It's intentional that this is `>` and not `>=`. . // Changing it to `>=` has negative performance . // implications in some cases. See #78884 for more. 866,790 ( 0.01%) if len > self.len { . return; . } . let remaining_len = self.len - len; . let s = ptr::slice_from_raw_parts_mut(self.as_mut_ptr().add(len), remaining_len); 1,174,231 ( 0.01%) self.len = len; 20,683 ( 0.00%) ptr::drop_in_place(s); . } 1,110,830 ( 0.01%) } . . /// Extracts a slice containing the entire vector. . /// . /// Equivalent to `&s[..]`. . /// . /// # Examples . /// . /// ``` -- line 1076 ---------------------------------------- -- line 1126 ---------------------------------------- . /// ``` . /// . /// [`as_mut_ptr`]: Vec::as_mut_ptr . #[stable(feature = "vec_as_ptr", since = "1.37.0")] . #[inline] . pub fn as_ptr(&self) -> *const T { . // We shadow the slice method of the same name to avoid going through . // `deref`, which creates an intermediate reference. 30,460,039 ( 0.36%) 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. 16,807,355 ( 0.20%) 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()); . 2,096,681 ( 0.03%) self.len = new_len; 11,010 ( 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(); 605 ( 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")] 18,340 ( 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); . } . 2,785 ( 0.00%) let len = self.len(); 6,992 ( 0.00%) if index > len { . assert_failed(index, len); . } . . // space for the new element 9,432 ( 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.) 13,653 ( 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); . } 9,432 ( 0.00%) self.set_len(len + 1); . } 15,720 ( 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); . } . 1,059 ( 0.00%) let len = self.len(); 3,725 ( 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. 6,976 ( 0.00%) ret = ptr::read(ptr); . . // Shift everything down to fill in that spot. 2,146 ( 0.00%) ptr::copy(ptr.offset(1), ptr, len - index - 1); . } 3,296 ( 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")] 830,526 ( 0.01%) pub fn retain(&mut self, mut f: F) . where . F: FnMut(&T) -> bool, . { 56,204 ( 0.00%) self.retain_mut(|elem| f(elem)); 808,816 ( 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, . { 113,767 ( 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) { 95,720 ( 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), 75,721 ( 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, . { 1,665,970 ( 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) }; 680,577 ( 0.01%) if !f(cur) { . // Advance early to avoid double drop if `drop_in_place` panicked. 67,735 ( 0.00%) g.processed_len += 1; 62,228 ( 0.00%) g.deleted_cnt += 1; . // SAFETY: We never touch this element again after dropped. 1,208 ( 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 { 65,466 ( 0.00%) let hole_slot = g.v.as_mut_ptr().add(g.processed_len - g.deleted_cnt); . ptr::copy_nonoverlapping(cur, hole_slot, 1); . } . } 43,644 ( 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")] 24,444 ( 0.00%) pub fn dedup_by(&mut self, mut same_bucket: F) . where . F: FnMut(&mut T, &mut T) -> bool, . { 3,495 ( 0.00%) let len = self.len(); 10,440 ( 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 { 13,429 ( 0.00%) while gap.read < len { . let read_ptr = ptr.add(gap.read); . let prev_ptr = ptr.add(gap.write.wrapping_sub(1)); . 7,253 ( 0.00%) if same_bucket(&mut *read_ptr, &mut *prev_ptr) { . // Increase `gap.read` now since the drop may panic. . gap.read += 1; . /* We have found duplicate, drop it in-place */ . ptr::drop_in_place(read_ptr); . } else { . let write_ptr = ptr.add(gap.write); . . /* Because `read_ptr` can be equal to `write_ptr`, we either . * have to use `copy` or conditional `copy_nonoverlapping`. . * Looks like the first option is faster. */ . ptr::copy(read_ptr, write_ptr, 1); . . /* We have filled that place, so go further */ 6,294 ( 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); . } 27,936 ( 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")] 1,555 ( 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. 15,604,848 ( 0.19%) if self.len == self.buf.capacity() { 1,207,533 ( 0.01%) self.buf.reserve_for_push(self.len); . } . unsafe { 576,877 ( 0.01%) let end = self.as_mut_ptr().add(self.len); . ptr::write(end, value); 22,718,541 ( 0.27%) self.len += 1; . } 1,244 ( 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 { 4,141,389 ( 0.05%) if self.len == 0 { 258 ( 0.00%) None . } else { . unsafe { 3,169,859 ( 0.04%) self.len -= 1; 514,506 ( 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,470 ( 0.00%) pub fn append(&mut self, other: &mut Self) { . unsafe { . self.append_elements(other.as_slice() as _); . other.set_len(0); . } 1,260 ( 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); 78,975 ( 0.00%) let len = self.len(); . unsafe { ptr::copy_nonoverlapping(other as *const T, self.as_mut_ptr().add(len), count) }; 1,478,192 ( 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. . // 88,823 ( 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). 30 ( 0.00%) let range_slice = slice::from_raw_parts_mut(self.as_mut_ptr().add(start), end - start); 28,857 ( 0.00%) Drain { . tail_start: end, 30 ( 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) { 1,649,288 ( 0.02%) 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 { 1,265,742 ( 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); . } . 4,426 ( 0.00%) if at > self.len() { . assert_failed(at, self.len()); . } . 3,830 ( 0.00%) if at == 0 { . // the new vector can take over the original buffer and avoid the copy . return mem::replace( . self, . Vec::with_capacity_in(self.capacity(), self.allocator().clone()), . ); . } . . let other_len = self.len - at; -- line 1955 ---------------------------------------- -- line 1988 ---------------------------------------- . /// . /// let mut vec = vec![]; . /// let mut p = 1; . /// vec.resize_with(4, || { p *= 2; p }); . /// assert_eq!(vec, [2, 4, 8, 16]); . /// ``` . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "vec_resize_with", since = "1.33.0")] 117,301 ( 0.00%) pub fn resize_with(&mut self, new_len: usize, f: F) . where . F: FnMut() -> T, . { 15,385 ( 0.00%) let len = self.len(); 30,770 ( 0.00%) if new_len > len { 92,237 ( 0.00%) self.extend_with(new_len - len, ExtendFunc(f)); . } else { . self.truncate(new_len); . } 101,916 ( 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( 2 ( 0.00%) self.as_mut_ptr().add(self.len) as *mut MaybeUninit, 66 ( 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")] 350 ( 0.00%) pub fn resize(&mut self, new_len: usize, value: T) { 35 ( 0.00%) let len = self.len(); . 105 ( 0.00%) if new_len > len { 13,008 ( 0.00%) self.extend_with(new_len - len, ExtendElement(value)) . } else { . self.truncate(new_len); . } 35 ( 0.00%) } . . /// Clones and appends all elements in a slice to the `Vec`. . /// . /// Iterates over the slice `other`, clones each element, and then appends . /// it to this `Vec`. The `other` slice is traversed in-order. . /// . /// Note that this function is same as [`extend`] except that it is . /// specialized to work with slices instead. If and when Rust gets -- line 2213 ---------------------------------------- -- line 2291 ---------------------------------------- . fn last(mut self) -> T { . (self.0)() . } . } . . impl Vec { . #[cfg(not(no_global_oom_handling))] . /// Extend the vector by `n` values, using the given generator. 548,363 ( 0.01%) fn extend_with>(&mut self, n: usize, mut value: E) { . self.reserve(n); . . unsafe { 17,259 ( 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); . } . 664,397 ( 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 . } 435,321 ( 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) { 3,496 ( 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")] 110,999 ( 0.00%) pub fn from_elem(elem: T, n: usize) -> Vec { 708,696 ( 0.01%) ::from_elem(elem, n, Global) 142,563 ( 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] { 37,153,610 ( 0.44%) unsafe { slice::from_raw_parts(self.as_ptr(), self.len) } 239 ( 0.00%) } . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl ops::DerefMut for Vec { . fn deref_mut(&mut self) -> &mut [T] { 15,230,481 ( 0.18%) 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))] 1,340,365 ( 0.02%) fn clone(&self) -> Self { . let alloc = self.allocator().clone(); 2 ( 0.00%) <[T]>::to_vec_in(&**self, alloc) 1,788,331 ( 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 { 716,136 ( 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,412 ( 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 { 5,352,688 ( 0.06%) >::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 { 2,782,103 ( 0.03%) 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(); 1,811,843 ( 0.02%) 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> { 928 ( 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> { 1,192 ( 0.00%) self.iter_mut() . } . } . . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "rust1", since = "1.0.0")] . impl Extend for Vec { . #[inline] 14,216 ( 0.00%) fn extend>(&mut self, iter: I) { 3,155,216 ( 0.04%) >::spec_extend(self, iter.into_iter()) 14,216 ( 0.00%) } . . #[inline] . fn extend_one(&mut self, item: T) { 148 ( 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); . // } 643,159 ( 0.01%) while let Some(element) = iterator.next() { 225,076 ( 0.00%) let len = self.len(); 1,275,493 ( 0.02%) if len == self.capacity() { 914 ( 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 995,833 ( 0.01%) self.set_len(len + 1); . } . } 109,275 ( 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, . { 1,705 ( 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, . { 16,318 ( 0.00%) let old_len = self.len(); . . // Guard against us getting leaked (leak amplification) . unsafe { . self.set_len(0); . } . 110,168 ( 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 { 2,852,652 ( 0.03%) 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 1,098,599 ( 0.01%) ptr::drop_in_place(ptr::slice_from_raw_parts_mut(self.as_mut_ptr(), self.len)) . } . // RawVec handles deallocation 3,376,340 ( 0.04%) } . } . . #[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 ---------------------------------------- 9,361,550 ( 0.11%) -------------------------------------------------------------------------------- -- 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 { 77,867 ( 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> { 960,333 ( 0.01%) fn reverse(&mut self, undo: UndoLog<'tcx>) { 1,600,555 ( 0.02%) match undo { 1,973,840 ( 0.02%) UndoLog::TypeVariables(undo) => self.type_variable_storage.reverse(undo), 964 ( 0.00%) UndoLog::ConstUnificationTable(undo) => self.const_unification_storage.reverse(undo), 5,648 ( 0.00%) UndoLog::IntUnificationTable(undo) => self.int_unification_storage.reverse(undo), . UndoLog::FloatUnificationTable(undo) => self.float_unification_storage.reverse(undo), . UndoLog::RegionConstraintCollector(undo) => { 439,166 ( 0.01%) self.region_constraint_storage.as_mut().unwrap().reverse(undo) . } . UndoLog::RegionUnificationTable(undo) => { 104,692 ( 0.00%) self.region_constraint_storage.as_mut().unwrap().unification_table.reverse(undo) . } . UndoLog::ProjectionCache(undo) => self.projection_cache.reverse(undo), . UndoLog::PushRegionObligation => { . self.region_obligations.pop(); . } . } 1,280,444 ( 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 { 56,414 ( 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) { 450,842 ( 0.01%) if self.in_snapshot() { 622,936 ( 0.01%) 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> { 1,118,604 ( 0.01%) pub fn rollback_to(&mut self, snapshot: Snapshot<'tcx>) { . debug!("rollback_to({})", snapshot.undo_len); . self.undo_log.assert_open_snapshot(&snapshot); . 1,333,201 ( 0.02%) while self.undo_log.logs.len() > snapshot.undo_len { . let undo = self.undo_log.logs.pop().unwrap(); 3,841,332 ( 0.05%) self.reverse(undo); . } . 425,949 ( 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. 92,920 ( 0.00%) assert!(snapshot.undo_len == 0); . self.undo_log.logs.clear(); . } . 605,762 ( 0.01%) self.undo_log.num_open_snapshots -= 1; 1,305,038 ( 0.02%) } . . pub fn commit(&mut self, snapshot: Snapshot<'tcx>) { . debug!("commit({})", snapshot.undo_len); . 1,642,686 ( 0.02%) 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. 473,870 ( 0.01%) assert!(snapshot.undo_len == 0); . self.undo_log.logs.clear(); . } . 1,879,621 ( 0.02%) self.undo_log.num_open_snapshots -= 1; . } . } . . impl<'tcx> InferCtxtUndoLogs<'tcx> { . pub fn start_snapshot(&mut self) -> Snapshot<'tcx> { 2,935,984 ( 0.04%) 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 { 90,145 ( 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 { 455 ( 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. 559,302 ( 0.01%) assert!(self.logs.len() >= snapshot.undo_len); 559,302 ( 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 ---------------------------------------- 704,968 ( 0.01%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/region_constraints/mod.rs -------------------------------------------------------------------------------- Ir -- line 23 ---------------------------------------- . use std::collections::BTreeMap; . use std::ops::Range; . use std::{cmp, fmt, mem}; . . mod leak_check; . . pub use rustc_middle::infer::MemberConstraint; . 310,277 ( 0.00%) #[derive(Default)] . pub struct RegionConstraintStorage<'tcx> { . /// For each `RegionVid`, the corresponding `RegionVariableOrigin`. . var_infos: IndexVec, . . data: RegionConstraintData<'tcx>, . . /// For a given pair of regions (R1, R2), maps to a region R3 that . /// is designated as their LUB (edges R1 <= R3 and R2 <= R3 -- line 39 ---------------------------------------- -- line 64 ---------------------------------------- . storage: &'a mut RegionConstraintStorage<'tcx>, . undo_log: &'a mut InferCtxtUndoLogs<'tcx>, . } . . impl<'tcx> std::ops::Deref for RegionConstraintCollector<'_, 'tcx> { . type Target = RegionConstraintStorage<'tcx>; . #[inline] . fn deref(&self) -> &RegionConstraintStorage<'tcx> { 15,672 ( 0.00%) self.storage . } . } . . impl<'tcx> std::ops::DerefMut for RegionConstraintCollector<'_, 'tcx> { . #[inline] . fn deref_mut(&mut self) -> &mut RegionConstraintStorage<'tcx> { 121,828 ( 0.00%) self.storage . } . } . . pub type VarInfos = IndexVec; . . /// The full set of region constraints gathered up by the collector. . /// Describes constraints between the region variables and other . /// regions, as well as other conditions that must be verified, or . /// assumptions that can be made. 149,552 ( 0.00%) #[derive(Debug, Default, Clone)] . pub struct RegionConstraintData<'tcx> { . /// Constraints of the form `A <= B`, where either `A` or `B` can . /// be a region variable (or neither, as it happens). . pub constraints: BTreeMap, SubregionOrigin<'tcx>>, . . /// Constraints of the form `R0 member of [R1, ..., Rn]`, meaning that . /// `R0` must be equal to one of the regions `R1..Rn`. These occur . /// with `impl Trait` quite frequently. -- line 97 ---------------------------------------- -- line 122 ---------------------------------------- . /// This hashmap is used to avoid that naive scenario. Basically . /// we record the fact that `'a <= 'b` is implied by the fn . /// signature, and then ignore the constraint when solving . /// equations. This is a bit of a hack but seems to work. . pub givens: FxHashSet<(Region<'tcx>, ty::RegionVid)>, . } . . /// Represents a constraint that influences the inference process. 7,925,571 ( 0.09%) #[derive(Clone, Copy, PartialEq, Eq, Debug, PartialOrd, Ord)] . pub enum Constraint<'tcx> { . /// A region variable is a subregion of another. 1,162,352 ( 0.01%) VarSubVar(RegionVid, RegionVid), . . /// A concrete region is a subregion of region variable. 1,178,825 ( 0.01%) RegSubVar(Region<'tcx>, RegionVid), . . /// A region variable is a subregion of a concrete region. This does not . /// directly affect inference, but instead is checked after . /// inference is complete. 535,183 ( 0.01%) VarSubReg(RegionVid, Region<'tcx>), . . /// A constraint where neither side is a variable. This does not . /// directly affect inference, but instead is checked after . /// inference is complete. 8,120 ( 0.00%) RegSubReg(Region<'tcx>, Region<'tcx>), . } . . impl Constraint<'_> { . pub fn involves_placeholders(&self) -> bool { 16,641 ( 0.00%) match self { . Constraint::VarSubVar(_, _) => false, . Constraint::VarSubReg(_, r) | Constraint::RegSubVar(r, _) => r.is_placeholder(), . Constraint::RegSubReg(r, s) => r.is_placeholder() || s.is_placeholder(), . } . } . } . . #[derive(Debug, Clone)] -- line 159 ---------------------------------------- -- line 263 ---------------------------------------- . /// In other words, if we meet *all* bounds in `B`, that suffices. . /// This is used when *some* bound in `B` is known to suffice, but . /// we don't know which. . AllBounds(Vec>), . } . . #[derive(Copy, Clone, PartialEq, Eq, Hash)] . pub(crate) struct TwoRegions<'tcx> { 31 ( 0.00%) a: Region<'tcx>, 35 ( 0.00%) b: Region<'tcx>, . } . . #[derive(Copy, Clone, PartialEq)] . pub(crate) enum UndoLog<'tcx> { . /// We added `RegionVid`. . AddVar(RegionVid), . . /// We added the given `constraint`. -- line 280 ---------------------------------------- -- line 304 ---------------------------------------- . pub universe: ty::UniverseIndex, . } . . pub struct RegionSnapshot { . any_unifications: bool, . } . . impl<'tcx> RegionConstraintStorage<'tcx> { 56,414 ( 0.00%) pub fn new() -> Self { . Self::default() 56,414 ( 0.00%) } . . #[inline] . pub(crate) fn with_log<'a>( . &'a mut self, . undo_log: &'a mut InferCtxtUndoLogs<'tcx>, . ) -> RegionConstraintCollector<'a, 'tcx> { . RegionConstraintCollector { storage: self, undo_log } . } . . fn rollback_undo_entry(&mut self, undo_entry: UndoLog<'tcx>) { 313,690 ( 0.00%) match undo_entry { . AddVar(vid) => { . self.var_infos.pop().unwrap(); 107,992 ( 0.00%) assert_eq!(self.var_infos.len(), vid.index() as usize); . } 35,740 ( 0.00%) AddConstraint(ref constraint) => { 142,960 ( 0.00%) self.data.constraints.remove(constraint); . } . AddVerify(index) => { . self.data.verifys.pop(); . assert_eq!(self.data.verifys.len(), index); . } . AddGiven(sub, sup) => { . self.data.givens.remove(&(sub, sup)); . } -- line 339 ---------------------------------------- -- line 348 ---------------------------------------- . } . . impl<'tcx> RegionConstraintCollector<'_, 'tcx> { . pub fn num_region_vars(&self) -> usize { . self.var_infos.len() . } . . pub fn region_constraint_data(&self) -> &RegionConstraintData<'tcx> { 8,384 ( 0.00%) &self.data 8,384 ( 0.00%) } . . /// Once all the constraints have been gathered, extract out the final data. . /// . /// Not legal during a snapshot. . pub fn into_infos_and_data(self) -> (VarInfos, RegionConstraintData<'tcx>) { 9,170 ( 0.00%) assert!(!UndoLogs::>::in_snapshot(&self.undo_log)); . (mem::take(&mut self.storage.var_infos), mem::take(&mut self.storage.data)) . } . . /// Takes (and clears) the current set of constraints. Note that . /// the set of variables remains intact, but all relationships . /// between them are reset. This is used during NLL checking to . /// grab the set of constraints that arose from a particular . /// operation. . /// . /// We don't want to leak relationships between variables between . /// points because just because (say) `r1 == r2` was true at some . /// point P in the graph doesn't imply that it will be true at . /// some other point Q, in NLL. . /// . /// Not legal during a snapshot. 66 ( 0.00%) pub fn take_and_reset_data(&mut self) -> RegionConstraintData<'tcx> { 11 ( 0.00%) assert!(!UndoLogs::>::in_snapshot(&self.undo_log)); . . // If you add a new field to `RegionConstraintCollector`, you . // should think carefully about whether it needs to be cleared . // or updated in some way. . let RegionConstraintStorage { . var_infos: _, 11 ( 0.00%) data, . lubs, . glbs, . unification_table: _, . any_unifications, . } = self.storage; . . // Clear the tables of (lubs, glbs), so that we will create . // fresh regions if we do a LUB operation. As it happens, -- line 395 ---------------------------------------- -- line 399 ---------------------------------------- . glbs.clear(); . . let data = mem::take(data); . . // Clear all unifications and recreate the variables a "now . // un-unified" state. Note that when we unify `a` and `b`, we . // also insert `a <= b` and a `b <= a` edges, so the . // `RegionConstraintData` contains the relationship here. 22 ( 0.00%) if *any_unifications { 8 ( 0.00%) *any_unifications = false; 24 ( 0.00%) self.unification_table().reset_unifications(|_| UnifiedRegion(None)); . } . . data 88 ( 0.00%) } . . pub fn data(&self) -> &RegionConstraintData<'tcx> { . &self.data . } . . pub fn start_snapshot(&mut self) -> RegionSnapshot { . debug!("RegionConstraintCollector: start_snapshot"); . RegionSnapshot { any_unifications: self.any_unifications } . } . . pub fn rollback_to(&mut self, snapshot: RegionSnapshot) { . debug!("RegionConstraintCollector: rollback_to({:?})", snapshot); 186,434 ( 0.00%) self.any_unifications = snapshot.any_unifications; . } . 730,968 ( 0.01%) pub fn new_region_var( . &mut self, . universe: ty::UniverseIndex, . origin: RegionVariableOrigin, . ) -> RegionVid { 121,828 ( 0.00%) let vid = self.var_infos.push(RegionVariableInfo { origin, universe }); . 365,484 ( 0.00%) let u_vid = self.unification_table().new_key(UnifiedRegion(None)); 121,828 ( 0.00%) assert_eq!(vid, u_vid.vid); . self.undo_log.push(AddVar(vid)); . debug!("created new region variable {:?} in {:?} with origin {:?}", vid, universe, origin); . vid 974,624 ( 0.01%) } . . /// Returns the universe for the given variable. . pub fn var_universe(&self, vid: RegionVid) -> ty::UniverseIndex { 136,905 ( 0.00%) self.var_infos[vid].universe . } . . /// Returns the origin for the given variable. . pub fn var_origin(&self, vid: RegionVid) -> RegionVariableOrigin { . self.var_infos[vid].origin . } . . fn add_constraint(&mut self, constraint: Constraint<'tcx>, origin: SubregionOrigin<'tcx>) { . // cannot add constraints once regions are resolved . debug!("RegionConstraintCollector: add_constraint({:?})", constraint); . . // never overwrite an existing (constraint, origin) - only insert one if it isn't . // present in the map yet. This prevents origins from outside the snapshot being . // replaced with "less informative" origins e.g., during calls to `can_eq` . let undo_log = &mut self.undo_log; 898,294 ( 0.01%) self.storage.data.constraints.entry(constraint).or_insert_with(|| { 496,008 ( 0.01%) undo_log.push(AddConstraint(constraint)); 330,672 ( 0.00%) origin . }); . } . . fn add_verify(&mut self, verify: Verify<'tcx>) { . // cannot add verifys once regions are resolved . debug!("RegionConstraintCollector: add_verify({:?})", verify); . . // skip no-op cases known to be satisfied 5,244 ( 0.00%) if let VerifyBound::AllBounds(ref bs) = verify.bound { . if bs.is_empty() { . return; . } . } . 2,622 ( 0.00%) let index = self.data.verifys.len(); 39,330 ( 0.00%) self.data.verifys.push(verify); 2,622 ( 0.00%) self.undo_log.push(AddVerify(index)); . } . . pub fn add_given(&mut self, sub: Region<'tcx>, sup: ty::RegionVid) { . // cannot add givens once regions are resolved . if self.data.givens.insert((sub, sup)) { . debug!("add_given({:?} <= {:?})", sub, sup); . . self.undo_log.push(AddGiven(sub, sup)); . } . } . 414,640 ( 0.00%) pub fn make_eqregion( . &mut self, . origin: SubregionOrigin<'tcx>, . sub: Region<'tcx>, . sup: Region<'tcx>, . ) { 207,320 ( 0.00%) if sub != sup { . // Eventually, it would be nice to add direct support for . // equating regions. 249,048 ( 0.00%) self.make_subregion(origin.clone(), sub, sup); 280,179 ( 0.00%) self.make_subregion(origin, sup, sub); . 155,756 ( 0.00%) match (sub, sup) { 58,122 ( 0.00%) (&ty::ReVar(sub), &ty::ReVar(sup)) => { . debug!("make_eqregion: unifying {:?} with {:?}", sub, sup); 96,870 ( 0.00%) self.unification_table().union(sub, sup); . self.any_unifications = true; . } . (&ty::ReVar(vid), value) | (value, &ty::ReVar(vid)) => { . debug!("make_eqregion: unifying {:?} with {:?}", vid, value); 46,624 ( 0.00%) self.unification_table().union_value(vid, UnifiedRegion(Some(value))); . self.any_unifications = true; . } . (_, _) => {} . } . } 217,917 ( 0.00%) } . 70 ( 0.00%) pub fn member_constraint( . &mut self, . opaque_type_def_id: DefId, . definition_span: Span, . hidden_ty: Ty<'tcx>, . member_region: ty::Region<'tcx>, . choice_regions: &Lrc>>, . ) { . debug!("member_constraint({:?} in {:#?})", member_region, choice_regions); . 5 ( 0.00%) if choice_regions.iter().any(|&r| r == member_region) { . return; . } . 45 ( 0.00%) self.data.member_constraints.push(MemberConstraint { . opaque_type_def_id, . definition_span, . hidden_ty, . member_region, . choice_regions: choice_regions.clone(), . }); 40 ( 0.00%) } . 1,247,968 ( 0.01%) #[instrument(skip(self, origin), level = "debug")] . pub fn make_subregion( . &mut self, . origin: SubregionOrigin<'tcx>, . sub: Region<'tcx>, . sup: Region<'tcx>, . ) { . // cannot add constraints once regions are resolved . debug!("origin = {:#?}", origin); . 920,276 ( 0.01%) match (sub, sup) { . (&ReLateBound(..), _) | (_, &ReLateBound(..)) => { . span_bug!(origin.span(), "cannot relate bound region: {:?} <= {:?}", sub, sup); . } . (_, &ReStatic) => { . // all regions are subregions of static, so we can ignore this . } 56,468 ( 0.00%) (&ReVar(sub_id), &ReVar(sup_id)) => { 395,276 ( 0.00%) self.add_constraint(Constraint::VarSubVar(sub_id, sup_id), origin); . } . (_, &ReVar(sup_id)) => { 99,561 ( 0.00%) self.add_constraint(Constraint::RegSubVar(sub, sup_id), origin); . } 15,011 ( 0.00%) (&ReVar(sub_id), _) => { 105,077 ( 0.00%) self.add_constraint(Constraint::VarSubReg(sub_id, sup), origin); . } . _ => { 12,285 ( 0.00%) self.add_constraint(Constraint::RegSubReg(sub, sup), origin); . } . } . } . 13,110 ( 0.00%) pub fn verify_generic_bound( . &mut self, . origin: SubregionOrigin<'tcx>, . kind: GenericKind<'tcx>, . sub: Region<'tcx>, . bound: VerifyBound<'tcx>, . ) { 34,086 ( 0.00%) self.add_verify(Verify { kind, origin, region: sub, bound }); 13,110 ( 0.00%) } . . pub fn lub_regions( . &mut self, . tcx: TyCtxt<'tcx>, . origin: SubregionOrigin<'tcx>, . a: Region<'tcx>, . b: Region<'tcx>, . ) -> Region<'tcx> { -- line 591 ---------------------------------------- -- line 599 ---------------------------------------- . _ if a == b => { . a // LUB(a,a) = a . } . . _ => self.combine_vars(tcx, Lub, a, b, origin), . } . } . 1,200 ( 0.00%) pub fn glb_regions( . &mut self, . tcx: TyCtxt<'tcx>, . origin: SubregionOrigin<'tcx>, . a: Region<'tcx>, . b: Region<'tcx>, . ) -> Region<'tcx> { . // cannot add constraints once regions are resolved . debug!("RegionConstraintCollector: glb_regions({:?}, {:?})", a, b); 600 ( 0.00%) match (a, b) { . (&ReStatic, r) | (r, &ReStatic) => { . r // static lives longer than everything else . } . 254 ( 0.00%) _ if a == b => { . a // GLB(a,a) = a . } . 1,524 ( 0.00%) _ => self.combine_vars(tcx, Glb, a, b, origin), . } 1,200 ( 0.00%) } . . /// Resolves the passed RegionVid to the root RegionVid in the unification table . pub fn opportunistic_resolve_var(&mut self, rid: ty::RegionVid) -> ty::RegionVid { 133,630 ( 0.00%) self.unification_table().find(rid).vid . } . . /// If the Region is a `ReVar`, then resolves it either to the root value in . /// the unification table, if it exists, or to the root `ReVar` in the table. . /// If the Region is not a `ReVar`, just returns the Region itself. . pub fn opportunistic_resolve_region( . &mut self, . tcx: TyCtxt<'tcx>, -- line 639 ---------------------------------------- -- line 647 ---------------------------------------- . tcx.reuse_or_mk_region(region, ty::ReVar(root)) . }) . } . _ => region, . } . } . . fn combine_map(&mut self, t: CombineMapType) -> &mut CombineMap<'tcx> { 1,016 ( 0.00%) match t { . Glb => &mut self.glbs, . Lub => &mut self.lubs, . } . } . 1,524 ( 0.00%) fn combine_vars( . &mut self, . tcx: TyCtxt<'tcx>, . t: CombineMapType, . a: Region<'tcx>, . b: Region<'tcx>, . origin: SubregionOrigin<'tcx>, . ) -> Region<'tcx> { . let vars = TwoRegions { a, b }; 1 ( 0.00%) if let Some(&c) = self.combine_map(t).get(&vars) { 6 ( 0.00%) return tcx.mk_region(ReVar(c)); . } . let a_universe = self.universe(a); . let b_universe = self.universe(b); . let c_universe = cmp::max(a_universe, b_universe); 630 ( 0.00%) let c = self.new_region_var(c_universe, MiscVariable(origin.span())); . self.combine_map(t).insert(vars, c); 126 ( 0.00%) self.undo_log.push(AddCombination(t, vars)); 630 ( 0.00%) let new_r = tcx.mk_region(ReVar(c)); 1,008 ( 0.00%) for old_r in [a, b] { 252 ( 0.00%) match t { 2,142 ( 0.00%) Glb => self.make_subregion(origin.clone(), new_r, old_r), . Lub => self.make_subregion(origin.clone(), old_r, new_r), . } . } . debug!("combine_vars() c={:?}", c); . new_r 1,143 ( 0.00%) } . . pub fn universe(&self, region: Region<'tcx>) -> ty::UniverseIndex { 386,664 ( 0.00%) match *region { . ty::ReStatic | ty::ReErased | ty::ReFree(..) | ty::ReEarlyBound(..) => { . ty::UniverseIndex::ROOT . } . ty::ReEmpty(ui) => ui, . ty::RePlaceholder(placeholder) => placeholder.universe, 28,572 ( 0.00%) ty::ReVar(vid) => self.var_universe(vid), . ty::ReLateBound(..) => bug!("universe(): encountered bound region {:?}", region), . } . } . 22,110 ( 0.00%) pub fn vars_since_snapshot( . &self, . value_count: usize, . ) -> (Range, Vec) { . let range = RegionVid::from(value_count)..RegionVid::from(self.unification_table.len()); 26,532 ( 0.00%) ( . range.clone(), . (range.start.index()..range.end.index()) . .map(|index| self.var_infos[ty::RegionVid::from(index)].origin) . .collect(), . ) 26,532 ( 0.00%) } . . /// See `InferCtxt::region_constraints_added_in_snapshot`. 96,411 ( 0.00%) pub fn region_constraints_added_in_snapshot(&self, mark: &Snapshot<'tcx>) -> Option { 32,137 ( 0.00%) self.undo_log . .region_constraints_in_snapshot(mark) 19,680 ( 0.00%) .map(|&elt| match elt { 6,122 ( 0.00%) AddConstraint(constraint) => Some(constraint.involves_placeholders()), . _ => None, . }) . .max() . .unwrap_or(None) 128,548 ( 0.00%) } . . #[inline] . fn unification_table(&mut self) -> super::UnificationTable<'_, 'tcx, RegionVidKey<'tcx>> { 372,539 ( 0.00%) ut::UnificationTable::with_log(&mut self.storage.unification_table, self.undo_log) . } . } . . impl fmt::Debug for RegionSnapshot { . fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { . write!(f, "RegionSnapshot") . } . } -- line 737 ---------------------------------------- -- line 750 ---------------------------------------- . match *self { . GenericKind::Param(ref p) => write!(f, "{}", p), . GenericKind::Projection(ref p) => write!(f, "{}", p), . } . } . } . . impl<'tcx> GenericKind<'tcx> { 1,784 ( 0.00%) pub fn to_ty(&self, tcx: TyCtxt<'tcx>) -> Ty<'tcx> { 83,374 ( 0.00%) match *self { 3,397 ( 0.00%) GenericKind::Param(ref p) => p.to_ty(tcx), 117 ( 0.00%) GenericKind::Projection(ref p) => tcx.mk_projection(p.item_def_id, p.substs), . } 1,784 ( 0.00%) } . } . . impl<'tcx> VerifyBound<'tcx> { 8,676 ( 0.00%) pub fn must_hold(&self) -> bool { 12,368 ( 0.00%) match self { . VerifyBound::IfEq(..) => false, . VerifyBound::OutlivedBy(ty::ReStatic) => true, . VerifyBound::OutlivedBy(_) => false, . VerifyBound::IsEmpty => false, 2,279 ( 0.00%) VerifyBound::AnyBound(bs) => bs.iter().any(|b| b.must_hold()), 90 ( 0.00%) VerifyBound::AllBounds(bs) => bs.iter().all(|b| b.must_hold()), . } 10,122 ( 0.00%) } . 3,650 ( 0.00%) pub fn cannot_hold(&self) -> bool { 5,208 ( 0.00%) match self { . VerifyBound::IfEq(_, b) => b.cannot_hold(), . VerifyBound::IsEmpty => false, . VerifyBound::OutlivedBy(_) => false, 632 ( 0.00%) VerifyBound::AnyBound(bs) => bs.iter().all(|b| b.cannot_hold()), 630 ( 0.00%) VerifyBound::AllBounds(bs) => bs.iter().any(|b| b.cannot_hold()), . } 5,110 ( 0.00%) } . 702 ( 0.00%) pub fn or(self, vb: VerifyBound<'tcx>) -> VerifyBound<'tcx> { 936 ( 0.00%) if self.must_hold() || vb.cannot_hold() { . self 904 ( 0.00%) } else if self.cannot_hold() || vb.must_hold() { 32 ( 0.00%) vb . } else { 1,417 ( 0.00%) VerifyBound::AnyBound(vec![self, vb]) . } 609 ( 0.00%) } . } . . impl<'tcx> RegionConstraintData<'tcx> { . /// Returns `true` if this region constraint data contains no constraints, and `false` . /// otherwise. . pub fn is_empty(&self) -> bool { . let RegionConstraintData { constraints, member_constraints, verifys, givens } = self; 3,474 ( 0.00%) constraints.is_empty() . && member_constraints.is_empty() . && verifys.is_empty() . && givens.is_empty() . } . } . . impl<'tcx> Rollback> for RegionConstraintStorage<'tcx> { 313,690 ( 0.00%) fn reverse(&mut self, undo: UndoLog<'tcx>) { 250,952 ( 0.00%) self.rollback_undo_entry(undo) 313,690 ( 0.00%) } . } 3,754,539 ( 0.04%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/combine.rs -------------------------------------------------------------------------------- Ir -- line 56 ---------------------------------------- . #[derive(Copy, Clone, Debug)] . pub enum RelationDir { . SubtypeOf, . SupertypeOf, . EqTo, . } . . impl<'infcx, 'tcx> InferCtxt<'infcx, 'tcx> { 1,155,636 ( 0.01%) pub fn super_combine_tys( . &self, . relation: &mut R, . a: Ty<'tcx>, . b: Ty<'tcx>, . ) -> RelateResult<'tcx, Ty<'tcx>> . where . R: TypeRelation<'tcx>, . { . let a_is_expected = relation.a_is_expected(); . 1,085,165 ( 0.01%) match (a.kind(), b.kind()) { . // Relate integral variables to other types 364 ( 0.00%) (&ty::Infer(ty::IntVar(a_id)), &ty::Infer(ty::IntVar(b_id))) => { 2,002 ( 0.00%) self.inner . .borrow_mut() . .int_unification_table() . .unify_var_var(a_id, b_id) . .map_err(|e| int_unification_error(a_is_expected, e))?; . Ok(a) . } 1,382 ( 0.00%) (&ty::Infer(ty::IntVar(v_id)), &ty::Int(v)) => { 2,764 ( 0.00%) self.unify_integral_variable(a_is_expected, v_id, IntType(v)) . } . (&ty::Int(v), &ty::Infer(ty::IntVar(v_id))) => { . self.unify_integral_variable(!a_is_expected, v_id, IntType(v)) . } 1,718 ( 0.00%) (&ty::Infer(ty::IntVar(v_id)), &ty::Uint(v)) => { 3,436 ( 0.00%) self.unify_integral_variable(a_is_expected, v_id, UintType(v)) . } 5 ( 0.00%) (&ty::Uint(v), &ty::Infer(ty::IntVar(v_id))) => { 10 ( 0.00%) self.unify_integral_variable(!a_is_expected, v_id, UintType(v)) . } . . // Relate floating-point variables to other types . (&ty::Infer(ty::FloatVar(a_id)), &ty::Infer(ty::FloatVar(b_id))) => { . self.inner . .borrow_mut() . .float_unification_table() . .unify_var_var(a_id, b_id) -- line 103 ---------------------------------------- -- line 108 ---------------------------------------- . self.unify_float_variable(a_is_expected, v_id, v) . } . (&ty::Float(v), &ty::Infer(ty::FloatVar(v_id))) => { . self.unify_float_variable(!a_is_expected, v_id, v) . } . . // All other cases of inference are errors . (&ty::Infer(_), _) | (_, &ty::Infer(_)) => { 40,730 ( 0.00%) Err(TypeError::Sorts(ty::relate::expected_found(relation, a, b))) . } . 949,554 ( 0.01%) _ => ty::relate::super_relate_tys(relation, a, b), . } 1,155,636 ( 0.01%) } . 20,532 ( 0.00%) pub fn super_combine_consts( . &self, . relation: &mut R, . a: &'tcx ty::Const<'tcx>, . b: &'tcx ty::Const<'tcx>, . ) -> RelateResult<'tcx, &'tcx ty::Const<'tcx>> . where . R: ConstEquateRelation<'tcx>, . { . debug!("{}.consts({:?}, {:?})", relation.tag(), a, b); 14,390 ( 0.00%) if a == b { . return Ok(a); . } . 4,836 ( 0.00%) let a = replace_if_possible(&mut self.inner.borrow_mut().const_unification_table(), a); 4,836 ( 0.00%) let b = replace_if_possible(&mut self.inner.borrow_mut().const_unification_table(), b); . . let a_is_expected = relation.a_is_expected(); . 22,456 ( 0.00%) match (a.val, b.val) { . ( . ty::ConstKind::Infer(InferConst::Var(a_vid)), . ty::ConstKind::Infer(InferConst::Var(b_vid)), . ) => { . self.inner . .borrow_mut() . .const_unification_table() . .unify_var_var(a_vid, b_vid) -- line 150 ---------------------------------------- -- line 158 ---------------------------------------- . bug!("tried to combine ConstKind::Infer/ConstKind::Infer(InferConst::Var)") . } . . (ty::ConstKind::Infer(InferConst::Var(vid)), _) => { . return self.unify_const_variable(relation.param_env(), vid, b, a_is_expected); . } . . (_, ty::ConstKind::Infer(InferConst::Var(vid))) => { 140 ( 0.00%) return self.unify_const_variable(relation.param_env(), vid, a, !a_is_expected); . } . (ty::ConstKind::Unevaluated(..), _) if self.tcx.lazy_normalization() => { . // FIXME(#59490): Need to remove the leak check to accommodate . // escaping bound variables here. . if !a.has_escaping_bound_vars() && !b.has_escaping_bound_vars() { . relation.const_equate_obligation(a, b); . } . return Ok(b); -- line 174 ---------------------------------------- -- line 179 ---------------------------------------- . if !a.has_escaping_bound_vars() && !b.has_escaping_bound_vars() { . relation.const_equate_obligation(a, b); . } . return Ok(a); . } . _ => {} . } . 7,920 ( 0.00%) ty::relate::super_relate_consts(relation, a, b) 15,399 ( 0.00%) } . . /// Unifies the const variable `target_vid` with the given constant. . /// . /// This also tests if the given const `ct` contains an inference variable which was previously . /// unioned with `target_vid`. If this is the case, inferring `target_vid` to `ct` . /// would result in an infinite type as we continuously replace an inference variable . /// in `ct` with `ct` itself. . /// -- line 196 ---------------------------------------- -- line 216 ---------------------------------------- . /// of `fn bind` (meaning that its substs contain `N`). . /// . /// `bind(arr)` now infers that the type of `arr` must be `[u8; N]`. . /// The assignment `arr = bind(arr)` now tries to equate `N` with `3 + 4`. . /// . /// As `3 + 4` contains `N` in its substs, this must not succeed. . /// . /// See `src/test/ui/const-generics/occurs-check/` for more examples where this is relevant. 532 ( 0.00%) #[instrument(level = "debug", skip(self))] . fn unify_const_variable( . &self, . param_env: ty::ParamEnv<'tcx>, . target_vid: ty::ConstVid<'tcx>, . ct: &'tcx ty::Const<'tcx>, . vid_is_expected: bool, . ) -> RelateResult<'tcx, &'tcx ty::Const<'tcx>> { . let (for_universe, span) = { . let mut inner = self.inner.borrow_mut(); 112 ( 0.00%) let variable_table = &mut inner.const_unification_table(); 56 ( 0.00%) let var_value = variable_table.probe_value(target_vid); 56 ( 0.00%) match var_value.val { . ConstVariableValue::Known { value } => { . bug!("instantiating {:?} which has a known value {:?}", target_vid, value) . } . ConstVariableValue::Unknown { universe } => (universe, var_value.origin.span), . } . }; 224 ( 0.00%) let value = ConstInferUnifier { infcx: self, span, param_env, for_universe, target_vid } . .relate(ct, ct)?; . 112 ( 0.00%) self.inner . .borrow_mut() . .const_unification_table() . .unify_var_value( . target_vid, 168 ( 0.00%) ConstVarValue { . origin: ConstVariableOrigin { . kind: ConstVariableOriginKind::ConstInference, . span: DUMMY_SP, . }, . val: ConstVariableValue::Known { value }, . }, . ) . .map(|()| value) . .map_err(|e| const_unification_error(vid_is_expected, e)) . } . 18,630 ( 0.00%) fn unify_integral_variable( . &self, . vid_is_expected: bool, . vid: ty::IntVid, . val: ty::IntVarValue, . ) -> RelateResult<'tcx, Ty<'tcx>> { 24,840 ( 0.00%) self.inner . .borrow_mut() . .int_unification_table() . .unify_var_value(vid, Some(val)) . .map_err(|e| int_unification_error(vid_is_expected, e))?; 6,210 ( 0.00%) match val { 1,382 ( 0.00%) IntType(v) => Ok(self.tcx.mk_mach_int(v)), 6,551 ( 0.00%) UintType(v) => Ok(self.tcx.mk_mach_uint(v)), . } 24,840 ( 0.00%) } . . fn unify_float_variable( . &self, . vid_is_expected: bool, . vid: ty::FloatVid, . val: ty::FloatTy, . ) -> RelateResult<'tcx, Ty<'tcx>> { . self.inner -- line 286 ---------------------------------------- -- line 289 ---------------------------------------- . .unify_var_value(vid, Some(ty::FloatVarValue(val))) . .map_err(|e| float_unification_error(vid_is_expected, e))?; . Ok(self.tcx.mk_mach_float(val)) . } . } . . impl<'infcx, 'tcx> CombineFields<'infcx, 'tcx> { . pub fn tcx(&self) -> TyCtxt<'tcx> { 198,850 ( 0.00%) self.infcx.tcx . } . . pub fn equate<'a>(&'a mut self, a_is_expected: bool) -> Equate<'a, 'infcx, 'tcx> { . Equate::new(self, a_is_expected) . } . 487,772 ( 0.01%) pub fn sub<'a>(&'a mut self, a_is_expected: bool) -> Sub<'a, 'infcx, 'tcx> { . Sub::new(self, a_is_expected) 243,886 ( 0.00%) } . . pub fn lub<'a>(&'a mut self, a_is_expected: bool) -> Lub<'a, 'infcx, 'tcx> { . Lub::new(self, a_is_expected) . } . 552,454 ( 0.01%) pub fn glb<'a>(&'a mut self, a_is_expected: bool) -> Glb<'a, 'infcx, 'tcx> { . Glb::new(self, a_is_expected) 276,227 ( 0.00%) } . . /// Here, `dir` is either `EqTo`, `SubtypeOf`, or `SupertypeOf`. . /// The idea is that we should ensure that the type `a_ty` is equal . /// to, a subtype of, or a supertype of (respectively) the type . /// to which `b_vid` is bound. . /// . /// Since `b_vid` has not yet been instantiated with a type, we . /// will first instantiate `b_vid` with a *generalized* version . /// of `a_ty`. Generalization introduces other inference . /// variables wherever subtyping could occur. 1,568,325 ( 0.02%) pub fn instantiate( . &mut self, . a_ty: Ty<'tcx>, . dir: RelationDir, . b_vid: ty::TyVid, . a_is_expected: bool, . ) -> RelateResult<'tcx, ()> { . use self::RelationDir::*; . -- line 333 ---------------------------------------- -- line 342 ---------------------------------------- . // - `a_ty == &'x ?1`, where `'x` is some free region and `?1` is an . // inference variable, . // - and `dir` == `SubtypeOf`. . // . // Then the generalized form `b_ty` would be `&'?2 ?3`, where . // `'?2` and `?3` are fresh region/type inference . // variables. (Down below, we will relate `a_ty <: b_ty`, . // adding constraints like `'x: '?2` and `?1 <: ?3`.) 142,575 ( 0.00%) let Generalization { ty: b_ty, needs_wf } = self.generalize(a_ty, b_vid, dir)?; . debug!( . "instantiate(a_ty={:?}, dir={:?}, b_vid={:?}, generalized b_ty={:?})", . a_ty, dir, b_vid, b_ty . ); 998,025 ( 0.01%) self.infcx.inner.borrow_mut().type_variables().instantiate(b_vid, b_ty); . 142,575 ( 0.00%) if needs_wf { . self.obligations.push(Obligation::new( . self.trace.cause.clone(), . self.param_env, . ty::Binder::dummy(ty::PredicateKind::WellFormed(b_ty.into())) . .to_predicate(self.infcx.tcx), . )); . } . . // Finally, relate `b_ty` to `a_ty`, as described in previous comment. . // . // FIXME(#16847): This code is non-ideal because all these subtype . // relations wind up attributed to the same spans. We need . // to associate causes/spans with each of the relations in . // the stack to get this right. 552,250 ( 0.01%) match dir { 607,780 ( 0.01%) EqTo => self.equate(a_is_expected).relate(a_ty, b_ty), 45,125 ( 0.00%) SubtypeOf => self.sub(a_is_expected).relate(a_ty, b_ty), 23,988 ( 0.00%) SupertypeOf => self.sub(a_is_expected).relate_with_variance( . ty::Contravariant, . ty::VarianceDiagInfo::default(), . a_ty, . b_ty, . ), . }?; . 142,575 ( 0.00%) Ok(()) 1,140,600 ( 0.01%) } . . /// Attempts to generalize `ty` for the type variable `for_vid`. . /// This checks for cycle -- that is, whether the type `ty` . /// references `for_vid`. The `dir` is the "direction" for which we . /// a performing the generalization (i.e., are we producing a type . /// that can be used as a supertype etc). . /// . /// Preconditions: -- line 392 ---------------------------------------- -- line 401 ---------------------------------------- . debug!("generalize(ty={:?}, for_vid={:?}, dir={:?}", ty, for_vid, dir); . // Determine the ambient variance within which `ty` appears. . // The surrounding equation is: . // . // ty [op] ty2 . // . // where `op` is either `==`, `<:`, or `:>`. This maps quite . // naturally. 570,300 ( 0.01%) let ambient_variance = match dir { . RelationDir::EqTo => ty::Invariant, . RelationDir::SubtypeOf => ty::Covariant, . RelationDir::SupertypeOf => ty::Contravariant, . }; . . debug!("generalize: ambient_variance = {:?}", ambient_variance); . 1,425,750 ( 0.02%) let for_universe = match self.infcx.inner.borrow_mut().type_variables().probe(for_vid) { . v @ TypeVariableValue::Known { .. } => { . bug!("instantiating {:?} which has a known value {:?}", for_vid, v,) . } . TypeVariableValue::Unknown { universe } => universe, . }; . . debug!("generalize: for_universe = {:?}", for_universe); . debug!("generalize: trace = {:?}", self.trace); . 1,425,750 ( 0.02%) let mut generalize = Generalizer { . infcx: self.infcx, . cause: &self.trace.cause, . for_vid_sub_root: self.infcx.inner.borrow_mut().type_variables().sub_root_var(for_vid), . for_universe, . ambient_variance, . needs_wf: false, . root_ty: ty, 142,575 ( 0.00%) param_env: self.param_env, . cache: SsoHashMap::new(), . }; . 285,150 ( 0.00%) let ty = match generalize.relate(ty, ty) { 142,575 ( 0.00%) Ok(ty) => ty, . Err(e) => { . debug!("generalize: failure {:?}", e); . return Err(e); . } . }; 142,575 ( 0.00%) let needs_wf = generalize.needs_wf; . debug!("generalize: success {{ {:?}, {:?} }}", ty, needs_wf); . Ok(Generalization { ty, needs_wf }) . } . . pub fn add_const_equate_obligation( . &mut self, . a_is_expected: bool, . a: &'tcx ty::Const<'tcx>, -- line 454 ---------------------------------------- -- line 528 ---------------------------------------- . /// will force the calling code to check that `WF(Foo)` . /// holds, which in turn implies that `?C::Item == ?D`. So once . /// `?C` is constrained, that should suffice to restrict `?D`. . needs_wf: bool, . } . . impl<'tcx> TypeRelation<'tcx> for Generalizer<'_, 'tcx> { . fn tcx(&self) -> TyCtxt<'tcx> { 370,212 ( 0.00%) self.infcx.tcx . } . fn param_env(&self) -> ty::ParamEnv<'tcx> { 1,015 ( 0.00%) self.param_env . } . . fn tag(&self) -> &'static str { . "Generalizer" . } . . fn a_is_expected(&self) -> bool { . true . } . 89,296 ( 0.00%) fn binders( . &mut self, . a: ty::Binder<'tcx, T>, . b: ty::Binder<'tcx, T>, . ) -> RelateResult<'tcx, ty::Binder<'tcx, T>> . where . T: Relate<'tcx>, . { 157,281 ( 0.00%) Ok(a.rebind(self.relate(a.skip_binder(), b.skip_binder())?)) 89,296 ( 0.00%) } . 1,116,192 ( 0.01%) fn relate_item_substs( . &mut self, . item_def_id: DefId, . a_subst: SubstsRef<'tcx>, . b_subst: SubstsRef<'tcx>, . ) -> RelateResult<'tcx, SubstsRef<'tcx>> { 101,472 ( 0.00%) if self.ambient_variance == ty::Variance::Invariant { . // Avoid fetching the variance if we are in an invariant . // context; no need, and it can induce dependency cycles . // (e.g., #41849). 82,043 ( 0.00%) relate::relate_substs(self, None, a_subst, b_subst) . } else { . let tcx = self.tcx(); . let opt_variances = tcx.variances_of(item_def_id); 97,145 ( 0.00%) relate::relate_substs(self, Some((item_def_id, &opt_variances)), a_subst, b_subst) . } 913,248 ( 0.01%) } . 400,662 ( 0.00%) fn relate_with_variance>( . &mut self, . variance: ty::Variance, . _info: ty::VarianceDiagInfo<'tcx>, . a: T, . b: T, . ) -> RelateResult<'tcx, T> { 72 ( 0.00%) let old_ambient_variance = self.ambient_variance; 2,021,144 ( 0.02%) self.ambient_variance = self.ambient_variance.xform(variance); . . let result = self.relate(a, b); 368,050 ( 0.00%) self.ambient_variance = old_ambient_variance; . result 311,626 ( 0.00%) } . 4,634,118 ( 0.06%) fn tys(&mut self, t: Ty<'tcx>, t2: Ty<'tcx>) -> RelateResult<'tcx, Ty<'tcx>> { 514,902 ( 0.01%) assert_eq!(t, t2); // we are abusing TypeRelation here; both LHS and RHS ought to be == . 3,089,412 ( 0.04%) if let Some(result) = self.cache.get(&t) { 177,868 ( 0.00%) return result.clone(); . } . debug!("generalize: t={:?}", t); . . // Check to see whether the type we are generalizing references . // any other type variable related to `vid` via . // subtyping. This is basically our "occurs check", preventing . // us from creating infinitely sized types. 1,679,329 ( 0.02%) let result = match *t.kind() { 44,288 ( 0.00%) ty::Infer(ty::TyVar(vid)) => { 44,288 ( 0.00%) let vid = self.infcx.inner.borrow_mut().type_variables().root_var(vid); 44,288 ( 0.00%) let sub_vid = self.infcx.inner.borrow_mut().type_variables().sub_root_var(vid); 44,288 ( 0.00%) if sub_vid == self.for_vid_sub_root { . // If sub-roots are equal, then `for_vid` and . // `vid` are related via subtyping. . Err(TypeError::CyclicTy(self.root_ty)) . } else { 265,728 ( 0.00%) let probe = self.infcx.inner.borrow_mut().type_variables().probe(vid); 88,576 ( 0.00%) match probe { . TypeVariableValue::Known { value: u } => { . debug!("generalize: known value {:?}", u); . self.relate(u, u) . } . TypeVariableValue::Unknown { universe } => { 218,825 ( 0.00%) match self.ambient_variance { . // Invariant: no need to make a fresh type variable. . ty::Invariant => { 208,145 ( 0.00%) if self.for_universe.can_name(universe) { 166,020 ( 0.00%) return Ok(t); . } . } . . // Bivariant: make a fresh var, but we . // may need a WF predicate. See . // comment on `needs_wf` field for . // more info. . ty::Bivariant => self.needs_wf = true, . . // Co/contravariant: this will be . // sufficiently constrained later on. . ty::Covariant | ty::Contravariant => (), . } . . let origin = 20,340 ( 0.00%) *self.infcx.inner.borrow_mut().type_variables().var_origin(vid); 15,820 ( 0.00%) let new_var_id = self . .infcx . .inner . .borrow_mut() . .type_variables() 15,820 ( 0.00%) .new_var(self.for_universe, origin); . let u = self.tcx().mk_ty_var(new_var_id); . . // Record that we replaced `vid` with `new_var_id` as part of a generalization . // operation. This is needed to detect cyclic types. To see why, see the . // docs in the `type_variables` module. 11,300 ( 0.00%) self.infcx.inner.borrow_mut().type_variables().sub(vid, new_var_id); . debug!("generalize: replacing original vid={:?} with new={:?}", vid, u); 4,520 ( 0.00%) Ok(u) . } . } . } . } . ty::Infer(ty::IntVar(_) | ty::FloatVar(_)) => { . // No matter what mode we are in, . // integer/floating-point types must be equal to be . // relatable. 574 ( 0.00%) Ok(t) . } 1,276,719 ( 0.02%) _ => relate::super_relate_tys(self, t, t), . }; . 4,289,300 ( 0.05%) self.cache.insert(t, result.clone()); 2,573,580 ( 0.03%) return result; 4,634,118 ( 0.06%) } . 581,272 ( 0.01%) fn regions( . &mut self, . r: ty::Region<'tcx>, . r2: ty::Region<'tcx>, . ) -> RelateResult<'tcx, ty::Region<'tcx>> { 70,282 ( 0.00%) assert_eq!(r, r2); // we are abusing TypeRelation here; both LHS and RHS ought to be == . . debug!("generalize: regions r={:?}", r); . 140,564 ( 0.00%) match *r { . // Never make variables for regions bound within the type itself, . // nor for erased regions. . ty::ReLateBound(..) | ty::ReErased => { . return Ok(r); . } . . ty::RePlaceholder(..) . | ty::ReVar(..) -- line 691 ---------------------------------------- -- line 697 ---------------------------------------- . } . } . . // If we are in an invariant context, we can re-use the region . // as is, unless it happens to be in some universe that we . // can't name. (In the case of a region *variable*, we could . // use it if we promoted it into our universe, but we don't . // bother.) 141,662 ( 0.00%) if let ty::Invariant = self.ambient_variance { 192,426 ( 0.00%) let r_universe = self.infcx.universe_of_region(r); 448,842 ( 0.01%) if self.for_universe.can_name(r_universe) { . return Ok(r); . } . } . . // FIXME: This is non-ideal because we don't give a . // very descriptive origin for this region variable. 68,258 ( 0.00%) Ok(self.infcx.next_region_var_in_universe(MiscVariable(self.cause.span), self.for_universe)) 581,272 ( 0.01%) } . 9,243 ( 0.00%) fn consts( . &mut self, . c: &'tcx ty::Const<'tcx>, . c2: &'tcx ty::Const<'tcx>, . ) -> RelateResult<'tcx, &'tcx ty::Const<'tcx>> { 3,045 ( 0.00%) assert_eq!(c, c2); // we are abusing TypeRelation here; both LHS and RHS ought to be == . . match c.val { . ty::ConstKind::Infer(InferConst::Var(vid)) => { 12 ( 0.00%) let mut inner = self.infcx.inner.borrow_mut(); 48 ( 0.00%) let variable_table = &mut inner.const_unification_table(); 12 ( 0.00%) let var_value = variable_table.probe_value(vid); 24 ( 0.00%) match var_value.val { . ConstVariableValue::Known { value: u } => { . drop(inner); . self.relate(u, u) . } 12 ( 0.00%) ConstVariableValue::Unknown { universe } => { 60 ( 0.00%) if self.for_universe.can_name(universe) { . Ok(c) . } else { . let new_var_id = variable_table.new_key(ConstVarValue { . origin: var_value.origin, . val: ConstVariableValue::Unknown { universe: self.for_universe }, . }); . Ok(self.tcx().mk_const_var(new_var_id, c.ty)) . } -- line 743 ---------------------------------------- -- line 754 ---------------------------------------- . substs, . substs, . )?; . Ok(self.tcx().mk_const(ty::Const { . ty: c.ty, . val: ty::ConstKind::Unevaluated(ty::Unevaluated { def, substs, promoted }), . })) . } 5,075 ( 0.00%) _ => relate::super_relate_consts(self, c, c), . } 9,243 ( 0.00%) } . } . . pub trait ConstEquateRelation<'tcx>: TypeRelation<'tcx> { . /// Register an obligation that both constants must be equal to each other. . /// . /// If they aren't equal then the relation doesn't hold. . fn const_equate_obligation(&mut self, a: &'tcx ty::Const<'tcx>, b: &'tcx ty::Const<'tcx>); . } -- line 772 ---------------------------------------- -- line 824 ---------------------------------------- . target_vid: ty::ConstVid<'tcx>, . } . . // We use `TypeRelation` here to propagate `RelateResult` upwards. . // . // Both inputs are expected to be the same. . impl<'tcx> TypeRelation<'tcx> for ConstInferUnifier<'_, 'tcx> { . fn tcx(&self) -> TyCtxt<'tcx> { 112 ( 0.00%) self.infcx.tcx . } . . fn param_env(&self) -> ty::ParamEnv<'tcx> { 28 ( 0.00%) self.param_env . } . . fn tag(&self) -> &'static str { . "ConstInferUnifier" . } . . fn a_is_expected(&self) -> bool { . true -- line 844 ---------------------------------------- -- line 937 ---------------------------------------- . return Ok(r); . } else { . // FIXME: This is non-ideal because we don't give a . // very descriptive origin for this region variable. . Ok(self.infcx.next_region_var_in_universe(MiscVariable(self.span), self.for_universe)) . } . } . 532 ( 0.00%) #[tracing::instrument(level = "debug", skip(self))] . fn consts( . &mut self, . c: &'tcx ty::Const<'tcx>, . _c: &'tcx ty::Const<'tcx>, . ) -> RelateResult<'tcx, &'tcx ty::Const<'tcx>> { . debug_assert_eq!(c, _c); . debug!("ConstInferUnifier: c={:?}", c); . 140 ( 0.00%) match c.val { . ty::ConstKind::Infer(InferConst::Var(vid)) => { . // Check if the current unification would end up . // unifying `target_vid` with a const which contains . // an inference variable which is unioned with `target_vid`. . // . // Not doing so can easily result in stack overflows. . if self . .infcx -- line 962 ---------------------------------------- -- line 1000 ---------------------------------------- . substs, . substs, . )?; . Ok(self.tcx().mk_const(ty::Const { . ty: c.ty, . val: ty::ConstKind::Unevaluated(ty::Unevaluated { def, substs, promoted }), . })) . } 140 ( 0.00%) _ => relate::super_relate_consts(self, c, c), . } . } . } 2,708,007 ( 0.03%) -------------------------------------------------------------------------------- The following files chosen for auto-annotation could not be found: -------------------------------------------------------------------------------- ./elf/dl-lookup.c ./malloc/malloc.c ./string/../sysdeps/x86_64/multiarch/memcmp-avx2-movbe.S ./string/../sysdeps/x86_64/multiarch/memmove-vec-unaligned-erms.S -------------------------------------------------------------------------------- Ir -------------------------------------------------------------------------------- 4,783,290,040 (57.20%) events annotated

(&mut self, ct: ty::Unevaluated<'_, P>) { 88 ( 0.00%) self.add_substs(ct.substs); . self.add_flags(TypeFlags::HAS_CT_PROJECTION); . } . . fn add_existential_projection(&mut self, projection: &ty::ExistentialProjection<'_>) { 850 ( 0.00%) self.add_substs(projection.substs); 850 ( 0.00%) match projection.term { 425 ( 0.00%) ty::Term::Ty(ty) => self.add_ty(ty), . ty::Term::Const(ct) => self.add_const(ct), . } . } . . fn add_projection_ty(&mut self, projection_ty: ty::ProjectionTy<'_>) { 96,170 ( 0.00%) self.add_substs(projection_ty.substs); . } . 2,645,552 ( 0.03%) fn add_substs(&mut self, substs: &[GenericArg<'_>]) { . for kind in substs { 553,999 ( 0.01%) match kind.unpack() { 1,084,912 ( 0.01%) GenericArgKind::Type(ty) => self.add_ty(ty), . GenericArgKind::Lifetime(lt) => self.add_region(lt), 228 ( 0.00%) GenericArgKind::Const(ct) => self.add_const(ct), . } . } 3,023,488 ( 0.04%) } . } 1,288,916 ( 0.02%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/std/src/sys/unix/alloc.rs -------------------------------------------------------------------------------- Ir -- line 5 ---------------------------------------- . #[stable(feature = "alloc_system_type", since = "1.28.0")] . unsafe impl GlobalAlloc for System { . #[inline] . unsafe fn alloc(&self, layout: Layout) -> *mut u8 { . // jemalloc provides alignment less than MIN_ALIGN for small allocations. . // So only rely on MIN_ALIGN if size >= align. . // Also see and . // . 10,666,476 ( 0.13%) if layout.align() <= MIN_ALIGN && layout.align() <= layout.size() { 7,999,857 ( 0.10%) 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. 186,048 ( 0.00%) if layout.align() <= MIN_ALIGN && layout.align() <= layout.size() { 279,072 ( 0.00%) libc::calloc(layout.size(), 1) as *mut u8 . } else { . let ptr = self.alloc(layout); . if !ptr.is_null() { . ptr::write_bytes(ptr, 0, layout.size()); . } . ptr . } . } . . #[inline] . unsafe fn dealloc(&self, ptr: *mut u8, _layout: Layout) { 2,713,120 ( 0.03%) libc::free(ptr as *mut libc::c_void) . } . . #[inline] . unsafe fn realloc(&self, ptr: *mut u8, layout: Layout, new_size: usize) -> *mut u8 { 914,560 ( 0.01%) if layout.align() <= MIN_ALIGN && layout.align() <= new_size { 1,829,120 ( 0.02%) libc::realloc(ptr as *mut libc::c_void, new_size) as *mut u8 . } else { . realloc_fallback(self, ptr, layout, new_size) . } . } . } . . cfg_if::cfg_if! { . if #[cfg(any( -- line 56 ---------------------------------------- -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/.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 { 640 ( 0.00%) fn clone(&self) -> Self { 6,315 ( 0.00%) HashMap { . hash_builder: self.hash_builder.clone(), 1,338 ( 0.00%) table: self.table.clone(), . } 720 ( 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, . { 763,771 ( 0.01%) move |val| make_hash::(hash_builder, &val.0) . } . . /// Ensures that a single closure type across uses of this which, in turn prevents multiple . /// instances of any functions like RawTable::reserve from being generated . #[cfg_attr(feature = "inline-more", inline)] . fn equivalent_key(k: &Q) -> impl Fn(&(K, V)) -> bool + '_ . where . K: Borrow, . Q: ?Sized + Eq, . { 1,131,716 ( 0.01%) move |x| k.eq(x.0.borrow()) . } . . /// Ensures that a single closure type across uses of this which, in turn prevents multiple . /// instances of any functions like RawTable::reserve from being generated . #[cfg_attr(feature = "inline-more", inline)] . fn equivalent(k: &Q) -> impl Fn(&K) -> bool + '_ . where . K: Borrow, . Q: ?Sized + Eq, . { 1,293,531 ( 0.02%) move |x| k.eq(x.borrow()) . } . . #[cfg(not(feature = "nightly"))] . #[cfg_attr(feature = "inline-more", inline)] . pub(crate) fn make_hash(hash_builder: &S, val: &Q) -> u64 . where . K: Borrow, . Q: Hash + ?Sized, -- line 248 ---------------------------------------- -- line 251 ---------------------------------------- . use core::hash::Hasher; . let mut state = hash_builder.build_hasher(); . val.hash(&mut state); . state.finish() . } . . #[cfg(feature = "nightly")] . #[cfg_attr(feature = "inline-more", inline)] 2 ( 0.00%) pub(crate) fn make_hash(hash_builder: &S, val: &Q) -> u64 . where . K: Borrow, . Q: Hash + ?Sized, . S: BuildHasher, . { . hash_builder.hash_one(val) 4 ( 0.00%) } . . #[cfg(not(feature = "nightly"))] . #[cfg_attr(feature = "inline-more", inline)] . pub(crate) fn make_insert_hash(hash_builder: &S, val: &K) -> u64 . where . K: Hash, . S: BuildHasher, . { -- line 274 ---------------------------------------- -- line 367 ---------------------------------------- . /// let s = DefaultHashBuilder::default(); . /// let mut map = HashMap::with_hasher(s); . /// map.insert(1, 2); . /// ``` . /// . /// [`BuildHasher`]: ../../std/hash/trait.BuildHasher.html . #[cfg_attr(feature = "inline-more", inline)] . pub const fn with_hasher(hash_builder: S) -> Self { 1,044,976 ( 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 { 187 ( 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 { 40,619 ( 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 { 228,464 ( 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)] 1,828 ( 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)) { 595 ( 0.00%) Entry::Occupied(OccupiedEntry { . hash, . key: Some(key), . elem, . table: self, . }) . } else { 1,690 ( 0.00%) Entry::Vacant(VacantEntry { . hash, . key, . table: self, . }) . } 2,285 ( 0.00%) } . . /// Gets the given key's corresponding entry by reference in the map for in-place manipulation. . /// . /// # Examples . /// . /// ``` . /// use hashbrown::HashMap; . /// -- line 995 ---------------------------------------- -- line 1047 ---------------------------------------- . /// ``` . #[inline] . pub fn get(&self, k: &Q) -> Option<&V> . where . K: Borrow, . Q: Hash + Eq, . { . // Avoid `Option::map` because it bloats LLVM IR. 3,220,010 ( 0.04%) match self.get_inner(k) { . Some(&(_, ref v)) => Some(v), . None => None, . } . } . . /// Returns the key-value pair corresponding to the supplied key. . /// . /// The supplied key may be any borrowed form of the map's key type, but -- line 1063 ---------------------------------------- -- line 1091 ---------------------------------------- . } . . #[inline] . fn get_inner(&self, k: &Q) -> Option<&(K, V)> . where . K: Borrow, . Q: Hash + Eq, . { 3,303,557 ( 0.04%) if self.table.is_empty() { . None . } else { 1 ( 0.00%) let hash = make_hash::(&self.hash_builder, k); . self.table.get(hash, equivalent_key(k)) . } . } . . /// Returns the key-value pair corresponding to the supplied key, with a mutable reference to value. . /// . /// The supplied key may be any borrowed form of the map's key type, but . /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for -- line 1110 ---------------------------------------- -- line 1155 ---------------------------------------- . /// use hashbrown::HashMap; . /// . /// let mut map = HashMap::new(); . /// map.insert(1, "a"); . /// assert_eq!(map.contains_key(&1), true); . /// assert_eq!(map.contains_key(&2), false); . /// ``` . #[cfg_attr(feature = "inline-more", inline)] 2,285,251 ( 0.03%) pub fn contains_key(&self, k: &Q) -> bool . where . K: Borrow, . Q: Hash + Eq, . { . self.get_inner(k).is_some() 2,718,574 ( 0.03%) } . . /// 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)] 688 ( 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. 2,064 ( 0.00%) match self.get_inner_mut(k) { . Some(&mut (_, ref mut v)) => Some(v), . None => None, . } 1,376 ( 0.00%) } . . #[inline] . fn get_inner_mut(&mut self, k: &Q) -> Option<&mut (K, V)> . where . K: Borrow, . Q: Hash + Eq, . { 688 ( 0.00%) if self.table.is_empty() { . None . } else { . let hash = make_hash::(&self.hash_builder, k); . self.table.get_mut(hash, equivalent_key(k)) . } . } . . /// Attempts to get mutable references to `N` values in the map at once. -- line 1219 ---------------------------------------- -- line 1495 ---------------------------------------- . /// assert_eq!(map.insert(37, "a"), None); . /// assert_eq!(map.is_empty(), false); . /// . /// map.insert(37, "b"); . /// assert_eq!(map.insert(37, "c"), Some("b")); . /// assert_eq!(map[&37], "c"); . /// ``` . #[cfg_attr(feature = "inline-more", inline)] 12,006,988 ( 0.14%) pub fn insert(&mut self, k: K, v: V) -> Option { . let hash = make_insert_hash::(&self.hash_builder, &k); 1,366 ( 0.00%) if let Some((_, item)) = self.table.get_mut(hash, equivalent_key(&k)) { 4 ( 0.00%) Some(mem::replace(item, v)) . } else { 4,626,727 ( 0.06%) self.table 6,296,457 ( 0.08%) .insert(hash, (k, v), make_hasher::(&self.hash_builder)); 658,814 ( 0.01%) None . } 11,154,239 ( 0.13%) } . . /// 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)] 186,770 ( 0.00%) pub fn remove(&mut self, k: &Q) -> Option . where . K: Borrow, . Q: Hash + Eq, . { . // Avoid `Option::map` because it bloats LLVM IR. 1,208,981 ( 0.01%) match self.remove_entry(k) { 84,466 ( 0.00%) Some((_, v)) => Some(v), 148,478 ( 0.00%) None => None, . } 433,883 ( 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); 782,938 ( 0.01%) self.table.remove_entry(hash, equivalent_key(k)) . } . } . . impl HashMap { . /// Creates a raw entry builder for the HashMap. . /// . /// Raw entries provide the lowest level of control for searching and . /// manipulating a map. They must be manually initialized with a hash and -- line 1647 ---------------------------------------- -- line 2069 ---------------------------------------- . where . F: FnMut(&K, &mut V) -> bool, . A: Allocator + Clone, . { . type Item = (K, V); . . #[cfg_attr(feature = "inline-more", inline)] . fn next(&mut self) -> Option { 144 ( 0.00%) self.inner.next(&mut self.f) . } . . #[inline] . fn size_hint(&self) -> (usize, Option) { . (0, self.inner.iter.size_hint().1) . } . } . -- line 2085 ---------------------------------------- -- line 2095 ---------------------------------------- . #[cfg_attr(feature = "inline-more", inline)] . pub(super) fn next(&mut self, f: &mut F) -> Option<(K, V)> . where . F: FnMut(&K, &mut V) -> bool, . { . unsafe { . for item in &mut self.iter { . let &mut (ref key, ref mut value) = item.as_mut(); 216 ( 0.00%) if f(key, value) { 48 ( 0.00%) return Some(self.table.remove(item)); . } . } . } . None . } . } . . /// A mutable iterator over the values of a `HashMap`. -- line 2112 ---------------------------------------- -- line 2209 ---------------------------------------- . /// Creates a `RawEntryMut` from the given key and its hash. . #[inline] . #[allow(clippy::wrong_self_convention)] . pub fn from_key_hashed_nocheck(self, hash: u64, k: &Q) -> RawEntryMut<'a, K, V, S, A> . where . K: Borrow, . Q: Eq, . { 14,986,002 ( 0.18%) 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)] 36,267,729 ( 0.43%) 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) 40,207,601 ( 0.48%) } . . #[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, . { 4,639,722 ( 0.06%) match self.map.table.find(hash, |(k, _)| is_match(k)) { 22,214,372 ( 0.27%) Some(elem) => RawEntryMut::Occupied(RawOccupiedEntryMut { . elem, . table: &mut self.map.table, . hash_builder: &self.map.hash_builder, . }), 2,972,826 ( 0.04%) 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)] 3,276,878 ( 0.04%) pub fn from_key_hashed_nocheck(self, hash: u64, k: &Q) -> Option<(&'a K, &'a V)> . where . K: Borrow, . Q: Eq, . { 4,171,992 ( 0.05%) self.from_hash(hash, equivalent(k)) 5,981,951 ( 0.07%) } . . #[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, . { 6,053,947 ( 0.07%) 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, . { 5,039,601 ( 0.06%) let &mut (ref mut k, ref mut v) = self.table.insert_entry( . hash, . (key, value), . make_hasher::(self.hash_builder), . ); . (k, v) . } . . /// Set the value of an entry with a custom hasher function. -- line 2640 ---------------------------------------- -- line 2974 ---------------------------------------- . /// map.insert("a", 1); . /// map.insert("b", 2); . /// map.insert("c", 3); . /// . /// // Not possible with .iter() . /// let vec: Vec<(&str, i32)> = map.into_iter().collect(); . /// ``` . #[cfg_attr(feature = "inline-more", inline)] 4,005 ( 0.00%) fn into_iter(self) -> IntoIter { 72,396 ( 0.00%) IntoIter { 31,890 ( 0.00%) inner: self.table.into_iter(), . } 12,015 ( 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. 327,325 ( 0.00%) match self.inner.next() { . Some(x) => unsafe { . let r = x.as_ref(); 3,257 ( 0.00%) Some((&r.0, &r.1)) . }, . None => None, . } . } . #[cfg_attr(feature = "inline-more", inline)] . fn size_hint(&self) -> (usize, Option) { . self.inner.size_hint() . } -- line 3006 ---------------------------------------- -- 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(); 3 ( 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,836 ( 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)] 147 ( 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, . } 294 ( 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; 112 ( 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)] 194,386 ( 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. 137,669 ( 0.00%) let iter = iter.into_iter(); 66,458 ( 0.00%) let reserve = if self.is_empty() { . iter.size_hint().0 . } else { 4,307 ( 0.00%) (iter.size_hint().0 + 1) / 2 . }; . self.reserve(reserve); . iter.for_each(move |(k, v)| { 1,117,221 ( 0.01%) self.insert(k, v); . }); 156,192 ( 0.00%) } . . #[inline] . #[cfg(feature = "nightly")] . fn extend_one(&mut self, (k, v): (K, V)) { . self.insert(k, v); . } . . #[inline] -- line 4588 ---------------------------------------- 17,703,536 ( 0.21%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/ena-0.14.0/src/unify/mod.rs -------------------------------------------------------------------------------- Ir -- line 154 ---------------------------------------- . /// Value of a unification key. We implement Tarjan's union-find . /// algorithm: when two keys are unified, one of them is converted . /// into a "redirect" pointing at the other. These redirects form a . /// DAG: the roots of the DAG (nodes that are not redirected) are each . /// associated with a value of type `V` and a rank. The rank is used . /// to keep the DAG relatively balanced, which helps keep the running . /// time of the algorithm under control. For more information, see . /// . 63,202 ( 0.00%) #[derive(PartialEq, Clone, Debug)] . pub struct VarValue { 202,870 ( 0.00%) parent: K, // if equal to self, this is a root 13,876 ( 0.00%) value: K::Value, // value assigned (only relevant to root) 196,296 ( 0.00%) rank: u32, // max depth (only relevant to root) . } . . /// Table of unification keys and their values. You must define a key type K . /// that implements the `UnifyKey` trait. Unification tables can be used in two-modes: . /// . /// - in-place (`UnificationTable>` or `InPlaceUnificationTable`): . /// - This is the standard mutable mode, where the array is modified . /// in place. . /// - To do backtracking, you can employ the `snapshot` and `rollback_to` . /// methods. . /// - persistent (`UnificationTable>` or `PersistentUnificationTable`): . /// - In this mode, we use a persistent vector to store the data, so that . /// cloning the table is an O(1) operation. . /// - This implies that ordinary operations are quite a bit slower though. . /// - Requires the `persistent` feature be selected in your Cargo.toml file. 141,035 ( 0.00%) #[derive(Clone, Debug, Default)] . pub struct UnificationTable { . /// Indicates the current value of each key. . values: S, . } . . pub type UnificationStorage = Vec>; . pub type UnificationTableStorage = UnificationTable, ()>>; . -- line 190 ---------------------------------------- -- line 215 ---------------------------------------- . } . . fn new(parent: K, value: K::Value, rank: u32) -> VarValue { . VarValue { . parent: parent, // this is a root . value: value, . rank: rank, . } 248,422 ( 0.00%) } . . fn redirect(&mut self, to: K) { 125,615 ( 0.00%) self.parent = to; . } . . fn root(&mut self, rank: u32, value: K::Value) { 94,064 ( 0.00%) self.rank = rank; 72,802 ( 0.00%) self.value = value; . } . . fn parent(&self, self_key: K) -> Option { 11,324,692 ( 0.14%) self.if_not_self(self.parent, self_key) . } . . fn if_not_self(&self, key: K, self_key: K) -> Option { . if key == self_key { . None . } else { . Some(key) . } -- line 243 ---------------------------------------- -- line 253 ---------------------------------------- . &'a mut self, . undo_log: L, . ) -> UnificationTable, L>> . where . L: UndoLogs>>, . { . UnificationTable { . values: InPlace { 12 ( 0.00%) values: self.values.values.with_log(undo_log), . }, . } . } . } . . // We can't use V:LatticeValue, much as I would like to, . // because frequently the pattern is that V=Option for some . // other type parameter U, and we have no way to say -- line 269 ---------------------------------------- -- line 311 ---------------------------------------- . pub fn len(&self) -> usize { . self.values.len() . } . } . . impl UnificationTable { . /// Starts a new snapshot. Each snapshot must be either . /// Creates a fresh key with the given value. 966,380 ( 0.01%) pub fn new_key(&mut self, value: S::Value) -> S::Key { . let len = self.values.len(); 1,008,121 ( 0.01%) let key: S::Key = UnifyKey::from_index(len as u32); . self.values.push(VarValue::new_var(key, value)); 442,663 ( 0.01%) debug!("{}: created new key: {:?}", S::tag(), key); . key 1,445,695 ( 0.02%) } . . /// Reserve memory for `num_new_keys` to be created. Does not . /// actually create the new keys; you must then invoke `new_key`. . pub fn reserve(&mut self, num_new_keys: usize) { . self.values.reserve(num_new_keys); . } . . /// Clears all unifications that have been performed, resetting to . /// the initial state. The values of each variable are given by . /// the closure. . pub fn reset_unifications(&mut self, mut value: impl FnMut(S::Key) -> S::Value) { . self.values.reset_unifications(|i| { 2,331 ( 0.00%) let key = UnifyKey::from_index(i as u32); . let value = value(key); . VarValue::new_var(key, value) . }); . } . . /// Obtains the current value for a particular key. . /// Not for end-users; they can use `probe_value`. . fn value(&self, key: S::Key) -> &VarValue { 12,274,724 ( 0.15%) &self.values[key.index() as usize] . } . . /// Find the root node for `vid`. This uses the standard . /// union-find algorithm with path compression: . /// . . /// . /// NB. This is a building-block operation and you would probably . /// prefer to call `probe` below. . /// . /// This is an always-inlined version of this function for the hot . /// callsites. `uninlined_get_root_key` is the never-inlined version. . #[inline(always)] . fn inlined_get_root_key(&mut self, vid: S::Key) -> S::Key { . let redirect = { 17,949,371 ( 0.21%) match self.value(vid).parent(vid) { . None => return vid, . Some(redirect) => redirect, . } . }; . 11,701,572 ( 0.14%) let root_key: S::Key = self.uninlined_get_root_key(redirect); 1,169,846 ( 0.01%) if root_key != redirect { . // Path compression 7,744 ( 0.00%) self.update_value(vid, |value| value.parent = root_key); . } . 2,237 ( 0.00%) root_key . } . . // This is a never-inlined version of this function for cold callsites. . // 'inlined_get_root_key` is the always-inlined version. . #[inline(never)] 35,519,590 ( 0.42%) fn uninlined_get_root_key(&mut self, vid: S::Key) -> S::Key { . self.inlined_get_root_key(vid) 36,251,214 ( 0.43%) } . 14,925 ( 0.00%) fn update_value(&mut self, key: S::Key, op: OP) . where . OP: FnOnce(&mut VarValue), . { 530,257 ( 0.01%) self.values.update(key.index() as usize, op); 311,102 ( 0.00%) debug!("Updated variable {:?} to {:?}", key, self.value(key)); 11,908 ( 0.00%) } . . /// Either redirects `node_a` to `node_b` or vice versa, depending . /// on the relative rank. The value associated with the new root . /// will be `new_value`. . /// . /// NB: This is the "union" operation of "union-find". It is . /// really more of a building block. If the values associated with . /// your key are non-trivial, you would probably prefer to call . /// `unify_var_var` below. . fn unify_roots(&mut self, key_a: S::Key, key_b: S::Key, new_value: S::Value) { 74,896 ( 0.00%) debug!("unify(key_a={:?}, key_b={:?})", key_a, key_b); . 66,701 ( 0.00%) let rank_a = self.value(key_a).rank; 291,025 ( 0.00%) let rank_b = self.value(key_b).rank; . if let Some((new_root, redirected)) = S::Key::order_roots( 143,691 ( 0.00%) key_a, . &self.value(key_a).value, 143,691 ( 0.00%) key_b, . &self.value(key_b).value, . ) { . // compute the new rank for the new root that they chose; . // this may not be the optimal choice. . let new_rank = if new_root == key_a { . debug_assert!(redirected == key_b); . if rank_a > rank_b { . rank_a -- line 416 ---------------------------------------- -- line 422 ---------------------------------------- . debug_assert!(redirected == key_a); . if rank_b > rank_a { . rank_b . } else { . rank_a + 1 . } . }; . self.redirect_root(new_rank, redirected, new_root, new_value); 149,792 ( 0.00%) } else if rank_a > rank_b { . // a has greater rank, so a should become b's parent, . // i.e., b should redirect to a. 154,160 ( 0.00%) self.redirect_root(rank_a, key_b, key_a, new_value); 30,271 ( 0.00%) } else if rank_a < rank_b { . // b has greater rank, so a should redirect to b. 14,404 ( 0.00%) self.redirect_root(rank_b, key_a, key_b, new_value); . } else { . // If equal, redirect one to the other and increment the . // other's rank. 102,963 ( 0.00%) self.redirect_root(rank_a + 1, key_a, key_b, new_value); . } . } . . /// Internal method to redirect `old_root_key` (which is currently . /// a root) to a child of `new_root_key` (which will remain a . /// root). The rank and value of `new_root_key` will be updated to . /// `new_rank` and `new_value` respectively. 942,461 ( 0.01%) fn redirect_root( . &mut self, . new_rank: u32, . old_root_key: S::Key, . new_root_key: S::Key, . new_value: S::Value, . ) { . self.update_value(old_root_key, |old_root_value| { . old_root_value.redirect(new_root_key); . }); 910 ( 0.00%) self.update_value(new_root_key, |new_root_value| { 26,999 ( 0.00%) new_root_value.root(new_rank, new_value); . }); 522,178 ( 0.01%) } . } . . /// //////////////////////////////////////////////////////////////////////// . /// Public API . . impl UnificationTable . where . S: UnificationStoreMut, . K: UnifyKey, . V: UnifyValue, . { . /// Unions two keys without the possibility of failure; only . /// applicable when unify values use `NoError` as their error . /// type. 917,139 ( 0.01%) pub fn union(&mut self, a_id: K1, b_id: K2) . where . K1: Into, . K2: Into, . V: UnifyValue, . { . self.unify_var_var(a_id, b_id).unwrap(); 810,141 ( 0.01%) } . . /// Unions a key and a value without the possibility of failure; . /// only applicable when unify values use `NoError` as their error . /// type. 1,372,534 ( 0.02%) pub fn union_value(&mut self, id: K1, value: V) . where . K1: Into, . V: UnifyValue, . { . self.unify_var_value(id, value).unwrap(); 1,074,002 ( 0.01%) } . . /// Given two keys, indicates whether they have been unioned together. . pub fn unioned(&mut self, a_id: K1, b_id: K2) -> bool . where . K1: Into, . K2: Into, . { . self.find(a_id) == self.find(b_id) -- line 502 ---------------------------------------- -- line 503 ---------------------------------------- . } . . /// Given a key, returns the (current) root key. . pub fn find(&mut self, id: K1) -> K . where . K1: Into, . { . let id = id.into(); 749,386 ( 0.01%) self.uninlined_get_root_key(id) . } . . /// Unions together two variables, merging their values. If . /// merging the values fails, the error is propagated and this . /// method has no effect. 1,638 ( 0.00%) pub fn unify_var_var(&mut self, a_id: K1, b_id: K2) -> Result<(), V::Error> . where . K1: Into, . K2: Into, . { . let a_id = a_id.into(); . let b_id = b_id.into(); . 253,108 ( 0.00%) let root_a = self.uninlined_get_root_key(a_id); 321,904 ( 0.00%) let root_b = self.uninlined_get_root_key(b_id); . 46,025 ( 0.00%) if root_a == root_b { . return Ok(()); . } . 326,175 ( 0.00%) let combined = V::unify_values(&self.value(root_a).value, &self.value(root_b).value)?; . . Ok(self.unify_roots(root_a, root_b, combined)) 1,820 ( 0.00%) } . . /// Sets the value of the key `a_id` to `b`, attempting to merge . /// with the previous value. 31,302 ( 0.00%) pub fn unify_var_value(&mut self, a_id: K1, b: V) -> Result<(), V::Error> . where . K1: Into, . { . let a_id = a_id.into(); 216,591 ( 0.00%) let root_a = self.uninlined_get_root_key(a_id); 488,768 ( 0.01%) let value = V::unify_values(&self.value(root_a).value, &b)?; 322,776 ( 0.00%) self.update_value(root_a, |node| node.value = value); . Ok(()) 28,225 ( 0.00%) } . . /// Returns the current value for the given key. If the key has . /// been union'd, this will give the value from the current root. 121,089 ( 0.00%) pub fn probe_value(&mut self, id: K1) -> V . where . K1: Into, . { . self.inlined_probe_value(id) 118,224 ( 0.00%) } . . // An always-inlined version of `probe_value`, for hot callsites. . #[inline(always)] . pub fn inlined_probe_value(&mut self, id: K1) -> V . where . K1: Into, . { . let id = id.into(); . let id = self.inlined_get_root_key(id); 69,852 ( 0.00%) self.value(id).value.clone() . } . } . . /////////////////////////////////////////////////////////////////////////// . . impl UnifyValue for () { . type Error = NoError; . . fn unify_values(_: &(), _: &()) -> Result<(), NoError> { . Ok(()) 58,186 ( 0.00%) } . } . . impl UnifyValue for Option { . type Error = V::Error; . . fn unify_values(a: &Option, b: &Option) -> Result { 20,086 ( 0.00%) match (a, b) { . (&None, &None) => Ok(None), . (&Some(ref v), &None) | (&None, &Some(ref v)) => Ok(Some(v.clone())), . (&Some(ref a), &Some(ref b)) => match V::unify_values(a, b) { . Ok(v) => Ok(Some(v)), . Err(err) => Err(err), . }, . } . } -- line 593 ---------------------------------------- 7,410,323 ( 0.09%) -------------------------------------------------------------------------------- -- 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}; . 41,846 ( 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); . } . } . } . }; . } . 77,203 ( 0.00%) #[derive(Clone)] . pub struct Parser<'a> { 3,187 ( 0.00%) pub sess: &'a ParseSess, . /// The current token. 2,472 ( 0.00%) pub token: Token, . /// The spacing for the current token 1,337 ( 0.00%) pub token_spacing: Spacing, . /// The previous token. 3,708 ( 0.00%) pub prev_token: Token, 1,438 ( 0.00%) pub capture_cfg: bool, 2,977 ( 0.00%) restrictions: Restrictions, 2,674 ( 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, 2,674 ( 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. 2,674 ( 0.00%) unmatched_angle_bracket_count: u32, 4,011 ( 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. 1,337 ( 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` 1,337 ( 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, . } . 5,962 ( 0.00%) #[derive(Clone)] . struct CaptureState { 5,348 ( 0.00%) capturing: Capturing, 1,337 ( 0.00%) replace_ranges: Vec, . inner_attr_ranges: FxHashMap, . } . . impl<'a> Drop for Parser<'a> { . fn drop(&mut self) { 16,923 ( 0.00%) emit_unclosed_delims(&mut self.unclosed_delims, &self.sess); . } . } . 288,313 ( 0.00%) #[derive(Clone)] . struct TokenCursor { . frame: TokenCursorFrame, 67,676 ( 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. 21,419 ( 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, . } . 131,140 ( 0.00%) #[derive(Clone)] . struct TokenCursorFrame { 46,321 ( 0.00%) delim: token::DelimToken, . span: DelimSpan, . open_delim: bool, 92,642 ( 0.00%) tree_cursor: tokenstream::Cursor, . close_delim: bool, . } . . impl TokenCursorFrame { . fn new(span: DelimSpan, delim: DelimToken, tts: TokenStream) -> Self { 17,790 ( 0.00%) TokenCursorFrame { . delim, . span, . open_delim: false, 31,751 ( 0.00%) tree_cursor: tts.into_trees(), . close_delim: false, . } . } . } . . impl TokenCursor { 2,269,680 ( 0.03%) fn next(&mut self) -> (Token, Spacing) { . loop { 1,109,569 ( 0.01%) let (tree, spacing) = if !self.frame.open_delim { 23,972 ( 0.00%) self.frame.open_delim = true; 119,860 ( 0.00%) TokenTree::open_tt(self.frame.span, self.frame.delim).into() 2,185,882 ( 0.03%) } else if let Some(tree) = self.frame.tree_cursor.next_with_spacing() { . tree 102,796 ( 0.00%) } else if !self.frame.close_delim { 23,664 ( 0.00%) self.frame.close_delim = true; 118,320 ( 0.00%) TokenTree::close_tt(self.frame.span, self.frame.delim).into() 47,324 ( 0.00%) } else if let Some(frame) = self.stack.pop() { 307,606 ( 0.00%) self.frame = frame; . continue; . } else { 73,296 ( 0.00%) (TokenTree::Token(Token::new(token::Eof, DUMMY_SP)), Spacing::Alone) . }; . 424,898 ( 0.01%) match tree { . TokenTree::Token(token) => { 1,513,120 ( 0.02%) return (token, spacing); . } . TokenTree::Delimited(sp, delim, tts) => { . let frame = TokenCursorFrame::new(sp, delim, tts); . self.stack.push(mem::replace(&mut self.frame, frame)); . } . } . } 1,513,120 ( 0.02%) } . 250,580 ( 0.00%) fn next_desugared(&mut self) -> (Token, Spacing) { 76,500 ( 0.00%) let (data, attr_style, sp) = match self.next() { 1,989 ( 0.00%) (Token { kind: token::DocComment(_, attr_style, data), span }, _) => { . (data, attr_style, span) . } 121,975 ( 0.00%) tok => return tok, . }; . . // Searches for the occurrences of `"#*` and returns the minimum number of `#`s . // required to wrap the text. . let mut num_of_hashes = 0; . let mut count = 0; 149,077 ( 0.00%) for ch in data.as_str().chars() { . count = match ch { . '"' => 1, 26 ( 0.00%) '#' if count > 0 => count + 1, . _ => 0, . }; . num_of_hashes = cmp::max(num_of_hashes, count); . } . 2,652 ( 0.00%) let delim_span = DelimSpan::from_single(sp); 3,315 ( 0.00%) let body = TokenTree::Delimited( . delim_span, . token::Bracket, 7,956 ( 0.00%) [ 4,641 ( 0.00%) TokenTree::token(token::Ident(sym::doc, false), sp), 2,652 ( 0.00%) TokenTree::token(token::Eq, sp), 5,304 ( 0.00%) TokenTree::token(TokenKind::lit(token::StrRaw(num_of_hashes), data, None), sp), . ] . .iter() . .cloned() . .collect::(), 663 ( 0.00%) ); . . self.stack.push(mem::replace( . &mut self.frame, . TokenCursorFrame::new( . delim_span, . token::NoDelim, 663 ( 0.00%) if attr_style == AttrStyle::Inner { . [TokenTree::token(token::Pound, sp), TokenTree::token(token::Not, sp), body] . .iter() . .cloned() . .collect::() . } else { 7,956 ( 0.00%) [TokenTree::token(token::Pound, sp), body] . .iter() . .cloned() . .collect::() . }, . ), . )); . 1,989 ( 0.00%) self.next() 225,522 ( 0.00%) } . } . 77,560 ( 0.00%) #[derive(Debug, Clone, PartialEq)] . enum TokenType { 62,048 ( 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 { 132 ( 0.00%) SeqSep { sep: Some(t), trailing_sep_allowed: true } . } . . fn none() -> SeqSep { . SeqSep { sep: None, trailing_sep_allowed: false } . } . } . . pub enum FollowedByType { . Yes, . No, . } . . fn token_descr_opt(token: &Token) -> Option<&'static str> { 2,712 ( 0.00%) Some(match token.kind { 5,424 ( 0.00%) _ if token.is_special_ident() => "reserved identifier", 5,424 ( 0.00%) _ if token.is_used_keyword() => "keyword", 5,424 ( 0.00%) _ if token.is_unused_keyword() => "reserved keyword", . token::DocComment(..) => "doc comment", . _ => return None, . }) . } . 9,492 ( 0.00%) pub(super) fn token_descr(token: &Token) -> String { 2,712 ( 0.00%) let token_str = pprust::token_to_string(token); . match token_descr_opt(token) { . Some(prefix) => format!("{} `{}`", prefix, token_str), 9,492 ( 0.00%) _ => format!("`{}`", token_str), . } 6,780 ( 0.00%) } . . impl<'a> Parser<'a> { 49,812 ( 0.00%) pub fn new( . sess: &'a ParseSess, . tokens: TokenStream, . desugar_doc_comments: bool, . subparser_name: Option<&'static str>, . ) -> Self { 3,558 ( 0.00%) let mut start_frame = TokenCursorFrame::new(DelimSpan::dummy(), token::NoDelim, tokens); 7,116 ( 0.00%) start_frame.open_delim = true; . start_frame.close_delim = true; . 110,298 ( 0.00%) let mut parser = Parser { . sess, 3,558 ( 0.00%) token: Token::dummy(), . token_spacing: Spacing::Alone, 3,558 ( 0.00%) prev_token: Token::dummy(), . capture_cfg: false, . restrictions: Restrictions::empty(), . expected_tokens: Vec::new(), . token_cursor: TokenCursor { 21,348 ( 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. 7,116 ( 0.00%) parser.bump(); . . parser 32,022 ( 0.00%) } . . fn next_tok(&mut self, fallback_span: Span) -> (Token, Spacing) { . loop { 1,103,412 ( 0.01%) let (mut next, spacing) = if self.desugar_doc_comments { 100,232 ( 0.00%) self.token_cursor.next_desugared() . } else { 476,532 ( 0.01%) self.token_cursor.next() . }; 735,608 ( 0.01%) self.token_cursor.num_next_calls += 1; . // We've retrieved an token from the underlying . // cursor, so we no longer need to worry about . // an unglued token. See `break_and_eat` for more details 183,902 ( 0.00%) self.token_cursor.break_last_token = false; 735,608 ( 0.01%) if next.span.is_dummy() { . // Tweak the location for better diagnostics, but keep syntactic context intact. 14,304 ( 0.00%) next.span = fallback_span.with_ctxt(next.span.ctxt()); . } 622,686 ( 0.01%) if matches!( 367,804 ( 0.00%) next.kind, . token::OpenDelim(token::NoDelim) | token::CloseDelim(token::NoDelim) . ) { . continue; . } 730,304 ( 0.01%) return (next, spacing); . } . } . . pub fn unexpected(&mut self) -> PResult<'a, T> { . match self.expect_one_of(&[], &[]) { . Err(e) => Err(e), . // We can get `Ok(true)` from `recover_closing_delimiter` . // which is called in `expected_one_of_not_found`. . Ok(_) => FatalError.raise(), . } . } . . /// Expects and consumes the token `t`. Signals an error if the next token is not `t`. 220,563 ( 0.00%) pub fn expect(&mut self, t: &TokenKind) -> PResult<'a, bool /* recovered */> { 24,507 ( 0.00%) if self.expected_tokens.is_empty() { 34,998 ( 0.00%) if self.token == *t { 29,165 ( 0.00%) self.bump(); . Ok(false) . } else { . self.unexpected_try_recover(t) . } . } else { 224,088 ( 0.00%) self.expect_one_of(slice::from_ref(t), &[]) . } 367,605 ( 0.00%) } . . /// Expect next token to be edible or inedible token. If edible, . /// then consume it; if inedible, then return without consuming . /// anything. Signal a fatal error if next token is unexpected. 263,760 ( 0.00%) pub fn expect_one_of( . &mut self, . edible: &[TokenKind], . inedible: &[TokenKind], . ) -> PResult<'a, bool /* recovered */> { 43,960 ( 0.00%) if edible.contains(&self.token.kind) { 57,537 ( 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) . } 329,700 ( 0.00%) } . . // Public for rustfmt usage. . pub fn parse_ident(&mut self) -> PResult<'a, Ident> { 133,759 ( 0.00%) self.parse_ident_common(true) . } . . fn ident_or_err(&mut self) -> PResult<'a, (Ident, /* is_raw */ bool)> { 101,145 ( 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(), . }) . } . 234,745 ( 0.00%) fn parse_ident_common(&mut self, recover: bool) -> PResult<'a, Ident> { 33,535 ( 0.00%) let (ident, is_raw) = self.ident_or_err()?; 201,210 ( 0.00%) if !is_raw && ident.is_reserved() { . let mut err = self.expected_ident_found(); . if recover { . err.emit(); . } else { . return Err(err); . } . } 134,140 ( 0.00%) self.bump(); . Ok(ident) 335,350 ( 0.00%) } . . /// 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. 2,832,732 ( 0.03%) fn check(&mut self, tok: &TokenKind) -> bool { 1,235,041 ( 0.01%) let is_present = self.token == *tok; 837,530 ( 0.01%) if !is_present { 1,720,878 ( 0.02%) self.expected_tokens.push(TokenType::Token(tok.clone())); . } . is_present 2,832,732 ( 0.03%) } . . /// Consumes a token 'tok' if it exists. Returns whether the given token was present. 928 ( 0.00%) pub fn eat(&mut self, tok: &TokenKind) -> bool { 636,591 ( 0.01%) let is_present = self.check(tok); 415,747 ( 0.00%) if is_present { 91,887 ( 0.00%) self.bump() . } . is_present 1,160 ( 0.00%) } . . /// If the next token is the given keyword, returns `true` without eating it. . /// An expectation is also added for diagnostics purposes. 59,145 ( 0.00%) fn check_keyword(&mut self, kw: Symbol) -> bool { 16,829 ( 0.00%) self.expected_tokens.push(TokenType::Keyword(kw)); 502,910 ( 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. 174,795 ( 0.00%) pub fn eat_keyword(&mut self, kw: Symbol) -> bool { 125,582 ( 0.00%) if self.check_keyword(kw) { 14,292 ( 0.00%) self.bump(); . true . } else { . false . } 174,795 ( 0.00%) } . . fn eat_keyword_noexpect(&mut self, kw: Symbol) -> bool { 36,336 ( 0.00%) if self.token.is_keyword(kw) { 4,101 ( 0.00%) self.bump(); . true . } else { . false . } . } . . /// If the given word is not a keyword, signals an error. . /// If the next token is not the given word, signals an error. . /// Otherwise, eats it. 2,215 ( 0.00%) fn expect_keyword(&mut self, kw: Symbol) -> PResult<'a, ()> { . if !self.eat_keyword(kw) { self.unexpected() } else { Ok(()) } 1,772 ( 0.00%) } . . /// Is the given keyword `kw` followed by a non-reserved identifier? 103,768 ( 0.00%) fn is_kw_followed_by_ident(&self, kw: Symbol) -> bool { 51,884 ( 0.00%) self.token.is_keyword(kw) && self.look_ahead(1, |t| t.is_ident() && !t.is_reserved_ident()) 116,739 ( 0.00%) } . 162,822 ( 0.00%) fn check_or_expected(&mut self, ok: bool, typ: TokenType) -> bool { 60,656 ( 0.00%) if ok { . true . } else { 24,576 ( 0.00%) self.expected_tokens.push(typ); . false . } 162,822 ( 0.00%) } . . fn check_ident(&mut self) -> bool { 53,528 ( 0.00%) self.check_or_expected(self.token.is_ident(), TokenType::Ident) . } . 43,316 ( 0.00%) fn check_path(&mut self) -> bool { 125,676 ( 0.00%) self.check_or_expected(self.token.is_path_start(), TokenType::Path) 54,145 ( 0.00%) } . . fn check_type(&mut self) -> bool { 10,940 ( 0.00%) self.check_or_expected(self.token.can_begin_type(), TokenType::Type) . } . . fn check_const_arg(&mut self) -> bool { 7,568 ( 0.00%) self.check_or_expected(self.token.can_begin_const_arg(), TokenType::Const) . } . 41,112 ( 0.00%) fn check_inline_const(&self, dist: usize) -> bool { 22,840 ( 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, . }) 41,112 ( 0.00%) } . . /// Checks to see if the next token is either `+` or `+=`. . /// Otherwise returns `false`. . fn check_plus(&mut self) -> bool { 13,816 ( 0.00%) self.check_or_expected( 6,908 ( 0.00%) self.token.is_like_plus(), 6,908 ( 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. 229,152 ( 0.00%) fn break_and_eat(&mut self, expected: TokenKind) -> bool { 133,672 ( 0.00%) if self.token.kind == expected { 12,014 ( 0.00%) self.bump(); . return true; . } 65,445 ( 0.00%) match self.token.kind.break_two_token_op() { 2,059 ( 0.00%) Some((first, second)) if first == expected => { 340 ( 0.00%) let first_span = self.sess.source_map().start_point(self.token.span); 425 ( 0.00%) let second_span = self.token.span.with_lo(first_span.hi()); 765 ( 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` 85 ( 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,190 ( 0.00%) self.bump_with((Token::new(second, second_span), self.token_spacing)); . true . } . _ => { 39,012 ( 0.00%) self.expected_tokens.push(TokenType::Token(expected)); . false . } . } 224,368 ( 0.00%) } . . /// Eats `+` possibly breaking tokens like `+=` in process. . fn eat_plus(&mut self) -> bool { 13,636 ( 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, ()> { 5,616 ( 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, ()> { 264 ( 0.00%) if self.break_and_eat(token::BinOp(token::Or)) { Ok(()) } else { self.unexpected() } . } . . /// Eats `<` possibly breaking tokens like `<<` in process. 9,094 ( 0.00%) fn eat_lt(&mut self) -> bool { 40,488 ( 0.00%) let ate = self.break_and_eat(token::Lt); 26,246 ( 0.00%) if ate { . // See doc comment for `unmatched_angle_bracket_count`. 8,112 ( 0.00%) self.unmatched_angle_bracket_count += 1; 9,262 ( 0.00%) self.max_angle_bracket_count += 1; . debug!("eat_lt: (increment) count={:?}", self.unmatched_angle_bracket_count); . } . ate 9,094 ( 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, ()> { 12,144 ( 0.00%) if self.break_and_eat(token::Gt) { . // See doc comment for `unmatched_angle_bracket_count`. 6,072 ( 0.00%) if self.unmatched_angle_bracket_count > 0 { 4,048 ( 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 { 57,105 ( 0.00%) TokenExpectType::Expect => self.check(k), 684 ( 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) { 60,060 ( 0.00%) if let token::CloseDelim(..) | token::Eof = self.token.kind { . break; . } 43,320 ( 0.00%) if let Some(ref t) = sep.sep { 48,076 ( 0.00%) if first { . first = false; . } else { 30,508 ( 0.00%) match self.expect(t) { . Ok(false) => { . self.current_closure.take(); . } . Ok(true) => { . self.current_closure.take(); . recovered = true; . break; . } -- line 784 ---------------------------------------- -- line 857 ---------------------------------------- . e.cancel(); . break; . } . } . } . } . } . } 21,570 ( 0.00%) if sep.trailing_sep_allowed && self.expect_any_with_type(kets, expect) { . trailing = true; . break; . } . 20,899 ( 0.00%) let t = f(self)?; 12,602 ( 0.00%) v.push(t); . } . 31,640 ( 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)> { 34,291 ( 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. 51,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 */)> { 20,935 ( 0.00%) let (val, trailing, recovered) = self.parse_seq_to_before_end(ket, sep, f)?; 10,529 ( 0.00%) if !recovered { . self.eat(ket); . } 55,124 ( 0.00%) Ok((val, trailing)) 40,968 ( 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)> { 18,098 ( 0.00%) self.expect(bra)?; 40,968 ( 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( 7,185 ( 0.00%) &token::OpenDelim(delim), 9,264 ( 0.00%) &token::CloseDelim(delim), . SeqSep::trailing_allowed(token::Comma), . f, . ) . } . . fn parse_paren_comma_seq( . &mut self, . f: impl FnMut(&mut Parser<'a>) -> PResult<'a, T>, . ) -> PResult<'a, (Vec, bool)> { . self.parse_delim_comma_seq(token::Paren, f) . } . . /// Advance the parser by one token using provided token as the next one. 2,374,593 ( 0.03%) fn bump_with(&mut self, (next_token, next_spacing): (Token, Spacing)) { . // Bumping after EOF is a bad sign, usually an infinite loop. 1,095,966 ( 0.01%) 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. 730,644 ( 0.01%) self.prev_token = mem::replace(&mut self.token, next_token); 182,661 ( 0.00%) self.token_spacing = next_spacing; . . // Diagnostics. 182,661 ( 0.00%) self.expected_tokens.clear(); . } . . /// Advance the parser by one token. 1,460,608 ( 0.02%) pub fn bump(&mut self) { 730,304 ( 0.01%) let next_token = self.next_tok(self.token.span); 1,095,456 ( 0.01%) self.bump_with(next_token); 1,460,608 ( 0.02%) } . . /// Look-ahead `dist` tokens of `self.token` and get access to that token there. . /// When `dist == 0` then the current token is looked at. 208 ( 0.00%) pub fn look_ahead(&self, dist: usize, looker: impl FnOnce(&Token) -> R) -> R { 21,626 ( 0.00%) if dist == 0 { 7,481 ( 0.00%) return looker(&self.token); . } . 52,396 ( 0.00%) let frame = &self.token_cursor.frame; 57,190 ( 0.00%) if frame.delim != DelimToken::NoDelim { . let all_normal = (0..dist).all(|i| { 169,226 ( 0.00%) let token = frame.tree_cursor.look_ahead(i); 220,992 ( 0.00%) !matches!(token, Some(TokenTree::Delimited(_, DelimToken::NoDelim, _))) . }); . if all_normal { 268,880 ( 0.00%) return match frame.tree_cursor.look_ahead(dist - 1) { 91,636 ( 0.00%) Some(tree) => match tree { 43,256 ( 0.00%) TokenTree::Token(token) => looker(token), . TokenTree::Delimited(dspan, delim, _) => { 22,442 ( 0.00%) looker(&Token::new(token::OpenDelim(*delim), dspan.open)) . } . }, 51,188 ( 0.00%) None => looker(&Token::new(token::CloseDelim(frame.delim), frame.span.close)), . }; . } . } . . let mut cursor = self.token_cursor.clone(); . let mut i = 0; 4,472 ( 0.00%) let mut token = Token::dummy(); 3,656 ( 0.00%) while i < dist { 33,435 ( 0.00%) token = cursor.next().0; 14,625 ( 0.00%) if matches!( 9,101 ( 0.00%) token.kind, . token::OpenDelim(token::NoDelim) | token::CloseDelim(token::NoDelim) . ) { . continue; . } 1,890 ( 0.00%) i += 1; . } 309 ( 0.00%) return looker(&token); 234 ( 0.00%) } . . /// Returns whether any of the given keywords are `dist` tokens ahead of the current one. 91,710 ( 0.00%) fn is_keyword_ahead(&self, dist: usize, kws: &[Symbol]) -> bool { 27,586 ( 0.00%) self.look_ahead(dist, |t| kws.iter().any(|&kw| t.is_keyword(kw))) 91,710 ( 0.00%) } . . /// Parses asyncness: `async` or nothing. . fn parse_asyncness(&mut self) -> Async { . if self.eat_keyword(kw::Async) { 100 ( 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. 3,258 ( 0.00%) fn parse_unsafety(&mut self) -> Unsafe { . if self.eat_keyword(kw::Unsafe) { . Unsafe::Yes(self.prev_token.uninterpolated_span()) . } else { . Unsafe::No . } 13,032 ( 0.00%) } . . /// Parses constness: `const` or nothing. 21,840 ( 0.00%) fn parse_constness(&mut self) -> Const { . // Avoid const blocks to be parsed as const items 6,184 ( 0.00%) if self.look_ahead(1, |t| t != &token::OpenDelim(DelimToken::Brace)) . && self.eat_keyword(kw::Const) . { . Const::Yes(self.prev_token.uninterpolated_span()) . } else { . Const::No . } 38,220 ( 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). 720 ( 0.00%) fn parse_mutability(&mut self) -> Mutability { . if self.eat_keyword(kw::Mut) { Mutability::Mut } else { Mutability::Not } 2,933 ( 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> { 156 ( 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 { 234 ( 0.00%) self.parse_ident_common(true) . } . } . . fn parse_mac_args(&mut self) -> PResult<'a, P> { 2,294 ( 0.00%) self.parse_mac_args_common(true).map(P) . } . . fn parse_attr_args(&mut self) -> PResult<'a, MacArgs> { 8,226 ( 0.00%) self.parse_mac_args_common(false) . } . 32,184 ( 0.00%) fn parse_mac_args_common(&mut self, delimited_only: bool) -> PResult<'a, MacArgs> { 28,608 ( 0.00%) Ok( 23,510 ( 0.00%) if self.check(&token::OpenDelim(DelimToken::Paren)) 4,269 ( 0.00%) || self.check(&token::OpenDelim(DelimToken::Bracket)) 4,176 ( 0.00%) || self.check(&token::OpenDelim(DelimToken::Brace)) . { 8,892 ( 0.00%) match self.parse_token_tree() { 11,115 ( 0.00%) TokenTree::Delimited(dspan, delim, tokens) => . // We've confirmed above that there is a delimiter so unwrapping is OK. . { 4,446 ( 0.00%) MacArgs::Delimited(dspan, MacDelimiter::from_token(delim).unwrap(), tokens) . } . _ => unreachable!(), . } 2,706 ( 0.00%) } else if !delimited_only { . if self.eat(&token::Eq) { 573 ( 0.00%) let eq_span = self.prev_token.span; . . // Collect tokens because they are used during lowering to HIR. 573 ( 0.00%) let expr = self.parse_expr_force_collect()?; 573 ( 0.00%) let span = expr.span; . 2,865 ( 0.00%) let token_kind = token::Interpolated(Lrc::new(token::NtExpr(expr))); 5,157 ( 0.00%) MacArgs::Eq(eq_span, Token::new(token_kind, span)) . } else { . MacArgs::Empty . } . } else { . return self.unexpected(); . }, . ) 25,032 ( 0.00%) } . . fn parse_or_use_outer_attributes( . &mut self, . already_parsed_attrs: Option, . ) -> PResult<'a, AttrWrapper> { 36,162 ( 0.00%) if let Some(attrs) = already_parsed_attrs { . Ok(attrs) . } else { 21,644 ( 0.00%) self.parse_outer_attributes() . } . } . . /// Parses a single token tree from the input. 24,736 ( 0.00%) pub(crate) fn parse_token_tree(&mut self) -> TokenTree { 12,260 ( 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. 110,894 ( 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. 73,026 ( 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; 4,692 ( 0.00%) let stream = frame.tree_cursor.stream.clone(); 4,692 ( 0.00%) let span = frame.span; 2,346 ( 0.00%) let delim = frame.delim; . // Consume close delimiter 4,692 ( 0.00%) self.bump(); 11,730 ( 0.00%) TokenTree::Delimited(span, delim, stream) . } . token::CloseDelim(_) | token::Eof => unreachable!(), . _ => { 1,492 ( 0.00%) self.bump(); 3,730 ( 0.00%) TokenTree::Token(self.prev_token.clone()) . } . } 21,644 ( 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 { 15,797 ( 0.00%) let old = self.restrictions; 19,473 ( 0.00%) self.restrictions = res; . let res = f(self); 17,739 ( 0.00%) self.restrictions = old; . res . } . 43,232 ( 0.00%) fn is_crate_vis(&self) -> bool { 27,020 ( 0.00%) self.token.is_keyword(kw::Crate) && self.look_ahead(1, |t| t != &token::ModSep) 48,636 ( 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. 28,340 ( 0.00%) pub fn parse_visibility(&mut self, fbt: FollowedByType) -> PResult<'a, Visibility> { 5,791 ( 0.00%) maybe_whole!(self, NtVis, |x| x); . 2,834 ( 0.00%) self.expected_tokens.push(TokenType::Keyword(kw::Crate)); 11,336 ( 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". 2,040 ( 0.00%) return Ok(Visibility { 6,120 ( 0.00%) span: self.token.span.shrink_to_lo(), . kind: VisibilityKind::Inherited, . tokens: None, . }); . } 794 ( 0.00%) let lo = self.prev_token.span; . 3,970 ( 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. 72 ( 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)`. 24 ( 0.00%) self.bump(); // `(` 16 ( 0.00%) self.bump(); // `crate` 24 ( 0.00%) self.expect(&token::CloseDelim(token::Paren))?; // `)` 8 ( 0.00%) let vis = VisibilityKind::Crate(CrateSugar::PubCrate); . return Ok(Visibility { 24 ( 0.00%) span: lo.to(self.prev_token.span), . kind: vis, . tokens: None, . }); . } 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` -- line 1317 ---------------------------------------- -- line 1338 ---------------------------------------- . } 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. . } . } . 2,358 ( 0.00%) Ok(Visibility { span: lo, kind: VisibilityKind::Public, tokens: None }) 25,506 ( 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 { 1,393 ( 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, . } . } . 12,370 ( 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, 1,898 ( 0.00%) |this, _attrs| Ok((f(this)?, TrailingToken::None)), . ) 12,370 ( 0.00%) } . . /// `::{` or `::*` 208,088 ( 0.00%) fn is_import_coupler(&mut self) -> bool { 104,044 ( 0.00%) self.check(&token::ModSep) . && self.look_ahead(1, |t| { 75,307 ( 0.00%) *t == token::OpenDelim(token::Brace) || *t == token::BinOp(token::Star) . }) 196,866 ( 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) . } . 39,160 ( 0.00%) pub fn emit_unclosed_delims(unclosed_delims: &mut Vec, sess: &ParseSess) { 19,580 ( 0.00%) *sess.reached_eof.borrow_mut() |= . unclosed_delims.iter().any(|unmatched_delim| unmatched_delim.found_delim.is_none()); 19,580 ( 0.00%) for unmatched in unclosed_delims.drain(..) { . if let Some(mut e) = make_unclosed_delims_error(unmatched, sess) { . e.emit(); . } . } 39,160 ( 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 . #[derive(Debug, Clone)] . pub enum FlatToken { -- line 1474 ---------------------------------------- 1,117,392 ( 0.01%) -------------------------------------------------------------------------------- -- 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)] 11,588,725 ( 0.14%) pub fn rustc_entry(&mut self, key: K) -> RustcEntry<'_, K, V, A> { . let hash = make_insert_hash(&self.hash_builder, &key); 147,598 ( 0.00%) if let Some(elem) = self.table.find(hash, |q| q.0.eq(&key)) { 1,186,305 ( 0.01%) RustcEntry::Occupied(RustcOccupiedEntry { 1,575,358 ( 0.02%) 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); . 2,216,140 ( 0.03%) RustcEntry::Vacant(RustcVacantEntry { . hash, 667,192 ( 0.01%) key, . table: &mut self.table, . }) . } 8,178,587 ( 0.10%) } . } . . /// 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 { 23,434 ( 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)] 66,602 ( 0.00%) pub fn insert(self, value: V) -> &'a mut V { . unsafe { 1,134,866 ( 0.01%) let bucket = self.table.insert_no_grow(self.hash, (self.key, value)); 26,055 ( 0.00%) &mut bucket.as_mut().1 . } 86,571 ( 0.00%) } . . /// Sets the value of the entry with the RustcVacantEntry's key, . /// and returns a RustcOccupiedEntry. . /// . /// # Examples . /// . /// ``` . /// use hashbrown::HashMap; -- line 589 ---------------------------------------- 1,999,335 ( 0.02%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/equate.rs -------------------------------------------------------------------------------- Ir -- line 24 ---------------------------------------- . } . . impl<'tcx> TypeRelation<'tcx> for Equate<'_, '_, 'tcx> { . fn tag(&self) -> &'static str { . "Equate" . } . . fn tcx(&self) -> TyCtxt<'tcx> { 96,355 ( 0.00%) self.fields.tcx() 62,550 ( 0.00%) } . . fn param_env(&self) -> ty::ParamEnv<'tcx> { 9,560 ( 0.00%) self.fields.param_env . } . . fn a_is_expected(&self) -> bool { 137,053 ( 0.00%) self.a_is_expected . } . 148,300 ( 0.00%) fn relate_item_substs( . &mut self, . _item_def_id: DefId, . a_subst: SubstsRef<'tcx>, . b_subst: SubstsRef<'tcx>, . ) -> RelateResult<'tcx, SubstsRef<'tcx>> { . // N.B., once we are equating types, we don't care about . // variance, so don't try to lookup the variance here. This . // also avoids some cycles (e.g., #41849) since looking up . // variance requires computing types which can require . // performing trait matching (which then performs equality . // unification). . 29,660 ( 0.00%) relate::relate_substs(self, None, a_subst, b_subst) 177,960 ( 0.00%) } . . fn relate_with_variance>( . &mut self, . _: ty::Variance, . _info: ty::VarianceDiagInfo<'tcx>, . a: T, . b: T, . ) -> RelateResult<'tcx, T> { . self.relate(a, b) . } . 4,760,262 ( 0.06%) fn tys(&mut self, a: Ty<'tcx>, b: Ty<'tcx>) -> RelateResult<'tcx, Ty<'tcx>> { . debug!("{}.tys({:?}, {:?})", self.tag(), a, b); 528,918 ( 0.01%) if a == b { . return Ok(a); . } . 534,404 ( 0.01%) let infcx = self.fields.infcx; 534,404 ( 0.01%) let a = infcx.inner.borrow_mut().type_variables().replace_if_possible(a); 534,404 ( 0.01%) let b = infcx.inner.borrow_mut().type_variables().replace_if_possible(b); . . debug!("{}.tys: replacements ({:?}, {:?})", self.tag(), a, b); . 1,846,600 ( 0.02%) match (a.kind(), b.kind()) { . (&ty::Infer(TyVar(a_id)), &ty::Infer(TyVar(b_id))) => { . infcx.inner.borrow_mut().type_variables().equate(a_id, b_id); . } . 2,781 ( 0.00%) (&ty::Infer(TyVar(a_id)), _) => { 11,124 ( 0.00%) self.fields.instantiate(b, RelationDir::EqTo, a_id, self.a_is_expected)?; . } . 118,775 ( 0.00%) (_, &ty::Infer(TyVar(b_id))) => { 593,875 ( 0.01%) self.fields.instantiate(a, RelationDir::EqTo, b_id, self.a_is_expected)?; . } . . _ => { 727,055 ( 0.01%) self.fields.infcx.super_combine_tys(self, a, b)?; . } . } . . Ok(a) 4,760,262 ( 0.06%) } . 373,176 ( 0.00%) fn regions( . &mut self, . a: ty::Region<'tcx>, . b: ty::Region<'tcx>, . ) -> RelateResult<'tcx, ty::Region<'tcx>> { . debug!("{}.regions({:?}, {:?})", self.tag(), a, b); 124,392 ( 0.00%) let origin = Subtype(Box::new(self.fields.trace.clone())); 248,784 ( 0.00%) self.fields . .infcx . .inner . .borrow_mut() . .unwrap_region_constraints() 248,784 ( 0.00%) .make_eqregion(origin, a, b); 82,928 ( 0.00%) Ok(a) 373,176 ( 0.00%) } . . fn consts( . &mut self, . a: &'tcx ty::Const<'tcx>, . b: &'tcx ty::Const<'tcx>, . ) -> RelateResult<'tcx, &'tcx ty::Const<'tcx>> { 11,977 ( 0.00%) self.fields.infcx.super_combine_consts(self, a, b) . } . 5,200 ( 0.00%) fn binders( . &mut self, . a: ty::Binder<'tcx, T>, . b: ty::Binder<'tcx, T>, . ) -> RelateResult<'tcx, ty::Binder<'tcx, T>> . where . T: Relate<'tcx>, . { 3,034 ( 0.00%) if a.skip_binder().has_escaping_bound_vars() || b.skip_binder().has_escaping_bound_vars() { 674 ( 0.00%) self.fields.higher_ranked_sub(a, b, self.a_is_expected)?; 566 ( 0.00%) self.fields.higher_ranked_sub(b, a, self.a_is_expected) . } else { . // Fast path for the common case. 1,362 ( 0.00%) self.relate(a.skip_binder(), b.skip_binder())?; 3,192 ( 0.00%) Ok(a) . } 4,356 ( 0.00%) } . } . . impl<'tcx> ConstEquateRelation<'tcx> for Equate<'_, '_, 'tcx> { . fn const_equate_obligation(&mut self, a: &'tcx ty::Const<'tcx>, b: &'tcx ty::Const<'tcx>) { . self.fields.add_const_equate_obligation(self.a_is_expected, a, b); . } . } 1,954,000 ( 0.02%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/smallvec-1.7.0/src/lib.rs -------------------------------------------------------------------------------- Ir -- line 294 ---------------------------------------- . #[allow(deprecated)] . impl From for CollectionAllocErr { . fn from(_: LayoutErr) -> Self { . CollectionAllocErr::CapacityOverflow . } . } . . fn infallible(result: Result) -> T { 628,487 ( 0.01%) match result { . Ok(x) => x, . Err(CollectionAllocErr::CapacityOverflow) => panic!("capacity overflow"), . Err(CollectionAllocErr::AllocErr { layout }) => alloc::alloc::handle_alloc_error(layout), . } . } . . /// FIXME: use `Layout::array` when we require a Rust version where it’s stable . /// https://github.com/rust-lang/rust/issues/55724 -- line 310 ---------------------------------------- -- line 422 ---------------------------------------- . #[cfg(feature = "union")] . impl SmallVecData { . #[inline] . unsafe fn inline(&self) -> *const A::Item { . self.inline.as_ptr() as *const A::Item . } . #[inline] . unsafe fn inline_mut(&mut self) -> *mut A::Item { 221,812 ( 0.00%) self.inline.as_mut_ptr() as *mut A::Item . } . #[inline] . fn from_inline(inline: MaybeUninit) -> SmallVecData { . SmallVecData { . inline: core::mem::ManuallyDrop::new(inline), . } . } . #[inline] . unsafe fn into_inline(self) -> MaybeUninit { . core::mem::ManuallyDrop::into_inner(self.inline) . } . #[inline] . unsafe fn heap(&self) -> (*mut A::Item, usize) { 98,708 ( 0.00%) self.heap . } . #[inline] . unsafe fn heap_mut(&mut self) -> &mut (*mut A::Item, usize) { . &mut self.heap . } . #[inline] . fn from_heap(ptr: *mut A::Item, len: usize) -> SmallVecData { . SmallVecData { heap: (ptr, len) } -- line 452 ---------------------------------------- -- line 557 ---------------------------------------- . #[inline] . pub fn new() -> SmallVec { . // Try to detect invalid custom implementations of `Array`. Hopefully, . // this check should be optimized away entirely for valid ones. . assert!( . mem::size_of::() == A::size() * mem::size_of::() . && mem::align_of::() >= mem::align_of::() . ); 1,370,640 ( 0.02%) SmallVec { . capacity: 0, . data: SmallVecData::from_inline(MaybeUninit::uninit()), . } . } . . /// Construct an empty vector with enough capacity pre-allocated to store at least `n` . /// elements. . /// -- line 573 ---------------------------------------- -- line 635 ---------------------------------------- . /// let small_vec: SmallVec<_> = SmallVec::from_buf(buf); . /// . /// assert_eq!(&*small_vec, &[1, 2, 3, 4, 5]); . /// ``` . #[inline] . pub fn from_buf(buf: A) -> SmallVec { . SmallVec { . capacity: A::size(), 28,035 ( 0.00%) data: SmallVecData::from_inline(MaybeUninit::new(buf)), . } . } . . /// Constructs a new `SmallVec` on the stack from an `A` without . /// copying elements. Also sets the length, which must be less or . /// equal to the size of `buf`. . /// . /// ```rust -- line 651 ---------------------------------------- -- line 653 ---------------------------------------- . /// . /// let buf = [1, 2, 3, 4, 5, 0, 0, 0]; . /// let small_vec: SmallVec<_> = SmallVec::from_buf_and_len(buf, 5); . /// . /// assert_eq!(&*small_vec, &[1, 2, 3, 4, 5]); . /// ``` . #[inline] . pub fn from_buf_and_len(buf: A, len: usize) -> SmallVec { 12 ( 0.00%) assert!(len <= A::size()); 36 ( 0.00%) unsafe { SmallVec::from_buf_and_len_unchecked(MaybeUninit::new(buf), len) } . } . . /// Constructs a new `SmallVec` on the stack from an `A` without . /// copying elements. Also sets the length. The user is responsible . /// for ensuring that `len <= A::size()`. . /// . /// ```rust . /// use smallvec::SmallVec; -- line 670 ---------------------------------------- -- line 674 ---------------------------------------- . /// let small_vec: SmallVec<_> = unsafe { . /// SmallVec::from_buf_and_len_unchecked(MaybeUninit::new(buf), 5) . /// }; . /// . /// assert_eq!(&*small_vec, &[1, 2, 3, 4, 5]); . /// ``` . #[inline] . pub unsafe fn from_buf_and_len_unchecked(buf: MaybeUninit, len: usize) -> SmallVec { 6 ( 0.00%) SmallVec { . capacity: len, . data: SmallVecData::from_inline(buf), . } . } . . /// Sets the length of a vector. . /// . /// This will explicitly set the size of the vector, without actually . /// modifying its buffers, so it is up to the caller to ensure that the . /// vector is actually the specified size. . pub unsafe fn set_len(&mut self, new_len: usize) { . let (_, len_ptr, _) = self.triple_mut(); 267,976 ( 0.00%) *len_ptr = new_len; . } . . /// The maximum number of elements this vector can hold inline . #[inline] . fn inline_capacity() -> usize { . if mem::size_of::() > 0 { 36 ( 0.00%) A::size() . } else { . // For zero-size items code like `ptr.add(offset)` always returns the same pointer. . // Therefore all items are at the same address, . // and any array size has capacity for infinitely many items. . // The capacity is limited by the bit width of the length field. . // . // `Vec` also does this: . // https://github.com/rust-lang/rust/blob/1.44.0/src/liballoc/raw_vec.rs#L186 -- line 710 ---------------------------------------- -- line 725 ---------------------------------------- . #[inline] . pub fn len(&self) -> usize { . self.triple().1 . } . . /// Returns `true` if the vector is empty . #[inline] . pub fn is_empty(&self) -> bool { 185,218 ( 0.00%) self.len() == 0 . } . . /// The number of items the vector can hold without reallocating . #[inline] . pub fn capacity(&self) -> usize { . self.triple().2 . } . . /// Returns a tuple with (data ptr, len, capacity) . /// Useful to get all SmallVec properties with a single check of the current storage variant. . #[inline] . fn triple(&self) -> (*const A::Item, usize, usize) { . unsafe { 9,718,206 ( 0.12%) if self.spilled() { . let (ptr, len) = self.data.heap(); . (ptr, len, self.capacity) . } else { . (self.data.inline(), self.capacity, Self::inline_capacity()) . } . } . } . . /// Returns a tuple with (data ptr, len ptr, capacity) . #[inline] . fn triple_mut(&mut self) -> (*mut A::Item, &mut usize, usize) { . unsafe { 15,718,295 ( 0.19%) if self.spilled() { 170,002 ( 0.00%) let &mut (ptr, ref mut len_ptr) = self.data.heap_mut(); . (ptr, len_ptr, self.capacity) . } else { . ( . self.data.inline_mut(), . &mut self.capacity, . Self::inline_capacity(), . ) . } . } . } . . /// Returns `true` if the data has spilled into a separate heap-allocated buffer. . #[inline] . pub fn spilled(&self) -> bool { 16,801,329 ( 0.20%) self.capacity > Self::inline_capacity() . } . . /// Creates a draining iterator that removes the specified range in the vector . /// and yields the removed items. . /// . /// Note 1: The element range is removed even if the iterator is only . /// partially consumed or not consumed at all. . /// -- line 784 ---------------------------------------- -- line 821 ---------------------------------------- . iter: range_slice.iter(), . vec: NonNull::from(self), . } . } . } . . /// Append an item to the vector. . #[inline] 275,120 ( 0.00%) pub fn push(&mut self, value: A::Item) { . unsafe { . let (mut ptr, mut len, cap) = self.triple_mut(); 2,726,891 ( 0.03%) if *len == cap { 1,362 ( 0.00%) self.reserve(1); 23,493 ( 0.00%) let &mut (heap_ptr, ref mut heap_len) = self.data.heap_mut(); . ptr = heap_ptr; . len = heap_len; . } 19,810 ( 0.00%) ptr::write(ptr.add(*len), value); 4,330,425 ( 0.05%) *len += 1; . } 220,120 ( 0.00%) } . . /// Remove an item from the end of the vector and return it, or None if empty. . #[inline] . pub fn pop(&mut self) -> Option { . unsafe { . let (ptr, len_ptr, _) = self.triple_mut(); 1,234,971 ( 0.01%) if *len_ptr == 0 { . return None; . } 337,811 ( 0.00%) let last_index = *len_ptr - 1; 342,598 ( 0.00%) *len_ptr = last_index; 298,940 ( 0.00%) Some(ptr::read(ptr.add(last_index))) . } 27 ( 0.00%) } . . /// Moves all the elements of `other` into `self`, leaving `other` empty. . /// . /// # Example . /// . /// ``` . /// # use smallvec::{SmallVec, smallvec}; . /// let mut v0: SmallVec<[u8; 16]> = smallvec![1, 2, 3]; -- line 863 ---------------------------------------- -- line 879 ---------------------------------------- . /// or if the capacity computation overflows `usize`. . pub fn grow(&mut self, new_cap: usize) { . infallible(self.try_grow(new_cap)) . } . . /// Re-allocate to set the capacity to `max(new_cap, inline_size())`. . /// . /// Panics if `new_cap` is less than the vector's length 95,568 ( 0.00%) pub fn try_grow(&mut self, new_cap: usize) -> Result<(), CollectionAllocErr> { . unsafe { 1,624 ( 0.00%) let (ptr, &mut len, cap) = self.triple_mut(); . let unspilled = !self.spilled(); 59,570 ( 0.00%) assert!(new_cap >= len); 59,570 ( 0.00%) if new_cap <= self.inline_size() { . if unspilled { . return Ok(()); . } . self.data = SmallVecData::from_inline(MaybeUninit::uninit()); . ptr::copy_nonoverlapping(ptr, self.data.inline_mut(), len); . self.capacity = len; . deallocate(ptr, cap); 59,570 ( 0.00%) } else if new_cap != cap { 57,589 ( 0.00%) let layout = layout_array::(new_cap)?; . debug_assert!(layout.size() > 0); . let new_alloc; 29,785 ( 0.00%) if unspilled { . new_alloc = NonNull::new(alloc::alloc::alloc(layout)) . .ok_or(CollectionAllocErr::AllocErr { layout })? . .cast() . .as_ptr(); . ptr::copy_nonoverlapping(ptr, new_alloc, len); . } else { . // This should never fail since the same succeeded . // when previously allocating `ptr`. 9,144 ( 0.00%) let old_layout = layout_array::(cap)?; . . let new_ptr = alloc::alloc::realloc(ptr as *mut u8, old_layout, layout.size()); . new_alloc = NonNull::new(new_ptr) . .ok_or(CollectionAllocErr::AllocErr { layout })? . .cast() . .as_ptr(); . } 59,570 ( 0.00%) self.data = SmallVecData::from_heap(new_alloc, len); 96,144 ( 0.00%) self.capacity = new_cap; . } . Ok(()) . } 97,192 ( 0.00%) } . . /// Reserve capacity for `additional` more elements to be inserted. . /// . /// May reserve more space to avoid frequent reallocations. . /// . /// Panics if the capacity computation overflows `usize`. . #[inline] 282,068 ( 0.00%) pub fn reserve(&mut self, additional: usize) { 677,800 ( 0.01%) infallible(self.try_reserve(additional)) 320,632 ( 0.00%) } . . /// Reserve capacity for `additional` more elements to be inserted. . /// . /// May reserve more space to avoid frequent reallocations. 2,536,093 ( 0.03%) pub fn try_reserve(&mut self, additional: usize) -> Result<(), CollectionAllocErr> { . // prefer triple_mut() even if triple() would work . // so that the optimizer removes duplicated calls to it . // from callers like insert() 26,302 ( 0.00%) let (_, &mut len, cap) = self.triple_mut(); 3,513,315 ( 0.04%) if cap - len >= additional { . return Ok(()); . } . let new_cap = len . .checked_add(additional) . .and_then(usize::checked_next_power_of_two) . .ok_or(CollectionAllocErr::CapacityOverflow)?; 6,816 ( 0.00%) self.try_grow(new_cap) 2,773,677 ( 0.03%) } . . /// Reserve the minimum capacity for `additional` more elements to be inserted. . /// . /// Panics if the new capacity overflows `usize`. . pub fn reserve_exact(&mut self, additional: usize) { . infallible(self.try_reserve_exact(additional)) . } . . /// Reserve the minimum capacity for `additional` more elements to be inserted. . pub fn try_reserve_exact(&mut self, additional: usize) -> Result<(), CollectionAllocErr> { . let (_, &mut len, cap) = self.triple_mut(); 426,697 ( 0.01%) if cap - len >= additional { . return Ok(()); . } . let new_cap = len . .checked_add(additional) . .ok_or(CollectionAllocErr::CapacityOverflow)?; 8,879 ( 0.00%) self.try_grow(new_cap) 8,879 ( 0.00%) } . . /// Shrink the capacity of the vector as much as possible. . /// . /// When possible, this will move data from an external heap buffer to the vector's inline . /// storage. . pub fn shrink_to_fit(&mut self) { . if !self.spilled() { . return; -- line 981 ---------------------------------------- -- line 999 ---------------------------------------- . /// If `len` is greater than or equal to the vector's current length, this has no . /// effect. . /// . /// This does not re-allocate. If you want the vector's capacity to shrink, call . /// `shrink_to_fit` after truncating. . pub fn truncate(&mut self, len: usize) { . unsafe { . let (ptr, len_ptr, _) = self.triple_mut(); 128,288 ( 0.00%) while len < *len_ptr { . let last_index = *len_ptr - 1; . *len_ptr = last_index; . ptr::drop_in_place(ptr.add(last_index)); . } . } . } . . /// Extracts a slice containing the entire vector. -- line 1015 ---------------------------------------- -- line 1044 ---------------------------------------- . pub fn clear(&mut self) { . self.truncate(0); . } . . /// Remove and return the element at position `index`, shifting all elements after it to the . /// left. . /// . /// Panics if `index` is out of bounds. 236 ( 0.00%) pub fn remove(&mut self, index: usize) -> A::Item { . unsafe { . let (mut ptr, len_ptr, _) = self.triple_mut(); 7,639 ( 0.00%) let len = *len_ptr; 26,841 ( 0.00%) assert!(index < len); 48,129 ( 0.00%) *len_ptr = len - 1; . ptr = ptr.add(index); . let item = ptr::read(ptr); 17,894 ( 0.00%) ptr::copy(ptr.add(1), ptr, len - index - 1); . item . } 295 ( 0.00%) } . . /// Insert an element at position `index`, shifting all elements after it to the right. . /// . /// Panics if `index` is out of bounds. 157,584 ( 0.00%) pub fn insert(&mut self, index: usize, element: A::Item) { . self.reserve(1); . . unsafe { . let (mut ptr, len_ptr, _) = self.triple_mut(); 14,801 ( 0.00%) let len = *len_ptr; 29,134 ( 0.00%) assert!(index <= len); 58,268 ( 0.00%) *len_ptr = len + 1; . ptr = ptr.add(index); 29,134 ( 0.00%) ptr::copy(ptr, ptr.add(1), len - index); . ptr::write(ptr, element); . } 100,283 ( 0.00%) } . . /// Insert multiple elements at position `index`, shifting all following elements toward the . /// back. . pub fn insert_many>(&mut self, index: usize, iterable: I) { . let mut iter = iterable.into_iter(); . if index == self.len() { . return self.extend(iter); . } -- line 1088 ---------------------------------------- -- line 1201 ---------------------------------------- . } . } . . /// Retains only the elements specified by the predicate. . /// . /// In other words, remove all elements `e` such that `f(&e)` returns `false`. . /// This method operates in place and preserves the order of the retained . /// elements. 267,498 ( 0.00%) pub fn retain bool>(&mut self, mut f: F) { . let mut del = 0; . let len = self.len(); . for i in 0..len { 87,528 ( 0.00%) if !f(&mut self[i]) { 392 ( 0.00%) del += 1; 26,590 ( 0.00%) } else if del > 0 { 300 ( 0.00%) self.swap(i - del, i); . } . } 59,444 ( 0.00%) self.truncate(len - del); 237,776 ( 0.00%) } . . /// Removes consecutive duplicate elements. 259 ( 0.00%) pub fn dedup(&mut self) . where . A::Item: PartialEq, . { . self.dedup_by(|a, b| a == b); 296 ( 0.00%) } . . /// Removes consecutive duplicate elements using the given equality relation. . pub fn dedup_by(&mut self, mut same_bucket: F) . where . F: FnMut(&mut A::Item, &mut A::Item) -> bool, . { . // See the implementation of Vec::dedup_by in the . // standard library for an explanation of this algorithm. . let len = self.len(); 74 ( 0.00%) if len <= 1 { . return; . } . . let ptr = self.as_mut_ptr(); . let mut w: usize = 1; . . unsafe { . for r in 1..len { . let p_r = ptr.add(r); 19 ( 0.00%) let p_wm1 = ptr.add(w - 1); . if !same_bucket(&mut *p_r, &mut *p_wm1) { 6 ( 0.00%) if r != w { . let p_w = p_wm1.add(1); . mem::swap(&mut *p_r, &mut *p_w); . } 6 ( 0.00%) w += 1; . } . } . } . . self.truncate(w); . } . . /// Removes consecutive elements that map to the same key. -- line 1262 ---------------------------------------- -- line 1418 ---------------------------------------- . capacity: len, . data: SmallVecData::from_inline(unsafe { . let mut data: MaybeUninit = MaybeUninit::uninit(); . ptr::copy_nonoverlapping( . slice.as_ptr(), . data.as_mut_ptr() as *mut A::Item, . len, . ); 6,954 ( 0.00%) data . }), . } . } else { . let mut b = slice.to_vec(); . let (ptr, cap) = (b.as_mut_ptr(), b.capacity()); . mem::forget(b); . SmallVec { . capacity: cap, -- line 1434 ---------------------------------------- -- line 1436 ---------------------------------------- . } . } . } . . /// Copy elements from a slice into the vector at position `index`, shifting any following . /// elements toward the back. . /// . /// For slices of `Copy` types, this is more efficient than `insert`. 1,356,459 ( 0.02%) pub fn insert_from_slice(&mut self, index: usize, slice: &[A::Item]) { . self.reserve(slice.len()); . . let len = self.len(); 432,588 ( 0.01%) assert!(index <= len); . . unsafe { . let slice_ptr = slice.as_ptr(); . let ptr = self.as_mut_ptr().add(index); . ptr::copy(ptr, ptr.add(slice.len()), len - index); . ptr::copy_nonoverlapping(slice_ptr, ptr, slice.len()); 288,392 ( 0.00%) self.set_len(len + slice.len()); . } 1,153,568 ( 0.01%) } . . /// Copy elements from a slice and append them to the vector. . /// . /// For slices of `Copy` types, this is more efficient than `extend`. . #[inline] . pub fn extend_from_slice(&mut self, slice: &[A::Item]) { . let len = self.len(); 467,875 ( 0.01%) self.insert_from_slice(len, slice); . } . } . . impl SmallVec . where . A::Item: Clone, . { . /// Resizes the vector so that its length is equal to `len`. -- line 1473 ---------------------------------------- -- line 1522 ---------------------------------------- . } . } . } . . impl ops::DerefMut for SmallVec { . #[inline] . fn deref_mut(&mut self) -> &mut [A::Item] { . unsafe { 162,176 ( 0.00%) let (ptr, &mut len, _) = self.triple_mut(); . slice::from_raw_parts_mut(ptr, len) . } . } . } . . impl AsRef<[A::Item]> for SmallVec { . #[inline] . fn as_ref(&self) -> &[A::Item] { -- line 1538 ---------------------------------------- -- line 1716 ---------------------------------------- . SmallVec::extend_from_slice(self, other) . } . } . . impl FromIterator for SmallVec { . #[inline] . fn from_iter>(iterable: I) -> SmallVec { . let mut v = SmallVec::new(); 4,022,780 ( 0.05%) v.extend(iterable); . v . } . } . . impl Extend for SmallVec { 5,548,705 ( 0.07%) fn extend>(&mut self, iterable: I) { 1,803,861 ( 0.02%) let mut iter = iterable.into_iter(); 2 ( 0.00%) let (lower_size_bound, _) = iter.size_hint(); 64,411 ( 0.00%) self.reserve(lower_size_bound); . . unsafe { . let (ptr, len_ptr, cap) = self.triple_mut(); . let mut len = SetLenOnDrop::new(len_ptr); 5,969,953 ( 0.07%) while len.get() < cap { 5,304,139 ( 0.06%) if let Some(out) = iter.next() { 78 ( 0.00%) ptr::write(ptr.add(len.get()), out); . len.increment_len(1); . } else { . return; . } . } . } . 240,244 ( 0.00%) for elem in iter { 31,702 ( 0.00%) self.push(elem); . } 5,303,820 ( 0.06%) } . } . . impl fmt::Debug for SmallVec . where . A::Item: fmt::Debug, . { . fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { . f.debug_list().entries(self.iter()).finish() -- line 1759 ---------------------------------------- -- line 1764 ---------------------------------------- . #[inline] . fn default() -> SmallVec { . SmallVec::new() . } . } . . #[cfg(feature = "may_dangle")] . unsafe impl<#[may_dangle] A: Array> Drop for SmallVec { 1,191,910 ( 0.01%) fn drop(&mut self) { . unsafe { 3,712,111 ( 0.04%) if self.spilled() { . let (ptr, len) = self.data.heap(); . Vec::from_raw_parts(ptr, len, self.capacity); . } else { . ptr::drop_in_place(&mut self[..]); . } . } 1,305,958 ( 0.02%) } . } . . #[cfg(not(feature = "may_dangle"))] . impl Drop for SmallVec { . fn drop(&mut self) { . unsafe { . if self.spilled() { . let (ptr, len) = self.data.heap(); -- line 1789 ---------------------------------------- -- line 1888 ---------------------------------------- . A::Item: Clone, . { . fn clone(&self) -> IntoIter { . SmallVec::from(self.as_slice()).into_iter() . } . } . . impl Drop for IntoIter { 6,100 ( 0.00%) fn drop(&mut self) { 162,466 ( 0.00%) for _ in self {} 5,472 ( 0.00%) } . } . . impl Iterator for IntoIter { . type Item = A::Item; . . #[inline] . fn next(&mut self) -> Option { 837,637 ( 0.01%) if self.current == self.end { 5,196 ( 0.00%) None . } else { . unsafe { . let current = self.current; 420,513 ( 0.01%) self.current += 1; 14,617 ( 0.00%) Some(ptr::read(self.data.as_ptr().add(current))) . } . } . } . . #[inline] . fn size_hint(&self) -> (usize, Option) { 29,305 ( 0.00%) let size = self.end - self.current; . (size, Some(size)) . } . } . . impl DoubleEndedIterator for IntoIter { . #[inline] . fn next_back(&mut self) -> Option { . if self.current == self.end { -- line 1927 ---------------------------------------- -- line 1955 ---------------------------------------- . impl IntoIterator for SmallVec { . type IntoIter = IntoIter; . type Item = A::Item; . fn into_iter(mut self) -> Self::IntoIter { . unsafe { . // Set SmallVec len to zero as `IntoIter` drop handles dropping of the elements . let len = self.len(); . self.set_len(0); 76,992 ( 0.00%) IntoIter { 559,742 ( 0.01%) data: self, . current: 0, . end: len, . } . } . } . } . . impl<'a, A: Array> IntoIterator for &'a SmallVec { -- line 1972 ---------------------------------------- -- line 2000 ---------------------------------------- . len: &'a mut usize, . local_len: usize, . } . . impl<'a> SetLenOnDrop<'a> { . #[inline] . fn new(len: &'a mut usize) -> Self { . SetLenOnDrop { 677,670 ( 0.01%) local_len: *len, . len, . } . } . . #[inline] . fn get(&self) -> usize { . self.local_len . } . . #[inline] . fn increment_len(&mut self, increment: usize) { 1,957,535 ( 0.02%) self.local_len += increment; . } . } . . impl<'a> Drop for SetLenOnDrop<'a> { . #[inline] . fn drop(&mut self) { 915,654 ( 0.01%) *self.len = self.local_len; . } . } . . #[cfg(feature = "const_new")] . impl SmallVec<[T; N]> { . /// Construct an empty vector. . /// . /// This is a `const` version of [`SmallVec::new`] that is enabled by the feature `const_new`, with the limitation that it only works for arrays. -- line 2035 ---------------------------------------- 14,229,387 ( 0.17%) -------------------------------------------------------------------------------- -- 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> { 435 ( 0.00%) pub ty: Ty<'tcx>, 2,175 ( 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 { 45,337 ( 0.00%) pub scope: DefId, 95,755 ( 0.00%) pub bound_region: BoundRegionKind, . } . 1,016,797 ( 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) 80,197 ( 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. 2,237 ( 0.00%) BrNamed(DefId, Symbol), . . /// Anonymous region for the implicit env pointer parameter . /// to a closure . BrEnv, . } . 2,184 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, Hash, TyEncodable, TyDecodable, Debug, PartialOrd, Ord)] . #[derive(HashStable)] . pub struct BoundRegion { 213,944 ( 0.00%) pub var: BoundVar, 179,516 ( 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. 65,863,708 ( 0.79%) #[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. 6,836,303 ( 0.08%) 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]`. 105,504 ( 0.00%) Array(Ty<'tcx>, &'tcx ty::Const<'tcx>), . . /// The pointee of an array slice. Written as `[T]`. . Slice(Ty<'tcx>), . . /// A raw pointer. Written as `*mut T` or `*const T` . RawPtr(TypeAndMut<'tcx>), . . /// A reference; a pointer with an associated lifetime. Written as . /// `&'a mut T` or `&'a T`. 4,525,676 ( 0.05%) 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`. 77,933 ( 0.00%) Dynamic(&'tcx List>>, ty::Region<'tcx>), . . /// The anonymous type of a closure. Used to represent the type of . /// `|a| a`. . Closure(DefId, SubstsRef<'tcx>), . . /// The anonymous type of a generator. Used to represent the type of . /// `|a| yield a`. . Generator(DefId, SubstsRef<'tcx>, hir::Movability), -- line 159 ---------------------------------------- -- line 180 ---------------------------------------- . /// The substitutions are for the generics of the function in question. . /// After typeck, the concrete type can be found in the `types` map. . Opaque(DefId, SubstsRef<'tcx>), . . /// A type parameter; for example, `T` in `fn f(x: T) {}`. . Param(ParamTy), . . /// Bound type variable, used only when preparing a trait query. 10,246 ( 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. 56 ( 0.00%) pub fn new( . tcx: TyCtxt<'tcx>, . parts: ClosureSubstsParts<'tcx, Ty<'tcx>>, . ) -> ClosureSubsts<'tcx> { . ClosureSubsts { . substs: tcx.mk_substs( 112 ( 0.00%) parts.parent_substs.iter().copied().chain( 224 ( 0.00%) [parts.closure_kind_ty, parts.closure_sig_as_fn_ptr_ty, parts.tupled_upvars_ty] . .iter() . .map(|&ty| ty.into()), . ), . ), . } 112 ( 0.00%) } . . /// Divides the closure substs into their respective components. . /// The ordering assumed here must match that used by `ClosureSubsts::new` above. 1,564 ( 0.00%) fn split(self) -> ClosureSubstsParts<'tcx, GenericArg<'tcx>> { . match self.substs[..] { 46,510 ( 0.00%) [ 6,294 ( 0.00%) ref parent_substs @ .., 5,465 ( 0.00%) closure_kind_ty, 15,425 ( 0.00%) closure_sig_as_fn_ptr_ty, 3,929 ( 0.00%) tupled_upvars_ty, 6,256 ( 0.00%) ] => ClosureSubstsParts { . parent_substs, . closure_kind_ty, . closure_sig_as_fn_ptr_ty, . tupled_upvars_ty, . }, . _ => bug!("closure substs missing synthetics"), . } 4,692 ( 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. . pub fn is_valid(self) -> bool { . self.substs.len() >= 3 -- line 378 ---------------------------------------- -- line 383 ---------------------------------------- . 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] 102 ( 0.00%) pub fn upvar_tys(self) -> impl Iterator> + 'tcx { 348 ( 0.00%) match self.tupled_upvars_ty().kind() { . TyKind::Error(_) => None, 232 ( 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() 68 ( 0.00%) } . . /// Returns the tuple type representing the upvars for this closure. . #[inline] . pub fn tupled_upvars_ty(self) -> Ty<'tcx> { 7,257 ( 0.00%) self.split().tupled_upvars_ty.expect_ty() . } . . /// Returns the closure kind for this closure; may return a type . /// variable during inference. To get the closure kind during . /// inference, use `infcx.closure_kind(substs)`. 1,408 ( 0.00%) pub fn kind_ty(self) -> Ty<'tcx> { . self.split().closure_kind_ty.expect_ty() 2,816 ( 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`. 2 ( 0.00%) pub fn sig_as_fn_ptr_ty(self) -> Ty<'tcx> { . self.split().closure_sig_as_fn_ptr_ty.expect_ty() 4 ( 0.00%) } . . /// 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()`. 16 ( 0.00%) pub fn kind(self) -> ty::ClosureKind { 16 ( 0.00%) self.kind_ty().to_opt_closure_kind().unwrap() 32 ( 0.00%) } . . /// Extracts the signature from the closure. 13,058 ( 0.00%) pub fn sig(self) -> ty::PolyFnSig<'tcx> { . let ty = self.sig_as_fn_ptr_ty(); 26,116 ( 0.00%) match ty.kind() { 52,232 ( 0.00%) ty::FnPtr(sig) => *sig, . _ => bug!("closure_sig_as_fn_ptr_ty is not a fn-ptr: {:?}", ty.kind()), . } 39,174 ( 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 676 ---------------------------------------- . } . . 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 { 144 ( 0.00%) let tupled_tys = match self { 200 ( 0.00%) UpvarSubsts::Closure(substs) => substs.as_closure().tupled_upvars_ty(), . UpvarSubsts::Generator(substs) => substs.as_generator().tupled_upvars_ty(), . }; . 328 ( 0.00%) match tupled_tys.kind() { . TyKind::Error(_) => None, 272 ( 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> { 256 ( 0.00%) match self { 274 ( 0.00%) UpvarSubsts::Closure(substs) => substs.as_closure().tupled_upvars_ty(), . UpvarSubsts::Generator(substs) => substs.as_generator().tupled_upvars_ty(), . } . } . } . . /// An inline const is modeled like . /// . /// const InlineConst<'l0...'li, T0...Tj, R>: R; -- line 710 ---------------------------------------- -- line 760 ---------------------------------------- . } . . /// Returns the type of this inline const. . pub fn ty(self) -> Ty<'tcx> { . self.split().ty.expect_ty() . } . } . 102,860 ( 0.00%) #[derive(Debug, Copy, Clone, PartialEq, PartialOrd, Ord, Eq, Hash, TyEncodable, TyDecodable)] 94,873 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub enum ExistentialPredicate<'tcx> { . /// E.g., `Iterator`. . Trait(ExistentialTraitRef<'tcx>), . /// E.g., `Iterator::Item = T`. . Projection(ExistentialProjection<'tcx>), . /// E.g., `Send`. 507 ( 0.00%) AutoTrait(DefId), . } . . impl<'tcx> ExistentialPredicate<'tcx> { . /// Compares via an ordering that will not change if modules are reordered or other changes are . /// made to the tree. In particular, this ordering is preserved across incremental compilations. 11,340 ( 0.00%) pub fn stable_cmp(&self, tcx: TyCtxt<'tcx>, other: &Self) -> Ordering { . use self::ExistentialPredicate::*; 16,698 ( 0.00%) match (*self, *other) { . (Trait(_), Trait(_)) => Ordering::Equal, . (Projection(ref a), Projection(ref b)) => { . tcx.def_path_hash(a.item_def_id).cmp(&tcx.def_path_hash(b.item_def_id)) . } . (AutoTrait(ref a), AutoTrait(ref b)) => { . tcx.def_path_hash(*a).cmp(&tcx.def_path_hash(*b)) . } . (Trait(_), _) => Ordering::Less, . (Projection(_), Trait(_)) => Ordering::Greater, . (Projection(_), _) => Ordering::Less, . (AutoTrait(_), _) => Ordering::Greater, . } 13,608 ( 0.00%) } . } . . impl<'tcx> Binder<'tcx, ExistentialPredicate<'tcx>> { 8,613 ( 0.00%) pub fn with_self_ty(&self, tcx: TyCtxt<'tcx>, self_ty: Ty<'tcx>) -> ty::Predicate<'tcx> { . use crate::ty::ToPredicate; 4,801 ( 0.00%) match self.skip_binder() { . ExistentialPredicate::Trait(tr) => { . self.rebind(tr).with_self_ty(tcx, self_ty).without_const().to_predicate(tcx) . } . ExistentialPredicate::Projection(p) => { 4 ( 0.00%) self.rebind(p.with_self_ty(tcx, self_ty)).to_predicate(tcx) . } . ExistentialPredicate::AutoTrait(did) => { . let trait_ref = self.rebind(ty::TraitRef { . def_id: did, . substs: tcx.mk_substs_trait(self_ty, &[]), . }); . trait_ref.without_const().to_predicate(tcx) . } . } 7,656 ( 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. 71 ( 0.00%) pub fn principal(&self) -> Option>> { 3,224 ( 0.00%) self[0] 3,011 ( 0.00%) .map_bound(|this| match this { . ExistentialPredicate::Trait(tr) => Some(tr), . _ => None, 284 ( 0.00%) }) . .transpose() 213 ( 0.00%) } . 948 ( 0.00%) pub fn principal_def_id(&self) -> Option { . self.principal().map(|trait_ref| trait_ref.skip_binder().def_id) 1,896 ( 0.00%) } . . #[inline] . pub fn projection_bounds<'a>( . &'a self, . ) -> impl Iterator>> + 'a { . self.iter().filter_map(|predicate| { 36 ( 0.00%) predicate 148 ( 0.00%) .map_bound(|pred| match pred { 12 ( 0.00%) ExistentialPredicate::Projection(projection) => Some(projection), . _ => None, . }) . .transpose() . }) . } . . #[inline] . pub fn auto_traits<'a>(&'a self) -> impl Iterator + 'a { 38 ( 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. 26,148 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)] 9,982,608 ( 0.12%) #[derive(HashStable, TypeFoldable)] . pub struct TraitRef<'tcx> { 29,094 ( 0.00%) pub def_id: DefId, 5,585,381 ( 0.07%) pub substs: SubstsRef<'tcx>, . } . . impl<'tcx> TraitRef<'tcx> { 5,732 ( 0.00%) pub fn new(def_id: DefId, substs: SubstsRef<'tcx>) -> TraitRef<'tcx> { . TraitRef { def_id, substs } 22,928 ( 0.00%) } . . /// Returns a `TraitRef` of the form `P0: Foo` where `Pi` . /// are the parameters defined on trait. 1,575 ( 0.00%) pub fn identity(tcx: TyCtxt<'tcx>, def_id: DefId) -> Binder<'tcx, TraitRef<'tcx>> { 700 ( 0.00%) ty::Binder::dummy(TraitRef { . def_id, 1,050 ( 0.00%) substs: InternalSubsts::identity_for_item(tcx, def_id), . }) 1,400 ( 0.00%) } . . #[inline] . pub fn self_ty(&self) -> Ty<'tcx> { . self.substs.type_at(0) . } . 2,160 ( 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); . 270 ( 0.00%) ty::TraitRef { def_id: trait_id, substs: tcx.intern_substs(&substs[..defs.params.len()]) } 2,970 ( 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 { 9,249 ( 0.00%) self.skip_binder().def_id 3,083 ( 0.00%) } . 41,588 ( 0.00%) pub fn to_poly_trait_predicate(&self) -> ty::PolyTraitPredicate<'tcx> { 83,176 ( 0.00%) self.map_bound(|trait_ref| ty::TraitPredicate { . trait_ref, . constness: ty::BoundConstness::NotConst, . polarity: ty::ImplPolarity::Positive, . }) 41,588 ( 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). 140 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)] 32,854 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub struct ExistentialTraitRef<'tcx> { 4,466 ( 0.00%) pub def_id: DefId, 37,672 ( 0.00%) pub substs: SubstsRef<'tcx>, . } . . impl<'tcx> ExistentialTraitRef<'tcx> { 304 ( 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..]), . } 304 ( 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. 36 ( 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()); . 18 ( 0.00%) ty::TraitRef { def_id: self.def_id, substs: tcx.mk_substs_trait(self_ty, self.substs) } 90 ( 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. 84 ( 0.00%) pub fn with_self_ty(&self, tcx: TyCtxt<'tcx>, self_ty: Ty<'tcx>) -> ty::PolyTraitRef<'tcx> { 84 ( 0.00%) self.map_bound(|trait_ref| trait_ref.with_self_ty(tcx, self_ty)) 112 ( 0.00%) } . } . 79,866 ( 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. 106,895 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)] 2,764,104 ( 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. 124,987 ( 0.00%) pub fn dummy(value: T) -> Binder<'tcx, T> { 352,026 ( 0.00%) assert!(!value.has_escaping_bound_vars()); 1,031,347 ( 0.01%) Binder(value, ty::List::empty()) 124,602 ( 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); . } 53,422 ( 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 { 8,124,112 ( 0.10%) self.0 . } . . pub fn bound_vars(&self) -> &'tcx List { 6,991 ( 0.00%) self.1 . } . . pub fn as_ref(&self) -> Binder<'tcx, &T> { 111,942 ( 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) . } . 811 ( 0.00%) pub fn map_bound>(self, f: F) -> Binder<'tcx, U> . where . F: FnOnce(T) -> U, . { 210,386 ( 0.00%) let value = f(self.0); . if cfg!(debug_assertions) { . let mut validator = ValidateBoundVars::new(self.1); . value.visit_with(&mut validator); . } 1,506,832 ( 0.02%) Binder(value, self.1) 805 ( 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); . } 41,858 ( 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); . } 196,972 ( 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>, . { 1,180,378 ( 0.01%) if self.0.has_escaping_bound_vars() { None } else { Some(self.skip_binder()) } 8,780 ( 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,838 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)] 1,165,134 ( 0.01%) #[derive(HashStable, TypeFoldable)] . pub struct ProjectionTy<'tcx> { . /// The parameters of the associated item. 1,043,976 ( 0.01%) 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`. 902,216 ( 0.01%) pub item_def_id: DefId, . } . . impl<'tcx> ProjectionTy<'tcx> { 394,541 ( 0.00%) pub fn trait_def_id(&self, tcx: TyCtxt<'tcx>) -> DefId { 112,726 ( 0.00%) tcx.associated_item(self.item_def_id).container.id() 450,904 ( 0.01%) } . . /// 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 26,278 ( 0.00%) pub fn trait_ref_and_own_substs( . &self, . tcx: TyCtxt<'tcx>, . ) -> (ty::TraitRef<'tcx>, &'tcx [ty::GenericArg<'tcx>]) { 11,262 ( 0.00%) let def_id = tcx.associated_item(self.item_def_id).container.id(); . let trait_generics = tcx.generics_of(def_id); 18,770 ( 0.00%) ( . ty::TraitRef { def_id, substs: self.substs.truncate_to(tcx, trait_generics) }, . &self.substs[trait_generics.count()..], . ) 33,786 ( 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. 506,817 ( 0.01%) pub fn trait_ref(&self, tcx: TyCtxt<'tcx>) -> ty::TraitRef<'tcx> { 56,313 ( 0.00%) let def_id = self.trait_def_id(tcx); 56,313 ( 0.00%) ty::TraitRef { def_id, substs: self.substs.truncate_to(tcx, tcx.generics_of(def_id)) } 619,443 ( 0.01%) } . 86,998 ( 0.00%) pub fn self_ty(&self) -> Ty<'tcx> { 260,994 ( 0.00%) self.substs.type_at(0) 173,996 ( 0.00%) } . } . . #[derive(Copy, Clone, Debug, TypeFoldable)] . pub struct GenSig<'tcx> { . pub resume_ty: Ty<'tcx>, . pub yield_ty: Ty<'tcx>, . pub return_ty: Ty<'tcx>, . } -- line 1233 ---------------------------------------- -- line 1235 ---------------------------------------- . pub type PolyGenSig<'tcx> = Binder<'tcx, GenSig<'tcx>>; . . /// Signature of a function type, which we have arbitrarily . /// decided to use to refer to the input/output types. . /// . /// - `inputs`: is the list of arguments and their modes. . /// - `output`: is the return type. . /// - `c_variadic`: indicates whether this is a C-variadic function. 101,042 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)] 221,187 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub struct FnSig<'tcx> { 154,892 ( 0.00%) pub inputs_and_output: &'tcx List>, 1,035,010 ( 0.01%) pub c_variadic: bool, 256,901 ( 0.00%) pub unsafety: hir::Unsafety, 558,995 ( 0.01%) pub abi: abi::Abi, . } . . impl<'tcx> FnSig<'tcx> { 150,872 ( 0.00%) pub fn inputs(&self) -> &'tcx [Ty<'tcx>] { 619,247 ( 0.01%) &self.inputs_and_output[..self.inputs_and_output.len() - 1] 301,744 ( 0.00%) } . 90,256 ( 0.00%) pub fn output(&self) -> Ty<'tcx> { 646,825 ( 0.01%) self.inputs_and_output[self.inputs_and_output.len() - 1] 180,512 ( 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>]> { 9,462 ( 0.00%) self.map_bound_ref_unchecked(|fn_sig| fn_sig.inputs()) . } . #[inline] . pub fn input(&self, index: usize) -> ty::Binder<'tcx, Ty<'tcx>> { 30,892 ( 0.00%) self.map_bound_ref(|fn_sig| fn_sig.inputs()[index]) . } . pub fn inputs_and_output(&self) -> ty::Binder<'tcx, &'tcx List>> { . self.map_bound_ref(|fn_sig| fn_sig.inputs_and_output) 1,123 ( 0.00%) } . #[inline] . pub fn output(&self) -> ty::Binder<'tcx, Ty<'tcx>> { 20,518 ( 0.00%) self.map_bound_ref(|fn_sig| fn_sig.output()) . } . pub fn c_variadic(&self) -> bool { 2,234 ( 0.00%) self.skip_binder().c_variadic 1,117 ( 0.00%) } . pub fn unsafety(&self) -> hir::Unsafety { 13,052 ( 0.00%) self.skip_binder().unsafety 6,526 ( 0.00%) } . pub fn abi(&self) -> abi::Abi { 21,480 ( 0.00%) self.skip_binder().abi 5,370 ( 0.00%) } . } . . pub type CanonicalPolyFnSig<'tcx> = Canonical<'tcx, Binder<'tcx, FnSig<'tcx>>>; . 712 ( 0.00%) #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)] . #[derive(HashStable)] . pub struct ParamTy { 3,762 ( 0.00%) pub index: u32, . pub name: Symbol, . } . . impl<'tcx> ParamTy { 3,024 ( 0.00%) pub fn new(index: u32, name: Symbol) -> ParamTy { . ParamTy { index, name } 1,512 ( 0.00%) } . . pub fn for_def(def: &ty::GenericParamDef) -> ParamTy { 462 ( 0.00%) ParamTy::new(def.index, def.name) 231 ( 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 { 110 ( 0.00%) pub index: u32, 110 ( 0.00%) pub name: Symbol, . } . . impl ParamConst { . pub fn new(index: u32, name: Symbol) -> ParamConst { . ParamConst { index, name } . } . . pub fn for_def(def: &ty::GenericParamDef) -> ParamConst { -- line 1338 ---------------------------------------- -- line 1440 ---------------------------------------- . /// the inference variable is supposed to satisfy the relation . /// *for every value of the placeholder region*. To ensure that doesn't . /// happen, you can use `leak_check`. This is more clearly explained . /// by the [rustc dev guide]. . /// . /// [1]: https://smallcultfollowing.com/babysteps/blog/2013/10/29/intermingled-parameter-lists/ . /// [2]: https://smallcultfollowing.com/babysteps/blog/2013/11/04/intermingled-parameter-lists/ . /// [rustc dev guide]: https://rustc-dev-guide.rust-lang.org/traits/hrtb.html 13,450,892 ( 0.16%) #[derive(Clone, PartialEq, Eq, Hash, Copy, TyEncodable, TyDecodable, PartialOrd, Ord)] 46 ( 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. 347,680 ( 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, . } . 16,848 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, Hash, TyEncodable, TyDecodable, Debug, PartialOrd, Ord)] . pub struct EarlyBoundRegion { 853,253 ( 0.01%) pub def_id: DefId, 826,674 ( 0.01%) pub index: u32, 462,503 ( 0.01%) pub name: Symbol, . } . . /// A **`const`** **v**ariable **ID**. . #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)] . pub struct ConstVid<'tcx> { 4,625 ( 0.00%) pub index: u32, 995 ( 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, 10,246 ( 0.00%) pub kind: BoundTyKind, . } . 174,863 ( 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`. 39 ( 0.00%) #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)] 9,844 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub struct ExistentialProjection<'tcx> { 2,308 ( 0.00%) pub item_def_id: DefId, 10,345 ( 0.00%) pub substs: SubstsRef<'tcx>, 2,512 ( 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. 595 ( 0.00%) pub fn trait_ref(&self, tcx: TyCtxt<'tcx>) -> ty::ExistentialTraitRef<'tcx> { 255 ( 0.00%) let def_id = tcx.associated_item(self.item_def_id).container.id(); 170 ( 0.00%) let subst_count = tcx.generics_of(def_id).count() - 1; 85 ( 0.00%) let substs = tcx.intern_substs(&self.substs[..subst_count]); . ty::ExistentialTraitRef { def_id, substs } 765 ( 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, . } . } . 15 ( 0.00%) pub fn erase_self_ty( . tcx: TyCtxt<'tcx>, . projection_predicate: ty::ProjectionPredicate<'tcx>, . ) -> Self { . // Assert there is a Self. 9 ( 0.00%) projection_predicate.projection_ty.substs.type_at(0); . 12 ( 0.00%) Self { 6 ( 0.00%) item_def_id: projection_predicate.projection_ty.item_def_id, . substs: tcx.intern_substs(&projection_predicate.projection_ty.substs[1..]), 3 ( 0.00%) term: projection_predicate.term, . } 21 ( 0.00%) } . } . . impl<'tcx> PolyExistentialProjection<'tcx> { 30 ( 0.00%) pub fn with_self_ty( . &self, . tcx: TyCtxt<'tcx>, . self_ty: Ty<'tcx>, . ) -> ty::PolyProjectionPredicate<'tcx> { 30 ( 0.00%) self.map_bound(|p| p.with_self_ty(tcx, self_ty)) 36 ( 0.00%) } . . pub fn item_def_id(&self) -> DefId { 12 ( 0.00%) self.skip_binder().item_def_id 6 ( 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 { 4,756 ( 0.00%) matches!(*self, ty::ReLateBound(..)) . } . . #[inline] . pub fn is_placeholder(&self) -> bool { . matches!(*self, ty::RePlaceholder(..)) . } . . #[inline] . pub fn bound_at_or_above_binder(&self, index: ty::DebruijnIndex) -> bool { 237,501 ( 0.00%) match *self { . ty::ReLateBound(debruijn, _) => debruijn >= index, . _ => false, . } . } . . pub fn type_flags(&self) -> TypeFlags { . let mut flags = TypeFlags::empty(); . 276,320 ( 0.00%) 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 10,533 ( 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 { 6,244 ( 0.00%) match self.kind() { 1,165 ( 0.00%) Tuple(ref tys) => tys.is_empty(), . _ => false, . } . } . . #[inline] . pub fn is_never(&self) -> bool { 87,221 ( 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 { 121,627 ( 0.00%) matches!(self.kind(), Infer(TyVar(_))) . } . . #[inline] . pub fn ty_vid(&self) -> Option { 126,750 ( 0.00%) match self.kind() { 20,533 ( 0.00%) &Infer(TyVar(vid)) => Some(vid), . _ => None, . } . } . . #[inline] . pub fn is_ty_infer(&self) -> bool { 168 ( 0.00%) matches!(self.kind(), Infer(_)) . } . . #[inline] . pub fn is_phantom_data(&self) -> bool { . if let Adt(def, _) = self.kind() { def.is_phantom_data() } else { false } . } . . #[inline] -- line 1770 ---------------------------------------- -- line 1775 ---------------------------------------- . /// 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 { 292 ( 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 { 289 ( 0.00%) matches!(self.kind(), Array(..)) . } . . #[inline] . pub fn is_simd(&self) -> bool { . match self.kind() { . Adt(def, _) => def.repr.simd(), . _ => false, . } . } . 514 ( 0.00%) pub fn sequence_element_type(&self, tcx: TyCtxt<'tcx>) -> Ty<'tcx> { 1,028 ( 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), . } 514 ( 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 { 18 ( 0.00%) matches!(self.kind(), Ref(..)) . } . . #[inline] . pub fn is_mutable_ptr(&self) -> bool { 3 ( 0.00%) matches!( 2 ( 0.00%) self.kind(), . RawPtr(TypeAndMut { mutbl: hir::Mutability::Mut, .. }) . | Ref(_, _, hir::Mutability::Mut) . ) . } . . /// Get the mutability of the reference or `None` when not a reference . #[inline] . pub fn ref_mutability(&self) -> Option { -- line 1860 ---------------------------------------- -- line 1861 ---------------------------------------- . match self.kind() { . Ref(_, _, mutability) => Some(*mutability), . _ => None, . } . } . . #[inline] . pub fn is_unsafe_ptr(&self) -> bool { 6,645 ( 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 { 121,534 ( 0.00%) match self.kind() { 23,612 ( 0.00%) Adt(def, _) => def.is_box(), . _ => false, . } . } . . /// Panics if called on any type other than `Box`. . pub fn boxed_ty(&self) -> Ty<'tcx> { . match self.kind() { . Adt(def, substs) if def.is_box() => substs.type_at(0), -- line 1889 ---------------------------------------- -- line 1891 ---------------------------------------- . } . } . . /// A scalar type is one that denotes an atomic datum, with no sub-components. . /// (A RawPtr is scalar because it represents a non-managed pointer, so its . /// contents are abstract to rustc.) . #[inline] . pub fn is_scalar(&self) -> bool { 1,403 ( 0.00%) matches!( 3,061 ( 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 { 1 ( 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 { . matches!(self.kind(), Adt(adt_def, _) if adt_def.is_enum()) . } . . #[inline] . pub fn is_union(&self) -> bool { 18,549 ( 0.00%) matches!(self.kind(), Adt(adt_def, _) if adt_def.is_union()) . } . . #[inline] . pub fn is_closure(&self) -> bool { 4,220 ( 0.00%) matches!(self.kind(), Closure(..)) . } . . #[inline] . pub fn is_generator(&self) -> bool { 6,276 ( 0.00%) matches!(self.kind(), Generator(..)) . } . . #[inline] . pub fn is_integral(&self) -> bool { 12,981 ( 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 { 9,319 ( 0.00%) matches!(self.kind(), Infer(FreshTy(_) | FreshIntTy(_) | FreshFloatTy(_))) . } . . #[inline] . pub fn is_char(&self) -> bool { . matches!(self.kind(), Char) . } . . #[inline] . pub fn is_numeric(&self) -> bool { . self.is_integral() || self.is_floating_point() . } . . #[inline] . pub fn is_signed(&self) -> bool { 15 ( 0.00%) matches!(self.kind(), Int(_)) . } . . #[inline] . pub fn is_ptr_sized_integral(&self) -> bool { 2,376 ( 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. 20,578 ( 0.00%) pub fn builtin_deref(&self, explicit: bool) -> Option> { 115,441 ( 0.00%) match self.kind() { 844 ( 0.00%) Adt(def, _) if def.is_box() => { . Some(TypeAndMut { ty: self.boxed_ty(), mutbl: hir::Mutability::Not }) . } 74,002 ( 0.00%) Ref(_, ty, mutbl) => Some(TypeAndMut { ty, mutbl: *mutbl }), . RawPtr(mt) if explicit => Some(*mt), . _ => None, . } 41,156 ( 0.00%) } . . /// Returns the type of `ty[i]`. . pub fn builtin_index(&self) -> Option> { 1,597 ( 0.00%) match self.kind() { . Array(ty, _) | Slice(ty) => Some(ty), . _ => None, . } 226 ( 0.00%) } . 137,416 ( 0.00%) pub fn fn_sig(&self, tcx: TyCtxt<'tcx>) -> PolyFnSig<'tcx> { 68,708 ( 0.00%) match self.kind() { 51,531 ( 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), . } 154,593 ( 0.00%) } . . #[inline] . pub fn is_fn(&self) -> bool { 1,350 ( 0.00%) matches!(self.kind(), FnDef(..) | FnPtr(_)) . } . . #[inline] . pub fn is_fn_ptr(&self) -> bool { . matches!(self.kind(), FnPtr(_)) . } . . #[inline] . pub fn is_impl_trait(&self) -> bool { . matches!(self.kind(), Opaque(..)) . } . . #[inline] . pub fn ty_adt_def(&self) -> Option<&'tcx AdtDef> { 6,771 ( 0.00%) match self.kind() { . Adt(adt, _) => Some(adt), . _ => None, . } . } . . /// Iterates over tuple fields. . /// Panics when called on anything but a tuple. 189 ( 0.00%) pub fn tuple_fields(&self) -> impl DoubleEndedIterator> { 2,330 ( 0.00%) match self.kind() { 1,276 ( 0.00%) Tuple(substs) => substs.iter().map(|field| field.expect_ty()), . _ => bug!("tuple_fields called on non-tuple"), . } 378 ( 0.00%) } . . /// Get the `i`-th element of a tuple. . /// Panics when called on anything but a tuple. 53 ( 0.00%) pub fn tuple_element_ty(&self, i: usize) -> Option> { 106 ( 0.00%) match self.kind() { 106 ( 0.00%) Tuple(substs) => substs.iter().nth(i).map(|field| field.expect_ty()), . _ => bug!("tuple_fields called on non-tuple"), . } 106 ( 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 2095 ---------------------------------------- . TyKind::Generator(def_id, substs, _) => { . Some(substs.as_generator().discriminant_for_variant(*def_id, tcx, variant_index)) . } . _ => None, . } . } . . /// Returns the type of the discriminant of this type. 12,580 ( 0.00%) pub fn discriminant_ty(&'tcx self, tcx: TyCtxt<'tcx>) -> Ty<'tcx> { 6,290 ( 0.00%) match self.kind() { 10,064 ( 0.00%) ty::Adt(adt, _) if adt.is_enum() => adt.repr.discr_type().to_ty(tcx), . ty::Generator(_, substs, _) => substs.as_generator().discr_ty(tcx), . . ty::Param(_) | ty::Projection(_) | ty::Opaque(..) | ty::Infer(ty::TyVar(_)) => { . let assoc_items = tcx.associated_item_def_ids( . tcx.require_lang_item(hir::LangItem::DiscriminantKind, None), . ); . tcx.mk_projection(assoc_items[0], tcx.intern_substs(&[self.into()])) . } -- line 2113 ---------------------------------------- -- line 2135 ---------------------------------------- . | ty::Infer(IntVar(_) | FloatVar(_)) => tcx.types.u8, . . ty::Bound(..) . | ty::Placeholder(_) . | ty::Infer(FreshTy(_) | ty::FreshIntTy(_) | ty::FreshFloatTy(_)) => { . bug!("`discriminant_ty` applied to unexpected type: {:?}", self) . } . } 10,064 ( 0.00%) } . . /// Returns the type of metadata for (potentially fat) pointers to this type. . pub fn ptr_metadata_ty( . &'tcx self, . tcx: TyCtxt<'tcx>, . normalize: impl FnMut(Ty<'tcx>) -> Ty<'tcx>, . ) -> Ty<'tcx> { . let tail = tcx.struct_tail_with_normalize(self, normalize); -- line 2151 ---------------------------------------- -- line 2200 ---------------------------------------- . /// function converts such a special type into the closure . /// kind. To go the other way, use . /// `tcx.closure_kind_ty(closure_kind)`. . /// . /// Note that during type checking, we use an inference variable . /// to represent the closure kind, because it has not yet been . /// inferred. Once upvar inference (in `rustc_typeck/src/check/upvar.rs`) . /// is complete, that type variable will be unified. 3,060 ( 0.00%) pub fn to_opt_closure_kind(&self) -> Option { 6,120 ( 0.00%) match self.kind() { 6,056 ( 0.00%) Int(int_ty) => match int_ty { . ty::IntTy::I8 => Some(ty::ClosureKind::Fn), . ty::IntTy::I16 => Some(ty::ClosureKind::FnMut), . ty::IntTy::I32 => Some(ty::ClosureKind::FnOnce), . _ => bug!("cannot convert type `{:?}` to a closure kind", self), . }, . . // "Bound" types appear in canonical queries when the . // closure type is not yet known . Bound(..) | Infer(_) => None, . . Error(_) => Some(ty::ClosureKind::Fn), . . _ => bug!("cannot convert type `{:?}` to a closure kind", self), . } 3,060 ( 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`. 395,037 ( 0.00%) pub fn is_trivially_sized(&self, tcx: TyCtxt<'tcx>) -> bool { 263,358 ( 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, . 8,162 ( 0.00%) ty::Tuple(tys) => tys.iter().all(|ty| ty.expect_ty().is_trivially_sized(tcx)), . 26,106 ( 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) . } . } 395,037 ( 0.00%) } . } . . /// Extra information about why we ended up with a particular variance. . /// This is only used to add more information to error messages, and . /// has no effect on soundness. While choosing the 'wrong' `VarianceDiagInfo` . /// may lead to confusing notes in error messages, it will never cause . /// a miscompilation or unsoundness. . /// . /// When in doubt, use `VarianceDiagInfo::default()` 7,851 ( 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. 152,558 ( 0.00%) pub fn xform(self, other: VarianceDiagInfo<'tcx>) -> VarianceDiagInfo<'tcx> { . // For now, just use the first `VarianceDiagInfo::Invariant` that we see 228,837 ( 0.00%) match self { . VarianceDiagInfo::None => other, . VarianceDiagInfo::Invariant { .. } => self, . } 76,279 ( 0.00%) } . } 70,831,729 ( 0.85%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/sso/map.rs -------------------------------------------------------------------------------- Ir -- line 70 ---------------------------------------- . Array(ArrayVec<(K, V), SSO_ARRAY_SIZE>), . Map(FxHashMap), . } . . impl SsoHashMap { . /// Creates an empty `SsoHashMap`. . #[inline] . pub fn new() -> Self { 143,447 ( 0.00%) SsoHashMap::Array(ArrayVec::new()) . } . . /// Creates an empty `SsoHashMap` with the specified capacity. . pub fn with_capacity(cap: usize) -> Self { . if cap <= SSO_ARRAY_SIZE { . Self::new() . } else { . SsoHashMap::Map(FxHashMap::with_capacity_and_hasher(cap, Default::default())) -- line 86 ---------------------------------------- -- line 226 ---------------------------------------- . /// Inserts a key-value pair into the map. . /// . /// If the map did not have this key present, [`None`] is returned. . /// . /// If the map did have this key present, the value is updated, and the old . /// value is returned. The key is not updated, though; this matters for . /// types that can be `==` without being identical. See the [module-level . /// documentation] for more. 6,652,963 ( 0.08%) pub fn insert(&mut self, key: K, value: V) -> Option { 1,684,260 ( 0.02%) match self { . SsoHashMap::Array(array) => { 1,848,635 ( 0.02%) for (k, v) in array.iter_mut() { 1,395,552 ( 0.02%) if *k == key { . let old_value = std::mem::replace(v, value); . return Some(old_value); . } . } 824,463 ( 0.01%) if let Err(error) = array.try_push((key, value)) { . let mut map: FxHashMap = array.drain(..).collect(); . let (key, value) = error.element(); . map.insert(key, value); 133,363 ( 0.00%) *self = SsoHashMap::Map(map); . } 366,278 ( 0.00%) None . } . SsoHashMap::Map(map) => map.insert(key, value), . } 6,232,529 ( 0.07%) } . . /// Removes a key from the map, returning the value at the key if the key . /// was previously in the map. . pub fn remove(&mut self, key: &K) -> Option { 80 ( 0.00%) match self { . SsoHashMap::Array(array) => { . if let Some(index) = array.iter().position(|(k, _v)| k == key) { . Some(array.swap_remove(index).1) . } else { . None . } . } . SsoHashMap::Map(map) => map.remove(key), -- line 266 ---------------------------------------- -- line 278 ---------------------------------------- . None . } . } . SsoHashMap::Map(map) => map.remove_entry(key), . } . } . . /// Returns a reference to the value corresponding to the key. 520,105 ( 0.01%) pub fn get(&self, key: &K) -> Option<&V> { 1,040,210 ( 0.01%) match self { . SsoHashMap::Array(array) => { 2,236,394 ( 0.03%) for (k, v) in array { 1,685,328 ( 0.02%) if k == key { . return Some(v); . } . } . None . } . SsoHashMap::Map(map) => map.get(key), . } 1,040,210 ( 0.01%) } . . /// Returns a mutable reference to the value corresponding to the key. . pub fn get_mut(&mut self, key: &K) -> Option<&mut V> { . match self { . SsoHashMap::Array(array) => { . for (k, v) in array { . if k == key { . return Some(v); -- line 306 ---------------------------------------- -- line 409 ---------------------------------------- . impl IntoIterator for SsoHashMap { . type IntoIter = EitherIter< . as IntoIterator>::IntoIter, . as IntoIterator>::IntoIter, . >; . type Item = ::Item; . . fn into_iter(self) -> Self::IntoIter { 255,852 ( 0.00%) match self { 1,535,088 ( 0.02%) SsoHashMap::Array(array) => EitherIter::Left(array.into_iter()), 24 ( 0.00%) SsoHashMap::Map(map) => EitherIter::Right(map.into_iter()), . } . } . } . . /// adapts Item of array reference iterator to Item of hashmap reference iterator. . #[inline(always)] . fn adapt_array_ref_it(pair: &(K, V)) -> (&K, &V) { . let (a, b) = pair; -- line 427 ---------------------------------------- 894,664 ( 0.01%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/ena-0.14.0/src/snapshot_vec.rs -------------------------------------------------------------------------------- Ir -- line 42 ---------------------------------------- . . impl Rollback> for SnapshotVecStorage { . fn reverse(&mut self, undo: UndoLog) { . self.values.reverse(undo) . } . } . impl Rollback> for Vec { . fn reverse(&mut self, undo: UndoLog) { 755,172 ( 0.01%) match undo { . NewElem(i) => { . self.pop(); 235,718 ( 0.00%) assert!(Vec::len(self) == i); . } . . SetElem(i, v) => { 271,754 ( 0.00%) self[i] = v; . } . . Other(u) => { . D::reverse(self, u); . } . } . } . } -- line 65 ---------------------------------------- -- line 76 ---------------------------------------- . impl VecLike for Vec . where . D: SnapshotVecDelegate, . { . fn push(&mut self, item: D::Value) { . Vec::push(self, item) . } . fn len(&self) -> usize { 229,510 ( 0.00%) Vec::len(self) . } . fn reserve(&mut self, size: usize) { . Vec::reserve(self, size) . } . } . . impl VecLike for &'_ mut Vec . where . D: SnapshotVecDelegate, . { . fn push(&mut self, item: D::Value) { . Vec::push(self, item) . } . fn len(&self) -> usize { 2,604,655 ( 0.03%) Vec::len(self) . } . fn reserve(&mut self, size: usize) { . Vec::reserve(self, size) . } . } . . #[allow(type_alias_bounds)] . pub type SnapshotVecStorage = -- line 107 ---------------------------------------- -- line 191 ---------------------------------------- . } . . impl, D: SnapshotVecDelegate, U> SnapshotVec { . pub fn len(&self) -> usize { . self.values.len() . } . . pub fn get(&self, index: usize) -> &D::Value { 44,424,965 ( 0.53%) &self.values.as_ref()[index] . } . . /// Returns a mutable pointer into the vec; whatever changes you make here cannot be undone . /// automatically, so you should be sure call `record()` with some sort of suitable undo . /// action. . pub fn get_mut(&mut self, index: usize) -> &mut D::Value { 167,232 ( 0.00%) &mut self.values.as_mut()[index] . } . . /// Reserve space for new values, just like an ordinary vec. . pub fn reserve(&mut self, additional: usize) { . // This is not affected by snapshots or anything. . self.values.reserve(additional); . } . } -- line 214 ---------------------------------------- -- line 219 ---------------------------------------- . } . . pub fn record(&mut self, action: D::Undo) { . if self.in_snapshot() { . self.undo_log.push(Other(action)); . } . } . 5,074,628 ( 0.06%) pub fn push(&mut self, elem: D::Value) -> usize { . let len = self.values.len(); . self.values.push(elem); . 690,050 ( 0.01%) if self.in_snapshot() { . self.undo_log.push(NewElem(len)); . } . . len 4,746,734 ( 0.06%) } . . /// Updates the element at the given index. The old value will saved (and perhaps restored) if . /// a snapshot is active. . pub fn set(&mut self, index: usize, new_elem: D::Value) { . let old_elem = mem::replace(&mut self.values.as_mut()[index], new_elem); . if self.undo_log.in_snapshot() { . self.undo_log.push(SetElem(index, old_elem)); . } . } . . /// Updates all elements. Potentially more efficient -- but . /// otherwise equivalent to -- invoking `set` for each element. 56 ( 0.00%) pub fn set_all(&mut self, mut new_elems: impl FnMut(usize) -> D::Value) { 8 ( 0.00%) if !self.undo_log.in_snapshot() { . for (index, slot) in self.values.as_mut().iter_mut().enumerate() { 9,324 ( 0.00%) *slot = new_elems(index); . } . } else { . for i in 0..self.values.len() { . self.set(i, new_elems(i)); . } . } 64 ( 0.00%) } . 2,601,217 ( 0.03%) pub fn update(&mut self, index: usize, op: OP) . where . OP: FnOnce(&mut D::Value), . D::Value: Clone, . { 311,102 ( 0.00%) if self.undo_log.in_snapshot() { 1,075,452 ( 0.01%) let old_elem = self.values.as_mut()[index].clone(); 168 ( 0.00%) self.undo_log.push(SetElem(index, old_elem)); . } 917,893 ( 0.01%) op(&mut self.values.as_mut()[index]); 2,484,832 ( 0.03%) } . } . . impl SnapshotVec . where . D: SnapshotVecDelegate, . V: VecLike + Rollback>, . L: Snapshots>, . { -- line 279 ---------------------------------------- 599,929 ( 0.01%) -------------------------------------------------------------------------------- -- 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)] 16,512,216 ( 0.20%) fn intern_ty(&self, kind: TyKind<'tcx>) -> Ty<'tcx> { . self.type_ 10,320,135 ( 0.12%) .intern(kind, |kind| { 558,524 ( 0.01%) let flags = super::flags::FlagComputation::for_kind(&kind); . . let ty_struct = TyS { 1,117,048 ( 0.01%) kind, . flags: flags.flags, . outer_exclusive_binder: flags.outer_exclusive_binder, . }; . . Interned(self.arena.alloc(ty_struct)) . }) . .0 18,576,243 ( 0.22%) } . . #[inline(never)] 5,248,872 ( 0.06%) fn intern_predicate( . &self, . kind: Binder<'tcx, PredicateKind<'tcx>>, . ) -> &'tcx PredicateInner<'tcx> { . self.predicate 4,592,763 ( 0.05%) .intern(kind, |kind| { 1,714,644 ( 0.02%) 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 5,904,981 ( 0.07%) } . } . . 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) { 706,146 ( 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) . } . 526,946 ( 0.01%) pub fn get(&self, id: hir::HirId) -> Option<&V> { 105,467 ( 0.00%) validate_hir_id_for_typeck_results(self.hir_owner, id); 105,467 ( 0.00%) self.data.get(&id.local_id) 422,602 ( 0.01%) } . . pub fn iter(&self) -> hash_map::Iter<'_, hir::ItemLocalId, V> { . self.data.iter() . } . } . . impl<'a, V> ::std::ops::Index for LocalTableInContext<'a, V> { . type Output = V; . 6,738 ( 0.00%) fn index(&self, key: hir::HirId) -> &V { 1 ( 0.00%) self.get(key).expect("LocalTableInContext: key not found") 4,492 ( 0.00%) } . } . . pub struct LocalTableInContextMut<'a, V> { . hir_owner: LocalDefId, . data: &'a mut ItemLocalMap, . } . . impl<'a, V> LocalTableInContextMut<'a, V> { -- line 292 ---------------------------------------- -- line 507 ---------------------------------------- . pub treat_byte_string_as_slice: ItemLocalSet, . . /// Contains the data for evaluating the effect of feature `capture_disjoint_fields` . /// on closure size. . pub closure_size_eval: FxHashMap>, . } . . impl<'tcx> TypeckResults<'tcx> { 21,876 ( 0.00%) pub fn new(hir_owner: LocalDefId) -> TypeckResults<'tcx> { 258,866 ( 0.00%) TypeckResults { . hir_owner, . type_dependent_defs: Default::default(), . field_indices: Default::default(), . user_provided_types: Default::default(), . user_provided_sigs: Default::default(), . node_types: Default::default(), . node_substs: Default::default(), . adjustments: Default::default(), -- line 524 ---------------------------------------- -- line 532 ---------------------------------------- . tainted_by_errors: None, . concrete_opaque_types: Default::default(), . closure_min_captures: Default::default(), . closure_fake_reads: Default::default(), . generator_interior_types: ty::Binder::dummy(Default::default()), . treat_byte_string_as_slice: Default::default(), . closure_size_eval: Default::default(), . } 21,876 ( 0.00%) } . . /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node. 110,658 ( 0.00%) pub fn qpath_res(&self, qpath: &hir::QPath<'_>, id: hir::HirId) -> Res { 73,772 ( 0.00%) match *qpath { 160,092 ( 0.00%) hir::QPath::Resolved(_, ref path) => path.res, . hir::QPath::TypeRelative(..) | hir::QPath::LangItem(..) => self . .type_dependent_def(id) 61,224 ( 0.00%) .map_or(Res::Err, |(kind, def_id)| Res::Def(kind, def_id)), . } 184,430 ( 0.00%) } . 1,285 ( 0.00%) pub fn type_dependent_defs( . &self, . ) -> LocalTableInContext<'_, Result<(DefKind, DefId), ErrorReported>> { 7,987 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.type_dependent_defs } 1,285 ( 0.00%) } . 15,437 ( 0.00%) pub fn type_dependent_def(&self, id: HirId) -> Option<(DefKind, DefId)> { 32,414 ( 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()) 30,874 ( 0.00%) } . 27,092 ( 0.00%) pub fn type_dependent_def_id(&self, id: HirId) -> Option { . self.type_dependent_def(id).map(|(_, def_id)| def_id) 27,092 ( 0.00%) } . 46,836 ( 0.00%) pub fn type_dependent_defs_mut( . &mut self, . ) -> LocalTableInContextMut<'_, Result<(DefKind, DefId), ErrorReported>> { 46,836 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.type_dependent_defs } 46,836 ( 0.00%) } . . pub fn field_indices(&self) -> LocalTableInContext<'_, usize> { 5,765 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.field_indices } 1,024 ( 0.00%) } . . pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> { 6,918 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.field_indices } 3,459 ( 0.00%) } . . pub fn user_provided_types(&self) -> LocalTableInContext<'_, CanonicalUserType<'tcx>> { 20,908 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.user_provided_types } 10,454 ( 0.00%) } . . pub fn user_provided_types_mut( . &mut self, . ) -> LocalTableInContextMut<'_, CanonicalUserType<'tcx>> { 3,804 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.user_provided_types } 1,902 ( 0.00%) } . . pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> { 98,780 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.node_types } 49,390 ( 0.00%) } . . pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> { 163,962 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.node_types } 81,981 ( 0.00%) } . 742,344 ( 0.01%) pub fn node_type(&self, id: hir::HirId) -> Ty<'tcx> { 123,724 ( 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))) . }) 618,620 ( 0.01%) } . 156,154 ( 0.00%) pub fn node_type_opt(&self, id: hir::HirId) -> Option> { 156,154 ( 0.00%) validate_hir_id_for_typeck_results(self.hir_owner, id); . self.node_types.get(&id.local_id).cloned() 312,308 ( 0.00%) } . . pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, SubstsRef<'tcx>> { 21,006 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.node_substs } 10,503 ( 0.00%) } . 53,737 ( 0.00%) pub fn node_substs(&self, id: hir::HirId) -> SubstsRef<'tcx> { 53,737 ( 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()) 107,474 ( 0.00%) } . 35,887 ( 0.00%) pub fn node_substs_opt(&self, id: hir::HirId) -> Option> { 35,887 ( 0.00%) validate_hir_id_for_typeck_results(self.hir_owner, id); . self.node_substs.get(&id.local_id).cloned() 71,774 ( 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> { 20,540 ( 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> { 139,283 ( 0.00%) self.node_type(expr.hir_id) . } . . pub fn expr_ty_opt(&self, expr: &hir::Expr<'_>) -> Option> { 121,187 ( 0.00%) self.node_type_opt(expr.hir_id) . } . . pub fn adjustments(&self) -> LocalTableInContext<'_, Vec>> { 67,268 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.adjustments } 33,634 ( 0.00%) } . . pub fn adjustments_mut( . &mut self, . ) -> LocalTableInContextMut<'_, Vec>> { 115,234 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.adjustments } 57,617 ( 0.00%) } . 55,673 ( 0.00%) pub fn expr_adjustments(&self, expr: &hir::Expr<'_>) -> &[ty::adjustment::Adjustment<'tcx>] { 111,346 ( 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[..]) 111,346 ( 0.00%) } . . /// Returns the type of `expr`, considering any `Adjustment` . /// entry recorded for that expression. 4,085 ( 0.00%) pub fn expr_ty_adjusted(&self, expr: &hir::Expr<'_>) -> Ty<'tcx> { 817 ( 0.00%) self.expr_adjustments(expr).last().map_or_else(|| self.expr_ty(expr), |adj| adj.target) 608 ( 0.00%) } . 1,995 ( 0.00%) pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr<'_>) -> Option> { 399 ( 0.00%) self.expr_adjustments(expr).last().map(|adj| adj.target).or_else(|| self.expr_ty_opt(expr)) 1,208 ( 0.00%) } . 6,702 ( 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. 13,404 ( 0.00%) if let hir::ExprKind::Path(_) = expr.kind { . return false; . } . 14,916 ( 0.00%) matches!(self.type_dependent_defs().get(expr.hir_id), Some(Ok((DefKind::AssocFn, _)))) 13,404 ( 0.00%) } . 40,566 ( 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 . }) 54,088 ( 0.00%) } . . pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> { 34,138 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.pat_binding_modes } 10,308 ( 0.00%) } . . pub fn pat_binding_modes_mut(&mut self) -> LocalTableInContextMut<'_, BindingMode> { 17,960 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.pat_binding_modes } 8,980 ( 0.00%) } . . pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec>> { 41,798 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.pat_adjustments } 20,899 ( 0.00%) } . . pub fn pat_adjustments_mut(&mut self) -> LocalTableInContextMut<'_, Vec>> { 13,134 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.pat_adjustments } 6,567 ( 0.00%) } . . /// For a given closure, returns the iterator of `ty::CapturedPlace`s that are captured . /// by the closure. 5,656 ( 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() 7,070 ( 0.00%) } . . pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, HirPlace<'tcx>)> { 2,204 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.closure_kind_origins } 1,102 ( 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>> { 6,696 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.liberated_fn_sigs } 3,348 ( 0.00%) } . . pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> { 4,492 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.liberated_fn_sigs } 2,246 ( 0.00%) } . . pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec>> { 2,206 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.fru_field_types } 1,103 ( 0.00%) } . . pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec>> { 4 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.fru_field_types } 2 ( 0.00%) } . 60 ( 0.00%) pub fn is_coercion_cast(&self, hir_id: hir::HirId) -> bool { 20 ( 0.00%) validate_hir_id_for_typeck_results(self.hir_owner, hir_id); . self.coercion_casts.contains(&hir_id.local_id) 40 ( 0.00%) } . . pub fn set_coercion_cast(&mut self, id: ItemLocalId) { . self.coercion_casts.insert(id); . } . . pub fn coercion_casts(&self) -> &ItemLocalSet { 1,102 ( 0.00%) &self.coercion_casts 1,102 ( 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>; . 1,154 ( 0.00%) #[derive(Clone, Debug, TyEncodable, TyDecodable, HashStable, TypeFoldable, Lift)] . pub struct CanonicalUserTypeAnnotation<'tcx> { . pub user_ty: CanonicalUserType<'tcx>, . pub span: Span, 993 ( 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. 4,793 ( 0.00%) pub fn is_identity(&self) -> bool { 9,586 ( 0.00%) match self.value { . UserType::Ty(_) => false, . UserType::TypeOf(_, user_substs) => { 4,793 ( 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() { 11,414 ( 0.00%) GenericArgKind::Type(ty) => match ty.kind() { . ty::Bound(debruijn, b) => { . // We only allow a `ty::INNERMOST` index in substitutions. 5,557 ( 0.00%) assert_eq!(*debruijn, ty::INNERMOST); . cvar == b.var . } . _ => false, . }, . 64 ( 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, . }, . } . }) . } . } 9,586 ( 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. 5,958 ( 0.00%) #[derive(Copy, Clone, Debug, PartialEq, TyEncodable, TyDecodable)] 53,133 ( 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> { 46,340 ( 0.00%) pub fn typeck_opt_const_arg( . self, . def: ty::WithOptConstParam, . ) -> &'tcx TypeckResults<'tcx> { 18,536 ( 0.00%) if let Some(param_did) = def.const_param_did { . self.typeck_const_arg((def.did, param_did)) . } else { . self.typeck(def.did) . } 37,072 ( 0.00%) } . 3,474 ( 0.00%) pub fn alloc_steal_thir(self, thir: Thir<'tcx>) -> &'tcx Steal> { 1,158 ( 0.00%) self.arena.alloc(Steal::new(thir)) 4,632 ( 0.00%) } . 17,545 ( 0.00%) pub fn alloc_steal_mir(self, mir: Body<'tcx>) -> &'tcx Steal> { 3,509 ( 0.00%) self.arena.alloc(Steal::new(mir)) 24,563 ( 0.00%) } . 4,632 ( 0.00%) pub fn alloc_steal_promoted( . self, . promoted: IndexVec>, . ) -> &'tcx Steal>> { 1,158 ( 0.00%) self.arena.alloc(Steal::new(promoted)) 5,790 ( 0.00%) } . 1,989 ( 0.00%) pub fn alloc_adt_def( . self, . did: DefId, . kind: AdtKind, . variants: IndexVec, . repr: ReprOptions, . ) -> &'tcx ty::AdtDef { 3,536 ( 0.00%) self.intern_adt_def(ty::AdtDef::new(self, did, kind, variants, repr)) 884 ( 0.00%) } . . /// Allocates a read-only byte or string literal for `mir::interpret`. 170 ( 0.00%) pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId { . // Create an allocation that just contains these bytes. 34 ( 0.00%) let alloc = interpret::Allocation::from_bytes_byte_aligned_immutable(bytes); 442 ( 0.00%) let alloc = self.intern_const_alloc(alloc); . self.create_memory_alloc(alloc) 170 ( 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? 10,592 ( 0.00%) pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound, Bound) { 5,296 ( 0.00%) let attrs = self.get_attrs(def_id); 22,508 ( 0.00%) let get = |name| { 5,296 ( 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); 48 ( 0.00%) if let Some( . &[ . ast::NestedMetaItem::Literal(ast::Lit { 24 ( 0.00%) kind: ast::LitKind::Int(a, _), .. . }), . ], 12 ( 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 . } 26,480 ( 0.00%) }; 7,944 ( 0.00%) ( 7,944 ( 0.00%) get(sym::rustc_layout_scalar_valid_range_start), 3,972 ( 0.00%) get(sym::rustc_layout_scalar_valid_range_end), . ) 10,592 ( 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 }) . } . 371 ( 0.00%) pub fn consider_optimizing String>(self, msg: T) -> bool { 53 ( 0.00%) let cname = self.crate_name(LOCAL_CRATE); 424 ( 0.00%) self.sess.consider_optimizing(cname.as_str(), msg) 424 ( 0.00%) } . . /// Obtain all lang items of this crate and all dependencies (recursively) 3,402,245 ( 0.04%) pub fn lang_items(self) -> &'tcx rustc_hir::lang_items::LanguageItems { . self.get_lang_items(()) 4,374,315 ( 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. 329 ( 0.00%) pub fn get_diagnostic_item(self, name: Symbol) -> Option { . self.all_diagnostic_items(()).name_to_id.get(&name).copied() 376 ( 0.00%) } . . /// Obtain the diagnostic item's name 82,166 ( 0.00%) pub fn get_diagnostic_name(self, id: DefId) -> Option { . self.diagnostic_items(id.krate).id_to_name.get(&id).copied() 93,904 ( 0.00%) } . . /// Check whether the diagnostic item with the given `name` has the given `DefId`. 84,385 ( 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) 96,440 ( 0.00%) } . 23,429 ( 0.00%) pub fn stability(self) -> &'tcx stability::Index<'tcx> { . self.stability_index(()) 30,123 ( 0.00%) } . 789,054 ( 0.01%) pub fn features(self) -> &'tcx rustc_feature::Features { . self.features_query(()) 901,776 ( 0.01%) } . . pub fn def_key(self, id: DefId) -> rustc_hir::definitions::DefKey { . // Accessing the DefKey is ok, since it is part of DefPathHash. 35,354 ( 0.00%) if let Some(id) = id.as_local() { . self.untracked_resolutions.definitions.def_key(id) . } else { 20,122 ( 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. 8,636 ( 0.00%) if let Some(def_id) = def_id.as_local() { . self.untracked_resolutions.definitions.def_path_hash(def_id) . } else { 272 ( 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 { 61,654 ( 0.00%) &*self.untracked_resolutions.cstore 30,827 ( 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> { 36 ( 0.00%) let resolutions = &self.gcx.untracked_resolutions; 179 ( 0.00%) StableHashingContext::new(self.sess, &resolutions.definitions, &*resolutions.cstore) . } . . #[inline(always)] . pub fn create_no_span_stable_hashing_context(self) -> StableHashingContext<'tcx> { . let resolutions = &self.gcx.untracked_resolutions; . StableHashingContext::ignore_spans( . self.sess, . &resolutions.definitions, -- line 1381 ---------------------------------------- -- line 1390 ---------------------------------------- . /// If `true`, we should use the MIR-based borrowck, but also . /// fall back on the AST borrowck if the MIR-based one errors. . pub fn migrate_borrowck(self) -> bool { . self.borrowck_mode().migrate() . } . . /// What mode(s) of borrowck should we run? AST? MIR? both? . /// (Also considers the `#![feature(nll)]` setting.) 2,204 ( 0.00%) pub fn borrowck_mode(self) -> BorrowckMode { . // Here are the main constraints we need to deal with: . // . // 1. An opts.borrowck_mode of `BorrowckMode::Migrate` is . // synonymous with no `-Z borrowck=...` flag at all. . // . // 2. We want to allow developers on the Nightly channel . // to opt back into the "hard error" mode for NLL, . // (which they can do via specifying `#![feature(nll)]` -- line 1406 ---------------------------------------- -- line 1413 ---------------------------------------- . // errors. (To simplify the code here, it now even overrides . // a user's attempt to specify `-Z borrowck=compare`, which . // we arguably do not need anymore and should remove.) . // . // * Otherwise, if no `-Z borrowck=...` then use migrate mode . // . // * Otherwise, use the behavior requested via `-Z borrowck=...` . 3,306 ( 0.00%) if self.features().nll { . return BorrowckMode::Mir; . } . 1,102 ( 0.00%) self.sess.opts.borrowck_mode 4,408 ( 0.00%) } . . /// If `true`, we should use lazy normalization for constants, otherwise . /// we still evaluate them eagerly. . #[inline] . pub fn lazy_normalization(self) -> bool { 170 ( 0.00%) let features = self.features(); . // Note: We only use lazy normalization for generic const expressions. 102 ( 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")`). 8,855 ( 0.00%) pub fn article_and_description(self, def_id: DefId) -> (&'static str, &'static str) { 6,440 ( 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"), . }, 14,490 ( 0.00%) def_kind => (def_kind.article(), def_kind.descr(def_id)), . } 7,245 ( 0.00%) } . . pub fn type_length_limit(self) -> Limit { . self.limits(()).type_length_limit . } . 2,160,480 ( 0.03%) pub fn recursion_limit(self) -> Limit { . self.limits(()).recursion_limit 2,469,120 ( 0.03%) } . . pub fn move_size_limit(self) -> Limit { . self.limits(()).move_size_limit . } . 105 ( 0.00%) pub fn const_eval_limit(self) -> Limit { . self.limits(()).const_eval_limit 120 ( 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(); 146,187 ( 0.00%) let _reset = rustc_data_structures::OnDrop(move || TLV.with(|tlv| tlv.set(old))); . TLV.with(|tlv| tlv.set(value)); . f() . } . . /// Gets the pointer to the current `ImplicitCtxt`. . #[cfg(not(parallel_compiler))] . #[inline] . fn get_tlv() -> usize { -- line 1761 ---------------------------------------- -- line 1763 ---------------------------------------- . } . . /// Sets `context` as the new current `ImplicitCtxt` for the duration of the function `f`. . #[inline] . pub fn enter_context<'a, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'tcx>, f: F) -> R . where . F: FnOnce(&ImplicitCtxt<'a, 'tcx>) -> R, . { 1 ( 0.00%) set_tlv(context as *const _ as usize, || f(&context)) . } . . /// Allows access to the current `ImplicitCtxt` in a closure if one is available. . #[inline] . pub fn with_context_opt(f: F) -> R . where . F: for<'a, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'tcx>>) -> R, . { . let context = get_tlv(); 575,141 ( 0.01%) if context == 0 { . f(None) . } else { . // We could get an `ImplicitCtxt` pointer from another thread. . // Ensure that `ImplicitCtxt` is `Sync`. . sync::assert_sync::>(); . . unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_>))) } . } -- line 1789 ---------------------------------------- -- line 1805 ---------------------------------------- . /// This will panic if you pass it a `TyCtxt` which is different from the current . /// `ImplicitCtxt`'s `tcx` field. . #[inline] . pub fn with_related_context<'tcx, F, R>(tcx: TyCtxt<'tcx>, f: F) -> R . where . F: FnOnce(&ImplicitCtxt<'_, 'tcx>) -> R, . { . with_context(|context| unsafe { 282,508 ( 0.00%) assert!(ptr_eq(context.tcx.gcx, tcx.gcx)); . let context: &ImplicitCtxt<'_, '_> = mem::transmute(context); 282,366 ( 0.00%) f(context) . }) . } . . /// Allows access to the `TyCtxt` in the current `ImplicitCtxt`. . /// Panics if there is no `ImplicitCtxt` available. . #[inline] . pub fn with(f: F) -> R . where -- line 1823 ---------------------------------------- -- line 1981 ---------------------------------------- . fn into_pointer(&self) -> *const () { . self.0 as *const _ as *const () . } . } . . #[allow(rustc::usage_of_ty_tykind)] . impl<'tcx> Borrow> for Interned<'tcx, TyS<'tcx>> { . fn borrow<'a>(&'a self) -> &'a TyKind<'tcx> { 1,815,596 ( 0.02%) &self.0.kind() . } . } . . impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> { . fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool { . // The `Borrow` trait requires that `x.borrow() == y.borrow()` equals . // `x == y`. . self.0.kind() == other.0.kind() -- line 1997 ---------------------------------------- -- line 1998 ---------------------------------------- . } . } . . impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {} . . impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> { . fn hash(&self, s: &mut H) { . // The `Borrow` trait requires that `x.borrow().hash(s) == x.hash(s)`. 1,376,244 ( 0.02%) self.0.kind().hash(s) . } . } . . impl<'tcx> Borrow>> for Interned<'tcx, PredicateInner<'tcx>> { . fn borrow<'a>(&'a self) -> &'a Binder<'tcx, PredicateKind<'tcx>> { 400,629 ( 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)`. 458,748 ( 0.01%) self.0.kind.hash(s) . } . } . . impl<'tcx, T> Borrow<[T]> for Interned<'tcx, List> { . fn borrow<'a>(&'a self) -> &'a [T] { 1,973,528 ( 0.02%) &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)`. 491,204 ( 0.01%) 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 { 291,391 ( 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)`. 67,812 ( 0.00%) self.0.hash(s) . } . } . . impl<'tcx> TyCtxt<'tcx> { 2,455,508 ( 0.03%) pub fn $method(self, v: $ty) -> &'tcx $ty { 1,253,626 ( 0.01%) self.interners.$name.intern(v, |v| { 18,598 ( 0.00%) Interned(self.interners.arena.alloc(v)) . }).0 2,761,353 ( 0.03%) } . })+ . } . } . . 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> { 22,384,555 ( 0.27%) $(pub fn $method(self, v: &[$ty]) -> &'tcx List<$ty> { . self.interners.$field.intern_ref(v, || { . Interned(List::from_arena(&*self.arena, v)) . }).0 20,097,198 ( 0.24%) })+ . } . ); . } . . 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`. 552 ( 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() . }) 414 ( 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(); 92 ( 0.00%) let mut stack = vec![trait_def_id]; . . set.insert(trait_def_id); . 414 ( 0.00%) iter::from_fn(move || -> Option { 148 ( 0.00%) let trait_did = stack.pop()?; 74 ( 0.00%) let generic_predicates = self.super_predicates_of(trait_did); . . for (predicate, _) in generic_predicates.predicates { 132 ( 0.00%) if let ty::PredicateKind::Trait(data) = predicate.kind().skip_binder() { 88 ( 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> { 337,596 ( 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> { 14,579,368 ( 0.17%) self.interners.intern_ty(st) . } . . #[inline] . pub fn mk_predicate(self, binder: Binder<'tcx, PredicateKind<'tcx>>) -> Predicate<'tcx> { 7,103,200 ( 0.08%) let inner = self.interners.intern_predicate(binder); . Predicate { inner } . } . . #[inline] 10,727,344 ( 0.13%) pub fn reuse_or_mk_predicate( . self, . pred: Predicate<'tcx>, . binder: Binder<'tcx, PredicateKind<'tcx>>, . ) -> Predicate<'tcx> { 862,203 ( 0.01%) if pred.kind() != binder { self.mk_predicate(binder) } else { pred } 10,727,344 ( 0.13%) } . . pub fn mk_mach_int(self, tm: IntTy) -> Ty<'tcx> { 1,693 ( 0.00%) match tm { . IntTy::Isize => self.types.isize, . IntTy::I8 => self.types.i8, . IntTy::I16 => self.types.i16, . IntTy::I32 => self.types.i32, . IntTy::I64 => self.types.i64, . IntTy::I128 => self.types.i128, . } 1,693 ( 0.00%) } . . pub fn mk_mach_uint(self, tm: UintTy) -> Ty<'tcx> { 2,285 ( 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, . } 2,285 ( 0.00%) } . . pub fn mk_mach_float(self, tm: FloatTy) -> Ty<'tcx> { 51 ( 0.00%) match tm { . FloatTy::F32 => self.types.f32, . FloatTy::F64 => self.types.f64, . } 51 ( 0.00%) } . . #[inline] . pub fn mk_static_str(self) -> Ty<'tcx> { 2,644 ( 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] 6,240 ( 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))) 6,544 ( 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> { 3,264 ( 0.00%) let kinds: Vec<_> = ts.iter().map(|&t| GenericArg::from(t)).collect(); 6,579 ( 0.00%) self.mk_ty(Tuple(self.intern_substs(&kinds))) . } . . pub fn mk_tup], Ty<'tcx>>>(self, iter: I) -> I::Output { 283,994 ( 0.00%) iter.intern_with(|ts| { 49,088 ( 0.00%) let kinds: Vec<_> = ts.iter().map(|&t| GenericArg::from(t)).collect(); 232,642 ( 0.00%) self.mk_ty(Tuple(self.intern_substs(&kinds))) 255,519 ( 0.00%) }) . } . . #[inline] . pub fn mk_unit(self) -> Ty<'tcx> { 942 ( 0.00%) self.types.unit . } . . #[inline] . pub fn mk_diverging_default(self) -> Ty<'tcx> { 16 ( 0.00%) if self.features().never_type_fallback { self.types.never } else { self.types.unit } . } . . #[inline] . pub fn mk_fn_def(self, def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> { . self.mk_ty(FnDef(def_id, substs)) . } . . #[inline] . pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> { 40,680 ( 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> { 2,880 ( 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 }) . } . 61,992 ( 0.00%) pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> GenericArg<'tcx> { 43,350 ( 0.00%) match param.kind { . GenericParamDefKind::Lifetime => { 2,790 ( 0.00%) self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into() . } 16,782 ( 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() . } . } 61,992 ( 0.00%) } . . #[inline] . pub fn mk_opaque(self, def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> { . self.mk_ty(Opaque(def_id, substs)) . } . 855 ( 0.00%) pub fn mk_place_field(self, place: Place<'tcx>, f: Field, ty: Ty<'tcx>) -> Place<'tcx> { 855 ( 0.00%) self.mk_place_elem(place, PlaceElem::Field(f, ty)) 1,710 ( 0.00%) } . . pub fn mk_place_deref(self, place: Place<'tcx>) -> Place<'tcx> { . self.mk_place_elem(place, PlaceElem::Deref) . } . 32 ( 0.00%) pub fn mk_place_downcast( . self, . place: Place<'tcx>, . adt_def: &'tcx AdtDef, . variant_index: VariantIdx, . ) -> Place<'tcx> { 32 ( 0.00%) self.mk_place_elem( . place, 64 ( 0.00%) PlaceElem::Downcast(Some(adt_def.variants[variant_index].name), variant_index), . ) 64 ( 0.00%) } . . pub fn mk_place_downcast_unnamed( . self, . place: Place<'tcx>, . variant_index: VariantIdx, . ) -> Place<'tcx> { . self.mk_place_elem(place, PlaceElem::Downcast(None, variant_index)) . } -- line 2496 ---------------------------------------- -- line 2497 ---------------------------------------- . . 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. 7,983 ( 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) } 8,870 ( 0.00%) } . 15,323 ( 0.00%) pub fn intern_poly_existential_predicates( . self, . eps: &[ty::Binder<'tcx, ExistentialPredicate<'tcx>>], . ) -> &'tcx List>> { 2,286 ( 0.00%) assert!(!eps.is_empty()); . assert!( . eps.array_windows() 6,186 ( 0.00%) .all(|[a, b]| a.skip_binder().stable_cmp(self, &b.skip_binder()) . != Ordering::Greater) . ); 9,144 ( 0.00%) self._intern_poly_existential_predicates(eps) 17,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. 21,427 ( 0.00%) if preds.is_empty() { . // The macro-generated method below asserts we don't intern an empty slice. . List::empty() . } else { 16,334 ( 0.00%) self._intern_predicates(preds) . } 10,224 ( 0.00%) } . . pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List> { 273,005 ( 0.00%) if ts.is_empty() { List::empty() } else { self._intern_type_list(ts) } 446 ( 0.00%) } . . pub fn intern_substs(self, ts: &[GenericArg<'tcx>]) -> &'tcx List> { 3,979,270 ( 0.05%) if ts.is_empty() { List::empty() } else { self._intern_substs(ts) } 148,536 ( 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> { 28,670 ( 0.00%) if ts.is_empty() { List::empty() } else { self._intern_place_elems(ts) } 12,796 ( 0.00%) } . . pub fn intern_canonical_var_infos( . self, . ts: &[CanonicalVarInfo<'tcx>], . ) -> CanonicalVarInfos<'tcx> { 82,311 ( 0.00%) if ts.is_empty() { List::empty() } else { self._intern_canonical_var_infos(ts) } 970 ( 0.00%) } . . pub fn intern_bound_variable_kinds( . self, . ts: &[ty::BoundVariableKind], . ) -> &'tcx List { 31,185 ( 0.00%) if ts.is_empty() { List::empty() } else { self._intern_bound_variable_kinds(ts) } 48,196 ( 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 { 7,135 ( 0.00%) inputs_and_output: self.intern_type_list(xs), 1,869 ( 0.00%) c_variadic, 2,270 ( 0.00%) unsafety, 2,936 ( 0.00%) abi, 500 ( 0.00%) }) . } . . pub fn mk_poly_existential_predicates< . I: InternAs< . [ty::Binder<'tcx, ExistentialPredicate<'tcx>>], . &'tcx List>>, . >, . >( . self, . iter: I, . ) -> I::Output { 6,922 ( 0.00%) iter.intern_with(|xs| self.intern_poly_existential_predicates(xs)) . } . . pub fn mk_predicates], &'tcx List>>>( . self, . iter: I, . ) -> I::Output { 26 ( 0.00%) iter.intern_with(|xs| self.intern_predicates(xs)) . } . . pub fn mk_type_list], &'tcx List>>>(self, iter: I) -> I::Output { 79,053 ( 0.00%) iter.intern_with(|xs| self.intern_type_list(xs)) . } . . pub fn mk_substs], &'tcx List>>>( . self, . iter: I, . ) -> I::Output { 1,623,900 ( 0.02%) iter.intern_with(|xs| self.intern_substs(xs)) . } . . pub fn mk_place_elems], &'tcx List>>>( . self, . iter: I, . ) -> I::Output { 36 ( 0.00%) iter.intern_with(|xs| self.intern_place_elems(xs)) . } . 71,593 ( 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())) 143,186 ( 0.00%) } . . pub fn mk_bound_variable_kinds< . I: InternAs<[ty::BoundVariableKind], &'tcx List>, . >( . self, . iter: I, . ) -> I::Output { 153,589 ( 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. 405,622 ( 0.00%) pub fn maybe_lint_level_root_bounded(self, mut id: HirId, bound: HirId) -> HirId { 405,622 ( 0.00%) let hir = self.hir(); . loop { 892,743 ( 0.01%) if id == bound { . return bound; . } . 1,216,876 ( 0.01%) if hir.attrs(id).iter().any(|attr| Level::from_symbol(attr.name_or_empty()).is_some()) { . return id; . } . let next = hir.get_parent_node(id); 718,905 ( 0.01%) if next == id { . bug!("lint traversal reached the root of the crate"); . } . id = next; . } 579,460 ( 0.01%) } . 22,560 ( 0.00%) pub fn lint_level_at_node( . self, . lint: &'static Lint, . mut id: hir::HirId, . ) -> (Level, LintLevelSource) { . let sets = self.lint_levels(()); . loop { 155,040 ( 0.00%) if let Some(pair) = sets.level_and_source(lint, id, self.sess) { . return pair; . } 12,840 ( 0.00%) let next = self.hir().get_parent_node(id); 38,520 ( 0.00%) if next == id { . bug!("lint traversal reached the root of the crate"); . } . id = next; . } 22,560 ( 0.00%) } . 4,816 ( 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>), . ) { 13,834 ( 0.00%) let (level, src) = self.lint_level_at_node(lint, hir_id); 4,053 ( 0.00%) struct_lint_level(self.sess, lint, level, src, Some(span.into()), decorate); 2,752 ( 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); . } . 24,381 ( 0.00%) pub fn in_scope_traits(self, id: HirId) -> Option<&'tcx [TraitCandidate]> { 6,966 ( 0.00%) let map = self.in_scope_traits_map(id.owner)?; . let candidates = map.get(&id.local_id)?; 6,966 ( 0.00%) Some(&*candidates) 27,864 ( 0.00%) } . 28,959 ( 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()) 37,233 ( 0.00%) } . 15,561 ( 0.00%) pub fn is_late_bound(self, id: HirId) -> bool { . self.is_late_bound_map(id.owner) 1,667 ( 0.00%) .map_or(false, |(owner, set)| owner == id.owner && set.contains(&id.local_id)) 13,832 ( 0.00%) } . 27,636 ( 0.00%) pub fn object_lifetime_defaults(self, id: HirId) -> Option> { . self.object_lifetime_defaults_map(id.owner) 35,532 ( 0.00%) } . 43,011 ( 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(), . ) 43,011 ( 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 2,670 ( 0.00%) pub fn is_const_fn(self, def_id: DefId) -> bool { 267 ( 0.00%) if self.is_const_fn_raw(def_id) { 131 ( 0.00%) match self.lookup_const_stability(def_id) { 4 ( 0.00%) Some(stability) if stability.level.is_unstable() => { . // has a `rustc_const_unstable` attribute, check whether the user enabled the . // corresponding feature gate. . self.features() . .declared_lib_features . .iter() . .any(|&(sym, _)| sym == stability.feature) . } . // functions without const stability are either stable user written . // const fn or the user is using feature gates and we thus don't . // care what they do . _ => true, . } . } else { . false . } 2,403 ( 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; 103,296 ( 0.00%) fn intern_with(self, f: F) -> Self::Output . where . F: FnOnce(&[T]) -> R, . { 9,250,667 ( 0.11%) E::intern_with(self, f) 106,623 ( 0.00%) } . } . . pub trait InternIteratorElement: Sized { . type Output; . fn intern_with, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output; . } . . impl InternIteratorElement for T { . type Output = R; 669,651 ( 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`. 805,408 ( 0.01%) match iter.size_hint() { . (0, Some(0)) => { 3 ( 0.00%) assert!(iter.next().is_none()); . f(&[]) . } . (1, Some(1)) => { . let t0 = iter.next().unwrap(); 54 ( 0.00%) assert!(iter.next().is_none()); 107,351 ( 0.00%) f(&[t0]) . } . (2, Some(2)) => { . let t0 = iter.next().unwrap(); . let t1 = iter.next().unwrap(); 473 ( 0.00%) assert!(iter.next().is_none()); 91,846 ( 0.00%) f(&[t0, t1]) . } 5,672 ( 0.00%) _ => f(&iter.collect::>()), . } 732,935 ( 0.01%) } . } . . impl<'a, T, R> InternIteratorElement for &'a T . where . T: Clone + 'a, . { . type Output = R; 24,667 ( 0.00%) fn intern_with, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output { . // This code isn't hot. 200 ( 0.00%) f(&iter.cloned().collect::>()) 19,916 ( 0.00%) } . } . . impl InternIteratorElement for Result { . type Output = Result; 3,571,098 ( 0.04%) 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. 2,993,238 ( 0.04%) Ok(match iter.size_hint() { . (0, Some(0)) => { . assert!(iter.next().is_none()); . f(&[]) . } . (1, Some(1)) => { 4,419 ( 0.00%) let t0 = iter.next().unwrap()?; . assert!(iter.next().is_none()); 259,397 ( 0.00%) f(&[t0]) . } . (2, Some(2)) => { 35,588 ( 0.00%) let t0 = iter.next().unwrap()?; 35,588 ( 0.00%) let t1 = iter.next().unwrap()?; 53,193 ( 0.00%) assert!(iter.next().is_none()); 293,410 ( 0.00%) f(&[t0, t1]) . } 212,932 ( 0.00%) _ => f(&iter.collect::, _>>()?), . }) 4,022,197 ( 0.05%) } . } . . // 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 { 282,508 ( 0.00%) 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 = 26,248 ( 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()) . }; . } 5,322,273 ( 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 { 3,110,764 ( 0.04%) 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> { 9,310 ( 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> { 5,272 ( 0.00%) if let [first, ..] = self { Some(first) } else { None } . } . . /// Returns the first and all the rest of the elements of the slice, or `None` if it is empty. . /// . /// # Examples . /// . /// ``` . /// let x = &[0, 1, 2]; -- line 194 ---------------------------------------- -- line 237 ---------------------------------------- . /// assert_eq!(last, &2); . /// assert_eq!(elements, &[0, 1]); . /// } . /// ``` . #[stable(feature = "slice_splits", since = "1.5.0")] . #[rustc_const_stable(feature = "const_slice_first_last_not_mut", since = "1.56.0")] . #[inline] . pub const fn split_last(&self) -> Option<(&T, &[T])> { 44,798 ( 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> { 688,563 ( 0.01%) if let [.., last] = self { Some(last) } else { None } . } . . /// Returns a mutable pointer to the last item in the slice. . /// . /// # Examples . /// . /// ``` . /// let x = &mut [0, 1, 2]; -- line 292 ---------------------------------------- -- line 295 ---------------------------------------- . /// *last = 10; . /// } . /// assert_eq!(x, &[0, 1, 10]); . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_unstable(feature = "const_slice_first_last", issue = "83570")] . #[inline] . pub const fn last_mut(&mut self) -> Option<&mut T> { 2,034,901 ( 0.02%) 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 { 4,104,655 ( 0.05%) 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 { 15 ( 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,794 ( 0.00%) let _ = &self[a]; 1,327,434 ( 0.02%) 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 { 8,133 ( 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]) { 157,750 ( 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. 10,452 ( 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, . { 2,202 ( 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(); 891,304 ( 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()); 8,874 ( 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; 5,711,049 ( 0.07%) while left < right { 7,129,054 ( 0.09%) 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. 736,236 ( 0.01%) 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. 2,060,659 ( 0.02%) if cmp == Less { 2,983,155 ( 0.04%) left = mid + 1; 988,511 ( 0.01%) } else if cmp == Greater { . right = mid; . } else { . // SAFETY: same as the `get_unchecked` above . unsafe { crate::intrinsics::assume(mid < self.len()) }; . return Ok(mid); . } . 6,028,241 ( 0.07%) 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, . ); . } . 325,378 ( 0.00%) if self.len() != src.len() { . len_mismatch_fail(self.len(), src.len()); . } . . // SAFETY: `self` is valid for `self.len()` elements by definition, and `src` was . // checked to have the same length. The slices cannot overlap because . // mutable references are exclusive. . unsafe { . ptr::copy_nonoverlapping(src.as_ptr(), self.as_mut_ptr(), self.len()); -- line 3219 ---------------------------------------- -- line 3382 ---------------------------------------- . } . let gcd: usize = gcd(mem::size_of::(), mem::size_of::()); . let ts: usize = mem::size_of::() / gcd; . let us: usize = mem::size_of::() / gcd; . . // Armed with this knowledge, we can find how many `U`s we can fit! . let us_len = self.len() / ts * us; . // And how many `T`s will be in the trailing slice! 12,278 ( 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::()) }; 12,278 ( 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), 12,278 ( 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")] 74 ( 0.00%) pub fn partition_point