-------------------------------------------------------------------------------- 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 elliptic_curve --edition=2021 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="arithmetic" --cfg feature="default" --cfg feature="ff" --cfg feature="group" -C metadata=1bbd7d83a72e4d35 -C extra-filename=-1bbd7d83a72e4d35 --out-dir /usr/home/liquid/tmp/.tmpRg0jO0/target/debug/deps -L dependency=/usr/home/liquid/tmp/.tmpRg0jO0/target/debug/deps --extern base16ct=/usr/home/liquid/tmp/.tmpRg0jO0/target/debug/deps/libbase16ct-618578cc1cbbf372.rmeta --extern crypto_bigint=/usr/home/liquid/tmp/.tmpRg0jO0/target/debug/deps/libcrypto_bigint-a921c3c84dcd35c5.rmeta --extern der=/usr/home/liquid/tmp/.tmpRg0jO0/target/debug/deps/libder-b38032d2b374e573.rmeta --extern ff=/usr/home/liquid/tmp/.tmpRg0jO0/target/debug/deps/libff-ea86b8b90dd4f944.rmeta --extern generic_array=/usr/home/liquid/tmp/.tmpRg0jO0/target/debug/deps/libgeneric_array-a9e00928aabed04e.rmeta --extern group=/usr/home/liquid/tmp/.tmpRg0jO0/target/debug/deps/libgroup-dcd0d40476bac245.rmeta --extern rand_core=/usr/home/liquid/tmp/.tmpRg0jO0/target/debug/deps/librand_core-720e9af211f71a44.rmeta --extern subtle=/usr/home/liquid/tmp/.tmpRg0jO0/target/debug/deps/libsubtle-ac0f272e7120c459.rmeta --extern zeroize=/usr/home/liquid/tmp/.tmpRg0jO0/target/debug/deps/libzeroize-d685d66f08298e75.rmeta -Adeprecated -Aunknown-lints -Zincremental-verify-ich Data file: results/cgout-w-profiling-elliptic-curve-0.12.0-pre.1-Check-Full Events recorded: Ir Events shown: Ir Event sort order: Ir Thresholds: 0.1 Include dirs: User annotated: Auto-annotation: on -------------------------------------------------------------------------------- Ir -------------------------------------------------------------------------------- 578,097,971 (100.0%) PROGRAM TOTALS -------------------------------------------------------------------------------- Ir file:function -------------------------------------------------------------------------------- 14,570,107 ( 2.52%) ./malloc/malloc.c:_int_free 11,517,297 ( 1.99%) ./malloc/malloc.c:_int_malloc 10,305,124 ( 1.78%) ./elf/dl-lookup.c:_dl_lookup_symbol_x 8,624,853 ( 1.49%) ./malloc/malloc.c:malloc 6,622,732 ( 1.15%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:, (), core::hash::BuildHasherDefault>>::from_hash::>::{closure#0}> 5,890,717 ( 1.02%) ./string/../sysdeps/x86_64/multiarch/memmove-vec-unaligned-erms.S:__memcpy_avx_unaligned_erms 4,835,679 ( 0.84%) ./elf/dl-lookup.c:do_lookup_x 4,522,746 ( 0.78%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/subst.rs:::fold_ty 4,329,474 ( 0.75%) ./malloc/malloc.c:free 4,141,271 ( 0.72%) ./elf/../sysdeps/x86_64/dl-machine.h:_dl_relocate_object 3,962,003 ( 0.69%) /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}> 3,616,555 ( 0.63%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/map.rs:>, (), core::hash::BuildHasherDefault>>::from_hash::>>::{closure#0}> 3,556,039 ( 0.62%) /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:: 3,506,847 ( 0.61%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs:::eq 3,363,609 ( 0.58%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_lexer/src/unescape.rs:rustc_lexer::unescape::scan_escape 3,293,213 ( 0.57%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs:::_intern_substs 3,040,070 ( 0.53%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/iter/macros.rs:::_intern_substs 2,947,706 ( 0.51%) /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:: 2,944,501 ( 0.51%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:>, (), core::hash::BuildHasherDefault>>::from_hash::>>::{closure#0}> 2,902,313 ( 0.50%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/map.rs:, (), core::hash::BuildHasherDefault>>::from_hash::>::{closure#0}> 2,772,601 ( 0.48%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs:::intern_ty 2,674,482 ( 0.46%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/fold.rs:::try_fold_with:: 2,606,841 ( 0.45%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/canonical/canonicalizer.rs:::fold_ty 2,595,894 ( 0.45%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs:::reuse_or_mk_predicate 2,469,026 ( 0.43%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/structural_impls.rs:rustc_middle::ty::util::fold_list:: as rustc_middle::ty::fold::TypeFoldable>::try_super_fold_with::{closure#0}> 2,457,504 ( 0.43%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_lexer/src/unescape.rs:rustc_lexer::unescape::unescape_literal::<::from_lit_token::{closure#2}> 2,405,738 ( 0.42%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/mod.rs:::reuse_or_mk_predicate 2,329,795 ( 0.40%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs:::hash:: 2,153,002 ( 0.37%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/opaque.rs:>::decode 2,139,033 ( 0.37%) ./elf/do-rel.h:_dl_relocate_object 1,975,858 ( 0.34%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/mod.rs:::try_fold_with:: 1,821,735 ( 0.32%) /usr/home/liquid/rust/worktree-benchmarking/library/alloc/src/vec/mod.rs:>::decode 1,801,751 ( 0.31%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/num/uint_macros.rs:::short_write_process_buffer:: 1,789,776 ( 0.31%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/fold.rs:::try_fold_with:: 1,762,662 ( 0.30%) /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:: 1,762,211 ( 0.30%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/lib.rs:>::decode 1,754,258 ( 0.30%) /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:: 1,749,585 ( 0.30%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs:::intern_predicate 1,721,736 ( 0.30%) /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:: 1,713,945 ( 0.30%) /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}> 1,713,842 ( 0.30%) ./malloc/malloc.c:malloc_consolidate 1,701,049 ( 0.29%) /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:: 1,676,079 ( 0.29%) ./malloc/malloc.c:realloc 1,537,207 ( 0.27%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/mod.rs:::hash:: 1,505,280 ( 0.26%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs:, (), core::hash::BuildHasherDefault>>::from_hash::>::{closure#0}> 1,387,907 ( 0.24%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/mod.rs:::try_fold_with:: 1,362,217 ( 0.24%) ???:SetImpliedBits(llvm::FeatureBitset&, llvm::FeatureBitset const&, llvm::ArrayRef) 1,273,699 ( 0.22%) /usr/home/liquid/rust/worktree-benchmarking/library/std/src/sys/unix/alloc.rs:__rdl_alloc 1,232,862 ( 0.21%) ./malloc/malloc.c:unlink_chunk.constprop.0 1,208,628 ( 0.21%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/sip128.rs:::short_write_process_buffer:: 1,207,340 ( 0.21%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/undo_log.rs:::rollback_to 1,178,511 ( 0.20%) ./malloc/malloc.c:_int_realloc 1,177,429 ( 0.20%) /usr/home/liquid/rust/worktree-benchmarking/library/alloc/src/string.rs:alloc::string::String::push 1,151,099 ( 0.20%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/caching_source_map_view.rs:::span_data_to_lines_and_cols 1,139,391 ( 0.20%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:)>>::remove_entry::>::{closure#0}> 1,135,256 ( 0.20%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/canonical/canonicalizer.rs:rustc_middle::ty::util::fold_list:: as rustc_middle::ty::fold::TypeFoldable>::try_super_fold_with::{closure#0}> 1,094,513 ( 0.19%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/ops/bit.rs:::hash:: 1,091,610 ( 0.19%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_parse/src/lexer/mod.rs:::next_token 1,054,668 ( 0.18%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/fold.rs:::has_escaping_bound_vars 1,028,913 ( 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}> 1,022,047 ( 0.18%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/mod.rs:::reuse_or_mk_predicate 1,013,890 ( 0.18%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs:::assemble_candidates 1,003,085 ( 0.17%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/fold.rs:::try_fold_binder:: 997,155 ( 0.17%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/mod.rs:::start_snapshot 993,445 ( 0.17%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/structural_impls.rs:rustc_middle::ty::util::fold_list:: as rustc_middle::ty::fold::TypeFoldable>::try_super_fold_with::{closure#0}> 990,424 ( 0.17%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs:::hash:: 987,882 ( 0.17%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/leb128.rs:::read_u32 975,182 ( 0.17%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/mod.rs:::shallow_resolve_ty 968,944 ( 0.17%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/bitmask.rs:, (), core::hash::BuildHasherDefault>>::from_hash::>::{closure#0}> 963,381 ( 0.17%) /usr/home/liquid/rust/worktree-benchmarking/library/alloc/src/vec/mod.rs:alloc::string::String::push 959,082 ( 0.17%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/iter/adapters/zip.rs:>, (), core::hash::BuildHasherDefault>>::from_hash::>>::{closure#0}> 946,419 ( 0.16%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs:::eq 905,402 ( 0.16%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_metadata/src/rmeta/decoder.rs:>::decode 892,567 ( 0.15%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/mod.rs:, (), core::hash::BuildHasherDefault>>::from_hash::, rustc_middle::ty::context::Interned>::{closure#0}> 880,346 ( 0.15%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/fold.rs:::try_fold_with:: 876,821 ( 0.15%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs:::reuse_or_mk_predicate 866,635 ( 0.15%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/cell.rs:::_intern_substs 866,635 ( 0.15%) /usr/home/liquid/rust/worktree-benchmarking/library/std/src/collections/hash/map.rs:::_intern_substs 864,856 ( 0.15%) ./elf/dl-lookup.c:check_match 861,462 ( 0.15%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/iter/macros.rs:rustc_lexer::unescape::unescape_literal::<::from_lit_token::{closure#2}> 858,291 ( 0.15%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_type_ir/src/lib.rs:::shift_out 857,130 ( 0.15%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/lib.rs:>::hash_stable 846,324 ( 0.15%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/util.rs:rustc_middle::ty::util::fold_list:: as rustc_middle::ty::fold::TypeFoldable>::try_super_fold_with::{closure#0}> 828,940 ( 0.14%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/obligation_forest/mod.rs:>::process_obligations::> 805,050 ( 0.14%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/num/uint_macros.rs:::_intern_substs 794,490 ( 0.14%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/iter/macros.rs:, >::decode::{closure#0}>, ::imported_source_files::{closure#3}::{closure#0}> as core::iter::traits::iterator::Iterator>::fold::<(), core::iter::traits::iterator::Iterator::for_each::call as alloc::vec::spec_extend::SpecExtend, >::decode::{closure#0}>, ::imported_source_files::{closure#3}::{closure#0}>>>::spec_extend::{closure#0}>::{closure#0}> 792,642 ( 0.14%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_parse/src/parser/mod.rs:::check 791,520 ( 0.14%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/iter/macros.rs:::new_imported_source_file 789,398 ( 0.14%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_span/src/lib.rs:::new_imported_source_file 781,475 ( 0.14%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_parse/src/lexer/tokentrees.rs:::parse_token_tree 780,918 ( 0.14%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/sharded.rs:::intern_ty 777,440 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_lexer/src/lib.rs:::advance_token 773,975 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/iter/traits/iterator.rs:::candidate_from_obligation 761,411 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/cell.rs:::start_snapshot 760,489 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_parse/src/parser/mod.rs:::next 753,020 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs:::try_fold_with:: 744,612 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/library/std/src/collections/hash/map.rs:::intern_ty 738,363 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/obligation_forest/mod.rs:>::register_obligation_at 737,674 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/fold.rs:::anonymize_late_bound_regions:: 735,678 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_type_ir/src/lib.rs:::shift_in 731,461 ( 0.13%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/leb128.rs:::read_u32 722,448 ( 0.12%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/map.rs:::_intern_substs 716,000 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/cell.rs:::intern_predicate 715,628 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/subst.rs:>::from 710,149 ( 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:: 708,760 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/num/uint_macros.rs:::hash:: 708,074 ( 0.12%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:>>::from_key_hashed_nocheck:: 705,287 ( 0.12%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/rustc-hash-1.1.0/src/lib.rs:<&str as core::hash::Hash>::hash:: 705,168 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_parse/src/parser/mod.rs:::bump 704,022 ( 0.12%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/stacker-0.1.14/src/lib.rs:stacker::remaining_stack 693,660 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/mod.rs:::to_opt_poly_trait_pred 674,455 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/leb128.rs:::read_usize 673,502 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/cmp.rs:>, (), core::hash::BuildHasherDefault>>::from_hash::>>::{closure#0}> 672,214 ( 0.12%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/ptr/mut_ptr.rs:>, (), core::hash::BuildHasherDefault>>::from_hash::>>::{closure#0}> 666,857 ( 0.12%) /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:: 663,872 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs:<&rustc_middle::ty::TyS as rustc_middle::ty::fold::TypeFoldable>::super_fold_with:: 663,545 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_ast/src/token.rs:::is_keyword 660,259 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/library/alloc/src/vec/into_iter.rs:> as core::ops::drop::Drop>::drop 656,361 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/sip128.rs:>::hash_stable 650,694 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/mod.rs:::try_fold_with:: 649,055 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/subst.rs:::try_fold_binder:: 645,848 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/mod.rs:::commit_from 641,406 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_ast/src/util/literal.rs:rustc_lexer::unescape::unescape_literal::<::from_lit_token::{closure#2}> 633,960 ( 0.11%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/raw/mod.rs:>::prepare_insert_slot 624,426 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_trait_selection/src/traits/fulfill.rs:::progress_changed_obligations 620,510 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/cell.rs:::intern_ty 615,872 ( 0.11%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_trait_selection/src/traits/project.rs:::fold_ty 603,207 ( 0.10%) /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.0/src/rustc_entry.rs:, core::hash::BuildHasherDefault>>::rustc_entry 594,105 ( 0.10%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/equate.rs:::tys 592,155 ( 0.10%) /usr/home/liquid/rust/worktree-benchmarking/library/core/src/ptr/mut_ptr.rs:, (), core::hash::BuildHasherDefault>>::from_hash::>::{closure#0}> 590,050 ( 0.10%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/structural_impls.rs:::try_fold_binder:: 584,730 ( 0.10%) /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/mod.rs:::rollback_to -------------------------------------------------------------------------------- -- 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. 106 ( 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. 106 ( 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 }, . } 212 ( 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> { 22,095 ( 0.00%) fn new() -> InferCtxtInner<'tcx> { 150,246 ( 0.03%) InferCtxtInner { . projection_cache: Default::default(), . type_variable_storage: type_variable::TypeVariableStorage::new(), . undo_log: InferCtxtUndoLogs::default(), . const_unification_storage: ut::UnificationTableStorage::new(), . int_unification_storage: ut::UnificationTableStorage::new(), . float_unification_storage: ut::UnificationTableStorage::new(), 13,257 ( 0.00%) region_constraint_storage: Some(RegionConstraintStorage::new()), . region_obligations: vec![], . opaque_types: Default::default(), . opaque_types_vars: Default::default(), . } 26,514 ( 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> { 12,520 ( 0.00%) self.projection_cache.with_log(&mut self.undo_log) . } . . #[inline] . fn type_variables(&mut self) -> type_variable::TypeVariableTable<'_, 'tcx> { 54,937 ( 0.01%) self.type_variable_storage.with_log(&mut self.undo_log) . } . . #[inline] . fn int_unification_table( . &mut self, . ) -> ut::UnificationTable< . ut::InPlace< . ty::IntVid, -- line 245 ---------------------------------------- -- line 268 ---------------------------------------- . &mut self, . ) -> ut::UnificationTable< . ut::InPlace< . ty::ConstVid<'tcx>, . &mut ut::UnificationStorage>, . &mut InferCtxtUndoLogs<'tcx>, . >, . > { 184 ( 0.00%) self.const_unification_storage.with_log(&mut self.undo_log) . } . . #[inline] . pub fn unwrap_region_constraints(&mut self) -> RegionConstraintCollector<'_, 'tcx> { 18,116 ( 0.00%) self.region_constraint_storage . .as_mut() . .expect("region constraints already solved") 21,095 ( 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. 34,576 ( 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 29,204 ( 0.01%) #[derive(Clone, Debug)] . pub enum SubregionOrigin<'tcx> { . /// Arose from a subtyping relation 1,491 ( 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. 559 ( 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 224 ( 0.00%) DataBorrowed(Ty<'tcx>, Span), . . /// (&'a &'b T) where a >= b 269 ( 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> { 4,419 ( 0.00%) fn infer_ctxt(self) -> InferCtxtBuilder<'tcx> { 13,257 ( 0.00%) InferCtxtBuilder { tcx: self, defining_use_anchor: None, fresh_typeck_results: None } 4,419 ( 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. 3,159 ( 0.00%) pub fn with_fresh_in_progress_typeck_results(mut self, table_owner: LocalDefId) -> Self { 3,861 ( 0.00%) self.fresh_typeck_results = Some(RefCell::new(ty::TypeckResults::new(table_owner))); 1,755 ( 0.00%) self.with_opaque_type_inference(table_owner) 2,457 ( 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. 214 ( 0.00%) pub fn with_opaque_type_inference(mut self, defining_use_anchor: LocalDefId) -> Self { 107 ( 0.00%) self.defining_use_anchor = Some(defining_use_anchor); 916 ( 0.00%) self 321 ( 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`). 6,800 ( 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| { 14,820 ( 0.00%) let (value, subst) = 907 ( 0.00%) infcx.instantiate_canonical_with_fresh_inference_vars(span, canonical); 21,585 ( 0.00%) f(infcx, value, subst) . }) 7,366 ( 0.00%) } . 18,935 ( 0.00%) pub fn enter(&mut self, f: impl for<'a> FnOnce(InferCtxt<'a, 'tcx>) -> R) -> R { 12,351 ( 0.00%) let InferCtxtBuilder { tcx, defining_use_anchor, ref fresh_typeck_results } = *self; . let in_progress_typeck_results = fresh_typeck_results.as_ref(); 183,859 ( 0.03%) f(InferCtxt { . tcx, . defining_use_anchor, . in_progress_typeck_results, 4,419 ( 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), 4,419 ( 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), . }) 19,897 ( 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 { 656 ( 0.00%) let InferOk { value, obligations } = self; 2,303 ( 0.00%) for obligation in obligations { 39 ( 0.00%) fulfill_cx.register_predicate_obligation(infcx, obligation); . } . value . } . } . . impl<'tcx> InferOk<'tcx, ()> { 4,556 ( 0.00%) pub fn into_obligations(self) -> PredicateObligations<'tcx> { 18,224 ( 0.00%) self.obligations 4,556 ( 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() 8,187 ( 0.00%) } . 81,376 ( 0.01%) pub fn freshen>(&self, t: T) -> T { 91,548 ( 0.02%) t.fold_with(&mut self.freshener()) 91,548 ( 0.02%) } . . /// 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`. 12 ( 0.00%) pub fn type_var_origin(&'a self, ty: Ty<'tcx>) -> Option { 24 ( 0.00%) match *ty.kind() { 6 ( 0.00%) ty::Infer(ty::TyVar(vid)) => { 24 ( 0.00%) Some(*self.inner.borrow_mut().type_variables().var_origin(vid)) . } . _ => None, . } 24 ( 0.00%) } . 10,172 ( 0.00%) pub fn freshener<'b>(&'b self) -> TypeFreshener<'b, 'tcx> { . freshen::TypeFreshener::new(self, false) 10,172 ( 0.00%) } . . /// Like `freshener`, but does not replace `'static` regions. 24,008 ( 0.00%) pub fn freshener_keep_static<'b>(&'b self) -> TypeFreshener<'b, 'tcx> { . freshen::TypeFreshener::new(self, true) 24,008 ( 0.00%) } . 448 ( 0.00%) pub fn unsolved_variables(&self) -> Vec> { 224 ( 0.00%) let mut inner = self.inner.borrow_mut(); 224 ( 0.00%) let mut vars: Vec> = inner . .type_variables() . .unsolved_variables() . .into_iter() 12 ( 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 }) . .filter(|&vid| inner.int_unification_table().probe_value(vid).is_none()) . .map(|v| self.tcx.mk_int_var(v)), . ); . vars.extend( . (0..inner.float_unification_table().len()) . .map(|i| ty::FloatVid { index: i as u32 }) . .filter(|&vid| inner.float_unification_table().probe_value(vid).is_none()) . .map(|v| self.tcx.mk_float_var(v)), . ); . vars 784 ( 0.00%) } . 17,320 ( 0.00%) fn combine_fields( . &'a self, . trace: TypeTrace<'tcx>, . param_env: ty::ParamEnv<'tcx>, . ) -> CombineFields<'a, 'tcx> { 69,492 ( 0.01%) CombineFields { . infcx: self, 173,730 ( 0.03%) trace, . cause: None, . param_env, . obligations: PredicateObligations::new(), . } 17,320 ( 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 760 ---------------------------------------- . /// 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. . pub fn save_and_restore_in_snapshot_flag(&self, func: F) -> R . where . F: FnOnce(&Self) -> R, . { . let flag = self.in_snapshot.replace(false); 1,104 ( 0.00%) let result = func(self); . self.in_snapshot.set(flag); . result . } . 132,954 ( 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(); . 398,862 ( 0.07%) 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. 66,477 ( 0.01%) _in_progress_typeck_results: self . .in_progress_typeck_results . .map(|typeck_results| typeck_results.borrow()), . } 265,908 ( 0.05%) } . 357,335 ( 0.06%) #[instrument(skip(self, snapshot), level = "debug")] . fn rollback_to(&self, cause: &str, snapshot: CombinedSnapshot<'a, 'tcx>) { . let CombinedSnapshot { 32,485 ( 0.01%) undo_snapshot, 32,485 ( 0.01%) region_constraints_snapshot, 32,485 ( 0.01%) universe, 32,485 ( 0.01%) was_in_snapshot, 64,970 ( 0.01%) _in_progress_typeck_results, . } = snapshot; . . self.in_snapshot.set(was_in_snapshot); . self.universe.set(universe); . . let mut inner = self.inner.borrow_mut(); 32,485 ( 0.01%) inner.rollback_to(undo_snapshot); . inner.unwrap_region_constraints().rollback_to(region_constraints_snapshot); . } . 509,880 ( 0.09%) #[instrument(skip(self, snapshot), level = "debug")] . fn commit_from(&self, snapshot: CombinedSnapshot<'a, 'tcx>) { . let CombinedSnapshot { 33,992 ( 0.01%) undo_snapshot, . region_constraints_snapshot: _, . universe: _, 33,992 ( 0.01%) was_in_snapshot, 67,984 ( 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. 25,091 ( 0.00%) #[instrument(skip(self, f), level = "debug")] 33,416 ( 0.01%) pub fn commit_unconditionally(&self, f: F) -> R . where . F: FnOnce(&CombinedSnapshot<'a, 'tcx>) -> R, . { 3,040 ( 0.00%) let snapshot = self.start_snapshot(); 14,579 ( 0.00%) let r = f(&snapshot); 21,264 ( 0.00%) self.commit_from(snapshot); 31,425 ( 0.01%) r . } . . /// Execute `f` and commit the bindings if closure `f` returns `Ok(_)`. 266,789 ( 0.05%) #[instrument(skip(self, f), level = "debug")] 326,960 ( 0.06%) pub fn commit_if_ok(&self, f: F) -> Result . where . F: FnOnce(&CombinedSnapshot<'a, 'tcx>) -> Result, . { 42,050 ( 0.01%) let snapshot = self.start_snapshot(); 150,878 ( 0.03%) let r = f(&snapshot); . debug!("commit_if_ok() -- r.is_ok() = {}", r.is_ok()); 21,439 ( 0.00%) match r { . Ok(_) => { 243,142 ( 0.04%) self.commit_from(snapshot); . } . Err(_) => { 49,364 ( 0.01%) self.rollback_to("commit_if_ok -- error", snapshot); . } . } 185,491 ( 0.03%) r . } . . /// Execute `f` then unroll any bindings it creates. 167,478 ( 0.03%) #[instrument(skip(self, f), level = "debug")] 194,426 ( 0.03%) pub fn probe(&self, f: F) -> R . where . F: FnOnce(&CombinedSnapshot<'a, 'tcx>) -> R, . { 55,933 ( 0.01%) let snapshot = self.start_snapshot(); 120,091 ( 0.02%) let r = f(&snapshot); 249,035 ( 0.04%) self.rollback_to("probe", snapshot); 6,287 ( 0.00%) r . } . . /// If `should_skip` is true, then execute `f` then unroll any bindings it creates. 351 ( 0.00%) #[instrument(skip(self, f), level = "debug")] 468 ( 0.00%) pub fn probe_maybe_skip_leak_check(&self, should_skip: bool, f: F) -> R . where . F: FnOnce(&CombinedSnapshot<'a, 'tcx>) -> R, . { 78 ( 0.00%) let snapshot = self.start_snapshot(); 39 ( 0.00%) let was_skip_leak_check = self.skip_leak_check.get(); 78 ( 0.00%) if should_skip { . self.skip_leak_check.set(true); . } 156 ( 0.00%) let r = f(&snapshot); 351 ( 0.00%) self.rollback_to("probe", snapshot); . self.skip_leak_check.set(was_skip_leak_check); 468 ( 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 5,650 ( 0.00%) pub fn region_constraints_added_in_snapshot( . &self, . snapshot: &CombinedSnapshot<'a, 'tcx>, . ) -> Option { 11,300 ( 0.00%) self.inner . .borrow_mut() . .unwrap_region_constraints() . .region_constraints_added_in_snapshot(&snapshot.undo_snapshot) 8,475 ( 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); . } . . pub fn can_sub(&self, param_env: ty::ParamEnv<'tcx>, a: T, b: T) -> UnitResult<'tcx> . where . T: at::ToTrace<'tcx>, -- line 908 ---------------------------------------- -- line 911 ---------------------------------------- . self.probe(|_| { . self.at(origin, param_env).sub(a, b).map(|InferOk { obligations: _, .. }| { . // Ignore obligations, since we are unrolling . // everything anyway. . }) . }) . } . 1,536 ( 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. . }) . }) 1,152 ( 0.00%) } . 6,130 ( 0.00%) #[instrument(skip(self), level = "debug")] . pub fn sub_regions( . &self, . origin: SubregionOrigin<'tcx>, . a: ty::Region<'tcx>, . b: ty::Region<'tcx>, . ) { 5,517 ( 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`. . #[instrument(skip(self), level = "debug")] . pub fn member_constraint( . &self, . opaque_type_def_id: DefId, -- line 947 ---------------------------------------- -- 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.) 18 ( 0.00%) pub fn coerce_predicate( . &self, . cause: &ObligationCause<'tcx>, . param_env: ty::ParamEnv<'tcx>, . predicate: ty::PolyCoercePredicate<'tcx>, . ) -> Option> { 12 ( 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, . }); 30 ( 0.00%) self.subtype_predicate(cause, param_env, subtype_predicate) 24 ( 0.00%) } . 444 ( 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. 37 ( 0.00%) let r_a = self.shallow_resolve(predicate.skip_binder().a); 37 ( 0.00%) let r_b = self.shallow_resolve(predicate.skip_binder().b); 240 ( 0.00%) match (r_a.kind(), r_b.kind()) { 46 ( 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); 46 ( 0.00%) return None; . } . _ => {} . } . . Some(self.commit_if_ok(|_snapshot| { 14 ( 0.00%) let ty::SubtypePredicate { a_is_expected, a, b } = . self.replace_bound_vars_with_placeholders(predicate); . 28 ( 0.00%) let ok = self.at(cause, param_env).sub_exp(a_is_expected, a, b)?; . . Ok(ok.unit()) . })) 333 ( 0.00%) } . 1,512 ( 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) . }); 1,260 ( 0.00%) self.sub_regions(origin, r_b, r_a); // `b : a` ==> `a <= b` . Ok(()) . }) 1,008 ( 0.00%) } . . /// Number of type variables created so far. 6 ( 0.00%) pub fn num_ty_vars(&self) -> usize { . self.inner.borrow_mut().type_variables().num_vars() 12 ( 0.00%) } . 1,968 ( 0.00%) pub fn next_ty_var_id(&self, origin: TypeVariableOrigin) -> TyVid { 9,840 ( 0.00%) self.inner.borrow_mut().type_variables().new_var(self.universe(), origin) 2,952 ( 0.00%) } . 1,756 ( 0.00%) pub fn next_ty_var(&self, origin: TypeVariableOrigin) -> Ty<'tcx> { 6,782 ( 0.00%) self.tcx.mk_ty_var(self.next_ty_var_id(origin)) 2,634 ( 0.00%) } . 604 ( 0.00%) pub fn next_ty_var_in_universe( . &self, . origin: TypeVariableOrigin, . universe: ty::UniverseIndex, . ) -> Ty<'tcx> { 3,322 ( 0.00%) let vid = self.inner.borrow_mut().type_variables().new_var(universe, origin); 302 ( 0.00%) self.tcx.mk_ty_var(vid) 906 ( 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 1108 ---------------------------------------- . . 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. 1,692 ( 0.00%) pub fn next_region_var(&self, origin: RegionVariableOrigin) -> ty::Region<'tcx> { 24,949 ( 0.00%) self.next_region_var_in_universe(origin, self.universe()) 3,384 ( 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. 10,788 ( 0.00%) pub fn next_region_var_in_universe( . &self, . origin: RegionVariableOrigin, . universe: ty::UniverseIndex, . ) -> ty::Region<'tcx> { . let region_var = 70,122 ( 0.01%) self.inner.borrow_mut().unwrap_region_constraints().new_region_var(universe, origin); 26,970 ( 0.00%) self.tcx.mk_region(ty::ReVar(region_var)) 16,182 ( 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. 770 ( 0.00%) pub fn universe_of_region(&self, r: ty::Region<'tcx>) -> ty::UniverseIndex { . self.inner.borrow_mut().unwrap_region_constraints().universe(r) 1,155 ( 0.00%) } . . /// Number of region variables created so far. 858 ( 0.00%) pub fn num_region_vars(&self) -> usize { . self.inner.borrow_mut().unwrap_region_constraints().num_region_vars() 1,287 ( 0.00%) } . . /// Just a convenient wrapper of `next_region_var` for using during NLL. 1,535 ( 0.00%) pub fn next_nll_region_var(&self, origin: NllRegionVariableOrigin) -> ty::Region<'tcx> { . self.next_region_var(RegionVariableOrigin::Nll(origin)) 3,070 ( 0.00%) } . . /// Just a convenient wrapper of `next_region_var` for using during NLL. 175 ( 0.00%) pub fn next_nll_region_var_in_universe( . &self, . origin: NllRegionVariableOrigin, . universe: ty::UniverseIndex, . ) -> ty::Region<'tcx> { 1,265 ( 0.00%) self.next_region_var_in_universe(RegionVariableOrigin::Nll(origin), universe) 350 ( 0.00%) } . 21,672 ( 0.00%) pub fn var_for_def(&self, span: Span, param: &ty::GenericParamDef) -> GenericArg<'tcx> { 12,251 ( 0.00%) match param.kind { . GenericParamDefKind::Lifetime => { . // Create a region inference variable for the given . // region parameter definition. 647 ( 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)`. 8,248 ( 0.00%) let ty_var_id = self.inner.borrow_mut().type_variables().new_var( . self.universe(), 10,310 ( 0.00%) TypeVariableOrigin { . kind: TypeVariableOriginKind::TypeParameterDefinition( 2,062 ( 0.00%) param.name, 2,062 ( 0.00%) Some(param.def_id), . ), . span, . }, . ); . 2,062 ( 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, -- line 1196 ---------------------------------------- -- line 1202 ---------------------------------------- . }); . self.tcx.mk_const_var(const_var_id, self.tcx.type_of(param.def_id)).into() . } . } . } . . /// Given a set of generics defined on a type or impl, returns a substitution mapping each . /// type/region parameter to a fresh inference variable. 4,965 ( 0.00%) pub fn fresh_substs_for_item(&self, span: Span, def_id: DefId) -> SubstsRef<'tcx> { 22,615 ( 0.00%) InternalSubsts::for_item(self.tcx, def_id, |param, _| self.var_for_def(span, param)) 3,310 ( 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). 224 ( 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() . ); . 10,564 ( 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() 336 ( 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`. 11,410 ( 0.00%) pub fn resolve_regions( . &self, . region_context: DefId, . outlives_env: &OutlivesEnvironment<'tcx>, . mode: RegionckMode, . ) -> Vec> { 30,970 ( 0.01%) let (var_infos, data) = { . let mut inner = self.inner.borrow_mut(); . let inner = &mut *inner; 1,630 ( 0.00%) assert!( 4,890 ( 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() 1,630 ( 0.00%) }; . . let region_rels = 1,630 ( 0.00%) &RegionRelations::new(self.tcx, region_context, outlives_env.free_region_map()); . 14,670 ( 0.00%) let (lexical_region_resolutions, errors) = 39,120 ( 0.01%) lexical_region_resolve::resolve(region_rels, var_infos, data, mode); . 6,520 ( 0.00%) let old_value = self.lexical_region_resolutions.replace(Some(lexical_region_resolutions)); 1,630 ( 0.00%) assert!(old_value.is_none()); . . errors 14,670 ( 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`. 16,300 ( 0.00%) pub fn resolve_regions_and_report_errors( . &self, . region_context: DefId, . outlives_env: &OutlivesEnvironment<'tcx>, . mode: RegionckMode, . ) { 3,260 ( 0.00%) let errors = self.resolve_regions(region_context, outlives_env, mode); . 4,890 ( 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. 3,260 ( 0.00%) self.report_region_errors(&errors); . } 8,150 ( 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 -- line 1307 ---------------------------------------- -- line 1319 ---------------------------------------- . } . . /// 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(); 6,096 ( 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. 535 ( 0.00%) pub fn take_region_var_origins(&self) -> VarInfos { . let mut inner = self.inner.borrow_mut(); 2,033 ( 0.00%) let (var_infos, data) = inner . .region_constraint_storage . .take() . .expect("regions already resolved") . .with_log(&mut inner.undo_log) 107 ( 0.00%) .into_infos_and_data(); 107 ( 0.00%) assert!(data.is_empty()); . var_infos 856 ( 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)`. 1,602 ( 0.00%) pub fn probe_ty_var(&self, vid: TyVid) -> Result, ty::UniverseIndex> { . use self::type_variable::TypeVariableValue; . 4,806 ( 0.00%) match self.inner.borrow_mut().type_variables().probe(vid) { . TypeVariableValue::Known { value } => Ok(value), . TypeVariableValue::Unknown { universe } => Err(universe), . } 5,607 ( 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>, . { 43,743 ( 0.01%) value.fold_with(&mut ShallowResolver { infcx: self }) . } . 1,148 ( 0.00%) pub fn root_var(&self, var: ty::TyVid) -> ty::TyVid { . self.inner.borrow_mut().type_variables().root_var(var) 1,722 ( 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. 800 ( 0.00%) pub fn resolve_vars_if_possible(&self, value: T) -> T . where . T: TypeFoldable<'tcx>, . { 37,488 ( 0.01%) if !value.needs_infer() { 90,210 ( 0.02%) return value; // Avoid duplicated subst-folding. . } 19,299 ( 0.00%) let mut r = resolve::OpportunisticVarResolver::new(self); 25,299 ( 0.00%) value.fold_with(&mut r) 727 ( 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) . } . 1,386 ( 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 = 24,117 ( 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 }, . ) . }; 192,490 ( 0.03%) self.tcx.replace_bound_vars(value, fld_r, fld_t, fld_c) 924 ( 0.00%) } . . /// See the [`region_constraints::RegionConstraintCollector::verify_generic_bound`] method. 3,544 ( 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); . 1,329 ( 0.00%) self.inner . .borrow_mut() . .unwrap_region_constraints() 7,531 ( 0.00%) .verify_generic_bound(origin, kind, a, bound); 3,101 ( 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. 12 ( 0.00%) pub fn closure_kind(&self, closure_substs: SubstsRef<'tcx>) -> Option { 24 ( 0.00%) let closure_kind_ty = closure_substs.as_closure().kind_ty(); . let closure_kind_ty = self.shallow_resolve(closure_kind_ty); 18 ( 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 { 103,999 ( 0.02%) self.universe.get() 23,579 ( 0.00%) } . . /// Creates and return a fresh universe that extends all previous . /// universes. Updates `self.universe` to that new universe. 1,066 ( 0.00%) pub fn create_next_universe(&self) -> ty::UniverseIndex { 1,106 ( 0.00%) let u = self.universe.get().next_universe(); . self.universe.set(u); . u 1,066 ( 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`. 293,304 ( 0.05%) fn shallow_resolve_ty(&self, typ: Ty<'tcx>) -> Ty<'tcx> { 140,859 ( 0.02%) 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`. 66,412 ( 0.01%) let known = self.inner.borrow_mut().type_variables().probe(v).known(); . known.map_or(typ, |t| self.shallow_resolve_ty(t)) . } . . ty::Infer(ty::IntVar(v)) => self . .inner . .borrow_mut() . .int_unification_table() . .probe_value(v) -- line 1637 ---------------------------------------- -- line 1643 ---------------------------------------- . .borrow_mut() . .float_unification_table() . .probe_value(v) . .map(|v| v.to_type(self.tcx)) . .unwrap_or(typ), . . _ => typ, . } 329,967 ( 0.06%) } . . /// `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))`. 35,375 ( 0.01%) 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 -- line 1678 ---------------------------------------- -- 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`). 785 ( 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, . } 785 ( 0.00%) } . . /// Tries to extract an inference variable from a type, returns `None` . /// for types other than `ty::Infer(_)` (or `InferTy::Fresh*`). 38 ( 0.00%) pub fn maybe_from_ty(ty: Ty<'tcx>) -> Option { 7,057 ( 0.00%) match *ty.kind() { 1,546 ( 0.00%) ty::Infer(ty::TyVar(v)) => Some(TyOrConstInferVar::Ty(v)), . ty::Infer(ty::IntVar(v)) => Some(TyOrConstInferVar::TyInt(v)), . ty::Infer(ty::FloatVar(v)) => Some(TyOrConstInferVar::TyFloat(v)), . _ => None, . } 38 ( 0.00%) } . . /// Tries to extract an inference variable from a constant, returns `None` . /// for constants other than `ty::ConstKind::Infer(_)` (or `InferConst::Fresh`). . pub fn maybe_from_const(ct: &'tcx ty::Const<'tcx>) -> Option { . match ct.val { . ty::ConstKind::Infer(InferConst::Var(v)) => Some(TyOrConstInferVar::Const(v)), . _ => None, . } -- line 1749 ---------------------------------------- -- line 1755 ---------------------------------------- . } . . impl<'a, 'tcx> TypeFolder<'tcx> for ShallowResolver<'a, 'tcx> { . fn tcx<'b>(&'b self) -> TyCtxt<'tcx> { . self.infcx.tcx . } . . fn fold_ty(&mut self, ty: Ty<'tcx>) -> Ty<'tcx> { 58,668 ( 0.01%) self.infcx.shallow_resolve_ty(ty) . } . 252 ( 0.00%) fn fold_const(&mut self, ct: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> { 126 ( 0.00%) if let ty::Const { val: ty::ConstKind::Infer(InferConst::Var(vid)), .. } = ct { . self.infcx . .inner . .borrow_mut() . .const_unification_table() . .probe_value(*vid) . .val . .known() . .unwrap_or(ct) . } else { . ct . } 315 ( 0.00%) } . } . . impl<'tcx> TypeTrace<'tcx> { . pub fn span(&self) -> Span { . self.cause.span . } . . pub fn types( -- line 1787 ---------------------------------------- -- line 1818 ---------------------------------------- . CompareImplTypeObligation { span, .. } => span, . } . } . . pub fn from_obligation_cause(cause: &traits::ObligationCause<'tcx>, default: F) -> Self . where . F: FnOnce() -> Self, . { 4,332 ( 0.00%) match *cause.code() { 422 ( 0.00%) traits::ObligationCauseCode::ReferenceOutlivesReferent(ref_type) => { 2,110 ( 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 ---------------------------------------- 269,357 ( 0.05%) -------------------------------------------------------------------------------- -- 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> { 1,002 ( 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)?; 11 ( 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 { 330 ( 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 { 9,754 ( 0.00%) self.try_map_id(|t| t.try_fold_with(folder)) . } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { 1,076 ( 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> { 20,482 ( 0.00%) fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result { 2,176,849 ( 0.38%) self.try_map_bound(|ty| ty.try_fold_with(folder)) 25,598 ( 0.00%) } . . fn try_fold_with>(self, folder: &mut F) -> Result { 635,479 ( 0.11%) folder.try_fold_binder(self) . } . 36 ( 0.00%) fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { 889 ( 0.00%) self.as_ref().skip_binder().visit_with(visitor) 32 ( 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 { 132 ( 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 { 9,271 ( 0.00%) 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 981 ---------------------------------------- . } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { . self.instance.visit_with(visitor) . } . } . . impl<'tcx> TypeFoldable<'tcx> for Ty<'tcx> { 13,155 ( 0.00%) fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result { 722,644 ( 0.13%) let kind = match *self.kind() { . ty::RawPtr(tm) => ty::RawPtr(tm.try_fold_with(folder)?), 2,256 ( 0.00%) ty::Array(typ, sz) => ty::Array(typ.try_fold_with(folder)?, sz.try_fold_with(folder)?), 1,852 ( 0.00%) ty::Slice(typ) => ty::Slice(typ.try_fold_with(folder)?), 105,354 ( 0.02%) ty::Adt(tid, substs) => ty::Adt(tid, substs.try_fold_with(folder)?), 106 ( 0.00%) ty::Dynamic(trait_ty, region) => { 210 ( 0.00%) ty::Dynamic(trait_ty.try_fold_with(folder)?, region.try_fold_with(folder)?) . } 1,294 ( 0.00%) ty::Tuple(ts) => ty::Tuple(ts.try_fold_with(folder)?), 11,972 ( 0.00%) ty::FnDef(def_id, substs) => ty::FnDef(def_id, substs.try_fold_with(folder)?), 1,837 ( 0.00%) ty::FnPtr(f) => ty::FnPtr(f.try_fold_with(folder)?), 71,719 ( 0.01%) ty::Ref(r, ty, mutbl) => { 116,113 ( 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)?), 236 ( 0.00%) ty::Closure(did, substs) => ty::Closure(did, substs.try_fold_with(folder)?), 542,948 ( 0.09%) ty::Projection(data) => ty::Projection(data.try_fold_with(folder)?), . ty::Opaque(did, substs) => ty::Opaque(did, substs.try_fold_with(folder)?), . . ty::Bool . | ty::Char . | ty::Str . | ty::Int(_) . | ty::Uint(_) . | ty::Float(_) -- line 1020 ---------------------------------------- -- line 1022 ---------------------------------------- . | ty::Infer(_) . | ty::Param(..) . | ty::Bound(..) . | ty::Placeholder(..) . | ty::Never . | ty::Foreign(..) => return Ok(self), . }; . 524,692 ( 0.09%) Ok(if *self.kind() == kind { self } else { folder.tcx().mk_ty(kind) }) 18,711 ( 0.00%) } . . fn try_fold_with>(self, folder: &mut F) -> Result { 50,895 ( 0.01%) folder.try_fold_ty(self) . } . 111,044 ( 0.02%) fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { 106,395 ( 0.02%) match self.kind() { . ty::RawPtr(ref tm) => tm.visit_with(visitor), 56 ( 0.00%) ty::Array(typ, sz) => { 238 ( 0.00%) typ.visit_with(visitor)?; 504 ( 0.00%) sz.visit_with(visitor) . } . ty::Slice(typ) => typ.visit_with(visitor), . ty::Adt(_, substs) => substs.visit_with(visitor), 2 ( 0.00%) ty::Dynamic(ref trait_ty, ref reg) => { . trait_ty.visit_with(visitor)?; 20 ( 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, _) => { 1,480 ( 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), 7 ( 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, . } 101,674 ( 0.02%) } . . fn visit_with>(&self, visitor: &mut V) -> ControlFlow { 213,361 ( 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 { 3,528 ( 0.00%) folder.try_fold_region(self) . } . . fn super_visit_with>(&self, _visitor: &mut V) -> ControlFlow { . ControlFlow::CONTINUE . } . 2 ( 0.00%) fn visit_with>(&self, visitor: &mut V) -> ControlFlow { 5,261 ( 0.00%) visitor.visit_region(*self) 6 ( 0.00%) } . } . . impl<'tcx> TypeFoldable<'tcx> for ty::Predicate<'tcx> { 30,648 ( 0.01%) fn try_fold_with>(self, folder: &mut F) -> Result { . folder.try_fold_predicate(self) 25,540 ( 0.00%) } . . fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result { 835,703 ( 0.14%) let new = self.inner.kind.try_fold_with(folder)?; 2,693,231 ( 0.47%) Ok(folder.tcx().reuse_or_mk_predicate(self, new)) 15,324 ( 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 { 46,352 ( 0.01%) visitor.visit_predicate(*self) . } . . fn has_vars_bound_at_or_above(&self, binder: ty::DebruijnIndex) -> bool { 12,105 ( 0.00%) self.inner.outer_exclusive_binder > binder 12,105 ( 0.00%) } . . fn has_type_flags(&self, flags: ty::TypeFlags) -> bool { 47,076 ( 0.01%) self.inner.flags.intersects(flags) 47,076 ( 0.01%) } . } . . impl<'tcx> TypeFoldable<'tcx> for &'tcx ty::List> { . fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result { 28,783 ( 0.00%) ty::util::fold_list(self, folder, |tcx, v| tcx.intern_predicates(v)) . } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { 160 ( 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 1158 ---------------------------------------- . } . } . . impl<'tcx> TypeFoldable<'tcx> for &'tcx ty::Const<'tcx> { . fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result { 568 ( 0.00%) let ty = self.ty.try_fold_with(folder)?; 6,671 ( 0.00%) let val = self.val.try_fold_with(folder)?; 2,126 ( 0.00%) if ty != self.ty || val != self.val { 1,014 ( 0.00%) Ok(folder.tcx().mk_const(ty::Const { ty, val })) . } else { . Ok(self) . } . } . . fn try_fold_with>(self, folder: &mut F) -> Result { 1,175 ( 0.00%) folder.try_fold_const(self) . } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { 7 ( 0.00%) self.ty.visit_with(visitor)?; . self.val.visit_with(visitor) . } . 336 ( 0.00%) fn visit_with>(&self, visitor: &mut V) -> ControlFlow { 105 ( 0.00%) visitor.visit_const(self) 392 ( 0.00%) } . } . . impl<'tcx> TypeFoldable<'tcx> for ty::ConstKind<'tcx> { . fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result { 4,315 ( 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)?), 33 ( 0.00%) ty::ConstKind::Unevaluated(uv) => ty::ConstKind::Unevaluated(uv.try_fold_with(folder)?), . ty::ConstKind::Value(_) . | ty::ConstKind::Bound(..) . | ty::ConstKind::Placeholder(..) 1,720 ( 0.00%) | ty::ConstKind::Error(_) => self, . }) . } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { 112 ( 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, 165 ( 0.00%) substs: self.substs.try_fold_with(folder)?, . promoted: self.promoted, . }) . } . . fn visit_with>(&self, visitor: &mut V) -> ControlFlow { . visitor.visit_unevaluated_const(*self) . } . -- line 1246 ---------------------------------------- 178,519 ( 0.03%) -------------------------------------------------------------------------------- -- 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 . // . 727,828 ( 0.13%) if layout.align() <= MIN_ALIGN && layout.align() <= layout.size() { 545,871 ( 0.09%) 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. 16,600 ( 0.00%) if layout.align() <= MIN_ALIGN && layout.align() <= layout.size() { 24,900 ( 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) { 186,096 ( 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 { 71,364 ( 0.01%) if layout.align() <= MIN_ALIGN && layout.align() <= new_size { 142,728 ( 0.02%) libc::realloc(ptr as *mut libc::c_void, new_size) as *mut u8 . } else { . realloc_fallback(self, ptr, layout, new_size) . } . } . } . . cfg_if::cfg_if! { . if #[cfg(any( -- line 56 ---------------------------------------- -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/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. 350,896 ( 0.06%) 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. 229,905 ( 0.04%) 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`. 12 ( 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 { 34,540 ( 0.01%) len!(self) . } . . #[inline(always)] . fn is_empty(&self) -> bool { . is_empty!(self) . } . } . -- line 128 ---------------------------------------- -- line 134 ---------------------------------------- . fn next(&mut self) -> Option<$elem> { . // could be implemented with slices, but this avoids bounds checks . . // SAFETY: `assume` calls are safe since a slice's start pointer . // must be non-null, and slices over non-ZSTs must also have a . // non-null end pointer. The call to `next_unchecked!` is safe . // since we check if the iterator is empty first. . unsafe { 76,770 ( 0.01%) assume(!self.ptr.as_ptr().is_null()); . if mem::size_of::() != 0 { 127,902 ( 0.02%) assume(!self.end.is_null()); . } 12,694,010 ( 2.20%) if is_empty!(self) { . None . } else { . Some(next_unchecked!(self)) . } . } . } . . #[inline] . fn size_hint(&self) -> (usize, Option) { 237,162 ( 0.04%) let exact = len!(self); . (exact, Some(exact)) . } . . #[inline] . fn count(self) -> usize { . len!(self) . } . . #[inline] . fn nth(&mut self, n: usize) -> Option<$elem> { 3,017 ( 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() { 638 ( 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, . { 162 ( 0.00%) while let Some(x) = self.next() { 5,208 ( 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] 8 ( 0.00%) fn any(&mut self, mut f: F) -> bool . where . Self: Sized, . F: FnMut(Self::Item) -> bool, . { 54,918 ( 0.01%) while let Some(x) = self.next() { 122,121 ( 0.02%) if f(x) { . return true; . } . } . false 8 ( 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, . { 3,392 ( 0.00%) while let Some(x) = self.next() { 12,967 ( 0.00%) if predicate(&x) { . return Some(x); . } . } . None 816 ( 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, . { 15,849 ( 0.00%) while let Some(x) = self.next() { 44,847 ( 0.01%) if let Some(y) = f(x) { 5,922 ( 0.00%) return Some(y); . } . } . None 2,395 ( 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() { 21,911 ( 0.00%) 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; 2,370 ( 0.00%) while let Some(x) = self.next_back() { 28,193 ( 0.00%) i -= 1; 24,746 ( 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` 36,220 ( 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 351 ---------------------------------------- . . // SAFETY: `assume` calls are safe since a slice's start pointer must be non-null, . // and slices over non-ZSTs must also have a non-null end pointer. . // The call to `next_back_unchecked!` is safe since we check if the iterator is . // empty first. . unsafe { . assume(!self.ptr.as_ptr().is_null()); . if mem::size_of::() != 0 { 13 ( 0.00%) assume(!self.end.is_null()); . } 104,739 ( 0.02%) if is_empty!(self) { . None . } else { . Some(next_back_unchecked!(self)) . } . } . } . . #[inline] -- line 369 ---------------------------------------- 1,736,260 ( 0.30%) -------------------------------------------------------------------------------- -- 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) { 80 ( 0.00%) let old = self.replace(val); 436 ( 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. 58,452 ( 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 { 93,688 ( 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 { 24,328 ( 0.00%) RefCell { 25,856 ( 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. 836 ( 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] 1,089 ( 0.00%) pub fn borrow(&self) -> Ref<'_, T> { . self.try_borrow().expect("already mutably borrowed") 3,267 ( 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] 2,772 ( 0.00%) pub fn borrow_mut(&self) -> RefMut<'_, T> { . self.try_borrow_mut().expect("already borrowed") 8,316 ( 0.00%) } . . /// Mutably borrows the wrapped value, returning an error if the value is currently borrowed. . /// . /// The borrow lasts until the returned `RefMut` or all `RefMut`s derived . /// from it exit scope. The value cannot be borrowed while this borrow is . /// active. . /// . /// This is the non-panicking variant of [`borrow_mut`](#method.borrow_mut). -- line 955 ---------------------------------------- -- line 975 ---------------------------------------- . match BorrowRefMut::new(&self.borrow) { . Some(b) => { . #[cfg(feature = "debug_refcell")] . { . self.borrowed_at.set(Some(crate::panic::Location::caller())); . } . . // SAFETY: `BorrowRef` guarantees unique access. 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> { 135,636 ( 0.02%) let b = borrow.get().wrapping_add(1); 79,410 ( 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) { 60,684 ( 0.01%) let borrow = self.borrow.get(); . debug_assert!(is_reading(borrow)); 121,265 ( 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) { 1,118,220 ( 0.19%) let borrow = self.borrow.get(); . debug_assert!(is_writing(borrow)); 2,189,920 ( 0.38%) 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. 2,307,703 ( 0.40%) 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 { 112 ( 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! 487,569 ( 0.08%) 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 ---------------------------------------- 1,607,765 ( 0.28%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/slice/cmp.rs -------------------------------------------------------------------------------- Ir -- line 18 ---------------------------------------- . fn memcmp(s1: *const u8, s2: *const u8, n: usize) -> i32; . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl PartialEq<[B]> for [A] . where . A: PartialEq, . { 18,867 ( 0.00%) fn eq(&self, other: &[B]) -> bool { . SlicePartialEq::equal(self, other) 22,791 ( 0.00%) } . . fn ne(&self, other: &[B]) -> bool { . SlicePartialEq::not_equal(self, other) . } . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl Eq for [T] {} -- line 36 ---------------------------------------- -- line 62 ---------------------------------------- . } . . // Generic slice equality . impl SlicePartialEq for [A] . where . A: PartialEq, . { . default fn equal(&self, other: &[B]) -> bool { 366,890 ( 0.06%) if self.len() != other.len() { . return false; . } . 4,504 ( 0.00%) self.iter().zip(other.iter()).all(|(x, y)| x == y) . } . } . . // Use memcmp for bytewise equality when the types allow . impl SlicePartialEq for [A] . where . A: BytewiseEquality, . { . fn equal(&self, other: &[B]) -> bool { 35,868 ( 0.01%) if self.len() != other.len() { . return false; . } . . // SAFETY: `self` and `other` are references and are thus guaranteed to be valid. . // The two slices have been checked to have the same size above. . unsafe { . let size = mem::size_of_val(self); 83,934 ( 0.01%) memcmp(self.as_ptr() as *const u8, other.as_ptr() as *const u8, size) == 0 . } . } . } . . #[doc(hidden)] . // intermediate trait for specialization of slice's PartialOrd . trait SlicePartialOrd: Sized { . fn partial_compare(left: &[Self], right: &[Self]) -> Option; -- line 100 ---------------------------------------- -- line 168 ---------------------------------------- . default fn compare(left: &[Self], right: &[Self]) -> Ordering { . let l = cmp::min(left.len(), right.len()); . . // Slice to the loop iteration range to enable bound check . // elimination in the compiler . let lhs = &left[..l]; . let rhs = &right[..l]; . 2 ( 0.00%) for i in 0..l { . match lhs[i].cmp(&rhs[i]) { . Ordering::Equal => (), . non_eq => return non_eq, . } . } . . left.len().cmp(&right.len()) . } -- line 184 ---------------------------------------- -- line 188 ---------------------------------------- . // this matches the order we want for [u8], but no others (not even [i8]). . impl SliceOrd for u8 { . #[inline] . fn compare(left: &[Self], right: &[Self]) -> Ordering { . let order = . // SAFETY: `left` and `right` are references and are thus guaranteed to be valid. . // We use the minimum of both lengths which guarantees that both regions are . // valid for reads in that interval. 2,434 ( 0.00%) unsafe { memcmp(left.as_ptr(), right.as_ptr(), cmp::min(left.len(), right.len())) }; 4,868 ( 0.00%) if order == 0 { . left.len().cmp(&right.len()) 903 ( 0.00%) } else if order < 0 { . Less . } else { . Greater . } . } . } . . // Hack to allow specializing on `Eq` even though `Eq` has a method. -- line 207 ---------------------------------------- -- line 230 ---------------------------------------- . pub(super) trait SliceContains: Sized { . fn slice_contains(&self, x: &[Self]) -> bool; . } . . impl SliceContains for T . where . T: PartialEq, . { 40 ( 0.00%) default fn slice_contains(&self, x: &[Self]) -> bool { 6,181 ( 0.00%) x.iter().any(|y| *y == *self) 60 ( 0.00%) } . } . . impl SliceContains for u8 { . #[inline] . fn slice_contains(&self, x: &[Self]) -> bool { . memchr::memchr(*self, x).is_some() . } . } -- line 248 ---------------------------------------- 408,628 ( 0.07%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_parse/src/lexer/tokentrees.rs -------------------------------------------------------------------------------- Ir -- line 8 ---------------------------------------- . }; . use rustc_ast_pretty::pprust::token_to_string; . use rustc_data_structures::fx::FxHashMap; . use rustc_errors::PResult; . use rustc_span::Span; . . impl<'a> StringReader<'a> { . pub(super) fn into_token_trees(self) -> (PResult<'a, TokenStream>, Vec) { 285 ( 0.00%) let mut tt_reader = TokenTreesReader { . string_reader: self, 15 ( 0.00%) token: Token::dummy(), . open_braces: Vec::new(), . unmatched_braces: Vec::new(), . matching_delim_spans: Vec::new(), . last_unclosed_found_span: None, . last_delim_empty_block_spans: FxHashMap::default(), . matching_block_spans: Vec::new(), . }; 15 ( 0.00%) let res = tt_reader.parse_all_token_trees(); 90 ( 0.00%) (res, tt_reader.unmatched_braces) . } . } . . struct TokenTreesReader<'a> { . string_reader: StringReader<'a>, . token: Token, . /// Stack of open delimiters and their spans. Used for error message. . open_braces: Vec<(token::DelimToken, Span)>, -- line 35 ---------------------------------------- -- line 43 ---------------------------------------- . last_delim_empty_block_spans: FxHashMap, . /// Collect the spans of braces (Open, Close). Used only . /// for detecting if blocks are empty and only braces. . matching_block_spans: Vec<(Span, Span)>, . } . . impl<'a> TokenTreesReader<'a> { . // Parse a stream of tokens into a list of `TokenTree`s, up to an `Eof`. 120 ( 0.00%) fn parse_all_token_trees(&mut self) -> PResult<'a, TokenStream> { . let mut buf = TokenStreamBuilder::default(); . . self.bump(); 6,662 ( 0.00%) while self.token != token::Eof { 26,528 ( 0.00%) buf.push(self.parse_token_tree()?); . } . . Ok(buf.into_token_stream()) 135 ( 0.00%) } . . // Parse a stream of tokens into a list of `TokenTree`s, up to a `CloseDelim`. . fn parse_token_trees_until_close_delim(&mut self) -> TokenStream { . let mut buf = TokenStreamBuilder::default(); . loop { 17,186 ( 0.00%) if let token::CloseDelim(..) = self.token.kind { . return buf.into_token_stream(); . } . 36,550 ( 0.01%) match self.parse_token_tree() { 65,790 ( 0.01%) Ok(tree) => buf.push(tree), . Err(mut e) => { . e.emit(); . return buf.into_token_stream(); . } . } . } . } . 95,634 ( 0.02%) fn parse_token_tree(&mut self) -> PResult<'a, TreeAndSpacing> { 21,252 ( 0.00%) let sm = self.string_reader.sess.source_map(); . 90,502 ( 0.02%) match self.token.kind { . token::Eof => { . let msg = "this file contains an unclosed delimiter"; . let mut err = . self.string_reader.sess.span_diagnostic.struct_span_err(self.token.span, msg); . for &(_, sp) in &self.open_braces { . err.span_label(sp, "unclosed delimiter"); . self.unmatched_braces.push(UnmatchedBrace { . expected_delim: token::DelimToken::Brace, -- line 91 ---------------------------------------- -- line 113 ---------------------------------------- . err.span_label( . *close_sp, . "...as it matches this but it has different indentation", . ); . } . } . Err(err) . } 1,283 ( 0.00%) token::OpenDelim(delim) => { . // The span for beginning of the delimited section 1,283 ( 0.00%) let pre_span = self.token.span; . . // Parse the open delimiter. 8,981 ( 0.00%) self.open_braces.push((delim, self.token.span)); . self.bump(); . . // Parse the token trees within the delimiters. . // We stop at any delimiter so we can try to recover if the user . // uses an incorrect delimiter. 1,283 ( 0.00%) let tts = self.parse_token_trees_until_close_delim(); . . // Expand to cover the entire delimited token tree 6,415 ( 0.00%) let delim_span = DelimSpan::from_pair(pre_span, self.token.span); . 2,566 ( 0.00%) match self.token.kind { . // Correct delimiter. 2,566 ( 0.00%) token::CloseDelim(d) if d == delim => { . let (open_brace, open_brace_span) = self.open_braces.pop().unwrap(); 2,566 ( 0.00%) let close_brace_span = self.token.span; . 3,849 ( 0.00%) if tts.is_empty() { 372 ( 0.00%) let empty_block_span = open_brace_span.to(close_brace_span); 496 ( 0.00%) if !sm.is_multiline(empty_block_span) { . // Only track if the block is in the form of `{}`, otherwise it is . // likely that it was written on purpose. . self.last_delim_empty_block_spans.insert(delim, empty_block_span); . } . } . . //only add braces 5,132 ( 0.00%) if let (DelimToken::Brace, DelimToken::Brace) = (open_brace, delim) { . self.matching_block_spans.push((open_brace_span, close_brace_span)); . } . 1,283 ( 0.00%) if self.open_braces.is_empty() { . // Clear up these spans to avoid suggesting them as we've found . // properly matched delimiters so far for an entire block. . self.matching_delim_spans.clear(); . } else { . self.matching_delim_spans.push(( . open_brace, . open_brace_span, . close_brace_span, -- line 165 ---------------------------------------- -- line 218 ---------------------------------------- . token::Eof => { . // Silently recover, the EOF token will be seen again . // and an error emitted then. Thus we don't pop from . // self.open_braces here. . } . _ => {} . } . 8,981 ( 0.00%) Ok(TokenTree::Delimited(delim_span, delim, tts).into()) . } . token::CloseDelim(delim) => { . // An unexpected closing delimiter (i.e., there is no . // matching opening delimiter). . let token_str = token_to_string(&self.token); . let msg = format!("unexpected closing delimiter: `{}`", token_str); . let mut err = . self.string_reader.sess.span_diagnostic.struct_span_err(self.token.span, &msg); -- line 234 ---------------------------------------- -- line 253 ---------------------------------------- . err.span_label(parent.1, "...matches this closing brace"); . } . } . . err.span_label(self.token.span, "unexpected closing delimiter"); . Err(err) . } . _ => { 46,715 ( 0.01%) let tt = TokenTree::Token(self.token.take()); . let mut spacing = self.bump(); 18,686 ( 0.00%) if !self.token.is_op() { . spacing = Alone; . } 56,058 ( 0.01%) Ok((tt, spacing)) . } . } 85,008 ( 0.01%) } . . fn bump(&mut self) -> Spacing { 100,856 ( 0.02%) let (spacing, token) = self.string_reader.next_token(); 53,265 ( 0.01%) self.token = token; . spacing . } . } . 1,283 ( 0.00%) #[derive(Default)] . struct TokenStreamBuilder { . buf: Vec, . } . . impl TokenStreamBuilder { 138,138 ( 0.02%) fn push(&mut self, (tree, joint): TreeAndSpacing) { 69,044 ( 0.01%) if let Some((TokenTree::Token(prev_token), Joint)) = self.buf.last() { 6,260 ( 0.00%) if let TokenTree::Token(token) = &tree { 11,782 ( 0.00%) if let Some(glued) = prev_token.glue(token) { . self.buf.pop(); 7,176 ( 0.00%) self.buf.push((TokenTree::Token(glued), joint)); . return; . } . } . } 50,140 ( 0.01%) self.buf.push((tree, joint)) 85,008 ( 0.01%) } . . fn into_token_stream(self) -> TokenStream { 12,965 ( 0.00%) TokenStream::new(self.buf) . } . } 33,044 ( 0.01%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/opaque.rs -------------------------------------------------------------------------------- Ir -- line 14 ---------------------------------------- . . pub type EncodeResult = Result<(), !>; . . pub struct Encoder { . pub data: Vec, . } . . impl Encoder { 1 ( 0.00%) pub fn new(data: Vec) -> Encoder { 4 ( 0.00%) Encoder { data } 1 ( 0.00%) } . 1 ( 0.00%) pub fn into_inner(self) -> Vec { 4 ( 0.00%) self.data 1 ( 0.00%) } . . #[inline] . pub fn position(&self) -> usize { 7,837 ( 0.00%) self.data.len() . } . } . . macro_rules! write_leb128 { . ($enc:expr, $value:expr, $int_ty:ty, $fun:ident) => {{ . const MAX_ENCODED_LEN: usize = max_leb128_len!($int_ty); . let old_len = $enc.data.len(); . -- line 40 ---------------------------------------- -- line 67 ---------------------------------------- . . #[inline] . fn emit_unit(&mut self) -> EncodeResult { . Ok(()) . } . . #[inline] . fn emit_usize(&mut self, v: usize) -> EncodeResult { 109,741 ( 0.02%) write_leb128!(self, v, usize, write_usize_leb128) . } . . #[inline] . fn emit_u128(&mut self, v: u128) -> EncodeResult { 70 ( 0.00%) write_leb128!(self, v, u128, write_u128_leb128) . } . . #[inline] . fn emit_u64(&mut self, v: u64) -> EncodeResult { 357 ( 0.00%) write_leb128!(self, v, u64, write_u64_leb128) . } . . #[inline] . fn emit_u32(&mut self, v: u32) -> EncodeResult { 107,023 ( 0.02%) write_leb128!(self, v, u32, write_u32_leb128) . } . . #[inline] . fn emit_u16(&mut self, v: u16) -> EncodeResult { . self.data.extend_from_slice(&v.to_le_bytes()); . Ok(()) . } . -- line 98 ---------------------------------------- -- line 131 ---------------------------------------- . #[inline] . fn emit_i8(&mut self, v: i8) -> EncodeResult { . let as_u8: u8 = unsafe { std::mem::transmute(v) }; . self.emit_u8(as_u8) . } . . #[inline] . fn emit_bool(&mut self, v: bool) -> EncodeResult { 1,172 ( 0.00%) self.emit_u8(if v { 1 } else { 0 }) . } . . #[inline] . fn emit_f64(&mut self, v: f64) -> EncodeResult { . let as_u64: u64 = v.to_bits(); . self.emit_u64(as_u64) . } . -- line 147 ---------------------------------------- -- line 549 ---------------------------------------- . #[inline] . pub fn advance(&mut self, bytes: usize) { . self.position += bytes; . } . . #[inline] . pub fn read_raw_bytes(&mut self, bytes: usize) -> &'a [u8] { . let start = self.position; 12 ( 0.00%) self.position += bytes; 12 ( 0.00%) &self.data[start..self.position] . } . } . . macro_rules! read_leb128 { . ($dec:expr, $fun:ident) => {{ leb128::$fun($dec.data, &mut $dec.position) }}; . } . . impl<'a> serialize::Decoder for Decoder<'a> { . #[inline] . fn read_unit(&mut self) -> () { . () . } . . #[inline] . fn read_u128(&mut self) -> u128 { 558 ( 0.00%) read_leb128!(self, read_u128_leb128) . } . . #[inline] . fn read_u64(&mut self) -> u64 { 1,317 ( 0.00%) read_leb128!(self, read_u64_leb128) . } . . #[inline] 26,834 ( 0.00%) fn read_u32(&mut self) -> u32 { 118,100 ( 0.02%) read_leb128!(self, read_u32_leb128) 53,668 ( 0.01%) } . . #[inline] . fn read_u16(&mut self) -> u16 { 583,156 ( 0.10%) let bytes = [self.data[self.position], self.data[self.position + 1]]; 83,308 ( 0.01%) let value = u16::from_le_bytes(bytes); 166,616 ( 0.03%) self.position += 2; . value . } . . #[inline] . fn read_u8(&mut self) -> u8 { 1,225,458 ( 0.21%) let value = self.data[self.position]; 244,229 ( 0.04%) self.position += 1; . value . } . . #[inline] 160,848 ( 0.03%) fn read_usize(&mut self) -> usize { 160,888 ( 0.03%) read_leb128!(self, read_usize_leb128) 321,696 ( 0.06%) } . . #[inline] . fn read_i128(&mut self) -> i128 { . read_leb128!(self, read_i128_leb128) . } . . #[inline] . fn read_i64(&mut self) -> i64 { -- line 613 ---------------------------------------- -- line 637 ---------------------------------------- . #[inline] . fn read_isize(&mut self) -> isize { . read_leb128!(self, read_isize_leb128) . } . . #[inline] . fn read_bool(&mut self) -> bool { . let value = self.read_u8(); 8,439 ( 0.00%) value != 0 . } . . #[inline] . fn read_f64(&mut self) -> f64 { . let bits = self.read_u64(); . f64::from_bits(bits) . } . -- line 653 ---------------------------------------- -- line 660 ---------------------------------------- . #[inline] . fn read_char(&mut self) -> char { . let bits = self.read_u32(); . std::char::from_u32(bits).unwrap() . } . . #[inline] . fn read_str(&mut self) -> Cow<'_, str> { 18,079 ( 0.00%) let len = self.read_usize(); 113,656 ( 0.02%) let sentinel = self.data[self.position + len]; 28,444 ( 0.00%) assert!(sentinel == STR_SENTINEL); . let s = unsafe { . std::str::from_utf8_unchecked(&self.data[self.position..self.position + len]) . }; 71,110 ( 0.01%) self.position += len + 1; 11,691 ( 0.00%) Cow::Borrowed(s) . } . . #[inline] . fn read_raw_bytes_into(&mut self, s: &mut [u8]) { 170 ( 0.00%) let start = self.position; 884 ( 0.00%) self.position += s.len(); 170 ( 0.00%) s.copy_from_slice(&self.data[start..self.position]); . } . } . . // Specializations for contiguous byte sequences follow. The default implementations for slices . // encode and decode each element individually. This isn't necessary for `u8` slices when using . // opaque encoders and decoders, because each `u8` is unchanged by encoding and decoding. . // Therefore, we can use more efficient implementations that process the entire sequence at once. . -- line 690 ---------------------------------------- 420,580 ( 0.07%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_lexer/src/unescape.rs -------------------------------------------------------------------------------- Ir -- line 73 ---------------------------------------- . EscapeError::UnskippedWhitespaceWarning | EscapeError::MultipleSkippedLinesWarning . ) . } . } . . /// Takes a contents of a literal (without quotes) and produces a . /// sequence of escaped characters or errors. . /// Values are returned through invoking of the provided callback. 4,464 ( 0.00%) pub fn unescape_literal(literal_text: &str, mode: Mode, callback: &mut F) . where . F: FnMut(Range, Result), . { . match mode { . Mode::Char | Mode::Byte => { . let mut chars = literal_text.chars(); . let result = unescape_char_or_byte(&mut chars, mode); . // The Chars iterator moved forward. -- line 89 ---------------------------------------- -- line 91 ---------------------------------------- . } . Mode::Str | Mode::ByteStr => unescape_str_or_byte_str(literal_text, mode, callback), . // NOTE: Raw strings do not perform any explicit character escaping, here we . // only translate CRLF to LF and produce errors on bare CR. . Mode::RawStr | Mode::RawByteStr => { . unescape_raw_str_or_byte_str(literal_text, mode, callback) . } . } 1,984 ( 0.00%) } . . /// Takes a contents of a byte, byte string or raw byte string (without quotes) . /// and produces a sequence of bytes or errors. . /// Values are returned through invoking of the provided callback. . pub fn unescape_byte_literal(literal_text: &str, mode: Mode, callback: &mut F) . where . F: FnMut(Range, Result), . { -- line 107 ---------------------------------------- -- line 136 ---------------------------------------- . Byte, . ByteStr, . RawStr, . RawByteStr, . } . . impl Mode { . pub fn in_single_quotes(self) -> bool { 496 ( 0.00%) match self { . Mode::Char | Mode::Byte => true, . Mode::Str | Mode::ByteStr | Mode::RawStr | Mode::RawByteStr => false, . } . } . 496 ( 0.00%) pub fn in_double_quotes(self) -> bool { . !self.in_single_quotes() 248 ( 0.00%) } . . pub fn is_bytes(self) -> bool { . match self { . Mode::Byte | Mode::ByteStr | Mode::RawByteStr => true, . Mode::Char | Mode::Str | Mode::RawStr => false, . } . } . } . 1,102,890 ( 0.19%) fn scan_escape(first_char: char, chars: &mut Chars<'_>, mode: Mode) -> Result { 534,259 ( 0.09%) if first_char != '\\' { . // Previous character was not a slash, and we don't expect it to be . // an escape-only character. . return match first_char { . '\t' | '\n' => Err(EscapeError::EscapeOnlyChar), . '\r' => Err(EscapeError::BareCarriageReturn), . '\'' if mode.in_single_quotes() => Err(EscapeError::EscapeOnlyChar), . '"' if mode.in_double_quotes() => Err(EscapeError::EscapeOnlyChar), . _ => { 107,373 ( 0.02%) if mode.is_bytes() && !first_char.is_ascii() { . // Byte literal can't be a non-ascii character. . return Err(EscapeError::NonAsciiCharInByte); . } . Ok(first_char) . } . }; . } . . // Previous character is '\\', try to unescape it. . 8,748 ( 0.00%) let second_char = chars.next().ok_or(EscapeError::LoneSlash)?; . . let res = match second_char { . '"' => '"', . 'n' => '\n', . 'r' => '\r', . 't' => '\t', . '\\' => '\\', . '\'' => '\'', -- line 191 ---------------------------------------- -- line 263 ---------------------------------------- . value = value * 16 + digit; . } . }; . } . } . _ => return Err(EscapeError::InvalidEscape), . }; . Ok(res) 1,323,468 ( 0.23%) } . . fn unescape_char_or_byte(chars: &mut Chars<'_>, mode: Mode) -> Result { . let first_char = chars.next().ok_or(EscapeError::ZeroChars)?; . let res = scan_escape(first_char, chars, mode)?; . if chars.next().is_some() { . return Err(EscapeError::MoreThanOneChar); . } . Ok(res) -- line 279 ---------------------------------------- -- line 280 ---------------------------------------- . } . . /// Takes a contents of a string literal (without quotes) and produces a . /// sequence of escaped characters or errors. . fn unescape_str_or_byte_str(src: &str, mode: Mode, callback: &mut F) . where . F: FnMut(Range, Result), . { 797 ( 0.00%) assert!(mode.in_double_quotes()); . let initial_len = src.len(); 248 ( 0.00%) let mut chars = src.chars(); . while let Some(first_char) = chars.next() { 551,445 ( 0.10%) let start = initial_len - chars.as_str().len() - first_char.len_utf8(); . 650,070 ( 0.11%) let unescaped_char = match first_char { . '\\' => { . let second_char = chars.clone().next(); 5,832 ( 0.00%) match second_char { . Some('\n') => { . // Rust language specification requires us to skip whitespaces . // if unescaped '\' character is followed by '\n'. . // For details see [Rust language reference] . // (https://doc.rust-lang.org/reference/tokens.html#string-literals). . skip_ascii_whitespace(&mut chars, start, callback); . continue; . } 2,916 ( 0.00%) _ => scan_escape(first_char, &mut chars, mode), . } . } . '\n' => Ok('\n'), . '\t' => Ok('\t'), . _ => scan_escape(first_char, &mut chars, mode), . }; 223,966 ( 0.04%) let end = initial_len - chars.as_str().len(); 364,747 ( 0.06%) callback(start..end, unescaped_char); . } . . fn skip_ascii_whitespace(chars: &mut Chars<'_>, start: usize, callback: &mut F) . where . F: FnMut(Range, Result), . { . let tail = chars.as_str(); . let first_non_space = tail -- line 322 ---------------------------------------- -- line 344 ---------------------------------------- . /// Takes a contents of a string literal (without quotes) and produces a . /// sequence of characters or errors. . /// NOTE: Raw strings do not perform any explicit character escaping, here we . /// only translate CRLF to LF and produce errors on bare CR. . fn unescape_raw_str_or_byte_str(literal_text: &str, mode: Mode, callback: &mut F) . where . F: FnMut(Range, Result), . { 390 ( 0.00%) assert!(mode.in_double_quotes()); . let initial_len = literal_text.len(); . . let mut chars = literal_text.chars(); . while let Some(curr) = chars.next() { . let start = initial_len - chars.as_str().len() - curr.len_utf8(); . . let result = match curr { . '\r' => Err(EscapeError::BareCarriageReturnInRawString), -- line 360 ---------------------------------------- 1,058,894 ( 0.18%) -------------------------------------------------------------------------------- -- 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> { 81,376 ( 0.01%) #[instrument(level = "debug", skip(self))] 101,720 ( 0.02%) 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. 20,344 ( 0.00%) 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. 91,548 ( 0.02%) 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()); . 128,647 ( 0.02%) if let Some(c) = 30,516 ( 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. 14,610 ( 0.00%) let (candidate, dep_node) = 7,305 ( 0.00%) self.in_task(|this| this.candidate_from_obligation_no_cache(stack)); . . debug!(?candidate, "CACHE MISS"); . self.insert_candidate_cache( 4,870 ( 0.00%) stack.obligation.param_env, 9,740 ( 0.00%) cache_fresh_trait_pred, . dep_node, . candidate.clone(), . ); 29,220 ( 0.01%) candidate . } . 24,350 ( 0.00%) fn candidate_from_obligation_no_cache<'o>( . &mut self, . stack: &TraitObligationStack<'o, 'tcx>, . ) -> SelectionResult<'tcx, SelectionCandidate<'tcx>> { 130 ( 0.00%) if let Some(conflict) = self.is_knowable(stack) { . debug!("coherence stage: not knowable"); 16 ( 0.00%) 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() { . if self.evaluate_candidate(stack, &c)?.may_apply() { . no_candidates_apply = false; -- line 87 ---------------------------------------- -- line 106 ---------------------------------------- . } else { . IntercrateAmbiguityCause::DownstreamCrate { trait_desc, self_desc } . }; . debug!(?cause, "evaluate_stack: pushing cause"); . self.intercrate_ambiguity_causes.as_mut().unwrap().push(cause); . } . } . } 32 ( 0.00%) return Ok(None); . } . 7,257 ( 0.00%) let candidate_set = self.assemble_candidates(stack)?; . 4,838 ( 0.00%) if candidate_set.ambiguous { . debug!("candidate set contains ambig"); 368 ( 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. . 8,940 ( 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`". 4,470 ( 0.00%) if candidates.len() == 1 { 5,553 ( 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. 2,304 ( 0.00%) let mut candidates = candidates . .into_iter() . .map(|c| match self.evaluate_candidate(stack, &c) { 942 ( 0.00%) Ok(eval) if eval.may_apply() => { 1,176 ( 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()); . 384 ( 0.00%) let needs_infer = stack.obligation.predicate.has_infer_types_or_consts(); . 1,152 ( 0.00%) let sized_predicate = self.tcx().lang_items().sized_trait() 768 ( 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. 1,152 ( 0.00%) if candidates.len() > 1 { . let mut i = 0; 196 ( 0.00%) while i < candidates.len() { 237 ( 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()); 170 ( 0.00%) i += 1; . . // If there are *STILL* multiple candidates, give up . // and report ambiguity. 255 ( 0.00%) if i > 1 { . debug!("multiple matches, ambig"); 288 ( 0.00%) return Err(Ambiguous( . candidates . .into_iter() 63 ( 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). 360 ( 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. 626 ( 0.00%) if stack.obligation.references_error() { . debug!("no results for error type, treating as ambiguous"); 313 ( 0.00%) return Ok(None); . } . return Err(Unimplemented); . } . . // Just one candidate left. 141 ( 0.00%) self.filter_reservation_impls(candidates.pop().unwrap().candidate, stack.obligation) 22,635 ( 0.00%) } . 19,352 ( 0.00%) #[instrument(skip(self, stack), level = "debug")] 24,190 ( 0.00%) pub(super) fn assemble_candidates<'o>( . &mut self, . stack: &TraitObligationStack<'o, 'tcx>, . ) -> Result, SelectionError<'tcx>> { 2,419 ( 0.00%) let TraitObligationStack { obligation, .. } = *stack; 45,961 ( 0.01%) let obligation = &Obligation { 2,419 ( 0.00%) param_env: obligation.param_env, . cause: obligation.cause.clone(), 7,257 ( 0.00%) recursion_depth: obligation.recursion_depth, 29,028 ( 0.01%) predicate: self.infcx().resolve_vars_if_possible(obligation.predicate), . }; . 5,194 ( 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. 534 ( 0.00%) return Ok(SelectionCandidateSet { vec: vec![], ambiguous: true }); . } . 6,723 ( 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. 4,482 ( 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 { 2,241 ( 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. 13,446 ( 0.00%) let def_id = obligation.predicate.def_id(); 2,241 ( 0.00%) let lang_items = self.tcx().lang_items(); . 7,037 ( 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. 157 ( 0.00%) self.assemble_candidates_from_impls(obligation, &mut candidates); . . // For other types, we'll use the builtin rules. 628 ( 0.00%) let copy_conditions = self.copy_clone_conditions(obligation); 1,570 ( 0.00%) self.assemble_builtin_bound_candidates(copy_conditions, &mut candidates); 6,252 ( 0.00%) } else if lang_items.discriminant_kind_trait() == Some(def_id) { . // `DiscriminantKind` is automatically implemented for every type. . candidates.vec.push(DiscriminantKindCandidate); 6,252 ( 0.00%) } else if lang_items.pointee_trait() == Some(def_id) { . // `Pointee` is automatically implemented for every type. . candidates.vec.push(PointeeCandidate); 7,020 ( 0.00%) } else if lang_items.sized_trait() == Some(def_id) { . // Sized is never implementable by end-users, it is . // always automatically computed. 384 ( 0.00%) let sized_conditions = self.sized_conditions(obligation); 3,840 ( 0.00%) self.assemble_builtin_bound_candidates(sized_conditions, &mut candidates); 5,196 ( 0.00%) } else if lang_items.unsize_trait() == Some(def_id) { 96 ( 0.00%) self.assemble_candidates_for_unsizing(obligation, &mut candidates); 4,983 ( 0.00%) } else if lang_items.drop_trait() == Some(def_id) . && obligation.predicate.skip_binder().constness == ty::BoundConstness::ConstIfConst . { 40 ( 0.00%) self.assemble_const_drop_candidates(obligation, &mut candidates); . } else { 5,078 ( 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`. 292 ( 0.00%) let clone_conditions = self.copy_clone_conditions(obligation); 657 ( 0.00%) self.assemble_builtin_bound_candidates(clone_conditions, &mut candidates); . } . 1,644 ( 0.00%) self.assemble_generator_candidates(obligation, &mut candidates); 1,644 ( 0.00%) self.assemble_closure_candidates(obligation, &mut candidates); 1,644 ( 0.00%) self.assemble_fn_pointer_candidates(obligation, &mut candidates); 4,932 ( 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. 2,241 ( 0.00%) if candidates.vec.is_empty() { . self.assemble_candidates_from_auto_impls(obligation, &mut candidates); . } . } . debug!("candidate list size: {}", candidates.vec.len()); 29,133 ( 0.01%) 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. 19,007 ( 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,162 ( 0.00%) let result = self . .infcx 581 ( 0.00%) .probe(|_| self.match_projection_obligation_against_definition_bounds(obligation)); . 1,162 ( 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); . 8,964 ( 0.00%) let all_bounds = stack . .obligation . .param_env . .caller_bounds() . .iter() 83,544 ( 0.01%) .filter_map(|o| o.to_opt_poly_trait_pred()); . . // Micro-optimization: filter out predicates relating to different traits. . let matching_bounds = 440,808 ( 0.08%) 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. 2,944 ( 0.00%) let wc = self.evaluate_where_clause(stack, bound.map_bound(|t| t.trait_ref))?; 5,888 ( 0.00%) if wc.may_apply() { . candidates.vec.push(ParamCandidate(bound)); . } . } . . Ok(()) . } . 13,152 ( 0.00%) fn assemble_generator_candidates( . &mut self, . obligation: &TraitObligation<'tcx>, . candidates: &mut SelectionCandidateSet<'tcx>, . ) { 19,728 ( 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; . } . _ => {} . } 11,508 ( 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. 11,508 ( 0.00%) fn assemble_closure_candidates( . &mut self, . obligation: &TraitObligation<'tcx>, . candidates: &mut SelectionCandidateSet<'tcx>, . ) { 18,084 ( 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 31 ( 0.00%) match *obligation.self_ty().skip_binder().kind() { 2 ( 0.00%) ty::Closure(_, closure_substs) => { . debug!(?kind, ?obligation, "assemble_unboxed_candidates"); 8 ( 0.00%) match self.infcx.closure_kind(closure_substs) { . Some(closure_kind) => { . debug!(?closure_kind, "assemble_unboxed_candidates"); 10 ( 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; . } . _ => {} . } 9,864 ( 0.00%) } . . /// Implements one of the `Fn()` family for a fn pointer. 14,796 ( 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. 16,440 ( 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. 10 ( 0.00%) let self_ty = obligation.self_ty().skip_binder(); 31 ( 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). 2 ( 0.00%) ty::FnDef(def_id, _) => { 3 ( 0.00%) if let ty::FnSig { . unsafety: hir::Unsafety::Normal, . abi: Abi::Rust, . c_variadic: false, . .. 2 ( 0.00%) } = self_ty.fn_sig(self.tcx()).skip_binder() . { 2 ( 0.00%) if self.tcx().codegen_fn_attrs(def_id).target_features.is_empty() { . candidates . .vec 4 ( 0.00%) .push(FnPointerCandidate { is_const: self.tcx().is_const_fn(def_id) }); . } . } . } . _ => {} . } 13,152 ( 0.00%) } . . /// Searches for impls that might apply to `obligation`. 18,010 ( 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. 3,602 ( 0.00%) if obligation.predicate.references_error() { . return; . } . 5,403 ( 0.00%) self.tcx().for_each_relevant_impl( 14,408 ( 0.00%) obligation.predicate.def_id(), . obligation.predicate.skip_binder().trait_ref.self_ty(), 9,005 ( 0.00%) |impl_def_id| { 8,744 ( 0.00%) self.infcx.probe(|_| { 8,610 ( 0.00%) if let Ok(_substs) = self.match_impl(impl_def_id, obligation) { 1,026 ( 0.00%) candidates.vec.push(ImplCandidate(impl_def_id)); . } . }); . }, . ); 14,408 ( 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. 326 ( 0.00%) let self_ty = obligation.self_ty().skip_binder(); . debug!(?self_ty, "assemble_candidates_from_auto_impls"); . 1,956 ( 0.00%) let def_id = obligation.predicate.def_id(); . 1,304 ( 0.00%) if self.tcx().trait_is_auto(def_id) { 27 ( 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", . ); . 13,152 ( 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. 1,644 ( 0.00%) let self_ty = self.tcx().erase_late_bound_regions(obligation.self_ty()); 8,220 ( 0.00%) let poly_trait_ref = match self_ty.kind() { . ty::Dynamic(ref data, ..) => { . 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; -- line 646 ---------------------------------------- -- line 739 ---------------------------------------- . }; . . let def_id = data.principal_def_id()?; . . return Some((normalized_ty, def_id)); . } . . /// Searches for unsizing that might apply to `obligation`. 480 ( 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. 240 ( 0.00%) let source = match obligation.self_ty().no_bound_vars() { 48 ( 0.00%) Some(t) => t, . None => { . // Don't add any candidates if there are bound regions. . return; . } . }; 144 ( 0.00%) let target = obligation.predicate.skip_binder().trait_ref.substs.type_at(1); . . debug!(?source, ?target, "assemble_candidates_for_unsizing"); . 666 ( 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` . // -- line 785 ---------------------------------------- -- 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"); 12 ( 0.00%) candidates.ambiguous = true; . } . . // `[T; n]` -> `[T]` . (&ty::Array(..), &ty::Slice(_)) => { . candidates.vec.push(BuiltinUnsizeCandidate); . } . . // `Struct` -> `Struct` 30 ( 0.00%) (&ty::Adt(def_id_a, _), &ty::Adt(def_id_b, _)) if def_id_a.is_struct() => { 50 ( 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); . } . } . . _ => {} . }; 384 ( 0.00%) } . 31,374 ( 0.01%) #[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. 4,482 ( 0.00%) let self_ty = obligation.self_ty().skip_binder(); . debug!(?self_ty); . 17,928 ( 0.00%) let def_id = obligation.predicate.def_id(); . 8,964 ( 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`. 4,912 ( 0.00%) #[tracing::instrument(level = "debug", skip(self, candidates))] . fn assemble_builtin_bound_candidates( . &mut self, . conditions: BuiltinImplConditions<'tcx>, . candidates: &mut SelectionCandidateSet<'tcx>, . ) { 2,534 ( 0.00%) match conditions { . BuiltinImplConditions::Where(nested) => { . candidates . .vec . .push(BuiltinCandidate { has_nested: !nested.skip_binder().is_empty() }); . } . BuiltinImplConditions::None => {} . BuiltinImplConditions::Ambiguous => { . candidates.ambiguous = true; . } . } . } . 64 ( 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)); . return; . } . 4 ( 0.00%) let self_ty = self.infcx().shallow_resolve(obligation.self_ty()); 10 ( 0.00%) match self_ty.skip_binder().kind() { . ty::Opaque(..) . | ty::Dynamic(..) . | ty::Error(_) . | ty::Bound(..) . | ty::Param(_) . | ty::Placeholder(_) . | ty::Projection(_) => { . // We don't know if these are `~const Drop`, at least -- line 936 ---------------------------------------- -- line 958 ---------------------------------------- . | ty::Tuple(_) . | ty::GeneratorWitness(_) => { . // These are built-in, and cannot have a custom `impl const Drop`. . candidates.vec.push(ConstDropCandidate(None)); . } . . ty::Adt(..) => { . // Find a custom `impl Drop` impl, if it exists 3 ( 0.00%) let relevant_impl = self.tcx().find_map_relevant_impl( 6 ( 0.00%) obligation.predicate.def_id(), 3 ( 0.00%) obligation.predicate.skip_binder().trait_ref.self_ty(), . Some, . ); . 2 ( 0.00%) if let Some(impl_def_id) = relevant_impl { . // Check that `impl Drop` is actually const, if there is a custom impl . if self.tcx().impl_constness(impl_def_id) == hir::Constness::Const { . candidates.vec.push(ConstDropCandidate(Some(impl_def_id))); . } . } else { . // Otherwise check the ADT like a built-in type (structurally) . candidates.vec.push(ConstDropCandidate(None)); . } . } . . ty::Infer(_) => { . candidates.ambiguous = true; . } . } 64 ( 0.00%) } . } 198,685 ( 0.03%) -------------------------------------------------------------------------------- -- 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 { 826,602 ( 0.14%) Vec { buf: RawVec::NEW, len: 0 } 28 ( 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 { 290,254 ( 0.05%) 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 { 12,799 ( 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 { 46,666 ( 0.01%) self.buf.capacity() . } . . /// Reserves capacity for at least `additional` more elements to be inserted . /// in the given `Vec`. The collection may reserve more space to avoid . /// frequent reallocations. After calling `reserve`, capacity will be . /// greater than or equal to `self.len() + additional`. Does nothing if . /// capacity is already sufficient. . /// -- line 794 ---------------------------------------- -- line 801 ---------------------------------------- . /// ``` . /// let mut vec = vec![1]; . /// vec.reserve(10); . /// assert!(vec.capacity() >= 11); . /// ``` . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn reserve(&mut self, additional: usize) { 66,960 ( 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) { 4,758 ( 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. 3,640 ( 0.00%) if self.capacity() > self.len { 1,220 ( 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(); 1,272 ( 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")] 66,087 ( 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. 56,275 ( 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); 51,569 ( 0.01%) self.len = len; 1,476 ( 0.00%) ptr::drop_in_place(s); . } 79,304 ( 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. 559,631 ( 0.10%) let ptr = self.buf.ptr(); . unsafe { . assume(!ptr.is_null()); . } . ptr . } . . /// Returns an unsafe mutable pointer to the vector's buffer. . /// -- line 1142 ---------------------------------------- -- line 1162 ---------------------------------------- . /// } . /// assert_eq!(&*x, &[0, 1, 2, 3]); . /// ``` . #[stable(feature = "vec_as_ptr", since = "1.37.0")] . #[inline] . pub fn as_mut_ptr(&mut self) -> *mut T { . // We shadow the slice method of the same name to avoid going through . // `deref_mut`, which creates an intermediate reference. 899,182 ( 0.16%) 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()); . 119,586 ( 0.02%) self.len = new_len; 9,529 ( 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(); 37 ( 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")] 1,393 ( 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); . } . 224 ( 0.00%) let len = self.len(); 450 ( 0.00%) if index > len { . assert_failed(index, len); . } . . // space for the new element 818 ( 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.) 1,152 ( 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); . } 818 ( 0.00%) self.set_len(len + 1); . } 1,194 ( 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); . } . 171 ( 0.00%) let len = self.len(); 573 ( 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. 1,776 ( 0.00%) ret = ptr::read(ptr); . . // Shift everything down to fill in that spot. 380 ( 0.00%) ptr::copy(ptr.offset(1), ptr, len - index - 1); . } 174 ( 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")] 31,418 ( 0.01%) pub fn retain(&mut self, mut f: F) . where . F: FnMut(&T) -> bool, . { 2,848 ( 0.00%) self.retain_mut(|elem| f(elem)); 29,872 ( 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, . { 4,068 ( 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) { 3,462 ( 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), 1,772 ( 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, . { 45,799 ( 0.01%) while g.processed_len != original_len { . // SAFETY: Unchecked element must be valid. . let cur = unsafe { &mut *g.v.as_mut_ptr().add(g.processed_len) }; 14,714 ( 0.00%) if !f(cur) { . // Advance early to avoid double drop if `drop_in_place` panicked. 126 ( 0.00%) g.processed_len += 1; 26 ( 0.00%) g.deleted_cnt += 1; . // SAFETY: We never touch this element again after dropped. 28 ( 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 { 492 ( 0.00%) let hole_slot = g.v.as_mut_ptr().add(g.processed_len - g.deleted_cnt); . ptr::copy_nonoverlapping(cur, hole_slot, 1); . } . } 328 ( 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")] 203 ( 0.00%) pub fn dedup_by(&mut self, mut same_bucket: F) . where . F: FnMut(&mut T, &mut T) -> bool, . { 29 ( 0.00%) let len = self.len(); 1,002 ( 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 { 102 ( 0.00%) while gap.read < len { . let read_ptr = ptr.add(gap.read); . let prev_ptr = ptr.add(gap.write.wrapping_sub(1)); . 136 ( 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 */ 34 ( 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); . } 232 ( 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")] 140 ( 0.00%) pub fn push(&mut self, value: T) { . // This will panic or abort if we would allocate > isize::MAX bytes . // or if the length increment would overflow for zero-sized types. 1,915,422 ( 0.33%) if self.len == self.buf.capacity() { 111,981 ( 0.02%) self.buf.reserve_for_push(self.len); . } . unsafe { 51,310 ( 0.01%) let end = self.as_mut_ptr().add(self.len); . ptr::write(end, value); 2,473,666 ( 0.43%) self.len += 1; . } 112 ( 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 { 193,024 ( 0.03%) if self.len == 0 { 18 ( 0.00%) None . } else { . unsafe { 163,541 ( 0.03%) self.len -= 1; 14,733 ( 0.00%) Some(ptr::read(self.as_ptr().add(self.len()))) . } . } . } . . /// Moves all the elements of `other` into `Self`, leaving `other` empty. . /// . /// # Panics . /// -- line 1769 ---------------------------------------- -- line 1776 ---------------------------------------- . /// let mut vec2 = vec![4, 5, 6]; . /// vec.append(&mut vec2); . /// assert_eq!(vec, [1, 2, 3, 4, 5, 6]); . /// assert_eq!(vec2, []); . /// ``` . #[cfg(not(no_global_oom_handling))] . #[inline] . #[stable(feature = "append", since = "1.4.0")] 623 ( 0.00%) pub fn append(&mut self, other: &mut Self) { . unsafe { . self.append_elements(other.as_slice() as _); . other.set_len(0); . } 534 ( 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); 5,499 ( 0.00%) let len = self.len(); . unsafe { ptr::copy_nonoverlapping(other as *const T, self.as_mut_ptr().add(len), count) }; 87,960 ( 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. . // 3,903 ( 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). 22 ( 0.00%) let range_slice = slice::from_raw_parts_mut(self.as_mut_ptr().add(start), end - start); 223 ( 0.00%) Drain { . tail_start: end, 22 ( 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) { 117,458 ( 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 { 89,025 ( 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); . } . 678 ( 0.00%) if at > self.len() { . assert_failed(at, self.len()); . } . 504 ( 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")] 5,521 ( 0.00%) pub fn resize_with(&mut self, new_len: usize, f: F) . where . F: FnMut() -> T, . { 707 ( 0.00%) let len = self.len(); 1,414 ( 0.00%) if new_len > len { 8,266 ( 0.00%) self.extend_with(new_len - len, ExtendFunc(f)); . } else { . self.truncate(new_len); . } 4,814 ( 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, 48 ( 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")] 30 ( 0.00%) pub fn resize(&mut self, new_len: usize, value: T) { 3 ( 0.00%) let len = self.len(); . 9 ( 0.00%) if new_len > len { 2,178 ( 0.00%) self.extend_with(new_len - len, ExtendElement(value)) . } else { . self.truncate(new_len); . } 3 ( 0.00%) } . . /// Clones and appends all elements in a slice to the `Vec`. . /// . /// Iterates over the slice `other`, clones each element, and then appends . /// it to this `Vec`. The `other` slice is traversed in-order. . /// . /// Note that this function is same as [`extend`] except that it is . /// specialized to work with slices instead. If and when Rust gets -- line 2213 ---------------------------------------- -- line 2291 ---------------------------------------- . fn last(mut self) -> T { . (self.0)() . } . } . . impl Vec { . #[cfg(not(no_global_oom_handling))] . /// Extend the vector by `n` values, using the given generator. 19,661 ( 0.00%) fn extend_with>(&mut self, n: usize, mut value: E) { . self.reserve(n); . . unsafe { 1,851 ( 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); . } . 69,438 ( 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 . } 15,451 ( 0.00%) } . } . . 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) { 30 ( 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")] 8,927 ( 0.00%) pub fn from_elem(elem: T, n: usize) -> Vec { 43,156 ( 0.01%) ::from_elem(elem, n, Global) 11,437 ( 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] { 855,937 ( 0.15%) unsafe { slice::from_raw_parts(self.as_ptr(), self.len) } 19 ( 0.00%) } . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl ops::DerefMut for Vec { . fn deref_mut(&mut self) -> &mut [T] { 169,065 ( 0.03%) unsafe { slice::from_raw_parts_mut(self.as_mut_ptr(), self.len) } . } . } . . #[cfg(not(no_global_oom_handling))] . trait SpecCloneFrom { . fn clone_from(this: &mut Self, other: &Self); . } . -- line 2447 ---------------------------------------- -- line 2468 ---------------------------------------- . this.extend_from_slice(other); . } . } . . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "rust1", since = "1.0.0")] . impl Clone for Vec { . #[cfg(not(test))] 97,856 ( 0.02%) fn clone(&self) -> Self { . let alloc = self.allocator().clone(); 2 ( 0.00%) <[T]>::to_vec_in(&**self, alloc) 132,081 ( 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 { 18,639 ( 0.00%) 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`" . )] -- line 2534 ---------------------------------------- -- line 2539 ---------------------------------------- . } . } . . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "rust1", since = "1.0.0")] . impl FromIterator for Vec { . #[inline] . fn from_iter>(iter: I) -> Vec { 494,484 ( 0.09%) >::from_iter(iter.into_iter()) . } . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl IntoIterator for Vec { . type Item = T; . type IntoIter = IntoIter; . -- line 2555 ---------------------------------------- -- line 2564 ---------------------------------------- . /// for s in v.into_iter() { . /// // s has type String, not &String . /// println!("{}", s); . /// } . /// ``` . #[inline] . fn into_iter(self) -> IntoIter { . unsafe { 209,035 ( 0.04%) let mut me = ManuallyDrop::new(self); . let alloc = ptr::read(me.allocator()); . let begin = me.as_mut_ptr(); . let end = if mem::size_of::() == 0 { . arith_offset(begin as *const i8, me.len() as isize) as *const T . } else { . begin.add(me.len()) as *const T . }; . let cap = me.buf.capacity(); 107,137 ( 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> { 36 ( 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> { 786 ( 0.00%) self.iter_mut() . } . } . . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "rust1", since = "1.0.0")] . impl Extend for Vec { . #[inline] 4,856 ( 0.00%) fn extend>(&mut self, iter: I) { 305,703 ( 0.05%) >::spec_extend(self, iter.into_iter()) 4,856 ( 0.00%) } . . #[inline] . fn extend_one(&mut self, item: T) { . self.push(item); . } . . #[inline] . fn extend_reserve(&mut self, additional: usize) { -- line 2627 ---------------------------------------- -- line 2636 ---------------------------------------- . fn extend_desugared>(&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); . // } 118,428 ( 0.02%) while let Some(element) = iterator.next() { 7,393 ( 0.00%) let len = self.len(); 84,737 ( 0.01%) if len == self.capacity() { 1,082 ( 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 84,389 ( 0.01%) self.set_len(len + 1); . } . } 564 ( 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, . { 176 ( 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, . { 1,087 ( 0.00%) let old_len = self.len(); . . // Guard against us getting leaked (leak amplification) . unsafe { . self.set_len(0); . } . 3,928 ( 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 { 202,597 ( 0.04%) 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 84,462 ( 0.01%) ptr::drop_in_place(ptr::slice_from_raw_parts_mut(self.as_mut_ptr(), self.len)) . } . // RawVec handles deallocation 238,658 ( 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 ---------------------------------------- 315,787 ( 0.05%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/sty.rs -------------------------------------------------------------------------------- Ir -- line 32 ---------------------------------------- . 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 { 3,351 ( 0.00%) pub scope: DefId, 7,986 ( 0.00%) pub bound_region: BoundRegionKind, . } . 172,152 ( 0.03%) #[derive(Clone, PartialEq, PartialOrd, Eq, Ord, Hash, TyEncodable, TyDecodable, Copy)] . #[derive(HashStable)] . pub enum BoundRegionKind { . /// An anonymous region parameter for a given fn (&T) 6,576 ( 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. 19,455 ( 0.00%) BrNamed(DefId, Symbol), . . /// Anonymous region for the implicit env pointer parameter . /// to a closure . BrEnv, . } . 192 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, Hash, TyEncodable, TyDecodable, Debug, PartialOrd, Ord)] . #[derive(HashStable)] . pub struct BoundRegion { 34,479 ( 0.01%) pub var: BoundVar, 33,107 ( 0.01%) 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. 4,111,118 ( 0.71%) #[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. 156,940 ( 0.03%) Adt(&'tcx AdtDef, SubstsRef<'tcx>), . . /// An unsized FFI type that is opaque to Rust. Written as `extern type T`. . Foreign(DefId), . . /// The pointee of a string slice. Written as `str`. . Str, . . /// An array with the given length. Written as `[T; n]`. 2,847 ( 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`. 245,442 ( 0.04%) Ref(Region<'tcx>, Ty<'tcx>, hir::Mutability), . . /// The anonymous type of a function declaration/definition. Each . /// function has a unique type, which is output (for a function . /// named `foo` returning an `i32`) as `fn() -> i32 {foo}`. . /// . /// For example the type of `bar` here: . /// . /// ```rust -- line 134 ---------------------------------------- -- line 143 ---------------------------------------- . /// . /// ```rust . /// fn foo() -> i32 { 1 } . /// let bar: fn() -> i32 = foo; . /// ``` . FnPtr(PolyFnSig<'tcx>), . . /// A trait object. Written as `dyn for<'b> Trait<'b, Assoc = u32> + Send + 'a`. 603 ( 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. 537 ( 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. 1 ( 0.00%) pub fn new( . tcx: TyCtxt<'tcx>, . parts: ClosureSubstsParts<'tcx, Ty<'tcx>>, . ) -> ClosureSubsts<'tcx> { . ClosureSubsts { . substs: tcx.mk_substs( 2 ( 0.00%) parts.parent_substs.iter().copied().chain( 4 ( 0.00%) [parts.closure_kind_ty, parts.closure_sig_as_fn_ptr_ty, parts.tupled_upvars_ty] . .iter() . .map(|&ty| ty.into()), . ), . ), . } 2 ( 0.00%) } . . /// Divides the closure substs into their respective components. . /// The ordering assumed here must match that used by `ClosureSubsts::new` above. 10 ( 0.00%) fn split(self) -> ClosureSubstsParts<'tcx, GenericArg<'tcx>> { . match self.substs[..] { 76 ( 0.00%) [ 18 ( 0.00%) ref parent_substs @ .., 22 ( 0.00%) closure_kind_ty, 12 ( 0.00%) closure_sig_as_fn_ptr_ty, 14 ( 0.00%) tupled_upvars_ty, 40 ( 0.00%) ] => ClosureSubstsParts { . parent_substs, . closure_kind_ty, . closure_sig_as_fn_ptr_ty, . tupled_upvars_ty, . }, . _ => bug!("closure substs missing synthetics"), . } 30 ( 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 384 ---------------------------------------- . 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] . pub fn upvar_tys(self) -> impl Iterator> + 'tcx { 3 ( 0.00%) match self.tupled_upvars_ty().kind() { . TyKind::Error(_) => None, 2 ( 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() . } . . /// Returns the tuple type representing the upvars for this closure. . #[inline] . pub fn tupled_upvars_ty(self) -> Ty<'tcx> { 45 ( 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)`. 6 ( 0.00%) pub fn kind_ty(self) -> Ty<'tcx> { . self.split().closure_kind_ty.expect_ty() 12 ( 0.00%) } . . /// Returns the `fn` pointer type representing the closure signature for this . /// closure. . // FIXME(eddyb) this should be unnecessary, as the shallowly resolved . // type is known at the time of the creation of `ClosureSubsts`, . // see `rustc_typeck::check::closure`. . pub fn sig_as_fn_ptr_ty(self) -> Ty<'tcx> { . self.split().closure_sig_as_fn_ptr_ty.expect_ty() -- line 421 ---------------------------------------- -- line 426 ---------------------------------------- . /// there are no type variables. . /// . /// If you have an inference context, use `infcx.closure_kind()`. . pub fn kind(self) -> ty::ClosureKind { . self.kind_ty().to_opt_closure_kind().unwrap() . } . . /// Extracts the signature from the closure. 8 ( 0.00%) pub fn sig(self) -> ty::PolyFnSig<'tcx> { . let ty = self.sig_as_fn_ptr_ty(); 16 ( 0.00%) match ty.kind() { 32 ( 0.00%) ty::FnPtr(sig) => *sig, . _ => bug!("closure_sig_as_fn_ptr_ty is not a fn-ptr: {:?}", ty.kind()), . } 24 ( 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 { 2 ( 0.00%) let tupled_tys = match self { 3 ( 0.00%) UpvarSubsts::Closure(substs) => substs.as_closure().tupled_upvars_ty(), . UpvarSubsts::Generator(substs) => substs.as_generator().tupled_upvars_ty(), . }; . 5 ( 0.00%) match tupled_tys.kind() { . TyKind::Error(_) => None, 4 ( 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> { 4 ( 0.00%) match self { 4 ( 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() . } . } . 638 ( 0.00%) #[derive(Debug, Copy, Clone, PartialEq, PartialOrd, Ord, Eq, Hash, TyEncodable, TyDecodable)] 494 ( 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`. 6 ( 0.00%) AutoTrait(DefId), . } . . impl<'tcx> ExistentialPredicate<'tcx> { . /// Compares via an ordering that will not change if modules are reordered or other changes are . /// made to the tree. In particular, this ordering is preserved across incremental compilations. 30 ( 0.00%) pub fn stable_cmp(&self, tcx: TyCtxt<'tcx>, other: &Self) -> Ordering { . use self::ExistentialPredicate::*; 32 ( 0.00%) match (*self, *other) { . (Trait(_), Trait(_)) => Ordering::Equal, . (Projection(ref a), Projection(ref b)) => { . tcx.def_path_hash(a.item_def_id).cmp(&tcx.def_path_hash(b.item_def_id)) . } . (AutoTrait(ref a), AutoTrait(ref b)) => { . tcx.def_path_hash(*a).cmp(&tcx.def_path_hash(*b)) . } . (Trait(_), _) => Ordering::Less, . (Projection(_), Trait(_)) => Ordering::Greater, . (Projection(_), _) => Ordering::Less, . (AutoTrait(_), _) => Ordering::Greater, . } 36 ( 0.00%) } . } . . impl<'tcx> Binder<'tcx, ExistentialPredicate<'tcx>> { 72 ( 0.00%) pub fn with_self_ty(&self, tcx: TyCtxt<'tcx>, self_ty: Ty<'tcx>) -> ty::Predicate<'tcx> { . use crate::ty::ToPredicate; 40 ( 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) => { . 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) . } . } 64 ( 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 840 ---------------------------------------- . /// . /// It is also possible to have a "trivial" trait object that . /// consists only of auto traits, with no principal - for example, . /// `dyn Send + Sync`. In that case, the set of auto-trait bounds . /// is `{Send, Sync}`, while there is no principal. These trait objects . /// have a "trivial" vtable consisting of just the size, alignment, . /// and destructor. . pub fn principal(&self) -> Option>> { 30 ( 0.00%) self[0] 30 ( 0.00%) .map_bound(|this| match this { . ExistentialPredicate::Trait(tr) => Some(tr), . _ => None, . }) . .transpose() . } . 8 ( 0.00%) pub fn principal_def_id(&self) -> Option { . self.principal().map(|trait_ref| trait_ref.skip_binder().def_id) 16 ( 0.00%) } . . #[inline] . pub fn projection_bounds<'a>( . &'a self, . ) -> impl Iterator>> + 'a { . self.iter().filter_map(|predicate| { . predicate . .map_bound(|pred| match pred { -- line 866 ---------------------------------------- -- 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. 13,488 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)] 1,628,968 ( 0.28%) #[derive(HashStable, TypeFoldable)] . pub struct TraitRef<'tcx> { 266 ( 0.00%) pub def_id: DefId, 839,723 ( 0.15%) pub substs: SubstsRef<'tcx>, . } . . impl<'tcx> TraitRef<'tcx> { 789 ( 0.00%) pub fn new(def_id: DefId, substs: SubstsRef<'tcx>) -> TraitRef<'tcx> { . TraitRef { def_id, substs } 3,156 ( 0.00%) } . . /// Returns a `TraitRef` of the form `P0: Foo` where `Pi` . /// are the parameters defined on trait. 891 ( 0.00%) pub fn identity(tcx: TyCtxt<'tcx>, def_id: DefId) -> Binder<'tcx, TraitRef<'tcx>> { 396 ( 0.00%) ty::Binder::dummy(TraitRef { . def_id, 594 ( 0.00%) substs: InternalSubsts::identity_for_item(tcx, def_id), . }) 792 ( 0.00%) } . . #[inline] . pub fn self_ty(&self) -> Ty<'tcx> { . self.substs.type_at(0) . } . 768 ( 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); . 96 ( 0.00%) ty::TraitRef { def_id: trait_id, substs: tcx.intern_substs(&substs[..defs.params.len()]) } 1,056 ( 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 { 62,646 ( 0.01%) self.skip_binder().def_id 20,882 ( 0.00%) } . 1,988 ( 0.00%) pub fn to_poly_trait_predicate(&self) -> ty::PolyTraitPredicate<'tcx> { 3,976 ( 0.00%) self.map_bound(|trait_ref| ty::TraitPredicate { . trait_ref, . constness: ty::BoundConstness::NotConst, . polarity: ty::ImplPolarity::Positive, . }) 1,988 ( 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). 32 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)] 246 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub struct ExistentialTraitRef<'tcx> { 36 ( 0.00%) pub def_id: DefId, 284 ( 0.00%) pub substs: SubstsRef<'tcx>, . } . . impl<'tcx> ExistentialTraitRef<'tcx> { 4 ( 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..]), . } 4 ( 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. . 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()); -- line 985 ---------------------------------------- -- line 999 ---------------------------------------- . /// we convert the principal trait-ref into a normal trait-ref, . /// you must give *some* self type. A common choice is `mk_err()` . /// or some placeholder type. . pub fn with_self_ty(&self, tcx: TyCtxt<'tcx>, self_ty: Ty<'tcx>) -> ty::PolyTraitRef<'tcx> { . self.map_bound(|trait_ref| trait_ref.with_self_ty(tcx, self_ty)) . } . } . 30,286 ( 0.01%) #[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. 1,062 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)] 200,346 ( 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. 3,320 ( 0.00%) pub fn dummy(value: T) -> Binder<'tcx, T> { 16,938 ( 0.00%) assert!(!value.has_escaping_bound_vars()); 49,297 ( 0.01%) Binder(value, ty::List::empty()) 3,316 ( 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); . } 40,263 ( 0.01%) 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 { 556,566 ( 0.10%) self.0 . } . . pub fn bound_vars(&self) -> &'tcx List { 9,810 ( 0.00%) self.1 . } . . pub fn as_ref(&self) -> Binder<'tcx, &T> { 7,150 ( 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) . } . 8 ( 0.00%) pub fn map_bound>(self, f: F) -> Binder<'tcx, U> . where . F: FnOnce(T) -> U, . { 7,969 ( 0.00%) let value = f(self.0); . if cfg!(debug_assertions) { . let mut validator = ValidateBoundVars::new(self.1); . value.visit_with(&mut validator); . } 78,922 ( 0.01%) Binder(value, self.1) 8 ( 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); . } 15,668 ( 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); . } 94,225 ( 0.02%) 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>, . { 115,698 ( 0.02%) if self.0.has_escaping_bound_vars() { None } else { Some(self.skip_binder()) } 90 ( 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`. 609 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)] 257,541 ( 0.04%) #[derive(HashStable, TypeFoldable)] . pub struct ProjectionTy<'tcx> { . /// The parameters of the associated item. 127,856 ( 0.02%) 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`. 247,213 ( 0.04%) pub item_def_id: DefId, . } . . impl<'tcx> ProjectionTy<'tcx> { 13,209 ( 0.00%) pub fn trait_def_id(&self, tcx: TyCtxt<'tcx>) -> DefId { 3,774 ( 0.00%) tcx.associated_item(self.item_def_id).container.id() 15,096 ( 0.00%) } . . /// Extracts the underlying trait reference and own substs from this projection. . /// For example, if this is a projection of `::Item<'a>`, . /// then this function would return a `T: Iterator` trait reference and `['a]` as the own substs 6,951 ( 0.00%) pub fn trait_ref_and_own_substs( . &self, . tcx: TyCtxt<'tcx>, . ) -> (ty::TraitRef<'tcx>, &'tcx [ty::GenericArg<'tcx>]) { 2,979 ( 0.00%) let def_id = tcx.associated_item(self.item_def_id).container.id(); . let trait_generics = tcx.generics_of(def_id); 4,965 ( 0.00%) ( . ty::TraitRef { def_id, substs: self.substs.truncate_to(tcx, trait_generics) }, . &self.substs[trait_generics.count()..], . ) 8,937 ( 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. 16,974 ( 0.00%) pub fn trait_ref(&self, tcx: TyCtxt<'tcx>) -> ty::TraitRef<'tcx> { 1,886 ( 0.00%) let def_id = self.trait_def_id(tcx); 1,886 ( 0.00%) ty::TraitRef { def_id, substs: self.substs.truncate_to(tcx, tcx.generics_of(def_id)) } 20,746 ( 0.00%) } . 3,764 ( 0.00%) pub fn self_ty(&self) -> Ty<'tcx> { 11,292 ( 0.00%) self.substs.type_at(0) 7,528 ( 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. 6,709 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)] 3,882 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub struct FnSig<'tcx> { 285 ( 0.00%) pub inputs_and_output: &'tcx List>, 4,008 ( 0.00%) pub c_variadic: bool, 665 ( 0.00%) pub unsafety: hir::Unsafety, 4,649 ( 0.00%) pub abi: abi::Abi, . } . . impl<'tcx> FnSig<'tcx> { 3,195 ( 0.00%) pub fn inputs(&self) -> &'tcx [Ty<'tcx>] { 14,895 ( 0.00%) &self.inputs_and_output[..self.inputs_and_output.len() - 1] 6,390 ( 0.00%) } . 2,092 ( 0.00%) pub fn output(&self) -> Ty<'tcx> { 15,619 ( 0.00%) self.inputs_and_output[self.inputs_and_output.len() - 1] 4,184 ( 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>]> { 625 ( 0.00%) self.map_bound_ref_unchecked(|fn_sig| fn_sig.inputs()) . } . #[inline] . pub fn input(&self, index: usize) -> ty::Binder<'tcx, Ty<'tcx>> { 1,033 ( 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) 104 ( 0.00%) } . #[inline] . pub fn output(&self) -> ty::Binder<'tcx, Ty<'tcx>> { 795 ( 0.00%) self.map_bound_ref(|fn_sig| fn_sig.output()) . } . pub fn c_variadic(&self) -> bool { 208 ( 0.00%) self.skip_binder().c_variadic 104 ( 0.00%) } . pub fn unsafety(&self) -> hir::Unsafety { 464 ( 0.00%) self.skip_binder().unsafety 232 ( 0.00%) } . pub fn abi(&self) -> abi::Abi { 952 ( 0.00%) self.skip_binder().abi 238 ( 0.00%) } . } . . pub type CanonicalPolyFnSig<'tcx> = Canonical<'tcx, Binder<'tcx, FnSig<'tcx>>>; . 32 ( 0.00%) #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)] . #[derive(HashStable)] . pub struct ParamTy { 344 ( 0.00%) pub index: u32, . pub name: Symbol, . } . . impl<'tcx> ParamTy { 196 ( 0.00%) pub fn new(index: u32, name: Symbol) -> ParamTy { . ParamTy { index, name } 98 ( 0.00%) } . . pub fn for_def(def: &ty::GenericParamDef) -> ParamTy { 160 ( 0.00%) ParamTy::new(def.index, def.name) 80 ( 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 { 92 ( 0.00%) pub index: u32, 92 ( 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 790,376 ( 0.14%) #[derive(Clone, PartialEq, Eq, Hash, Copy, TyEncodable, TyDecodable, PartialOrd, Ord)] 28 ( 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. 65,938 ( 0.01%) ReLateBound(ty::DebruijnIndex, BoundRegion), . . /// When checking a function body, the types of all arguments and so forth . /// that refer to bound region parameters are modified to refer to free . /// region parameters. . ReFree(FreeRegion), . . /// Static data that has an "infinite" lifetime. Top in the region lattice. . ReStatic, -- line 1465 ---------------------------------------- -- line 1478 ---------------------------------------- . /// regions visible from `U`, but not less than regions not visible . /// from `U`. . ReEmpty(ty::UniverseIndex), . . /// Erased region, used by trait selection, in MIR and during codegen. . ReErased, . } . 8,612 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, Hash, TyEncodable, TyDecodable, Debug, PartialOrd, Ord)] . pub struct EarlyBoundRegion { 744 ( 0.00%) pub def_id: DefId, 6,586 ( 0.00%) pub index: u32, 2,749 ( 0.00%) pub name: Symbol, . } . . /// A **`const`** **v**ariable **ID**. . #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)] . pub struct ConstVid<'tcx> { 171 ( 0.00%) pub index: u32, . pub phantom: PhantomData<&'tcx ()>, . } . . rustc_index::newtype_index! { . /// A **region** (lifetime) **v**ariable **ID**. . pub struct RegionVid { . DEBUG_FORMAT = custom, . } -- line 1504 ---------------------------------------- -- line 1513 ---------------------------------------- . rustc_index::newtype_index! { . pub struct BoundVar { .. } . } . . #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)] . #[derive(HashStable)] . pub struct BoundTy { . pub var: BoundVar, 537 ( 0.00%) pub kind: BoundTyKind, . } . 9,165 ( 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 { -- line 1532 ---------------------------------------- -- line 1616 ---------------------------------------- . RegionKind::RePlaceholder(placeholder) => placeholder.name.is_named(), . RegionKind::ReEmpty(_) => false, . RegionKind::ReErased => false, . } . } . . #[inline] . pub fn is_late_bound(&self) -> bool { 618 ( 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 { 15,052 ( 0.00%) match *self { . ty::ReLateBound(debruijn, _) => debruijn >= index, . _ => false, . } . } . . pub fn type_flags(&self) -> TypeFlags { . let mut flags = TypeFlags::empty(); . 21,085 ( 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 1,288 ( 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 { 342 ( 0.00%) match self.kind() { 57 ( 0.00%) Tuple(ref tys) => tys.is_empty(), . _ => false, . } . } . . #[inline] . pub fn is_never(&self) -> bool { 3,312 ( 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 { 6,440 ( 0.00%) matches!(self.kind(), Infer(TyVar(_))) . } . . #[inline] . pub fn ty_vid(&self) -> Option { 12,770 ( 0.00%) match self.kind() { 663 ( 0.00%) &Infer(TyVar(vid)) => Some(vid), . _ => None, . } . } . . #[inline] . pub fn is_ty_infer(&self) -> bool { 3 ( 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 { 191 ( 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 { 106 ( 0.00%) matches!(self.kind(), Array(..)) . } . . #[inline] . pub fn is_simd(&self) -> bool { . match self.kind() { . Adt(def, _) => def.repr.simd(), . _ => false, . } . } . 28 ( 0.00%) pub fn sequence_element_type(&self, tcx: TyCtxt<'tcx>) -> Ty<'tcx> { 56 ( 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), . } 28 ( 0.00%) } . . pub fn simd_size_and_type(&self, tcx: TyCtxt<'tcx>) -> (u64, Ty<'tcx>) { . match self.kind() { . Adt(def, substs) => { . assert!(def.repr.simd(), "`simd_size_and_type` called on non-SIMD type"); . let variant = def.non_enum_variant(); . let f0_ty = variant.fields[0].ty(tcx, substs); . -- line 1824 ---------------------------------------- -- line 1861 ---------------------------------------- . match self.kind() { . Ref(_, _, mutability) => Some(*mutability), . _ => None, . } . } . . #[inline] . pub fn is_unsafe_ptr(&self) -> bool { 211 ( 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 { 4,766 ( 0.00%) match self.kind() { 770 ( 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 { 45 ( 0.00%) matches!( 102 ( 0.00%) self.kind(), . Bool | Char . | Int(_) . | Float(_) . | Uint(_) . | FnDef(..) . | FnPtr(_) . | RawPtr(_) . | Infer(IntVar(_) | FloatVar(_)) . ) . } . . /// Returns `true` if this type is a floating point type. . #[inline] . pub fn is_floating_point(&self) -> bool { 2 ( 0.00%) matches!(self.kind(), Float(_) | Infer(FloatVar(_))) . } . . #[inline] . pub fn is_trait(&self) -> bool { . matches!(self.kind(), Dynamic(..)) . } . . #[inline] . pub fn is_enum(&self) -> bool { . matches!(self.kind(), Adt(adt_def, _) if adt_def.is_enum()) . } . . #[inline] . pub fn is_union(&self) -> bool { 339 ( 0.00%) matches!(self.kind(), Adt(adt_def, _) if adt_def.is_union()) . } . . #[inline] . pub fn is_closure(&self) -> bool { 104 ( 0.00%) matches!(self.kind(), Closure(..)) . } . . #[inline] . pub fn is_generator(&self) -> bool { 159 ( 0.00%) matches!(self.kind(), Generator(..)) . } . . #[inline] . pub fn is_integral(&self) -> bool { 301 ( 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 { 1,018 ( 0.00%) matches!(self.kind(), Infer(FreshTy(_) | FreshIntTy(_) | FreshFloatTy(_))) . } . . #[inline] . pub fn is_char(&self) -> bool { . matches!(self.kind(), Char) . } . . #[inline] -- line 1963 ---------------------------------------- -- line 1967 ---------------------------------------- . . #[inline] . pub fn is_signed(&self) -> bool { . matches!(self.kind(), Int(_)) . } . . #[inline] . pub fn is_ptr_sized_integral(&self) -> bool { 6 ( 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. 810 ( 0.00%) pub fn builtin_deref(&self, explicit: bool) -> Option> { 4,482 ( 0.00%) match self.kind() { 84 ( 0.00%) Adt(def, _) if def.is_box() => { . Some(TypeAndMut { ty: self.boxed_ty(), mutbl: hir::Mutability::Not }) . } 2,708 ( 0.00%) Ref(_, ty, mutbl) => Some(TypeAndMut { ty, mutbl: *mutbl }), . RawPtr(mt) if explicit => Some(*mt), . _ => None, . } 1,620 ( 0.00%) } . . /// Returns the type of `ty[i]`. . pub fn builtin_index(&self) -> Option> { . match self.kind() { . Array(ty, _) | Slice(ty) => Some(ty), . _ => None, . } . } . 4,896 ( 0.00%) pub fn fn_sig(&self, tcx: TyCtxt<'tcx>) -> PolyFnSig<'tcx> { 2,448 ( 0.00%) match self.kind() { 1,836 ( 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), . } 5,508 ( 0.00%) } . . #[inline] . pub fn is_fn(&self) -> bool { 3 ( 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> { 601 ( 0.00%) match self.kind() { . Adt(adt, _) => Some(adt), . _ => None, . } . } . . /// Iterates over tuple fields. . /// Panics when called on anything but a tuple. 2 ( 0.00%) pub fn tuple_fields(&self) -> impl DoubleEndedIterator> { 32 ( 0.00%) match self.kind() { 16 ( 0.00%) Tuple(substs) => substs.iter().map(|field| field.expect_ty()), . _ => bug!("tuple_fields called on non-tuple"), . } 4 ( 0.00%) } . . /// Get the `i`-th element of a tuple. . /// Panics when called on anything but a tuple. . pub fn tuple_element_ty(&self, i: usize) -> Option> { . match self.kind() { . Tuple(substs) => substs.iter().nth(i).map(|field| field.expect_ty()), . _ => bug!("tuple_fields called on non-tuple"), . } -- line 2059 ---------------------------------------- -- line 2095 ---------------------------------------- . TyKind::Generator(def_id, substs, _) => { . Some(substs.as_generator().discriminant_for_variant(*def_id, tcx, variant_index)) . } . _ => None, . } . } . . /// Returns the type of the discriminant of this type. 80 ( 0.00%) pub fn discriminant_ty(&'tcx self, tcx: TyCtxt<'tcx>) -> Ty<'tcx> { 40 ( 0.00%) match self.kind() { 64 ( 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) . } . } 64 ( 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. 16 ( 0.00%) pub fn to_opt_closure_kind(&self) -> Option { 32 ( 0.00%) match self.kind() { 32 ( 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), . } 16 ( 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`. 10,575 ( 0.00%) pub fn is_trivially_sized(&self, tcx: TyCtxt<'tcx>) -> bool { 7,050 ( 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, . 37 ( 0.00%) ty::Tuple(tys) => tys.iter().all(|ty| ty.expect_ty().is_trivially_sized(tcx)), . 861 ( 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) . } . } 10,575 ( 0.00%) } . } . . /// Extra information about why we ended up with a particular variance. . /// This is only used to add more information to error messages, and . /// has no effect on soundness. While choosing the 'wrong' `VarianceDiagInfo` . /// may lead to confusing notes in error messages, it will never cause . /// a miscompilation or unsoundness. . /// -- line 2280 ---------------------------------------- -- line 2295 ---------------------------------------- . /// (e.g. `0` for `*mut T`, `1` for `MyStruct<'CovariantParam, 'InvariantParam>`) . param_index: u32, . }, . } . . impl<'tcx> VarianceDiagInfo<'tcx> { . /// Mirrors `Variance::xform` - used to 'combine' the existing . /// and new `VarianceDiagInfo`s when our variance changes. 3,512 ( 0.00%) pub fn xform(self, other: VarianceDiagInfo<'tcx>) -> VarianceDiagInfo<'tcx> { . // For now, just use the first `VarianceDiagInfo::Invariant` that we see 5,268 ( 0.00%) match self { . VarianceDiagInfo::None => other, . VarianceDiagInfo::Invariant { .. } => self, . } 1,756 ( 0.00%) } . } 4,535,753 ( 0.78%) -------------------------------------------------------------------------------- -- 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 { 63,396 ( 0.01%) &self.shards[i].0 . } . . pub fn lock_shards(&self) -> Vec> { . (0..SHARDS).map(|i| self.shards[i].0.lock()).collect() . } . . pub fn try_lock_shards(&self) -> Option>> { . (0..SHARDS).map(|i| self.shards[i].0.try_lock()).collect() -- line 63 ---------------------------------------- -- line 79 ---------------------------------------- . K: Borrow, . Q: Hash + Eq, . { . let hash = make_hash(value); . let mut shard = self.get_shard_by_hash(hash).lock(); . let entry = shard.raw_entry_mut().from_key_hashed_nocheck(hash, value); . . match entry { 178,922 ( 0.03%) 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 { 202,891 ( 0.04%) RawEntryMut::Occupied(e) => *e.key(), . RawEntryMut::Vacant(e) => { 65,335 ( 0.01%) let v = make(value); . e.insert_hashed_nocheck(hash, v, ()); . v . } . } 1 ( 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 { 645,679 ( 0.11%) let mut state = FxHasher::default(); 143,628 ( 0.02%) val.hash(&mut state); . state.finish() . } . . /// Get a shard with a pre-computed hash value. If `get_shard_by_value` is . /// ever used in combination with `get_shard_by_hash` on a single `Sharded` . /// instance, then `hash` must be computed with `FxHasher`. Otherwise, . /// `hash` can be computed with any hasher, so long as that hasher is used . /// consistently for each `Sharded` instance. -- line 142 ---------------------------------------- 252,483 ( 0.04%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/iter/adapters/zip.rs -------------------------------------------------------------------------------- Ir -- 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, . { 6,203 ( 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 147 ---------------------------------------- . index: 0, // unused . len: 0, // unused . a_len: 0, // unused . } . } . . #[inline] . default fn next(&mut self) -> Option<(A::Item, B::Item)> { 19,566 ( 0.00%) let x = self.a.next()?; 16,124 ( 0.00%) let y = self.b.next()?; 864 ( 0.00%) Some((x, y)) 1,093 ( 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) { 20 ( 0.00%) let (a_lower, a_upper) = self.a.size_hint(); . 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), -- line 219 ---------------------------------------- -- line 236 ---------------------------------------- . where . A: TrustedRandomAccessNoCoerce + Iterator, . B: TrustedRandomAccessNoCoerce + Iterator, . { . zip_impl_general_defaults! {} . . #[inline] . default fn size_hint(&self) -> (usize, Option) { 28 ( 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 { 4 ( 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)> { 1,240,327 ( 0.21%) 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 256,574 ( 0.04%) self.index += 1; . // SAFETY: `i` is smaller than `self.len`, thus smaller than `self.a.len()` and `self.b.len()` . unsafe { . Some((self.a.__iterator_get_unchecked(i), self.b.__iterator_get_unchecked(i))) . } . } 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; -- line 283 ---------------------------------------- -- line 290 ---------------------------------------- . None . } else { . None . } . } . . #[inline] . fn size_hint(&self) -> (usize, Option) { 49,814 ( 0.01%) 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, . { 140 ( 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`. 294 ( 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 ---------------------------------------- 115,793 ( 0.02%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_infer/src/infer/undo_log.rs -------------------------------------------------------------------------------- Ir -- line 28 ---------------------------------------- . PushRegionObligation, . } . . macro_rules! impl_from { . ($($ctor: ident ($ty: ty),)*) => { . $( . impl<'tcx> From<$ty> for UndoLog<'tcx> { . fn from(x: $ty) -> Self { 2,701 ( 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> { 53,610 ( 0.01%) fn reverse(&mut self, undo: UndoLog<'tcx>) { 89,350 ( 0.02%) match undo { 104,460 ( 0.02%) UndoLog::TypeVariables(undo) => self.type_variable_storage.reverse(undo), . UndoLog::ConstUnificationTable(undo) => self.const_unification_storage.reverse(undo), . UndoLog::IntUnificationTable(undo) => self.int_unification_storage.reverse(undo), . UndoLog::FloatUnificationTable(undo) => self.float_unification_storage.reverse(undo), . UndoLog::RegionConstraintCollector(undo) => { 25,746 ( 0.00%) self.region_constraint_storage.as_mut().unwrap().reverse(undo) . } . UndoLog::RegionUnificationTable(undo) => { 5,642 ( 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(); . } . } 71,480 ( 0.01%) } . } . . /// 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 { 8,838 ( 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) { 17,683 ( 0.00%) if self.in_snapshot() { 21,608 ( 0.00%) self.logs.push(undo.into()) . } . } . . fn clear(&mut self) { . self.logs.clear(); . self.num_open_snapshots = 0; . } . -- line 120 ---------------------------------------- -- line 125 ---------------------------------------- . { . if self.in_snapshot() { . self.logs.extend(undos.into_iter().map(UndoLog::from)) . } . } . } . . impl<'tcx> InferCtxtInner<'tcx> { 194,910 ( 0.03%) pub fn rollback_to(&mut self, snapshot: Snapshot<'tcx>) { . debug!("rollback_to({})", snapshot.undo_len); . self.undo_log.assert_open_snapshot(&snapshot); . 118,580 ( 0.02%) while self.undo_log.logs.len() > snapshot.undo_len { . let undo = self.undo_log.logs.pop().unwrap(); 214,440 ( 0.04%) self.reverse(undo); . } . 67,996 ( 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. 9,720 ( 0.00%) assert!(snapshot.undo_len == 0); . self.undo_log.logs.clear(); . } . 102,315 ( 0.02%) self.undo_log.num_open_snapshots -= 1; 227,395 ( 0.04%) } . . pub fn commit(&mut self, snapshot: Snapshot<'tcx>) { . debug!("commit({})", snapshot.undo_len); . 101,976 ( 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. 20,582 ( 0.00%) assert!(snapshot.undo_len == 0); . self.undo_log.logs.clear(); . } . 112,267 ( 0.02%) self.undo_log.num_open_snapshots -= 1; . } . } . . impl<'tcx> InferCtxtUndoLogs<'tcx> { . pub fn start_snapshot(&mut self) -> Snapshot<'tcx> { 265,908 ( 0.05%) 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 { 7,736 ( 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 { 784 ( 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. 97,455 ( 0.02%) assert!(self.logs.len() >= snapshot.undo_len); 97,455 ( 0.02%) 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 ---------------------------------------- 82,716 ( 0.01%) -------------------------------------------------------------------------------- -- 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>), . } . 57 ( 0.00%) #[derive(PartialEq, Eq, Debug)] . enum ProjectionTyCandidate<'tcx> { . /// From a where-clause in the env or object type 172 ( 0.00%) ParamEnv(ty::PolyProjectionPredicate<'tcx>), . . /// From the definition of `Trait` when you have something like <::B as Trait2>::C 261 ( 0.00%) TraitDef(ty::PolyProjectionPredicate<'tcx>), . . /// Bounds specified on an object type . Object(ty::PolyProjectionPredicate<'tcx>), . . /// From an "impl" (or a "pseudo-impl" returned by select) . Select(Selection<'tcx>), . } . -- line 69 ---------------------------------------- -- line 71 ---------------------------------------- . None, . Single(ProjectionTyCandidate<'tcx>), . Ambiguous, . Error(SelectionError<'tcx>), . } . . impl<'tcx> ProjectionTyCandidateSet<'tcx> { . fn mark_ambiguous(&mut self) { 330 ( 0.00%) *self = ProjectionTyCandidateSet::Ambiguous; . } . . fn mark_error(&mut self, err: SelectionError<'tcx>) { . *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. 3,132 ( 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; . 3,132 ( 0.00%) match self { . None => { 6,539 ( 0.00%) *self = Single(candidate); . return true; . } . . Single(current) => { . // Duplicates can happen inside ParamEnv. In the case, we . // perform a lazy deduplication. 15 ( 0.00%) if current == &candidate { . return false; . } . . // 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. 304 ( 0.00%) match (current, candidate) { . (ParamEnv(..), ParamEnv(..)) => convert_to_ambiguous = (), . (ParamEnv(..), _) => return false, . (_, ParamEnv(..)) => unreachable!(), . (_, _) => convert_to_ambiguous = (), . } . } . . Ambiguous | Error(..) => { . return false; . } . } . . // We only ever get here when we moved from a single candidate . // to ambiguous. . let () = convert_to_ambiguous; 5 ( 0.00%) *self = Ambiguous; . false 3,654 ( 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(); 2,872 ( 0.00%) infcx.commit_if_ok(|_snapshot| { . let placeholder_predicate = 2,832 ( 0.00%) infcx.replace_bound_vars_with_placeholders(obligation.predicate); . . let placeholder_obligation = obligation.with(placeholder_predicate); 944 ( 0.00%) let result = project_and_unify_type(selcx, &placeholder_obligation)?; 472 ( 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. 4,720 ( 0.00%) 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![]; 3,776 ( 0.00%) let normalized_ty = match opt_normalize_projection_type( . selcx, 472 ( 0.00%) obligation.param_env, 944 ( 0.00%) obligation.predicate.projection_ty, . obligation.cause.clone(), 944 ( 0.00%) obligation.recursion_depth, . &mut obligations, . ) { . Ok(Some(n)) => n, 300 ( 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. 794 ( 0.00%) let obligation_pred_ty = obligation.predicate.term.ty().unwrap(); 1,191 ( 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); 2,779 ( 0.00%) Ok(Ok(Some(obligations))) . } . Err(err) => { . debug!("project_and_unify_type: equating types encountered error {:?}", err); . Err(MismatchedProjectionTypes { err }) . } . } 4,248 ( 0.00%) } . . /// 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. 49,840 ( 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); 33,323 ( 0.01%) Normalized { value, obligations } 44,856 ( 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>, . { 38,416 ( 0.01%) normalize_with_depth_to(selcx, param_env, cause, 0, value, obligations) . } . . /// As `normalize`, but with a custom depth. 80 ( 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(); 30,450 ( 0.01%) let value = normalize_with_depth_to(selcx, param_env, cause, depth, value, &mut obligations); 16,693 ( 0.00%) Normalized { value, obligations } 68 ( 0.00%) } . 155,992 ( 0.03%) #[instrument(level = "info", skip(selcx, param_env, cause, obligations))] 221,715 ( 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()); 145,597 ( 0.03%) let mut normalizer = AssocTypeNormalizer::new(selcx, param_env, cause, depth, obligations); 118,455 ( 0.02%) let result = ensure_sufficient_stack(|| normalizer.fold(value)); . debug!(?result, obligations.len = normalizer.obligations.len()); . debug!(?normalizer.obligations,); 31,272 ( 0.01%) result 44,094 ( 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> { 3,706 ( 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> { 130,904 ( 0.02%) AssocTypeNormalizer { selcx, param_env, cause, obligations, depth, universes: vec![] } 3,706 ( 0.00%) } . 138,143 ( 0.02%) fn fold>(&mut self, value: T) -> T { 80,189 ( 0.01%) let value = self.selcx.infcx().resolve_vars_if_possible(value); . debug!(?value); . 25,910 ( 0.00%) assert!( . !value.has_escaping_bound_vars(), . "Normalizing {:?} without wrapping in a `Binder`", . value . ); . 47,850 ( 0.01%) if !needs_normalization(&value, self.param_env.reveal()) { 7,685 ( 0.00%) value . } else { 9,309 ( 0.00%) value.fold_with(self) . } 132,406 ( 0.02%) } . } . . impl<'a, 'b, 'tcx> TypeFolder<'tcx> for AssocTypeNormalizer<'a, 'b, 'tcx> { . fn tcx<'c>(&'c self) -> TyCtxt<'tcx> { 3,312 ( 0.00%) self.selcx.tcx() 848 ( 0.00%) } . . fn fold_binder>( . &mut self, . t: ty::Binder<'tcx, T>, . ) -> ty::Binder<'tcx, T> { . self.universes.push(None); 1,056 ( 0.00%) let t = t.super_fold_with(self); . self.universes.pop(); . t . } . 181,584 ( 0.03%) fn fold_ty(&mut self, ty: Ty<'tcx>) -> Ty<'tcx> { 45,396 ( 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. . 37,140 ( 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); 60,180 ( 0.01%) let normalized_ty = normalize_projection_type( 10,030 ( 0.00%) self.selcx, 10,030 ( 0.00%) self.param_env, . data, . self.cause.clone(), 10,030 ( 0.00%) self.depth, 10,030 ( 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), . } 204,282 ( 0.04%) } . . 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. 101,470 ( 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> { 81,176 ( 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. . 1,400 ( 0.00%) selcx.infcx().infer_projection(param_env, projection_ty, cause, depth + 1, obligations) . }) 91,323 ( 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. 255,511 ( 0.04%) #[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); 31,857 ( 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. . 10,619 ( 0.00%) let cache_result = if use_cache { 63,618 ( 0.01%) infcx.inner.borrow_mut().projection_cache().try_start(cache_key) . } else { 16 ( 0.00%) Ok(()) . }; 63,618 ( 0.01%) 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); . } 17,366 ( 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); . 16,911 ( 0.00%) match project_type(selcx, &obligation) { . Ok(ProjectedTy::Progress(Progress { . ty: projected_ty, 1,964 ( 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); . 491 ( 0.00%) let mut result = if projected_ty.has_projections() { . let mut normalizer = AssocTypeNormalizer::new( . selcx, . param_env, 1,092 ( 0.00%) cause, 546 ( 0.00%) depth + 1, . &mut projected_obligations, . ); 546 ( 0.00%) let normalized_ty = normalizer.fold(projected_ty); . . debug!(?normalized_ty, ?depth); . 1,365 ( 0.00%) Normalized { value: normalized_ty, obligations: projected_obligations } . } else { 1,308 ( 0.00%) Normalized { value: projected_ty, obligations: projected_obligations } . }; . . let mut deduped: SsoHashSet<_> = Default::default(); 491 ( 0.00%) result.obligations.drain_filter(|projected_obligation| { . if !deduped.insert(projected_obligation.clone()) { . return true; . } . false . }); . 491 ( 0.00%) if use_cache { 1,473 ( 0.00%) infcx.inner.borrow_mut().projection_cache().insert_ty(cache_key, result.clone()); . } . obligations.extend(result.obligations); 491 ( 0.00%) Ok(Some(result.value)) . } . Ok(ProjectedTy::NoProgress(projected_ty)) => { . debug!(?projected_ty, "opt_normalize_projection_type: no progress"); 2,540 ( 0.00%) let result = Normalized { value: projected_ty, obligations: vec![] }; 1,270 ( 0.00%) if use_cache { 3,810 ( 0.00%) infcx.inner.borrow_mut().projection_cache().insert_ty(cache_key, result.clone()); . } . // No need to extend `obligations`. 1,270 ( 0.00%) Ok(Some(result.value)) . } . Err(ProjectionTyError::TooManyCandidates) => { . debug!("opt_normalize_projection_type: too many candidates"); 118 ( 0.00%) if use_cache { 612 ( 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 -- line 980 ---------------------------------------- -- line 1042 ---------------------------------------- . obligations: Vec>, . } . . impl<'tcx> Progress<'tcx> { . fn error(tcx: TyCtxt<'tcx>) -> Self { . Progress { ty: tcx.ty_error(), obligations: vec![] } . } . 80 ( 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 ( 0.00%) self.obligations.append(&mut obligations); 48 ( 0.00%) self 48 ( 0.00%) } . } . . /// Computes the result of a projection type (if we can). . /// . /// IMPORTANT: . /// - `obligation` must be fully normalized 33,822 ( 0.01%) #[tracing::instrument(level = "info", skip(selcx))] . fn project_type<'cx, 'tcx>( . selcx: &mut SelectionContext<'cx, 'tcx>, . obligation: &ProjectionTyObligation<'tcx>, . ) -> Result, ProjectionTyError<'tcx>> { 5,637 ( 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()))); . } . 1,879 ( 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. 3,758 ( 0.00%) assemble_candidates_from_param_env(selcx, obligation, &mut candidates); . 3,726 ( 0.00%) assemble_candidates_from_trait_def(selcx, obligation, &mut candidates); . 3,758 ( 0.00%) assemble_candidates_from_object_ty(selcx, obligation, &mut candidates); . 4,378 ( 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 { 3,758 ( 0.00%) assemble_candidates_from_impls(selcx, obligation, &mut candidates); . }; . 9,395 ( 0.00%) match candidates { . ProjectionTyCandidateSet::Single(candidate) => { 10,802 ( 0.00%) Ok(ProjectedTy::Progress(confirm_candidate(selcx, obligation, candidate))) . } 6,350 ( 0.00%) ProjectionTyCandidateSet::None => Ok(ProjectedTy::NoProgress( . selcx . .tcx() 2,540 ( 0.00%) .mk_projection(obligation.predicate.item_def_id, obligation.predicate.substs), . )), . // Error occurred while trying to processing impls. . ProjectionTyCandidateSet::Error(e) => Err(ProjectionTyError::TraitSelectionError(e)), . // Inherent ambiguity that prevents us from even enumerating the . // candidates. 472 ( 0.00%) ProjectionTyCandidateSet::Ambiguous => Err(ProjectionTyError::TooManyCandidates), . } 5,146 ( 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, 1,879 ( 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. 22,336 ( 0.00%) let bounds = match *obligation.predicate.self_ty().kind() { 1,230 ( 0.00%) ty::Projection(ref data) => tcx.item_bounds(data.item_def_id).subst(tcx, data.substs), . 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 1169 ---------------------------------------- -- 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(); . 3,758 ( 0.00%) let self_ty = obligation.predicate.self_ty(); . let object_ty = selcx.infcx().shallow_resolve(self_ty); 9,395 ( 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, -- line 1210 ---------------------------------------- -- 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(); 8,737 ( 0.00%) for predicate in env_predicates { . debug!(?predicate); . let bound_predicate = predicate.kind(); 96,531 ( 0.02%) if let ty::PredicateKind::Projection(data) = predicate.kind().skip_binder() { 21,572 ( 0.00%) let data = bound_predicate.rebind(data); 10,786 ( 0.00%) let same_def_id = data.projection_def_id() == obligation.predicate.item_def_id; . 6,485 ( 0.00%) let is_match = same_def_id . && infcx.probe(|_| { 1,638 ( 0.00%) selcx.match_projection_projections( . obligation, 4,914 ( 0.00%) data, . potentially_unnormalized_candidates, . ) . }); . . debug!(?data, ?is_match, ?same_def_id); . 1,092 ( 0.00%) if is_match { 4,502 ( 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<...>`: 5,637 ( 0.00%) let poly_trait_ref = ty::Binder::dummy(obligation.predicate.trait_ref(selcx.tcx())); 3,758 ( 0.00%) let trait_obligation = obligation.with(poly_trait_ref.to_poly_trait_predicate()); 16,911 ( 0.00%) let _ = selcx.infcx().commit_if_ok(|_| { 11,274 ( 0.00%) let impl_source = match selcx.select(&trait_obligation) { 17,610 ( 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(()); . } . }; . 8,805 ( 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 = 765 ( 0.00%) assoc_ty_def(selcx, impl_data.impl_def_id, obligation.predicate.item_def_id) . .map_err(|ErrorReported| ())?; . 255 ( 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 1495 ---------------------------------------- . obligation.cause.span, . &format!("Cannot project an associated type from `{:?}`", impl_source), . ); . return Err(()); . } . }; . . if eligible { 1,246 ( 0.00%) if candidate_set.push_candidate(ProjectionTyCandidate::Select(impl_source)) { . Ok(()) . } else { . Err(()) . } . } else { . Err(()) . } 3,344 ( 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"); 2,455 ( 0.00%) let mut progress = match candidate { . ProjectionTyCandidate::ParamEnv(poly_projection) . | ProjectionTyCandidate::Object(poly_projection) => { 2,226 ( 0.00%) confirm_param_env_candidate(selcx, obligation, poly_projection, false) . } . . ProjectionTyCandidate::TraitDef(poly_projection) => { 3,341 ( 0.00%) confirm_param_env_candidate(selcx, obligation, poly_projection, true) . } . . ProjectionTyCandidate::Select(impl_source) => { 750 ( 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. 907 ( 0.00%) if progress.ty.has_infer_regions() { . 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> { 375 ( 0.00%) match impl_source { 355 ( 0.00%) super::ImplSource::UserDefined(data) => confirm_impl_candidate(selcx, obligation, data), . super::ImplSource::Generator(data) => confirm_generator_candidate(selcx, obligation, data), 12 ( 0.00%) super::ImplSource::Closure(data) => confirm_closure_candidate(selcx, obligation, data), 10 ( 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 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> { 2 ( 0.00%) let fn_type = selcx.infcx().shallow_resolve(fn_pointer_impl_source.fn_ty); 4 ( 0.00%) let sig = fn_type.fn_sig(selcx.tcx()); 20 ( 0.00%) let Normalized { value: sig, obligations } = normalize_with_depth( . selcx, 2 ( 0.00%) obligation.param_env, . obligation.cause.clone(), 6 ( 0.00%) obligation.recursion_depth + 1, 16 ( 0.00%) sig, . ); . 6 ( 0.00%) confirm_callable_candidate(selcx, obligation, sig, util::TupleArgumentsFlag::Yes) 14 ( 0.00%) .with_addl_obligations(fn_pointer_impl_source.nested) 14 ( 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> { 8 ( 0.00%) let closure_sig = impl_source.substs.as_closure().sig(); 20 ( 0.00%) let Normalized { value: closure_sig, obligations } = normalize_with_depth( . selcx, 2 ( 0.00%) obligation.param_env, . obligation.cause.clone(), 6 ( 0.00%) obligation.recursion_depth + 1, 16 ( 0.00%) closure_sig, . ); . . debug!(?obligation, ?closure_sig, ?obligations, "confirm_closure_candidate"); . 6 ( 0.00%) confirm_callable_candidate(selcx, obligation, closure_sig, util::TupleArgumentsFlag::No) 14 ( 0.00%) .with_addl_obligations(impl_source.nested) 14 ( 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"); . 20 ( 0.00%) let fn_once_def_id = tcx.require_lang_item(LangItem::FnOnce, None); 20 ( 0.00%) let fn_once_output_def_id = tcx.require_lang_item(LangItem::FnOnceOutput, None); . 40 ( 0.00%) let predicate = super::util::closure_trait_ref_and_return_type( . tcx, . fn_once_def_id, 8 ( 0.00%) obligation.predicate.self_ty(), 16 ( 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(), . }); . 48 ( 0.00%) confirm_param_env_candidate(selcx, obligation, predicate, true) . } . 5,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; 840 ( 0.00%) let param_env = obligation.param_env; . 1,680 ( 0.00%) let (cache_entry, _) = infcx.replace_bound_vars_with_fresh_vars( 1,260 ( 0.00%) cause.span, . LateBoundRegionConversionTime::HigherRankedType, . poly_cache_entry, . ); . 840 ( 0.00%) let cache_projection = cache_entry.projection_ty; . let mut nested_obligations = Vec::new(); 1,260 ( 0.00%) let obligation_projection = obligation.predicate; 3,360 ( 0.00%) let obligation_projection = ensure_sufficient_stack(|| { 1,680 ( 0.00%) normalize_with_depth_to( . selcx, 420 ( 0.00%) obligation.param_env, . obligation.cause.clone(), 1,260 ( 0.00%) obligation.recursion_depth + 1, 840 ( 0.00%) obligation_projection, . &mut nested_obligations, . ) . }); 840 ( 0.00%) let cache_projection = if potentially_unnormalized_candidate { 1,827 ( 0.00%) ensure_sufficient_stack(|| { 1,044 ( 0.00%) normalize_with_depth_to( . selcx, 261 ( 0.00%) obligation.param_env, . obligation.cause.clone(), 783 ( 0.00%) obligation.recursion_depth + 1, 522 ( 0.00%) cache_projection, . &mut nested_obligations, . ) . }) . } else { 318 ( 0.00%) cache_projection . }; . . debug!(?cache_projection, ?obligation_projection); . 840 ( 0.00%) match infcx.at(cause, param_env).eq(cache_projection, obligation_projection) { . Ok(InferOk { value: _, obligations }) => { . nested_obligations.extend(obligations); 840 ( 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. 3,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![] } . } . } 3,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(); . 284 ( 0.00%) let ImplSourceUserDefinedData { impl_def_id, substs, mut nested } = impl_impl_source; 213 ( 0.00%) let assoc_item_id = obligation.predicate.item_def_id; 284 ( 0.00%) let trait_def_id = tcx.trait_id_of_impl(impl_def_id).unwrap(); . 284 ( 0.00%) let param_env = obligation.param_env; 497 ( 0.00%) let assoc_ty = match assoc_ty_def(selcx, impl_def_id, assoc_item_id) { 710 ( 0.00%) Ok(assoc_ty) => assoc_ty, . Err(ErrorReported) => return Progress { ty: tcx.ty_error(), obligations: nested }, . }; . 284 ( 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]` 426 ( 0.00%) let substs = obligation.predicate.substs.rebase_onto(tcx, trait_def_id, substs); . let substs = 781 ( 0.00%) translate_substs(selcx.infcx(), param_env, impl_def_id, substs, assoc_ty.defining_node); 71 ( 0.00%) let ty = tcx.type_of(assoc_ty.item.def_id); 213 ( 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 { 142 ( 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. 4,419 ( 0.00%) fn assoc_ty_own_obligations<'cx, 'tcx>( . selcx: &mut SelectionContext<'cx, 'tcx>, . obligation: &ProjectionTyObligation<'tcx>, . nested: &mut Vec>, . ) { . let tcx = selcx.tcx(); 4,419 ( 0.00%) for predicate in tcx 982 ( 0.00%) .predicates_of(obligation.predicate.item_def_id) 1,473 ( 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, . )); . } 3,928 ( 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. 1,404 ( 0.00%) fn assoc_ty_def( . selcx: &SelectionContext<'_, '_>, . impl_def_id: DefId, . assoc_ty_def_id: DefId, . ) -> Result { . let tcx = selcx.tcx(); 312 ( 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. 312 ( 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); 1,872 ( 0.00%) return Ok(specialization_graph::LeafDef { 936 ( 0.00%) item: *item, . defining_node: impl_node, 780 ( 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) . ) . } 1,404 ( 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> { 378 ( 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 324 ( 0.00%) predicate.no_bound_vars().map(|predicate| { 108 ( 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), . ) . }) 432 ( 0.00%) } . } 192,328 ( 0.03%) -------------------------------------------------------------------------------- -- 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, . { 779 ( 0.00%) self.fold( . 0, . #[rustc_inherit_overflow_checks] 3,260 ( 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 267 ---------------------------------------- . /// 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> { . for i in 0..n { 319 ( 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 315 ---------------------------------------- . /// ``` . /// let a = [1, 2, 3]; . /// assert_eq!(a.iter().nth(10), None); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . fn nth(&mut self, n: usize) -> Option { . self.advance_by(n).ok()?; 505 ( 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, . { 984 ( 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, . { 3 ( 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, . { 25,437 ( 0.00%) 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) { 205 ( 0.00%) move |(), item| f(item) . } . 328,341 ( 0.06%) 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, . { 6,437 ( 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, . { 1,005 ( 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 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 1537 ---------------------------------------- . /// assert_eq!(iter.next(), None); . /// ``` . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . fn fuse(self) -> Fuse . where . Self: Sized, . { 1,067 ( 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, . { 7,112 ( 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")] 56 ( 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| { 6 ( 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(); . 4 ( 0.00%) self.fold((), extend(f, &mut left, &mut right)); . 80 ( 0.00%) (left, right) 63 ( 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")] 1,011 ( 0.00%) fn try_fold(&mut self, init: B, mut f: F) -> R . where . Self: Sized, . F: FnMut(B, Self::Item) -> R, . R: Try, . { 191 ( 0.00%) let mut accum = init; 556,491 ( 0.10%) while let Some(x) = self.next() { 4,488,714 ( 0.78%) accum = f(accum, x)?; . } 236 ( 0.00%) try { accum } 1,016 ( 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 { 72 ( 0.00%) move |(), x| f(x) . } . 55 ( 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")] 49 ( 0.00%) fn fold(mut self, init: B, mut f: F) -> B . where . Self: Sized, . F: FnMut(B, Self::Item) -> B, . { 62 ( 0.00%) let mut accum = init; 61,732 ( 0.01%) while let Some(x) = self.next() { 44,197 ( 0.01%) accum = f(accum, x); . } . accum 66 ( 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()?; 1,913 ( 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| { 420 ( 0.00%) if f(x) { ControlFlow::CONTINUE } else { ControlFlow::BREAK } . } . } 961 ( 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| { 18 ( 0.00%) if f(x) { ControlFlow::BREAK } else { ControlFlow::CONTINUE } . } . } . 18 ( 0.00%) self.try_fold((), check(f)) == ControlFlow::BREAK . } . . /// Searches for an element of an iterator that satisfies a predicate. . /// . /// `find()` 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 `find()` returns [`Some(element)`]. If they all return . /// `false`, it returns [`None`]. -- line 2443 ---------------------------------------- -- 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| { 67,795 ( 0.01%) if predicate(&x) { ControlFlow::Break(x) } else { ControlFlow::CONTINUE } 104 ( 0.00%) } . } . 71,562 ( 0.01%) 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 { 114,013 ( 0.02%) move |(), x| match f(x) { 3,238 ( 0.00%) Some(x) => ControlFlow::Break(x), . None => ControlFlow::CONTINUE, . } . } . 1 ( 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 2819 ---------------------------------------- . #[stable(feature = "iter_cmp_by_key", since = "1.6.0")] . 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) { 4 ( 0.00%) move |x| (f(&x), x) . } . . #[inline] . fn compare((x_p, _): &(B, T), (y_p, _): &(B, T)) -> Ordering { . x_p.cmp(y_p) . } . 5 ( 0.00%) let (_, x) = self.map(key(f)).max_by(compare)?; . Some(x) . } . . /// 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. -- line 2843 ---------------------------------------- -- 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 { 21 ( 0.00%) move |x, y| cmp::max_by(x, y, &mut compare) . } . 3,402 ( 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(); 4 ( 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, . { 3,865 ( 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, . { 5,739 ( 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")] 70 ( 0.00%) fn eq(self, other: I) -> bool . where . I: IntoIterator, . Self::Item: PartialEq, . Self: Sized, . { 80 ( 0.00%) self.eq_by(other, |x, y| x == y) 80 ( 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, . { 100 ( 0.00%) let mut other = other.into_iter(); . . loop { 30 ( 0.00%) let x = match self.next() { . None => return other.next().is_none(), 110 ( 0.00%) Some(val) => val, . }; . 30 ( 0.00%) let y = match other.next() { . None => return false, . Some(val) => val, . }; . 2 ( 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] 18 ( 0.00%) fn next(&mut self) -> Option { 5,441 ( 0.00%) (**self).next() 27 ( 0.00%) } . fn size_hint(&self) -> (usize, Option) { 32 ( 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 ---------------------------------------- 176,887 ( 0.03%) -------------------------------------------------------------------------------- -- 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 { 48 ( 0.00%) fn clone(&self) -> Self { 276 ( 0.00%) HashMap { . hash_builder: self.hash_builder.clone(), 54 ( 0.00%) table: self.table.clone(), . } 54 ( 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, . { 29,533 ( 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, . { 67,813 ( 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, . { 87,682 ( 0.02%) move |x| k.eq(x.borrow()) . } . . #[cfg(not(feature = "nightly"))] . #[cfg_attr(feature = "inline-more", inline)] . pub(crate) fn make_hash(hash_builder: &S, val: &Q) -> u64 . where . K: Borrow, . Q: Hash + ?Sized, -- line 248 ---------------------------------------- -- line 251 ---------------------------------------- . use core::hash::Hasher; . let mut state = hash_builder.build_hasher(); . val.hash(&mut state); . state.finish() . } . . #[cfg(feature = "nightly")] . #[cfg_attr(feature = "inline-more", inline)] 4 ( 0.00%) pub(crate) fn make_hash(hash_builder: &S, val: &Q) -> u64 . where . K: Borrow, . Q: Hash + ?Sized, . S: BuildHasher, . { . hash_builder.hash_one(val) 8 ( 0.00%) } . . #[cfg(not(feature = "nightly"))] . #[cfg_attr(feature = "inline-more", inline)] . pub(crate) fn make_insert_hash(hash_builder: &S, val: &K) -> u64 . where . K: Hash, . S: BuildHasher, . { -- line 274 ---------------------------------------- -- line 367 ---------------------------------------- . /// let s = DefaultHashBuilder::default(); . /// let mut map = HashMap::with_hasher(s); . /// map.insert(1, 2); . /// ``` . /// . /// [`BuildHasher`]: ../../std/hash/trait.BuildHasher.html . #[cfg_attr(feature = "inline-more", inline)] . pub const fn with_hasher(hash_builder: S) -> Self { 55,031 ( 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 { 31 ( 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 { 4,499 ( 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 { 13,423 ( 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)] 64 ( 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)) { . Entry::Occupied(OccupiedEntry { . hash, . key: Some(key), . elem, . table: self, . }) . } else { 80 ( 0.00%) Entry::Vacant(VacantEntry { . hash, . key, . table: self, . }) . } 80 ( 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. 124,487 ( 0.02%) 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, . { 172,640 ( 0.03%) if self.table.is_empty() { . None . } else { 2 ( 0.00%) let hash = make_hash::(&self.hash_builder, k); . self.table.get(hash, equivalent_key(k)) . } . } . . /// Returns the key-value pair corresponding to the supplied key, with a mutable reference to value. . /// . /// The supplied key may be any borrowed form of the map's key type, but . /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for -- line 1110 ---------------------------------------- -- line 1155 ---------------------------------------- . /// use hashbrown::HashMap; . /// . /// let mut map = HashMap::new(); . /// map.insert(1, "a"); . /// assert_eq!(map.contains_key(&1), true); . /// assert_eq!(map.contains_key(&2), false); . /// ``` . #[cfg_attr(feature = "inline-more", inline)] 110,375 ( 0.02%) pub fn contains_key(&self, k: &Q) -> bool . where . K: Borrow, . Q: Hash + Eq, . { . self.get_inner(k).is_some() 133,670 ( 0.02%) } . . /// Returns a mutable reference to the value corresponding to the key. . /// . /// The key may be any borrowed form of the map's key type, but . /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for . /// the key type. . /// . /// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html -- line 1177 ---------------------------------------- -- line 1185 ---------------------------------------- . /// let mut map = HashMap::new(); . /// map.insert(1, "a"); . /// if let Some(x) = map.get_mut(&1) { . /// *x = "b"; . /// } . /// assert_eq!(map[&1], "b"); . /// ``` . #[cfg_attr(feature = "inline-more", inline)] 137 ( 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. 411 ( 0.00%) match self.get_inner_mut(k) { . Some(&mut (_, ref mut v)) => Some(v), . None => None, . } 274 ( 0.00%) } . . #[inline] . fn get_inner_mut(&mut self, k: &Q) -> Option<&mut (K, V)> . where . K: Borrow, . Q: Hash + Eq, . { 137 ( 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)] 922,602 ( 0.16%) pub fn insert(&mut self, k: K, v: V) -> Option { . let hash = make_insert_hash::(&self.hash_builder, &k); 126 ( 0.00%) if let Some((_, item)) = self.table.get_mut(hash, equivalent_key(&k)) { . Some(mem::replace(item, v)) . } else { 467,253 ( 0.08%) self.table 440,420 ( 0.08%) .insert(hash, (k, v), make_hasher::(&self.hash_builder)); 46,758 ( 0.01%) None . } 836,593 ( 0.14%) } . . /// 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)] 8,348 ( 0.00%) pub fn remove(&mut self, k: &Q) -> Option . where . K: Borrow, . Q: Hash + Eq, . { . // Avoid `Option::map` because it bloats LLVM IR. 223,219 ( 0.04%) match self.remove_entry(k) { 5,673 ( 0.00%) Some((_, v)) => Some(v), 8,361 ( 0.00%) None => None, . } 17,608 ( 0.00%) } . . /// Removes a key from the map, returning the stored key and value if the . /// key was previously in the map. . /// . /// The key may be any borrowed form of the map's key type, but . /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for . /// the key type. . /// -- line 1618 ---------------------------------------- -- line 1631 ---------------------------------------- . /// ``` . #[cfg_attr(feature = "inline-more", inline)] . pub fn remove_entry(&mut self, k: &Q) -> Option<(K, V)> . where . K: Borrow, . Q: Hash + Eq, . { . let hash = make_hash::(&self.hash_builder, k); 72,670 ( 0.01%) self.table.remove_entry(hash, equivalent_key(k)) . } . } . . impl HashMap { . /// Creates a raw entry builder for the HashMap. . /// . /// Raw entries provide the lowest level of control for searching and . /// manipulating a map. They must be manually initialized with a hash and -- line 1647 ---------------------------------------- -- line 2209 ---------------------------------------- . /// Creates a `RawEntryMut` from the given key and its hash. . #[inline] . #[allow(clippy::wrong_self_convention)] . pub fn from_key_hashed_nocheck(self, hash: u64, k: &Q) -> RawEntryMut<'a, K, V, S, A> . where . K: Borrow, . Q: Eq, . { 1,175,824 ( 0.20%) 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)] 2,712,957 ( 0.47%) 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) 3,046,962 ( 0.53%) } . . #[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, . { 391,946 ( 0.07%) match self.map.table.find(hash, |(k, _)| is_match(k)) { 1,977,905 ( 0.34%) Some(elem) => RawEntryMut::Occupied(RawOccupiedEntryMut { . elem, . table: &mut self.map.table, . hash_builder: &self.map.hash_builder, . }), 67,443 ( 0.01%) 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)] 240,172 ( 0.04%) pub fn from_key_hashed_nocheck(self, hash: u64, k: &Q) -> Option<(&'a K, &'a V)> . where . K: Borrow, . Q: Eq, . { 306,811 ( 0.05%) self.from_hash(hash, equivalent(k)) 440,978 ( 0.08%) } . . #[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, . { 441,937 ( 0.08%) 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, . { 111,440 ( 0.02%) 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)] 538 ( 0.00%) fn into_iter(self) -> IntoIter { 9,995 ( 0.00%) IntoIter { 5,338 ( 0.00%) inner: self.table.into_iter(), . } 1,614 ( 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. 27,924 ( 0.00%) match self.inner.next() { . Some(x) => unsafe { . let r = x.as_ref(); 307 ( 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 3051 ---------------------------------------- . } . } . . impl Iterator for IntoIter { . type Item = (K, V); . . #[cfg_attr(feature = "inline-more", inline)] . fn next(&mut self) -> Option<(K, V)> { 338 ( 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)] 6 ( 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, . } 12 ( 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; 2 ( 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)] 10,245 ( 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. 9,454 ( 0.00%) let iter = iter.into_iter(); 3,256 ( 0.00%) let reserve = if self.is_empty() { . iter.size_hint().0 . } else { 407 ( 0.00%) (iter.size_hint().0 + 1) / 2 . }; . self.reserve(reserve); . iter.for_each(move |(k, v)| { 23,860 ( 0.00%) self.insert(k, v); . }); 4,985 ( 0.00%) } . . #[inline] . #[cfg(feature = "nightly")] . fn extend_one(&mut self, (k, v): (K, V)) { . self.insert(k, v); . } . . #[inline] -- line 4588 ---------------------------------------- 934,707 ( 0.16%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/rustc-hash-1.1.0/src/lib.rs -------------------------------------------------------------------------------- Ir -- line 71 ---------------------------------------- . fn default() -> FxHasher { . FxHasher { hash: 0 } . } . } . . impl FxHasher { . #[inline] . fn add_to_hash(&mut self, i: usize) { 438,913 ( 0.08%) self.hash = self.hash.rotate_left(5).bitxor(i).wrapping_mul(K); . } . } . . impl Hasher for FxHasher { . #[inline] 1,951 ( 0.00%) fn write(&mut self, mut bytes: &[u8]) { . #[cfg(target_pointer_width = "32")] . let read_usize = |bytes: &[u8]| u32::from_ne_bytes(bytes[..4].try_into().unwrap()); . #[cfg(target_pointer_width = "64")] . let read_usize = |bytes: &[u8]| u64::from_ne_bytes(bytes[..8].try_into().unwrap()); . 43,480 ( 0.01%) let mut hash = FxHasher { hash: self.hash }; . assert!(size_of::() <= 8); 405,632 ( 0.07%) while bytes.len() >= size_of::() { . hash.add_to_hash(read_usize(bytes) as usize); . bytes = &bytes[size_of::()..]; . } 86,650 ( 0.01%) if (size_of::() > 4) && (bytes.len() >= 4) { . hash.add_to_hash(u32::from_ne_bytes(bytes[..4].try_into().unwrap()) as usize); . bytes = &bytes[4..]; . } 86,650 ( 0.01%) if (size_of::() > 2) && bytes.len() >= 2 { . hash.add_to_hash(u16::from_ne_bytes(bytes[..2].try_into().unwrap()) as usize); . bytes = &bytes[2..]; . } 94,777 ( 0.02%) if (size_of::() > 1) && bytes.len() >= 1 { 17,353 ( 0.00%) hash.add_to_hash(bytes[0] as usize); . } 2,216 ( 0.00%) self.hash = hash.hash; 1,951 ( 0.00%) } . . #[inline] . fn write_u8(&mut self, i: u8) { 24 ( 0.00%) self.add_to_hash(i as usize); . } . . #[inline] . fn write_u16(&mut self, i: u16) { 290 ( 0.00%) self.add_to_hash(i as usize); . } . . #[inline] . fn write_u32(&mut self, i: u32) { 417,456 ( 0.07%) self.add_to_hash(i as usize); . } . . #[cfg(target_pointer_width = "32")] . #[inline] . fn write_u64(&mut self, i: u64) { . self.add_to_hash(i as usize); . self.add_to_hash((i >> 32) as usize); . } -- line 131 ---------------------------------------- 1 ( 0.00%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_metadata/src/rmeta/decoder.rs -------------------------------------------------------------------------------- Ir -- line 176 ---------------------------------------- . } . fn sess(self) -> Option<&'tcx Session> { . None . } . fn tcx(self) -> Option> { . None . } . 3,201 ( 0.00%) fn decoder(self, pos: usize) -> DecodeContext<'a, 'tcx> { 1,067 ( 0.00%) let tcx = self.tcx(); 266,169 ( 0.05%) DecodeContext { 27,189 ( 0.00%) opaque: opaque::Decoder::new(self.blob(), pos), 1,067 ( 0.00%) cdata: self.cdata(), . blob: self.blob(), 10,778 ( 0.00%) sess: self.sess().or(tcx.map(|tcx| tcx.sess)), . tcx, . last_source_file_index: 0, . lazy_state: LazyState::NoNode, . alloc_decoding_session: self . .cdata() 24,869 ( 0.00%) .map(|cdata| cdata.cdata.alloc_decoding_state.new_decoding_session()), . } 3,201 ( 0.00%) } . } . . impl<'a, 'tcx> Metadata<'a, 'tcx> for &'a MetadataBlob { . #[inline] . fn blob(self) -> &'a MetadataBlob { . self . } . } -- line 206 ---------------------------------------- -- line 255 ---------------------------------------- . } . #[inline] . fn tcx(self) -> Option> { . Some(self.1) . } . } . . impl<'a, 'tcx, T: Decodable>> Lazy { 49,498 ( 0.01%) fn decode>(self, metadata: M) -> T { 20,546 ( 0.00%) let mut dcx = metadata.decoder(self.position.get()); 76,863 ( 0.01%) dcx.lazy_state = LazyState::NodeStart(self.position); 21,918 ( 0.00%) T::decode(&mut dcx) 63,088 ( 0.01%) } . } . . impl<'a: 'x, 'tcx: 'x, 'x, T: Decodable>> Lazy<[T]> { . fn decode>( . self, . metadata: M, . ) -> impl ExactSizeIterator + Captures<'a> + Captures<'tcx> + 'x { 84 ( 0.00%) let mut dcx = metadata.decoder(self.position.get()); 24 ( 0.00%) dcx.lazy_state = LazyState::NodeStart(self.position); 9,191 ( 0.00%) (0..self.meta).map(move |_| T::decode(&mut dcx)) . } . } . . impl<'a, 'tcx> DecodeContext<'a, 'tcx> { . #[inline] . fn tcx(&self) -> TyCtxt<'tcx> { . debug_assert!(self.tcx.is_some(), "missing TyCtxt in DecodeContext"); . self.tcx.unwrap() -- line 285 ---------------------------------------- -- line 292 ---------------------------------------- . . #[inline] . pub fn cdata(&self) -> CrateMetadataRef<'a> { . debug_assert!(self.cdata.is_some(), "missing CrateMetadata in DecodeContext"); . self.cdata.unwrap() . } . . fn map_encoded_cnum_to_current(&self, cnum: CrateNum) -> CrateNum { 65,126 ( 0.01%) if cnum == LOCAL_CRATE { self.cdata().cnum } else { self.cdata().cnum_map[cnum] } . } . 29,530 ( 0.01%) fn read_lazy_with_meta(&mut self, meta: T::Meta) -> Lazy { . let distance = self.read_usize(); 28,034 ( 0.00%) let position = match self.lazy_state { . LazyState::NoNode => bug!("read_lazy_with_meta: outside of a metadata node"), 6,318 ( 0.00%) LazyState::NodeStart(start) => { . let start = start.get(); 12,636 ( 0.00%) assert!(distance <= start); . start - distance . } 5,448 ( 0.00%) LazyState::Previous(last_pos) => last_pos.get() + distance, . }; 16,268 ( 0.00%) self.lazy_state = LazyState::Previous(NonZeroUsize::new(position).unwrap()); . Lazy::from_position_and_meta(NonZeroUsize::new(position).unwrap(), meta) 29,530 ( 0.01%) } . . #[inline] . pub fn read_raw_bytes(&mut self, len: usize) -> &'a [u8] { . self.opaque.read_raw_bytes(len) . } . } . . impl<'a, 'tcx> TyDecoder<'tcx> for DecodeContext<'a, 'tcx> { -- line 324 ---------------------------------------- -- line 326 ---------------------------------------- . . #[inline] . fn tcx(&self) -> TyCtxt<'tcx> { . self.tcx.expect("missing TyCtxt in DecodeContext") . } . . #[inline] . fn peek_byte(&self) -> u8 { 67,515 ( 0.01%) self.opaque.data[self.opaque.position()] . } . . #[inline] . fn position(&self) -> usize { . self.opaque.position() . } . 59,017 ( 0.01%) fn cached_ty_for_shorthand(&mut self, shorthand: usize, or_insert_with: F) -> Ty<'tcx> . where . F: FnOnce(&mut Self) -> Ty<'tcx>, . { 8,431 ( 0.00%) let tcx = self.tcx(); . 8,431 ( 0.00%) let key = ty::CReaderCacheKey { cnum: Some(self.cdata().cnum), pos: shorthand }; . 26,576 ( 0.00%) if let Some(&ty) = tcx.ty_rcache.borrow().get(&key) { . return ty; . } . 1,787 ( 0.00%) let ty = or_insert_with(self); . tcx.ty_rcache.borrow_mut().insert(key, ty); . ty 75,879 ( 0.01%) } . . fn with_position(&mut self, pos: usize, f: F) -> R . where . F: FnOnce(&mut Self) -> R, . { . let new_opaque = opaque::Decoder::new(self.opaque.data, pos); . let old_opaque = mem::replace(&mut self.opaque, new_opaque); . let old_state = mem::replace(&mut self.lazy_state, LazyState::NoNode); . let r = f(self); 10,225 ( 0.00%) self.opaque = old_opaque; 2,045 ( 0.00%) self.lazy_state = old_state; . r . } . . fn decode_alloc_id(&mut self) -> rustc_middle::mir::interpret::AllocId { . if let Some(alloc_decoding_session) = self.alloc_decoding_session { . alloc_decoding_session.decode_alloc_id(self) . } else { . bug!("Attempting to decode interpret::AllocId without CrateMetadata") . } . } . } . . impl<'a, 'tcx> Decodable> for CrateNum { . fn decode(d: &mut DecodeContext<'a, 'tcx>) -> CrateNum { 32,843 ( 0.01%) let cnum = CrateNum::from_u32(d.read_u32()); . d.map_encoded_cnum_to_current(cnum) . } . } . . impl<'a, 'tcx> Decodable> for DefIndex { 201 ( 0.00%) fn decode(d: &mut DecodeContext<'a, 'tcx>) -> DefIndex { 69,811 ( 0.01%) DefIndex::from_u32(d.read_u32()) 402 ( 0.00%) } . } . . impl<'a, 'tcx> Decodable> for ExpnIndex { . fn decode(d: &mut DecodeContext<'a, 'tcx>) -> ExpnIndex { . ExpnIndex::from_u32(d.read_u32()) . } . } . . impl<'a, 'tcx> Decodable> for SyntaxContext { 61,040 ( 0.01%) fn decode(decoder: &mut DecodeContext<'a, 'tcx>) -> SyntaxContext { 15,260 ( 0.00%) let cdata = decoder.cdata(); 15,260 ( 0.00%) let sess = decoder.sess.unwrap(); 30,520 ( 0.01%) let cname = cdata.root.name; . rustc_span::hygiene::decode_syntax_context(decoder, &cdata.hygiene_context, |_, id| { . debug!("SpecializedDecoder: decoding {}", id); 216 ( 0.00%) cdata . .root . .syntax_contexts . .get(cdata, id) . .unwrap_or_else(|| panic!("Missing SyntaxContext {:?} for crate {:?}", id, cname)) . .decode((cdata, sess)) . }) 76,300 ( 0.01%) } . } . . impl<'a, 'tcx> Decodable> for ExpnId { 3,703 ( 0.00%) fn decode(decoder: &mut DecodeContext<'a, 'tcx>) -> ExpnId { 529 ( 0.00%) let local_cdata = decoder.cdata(); 529 ( 0.00%) let sess = decoder.sess.unwrap(); . . let cnum = CrateNum::decode(decoder); . let index = u32::decode(decoder); . . let expn_id = rustc_span::hygiene::decode_expn_id(cnum, index, |expn_id| { . let ExpnId { krate: cnum, local_id: index } = expn_id; . // Lookup local `ExpnData`s in our own crate data. Foreign `ExpnData`s . // are stored in the owning crate, to avoid duplication. . debug_assert_ne!(cnum, LOCAL_CRATE); 68 ( 0.00%) let crate_data = if cnum == local_cdata.cnum { . local_cdata . } else { . local_cdata.cstore.get_crate_data(cnum) . }; 340 ( 0.00%) let expn_data = crate_data . .root . .expn_data . .get(crate_data, index) . .unwrap() . .decode((crate_data, sess)); 340 ( 0.00%) let expn_hash = crate_data . .root . .expn_hashes . .get(crate_data, index) . .unwrap() . .decode((crate_data, sess)); 680 ( 0.00%) (expn_data, expn_hash) . }); . expn_id 4,232 ( 0.00%) } . } . . impl<'a, 'tcx> Decodable> for Span { 120,784 ( 0.02%) fn decode(decoder: &mut DecodeContext<'a, 'tcx>) -> Span { 15,098 ( 0.00%) let ctxt = SyntaxContext::decode(decoder); . let tag = u8::decode(decoder); . 30,196 ( 0.01%) if tag == TAG_PARTIAL_SPAN { . return DUMMY_SP.with_ctxt(ctxt); . } . . debug_assert!(tag == TAG_VALID_SPAN_LOCAL || tag == TAG_VALID_SPAN_FOREIGN); . . let lo = BytePos::decode(decoder); . let len = BytePos::decode(decoder); . let hi = lo + len; . 45,246 ( 0.01%) let Some(sess) = decoder.sess else { . bug!("Cannot decode Span without Session.") . }; . . // There are two possibilities here: . // 1. This is a 'local span', which is located inside a `SourceFile` . // that came from this crate. In this case, we use the source map data . // encoded in this crate. This branch should be taken nearly all of the time. . // 2. This is a 'foreign span', which is located inside a `SourceFile` -- line 476 ---------------------------------------- -- line 492 ---------------------------------------- . // a transitive dependency. . // . // When we encode a foreign span, we adjust its 'lo' and 'high' values . // to be based on the *foreign* crate (e.g. crate C), not the crate . // we are writing metadata for (e.g. crate B). This allows us to . // treat the 'local' and 'foreign' cases almost identically during deserialization: . // we can call `imported_source_files` for the proper crate, and binary search . // through the returned slice using our span. 39,259 ( 0.01%) let imported_source_files = if tag == TAG_VALID_SPAN_LOCAL { . decoder.cdata().imported_source_files(sess) . } else { . // When we encode a proc-macro crate, all `Span`s should be encoded . // with `TAG_VALID_SPAN_LOCAL` 6 ( 0.00%) if decoder.cdata().root.is_proc_macro_crate() { . // Decode `CrateNum` as u32 - using `CrateNum::decode` will ICE . // since we don't have `cnum_map` populated. . let cnum = u32::decode(decoder); . panic!( . "Decoding of crate {:?} tried to access proc-macro dep {:?}", . decoder.cdata().root.name, . cnum . ); -- line 513 ---------------------------------------- -- line 518 ---------------------------------------- . "SpecializedDecoder::specialized_decode: loading source files from cnum {:?}", . cnum . ); . . // Decoding 'foreign' spans should be rare enough that it's . // not worth it to maintain a per-CrateNum cache for `last_source_file_index`. . // We just set it to 0, to ensure that we don't try to access something out . // of bounds for our initial 'guess' 12 ( 0.00%) decoder.last_source_file_index = 0; . 6 ( 0.00%) let foreign_data = decoder.cdata().cstore.get_crate_data(cnum); . foreign_data.imported_source_files(sess) . }; . . let source_file = { . // Optimize for the case that most spans within a translated item . // originate from the same source_file. 45,246 ( 0.01%) let last_source_file = &imported_source_files[decoder.last_source_file_index]; . 56,799 ( 0.01%) if lo >= last_source_file.original_start_pos && lo <= last_source_file.original_end_pos . { . last_source_file . } else { . let index = imported_source_files . .binary_search_by_key(&lo, |source_file| source_file.original_start_pos) 18,188 ( 0.00%) .unwrap_or_else(|index| index - 1); . . // Don't try to cache the index for foreign spans, . // as this would require a map from CrateNums to indices 9,095 ( 0.00%) if tag == TAG_VALID_SPAN_LOCAL { 9,089 ( 0.00%) decoder.last_source_file_index = index; . } 18,190 ( 0.00%) &imported_source_files[index] . } . }; . . // Make sure our binary search above is correct. . debug_assert!( . lo >= source_file.original_start_pos && lo <= source_file.original_end_pos, . "Bad binary search: lo={:?} source_file.original_start_pos={:?} source_file.original_end_pos={:?}", . lo, -- line 558 ---------------------------------------- -- line 565 ---------------------------------------- . hi >= source_file.original_start_pos && hi <= source_file.original_end_pos, . "Bad binary search: hi={:?} source_file.original_start_pos={:?} source_file.original_end_pos={:?}", . hi, . source_file.original_start_pos, . source_file.original_end_pos . ); . . let lo = 60,328 ( 0.01%) (lo + source_file.translated_source_file.start_pos) - source_file.original_start_pos; . let hi = . (hi + source_file.translated_source_file.start_pos) - source_file.original_start_pos; . . // Do not try to decode parent for foreign spans. . Span::new(lo, hi, ctxt, None) 135,882 ( 0.02%) } . } . . impl<'a, 'tcx> Decodable> for &'tcx [thir::abstract_const::Node<'tcx>] { . fn decode(d: &mut DecodeContext<'a, 'tcx>) -> Self { . ty::codec::RefDecodable::decode(d) . } . } . -- line 587 ---------------------------------------- -- line 590 ---------------------------------------- . ty::codec::RefDecodable::decode(d) . } . } . . impl<'a, 'tcx, T: Decodable>> Decodable> . for Lazy . { . fn decode(decoder: &mut DecodeContext<'a, 'tcx>) -> Self { 11,351 ( 0.00%) decoder.read_lazy_with_meta(()) . } . } . . impl<'a, 'tcx, T: Decodable>> Decodable> . for Lazy<[T]> . { . fn decode(decoder: &mut DecodeContext<'a, 'tcx>) -> Self { . let len = decoder.read_usize(); 10,084 ( 0.00%) if len == 0 { Lazy::empty() } else { decoder.read_lazy_with_meta(len) } . } . } . . impl<'a, 'tcx, I: Idx, T: Decodable>> Decodable> . for Lazy> . where . Option: FixedSizeEncoding, . { . fn decode(decoder: &mut DecodeContext<'a, 'tcx>) -> Self { . let len = decoder.read_usize(); 6,084 ( 0.00%) decoder.read_lazy_with_meta(len) . } . } . . implement_ty_decoder!(DecodeContext<'a, 'tcx>); . . impl<'tcx> MetadataBlob { . crate fn new(metadata_ref: MetadataRef) -> MetadataBlob { . MetadataBlob(Lrc::new(metadata_ref)) -- line 626 ---------------------------------------- -- line 630 ---------------------------------------- . self.blob().starts_with(METADATA_HEADER) . } . . crate fn get_rustc_version(&self) -> String { . Lazy::::from_position(NonZeroUsize::new(METADATA_HEADER.len() + 4).unwrap()) . .decode(self) . } . 108 ( 0.00%) crate fn get_root(&self) -> CrateRoot<'tcx> { 36 ( 0.00%) let slice = &self.blob()[..]; . let offset = METADATA_HEADER.len(); 180 ( 0.00%) let pos = (((slice[offset + 0] as u32) << 24) 72 ( 0.00%) | ((slice[offset + 1] as u32) << 16) 144 ( 0.00%) | ((slice[offset + 2] as u32) << 8) 108 ( 0.00%) | ((slice[offset + 3] as u32) << 0)) as usize; . Lazy::>::from_position(NonZeroUsize::new(pos).unwrap()).decode(self) 180 ( 0.00%) } . . crate fn list_crate_metadata(&self, out: &mut dyn io::Write) -> io::Result<()> { . let root = self.get_root(); . writeln!(out, "Crate info:")?; . writeln!(out, "name {}{}", root.name, root.extra_filename)?; . writeln!(out, "hash {} stable_crate_id {:?}", root.hash, root.stable_crate_id)?; . writeln!(out, "proc_macro {:?}", root.proc_macro_data.is_some())?; . writeln!(out, "=External Dependencies=")?; -- line 654 ---------------------------------------- -- line 666 ---------------------------------------- . } . write!(out, "\n")?; . Ok(()) . } . } . . impl CrateRoot<'_> { . crate fn is_proc_macro_crate(&self) -> bool { 24 ( 0.00%) self.proc_macro_data.is_some() . } . . crate fn name(&self) -> Symbol { 10 ( 0.00%) self.name . } . . crate fn hash(&self) -> Svh { 12 ( 0.00%) self.hash . } . . crate fn stable_crate_id(&self) -> StableCrateId { 24 ( 0.00%) self.stable_crate_id . } . . crate fn triple(&self) -> &TargetTriple { . &self.triple . } . . crate fn decode_crate_deps<'a>( . &self, . metadata: &'a MetadataBlob, . ) -> impl ExactSizeIterator + Captures<'a> { 24 ( 0.00%) self.crate_deps.decode(metadata) . } . } . . impl<'a, 'tcx> CrateMetadataRef<'a> { . fn raw_proc_macro(self, id: DefIndex) -> &'a ProcMacro { . // DefIndex's in root.proc_macro_data have a one-to-one correspondence . // with items in 'raw_proc_macros'. . let pos = self -- line 705 ---------------------------------------- -- line 709 ---------------------------------------- . .unwrap() . .macros . .decode(self) . .position(|i| i == id) . .unwrap(); . &self.raw_proc_macros.unwrap()[pos] . } . 22,429 ( 0.00%) fn opt_item_ident(self, item_index: DefIndex, sess: &Session) -> Option { 17,062 ( 0.00%) let name = self.def_key(item_index).disambiguated_data.data.get_opt_name()?; 9,114 ( 0.00%) let span = match self.root.tables.ident_span.get(self, item_index) { . Some(lazy_span) => lazy_span.decode((self, sess)), . None => { . // FIXME: this weird case of a name with no span is specific to `extern crate` . // items, which are supposed to be treated like `use` items and only be encoded . // to metadata as `Export`s, return `None` because that's what all the callers . // expect in this case. 189 ( 0.00%) assert_eq!(self.def_kind(item_index), DefKind::ExternCrate); . return None; . } . }; . Some(Ident::new(name, span)) 28,846 ( 0.00%) } . 161 ( 0.00%) fn item_ident(self, item_index: DefIndex, sess: &Session) -> Ident { 3,103 ( 0.00%) self.opt_item_ident(item_index, sess).expect("no encoded ident for item") 322 ( 0.00%) } . . fn maybe_kind(self, item_id: DefIndex) -> Option { 11,614 ( 0.00%) self.root.tables.kind.get(self, item_id).map(|k| k.decode(self)) . } . 46,456 ( 0.01%) fn kind(self, item_id: DefIndex) -> EntryKind { . self.maybe_kind(item_id).unwrap_or_else(|| { . bug!( . "CrateMetadata::kind({:?}): id not found, in crate {:?} with number {}", . item_id, . self.root.name, . self.cnum, . ) . }) 34,842 ( 0.01%) } . 9,275 ( 0.00%) fn def_kind(self, item_id: DefIndex) -> DefKind { 6,870 ( 0.00%) self.root.tables.def_kind.get(self, item_id).map(|k| k.decode(self)).unwrap_or_else(|| { . bug!( . "CrateMetadata::def_kind({:?}): id not found, in crate {:?} with number {}", . item_id, . self.root.name, . self.cnum, . ) . }) 5,300 ( 0.00%) } . 1,449 ( 0.00%) fn get_span(self, index: DefIndex, sess: &Session) -> Span { 3,721 ( 0.00%) self.root . .tables . .span . .get(self, index) . .unwrap_or_else(|| panic!("Missing span for {:?}", index)) . .decode((self, sess)) 805 ( 0.00%) } . . fn load_proc_macro(self, id: DefIndex, sess: &Session) -> SyntaxExtension { . let (name, kind, helper_attrs) = match *self.raw_proc_macro(id) { . ProcMacro::CustomDerive { trait_name, attributes, client } => { . let helper_attrs = . attributes.iter().cloned().map(Symbol::intern).collect::>(); . ( . trait_name, -- line 778 ---------------------------------------- -- line 795 ---------------------------------------- . self.get_span(id, sess), . helper_attrs, . self.root.edition, . Symbol::intern(name), . &attrs, . ) . } . 845 ( 0.00%) fn get_trait_def(self, item_id: DefIndex, sess: &Session) -> ty::TraitDef { 260 ( 0.00%) match self.kind(item_id) { 65 ( 0.00%) EntryKind::Trait(data) => { 390 ( 0.00%) let data = data.decode((self, sess)); 1,040 ( 0.00%) ty::TraitDef::new( . self.local_def_id(item_id), 130 ( 0.00%) data.unsafety, 130 ( 0.00%) data.paren_sugar, 130 ( 0.00%) data.has_auto_impl, 130 ( 0.00%) data.is_marker, 65 ( 0.00%) data.skip_array_during_method_dispatch, 65 ( 0.00%) data.specialization_kind, 260 ( 0.00%) self.def_path_hash(item_id), 65 ( 0.00%) data.must_implement_one_of, . ) . } . EntryKind::TraitAlias => ty::TraitDef::new( . self.local_def_id(item_id), . hir::Unsafety::Normal, . false, . false, . false, . false, . ty::trait_def::TraitSpecializationKind::None, . self.def_path_hash(item_id), . None, . ), . _ => bug!("def-index does not refer to trait or trait alias"), . } 585 ( 0.00%) } . 189 ( 0.00%) fn get_variant( . self, . kind: &EntryKind, . index: DefIndex, . parent_did: DefId, . sess: &Session, . ) -> ty::VariantDef { 84 ( 0.00%) let data = match kind { . EntryKind::Variant(data) | EntryKind::Struct(data, _) | EntryKind::Union(data, _) => { 105 ( 0.00%) data.decode(self) . } . _ => bug!(), . }; . 62 ( 0.00%) let adt_kind = match kind { . EntryKind::Variant(_) => ty::AdtKind::Enum, . EntryKind::Struct(..) => ty::AdtKind::Struct, . EntryKind::Union(..) => ty::AdtKind::Union, . _ => bug!(), . }; . . let variant_did = . if adt_kind == ty::AdtKind::Enum { Some(self.local_def_id(index)) } else { None }; 42 ( 0.00%) let ctor_did = data.ctor.map(|index| self.local_def_id(index)); . 462 ( 0.00%) ty::VariantDef::new( . self.item_ident(index, sess).name, . variant_did, . ctor_did, 84 ( 0.00%) data.discr, 126 ( 0.00%) self.root . .tables . .children . .get(self, index) . .unwrap_or_else(Lazy::empty) . .decode(self) . .map(|index| ty::FieldDef { 20 ( 0.00%) did: self.local_def_id(index), 40 ( 0.00%) name: self.item_ident(index, sess).name, 40 ( 0.00%) vis: self.get_visibility(index), . }) . .collect(), . data.ctor_kind, . adt_kind, . parent_did, . false, 21 ( 0.00%) data.is_non_exhaustive, . ) 189 ( 0.00%) } . 240 ( 0.00%) fn get_adt_def(self, item_id: DefIndex, tcx: TyCtxt<'tcx>) -> &'tcx ty::AdtDef { 64 ( 0.00%) let kind = self.kind(item_id); 32 ( 0.00%) let did = self.local_def_id(item_id); . 68 ( 0.00%) let (adt_kind, repr) = match kind { . EntryKind::Enum(repr) => (ty::AdtKind::Enum, repr), . EntryKind::Struct(_, repr) => (ty::AdtKind::Struct, repr), . EntryKind::Union(_, repr) => (ty::AdtKind::Union, repr), . _ => bug!("get_adt_def called on a non-ADT {:?}", did), . }; . . let variants = if let ty::AdtKind::Enum = adt_kind { 30 ( 0.00%) self.root . .tables . .children . .get(self, item_id) . .unwrap_or_else(Lazy::empty) . .decode(self) 187 ( 0.00%) .map(|index| self.get_variant(&self.kind(index), index, did, tcx.sess)) . .collect() . } else { 80 ( 0.00%) std::iter::once(self.get_variant(&kind, item_id, did, tcx.sess)).collect() . }; . 254 ( 0.00%) tcx.alloc_adt_def(did, adt_kind, variants, repr) 112 ( 0.00%) } . . fn get_explicit_predicates( . self, . item_id: DefIndex, . tcx: TyCtxt<'tcx>, . ) -> ty::GenericPredicates<'tcx> { 1,385 ( 0.00%) self.root.tables.explicit_predicates.get(self, item_id).unwrap().decode((self, tcx)) . } . . fn get_inferred_outlives( . self, . item_id: DefIndex, . tcx: TyCtxt<'tcx>, . ) -> &'tcx [(ty::Predicate<'tcx>, Span)] { 1,385 ( 0.00%) self.root . .tables . .inferred_outlives . .get(self, item_id) 12 ( 0.00%) .map(|predicates| tcx.arena.alloc_from_iter(predicates.decode((self, tcx)))) . .unwrap_or_default() . } . . fn get_super_predicates( . self, . item_id: DefIndex, . tcx: TyCtxt<'tcx>, . ) -> ty::GenericPredicates<'tcx> { 380 ( 0.00%) self.root.tables.super_predicates.get(self, item_id).unwrap().decode((self, tcx)) . } . . fn get_explicit_item_bounds( . self, . item_id: DefIndex, . tcx: TyCtxt<'tcx>, . ) -> &'tcx [(ty::Predicate<'tcx>, Span)] { 50 ( 0.00%) self.root . .tables . .explicit_item_bounds . .get(self, item_id) 36 ( 0.00%) .map(|bounds| tcx.arena.alloc_from_iter(bounds.decode((self, tcx)))) . .unwrap_or_default() . } . . fn get_generics(self, item_id: DefIndex, sess: &Session) -> ty::Generics { 2,582 ( 0.00%) self.root.tables.generics.get(self, item_id).unwrap().decode((self, sess)) . } . . fn get_type(self, id: DefIndex, tcx: TyCtxt<'tcx>) -> Ty<'tcx> { 3,110 ( 0.00%) self.root . .tables . .ty . .get(self, id) . .unwrap_or_else(|| panic!("Not a type: {:?}", id)) . .decode((self, tcx)) . } . . fn get_stability(self, id: DefIndex) -> Option { 520 ( 0.00%) self.root.tables.stability.get(self, id).map(|stab| stab.decode(self)) . } . . fn get_const_stability(self, id: DefIndex) -> Option { . self.root.tables.const_stability.get(self, id).map(|stab| stab.decode(self)) . } . . fn get_deprecation(self, id: DefIndex) -> Option { 795 ( 0.00%) self.root.tables.deprecation.get(self, id).map(|depr| depr.decode(self)) . } . 240 ( 0.00%) fn get_visibility(self, id: DefIndex) -> ty::Visibility { 4,670 ( 0.00%) self.root.tables.visibility.get(self, id).unwrap().decode(self) 160 ( 0.00%) } . . fn get_impl_data(self, id: DefIndex) -> ImplData { 26,238 ( 0.00%) match self.kind(id) { 21,865 ( 0.00%) EntryKind::Impl(data) => data.decode(self), . _ => bug!(), . } . } . . fn get_parent_impl(self, id: DefIndex) -> Option { 12,921 ( 0.00%) self.get_impl_data(id).parent_impl . } . . fn get_impl_polarity(self, id: DefIndex) -> ty::ImplPolarity { 57 ( 0.00%) self.get_impl_data(id).polarity . } . . fn get_impl_defaultness(self, id: DefIndex) -> hir::Defaultness { 9 ( 0.00%) self.get_impl_data(id).defaultness . } . . fn get_impl_constness(self, id: DefIndex) -> hir::Constness { . self.get_impl_data(id).constness . } . . fn get_trait_item_def_id(self, id: DefIndex) -> Option { 2,335 ( 0.00%) self.root.tables.trait_item_def_id.get(self, id).map(|d| d.decode(self)) . } . . fn get_coerce_unsized_info(self, id: DefIndex) -> Option { . self.get_impl_data(id).coerce_unsized_info . } . . fn get_impl_trait(self, id: DefIndex, tcx: TyCtxt<'tcx>) -> Option> { 51,884 ( 0.01%) self.root.tables.impl_trait_ref.get(self, id).map(|tr| tr.decode((self, tcx))) . } . . fn get_expn_that_defined(self, id: DefIndex, sess: &Session) -> ExpnId { 2,035 ( 0.00%) self.root.tables.expn_that_defined.get(self, id).unwrap().decode((self, sess)) . } . . fn get_const_param_default( . self, . tcx: TyCtxt<'tcx>, . id: DefIndex, . ) -> rustc_middle::ty::Const<'tcx> { . self.root.tables.const_defaults.get(self, id).unwrap().decode((self, tcx)) -- line 1026 ---------------------------------------- -- line 1028 ---------------------------------------- . . /// Iterates over all the stability attributes in the given crate. . fn get_lib_features(self, tcx: TyCtxt<'tcx>) -> &'tcx [(Symbol, Option)] { . tcx.arena.alloc_from_iter(self.root.lib_features.decode(self)) . } . . /// Iterates over the language items in the given crate. . fn get_lang_items(self, tcx: TyCtxt<'tcx>) -> &'tcx [(DefId, usize)] { 36 ( 0.00%) tcx.arena.alloc_from_iter( 24 ( 0.00%) self.root . .lang_items . .decode(self) 508 ( 0.00%) .map(|(def_index, index)| (self.local_def_id(def_index), index)), . ) . } . . /// Iterates over the diagnostic items in the given crate. . fn get_diagnostic_items(self) -> DiagnosticItems { . let mut id_to_name = FxHashMap::default(); 24 ( 0.00%) let name_to_id = self . .root . .diagnostic_items . .decode(self) . .map(|(name, def_index)| { 91 ( 0.00%) let id = self.local_def_id(def_index); 91 ( 0.00%) id_to_name.insert(id, name); . (name, id) . }) . .collect(); 108 ( 0.00%) DiagnosticItems { id_to_name, name_to_id } . } . . /// Iterates over all named children of the given module, . /// including both proper items and reexports. . /// Module here is understood in name resolution sense - it can be a `mod` item, . /// or a crate root, or an enum, or a trait. . fn for_each_module_child( . self, . id: DefIndex, . mut callback: impl FnMut(ModChild), . sess: &Session, . ) { 384 ( 0.00%) if let Some(data) = &self.root.proc_macro_data { . // If we are loading as a proc macro, we want to return . // the view of this crate as a proc macro crate. . if id == CRATE_DEF_INDEX { . for def_index in data.macros.decode(self) { . let raw_macro = self.raw_proc_macro(def_index); . let res = Res::Def( . DefKind::Macro(macro_kind(raw_macro)), . self.local_def_id(def_index), -- line 1078 ---------------------------------------- -- line 1085 ---------------------------------------- . span: ident.span, . }); . } . } . return; . } . . // Iterate over all children. 768 ( 0.00%) if let Some(children) = self.root.tables.children.get(self, id) { 1,536 ( 0.00%) for child_index in children.decode((self, sess)) { 8,238 ( 0.00%) if let Some(ident) = self.opt_item_ident(child_index, sess) { 1,620 ( 0.00%) let kind = self.def_kind(child_index); 1,080 ( 0.00%) if matches!(kind, DefKind::Macro(..)) { . // FIXME: Macros are currently encoded twice, once as items and once as . // reexports. We ignore the items here and only use the reexports. . continue; . } . let def_id = self.local_def_id(child_index); . let res = Res::Def(kind, def_id); . let vis = self.get_visibility(child_index); . let span = self.get_span(child_index, sess); . . callback(ModChild { ident, res, vis, span }); . . // For non-re-export structs and variants add their constructors to children. . // Re-export lists automatically contain constructors when necessary. 2,064 ( 0.00%) match kind { . DefKind::Struct => { 35 ( 0.00%) if let Some((ctor_def_id, ctor_kind)) = . self.get_ctor_def_id_and_kind(child_index) . { . let ctor_res = . Res::Def(DefKind::Ctor(CtorOf::Struct, ctor_kind), ctor_def_id); . let vis = self.get_visibility(ctor_def_id.index); . callback(ModChild { ident, res: ctor_res, vis, span }); . } . } . DefKind::Variant => { . // Braced variants, unlike structs, generate unusable names in . // value namespace, they are reserved for possible future use. . // It's ok to use the variant's id as a ctor id since an . // error will be reported on any use of such resolution anyway. 6 ( 0.00%) let (ctor_def_id, ctor_kind) = self . .get_ctor_def_id_and_kind(child_index) . .unwrap_or((def_id, CtorKind::Fictive)); . let ctor_res = . Res::Def(DefKind::Ctor(CtorOf::Variant, ctor_kind), ctor_def_id); . let mut vis = self.get_visibility(ctor_def_id.index); 2 ( 0.00%) if ctor_def_id == def_id && vis.is_public() { . // For non-exhaustive variants lower the constructor visibility to . // within the crate. We only need this for fictive constructors, . // for other constructors correct visibilities . // were already encoded in metadata. . let mut attrs = self.get_item_attrs(def_id.index, sess); . if attrs.any(|item| item.has_name(sym::non_exhaustive)) { . let crate_def_id = self.local_def_id(CRATE_DEF_INDEX); . vis = ty::Visibility::Restricted(crate_def_id); -- line 1141 ---------------------------------------- -- line 1144 ---------------------------------------- . callback(ModChild { ident, res: ctor_res, vis, span }); . } . _ => {} . } . } . } . } . 998 ( 0.00%) match self.kind(id) { 54 ( 0.00%) EntryKind::Mod(exports) => { 8,022 ( 0.00%) for exp in exports.decode((self, sess)) { . callback(exp); . } . } . EntryKind::Enum(..) | EntryKind::Trait(..) => {} . _ => bug!("`for_each_module_child` is called on a non-module: {:?}", self.def_kind(id)), . } . } . -- line 1162 ---------------------------------------- -- line 1164 ---------------------------------------- . self.root.tables.mir_for_ctfe.get(self, id).is_some() . } . . fn is_item_mir_available(self, id: DefIndex) -> bool { . self.root.tables.mir.get(self, id).is_some() . } . . fn module_expansion(self, id: DefIndex, sess: &Session) -> ExpnId { 2,534 ( 0.00%) match self.kind(id) { . EntryKind::Mod(_) | EntryKind::Enum(_) | EntryKind::Trait(_) => { . self.get_expn_that_defined(id, sess) . } . _ => panic!("Expected module, found {:?}", self.local_def_id(id)), . } . } . . fn get_optimized_mir(self, tcx: TyCtxt<'tcx>, id: DefIndex) -> Body<'tcx> { -- line 1180 ---------------------------------------- -- line 1242 ---------------------------------------- . qualif, . _, . ) => qualif, . _ => bug!("mir_const_qualif: unexpected kind"), . } . } . . fn get_fn_has_self_parameter(self, id: DefIndex) -> bool { 915 ( 0.00%) match self.kind(id) { 732 ( 0.00%) EntryKind::AssocFn(data) => data.decode(self).has_self, . _ => false, . } . } . . fn get_associated_item_def_ids(self, tcx: TyCtxt<'tcx>, id: DefIndex) -> &'tcx [DefId] { 735 ( 0.00%) if let Some(children) = self.root.tables.children.get(self, id) { 315 ( 0.00%) tcx.arena.alloc_from_iter( 105 ( 0.00%) children.decode((self, tcx.sess)).map(|child_index| self.local_def_id(child_index)), . ) . } else { . &[] . } . } . 5,412 ( 0.00%) fn get_associated_item(self, id: DefIndex, sess: &Session) -> ty::AssocItem { 3,157 ( 0.00%) let def_key = self.def_key(id); . let parent = self.local_def_id(def_key.parent.unwrap()); . let ident = self.item_ident(id, sess); . 3,271 ( 0.00%) let (kind, container, has_self) = match self.kind(id) { 40 ( 0.00%) EntryKind::AssocConst(container, _, _) => (ty::AssocKind::Const, container, false), 404 ( 0.00%) EntryKind::AssocFn(data) => { . let data = data.decode(self); 2,828 ( 0.00%) (ty::AssocKind::Fn, data.container, data.has_self) . } 74 ( 0.00%) EntryKind::AssocType(container) => (ty::AssocKind::Type, container, false), . _ => bug!("cannot get associated-item of `{:?}`", def_key), . }; . 8,118 ( 0.00%) ty::AssocItem { . name: ident.name, . kind, . vis: self.get_visibility(id), . defaultness: container.defaultness(), . def_id: self.local_def_id(id), . trait_item_def_id: self.get_trait_item_def_id(id), . container: container.with_def_id(parent), . fn_has_self_parameter: has_self, . } 4,059 ( 0.00%) } . . fn get_item_variances(self, id: DefIndex) -> impl Iterator + 'a { 125 ( 0.00%) self.root.tables.variances.get(self, id).unwrap_or_else(Lazy::empty).decode(self) . } . . fn get_ctor_def_id_and_kind(self, node_id: DefIndex) -> Option<(DefId, CtorKind)> { 1,245 ( 0.00%) match self.kind(node_id) { . EntryKind::Struct(data, _) | EntryKind::Variant(data) => { 538 ( 0.00%) let vdata = data.decode(self); 523 ( 0.00%) vdata.ctor.map(|index| (self.local_def_id(index), vdata.ctor_kind)) . } . _ => None, . } 662 ( 0.00%) } . 300 ( 0.00%) fn get_item_attrs( . self, . id: DefIndex, . sess: &'a Session, . ) -> impl Iterator + 'a { 861 ( 0.00%) self.root . .tables . .attributes . .get(self, id) . .unwrap_or_else(|| { . // Structure and variant constructors don't have any attributes encoded for them, . // but we assume that someone passing a constructor ID actually wants to look at . // the attributes on the corresponding struct or variant. . let def_key = self.def_key(id); -- line 1320 ---------------------------------------- -- line 1322 ---------------------------------------- . let parent_id = def_key.parent.expect("no parent for a constructor"); . self.root . .tables . .attributes . .get(self, parent_id) . .expect("no encoded attributes for a structure or variant") . }) . .decode((self, sess)) 225 ( 0.00%) } . . fn get_struct_field_names( . self, . id: DefIndex, . sess: &'a Session, . ) -> impl Iterator> + 'a { 660 ( 0.00%) self.root . .tables . .children . .get(self, id) . .unwrap_or_else(Lazy::empty) . .decode(self) 1,610 ( 0.00%) .map(move |index| respan(self.get_span(index, sess), self.item_ident(index, sess).name)) . } . . fn get_struct_field_visibilities(self, id: DefIndex) -> impl Iterator + 'a { 345 ( 0.00%) self.root . .tables . .children . .get(self, id) . .unwrap_or_else(Lazy::empty) . .decode(self) 80 ( 0.00%) .map(move |field_index| self.get_visibility(field_index)) . } . . fn get_inherent_implementations_for_type( . self, . tcx: TyCtxt<'tcx>, . id: DefIndex, . ) -> &'tcx [DefId] { 36 ( 0.00%) tcx.arena.alloc_from_iter( 45 ( 0.00%) self.root . .tables . .inherent_impls . .get(self, id) . .unwrap_or_else(Lazy::empty) . .decode(self) 468 ( 0.00%) .map(|index| self.local_def_id(index)), . ) . } . . fn get_traits(self) -> impl Iterator + 'a { . self.root.traits.decode(self).map(move |index| self.local_def_id(index)) . } . . fn get_trait_impls(self) -> impl Iterator)> + 'a { -- line 1376 ---------------------------------------- -- line 1380 ---------------------------------------- . index: *trait_index, . }; . impls.decode(self).map(move |(impl_index, simplified_self_ty)| { . (trait_def_id, self.local_def_id(impl_index), simplified_self_ty) . }) . }) . } . 8,640 ( 0.00%) fn get_implementations_of_trait( . self, . tcx: TyCtxt<'tcx>, . trait_def_id: DefId, . ) -> &'tcx [(DefId, Option)] { 960 ( 0.00%) if self.trait_impls.is_empty() { . return &[]; . } . . // Do a reverse lookup beforehand to avoid touching the crate_num . // hash map in the loop below. 1,056 ( 0.00%) let key = match self.reverse_translate_def_id(trait_def_id) { . Some(def_id) => (def_id.krate.as_u32(), def_id.index), . None => return &[], . }; . . if let Some(impls) = self.trait_impls.get(&key) { 744 ( 0.00%) tcx.arena.alloc_from_iter( 372 ( 0.00%) impls . .decode(self) 7,445 ( 0.00%) .map(|(idx, simplified_self_ty)| (self.local_def_id(idx), simplified_self_ty)), . ) . } else { . &[] . } 7,680 ( 0.00%) } . . fn get_trait_of_item(self, id: DefIndex) -> Option { 244 ( 0.00%) let def_key = self.def_key(id); 305 ( 0.00%) match def_key.disambiguated_data.data { . DefPathData::TypeNs(..) | DefPathData::ValueNs(..) => (), . // Not an associated item . _ => return None, . } 549 ( 0.00%) def_key.parent.and_then(|parent_index| match self.kind(parent_index) { . EntryKind::Trait(_) | EntryKind::TraitAlias => Some(self.local_def_id(parent_index)), . _ => None, . }) . } . . fn get_native_libraries(self, sess: &'a Session) -> impl Iterator + 'a { 24 ( 0.00%) self.root.native_libraries.decode((self, sess)) . } . . fn get_proc_macro_quoted_span(self, index: usize, sess: &Session) -> Span { . self.root . .tables . .proc_macro_quoted_spans . .get(self, index) . .unwrap_or_else(|| panic!("Missing proc macro quoted span: {:?}", index)) -- line 1437 ---------------------------------------- -- line 1450 ---------------------------------------- . self.root.dylib_dependency_formats.decode(self).enumerate().flat_map(|(i, link)| { . let cnum = CrateNum::new(i + 1); . link.map(|link| (self.cnum_map[cnum], link)) . }), . ) . } . . fn get_missing_lang_items(self, tcx: TyCtxt<'tcx>) -> &'tcx [lang_items::LangItem] { 60 ( 0.00%) tcx.arena.alloc_from_iter(self.root.lang_items_missing.decode(self)) . } . . fn get_fn_param_names(self, tcx: TyCtxt<'tcx>, id: DefIndex) -> &'tcx [Ident] { . let param_names = match self.kind(id) { . EntryKind::Fn(data) | EntryKind::ForeignFn(data) => data.decode(self).param_names, . EntryKind::AssocFn(data) => data.decode(self).fn_data.param_names, . _ => Lazy::empty(), . }; -- line 1466 ---------------------------------------- -- line 1479 ---------------------------------------- . EntryKind::AnonConst(_, data) . | EntryKind::Const(_, data) . | EntryKind::AssocConst(_, _, data) => data.decode(self).0, . _ => bug!(), . } . } . . fn get_macro(self, id: DefIndex, sess: &Session) -> MacroDef { 78 ( 0.00%) match self.kind(id) { 13 ( 0.00%) EntryKind::MacroDef(macro_def) => macro_def.decode((self, sess)), . _ => bug!(), . } . } . . // This replicates some of the logic of the crate-local `is_const_fn_raw` query, because we . // don't serialize constness for tuple variant and tuple struct constructors. . fn is_const_fn_raw(self, id: DefIndex) -> bool { 81 ( 0.00%) let constness = match self.kind(id) { 18 ( 0.00%) EntryKind::AssocFn(data) => data.decode(self).fn_data.constness, . EntryKind::Fn(data) => data.decode(self).constness, . EntryKind::ForeignFn(data) => data.decode(self).constness, . EntryKind::Variant(..) | EntryKind::Struct(..) => hir::Constness::Const, . _ => hir::Constness::NotConst, . }; . constness == hir::Constness::Const . } . -- line 1505 ---------------------------------------- -- line 1532 ---------------------------------------- . fn generator_kind(self, id: DefIndex) -> Option { . match self.kind(id) { . EntryKind::Generator(data) => Some(data), . _ => None, . } . } . . fn fn_sig(self, id: DefIndex, tcx: TyCtxt<'tcx>) -> ty::PolyFnSig<'tcx> { 400 ( 0.00%) self.root.tables.fn_sig.get(self, id).unwrap().decode((self, tcx)) . } . . #[inline] 24,059 ( 0.00%) fn def_key(self, index: DefIndex) -> DefKey { 6,874 ( 0.00%) *self . .def_key_cache . .lock() . .entry(index) 9,775 ( 0.00%) .or_insert_with(|| self.root.tables.def_keys.get(self, index).unwrap().decode(self)) 27,496 ( 0.00%) } . . // Returns the path leading to the thing with this `id`. . fn def_path(self, id: DefIndex) -> DefPath { . debug!("def_path(cnum={:?}, id={:?})", self.cnum, id); . DefPath::make(self.cnum, id, |parent| self.def_key(parent)) . } . . fn def_path_hash_unlocked( . self, . index: DefIndex, . def_path_hashes: &mut FxHashMap, . ) -> DefPathHash { 4,386 ( 0.00%) *def_path_hashes.entry(index).or_insert_with(|| { 850 ( 0.00%) self.root.tables.def_path_hashes.get(self, index).unwrap().decode(self) . }) . } . . #[inline] 15,351 ( 0.00%) fn def_path_hash(self, index: DefIndex) -> DefPathHash { . let mut def_path_hashes = self.def_path_hash_cache.lock(); . self.def_path_hash_unlocked(index, &mut def_path_hashes) 17,544 ( 0.00%) } . . #[inline] . fn def_path_hash_to_def_index(self, hash: DefPathHash) -> DefIndex { . self.def_path_hash_map.def_path_hash_to_def_index(&hash) . } . . fn expn_hash_to_expn_id(self, sess: &Session, index_guess: u32, hash: ExpnHash) -> ExpnId { . debug_assert_eq!(ExpnId::from_hash(hash), None); -- line 1580 ---------------------------------------- -- line 1635 ---------------------------------------- . /// Proc macro crates don't currently export spans, so this function does not have . /// to work for them. . fn imported_source_files(self, sess: &Session) -> &'a [ImportedSourceFile] { . // Translate the virtual `/rustc/$hash` prefix back to a real directory . // that should hold actual sources, where possible. . // . // NOTE: if you update this, you might need to also update bootstrap's code for generating . // the `rust-src` component in `Src::run` in `src/bootstrap/dist.rs`. 30,164 ( 0.01%) let virtual_rust_source_base_dir = option_env!("CFG_VIRTUAL_RUST_SOURCE_BASE_DIR") . .map(Path::new) . .filter(|_| { . // Only spend time on further checks if we have what to translate *to*. . sess.opts.real_rust_source_base_dir.is_some() . }) . .filter(|virtual_dir| { . // Don't translate away `/rustc/$hash` if we're still remapping to it, . // since that means we're still building `std`/`rustc` that need it, . // and we don't want the real path to leak into codegen/debuginfo. . !sess.opts.remap_path_prefix.iter().any(|(_from, to)| to == virtual_dir) . }); 30,164 ( 0.01%) let try_to_translate_virtual_to_real = |name: &mut rustc_span::FileName| { . debug!( . "try_to_translate_virtual_to_real(name={:?}): \ . virtual_rust_source_base_dir={:?}, real_rust_source_base_dir={:?}", . name, virtual_rust_source_base_dir, sess.opts.real_rust_source_base_dir, . ); . 1,965 ( 0.00%) if let Some(virtual_dir) = virtual_rust_source_base_dir { . if let Some(real_dir) = &sess.opts.real_rust_source_base_dir { . if let rustc_span::FileName::Real(old_name) = name { . if let rustc_span::RealFileName::Remapped { local_path: _, virtual_name } = . old_name . { . if let Ok(rest) = virtual_name.strip_prefix(virtual_dir) { . let virtual_name = virtual_name.clone(); . -- line 1670 ---------------------------------------- -- line 1709 ---------------------------------------- . *old_name = new_name; . } . } . } . } . } . }; . 30,158 ( 0.01%) self.cdata.source_map_import_info.get_or_init(|| { 36 ( 0.00%) let external_source_map = self.root.source_map.decode(self); . . external_source_map . .map(|source_file_to_import| { . // We can't reuse an existing SourceFile, so allocate a new one . // containing the information we need. . let rustc_span::SourceFile { 8,253 ( 0.00%) mut name, 2,358 ( 0.00%) src_hash, 393 ( 0.00%) start_pos, 786 ( 0.00%) end_pos, 1,965 ( 0.00%) mut lines, 1,965 ( 0.00%) mut multibyte_chars, 2,358 ( 0.00%) mut non_narrow_chars, 1,965 ( 0.00%) mut normalized_pos, 2,358 ( 0.00%) name_hash, . .. . } = source_file_to_import; . . // If this file is under $sysroot/lib/rustlib/src/ but has not been remapped . // during rust bootstrapping by `remap-debuginfo = true`, and the user . // wish to simulate that behaviour by -Z simulate-remapped-rust-src-base, . // then we change `name` to a similar state as if the rust was bootstrapped . // with `remap-debuginfo = true`. . // This is useful for testing so that tests about the effects of . // `try_to_translate_virtual_to_real` don't have to worry about how the . // compiler is bootstrapped. 786 ( 0.00%) if let Some(virtual_dir) = . &sess.opts.debugging_opts.simulate_remapped_rust_src_base . { . if let Some(real_dir) = &sess.opts.real_rust_source_base_dir { . if let rustc_span::FileName::Real(ref mut old_name) = name { . if let rustc_span::RealFileName::LocalPath(local) = old_name { . if let Ok(rest) = local.strip_prefix(real_dir) { . *old_name = rustc_span::RealFileName::Remapped { . local_path: None, -- line 1753 ---------------------------------------- -- line 1767 ---------------------------------------- . let source_length = (end_pos - start_pos).to_usize(); . . // Translate line-start positions and multibyte character . // position into frame of reference local to file. . // `SourceMap::new_imported_source_file()` will then translate those . // coordinates to their new global frame of reference when the . // offset of the SourceFile is known. . for pos in &mut lines { 519,822 ( 0.09%) *pos = *pos - start_pos; . } . for mbc in &mut multibyte_chars { 1,164 ( 0.00%) mbc.pos = mbc.pos - start_pos; . } . for swc in &mut non_narrow_chars { 804 ( 0.00%) *swc = *swc - start_pos; . } . for np in &mut normalized_pos { 3,806 ( 0.00%) np.pos = np.pos - start_pos; . } . 7,074 ( 0.00%) let local_version = sess.source_map().new_imported_source_file( 5,109 ( 0.00%) name, 2,751 ( 0.00%) src_hash, . name_hash, . source_length, 786 ( 0.00%) self.cnum, 1,965 ( 0.00%) lines, 2,358 ( 0.00%) multibyte_chars, 1,965 ( 0.00%) non_narrow_chars, 1,572 ( 0.00%) normalized_pos, . start_pos, . end_pos, . ); . debug!( . "CrateMetaData::imported_source_files alloc \ . source_file {:?} original (start_pos {:?} end_pos {:?}) \ . translated (start_pos {:?} end_pos {:?})", . local_version.name, -- line 1804 ---------------------------------------- -- line 1808 ---------------------------------------- . local_version.end_pos . ); . . ImportedSourceFile { . original_start_pos: start_pos, . original_end_pos: end_pos, . translated_source_file: local_version, . } 1,179 ( 0.00%) }) . .collect() . }) . } . } . . impl CrateMetadata { 144 ( 0.00%) crate fn new( . sess: &Session, . blob: MetadataBlob, . root: CrateRoot<'static>, . raw_proc_macros: Option<&'static [ProcMacro]>, . cnum: CrateNum, . cnum_map: CrateNumMap, . dep_kind: CrateDepKind, . source: CrateSource, . private_dep: bool, . host_hash: Option, . ) -> CrateMetadata { 36 ( 0.00%) let trait_impls = root . .impls . .decode((&blob, sess)) . .map(|trait_impls| (trait_impls.trait_id, trait_impls.impls)) . .collect(); . let alloc_decoding_state = 36 ( 0.00%) AllocDecodingState::new(root.interpret_alloc_index.decode(&blob).collect()); . let dependencies = Lock::new(cnum_map.iter().cloned().collect()); . . // Pre-decode the DefPathHash->DefIndex table. This is a cheap operation . // that does not copy any data. It just does some data verification. 12 ( 0.00%) let def_path_hash_map = root.def_path_hash_map.decode(&blob); . 276 ( 0.00%) CrateMetadata { 12 ( 0.00%) blob, 36 ( 0.00%) root, 48 ( 0.00%) trait_impls, . raw_proc_macros, . source_map_import_info: OnceCell::new(), 48 ( 0.00%) def_path_hash_map, . expn_hash_map: Default::default(), 84 ( 0.00%) alloc_decoding_state, . cnum, 48 ( 0.00%) cnum_map, 60 ( 0.00%) dependencies, . dep_kind: Lock::new(dep_kind), 144 ( 0.00%) source, . private_dep, . host_hash, . extern_crate: Lock::new(None), . hygiene_context: Default::default(), . def_key_cache: Default::default(), . def_path_hash_cache: Default::default(), . } 108 ( 0.00%) } . . crate fn dependencies(&self) -> LockGuard<'_, Vec> { . self.dependencies.borrow() . } . . crate fn add_dependency(&self, cnum: CrateNum) { . self.dependencies.borrow_mut().push(cnum); . } . . crate fn update_extern_crate(&self, new_extern_crate: ExternCrate) -> bool { . let mut extern_crate = self.extern_crate.borrow_mut(); . let update = Some(new_extern_crate.rank()) > extern_crate.as_ref().map(ExternCrate::rank); . if update { 85 ( 0.00%) *extern_crate = Some(new_extern_crate); . } . update . } . . crate fn source(&self) -> &CrateSource { 872 ( 0.00%) &self.source . } . . crate fn dep_kind(&self) -> CrateDepKind { . *self.dep_kind.lock() . } . . crate fn update_dep_kind(&self, f: impl FnOnce(CrateDepKind) -> CrateDepKind) { 252 ( 0.00%) self.dep_kind.with_lock(|dep_kind| *dep_kind = f(*dep_kind)) . } . . crate fn panic_strategy(&self) -> PanicStrategy { . self.root.panic_strategy . } . . crate fn needs_panic_runtime(&self) -> bool { . self.root.needs_panic_runtime -- line 1905 ---------------------------------------- -- line 1909 ---------------------------------------- . self.root.panic_runtime . } . . crate fn is_profiler_runtime(&self) -> bool { . self.root.profiler_runtime . } . . crate fn needs_allocator(&self) -> bool { 12 ( 0.00%) self.root.needs_allocator . } . . crate fn has_global_allocator(&self) -> bool { . self.root.has_global_allocator . } . . crate fn has_default_lib_allocator(&self) -> bool { . self.root.has_default_lib_allocator . } . . crate fn is_proc_macro_crate(&self) -> bool { . self.root.is_proc_macro_crate() . } . . crate fn name(&self) -> Symbol { 1,261 ( 0.00%) self.root.name . } . . crate fn stable_crate_id(&self) -> StableCrateId { . self.root.stable_crate_id . } . . crate fn hash(&self) -> Svh { . self.root.hash . } . . fn num_def_ids(&self) -> usize { . self.root.tables.def_keys.size() . } . . fn local_def_id(&self, index: DefIndex) -> DefId { 12,522 ( 0.00%) DefId { krate: self.cnum, index } . } . . // Translate a DefId from the current compilation environment to a DefId . // for an external crate. . fn reverse_translate_def_id(&self, did: DefId) -> Option { . for (local, &global) in self.cnum_map.iter_enumerated() { 3,565 ( 0.00%) if global == did.krate { . return Some(DefId { krate: local, index: did.index }); . } . } . . None . } . } . -- line 1964 ---------------------------------------- 343,524 ( 0.06%) -------------------------------------------------------------------------------- -- 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> { 3,173 ( 0.00%) self.fields.tcx() 1,898 ( 0.00%) } . . fn param_env(&self) -> ty::ParamEnv<'tcx> { . self.fields.param_env . } . . fn a_is_expected(&self) -> bool { 5,610 ( 0.00%) self.a_is_expected . } . 6,180 ( 0.00%) fn relate_item_substs( . &mut self, . _item_def_id: DefId, . a_subst: SubstsRef<'tcx>, . b_subst: SubstsRef<'tcx>, . ) -> RelateResult<'tcx, SubstsRef<'tcx>> { . // 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). . 1,236 ( 0.00%) relate::relate_substs(self, None, a_subst, b_subst) 7,416 ( 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) . } . 196,353 ( 0.03%) fn tys(&mut self, a: Ty<'tcx>, b: Ty<'tcx>) -> RelateResult<'tcx, Ty<'tcx>> { . debug!("{}.tys({:?}, {:?})", self.tag(), a, b); 21,817 ( 0.00%) if a == b { . return Ok(a); . } . 13,204 ( 0.00%) let infcx = self.fields.infcx; 13,204 ( 0.00%) let a = infcx.inner.borrow_mut().type_variables().replace_if_possible(a); 13,204 ( 0.00%) let b = infcx.inner.borrow_mut().type_variables().replace_if_possible(b); . . debug!("{}.tys: replacements ({:?}, {:?})", self.tag(), a, b); . 38,491 ( 0.01%) 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); . } . 193 ( 0.00%) (&ty::Infer(TyVar(a_id)), _) => { 772 ( 0.00%) self.fields.instantiate(b, RelationDir::EqTo, a_id, self.a_is_expected)?; . } . 2,081 ( 0.00%) (_, &ty::Infer(TyVar(b_id))) => { 10,405 ( 0.00%) self.fields.instantiate(a, RelationDir::EqTo, b_id, self.a_is_expected)?; . } . . _ => { 29,260 ( 0.01%) self.fields.infcx.super_combine_tys(self, a, b)?; . } . } . . Ok(a) 196,353 ( 0.03%) } . 33,894 ( 0.01%) fn regions( . &mut self, . a: ty::Region<'tcx>, . b: ty::Region<'tcx>, . ) -> RelateResult<'tcx, ty::Region<'tcx>> { . debug!("{}.regions({:?}, {:?})", self.tag(), a, b); 11,298 ( 0.00%) let origin = Subtype(Box::new(self.fields.trace.clone())); 22,596 ( 0.00%) self.fields . .infcx . .inner . .borrow_mut() . .unwrap_region_constraints() 22,596 ( 0.00%) .make_eqregion(origin, a, b); 7,532 ( 0.00%) Ok(a) 33,894 ( 0.01%) } . . fn consts( . &mut self, . a: &'tcx ty::Const<'tcx>, . b: &'tcx ty::Const<'tcx>, . ) -> RelateResult<'tcx, &'tcx ty::Const<'tcx>> { . self.fields.infcx.super_combine_consts(self, a, b) . } -- line 124 ---------------------------------------- 58,768 ( 0.01%) -------------------------------------------------------------------------------- -- 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, . ) { 3,058 ( 0.00%) if let Some((file, file_idx)) = new_file_and_idx { 1,310 ( 0.00%) self.file = file; 2,212 ( 0.00%) self.file_index = file_idx; . } . 1,100 ( 0.00%) let line_index = self.file.lookup_line(pos).unwrap(); . let line_bounds = self.file.line_bounds(line_index); 4,548 ( 0.00%) self.line_number = line_index + 1; 6,498 ( 0.00%) self.line = line_bounds; . self.touch(time_stamp); . } . . #[inline] . fn touch(&mut self, time_stamp: usize) { 29,948 ( 0.01%) self.time_stamp = time_stamp; . } . } . . #[derive(Clone)] . pub struct CachingSourceMapView<'sm> { . source_map: &'sm SourceMap, . line_cache: [CacheEntry; 3], . time_stamp: usize, . } . . impl<'sm> CachingSourceMapView<'sm> { 1,130 ( 0.00%) pub fn new(source_map: &'sm SourceMap) -> CachingSourceMapView<'sm> { . let files = source_map.files(); 565 ( 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, . }; . 2,825 ( 0.00%) CachingSourceMapView { . source_map, 3,955 ( 0.00%) line_cache: [entry.clone(), entry.clone(), entry], . time_stamp: 0, . } 2,260 ( 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)) . } . 112,301 ( 0.02%) pub fn span_data_to_lines_and_cols( . &mut self, . span_data: &SpanData, . ) -> Option<(Lrc, usize, BytePos, usize, BytePos)> { 64,172 ( 0.01%) self.time_stamp += 1; . . // Check if lo and hi are in the cached lines. 16,043 ( 0.00%) let lo_cache_idx = self.cache_entry_index(span_data.lo); 16,043 ( 0.00%) let hi_cache_idx = self.cache_entry_index(span_data.hi); . 28,134 ( 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 = { 27,810 ( 0.00%) let lo = &self.line_cache[lo_cache_idx as usize]; . let hi = &self.line_cache[hi_cache_idx as usize]; . 83,430 ( 0.01%) if lo.file_index != hi.file_index { . return None; . } . . ( 27,810 ( 0.00%) lo.file.clone(), . lo.line_number, . span_data.lo - lo.line.start, 13,905 ( 0.00%) hi.line_number, . span_data.hi - hi.line.start, . ) . }; . 13,905 ( 0.00%) self.line_cache[lo_cache_idx as usize].touch(self.time_stamp); 13,905 ( 0.00%) self.line_cache[hi_cache_idx as usize].touch(self.time_stamp); . 55,620 ( 0.01%) return Some(result); . } . . // No cache hit or cache hit for only one of span lo and hi. 3,952 ( 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. 17,104 ( 0.00%) let new_file_and_idx = if !file_contains(&self.line_cache[oldest].file, span_data.lo) { 5,190 ( 0.00%) let new_file_and_idx = self.file_for_position(span_data.lo)?; 6,228 ( 0.00%) if !file_contains(&new_file_and_idx.0, span_data.hi) { . return None; . } . 4,152 ( 0.00%) Some(new_file_and_idx) . } else { . let file = &self.line_cache[oldest].file; 3,300 ( 0.00%) if !file_contains(&file, span_data.hi) { . return None; . } . 3,300 ( 0.00%) None . }; . . // Update the cache entries. 10,690 ( 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); . 4,548 ( 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); 324 ( 0.00%) let hi = &mut self.line_cache[hi_cache_idx as usize]; 486 ( 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]; 460 ( 0.00%) hi.update(new_file_and_idx, span_data.hi, self.time_stamp); 920 ( 0.00%) let lo = &mut self.line_cache[lo_cache_idx as usize]; 1,840 ( 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. 4,276 ( 0.00%) assert!(span_data.lo >= lo.line.start); 2,138 ( 0.00%) assert!(span_data.lo <= lo.line.end); 4,276 ( 0.00%) assert!(span_data.hi >= hi.line.start); 2,138 ( 0.00%) assert!(span_data.hi <= hi.line.end); 10,690 ( 0.00%) assert!(lo.file.contains(span_data.lo)); 6,414 ( 0.00%) assert!(lo.file.contains(span_data.hi)); 6,414 ( 0.00%) assert_eq!(lo.file_index, hi.file_index); . 6,414 ( 0.00%) Some(( 2,138 ( 0.00%) lo.file.clone(), . lo.line_number, . span_data.lo - lo.line.start, 2,138 ( 0.00%) hi.line_number, . span_data.hi - hi.line.start, . )) 144,387 ( 0.02%) } . . fn cache_entry_index(&self, pos: BytePos) -> isize { . for (idx, cache_entry) in self.line_cache.iter().enumerate() { 151,269 ( 0.03%) if cache_entry.line.contains(&pos) { . return idx as isize; . } . } . . -1 . } . . fn oldest_cache_entry_index(&self) -> usize { . let mut oldest = 0; . . for idx in 1..self.line_cache.len() { 9,096 ( 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() { 4,358 ( 0.00%) if idx != avoid_idx 1,867 ( 0.00%) && self.line_cache[idx].time_stamp < self.line_cache[oldest].time_stamp . { . oldest = idx; . } . } . . oldest . } . 5,190 ( 0.00%) fn file_for_position(&self, pos: BytePos) -> Option<(Lrc, usize)> { 1,038 ( 0.00%) if !self.source_map.files().is_empty() { 2,076 ( 0.00%) let file_idx = self.source_map.lookup_source_file_idx(pos); . let file = &self.source_map.files()[file_idx]; . 8,304 ( 0.00%) if file_contains(file, pos) { . return Some((file.clone(), file_idx)); . } . } . . None 5,190 ( 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 ---------------------------------------- 210,916 ( 0.04%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/.cargo/registry/src/github.com-1ecc6299db9ec823/stacker-0.1.14/src/lib.rs -------------------------------------------------------------------------------- Ir -- line 42 ---------------------------------------- . /// `stack_size` bytes. . /// . /// The closure `f` is guaranteed to run on a stack with at least `red_zone` bytes, and it will be . /// run on the current stack if there's space available. . #[inline(always)] . pub fn maybe_grow R>(red_zone: usize, stack_size: usize, callback: F) -> R { . // if we can't guess the remaining stack (unsupported on some platforms) we immediately grow . // the stack and then cache the new stack size (which we do know now because we allocated it. 139,401 ( 0.02%) let enough_space = match remaining_stack() { . Some(remaining) => remaining >= red_zone, . None => false, . }; 192,006 ( 0.03%) if enough_space { 12,661 ( 0.00%) callback() . } else { . grow(stack_size, callback) . } . } . . /// Always creates a new stack for the passed closure to run on. . /// The closure will still be on the same thread as the caller of `grow`. . /// This will allocate a new stack with at least `stack_size` bytes. -- line 63 ---------------------------------------- -- line 82 ---------------------------------------- . _grow(stack_size, dyn_callback); . ret.unwrap() . } . . /// Queries the amount of remaining stack as interpreted by this library. . /// . /// This function will return the amount of stack space left which will be used . /// to determine whether a stack switch should be made or not. 128,004 ( 0.02%) pub fn remaining_stack() -> Option { . let current_ptr = current_stack_ptr(); 128,004 ( 0.02%) get_stack_limit().map(|limit| current_ptr - limit) 256,008 ( 0.04%) } . . psm_stack_information! ( . yes { . fn current_stack_ptr() -> usize { 128,004 ( 0.02%) psm::stack_pointer() as usize . } . } . no { . #[inline(always)] . fn current_stack_ptr() -> usize { . unsafe { . let mut x = std::mem::MaybeUninit::::uninit(); . // Unlikely to be ever exercised. As a fallback we execute a volatile read to a -- line 106 ---------------------------------------- -- line 111 ---------------------------------------- . x.as_ptr() as usize . } . } . } . ); . . thread_local! { . static STACK_LIMIT: Cell> = Cell::new(unsafe { 1 ( 0.00%) guess_os_stack_limit() . }) . } . . #[inline(always)] . fn get_stack_limit() -> Option { . STACK_LIMIT.with(|s| s.get()) . } . -- line 127 ---------------------------------------- -- line 403 ---------------------------------------- . VirtualQuery( . psm::stack_pointer() as *const _, . mi.as_mut_ptr(), . std::mem::size_of::() as SIZE_T, . ); . Some(mi.assume_init().AllocationBase as usize + get_thread_stack_guarantee() + 0x1000) . } . } else if #[cfg(any(target_os = "linux", target_os="solaris", target_os = "netbsd"))] { 2 ( 0.00%) unsafe fn guess_os_stack_limit() -> Option { . let mut attr = std::mem::MaybeUninit::::uninit(); 4 ( 0.00%) assert_eq!(libc::pthread_attr_init(attr.as_mut_ptr()), 0); 7 ( 0.00%) assert_eq!(libc::pthread_getattr_np(libc::pthread_self(), . attr.as_mut_ptr()), 0); 1 ( 0.00%) let mut stackaddr = std::ptr::null_mut(); 4 ( 0.00%) let mut stacksize = 0; 4 ( 0.00%) assert_eq!(libc::pthread_attr_getstack( . attr.as_ptr(), &mut stackaddr, &mut stacksize . ), 0); 4 ( 0.00%) assert_eq!(libc::pthread_attr_destroy(attr.as_mut_ptr()), 0); 1 ( 0.00%) Some(stackaddr as usize) 3 ( 0.00%) } . } else if #[cfg(any(target_os = "freebsd", target_os = "dragonfly"))] { . unsafe fn guess_os_stack_limit() -> Option { . let mut attr = std::mem::MaybeUninit::::uninit(); . assert_eq!(libc::pthread_attr_init(attr.as_mut_ptr()), 0); . assert_eq!(libc::pthread_attr_get_np(libc::pthread_self(), attr.as_mut_ptr()), 0); . let mut stackaddr = std::ptr::null_mut(); . let mut stacksize = 0; . assert_eq!(libc::pthread_attr_getstack( -- line 431 ---------------------------------------- 82,948 ( 0.01%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_data_structures/src/obligation_forest/mod.rs -------------------------------------------------------------------------------- Ir -- line 121 ---------------------------------------- . #[derive(Debug)] . pub enum ProcessResult { . Unchanged, . Changed(Vec), . Error(E), . } . . #[derive(Clone, Copy, PartialEq, Eq, Hash, Debug)] 13,836 ( 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 { 156,384 ( 0.03%) Node { . obligation, . state: Cell::new(NodeState::Pending), 18,342 ( 0.00%) dependents: if let Some(parent_index) = parent { vec![parent_index] } else { vec![] }, . has_parent: parent.is_some(), . obligation_tree_id, . } . } . } . . /// The state of one node in some tree within the forest. This represents the . /// current state of processing for the obligation (of type `O`) associated -- line 200 ---------------------------------------- -- line 223 ---------------------------------------- . /// | compress() . /// v . /// (Removed) . /// ``` . /// The `Error` state can be introduced in several places, via `error_at()`. . /// . /// Outside of `ObligationForest` methods, nodes should be either `Pending` or . /// `Waiting`. 69,689 ( 0.01%) #[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 { 18,760 ( 0.00%) Self { stalled: true, errors: vec![] } . } . . fn mark_not_stalled(&mut self) { 9,765 ( 0.00%) self.stalled = false; . } . . fn is_stalled(&self) -> bool { 2,000 ( 0.00%) self.stalled . } . . fn record_completed(&mut self, _outcome: &Self::Obligation) { . // do nothing . } . . fn record_error(&mut self, error: Self::Error) { 64 ( 0.00%) self.errors.push(error) . } . } . . #[derive(Debug, PartialEq, Eq)] . pub struct Error { . pub error: E, . pub backtrace: Vec, . } . . impl ObligationForest { 3,455 ( 0.00%) pub fn new() -> ObligationForest { 41,460 ( 0.01%) ObligationForest { . nodes: vec![], . done_cache: Default::default(), . active_cache: Default::default(), . reused_node_vec: vec![], . obligation_tree_id_generator: (0..).map(ObligationTreeId), . error_cache: Default::default(), . } 3,455 ( 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. 106,431 ( 0.02%) let _ = self.register_obligation_at(obligation, None); . } . . // Returns Err(()) if we already know this obligation failed. 155,232 ( 0.03%) fn register_obligation_at(&mut self, obligation: O, parent: Option) -> Result<(), ()> { 28,224 ( 0.00%) let cache_key = obligation.as_cache_key(); 28,224 ( 0.00%) if self.done_cache.contains(&cache_key) { . debug!("register_obligation_at: ignoring already done obligation: {:?}", obligation); . return Ok(()); . } . 78,426 ( 0.01%) match self.active_cache.entry(cache_key) { . Entry::Occupied(o) => { 6,594 ( 0.00%) let node = &mut self.nodes[*o.get()]; 6,594 ( 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. 6,921 ( 0.00%) if !node.dependents.contains(&parent_index) { . node.dependents.push(parent_index); . } . } 9,891 ( 0.00%) if let NodeState::Error = node.state.get() { Err(()) } else { Ok(()) } . } 29,322 ( 0.01%) Entry::Vacant(v) => { 58,644 ( 0.01%) let obligation_tree_id = match parent { 5,712 ( 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 { 9,774 ( 0.00%) let new_index = self.nodes.len(); . v.insert(new_index); . self.nodes.push(Node::new(parent, obligation, obligation_tree_id)); . Ok(()) . } . } . } 127,008 ( 0.02%) } . . /// Converts all remaining obligations to the given error. 36,883 ( 0.01%) pub fn to_errors(&mut self, error: E) -> Vec> { . let errors = self . .nodes . .iter() . .enumerate() . .filter(|(_index, node)| node.state.get() == NodeState::Pending) . .map(|(index, _node)| Error { error: error.clone(), backtrace: self.error_at(index) }) . .collect(); . 10,538 ( 0.00%) self.compress(|_| assert!(false)); . errors 31,614 ( 0.01%) } . . /// 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, . { 19 ( 0.00%) self.nodes . .iter() . .filter(|node| node.state.get() == NodeState::Pending) . .map(|node| f(&node.obligation)) . .collect() . } . 28 ( 0.00%) fn insert_into_error_cache(&mut self, index: usize) { . let node = &self.nodes[index]; 4 ( 0.00%) self.error_cache 12 ( 0.00%) .entry(node.obligation_tree_id) . .or_default() . .insert(node.obligation.as_cache_key()); 32 ( 0.00%) } . . /// Performs a pass through the obligation list. This must . /// be called in a loop until `outcome.stalled` is false. . /// . /// This _cannot_ be unrolled (presently, at least). . #[inline(never)] 84,420 ( 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; 26,707 ( 0.00%) 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. 34,654 ( 0.01%) if node.state.get() != NodeState::Pending { 1,292 ( 0.00%) index += 1; . continue; . } . 50,847 ( 0.01%) match processor.process_obligation(&mut node.obligation) { . ProcessResult::Unchanged => { . // No change in state. . } 39,044 ( 0.01%) ProcessResult::Changed(children) => { . // We are not (yet) stalled. . outcome.mark_not_stalled(); . node.state.set(NodeState::Success); . 50,894 ( 0.01%) for child in children { 100,725 ( 0.02%) let st = self.register_obligation_at(child, Some(index)); 11,850 ( 0.00%) if let Err(()) = st { . // Error already reported - propagate it . // to our node. . self.error_at(index); . } . } . } . ProcessResult::Error(err) => { . outcome.mark_not_stalled(); 132 ( 0.00%) outcome.record_error(Error { error: err, backtrace: self.error_at(index) }); . } . } 32,070 ( 0.01%) index += 1; . } . . // There's no need to perform marking, cycle processing and compression when nothing . // changed. 2,000 ( 0.00%) if !outcome.is_stalled() { . self.mark_successes(); . self.process_cycles(processor); 3,026 ( 0.00%) self.compress(|obl| outcome.record_completed(obl)); . } . . outcome 84,420 ( 0.01%) } . . /// Returns a vector of obligations for `p` and all of its . /// ancestors, putting them into the error state in the process. 28 ( 0.00%) fn error_at(&self, mut index: usize) -> Vec { . let mut error_stack: Vec = vec![]; . let mut trace = vec![]; . . loop { . let node = &self.nodes[index]; 4 ( 0.00%) node.state.set(NodeState::Error); . trace.push(node.obligation.clone()); 8 ( 0.00%) if node.has_parent { . // The first dependent is the parent, which is treated . // specially. . error_stack.extend(node.dependents.iter().skip(1)); . index = node.dependents[0]; . } else { . // No parent; treat all dependents non-specially. . error_stack.extend(node.dependents.iter()); . break; -- line 504 ---------------------------------------- -- line 509 ---------------------------------------- . let node = &self.nodes[index]; . if node.state.get() != NodeState::Error { . node.state.set(NodeState::Error); . error_stack.extend(node.dependents.iter()); . } . } . . trace 32 ( 0.00%) } . . /// Mark all `Waiting` nodes as `Success`, except those that depend on a . /// pending node. . fn mark_successes(&self) { . // Convert all `Waiting` nodes to `Success`. . for node in &self.nodes { 31,164 ( 0.01%) if node.state.get() == NodeState::Waiting { . node.state.set(NodeState::Success); . } . } . . // Convert `Success` nodes that depend on a pending node back to . // `Waiting`. . for node in &self.nodes { 12,191 ( 0.00%) if node.state.get() == NodeState::Pending { . // This call site is hot. . self.inlined_mark_dependents_as_waiting(node); . } . } . } . . // This always-inlined function is for the hot call site. . #[inline(always)] . fn inlined_mark_dependents_as_waiting(&self, node: &Node) { 1,109 ( 0.00%) for &index in node.dependents.iter() { . let node = &self.nodes[index]; 1,109 ( 0.00%) let state = node.state.get(); 1,109 ( 0.00%) if state == NodeState::Success { . // This call site is cold. 1,338 ( 0.00%) self.uninlined_mark_dependents_as_waiting(node); . } else { . debug_assert!(state == NodeState::Waiting || state == NodeState::Error) . } . } . } . . // This never-inlined function is for the cold call site. . #[inline(never)] 3,122 ( 0.00%) fn uninlined_mark_dependents_as_waiting(&self, node: &Node) { . // Mark node Waiting in the cold uninlined code instead of the hot inlined . node.state.set(NodeState::Waiting); . self.inlined_mark_dependents_as_waiting(node) 3,568 ( 0.00%) } . . /// Report cycles between all `Success` nodes, and convert all `Success` . /// nodes to `Done`. This must be called after `mark_successes`. . fn process_cycles

(&mut self, processor: &mut P) . where . P: ObligationProcessor, . { 1,513 ( 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. 12,191 ( 0.00%) if node.state.get() == NodeState::Success { 47,525 ( 0.01%) self.find_cycles_from_node(&mut stack, processor, index); . } . } . . debug_assert!(stack.is_empty()); 12,104 ( 0.00%) self.reused_node_vec = stack; . } . 131,571 ( 0.02%) fn find_cycles_from_node

(&self, stack: &mut Vec, processor: &mut P, index: usize) . where . P: ObligationProcessor, . { . let node = &self.nodes[index]; 29,238 ( 0.01%) if node.state.get() == NodeState::Success { 516 ( 0.00%) match stack.iter().rposition(|&n| n == index) { . None => { . stack.push(index); 5,114 ( 0.00%) for &dep_index in node.dependents.iter() { 20,456 ( 0.00%) self.find_cycles_from_node(stack, processor, dep_index); . } . stack.pop(); . node.state.set(NodeState::Done); . } . Some(rpos) => { . // Cycle detected. . processor.process_backedge( . stack[rpos..].iter().map(|&i| &self.nodes[i].obligation), . PhantomData, . ); . } . } . } 116,952 ( 0.02%) } . . /// Compresses the vector, removing all popped nodes. This adjusts the . /// indices and hence invalidates any outstanding indices. `process_cycles` . /// must be run beforehand to remove any cycles on `Success` nodes. . #[inline(never)] 48,987 ( 0.01%) fn compress(&mut self, mut outcome_cb: impl FnMut(&O)) { 6,782 ( 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]; 67,007 ( 0.01%) match node.state.get() { . NodeState::Pending | NodeState::Waiting => { 4,852 ( 0.00%) if dead_nodes > 0 { 2,439 ( 0.00%) self.nodes.swap(index, index - dead_nodes); 4,065 ( 0.00%) node_rewrites[index] -= dead_nodes; . } . } . NodeState::Done => { . // This lookup can fail because the contents of . // `self.active_cache` are not guaranteed to match those of . // `self.nodes`. See the comment in `process_obligation` . // for more details. 38,117 ( 0.01%) if let Some((predicate, _)) = 29,283 ( 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); 19,522 ( 0.00%) node_rewrites[index] = orig_nodes_len; 19,522 ( 0.00%) dead_nodes += 1; . } . NodeState::Error => { . // We *intentionally* remove the node from the cache at this point. Otherwise . // tests must come up with a different type on every type error they . // check against. 12 ( 0.00%) self.active_cache.remove(&node.obligation.as_cache_key()); 8 ( 0.00%) self.insert_into_error_cache(index); 8 ( 0.00%) node_rewrites[index] = orig_nodes_len; 8 ( 0.00%) dead_nodes += 1; . } . NodeState::Success => unreachable!(), . } . } . . if dead_nodes > 0 { . // Remove the dead nodes and rewrite indices. 2,952 ( 0.00%) self.nodes.truncate(orig_nodes_len - dead_nodes); 1,476 ( 0.00%) self.apply_rewrites(&node_rewrites); . } . . node_rewrites.truncate(0); 27,128 ( 0.00%) self.reused_node_vec = node_rewrites; 54,256 ( 0.01%) } . . #[inline(never)] 13,284 ( 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,557 ( 0.00%) while let Some(dependent) = node.dependents.get_mut(i) { 2,996 ( 0.00%) let new_index = node_rewrites[*dependent]; 1,498 ( 0.00%) if new_index >= orig_nodes_len { . node.dependents.swap_remove(i); . if i == 0 && node.has_parent { . // We just removed the parent. . node.has_parent = false; . } . } else { 749 ( 0.00%) *dependent = new_index; 1,498 ( 0.00%) i += 1; . } . } . } . . // This updating of `self.active_cache` is necessary because the . // removal of nodes within `compress` can fail. See above. . self.active_cache.retain(|_predicate, index| { 10,940 ( 0.00%) let new_index = node_rewrites[*index]; 5,470 ( 0.00%) if new_index >= orig_nodes_len { . false . } else { 1,808 ( 0.00%) *index = new_index; . true . } . }); 11,808 ( 0.00%) } . } 185,948 ( 0.03%) -------------------------------------------------------------------------------- -- 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, . { 143,597 ( 0.02%) 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. 33 ( 0.00%) #[derive(Debug, Eq, PartialEq, Clone, Ord, PartialOrd)] 780 ( 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 2,156 ( 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> { 20 ( 0.00%) encoder.emit_enum(|encoder| match *self { . RealFileName::LocalPath(ref local_path) => { 80 ( 0.00%) encoder.emit_enum_variant("LocalPath", 0, 1, |encoder| { . encoder.emit_enum_variant_arg(true, |encoder| local_path.encode(encoder))?; . Ok(()) . }) . } . . RealFileName::Remapped { ref local_path, ref virtual_name } => encoder . .emit_enum_variant("Remapped", 1, 2, |encoder| { . // For privacy and build reproducibility, we must not embed host-dependant path in artifacts -- line 205 ---------------------------------------- -- line 224 ---------------------------------------- . p.as_ref().map(PathBuf::as_path) . } . } . } . . /// Returns the path suitable for reading from the file system on the local host, . /// if this information exists. . /// Avoid embedding this in build artifacts; see `remapped_path_if_available()` for that. 4 ( 0.00%) pub fn into_local_path(self) -> Option { 4 ( 0.00%) match self { . RealFileName::LocalPath(p) => Some(p), . RealFileName::Remapped { local_path: p, virtual_name: _ } => p, . } 6 ( 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 { 1,692 ( 0.00%) match self { . RealFileName::LocalPath(p) . | RealFileName::Remapped { local_path: _, virtual_name: p } => &p, . } 11 ( 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 { 11 ( 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> { 11 ( 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. 4,717 ( 0.00%) #[derive(Debug, Eq, PartialEq, Clone, Ord, PartialOrd, Hash)] 4,825 ( 0.00%) #[derive(Decodable, Encodable)] . pub enum FileName { . Real(RealFileName), . /// Call to `quote!`. 4 ( 0.00%) QuoteExpansion(u64), . /// Command line. . Anon(u64), . /// Hack in `src/librustc_ast/parse.rs`. . // FIXME(jseyfried) 1 ( 0.00%) MacroExpansion(u64), . ProcMacroSourceCode(u64), . /// Strings provided as `--cfg [cfgspec]` stored in a `crate_cfg`. . CfgSpec(u64), . /// Strings provided as crate attributes in the CLI. . CliCrateAttr(u64), . /// 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 { 77 ( 0.00%) fn from(p: PathBuf) -> Self { 22 ( 0.00%) assert!(!p.to_string_lossy().ends_with('>')); 66 ( 0.00%) FileName::Real(RealFileName::LocalPath(p)) 77 ( 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<'_> { 44 ( 0.00%) fn fmt(&self, fmt: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { . use FileName::*; 66 ( 0.00%) match *self.inner { . Real(ref name) => { 66 ( 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, ""), . } 55 ( 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::*; 808 ( 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. 11 ( 0.00%) pub fn prefer_local(&self) -> FileNameDisplay<'_> { . FileNameDisplay { inner: self, display_pref: FileNameDisplayPreference::Local } 22 ( 0.00%) } . . pub fn display(&self, display_pref: FileNameDisplayPreference) -> FileNameDisplay<'_> { . FileNameDisplay { inner: self, display_pref } . } . 5 ( 0.00%) pub fn macro_expansion_source_code(src: &str) -> FileName { . let mut hasher = StableHasher::new(); . src.hash(&mut hasher); 2 ( 0.00%) FileName::MacroExpansion(hasher.finish()) 5 ( 0.00%) } . . pub fn anon_source_code(src: &str) -> FileName { . let mut hasher = StableHasher::new(); . src.hash(&mut hasher); . FileName::Anon(hasher.finish()) . } . . pub fn proc_macro_source_code(src: &str) -> FileName { . let mut hasher = StableHasher::new(); . src.hash(&mut hasher); . FileName::ProcMacroSourceCode(hasher.finish()) . } . 20 ( 0.00%) pub fn cfg_spec_source_code(src: &str) -> FileName { . let mut hasher = StableHasher::new(); . src.hash(&mut hasher); 8 ( 0.00%) FileName::QuoteExpansion(hasher.finish()) 20 ( 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 { 1 ( 0.00%) pub lo: BytePos, 1 ( 0.00%) pub hi: BytePos, . /// Information about where the macro came from, if this piece of . /// code was created by a macro expansion. 3 ( 0.00%) pub ctxt: SyntaxContext, 1 ( 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 { 49,605 ( 0.01%) self.lo.0 == 0 && self.hi.0 == 0 . } . /// Returns `true` if `self` fully encloses `other`. . pub fn contains(self, other: Self) -> bool { 111 ( 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 { 28,112 ( 0.00%) fn partial_cmp(&self, rhs: &Self) -> Option { 21,084 ( 0.00%) PartialOrd::partial_cmp(&self.data(), &rhs.data()) 28,112 ( 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] 5,976 ( 0.00%) pub fn with_lo(self, lo: BytePos) -> Span { . self.data().with_lo(lo) 3,984 ( 0.00%) } . #[inline] 1,256 ( 0.00%) pub fn hi(self) -> BytePos { . self.data().hi 1,256 ( 0.00%) } . #[inline] 4,122 ( 0.00%) pub fn with_hi(self, hi: BytePos) -> Span { . self.data().with_hi(hi) 2,748 ( 0.00%) } . #[inline] . pub fn ctxt(self) -> SyntaxContext { . self.data_untracked().ctxt . } . #[inline] 1,405 ( 0.00%) pub fn with_ctxt(self, ctxt: SyntaxContext) -> Span { . self.data_untracked().with_ctxt(ctxt) 843 ( 0.00%) } . #[inline] . pub fn parent(self) -> Option { . self.data().parent . } . #[inline] 99 ( 0.00%) pub fn with_parent(self, ctxt: Option) -> Span { . self.data().with_parent(ctxt) 66 ( 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] 3 ( 0.00%) pub fn from_expansion(self) -> bool { . self.ctxt() != SyntaxContext::root() 2 ( 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] 33 ( 0.00%) pub fn shrink_to_hi(self) -> Span { . let span = self.data_untracked(); . span.with_lo(span.hi) 22 ( 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`. 333 ( 0.00%) pub fn contains(self, other: Span) -> bool { . let span = self.data(); . let other = other.data(); . span.contains(other) 222 ( 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 650 ---------------------------------------- . pub fn trim_start(self, other: Span) -> Option { . let span = self.data(); . let other = other.data(); . if span.hi > other.hi { Some(span.with_lo(cmp::max(span.lo, other.hi))) } else { None } . } . . /// Returns the source span -- this is either the supplied span, or the span for . /// the macro callsite that expanded to it. 10 ( 0.00%) pub fn source_callsite(self) -> Span { . let expn_data = self.ctxt().outer_expn_data(); 4 ( 0.00%) if !expn_data.is_root() { expn_data.call_site.source_callsite() } else { self } 8 ( 0.00%) } . . /// 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`. 240 ( 0.00%) pub fn find_ancestor_inside(mut self, outer: Span) -> Option { 120 ( 0.00%) while !outer.contains(self) { . self = self.parent_callsite()?; . } . Some(self) 264 ( 0.00%) } . . /// Edition of the crate from which this span came. 5,400 ( 0.00%) pub fn edition(self) -> edition::Edition { . self.ctxt().edition() 3,600 ( 0.00%) } . . #[inline] . pub fn rust_2015(self) -> bool { 1,375 ( 0.00%) self.edition() == edition::Edition::Edition2015 . } . . #[inline] . pub fn rust_2018(self) -> bool { 474 ( 0.00%) self.edition() >= edition::Edition::Edition2018 . } . . #[inline] . pub fn rust_2021(self) -> bool { 443 ( 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]`). 235 ( 0.00%) pub fn allows_unstable(self, feature: Symbol) -> bool { 47 ( 0.00%) self.ctxt() . .outer_expn_data() . .allow_internal_unstable . .map_or(false, |features| features.iter().any(|&f| f == feature)) 188 ( 0.00%) } . . /// Checks if this span arises from a compiler desugaring of kind `kind`. 1,575 ( 0.00%) pub fn is_desugaring(self, kind: DesugaringKind) -> bool { 1,350 ( 0.00%) match self.ctxt().outer_expn_data().kind { . ExpnKind::Desugaring(k) => k == kind, . _ => false, . } 1,125 ( 0.00%) } . . /// Returns the compiler desugaring that created this span, or `None` . /// if this span is not from a desugaring. 25 ( 0.00%) pub fn desugaring_kind(self) -> Option { 30 ( 0.00%) match self.ctxt().outer_expn_data().kind { . ExpnKind::Desugaring(k) => Some(k), . _ => None, . } 20 ( 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 . /// ^^^^^^^^^^^^^^^^^^^^ . /// ``` 116,182 ( 0.02%) pub fn to(self, end: Span) -> Span { . let span_data = self.data(); . let end_data = end.data(); . // FIXME(jseyfried): `self.ctxt` should always equal `end.ctxt` here (cf. issue #23480). . // Return the macro span on its own to avoid weird diagnostic output. It is preferable to . // have an incomplete span than a completely nonsensical one. 20,994 ( 0.00%) if span_data.ctxt != end_data.ctxt { 130 ( 0.00%) if span_data.ctxt == SyntaxContext::root() { . return end; 107 ( 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 }, 73,024 ( 0.01%) if span_data.parent == end_data.parent { span_data.parent } else { None }, . ) 95,058 ( 0.02%) } . . /// Returns a `Span` between the end of `self` to the beginning of `end`. . /// . /// ```text . /// ____ ___ . /// self lorem ipsum end . /// ^^^^^^^^^^^^^ . /// ``` 957 ( 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 }, 609 ( 0.00%) if span.parent == end.parent { span.parent } else { None }, . ) 696 ( 0.00%) } . . /// Returns a `Span` from the beginning of `self` until the beginning of `end`. . /// . /// ```text . /// ____ ___ . /// self lorem ipsum end . /// ^^^^^^^^^^^^^^^^^ . /// ``` 1,111 ( 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. 202 ( 0.00%) if span_data.ctxt != end_data.ctxt { . if span_data.ctxt == SyntaxContext::root() { . return end; . } else if end_data.ctxt == SyntaxContext::root() { . return self; . } . // Both spans fall within a macro. . // FIXME(estebank): check if it is the *same* macro. . } . Span::new( . span_data.lo, . end_data.lo, . if end_data.ctxt == SyntaxContext::root() { end_data.ctxt } else { span_data.ctxt }, 707 ( 0.00%) if span_data.parent == end_data.parent { span_data.parent } else { None }, . ) 909 ( 0.00%) } . 77 ( 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, . ) 49 ( 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 { 292 ( 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 { 10 ( 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). 1,812 ( 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)) 1,057 ( 0.00%) } . . #[inline] . pub fn apply_mark(self, expn_id: ExpnId, transparency: Transparency) -> Span { . let span = self.data(); 1,305 ( 0.00%) span.with_ctxt(span.ctxt.apply_mark(expn_id, transparency)) . } . . #[inline] . pub fn remove_mark(&mut self) -> ExpnId { . let mut span = self.data(); . let mark = span.ctxt.remove_mark(); . *self = Span::new(span.lo, span.hi, span.ctxt, span.parent); . mark -- line 897 ---------------------------------------- -- line 901 ---------------------------------------- . pub fn adjust(&mut self, expn_id: ExpnId) -> Option { . let mut span = self.data(); . let mark = span.ctxt.adjust(expn_id); . *self = Span::new(span.lo, span.hi, span.ctxt, span.parent); . mark . } . . #[inline] 20,196 ( 0.00%) pub fn normalize_to_macros_2_0_and_adjust(&mut self, expn_id: ExpnId) -> Option { 13,464 ( 0.00%) let mut span = self.data(); 11,048 ( 0.00%) let mark = span.ctxt.normalize_to_macros_2_0_and_adjust(expn_id); 20,196 ( 0.00%) *self = Span::new(span.lo, span.hi, span.ctxt, span.parent); . mark 22,268 ( 0.00%) } . . #[inline] . pub fn glob_adjust(&mut self, expn_id: ExpnId, glob_span: Span) -> Option> { 6 ( 0.00%) let mut span = self.data(); 9 ( 0.00%) let mark = span.ctxt.glob_adjust(expn_id, glob_span); 24 ( 0.00%) *self = Span::new(span.lo, span.hi, span.ctxt, span.parent); . mark . } . . #[inline] 144 ( 0.00%) pub fn reverse_glob_adjust( . &mut self, . expn_id: ExpnId, . glob_span: Span, . ) -> Option> { 128 ( 0.00%) let mut span = self.data(); 144 ( 0.00%) let mark = span.ctxt.reverse_glob_adjust(expn_id, glob_span); 272 ( 0.00%) *self = Span::new(span.lo, span.hi, span.ctxt, span.parent); . mark 160 ( 0.00%) } . . #[inline] 13,712 ( 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()) 11,998 ( 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 1048 ---------------------------------------- . . impl MultiSpan { . #[inline] . pub fn new() -> MultiSpan { . MultiSpan { primary_spans: vec![], span_labels: vec![] } . } . . pub fn from_span(primary_span: Span) -> MultiSpan { 945 ( 0.00%) MultiSpan { primary_spans: vec![primary_span], span_labels: vec![] } . } . . pub fn from_spans(mut vec: Vec) -> MultiSpan { . vec.sort(); 15 ( 0.00%) MultiSpan { primary_spans: vec, span_labels: vec![] } . } . . pub fn push_span_label(&mut self, span: Span, label: String) { . self.span_labels.push((span, label)); . } . . /// Selects the first primary span (if any). . pub fn primary_span(&self) -> Option { . self.primary_spans.first().cloned() 189 ( 0.00%) } . . /// Returns all primary spans. . pub fn primary_spans(&self) -> &[Span] { . &self.primary_spans 3 ( 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 { 945 ( 0.00%) fn from(span: Span) -> MultiSpan { . MultiSpan::from_span(span) 945 ( 0.00%) } . } . . impl From> for MultiSpan { 15 ( 0.00%) fn from(spans: Vec) -> MultiSpan { 12 ( 0.00%) MultiSpan::from_spans(spans) 15 ( 0.00%) } . } . . /// Identifies an offset of a multi-byte character in a `SourceFile`. 44 ( 0.00%) #[derive(Copy, Clone, Encodable, Decodable, Eq, PartialEq, Debug)] . pub struct MultiByteChar { . /// The absolute offset of the character in the `SourceMap`. . pub pos: BytePos, . /// The number of bytes, `>= 2`. . pub bytes: u8, . } . . /// Identifies an offset of a non-narrow character in a `SourceFile`. 286 ( 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), . } . . impl NonNarrowChar { . fn new(pos: BytePos, width: usize) -> Self { 4 ( 0.00%) match width { . 0 => NonNarrowChar::ZeroWidth(pos), . 2 => NonNarrowChar::Wide(pos), . 4 => NonNarrowChar::Tab(pos), . _ => panic!("width {} given for non-narrow character", width), . } . } . . /// Returns the absolute offset of the character in the `SourceMap`. -- line 1188 ---------------------------------------- -- line 1201 ---------------------------------------- . } . } . } . . impl Add for NonNarrowChar { . type Output = Self; . . fn add(self, rhs: BytePos) -> Self { 466 ( 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; . 134 ( 0.00%) fn sub(self, rhs: BytePos) -> Self { 466 ( 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), . } 402 ( 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, . } . 30 ( 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> { 80 ( 0.00%) match self { . ExternalSource::Foreign { kind: ExternalSourceKind::Present(ref src), .. } => Some(src), . _ => None, . } . } . } . . #[derive(Debug)] . pub struct OffsetOverflowError; . 786 ( 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. 60 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, Debug)] 1,572 ( 0.00%) #[derive(HashStable_Generic, Encodable, Decodable)] . pub struct SourceFileHash { . pub kind: SourceFileHashAlgorithm, . value: [u8; 32], . } . . impl SourceFileHash { . pub fn new(kind: SourceFileHashAlgorithm, src: &str) -> SourceFileHash { . let mut hash = SourceFileHash { kind, value: Default::default() }; . let len = hash.hash_len(); . let value = &mut hash.value[..len]; . let data = src.as_bytes(); . match kind { . SourceFileHashAlgorithm::Md5 => { 48 ( 0.00%) value.copy_from_slice(&Md5::digest(data)); . } . SourceFileHashAlgorithm::Sha1 => { . value.copy_from_slice(&Sha1::digest(data)); . } . SourceFileHashAlgorithm::Sha256 => { . value.copy_from_slice(&Sha256::digest(data)); . } . } -- line 1321 ---------------------------------------- -- line 1329 ---------------------------------------- . . /// The bytes of the hash. . pub fn hash_bytes(&self) -> &[u8] { . let len = self.hash_len(); . &self.value[..len] . } . . fn hash_len(&self) -> usize { 48 ( 0.00%) match self.kind { . SourceFileHashAlgorithm::Md5 => 16, . SourceFileHashAlgorithm::Sha1 => 20, . SourceFileHashAlgorithm::Sha256 => 32, . } . } . } . . /// A single source in the [`SourceMap`]. 580 ( 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. 10 ( 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. 10 ( 0.00%) pub name_hash: u128, . /// Indicates which crate this `SourceFile` was imported from. 10 ( 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)?; . 40 ( 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 { 20 ( 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); . 20 ( 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))?; 30 ( 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))?; 110 ( 0.00%) s.emit_struct_field("cnum", false, |s| self.cnum.encode(s)) . }) . } . } . . impl Decodable for SourceFile { 3,537 ( 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); 393 ( 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 { 685,652 ( 0.12%) 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)); 786 ( 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)); 4,323 ( 0.00%) SourceFile { 3,144 ( 0.00%) name, . start_pos, . end_pos, . src: None, 1,572 ( 0.00%) src_hash, . // Unused - the metadata decoder will construct . // a new SourceFile, filling in `external_src` properly . external_src: Lock::new(ExternalSource::Unneeded), 1,572 ( 0.00%) lines, 1,572 ( 0.00%) multibyte_chars, 1,572 ( 0.00%) non_narrow_chars, 1,572 ( 0.00%) normalized_pos, . name_hash, . cnum, . } . }) 3,537 ( 0.00%) } . } . . impl fmt::Debug for SourceFile { . fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result { . write!(fmt, "SourceFile({:?})", self.name) . } . } . . impl SourceFile { 176 ( 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); 48 ( 0.00%) let normalized_pos = normalize_src(&mut src, start_pos); . . let name_hash = { . let mut hasher: StableHasher = StableHasher::new(); 32 ( 0.00%) name.hash(&mut hasher); . hasher.finish::() . }; 32 ( 0.00%) let end_pos = start_pos.to_usize() + src.len(); 48 ( 0.00%) assert!(end_pos <= u32::MAX as usize); . 192 ( 0.00%) let (lines, multibyte_chars, non_narrow_chars) = 32 ( 0.00%) analyze_source_file::analyze_source_file(&src, start_pos); . 272 ( 0.00%) SourceFile { . name, . src: Some(Lrc::new(src)), 176 ( 0.00%) src_hash, . external_src: Lock::new(ExternalSource::Unneeded), . start_pos, . end_pos: Pos::from_usize(end_pos), 64 ( 0.00%) lines, 64 ( 0.00%) multibyte_chars, 64 ( 0.00%) non_narrow_chars, 64 ( 0.00%) normalized_pos, . name_hash, . cnum: LOCAL_CRATE, . } 144 ( 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. 1,120 ( 0.00%) pub fn add_external_src(&self, get_src: F) -> bool . where . F: FnOnce() -> Option, . { 160 ( 0.00%) if matches!( 320 ( 0.00%) *self.external_src.borrow(), . ExternalSource::Foreign { kind: ExternalSourceKind::AbsentOk, .. } . ) { . let src = get_src(); . let mut external_src = self.external_src.borrow_mut(); . // Check that no-one else have provided the source while we were getting it . if let ExternalSource::Foreign { . kind: src_kind @ ExternalSourceKind::AbsentOk, .. . } = &mut *external_src -- line 1582 ---------------------------------------- -- line 1592 ---------------------------------------- . *src_kind = ExternalSourceKind::AbsentErr; . } . . false . } else { . self.src.is_some() || external_src.get_source().is_some() . } . } else { 160 ( 0.00%) self.src.is_some() || self.external_src.borrow().get_source().is_some() . } 1,440 ( 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() 404 ( 0.00%) } . . pub fn is_imported(&self) -> bool { . self.src.is_none() 3,094 ( 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 { 2,936 ( 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 { 6,958 ( 0.00%) if self.is_empty() { . return self.start_pos..self.end_pos; . } . 5,008 ( 0.00%) assert!(line_index < self.lines.len()); 6,822 ( 0.00%) if line_index == (self.lines.len() - 1) { 44 ( 0.00%) self.lines[line_index]..self.end_pos . } else { 4,514 ( 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`. 4 ( 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; . 12 ( 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; . } . } . 24 ( 0.00%) assert!(self.start_pos.to_u32() + total_extra_bytes <= bpos.to_u32()); 20 ( 0.00%) CharPos(bpos.to_usize() - self.start_pos.to_usize() - total_extra_bytes as usize) 8 ( 0.00%) } . . /// Looks up the file's (1-based) line number and (0-based `CharPos`) column offset, for a . /// given `BytePos`. 14 ( 0.00%) pub fn lookup_file_pos(&self, pos: BytePos) -> (usize, CharPos) { 4 ( 0.00%) let chpos = self.bytepos_to_file_charpos(pos); 1 ( 0.00%) match self.lookup_line(pos) { . Some(a) => { . let line = a + 1; // Line numbers start at 1 2 ( 0.00%) let linebpos = self.lines[a]; 4 ( 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); 2 ( 0.00%) assert!(chpos >= linechpos); . (line, col) . } . None => (0, chpos), . } 16 ( 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`. 16 ( 0.00%) pub fn lookup_file_pos_with_col_display(&self, pos: BytePos) -> (usize, CharPos, usize) { 6 ( 0.00%) let (line, col_or_chpos) = self.lookup_file_pos(pos); 4 ( 0.00%) if line > 0 { . let col = col_or_chpos; 2 ( 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(); 10 ( 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) . } 14 ( 0.00%) } . } . . /// Normalizes the source code and records the normalizations. 160 ( 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 144 ( 0.00%) } . . /// Removes UTF-8 BOM, if any. . fn remove_bom(src: &mut String, normalized_pos: &mut Vec) { 16 ( 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) { 16 ( 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])* 17,567 ( 0.00%) $vis struct $ident($inner_vis $inner_ty); . . impl Pos for $ident { . #[inline(always)] . fn from_usize(n: usize) -> $ident { 1,535 ( 0.00%) $ident(n as $inner_ty) . } . . #[inline(always)] . fn to_usize(&self) -> usize { 35,842 ( 0.01%) self.0 as usize . } . . #[inline(always)] . fn from_u32(n: u32) -> $ident { . $ident(n as $inner_ty) . } . . #[inline(always)] -- line 1903 ---------------------------------------- -- line 1906 ---------------------------------------- . } . } . . impl Add for $ident { . type Output = $ident; . . #[inline(always)] . fn add(self, rhs: $ident) -> $ident { 1,180,721 ( 0.20%) $ident(self.0 + rhs.0) . } . } . . impl Sub for $ident { . type Output = $ident; . . #[inline(always)] . fn sub(self, rhs: $ident) -> $ident { 810,810 ( 0.14%) $ident(self.0 - rhs.0) . } . } . )* . }; . } . . impl_pos! { . /// A byte offset. -- line 1931 ---------------------------------------- -- line 1939 ---------------------------------------- . /// Because of multibyte UTF-8 characters, a byte offset . /// is not equivalent to a character offset. The [`SourceMap`] will convert [`BytePos`] . /// values to `CharPos` values as necessary. . #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Debug)] . pub struct CharPos(pub usize); . } . . impl Encodable for BytePos { 10 ( 0.00%) fn encode(&self, s: &mut S) -> Result<(), S::Error> { . s.emit_u32(self.0) 12 ( 0.00%) } . } . . impl Decodable for BytePos { . fn decode(d: &mut D) -> BytePos { 97,820 ( 0.02%) 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 { 44 ( 0.00%) pub fn new(start: usize, end: usize) -> InnerSpan { . InnerSpan { start, end } 22 ( 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. 114,086 ( 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; . 24,425 ( 0.00%) if !ctx.hash_spans() { . return; . } . 89,661 ( 0.02%) let span = self.data_untracked(); 24,513 ( 0.00%) span.ctxt.hash_stable(ctx, hasher); 48,894 ( 0.01%) span.parent.hash_stable(ctx, hasher); . 32,851 ( 0.01%) if span.is_dummy() { . Hash::hash(&TAG_INVALID_SPAN, hasher); . return; . } . 32,086 ( 0.01%) if let Some(parent) = span.parent { . let def_span = ctx.def_span(parent).data_untracked(); . if def_span.contains(span) { . // This span is enclosed in a definition: only hash the relative position. . Hash::hash(&TAG_RELATIVE_SPAN, hasher); . (span.lo - def_span.lo).to_u32().hash_stable(ctx, hasher); . (span.hi - def_span.lo).to_u32().hash_stable(ctx, hasher); . return; . } . } . . // If this is not an empty or invalid span, we want to hash the last . // position that belongs to it, as opposed to hashing the first . // position past it. 64,172 ( 0.01%) let (file, line_lo, col_lo, line_hi, col_hi) = match ctx.span_data_to_lines_and_cols(&span) . { 32,086 ( 0.01%) Some(pos) => pos, . None => { . Hash::hash(&TAG_INVALID_SPAN, hasher); . return; . } . }; . . Hash::hash(&TAG_VALID_SPAN, hasher); . // We truncate the stable ID hash and line and column numbers. The chances -- line 2129 ---------------------------------------- -- line 2134 ---------------------------------------- . // hash only the length, for example, then two otherwise equal spans with . // different end locations will have the same hash. This can cause a problem . // during incremental compilation wherein a previous result for a query that . // depends on the end location of a span will be incorrectly reused when the . // end location of the span it depends on has changed (see issue #74890). A . // similar analysis applies if some query depends specifically on the length . // of the span, but we only hash the end location. So hash both. . 16,043 ( 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; 16,043 ( 0.00%) let len = (span.hi - span.lo).0; . Hash::hash(&col_line, hasher); . Hash::hash(&len, hasher); 130,384 ( 0.02%) } . } 1,112,638 ( 0.19%) -------------------------------------------------------------------------------- -- 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 { 74,424 ( 0.01%) self.obligation.param_env.and(self.obligation.predicate) . } . } . . /// The fulfillment context is used to drive trait resolution. It . /// consists of a list of obligations that must be (eventually) . /// satisfied. The job is to track which are satisfied, which yielded . /// errors, and which are still pending. At any point, users can call . /// `select_where_possible`, and the fulfillment context will try to do -- line 49 ---------------------------------------- -- line 79 ---------------------------------------- . // outside of any snapshot, so any use of it inside a snapshot . // will lead to trouble and therefore is checked against, but . // other fulfillment contexts sometimes do live inside of . // a snapshot (they don't *straddle* a snapshot, so there . // is no trouble there). . usable_in_snapshot: bool, . } . 40 ( 0.00%) #[derive(Clone, Debug)] . pub struct PendingPredicateObligation<'tcx> { . pub obligation: PredicateObligation<'tcx>, . // This is far more often read than modified, meaning that we . // should mostly optimize for reading speed, while modifying is not as relevant. . // . // For whatever reason using a boxed slice is slower than using a `Vec` here. . pub stalled_on: Vec>, . } . . // `PendingPredicateObligation` is used a lot. Make sure it doesn't unintentionally get bigger. . #[cfg(all(target_arch = "x86_64", target_pointer_width = "64"))] . static_assert_size!(PendingPredicateObligation<'_>, 72); . . impl<'a, 'tcx> FulfillmentContext<'tcx> { . /// Creates a new fulfillment context. 1,337 ( 0.00%) pub fn new() -> FulfillmentContext<'tcx> { 16,438 ( 0.00%) FulfillmentContext { 2,247 ( 0.00%) predicates: ObligationForest::new(), . relationships: FxHashMap::default(), . register_region_obligations: true, . usable_in_snapshot: false, . } 1,337 ( 0.00%) } . . pub fn new_in_snapshot() -> FulfillmentContext<'tcx> { 57 ( 0.00%) FulfillmentContext { 19 ( 0.00%) predicates: ObligationForest::new(), . relationships: FxHashMap::default(), . register_region_obligations: true, . usable_in_snapshot: true, . } . } . . pub fn new_ignoring_regions() -> FulfillmentContext<'tcx> { 4,768 ( 0.00%) FulfillmentContext { 1,192 ( 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> { 15,734 ( 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<_, _> = 65,660 ( 0.01%) self.predicates.process_obligations(&mut FulfillProcessor { . selcx, 9,380 ( 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. 18,760 ( 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. 418 ( 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![]; 171 ( 0.00%) let normalized_ty = project::normalize_projection_type( . &mut selcx, . param_env, . projection_ty, 95 ( 0.00%) cause, . 0, . &mut obligations, . ); . self.register_predicate_obligations(infcx, obligations); . . debug!(?normalized_ty); . . normalized_ty . } . 49,122 ( 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. 24,561 ( 0.00%) let obligation = infcx.resolve_vars_if_possible(obligation); . . debug!(?obligation, "register_predicate_obligation"); . 49,122 ( 0.01%) assert!(!infcx.is_in_snapshot() || self.usable_in_snapshot); . 24,561 ( 0.00%) super::relationships::update(self, infcx, &obligation); . . self.predicates . .register_obligation(PendingPredicateObligation { obligation, stalled_on: vec![] }); 40,935 ( 0.01%) } . 42,176 ( 0.01%) fn select_all_or_error(&mut self, infcx: &InferCtxt<'_, 'tcx>) -> Vec> { . { 5,272 ( 0.00%) let errors = self.select_where_possible(infcx); 5,272 ( 0.00%) if !errors.is_empty() { 15 ( 0.00%) return errors; . } . } . 26,345 ( 0.00%) self.predicates.to_errors(CodeAmbiguity).into_iter().map(to_fulfillment_error).collect() 36,904 ( 0.01%) } . 78,670 ( 0.01%) fn select_where_possible( . &mut self, . infcx: &InferCtxt<'_, 'tcx>, . ) -> Vec> { . let mut selcx = SelectionContext::new(infcx); . self.select(&mut selcx) 70,803 ( 0.01%) } . 24 ( 0.00%) fn pending_obligations(&self) -> Vec> { . self.predicates.map_pending_obligations(|o| o.obligation.clone()) 32 ( 0.00%) } . . fn relationships(&mut self) -> &mut FxHashMap { 6 ( 0.00%) &mut self.relationships 6 ( 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. 66,888 ( 0.01%) 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 => { 16,560 ( 0.00%) let infer_var = pending_obligation.stalled_on[0]; 5,520 ( 0.00%) 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. 2,223 ( 0.00%) (|| { 4,266 ( 0.00%) for &infer_var in &pending_obligation.stalled_on { . if self.selcx.infcx().ty_or_const_infer_var_changed(infer_var) { . return true; . } . } . false . })() . } . }; -- line 306 ---------------------------------------- -- line 309 ---------------------------------------- . 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; . } . 31,317 ( 0.01%) self.progress_changed_obligations(pending_obligation) . } . . fn process_backedge<'c, I>( . &mut self, . cycle: I, . _marker: PhantomData<&'c PendingPredicateObligation<'tcx>>, . ) where . I: Clone + Iterator>, -- line 325 ---------------------------------------- -- line 333 ---------------------------------------- . } . } . . 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)] 104,390 ( 0.02%) fn progress_changed_obligations( . &mut self, . pending_obligation: &mut PendingPredicateObligation<'tcx>, . ) -> ProcessResult, FulfillmentErrorCode<'tcx>> { . pending_obligation.stalled_on.truncate(0); . . let obligation = &mut pending_obligation.obligation; . 31,317 ( 0.01%) if obligation.predicate.has_infer_types_or_consts() { 1,750 ( 0.00%) obligation.predicate = 5,250 ( 0.00%) self.selcx.infcx().resolve_vars_if_possible(obligation.predicate); . } . . debug!(?obligation, ?obligation.cause, "process_obligation"); . . let infcx = self.selcx.infcx(); . 17,378 ( 0.00%) let binder = obligation.predicate.kind(); 73,073 ( 0.01%) match binder.no_bound_vars() { 3,333 ( 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)); . 756 ( 0.00%) self.process_trait_obligation( . obligation, 2,268 ( 0.00%) trait_obligation, . &mut pending_obligation.stalled_on, . ) . } . ty::PredicateKind::Projection(data) => { . let project_obligation = obligation.with(binder.rebind(data)); . 456 ( 0.00%) self.process_projection_obligation( . obligation, 1,368 ( 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)); . 35,285 ( 0.01%) self.process_trait_obligation( . obligation, 155,254 ( 0.03%) trait_obligation, . &mut pending_obligation.stalled_on, . ) . } . . ty::PredicateKind::RegionOutlives(data) => { 756 ( 0.00%) match infcx.region_outlives_predicate(&obligation.cause, Binder::dummy(data)) { 504 ( 0.00%) Ok(()) => ProcessResult::Changed(vec![]), . Err(_) => ProcessResult::Error(CodeSelectionError(Unimplemented)), . } . } . . ty::PredicateKind::TypeOutlives(ty::OutlivesPredicate(t_a, r_b)) => { 1,468 ( 0.00%) if self.register_region_obligations { 3,670 ( 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)); . 1,590 ( 0.00%) self.process_projection_obligation( . obligation, 4,770 ( 0.00%) project_obligation, . &mut pending_obligation.stalled_on, . ) . } . . ty::PredicateKind::ObjectSafe(trait_def_id) => { 16 ( 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) => { 9 ( 0.00%) match self.selcx.infcx().closure_kind(closure_substs) { . Some(closure_kind) => { 18 ( 0.00%) if closure_kind.extends(kind) { . ProcessResult::Changed(vec![]) . } else { . ProcessResult::Error(CodeSelectionError(Unimplemented)) . } . } . None => ProcessResult::Unchanged, . } . } . . ty::PredicateKind::WellFormed(arg) => { 13,027 ( 0.00%) match wf::obligations( . self.selcx.infcx(), 3,722 ( 0.00%) obligation.param_env, 3,722 ( 0.00%) obligation.cause.body_id, 5,583 ( 0.00%) obligation.recursion_depth + 1, . arg, . obligation.cause.span, . ) { . None => { 676 ( 0.00%) pending_obligation.stalled_on = 1,183 ( 0.00%) vec![TyOrConstInferVar::maybe_from_generic_arg(arg).unwrap()]; 338 ( 0.00%) ProcessResult::Unchanged . } 5,076 ( 0.00%) Some(os) => ProcessResult::Changed(mk_pending(os)), . } . } . . ty::PredicateKind::Subtype(subtype) => { 216 ( 0.00%) match self.selcx.infcx().subtype_predicate( . &obligation.cause, . obligation.param_env, . Binder::dummy(subtype), . ) { . None => { . // None means that both are unresolved. 90 ( 0.00%) pending_obligation.stalled_on = vec![ 18 ( 0.00%) TyOrConstInferVar::maybe_from_ty(subtype.a).unwrap(), 36 ( 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) => { 48 ( 0.00%) match self.selcx.infcx().coerce_predicate( . &obligation.cause, . obligation.param_env, . Binder::dummy(coerce), . ) { . None => { . // None means that both are unresolved. 5 ( 0.00%) pending_obligation.stalled_on = vec![ 1 ( 0.00%) TyOrConstInferVar::maybe_from_ty(coerce.a).unwrap(), 2 ( 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") . } . }, . } 93,951 ( 0.02%) } . 137,674 ( 0.02%) #[instrument(level = "debug", skip(self, obligation, stalled_on))] . fn process_trait_obligation( . &mut self, . obligation: &PredicateObligation<'tcx>, . trait_obligation: TraitObligation<'tcx>, . stalled_on: &mut Vec>, . ) -> ProcessResult, FulfillmentErrorCode<'tcx>> { 7,246 ( 0.00%) let infcx = self.selcx.infcx(); 21,738 ( 0.00%) if obligation.predicate.is_global() { . // no type variables present, can use evaluation for better caching. . // FIXME: consider caching errors too. 860 ( 0.00%) if infcx.predicate_must_hold_considering_regions(obligation) { . debug!( . "selecting trait at depth {} evaluated to holds", . obligation.recursion_depth . ); 856 ( 0.00%) return ProcessResult::Changed(vec![]); . } . } . 47,718 ( 0.01%) match self.selcx.select(&trait_obligation) { . Ok(Some(impl_source)) => { . debug!("selecting trait at depth {} yielded Ok(Some)", obligation.recursion_depth); 115,020 ( 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, 424 ( 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 . ); . 424 ( 0.00%) ProcessResult::Unchanged . } . Err(selection_err) => { . debug!("selecting trait at depth {} yielded Err", obligation.recursion_depth); . 56 ( 0.00%) ProcessResult::Error(CodeSelectionError(selection_err)) . } . } . } . 4,752 ( 0.00%) fn process_projection_obligation( . &mut self, . obligation: &PredicateObligation<'tcx>, . project_obligation: PolyProjectionObligation<'tcx>, . stalled_on: &mut Vec>, . ) -> ProcessResult, FulfillmentErrorCode<'tcx>> { 432 ( 0.00%) let tcx = self.selcx.tcx(); . 1,296 ( 0.00%) if obligation.predicate.is_global() { . // no type variables present, can use evaluation for better caching. . // FIXME: consider caching errors too. . if self.selcx.infcx().predicate_must_hold_considering_regions(obligation) { . if let Some(key) = ProjectionCacheKey::from_poly_projection_predicate( . &mut self.selcx, . project_obligation.predicate, . ) { . // If `predicate_must_hold_considering_regions` succeeds, then we've -- line 719 ---------------------------------------- -- line 727 ---------------------------------------- . .complete(key, EvaluationResult::EvaluatedToOk); . } . return ProcessResult::Changed(vec![]); . } else { . tracing::debug!("Does NOT hold: {:?}", obligation); . } . } . 3,024 ( 0.00%) match project::poly_project_and_unify_type(self.selcx, &project_obligation) { . Ok(Ok(Some(os))) => ProcessResult::Changed(mk_pending(os)), . Ok(Ok(None)) => { . stalled_on.clear(); . stalled_on.extend(substs_infer_vars( . self.selcx, 62 ( 0.00%) project_obligation.predicate.map_bound(|pred| pred.projection_ty.substs), . )); 62 ( 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)), . } 3,456 ( 0.00%) } . } . . /// Returns the set of inference variables contained in `substs`. . fn substs_infer_vars<'a, 'tcx>( . selcx: &mut SelectionContext<'a, 'tcx>, . substs: ty::Binder<'tcx, SubstsRef<'tcx>>, . ) -> impl Iterator> { . selcx . .infcx() . .resolve_vars_if_possible(substs) . .skip_binder() // ok because this check doesn't care about regions . .iter() . .filter(|arg| arg.has_infer_types_or_consts()) . .flat_map(|arg| { 2,830 ( 0.00%) let mut walker = arg.walk(); 5,479 ( 0.00%) while let Some(c) = walker.next() { 670 ( 0.00%) if !c.has_infer_types_or_consts() { . walker.visited.remove(&c); 54 ( 0.00%) walker.skip_current_subtree(); . } . } . walker.visited.into_iter() . }) . .filter_map(TyOrConstInferVar::maybe_from_generic_arg) . } . . fn to_fulfillment_error<'tcx>( . error: Error, FulfillmentErrorCode<'tcx>>, . ) -> FulfillmentError<'tcx> { . let mut iter = error.backtrace.into_iter(); 4 ( 0.00%) let obligation = iter.next().unwrap().obligation; . // The root obligation is the last item in the backtrace - if there's only . // one item, then it's the same as the main obligation . let root_obligation = iter.next_back().map_or_else(|| obligation.clone(), |e| e.obligation); 120 ( 0.00%) FulfillmentError::new(obligation, error.error, root_obligation) . } 138,465 ( 0.02%) -------------------------------------------------------------------------------- -- 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)] 554,243 ( 0.10%) pub fn rustc_entry(&mut self, key: K) -> RustcEntry<'_, K, V, A> { . let hash = make_insert_hash(&self.hash_builder, &key); 692 ( 0.00%) if let Some(elem) = self.table.find(hash, |q| q.0.eq(&key)) { 40,764 ( 0.01%) RustcEntry::Occupied(RustcOccupiedEntry { 6,502 ( 0.00%) key: Some(key), . elem, . table: &mut self.table, . }) . } else { . // Ideally we would put this in VacantEntry::insert, but Entry is not . // generic over the BuildHasher and adding a generic parameter would be . // a breaking change. . self.reserve(1); . 159,140 ( 0.03%) RustcEntry::Vacant(RustcVacantEntry { . hash, 41,310 ( 0.01%) key, . table: &mut self.table, . }) . } 455,395 ( 0.08%) } . } . . /// 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 { 2,524 ( 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)] 2,120 ( 0.00%) pub fn insert(self, value: V) -> &'a mut V { . unsafe { 14,527 ( 0.00%) let bucket = self.table.insert_no_grow(self.hash, (self.key, value)); 1,599 ( 0.00%) &mut bucket.as_mut().1 . } 2,860 ( 0.00%) } . . /// Sets the value of the entry with the RustcVacantEntry's key, . /// and returns a RustcOccupiedEntry. . /// . /// # Examples . /// . /// ``` . /// use hashbrown::HashMap; -- line 589 ---------------------------------------- 130,883 ( 0.02%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_serialize/src/leb128.rs -------------------------------------------------------------------------------- Ir -- line 17 ---------------------------------------- . #[inline] . pub fn $fn_name( . out: &mut [::std::mem::MaybeUninit; max_leb128_len!($int_ty)], . mut value: $int_ty, . ) -> &[u8] { . let mut i = 0; . . loop { 76,402 ( 0.01%) if value < 0x80 { . unsafe { 35,019 ( 0.01%) *out.get_unchecked_mut(i).as_mut_ptr() = value as u8; . } . 47,461 ( 0.01%) i += 1; . break; . } else { . unsafe { 38,324 ( 0.01%) *out.get_unchecked_mut(i).as_mut_ptr() = ((value & 0x7f) | 0x80) as u8; . } . 15,347 ( 0.00%) value >>= 7; . i += 1; . } . } . . unsafe { ::std::mem::MaybeUninit::slice_assume_init_ref(&out.get_unchecked(..i)) } . } . }; . } -- line 45 ---------------------------------------- -- line 53 ---------------------------------------- . macro_rules! impl_read_unsigned_leb128 { . ($fn_name:ident, $int_ty:ty) => { . #[inline] . pub fn $fn_name(slice: &[u8], position: &mut usize) -> $int_ty { . // The first iteration of this loop is unpeeled. This is a . // performance win because this code is hot and integer values less . // than 128 are very common, typically occurring 50-80% or more of . // the time, even for u64 and u128. 1,123,452 ( 0.19%) let byte = slice[*position]; 561,726 ( 0.10%) *position += 1; 561,726 ( 0.10%) if (byte & 0x80) == 0 { 330 ( 0.00%) return byte as $int_ty; . } 786 ( 0.00%) let mut result = (byte & 0x7F) as $int_ty; . let mut shift = 7; . loop { 390,249 ( 0.07%) let byte = slice[*position]; 255,641 ( 0.04%) *position += 1; 260,166 ( 0.05%) if (byte & 0x80) == 0 { 200,166 ( 0.03%) result |= (byte as $int_ty) << shift; . return result; . } else { . result |= ((byte & 0x7F) as $int_ty) << shift; . } . shift += 7; . } . } . }; -- line 80 ---------------------------------------- 431,954 ( 0.07%) -------------------------------------------------------------------------------- -- 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] { 4,534 ( 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] { 171,908 ( 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 126 ( 0.00%) self.cap = 0; 252 ( 0.00%) self.buf = unsafe { NonNull::new_unchecked(RawVec::NEW.ptr()) }; 136 ( 0.00%) self.ptr = self.buf.as_ptr(); 233 ( 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 { 446,335 ( 0.08%) if self.ptr as *const _ == self.end { 29,309 ( 0.01%) 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; 57,172 ( 0.01%) self.ptr = unsafe { self.ptr.offset(1) }; . 12,759 ( 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 { 25,190 ( 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 { 7,925 ( 0.00%) self.end = unsafe { self.end.offset(-1) }; . 177 ( 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 { 533,387 ( 0.09%) fn drop(&mut self) { . struct DropGuard<'a, T, A: Allocator>(&'a mut IntoIter); . . impl Drop for DropGuard<'_, T, A> { . fn drop(&mut self) { . unsafe { . // `IntoIter::alloc` is not used anymore after this . let alloc = ptr::read(&self.0.alloc); . // RawVec handles deallocation 104,596 ( 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 { 49 ( 0.00%) ptr::drop_in_place(guard.0.as_raw_mut_slice()); . } . // now `guard` will be dropped and do the rest 475,334 ( 0.08%) } . } . . #[unstable(issue = "none", feature = "inplace_iteration")] . #[doc(hidden)] . unsafe impl InPlaceIterable for IntoIter {} . . #[unstable(issue = "none", feature = "inplace_iteration")] . #[doc(hidden)] -- line 331 ---------------------------------------- 210,488 ( 0.04%) -------------------------------------------------------------------------------- -- 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; . 1,148,846 ( 0.20%) 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] 595 ( 0.00%) pub fn shifted_in(self, amount: u32) -> DebruijnIndex { 246,416 ( 0.04%) DebruijnIndex::from_u32(self.as_u32() + amount) 1,785 ( 0.00%) } . . /// Update this index in place by shifting it "in" through . /// `amount` number of binders. 122,613 ( 0.02%) pub fn shift_in(&mut self, amount: u32) { 122,613 ( 0.02%) *self = self.shifted_in(amount); 245,226 ( 0.04%) } . . /// Returns the resulting index when this value is moved out from . /// `amount` number of new binders. . #[must_use] 669 ( 0.00%) pub fn shifted_out(self, amount: u32) -> DebruijnIndex { 246,564 ( 0.04%) DebruijnIndex::from_u32(self.as_u32() - amount) 2,007 ( 0.00%) } . . /// Update in place by shifting out from `amount` binders. 122,613 ( 0.02%) pub fn shift_out(&mut self, amount: u32) { 245,226 ( 0.04%) *self = self.shifted_out(amount); 245,226 ( 0.04%) } . . /// 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()) . } . } . 617 ( 0.00%) #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)] 2,478 ( 0.00%) #[derive(Encodable, Decodable)] . pub enum IntTy { . Isize, . I8, . I16, . I32, . I64, . I128, . } -- line 227 ---------------------------------------- -- line 257 ---------------------------------------- . 64 => IntTy::I64, . _ => unreachable!(), . }, . _ => *self, . } . } . } . 642 ( 0.00%) #[derive(Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Copy, Debug)] 3,230 ( 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, . }) . } . 1 ( 0.00%) pub fn normalize(&self, target_width: u32) -> Self { 3 ( 0.00%) match self { 2 ( 0.00%) UintTy::Usize => match target_width { . 16 => UintTy::U16, . 32 => UintTy::U32, . 64 => UintTy::U64, . _ => unreachable!(), . }, . _ => *self, . } 2 ( 0.00%) } . } . 67 ( 0.00%) #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)] 548 ( 0.00%) #[derive(Encodable, Decodable)] . pub enum FloatTy { . F32, . F64, . } . . impl FloatTy { . pub fn name_str(self) -> &'static str { . match self { -- line 321 ---------------------------------------- -- line 360 ---------------------------------------- . 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. 66,687 ( 0.01%) #[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 { 5,381 ( 0.00%) self.as_u32() 5,381 ( 0.00%) } . fn from_index(i: u32) -> TyVid { . TyVid::from_u32(i) 6,750 ( 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 . } 736 ( 0.00%) fn from_index(i: u32) -> IntVid { . IntVid { index: i } 736 ( 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" . } . } . 3,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. 5,796 ( 0.00%) pub fn xform(self, v: Variance) -> Variance { 38,456 ( 0.01%) 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, . } 5,796 ( 0.00%) } . } . . impl HashStable for DebruijnIndex { . fn hash_stable(&self, ctx: &mut CTX, hasher: &mut StableHasher) { . self.as_u32().hash_stable(ctx, hasher); . } . } . -- line 518 ---------------------------------------- 283,444 ( 0.05%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/context.rs -------------------------------------------------------------------------------- Ir -- line 118 ---------------------------------------- . stability: InternedSet<'tcx, attr::Stability>, . . /// `#[rustc_const_stable]` and `#[rustc_const_unstable]` attributes . const_stability: InternedSet<'tcx, attr::ConstStability>, . } . . impl<'tcx> CtxtInterners<'tcx> { . fn new(arena: &'tcx WorkerLocal>) -> CtxtInterners<'tcx> { 17 ( 0.00%) CtxtInterners { . arena, . type_: Default::default(), . type_list: Default::default(), . substs: Default::default(), . region: Default::default(), . poly_existential_predicates: Default::default(), . canonical_var_infos: Default::default(), . predicate: Default::default(), -- line 134 ---------------------------------------- -- line 143 ---------------------------------------- . stability: Default::default(), . const_stability: Default::default(), . } . } . . /// Interns a type. . #[allow(rustc::usage_of_ty_tykind)] . #[inline(never)] 992,816 ( 0.17%) fn intern_ty(&self, kind: TyKind<'tcx>) -> Ty<'tcx> { . self.type_ 620,510 ( 0.11%) .intern(kind, |kind| { 12,102 ( 0.00%) let flags = super::flags::FlagComputation::for_kind(&kind); . . let ty_struct = TyS { 24,204 ( 0.00%) kind, . flags: flags.flags, . outer_exclusive_binder: flags.outer_exclusive_binder, . }; . . Interned(self.arena.alloc(ty_struct)) . }) . .0 1,116,918 ( 0.19%) } . . #[inline(never)] 572,800 ( 0.10%) fn intern_predicate( . &self, . kind: Binder<'tcx, PredicateKind<'tcx>>, . ) -> &'tcx PredicateInner<'tcx> { . self.predicate 501,200 ( 0.09%) .intern(kind, |kind| { 26,730 ( 0.00%) let flags = super::flags::FlagComputation::for_predicate(kind); . . let predicate_struct = PredicateInner { . kind, . flags: flags.flags, . outer_exclusive_binder: flags.outer_exclusive_binder, . }; . . Interned(self.arena.alloc(predicate_struct)) . }) . .0 644,400 ( 0.11%) } . } . . 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) { 26,980 ( 0.00%) 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) . } . 19,703 ( 0.00%) pub fn get(&self, id: hir::HirId) -> Option<&V> { 4,001 ( 0.00%) validate_hir_id_for_typeck_results(self.hir_owner, id); 4,001 ( 0.00%) self.data.get(&id.local_id) 15,806 ( 0.00%) } . . 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; . 624 ( 0.00%) fn index(&self, key: hir::HirId) -> &V { . self.get(key).expect("LocalTableInContext: key not found") 416 ( 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> { 2,742 ( 0.00%) pub fn new(hir_owner: LocalDefId) -> TypeckResults<'tcx> { 32,447 ( 0.01%) TypeckResults { . hir_owner, . type_dependent_defs: Default::default(), . field_indices: Default::default(), . user_provided_types: Default::default(), . user_provided_sigs: Default::default(), . node_types: Default::default(), . node_substs: Default::default(), . adjustments: Default::default(), -- line 524 ---------------------------------------- -- line 532 ---------------------------------------- . tainted_by_errors: None, . concrete_opaque_types: Default::default(), . closure_min_captures: Default::default(), . closure_fake_reads: Default::default(), . generator_interior_types: ty::Binder::dummy(Default::default()), . treat_byte_string_as_slice: Default::default(), . closure_size_eval: Default::default(), . } 2,742 ( 0.00%) } . . /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node. 4,020 ( 0.00%) pub fn qpath_res(&self, qpath: &hir::QPath<'_>, id: hir::HirId) -> Res { 2,680 ( 0.00%) match *qpath { 5,550 ( 0.00%) hir::QPath::Resolved(_, ref path) => path.res, . hir::QPath::TypeRelative(..) | hir::QPath::LangItem(..) => self . .type_dependent_def(id) 2,490 ( 0.00%) .map_or(Res::Err, |(kind, def_id)| Res::Def(kind, def_id)), . } 6,700 ( 0.00%) } . 92 ( 0.00%) pub fn type_dependent_defs( . &self, . ) -> LocalTableInContext<'_, Result<(DefKind, DefId), ErrorReported>> { 325 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.type_dependent_defs } 92 ( 0.00%) } . 659 ( 0.00%) pub fn type_dependent_def(&self, id: HirId) -> Option<(DefKind, DefId)> { 1,334 ( 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()) 1,318 ( 0.00%) } . 1,040 ( 0.00%) pub fn type_dependent_def_id(&self, id: HirId) -> Option { . self.type_dependent_def(id).map(|(_, def_id)| def_id) 1,040 ( 0.00%) } . 1,868 ( 0.00%) pub fn type_dependent_defs_mut( . &mut self, . ) -> LocalTableInContextMut<'_, Result<(DefKind, DefId), ErrorReported>> { 1,868 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.type_dependent_defs } 1,868 ( 0.00%) } . . pub fn field_indices(&self) -> LocalTableInContext<'_, usize> { 350 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.field_indices } 77 ( 0.00%) } . . pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> { 510 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.field_indices } 255 ( 0.00%) } . . pub fn user_provided_types(&self) -> LocalTableInContext<'_, CanonicalUserType<'tcx>> { 844 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.user_provided_types } 422 ( 0.00%) } . . pub fn user_provided_types_mut( . &mut self, . ) -> LocalTableInContextMut<'_, CanonicalUserType<'tcx>> { 356 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.user_provided_types } 178 ( 0.00%) } . . pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> { 3,790 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.node_types } 1,895 ( 0.00%) } . . pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> { 6,632 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.node_types } 3,316 ( 0.00%) } . 26,658 ( 0.00%) pub fn node_type(&self, id: hir::HirId) -> Ty<'tcx> { 4,443 ( 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))) . }) 22,215 ( 0.00%) } . 5,658 ( 0.00%) pub fn node_type_opt(&self, id: hir::HirId) -> Option> { 5,658 ( 0.00%) validate_hir_id_for_typeck_results(self.hir_owner, id); . self.node_types.get(&id.local_id).cloned() 11,316 ( 0.00%) } . . pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, SubstsRef<'tcx>> { 952 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.node_substs } 476 ( 0.00%) } . 1,951 ( 0.00%) pub fn node_substs(&self, id: hir::HirId) -> SubstsRef<'tcx> { 1,951 ( 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()) 3,902 ( 0.00%) } . 1,432 ( 0.00%) pub fn node_substs_opt(&self, id: hir::HirId) -> Option> { 1,432 ( 0.00%) validate_hir_id_for_typeck_results(self.hir_owner, id); . self.node_substs.get(&id.local_id).cloned() 2,864 ( 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> { 752 ( 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> { 5,289 ( 0.00%) self.node_type(expr.hir_id) . } . . pub fn expr_ty_opt(&self, expr: &hir::Expr<'_>) -> Option> { 4,728 ( 0.00%) self.node_type_opt(expr.hir_id) . } . . pub fn adjustments(&self) -> LocalTableInContext<'_, Vec>> { 2,386 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.adjustments } 1,193 ( 0.00%) } . . pub fn adjustments_mut( . &mut self, . ) -> LocalTableInContextMut<'_, Vec>> { 3,826 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.adjustments } 1,913 ( 0.00%) } . 2,189 ( 0.00%) pub fn expr_adjustments(&self, expr: &hir::Expr<'_>) -> &[ty::adjustment::Adjustment<'tcx>] { 4,378 ( 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[..]) 4,378 ( 0.00%) } . . /// Returns the type of `expr`, considering any `Adjustment` . /// entry recorded for that expression. 295 ( 0.00%) pub fn expr_ty_adjusted(&self, expr: &hir::Expr<'_>) -> Ty<'tcx> { 59 ( 0.00%) self.expr_adjustments(expr).last().map_or_else(|| self.expr_ty(expr), |adj| adj.target) 144 ( 0.00%) } . . pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr<'_>) -> Option> { . self.expr_adjustments(expr).last().map(|adj| adj.target).or_else(|| self.expr_ty_opt(expr)) . } . 233 ( 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. 466 ( 0.00%) if let hir::ExprKind::Path(_) = expr.kind { . return false; . } . 526 ( 0.00%) matches!(self.type_dependent_defs().get(expr.hir_id), Some(Ok((DefKind::AssocFn, _)))) 466 ( 0.00%) } . 1,521 ( 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 . }) 2,028 ( 0.00%) } . . pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> { 1,217 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.pat_binding_modes } 355 ( 0.00%) } . . pub fn pat_binding_modes_mut(&mut self) -> LocalTableInContextMut<'_, BindingMode> { 676 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.pat_binding_modes } 338 ( 0.00%) } . . pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec>> { 1,188 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.pat_adjustments } 594 ( 0.00%) } . . pub fn pat_adjustments_mut(&mut self) -> LocalTableInContextMut<'_, Vec>> { 386 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.pat_adjustments } 193 ( 0.00%) } . . /// For a given closure, returns the iterator of `ty::CapturedPlace`s that are captured . /// by the closure. 444 ( 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() 555 ( 0.00%) } . . pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, HirPlace<'tcx>)> { 212 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.closure_kind_origins } 106 ( 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>> { 628 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.liberated_fn_sigs } 314 ( 0.00%) } . . pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> { 416 ( 0.00%) LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.liberated_fn_sigs } 208 ( 0.00%) } . . pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec>> { 212 ( 0.00%) LocalTableInContext { hir_owner: self.hir_owner, data: &self.fru_field_types } 106 ( 0.00%) } . . pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec>> { . LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.fru_field_types } . } . . pub fn is_coercion_cast(&self, hir_id: hir::HirId) -> bool { . validate_hir_id_for_typeck_results(self.hir_owner, hir_id); . self.coercion_casts.contains(&hir_id.local_id) . } . . pub fn set_coercion_cast(&mut self, id: ItemLocalId) { . self.coercion_casts.insert(id); . } . . pub fn coercion_casts(&self) -> &ItemLocalSet { 106 ( 0.00%) &self.coercion_casts 106 ( 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>; . 2 ( 0.00%) #[derive(Clone, Debug, TyEncodable, TyDecodable, HashStable, TypeFoldable, Lift)] . pub struct CanonicalUserTypeAnnotation<'tcx> { . pub user_ty: CanonicalUserType<'tcx>, . pub span: Span, 91 ( 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. 151 ( 0.00%) pub fn is_identity(&self) -> bool { 302 ( 0.00%) match self.value { . UserType::Ty(_) => false, . UserType::TypeOf(_, user_substs) => { 151 ( 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() { 246 ( 0.00%) GenericArgKind::Type(ty) => match ty.kind() { . ty::Bound(debruijn, b) => { . // We only allow a `ty::INNERMOST` index in substitutions. 86 ( 0.00%) assert_eq!(*debruijn, ty::INNERMOST); . cvar == b.var . } . _ => false, . }, . 8 ( 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, . }, . } . }) . } . } 302 ( 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. 546 ( 0.00%) #[derive(Copy, Clone, Debug, PartialEq, TyEncodable, TyDecodable)] 2,019 ( 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> { 4,280 ( 0.00%) pub fn typeck_opt_const_arg( . self, . def: ty::WithOptConstParam, . ) -> &'tcx TypeckResults<'tcx> { 1,712 ( 0.00%) if let Some(param_did) = def.const_param_did { . self.typeck_const_arg((def.did, param_did)) . } else { . self.typeck(def.did) . } 3,424 ( 0.00%) } . 321 ( 0.00%) pub fn alloc_steal_thir(self, thir: Thir<'tcx>) -> &'tcx Steal> { 107 ( 0.00%) self.arena.alloc(Steal::new(thir)) 428 ( 0.00%) } . 1,620 ( 0.00%) pub fn alloc_steal_mir(self, mir: Body<'tcx>) -> &'tcx Steal> { 324 ( 0.00%) self.arena.alloc(Steal::new(mir)) 2,268 ( 0.00%) } . 428 ( 0.00%) pub fn alloc_steal_promoted( . self, . promoted: IndexVec>, . ) -> &'tcx Steal>> { 107 ( 0.00%) self.arena.alloc(Steal::new(promoted)) 535 ( 0.00%) } . 189 ( 0.00%) pub fn alloc_adt_def( . self, . did: DefId, . kind: AdtKind, . variants: IndexVec, . repr: ReprOptions, . ) -> &'tcx ty::AdtDef { 336 ( 0.00%) self.intern_adt_def(ty::AdtDef::new(self, did, kind, variants, repr)) 84 ( 0.00%) } . . /// Allocates a read-only byte or string literal for `mir::interpret`. . pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId { . // Create an allocation that just contains these bytes. . let alloc = interpret::Allocation::from_bytes_byte_aligned_immutable(bytes); . let alloc = self.intern_const_alloc(alloc); . self.create_memory_alloc(alloc) . } . . /// Returns a range of the start/end indices specified with the . /// `rustc_layout_scalar_valid_range` attribute. . // FIXME(eddyb) this is an awkward spot for this method, maybe move it? 816 ( 0.00%) pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound, Bound) { 408 ( 0.00%) let attrs = self.get_attrs(def_id); 1,734 ( 0.00%) let get = |name| { 408 ( 0.00%) let attr = match attrs.iter().find(|a| a.has_name(name)) { . Some(attr) => attr, . None => return Bound::Unbounded, . }; . debug!("layout_scalar_valid_range: attr={:?}", attr); . if let Some( . &[ . ast::NestedMetaItem::Literal(ast::Lit { . kind: ast::LitKind::Int(a, _), .. -- line 1111 ---------------------------------------- -- line 1114 ---------------------------------------- . ) = attr.meta_item_list().as_deref() . { . Bound::Included(a) . } else { . self.sess . .delay_span_bug(attr.span, "invalid rustc_layout_scalar_valid_range attribute"); . Bound::Unbounded . } 2,040 ( 0.00%) }; 612 ( 0.00%) ( 612 ( 0.00%) get(sym::rustc_layout_scalar_valid_range_start), 306 ( 0.00%) get(sym::rustc_layout_scalar_valid_range_end), . ) 816 ( 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 }) . } . 35 ( 0.00%) pub fn consider_optimizing String>(self, msg: T) -> bool { 5 ( 0.00%) let cname = self.crate_name(LOCAL_CRATE); 40 ( 0.00%) self.sess.consider_optimizing(cname.as_str(), msg) 40 ( 0.00%) } . . /// Obtain all lang items of this crate and all dependencies (recursively) 206,787 ( 0.04%) pub fn lang_items(self) -> &'tcx rustc_hir::lang_items::LanguageItems { . self.get_lang_items(()) 265,869 ( 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. 35 ( 0.00%) pub fn get_diagnostic_item(self, name: Symbol) -> Option { . self.all_diagnostic_items(()).name_to_id.get(&name).copied() 40 ( 0.00%) } . . /// Obtain the diagnostic item's name 2,716 ( 0.00%) pub fn get_diagnostic_name(self, id: DefId) -> Option { . self.diagnostic_items(id.krate).id_to_name.get(&id).copied() 3,104 ( 0.00%) } . . /// Check whether the diagnostic item with the given `name` has the given `DefId`. 11,417 ( 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) 13,048 ( 0.00%) } . 2,562 ( 0.00%) pub fn stability(self) -> &'tcx stability::Index<'tcx> { . self.stability_index(()) 3,294 ( 0.00%) } . 55,860 ( 0.01%) pub fn features(self) -> &'tcx rustc_feature::Features { . self.features_query(()) 63,840 ( 0.01%) } . . pub fn def_key(self, id: DefId) -> rustc_hir::definitions::DefKey { . // Accessing the DefKey is ok, since it is part of DefPathHash. 1,400 ( 0.00%) if let Some(id) = id.as_local() { . self.untracked_resolutions.definitions.def_key(id) . } else { 231 ( 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. 1,286 ( 0.00%) if let Some(def_id) = def_id.as_local() { . self.untracked_resolutions.definitions.def_path_hash(def_id) . } else { 384 ( 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 { 26,678 ( 0.00%) &*self.untracked_resolutions.cstore 13,339 ( 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> { 4 ( 0.00%) let resolutions = &self.gcx.untracked_resolutions; 19 ( 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.) 212 ( 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=...` . 318 ( 0.00%) if self.features().nll { . return BorrowckMode::Mir; . } . 106 ( 0.00%) self.sess.opts.borrowck_mode 424 ( 0.00%) } . . /// If `true`, we should use lazy normalization for constants, otherwise . /// we still evaluate them eagerly. . #[inline] . pub fn lazy_normalization(self) -> bool { . let features = self.features(); . // Note: We only use lazy normalization for generic const expressions. . features.generic_const_exprs -- line 1434 ---------------------------------------- -- line 1554 ---------------------------------------- . self.mk_imm_ref( . self.lifetimes.re_static, . self.type_of(self.require_lang_item(LangItem::PanicLocation, None)) . .subst(self, self.mk_substs([self.lifetimes.re_static.into()].iter())), . ) . } . . /// Returns a displayable description and article for the given `def_id` (e.g. `("a", "struct")`). 957 ( 0.00%) pub fn article_and_description(self, def_id: DefId) -> (&'static str, &'static str) { 696 ( 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"), . }, 1,566 ( 0.00%) def_kind => (def_kind.article(), def_kind.descr(def_id)), . } 783 ( 0.00%) } . . pub fn type_length_limit(self) -> Limit { . self.limits(()).type_length_limit . } . 97,923 ( 0.02%) pub fn recursion_limit(self) -> Limit { . self.limits(()).recursion_limit 111,912 ( 0.02%) } . . pub fn move_size_limit(self) -> Limit { . self.limits(()).move_size_limit . } . . pub fn const_eval_limit(self) -> Limit { . self.limits(()).const_eval_limit . } -- line 1586 ---------------------------------------- -- 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(); 32,971 ( 0.01%) let _reset = rustc_data_structures::OnDrop(move || TLV.with(|tlv| tlv.set(old))); . TLV.with(|tlv| tlv.set(value)); . f() . } . . /// Gets the pointer to the current `ImplicitCtxt`. . #[cfg(not(parallel_compiler))] . #[inline] . fn get_tlv() -> usize { -- line 1761 ---------------------------------------- -- line 1763 ---------------------------------------- . } . . /// Sets `context` as the new current `ImplicitCtxt` for the duration of the function `f`. . #[inline] . pub fn enter_context<'a, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'tcx>, f: F) -> R . where . F: FnOnce(&ImplicitCtxt<'a, 'tcx>) -> R, . { 1 ( 0.00%) set_tlv(context as *const _ as usize, || f(&context)) . } . . /// Allows access to the current `ImplicitCtxt` in a closure if one is available. . #[inline] . pub fn with_context_opt(f: F) -> R . where . F: for<'a, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'tcx>>) -> R, . { . let context = get_tlv(); 128,295 ( 0.02%) if context == 0 { . f(None) . } else { . // We could get an `ImplicitCtxt` pointer from another thread. . // Ensure that `ImplicitCtxt` is `Sync`. . sync::assert_sync::>(); . . unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_>))) } . } -- line 1789 ---------------------------------------- -- line 1805 ---------------------------------------- . /// This will panic if you pass it a `TyCtxt` which is different from the current . /// `ImplicitCtxt`'s `tcx` field. . #[inline] . pub fn with_related_context<'tcx, F, R>(tcx: TyCtxt<'tcx>, f: F) -> R . where . F: FnOnce(&ImplicitCtxt<'_, 'tcx>) -> R, . { . with_context(|context| unsafe { 63,405 ( 0.01%) assert!(ptr_eq(context.tcx.gcx, tcx.gcx)); . let context: &ImplicitCtxt<'_, '_> = mem::transmute(context); 63,396 ( 0.01%) f(context) . }) . } . . /// Allows access to the `TyCtxt` in the current `ImplicitCtxt`. . /// Panics if there is no `ImplicitCtxt` available. . #[inline] . pub fn with(f: F) -> R . where -- line 1823 ---------------------------------------- -- line 1981 ---------------------------------------- . fn into_pointer(&self) -> *const () { . self.0 as *const _ as *const () . } . } . . #[allow(rustc::usage_of_ty_tykind)] . impl<'tcx> Borrow> for Interned<'tcx, TyS<'tcx>> { . fn borrow<'a>(&'a self) -> &'a TyKind<'tcx> { 119,001 ( 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)`. 21,492 ( 0.00%) self.0.kind().hash(s) . } . } . . impl<'tcx> Borrow>> for Interned<'tcx, PredicateInner<'tcx>> { . fn borrow<'a>(&'a self) -> &'a Binder<'tcx, PredicateKind<'tcx>> { 67,993 ( 0.01%) &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)`. 7,164 ( 0.00%) self.0.kind.hash(s) . } . } . . impl<'tcx, T> Borrow<[T]> for Interned<'tcx, List> { . fn borrow<'a>(&'a self) -> &'a [T] { 180,220 ( 0.03%) &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)`. 9,471 ( 0.00%) self.0[..].hash(s) . } . } . . macro_rules! direct_interners { . ($($name:ident: $method:ident($ty:ty),)+) => { . $(impl<'tcx> Borrow<$ty> for Interned<'tcx, $ty> { . fn borrow<'a>(&'a self) -> &'a $ty { 17,881 ( 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)`. 6,793 ( 0.00%) self.0.hash(s) . } . } . . impl<'tcx> TyCtxt<'tcx> { 157,368 ( 0.03%) pub fn $method(self, v: $ty) -> &'tcx $ty { 79,743 ( 0.01%) self.interners.$name.intern(v, |v| { 1,933 ( 0.00%) Interned(self.interners.arena.alloc(v)) . }).0 176,652 ( 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> { 1,866,848 ( 0.32%) $(pub fn $method(self, v: &[$ty]) -> &'tcx List<$ty> { . self.interners.$field.intern_ref(v, || { . Interned(List::from_arena(&*self.arena, v)) . }).0 1,676,601 ( 0.29%) })+ . } . ); . } . . 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`. 600 ( 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() . }) 450 ( 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(); 100 ( 0.00%) let mut stack = vec![trait_def_id]; . . set.insert(trait_def_id); . 450 ( 0.00%) iter::from_fn(move || -> Option { 454 ( 0.00%) let trait_did = stack.pop()?; 227 ( 0.00%) let generic_predicates = self.super_predicates_of(trait_did); . . for (predicate, _) in generic_predicates.predicates { 1,047 ( 0.00%) if let ty::PredicateKind::Trait(data) = predicate.kind().skip_binder() { 650 ( 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> { 15,028 ( 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> { 948,683 ( 0.16%) self.interners.intern_ty(st) . } . . #[inline] . pub fn mk_predicate(self, binder: Binder<'tcx, PredicateKind<'tcx>>) -> Predicate<'tcx> { 783,852 ( 0.14%) let inner = self.interners.intern_predicate(binder); . Predicate { inner } . } . . #[inline] 1,855,144 ( 0.32%) pub fn reuse_or_mk_predicate( . self, . pred: Predicate<'tcx>, . binder: Binder<'tcx, PredicateKind<'tcx>>, . ) -> Predicate<'tcx> { 168,641 ( 0.03%) if pred.kind() != binder { self.mk_predicate(binder) } else { pred } 1,855,144 ( 0.32%) } . . pub fn mk_mach_int(self, tm: IntTy) -> Ty<'tcx> { . match tm { . IntTy::Isize => self.types.isize, . IntTy::I8 => self.types.i8, . IntTy::I16 => self.types.i16, . IntTy::I32 => self.types.i32, . IntTy::I64 => self.types.i64, . IntTy::I128 => self.types.i128, . } . } . . pub fn mk_mach_uint(self, tm: UintTy) -> Ty<'tcx> { 29 ( 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, . } 29 ( 0.00%) } . . pub fn mk_mach_float(self, tm: FloatTy) -> Ty<'tcx> { . match tm { . FloatTy::F32 => self.types.f32, . FloatTy::F64 => self.types.f64, . } . } . . #[inline] . pub fn mk_static_str(self) -> Ty<'tcx> { 36 ( 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] 322 ( 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))) 336 ( 0.00%) } . . #[inline] . pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> { . self.mk_ty(Slice(ty)) . } . . #[inline] . pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> { . let kinds: Vec<_> = ts.iter().map(|&t| GenericArg::from(t)).collect(); 21 ( 0.00%) self.mk_ty(Tuple(self.intern_substs(&kinds))) . } . . pub fn mk_tup], Ty<'tcx>>>(self, iter: I) -> I::Output { 10 ( 0.00%) iter.intern_with(|ts| { 8 ( 0.00%) let kinds: Vec<_> = ts.iter().map(|&t| GenericArg::from(t)).collect(); 364 ( 0.00%) self.mk_ty(Tuple(self.intern_substs(&kinds))) 9 ( 0.00%) }) . } . . #[inline] . pub fn mk_unit(self) -> Ty<'tcx> { 37 ( 0.00%) self.types.unit . } . . #[inline] . pub fn mk_diverging_default(self) -> Ty<'tcx> { . if self.features().never_type_fallback { self.types.never } else { self.types.unit } . } . . #[inline] . pub fn mk_fn_def(self, def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> { . self.mk_ty(FnDef(def_id, substs)) . } . . #[inline] . pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> { 264 ( 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 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 }) . } . 5,607 ( 0.00%) pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> GenericArg<'tcx> { 3,865 ( 0.00%) match param.kind { . GenericParamDefKind::Lifetime => { 420 ( 0.00%) self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into() . } 1,462 ( 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() . } . } 5,607 ( 0.00%) } . . #[inline] . pub fn mk_opaque(self, def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> { . self.mk_ty(Opaque(def_id, substs)) . } . 2 ( 0.00%) pub fn mk_place_field(self, place: Place<'tcx>, f: Field, ty: Ty<'tcx>) -> Place<'tcx> { 2 ( 0.00%) self.mk_place_elem(place, PlaceElem::Field(f, ty)) 4 ( 0.00%) } . . pub fn mk_place_deref(self, place: Place<'tcx>) -> Place<'tcx> { . self.mk_place_elem(place, PlaceElem::Deref) . } . . pub fn mk_place_downcast( . self, . place: Place<'tcx>, -- line 2480 ---------------------------------------- -- 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. 18 ( 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) } 20 ( 0.00%) } . 161 ( 0.00%) pub fn intern_poly_existential_predicates( . self, . eps: &[ty::Binder<'tcx, ExistentialPredicate<'tcx>>], . ) -> &'tcx List>> { 23 ( 0.00%) assert!(!eps.is_empty()); . assert!( . eps.array_windows() 30 ( 0.00%) .all(|[a, b]| a.skip_binder().stable_cmp(self, &b.skip_binder()) . != Ordering::Greater) . ); 92 ( 0.00%) self._intern_poly_existential_predicates(eps) 184 ( 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. 5,502 ( 0.00%) if preds.is_empty() { . // The macro-generated method below asserts we don't intern an empty slice. . List::empty() . } else { 4,716 ( 0.00%) self._intern_predicates(preds) . } 1,944 ( 0.00%) } . . pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List> { 5,694 ( 0.00%) if ts.is_empty() { List::empty() } else { self._intern_type_list(ts) } 36 ( 0.00%) } . . pub fn intern_substs(self, ts: &[GenericArg<'tcx>]) -> &'tcx List> { 338,861 ( 0.06%) if ts.is_empty() { List::empty() } else { self._intern_substs(ts) } 2,254 ( 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> { 646 ( 0.00%) if ts.is_empty() { List::empty() } else { self._intern_place_elems(ts) } 232 ( 0.00%) } . . pub fn intern_canonical_var_infos( . self, . ts: &[CanonicalVarInfo<'tcx>], . ) -> CanonicalVarInfos<'tcx> { 10,693 ( 0.00%) if ts.is_empty() { List::empty() } else { self._intern_canonical_var_infos(ts) } 6,706 ( 0.00%) } . . pub fn intern_bound_variable_kinds( . self, . ts: &[ty::BoundVariableKind], . ) -> &'tcx List { 16,384 ( 0.00%) if ts.is_empty() { List::empty() } else { self._intern_bound_variable_kinds(ts) } 25,108 ( 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 { 795 ( 0.00%) inputs_and_output: self.intern_type_list(xs), 147 ( 0.00%) c_variadic, 220 ( 0.00%) unsafety, 148 ( 0.00%) abi, 10 ( 0.00%) }) . } . . pub fn mk_poly_existential_predicates< . I: InternAs< . [ty::Binder<'tcx, ExistentialPredicate<'tcx>>], . &'tcx List>>, . >, . >( . self, . iter: I, . ) -> I::Output { 84 ( 0.00%) iter.intern_with(|xs| self.intern_poly_existential_predicates(xs)) . } . . pub fn mk_predicates], &'tcx List>>>( . self, . iter: I, . ) -> I::Output { 18 ( 0.00%) iter.intern_with(|xs| self.intern_predicates(xs)) . } . . pub fn mk_type_list], &'tcx List>>>(self, iter: I) -> I::Output { 1,101 ( 0.00%) iter.intern_with(|xs| self.intern_type_list(xs)) . } . . pub fn mk_substs], &'tcx List>>>( . self, . iter: I, . ) -> I::Output { 127,753 ( 0.02%) iter.intern_with(|xs| self.intern_substs(xs)) . } . . pub fn mk_place_elems], &'tcx List>>>( . self, . iter: I, . ) -> I::Output { . iter.intern_with(|xs| self.intern_place_elems(xs)) . } . 2,526 ( 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())) 5,052 ( 0.00%) } . . pub fn mk_bound_variable_kinds< . I: InternAs<[ty::BoundVariableKind], &'tcx List>, . >( . self, . iter: I, . ) -> I::Output { 81,549 ( 0.01%) 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. 15,722 ( 0.00%) pub fn maybe_lint_level_root_bounded(self, mut id: HirId, bound: HirId) -> HirId { 15,722 ( 0.00%) let hir = self.hir(); . loop { 22,929 ( 0.00%) if id == bound { . return bound; . } . 27,177 ( 0.00%) 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); 16,191 ( 0.00%) if next == id { . bug!("lint traversal reached the root of the crate"); . } . id = next; . } 22,460 ( 0.00%) } . 2,976 ( 0.00%) pub fn lint_level_at_node( . self, . lint: &'static Lint, . mut id: hir::HirId, . ) -> (Level, LintLevelSource) { . let sets = self.lint_levels(()); . loop { 13,011 ( 0.00%) if let Some(pair) = sets.level_and_source(lint, id, self.sess) { . return pair; . } 867 ( 0.00%) let next = self.hir().get_parent_node(id); 2,601 ( 0.00%) if next == id { . bug!("lint traversal reached the root of the crate"); . } . id = next; . } 2,976 ( 0.00%) } . 42 ( 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>), . ) { 40 ( 0.00%) let (level, src) = self.lint_level_at_node(lint, hir_id); 25 ( 0.00%) struct_lint_level(self.sess, lint, level, src, Some(span.into()), decorate); 24 ( 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); . } . 1,246 ( 0.00%) pub fn in_scope_traits(self, id: HirId) -> Option<&'tcx [TraitCandidate]> { 356 ( 0.00%) let map = self.in_scope_traits_map(id.owner)?; . let candidates = map.get(&id.local_id)?; 356 ( 0.00%) Some(&*candidates) 1,424 ( 0.00%) } . 2,793 ( 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()) 3,591 ( 0.00%) } . 198 ( 0.00%) pub fn is_late_bound(self, id: HirId) -> bool { . self.is_late_bound_map(id.owner) 11 ( 0.00%) .map_or(false, |(owner, set)| owner == id.owner && set.contains(&id.local_id)) 176 ( 0.00%) } . 5,264 ( 0.00%) pub fn object_lifetime_defaults(self, id: HirId) -> Option> { . self.object_lifetime_defaults_map(id.owner) 6,768 ( 0.00%) } . 6,606 ( 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(), . ) 6,606 ( 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 140 ( 0.00%) pub fn is_const_fn(self, def_id: DefId) -> bool { 14 ( 0.00%) if self.is_const_fn_raw(def_id) { . match self.lookup_const_stability(def_id) { . 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) -- line 2741 ---------------------------------------- -- line 2743 ---------------------------------------- . // 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 . } 126 ( 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; 48,168 ( 0.01%) fn intern_with(self, f: F) -> Self::Output . where . F: FnOnce(&[T]) -> R, . { 504,623 ( 0.09%) E::intern_with(self, f) 51,048 ( 0.01%) } . } . . pub trait InternIteratorElement: Sized { . type Output; . fn intern_with, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output; . } . . impl InternIteratorElement for T { . type Output = R; 161,136 ( 0.03%) 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`. 112,362 ( 0.02%) match iter.size_hint() { . (0, Some(0)) => { 3 ( 0.00%) assert!(iter.next().is_none()); . f(&[]) . } . (1, Some(1)) => { . let t0 = iter.next().unwrap(); 1 ( 0.00%) assert!(iter.next().is_none()); 11,385 ( 0.00%) f(&[t0]) . } . (2, Some(2)) => { . let t0 = iter.next().unwrap(); . let t1 = iter.next().unwrap(); 74 ( 0.00%) assert!(iter.next().is_none()); 8,917 ( 0.00%) f(&[t0, t1]) . } 292 ( 0.00%) _ => f(&iter.collect::>()), . } 96,298 ( 0.02%) } . } . . impl<'a, T, R> InternIteratorElement for &'a T . where . T: Clone + 'a, . { . type Output = R; 3,683 ( 0.00%) fn intern_with, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output { . // This code isn't hot. 4 ( 0.00%) f(&iter.cloned().collect::>()) 2,950 ( 0.00%) } . } . . impl InternIteratorElement for Result { . type Output = Result; 132,324 ( 0.02%) fn intern_with, F: FnOnce(&[T]) -> R>( . mut iter: I, . f: F, . ) -> Self::Output { . // This code is hot enough that it's worth specializing for the most . // common length lists, to avoid the overhead of `SmallVec` creation. . // Lengths 0, 1, and 2 typically account for ~95% of cases. If . // `size_hint` is incorrect a panic will occur via an `unwrap` or an . // `assert`, unless a failure happens first, in which case the result . // will be an error anyway. 103,786 ( 0.02%) Ok(match iter.size_hint() { . (0, Some(0)) => { . assert!(iter.next().is_none()); . f(&[]) . } . (1, Some(1)) => { 42 ( 0.00%) let t0 = iter.next().unwrap()?; . assert!(iter.next().is_none()); 11,299 ( 0.00%) f(&[t0]) . } . (2, Some(2)) => { 50 ( 0.00%) let t0 = iter.next().unwrap()?; 50 ( 0.00%) let t1 = iter.next().unwrap()?; 75 ( 0.00%) assert!(iter.next().is_none()); 6,412 ( 0.00%) f(&[t0, t1]) . } 1,258 ( 0.00%) _ => f(&iter.collect::, _>>()?), . }) 148,680 ( 0.03%) } . } . . // We are comparing types with different invariant lifetimes, so `ptr::eq` . // won't work for us. . fn ptr_eq(t: *const T, u: *const U) -> bool { 63,405 ( 0.01%) t as *const () == u as *const () . } . . pub fn provide(providers: &mut ty::query::Providers) { 2 ( 0.00%) providers.in_scope_traits_map = . |tcx, id| tcx.hir_crate(()).owners[id].as_ref().map(|owner_info| &owner_info.trait_map); 3 ( 0.00%) providers.resolutions = |tcx, ()| &tcx.untracked_resolutions; 2 ( 0.00%) providers.module_reexports = . |tcx, id| tcx.resolutions(()).reexport_map.get(&id).map(|v| &v[..]); 2 ( 0.00%) providers.crate_name = |tcx, id| { 1 ( 0.00%) assert_eq!(id, LOCAL_CRATE); 1 ( 0.00%) tcx.crate_name . }; 2 ( 0.00%) providers.maybe_unused_trait_import = . |tcx, id| tcx.resolutions(()).maybe_unused_trait_imports.contains(&id); 2 ( 0.00%) providers.maybe_unused_extern_crates = . |tcx, ()| &tcx.resolutions(()).maybe_unused_extern_crates[..]; 2 ( 0.00%) providers.names_imported_by_glob_use = |tcx, id| { . tcx.arena.alloc(tcx.resolutions(()).glob_map.get(&id).cloned().unwrap_or_default()) . }; . 11 ( 0.00%) providers.lookup_stability = |tcx, id| tcx.stability().local_stability(id.expect_local()); 2 ( 0.00%) providers.lookup_const_stability = . |tcx, id| tcx.stability().local_const_stability(id.expect_local()); 2 ( 0.00%) providers.lookup_deprecation_entry = 2,912 ( 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()) . }; . } 401,918 ( 0.07%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_lexer/src/lib.rs -------------------------------------------------------------------------------- Ir -- line 38 ---------------------------------------- . #[derive(Debug)] . pub struct Token { . pub kind: TokenKind, . pub len: usize, . } . . impl Token { . fn new(kind: TokenKind, len: usize) -> Token { 147,987 ( 0.03%) Token { kind, len } . } . } . . /// Enum representing common lexeme types. . // perf note: Changing all `usize` to `u32` doesn't change performance. See #77629 45,180 ( 0.01%) #[derive(Clone, Copy, Debug, PartialEq, Eq, PartialOrd, Ord)] . pub enum TokenKind { . // Multi-char tokens: . /// "// comment" . LineComment { doc_style: Option }, . /// `/* block comment */` . /// . /// Block comments can be recursive, so the sequence like `/* /* */` . /// will not be considered terminated and will result in a parsing error. -- line 60 ---------------------------------------- -- line 192 ---------------------------------------- . /// Literal starts with "0x". . Hexadecimal, . /// Literal doesn't contain a prefix. . Decimal, . } . . /// `rustc` allows files to have a shebang, e.g. "#!/usr/bin/rustrun", . /// but shebang isn't a part of rust syntax. 105 ( 0.00%) pub fn strip_shebang(input: &str) -> Option { . // Shebang must start with `#!` literally, without any preceding whitespace. . // For simplicity we consider any line starting with `#!` a shebang, . // regardless of restrictions put on shebangs by specific platforms. . if let Some(input_tail) = input.strip_prefix("#!") { . // Ok, this is a shebang but if the next non-whitespace token is `[`, . // then it may be valid Rust code, so consider it Rust code. . let next_non_whitespace_token = tokenize(input_tail).map(|tok| tok.kind).find(|tok| { . !matches!( . tok, . TokenKind::Whitespace . | TokenKind::LineComment { doc_style: None } . | TokenKind::BlockComment { doc_style: None, .. } . ) . }); 1 ( 0.00%) if next_non_whitespace_token != Some(TokenKind::OpenBracket) { . // No other choice than to consider this a shebang. . return Some(2 + input_tail.lines().next().unwrap_or_default().len()); . } . } . None 120 ( 0.00%) } . . /// Parses the first token from the provided input string. 49,326 ( 0.01%) pub fn first_token(input: &str) -> Token { . debug_assert!(!input.is_empty()); 16,442 ( 0.00%) Cursor::new(input).advance_token() 65,768 ( 0.01%) } . . /// Creates an iterator that produces tokens from the input string. . pub fn tokenize(input: &str) -> impl Iterator + '_ { . let mut cursor = Cursor::new(input); . std::iter::from_fn(move || { 1 ( 0.00%) if cursor.is_eof() { . None . } else { . cursor.reset_len_consumed(); 14 ( 0.00%) Some(cursor.advance_token()) . } . }) . } . . /// True if `c` is considered a whitespace according to Rust language definition. . /// See [Rust language reference](https://doc.rust-lang.org/reference/whitespace.html) . /// for definitions of these classes. . pub fn is_whitespace(c: char) -> bool { . // This is Pattern_White_Space. . // . // Note that this set is stable (ie, it doesn't change with different . // Unicode versions), so it's ok to just hard-code the values. . 30,948 ( 0.01%) matches!( . c, . // Usual ASCII suspects . '\u{0009}' // \t . | '\u{000A}' // \n . | '\u{000B}' // vertical tab . | '\u{000C}' // form feed . | '\u{000D}' // \r . | '\u{0020}' // space -- line 259 ---------------------------------------- -- line 269 ---------------------------------------- . | '\u{2028}' // LINE SEPARATOR . | '\u{2029}' // PARAGRAPH SEPARATOR . ) . } . . /// True if `c` is valid as a first character of an identifier. . /// See [Rust language reference](https://doc.rust-lang.org/reference/identifiers.html) for . /// a formal definition of valid identifier name. 15 ( 0.00%) pub fn is_id_start(c: char) -> bool { . // This is XID_Start OR '_' (which formally is not a XID_Start). 458 ( 0.00%) c == '_' || unicode_xid::UnicodeXID::is_xid_start(c) 15 ( 0.00%) } . . /// True if `c` is valid as a non-first character of an identifier. . /// See [Rust language reference](https://doc.rust-lang.org/reference/identifiers.html) for . /// a formal definition of valid identifier name. . pub fn is_id_continue(c: char) -> bool { . unicode_xid::UnicodeXID::is_xid_continue(c) 5 ( 0.00%) } . . /// The passed string is lexically an identifier. . pub fn is_ident(string: &str) -> bool { . let mut chars = string.chars(); . if let Some(start) = chars.next() { . is_id_start(start) && chars.all(is_id_continue) . } else { . false . } . } . . impl Cursor<'_> { . /// Parses a token from the input string. 131,544 ( 0.02%) fn advance_token(&mut self) -> Token { . let first_char = self.bump().unwrap(); 59,744 ( 0.01%) let token_kind = match first_char { . // Slash, comment or block comment. 1,480 ( 0.00%) '/' => match self.first() { . '/' => self.line_comment(), . '*' => self.block_comment(), . _ => Slash, . }, . . // Whitespace sequence. . c if is_whitespace(c) => self.whitespace(), . . // Raw identifier, raw string literal or identifier. 136 ( 0.00%) 'r' => match (self.first(), self.second()) { . ('#', c1) if is_id_start(c1) => self.raw_ident(), . ('#', _) | ('"', _) => { . let (n_hashes, err) = self.raw_double_quoted_string(1); . let suffix_start = self.len_consumed(); . if err.is_none() { . self.eat_literal_suffix(); . } . let kind = RawStr { n_hashes, err }; . Literal { kind, suffix_start } . } . _ => self.ident_or_unknown_prefix(), . }, . . // Byte literal, byte string literal, raw byte string literal or identifier. 549 ( 0.00%) 'b' => match (self.first(), self.second()) { . ('\'', _) => { . self.bump(); . let terminated = self.single_quoted_string(); . let suffix_start = self.len_consumed(); . if terminated { . self.eat_literal_suffix(); . } . let kind = Byte { terminated }; -- line 338 ---------------------------------------- -- line 361 ---------------------------------------- . _ => self.ident_or_unknown_prefix(), . }, . . // Identifier (this should be checked after other variant that can . // start as identifier). . c if is_id_start(c) => self.ident_or_unknown_prefix(), . . // Numeric literal. 21,132 ( 0.00%) c @ '0'..='9' => { . let literal_kind = self.number(c); . let suffix_start = self.len_consumed(); . self.eat_literal_suffix(); 10 ( 0.00%) TokenKind::Literal { kind: literal_kind, suffix_start } . } . . // One-symbol tokens. 376 ( 0.00%) ';' => Semi, 1,052 ( 0.00%) ',' => Comma, 426 ( 0.00%) '.' => Dot, 1,506 ( 0.00%) '(' => OpenParen, 1,506 ( 0.00%) ')' => CloseParen, 698 ( 0.00%) '{' => OpenBrace, 698 ( 0.00%) '}' => CloseBrace, 364 ( 0.00%) '[' => OpenBracket, 362 ( 0.00%) ']' => CloseBracket, . '@' => At, 336 ( 0.00%) '#' => Pound, . '~' => Tilde, 24 ( 0.00%) '?' => Question, 2,386 ( 0.00%) ':' => Colon, . '$' => Dollar, 524 ( 0.00%) '=' => Eq, 60 ( 0.00%) '!' => Bang, 1,020 ( 0.00%) '<' => Lt, 1,274 ( 0.00%) '>' => Gt, 258 ( 0.00%) '-' => Minus, 380 ( 0.00%) '&' => And, 64 ( 0.00%) '|' => Or, 300 ( 0.00%) '+' => Plus, 36 ( 0.00%) '*' => Star, . '^' => Caret, . '%' => Percent, . . // Lifetime or character literal. 66 ( 0.00%) '\'' => self.lifetime_or_char(), . . // String literal. . '"' => { 585 ( 0.00%) let terminated = self.double_quoted_string(); . let suffix_start = self.len_consumed(); 390 ( 0.00%) if terminated { . self.eat_literal_suffix(); . } . let kind = Str { terminated }; 390 ( 0.00%) Literal { kind, suffix_start } . } . // Identifier starting with an emoji. Only lexed for graceful error recovery. . c if !c.is_ascii() && unic_emoji_char::is_emoji(c) => { . self.fake_ident_or_unknown_prefix() . } . _ => Unknown, . }; . Token::new(token_kind, self.len_consumed()) 147,987 ( 0.03%) } . . fn line_comment(&mut self) -> TokenKind { . debug_assert!(self.prev() == '/' && self.first() == '/'); . self.bump(); . 906 ( 0.00%) let doc_style = match self.first() { . // `//!` is an inner line doc comment. . '!' => Some(DocStyle::Inner), . // `////` (more than 3 slashes) is not considered a doc comment. 861 ( 0.00%) '/' if self.second() != '/' => Some(DocStyle::Outer), . _ => None, . }; . 15,256 ( 0.00%) self.eat_while(|c| c != '\n'); 1,110 ( 0.00%) LineComment { doc_style } . } . . fn block_comment(&mut self) -> TokenKind { . debug_assert!(self.prev() == '/' && self.first() == '*'); . self.bump(); . . let doc_style = match self.first() { . // `/*!` is an inner block doc comment. -- line 447 ---------------------------------------- -- line 474 ---------------------------------------- . } . . BlockComment { doc_style, terminated: depth == 0 } . } . . fn whitespace(&mut self) -> TokenKind { . debug_assert!(is_whitespace(self.prev())); . self.eat_while(is_whitespace); 4,511 ( 0.00%) Whitespace . } . . fn raw_ident(&mut self) -> TokenKind { . debug_assert!(self.prev() == 'r' && self.first() == '#' && is_id_start(self.second())); . // Eat "#" symbol. . self.bump(); . // Eat the identifier part of RawIdent. . self.eat_identifier(); . RawIdent . } . 22,590 ( 0.00%) fn ident_or_unknown_prefix(&mut self) -> TokenKind { . debug_assert!(is_id_start(self.prev())); . // Start is already eaten, eat the rest of identifier. 9,036 ( 0.00%) self.eat_while(is_id_continue); . // Known prefixes must have been handled earlier. So if . // we see a prefix here, it is definitely an unknown prefix. 9,036 ( 0.00%) match self.first() { . '#' | '"' | '\'' => UnknownPrefix, 4,518 ( 0.00%) c if !c.is_ascii() && unic_emoji_char::is_emoji(c) => { . self.fake_ident_or_unknown_prefix() . } 4,518 ( 0.00%) _ => Ident, . } 18,072 ( 0.00%) } . . fn fake_ident_or_unknown_prefix(&mut self) -> TokenKind { . // Start is already eaten, eat the rest of identifier. . self.eat_while(|c| { . unicode_xid::UnicodeXID::is_xid_continue(c) . || (!c.is_ascii() && unic_emoji_char::is_emoji(c)) . || c == '\u{200d}' . }); -- line 515 ---------------------------------------- -- line 519 ---------------------------------------- . '#' | '"' | '\'' => UnknownPrefix, . _ => InvalidIdent, . } . } . . fn number(&mut self, first_digit: char) -> LiteralKind { . debug_assert!('0' <= self.prev() && self.prev() <= '9'); . let mut base = Base::Decimal; 4 ( 0.00%) if first_digit == '0' { . // Attempt to parse encoding base. . let has_digits = match self.first() { . 'b' => { . base = Base::Binary; . self.bump(); . self.eat_decimal_digits() . } . 'o' => { -- line 535 ---------------------------------------- -- line 555 ---------------------------------------- . if !has_digits { . return Int { base, empty_int: true }; . } . } else { . // No base prefix, parse number in the usual way. . self.eat_decimal_digits(); . }; . 12 ( 0.00%) match self.first() { . // Don't be greedy if this is actually an . // integer literal followed by field/method access or a range pattern . // (`0..2` and `12.foo()`) . '.' if self.second() != '.' && !is_id_start(self.second()) => { . // might have stuff after the ., and if it does, it needs to start . // with a number . self.bump(); . let mut empty_exponent = false; -- line 571 ---------------------------------------- -- line 585 ---------------------------------------- . self.bump(); . let empty_exponent = !self.eat_float_exponent(); . Float { base, empty_exponent } . } . _ => Int { base, empty_int: false }, . } . } . 154 ( 0.00%) fn lifetime_or_char(&mut self) -> TokenKind { . debug_assert!(self.prev() == '\''); . 44 ( 0.00%) let can_be_a_lifetime = if self.second() == '\'' { . // It's surely not a lifetime. . false . } else { . // If the first symbol is valid for identifier, it can be a lifetime. . // Also check if it's a number for a better error reporting (so '0 will . // be reported as invalid lifetime and not as unterminated char literal). . is_id_start(self.first()) || self.first().is_digit(10) . }; -- line 604 ---------------------------------------- -- line 617 ---------------------------------------- . // length greater than 1. . . let starts_with_number = self.first().is_digit(10); . . // Skip the literal contents. . // First symbol can be a number (which isn't a valid identifier start), . // so skip it without any checks. . self.bump(); 44 ( 0.00%) self.eat_while(is_id_continue); . . // Check if after skipping literal contents we've met a closing . // single quote (which means that user attempted to create a . // string with single quotes). 44 ( 0.00%) if self.first() == '\'' { . self.bump(); . let kind = Char { terminated: true }; . Literal { kind, suffix_start: self.len_consumed() } . } else { 44 ( 0.00%) Lifetime { starts_with_number } . } 132 ( 0.00%) } . . fn single_quoted_string(&mut self) -> bool { . debug_assert!(self.prev() == '\''); . // Check if it's a one-symbol literal. . if self.second() == '\'' && self.first() != '\\' { . self.bump(); . self.bump(); . return true; -- line 645 ---------------------------------------- -- line 677 ---------------------------------------- . false . } . . /// Eats double-quoted string and returns true . /// if string is terminated. . fn double_quoted_string(&mut self) -> bool { . debug_assert!(self.prev() == '"'); . while let Some(c) = self.bump() { 14,494 ( 0.00%) match c { . '"' => { . return true; . } 216 ( 0.00%) '\\' if self.first() == '\\' || self.first() == '"' => { . // Bump again to skip escaped character. . self.bump(); . } . _ => (), . } . } . // End of file reached. . false 195 ( 0.00%) } . . /// Eats the double-quoted string and returns `n_hashes` and an error if encountered. . fn raw_double_quoted_string(&mut self, prefix_len: usize) -> (u16, Option) { . // Wrap the actual function to handle the error with too many hashes. . // This way, it eats the whole raw string. . let (n_hashes, err) = self.raw_string_unvalidated(prefix_len); . // Only up to 65535 `#`s are allowed in raw strings . match u16::try_from(n_hashes) { -- line 706 ---------------------------------------- -- line 773 ---------------------------------------- . max_hashes = n_end_hashes; . } . } . } . . fn eat_decimal_digits(&mut self) -> bool { . let mut has_digits = false; . loop { 6 ( 0.00%) match self.first() { . '_' => { . self.bump(); . } 9 ( 0.00%) '0'..='9' => { . has_digits = true; . self.bump(); . } . _ => break, . } . } . has_digits 4 ( 0.00%) } . . fn eat_hexadecimal_digits(&mut self) -> bool { . let mut has_digits = false; . loop { . match self.first() { . '_' => { . self.bump(); . } -- line 801 ---------------------------------------- -- line 816 ---------------------------------------- . if self.first() == '-' || self.first() == '+' { . self.bump(); . } . self.eat_decimal_digits() . } . . // Eats the suffix of the literal, e.g. "_u8". . fn eat_literal_suffix(&mut self) { 394 ( 0.00%) self.eat_identifier(); . } . . // Eats the identifier. 591 ( 0.00%) fn eat_identifier(&mut self) { . if !is_id_start(self.first()) { . return; . } . self.bump(); . 5 ( 0.00%) self.eat_while(is_id_continue); 784 ( 0.00%) } . } 212,228 ( 0.04%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/util.rs -------------------------------------------------------------------------------- Ir -- line 41 ---------------------------------------- . write!(fmt, "{}", x) . } . _ => write!(fmt, "{}", self.val), . } . } . } . . fn int_size_and_signed<'tcx>(tcx: TyCtxt<'tcx>, ty: Ty<'tcx>) -> (Size, bool) { 27 ( 0.00%) let (int, signed) = match *ty.kind() { 63 ( 0.00%) Int(ity) => (Integer::from_int_ty(&tcx, ity), true), . Uint(uty) => (Integer::from_uint_ty(&tcx, uty), false), . _ => bug!("non integer discriminant"), . }; . (int.size(), signed) . } . . impl<'tcx> Discr<'tcx> { . /// Adds `1` to the value and wraps around if the maximum for the type is reached. 45 ( 0.00%) pub fn wrap_incr(self, tcx: TyCtxt<'tcx>) -> Self { 63 ( 0.00%) self.checked_add(tcx, 1).0 18 ( 0.00%) } 81 ( 0.00%) pub fn checked_add(self, tcx: TyCtxt<'tcx>, n: u128) -> (Self, bool) { . let (size, signed) = int_size_and_signed(tcx, self.ty); . let (val, oflo) = if signed { . let min = size.signed_int_min(); . let max = size.signed_int_max(); . let val = size.sign_extend(self.val) as i128; 36 ( 0.00%) assert!(n < (i128::MAX as u128)); . let n = n as i128; 63 ( 0.00%) let oflo = val > max - n; 36 ( 0.00%) let val = if oflo { min + (n - (max - val) - 1) } else { val + n }; . // zero the upper bits . let val = val as u128; . let val = size.truncate(val); . (val, oflo) . } else { . let max = size.unsigned_int_max(); . let val = self.val; . let oflo = val > max - n; . let val = if oflo { n - (max - val) - 1 } else { val + n }; . (val, oflo) . }; 36 ( 0.00%) (Self { val, ty: self.ty }, oflo) 81 ( 0.00%) } . } . . pub trait IntTypeExt { . fn to_ty<'tcx>(&self, tcx: TyCtxt<'tcx>) -> Ty<'tcx>; . fn disr_incr<'tcx>(&self, tcx: TyCtxt<'tcx>, val: Option>) -> Option>; . fn initial_discriminant<'tcx>(&self, tcx: TyCtxt<'tcx>) -> Discr<'tcx>; . } . . impl IntTypeExt for attr::IntType { . fn to_ty<'tcx>(&self, tcx: TyCtxt<'tcx>) -> Ty<'tcx> { 105 ( 0.00%) match *self { . SignedInt(ast::IntTy::I8) => tcx.types.i8, . SignedInt(ast::IntTy::I16) => tcx.types.i16, . SignedInt(ast::IntTy::I32) => tcx.types.i32, . SignedInt(ast::IntTy::I64) => tcx.types.i64, . SignedInt(ast::IntTy::I128) => tcx.types.i128, . SignedInt(ast::IntTy::Isize) => tcx.types.isize, . UnsignedInt(ast::UintTy::U8) => tcx.types.u8, . UnsignedInt(ast::UintTy::U16) => tcx.types.u16, . UnsignedInt(ast::UintTy::U32) => tcx.types.u32, . UnsignedInt(ast::UintTy::U64) => tcx.types.u64, . UnsignedInt(ast::UintTy::U128) => tcx.types.u128, . UnsignedInt(ast::UintTy::Usize) => tcx.types.usize, . } 12 ( 0.00%) } . . fn initial_discriminant<'tcx>(&self, tcx: TyCtxt<'tcx>) -> Discr<'tcx> { . Discr { val: 0, ty: self.to_ty(tcx) } 27 ( 0.00%) } . . fn disr_incr<'tcx>(&self, tcx: TyCtxt<'tcx>, val: Option>) -> Option> { . if let Some(val) = val { . assert_eq!(self.to_ty(tcx), val.ty); . let (new, oflo) = val.checked_add(tcx, 1); . if oflo { None } else { Some(new) } . } else { . Some(self.initial_discriminant(tcx)) -- line 121 ---------------------------------------- -- line 138 ---------------------------------------- . hcx.while_hashing_spans(false, |hcx| { . hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| { . ty.hash_stable(hcx, &mut hasher); . }); . }); . hasher.finish() . } . 35 ( 0.00%) pub fn has_error_field(self, ty: Ty<'tcx>) -> bool { 20 ( 0.00%) if let ty::Adt(def, substs) = *ty.kind() { . for field in def.all_fields() { 12 ( 0.00%) let field_ty = field.ty(self, substs); 12 ( 0.00%) if let Error(_) = field_ty.kind() { . return true; . } . } . } . false 40 ( 0.00%) } . . /// Attempts to returns the deeply last field of nested structures, but . /// does not apply any normalization in its search. Returns the same type . /// if input `ty` is not a structure at all. 1,818 ( 0.00%) pub fn struct_tail_without_normalization(self, ty: Ty<'tcx>) -> Ty<'tcx> { . let tcx = self; . tcx.struct_tail_with_normalize(ty, |ty| ty) 1,616 ( 0.00%) } . . /// Returns the deeply last field of nested structures, or the same type if . /// not a structure at all. Corresponds to the only possible unsized field, . /// and its type can be used to determine unsizing strategy. . /// . /// Should only be called if `ty` has no inference variables and does not . /// need its lifetimes preserved (e.g. as part of codegen); otherwise . /// normalization attempt may cause compiler bugs. 11 ( 0.00%) pub fn struct_tail_erasing_lifetimes( . self, . ty: Ty<'tcx>, . param_env: ty::ParamEnv<'tcx>, . ) -> Ty<'tcx> { . let tcx = self; . tcx.struct_tail_with_normalize(ty, |ty| tcx.normalize_erasing_regions(param_env, ty)) 9 ( 0.00%) } . . /// Returns the deeply last field of nested structures, or the same type if . /// not a structure at all. Corresponds to the only possible unsized field, . /// and its type can be used to determine unsizing strategy. . /// . /// This is parameterized over the normalization strategy (i.e. how to . /// handle `::Assoc` and `impl Trait`); pass the identity . /// function to indicate no normalization should take place. -- line 188 ---------------------------------------- -- line 189 ---------------------------------------- . /// . /// See also `struct_tail_erasing_lifetimes`, which is suitable for use . /// during codegen. . pub fn struct_tail_with_normalize( . self, . mut ty: Ty<'tcx>, . mut normalize: impl FnMut(Ty<'tcx>) -> Ty<'tcx>, . ) -> Ty<'tcx> { 1,015 ( 0.00%) let recursion_limit = self.recursion_limit(); . for iteration in 0.. { 236 ( 0.00%) if !recursion_limit.value_within_limit(iteration) { . return self.ty_error_with_message( . DUMMY_SP, . &format!("reached the recursion limit finding the struct tail for {}", ty), . ); . } 1,091 ( 0.00%) match *ty.kind() { 46 ( 0.00%) ty::Adt(def, substs) => { 92 ( 0.00%) if !def.is_struct() { . break; . } 45 ( 0.00%) match def.non_enum_variant().fields.last() { 99 ( 0.00%) Some(f) => ty = f.ty(self, substs), . None => break, . } . } . . ty::Tuple(tys) if let Some((&last_ty, _)) = tys.split_last() => { . ty = last_ty.expect_ty(); . } . -- line 219 ---------------------------------------- -- line 310 ---------------------------------------- . . _ => break, . } . } . (a, b) . } . . /// Calculate the destructor of a given type. 240 ( 0.00%) pub fn calculate_dtor( . self, . adt_did: DefId, . validate: impl Fn(Self, DefId) -> Result<(), ErrorReported>, . ) -> Option { 100 ( 0.00%) let drop_trait = self.lang_items().drop_trait()?; . self.ensure().coherent_trait(drop_trait); . 20 ( 0.00%) let ty = self.type_of(adt_did); 189 ( 0.00%) let (did, constness) = self.find_map_relevant_impl(drop_trait, ty, |impl_did| { 3 ( 0.00%) if let Some(item_id) = self.associated_item_def_ids(impl_did).first() { 3 ( 0.00%) if validate(self, impl_did).is_ok() { 7 ( 0.00%) return Some((*item_id, self.impl_constness(impl_did))); . } . } . None 13 ( 0.00%) })?; . . Some(ty::Destructor { did, constness }) 200 ( 0.00%) } . . /// Returns the set of types that are required to be alive in . /// order to run the destructor of `def` (see RFCs 769 and . /// 1238). . /// . /// Note that this returns only the constraints for the . /// destructor of `def` itself. For the destructors of the . /// contents, you need `adt_dtorck_constraint`. 220 ( 0.00%) pub fn destructor_constraints(self, def: &'tcx ty::AdtDef) -> Vec> { 102 ( 0.00%) let dtor = match def.destructor(self) { . None => { . debug!("destructor_constraints({:?}) - no dtor", def.did); . return vec![]; . } . Some(dtor) => dtor.did, . }; . . let impl_def_id = self.associated_item(dtor).container.id(); -- line 355 ---------------------------------------- -- line 371 ---------------------------------------- . // . // impl<#[may_dangle] P0, P1, P2> Drop for S . // . // We want to return the parameters (X, Y). For that, we match . // up the item-substs with the substs on the impl ADT, . // , and then look up which of the impl substs refer to . // parameters marked as pure. . 2 ( 0.00%) let impl_substs = match *self.type_of(impl_def_id).kind() { 7 ( 0.00%) ty::Adt(def_, substs) if def_ == def => substs, . _ => bug!(), . }; . 2 ( 0.00%) let item_substs = match *self.type_of(def.did).kind() { 7 ( 0.00%) ty::Adt(def_, substs) if def_ == def => substs, . _ => bug!(), . }; . . let result = iter::zip(item_substs, impl_substs) . .filter(|&(_, k)| { 2 ( 0.00%) match k.unpack() { . GenericArgKind::Lifetime(&ty::RegionKind::ReEarlyBound(ref ebr)) => { . !impl_generics.region_param(ebr, self).pure_wrt_drop . } . GenericArgKind::Type(&ty::TyS { kind: ty::Param(ref pt), .. }) => { 3 ( 0.00%) !impl_generics.type_param(pt, self).pure_wrt_drop . } . GenericArgKind::Const(&ty::Const { . val: ty::ConstKind::Param(ref pc), .. . }) => !impl_generics.const_param(pc, self).pure_wrt_drop, . GenericArgKind::Lifetime(_) . | GenericArgKind::Type(_) . | GenericArgKind::Const(_) => { . // Not a type, const or region param: this should be reported -- line 404 ---------------------------------------- -- line 405 ---------------------------------------- . // as an error. . false . } . } . }) . .map(|(item_param, _)| item_param) . .collect(); . debug!("destructor_constraint({:?}) = {:?}", def.did, result); 5 ( 0.00%) result 198 ( 0.00%) } . . /// Returns `true` if `def_id` refers to a closure (e.g., `|x| x * 2`). Note . /// that closures have a `DefId`, but the closure *expression* also . /// has a `HirId` that is located within the context where the . /// closure appears (and, sadly, a corresponding `NodeId`, since . /// those are not yet phased out). The parent of the closure's . /// `DefId` will also be the context where it appears. 326 ( 0.00%) pub fn is_closure(self, def_id: DefId) -> bool { 1,630 ( 0.00%) matches!(self.def_kind(def_id), DefKind::Closure | DefKind::Generator) 652 ( 0.00%) } . . /// Returns `true` if `def_id` refers to a definition that does not have its own . /// type-checking context, i.e. closure, generator or inline const. 214 ( 0.00%) pub fn is_typeck_child(self, def_id: DefId) -> bool { 3,510 ( 0.00%) matches!( 3,810 ( 0.00%) self.def_kind(def_id), . DefKind::Closure | DefKind::Generator | DefKind::InlineConst . ) 428 ( 0.00%) } . . /// Returns `true` if `def_id` refers to a trait (i.e., `trait Foo { ... }`). 751 ( 0.00%) pub fn is_trait(self, def_id: DefId) -> bool { 751 ( 0.00%) self.def_kind(def_id) == DefKind::Trait 1,502 ( 0.00%) } . . /// Returns `true` if `def_id` refers to a trait alias (i.e., `trait Foo = ...;`), . /// and `false` otherwise. 2,383 ( 0.00%) pub fn is_trait_alias(self, def_id: DefId) -> bool { 2,383 ( 0.00%) self.def_kind(def_id) == DefKind::TraitAlias 4,766 ( 0.00%) } . . /// Returns `true` if this `DefId` refers to the implicit constructor for . /// a tuple struct like `struct Foo(u32)`, and `false` otherwise. 6 ( 0.00%) pub fn is_constructor(self, def_id: DefId) -> bool { 2,078 ( 0.00%) matches!(self.def_kind(def_id), DefKind::Ctor(..)) 12 ( 0.00%) } . . /// Given the `DefId`, returns the `DefId` of the innermost item that . /// has its own type-checking context or "inference enviornment". . /// . /// For example, a closure has its own `DefId`, but it is type-checked . /// with the containing item. Similarly, an inline const block has its . /// own `DefId` but it is type-checked together with the containing item. . /// . /// Therefore, when we fetch the . /// `typeck` the closure, for example, we really wind up . /// fetching the `typeck` the enclosing fn item. 8,900 ( 0.00%) pub fn typeck_root_def_id(self, def_id: DefId) -> DefId { . let mut def_id = def_id; . while self.is_typeck_child(def_id) { . def_id = self.parent(def_id).unwrap_or_else(|| { . bug!("closure {:?} has no parent", def_id); . }); . } . def_id 7,120 ( 0.00%) } . . /// Given the `DefId` and substs a closure, creates the type of . /// `self` argument that the closure expects. For example, for a . /// `Fn` closure, this would return a reference type `&T` where . /// `T = closure_ty`. . /// . /// Returns `None` if this closure's kind has not yet been inferred. . /// This should only be possible during type checking. . /// . /// Note that the return value is a late-bound region and hence . /// wrapped in a binder. 18 ( 0.00%) pub fn closure_env_ty( . self, . closure_def_id: DefId, . closure_substs: SubstsRef<'tcx>, . env_region: ty::RegionKind, . ) -> Option> { . let closure_ty = self.mk_closure(closure_def_id, closure_substs); . let closure_kind_ty = closure_substs.as_closure().kind_ty(); 6 ( 0.00%) let closure_kind = closure_kind_ty.to_opt_closure_kind()?; 8 ( 0.00%) let env_ty = match closure_kind { . ty::ClosureKind::Fn => self.mk_imm_ref(self.mk_region(env_region), closure_ty), . ty::ClosureKind::FnMut => self.mk_mut_ref(self.mk_region(env_region), closure_ty), . ty::ClosureKind::FnOnce => closure_ty, . }; . Some(env_ty) 16 ( 0.00%) } . . /// Returns `true` if the node pointed to by `def_id` is a `static` item. 21 ( 0.00%) pub fn is_static(self, def_id: DefId) -> bool { . self.static_mutability(def_id).is_some() 24 ( 0.00%) } . . /// Returns `true` if this is a `static` item with the `#[thread_local]` attribute. . pub fn is_thread_local_static(self, def_id: DefId) -> bool { . self.codegen_fn_attrs(def_id).flags.contains(CodegenFnAttrFlags::THREAD_LOCAL) . } . . /// Returns `true` if the node pointed to by `def_id` is a mutable `static` item. . pub fn is_mutable_static(self, def_id: DefId) -> bool { -- line 510 ---------------------------------------- -- line 597 ---------------------------------------- . self.found_recursion = def_id == *self.primary_def_id.as_ref().unwrap(); . None . } . } . } . . impl<'tcx> TypeFolder<'tcx> for OpaqueTypeExpander<'tcx> { . fn tcx(&self) -> TyCtxt<'tcx> { 238 ( 0.00%) self.tcx . } . . fn fold_ty(&mut self, t: Ty<'tcx>) -> Ty<'tcx> { 598 ( 0.00%) if let ty::Opaque(def_id, substs) = t.kind { . self.expand_opaque_ty(def_id, substs).unwrap_or(t) 299 ( 0.00%) } else if t.has_opaque_types() { . t.super_fold_with(self) . } else { . t . } . } . } . . impl<'tcx> ty::TyS<'tcx> { -- line 619 ---------------------------------------- -- line 658 ---------------------------------------- . . /// Checks whether values of this type `T` are *moved* or *copied* . /// when referenced -- this amounts to a check for whether `T: . /// Copy`, but note that we **don't** consider lifetimes when . /// doing this check. This means that we may generate MIR which . /// does copies even when the type actually doesn't satisfy the . /// full requirements for the `Copy` trait (cc #29149) -- this . /// winds up being reported as an error during NLL borrow check. 890 ( 0.00%) pub fn is_copy_modulo_regions( . &'tcx self, . tcx_at: TyCtxtAt<'tcx>, . param_env: ty::ParamEnv<'tcx>, . ) -> bool { . tcx_at.is_copy_raw(param_env.and(self)) 712 ( 0.00%) } . . /// Checks whether values of this type `T` have a size known at . /// compile time (i.e., whether `T: Sized`). Lifetimes are ignored . /// for the purposes of this check, so it can be an . /// over-approximation in generic contexts, where one can have . /// strange rules like `>::Bar: Sized` that . /// actually carry lifetime requirements. 5,058 ( 0.00%) pub fn is_sized(&'tcx self, tcx_at: TyCtxtAt<'tcx>, param_env: ty::ParamEnv<'tcx>) -> bool { 2,810 ( 0.00%) self.is_trivially_sized(tcx_at.tcx) || tcx_at.is_sized_raw(param_env.and(self)) 3,372 ( 0.00%) } . . /// Checks whether values of this type `T` implement the `Freeze` . /// trait -- frozen types are those that do not contain an . /// `UnsafeCell` anywhere. This is a language concept used to . /// distinguish "true immutability", which is relevant to . /// optimization as well as the rules around static values. Note . /// that the `Freeze` trait is not exposed to end users and is . /// effectively an implementation detail. 423 ( 0.00%) pub fn is_freeze(&'tcx self, tcx_at: TyCtxtAt<'tcx>, param_env: ty::ParamEnv<'tcx>) -> bool { 235 ( 0.00%) self.is_trivially_freeze() || tcx_at.is_freeze_raw(param_env.and(self)) 282 ( 0.00%) } . . /// Fast path helper for testing if a type is `Freeze`. . /// . /// Returning true means the type is known to be `Freeze`. Returning . /// `false` means nothing -- could be `Freeze`, might not be. . fn is_trivially_freeze(&self) -> bool { . match self.kind() { . ty::Int(_) -- line 701 ---------------------------------------- -- line 731 ---------------------------------------- . pub fn is_unpin(&'tcx self, tcx_at: TyCtxtAt<'tcx>, param_env: ty::ParamEnv<'tcx>) -> bool { . self.is_trivially_unpin() || tcx_at.is_unpin_raw(param_env.and(self)) . } . . /// Fast path helper for testing if a type is `Unpin`. . /// . /// Returning true means the type is known to be `Unpin`. Returning . /// `false` means nothing -- could be `Unpin`, might not be. 235 ( 0.00%) fn is_trivially_unpin(&self) -> bool { 235 ( 0.00%) match self.kind() { . ty::Int(_) . | ty::Uint(_) . | ty::Float(_) . | ty::Bool . | ty::Char . | ty::Str . | ty::Never . | ty::Ref(..) -- line 748 ---------------------------------------- -- line 760 ---------------------------------------- . | ty::Generator(..) . | ty::GeneratorWitness(_) . | ty::Infer(_) . | ty::Opaque(..) . | ty::Param(_) . | ty::Placeholder(_) . | ty::Projection(_) => false, . } 329 ( 0.00%) } . . /// If `ty.needs_drop(...)` returns `true`, then `ty` is definitely . /// non-copy and *might* have a destructor attached; if it returns . /// `false`, then `ty` definitely has no destructor (i.e., no drop glue). . /// . /// (Note that this implies that if `ty` has a destructor attached, . /// then `needs_drop` will definitely return `true` for `ty`.) . /// . /// Note that this method is used to check eligible types in unions. . #[inline] 6,900 ( 0.00%) pub fn needs_drop(&'tcx self, tcx: TyCtxt<'tcx>, param_env: ty::ParamEnv<'tcx>) -> bool { . // Avoid querying in simple cases. 4,896 ( 0.00%) match needs_drop_components(self, &tcx.data_layout) { . Err(AlwaysRequiresDrop) => true, 2,804 ( 0.00%) Ok(components) => { . let query_ty = match *components { 1,894 ( 0.00%) [] => return false, . // If we've got a single component, call the query with that . // to increase the chance that we hit the query cache. 246 ( 0.00%) [component_ty] => component_ty, . _ => self, . }; . . // This doesn't depend on regions, so try to minimize distinct . // query keys used. . // If normalization fails, we just use `query_ty`. . let query_ty = . tcx.try_normalize_erasing_regions(param_env, query_ty).unwrap_or(query_ty); . . tcx.needs_drop_raw(param_env.and(query_ty)) . } . } 6,210 ( 0.00%) } . . /// Checks if `ty` has has a significant drop. . /// . /// Note that this method can return false even if `ty` has a destructor . /// attached; even if that is the case then the adt has been marked with . /// the attribute `rustc_insignificant_dtor`. . /// . /// Note that this method is used to check for change in drop order for -- line 809 ---------------------------------------- -- line 854 ---------------------------------------- . /// . /// This function is "shallow" because it may return `true` for a composite type whose fields . /// are not `StructuralEq`. For example, `[T; 4]` has structural equality regardless of `T` . /// because equality for arrays is determined by the equality of each array element. If you . /// want to know whether a given call to `PartialEq::eq` will proceed structurally all the way . /// down, you will need to use a type visitor. . #[inline] . pub fn is_structural_eq_shallow(&'tcx self, tcx: TyCtxt<'tcx>) -> bool { 32 ( 0.00%) match self.kind() { . // Look for an impl of both `PartialStructuralEq` and `StructuralEq`. . Adt(..) => tcx.has_structural_eq_impls(self), . . // Primitive types that satisfy `Eq`. . Bool | Char | Int(_) | Uint(_) | Str | Never => true, . . // Composite types that satisfy `Eq` when all of their fields do. . // -- line 870 ---------------------------------------- -- line 911 ---------------------------------------- . /// This method is idempotent, i.e. `ty.peel_refs().peel_refs() == ty.peel_refs()`. . /// . /// # Examples . /// . /// - `u8` -> `u8` . /// - `&'a mut u8` -> `u8` . /// - `&'a &'b u8` -> `u8` . /// - `&'a *const &'b u8 -> *const &'b u8` 156 ( 0.00%) pub fn peel_refs(&'tcx self) -> Ty<'tcx> { . let mut ty = self; 633 ( 0.00%) while let Ref(_, inner_ty, _) = ty.kind() { 107 ( 0.00%) ty = inner_ty; . } . ty 156 ( 0.00%) } . . pub fn outer_exclusive_binder(&'tcx self) -> DebruijnIndex { 274 ( 0.00%) self.outer_exclusive_binder 274 ( 0.00%) } . } . . pub enum ExplicitSelf<'tcx> { . ByValue, . ByReference(ty::Region<'tcx>, hir::Mutability), . ByRawPointer(hir::Mutability), . ByBox, . Other, -- line 937 ---------------------------------------- -- line 976 ---------------------------------------- . _ => Other, . } . } . } . . /// Returns a list of types such that the given type needs drop if and only if . /// *any* of the returned types need drop. Returns `Err(AlwaysRequiresDrop)` if . /// this type always needs drop. 5,782 ( 0.00%) pub fn needs_drop_components<'tcx>( . ty: Ty<'tcx>, . target_layout: &TargetDataLayout, . ) -> Result; 2]>, AlwaysRequiresDrop> { 4,956 ( 0.00%) match ty.kind() { . ty::Infer(ty::FreshIntTy(_)) . | ty::Infer(ty::FreshFloatTy(_)) . | ty::Bool . | ty::Int(_) . | ty::Uint(_) . | ty::Float(_) . | ty::Never . | ty::FnDef(..) -- line 996 ---------------------------------------- -- line 1003 ---------------------------------------- . . // Foreign types can never have destructors. . ty::Foreign(..) => Ok(SmallVec::new()), . . ty::Dynamic(..) | ty::Error(_) => Err(AlwaysRequiresDrop), . . ty::Slice(ty) => needs_drop_components(ty, target_layout), . ty::Array(elem_ty, size) => { 84 ( 0.00%) match needs_drop_components(elem_ty, target_layout) { 70 ( 0.00%) Ok(v) if v.is_empty() => Ok(v), 56 ( 0.00%) res => match size.val.try_to_bits(target_layout.pointer_size) { . // Arrays of size zero don't need drop, even if their element . // type does. . Some(0) => Ok(SmallVec::new()), 28 ( 0.00%) Some(_) => res, . // We don't know which of the cases above we are in, so . // return the whole type and let the caller decide what to . // do. . None => Ok(smallvec![ty]), . }, . } . } . // If any field needs drop, then the whole tuple does. 28 ( 0.00%) ty::Tuple(..) => ty.tuple_fields().try_fold(SmallVec::new(), move |mut acc, elem| { . acc.extend(needs_drop_components(elem, target_layout)?); . Ok(acc) . }), . . // These require checking for `Copy` bounds or `Adt` destructors. . ty::Adt(..) . | ty::Projection(..) . | ty::Param(_) . | ty::Bound(..) . | ty::Placeholder(..) . | ty::Opaque(..) . | ty::Infer(_) . | ty::Closure(..) 694 ( 0.00%) | ty::Generator(..) => Ok(smallvec![ty]), . } 4,956 ( 0.00%) } . 54 ( 0.00%) pub fn is_trivially_const_drop<'tcx>(ty: Ty<'tcx>) -> bool { 36 ( 0.00%) match *ty.kind() { . ty::Bool . | ty::Char . | ty::Int(_) . | ty::Uint(_) . | ty::Float(_) . | ty::Infer(ty::IntVar(_)) . | ty::Infer(ty::FloatVar(_)) . | ty::Str -- line 1053 ---------------------------------------- -- line 1070 ---------------------------------------- . // Not trivial because they have components, and instead of looking inside, . // we'll just perform trait selection. . ty::Closure(..) | ty::Generator(..) | ty::GeneratorWitness(_) | ty::Adt(..) => false, . . ty::Array(ty, _) | ty::Slice(ty) => is_trivially_const_drop(ty), . . ty::Tuple(tys) => tys.iter().all(|ty| is_trivially_const_drop(ty.expect_ty())), . } 72 ( 0.00%) } . . // Does the equivalent of . // ``` . // let v = self.iter().map(|p| p.fold_with(folder)).collect::>(); . // folder.tcx().intern_*(&v) . // ``` 103,514 ( 0.02%) pub fn fold_list<'tcx, F, T>( . list: &'tcx ty::List, . folder: &mut F, . intern: impl FnOnce(TyCtxt<'tcx>, &[T]) -> &'tcx ty::List, . ) -> Result<&'tcx ty::List, F::Error> . where . F: FallibleTypeFolder<'tcx>, . T: TypeFoldable<'tcx> + PartialEq + Copy, . { . let mut iter = list.iter(); . // Look for the first element that changed 303,313 ( 0.05%) match iter.by_ref().enumerate().find_map(|(i, t)| match t.try_fold_with(folder) { 616,285 ( 0.11%) Ok(new_t) if new_t == t => None, . new_t => Some((i, new_t)), . }) { . Some((i, Ok(new_t))) => { . // An element changed, prepare to intern the resulting list . let mut new_list = SmallVec::<[_; 8]>::with_capacity(list.len()); . new_list.extend_from_slice(&list[..i]); . new_list.push(new_t); . for t in iter { 2 ( 0.00%) new_list.push(t.try_fold_with(folder)?) . } 7,199 ( 0.00%) Ok(intern(folder.tcx(), &new_list)) . } . Some((_, Err(err))) => { . return Err(err); . } . None => Ok(list), . } 106,538 ( 0.02%) } . . #[derive(Copy, Clone, Debug, HashStable, TyEncodable, TyDecodable)] . pub struct AlwaysRequiresDrop; . . /// Normalizes all opaque types in the given value, replacing them . /// with their underlying types. 60 ( 0.00%) pub fn normalize_opaque_types<'tcx>( . tcx: TyCtxt<'tcx>, . val: &'tcx List>, . ) -> &'tcx List> { 105 ( 0.00%) let mut visitor = OpaqueTypeExpander { . seen_opaque_tys: FxHashSet::default(), . expanded_cache: FxHashMap::default(), . primary_def_id: None, . found_recursion: false, . found_any_recursion: false, . check_recursion: false, . tcx, . }; . val.fold_with(&mut visitor) 75 ( 0.00%) } . . pub fn provide(providers: &mut ty::query::Providers) { 2 ( 0.00%) *providers = ty::query::Providers { normalize_opaque_types, ..*providers } . } 185,560 ( 0.03%) -------------------------------------------------------------------------------- -- 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). 1,263 ( 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, 64,092 ( 0.01%) PartialEq, . Eq, . Hash, . TyEncodable, 9,450 ( 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"), . } . } . } . 91,344 ( 0.02%) #[derive(Clone, Debug, PartialEq, Eq, Copy, Hash, TyEncodable, TyDecodable, HashStable)] . pub enum Visibility { . /// Visible everywhere (including in other crates). . Public, . /// Visible only in the given crate-local module. . Restricted(DefId), . /// Not visible anywhere in the local crate. This is the visibility of private external items. . Invisible, . } . 211,155 ( 0.04%) #[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. 3,664 ( 0.00%) pub fn and(&mut self, constness: hir::Constness) -> hir::Constness { 5,496 ( 0.00%) match (constness, self) { . (hir::Constness::Const, BoundConstness::ConstIfConst) => hir::Constness::Const, . (_, this) => { 15,485 ( 0.00%) *this = BoundConstness::NotConst; . hir::Constness::NotConst . } . } 1,832 ( 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 { 6 ( 0.00%) if descendant.krate != ancestor.krate { . return false; . } . 630 ( 0.00%) while descendant != ancestor { 93 ( 0.00%) match self.parent(descendant) { . Some(parent) => descendant = parent, . None => return false, . } . } . true 8 ( 0.00%) } . } . . impl<'tcx> DefIdTree for TyCtxt<'tcx> { 336 ( 0.00%) fn parent(self, id: DefId) -> Option { . self.def_key(id).parent.map(|index| DefId { index, ..id }) 504 ( 0.00%) } . } . . impl Visibility { 320 ( 0.00%) pub fn from_hir(visibility: &hir::Visibility<'_>, id: hir::HirId, tcx: TyCtxt<'_>) -> Self { 960 ( 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 => { 516 ( 0.00%) Visibility::Restricted(tcx.parent_module(id).to_def_id()) . } . } 320 ( 0.00%) } . . /// Returns `true` if an item with this visibility is accessible from the given block. 15,237 ( 0.00%) pub fn is_accessible_from(self, module: DefId, tree: T) -> bool { 39,498 ( 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. 612 ( 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) 15,237 ( 0.00%) } . . /// Returns `true` if this visibility is at least as accessible as the given visibility 3,654 ( 0.00%) pub fn is_at_least(self, vis: Visibility, tree: T) -> bool { 8,010 ( 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,654 ( 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 { 1,458 ( 0.00%) matches!(self, Visibility::Public) 729 ( 0.00%) } . } . . /// The crate variances map is computed during typeck and contains the . /// variance of every item in the local crate. You should not use it . /// directly, because to do so will make your pass dependent on the . /// HIR of every item in the local crate. Instead, use . /// `tcx.variances_of()` to get the variance for a *particular* . /// item. -- line 365 ---------------------------------------- -- line 509 ---------------------------------------- . #[derive(Clone, Copy, Lift)] . pub struct Predicate<'tcx> { . inner: &'tcx PredicateInner<'tcx>, . } . . impl<'tcx> PartialEq for Predicate<'tcx> { . fn eq(&self, other: &Self) -> bool { . // `self.kind` is always interned. 259,433 ( 0.04%) ptr::eq(self.inner, other.inner) 174,083 ( 0.03%) } . } . . 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>> { 973,076 ( 0.17%) self.inner.kind . } . . /// Flips the polarity of a Predicate. . /// . /// Given `T: Trait` predicate it returns `T: !Trait` and given `T: !Trait` returns `T: Trait`. . pub fn flip_polarity(&self, tcx: TyCtxt<'tcx>) -> Option> { . let kind = self . .inner -- line 541 ---------------------------------------- -- line 567 ---------------------------------------- . flags: _, . outer_exclusive_binder: _, . } = self.inner; . . kind.hash_stable(hcx, hasher); . } . } . 3,215,486 ( 0.56%) #[derive(Clone, Copy, PartialEq, Eq, Hash, TyEncodable, TyDecodable)] 4,324,792 ( 0.75%) #[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. 15 ( 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. 103 ( 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. 88,290 ( 0.02%) 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> 9,810 ( 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)); 88,290 ( 0.02%) tcx.reuse_or_mk_predicate(self, ty::Binder::bind_with_vars(new, bound_vars)) 68,670 ( 0.01%) } . } . 24,365 ( 0.00%) #[derive(Clone, Copy, PartialEq, Eq, Hash, TyEncodable, TyDecodable)] 408,624 ( 0.07%) #[derive(HashStable, TypeFoldable)] . pub struct TraitPredicate<'tcx> { . pub trait_ref: TraitRef<'tcx>, . 389,522 ( 0.07%) pub constness: BoundConstness, . 589,312 ( 0.10%) pub polarity: ImplPolarity, . } . . pub type PolyTraitPredicate<'tcx> = ty::Binder<'tcx, TraitPredicate<'tcx>>; . . impl<'tcx> TraitPredicate<'tcx> { 109,560 ( 0.02%) pub fn remap_constness(&mut self, tcx: TyCtxt<'tcx>, param_env: &mut ParamEnv<'tcx>) { 95,949 ( 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` 84 ( 0.00%) param_env.remap_constness_with(self.constness) . } else { 13,653 ( 0.00%) *param_env = param_env.with_constness(self.constness.and(param_env.constness())) . } 82,170 ( 0.01%) } . . /// Remap the constness of this predicate before emitting it for diagnostics. . pub fn remap_constness_diag(&mut self, param_env: ParamEnv<'tcx>) { . // this is different to `remap_constness` that callees want to print this predicate . // in case of selection errors. `T: ~const Drop` bounds cannot end up here when the . // param_env is not const because we it is always satisfied in non-const contexts. . if let hir::Constness::NotConst = param_env.constness() { . self.constness = ty::BoundConstness::NotConst; . } . } . . pub fn def_id(self) -> DefId { 23,544 ( 0.00%) self.trait_ref.def_id 11,772 ( 0.00%) } . 14,320 ( 0.00%) pub fn self_ty(self) -> Ty<'tcx> { 42,960 ( 0.01%) self.trait_ref.self_ty() 28,640 ( 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() 85,354 ( 0.01%) } . 7 ( 0.00%) pub fn self_ty(self) -> ty::Binder<'tcx, Ty<'tcx>> { 28 ( 0.00%) self.map_bound(|trait_ref| trait_ref.self_ty()) 14 ( 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 . }); . } . } . 18 ( 0.00%) #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)] 8,972 ( 0.00%) #[derive(HashStable, TypeFoldable)] 26,750 ( 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)] 275 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub struct SubtypePredicate<'tcx> { 501 ( 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)] 6 ( 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>>; . 80,714 ( 0.01%) #[derive(Debug, Copy, Clone, PartialEq, Eq, Hash, PartialOrd, Ord, TyEncodable, TyDecodable)] 43,804 ( 0.01%) #[derive(HashStable, TypeFoldable)] . pub enum Term<'tcx> { 1 ( 0.00%) Ty(Ty<'tcx>), . Const(&'tcx Const<'tcx>), . } . . impl<'tcx> From> for Term<'tcx> { . fn from(ty: Ty<'tcx>) -> Self { . Term::Ty(ty) 405 ( 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> { 2,416 ( 0.00%) if let Term::Ty(ty) = self { Some(ty) } else { None } 1,208 ( 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. 56 ( 0.00%) #[derive(Copy, Clone, PartialEq, Eq, Hash, TyEncodable, TyDecodable)] 3,181 ( 0.00%) #[derive(HashStable, TypeFoldable)] . pub struct ProjectionPredicate<'tcx> { . pub projection_ty: ProjectionTy<'tcx>, 53,342 ( 0.01%) 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 { 4 ( 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. 7 ( 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. 10,786 ( 0.00%) self.skip_binder().projection_ty.item_def_id 5,393 ( 0.00%) } . } . . pub trait ToPolyTraitRef<'tcx> { . fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx>; . } . . impl<'tcx> ToPolyTraitRef<'tcx> for PolyTraitPredicate<'tcx> { 7,046 ( 0.00%) fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx> { 7,046 ( 0.00%) self.map_bound_ref(|trait_pred| trait_pred.trait_ref) 7,046 ( 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> { 2,355 ( 0.00%) fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> { 11,775 ( 0.00%) self.map_bound(PredicateKind::Trait).to_predicate(tcx) 4,710 ( 0.00%) } . } . . impl<'tcx> ToPredicate<'tcx> for PolyRegionOutlivesPredicate<'tcx> { . fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> { . self.map_bound(PredicateKind::RegionOutlives).to_predicate(tcx) . } . } . . impl<'tcx> ToPredicate<'tcx> for PolyTypeOutlivesPredicate<'tcx> { 6 ( 0.00%) fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> { 12 ( 0.00%) self.map_bound(PredicateKind::TypeOutlives).to_predicate(tcx) 12 ( 0.00%) } . } . . impl<'tcx> ToPredicate<'tcx> for PolyProjectionPredicate<'tcx> { 123 ( 0.00%) fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> { 615 ( 0.00%) self.map_bound(PredicateKind::Projection).to_predicate(tcx) 246 ( 0.00%) } . } . . impl<'tcx> Predicate<'tcx> { 89,274 ( 0.02%) pub fn to_opt_poly_trait_pred(self) -> Option> { . let predicate = self.kind(); 267,822 ( 0.05%) match predicate.skip_binder() { 197,520 ( 0.03%) 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(..) 5,133 ( 0.00%) | PredicateKind::TypeWellFormedFromEnv(..) => None, . } 89,274 ( 0.02%) } . 28,873 ( 0.00%) pub fn to_opt_type_outlives(self) -> Option> { . let predicate = self.kind(); 57,746 ( 0.01%) match predicate.skip_binder() { 3,948 ( 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(..) 27,557 ( 0.00%) | PredicateKind::TypeWellFormedFromEnv(..) => None, . } 28,873 ( 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]]`. 9,581 ( 0.00%) #[derive(Clone, Debug, TypeFoldable)] . pub struct InstantiatedPredicates<'tcx> { . pub predicates: Vec>, . pub spans: Vec, . } . . impl<'tcx> InstantiatedPredicates<'tcx> { 14 ( 0.00%) pub fn empty() -> InstantiatedPredicates<'tcx> { 8,104 ( 0.00%) InstantiatedPredicates { predicates: vec![], spans: vec![] } 14 ( 0.00%) } . . pub fn is_empty(&self) -> bool { . self.predicates.is_empty() 15 ( 0.00%) } . } . . #[derive(Copy, Clone, Debug, PartialEq, Eq, HashStable, TyEncodable, TyDecodable, TypeFoldable)] . pub struct OpaqueTypeKey<'tcx> { . pub def_id: DefId, . pub substs: SubstsRef<'tcx>, . } . -- line 1040 ---------------------------------------- -- 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. 15,273 ( 0.00%) pub fn next_universe(self) -> UniverseIndex { . UniverseIndex::from_u32(self.private.checked_add(1).unwrap()) 45,819 ( 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 { 6,564 ( 0.00%) self.private >= other.private 3,282 ( 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 { 592 ( 0.00%) self.private < other.private 296 ( 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 { 15,438 ( 0.00%) pub universe: UniverseIndex, 2,653 ( 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,798 ( 0.00%) #[derive(Copy, Clone, Debug, TypeFoldable, Lift, TyEncodable, TyDecodable)] . #[derive(PartialEq, Eq, PartialOrd, Ord)] . #[derive(Hash, HashStable)] . pub struct WithOptConstParam { 770 ( 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`. 790 ( 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 } 2,348 ( 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> { 324 ( 0.00%) if self.const_param_did.is_none() { 538 ( 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 } . } . 12 ( 0.00%) pub fn def_id_for_type_of(self) -> DefId { 9 ( 0.00%) if let Some(did) = self.const_param_did { did } else { self.did.to_def_id() } 3 ( 0.00%) } . } . . impl WithOptConstParam { 214 ( 0.00%) pub fn as_local(self) -> Option> { . self.did . .as_local() . .map(|did| WithOptConstParam { did, const_param_did: self.const_param_did }) 214 ( 0.00%) } . . pub fn as_const_arg(self) -> Option<(LocalDefId, DefId)> { 392 ( 0.00%) if let Some(param_did) = self.const_param_did { 188 ( 0.00%) if let Some(did) = self.did.as_local() { . return Some((did, param_did)); . } . } . . None 48 ( 0.00%) } . . pub fn is_local(self) -> bool { . self.did.is_local() . } . 67 ( 0.00%) pub fn def_id_for_type_of(self) -> DefId { . self.const_param_did.unwrap_or(self.did) 67 ( 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 { 8,062 ( 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 { 217,175 ( 0.04%) 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 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) { 2,778 ( 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 440 ( 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(), . ) 495 ( 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. 28,405 ( 0.00%) pub fn and>(self, value: T) -> ParamEnvAnd<'tcx, T> { . match self.reveal() { . Reveal::UserFacing => ParamEnvAnd { param_env: self, value }, . . Reveal::All => { 18 ( 0.00%) if value.is_global() { . ParamEnvAnd { param_env: self.without_caller_bounds(), value } . } else { . ParamEnvAnd { param_env: self, value } . } . } . } 27,432 ( 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> { 1,054 ( 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) . } . } . 745 ( 0.00%) #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, TypeFoldable)] . pub struct ParamEnvAnd<'tcx, T> { 9,140 ( 0.00%) pub param_env: ParamEnv<'tcx>, 97,352 ( 0.02%) pub value: T, . } . . impl<'tcx, T> ParamEnvAnd<'tcx, T> { . pub fn into_parts(self) -> (ParamEnv<'tcx>, T) { . (self.param_env, self.value) . } . . #[inline] . pub fn without_const(mut self) -> Self { . self.param_env = self.param_env.without_const(); 564 ( 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, . } . 160 ( 0.00%) bitflags! { 378 ( 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. 38,084 ( 0.01%) #[derive(Debug, HashStable, TyEncodable, TyDecodable)] . pub struct VariantDef { . /// `DefId` that identifies the variant itself. . /// If this variant belongs to a struct or union, then this is a copy of its `DefId`. . pub def_id: DefId, . /// `DefId` that identifies the variant's constructor. . /// If this variant is a struct variant, then this is `None`. . pub ctor_def_id: Option, . /// Variant or struct name. -- line 1571 ---------------------------------------- -- line 1592 ---------------------------------------- . /// `parent_did` is the `DefId` of the `AdtDef` representing the enum or struct that . /// owns this variant. It is used for checking if a struct has `#[non_exhaustive]` w/out having . /// to go through the redirect of checking the ctor's attributes - but compiling a small crate . /// requires loading the `AdtDef`s for all the structs in the universe (e.g., coherence for any . /// built-in trait), and we do not want to load attributes twice. . /// . /// If someone speeds up attribute loading to not be a performance concern, they can . /// remove this hack and use the constructor `DefId` everywhere. 208 ( 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; 26 ( 0.00%) if is_field_list_non_exhaustive { . flags |= VariantFlags::IS_FIELD_LIST_NON_EXHAUSTIVE; . } . 78 ( 0.00%) if recovered { . flags |= VariantFlags::IS_RECOVERED; . } . 234 ( 0.00%) VariantDef { . def_id: variant_did.unwrap_or(parent_did), . ctor_def_id, . name, . discr, 104 ( 0.00%) fields, . ctor_kind, . flags, . } 104 ( 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` 126 ( 0.00%) pub fn ident(&self, tcx: TyCtxt<'_>) -> Ident { 72 ( 0.00%) Ident::new(self.name, tcx.def_ident_span(self.def_id).unwrap()) 162 ( 0.00%) } . } . 22,406 ( 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), . } . 49,763 ( 0.01%) #[derive(Debug, HashStable, TyEncodable, TyDecodable)] . pub struct FieldDef { . pub did: DefId, . pub name: Symbol, . pub vis: Visibility, . } . 19 ( 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, 41,352 ( 0.01%) #[derive(Copy, Clone, Debug, Eq, PartialEq, TyEncodable, TyDecodable, Default, HashStable)] . pub struct ReprOptions { . pub int: Option, . pub align: Option, . pub pack: Option, . pub flags: ReprFlags, . /// The seed to be used for randomizing a type's layout . /// . /// Note: This could technically be a `[u8; 16]` (a `u128`) which would -- line 1705 ---------------------------------------- -- line 1706 ---------------------------------------- . /// be the "most accurate" hash as it'd encompass the item and crate . /// hash without loss, but it does pay the price of being larger. . /// Everything's a tradeoff, a `u64` seed should be sufficient for our . /// purposes (primarily `-Z randomize-layout`) . pub field_shuffle_seed: u64, . } . . impl ReprOptions { 65 ( 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 15 ( 0.00%) if let Some(user_seed) = tcx.sess.opts.debugging_opts.layout_seed { . field_shuffle_seed ^= user_seed; . } . 20 ( 0.00%) for attr in tcx.get_attrs(did).iter() { 415 ( 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 40 ( 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. 30 ( 0.00%) if !tcx.consider_optimizing(|| format!("Reorder fields of {:?}", tcx.def_path_str(did))) { . flags.insert(ReprFlags::IS_LINEAR); . } . 10 ( 0.00%) Self { int: size, align: max_align, pack: min_pack, flags, field_shuffle_seed } 140 ( 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 { 21 ( 0.00%) self.int.unwrap_or(attr::SignedInt(ast::IntTy::Isize)) 13 ( 0.00%) } . . /// Returns `true` if this `#[repr()]` should inhabit "smart enum . /// layout" optimizations, such as representing `Foo<&T>` as a . /// single pointer. . pub fn inhibit_enum_layout_opt(&self) -> bool { . self.c() || self.int.is_some() . } . -- line 1815 ---------------------------------------- -- line 1836 ---------------------------------------- . pub fn inhibit_union_abi_opt(&self) -> bool { . self.c() . } . } . . impl<'tcx> FieldDef { . /// Returns the type of this field. The resulting type is not normalized. The `subst` is . /// typically obtained via the second field of [`TyKind::Adt`]. 2,583 ( 0.00%) pub fn ty(&self, tcx: TyCtxt<'tcx>, subst: SubstsRef<'tcx>) -> Ty<'tcx> { 738 ( 0.00%) tcx.type_of(self.did).subst(tcx, subst) 2,952 ( 0.00%) } . . /// Computes the `Ident` of this variant by looking up the `Span` 735 ( 0.00%) pub fn ident(&self, tcx: TyCtxt<'_>) -> Ident { 420 ( 0.00%) Ident::new(self.name, tcx.def_ident_span(self.did).unwrap()) 945 ( 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> { 4,896 ( 0.00%) pub fn typeck_body(self, body: hir::BodyId) -> &'tcx TypeckResults<'tcx> { 1,224 ( 0.00%) self.typeck(self.hir().body_owner_def_id(body)) 4,896 ( 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 { -- line 1909 ---------------------------------------- -- line 1947 ---------------------------------------- . /// . /// 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)) . } . 51,820 ( 0.01%) pub fn opt_associated_item(self, def_id: DefId) -> Option<&'tcx AssocItem> { 20,728 ( 0.00%) if let DefKind::AssocConst | DefKind::AssocFn | DefKind::AssocTy = self.def_kind(def_id) { . Some(self.associated_item(def_id)) . } else { . None . } 46,638 ( 0.01%) } . 196 ( 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") 392 ( 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. 340 ( 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()) 68 ( 0.00%) || self.impl_trait_ref(def_id2).map_or(false, |tr| tr.references_error()) . { . return Some(ImplOverlapKind::Permitted { marker: false }); . } . 340 ( 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 = { 340 ( 0.00%) let is_marker_impl = |def_id: DefId| -> bool { 102 ( 0.00%) let trait_ref = self.impl_trait_ref(def_id); 102 ( 0.00%) trait_ref.map_or(false, |tr| self.trait_def(tr.def_id).is_marker) 272 ( 0.00%) }; 136 ( 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 { 136 ( 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 . } 272 ( 0.00%) } . . /// Returns `ty::VariantDef` if `res` refers to a struct, . /// or variant or their constructors, panics otherwise. 7 ( 0.00%) pub fn expect_variant_res(self, res: Res) -> &'tcx VariantDef { 12 ( 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), . } 8 ( 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. 40,500 ( 0.01%) pub fn get_attrs(self, did: DefId) -> Attributes<'tcx> { 12,150 ( 0.00%) if let Some(did) = did.as_local() { 11,358 ( 0.00%) self.hir().attrs(self.hir().local_def_id_to_hir_id(did)) . } else { . self.item_attrs(did) . } 32,400 ( 0.01%) } . . /// Determines whether an item is annotated with an attribute. 4,260 ( 0.00%) pub fn has_attr(self, did: DefId, attr: Symbol) -> bool { 13,347 ( 0.00%) self.sess.contains_name(&self.get_attrs(did), attr) . } . . /// Determines whether an item is annotated with `doc(hidden)`. 231 ( 0.00%) pub fn is_doc_hidden(self, did: DefId) -> bool { 33 ( 0.00%) self.get_attrs(did) . .iter() 2 ( 0.00%) .filter_map(|attr| if attr.has_name(sym::doc) { attr.meta_item_list() } else { None }) . .any(|items| items.iter().any(|item| item.has_name(sym::hidden))) 264 ( 0.00%) } . . /// Returns `true` if this is an `auto trait`. 3,605 ( 0.00%) pub fn trait_is_auto(self, trait_def_id: DefId) -> bool { 515 ( 0.00%) self.trait_def(trait_def_id).has_auto_impl 4,120 ( 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`. 896 ( 0.00%) pub fn trait_id_of_impl(self, def_id: DefId) -> Option { . self.impl_trait_ref(def_id).map(|tr| tr.def_id) 1,152 ( 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`. 118 ( 0.00%) pub fn impl_of_method(self, def_id: DefId) -> Option { 472 ( 0.00%) self.opt_associated_item(def_id).and_then(|trait_item| match trait_item.container { . TraitContainer(_) => None, . ImplContainer(def_id) => Some(def_id), . }) 236 ( 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. 2,936 ( 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. 367 ( 0.00%) use_name.name == def_name.name 1,065 ( 0.00%) && use_name . .span . .ctxt() . .hygienic_eq(def_name.span.ctxt(), self.expn_that_defined(def_parent_def_id)) 2,936 ( 0.00%) } . 378 ( 0.00%) pub fn adjust_ident(self, mut ident: Ident, scope: DefId) -> Ident { 84 ( 0.00%) ident.span.normalize_to_macros_2_0_and_adjust(self.expn_that_defined(scope)); 84 ( 0.00%) ident 336 ( 0.00%) } . 3,330 ( 0.00%) pub fn adjust_ident_and_get_scope( . self, . mut ident: Ident, . scope: DefId, . block: hir::HirId, . ) -> (Ident, DefId) { 370 ( 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) 1,480 ( 0.00%) .unwrap_or_else(|| self.parent_module(block).to_def_id()); 2,220 ( 0.00%) (ident, scope) 3,330 ( 0.00%) } . 56 ( 0.00%) pub fn is_object_safe(self, key: DefId) -> bool { . self.object_safety_violations(key).is_empty() 64 ( 0.00%) } . } . . /// Yields the parent function's `LocalDefId` if `def_id` is an `impl Trait` definition. 1,575 ( 0.00%) pub fn is_impl_trait_defn(tcx: TyCtxt<'_>, def_id: DefId) -> Option { 1,575 ( 0.00%) let def_id = def_id.as_local()?; 1,876 ( 0.00%) if let Node::Item(item) = tcx.hir().get_by_def_id(def_id) { 662 ( 0.00%) if let hir::ItemKind::OpaqueTy(ref opaque_ty) = item.kind { . return match opaque_ty.origin { . hir::OpaqueTyOrigin::FnReturn(parent) | hir::OpaqueTyOrigin::AsyncFn(parent) => { . Some(parent) . } . hir::OpaqueTyOrigin::TyAlias => None, . }; . } . } . None 2,100 ( 0.00%) } . . pub fn int_ty(ity: ast::IntTy) -> IntTy { . match ity { . ast::IntTy::Isize => IntTy::Isize, . ast::IntTy::I8 => IntTy::I8, . ast::IntTy::I16 => IntTy::I16, . ast::IntTy::I32 => IntTy::I32, . ast::IntTy::I64 => IntTy::I64, -- line 2216 ---------------------------------------- -- line 2231 ---------------------------------------- . . pub fn float_ty(fty: ast::FloatTy) -> FloatTy { . match fty { . ast::FloatTy::F32 => FloatTy::F32, . ast::FloatTy::F64 => FloatTy::F64, . } . } . 29 ( 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, . } 29 ( 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 ---------------------------------------- 3,043,040 ( 0.53%) -------------------------------------------------------------------------------- -- 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 { 564,091 ( 0.10%) ctrl & 0x80 == 0 . } . . /// Checks whether a control byte represents a special value (top bit is set). . #[inline] . fn is_special(ctrl: u8) -> bool { . ctrl & 0x80 != 0 . } . . /// Checks whether a special control value is EMPTY (just check 1 bit). . #[inline] . fn special_is_empty(ctrl: u8) -> bool { . debug_assert!(is_special(ctrl)); 47,551 ( 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::()); 13,360,885 ( 2.31%) 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" . ); . 99,588 ( 0.02%) self.stride += Group::WIDTH; 99,588 ( 0.02%) self.pos += self.stride; 85,321 ( 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. 45,694 ( 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. 93,825 ( 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. 24,492 ( 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 { 120,328 ( 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. 25,716 ( 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 = 88,678 ( 0.02%) size.checked_mul(buckets)?.checked_add(ctrl_align - 1)? & !(ctrl_align - 1); 122,140 ( 0.02%) let len = ctrl_offset.checked_add(buckets + Group::WIDTH)?; . . Some(( . unsafe { Layout::from_size_align_unchecked(len, ctrl_align) }, . ctrl_offset, . )) . } . } . -- line 263 ---------------------------------------- -- line 337 ---------------------------------------- . } . } . #[cfg_attr(feature = "inline-more", inline)] . pub unsafe fn drop(&self) { . self.as_ptr().drop_in_place(); . } . #[inline] . pub unsafe fn read(&self) -> T { 170 ( 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 { 159 ( 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 { 35 ( 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 { 2,582 ( 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")] 9,765 ( 0.00%) pub unsafe fn erase_no_drop(&mut self, item: &Bucket) { 9,765 ( 0.00%) let index = self.bucket_index(item); . self.table.erase(index); 19,530 ( 0.00%) } . . /// Erases an element from the table, dropping it in place. . #[cfg_attr(feature = "inline-more", inline)] . #[allow(clippy::needless_pass_by_value)] . #[allow(deprecated)] . pub unsafe fn erase(&mut self, item: Bucket) { . // Erase the element from the table first since drop might panic. 1,854 ( 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 { 17,676 ( 0.00%) self.erase_no_drop(&item); 44 ( 0.00%) item.read() . } . . /// Finds and removes an element from the table, returning it. . #[cfg_attr(feature = "inline-more", inline)] 236,541 ( 0.04%) pub fn remove_entry(&mut self, hash: u64, eq: impl FnMut(&T) -> bool) -> Option { . // Avoid `Option::map` because it bloats LLVM IR. 248 ( 0.00%) match self.find(hash, eq) { 1,327 ( 0.00%) Some(bucket) => Some(unsafe { self.remove(bucket) }), 32,846 ( 0.01%) None => None, . } 318,529 ( 0.06%) } . . /// Marks all table buckets as empty without dropping their contents. . #[cfg_attr(feature = "inline-more", inline)] . pub fn clear_no_drop(&mut self) { . self.table.clear_no_drop(); . } . . /// Removes all elements from the table without freeing the backing memory. . #[cfg_attr(feature = "inline-more", inline)] . pub fn clear(&mut self) { . // Ensure that the table is reset even if one of the drops panic . let mut self_ = guard(self, |self_| self_.clear_no_drop()); . unsafe { 1 ( 0.00%) self_.drop_elements(); . } . } . 7 ( 0.00%) unsafe fn drop_elements(&mut self) { 5,630 ( 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) { 129,851 ( 0.02%) if additional > self.table.growth_left { . // Avoid `Result::unwrap_or_else` because it bloats LLVM IR. 75,909 ( 0.01%) if self . .reserve_rehash(additional, hasher, Fallibility::Infallible) . .is_err() . { . unsafe { hint::unreachable_unchecked() } . } . } . } . -- line 660 ---------------------------------------- -- line 671 ---------------------------------------- . } else { . Ok(()) . } . } . . /// Out-of-line slow path for `reserve` and `try_reserve`. . #[cold] . #[inline(never)] 183,408 ( 0.03%) fn reserve_rehash( . &mut self, . additional: usize, . hasher: impl Fn(&T) -> u64, . fallibility: Fallibility, . ) -> Result<(), TryReserveError> { . unsafe { . self.table.reserve_rehash_inner( . additional, -- line 687 ---------------------------------------- -- line 690 ---------------------------------------- . TableLayout::new::(), . if mem::needs_drop::() { . Some(mem::transmute(ptr::drop_in_place:: as unsafe fn(*mut T))) . } else { . None . }, . ) . } 121,752 ( 0.02%) } . . /// Allocates a new table of a different size and moves the contents of the . /// current table into it. . fn resize( . &mut self, . capacity: usize, . hasher: impl Fn(&T) -> u64, . fallibility: Fallibility, -- line 706 ---------------------------------------- -- line 714 ---------------------------------------- . ) . } . } . . /// Inserts a new element into the table, and returns its raw bucket. . /// . /// This does not check if the given element already exists in the table. . #[cfg_attr(feature = "inline-more", inline)] 888,528 ( 0.15%) 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. 1,901 ( 0.00%) let old_ctrl = *self.table.ctrl(index); 524,708 ( 0.09%) 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 . } 653,250 ( 0.11%) } . . /// 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)] 158,488 ( 0.03%) pub fn insert_entry(&mut self, hash: u64, value: T, hasher: impl Fn(&T) -> u64) -> &mut T { 30 ( 0.00%) unsafe { self.insert(hash, value, hasher).as_mut() } 118,866 ( 0.02%) } . . /// 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"))] 145 ( 0.00%) pub unsafe fn insert_no_grow(&mut self, hash: u64, value: T) -> Bucket { 133,938 ( 0.02%) let (index, old_ctrl) = self.table.prepare_insert_slot(hash); 1,897 ( 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. 283,205 ( 0.05%) self.table.growth_left -= special_is_empty(old_ctrl) as usize; . . bucket.write(value); 224,283 ( 0.04%) self.table.items += 1; . bucket 276 ( 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] 1,008 ( 0.00%) pub fn find(&self, hash: u64, mut eq: impl FnMut(&T) -> bool) -> Option> { 839 ( 0.00%) let result = self.table.find_inner(hash, &mut |index| unsafe { 5,814 ( 0.00%) eq(self.bucket(index).as_ref()) 96 ( 0.00%) }); . . // Avoid `Option::map` because it bloats LLVM IR. . match result { 45 ( 0.00%) Some(index) => Some(unsafe { self.bucket(index) }), . None => None, . } 1,008 ( 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. 3,494 ( 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. 4,592 ( 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 { 181,387 ( 0.03%) self.len() == 0 . } . . /// Returns the number of buckets in the table. . #[inline] . pub fn buckets(&self) -> usize { . self.table.bucket_mask + 1 . } . -- line 936 ---------------------------------------- -- line 938 ---------------------------------------- . /// the caller to ensure that the `RawTable` outlives the `RawIter`. . /// Because we cannot make the `next` method unsafe on the `RawIter` . /// struct, we have to make the `iter` method unsafe. . #[inline] . pub unsafe fn iter(&self) -> RawIter { . let data = Bucket::from_base_index(self.data_end(), 0); . RawIter { . iter: RawIterRange::new(self.table.ctrl.as_ptr(), data, self.table.buckets()), 25,462 ( 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(); 2,460 ( 0.00%) let allocation = self.into_allocation(); 1,845 ( 0.00%) RawIntoIter { 3,075 ( 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)> { 1,153 ( 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(( 221 ( 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 { 242,177 ( 0.04%) Self { . // Be careful to cast the entire slice to a raw pointer. . ctrl: unsafe { NonNull::new_unchecked(Group::static_empty() as *const _ as *mut u8) }, . bucket_mask: 0, . items: 0, . growth_left: 0, . alloc, . } . } . } . . impl RawTableInner { . #[cfg_attr(feature = "inline-more", inline)] 156,770 ( 0.03%) unsafe fn new_uninitialized( . alloc: A, . table_layout: TableLayout, . buckets: usize, . fallibility: Fallibility, . ) -> Result { . debug_assert!(buckets.is_power_of_two()); . . // Avoid `Option::ok_or_else` because it bloats LLVM IR. -- line 1071 ---------------------------------------- -- line 1078 ---------------------------------------- . // exceed `isize::MAX`. We can skip this check on 64-bit systems since . // such allocations will never succeed anyways. . // . // This mirrors what Vec does in the standard library. . if mem::size_of::() < 8 && layout.size() > isize::MAX as usize { . return Err(fallibility.capacity_overflow()); . } . 33,660 ( 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)); 87,270 ( 0.02%) Ok(Self { . ctrl, 37,399 ( 0.01%) bucket_mask: buckets - 1, . items: 0, . growth_left: bucket_mask_to_capacity(buckets - 1), . alloc, . }) 114,210 ( 0.02%) } . . #[inline] 7,162 ( 0.00%) fn fallible_with_capacity( . alloc: A, . table_layout: TableLayout, . capacity: usize, . fallibility: Fallibility, . ) -> Result { 1,870 ( 0.00%) if capacity == 0 { 1,174 ( 0.00%) Ok(Self::new_in(alloc)) . } else { . unsafe { . let buckets = . capacity_to_buckets(capacity).ok_or_else(|| fallibility.capacity_overflow())?; . 71,513 ( 0.01%) let result = Self::new_uninitialized(alloc, table_layout, buckets, fallibility)?; . result.ctrl(0).write_bytes(EMPTY, result.num_ctrl_bytes()); . 4,074 ( 0.00%) Ok(result) . } . } 7,162 ( 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] 47,419 ( 0.01%) unsafe fn prepare_insert_slot(&self, hash: u64) -> (usize, u8) { . let index = self.find_insert_slot(hash); 47,419 ( 0.01%) let old_ctrl = *self.ctrl(index); . self.set_ctrl_h2(index, hash); . (index, old_ctrl) 94,838 ( 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)); 371,776 ( 0.06%) if let Some(bit) = group.match_empty_or_deleted().lowest_set_bit() { 1,078,455 ( 0.19%) let result = (probe_seq.pos + bit) & self.bucket_mask; . . // In tables smaller than the group width, trailing control . // bytes outside the range of the table are filled with . // EMPTY entries. These will unfortunately trigger a . // match, but once masked may point to a full bucket that . // is already occupied. We detect this situation here and . // perform a second scan starting at the beginning of the . // table. This second scan is guaranteed to find an empty . // slot (due to the load factor) before hitting the trailing . // control bytes (containing EMPTY). 490,561 ( 0.08%) 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); . 29,472 ( 0.01%) loop { . let group = unsafe { Group::load(self.ctrl(probe_seq.pos)) }; . 1,132,755 ( 0.20%) for bit in group.match_byte(h2_hash) { 2,325,818 ( 0.40%) let index = (probe_seq.pos + bit) & self.bucket_mask; . 1,430,905 ( 0.25%) if likely(eq(index)) { . return Some(index); . } . } . 318,319 ( 0.06%) if likely(group.match_empty().any_bit_set()) { . return None; . } . . probe_seq.move_next(self.bucket_mask); . } . } . . #[allow(clippy::mut_mut)] -- line 1198 ---------------------------------------- -- line 1225 ---------------------------------------- . Bucket::from_base_index(self.data_end(), index) . } . . #[inline] . unsafe fn bucket_ptr(&self, index: usize, size_of: usize) -> *mut u8 { . debug_assert_ne!(self.bucket_mask, 0); . debug_assert!(index < self.buckets()); . let base: *mut u8 = self.data_end().as_ptr(); 1,313,592 ( 0.23%) 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 { 6,448,009 ( 1.12%) pos: h1(hash) & self.bucket_mask, . stride: 0, . } . } . . /// Returns the index of a bucket for which a value must be inserted if there is enough rooom . /// in the table, otherwise returns error . #[cfg(feature = "raw")] . #[inline] -- line 1257 ---------------------------------------- -- line 1263 ---------------------------------------- . } else { . self.record_item_insert_at(index, old_ctrl, hash); . Ok(index) . } . } . . #[inline] . unsafe fn record_item_insert_at(&mut self, index: usize, old_ctrl: u8, hash: u64) { 655,795 ( 0.11%) self.growth_left -= special_is_empty(old_ctrl) as usize; . self.set_ctrl_h2(index, hash); 524,636 ( 0.09%) self.items += 1; . } . . #[inline] . fn is_in_same_group(&self, i: usize, new_i: usize, hash: u64) -> bool { . let probe_seq_pos = self.probe_seq(hash).pos; . let probe_index = . |pos: usize| (pos.wrapping_sub(probe_seq_pos) & self.bucket_mask) / Group::WIDTH; . probe_index(i) == probe_index(new_i) -- line 1281 ---------------------------------------- -- line 1312 ---------------------------------------- . // replicate the buckets at the end of the trailing group. For example . // with 2 buckets and a group size of 4, the control bytes will look . // like this: . // . // Real | Replicated . // --------------------------------------------- . // | [A] | [B] | [EMPTY] | [EMPTY] | [A] | [B] | . // --------------------------------------------- 1,028,727 ( 0.18%) let index2 = ((index.wrapping_sub(Group::WIDTH)) & self.bucket_mask) + Group::WIDTH; . 342,909 ( 0.06%) *self.ctrl(index) = ctrl; 342,982 ( 0.06%) *self.ctrl(index2) = ctrl; . } . . /// Returns a pointer to a control byte. . #[inline] . unsafe fn ctrl(&self, index: usize) -> *mut u8 { . debug_assert!(index < self.num_ctrl_bytes()); . self.ctrl.as_ptr().add(index) . } . . #[inline] . fn buckets(&self) -> usize { 91,804 ( 0.02%) self.bucket_mask + 1 . } . . #[inline] . fn num_ctrl_bytes(&self) -> usize { 81,211 ( 0.01%) self.bucket_mask + 1 + Group::WIDTH . } . . #[inline] . fn is_empty_singleton(&self) -> bool { 459,545 ( 0.08%) self.bucket_mask == 0 . } . . #[allow(clippy::mut_mut)] . #[inline] . unsafe fn prepare_resize( . &self, . table_layout: TableLayout, . capacity: usize, . fallibility: Fallibility, . ) -> Result, TryReserveError> { . debug_assert!(self.items <= capacity); . . // Allocate and initialize the new table. 789 ( 0.00%) let mut new_table = RawTableInner::fallible_with_capacity( . self.alloc.clone(), . table_layout, . capacity, . fallibility, . )?; 47,788 ( 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_| { 22,431 ( 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. 44,863 ( 0.01%) let new_items = match self.items.checked_add(additional) { . Some(new_items) => new_items, . None => return Err(fallibility.capacity_overflow()), . }; 44,862 ( 0.01%) let full_capacity = bucket_mask_to_capacity(self.bucket_mask); 94,341 ( 0.02%) if new_items <= full_capacity / 2 { . // Rehash in-place without re-allocating if we have plenty of spare . // capacity that is locked up due to DELETED entries. . self.rehash_in_place(hasher, layout.size, drop); . Ok(()) . } else { . // Otherwise, conservatively resize to at least the next size up . // to avoid churning deletes into frequent rehashes. . self.resize_inner( 22,431 ( 0.00%) usize::max(new_items, full_capacity + 1), . hasher, . fallibility, . layout, . ) . } . } . . /// Allocates a new table of a different size and moves the contents of the -- line 1418 ---------------------------------------- -- line 1424 ---------------------------------------- . #[inline(always)] . unsafe fn resize_inner( . &mut self, . capacity: usize, . hasher: &dyn Fn(&mut Self, usize) -> u64, . fallibility: Fallibility, . layout: TableLayout, . ) -> Result<(), TryReserveError> { 1,913 ( 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() { 204,689 ( 0.04%) if !is_full(*self.ctrl(i)) { . continue; . } . . // This may panic. . let hash = hasher(self, i); . . // We can use a simpler version of insert() here since: . // - there are no DELETED entries. -- line 1444 ---------------------------------------- -- line 1454 ---------------------------------------- . } . . // We successfully copied all elements without panicking. Now replace . // self with the new table. The old table will have its memory freed but . // the items will not be dropped (since they have been moved into the . // new table). . mem::swap(self, &mut new_table); . 22,431 ( 0.00%) Ok(()) . } . . /// Rehashes the contents of the table in place (i.e. without changing the . /// allocation). . /// . /// If `hasher` panics then some the table's contents may be lost. . /// . /// This uses dynamic dispatch to reduce the amount of -- line 1470 ---------------------------------------- -- line 1554 ---------------------------------------- . #[inline] . unsafe fn free_buckets(&mut self, table_layout: TableLayout) { . // Avoid `Option::unwrap_or_else` because it bloats LLVM IR. . let (layout, ctrl_offset) = match table_layout.calculate_layout_for(self.buckets()) { . Some(lco) => lco, . None => hint::unreachable_unchecked(), . }; . self.alloc.deallocate( 14,233 ( 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) { 1,546 ( 0.00%) if !self.is_empty_singleton() { . unsafe { . self.ctrl(0).write_bytes(EMPTY, self.num_ctrl_bytes()); . } . } 1,939 ( 0.00%) self.items = 0; 1,546 ( 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))); 43,313 ( 0.01%) let index_before = index.wrapping_sub(Group::WIDTH) & self.bucket_mask; . let empty_before = Group::load(self.ctrl(index_before)).match_empty(); . let empty_after = Group::load(self.ctrl(index)).match_empty(); . . // If we are inside a continuous block of Group::WIDTH full or deleted . // cells then a probe window may have seen a full block when trying to . // insert. We therefore need to keep that block non-empty so that . // lookups will continue searching to the next probe window. . // . // Note that in this context `leading_zeros` refers to the bytes at the . // end of a group, while `trailing_zeros` refers to the bytes at the . // beginning of a group. 173,252 ( 0.03%) let ctrl = if empty_before.leading_zeros() + empty_after.trailing_zeros() >= Group::WIDTH { . DELETED . } else { 214,635 ( 0.04%) self.growth_left += 1; . EMPTY . }; . self.set_ctrl(index, ctrl); 173,252 ( 0.03%) self.items -= 1; . } . } . . impl Clone for RawTable { 440 ( 0.00%) fn clone(&self) -> Self { 61 ( 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) . } . } 495 ( 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; 14 ( 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)] 207,884 ( 0.04%) fn drop(&mut self) { 198,297 ( 0.03%) if !self.table.is_empty_singleton() { . unsafe { . self.drop_elements(); . self.free_buckets(); . } . } 217,730 ( 0.04%) } . } . #[cfg(not(feature = "nightly"))] . impl Drop for RawTable { . #[cfg_attr(feature = "inline-more", inline)] . fn drop(&mut self) { . if !self.table.is_empty_singleton() { . unsafe { . self.drop_elements(); -- line 1813 ---------------------------------------- -- line 1817 ---------------------------------------- . } . } . . impl IntoIterator for RawTable { . type Item = T; . type IntoIter = RawIntoIter; . . #[cfg_attr(feature = "inline-more", inline)] 2,460 ( 0.00%) fn into_iter(self) -> RawIntoIter { . unsafe { . let iter = self.iter(); . self.into_iter_from(iter) . } 3,075 ( 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 { 58,774 ( 0.01%) if let Some(index) = self.current_group.lowest_set_bit() { 7,150 ( 0.00%) self.current_group = self.current_group.remove_lowest_bit(); 11,757 ( 0.00%) return Some(self.data.next_n(index)); . } . 52,853 ( 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). 1,291 ( 0.00%) self.current_group = Group::load_aligned(self.next_ctrl).match_full(); 594 ( 0.00%) self.data = self.data.next_n(Group::WIDTH); 2,966 ( 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) { 513 ( 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)] 9,469 ( 0.00%) fn next(&mut self) -> Option> { 21,946 ( 0.00%) if let Some(b) = self.iter.next() { 67,898 ( 0.01%) self.items -= 1; . Some(b) . } else { . // We don't check against items == 0 here to allow the . // compiler to optimize away the item count entirely if the . // iterator length is never queried. . debug_assert_eq!(self.items, 0); . None . } 18,938 ( 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)] 1,194 ( 0.00%) fn drop(&mut self) { . unsafe { . // Drop all remaining elements . self.iter.drop_elements(); . . // Free the table 5,387 ( 0.00%) if let Some((ptr, layout)) = self.allocation { . self.alloc.deallocate(ptr, layout); . } . } 98 ( 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)] 171 ( 0.00%) fn next(&mut self) -> Option { 54 ( 0.00%) unsafe { Some(self.iter.next()?.read()) } 342 ( 0.00%) } . . #[inline] . fn size_hint(&self) -> (usize, Option) { 3 ( 0.00%) self.iter.size_hint() . } . } . . impl ExactSizeIterator for RawIntoIter {} . impl FusedIterator for RawIntoIter {} . . /// Iterator which consumes elements without freeing the table storage. . pub struct RawDrain<'a, T, A: Allocator + Clone = Global> { -- line 2231 ---------------------------------------- -- line 2259 ---------------------------------------- . where . T: Sync, . A: Sync, . { . } . . impl Drop for RawDrain<'_, T, A> { . #[cfg_attr(feature = "inline-more", inline)] 96 ( 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. 12 ( 0.00%) self.orig_table . .as_ptr() . .copy_from_nonoverlapping(&*self.table, 1); . } 96 ( 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 ---------------------------------------- 3,758,104 ( 0.65%) -------------------------------------------------------------------------------- -- 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> { 215,098 ( 0.04%) ptr: NonZeroUsize, 656,703 ( 0.11%) 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; . 34,510 ( 0.01%) #[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> { 8,703 ( 0.00%) fn pack(self) -> GenericArg<'tcx> { 8,703 ( 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) . } . }; . 27,847 ( 0.00%) GenericArg { ptr: unsafe { NonZeroUsize::new_unchecked(ptr | tag) }, marker: PhantomData } 8,703 ( 0.00%) } . } . . impl<'tcx> fmt::Debug for GenericArg<'tcx> { . fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { . match self.unpack() { . GenericArgKind::Lifetime(lt) => lt.fmt(f), . GenericArgKind::Type(ty) => ty.fmt(f), . GenericArgKind::Const(ct) => ct.fmt(f), -- line 75 ---------------------------------------- -- line 85 ---------------------------------------- . . impl<'tcx> PartialOrd for GenericArg<'tcx> { . fn partial_cmp(&self, other: &GenericArg<'_>) -> Option { . Some(self.cmp(&other)) . } . } . . impl<'tcx> From> for GenericArg<'tcx> { 16,166 ( 0.00%) fn from(r: ty::Region<'tcx>) -> GenericArg<'tcx> { . GenericArgKind::Lifetime(r).pack() 16,166 ( 0.00%) } . } . . impl<'tcx> From> for GenericArg<'tcx> { 357,814 ( 0.06%) fn from(ty: Ty<'tcx>) -> GenericArg<'tcx> { . GenericArgKind::Type(ty).pack() 357,814 ( 0.06%) } . } . . impl<'tcx> From<&'tcx ty::Const<'tcx>> for GenericArg<'tcx> { . fn from(c: &'tcx ty::Const<'tcx>) -> GenericArg<'tcx> { . GenericArgKind::Const(c).pack() . } . } . . impl<'tcx> GenericArg<'tcx> { . #[inline] . pub fn unpack(self) -> GenericArgKind<'tcx> { . let ptr = self.ptr.get(); . unsafe { 3,498,880 ( 0.61%) match ptr & TAG_MASK { 13,192 ( 0.00%) REGION_TAG => GenericArgKind::Lifetime(&*((ptr & !TAG_MASK) as *const _)), 913,810 ( 0.16%) TYPE_TAG => GenericArgKind::Type(&*((ptr & !TAG_MASK) as *const _)), 28 ( 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"), . } 266 ( 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> { 1,248 ( 0.00%) self.unpack().encode(e) . } . } . . impl<'tcx, D: TyDecoder<'tcx>> Decodable for GenericArg<'tcx> { 43,515 ( 0.01%) fn decode(d: &mut D) -> GenericArg<'tcx> { 43,515 ( 0.01%) GenericArgKind::decode(d).pack() . } . } . . /// A substitution mapping generic parameters to new values. . pub type InternalSubsts<'tcx> = List>; . . pub type SubstsRef<'tcx> = &'tcx InternalSubsts<'tcx>; . . impl<'a, 'tcx> InternalSubsts<'tcx> { . /// Interpret these substitutions as the substitutions of a closure type. . /// Closure substitutions have a particular structure controlled by the . /// compiler that encodes information like the signature and closure kind; . /// see `ty::ClosureSubsts` struct for more comments. 23 ( 0.00%) pub fn as_closure(&'a self) -> ClosureSubsts<'a> { . ClosureSubsts { substs: self } 23 ( 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. 4,540 ( 0.00%) pub fn identity_for_item(tcx: TyCtxt<'tcx>, def_id: DefId) -> SubstsRef<'tcx> { 2,124 ( 0.00%) Self::for_item(tcx, def_id, |param, _| tcx.mk_param_from_def(param)) 4,086 ( 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. 19,189 ( 0.00%) 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); 7,844 ( 0.00%) Self::fill_item(&mut substs, tcx, defs, &mut mk_kind); 4,288 ( 0.00%) tcx.intern_substs(&substs) 19,296 ( 0.00%) } . . 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)) . }) . } . 31,298 ( 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>, . { 13,066 ( 0.00%) if let Some(def_id) = defs.parent { . let parent_defs = tcx.generics_of(def_id); 2,423 ( 0.00%) Self::fill_item(substs, tcx, parent_defs, mk_kind); . } . Self::fill_single(substs, defs, mk_kind) 24,776 ( 0.00%) } . 120 ( 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); 18,658 ( 0.00%) assert_eq!(param.index as usize, substs.len()); . substs.push(kind); . } 120 ( 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> { 89,352 ( 0.02%) 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. 1,610 ( 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); 460 ( 0.00%) tcx.mk_substs(target_substs.iter().chain(self.iter().skip(defs.params.len()))) 1,840 ( 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> { 114,807 ( 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`. 1,638,612 ( 0.28%) match self.len() { . 1 => { 310,667 ( 0.05%) let param0 = self[0].try_fold_with(folder)?; 887,372 ( 0.15%) if param0 == self[0] { Ok(self) } else { Ok(folder.tcx().intern_substs(&[param0])) } . } . 2 => { 87,840 ( 0.02%) let param0 = self[0].try_fold_with(folder)?; 247,487 ( 0.04%) let param1 = self[1].try_fold_with(folder)?; 268,846 ( 0.05%) if param0 == self[0] && param1 == self[1] { . Ok(self) . } else { 177,043 ( 0.03%) Ok(folder.tcx().intern_substs(&[param0, param1])) . } . } . 0 => Ok(self), . _ => { . let params: SmallVec<[_; 8]> = 7,775 ( 0.00%) self.iter().map(|k| k.try_fold_with(folder)).collect::>()?; 36 ( 0.00%) if params[..] == self[..] { . Ok(self) . } else { 7,442 ( 0.00%) Ok(folder.tcx().intern_substs(¶ms)) . } . } . } 147,840 ( 0.03%) } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow { 69,758 ( 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 { 176,653 ( 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> { 183,111 ( 0.03%) self.tcx . } . . fn fold_binder>( . &mut self, . t: ty::Binder<'tcx, T>, . ) -> ty::Binder<'tcx, T> { 237,600 ( 0.04%) self.binders_passed += 1; 59,005 ( 0.01%) let t = t.super_fold_with(self); 237,600 ( 0.04%) self.binders_passed -= 1; . t . } . 85,908 ( 0.01%) fn fold_region(&mut self, r: ty::Region<'tcx>) -> ty::Region<'tcx> { . // Note: This routine only handles regions that are bound on . // type declarations and other outer declarations, not those . // bound in *fn types*. Region substitution of the bound . // regions that appear in a function signature is done using . // the specialized routine `ty::replace_late_regions()`. 28,636 ( 0.00%) match *r { 3,750 ( 0.00%) ty::ReEarlyBound(data) => { 3,750 ( 0.00%) let rk = self.substs.get(data.index as usize).map(|k| k.unpack()); . match rk { 1,875 ( 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, . } 100,226 ( 0.02%) } . 678,855 ( 0.12%) fn fold_ty(&mut self, t: Ty<'tcx>) -> Ty<'tcx> { 226,285 ( 0.04%) if !t.needs_subst() { . return t; . } . 442,374 ( 0.08%) match *t.kind() { 578,560 ( 0.10%) ty::Param(p) => self.ty_for_param(p, t), 632,850 ( 0.11%) _ => t.super_fold_with(self), . } 604,050 ( 0.10%) } . 224 ( 0.00%) fn fold_const(&mut self, c: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> { 64 ( 0.00%) if let ty::ConstKind::Param(p) = c.val { . self.const_for_param(p, c) . } else { 288 ( 0.00%) c.super_fold_with(self) . } . } . . #[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. 231,424 ( 0.04%) 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 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() . ); . 444,313 ( 0.08%) 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> { 4,499 ( 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)] 1,032 ( 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. 858 ( 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, 150 ( 0.00%) pub self_ty: Ty<'tcx>, . } 2,072,696 ( 0.36%) -------------------------------------------------------------------------------- -- 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 { 207,403 ( 0.04%) 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 { 672 ( 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> { 4,690 ( 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> { 276,924 ( 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] 47,731 ( 0.01%) pub fn get(&self, k: &Q) -> Option<&V> . where . K: Borrow, . Q: Hash + Eq, . { . self.base.get(k) 65,842 ( 0.01%) } . . /// 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, . { 8,310 ( 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, . { 285 ( 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 { 487,215 ( 0.08%) 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, . { 12,749 ( 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 { 143 ( 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] 1,206 ( 0.00%) fn index(&self, key: &Q) -> &V { . self.get(key).expect("no entry found for key") 1,628 ( 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, . { 1,018,616 ( 0.18%) 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, . { 460,256 ( 0.08%) 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 { 11,246 ( 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 { 13,164 ( 0.00%) 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), . { 16 ( 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 { 12,126 ( 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 { 44,473 ( 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, . { 4 ( 0.00%) fn from_iter>(iter: T) -> HashMap { . let mut map = HashMap::with_hasher(Default::default()); . map.extend(iter); . map 5 ( 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) { 8,271 ( 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> { 2,439 ( 0.00%) match raw { . base::RustcEntry::Occupied(base) => Entry::Occupied(OccupiedEntry { base }), 235 ( 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> { 803,246 ( 0.14%) 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 ---------------------------------------- 497,776 ( 0.09%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_ast/src/token.rs -------------------------------------------------------------------------------- Ir -- line 12 ---------------------------------------- . use rustc_data_structures::sync::Lrc; . use rustc_macros::HashStable_Generic; . use rustc_span::symbol::{kw, sym}; . use rustc_span::symbol::{Ident, Symbol}; . use rustc_span::{self, edition::Edition, Span, DUMMY_SP}; . use std::borrow::Cow; . use std::{fmt, mem}; . 5,502 ( 0.00%) #[derive(Clone, Copy, PartialEq, Encodable, Decodable, Debug, HashStable_Generic)] . pub enum CommentKind { . Line, . Block, . } . 142 ( 0.00%) #[derive(Clone, PartialEq, Encodable, Decodable, Hash, Debug, Copy)] . #[derive(HashStable_Generic)] . pub enum BinOpToken { . Plus, . Minus, . Star, . Slash, . Percent, . Caret, . And, . Or, . Shl, . Shr, . } . . /// A delimiter token. 6,186 ( 0.00%) #[derive(Clone, PartialEq, Eq, Encodable, Decodable, Hash, Debug, Copy)] . #[derive(HashStable_Generic)] . pub enum DelimToken { . /// A round parenthesis (i.e., `(` or `)`). . Paren, . /// A square bracket (i.e., `[` or `]`). . Bracket, . /// A curly brace (i.e., `{` or `}`). . Brace, . /// An empty delimiter. . NoDelim, . } . 937 ( 0.00%) #[derive(Clone, Copy, PartialEq, Encodable, Decodable, Debug, HashStable_Generic)] . pub enum LitKind { . Bool, // AST only, must never appear in a `Token` . Byte, . Char, . Integer, . Float, . Str, . StrRaw(u16), // raw string delimited by `n` hash symbols . ByteStr, . ByteStrRaw(u16), // raw byte string delimited by `n` hash symbols . Err, . } . . /// A literal token. 4,383 ( 0.00%) #[derive(Clone, Copy, PartialEq, Encodable, Decodable, Debug, HashStable_Generic)] . pub struct Lit { . pub kind: LitKind, . pub symbol: Symbol, . pub suffix: Option, . } . . impl fmt::Display for Lit { 5 ( 0.00%) fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { 9 ( 0.00%) let Lit { kind, symbol, suffix } = *self; . match kind { . Byte => write!(f, "b'{}'", symbol)?, . Char => write!(f, "'{}'", symbol)?, 3 ( 0.00%) Str => write!(f, "\"{}\"", symbol)?, . StrRaw(n) => write!( . f, . "r{delim}\"{string}\"{delim}", . delim = "#".repeat(n as usize), . string = symbol . )?, . ByteStr => write!(f, "b\"{}\"", symbol)?, . ByteStrRaw(n) => write!( -- line 91 ---------------------------------------- -- line 92 ---------------------------------------- . f, . "br{delim}\"{string}\"{delim}", . delim = "#".repeat(n as usize), . string = symbol . )?, . Integer | Float | Bool | Err => write!(f, "{}", symbol)?, . } . 2 ( 0.00%) if let Some(suffix) = suffix { . write!(f, "{}", suffix)?; . } . . Ok(()) 5 ( 0.00%) } . } . . impl LitKind { . /// An English article for the literal token kind. . pub fn article(self) -> &'static str { . match self { . Integer | Err => "an", . _ => "a", -- line 113 ---------------------------------------- -- line 123 ---------------------------------------- . Float => "float", . Str | StrRaw(..) => "string", . ByteStr | ByteStrRaw(..) => "byte string", . Err => "error", . } . } . . crate fn may_have_suffix(self) -> bool { 2 ( 0.00%) matches!(self, Integer | Float | Err) . } . } . . impl Lit { . pub fn new(kind: LitKind, symbol: Symbol, suffix: Option) -> Lit { . Lit { kind, symbol, suffix } 320 ( 0.00%) } . } . 48 ( 0.00%) pub fn ident_can_begin_expr(name: Symbol, span: Span, is_raw: bool) -> bool { 84 ( 0.00%) let ident_token = Token::new(Ident(name, is_raw), span); . 24 ( 0.00%) !ident_token.is_reserved_ident() . || ident_token.is_path_segment_keyword() . || [ . kw::Async, . kw::Do, . kw::Box, . kw::Break, . kw::Const, . kw::Continue, -- line 152 ---------------------------------------- -- line 161 ---------------------------------------- . kw::True, . kw::Try, . kw::Unsafe, . kw::While, . kw::Yield, . kw::Static, . ] . .contains(&name) 60 ( 0.00%) } . . fn ident_can_begin_type(name: Symbol, span: Span, is_raw: bool) -> bool { 3,246 ( 0.00%) let ident_token = Token::new(Ident(name, is_raw), span); . 1,176 ( 0.00%) !ident_token.is_reserved_ident() . || ident_token.is_path_segment_keyword() . || [kw::Underscore, kw::For, kw::Impl, kw::Fn, kw::Unsafe, kw::Extern, kw::Typeof, kw::Dyn] . .contains(&name) . } . 1,153,113 ( 0.20%) #[derive(Clone, PartialEq, Encodable, Decodable, Debug, HashStable_Generic)] . pub enum TokenKind { . /* Expression-operator symbols. */ . Eq, . Lt, . Le, . EqEq, . Ne, . Ge, . Gt, . AndAnd, . OrOr, . Not, . Tilde, 11,016 ( 0.00%) BinOp(BinOpToken), . BinOpEq(BinOpToken), . . /* Structural symbols */ . At, . Dot, . DotDot, . DotDotDot, . DotDotEq, -- line 202 ---------------------------------------- -- line 208 ---------------------------------------- . LArrow, . FatArrow, . Pound, . Dollar, . Question, . /// Used by proc macros for representing lifetimes, not generated by lexer right now. . SingleQuote, . /// An opening delimiter (e.g., `{`). 18,642 ( 0.00%) OpenDelim(DelimToken), . /// A closing delimiter (e.g., `}`). 4,860 ( 0.00%) CloseDelim(DelimToken), . . /* Literals */ 3,089 ( 0.00%) Literal(Lit), . . /// Identifier token. . /// Do not forget about `NtIdent` when you want to match on identifiers. . /// It's recommended to use `Token::(ident,uninterpolate,uninterpolated_span)` to . /// treat regular and interpolated identifiers in the same way. 7,022 ( 0.00%) Ident(Symbol, /* is_raw */ bool), . /// Lifetime identifier token. . /// Do not forget about `NtLifetime` when you want to match on lifetime identifiers. . /// It's recommended to use `Token::(lifetime,uninterpolate,uninterpolated_span)` to . /// treat regular and interpolated lifetime identifiers in the same way. 84 ( 0.00%) Lifetime(Symbol), . 25 ( 0.00%) Interpolated(Lrc), . . /// A doc comment token. . /// `Symbol` is the doc comment's data excluding its "quotes" (`///`, `/**`, etc) . /// similarly to symbols in string literal tokens. 1,044 ( 0.00%) DocComment(CommentKind, ast::AttrStyle, Symbol), . . Eof, . } . . // `TokenKind` is used a lot. Make sure it doesn't unintentionally get bigger. . #[cfg(all(target_arch = "x86_64", target_pointer_width = "64"))] . rustc_data_structures::static_assert_size!(TokenKind, 16); . 77,230 ( 0.01%) #[derive(Clone, PartialEq, Encodable, Decodable, Debug, HashStable_Generic)] . pub struct Token { 4,022 ( 0.00%) pub kind: TokenKind, . pub span: Span, . } . . impl TokenKind { . pub fn lit(kind: LitKind, symbol: Symbol, suffix: Option) -> TokenKind { . Literal(Lit::new(kind, symbol, suffix)) . } . . // An approximation to proc-macro-style single-character operators used by rustc parser. . // If the operator token can be broken into two tokens, the first of which is single-character, . // then this function performs that operation, otherwise it returns `None`. 1,688 ( 0.00%) pub fn break_two_token_op(&self) -> Option<(TokenKind, TokenKind)> { 7,036 ( 0.00%) Some(match *self { . Le => (Lt, Eq), . EqEq => (Eq, Eq), . Ne => (Not, Eq), . Ge => (Gt, Eq), . AndAnd => (BinOp(And), BinOp(And)), . OrOr => (BinOp(Or), BinOp(Or)), . BinOp(Shl) => (Lt, Lt), . BinOp(Shr) => (Gt, Gt), -- line 271 ---------------------------------------- -- line 280 ---------------------------------------- . BinOpEq(Shl) => (Lt, Le), . BinOpEq(Shr) => (Gt, Ge), . DotDot => (Dot, Dot), . DotDotDot => (Dot, DotDot), . ModSep => (Colon, Colon), . RArrow => (BinOp(Minus), Gt), . LArrow => (Lt, BinOp(Minus)), . FatArrow => (Eq, Gt), 1,656 ( 0.00%) _ => return None, . }) 1,688 ( 0.00%) } . . /// Returns tokens that are likely to be typed accidentally instead of the current token. . /// Enables better error recovery when the wrong token is found. . pub fn similar_tokens(&self) -> Option> { . match *self { . Comma => Some(vec![Dot, Lt, Semi]), . Semi => Some(vec![Colon, Comma]), . FatArrow => Some(vec![Eq, RArrow]), . _ => None, . } . } . . pub fn should_end_const_arg(&self) -> bool { 1,752 ( 0.00%) matches!(self, Gt | Ge | BinOp(Shr) | BinOpEq(Shr)) 393 ( 0.00%) } . } . . impl Token { 12,668 ( 0.00%) pub fn new(kind: TokenKind, span: Span) -> Self { 45,058 ( 0.01%) Token { kind, span } 12,668 ( 0.00%) } . . /// Some token that will be thrown away later. 1,614 ( 0.00%) pub fn dummy() -> Self { . Token::new(TokenKind::Question, DUMMY_SP) 1,614 ( 0.00%) } . . /// Recovers a `Token` from an `Ident`. This creates a raw identifier if necessary. . pub fn from_ast_ident(ident: Ident) -> Self { 280 ( 0.00%) Token::new(Ident(ident.name, ident.is_raw_guess()), ident.span) . } . . /// Return this token by value and leave a dummy token in its place. 9,343 ( 0.00%) pub fn take(&mut self) -> Self { . mem::replace(self, Token::dummy()) 9,343 ( 0.00%) } . . /// For interpolated tokens, returns a span of the fragment to which the interpolated . /// token refers. For all other tokens this is just a regular span. . /// It is particularly important to use this for identifiers and lifetimes . /// for which spans affect name resolution and edition checks. . /// Note that keywords are also identifiers, so they should use this . /// if they keep spans or perform edition checks. . pub fn uninterpolated_span(&self) -> Span { 494 ( 0.00%) match &self.kind { . Interpolated(nt) => nt.span(), 247 ( 0.00%) _ => self.span, . } 247 ( 0.00%) } . . pub fn is_op(&self) -> bool { 28,029 ( 0.00%) !matches!( 9,343 ( 0.00%) self.kind, . OpenDelim(..) . | CloseDelim(..) . | Literal(..) . | DocComment(..) . | Ident(..) . | Lifetime(..) . | Interpolated(..) . | Eof . ) 9,343 ( 0.00%) } . . pub fn is_like_plus(&self) -> bool { 9,861 ( 0.00%) matches!(self.kind, BinOp(Plus) | BinOpEq(Plus)) 1,949 ( 0.00%) } . . /// Returns `true` if the token can appear at the start of an expression. 12 ( 0.00%) pub fn can_begin_expr(&self) -> bool { 60 ( 0.00%) match self.uninterpolate().kind { 108 ( 0.00%) Ident(name, is_raw) => 36 ( 0.00%) ident_can_begin_expr(name, self.span, is_raw), // value name or keyword . OpenDelim(..) | // tuple, array or block . Literal(..) | // literal . Not | // operator not . BinOp(Minus) | // unary minus . BinOp(Star) | // dereference . BinOp(Or) | OrOr | // closure . BinOp(And) | // reference . AndAnd | // double reference -- line 371 ---------------------------------------- -- line 376 ---------------------------------------- . Lifetime(..) | // labeled loop . Pound => true, // expression attributes . Interpolated(ref nt) => matches!(**nt, NtLiteral(..) | . NtExpr(..) | . NtBlock(..) | . NtPath(..)), . _ => false, . } 24 ( 0.00%) } . . /// Returns `true` if the token can appear at the start of a type. 2,624 ( 0.00%) pub fn can_begin_type(&self) -> bool { 3,787 ( 0.00%) match self.uninterpolate().kind { 4,869 ( 0.00%) Ident(name, is_raw) => 541 ( 0.00%) ident_can_begin_type(name, self.span, is_raw), // type name or keyword . OpenDelim(Paren) | // tuple . OpenDelim(Bracket) | // array . Not | // never . BinOp(Star) | // raw pointer . BinOp(And) | // reference . AndAnd | // double reference . Question | // maybe bound in trait object . Lifetime(..) | // lifetime bound in trait object . Lt | BinOp(Shl) | // associated path . ModSep => true, // global path . Interpolated(ref nt) => matches!(**nt, NtTy(..) | NtPath(..)), . _ => false, . } 3,936 ( 0.00%) } . . /// Returns `true` if the token can appear at the start of a const param. . pub fn can_begin_const_arg(&self) -> bool { 1,965 ( 0.00%) match self.kind { . OpenDelim(Brace) => true, . Interpolated(ref nt) => matches!(**nt, NtExpr(..) | NtBlock(..) | NtLiteral(..)), 393 ( 0.00%) _ => self.can_begin_literal_maybe_minus(), . } . } . . /// Returns `true` if the token can appear at the start of a generic bound. . pub fn can_begin_bound(&self) -> bool { . self.is_path_start() . || self.is_lifetime() . || self.is_keyword(kw::For) -- line 419 ---------------------------------------- -- line 427 ---------------------------------------- . } . . /// Returns `true` if the token is any literal, a minus (which can prefix a literal, . /// for example a '-42', or one of the boolean idents). . /// . /// In other words, would this token be a valid start of `parse_literal_maybe_minus`? . /// . /// Keep this in sync with and `Lit::from_token`, excluding unary negation. 395 ( 0.00%) pub fn can_begin_literal_maybe_minus(&self) -> bool { 3,924 ( 0.00%) match self.uninterpolate().kind { . Literal(..) | BinOp(Minus) => true, 1,524 ( 0.00%) Ident(name, false) if name.is_bool_lit() => true, . Interpolated(ref nt) => match &**nt { . NtLiteral(_) => true, . NtExpr(e) => match &e.kind { . ast::ExprKind::Lit(_) => true, . ast::ExprKind::Unary(ast::UnOp::Neg, e) => { . matches!(&e.kind, ast::ExprKind::Lit(_)) . } . _ => false, . }, . _ => false, . }, . _ => false, . } 790 ( 0.00%) } . . // A convenience function for matching on identifiers during parsing. . // Turns interpolated identifier (`$i: ident`) or lifetime (`$l: lifetime`) token . // into the regular identifier or lifetime token it refers to, . // otherwise returns the original token. 963 ( 0.00%) pub fn uninterpolate(&self) -> Cow<'_, Token> { 112,498 ( 0.02%) match &self.kind { 54 ( 0.00%) Interpolated(nt) => match **nt { . NtIdent(ident, is_raw) => { . Cow::Owned(Token::new(Ident(ident.name, is_raw), ident.span)) . } . NtLifetime(ident) => Cow::Owned(Token::new(Lifetime(ident.name), ident.span)), . _ => Cow::Borrowed(self), . }, . _ => Cow::Borrowed(self), . } 963 ( 0.00%) } . . /// Returns an identifier if this token is an identifier. 8,145 ( 0.00%) pub fn ident(&self) -> Option<(Ident, /* is_raw */ bool)> { . let token = self.uninterpolate(); 75,060 ( 0.01%) match token.kind { 385,724 ( 0.07%) Ident(name, is_raw) => Some((Ident::new(name, token.span), is_raw)), . _ => None, . } 72,280 ( 0.01%) } . . /// Returns a lifetime identifier if this token is a lifetime. 151 ( 0.00%) pub fn lifetime(&self) -> Option { . let token = self.uninterpolate(); 3,120 ( 0.00%) match token.kind { 324 ( 0.00%) Lifetime(name) => Some(Ident::new(name, token.span)), . _ => None, . } 1,057 ( 0.00%) } . . /// Returns `true` if the token is an identifier. . pub fn is_ident(&self) -> bool { . self.ident().is_some() 622 ( 0.00%) } . . /// Returns `true` if the token is a lifetime. 1,409 ( 0.00%) pub fn is_lifetime(&self) -> bool { . self.lifetime().is_some() 2,818 ( 0.00%) } . . /// Returns `true` if the token is an identifier whose name is the given . /// string slice. 338 ( 0.00%) pub fn is_ident_named(&self, name: Symbol) -> bool { . self.ident().map_or(false, |(ident, _)| ident.name == name) 676 ( 0.00%) } . . /// Returns `true` if the token is an interpolated path. . fn is_path(&self) -> bool { 7,388 ( 0.00%) if let Interpolated(ref nt) = self.kind { . if let NtPath(..) = **nt { . return true; . } . } . false . } . . /// Would `maybe_whole_expr` in `parser.rs` return `Ok(..)`? -- line 515 ---------------------------------------- -- line 522 ---------------------------------------- . } . } . . false . } . . // Is the token an interpolated block (`$b:block`)? . pub fn is_whole_block(&self) -> bool { 2 ( 0.00%) if let Interpolated(ref nt) = self.kind { . if let NtBlock(..) = **nt { . return true; . } . } . false 1 ( 0.00%) } . . /// Returns `true` if the token is either the `mut` or `const` keyword. . pub fn is_mutability(&self) -> bool { . self.is_keyword(kw::Mut) || self.is_keyword(kw::Const) . } . 272 ( 0.00%) pub fn is_qpath_start(&self) -> bool { 3,982 ( 0.00%) self == &Lt || self == &BinOp(Shl) 12 ( 0.00%) } . 7,420 ( 0.00%) pub fn is_path_start(&self) -> bool { 11,048 ( 0.00%) self == &ModSep . || self.is_qpath_start() . || self.is_path() . || self.is_path_segment_keyword() 1,595 ( 0.00%) || self.is_ident() && !self.is_reserved_ident() 9,275 ( 0.00%) } . . /// Returns `true` if the token is a given keyword, `kw`. 23,329 ( 0.00%) pub fn is_keyword(&self, kw: Symbol) -> bool { . self.is_non_raw_ident_where(|id| id.name == kw) 46,658 ( 0.01%) } . 132 ( 0.00%) pub fn is_path_segment_keyword(&self) -> bool { . self.is_non_raw_ident_where(Ident::is_path_segment_keyword) . } . . // Returns true for reserved identifiers used internally for elided lifetimes, . // unnamed method parameters, crate root module, error recovery etc. 186 ( 0.00%) pub fn is_special_ident(&self) -> bool { . self.is_non_raw_ident_where(Ident::is_special) . } . . /// Returns `true` if the token is a keyword used in the language. 186 ( 0.00%) pub fn is_used_keyword(&self) -> bool { . self.is_non_raw_ident_where(Ident::is_used_keyword) . } . . /// Returns `true` if the token is a keyword reserved for possible future use. 186 ( 0.00%) pub fn is_unused_keyword(&self) -> bool { . self.is_non_raw_ident_where(Ident::is_unused_keyword) . } . . /// Returns `true` if the token is either a special identifier or a keyword. . pub fn is_reserved_ident(&self) -> bool { . self.is_non_raw_ident_where(Ident::is_reserved) . } . . /// Returns `true` if the token is the identifier `true` or `false`. 132 ( 0.00%) pub fn is_bool_lit(&self) -> bool { 264 ( 0.00%) self.is_non_raw_ident_where(|id| id.name.is_bool_lit()) . } . . pub fn is_numeric_lit(&self) -> bool { . matches!( . self.kind, . Literal(Lit { kind: LitKind::Integer, .. }) | Literal(Lit { kind: LitKind::Float, .. }) . ) . } . . /// Returns `true` if the token is a non-raw identifier for which `pred` holds. 32 ( 0.00%) pub fn is_non_raw_ident_where(&self, pred: impl FnOnce(Ident) -> bool) -> bool { 156,359 ( 0.03%) match self.ident() { 1,594 ( 0.00%) Some((id, false)) => pred(id), . _ => false, . } 40 ( 0.00%) } . 31,300 ( 0.01%) pub fn glue(&self, joint: &Token) -> Option { 15,650 ( 0.00%) let kind = match self.kind { 12 ( 0.00%) Eq => match joint.kind { . Eq => EqEq, . Gt => FatArrow, . _ => return None, . }, 81 ( 0.00%) Lt => match joint.kind { . Eq => Le, . Lt => BinOp(Shl), . Le => BinOpEq(Shl), . BinOp(Minus) => LArrow, . _ => return None, . }, 1,099 ( 0.00%) Gt => match joint.kind { . Eq => Ge, . Gt => BinOp(Shr), . Ge => BinOpEq(Shr), . _ => return None, . }, 4 ( 0.00%) Not => match joint.kind { . Eq => Ne, . _ => return None, . }, 806 ( 0.00%) BinOp(op) => match joint.kind { . Eq => BinOpEq(op), 2 ( 0.00%) BinOp(And) if op == And => AndAnd, . BinOp(Or) if op == Or => OrOr, 126 ( 0.00%) Gt if op == Minus => RArrow, . _ => return None, . }, . Dot => match joint.kind { . Dot => DotDot, . DotDot => DotDotDot, . _ => return None, . }, . DotDot => match joint.kind { . Dot => DotDotDot, . Eq => DotDotEq, . _ => return None, . }, 868 ( 0.00%) Colon => match joint.kind { . Colon => ModSep, . _ => return None, . }, . SingleQuote => match joint.kind { . Ident(name, false) => Lifetime(Symbol::intern(&format!("'{}", name))), . _ => return None, . }, . . Le | EqEq | Ne | Ge | AndAnd | OrOr | Tilde | BinOpEq(..) | At | DotDotDot . | DotDotEq | Comma | Semi | ModSep | RArrow | LArrow | FatArrow | Pound | Dollar . | Question | OpenDelim(..) | CloseDelim(..) | Literal(..) | Ident(..) . | Lifetime(..) | Interpolated(..) | DocComment(..) | Eof => return None, . }; . 7,774 ( 0.00%) Some(Token::new(kind, self.span.to(joint.span))) 28,170 ( 0.00%) } . } . . impl PartialEq for Token { . fn eq(&self, rhs: &TokenKind) -> bool { 64,940 ( 0.01%) self.kind == *rhs . } . } . . #[derive(Clone, Encodable, Decodable)] . /// For interpolation during macro expansion. . pub enum Nonterminal { . NtItem(P), . NtBlock(P), -- line 675 ---------------------------------------- -- line 711 ---------------------------------------- . Path, . Vis, . TT, . } . . impl NonterminalKind { . /// The `edition` closure is used to get the edition for the given symbol. Doing . /// `span.edition()` is expensive, so we do it lazily. 72 ( 0.00%) pub fn from_symbol( . symbol: Symbol, . edition: impl FnOnce() -> Edition, . ) -> Option { 154 ( 0.00%) Some(match symbol { . sym::item => NonterminalKind::Item, . sym::block => NonterminalKind::Block, . sym::stmt => NonterminalKind::Stmt, . sym::pat => match edition() { . Edition::Edition2015 | Edition::Edition2018 => { . NonterminalKind::PatParam { inferred: true } . } . Edition::Edition2021 => NonterminalKind::PatWithOr, -- line 731 ---------------------------------------- -- line 737 ---------------------------------------- . sym::lifetime => NonterminalKind::Lifetime, . sym::literal => NonterminalKind::Literal, . sym::meta => NonterminalKind::Meta, . sym::path => NonterminalKind::Path, . sym::vis => NonterminalKind::Vis, . sym::tt => NonterminalKind::TT, . _ => return None, . }) 72 ( 0.00%) } . fn symbol(self) -> Symbol { . match self { . NonterminalKind::Item => sym::item, . NonterminalKind::Block => sym::block, . NonterminalKind::Stmt => sym::stmt, . NonterminalKind::PatParam { inferred: false } => sym::pat_param, . NonterminalKind::PatParam { inferred: true } | NonterminalKind::PatWithOr => sym::pat, . NonterminalKind::Expr => sym::expr, -- line 753 ---------------------------------------- -- line 765 ---------------------------------------- . . impl fmt::Display for NonterminalKind { . fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { . write!(f, "{}", self.symbol()) . } . } . . impl Nonterminal { 1 ( 0.00%) pub fn span(&self) -> Span { 5 ( 0.00%) match self { . NtItem(item) => item.span, . NtBlock(block) => block.span, . NtStmt(stmt) => stmt.span, . NtPat(pat) => pat.span, 1 ( 0.00%) NtExpr(expr) | NtLiteral(expr) => expr.span, . NtTy(ty) => ty.span, . NtIdent(ident, _) | NtLifetime(ident) => ident.span, . NtMeta(attr_item) => attr_item.span(), . NtPath(path) => path.span, . NtVis(vis) => vis.span, . NtTT(tt) => tt.span(), . } 2 ( 0.00%) } . } . . impl PartialEq for Nonterminal { . fn eq(&self, rhs: &Self) -> bool { . match (self, rhs) { . (NtIdent(ident_lhs, is_raw_lhs), NtIdent(ident_rhs, is_raw_rhs)) => { . ident_lhs == ident_rhs && is_raw_lhs == is_raw_rhs . } -- line 795 ---------------------------------------- 401,636 ( 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); . 14,162 ( 0.00%) if count == 8 { . ptr::copy_nonoverlapping(src, dst, 8); . return; . } . . let mut i = 0; 18,458 ( 0.00%) if i + 3 < count { . ptr::copy_nonoverlapping(src.add(i), dst.add(i), 4); . i += 4; . } . 39,971 ( 0.01%) if i + 1 < count { . ptr::copy_nonoverlapping(src.add(i), dst.add(i), 2); 4,422 ( 0.00%) i += 2 . } . 18,458 ( 0.00%) if i < count { 11,997 ( 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::(); 140,401 ( 0.02%) let nbuf = self.nbuf; . debug_assert!(size <= 8); . debug_assert!(nbuf < BUFFER_SIZE); . debug_assert!(nbuf + size < BUFFER_WITH_SPILL_SIZE); . 920,260 ( 0.16%) 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); . } . 282,840 ( 0.05%) self.nbuf = nbuf + size; . . return; . } . 43,462 ( 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)] 13,281 ( 0.00%) unsafe fn short_write_process_buffer(&mut self, x: T) { . let size = mem::size_of::(); 13,281 ( 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 { 132,810 ( 0.02%) let elem = self.buf.get_unchecked(i).assume_init().to_le(); 106,248 ( 0.02%) self.state.v3 ^= elem; . Sip24Rounds::c_rounds(&mut self.state); 119,529 ( 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. 62,469 ( 0.01%) self.nbuf = if size == 1 { 0 } else { nbuf + size - BUFFER_SIZE }; 53,124 ( 0.01%) self.processed += BUFFER_SIZE; 26,562 ( 0.00%) } . . // A write function for byte slices. . #[inline] . fn slice_write(&mut self, msg: &[u8]) { . let length = msg.len(); 5,557 ( 0.00%) let nbuf = self.nbuf; . debug_assert!(nbuf < BUFFER_SIZE); . 53,964 ( 0.01%) if nbuf + length < BUFFER_SIZE { . unsafe { . let dst = (self.buf.as_mut_ptr() as *mut u8).add(nbuf); . 19,892 ( 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); . } . } . 9,961 ( 0.00%) self.nbuf = nbuf + length; . . return; . } . 5,254 ( 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)] 3,845 ( 0.00%) unsafe fn slice_write_process_buffer(&mut self, msg: &[u8]) { . let length = msg.len(); 769 ( 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. 2,307 ( 0.00%) let valid_in_elem = nbuf % ELEM_SIZE; 769 ( 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. 1,538 ( 0.00%) let last = nbuf / ELEM_SIZE + 1; . . for i in 0..last { 5,737 ( 0.00%) let elem = self.buf.get_unchecked(i).assume_init().to_le(); 6,506 ( 0.00%) self.state.v3 ^= elem; . Sip24Rounds::c_rounds(&mut self.state); 11,474 ( 0.00%) self.state.v0 ^= elem; . } . . // Process the remaining element-sized chunks of input. . let mut processed = needed_in_elem; 1,538 ( 0.00%) let input_left = length - processed; 840 ( 0.00%) let elems_left = input_left / ELEM_SIZE; . let extra_bytes_left = input_left % ELEM_SIZE; . . for _ in 0..elems_left { 1,042 ( 0.00%) let elem = (msg.as_ptr().add(processed) as *const u64).read_unaligned().to_le(); 1,042 ( 0.00%) self.state.v3 ^= elem; . Sip24Rounds::c_rounds(&mut self.state); 1,042 ( 0.00%) self.state.v0 ^= elem; 2,084 ( 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); . 769 ( 0.00%) self.nbuf = extra_bytes_left; 3,845 ( 0.00%) self.processed += nbuf + processed; 4,614 ( 0.00%) } . . #[inline] . pub fn finish128(mut self) -> (u64, u64) { . debug_assert!(self.nbuf < BUFFER_SIZE); . . // Process full elements in buffer. 10,170 ( 0.00%) let last = self.nbuf / ELEM_SIZE; . . // Since we're consuming self, avoid updating members for a potential . // performance gain. 13,560 ( 0.00%) let mut state = self.state; . . for i in 0..last { 9,784 ( 0.00%) let elem = unsafe { self.buf.get_unchecked(i).assume_init().to_le() }; 9,784 ( 0.00%) state.v3 ^= elem; . Sip24Rounds::c_rounds(&mut state); 9,784 ( 0.00%) state.v0 ^= elem; . } . . // Get remaining partial element. 6,780 ( 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); 2,855 ( 0.00%) self.buf.get_unchecked(last).assume_init().to_le() . } . } else { . 0 . }; . . // Finalize the hash. 9,635 ( 0.00%) let length = self.processed + self.nbuf; 6,778 ( 0.00%) let b: u64 = ((length as u64 & 0xff) << 56) | elem; . 3,389 ( 0.00%) state.v3 ^= b; . Sip24Rounds::c_rounds(&mut state); 3,389 ( 0.00%) state.v0 ^= b; . 3,389 ( 0.00%) state.v2 ^= 0xee; . Sip24Rounds::d_rounds(&mut state); 10,862 ( 0.00%) let _0 = state.v0 ^ state.v1 ^ state.v2 ^ state.v3; . 4,082 ( 0.00%) state.v1 ^= 0xdd; . Sip24Rounds::d_rounds(&mut state); 4,082 ( 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) { 520,388 ( 0.09%) compress!(state); 561,854 ( 0.10%) compress!(state); . } . . #[inline] . fn d_rounds(state: &mut State) { 21,720 ( 0.00%) compress!(state); 21,720 ( 0.00%) compress!(state); 21,720 ( 0.00%) compress!(state); 18,332 ( 0.00%) compress!(state); . } . } 118,600 ( 0.02%) -------------------------------------------------------------------------------- -- 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] 36 ( 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] 1,476,036 ( 0.26%) 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 { 24 ( 0.00%) self << other . } . } . . forward_ref_binop! { impl const Shl, shl for $t, $f } . }; . } . . macro_rules! shl_impl_all { -- line 484 ---------------------------------------- 819,365 ( 0.14%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_ast/src/util/literal.rs -------------------------------------------------------------------------------- Ir -- line 19 ---------------------------------------- . InvalidFloatSuffix, . NonDecimalFloat(u32), . IntTooLarge, . } . . impl LitKind { . /// Converts literal token into a semantic literal. . fn from_lit_token(lit: token::Lit) -> Result { 391 ( 0.00%) let token::Lit { kind, symbol, suffix } = lit; 391 ( 0.00%) if suffix.is_some() && !kind.may_have_suffix() { . return Err(LitError::InvalidSuffix); . } . 5,062 ( 0.00%) Ok(match kind { . token::Bool => { 16 ( 0.00%) assert!(symbol.is_bool_lit()); . LitKind::Bool(symbol == kw::True) . } . token::Byte => { . return unescape_byte(symbol.as_str()) . .map(LitKind::Byte) . .map_err(|_| LitError::LexerError); . } . token::Char => { . return unescape_char(symbol.as_str()) . .map(LitKind::Char) . .map_err(|_| LitError::LexerError); . } . . // There are some valid suffixes for integer and float literals, . // so all the handling is done internally. 6 ( 0.00%) token::Integer => return integer_lit(symbol, suffix), . token::Float => return float_lit(symbol, suffix), . . token::Str => { . // If there are no characters requiring special treatment we can . // reuse the symbol from the token. Otherwise, we must generate a . // new symbol because the string in the LitKind is different to the . // string in the token. 1,155 ( 0.00%) let s = symbol.as_str(); . let symbol = . if s.contains(&['\\', '\r']) { . let mut buf = String::with_capacity(s.len()); 106 ( 0.00%) let mut error = Ok(()); 424 ( 0.00%) unescape_literal(&s, Mode::Str, &mut |_, unescaped_char| { 213,802 ( 0.04%) match unescaped_char { 213,802 ( 0.04%) Ok(c) => buf.push(c), . Err(err) => { . if err.is_fatal() { . error = Err(LitError::LexerError); . } . } . } . }); 159 ( 0.00%) error?; 53 ( 0.00%) Symbol::intern(&buf) . } else { 664 ( 0.00%) symbol . }; 1,925 ( 0.00%) LitKind::Str(symbol, ast::StrStyle::Cooked) . } . token::StrRaw(n) => { . // Ditto. . let s = symbol.as_str(); . let symbol = . if s.contains('\r') { . let mut buf = String::with_capacity(s.len()); . let mut error = Ok(()); -- line 86 ---------------------------------------- -- line 138 ---------------------------------------- . } else { . symbol.to_string().into_bytes() . }; . . LitKind::ByteStr(bytes.into()) . } . token::Err => LitKind::Err(symbol), . }) 2 ( 0.00%) } . . /// Attempts to recover a token from semantic literal. . /// This function is used when the original token doesn't exist (e.g. the literal is created . /// by an AST-based macro) or unavailable (e.g. from HIR pretty-printing). 264 ( 0.00%) pub fn to_lit_token(&self) -> token::Lit { 256 ( 0.00%) let (kind, symbol, suffix) = match *self { 54 ( 0.00%) LitKind::Str(symbol, ast::StrStyle::Cooked) => { . // Don't re-intern unless the escaped string is different. 72 ( 0.00%) let s = symbol.as_str(); 36 ( 0.00%) let escaped = s.escape_default().to_string(); 37 ( 0.00%) let symbol = if s == escaped { symbol } else { Symbol::intern(&escaped) }; . (token::Str, symbol, None) . } . LitKind::Str(symbol, ast::StrStyle::Raw(n)) => (token::StrRaw(n), symbol, None), . LitKind::ByteStr(ref bytes) => { . let string = bytes . .iter() . .cloned() . .flat_map(ascii::escape_default) -- line 165 ---------------------------------------- -- line 166 ---------------------------------------- . .map(Into::::into) . .collect::(); . (token::ByteStr, Symbol::intern(&string), None) . } . LitKind::Byte(byte) => { . let string: String = ascii::escape_default(byte).map(Into::::into).collect(); . (token::Byte, Symbol::intern(&string), None) . } 14 ( 0.00%) LitKind::Char(ch) => { . let string: String = ch.escape_default().map(Into::::into).collect(); 14 ( 0.00%) (token::Char, Symbol::intern(&string), None) . } 70 ( 0.00%) LitKind::Int(n, ty) => { 42 ( 0.00%) let suffix = match ty { . ast::LitIntType::Unsigned(ty) => Some(ty.name()), . ast::LitIntType::Signed(ty) => Some(ty.name()), . ast::LitIntType::Unsuffixed => None, . }; 70 ( 0.00%) (token::Integer, sym::integer(n), suffix) . } . LitKind::Float(symbol, ty) => { . let suffix = match ty { . ast::LitFloatType::Suffixed(ty) => Some(ty.name()), . ast::LitFloatType::Unsuffixed => None, . }; . (token::Float, symbol, suffix) . } 15 ( 0.00%) LitKind::Bool(value) => { 20 ( 0.00%) let symbol = if value { kw::True } else { kw::False }; . (token::Bool, symbol, None) . } . LitKind::Err(symbol) => (token::Err, symbol, None), . }; . . token::Lit::new(kind, symbol, suffix) 308 ( 0.00%) } . } . . impl Lit { . /// Converts literal token into an AST literal. 5,474 ( 0.00%) pub fn from_lit_token(token: token::Lit, span: Span) -> Result { 2,346 ( 0.00%) Ok(Lit { token, kind: LitKind::from_lit_token(token)?, span }) 3,519 ( 0.00%) } . . /// Converts arbitrary token into an AST literal. . /// . /// Keep this in sync with `Token::can_begin_literal_or_bool` excluding unary negation. 8,001 ( 0.00%) pub fn from_token(token: &Token) -> Result { 6,175 ( 0.00%) let lit = match token.uninterpolate().kind { 3,012 ( 0.00%) token::Ident(name, false) if name.is_bool_lit() => { . token::Lit::new(token::Bool, name, None) . } 1,548 ( 0.00%) token::Literal(lit) => lit, 6 ( 0.00%) token::Interpolated(ref nt) => { 12 ( 0.00%) if let token::NtExpr(expr) | token::NtLiteral(expr) = &**nt { 4 ( 0.00%) if let ast::ExprKind::Lit(lit) = &expr.kind { 20 ( 0.00%) return Ok(lit.clone()); . } . } . return Err(LitError::NotLiteral); . } . _ => return Err(LitError::NotLiteral), . }; . 1,173 ( 0.00%) Lit::from_lit_token(lit, token.span) 8,001 ( 0.00%) } . . /// Attempts to recover an AST literal from semantic literal. . /// This function is used when the original token doesn't exist (e.g. the literal is created . /// by an AST-based macro) or unavailable (e.g. from HIR pretty-printing). 264 ( 0.00%) pub fn from_lit_kind(kind: LitKind, span: Span) -> Lit { 396 ( 0.00%) Lit { token: kind.to_lit_token(), kind, span } 220 ( 0.00%) } . . /// Losslessly convert an AST literal into a token. . pub fn to_token(&self) -> Token { . let kind = match self.token.kind { . token::Bool => token::Ident(self.token.symbol, false), . _ => token::Literal(self.token), . }; . Token::new(kind, self.span) . } . } . 18 ( 0.00%) fn strip_underscores(symbol: Symbol) -> Symbol { . // Do not allocate a new string unless necessary. 6 ( 0.00%) let s = symbol.as_str(); 2 ( 0.00%) if s.contains('_') { . let mut s = s.to_string(); . s.retain(|c| c != '_'); . return Symbol::intern(&s); . } 2 ( 0.00%) symbol 18 ( 0.00%) } . . fn filtered_float_lit( . symbol: Symbol, . suffix: Option, . base: u32, . ) -> Result { . debug!("filtered_float_lit: {:?}, {:?}, {:?}", symbol, suffix, base); . if base != 10 { -- line 267 ---------------------------------------- -- line 280 ---------------------------------------- . }) . } . . fn float_lit(symbol: Symbol, suffix: Option) -> Result { . debug!("float_lit: {:?}, {:?}", symbol, suffix); . filtered_float_lit(strip_underscores(symbol), suffix, 10) . } . 18 ( 0.00%) fn integer_lit(symbol: Symbol, suffix: Option) -> Result { . debug!("integer_lit: {:?}, {:?}", symbol, suffix); 8 ( 0.00%) let symbol = strip_underscores(symbol); 10 ( 0.00%) let s = symbol.as_str(); . 2 ( 0.00%) let base = match s.as_bytes() { 4 ( 0.00%) [b'0', b'x', ..] => 16, . [b'0', b'o', ..] => 8, . [b'0', b'b', ..] => 2, . _ => 10, . }; . 4 ( 0.00%) let ty = match suffix { 4 ( 0.00%) Some(suf) => match suf { . sym::isize => ast::LitIntType::Signed(ast::IntTy::Isize), . sym::i8 => ast::LitIntType::Signed(ast::IntTy::I8), . sym::i16 => ast::LitIntType::Signed(ast::IntTy::I16), . sym::i32 => ast::LitIntType::Signed(ast::IntTy::I32), . sym::i64 => ast::LitIntType::Signed(ast::IntTy::I64), . sym::i128 => ast::LitIntType::Signed(ast::IntTy::I128), . sym::usize => ast::LitIntType::Unsigned(ast::UintTy::Usize), . sym::u8 => ast::LitIntType::Unsigned(ast::UintTy::U8), -- line 309 ---------------------------------------- -- line 314 ---------------------------------------- . // `1f64` and `2f32` etc. are valid float literals, and . // `fxxx` looks more like an invalid float literal than invalid integer literal. . _ if suf.as_str().starts_with('f') => return filtered_float_lit(symbol, suffix, base), . _ => return Err(LitError::InvalidIntSuffix), . }, . _ => ast::LitIntType::Unsuffixed, . }; . 4 ( 0.00%) let s = &s[if base != 10 { 2 } else { 0 }..]; 8 ( 0.00%) u128::from_str_radix(s, base).map(|i| LitKind::Int(i, ty)).map_err(|_| { . // Small bases are lexed as if they were base 10, e.g, the string . // might be `0b10201`. This will cause the conversion above to fail, . // but these kinds of errors are already reported by the lexer. . let from_lexer = . base < 10 && s.chars().any(|c| c.to_digit(10).map_or(false, |d| d >= base)); . if from_lexer { LitError::LexerError } else { LitError::IntTooLarge } . }) 18 ( 0.00%) } 216,970 ( 0.04%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_middle/src/ty/fold.rs -------------------------------------------------------------------------------- Ir -- line 46 ---------------------------------------- . /// . /// To implement this conveniently, use the derive macro located in `rustc_macros`. . pub trait TypeFoldable<'tcx>: fmt::Debug + Clone { . /// Consumers may find this more convenient to use with infallible folders than . /// [`try_super_fold_with`][`TypeFoldable::try_super_fold_with`], to which the . /// provided default definition delegates. Implementors **should not** override . /// this provided default definition, to ensure that the two methods are coherent . /// (provide a definition of `try_super_fold_with` instead). 1,567,901 ( 0.27%) fn super_fold_with>(self, folder: &mut F) -> Self { 99,395 ( 0.02%) self.try_super_fold_with(folder).into_ok() 1,665,436 ( 0.29%) } . /// 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). 68,938 ( 0.01%) fn fold_with>(self, folder: &mut F) -> Self { 116,445 ( 0.02%) self.try_fold_with(folder).into_ok() 64,388 ( 0.01%) } . . fn try_super_fold_with>( . self, . folder: &mut F, . ) -> Result; . 4,646,721 ( 0.80%) fn try_fold_with>(self, folder: &mut F) -> Result { 1,696,088 ( 0.29%) self.try_super_fold_with(folder) 4,970,896 ( 0.86%) } . . fn super_visit_with>(&self, visitor: &mut V) -> ControlFlow; 83,755 ( 0.01%) fn visit_with>(&self, visitor: &mut V) -> ControlFlow { 129,072 ( 0.02%) self.super_visit_with(visitor) 53,306 ( 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 { 135,962 ( 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 { 3 ( 0.00%) self.has_vars_bound_at_or_above(binder.shifted_in(1)) . } . 473,394 ( 0.08%) fn has_escaping_bound_vars(&self) -> bool { 37,584 ( 0.01%) self.has_vars_bound_at_or_above(ty::INNERMOST) 474,982 ( 0.08%) } . 28,763 ( 0.00%) #[instrument(level = "trace")] . fn has_type_flags(&self, flags: TypeFlags) -> bool { 17,562 ( 0.00%) self.visit_with(&mut HasTypeFlagsVisitor { flags }).break_value() == Some(FoundFlags) . } . fn has_projections(&self) -> bool { 1,340 ( 0.00%) self.has_type_flags(TypeFlags::HAS_PROJECTION) . } . fn has_opaque_types(&self) -> bool { . self.has_type_flags(TypeFlags::HAS_TY_OPAQUE) . } 4,032 ( 0.00%) fn references_error(&self) -> bool { . self.has_type_flags(TypeFlags::HAS_ERROR) 4,032 ( 0.00%) } . fn has_param_types_or_consts(&self) -> bool { 873 ( 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 { 43,943 ( 0.01%) self.has_type_flags(TypeFlags::HAS_TY_INFER | TypeFlags::HAS_CT_INFER) . } 18,574 ( 0.00%) fn needs_infer(&self) -> bool { 27,364 ( 0.00%) self.has_type_flags(TypeFlags::NEEDS_INFER) 18,668 ( 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. 35 ( 0.00%) fn is_global(&self) -> bool { 20,083 ( 0.00%) !self.has_type_flags(TypeFlags::HAS_FREE_LOCAL_NAMES) 42 ( 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 = !>, . { 340,100 ( 0.06%) t.super_fold_with(self) . } . . fn fold_ty(&mut self, t: Ty<'tcx>) -> Ty<'tcx> . where . Self: TypeFolder<'tcx, Error = !>, . { 14,859 ( 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 = !>, . { 766 ( 0.00%) c.super_fold_with(self) . } . . fn fold_predicate(&mut self, p: ty::Predicate<'tcx>) -> ty::Predicate<'tcx> . where . Self: TypeFolder<'tcx, Error = !>, . { 5,143 ( 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>, . { 51,166 ( 0.01%) 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> { 13,471 ( 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 = !>, . { 262,750 ( 0.05%) fn try_fold_binder(&mut self, t: Binder<'tcx, T>) -> Result, Self::Error> . where . T: TypeFoldable<'tcx>, . { 452,489 ( 0.08%) Ok(self.fold_binder(t)) 379,704 ( 0.07%) } . 8,576 ( 0.00%) fn try_fold_ty(&mut self, t: Ty<'tcx>) -> Result, Self::Error> { 1,236,970 ( 0.21%) Ok(self.fold_ty(t)) 6,791 ( 0.00%) } . 1,564 ( 0.00%) fn try_fold_region(&mut self, r: ty::Region<'tcx>) -> Result, Self::Error> { 129,833 ( 0.02%) Ok(self.fold_region(r)) 1,564 ( 0.00%) } . 304 ( 0.00%) fn try_fold_const( . &mut self, . c: &'tcx ty::Const<'tcx>, . ) -> Result<&'tcx ty::Const<'tcx>, Self::Error> { 17,671 ( 0.00%) Ok(self.fold_const(c)) 304 ( 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 { 12 ( 0.00%) t.super_visit_with(self) . } . . fn visit_ty(&mut self, t: Ty<'tcx>) -> ControlFlow { 768 ( 0.00%) t.super_visit_with(self) . } . . fn visit_region(&mut self, r: ty::Region<'tcx>) -> ControlFlow { . r.super_visit_with(self) . } . . fn visit_const(&mut self, c: &'tcx ty::Const<'tcx>) -> ControlFlow { . c.super_visit_with(self) -- line 350 ---------------------------------------- -- line 380 ---------------------------------------- . 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> { . self.tcx . } . . fn fold_ty(&mut self, ty: Ty<'tcx>) -> Ty<'tcx> { 689 ( 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) . } . -- line 396 ---------------------------------------- -- 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`. 461 ( 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| { 2,078 ( 0.00%) callback(r); . false . }); 399 ( 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 { 450 ( 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 { 84 ( 0.00%) self.outer_index.shift_in(1); 16 ( 0.00%) let result = t.as_ref().skip_binder().visit_with(self); 12 ( 0.00%) self.outer_index.shift_out(1); . result . } . 2,025 ( 0.00%) fn visit_region(&mut self, r: ty::Region<'tcx>) -> ControlFlow { 3,507 ( 0.00%) match *r { 48 ( 0.00%) ty::ReLateBound(debruijn, _) if debruijn < self.outer_index => { . ControlFlow::CONTINUE . } . _ => { . if (self.callback)(r) { . ControlFlow::BREAK . } else { . ControlFlow::CONTINUE . } . } . } 2,835 ( 0.00%) } . . fn visit_ty(&mut self, ty: Ty<'tcx>) -> ControlFlow { . // We're only interested in types involving regions 2,423 ( 0.00%) if ty.flags().intersects(TypeFlags::HAS_FREE_REGIONS) { 2,631 ( 0.00%) ty.super_visit_with(self) . } else { . ControlFlow::CONTINUE . } . } . } . 5,278 ( 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> { 26,628 ( 0.00%) 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> { 91,544 ( 0.02%) self.tcx 91,544 ( 0.02%) } . . fn fold_binder>( . &mut self, . t: ty::Binder<'tcx, T>, . ) -> ty::Binder<'tcx, T> { 397 ( 0.00%) self.current_index.shift_in(1); 52 ( 0.00%) let t = t.super_fold_with(self); 378 ( 0.00%) self.current_index.shift_out(1); . t . } . 326 ( 0.00%) #[instrument(skip(self), level = "debug")] . fn fold_region(&mut self, r: ty::Region<'tcx>) -> ty::Region<'tcx> { 4,160 ( 0.00%) match *r { 326 ( 0.00%) ty::ReLateBound(debruijn, _) if debruijn < self.current_index => { . debug!(?self.current_index, "skipped bound region"); 326 ( 0.00%) *self.skipped_regions = true; . r . } . _ => { . debug!(?self.current_index, "folding free region"); 11,502 ( 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> { 17,570 ( 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 { 68,104 ( 0.01%) BoundVarReplacer { tcx, current_index: ty::INNERMOST, fld_r, fld_t, fld_c } 8,785 ( 0.00%) } . } . . impl<'a, 'tcx> TypeFolder<'tcx> for BoundVarReplacer<'a, 'tcx> { . fn tcx<'b>(&'b self) -> TyCtxt<'tcx> { 23,545 ( 0.00%) self.tcx 18,226 ( 0.00%) } . . fn fold_binder>( . &mut self, . t: ty::Binder<'tcx, T>, . ) -> ty::Binder<'tcx, T> { 47,355 ( 0.01%) self.current_index.shift_in(1); 120,880 ( 0.02%) let t = t.super_fold_with(self); 46,266 ( 0.01%) self.current_index.shift_out(1); . t . } . 135,920 ( 0.02%) fn fold_ty(&mut self, t: Ty<'tcx>) -> Ty<'tcx> { 66,602 ( 0.01%) match *t.kind() { 1,832 ( 0.00%) ty::Bound(debruijn, bound_ty) if debruijn == self.current_index => { 370 ( 0.00%) if let Some(fld_t) = self.fld_t.as_mut() { . let ty = fld_t(bound_ty); 370 ( 0.00%) return ty::fold::shift_vars(self.tcx, &ty, self.current_index.as_u32()); . } . } 65,862 ( 0.01%) _ if t.has_vars_bound_at_or_above(self.current_index) => { 35,098 ( 0.01%) return t.super_fold_with(self); . } . _ => {} . } . t 137,166 ( 0.02%) } . 24,872 ( 0.00%) fn fold_region(&mut self, r: ty::Region<'tcx>) -> ty::Region<'tcx> { 22,386 ( 0.00%) match *r { 21,480 ( 0.00%) ty::ReLateBound(debruijn, br) if debruijn == self.current_index => { 10,718 ( 0.00%) if let Some(fld_r) = self.fld_r.as_mut() { . let region = fld_r(br); 23,866 ( 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. 1,215 ( 0.00%) assert_eq!(debruijn1, ty::INNERMOST); 12,143 ( 0.00%) self.tcx.mk_region(ty::ReLateBound(debruijn, br)) . } else { . region . }; . } . } . _ => {} . } . r 24,872 ( 0.00%) } . . fn fold_const(&mut self, ct: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> { 21 ( 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()); . } . } 7 ( 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 = 78,462 ( 0.01%) |br: ty::BoundRegion| *region_map.entry(br).or_insert_with(|| fld_r(br)); 2,315 ( 0.00%) let value = value.skip_binder(); 47,123 ( 0.01%) let value = if !value.has_escaping_bound_vars() { 86,604 ( 0.01%) value . } else { 7,571 ( 0.00%) let mut replacer = BoundVarReplacer::new(self, Some(&mut real_fld_r), None, None); 8,019 ( 0.00%) value.fold_with(&mut replacer) . }; 136,130 ( 0.02%) (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. 41,151 ( 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>, . { 40,069 ( 0.01%) if !value.has_escaping_bound_vars() { 76,273 ( 0.01%) value . } else { . let mut replacer = 93,328 ( 0.02%) BoundVarReplacer::new(self, Some(&mut fld_r), Some(&mut fld_t), Some(&mut fld_c)); 13,155 ( 0.00%) value.fold_with(&mut replacer) . } 28,549 ( 0.00%) } . . /// 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. 296,857 ( 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(); 41,691 ( 0.01%) let real_fld_r = |br: ty::BoundRegion| *region_map.entry(br).or_insert_with(|| fld_r(br)); 261,730 ( 0.05%) let value = self.replace_escaping_bound_vars(value.skip_binder(), real_fld_r, fld_t, fld_c); 210,726 ( 0.04%) (value, region_map) 225,371 ( 0.04%) } . . /// Replaces any late-bound regions bound in `value` with . /// free variants attached to `all_outlive_scope`. 3,905 ( 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| { 5,369 ( 0.00%) self.mk_region(ty::ReFree(ty::FreeRegion { 826 ( 0.00%) scope: all_outlive_scope, . bound_region: br.kind, . })) . }) . .0 2,130 ( 0.00%) } . . pub fn shift_bound_var_indices(self, bound_vars: usize, value: T) -> T . where . T: TypeFoldable<'tcx>, . { . self.replace_escaping_bound_vars( 147,150 ( 0.03%) value, 411 ( 0.00%) |r| { 2,877 ( 0.00%) self.mk_region(ty::ReLateBound( . ty::INNERMOST, . ty::BoundRegion { 1,644 ( 0.00%) var: ty::BoundVar::from_usize(r.var.as_usize() + bound_vars), . kind: r.kind, . }, . )) 822 ( 0.00%) }, . |t| { . self.mk_ty(ty::Bound( . ty::INNERMOST, . ty::BoundTy { . var: ty::BoundVar::from_usize(t.var.as_usize() + bound_vars), . kind: t.kind, . }, . )) -- line 804 ---------------------------------------- -- line 843 ---------------------------------------- . fn collect_late_bound_regions( . self, . value: &Binder<'tcx, T>, . just_constraint: bool, . ) -> FxHashSet . where . T: TypeFoldable<'tcx>, . { 488 ( 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 944 ( 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>, . { 364 ( 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. 108,333 ( 0.02%) pub fn anonymize_late_bound_regions(self, sig: Binder<'tcx, T>) -> Binder<'tcx, T> . where . T: TypeFoldable<'tcx>, . { 78,445 ( 0.01%) let mut counter = 0; 9,186 ( 0.00%) let inner = self . .replace_late_bound_regions(sig, |_| { . let br = ty::BoundRegion { 1,608 ( 0.00%) var: ty::BoundVar::from_u32(counter), . kind: ty::BrAnon(counter), . }; 6,432 ( 0.00%) let r = self.mk_region(ty::ReLateBound(ty::INNERMOST, br)); 4,020 ( 0.00%) counter += 1; . r . }) . .0; 15,689 ( 0.00%) let bound_vars = self.mk_bound_variable_kinds( 47,067 ( 0.01%) (0..counter).map(|i| ty::BoundVariableKind::Region(ty::BrAnon(i))), . ); 90,978 ( 0.02%) Binder::bind_with_vars(inner, bound_vars) 92,647 ( 0.02%) } . } . . 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 } 740 ( 0.00%) } . } . . impl<'tcx> TypeFolder<'tcx> for Shifter<'tcx> { . fn tcx<'b>(&'b self) -> TyCtxt<'tcx> { . self.tcx . } . . fn fold_binder>( -- line 1020 ---------------------------------------- -- line 1038 ---------------------------------------- . self.tcx.mk_region(shifted) . } . } . _ => r, . } . } . . fn fold_ty(&mut self, ty: Ty<'tcx>) -> Ty<'tcx> { 740 ( 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)) . } . } . 1,164 ( 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 => { 312 ( 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); . 812 ( 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 { 7,122 ( 0.00%) self.outer_index.shift_in(1); . let result = t.super_visit_with(self); 10,450 ( 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 1210 ---------------------------------------- . #[instrument(level = "trace")] . fn visit_ty(&mut self, t: Ty<'_>) -> ControlFlow { . debug!( . "HasTypeFlagsVisitor: t={:?} t.flags={:?} self.flags={:?}", . t, . t.flags(), . self.flags . ); 97,023 ( 0.02%) 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 { 2,541 ( 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 { 161 ( 0.00%) let flags = FlagComputation::for_const(c); . trace!(r.flags=?flags); 112 ( 0.00%) if flags.intersects(self.flags) { . ControlFlow::Break(FoundFlags) . } else { . ControlFlow::CONTINUE . } . } . . #[inline] . #[instrument(level = "trace")] -- line 1250 ---------------------------------------- -- 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 { 236 ( 0.00%) fn new(just_constrained: bool) -> Self { 1,652 ( 0.00%) LateBoundRegionsCollector { . current_index: ty::INNERMOST, . regions: Default::default(), . just_constrained, . } 236 ( 0.00%) } . } . . impl<'tcx> TypeVisitor<'tcx> for LateBoundRegionsCollector { . fn visit_binder>( . &mut self, . t: &Binder<'tcx, T>, . ) -> ControlFlow { . self.current_index.shift_in(1); . let result = t.super_visit_with(self); . self.current_index.shift_out(1); . result . } . 834 ( 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 1,048 ( 0.00%) if self.just_constrained { 1,087 ( 0.00%) if let ty::Projection(..) | ty::Opaque(..) = t.kind() { . return ControlFlow::CONTINUE; . } . } . 1,247 ( 0.00%) t.super_visit_with(self) 556 ( 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 . if self.just_constrained { . 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 { 632 ( 0.00%) if let ty::ReLateBound(debruijn, br) = *r { 126 ( 0.00%) if debruijn == self.current_index { . self.regions.insert(br.kind); . } . } . ControlFlow::CONTINUE . } . } 91,708 ( 0.02%) -------------------------------------------------------------------------------- -- 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>, . { 3,298 ( 0.00%) self.tcx.sess.perf_stats.queries_canonicalized.fetch_add(1, Ordering::Relaxed); . 16,312 ( 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 9 ( 0.00%) pub fn canonicalize_response(&self, value: V) -> Canonicalized<'tcx, V> . where . V: TypeFoldable<'tcx>, . { 3,362 ( 0.00%) let mut query_state = OriginalQueryValues::default(); 11,767 ( 0.00%) Canonicalizer::canonicalize( 19,658 ( 0.00%) value, . self, 1,681 ( 0.00%) self.tcx, . &CanonicalizeQueryResponse, . &mut query_state, . ) 7 ( 0.00%) } . 1,305 ( 0.00%) pub fn canonicalize_user_type_annotation(&self, value: V) -> Canonicalized<'tcx, V> . where . V: TypeFoldable<'tcx>, . { 306 ( 0.00%) let mut query_state = OriginalQueryValues::default(); 1,071 ( 0.00%) Canonicalizer::canonicalize( 910 ( 0.00%) value, . self, 153 ( 0.00%) self.tcx, . &CanonicalizeUserTypeAnnotation, . &mut query_state, . ) 1,015 ( 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). 2,985 ( 0.00%) pub fn canonicalize_query_keep_static( . &self, . value: V, . query_state: &mut OriginalQueryValues<'tcx>, . ) -> Canonicalized<'tcx, V> . where . V: TypeFoldable<'tcx>, . { 9,200 ( 0.00%) self.tcx.sess.perf_stats.queries_canonicalized.fetch_add(1, Ordering::Relaxed); . 41,060 ( 0.01%) Canonicalizer::canonicalize( 3,406 ( 0.00%) value, . self, 4,600 ( 0.00%) self.tcx, . &CanonicalizeFreeRegionsOtherThanStatic, . query_state, . ) 2,985 ( 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 { 10,295 ( 0.00%) fn canonicalize_free_region<'tcx>( . &self, . canonicalizer: &mut Canonicalizer<'_, 'tcx>, . r: ty::Region<'tcx>, . ) -> ty::Region<'tcx> { 6,177 ( 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) => { 1,867 ( 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 . } . } 10,295 ( 0.00%) } . . fn any(&self) -> bool { . false . } . } . . struct CanonicalizeUserTypeAnnotation; . . impl CanonicalizeRegionMode for CanonicalizeUserTypeAnnotation { 162 ( 0.00%) fn canonicalize_free_region<'tcx>( . &self, . canonicalizer: &mut Canonicalizer<'_, 'tcx>, . r: ty::Region<'tcx>, . ) -> ty::Region<'tcx> { 162 ( 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) . } . } 162 ( 0.00%) } . . fn any(&self) -> bool { . false 3,668 ( 0.00%) } . } . . struct CanonicalizeAllFreeRegions; . . impl CanonicalizeRegionMode for CanonicalizeAllFreeRegions { 8,760 ( 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) 6,570 ( 0.00%) } . . fn any(&self) -> bool { . true 12,498 ( 0.00%) } . } . . struct CanonicalizeFreeRegionsOtherThanStatic; . . impl CanonicalizeRegionMode for CanonicalizeFreeRegionsOtherThanStatic { 17,559 ( 0.00%) fn canonicalize_free_region<'tcx>( . &self, . canonicalizer: &mut Canonicalizer<'_, 'tcx>, . r: ty::Region<'tcx>, . ) -> ty::Region<'tcx> { 11,706 ( 0.00%) if let ty::ReStatic = r { . r . } else { . canonicalizer.canonical_var_for_region_in_root_universe(r) . } 17,559 ( 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> { 111,928 ( 0.02%) self.tcx 105,335 ( 0.02%) } . . fn fold_binder(&mut self, t: ty::Binder<'tcx, T>) -> ty::Binder<'tcx, T> . where . T: TypeFoldable<'tcx>, . { 312,775 ( 0.05%) self.binder_index.shift_in(1); 534,398 ( 0.09%) let t = t.super_fold_with(self); 309,956 ( 0.05%) self.binder_index.shift_out(1); . t . } . 40,720 ( 0.01%) fn fold_region(&mut self, r: ty::Region<'tcx>) -> ty::Region<'tcx> { 61,080 ( 0.01%) match *r { 24 ( 0.00%) ty::ReLateBound(index, ..) => { 24 ( 0.00%) if index >= self.binder_index { . bug!("escaping late-bound region during canonicalization"); . } else { . r . } . } . . ty::ReVar(vid) => { 3,163 ( 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 . ); 12,652 ( 0.00%) let r = self.tcx.reuse_or_mk_region(r, ty::ReVar(resolved_vid)); 18,978 ( 0.00%) self.canonicalize_region_mode.canonicalize_free_region(self, r) . } . . ty::ReStatic . | ty::ReEarlyBound(..) . | ty::ReFree(_) . | ty::ReEmpty(_) . | ty::RePlaceholder(..) 69,930 ( 0.01%) | ty::ReErased => self.canonicalize_region_mode.canonicalize_free_region(self, r), . } 19,122 ( 0.00%) } . 819,792 ( 0.14%) fn fold_ty(&mut self, t: Ty<'tcx>) -> Ty<'tcx> { 686,149 ( 0.12%) match *t.kind() { 713 ( 0.00%) ty::Infer(ty::TyVar(vid)) => { . debug!("canonical: type var found with vid {:?}", vid); 2,852 ( 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( 543 ( 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(..) => { 272,178 ( 0.05%) if t.flags().intersects(self.needs_canonical_flags) { 14,749 ( 0.00%) t.super_fold_with(self) . } else { . t . } . } . } 807,150 ( 0.14%) } . 147 ( 0.00%) fn fold_const(&mut self, ct: &'tcx ty::Const<'tcx>) -> &'tcx ty::Const<'tcx> { 147 ( 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, . ); . } . _ => {} . } . 42 ( 0.00%) let flags = FlagComputation::for_const(ct); 21 ( 0.00%) if flags.intersects(self.needs_canonical_flags) { ct.super_fold_with(self) } else { ct } 126 ( 0.00%) } . } . . impl<'cx, 'tcx> Canonicalizer<'cx, 'tcx> { . /// The main `canonicalize` method, shared impl of . /// `canonicalize_query` and `canonicalize_response`. 109,769 ( 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>, . { 49,251 ( 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. 7,803 ( 0.00%) if !value.has_type_flags(needs_canonical_flags) { . let canon_value = Canonical { . max_universe: ty::UniverseIndex::ROOT, . variables: List::empty(), 10,336 ( 0.00%) value, . }; 4,354 ( 0.00%) return canon_value; . } . 76,294 ( 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, . }; 22,168 ( 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()); . 13,702 ( 0.00%) let canonical_variables = tcx.intern_canonical_var_infos(&canonicalizer.variables); . . let max_universe = canonical_variables . .iter() 15,049 ( 0.00%) .map(|cvar| cvar.universe()) . .max() . .unwrap_or(ty::UniverseIndex::ROOT); . 39,080 ( 0.01%) Canonical { max_universe, variables: canonical_variables, value: out_value } 73,359 ( 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). 60,600 ( 0.01%) fn canonical_var(&mut self, info: CanonicalVarInfo<'tcx>, kind: GenericArg<'tcx>) -> BoundVar { 12,120 ( 0.00%) let Canonicalizer { variables, query_state, indices, .. } = self; . 12,120 ( 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`. 12,120 ( 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); 24,620 ( 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. 4,924 ( 0.00%) if var_values.spilled() { 2 ( 0.00%) assert!(indices.is_empty()); 8 ( 0.00%) *indices = var_values . .iter() . .enumerate() . .map(|(i, &kind)| (kind, BoundVar::new(i))) . .collect(); . } . // The cv is the index of the appended element. 9,848 ( 0.00%) BoundVar::new(var_values.len() - 1) . } . } else { . // `var_values` is large. Do a hashmap search via `indices`. 72 ( 0.00%) *indices.entry(kind).or_insert_with(|| { . variables.push(info); . var_values.push(kind); 48 ( 0.00%) assert_eq!(variables.len(), var_values.len()); 24 ( 0.00%) BoundVar::new(variables.len() - 1) . }) . } 54,540 ( 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> { 20,357 ( 0.00%) let var = self.canonical_var(info, r.into()); . let br = ty::BoundRegion { var, kind: ty::BrAnon(var.as_u32()) }; 3,494 ( 0.00%) let region = ty::ReLateBound(self.binder_index, br); 24,458 ( 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`. 4,344 ( 0.00%) fn canonicalize_ty_var(&mut self, info: CanonicalVarInfo<'tcx>, ty_var: Ty<'tcx>) -> Ty<'tcx> { 543 ( 0.00%) let infcx = self.infcx; . let bound_to = infcx.shallow_resolve(ty_var); 543 ( 0.00%) if bound_to != ty_var { . self.fold_ty(bound_to) . } else { 3,801 ( 0.00%) let var = self.canonical_var(info, ty_var.into()); 543 ( 0.00%) self.tcx().mk_ty(ty::Bound(self.binder_index, var.into())) . } 3,258 ( 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 ---------------------------------------- 103,529 ( 0.02%) -------------------------------------------------------------------------------- -- 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 { 19,711 ( 0.00%) 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 { 19,874 ( 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 { 341,646 ( 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 { 4,460,197 ( 0.77%) 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 { 6,967 ( 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 { 1,548,993 ( 0.27%) let bit = self.0.lowest_set_bit()?; . self.0 = self.0.remove_lowest_bit(); . Some(bit) . } . } 67,274 ( 0.01%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/alloc/src/string.rs -------------------------------------------------------------------------------- Ir -- line 375 ---------------------------------------- . /// ``` . /// let s = String::new(); . /// ``` . #[inline] . #[rustc_const_stable(feature = "const_string_new", since = "1.39.0")] . #[stable(feature = "rust1", since = "1.0.0")] . #[must_use] . pub const fn new() -> String { 893 ( 0.00%) String { vec: Vec::new() } . } . . /// Creates a new empty `String` with a particular capacity. . /// . /// `String`s have an internal buffer to hold their data. The capacity is . /// the length of that buffer, and can be queried with the [`capacity`] . /// method. This method creates an empty `String`, but one with an initial . /// buffer that can hold `capacity` bytes. This is useful when you may be -- line 391 ---------------------------------------- -- line 420 ---------------------------------------- . /// // ...but this may make the string reallocate . /// s.push('a'); . /// ``` . #[cfg(not(no_global_oom_handling))] . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . #[must_use] . pub fn with_capacity(capacity: usize) -> String { 3,584 ( 0.00%) String { vec: Vec::with_capacity(capacity) } . } . . // HACK(japaric): with cfg(test) the inherent `[T]::to_vec` method, which is . // required for this method definition, is not available. Since we don't . // require this method for testing purposes, I'll just stub it . // NB see the slice::hack module in slice.rs for more information . #[inline] . #[cfg(test)] -- line 436 ---------------------------------------- -- line 492 ---------------------------------------- . /// . /// [`from_utf8_unchecked`]: String::from_utf8_unchecked . /// [`Vec`]: crate::vec::Vec "Vec" . /// [`&str`]: prim@str "&str" . /// [`into_bytes`]: String::into_bytes . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn from_utf8(vec: Vec) -> Result { 265 ( 0.00%) match str::from_utf8(&vec) { . Ok(..) => Ok(String { vec }), . Err(e) => Err(FromUtf8Error { bytes: vec, error: e }), . } . } . . /// Converts a slice of bytes to a string, including invalid characters. . /// . /// Strings are made of bytes ([`u8`]), and a slice of bytes -- line 508 ---------------------------------------- -- line 550 ---------------------------------------- . /// let input = b"Hello \xF0\x90\x80World"; . /// let output = String::from_utf8_lossy(input); . /// . /// assert_eq!("Hello �World", output); . /// ``` . #[must_use] . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "rust1", since = "1.0.0")] 207 ( 0.00%) pub fn from_utf8_lossy(v: &[u8]) -> Cow<'_, str> { 230 ( 0.00%) let mut iter = lossy::Utf8Lossy::from_bytes(v).chunks(); . 115 ( 0.00%) let first_valid = if let Some(chunk) = iter.next() { . let lossy::Utf8LossyChunk { valid, broken } = chunk; 23 ( 0.00%) if broken.is_empty() { . debug_assert_eq!(valid.len(), v.len()); 23 ( 0.00%) return Cow::Borrowed(valid); . } . valid . } else { . return Cow::Borrowed(""); . }; . . const REPLACEMENT: &str = "\u{FFFD}"; . -- line 573 ---------------------------------------- -- line 578 ---------------------------------------- . for lossy::Utf8LossyChunk { valid, broken } in iter { . res.push_str(valid); . if !broken.is_empty() { . res.push_str(REPLACEMENT); . } . } . . Cow::Owned(res) 184 ( 0.00%) } . . /// Decode a UTF-16–encoded vector `v` into a `String`, returning [`Err`] . /// if `v` contains any invalid data. . /// . /// # Examples . /// . /// Basic usage: . /// -- line 594 ---------------------------------------- -- line 762 ---------------------------------------- . /// }; . /// . /// assert_eq!("💖", sparkle_heart); . /// ``` . #[inline] . #[must_use] . #[stable(feature = "rust1", since = "1.0.0")] . pub unsafe fn from_utf8_unchecked(bytes: Vec) -> String { 1,027 ( 0.00%) String { vec: bytes } . } . . /// Converts a `String` into a byte vector. . /// . /// This consumes the `String`, so we do not need to copy its contents. . /// . /// # Examples . /// -- line 778 ---------------------------------------- -- line 1138 ---------------------------------------- . /// s.push('2'); . /// s.push('3'); . /// . /// assert_eq!("abc123", s); . /// ``` . #[cfg(not(no_global_oom_handling))] . #[inline] . #[stable(feature = "rust1", since = "1.0.0")] 642,342 ( 0.11%) pub fn push(&mut self, ch: char) { . match ch.len_utf8() { . 1 => self.vec.push(ch as u8), . _ => self.vec.extend_from_slice(ch.encode_utf8(&mut [0; 4]).as_bytes()), . } 535,285 ( 0.09%) } . . /// Returns a byte slice of this `String`'s contents. . /// . /// The inverse of this method is [`from_utf8`]. . /// . /// [`from_utf8`]: String::from_utf8 . /// . /// # Examples -- line 1159 ---------------------------------------- -- line 1543 ---------------------------------------- . /// let fancy_f = String::from("ƒoo"); . /// assert_eq!(fancy_f.len(), 4); . /// assert_eq!(fancy_f.chars().count(), 3); . /// ``` . #[inline] . #[must_use] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn len(&self) -> usize { 38 ( 0.00%) self.vec.len() . } . . /// Returns `true` if this `String` has a length of zero, and `false` otherwise. . /// . /// # Examples . /// . /// Basic usage: . /// -- line 1559 ---------------------------------------- -- line 1563 ---------------------------------------- . /// . /// v.push('a'); . /// assert!(!v.is_empty()); . /// ``` . #[inline] . #[must_use] . #[stable(feature = "rust1", since = "1.0.0")] . pub fn is_empty(&self) -> bool { 7 ( 0.00%) self.len() == 0 . } . . /// Splits the string into two at the given byte index. . /// . /// Returns a newly allocated `String`. `self` contains bytes `[0, at)`, and . /// the returned `String` contains bytes `[at, len)`. `at` must be on the . /// boundary of a UTF-8 code point. . /// -- line 1579 ---------------------------------------- -- line 1845 ---------------------------------------- . fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { . fmt::Display::fmt("invalid utf-16: lone surrogate found", f) . } . } . . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "rust1", since = "1.0.0")] . impl Clone for String { 2,064 ( 0.00%) fn clone(&self) -> Self { 1,032 ( 0.00%) String { vec: self.vec.clone() } 2,408 ( 0.00%) } . . fn clone_from(&mut self, source: &Self) { . self.vec.clone_from(&source.vec); . } . } . . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "rust1", since = "1.0.0")] . impl FromIterator for String { 35 ( 0.00%) fn from_iter>(iter: I) -> String { . let mut buf = String::new(); . buf.extend(iter); . buf 42 ( 0.00%) } . } . . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "string_from_iter_by_ref", since = "1.17.0")] . impl<'a> FromIterator<&'a char> for String { . fn from_iter>(iter: I) -> String { . let mut buf = String::new(); . buf.extend(iter); -- line 1877 ---------------------------------------- -- line 1937 ---------------------------------------- . } . } . } . . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "rust1", since = "1.0.0")] . impl Extend for String { . fn extend>(&mut self, iter: I) { 35 ( 0.00%) let iterator = iter.into_iter(); . let (lower_bound, _) = iterator.size_hint(); . self.reserve(lower_bound); 54 ( 0.00%) iterator.for_each(move |c| self.push(c)); . } . . #[inline] . fn extend_one(&mut self, c: char) { . self.push(c); . } . . #[inline] -- line 1956 ---------------------------------------- -- line 2128 ---------------------------------------- . fn default() -> String { . String::new() . } . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl fmt::Display for String { . #[inline] 261 ( 0.00%) fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { 524 ( 0.00%) fmt::Display::fmt(&**self, f) . } . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl fmt::Debug for String { . #[inline] . fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { . fmt::Debug::fmt(&**self, f) . } . } . . #[stable(feature = "rust1", since = "1.0.0")] . impl hash::Hash for String { . #[inline] . fn hash(&self, hasher: &mut H) { 1,145 ( 0.00%) (**self).hash(hasher) . } . } . . /// Implements the `+` operator for concatenating two strings. . /// . /// This consumes the `String` on the left-hand side and re-uses its buffer (growing it if . /// necessary). This is done to avoid allocating a new `String` and copying the entire contents on . /// every operation, which would lead to *O*(*n*^2) running time when building an *n*-byte string by -- line 2161 ---------------------------------------- -- line 2194 ---------------------------------------- . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "rust1", since = "1.0.0")] . impl Add<&str> for String { . type Output = String; . . #[inline] . fn add(mut self, other: &str) -> String { . self.push_str(other); 2 ( 0.00%) self . } . } . . /// Implements the `+=` operator for appending to a `String`. . /// . /// This has the same behavior as the [`push_str`][String::push_str] method. . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "stringaddassign", since = "1.12.0")] -- line 2210 ---------------------------------------- -- line 2388 ---------------------------------------- . impl ToString for T { . // A common guideline is to not inline generic functions. However, . // removing `#[inline]` from this method causes non-negligible regressions. . // See , the last attempt . // to try to remove it. . #[inline] . default fn to_string(&self) -> String { . let mut buf = String::new(); 2,072 ( 0.00%) let mut formatter = core::fmt::Formatter::new(&mut buf); . // Bypass format_args!() to avoid write_str with zero-length strs 679 ( 0.00%) fmt::Display::fmt(self, &mut formatter) . .expect("a Display implementation returned an error unexpectedly"); . buf . } . } . . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "char_to_string_specialization", since = "1.46.0")] . impl ToString for char { -- line 2406 ---------------------------------------- -- line 2620 ---------------------------------------- . /// ``` . /// # use std::borrow::Cow; . /// assert_eq!(Cow::from("eggplant"), Cow::Borrowed("eggplant")); . /// ``` . /// . /// [`Borrowed`]: crate::borrow::Cow::Borrowed "borrow::Cow::Borrowed" . #[inline] . fn from(s: &'a str) -> Cow<'a, str> { 702 ( 0.00%) Cow::Borrowed(s) . } . } . . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "rust1", since = "1.0.0")] . impl<'a> From for Cow<'a, str> { . /// Converts a [`String`] into an [`Owned`] variant. . /// No heap allocation is performed, and the string -- line 2636 ---------------------------------------- -- line 2643 ---------------------------------------- . /// let s = "eggplant".to_string(); . /// let s2 = "eggplant".to_string(); . /// assert_eq!(Cow::from(s), Cow::<'static, str>::Owned(s2)); . /// ``` . /// . /// [`Owned`]: crate::borrow::Cow::Owned "borrow::Cow::Owned" . #[inline] . fn from(s: String) -> Cow<'a, str> { 550 ( 0.00%) Cow::Owned(s) . } . } . . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "cow_from_string_ref", since = "1.28.0")] . impl<'a> From<&'a String> for Cow<'a, str> { . /// Converts a [`String`] reference into a [`Borrowed`] variant. . /// No heap allocation is performed, and the string -- line 2659 ---------------------------------------- -- line 2709 ---------------------------------------- . /// ``` . /// let s1 = String::from("hello world"); . /// let v1 = Vec::from(s1); . /// . /// for b in v1 { . /// println!("{}", b); . /// } . /// ``` 3 ( 0.00%) fn from(string: String) -> Vec { 12 ( 0.00%) string.into_bytes() 3 ( 0.00%) } . } . . #[cfg(not(no_global_oom_handling))] . #[stable(feature = "rust1", since = "1.0.0")] . impl fmt::Write for String { . #[inline] 3,608 ( 0.00%) fn write_str(&mut self, s: &str) -> fmt::Result { . self.push_str(s); . Ok(()) 3,157 ( 0.00%) } . . #[inline] 13,866 ( 0.00%) fn write_char(&mut self, c: char) -> fmt::Result { 138 ( 0.00%) self.push(c); . Ok(()) 13,866 ( 0.00%) } . } . . /// A draining iterator for `String`. . /// . /// This struct is created by the [`drain`] method on [`String`]. See its . /// documentation for more. . /// . /// [`drain`]: String::drain -- line 2743 ---------------------------------------- 796 ( 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`. 4,931,334 ( 0.85%) 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. 35 ( 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, . { 319 ( 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`. 88 ( 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 { 13,818 ( 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 ---------------------------------------- 17,528 ( 0.00%) -------------------------------------------------------------------------------- -- 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}; . 1,582 ( 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); . } . } . } . }; . } . 3,285 ( 0.00%) #[derive(Clone)] . pub struct Parser<'a> { 99 ( 0.00%) pub sess: &'a ParseSess, . /// The current token. 70 ( 0.00%) pub token: Token, . /// The spacing for the current token 53 ( 0.00%) pub token_spacing: Spacing, . /// The previous token. 105 ( 0.00%) pub prev_token: Token, 71 ( 0.00%) pub capture_cfg: bool, 160 ( 0.00%) restrictions: Restrictions, 106 ( 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, 106 ( 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. 106 ( 0.00%) unmatched_angle_bracket_count: u32, 159 ( 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. 53 ( 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` 53 ( 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, . } . 223 ( 0.00%) #[derive(Clone)] . struct CaptureState { 212 ( 0.00%) capturing: Capturing, 53 ( 0.00%) replace_ranges: Vec, . inner_attr_ranges: FxHashMap, . } . . impl<'a> Drop for Parser<'a> { . fn drop(&mut self) { 937 ( 0.00%) emit_unclosed_delims(&mut self.unclosed_delims, &self.sess); . } . } . 27,916 ( 0.00%) #[derive(Clone)] . struct TokenCursor { . frame: TokenCursorFrame, 6,292 ( 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. 2,019 ( 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, . } . 12,554 ( 0.00%) #[derive(Clone)] . struct TokenCursorFrame { 2,702 ( 0.00%) delim: token::DelimToken, . span: DelimSpan, . open_delim: bool, 5,404 ( 0.00%) tree_cursor: tokenstream::Cursor, . close_delim: bool, . } . . impl TokenCursorFrame { . fn new(span: DelimSpan, delim: DelimToken, tts: TokenStream) -> Self { 1,030 ( 0.00%) TokenCursorFrame { . delim, . span, . open_delim: false, 1,923 ( 0.00%) tree_cursor: tts.into_trees(), . close_delim: false, . } . } . } . . impl TokenCursor { 170,628 ( 0.03%) fn next(&mut self) -> (Token, Spacing) { . loop { 81,576 ( 0.01%) let (tree, spacing) = if !self.frame.open_delim { 1,511 ( 0.00%) self.frame.open_delim = true; 7,555 ( 0.00%) TokenTree::open_tt(self.frame.span, self.frame.delim).into() 166,057 ( 0.03%) } else if let Some(tree) = self.frame.tree_cursor.next_with_spacing() { . tree 6,322 ( 0.00%) } else if !self.frame.close_delim { 1,463 ( 0.00%) self.frame.close_delim = true; 7,315 ( 0.00%) TokenTree::close_tt(self.frame.span, self.frame.delim).into() 2,926 ( 0.00%) } else if let Some(frame) = self.stack.pop() { 19,019 ( 0.00%) self.frame = frame; . continue; . } else { 4,230 ( 0.00%) (TokenTree::Token(Token::new(token::Eof, DUMMY_SP)), Spacing::Alone) . }; . 31,460 ( 0.01%) match tree { . TokenTree::Token(token) => { 113,752 ( 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)); . } . } . } 113,752 ( 0.02%) } . 3,790 ( 0.00%) fn next_desugared(&mut self) -> (Token, Spacing) { 1,137 ( 0.00%) let (data, attr_style, sp) = match self.next() { . (Token { kind: token::DocComment(_, attr_style, data), span }, _) => { . (data, attr_style, span) . } 1,895 ( 0.00%) tok => return tok, . }; . . // Searches for the occurrences of `"#*` and returns the minimum number of `#`s . // required to wrap the text. . let mut num_of_hashes = 0; . let mut count = 0; . for ch in data.as_str().chars() { . count = match ch { -- line 298 ---------------------------------------- -- line 332 ---------------------------------------- . .iter() . .cloned() . .collect::() . }, . ), . )); . . self.next() 3,411 ( 0.00%) } . } . 14,590 ( 0.00%) #[derive(Debug, Clone, PartialEq)] . enum TokenType { 11,672 ( 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 { 48 ( 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> { 372 ( 0.00%) Some(match token.kind { 744 ( 0.00%) _ if token.is_special_ident() => "reserved identifier", 744 ( 0.00%) _ if token.is_used_keyword() => "keyword", 744 ( 0.00%) _ if token.is_unused_keyword() => "reserved keyword", . token::DocComment(..) => "doc comment", . _ => return None, . }) . } . 1,302 ( 0.00%) pub(super) fn token_descr(token: &Token) -> String { 372 ( 0.00%) let token_str = pprust::token_to_string(token); . match token_descr_opt(token) { . Some(prefix) => format!("{} `{}`", prefix, token_str), 1,302 ( 0.00%) _ => format!("`{}`", token_str), . } 930 ( 0.00%) } . . impl<'a> Parser<'a> { 2,884 ( 0.00%) pub fn new( . sess: &'a ParseSess, . tokens: TokenStream, . desugar_doc_comments: bool, . subparser_name: Option<&'static str>, . ) -> Self { 206 ( 0.00%) let mut start_frame = TokenCursorFrame::new(DelimSpan::dummy(), token::NoDelim, tokens); 412 ( 0.00%) start_frame.open_delim = true; . start_frame.close_delim = true; . 6,386 ( 0.00%) let mut parser = Parser { . sess, 206 ( 0.00%) token: Token::dummy(), . token_spacing: Spacing::Alone, 206 ( 0.00%) prev_token: Token::dummy(), . capture_cfg: false, . restrictions: Restrictions::empty(), . expected_tokens: Vec::new(), . token_cursor: TokenCursor { 1,236 ( 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. 412 ( 0.00%) parser.bump(); . . parser 1,854 ( 0.00%) } . . fn next_tok(&mut self, fallback_span: Span) -> (Token, Spacing) { . loop { 77,700 ( 0.01%) let (mut next, spacing) = if self.desugar_doc_comments { 1,516 ( 0.00%) self.token_cursor.next_desugared() . } else { 37,713 ( 0.01%) self.token_cursor.next() . }; 51,800 ( 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 12,950 ( 0.00%) self.token_cursor.break_last_token = false; 51,800 ( 0.01%) if next.span.is_dummy() { . // Tweak the location for better diagnostics, but keep syntactic context intact. 880 ( 0.00%) next.span = fallback_span.with_ctxt(next.span.ctxt()); . } 43,239 ( 0.01%) if matches!( 25,900 ( 0.00%) next.kind, . token::OpenDelim(token::NoDelim) | token::CloseDelim(token::NoDelim) . ) { . continue; . } 51,800 ( 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`. 11,781 ( 0.00%) pub fn expect(&mut self, t: &TokenKind) -> PResult<'a, bool /* recovered */> { 1,309 ( 0.00%) if self.expected_tokens.is_empty() { 1,314 ( 0.00%) if self.token == *t { 1,095 ( 0.00%) self.bump(); . Ok(false) . } else { . self.unexpected_try_recover(t) . } . } else { 13,080 ( 0.00%) self.expect_one_of(slice::from_ref(t), &[]) . } 19,635 ( 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. 15,120 ( 0.00%) pub fn expect_one_of( . &mut self, . edible: &[TokenKind], . inedible: &[TokenKind], . ) -> PResult<'a, bool /* recovered */> { 2,520 ( 0.00%) if edible.contains(&self.token.kind) { 3,330 ( 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) . } 18,900 ( 0.00%) } . . // Public for rustfmt usage. . pub fn parse_ident(&mut self) -> PResult<'a, Ident> { 12,699 ( 0.00%) self.parse_ident_common(true) . } . . fn ident_or_err(&mut self) -> PResult<'a, (Ident, /* is_raw */ bool)> { 9,720 ( 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(), . }) . } . 22,652 ( 0.00%) fn parse_ident_common(&mut self, recover: bool) -> PResult<'a, Ident> { 3,236 ( 0.00%) let (ident, is_raw) = self.ident_or_err()?; 19,416 ( 0.00%) if !is_raw && ident.is_reserved() { . let mut err = self.expected_ident_found(); . if recover { . err.emit(); . } else { . return Err(err); . } . } 12,944 ( 0.00%) self.bump(); . Ok(ident) 32,360 ( 0.01%) } . . /// Checks if the next token is `tok`, and returns `true` if so. . /// . /// This method will automatically add `tok` to `expected_tokens` if `tok` is not . /// encountered. 237,783 ( 0.04%) fn check(&mut self, tok: &TokenKind) -> bool { 105,717 ( 0.02%) let is_present = self.token == *tok; 71,396 ( 0.01%) if !is_present { 153,478 ( 0.03%) self.expected_tokens.push(TokenType::Token(tok.clone())); . } . is_present 237,783 ( 0.04%) } . . /// Consumes a token 'tok' if it exists. Returns whether the given token was present. 80 ( 0.00%) pub fn eat(&mut self, tok: &TokenKind) -> bool { 54,118 ( 0.01%) let is_present = self.check(tok); 36,278 ( 0.01%) if is_present { 6,488 ( 0.00%) self.bump() . } . is_present 100 ( 0.00%) } . . /// If the next token is the given keyword, returns `true` without eating it. . /// An expectation is also added for diagnostics purposes. 8,885 ( 0.00%) fn check_keyword(&mut self, kw: Symbol) -> bool { 2,624 ( 0.00%) self.expected_tokens.push(TokenType::Keyword(kw)); 72,772 ( 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. 14,590 ( 0.00%) pub fn eat_keyword(&mut self, kw: Symbol) -> bool { 13,618 ( 0.00%) if self.check_keyword(kw) { 1,699 ( 0.00%) self.bump(); . true . } else { . false . } 14,590 ( 0.00%) } . . fn eat_keyword_noexpect(&mut self, kw: Symbol) -> bool { 4,652 ( 0.00%) if self.token.is_keyword(kw) { 998 ( 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. 610 ( 0.00%) fn expect_keyword(&mut self, kw: Symbol) -> PResult<'a, ()> { . if !self.eat_keyword(kw) { self.unexpected() } else { Ok(()) } 488 ( 0.00%) } . . /// Is the given keyword `kw` followed by a non-reserved identifier? 5,632 ( 0.00%) fn is_kw_followed_by_ident(&self, kw: Symbol) -> bool { 2,816 ( 0.00%) self.token.is_keyword(kw) && self.look_ahead(1, |t| t.is_ident() && !t.is_reserved_ident()) 6,336 ( 0.00%) } . 23,310 ( 0.00%) fn check_or_expected(&mut self, ok: bool, typ: TokenType) -> bool { 8,118 ( 0.00%) if ok { . true . } else { 5,828 ( 0.00%) self.expected_tokens.push(typ); . false . } 23,310 ( 0.00%) } . . fn check_ident(&mut self) -> bool { 1,944 ( 0.00%) self.check_or_expected(self.token.is_ident(), TokenType::Ident) . } . 5,368 ( 0.00%) fn check_path(&mut self) -> bool { 13,963 ( 0.00%) self.check_or_expected(self.token.is_path_start(), TokenType::Path) 6,710 ( 0.00%) } . . fn check_type(&mut self) -> bool { 4,692 ( 0.00%) self.check_or_expected(self.token.can_begin_type(), TokenType::Type) . } . . fn check_const_arg(&mut self) -> bool { 3,144 ( 0.00%) self.check_or_expected(self.token.can_begin_const_arg(), TokenType::Const) . } . 1,287 ( 0.00%) fn check_inline_const(&self, dist: usize) -> bool { 715 ( 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, . }) 1,287 ( 0.00%) } . . /// Checks to see if the next token is either `+` or `+=`. . /// Otherwise returns `false`. . fn check_plus(&mut self) -> bool { 3,680 ( 0.00%) self.check_or_expected( 1,840 ( 0.00%) self.token.is_like_plus(), 1,840 ( 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. 35,484 ( 0.01%) fn break_and_eat(&mut self, expected: TokenKind) -> bool { 20,699 ( 0.00%) if self.token.kind == expected { 2,538 ( 0.00%) self.bump(); . return true; . } 8,440 ( 0.00%) match self.token.kind.break_two_token_op() { 224 ( 0.00%) Some((first, second)) if first == expected => { 128 ( 0.00%) let first_span = self.sess.source_map().start_point(self.token.span); 160 ( 0.00%) let second_span = self.token.span.with_lo(first_span.hi()); 288 ( 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` 32 ( 0.00%) self.token_cursor.break_last_token = true; . // Use the spacing of the glued token as the spacing . // of the unglued second token. 448 ( 0.00%) self.bump_with((Token::new(second, second_span), self.token_spacing)); . true . } . _ => { 4,968 ( 0.00%) self.expected_tokens.push(TokenType::Token(expected)); . false . } . } 33,237 ( 0.01%) } . . /// Eats `+` possibly breaking tokens like `+=` in process. . fn eat_plus(&mut self) -> bool { 1,348 ( 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, ()> { 774 ( 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, ()> { 96 ( 0.00%) if self.break_and_eat(token::BinOp(token::Or)) { Ok(()) } else { self.unexpected() } . } . . /// Eats `<` possibly breaking tokens like `<<` in process. 1,994 ( 0.00%) fn eat_lt(&mut self) -> bool { 6,594 ( 0.00%) let ate = self.break_and_eat(token::Lt); 4,345 ( 0.00%) if ate { . // See doc comment for `unmatched_angle_bracket_count`. 2,040 ( 0.00%) self.unmatched_angle_bracket_count += 1; 2,150 ( 0.00%) self.max_angle_bracket_count += 1; . debug!("eat_lt: (increment) count={:?}", self.unmatched_angle_bracket_count); . } . ate 1,994 ( 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, ()> { 2,994 ( 0.00%) if self.break_and_eat(token::Gt) { . // See doc comment for `unmatched_angle_bracket_count`. 1,497 ( 0.00%) if self.unmatched_angle_bracket_count > 0 { 998 ( 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 { 3,867 ( 0.00%) TokenExpectType::Expect => self.check(k), 240 ( 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) { 3,725 ( 0.00%) if let token::CloseDelim(..) | token::Eof = self.token.kind { . break; . } 2,528 ( 0.00%) if let Some(ref t) = sep.sep { 3,240 ( 0.00%) if first { . first = false; . } else { 1,680 ( 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; . } . } . } . } . } . } 1,318 ( 0.00%) if sep.trailing_sep_allowed && self.expect_any_with_type(kets, expect) { . trailing = true; . break; . } . 899 ( 0.00%) let t = f(self)?; 2,290 ( 0.00%) v.push(t); . } . 2,120 ( 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)> { 2,367 ( 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. 2,890 ( 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 */)> { 1,381 ( 0.00%) let (val, trailing, recovered) = self.parse_seq_to_before_end(ket, sep, f)?; 675 ( 0.00%) if !recovered { . self.eat(ket); . } 3,490 ( 0.00%) Ok((val, trailing)) 2,312 ( 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)> { 1,175 ( 0.00%) self.expect(bra)?; 2,312 ( 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( 510 ( 0.00%) &token::OpenDelim(delim), 731 ( 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. 168,766 ( 0.03%) fn bump_with(&mut self, (next_token, next_spacing): (Token, Spacing)) { . // Bumping after EOF is a bad sign, usually an infinite loop. 77,892 ( 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. 51,928 ( 0.01%) self.prev_token = mem::replace(&mut self.token, next_token); 12,982 ( 0.00%) self.token_spacing = next_spacing; . . // Diagnostics. 12,982 ( 0.00%) self.expected_tokens.clear(); . } . . /// Advance the parser by one token. 103,600 ( 0.02%) pub fn bump(&mut self) { 51,800 ( 0.01%) let next_token = self.next_tok(self.token.span); 77,700 ( 0.01%) self.bump_with(next_token); 103,600 ( 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. 56 ( 0.00%) pub fn look_ahead(&self, dist: usize, looker: impl FnOnce(&Token) -> R) -> R { 1,098 ( 0.00%) if dist == 0 { 447 ( 0.00%) return looker(&self.token); . } . 3,555 ( 0.00%) let frame = &self.token_cursor.frame; 3,975 ( 0.00%) if frame.delim != DelimToken::NoDelim { . let all_normal = (0..dist).all(|i| { 8,638 ( 0.00%) let token = frame.tree_cursor.look_ahead(i); 11,437 ( 0.00%) !matches!(token, Some(TokenTree::Delimited(_, DelimToken::NoDelim, _))) . }); . if all_normal { 14,111 ( 0.00%) return match frame.tree_cursor.look_ahead(dist - 1) { 5,034 ( 0.00%) Some(tree) => match tree { 2,382 ( 0.00%) TokenTree::Token(token) => looker(token), . TokenTree::Delimited(dspan, delim, _) => { 993 ( 0.00%) looker(&Token::new(token::OpenDelim(*delim), dspan.open)) . } . }, 2,039 ( 0.00%) None => looker(&Token::new(token::CloseDelim(frame.delim), frame.span.close)), . }; . } . } . . let mut cursor = self.token_cursor.clone(); . let mut i = 0; 1,211 ( 0.00%) let mut token = Token::dummy(); 3,200 ( 0.00%) while i < dist { 10,223 ( 0.00%) token = cursor.next().0; 4,234 ( 0.00%) if matches!( 2,538 ( 0.00%) token.kind, . token::OpenDelim(token::NoDelim) | token::CloseDelim(token::NoDelim) . ) { . continue; . } 1,675 ( 0.00%) i += 1; . } 34 ( 0.00%) return looker(&token); 63 ( 0.00%) } . . /// Returns whether any of the given keywords are `dist` tokens ahead of the current one. 3,006 ( 0.00%) fn is_keyword_ahead(&self, dist: usize, kws: &[Symbol]) -> bool { 971 ( 0.00%) self.look_ahead(dist, |t| kws.iter().any(|&kw| t.is_keyword(kw))) 3,006 ( 0.00%) } . . /// Parses asyncness: `async` or nothing. . fn parse_asyncness(&mut self) -> Async { . if self.eat_keyword(kw::Async) { . 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. 512 ( 0.00%) fn parse_unsafety(&mut self) -> Unsafe { . if self.eat_keyword(kw::Unsafe) { . Unsafe::Yes(self.prev_token.uninterpolated_span()) . } else { . Unsafe::No . } 2,048 ( 0.00%) } . . /// Parses constness: `const` or nothing. 3,536 ( 0.00%) fn parse_constness(&mut self) -> Const { . // Avoid const blocks to be parsed as const items 1,122 ( 0.00%) if self.look_ahead(1, |t| t != &token::OpenDelim(DelimToken::Brace)) . && self.eat_keyword(kw::Const) . { 50 ( 0.00%) Const::Yes(self.prev_token.uninterpolated_span()) . } else { . Const::No . } 6,188 ( 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 1110 ---------------------------------------- . }; . 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). . fn parse_mutability(&mut self) -> Mutability { . if self.eat_keyword(kw::Mut) { Mutability::Mut } else { Mutability::Not } 258 ( 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> { 44 ( 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 { 66 ( 0.00%) self.parse_ident_common(true) . } . } . . fn parse_mac_args(&mut self) -> PResult<'a, P> { 75 ( 0.00%) self.parse_mac_args_common(true).map(P) . } . . fn parse_attr_args(&mut self) -> PResult<'a, MacArgs> { 558 ( 0.00%) self.parse_mac_args_common(false) . } . 1,953 ( 0.00%) fn parse_mac_args_common(&mut self, delimited_only: bool) -> PResult<'a, MacArgs> { 1,736 ( 0.00%) Ok( 1,113 ( 0.00%) if self.check(&token::OpenDelim(DelimToken::Paren)) 21 ( 0.00%) || self.check(&token::OpenDelim(DelimToken::Bracket)) 21 ( 0.00%) || self.check(&token::OpenDelim(DelimToken::Brace)) . { 840 ( 0.00%) match self.parse_token_tree() { 1,050 ( 0.00%) TokenTree::Delimited(dspan, delim, tokens) => . // We've confirmed above that there is a delimiter so unwrapping is OK. . { 420 ( 0.00%) MacArgs::Delimited(dspan, MacDelimiter::from_token(delim).unwrap(), tokens) . } . _ => unreachable!(), . } 14 ( 0.00%) } else if !delimited_only { . if self.eat(&token::Eq) { 1 ( 0.00%) let eq_span = self.prev_token.span; . . // Collect tokens because they are used during lowering to HIR. 1 ( 0.00%) let expr = self.parse_expr_force_collect()?; 1 ( 0.00%) let span = expr.span; . 5 ( 0.00%) let token_kind = token::Interpolated(Lrc::new(token::NtExpr(expr))); 9 ( 0.00%) MacArgs::Eq(eq_span, Token::new(token_kind, span)) . } else { . MacArgs::Empty . } . } else { . return self.unexpected(); . }, . ) 1,519 ( 0.00%) } . . fn parse_or_use_outer_attributes( . &mut self, . already_parsed_attrs: Option, . ) -> PResult<'a, AttrWrapper> { 1,452 ( 0.00%) if let Some(attrs) = already_parsed_attrs { . Ok(attrs) . } else { 816 ( 0.00%) self.parse_outer_attributes() . } . } . . /// Parses a single token tree from the input. 2,304 ( 0.00%) pub(crate) fn parse_token_tree(&mut self) -> TokenTree { 1,020 ( 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. 6,302 ( 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. 3,904 ( 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; 498 ( 0.00%) let stream = frame.tree_cursor.stream.clone(); 498 ( 0.00%) let span = frame.span; 249 ( 0.00%) let delim = frame.delim; . // Consume close delimiter 498 ( 0.00%) self.bump(); 1,245 ( 0.00%) TokenTree::Delimited(span, delim, stream) . } . token::CloseDelim(_) | token::Eof => unreachable!(), . _ => { 78 ( 0.00%) self.bump(); 195 ( 0.00%) TokenTree::Token(self.prev_token.clone()) . } . } 2,016 ( 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 { 594 ( 0.00%) let old = self.restrictions; 785 ( 0.00%) self.restrictions = res; . let res = f(self); 726 ( 0.00%) self.restrictions = old; . res . } . 4,544 ( 0.00%) fn is_crate_vis(&self) -> bool { 2,840 ( 0.00%) self.token.is_keyword(kw::Crate) && self.look_ahead(1, |t| t != &token::ModSep) 5,112 ( 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. 4,360 ( 0.00%) pub fn parse_visibility(&mut self, fbt: FollowedByType) -> PResult<'a, Visibility> { 872 ( 0.00%) maybe_whole!(self, NtVis, |x| x); . 436 ( 0.00%) self.expected_tokens.push(TokenType::Keyword(kw::Crate)); 1,744 ( 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". 339 ( 0.00%) return Ok(Visibility { 1,017 ( 0.00%) span: self.token.span.shrink_to_lo(), . kind: VisibilityKind::Inherited, . tokens: None, . }); . } 97 ( 0.00%) let lo = self.prev_token.span; . 485 ( 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. 34 ( 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)`. 9 ( 0.00%) self.bump(); // `(` 6 ( 0.00%) self.bump(); // `crate` 9 ( 0.00%) self.expect(&token::CloseDelim(token::Paren))?; // `)` 3 ( 0.00%) let vis = VisibilityKind::Crate(CrateSugar::PubCrate); . return Ok(Visibility { 9 ( 0.00%) span: lo.to(self.prev_token.span), . kind: vis, . tokens: None, . }); 7 ( 0.00%) } else if self.is_keyword_ahead(1, &[kw::In]) { . // Parse `pub(in path)`. . self.bump(); // `(` . self.bump(); // `in` . let path = self.parse_path(PathStyle::Mod)?; // `path` . self.expect(&token::CloseDelim(token::Paren))?; // `)` . let vis = VisibilityKind::Restricted { path: P(path), id: ast::DUMMY_NODE_ID }; . return Ok(Visibility { . span: lo.to(self.prev_token.span), . kind: vis, . tokens: None, . }); 4 ( 0.00%) } else if self.look_ahead(2, |t| t == &token::CloseDelim(token::Paren)) 5 ( 0.00%) && self.is_keyword_ahead(1, &[kw::Super, kw::SelfLower]) . { . // Parse `pub(self)` or `pub(super)`. 3 ( 0.00%) self.bump(); // `(` 1 ( 0.00%) let path = self.parse_path(PathStyle::Mod)?; // `super`/`self` 3 ( 0.00%) self.expect(&token::CloseDelim(token::Paren))?; // `)` 11 ( 0.00%) let vis = VisibilityKind::Restricted { path: P(path), id: ast::DUMMY_NODE_ID }; . return Ok(Visibility { 4 ( 0.00%) span: lo.to(self.prev_token.span), . kind: vis, . tokens: None, . }); . } else if let FollowedByType::No = fbt { . // Provide this diagnostic if a type cannot follow; . // in particular, if this is not a tuple struct. . self.recover_incorrect_vis_restriction()?; . // Emit diagnostic, but continue with public visibility. . } . } . 279 ( 0.00%) Ok(Visibility { span: lo, kind: VisibilityKind::Public, tokens: None }) 3,924 ( 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 { 134 ( 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, . } . } . 80 ( 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, 8 ( 0.00%) |this, _attrs| Ok((f(this)?, TrailingToken::None)), . ) 80 ( 0.00%) } . . /// `::{` or `::*` 24,656 ( 0.00%) fn is_import_coupler(&mut self) -> bool { 12,328 ( 0.00%) self.check(&token::ModSep) . && self.look_ahead(1, |t| { 5,509 ( 0.00%) *t == token::OpenDelim(token::Brace) || *t == token::BinOp(token::Star) . }) 25,110 ( 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) . } . 2,080 ( 0.00%) pub fn emit_unclosed_delims(unclosed_delims: &mut Vec, sess: &ParseSess) { 1,040 ( 0.00%) *sess.reached_eof.borrow_mut() |= . unclosed_delims.iter().any(|unmatched_delim| unmatched_delim.found_delim.is_none()); 1,040 ( 0.00%) for unmatched in unclosed_delims.drain(..) { . if let Some(mut e) = make_unclosed_delims_error(unmatched, sess) { . e.emit(); . } . } 2,080 ( 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 ---------------------------------------- 84,084 ( 0.01%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/compiler/rustc_parse/src/lexer/mod.rs -------------------------------------------------------------------------------- Ir -- line 26 ---------------------------------------- . pub struct UnmatchedBrace { . pub expected_delim: token::DelimToken, . pub found_delim: Option, . pub found_span: Span, . pub unclosed_span: Option, . pub candidate_span: Option, . } . 210 ( 0.00%) crate fn parse_token_trees<'a>( . sess: &'a ParseSess, . src: &'a str, . start_pos: BytePos, . override_span: Option, . ) -> (PResult<'a, TokenStream>, Vec) { . StringReader { sess, start_pos, pos: start_pos, end_src_index: src.len(), src, override_span } . .into_token_trees() 135 ( 0.00%) } . . struct StringReader<'a> { . sess: &'a ParseSess, . /// Initial position, read-only. . start_pos: BytePos, . /// The absolute offset within the source_map of the current character. . pos: BytePos, . /// Stop reading src at this index. -- line 50 ---------------------------------------- -- line 51 ---------------------------------------- . end_src_index: usize, . /// Source text to tokenize. . src: &'a str, . override_span: Option, . } . . impl<'a> StringReader<'a> { . fn mk_sp(&self, lo: BytePos, hi: BytePos) -> Span { 16,457 ( 0.00%) self.override_span.unwrap_or_else(|| Span::with_root_ctxt(lo, hi)) . } . . /// Returns the next token, and info about preceding whitespace, if any. 83,468 ( 0.01%) fn next_token(&mut self) -> (Spacing, Token) { . let mut spacing = Spacing::Joint; . . // Skip `#!` at the start of the file 23,848 ( 0.00%) let start_src_index = self.src_index(self.pos); 35,772 ( 0.01%) let text: &str = &self.src[start_src_index..self.end_src_index]; . let is_beginning_of_file = self.pos == self.start_pos; 11,924 ( 0.00%) if is_beginning_of_file { 60 ( 0.00%) if let Some(shebang_len) = rustc_lexer::strip_shebang(text) { . self.pos = self.pos + BytePos::from_usize(shebang_len); . spacing = Spacing::Alone; . } . } . . // Skip trivial (whitespace & comments) tokens . loop { 20,990 ( 0.00%) let start_src_index = self.src_index(self.pos); 49,371 ( 0.01%) let text: &str = &self.src[start_src_index..self.end_src_index]; . 16,457 ( 0.00%) if text.is_empty() { . let span = self.mk_sp(self.pos, self.pos); 75 ( 0.00%) return (spacing, Token::new(token::Eof, span)); . } . 49,326 ( 0.01%) let token = rustc_lexer::first_token(text); . 32,884 ( 0.01%) let start = self.pos; 16,442 ( 0.00%) self.pos = self.pos + BytePos::from_usize(token.len); . . debug!("next_token: {:?}({:?})", token.kind, self.str_from(start)); . 132,928 ( 0.02%) match self.cook_lexer_token(token.kind, start) { 95,272 ( 0.02%) Some(kind) => { . let span = self.mk_sp(start, self.pos); 71,454 ( 0.01%) return (spacing, Token::new(kind, span)); . } . None => spacing = Spacing::Alone, . } . } 107,316 ( 0.02%) } . . /// Report a fatal lexical error with a given span. . fn fatal_span(&self, sp: Span, m: &str) -> FatalError { . self.sess.span_diagnostic.span_fatal(sp, m) . } . . /// Report a lexical error with a given span. . fn err_span(&self, sp: Span, m: &str) { -- line 110 ---------------------------------------- -- line 130 ---------------------------------------- . ) -> DiagnosticBuilder<'a> { . self.sess . .span_diagnostic . .struct_span_fatal(self.mk_sp(from_pos, to_pos), &format!("{}: {}", m, escaped_char(c))) . } . . /// Detect usages of Unicode codepoints changing the direction of the text on screen and loudly . /// complain about it. 154 ( 0.00%) fn lint_unicode_text_flow(&self, start: BytePos) { . // Opening delimiter of the length 2 is not included into the comment text. . let content_start = start + BytePos(2); . let content = self.str_from(content_start); . if contains_text_flow_control_chars(content) { . let span = self.mk_sp(start, self.pos); . self.sess.buffer_lint_with_diagnostic( . &TEXT_DIRECTION_CODEPOINT_IN_COMMENT, . span, . ast::CRATE_NODE_ID, . "unicode codepoint changing visible direction of text present in comment", . BuiltinLintDiagnostics::UnicodeTextFlow(span, content.to_string()), . ); . } 176 ( 0.00%) } . . /// Turns simple `rustc_lexer::TokenKind` enum into a rich . /// `rustc_ast::TokenKind`. This turns strings into interned . /// symbols and runs additional validation. . fn cook_lexer_token(&self, token: rustc_lexer::TokenKind, start: BytePos) -> Option { 82,210 ( 0.01%) Some(match token { 370 ( 0.00%) rustc_lexer::TokenKind::LineComment { doc_style } => { . // Skip non-doc comments 1,784 ( 0.00%) let doc_style = if let Some(doc_style) = doc_style { . doc_style . } else { . self.lint_unicode_text_flow(start); . return None; . }; . . // Opening delimiter of the length 3 is not included into the symbol. . let content_start = start + BytePos(3); . let content = self.str_from(content_start); 1,740 ( 0.00%) self.cook_doc_comment(content_start, content, CommentKind::Line, doc_style) . } . rustc_lexer::TokenKind::BlockComment { doc_style, terminated } => { . if !terminated { . let msg = match doc_style { . Some(_) => "unterminated block doc-comment", . None => "unterminated block comment", . }; . let last_bpos = self.pos; -- line 179 ---------------------------------------- -- line 198 ---------------------------------------- . let content_end = self.pos - BytePos(if terminated { 2 } else { 0 }); . let content = self.str_from_to(content_start, content_end); . self.cook_doc_comment(content_start, content, CommentKind::Block, doc_style) . } . rustc_lexer::TokenKind::Whitespace => return None, . rustc_lexer::TokenKind::Ident . | rustc_lexer::TokenKind::RawIdent . | rustc_lexer::TokenKind::UnknownPrefix => { 18,072 ( 0.00%) let is_raw_ident = token == rustc_lexer::TokenKind::RawIdent; 22,590 ( 0.00%) let is_unknown_prefix = token == rustc_lexer::TokenKind::UnknownPrefix; . let mut ident_start = start; 9,036 ( 0.00%) if is_raw_ident { . ident_start = ident_start + BytePos(2); . } 13,554 ( 0.00%) if is_unknown_prefix { . self.report_unknown_prefix(start); . } 22,590 ( 0.00%) let sym = nfc_normalize(self.str_from(ident_start)); . let span = self.mk_sp(start, self.pos); 18,072 ( 0.00%) self.sess.symbol_gallery.insert(sym, span); 9,036 ( 0.00%) if is_raw_ident { . if !sym.can_be_raw() { . self.err_span(span, &format!("`{}` cannot be a raw identifier", sym)); . } . self.sess.raw_identifier_spans.borrow_mut().push(span); . } 31,626 ( 0.01%) token::Ident(sym, is_raw_ident) . } . rustc_lexer::TokenKind::InvalidIdent . // Do not recover an identifier with emoji if the codepoint is a confusable . // with a recoverable substitution token, like `➖`. . if UNICODE_ARRAY . .iter() . .find(|&&(c, _, _)| { . let sym = self.str_from(start); -- line 232 ---------------------------------------- -- line 234 ---------------------------------------- . }) . .is_none() => . { . let sym = nfc_normalize(self.str_from(start)); . let span = self.mk_sp(start, self.pos); . self.sess.bad_unicode_identifiers.borrow_mut().entry(sym).or_default().push(span); . token::Ident(sym, false) . } 3,152 ( 0.00%) rustc_lexer::TokenKind::Literal { kind, suffix_start } => { . let suffix_start = start + BytePos(suffix_start as u32); . let (kind, symbol) = self.cook_lexer_literal(start, suffix_start, kind); 591 ( 0.00%) let suffix = if suffix_start < self.pos { . let string = self.str_from(suffix_start); . if string == "_" { . self.sess . .span_diagnostic . .struct_span_warn( . self.mk_sp(suffix_start, self.pos), . "underscore literal suffix is not allowed", . ) -- line 253 ---------------------------------------- -- line 259 ---------------------------------------- . .note( . "see issue #42326 \ . \ . for more information", . ) . .emit(); . None . } else { 5 ( 0.00%) Some(Symbol::intern(string)) . } . } else { . None . }; 1,576 ( 0.00%) token::Literal(token::Lit { kind, symbol, suffix }) . } 44 ( 0.00%) rustc_lexer::TokenKind::Lifetime { starts_with_number } => { . // Include the leading `'` in the real identifier, for macro . // expansion purposes. See #12512 for the gory details of why . // this is necessary. . let lifetime_name = self.str_from(start); 22 ( 0.00%) if starts_with_number { . self.err_span_(start, self.pos, "lifetimes cannot start with a number"); . } 66 ( 0.00%) let ident = Symbol::intern(lifetime_name); 88 ( 0.00%) token::Lifetime(ident) . } . rustc_lexer::TokenKind::Semi => token::Semi, . rustc_lexer::TokenKind::Comma => token::Comma, . rustc_lexer::TokenKind::Dot => token::Dot, . rustc_lexer::TokenKind::OpenParen => token::OpenDelim(token::Paren), . rustc_lexer::TokenKind::CloseParen => token::CloseDelim(token::Paren), . rustc_lexer::TokenKind::OpenBrace => token::OpenDelim(token::Brace), . rustc_lexer::TokenKind::CloseBrace => token::CloseDelim(token::Brace), -- line 291 ---------------------------------------- -- line 324 ---------------------------------------- . err.help("source files must contain UTF-8 encoded text, unexpected null bytes might occur when a different encoding is used"); . } . err.emit(); . token? . } . }) . } . 4,176 ( 0.00%) fn cook_doc_comment( . &self, . content_start: BytePos, . content: &str, . comment_kind: CommentKind, . doc_style: DocStyle, . ) -> TokenKind { 348 ( 0.00%) if content.contains('\r') { . for (idx, _) in content.char_indices().filter(|&(_, c)| c == '\r') { . self.err_span_( . content_start + BytePos(idx as u32), . content_start + BytePos(idx as u32 + 1), . match comment_kind { . CommentKind::Line => "bare CR not allowed in doc-comment", . CommentKind::Block => "bare CR not allowed in block doc-comment", . }, -- line 347 ---------------------------------------- -- line 349 ---------------------------------------- . } . } . . let attr_style = match doc_style { . DocStyle::Outer => AttrStyle::Outer, . DocStyle::Inner => AttrStyle::Inner, . }; . 1,044 ( 0.00%) token::DocComment(comment_kind, attr_style, Symbol::intern(content)) 5,220 ( 0.00%) } . . fn cook_lexer_literal( . &self, . start: BytePos, . suffix_start: BytePos, . kind: rustc_lexer::LiteralKind, . ) -> (token::LitKind, Symbol) { . // prefix means `"` or `br"` or `r###"`, ... -- line 366 ---------------------------------------- -- line 380 ---------------------------------------- . self.sess.span_diagnostic.span_fatal_with_code( . self.mk_sp(start + BytePos(1), suffix_start), . "unterminated byte constant", . error_code!(E0763), . ) . } . (token::Byte, Mode::Byte, 2, 1) // b' ' . } 195 ( 0.00%) rustc_lexer::LiteralKind::Str { terminated } => { 195 ( 0.00%) if !terminated { . self.sess.span_diagnostic.span_fatal_with_code( . self.mk_sp(start, suffix_start), . "unterminated double quote string", . error_code!(E0765), . ) . } . (token::Str, Mode::Str, 1, 1) // " " . } -- line 397 ---------------------------------------- -- line 410 ---------------------------------------- . let n = u32::from(n_hashes); . (token::StrRaw(n_hashes), Mode::RawStr, 2 + n, 1 + n) // r##" "## . } . rustc_lexer::LiteralKind::RawByteStr { n_hashes, err } => { . self.report_raw_str_error(start, err); . let n = u32::from(n_hashes); . (token::ByteStrRaw(n_hashes), Mode::RawByteStr, 3 + n, 1 + n) // br##" "## . } 4 ( 0.00%) rustc_lexer::LiteralKind::Int { base, empty_int } => { 2 ( 0.00%) return if empty_int { . self.sess . .span_diagnostic . .struct_span_err_with_code( . self.mk_sp(start, suffix_start), . "no valid digits found for number", . error_code!(E0768), . ) . .emit(); . (token::Integer, sym::integer(0)) . } else { . self.validate_int_literal(base, start, suffix_start); 6 ( 0.00%) (token::Integer, self.symbol_from_to(start, suffix_start)) . }; . } . rustc_lexer::LiteralKind::Float { base, empty_exponent } => { . if empty_exponent { . self.err_span_(start, self.pos, "expected at least one digit in exponent"); . } . . match base { -- line 439 ---------------------------------------- -- line 452 ---------------------------------------- . } . . let id = self.symbol_from_to(start, suffix_start); . return (token::Float, id); . } . }; . let content_start = start + BytePos(prefix_len); . let content_end = suffix_start - BytePos(postfix_len); 585 ( 0.00%) let id = self.symbol_from_to(content_start, content_end); . self.validate_literal_escape(mode, content_start, content_end, prefix_len, postfix_len); . (lit_kind, id) . } . . #[inline] . fn src_index(&self, pos: BytePos) -> usize { . (pos - self.start_pos).to_usize() . } . . /// Slice of the source text from `start` up to but excluding `self.pos`, . /// meaning the slice does not include the character `self.ch`. . fn str_from(&self, start: BytePos) -> &str { 29,989 ( 0.01%) self.str_from_to(start, self.pos) . } . . /// As symbol_from, with an explicit endpoint. . fn symbol_from_to(&self, start: BytePos, end: BytePos) -> Symbol { . debug!("taking an ident from {:?} to {:?}", start, end); 2,354 ( 0.00%) Symbol::intern(self.str_from_to(start, end)) . } . . /// Slice of the source text spanning from `start` up to but excluding `end`. 5,303 ( 0.00%) fn str_from_to(&self, start: BytePos, end: BytePos) -> &str { . &self.src[self.src_index(start)..self.src_index(end)] 21,212 ( 0.00%) } . . fn report_raw_str_error(&self, start: BytePos, opt_err: Option) { . match opt_err { . Some(RawStrError::InvalidStarter { bad_char }) => { . self.report_non_started_raw_string(start, bad_char) . } . Some(RawStrError::NoTerminator { expected, found, possible_terminator_offset }) => self . .report_unterminated_raw_string(start, expected, possible_terminator_offset, found), -- line 493 ---------------------------------------- -- line 609 ---------------------------------------- . fn validate_literal_escape( . &self, . mode: Mode, . content_start: BytePos, . content_end: BytePos, . prefix_len: u32, . postfix_len: u32, . ) { 1,170 ( 0.00%) let lit_content = self.str_from_to(content_start, content_end); 31,394 ( 0.01%) unescape::unescape_literal(lit_content, mode, &mut |range, result| { . // Here we only check for errors. The actual unescaping is done later. 6,776 ( 0.00%) if let Err(err) = result { . let span_with_quotes = self . .mk_sp(content_start - BytePos(prefix_len), content_end + BytePos(postfix_len)); . let (start, end) = (range.start as u32, range.end as u32); . let lo = content_start + BytePos(start); . let hi = lo + BytePos(end - start); . let span = self.mk_sp(lo, hi); . emit_unescape_error( . &self.sess.span_diagnostic, -- line 628 ---------------------------------------- -- line 629 ---------------------------------------- . lit_content, . span_with_quotes, . span, . mode, . range, . err, . ); . } 30,492 ( 0.01%) }); . } . . fn validate_int_literal(&self, base: Base, content_start: BytePos, content_end: BytePos) { 8 ( 0.00%) let base = match base { . Base::Binary => 2, . Base::Octal => 8, . _ => return, . }; . let s = self.str_from_to(content_start + BytePos(2), content_end); . for (idx, c) in s.char_indices() { . let idx = idx as u32; . if c != '_' && c.to_digit(base).is_none() { -- line 649 ---------------------------------------- -- line 650 ---------------------------------------- . let lo = content_start + BytePos(2 + idx); . let hi = content_start + BytePos(2 + idx + c.len_utf8() as u32); . self.err_span_(lo, hi, &format!("invalid digit for a base {} literal", base)); . } . } . } . } . 40,662 ( 0.01%) pub fn nfc_normalize(string: &str) -> Symbol { . use unicode_normalization::{is_nfc_quick, IsNormalized, UnicodeNormalization}; 9,036 ( 0.00%) match is_nfc_quick(string.chars()) { 45,180 ( 0.01%) IsNormalized::Yes => Symbol::intern(string), . _ => { . let normalized_str: String = string.chars().nfc().collect(); . Symbol::intern(&normalized_str) . } . } . } 53,504 ( 0.01%) -------------------------------------------------------------------------------- -- Auto-annotated source: /usr/home/liquid/rust/worktree-benchmarking/library/core/src/num/uint_macros.rs -------------------------------------------------------------------------------- Ir -- line 57 ---------------------------------------- . /// # Examples . /// . /// Basic usage: . /// . /// ``` . #[doc = concat!("assert_eq!(", stringify!($SelfT), "::from_str_radix(\"A\", 16), Ok(10));")] . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] 4 ( 0.00%) pub fn from_str_radix(src: &str, radix: u32) -> Result { 2 ( 0.00%) from_str_radix(src, radix) 6 ( 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 { 19,305 ( 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 { 174,512 ( 0.03%) intrinsics::ctlz(self as $ActualT) as u32 . } . . /// Returns the number of trailing zeros in the binary representation . /// of `self`. . /// . /// # Examples . /// . /// Basic usage: -- line 134 ---------------------------------------- -- line 139 ---------------------------------------- . /// assert_eq!(n.trailing_zeros(), 3); . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_stable(feature = "const_math", since = "1.32.0")] . #[must_use = "this returns the result of the operation, \ . without modifying the original"] . #[inline(always)] . pub const fn trailing_zeros(self) -> u32 { 142,169 ( 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 { 3,292,645 ( 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 { 58 ( 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`. 289,889 ( 0.05%) 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`. 13,917 ( 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 { 37,727 ( 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 { 760 ( 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 { 1,380,709 ( 0.24%) 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 { 525,178 ( 0.09%) intrinsics::wrapping_sub(self, rhs) . } . . /// Wrapping (modular) multiplication. Computes `self * . /// rhs`, wrapping around at the boundary of the type. . /// . /// # Examples . /// . /// Basic usage: -- line 1233 ---------------------------------------- -- line 1240 ---------------------------------------- . /// assert_eq!(25u8.wrapping_mul(12), 44); . /// ``` . #[stable(feature = "rust1", since = "1.0.0")] . #[rustc_const_stable(feature = "const_wrapping_math", since = "1.32.0")] . #[must_use = "this returns the result of the operation, \ . without modifying the original"] . #[inline(always)] . pub const fn wrapping_mul(self, rhs: Self) -> Self { 2,522,321 ( 0.44%) 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) { 250,793 ( 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) { 55,982 ( 0.01%) 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) { 464,523 ( 0.08%) 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 { 114 ( 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 { 728 ( 0.00%) if self <= 1 { return 0; } . 5,564 ( 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. 16,631 ( 0.00%) let z = unsafe { intrinsics::ctlz_nonzero(p) }; 5,561 ( 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 { 10,368 ( 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 ---------------------------------------- 33,379 ( 0.01%) -------------------------------------------------------------------------------- The following files chosen for auto-annotation could not be found: -------------------------------------------------------------------------------- ./elf/../sysdeps/x86_64/dl-machine.h ./elf/dl-lookup.c ./elf/do-rel.h ./malloc/malloc.c ./string/../sysdeps/x86_64/multiarch/memmove-vec-unaligned-erms.S -------------------------------------------------------------------------------- Ir -------------------------------------------------------------------------------- 284,854,306 (49.27%) events annotated