1 use super::operand::OperandRef;
2 use super::operand::OperandValue::{Immediate, Pair, Ref};
3 use super::place::PlaceRef;
4 use super::{FunctionCx, LocalRef};
7 use crate::common::{self, IntPredicate};
13 use rustc_ast::{InlineAsmOptions, InlineAsmTemplatePiece};
14 use rustc_hir::lang_items::LangItem;
15 use rustc_index::vec::Idx;
16 use rustc_middle::mir::{self, AssertKind, SwitchTargets};
17 use rustc_middle::ty::layout::{HasTyCtxt, LayoutOf};
18 use rustc_middle::ty::print::{with_no_trimmed_paths, with_no_visible_paths};
19 use rustc_middle::ty::{self, Instance, Ty, TypeVisitable};
20 use rustc_span::source_map::Span;
21 use rustc_span::{sym, Symbol};
22 use rustc_symbol_mangling::typeid::typeid_for_fnabi;
23 use rustc_target::abi::call::{ArgAbi, FnAbi, PassMode, Reg};
24 use rustc_target::abi::{self, HasDataLayout, WrappingRange};
25 use rustc_target::spec::abi::Abi;
27 /// Used by `FunctionCx::codegen_terminator` for emitting common patterns
28 /// e.g., creating a basic block, calling a function, etc.
29 struct TerminatorCodegenHelper<'tcx> {
31 terminator: &'tcx mir::Terminator<'tcx>,
32 funclet_bb: Option<mir::BasicBlock>,
35 impl<'a, 'tcx> TerminatorCodegenHelper<'tcx> {
36 /// Returns the appropriate `Funclet` for the current funclet, if on MSVC,
37 /// either already previously cached, or newly created, by `landing_pad_for`.
38 fn funclet<'b, Bx: BuilderMethods<'a, 'tcx>>(
40 fx: &'b mut FunctionCx<'a, 'tcx, Bx>,
41 ) -> Option<&'b Bx::Funclet> {
42 let funclet_bb = self.funclet_bb?;
43 if base::wants_msvc_seh(fx.cx.tcx().sess) {
44 // If `landing_pad_for` hasn't been called yet to create the `Funclet`,
45 // it has to be now. This may not seem necessary, as RPO should lead
46 // to all the unwind edges being visited (and so to `landing_pad_for`
47 // getting called for them), before building any of the blocks inside
48 // the funclet itself - however, if MIR contains edges that end up not
49 // being needed in the LLVM IR after monomorphization, the funclet may
50 // be unreachable, and we don't have yet a way to skip building it in
51 // such an eventuality (which may be a better solution than this).
52 if fx.funclets[funclet_bb].is_none() {
53 fx.landing_pad_for(funclet_bb);
57 fx.funclets[funclet_bb]
59 .expect("landing_pad_for didn't also create funclets entry"),
66 fn lltarget<Bx: BuilderMethods<'a, 'tcx>>(
68 fx: &mut FunctionCx<'a, 'tcx, Bx>,
69 target: mir::BasicBlock,
70 ) -> (Bx::BasicBlock, bool) {
71 let span = self.terminator.source_info.span;
72 let lltarget = fx.llbb(target);
73 let target_funclet = fx.cleanup_kinds[target].funclet_bb(target);
74 match (self.funclet_bb, target_funclet) {
75 (None, None) => (lltarget, false),
76 (Some(f), Some(t_f)) if f == t_f || !base::wants_msvc_seh(fx.cx.tcx().sess) => {
79 // jump *into* cleanup - need a landing pad if GNU, cleanup pad if MSVC
80 (None, Some(_)) => (fx.landing_pad_for(target), false),
81 (Some(_), None) => span_bug!(span, "{:?} - jump out of cleanup?", self.terminator),
82 (Some(_), Some(_)) => (fx.landing_pad_for(target), true),
86 /// Create a basic block.
87 fn llblock<Bx: BuilderMethods<'a, 'tcx>>(
89 fx: &mut FunctionCx<'a, 'tcx, Bx>,
90 target: mir::BasicBlock,
92 let (lltarget, is_cleanupret) = self.lltarget(fx, target);
94 // MSVC cross-funclet jump - need a trampoline
96 debug!("llblock: creating cleanup trampoline for {:?}", target);
97 let name = &format!("{:?}_cleanup_trampoline_{:?}", self.bb, target);
98 let trampoline = Bx::append_block(fx.cx, fx.llfn, name);
99 let mut trampoline_bx = Bx::build(fx.cx, trampoline);
100 trampoline_bx.cleanup_ret(self.funclet(fx).unwrap(), Some(lltarget));
107 fn funclet_br<Bx: BuilderMethods<'a, 'tcx>>(
109 fx: &mut FunctionCx<'a, 'tcx, Bx>,
111 target: mir::BasicBlock,
113 let (lltarget, is_cleanupret) = self.lltarget(fx, target);
115 // micro-optimization: generate a `ret` rather than a jump
117 bx.cleanup_ret(self.funclet(fx).unwrap(), Some(lltarget));
123 /// Call `fn_ptr` of `fn_abi` with the arguments `llargs`, the optional
124 /// return destination `destination` and the cleanup function `cleanup`.
125 fn do_call<Bx: BuilderMethods<'a, 'tcx>>(
127 fx: &mut FunctionCx<'a, 'tcx, Bx>,
129 fn_abi: &'tcx FnAbi<'tcx, Ty<'tcx>>,
131 llargs: &[Bx::Value],
132 destination: Option<(ReturnDest<'tcx, Bx::Value>, mir::BasicBlock)>,
133 cleanup: Option<mir::BasicBlock>,
134 copied_constant_arguments: &[PlaceRef<'tcx, <Bx as BackendTypes>::Value>],
136 // If there is a cleanup block and the function we're calling can unwind, then
137 // do an invoke, otherwise do a call.
138 let fn_ty = bx.fn_decl_backend_type(&fn_abi);
140 let unwind_block = if let Some(cleanup) = cleanup.filter(|_| fn_abi.can_unwind) {
141 Some(self.llblock(fx, cleanup))
142 } else if fx.mir[self.bb].is_cleanup
144 && !base::wants_msvc_seh(fx.cx.tcx().sess)
146 // Exception must not propagate out of the execution of a cleanup (doing so
147 // can cause undefined behaviour). We insert a double unwind guard for
148 // functions that can potentially unwind to protect against this.
150 // This is not necessary for SEH which does not use successive unwinding
151 // like Itanium EH. EH frames in SEH are different from normal function
152 // frames and SEH will abort automatically if an exception tries to
153 // propagate out from cleanup.
154 Some(fx.double_unwind_guard())
159 if let Some(unwind_block) = unwind_block {
160 let ret_llbb = if let Some((_, target)) = destination {
163 fx.unreachable_block()
166 bx.invoke(fn_ty, fn_ptr, &llargs, ret_llbb, unwind_block, self.funclet(fx));
167 bx.apply_attrs_callsite(&fn_abi, invokeret);
168 if fx.mir[self.bb].is_cleanup {
169 bx.do_not_inline(invokeret);
172 if let Some((ret_dest, target)) = destination {
173 bx.switch_to_block(fx.llbb(target));
174 fx.set_debug_loc(bx, self.terminator.source_info);
175 for tmp in copied_constant_arguments {
176 bx.lifetime_end(tmp.llval, tmp.layout.size);
178 fx.store_return(bx, ret_dest, &fn_abi.ret, invokeret);
181 let llret = bx.call(fn_ty, fn_ptr, &llargs, self.funclet(fx));
182 bx.apply_attrs_callsite(&fn_abi, llret);
183 if fx.mir[self.bb].is_cleanup {
184 // Cleanup is always the cold path. Don't inline
185 // drop glue. Also, when there is a deeply-nested
186 // struct, there are "symmetry" issues that cause
187 // exponential inlining - see issue #41696.
188 bx.do_not_inline(llret);
191 if let Some((ret_dest, target)) = destination {
192 for tmp in copied_constant_arguments {
193 bx.lifetime_end(tmp.llval, tmp.layout.size);
195 fx.store_return(bx, ret_dest, &fn_abi.ret, llret);
196 self.funclet_br(fx, bx, target);
203 /// Generates inline assembly with optional `destination` and `cleanup`.
204 fn do_inlineasm<Bx: BuilderMethods<'a, 'tcx>>(
206 fx: &mut FunctionCx<'a, 'tcx, Bx>,
208 template: &[InlineAsmTemplatePiece],
209 operands: &[InlineAsmOperandRef<'tcx, Bx>],
210 options: InlineAsmOptions,
212 destination: Option<mir::BasicBlock>,
213 cleanup: Option<mir::BasicBlock>,
214 instance: Instance<'_>,
216 if let Some(cleanup) = cleanup {
217 let ret_llbb = if let Some(target) = destination {
220 fx.unreachable_block()
223 bx.codegen_inline_asm(
229 Some((ret_llbb, self.llblock(fx, cleanup), self.funclet(fx))),
232 bx.codegen_inline_asm(template, &operands, options, line_spans, instance, None);
234 if let Some(target) = destination {
235 self.funclet_br(fx, bx, target);
243 /// Codegen implementations for some terminator variants.
244 impl<'a, 'tcx, Bx: BuilderMethods<'a, 'tcx>> FunctionCx<'a, 'tcx, Bx> {
245 /// Generates code for a `Resume` terminator.
246 fn codegen_resume_terminator(&mut self, helper: TerminatorCodegenHelper<'tcx>, mut bx: Bx) {
247 if let Some(funclet) = helper.funclet(self) {
248 bx.cleanup_ret(funclet, None);
250 let slot = self.get_personality_slot(&mut bx);
251 let lp0 = slot.project_field(&mut bx, 0);
252 let lp0 = bx.load_operand(lp0).immediate();
253 let lp1 = slot.project_field(&mut bx, 1);
254 let lp1 = bx.load_operand(lp1).immediate();
255 slot.storage_dead(&mut bx);
257 let mut lp = bx.const_undef(self.landing_pad_type());
258 lp = bx.insert_value(lp, lp0, 0);
259 lp = bx.insert_value(lp, lp1, 1);
264 fn codegen_switchint_terminator(
266 helper: TerminatorCodegenHelper<'tcx>,
268 discr: &mir::Operand<'tcx>,
270 targets: &SwitchTargets,
272 let discr = self.codegen_operand(&mut bx, &discr);
273 // `switch_ty` is redundant, sanity-check that.
274 assert_eq!(discr.layout.ty, switch_ty);
275 let mut target_iter = targets.iter();
276 if target_iter.len() == 1 {
277 // If there are two targets (one conditional, one fallback), emit br instead of switch
278 let (test_value, target) = target_iter.next().unwrap();
279 let lltrue = helper.llblock(self, target);
280 let llfalse = helper.llblock(self, targets.otherwise());
281 if switch_ty == bx.tcx().types.bool {
282 // Don't generate trivial icmps when switching on bool
284 0 => bx.cond_br(discr.immediate(), llfalse, lltrue),
285 1 => bx.cond_br(discr.immediate(), lltrue, llfalse),
289 let switch_llty = bx.immediate_backend_type(bx.layout_of(switch_ty));
290 let llval = bx.const_uint_big(switch_llty, test_value);
291 let cmp = bx.icmp(IntPredicate::IntEQ, discr.immediate(), llval);
292 bx.cond_br(cmp, lltrue, llfalse);
297 helper.llblock(self, targets.otherwise()),
298 target_iter.map(|(value, target)| (value, helper.llblock(self, target))),
303 fn codegen_return_terminator(&mut self, mut bx: Bx) {
304 // Call `va_end` if this is the definition of a C-variadic function.
305 if self.fn_abi.c_variadic {
306 // The `VaList` "spoofed" argument is just after all the real arguments.
307 let va_list_arg_idx = self.fn_abi.args.len();
308 match self.locals[mir::Local::new(1 + va_list_arg_idx)] {
309 LocalRef::Place(va_list) => {
310 bx.va_end(va_list.llval);
312 _ => bug!("C-variadic function must have a `VaList` place"),
315 if self.fn_abi.ret.layout.abi.is_uninhabited() {
316 // Functions with uninhabited return values are marked `noreturn`,
317 // so we should make sure that we never actually do.
318 // We play it safe by using a well-defined `abort`, but we could go for immediate UB
319 // if that turns out to be helpful.
321 // `abort` does not terminate the block, so we still need to generate
322 // an `unreachable` terminator after it.
326 let llval = match &self.fn_abi.ret.mode {
327 PassMode::Ignore | PassMode::Indirect { .. } => {
332 PassMode::Direct(_) | PassMode::Pair(..) => {
333 let op = self.codegen_consume(&mut bx, mir::Place::return_place().as_ref());
334 if let Ref(llval, _, align) = op.val {
335 bx.load(bx.backend_type(op.layout), llval, align)
337 op.immediate_or_packed_pair(&mut bx)
341 PassMode::Cast(cast_ty, _) => {
342 let op = match self.locals[mir::RETURN_PLACE] {
343 LocalRef::Operand(Some(op)) => op,
344 LocalRef::Operand(None) => bug!("use of return before def"),
345 LocalRef::Place(cg_place) => OperandRef {
346 val: Ref(cg_place.llval, None, cg_place.align),
347 layout: cg_place.layout,
349 LocalRef::UnsizedPlace(_) => bug!("return type must be sized"),
351 let llslot = match op.val {
352 Immediate(_) | Pair(..) => {
353 let scratch = PlaceRef::alloca(&mut bx, self.fn_abi.ret.layout);
354 op.val.store(&mut bx, scratch);
357 Ref(llval, _, align) => {
358 assert_eq!(align, op.layout.align.abi, "return place is unaligned!");
362 let ty = bx.cast_backend_type(cast_ty);
363 let addr = bx.pointercast(llslot, bx.type_ptr_to(ty));
364 bx.load(ty, addr, self.fn_abi.ret.layout.align.abi)
370 #[tracing::instrument(level = "trace", skip(self, helper, bx))]
371 fn codegen_drop_terminator(
373 helper: TerminatorCodegenHelper<'tcx>,
375 location: mir::Place<'tcx>,
376 target: mir::BasicBlock,
377 unwind: Option<mir::BasicBlock>,
379 let ty = location.ty(self.mir, bx.tcx()).ty;
380 let ty = self.monomorphize(ty);
381 let drop_fn = Instance::resolve_drop_in_place(bx.tcx(), ty);
383 if let ty::InstanceDef::DropGlue(_, None) = drop_fn.def {
384 // we don't actually need to drop anything.
385 helper.funclet_br(self, &mut bx, target);
389 let place = self.codegen_place(&mut bx, location.as_ref());
391 let mut args = if let Some(llextra) = place.llextra {
392 args2 = [place.llval, llextra];
395 args1 = [place.llval];
398 let (drop_fn, fn_abi) = match ty.kind() {
399 // FIXME(eddyb) perhaps move some of this logic into
400 // `Instance::resolve_drop_in_place`?
401 ty::Dynamic(_, _, ty::Dyn) => {
402 // IN THIS ARM, WE HAVE:
403 // ty = *mut (dyn Trait)
404 // which is: exists<T> ( *mut T, Vtable<T: Trait> )
407 // args = ( Data, Vtable )
414 let virtual_drop = Instance {
415 def: ty::InstanceDef::Virtual(drop_fn.def_id(), 0),
416 substs: drop_fn.substs,
418 debug!("ty = {:?}", ty);
419 debug!("drop_fn = {:?}", drop_fn);
420 debug!("args = {:?}", args);
421 let fn_abi = bx.fn_abi_of_instance(virtual_drop, ty::List::empty());
422 let vtable = args[1];
423 // Truncate vtable off of args list
426 meth::VirtualIndex::from_index(ty::COMMON_VTABLE_ENTRIES_DROPINPLACE)
427 .get_fn(&mut bx, vtable, ty, &fn_abi),
431 ty::Dynamic(_, _, ty::DynStar) => {
432 // IN THIS ARM, WE HAVE:
433 // ty = *mut (dyn* Trait)
434 // which is: *mut exists<T: sizeof(T) == sizeof(usize)> (T, Vtable<T: Trait>)
447 // WE CAN CONVERT THIS INTO THE ABOVE LOGIC BY DOING
449 // data = &(*args[0]).0 // gives a pointer to Data above (really the same pointer)
450 // vtable = (*args[0]).1 // loads the vtable out
451 // (data, vtable) // an equivalent Rust `*mut dyn Trait`
453 // SO THEN WE CAN USE THE ABOVE CODE.
454 let virtual_drop = Instance {
455 def: ty::InstanceDef::Virtual(drop_fn.def_id(), 0),
456 substs: drop_fn.substs,
458 debug!("ty = {:?}", ty);
459 debug!("drop_fn = {:?}", drop_fn);
460 debug!("args = {:?}", args);
461 let fn_abi = bx.fn_abi_of_instance(virtual_drop, ty::List::empty());
463 let data_ty = bx.cx().backend_type(place.layout);
465 bx.gep(data_ty, data, &[bx.cx().const_i32(0), bx.cx().const_i32(1)]);
466 let vtable = bx.load(bx.type_i8p(), vtable_ptr, abi::Align::ONE);
467 // Truncate vtable off of args list
469 debug!("args' = {:?}", args);
471 meth::VirtualIndex::from_index(ty::COMMON_VTABLE_ENTRIES_DROPINPLACE)
472 .get_fn(&mut bx, vtable, ty, &fn_abi),
476 _ => (bx.get_fn_addr(drop_fn), bx.fn_abi_of_instance(drop_fn, ty::List::empty())),
484 Some((ReturnDest::Nothing, target)),
490 fn codegen_assert_terminator(
492 helper: TerminatorCodegenHelper<'tcx>,
494 terminator: &mir::Terminator<'tcx>,
495 cond: &mir::Operand<'tcx>,
497 msg: &mir::AssertMessage<'tcx>,
498 target: mir::BasicBlock,
499 cleanup: Option<mir::BasicBlock>,
501 let span = terminator.source_info.span;
502 let cond = self.codegen_operand(&mut bx, cond).immediate();
503 let mut const_cond = bx.const_to_opt_u128(cond, false).map(|c| c == 1);
505 // This case can currently arise only from functions marked
506 // with #[rustc_inherit_overflow_checks] and inlined from
507 // another crate (mostly core::num generic/#[inline] fns),
508 // while the current crate doesn't use overflow checks.
509 // NOTE: Unlike binops, negation doesn't have its own
510 // checked operation, just a comparison with the minimum
511 // value, so we have to check for the assert message.
512 if !bx.check_overflow() {
513 if let AssertKind::OverflowNeg(_) = *msg {
514 const_cond = Some(expected);
518 // Don't codegen the panic block if success if known.
519 if const_cond == Some(expected) {
520 helper.funclet_br(self, &mut bx, target);
524 // Pass the condition through llvm.expect for branch hinting.
525 let cond = bx.expect(cond, expected);
527 // Create the failure block and the conditional branch to it.
528 let lltarget = helper.llblock(self, target);
529 let panic_block = bx.append_sibling_block("panic");
531 bx.cond_br(cond, lltarget, panic_block);
533 bx.cond_br(cond, panic_block, lltarget);
536 // After this point, bx is the block for the call to panic.
537 bx.switch_to_block(panic_block);
538 self.set_debug_loc(&mut bx, terminator.source_info);
540 // Get the location information.
541 let location = self.get_caller_location(&mut bx, terminator.source_info).immediate();
543 // Put together the arguments to the panic entry point.
544 let (lang_item, args) = match msg {
545 AssertKind::BoundsCheck { ref len, ref index } => {
546 let len = self.codegen_operand(&mut bx, len).immediate();
547 let index = self.codegen_operand(&mut bx, index).immediate();
548 // It's `fn panic_bounds_check(index: usize, len: usize)`,
549 // and `#[track_caller]` adds an implicit third argument.
550 (LangItem::PanicBoundsCheck, vec![index, len, location])
553 let msg = bx.const_str(msg.description());
554 // It's `pub fn panic(expr: &str)`, with the wide reference being passed
555 // as two arguments, and `#[track_caller]` adds an implicit third argument.
556 (LangItem::Panic, vec![msg.0, msg.1, location])
560 let (fn_abi, llfn) = common::build_langcall(&bx, Some(span), lang_item);
562 // Codegen the actual panic invoke/call.
563 helper.do_call(self, &mut bx, fn_abi, llfn, &args, None, cleanup, &[]);
566 fn codegen_abort_terminator(
568 helper: TerminatorCodegenHelper<'tcx>,
570 terminator: &mir::Terminator<'tcx>,
572 let span = terminator.source_info.span;
573 self.set_debug_loc(&mut bx, terminator.source_info);
575 // Obtain the panic entry point.
576 let (fn_abi, llfn) = common::build_langcall(&bx, Some(span), LangItem::PanicNoUnwind);
578 // Codegen the actual panic invoke/call.
579 helper.do_call(self, &mut bx, fn_abi, llfn, &[], None, None, &[]);
582 /// Returns `true` if this is indeed a panic intrinsic and codegen is done.
583 fn codegen_panic_intrinsic(
585 helper: &TerminatorCodegenHelper<'tcx>,
587 intrinsic: Option<Symbol>,
588 instance: Option<Instance<'tcx>>,
589 source_info: mir::SourceInfo,
590 target: Option<mir::BasicBlock>,
591 cleanup: Option<mir::BasicBlock>,
593 // Emit a panic or a no-op for `assert_*` intrinsics.
594 // These are intrinsics that compile to panics so that we can get a message
595 // which mentions the offending type, even from a const context.
596 #[derive(Debug, PartialEq)]
597 enum AssertIntrinsic {
602 let panic_intrinsic = intrinsic.and_then(|i| match i {
603 sym::assert_inhabited => Some(AssertIntrinsic::Inhabited),
604 sym::assert_zero_valid => Some(AssertIntrinsic::ZeroValid),
605 sym::assert_uninit_valid => Some(AssertIntrinsic::UninitValid),
608 if let Some(intrinsic) = panic_intrinsic {
609 use AssertIntrinsic::*;
611 let ty = instance.unwrap().substs.type_at(0);
612 let layout = bx.layout_of(ty);
613 let do_panic = match intrinsic {
614 Inhabited => layout.abi.is_uninhabited(),
615 ZeroValid => !bx.tcx().permits_zero_init(layout),
616 UninitValid => !bx.tcx().permits_uninit_init(layout),
619 let msg_str = with_no_visible_paths!({
620 with_no_trimmed_paths!({
621 if layout.abi.is_uninhabited() {
622 // Use this error even for the other intrinsics as it is more precise.
623 format!("attempted to instantiate uninhabited type `{}`", ty)
624 } else if intrinsic == ZeroValid {
625 format!("attempted to zero-initialize type `{}`, which is invalid", ty)
628 "attempted to leave type `{}` uninitialized, which is invalid",
634 let msg = bx.const_str(&msg_str);
635 let location = self.get_caller_location(bx, source_info).immediate();
637 // Obtain the panic entry point.
639 common::build_langcall(bx, Some(source_info.span), LangItem::Panic);
641 // Codegen the actual panic invoke/call.
647 &[msg.0, msg.1, location],
648 target.as_ref().map(|bb| (ReturnDest::Nothing, *bb)),
654 let target = target.unwrap();
655 helper.funclet_br(self, bx, target)
663 fn codegen_call_terminator(
665 helper: TerminatorCodegenHelper<'tcx>,
667 terminator: &mir::Terminator<'tcx>,
668 func: &mir::Operand<'tcx>,
669 args: &[mir::Operand<'tcx>],
670 destination: mir::Place<'tcx>,
671 target: Option<mir::BasicBlock>,
672 cleanup: Option<mir::BasicBlock>,
675 let source_info = terminator.source_info;
676 let span = source_info.span;
678 // Create the callee. This is a fn ptr or zero-sized and hence a kind of scalar.
679 let callee = self.codegen_operand(&mut bx, func);
681 let (instance, mut llfn) = match *callee.layout.ty.kind() {
682 ty::FnDef(def_id, substs) => (
684 ty::Instance::resolve(bx.tcx(), ty::ParamEnv::reveal_all(), def_id, substs)
687 .polymorphize(bx.tcx()),
691 ty::FnPtr(_) => (None, Some(callee.immediate())),
692 _ => bug!("{} is not callable", callee.layout.ty),
694 let def = instance.map(|i| i.def);
696 if let Some(ty::InstanceDef::DropGlue(_, None)) = def {
697 // Empty drop glue; a no-op.
698 let target = target.unwrap();
699 helper.funclet_br(self, &mut bx, target);
703 // FIXME(eddyb) avoid computing this if possible, when `instance` is
704 // available - right now `sig` is only needed for getting the `abi`
705 // and figuring out how many extra args were passed to a C-variadic `fn`.
706 let sig = callee.layout.ty.fn_sig(bx.tcx());
709 // Handle intrinsics old codegen wants Expr's for, ourselves.
710 let intrinsic = match def {
711 Some(ty::InstanceDef::Intrinsic(def_id)) => Some(bx.tcx().item_name(def_id)),
715 let extra_args = &args[sig.inputs().skip_binder().len()..];
716 let extra_args = bx.tcx().mk_type_list(extra_args.iter().map(|op_arg| {
717 let op_ty = op_arg.ty(self.mir, bx.tcx());
718 self.monomorphize(op_ty)
721 let fn_abi = match instance {
722 Some(instance) => bx.fn_abi_of_instance(instance, extra_args),
723 None => bx.fn_abi_of_fn_ptr(sig, extra_args),
726 if intrinsic == Some(sym::transmute) {
727 if let Some(target) = target {
728 self.codegen_transmute(&mut bx, &args[0], destination);
729 helper.funclet_br(self, &mut bx, target);
731 // If we are trying to transmute to an uninhabited type,
732 // it is likely there is no allotted destination. In fact,
733 // transmuting to an uninhabited type is UB, which means
734 // we can do what we like. Here, we declare that transmuting
735 // into an uninhabited type is impossible, so anything following
736 // it must be unreachable.
737 assert_eq!(fn_abi.ret.layout.abi, abi::Abi::Uninhabited);
743 if self.codegen_panic_intrinsic(
755 // The arguments we'll be passing. Plus one to account for outptr, if used.
756 let arg_count = fn_abi.args.len() + fn_abi.ret.is_indirect() as usize;
757 let mut llargs = Vec::with_capacity(arg_count);
759 // Prepare the return value destination
760 let ret_dest = if target.is_some() {
761 let is_intrinsic = intrinsic.is_some();
762 self.make_return_dest(&mut bx, destination, &fn_abi.ret, &mut llargs, is_intrinsic)
767 if intrinsic == Some(sym::caller_location) {
768 if let Some(target) = target {
770 .get_caller_location(&mut bx, mir::SourceInfo { span: fn_span, ..source_info });
772 if let ReturnDest::IndirectOperand(tmp, _) = ret_dest {
773 location.val.store(&mut bx, tmp);
775 self.store_return(&mut bx, ret_dest, &fn_abi.ret, location.immediate());
776 helper.funclet_br(self, &mut bx, target);
782 None | Some(sym::drop_in_place) => {}
783 Some(sym::copy_nonoverlapping) => unreachable!(),
785 let dest = match ret_dest {
786 _ if fn_abi.ret.is_indirect() => llargs[0],
787 ReturnDest::Nothing => {
788 bx.const_undef(bx.type_ptr_to(bx.arg_memory_ty(&fn_abi.ret)))
790 ReturnDest::IndirectOperand(dst, _) | ReturnDest::Store(dst) => dst.llval,
791 ReturnDest::DirectOperand(_) => {
792 bug!("Cannot use direct operand with an intrinsic call")
796 let args: Vec<_> = args
800 // The indices passed to simd_shuffle* in the
801 // third argument must be constant. This is
802 // checked by const-qualification, which also
803 // promotes any complex rvalues to constants.
804 if i == 2 && intrinsic.as_str().starts_with("simd_shuffle") {
805 if let mir::Operand::Constant(constant) = arg {
806 let c = self.eval_mir_constant(constant);
807 let (llval, ty) = self.simd_shuffle_indices(
810 self.monomorphize(constant.ty()),
814 val: Immediate(llval),
815 layout: bx.layout_of(ty),
818 span_bug!(span, "shuffle indices must be constant");
822 self.codegen_operand(&mut bx, arg)
826 Self::codegen_intrinsic_call(
828 *instance.as_ref().unwrap(),
835 if let ReturnDest::IndirectOperand(dst, _) = ret_dest {
836 self.store_return(&mut bx, ret_dest, &fn_abi.ret, dst.llval);
839 if let Some(target) = target {
840 helper.funclet_br(self, &mut bx, target);
849 // Split the rust-call tupled arguments off.
850 let (first_args, untuple) = if abi == Abi::RustCall && !args.is_empty() {
851 let (tup, args) = args.split_last().unwrap();
857 let mut copied_constant_arguments = vec![];
858 'make_args: for (i, arg) in first_args.iter().enumerate() {
859 let mut op = self.codegen_operand(&mut bx, arg);
861 if let (0, Some(ty::InstanceDef::Virtual(_, idx))) = (i, def) {
863 Pair(data_ptr, meta) => {
864 // In the case of Rc<Self>, we need to explicitly pass a
865 // *mut RcBox<Self> with a Scalar (not ScalarPair) ABI. This is a hack
866 // that is understood elsewhere in the compiler as a method on
868 // To get a `*mut RcBox<Self>`, we just keep unwrapping newtypes until
869 // we get a value of a built-in pointer type
870 'descend_newtypes: while !op.layout.ty.is_unsafe_ptr()
871 && !op.layout.ty.is_region_ptr()
873 for i in 0..op.layout.fields.count() {
874 let field = op.extract_field(&mut bx, i);
875 if !field.layout.is_zst() {
876 // we found the one non-zero-sized field that is allowed
877 // now find *its* non-zero-sized field, or stop if it's a
880 continue 'descend_newtypes;
884 span_bug!(span, "receiver has no non-zero-sized fields {:?}", op);
887 // now that we have `*dyn Trait` or `&dyn Trait`, split it up into its
888 // data pointer and vtable. Look up the method in the vtable, and pass
889 // the data pointer as the first argument
890 llfn = Some(meth::VirtualIndex::from_index(idx).get_fn(
896 llargs.push(data_ptr);
899 Ref(data_ptr, Some(meta), _) => {
900 // by-value dynamic dispatch
901 llfn = Some(meth::VirtualIndex::from_index(idx).get_fn(
907 llargs.push(data_ptr);
911 let ty::Ref(_, ty, _) = op.layout.ty.kind() else {
912 span_bug!(span, "can't codegen a virtual call on {:#?}", op);
914 if !ty.is_dyn_star() {
915 span_bug!(span, "can't codegen a virtual call on {:#?}", op);
917 // FIXME(dyn-star): Make sure this is done on a &dyn* receiver
918 let place = op.deref(bx.cx());
919 let data_ptr = place.project_field(&mut bx, 0);
920 let meta_ptr = place.project_field(&mut bx, 1);
921 let meta = bx.load_operand(meta_ptr);
922 llfn = Some(meth::VirtualIndex::from_index(idx).get_fn(
928 llargs.push(data_ptr.llval);
932 span_bug!(span, "can't codegen a virtual call on {:#?}", op);
937 // The callee needs to own the argument memory if we pass it
938 // by-ref, so make a local copy of non-immediate constants.
939 match (arg, op.val) {
940 (&mir::Operand::Copy(_), Ref(_, None, _))
941 | (&mir::Operand::Constant(_), Ref(_, None, _)) => {
942 let tmp = PlaceRef::alloca(&mut bx, op.layout);
943 bx.lifetime_start(tmp.llval, tmp.layout.size);
944 op.val.store(&mut bx, tmp);
945 op.val = Ref(tmp.llval, None, tmp.align);
946 copied_constant_arguments.push(tmp);
951 self.codegen_argument(&mut bx, op, &mut llargs, &fn_abi.args[i]);
953 let num_untupled = untuple.map(|tup| {
954 self.codegen_arguments_untupled(
958 &fn_abi.args[first_args.len()..],
963 instance.map_or(false, |i| i.def.requires_caller_location(self.cx.tcx()));
965 let mir_args = if let Some(num_untupled) = num_untupled {
966 first_args.len() + num_untupled
973 "#[track_caller] fn's must have 1 more argument in their ABI than in their MIR: {:?} {:?} {:?}",
979 self.get_caller_location(&mut bx, mir::SourceInfo { span: fn_span, ..source_info });
981 "codegen_call_terminator({:?}): location={:?} (fn_span {:?})",
982 terminator, location, fn_span
985 let last_arg = fn_abi.args.last().unwrap();
986 self.codegen_argument(&mut bx, location, &mut llargs, last_arg);
989 let (is_indirect_call, fn_ptr) = match (llfn, instance) {
990 (Some(llfn), _) => (true, llfn),
991 (None, Some(instance)) => (false, bx.get_fn_addr(instance)),
992 _ => span_bug!(span, "no llfn for call"),
995 // For backends that support CFI using type membership (i.e., testing whether a given
996 // pointer is associated with a type identifier).
997 if bx.tcx().sess.is_sanitizer_cfi_enabled() && is_indirect_call {
998 // Emit type metadata and checks.
999 // FIXME(rcvalle): Add support for generalized identifiers.
1000 // FIXME(rcvalle): Create distinct unnamed MDNodes for internal identifiers.
1001 let typeid = typeid_for_fnabi(bx.tcx(), fn_abi);
1002 let typeid_metadata = self.cx.typeid_metadata(typeid);
1004 // Test whether the function pointer is associated with the type identifier.
1005 let cond = bx.type_test(fn_ptr, typeid_metadata);
1006 let bb_pass = bx.append_sibling_block("type_test.pass");
1007 let bb_fail = bx.append_sibling_block("type_test.fail");
1008 bx.cond_br(cond, bb_pass, bb_fail);
1010 bx.switch_to_block(bb_pass);
1017 target.as_ref().map(|&target| (ret_dest, target)),
1019 &copied_constant_arguments,
1022 bx.switch_to_block(bb_fail);
1035 target.as_ref().map(|&target| (ret_dest, target)),
1037 &copied_constant_arguments,
1041 fn codegen_asm_terminator(
1043 helper: TerminatorCodegenHelper<'tcx>,
1045 terminator: &mir::Terminator<'tcx>,
1046 template: &[ast::InlineAsmTemplatePiece],
1047 operands: &[mir::InlineAsmOperand<'tcx>],
1048 options: ast::InlineAsmOptions,
1049 line_spans: &[Span],
1050 destination: Option<mir::BasicBlock>,
1051 cleanup: Option<mir::BasicBlock>,
1052 instance: Instance<'_>,
1054 let span = terminator.source_info.span;
1056 let operands: Vec<_> = operands
1058 .map(|op| match *op {
1059 mir::InlineAsmOperand::In { reg, ref value } => {
1060 let value = self.codegen_operand(&mut bx, value);
1061 InlineAsmOperandRef::In { reg, value }
1063 mir::InlineAsmOperand::Out { reg, late, ref place } => {
1064 let place = place.map(|place| self.codegen_place(&mut bx, place.as_ref()));
1065 InlineAsmOperandRef::Out { reg, late, place }
1067 mir::InlineAsmOperand::InOut { reg, late, ref in_value, ref out_place } => {
1068 let in_value = self.codegen_operand(&mut bx, in_value);
1070 out_place.map(|out_place| self.codegen_place(&mut bx, out_place.as_ref()));
1071 InlineAsmOperandRef::InOut { reg, late, in_value, out_place }
1073 mir::InlineAsmOperand::Const { ref value } => {
1074 let const_value = self
1075 .eval_mir_constant(value)
1076 .unwrap_or_else(|_| span_bug!(span, "asm const cannot be resolved"));
1077 let string = common::asm_const_to_str(
1081 bx.layout_of(value.ty()),
1083 InlineAsmOperandRef::Const { string }
1085 mir::InlineAsmOperand::SymFn { ref value } => {
1086 let literal = self.monomorphize(value.literal);
1087 if let ty::FnDef(def_id, substs) = *literal.ty().kind() {
1088 let instance = ty::Instance::resolve_for_fn_ptr(
1090 ty::ParamEnv::reveal_all(),
1095 InlineAsmOperandRef::SymFn { instance }
1097 span_bug!(span, "invalid type for asm sym (fn)");
1100 mir::InlineAsmOperand::SymStatic { def_id } => {
1101 InlineAsmOperandRef::SymStatic { def_id }
1106 helper.do_inlineasm(
1120 impl<'a, 'tcx, Bx: BuilderMethods<'a, 'tcx>> FunctionCx<'a, 'tcx, Bx> {
1121 pub fn codegen_block(&mut self, bb: mir::BasicBlock) {
1122 let llbb = self.llbb(bb);
1123 let mut bx = Bx::build(self.cx, llbb);
1125 let data = &mir[bb];
1127 debug!("codegen_block({:?}={:?})", bb, data);
1129 for statement in &data.statements {
1130 bx = self.codegen_statement(bx, statement);
1133 self.codegen_terminator(bx, bb, data.terminator());
1136 fn codegen_terminator(
1139 bb: mir::BasicBlock,
1140 terminator: &'tcx mir::Terminator<'tcx>,
1142 debug!("codegen_terminator: {:?}", terminator);
1144 // Create the cleanup bundle, if needed.
1145 let funclet_bb = self.cleanup_kinds[bb].funclet_bb(bb);
1146 let helper = TerminatorCodegenHelper { bb, terminator, funclet_bb };
1148 self.set_debug_loc(&mut bx, terminator.source_info);
1149 match terminator.kind {
1150 mir::TerminatorKind::Resume => self.codegen_resume_terminator(helper, bx),
1152 mir::TerminatorKind::Abort => {
1153 self.codegen_abort_terminator(helper, bx, terminator);
1156 mir::TerminatorKind::Goto { target } => {
1157 helper.funclet_br(self, &mut bx, target);
1160 mir::TerminatorKind::SwitchInt { ref discr, switch_ty, ref targets } => {
1161 self.codegen_switchint_terminator(helper, bx, discr, switch_ty, targets);
1164 mir::TerminatorKind::Return => {
1165 self.codegen_return_terminator(bx);
1168 mir::TerminatorKind::Unreachable => {
1172 mir::TerminatorKind::Drop { place, target, unwind } => {
1173 self.codegen_drop_terminator(helper, bx, place, target, unwind);
1176 mir::TerminatorKind::Assert { ref cond, expected, ref msg, target, cleanup } => {
1177 self.codegen_assert_terminator(
1178 helper, bx, terminator, cond, expected, msg, target, cleanup,
1182 mir::TerminatorKind::DropAndReplace { .. } => {
1183 bug!("undesugared DropAndReplace in codegen: {:?}", terminator);
1186 mir::TerminatorKind::Call {
1195 self.codegen_call_terminator(
1207 mir::TerminatorKind::GeneratorDrop | mir::TerminatorKind::Yield { .. } => {
1208 bug!("generator ops in codegen")
1210 mir::TerminatorKind::FalseEdge { .. } | mir::TerminatorKind::FalseUnwind { .. } => {
1211 bug!("borrowck false edges in codegen")
1214 mir::TerminatorKind::InlineAsm {
1222 self.codegen_asm_terminator(
1238 fn codegen_argument(
1241 op: OperandRef<'tcx, Bx::Value>,
1242 llargs: &mut Vec<Bx::Value>,
1243 arg: &ArgAbi<'tcx, Ty<'tcx>>,
1246 PassMode::Ignore => return,
1247 PassMode::Cast(_, true) => {
1248 // Fill padding with undef value, where applicable.
1249 llargs.push(bx.const_undef(bx.reg_backend_type(&Reg::i32())));
1251 PassMode::Pair(..) => match op.val {
1257 _ => bug!("codegen_argument: {:?} invalid for pair argument", op),
1259 PassMode::Indirect { attrs: _, extra_attrs: Some(_), on_stack: _ } => match op.val {
1260 Ref(a, Some(b), _) => {
1265 _ => bug!("codegen_argument: {:?} invalid for unsized indirect argument", op),
1270 // Force by-ref if we have to load through a cast pointer.
1271 let (mut llval, align, by_ref) = match op.val {
1272 Immediate(_) | Pair(..) => match arg.mode {
1273 PassMode::Indirect { .. } | PassMode::Cast(..) => {
1274 let scratch = PlaceRef::alloca(bx, arg.layout);
1275 op.val.store(bx, scratch);
1276 (scratch.llval, scratch.align, true)
1278 _ => (op.immediate_or_packed_pair(bx), arg.layout.align.abi, false),
1280 Ref(llval, _, align) => {
1281 if arg.is_indirect() && align < arg.layout.align.abi {
1282 // `foo(packed.large_field)`. We can't pass the (unaligned) field directly. I
1283 // think that ATM (Rust 1.16) we only pass temporaries, but we shouldn't
1284 // have scary latent bugs around.
1286 let scratch = PlaceRef::alloca(bx, arg.layout);
1296 (scratch.llval, scratch.align, true)
1298 (llval, align, true)
1303 if by_ref && !arg.is_indirect() {
1304 // Have to load the argument, maybe while casting it.
1305 if let PassMode::Cast(ty, _) = &arg.mode {
1306 let llty = bx.cast_backend_type(ty);
1307 let addr = bx.pointercast(llval, bx.type_ptr_to(llty));
1308 llval = bx.load(llty, addr, align.min(arg.layout.align.abi));
1310 // We can't use `PlaceRef::load` here because the argument
1311 // may have a type we don't treat as immediate, but the ABI
1312 // used for this call is passing it by-value. In that case,
1313 // the load would just produce `OperandValue::Ref` instead
1314 // of the `OperandValue::Immediate` we need for the call.
1315 llval = bx.load(bx.backend_type(arg.layout), llval, align);
1316 if let abi::Abi::Scalar(scalar) = arg.layout.abi {
1317 if scalar.is_bool() {
1318 bx.range_metadata(llval, WrappingRange { start: 0, end: 1 });
1321 // We store bools as `i8` so we need to truncate to `i1`.
1322 llval = bx.to_immediate(llval, arg.layout);
1329 fn codegen_arguments_untupled(
1332 operand: &mir::Operand<'tcx>,
1333 llargs: &mut Vec<Bx::Value>,
1334 args: &[ArgAbi<'tcx, Ty<'tcx>>],
1336 let tuple = self.codegen_operand(bx, operand);
1338 // Handle both by-ref and immediate tuples.
1339 if let Ref(llval, None, align) = tuple.val {
1340 let tuple_ptr = PlaceRef::new_sized_aligned(llval, tuple.layout, align);
1341 for i in 0..tuple.layout.fields.count() {
1342 let field_ptr = tuple_ptr.project_field(bx, i);
1343 let field = bx.load_operand(field_ptr);
1344 self.codegen_argument(bx, field, llargs, &args[i]);
1346 } else if let Ref(_, Some(_), _) = tuple.val {
1347 bug!("closure arguments must be sized")
1349 // If the tuple is immediate, the elements are as well.
1350 for i in 0..tuple.layout.fields.count() {
1351 let op = tuple.extract_field(bx, i);
1352 self.codegen_argument(bx, op, llargs, &args[i]);
1355 tuple.layout.fields.count()
1358 fn get_caller_location(
1361 mut source_info: mir::SourceInfo,
1362 ) -> OperandRef<'tcx, Bx::Value> {
1365 let mut span_to_caller_location = |span: Span| {
1366 let topmost = span.ctxt().outer_expn().expansion_cause().unwrap_or(span);
1367 let caller = tcx.sess.source_map().lookup_char_pos(topmost.lo());
1368 let const_loc = tcx.const_caller_location((
1369 Symbol::intern(&caller.file.name.prefer_remapped().to_string_lossy()),
1371 caller.col_display as u32 + 1,
1373 OperandRef::from_const(bx, const_loc, bx.tcx().caller_location_ty())
1376 // Walk up the `SourceScope`s, in case some of them are from MIR inlining.
1377 // If so, the starting `source_info.span` is in the innermost inlined
1378 // function, and will be replaced with outer callsite spans as long
1379 // as the inlined functions were `#[track_caller]`.
1381 let scope_data = &self.mir.source_scopes[source_info.scope];
1383 if let Some((callee, callsite_span)) = scope_data.inlined {
1384 // Stop inside the most nested non-`#[track_caller]` function,
1385 // before ever reaching its caller (which is irrelevant).
1386 if !callee.def.requires_caller_location(tcx) {
1387 return span_to_caller_location(source_info.span);
1389 source_info.span = callsite_span;
1392 // Skip past all of the parents with `inlined: None`.
1393 match scope_data.inlined_parent_scope {
1394 Some(parent) => source_info.scope = parent,
1399 // No inlined `SourceScope`s, or all of them were `#[track_caller]`.
1400 self.caller_location.unwrap_or_else(|| span_to_caller_location(source_info.span))
1403 fn get_personality_slot(&mut self, bx: &mut Bx) -> PlaceRef<'tcx, Bx::Value> {
1405 if let Some(slot) = self.personality_slot {
1408 let layout = cx.layout_of(
1409 cx.tcx().intern_tup(&[cx.tcx().mk_mut_ptr(cx.tcx().types.u8), cx.tcx().types.i32]),
1411 let slot = PlaceRef::alloca(bx, layout);
1412 self.personality_slot = Some(slot);
1417 /// Returns the landing/cleanup pad wrapper around the given basic block.
1418 // FIXME(eddyb) rename this to `eh_pad_for`.
1419 fn landing_pad_for(&mut self, bb: mir::BasicBlock) -> Bx::BasicBlock {
1420 if let Some(landing_pad) = self.landing_pads[bb] {
1424 let landing_pad = self.landing_pad_for_uncached(bb);
1425 self.landing_pads[bb] = Some(landing_pad);
1429 // FIXME(eddyb) rename this to `eh_pad_for_uncached`.
1430 fn landing_pad_for_uncached(&mut self, bb: mir::BasicBlock) -> Bx::BasicBlock {
1431 let llbb = self.llbb(bb);
1432 if base::wants_msvc_seh(self.cx.sess()) {
1435 match self.mir[bb].terminator.as_ref().map(|t| &t.kind) {
1436 // This is a basic block that we're aborting the program for,
1437 // notably in an `extern` function. These basic blocks are inserted
1438 // so that we assert that `extern` functions do indeed not panic,
1439 // and if they do we abort the process.
1441 // On MSVC these are tricky though (where we're doing funclets). If
1442 // we were to do a cleanuppad (like below) the normal functions like
1443 // `longjmp` would trigger the abort logic, terminating the
1444 // program. Instead we insert the equivalent of `catch(...)` for C++
1445 // which magically doesn't trigger when `longjmp` files over this
1448 // Lots more discussion can be found on #48251 but this codegen is
1449 // modeled after clang's for:
1456 Some(&mir::TerminatorKind::Abort) => {
1458 Bx::append_block(self.cx, self.llfn, &format!("cs_funclet{:?}", bb));
1460 Bx::append_block(self.cx, self.llfn, &format!("cp_funclet{:?}", bb));
1463 let mut cs_bx = Bx::build(self.cx, cs_bb);
1464 let cs = cs_bx.catch_switch(None, None, &[cp_bb]);
1466 // The "null" here is actually a RTTI type descriptor for the
1467 // C++ personality function, but `catch (...)` has no type so
1468 // it's null. The 64 here is actually a bitfield which
1469 // represents that this is a catch-all block.
1470 let mut cp_bx = Bx::build(self.cx, cp_bb);
1471 let null = cp_bx.const_null(
1472 cp_bx.type_i8p_ext(cp_bx.cx().data_layout().instruction_address_space),
1474 let sixty_four = cp_bx.const_i32(64);
1475 funclet = cp_bx.catch_pad(cs, &[null, sixty_four, null]);
1480 Bx::append_block(self.cx, self.llfn, &format!("funclet_{:?}", bb));
1481 ret_llbb = cleanup_bb;
1482 let mut cleanup_bx = Bx::build(self.cx, cleanup_bb);
1483 funclet = cleanup_bx.cleanup_pad(None, &[]);
1484 cleanup_bx.br(llbb);
1487 self.funclets[bb] = Some(funclet);
1490 let bb = Bx::append_block(self.cx, self.llfn, "cleanup");
1491 let mut bx = Bx::build(self.cx, bb);
1493 let llpersonality = self.cx.eh_personality();
1494 let llretty = self.landing_pad_type();
1495 let lp = bx.cleanup_landing_pad(llretty, llpersonality);
1497 let slot = self.get_personality_slot(&mut bx);
1498 slot.storage_live(&mut bx);
1499 Pair(bx.extract_value(lp, 0), bx.extract_value(lp, 1)).store(&mut bx, slot);
1506 fn landing_pad_type(&self) -> Bx::Type {
1508 cx.type_struct(&[cx.type_i8p(), cx.type_i32()], false)
1511 fn unreachable_block(&mut self) -> Bx::BasicBlock {
1512 self.unreachable_block.unwrap_or_else(|| {
1513 let llbb = Bx::append_block(self.cx, self.llfn, "unreachable");
1514 let mut bx = Bx::build(self.cx, llbb);
1516 self.unreachable_block = Some(llbb);
1521 fn double_unwind_guard(&mut self) -> Bx::BasicBlock {
1522 self.double_unwind_guard.unwrap_or_else(|| {
1523 assert!(!base::wants_msvc_seh(self.cx.sess()));
1525 let llbb = Bx::append_block(self.cx, self.llfn, "abort");
1526 let mut bx = Bx::build(self.cx, llbb);
1527 self.set_debug_loc(&mut bx, mir::SourceInfo::outermost(self.mir.span));
1529 let llpersonality = self.cx.eh_personality();
1530 let llretty = self.landing_pad_type();
1531 bx.cleanup_landing_pad(llretty, llpersonality);
1533 let (fn_abi, fn_ptr) = common::build_langcall(&bx, None, LangItem::PanicNoUnwind);
1534 let fn_ty = bx.fn_decl_backend_type(&fn_abi);
1536 let llret = bx.call(fn_ty, fn_ptr, &[], None);
1537 bx.apply_attrs_callsite(&fn_abi, llret);
1538 bx.do_not_inline(llret);
1542 self.double_unwind_guard = Some(llbb);
1547 /// Get the backend `BasicBlock` for a MIR `BasicBlock`, either already
1548 /// cached in `self.cached_llbbs`, or created on demand (and cached).
1549 // FIXME(eddyb) rename `llbb` and other `ll`-prefixed things to use a
1550 // more backend-agnostic prefix such as `cg` (i.e. this would be `cgbb`).
1551 pub fn llbb(&mut self, bb: mir::BasicBlock) -> Bx::BasicBlock {
1552 self.cached_llbbs[bb].unwrap_or_else(|| {
1553 // FIXME(eddyb) only name the block if `fewer_names` is `false`.
1554 let llbb = Bx::append_block(self.cx, self.llfn, &format!("{:?}", bb));
1555 self.cached_llbbs[bb] = Some(llbb);
1560 fn make_return_dest(
1563 dest: mir::Place<'tcx>,
1564 fn_ret: &ArgAbi<'tcx, Ty<'tcx>>,
1565 llargs: &mut Vec<Bx::Value>,
1567 ) -> ReturnDest<'tcx, Bx::Value> {
1568 // If the return is ignored, we can just return a do-nothing `ReturnDest`.
1569 if fn_ret.is_ignore() {
1570 return ReturnDest::Nothing;
1572 let dest = if let Some(index) = dest.as_local() {
1573 match self.locals[index] {
1574 LocalRef::Place(dest) => dest,
1575 LocalRef::UnsizedPlace(_) => bug!("return type must be sized"),
1576 LocalRef::Operand(None) => {
1577 // Handle temporary places, specifically `Operand` ones, as
1578 // they don't have `alloca`s.
1579 return if fn_ret.is_indirect() {
1580 // Odd, but possible, case, we have an operand temporary,
1581 // but the calling convention has an indirect return.
1582 let tmp = PlaceRef::alloca(bx, fn_ret.layout);
1583 tmp.storage_live(bx);
1584 llargs.push(tmp.llval);
1585 ReturnDest::IndirectOperand(tmp, index)
1586 } else if is_intrinsic {
1587 // Currently, intrinsics always need a location to store
1588 // the result, so we create a temporary `alloca` for the
1590 let tmp = PlaceRef::alloca(bx, fn_ret.layout);
1591 tmp.storage_live(bx);
1592 ReturnDest::IndirectOperand(tmp, index)
1594 ReturnDest::DirectOperand(index)
1597 LocalRef::Operand(Some(_)) => {
1598 bug!("place local already assigned to");
1604 mir::PlaceRef { local: dest.local, projection: &dest.projection },
1607 if fn_ret.is_indirect() {
1608 if dest.align < dest.layout.align.abi {
1609 // Currently, MIR code generation does not create calls
1610 // that store directly to fields of packed structs (in
1611 // fact, the calls it creates write only to temps).
1613 // If someone changes that, please update this code path
1614 // to create a temporary.
1615 span_bug!(self.mir.span, "can't directly store to unaligned value");
1617 llargs.push(dest.llval);
1620 ReturnDest::Store(dest)
1624 fn codegen_transmute(&mut self, bx: &mut Bx, src: &mir::Operand<'tcx>, dst: mir::Place<'tcx>) {
1625 if let Some(index) = dst.as_local() {
1626 match self.locals[index] {
1627 LocalRef::Place(place) => self.codegen_transmute_into(bx, src, place),
1628 LocalRef::UnsizedPlace(_) => bug!("transmute must not involve unsized locals"),
1629 LocalRef::Operand(None) => {
1630 let dst_layout = bx.layout_of(self.monomorphized_place_ty(dst.as_ref()));
1631 assert!(!dst_layout.ty.has_erasable_regions());
1632 let place = PlaceRef::alloca(bx, dst_layout);
1633 place.storage_live(bx);
1634 self.codegen_transmute_into(bx, src, place);
1635 let op = bx.load_operand(place);
1636 place.storage_dead(bx);
1637 self.locals[index] = LocalRef::Operand(Some(op));
1638 self.debug_introduce_local(bx, index);
1640 LocalRef::Operand(Some(op)) => {
1641 assert!(op.layout.is_zst(), "assigning to initialized SSAtemp");
1645 let dst = self.codegen_place(bx, dst.as_ref());
1646 self.codegen_transmute_into(bx, src, dst);
1650 fn codegen_transmute_into(
1653 src: &mir::Operand<'tcx>,
1654 dst: PlaceRef<'tcx, Bx::Value>,
1656 let src = self.codegen_operand(bx, src);
1658 // Special-case transmutes between scalars as simple bitcasts.
1659 match (src.layout.abi, dst.layout.abi) {
1660 (abi::Abi::Scalar(src_scalar), abi::Abi::Scalar(dst_scalar)) => {
1661 // HACK(eddyb) LLVM doesn't like `bitcast`s between pointers and non-pointers.
1662 if (src_scalar.primitive() == abi::Pointer)
1663 == (dst_scalar.primitive() == abi::Pointer)
1665 assert_eq!(src.layout.size, dst.layout.size);
1667 // NOTE(eddyb) the `from_immediate` and `to_immediate_scalar`
1668 // conversions allow handling `bool`s the same as `u8`s.
1669 let src = bx.from_immediate(src.immediate());
1670 let src_as_dst = bx.bitcast(src, bx.backend_type(dst.layout));
1671 Immediate(bx.to_immediate_scalar(src_as_dst, dst_scalar)).store(bx, dst);
1678 let llty = bx.backend_type(src.layout);
1679 let cast_ptr = bx.pointercast(dst.llval, bx.type_ptr_to(llty));
1680 let align = src.layout.align.abi.min(dst.align);
1681 src.val.store(bx, PlaceRef::new_sized_aligned(cast_ptr, src.layout, align));
1684 // Stores the return value of a function call into it's final location.
1688 dest: ReturnDest<'tcx, Bx::Value>,
1689 ret_abi: &ArgAbi<'tcx, Ty<'tcx>>,
1692 use self::ReturnDest::*;
1696 Store(dst) => bx.store_arg(&ret_abi, llval, dst),
1697 IndirectOperand(tmp, index) => {
1698 let op = bx.load_operand(tmp);
1699 tmp.storage_dead(bx);
1700 self.locals[index] = LocalRef::Operand(Some(op));
1701 self.debug_introduce_local(bx, index);
1703 DirectOperand(index) => {
1704 // If there is a cast, we have to store and reload.
1705 let op = if let PassMode::Cast(..) = ret_abi.mode {
1706 let tmp = PlaceRef::alloca(bx, ret_abi.layout);
1707 tmp.storage_live(bx);
1708 bx.store_arg(&ret_abi, llval, tmp);
1709 let op = bx.load_operand(tmp);
1710 tmp.storage_dead(bx);
1713 OperandRef::from_immediate_or_packed_pair(bx, llval, ret_abi.layout)
1715 self.locals[index] = LocalRef::Operand(Some(op));
1716 self.debug_introduce_local(bx, index);
1722 enum ReturnDest<'tcx, V> {
1723 // Do nothing; the return value is indirect or ignored.
1725 // Store the return value to the pointer.
1726 Store(PlaceRef<'tcx, V>),
1727 // Store an indirect return value to an operand local place.
1728 IndirectOperand(PlaceRef<'tcx, V>, mir::Local),
1729 // Store a direct return value to an operand local place.
1730 DirectOperand(mir::Local),