rustc_symbol_mangling/
v0.rs

1use std::fmt::Write;
2use std::hash::Hasher;
3use std::iter;
4use std::ops::Range;
5
6use rustc_abi::{ExternAbi, Integer};
7use rustc_data_structures::base_n::ToBaseN;
8use rustc_data_structures::fx::FxHashMap;
9use rustc_data_structures::intern::Interned;
10use rustc_data_structures::stable_hasher::StableHasher;
11use rustc_hashes::Hash64;
12use rustc_hir as hir;
13use rustc_hir::def::CtorKind;
14use rustc_hir::def_id::{CrateNum, DefId};
15use rustc_hir::definitions::{DefPathData, DisambiguatedDefPathData};
16use rustc_middle::bug;
17use rustc_middle::ty::layout::IntegerExt;
18use rustc_middle::ty::print::{Print, PrintError, Printer};
19use rustc_middle::ty::{
20    self, FloatTy, GenericArg, GenericArgKind, Instance, IntTy, ReifyReason, Ty, TyCtxt,
21    TypeVisitable, TypeVisitableExt, UintTy,
22};
23use rustc_span::sym;
24
25pub(super) fn mangle<'tcx>(
26    tcx: TyCtxt<'tcx>,
27    instance: Instance<'tcx>,
28    instantiating_crate: Option<CrateNum>,
29    is_exportable: bool,
30) -> String {
31    let def_id = instance.def_id();
32    // FIXME(eddyb) this should ideally not be needed.
33    let args = tcx.normalize_erasing_regions(ty::TypingEnv::fully_monomorphized(), instance.args);
34
35    let prefix = "_R";
36    let mut cx: SymbolMangler<'_> = SymbolMangler {
37        tcx,
38        start_offset: prefix.len(),
39        is_exportable,
40        paths: FxHashMap::default(),
41        types: FxHashMap::default(),
42        consts: FxHashMap::default(),
43        binders: vec![],
44        out: String::from(prefix),
45    };
46
47    // Append `::{shim:...#0}` to shims that can coexist with a non-shim instance.
48    let shim_kind = match instance.def {
49        ty::InstanceKind::ThreadLocalShim(_) => Some("tls"),
50        ty::InstanceKind::VTableShim(_) => Some("vtable"),
51        ty::InstanceKind::ReifyShim(_, None) => Some("reify"),
52        ty::InstanceKind::ReifyShim(_, Some(ReifyReason::FnPtr)) => Some("reify_fnptr"),
53        ty::InstanceKind::ReifyShim(_, Some(ReifyReason::Vtable)) => Some("reify_vtable"),
54
55        // FIXME(async_closures): This shouldn't be needed when we fix
56        // `Instance::ty`/`Instance::def_id`.
57        ty::InstanceKind::ConstructCoroutineInClosureShim { receiver_by_ref: true, .. } => {
58            Some("by_move")
59        }
60        ty::InstanceKind::ConstructCoroutineInClosureShim { receiver_by_ref: false, .. } => {
61            Some("by_ref")
62        }
63        ty::InstanceKind::FutureDropPollShim(_, _, _) => Some("drop"),
64        _ => None,
65    };
66
67    if let ty::InstanceKind::AsyncDropGlue(_, ty) = instance.def {
68        let ty::Coroutine(_, cor_args) = ty.kind() else {
69            bug!();
70        };
71        let drop_ty = cor_args.first().unwrap().expect_ty();
72        cx.print_def_path(def_id, tcx.mk_args(&[GenericArg::from(drop_ty)])).unwrap()
73    } else if let Some(shim_kind) = shim_kind {
74        cx.path_append_ns(|cx| cx.print_def_path(def_id, args), 'S', 0, shim_kind).unwrap()
75    } else {
76        cx.print_def_path(def_id, args).unwrap()
77    };
78    if let Some(instantiating_crate) = instantiating_crate {
79        cx.print_def_path(instantiating_crate.as_def_id(), &[]).unwrap();
80    }
81    std::mem::take(&mut cx.out)
82}
83
84pub fn mangle_internal_symbol<'tcx>(tcx: TyCtxt<'tcx>, item_name: &str) -> String {
85    if item_name == "rust_eh_personality" {
86        // rust_eh_personality must not be renamed as LLVM hard-codes the name
87        return "rust_eh_personality".to_owned();
88    }
89
90    let prefix = "_R";
91    let mut cx: SymbolMangler<'_> = SymbolMangler {
92        tcx,
93        start_offset: prefix.len(),
94        is_exportable: false,
95        paths: FxHashMap::default(),
96        types: FxHashMap::default(),
97        consts: FxHashMap::default(),
98        binders: vec![],
99        out: String::from(prefix),
100    };
101
102    cx.path_append_ns(
103        |cx| {
104            cx.push("C");
105            cx.push_disambiguator({
106                let mut hasher = StableHasher::new();
107                // Incorporate the rustc version to ensure #[rustc_std_internal_symbol] functions
108                // get a different symbol name depending on the rustc version.
109                //
110                // RUSTC_FORCE_RUSTC_VERSION is ignored here as otherwise different we would get an
111                // abi incompatibility with the standard library.
112                hasher.write(tcx.sess.cfg_version.as_bytes());
113
114                let hash: Hash64 = hasher.finish();
115                hash.as_u64()
116            });
117            cx.push_ident("__rustc");
118            Ok(())
119        },
120        'v',
121        0,
122        item_name,
123    )
124    .unwrap();
125
126    std::mem::take(&mut cx.out)
127}
128
129pub(super) fn mangle_typeid_for_trait_ref<'tcx>(
130    tcx: TyCtxt<'tcx>,
131    trait_ref: ty::ExistentialTraitRef<'tcx>,
132) -> String {
133    // FIXME(flip1995): See comment in `mangle_typeid_for_fnabi`.
134    let mut cx = SymbolMangler {
135        tcx,
136        start_offset: 0,
137        is_exportable: false,
138        paths: FxHashMap::default(),
139        types: FxHashMap::default(),
140        consts: FxHashMap::default(),
141        binders: vec![],
142        out: String::new(),
143    };
144    cx.print_def_path(trait_ref.def_id, &[]).unwrap();
145    std::mem::take(&mut cx.out)
146}
147
148struct BinderLevel {
149    /// The range of distances from the root of what's
150    /// being printed, to the lifetimes in a binder.
151    /// Specifically, a `BrAnon` lifetime has depth
152    /// `lifetime_depths.start + index`, going away from the
153    /// the root and towards its use site, as the var index increases.
154    /// This is used to flatten rustc's pairing of `BrAnon`
155    /// (intra-binder disambiguation) with a `DebruijnIndex`
156    /// (binder addressing), to "true" de Bruijn indices,
157    /// by subtracting the depth of a certain lifetime, from
158    /// the innermost depth at its use site.
159    lifetime_depths: Range<u32>,
160}
161
162struct SymbolMangler<'tcx> {
163    tcx: TyCtxt<'tcx>,
164    binders: Vec<BinderLevel>,
165    out: String,
166    is_exportable: bool,
167
168    /// The length of the prefix in `out` (e.g. 2 for `_R`).
169    start_offset: usize,
170    /// The values are start positions in `out`, in bytes.
171    paths: FxHashMap<(DefId, &'tcx [GenericArg<'tcx>]), usize>,
172    types: FxHashMap<Ty<'tcx>, usize>,
173    consts: FxHashMap<ty::Const<'tcx>, usize>,
174}
175
176impl<'tcx> SymbolMangler<'tcx> {
177    fn push(&mut self, s: &str) {
178        self.out.push_str(s);
179    }
180
181    /// Push a `_`-terminated base 62 integer, using the format
182    /// specified in the RFC as `<base-62-number>`, that is:
183    /// * `x = 0` is encoded as just the `"_"` terminator
184    /// * `x > 0` is encoded as `x - 1` in base 62, followed by `"_"`,
185    ///   e.g. `1` becomes `"0_"`, `62` becomes `"Z_"`, etc.
186    fn push_integer_62(&mut self, x: u64) {
187        push_integer_62(x, &mut self.out)
188    }
189
190    /// Push a `tag`-prefixed base 62 integer, when larger than `0`, that is:
191    /// * `x = 0` is encoded as `""` (nothing)
192    /// * `x > 0` is encoded as the `tag` followed by `push_integer_62(x - 1)`
193    ///   e.g. `1` becomes `tag + "_"`, `2` becomes `tag + "0_"`, etc.
194    fn push_opt_integer_62(&mut self, tag: &str, x: u64) {
195        if let Some(x) = x.checked_sub(1) {
196            self.push(tag);
197            self.push_integer_62(x);
198        }
199    }
200
201    fn push_disambiguator(&mut self, dis: u64) {
202        self.push_opt_integer_62("s", dis);
203    }
204
205    fn push_ident(&mut self, ident: &str) {
206        push_ident(ident, &mut self.out)
207    }
208
209    fn path_append_ns(
210        &mut self,
211        print_prefix: impl FnOnce(&mut Self) -> Result<(), PrintError>,
212        ns: char,
213        disambiguator: u64,
214        name: &str,
215    ) -> Result<(), PrintError> {
216        self.push("N");
217        self.out.push(ns);
218        print_prefix(self)?;
219        self.push_disambiguator(disambiguator);
220        self.push_ident(name);
221        Ok(())
222    }
223
224    fn print_backref(&mut self, i: usize) -> Result<(), PrintError> {
225        self.push("B");
226        self.push_integer_62((i - self.start_offset) as u64);
227        Ok(())
228    }
229
230    fn wrap_binder<T>(
231        &mut self,
232        value: &ty::Binder<'tcx, T>,
233        print_value: impl FnOnce(&mut Self, &T) -> Result<(), PrintError>,
234    ) -> Result<(), PrintError>
235    where
236        T: TypeVisitable<TyCtxt<'tcx>>,
237    {
238        let mut lifetime_depths =
239            self.binders.last().map(|b| b.lifetime_depths.end).map_or(0..0, |i| i..i);
240
241        // FIXME(non-lifetime-binders): What to do here?
242        let lifetimes = value
243            .bound_vars()
244            .iter()
245            .filter(|var| matches!(var, ty::BoundVariableKind::Region(..)))
246            .count() as u32;
247
248        self.push_opt_integer_62("G", lifetimes as u64);
249        lifetime_depths.end += lifetimes;
250
251        self.binders.push(BinderLevel { lifetime_depths });
252        print_value(self, value.as_ref().skip_binder())?;
253        self.binders.pop();
254
255        Ok(())
256    }
257
258    fn print_pat(&mut self, pat: ty::Pattern<'tcx>) -> Result<(), std::fmt::Error> {
259        Ok(match *pat {
260            ty::PatternKind::Range { start, end } => {
261                let consts = [start, end];
262                for ct in consts {
263                    Ty::new_array_with_const_len(self.tcx, self.tcx.types.unit, ct).print(self)?;
264                }
265            }
266            ty::PatternKind::Or(patterns) => {
267                for pat in patterns {
268                    self.print_pat(pat)?;
269                }
270            }
271        })
272    }
273}
274
275impl<'tcx> Printer<'tcx> for SymbolMangler<'tcx> {
276    fn tcx(&self) -> TyCtxt<'tcx> {
277        self.tcx
278    }
279
280    fn print_def_path(
281        &mut self,
282        def_id: DefId,
283        args: &'tcx [GenericArg<'tcx>],
284    ) -> Result<(), PrintError> {
285        if let Some(&i) = self.paths.get(&(def_id, args)) {
286            return self.print_backref(i);
287        }
288        let start = self.out.len();
289
290        self.default_print_def_path(def_id, args)?;
291
292        // Only cache paths that do not refer to an enclosing
293        // binder (which would change depending on context).
294        if !args.iter().any(|k| k.has_escaping_bound_vars()) {
295            self.paths.insert((def_id, args), start);
296        }
297        Ok(())
298    }
299
300    fn print_impl_path(
301        &mut self,
302        impl_def_id: DefId,
303        args: &'tcx [GenericArg<'tcx>],
304    ) -> Result<(), PrintError> {
305        let key = self.tcx.def_key(impl_def_id);
306        let parent_def_id = DefId { index: key.parent.unwrap(), ..impl_def_id };
307
308        let self_ty = self.tcx.type_of(impl_def_id);
309        let impl_trait_ref = self.tcx.impl_trait_ref(impl_def_id);
310        let generics = self.tcx.generics_of(impl_def_id);
311        // We have two cases to worry about here:
312        // 1. We're printing a nested item inside of an impl item, like an inner
313        // function inside of a method. Due to the way that def path printing works,
314        // we'll render this something like `<Ty as Trait>::method::inner_fn`
315        // but we have no substs for this impl since it's not really inheriting
316        // generics from the outer item. We need to use the identity substs, and
317        // to normalize we need to use the correct param-env too.
318        // 2. We're mangling an item with identity substs. This seems to only happen
319        // when generating coverage, since we try to generate coverage for unused
320        // items too, and if something isn't monomorphized then we necessarily don't
321        // have anything to substitute the instance with.
322        // NOTE: We don't support mangling partially substituted but still polymorphic
323        // instances, like `impl<A> Tr<A> for ()` where `A` is substituted w/ `(T,)`.
324        let (typing_env, mut self_ty, mut impl_trait_ref) = if generics.count() > args.len()
325            || &args[..generics.count()]
326                == self
327                    .tcx
328                    .erase_regions(ty::GenericArgs::identity_for_item(self.tcx, impl_def_id))
329                    .as_slice()
330        {
331            (
332                ty::TypingEnv::post_analysis(self.tcx, impl_def_id),
333                self_ty.instantiate_identity(),
334                impl_trait_ref.map(|impl_trait_ref| impl_trait_ref.instantiate_identity()),
335            )
336        } else {
337            assert!(
338                !args.has_non_region_param(),
339                "should not be mangling partially substituted \
340                polymorphic instance: {impl_def_id:?} {args:?}"
341            );
342            (
343                ty::TypingEnv::fully_monomorphized(),
344                self_ty.instantiate(self.tcx, args),
345                impl_trait_ref.map(|impl_trait_ref| impl_trait_ref.instantiate(self.tcx, args)),
346            )
347        };
348
349        match &mut impl_trait_ref {
350            Some(impl_trait_ref) => {
351                assert_eq!(impl_trait_ref.self_ty(), self_ty);
352                *impl_trait_ref = self.tcx.normalize_erasing_regions(typing_env, *impl_trait_ref);
353                self_ty = impl_trait_ref.self_ty();
354            }
355            None => {
356                self_ty = self.tcx.normalize_erasing_regions(typing_env, self_ty);
357            }
358        }
359
360        self.push(match impl_trait_ref {
361            Some(_) => "X",
362            None => "M",
363        });
364
365        // Encode impl generic params if the generic parameters contain non-region parameters
366        // and this isn't an inherent impl.
367        if impl_trait_ref.is_some() && args.iter().any(|a| a.has_non_region_param()) {
368            self.path_generic_args(
369                |this| {
370                    this.path_append_ns(
371                        |cx| cx.print_def_path(parent_def_id, &[]),
372                        'I',
373                        key.disambiguated_data.disambiguator as u64,
374                        "",
375                    )
376                },
377                args,
378            )?;
379        } else {
380            let exported_impl_order = self.tcx.stable_order_of_exportable_impls(impl_def_id.krate);
381            let disambiguator = match self.is_exportable {
382                true => exported_impl_order[&impl_def_id] as u64,
383                false => {
384                    exported_impl_order.len() as u64 + key.disambiguated_data.disambiguator as u64
385                }
386            };
387            self.push_disambiguator(disambiguator);
388            self.print_def_path(parent_def_id, &[])?;
389        }
390
391        self_ty.print(self)?;
392
393        if let Some(trait_ref) = impl_trait_ref {
394            self.print_def_path(trait_ref.def_id, trait_ref.args)?;
395        }
396
397        Ok(())
398    }
399
400    fn print_region(&mut self, region: ty::Region<'_>) -> Result<(), PrintError> {
401        let i = match region.kind() {
402            // Erased lifetimes use the index 0, for a
403            // shorter mangling of `L_`.
404            ty::ReErased => 0,
405
406            // Bound lifetimes use indices starting at 1,
407            // see `BinderLevel` for more details.
408            ty::ReBound(debruijn, ty::BoundRegion { var, kind: ty::BoundRegionKind::Anon }) => {
409                let binder = &self.binders[self.binders.len() - 1 - debruijn.index()];
410                let depth = binder.lifetime_depths.start + var.as_u32();
411
412                1 + (self.binders.last().unwrap().lifetime_depths.end - 1 - depth)
413            }
414
415            _ => bug!("symbol_names: non-erased region `{:?}`", region),
416        };
417        self.push("L");
418        self.push_integer_62(i as u64);
419        Ok(())
420    }
421
422    fn print_type(&mut self, ty: Ty<'tcx>) -> Result<(), PrintError> {
423        // Basic types, never cached (single-character).
424        let basic_type = match ty.kind() {
425            ty::Bool => "b",
426            ty::Char => "c",
427            ty::Str => "e",
428            ty::Tuple(_) if ty.is_unit() => "u",
429            ty::Int(IntTy::I8) => "a",
430            ty::Int(IntTy::I16) => "s",
431            ty::Int(IntTy::I32) => "l",
432            ty::Int(IntTy::I64) => "x",
433            ty::Int(IntTy::I128) => "n",
434            ty::Int(IntTy::Isize) => "i",
435            ty::Uint(UintTy::U8) => "h",
436            ty::Uint(UintTy::U16) => "t",
437            ty::Uint(UintTy::U32) => "m",
438            ty::Uint(UintTy::U64) => "y",
439            ty::Uint(UintTy::U128) => "o",
440            ty::Uint(UintTy::Usize) => "j",
441            ty::Float(FloatTy::F16) => "C3f16",
442            ty::Float(FloatTy::F32) => "f",
443            ty::Float(FloatTy::F64) => "d",
444            ty::Float(FloatTy::F128) => "C4f128",
445            ty::Never => "z",
446
447            // Should only be encountered within the identity-substituted
448            // impl header of an item nested within an impl item.
449            ty::Param(_) => "p",
450
451            ty::Bound(..) | ty::Placeholder(_) | ty::Infer(_) | ty::Error(_) => bug!(),
452
453            _ => "",
454        };
455        if !basic_type.is_empty() {
456            self.push(basic_type);
457            return Ok(());
458        }
459
460        if let Some(&i) = self.types.get(&ty) {
461            return self.print_backref(i);
462        }
463        let start = self.out.len();
464
465        match *ty.kind() {
466            // Basic types, handled above.
467            ty::Bool | ty::Char | ty::Str | ty::Int(_) | ty::Uint(_) | ty::Float(_) | ty::Never => {
468                unreachable!()
469            }
470            ty::Tuple(_) if ty.is_unit() => unreachable!(),
471
472            // Placeholders, also handled as part of basic types.
473            ty::Param(_) | ty::Bound(..) | ty::Placeholder(_) | ty::Infer(_) | ty::Error(_) => {
474                unreachable!()
475            }
476
477            ty::Ref(r, ty, mutbl) => {
478                self.push(match mutbl {
479                    hir::Mutability::Not => "R",
480                    hir::Mutability::Mut => "Q",
481                });
482                if !r.is_erased() {
483                    r.print(self)?;
484                }
485                ty.print(self)?;
486            }
487
488            ty::RawPtr(ty, mutbl) => {
489                self.push(match mutbl {
490                    hir::Mutability::Not => "P",
491                    hir::Mutability::Mut => "O",
492                });
493                ty.print(self)?;
494            }
495
496            ty::Pat(ty, pat) => {
497                // HACK: Represent as tuple until we have something better.
498                // HACK: constants are used in arrays, even if the types don't match.
499                self.push("T");
500                ty.print(self)?;
501                self.print_pat(pat)?;
502                self.push("E");
503            }
504
505            ty::Array(ty, len) => {
506                self.push("A");
507                ty.print(self)?;
508                self.print_const(len)?;
509            }
510            ty::Slice(ty) => {
511                self.push("S");
512                ty.print(self)?;
513            }
514
515            ty::Tuple(tys) => {
516                self.push("T");
517                for ty in tys.iter() {
518                    ty.print(self)?;
519                }
520                self.push("E");
521            }
522
523            // Mangle all nominal types as paths.
524            ty::Adt(ty::AdtDef(Interned(&ty::AdtDefData { did: def_id, .. }, _)), args)
525            | ty::FnDef(def_id, args)
526            | ty::Closure(def_id, args)
527            | ty::CoroutineClosure(def_id, args)
528            | ty::Coroutine(def_id, args) => {
529                self.print_def_path(def_id, args)?;
530            }
531
532            // We may still encounter projections here due to the printing
533            // logic sometimes passing identity-substituted impl headers.
534            ty::Alias(ty::Projection, ty::AliasTy { def_id, args, .. }) => {
535                self.print_def_path(def_id, args)?;
536            }
537
538            ty::Foreign(def_id) => {
539                self.print_def_path(def_id, &[])?;
540            }
541
542            ty::FnPtr(sig_tys, hdr) => {
543                let sig = sig_tys.with(hdr);
544                self.push("F");
545                self.wrap_binder(&sig, |cx, sig| {
546                    if sig.safety.is_unsafe() {
547                        cx.push("U");
548                    }
549                    match sig.abi {
550                        ExternAbi::Rust => {}
551                        ExternAbi::C { unwind: false } => cx.push("KC"),
552                        abi => {
553                            cx.push("K");
554                            let name = abi.as_str();
555                            if name.contains('-') {
556                                cx.push_ident(&name.replace('-', "_"));
557                            } else {
558                                cx.push_ident(name);
559                            }
560                        }
561                    }
562                    for &ty in sig.inputs() {
563                        ty.print(cx)?;
564                    }
565                    if sig.c_variadic {
566                        cx.push("v");
567                    }
568                    cx.push("E");
569                    sig.output().print(cx)
570                })?;
571            }
572
573            // FIXME(unsafe_binder):
574            ty::UnsafeBinder(..) => todo!(),
575
576            ty::Dynamic(predicates, r, kind) => {
577                self.push(match kind {
578                    ty::Dyn => "D",
579                });
580                self.print_dyn_existential(predicates)?;
581                r.print(self)?;
582            }
583
584            ty::Alias(..) => bug!("symbol_names: unexpected alias"),
585            ty::CoroutineWitness(..) => bug!("symbol_names: unexpected `CoroutineWitness`"),
586        }
587
588        // Only cache types that do not refer to an enclosing
589        // binder (which would change depending on context).
590        if !ty.has_escaping_bound_vars() {
591            self.types.insert(ty, start);
592        }
593        Ok(())
594    }
595
596    fn print_dyn_existential(
597        &mut self,
598        predicates: &'tcx ty::List<ty::PolyExistentialPredicate<'tcx>>,
599    ) -> Result<(), PrintError> {
600        // Okay, so this is a bit tricky. Imagine we have a trait object like
601        // `dyn for<'a> Foo<'a, Bar = &'a ()>`. When we mangle this, the
602        // output looks really close to the syntax, where the `Bar = &'a ()` bit
603        // is under the same binders (`['a]`) as the `Foo<'a>` bit. However, we
604        // actually desugar these into two separate `ExistentialPredicate`s. We
605        // can't enter/exit the "binder scope" twice though, because then we
606        // would mangle the binders twice. (Also, side note, we merging these
607        // two is kind of difficult, because of potential HRTBs in the Projection
608        // predicate.)
609        //
610        // Also worth mentioning: imagine that we instead had
611        // `dyn for<'a> Foo<'a, Bar = &'a ()> + Send`. In this case, `Send` is
612        // under the same binders as `Foo`. Currently, this doesn't matter,
613        // because only *auto traits* are allowed other than the principal trait
614        // and all auto traits don't have any generics. Two things could
615        // make this not an "okay" mangling:
616        // 1) Instead of mangling only *used*
617        // bound vars, we want to mangle *all* bound vars (`for<'b> Send` is a
618        // valid trait predicate);
619        // 2) We allow multiple "principal" traits in the future, or at least
620        // allow in any form another trait predicate that can take generics.
621        //
622        // Here we assume that predicates have the following structure:
623        // [<Trait> [{<Projection>}]] [{<Auto>}]
624        // Since any predicates after the first one shouldn't change the binders,
625        // just put them all in the binders of the first.
626        self.wrap_binder(&predicates[0], |cx, _| {
627            for predicate in predicates.iter() {
628                // It would be nice to be able to validate bound vars here, but
629                // projections can actually include bound vars from super traits
630                // because of HRTBs (only in the `Self` type). Also, auto traits
631                // could have different bound vars *anyways*.
632                match predicate.as_ref().skip_binder() {
633                    ty::ExistentialPredicate::Trait(trait_ref) => {
634                        // Use a type that can't appear in defaults of type parameters.
635                        let dummy_self = Ty::new_fresh(cx.tcx, 0);
636                        let trait_ref = trait_ref.with_self_ty(cx.tcx, dummy_self);
637                        cx.print_def_path(trait_ref.def_id, trait_ref.args)?;
638                    }
639                    ty::ExistentialPredicate::Projection(projection) => {
640                        let name = cx.tcx.associated_item(projection.def_id).name();
641                        cx.push("p");
642                        cx.push_ident(name.as_str());
643                        match projection.term.kind() {
644                            ty::TermKind::Ty(ty) => ty.print(cx),
645                            ty::TermKind::Const(c) => c.print(cx),
646                        }?;
647                    }
648                    ty::ExistentialPredicate::AutoTrait(def_id) => {
649                        cx.print_def_path(*def_id, &[])?;
650                    }
651                }
652            }
653            Ok(())
654        })?;
655
656        self.push("E");
657        Ok(())
658    }
659
660    fn print_const(&mut self, ct: ty::Const<'tcx>) -> Result<(), PrintError> {
661        // We only mangle a typed value if the const can be evaluated.
662        let cv = match ct.kind() {
663            ty::ConstKind::Value(cv) => cv,
664
665            // Should only be encountered within the identity-substituted
666            // impl header of an item nested within an impl item.
667            ty::ConstKind::Param(_) => {
668                // Never cached (single-character).
669                self.push("p");
670                return Ok(());
671            }
672
673            // We may still encounter unevaluated consts due to the printing
674            // logic sometimes passing identity-substituted impl headers.
675            ty::ConstKind::Unevaluated(ty::UnevaluatedConst { def, args, .. }) => {
676                return self.print_def_path(def, args);
677            }
678
679            ty::ConstKind::Expr(_)
680            | ty::ConstKind::Infer(_)
681            | ty::ConstKind::Bound(..)
682            | ty::ConstKind::Placeholder(_)
683            | ty::ConstKind::Error(_) => bug!(),
684        };
685
686        if let Some(&i) = self.consts.get(&ct) {
687            self.print_backref(i)?;
688            return Ok(());
689        }
690
691        let ty::Value { ty: ct_ty, valtree } = cv;
692        let start = self.out.len();
693
694        match ct_ty.kind() {
695            ty::Uint(_) | ty::Int(_) | ty::Bool | ty::Char => {
696                ct_ty.print(self)?;
697
698                let mut bits = cv
699                    .try_to_bits(self.tcx, ty::TypingEnv::fully_monomorphized())
700                    .expect("expected const to be monomorphic");
701
702                // Negative integer values are mangled using `n` as a "sign prefix".
703                if let ty::Int(ity) = ct_ty.kind() {
704                    let val =
705                        Integer::from_int_ty(&self.tcx, *ity).size().sign_extend(bits) as i128;
706                    if val < 0 {
707                        self.push("n");
708                    }
709                    bits = val.unsigned_abs();
710                }
711
712                let _ = write!(self.out, "{bits:x}_");
713            }
714
715            // Handle `str` as partial support for unsized constants
716            ty::Str => {
717                let tcx = self.tcx();
718                // HACK(jaic1): hide the `str` type behind a reference
719                // for the following transformation from valtree to raw bytes
720                let ref_ty = Ty::new_imm_ref(tcx, tcx.lifetimes.re_static, ct_ty);
721                let cv = ty::Value { ty: ref_ty, valtree };
722                let slice = cv.try_to_raw_bytes(tcx).unwrap_or_else(|| {
723                    bug!("expected to get raw bytes from valtree {:?} for type {:}", valtree, ct_ty)
724                });
725                let s = std::str::from_utf8(slice).expect("non utf8 str from MIR interpreter");
726
727                // "e" for str as a basic type
728                self.push("e");
729
730                // FIXME(eddyb) use a specialized hex-encoding loop.
731                for byte in s.bytes() {
732                    let _ = write!(self.out, "{byte:02x}");
733                }
734
735                self.push("_");
736            }
737
738            // FIXME(valtrees): Remove the special case for `str`
739            // here and fully support unsized constants.
740            ty::Ref(_, _, mutbl) => {
741                self.push(match mutbl {
742                    hir::Mutability::Not => "R",
743                    hir::Mutability::Mut => "Q",
744                });
745
746                let pointee_ty =
747                    ct_ty.builtin_deref(true).expect("tried to dereference on non-ptr type");
748                let dereferenced_const = ty::Const::new_value(self.tcx, valtree, pointee_ty);
749                dereferenced_const.print(self)?;
750            }
751
752            ty::Array(..) | ty::Tuple(..) | ty::Adt(..) | ty::Slice(_) => {
753                let contents = self.tcx.destructure_const(ct);
754                let fields = contents.fields.iter().copied();
755
756                let print_field_list = |this: &mut Self| {
757                    for field in fields.clone() {
758                        field.print(this)?;
759                    }
760                    this.push("E");
761                    Ok(())
762                };
763
764                match *ct_ty.kind() {
765                    ty::Array(..) | ty::Slice(_) => {
766                        self.push("A");
767                        print_field_list(self)?;
768                    }
769                    ty::Tuple(..) => {
770                        self.push("T");
771                        print_field_list(self)?;
772                    }
773                    ty::Adt(def, args) => {
774                        let variant_idx =
775                            contents.variant.expect("destructed const of adt without variant idx");
776                        let variant_def = &def.variant(variant_idx);
777
778                        self.push("V");
779                        self.print_def_path(variant_def.def_id, args)?;
780
781                        match variant_def.ctor_kind() {
782                            Some(CtorKind::Const) => {
783                                self.push("U");
784                            }
785                            Some(CtorKind::Fn) => {
786                                self.push("T");
787                                print_field_list(self)?;
788                            }
789                            None => {
790                                self.push("S");
791                                for (field_def, field) in iter::zip(&variant_def.fields, fields) {
792                                    // HACK(eddyb) this mimics `path_append`,
793                                    // instead of simply using `field_def.ident`,
794                                    // just to be able to handle disambiguators.
795                                    let disambiguated_field =
796                                        self.tcx.def_key(field_def.did).disambiguated_data;
797                                    let field_name = disambiguated_field.data.get_opt_name();
798                                    self.push_disambiguator(
799                                        disambiguated_field.disambiguator as u64,
800                                    );
801                                    self.push_ident(field_name.unwrap().as_str());
802
803                                    field.print(self)?;
804                                }
805                                self.push("E");
806                            }
807                        }
808                    }
809                    _ => unreachable!(),
810                }
811            }
812            _ => {
813                bug!("symbol_names: unsupported constant of type `{}` ({:?})", ct_ty, ct);
814            }
815        }
816
817        // Only cache consts that do not refer to an enclosing
818        // binder (which would change depending on context).
819        if !ct.has_escaping_bound_vars() {
820            self.consts.insert(ct, start);
821        }
822        Ok(())
823    }
824
825    fn path_crate(&mut self, cnum: CrateNum) -> Result<(), PrintError> {
826        self.push("C");
827        if !self.is_exportable {
828            let stable_crate_id = self.tcx.def_path_hash(cnum.as_def_id()).stable_crate_id();
829            self.push_disambiguator(stable_crate_id.as_u64());
830        }
831        let name = self.tcx.crate_name(cnum);
832        self.push_ident(name.as_str());
833        Ok(())
834    }
835
836    fn path_qualified(
837        &mut self,
838        self_ty: Ty<'tcx>,
839        trait_ref: Option<ty::TraitRef<'tcx>>,
840    ) -> Result<(), PrintError> {
841        assert!(trait_ref.is_some());
842        let trait_ref = trait_ref.unwrap();
843
844        self.push("Y");
845        self_ty.print(self)?;
846        self.print_def_path(trait_ref.def_id, trait_ref.args)
847    }
848
849    fn path_append_impl(
850        &mut self,
851        _: impl FnOnce(&mut Self) -> Result<(), PrintError>,
852        _: &DisambiguatedDefPathData,
853        _: Ty<'tcx>,
854        _: Option<ty::TraitRef<'tcx>>,
855    ) -> Result<(), PrintError> {
856        // Inlined into `print_impl_path`
857        unreachable!()
858    }
859
860    fn path_append(
861        &mut self,
862        print_prefix: impl FnOnce(&mut Self) -> Result<(), PrintError>,
863        disambiguated_data: &DisambiguatedDefPathData,
864    ) -> Result<(), PrintError> {
865        let ns = match disambiguated_data.data {
866            // Extern block segments can be skipped, names from extern blocks
867            // are effectively living in their parent modules.
868            DefPathData::ForeignMod => return print_prefix(self),
869
870            // Uppercase categories are more stable than lowercase ones.
871            DefPathData::TypeNs(_) => 't',
872            DefPathData::ValueNs(_) => 'v',
873            DefPathData::Closure => 'C',
874            DefPathData::Ctor => 'c',
875            DefPathData::AnonConst => 'k',
876            DefPathData::OpaqueTy => 'i',
877            DefPathData::SyntheticCoroutineBody => 's',
878            DefPathData::NestedStatic => 'n',
879
880            // These should never show up as `path_append` arguments.
881            DefPathData::CrateRoot
882            | DefPathData::Use
883            | DefPathData::GlobalAsm
884            | DefPathData::Impl
885            | DefPathData::MacroNs(_)
886            | DefPathData::LifetimeNs(_)
887            | DefPathData::OpaqueLifetime(_)
888            | DefPathData::AnonAssocTy(..) => {
889                bug!("symbol_names: unexpected DefPathData: {:?}", disambiguated_data.data)
890            }
891        };
892
893        let name = disambiguated_data.data.get_opt_name();
894
895        self.path_append_ns(
896            print_prefix,
897            ns,
898            disambiguated_data.disambiguator as u64,
899            name.unwrap_or(sym::empty).as_str(),
900        )
901    }
902
903    fn path_generic_args(
904        &mut self,
905        print_prefix: impl FnOnce(&mut Self) -> Result<(), PrintError>,
906        args: &[GenericArg<'tcx>],
907    ) -> Result<(), PrintError> {
908        // Don't print any regions if they're all erased.
909        let print_regions = args.iter().any(|arg| match arg.kind() {
910            GenericArgKind::Lifetime(r) => !r.is_erased(),
911            _ => false,
912        });
913        let args = args.iter().cloned().filter(|arg| match arg.kind() {
914            GenericArgKind::Lifetime(_) => print_regions,
915            _ => true,
916        });
917
918        if args.clone().next().is_none() {
919            return print_prefix(self);
920        }
921
922        self.push("I");
923        print_prefix(self)?;
924        for arg in args {
925            match arg.kind() {
926                GenericArgKind::Lifetime(lt) => {
927                    lt.print(self)?;
928                }
929                GenericArgKind::Type(ty) => {
930                    ty.print(self)?;
931                }
932                GenericArgKind::Const(c) => {
933                    self.push("K");
934                    c.print(self)?;
935                }
936            }
937        }
938        self.push("E");
939
940        Ok(())
941    }
942}
943/// Push a `_`-terminated base 62 integer, using the format
944/// specified in the RFC as `<base-62-number>`, that is:
945/// * `x = 0` is encoded as just the `"_"` terminator
946/// * `x > 0` is encoded as `x - 1` in base 62, followed by `"_"`,
947///   e.g. `1` becomes `"0_"`, `62` becomes `"Z_"`, etc.
948pub(crate) fn push_integer_62(x: u64, output: &mut String) {
949    if let Some(x) = x.checked_sub(1) {
950        output.push_str(&x.to_base(62));
951    }
952    output.push('_');
953}
954
955pub(crate) fn encode_integer_62(x: u64) -> String {
956    let mut output = String::new();
957    push_integer_62(x, &mut output);
958    output
959}
960
961pub(crate) fn push_ident(ident: &str, output: &mut String) {
962    let mut use_punycode = false;
963    for b in ident.bytes() {
964        match b {
965            b'_' | b'a'..=b'z' | b'A'..=b'Z' | b'0'..=b'9' => {}
966            0x80..=0xff => use_punycode = true,
967            _ => bug!("symbol_names: bad byte {} in ident {:?}", b, ident),
968        }
969    }
970
971    let punycode_string;
972    let ident = if use_punycode {
973        output.push('u');
974
975        // FIXME(eddyb) we should probably roll our own punycode implementation.
976        let mut punycode_bytes = match punycode::encode(ident) {
977            Ok(s) => s.into_bytes(),
978            Err(()) => bug!("symbol_names: punycode encoding failed for ident {:?}", ident),
979        };
980
981        // Replace `-` with `_`.
982        if let Some(c) = punycode_bytes.iter_mut().rfind(|&&mut c| c == b'-') {
983            *c = b'_';
984        }
985
986        // FIXME(eddyb) avoid rechecking UTF-8 validity.
987        punycode_string = String::from_utf8(punycode_bytes).unwrap();
988        &punycode_string
989    } else {
990        ident
991    };
992
993    let _ = write!(output, "{}", ident.len());
994
995    // Write a separating `_` if necessary (leading digit or `_`).
996    if let Some('_' | '0'..='9') = ident.chars().next() {
997        output.push('_');
998    }
999
1000    output.push_str(ident);
1001}