3 struct PrintOnPanic<F: Fn() -> String>(F);
4 impl<F: Fn() -> String> Drop for PrintOnPanic<F> {
6 if ::std::thread::panicking() {
7 println!("{}", (self.0)());
12 pub fn trans_mono_item<'a, 'clif, 'tcx: 'a, B: Backend + 'static>(
13 cx: &mut crate::CodegenCx<'a, 'clif, 'tcx, B>,
14 mono_item: MonoItem<'tcx>,
18 MonoItem::Fn(inst) => {
20 PrintOnPanic(|| format!("{:?} {}", inst, tcx.symbol_name(inst).as_str()));
21 debug_assert!(!inst.substs.needs_infer());
22 let _mir_guard = PrintOnPanic(|| {
25 | InstanceDef::DropGlue(_, _)
26 | InstanceDef::Virtual(_, _)
27 if inst.def_id().krate == LOCAL_CRATE =>
29 let mut mir = ::std::io::Cursor::new(Vec::new());
30 crate::rustc_mir::util::write_mir_pretty(
36 String::from_utf8(mir.into_inner()).unwrap()
39 // FIXME fix write_mir_pretty for these instances
40 format!("{:#?}", tcx.instance_mir(inst.def))
47 MonoItem::Static(def_id) => {
48 crate::constant::codegen_static(&mut cx.ccx, def_id);
50 MonoItem::GlobalAsm(node_id) => tcx
52 .fatal(&format!("Unimplemented global asm mono item {:?}", node_id)),
56 fn trans_fn<'a, 'clif, 'tcx: 'a, B: Backend + 'static>(
57 cx: &mut crate::CodegenCx<'a, 'clif, 'tcx, B>,
58 instance: Instance<'tcx>,
63 let mir = tcx.instance_mir(instance.def);
65 // Step 2. Declare function
66 let (name, sig) = get_function_name_and_sig(tcx, instance);
67 let func_id = cx.module
68 .declare_function(&name, Linkage::Export, &sig)
71 // Step 3. Make FunctionBuilder
72 let mut func = Function::with_name_signature(ExternalName::user(0, 0), sig);
73 let mut func_ctx = FunctionBuilderContext::new();
74 let mut bcx = FunctionBuilder::new(&mut func, &mut func_ctx);
76 // Step 4. Predefine ebb's
77 let start_ebb = bcx.create_ebb();
78 let mut ebb_map: HashMap<BasicBlock, Ebb> = HashMap::new();
79 for (bb, _bb_data) in mir.basic_blocks().iter_enumerated() {
80 ebb_map.insert(bb, bcx.create_ebb());
83 // Step 5. Make FunctionCx
84 let pointer_type = cx.module.target_config().pointer_type();
85 let clif_comments = crate::pretty_clif::CommentWriter::new(tcx, instance);
87 let mut fx = FunctionCx {
97 local_map: HashMap::new(),
100 constants: &mut cx.ccx,
101 caches: &mut cx.caches,
104 // Step 6. Codegen function
105 with_unimpl_span(fx.mir.span, || {
106 crate::abi::codegen_fn_prelude(&mut fx, start_ebb);
107 codegen_fn_content(&mut fx);
110 // Step 7. Write function to file for debugging
111 if cfg!(debug_assertions) {
112 fx.write_clif_file();
115 // Step 8. Verify function
116 verify_func(tcx, fx.clif_comments, &func);
118 // Step 9. Define function
119 cx.caches.context.func = func;
121 .define_function(func_id, &mut cx.caches.context)
123 cx.caches.context.clear();
126 fn verify_func(tcx: TyCtxt, writer: crate::pretty_clif::CommentWriter, func: &Function) {
127 let flags = settings::Flags::new(settings::builder());
128 match ::cranelift::codegen::verify_function(&func, &flags) {
131 tcx.sess.err(&format!("{:?}", err));
132 let pretty_error = ::cranelift::codegen::print_errors::pretty_verifier_error(
135 Some(Box::new(&writer)),
139 .fatal(&format!("cranelift verify error:\n{}", pretty_error));
144 fn codegen_fn_content<'a, 'tcx: 'a>(fx: &mut FunctionCx<'a, 'tcx, impl Backend>) {
145 for (bb, bb_data) in fx.mir.basic_blocks().iter_enumerated() {
146 if bb_data.is_cleanup {
147 // Unwinding after panicking is not supported
151 let ebb = fx.get_ebb(bb);
152 fx.bcx.switch_to_block(ebb);
155 for stmt in &bb_data.statements {
156 trans_stmt(fx, ebb, stmt);
159 let mut terminator_head = "\n".to_string();
163 .fmt_head(&mut terminator_head)
165 let inst = fx.bcx.func.layout.last_inst(ebb).unwrap();
166 fx.add_comment(inst, terminator_head);
168 match &bb_data.terminator().kind {
169 TerminatorKind::Goto { target } => {
170 let ebb = fx.get_ebb(*target);
171 fx.bcx.ins().jump(ebb, &[]);
173 TerminatorKind::Return => {
174 crate::abi::codegen_return(fx);
176 TerminatorKind::Assert {
183 let cond = trans_operand(fx, cond).load_value(fx);
184 // TODO HACK brz/brnz for i8/i16 is not yet implemented
185 let cond = fx.bcx.ins().uextend(types::I32, cond);
186 let target = fx.get_ebb(*target);
188 fx.bcx.ins().brnz(cond, target, &[]);
190 fx.bcx.ins().brz(cond, target, &[]);
192 trap_panic(&mut fx.bcx);
195 TerminatorKind::SwitchInt {
201 let discr = trans_operand(fx, discr).load_value(fx);
202 let mut switch = ::cranelift::frontend::Switch::new();
203 for (i, value) in values.iter().enumerate() {
204 let ebb = fx.get_ebb(targets[i]);
205 switch.set_entry(*value as u64, ebb);
207 let otherwise_ebb = fx.get_ebb(targets[targets.len() - 1]);
208 switch.emit(&mut fx.bcx, discr, otherwise_ebb);
210 TerminatorKind::Call {
217 crate::abi::codegen_terminator_call(fx, func, args, destination);
219 TerminatorKind::Resume | TerminatorKind::Abort | TerminatorKind::Unreachable => {
220 trap_unreachable(&mut fx.bcx);
222 TerminatorKind::Yield { .. }
223 | TerminatorKind::FalseEdges { .. }
224 | TerminatorKind::FalseUnwind { .. }
225 | TerminatorKind::DropAndReplace { .. } => {
226 bug!("shouldn't exist at trans {:?}", bb_data.terminator());
228 TerminatorKind::Drop {
233 let ty = location.ty(fx.mir, fx.tcx).to_ty(fx.tcx);
234 let ty = fx.monomorphize(&ty);
235 let drop_fn = crate::rustc_mir::monomorphize::resolve_drop_in_place(fx.tcx, ty);
237 if let ty::InstanceDef::DropGlue(_, None) = drop_fn.def {
238 // we don't actually need to drop anything
240 let drop_place = trans_place(fx, location);
241 let arg_place = CPlace::temp(
244 &ty::RegionKind::ReErased,
247 mutbl: crate::rustc::hir::Mutability::MutMutable,
251 drop_place.write_place_ref(fx, arg_place);
254 fx.tcx.sess.warn("Drop for trait object");
257 let drop_fn_ty = drop_fn.ty(fx.tcx);
258 let arg_value = arg_place.to_cvalue(fx);
259 crate::abi::codegen_call_inner(
270 /*let mut args = if let Some(llextra) = place.llextra {
271 args2 = [place.llval, llextra];
274 args1 = [place.llval];
277 let (drop_fn, fn_ty) = match ty.sty {
279 let fn_ty = drop_fn.ty(bx.cx.tcx);
280 let sig = common::ty_fn_sig(bx.cx, fn_ty);
281 let sig = bx.tcx().normalize_erasing_late_bound_regions(
282 ty::ParamEnv::reveal_all(),
285 let fn_ty = FnType::new_vtable(bx.cx, sig, &[]);
286 let vtable = args[1];
288 (meth::DESTRUCTOR.get_fn(&bx, vtable, &fn_ty), fn_ty)
291 let value = place.to_cvalue(fx);
292 (callee::get_fn(bx.cx, drop_fn),
293 FnType::of_instance(bx.cx, &drop_fn))
296 do_call(self, bx, fn_ty, drop_fn, args,
297 Some((ReturnDest::Nothing, target)),
301 let target_ebb = fx.get_ebb(*target);
302 fx.bcx.ins().jump(target_ebb, &[]);
304 TerminatorKind::GeneratorDrop => {
305 unimplemented!("terminator GeneratorDrop");
310 fx.bcx.seal_all_blocks();
314 fn trans_stmt<'a, 'tcx: 'a>(
315 fx: &mut FunctionCx<'a, 'tcx, impl Backend>,
317 stmt: &Statement<'tcx>,
319 let _print_guard = PrintOnPanic(|| format!("stmt {:?}", stmt));
322 StatementKind::StorageLive(..) | StatementKind::StorageDead(..) => {} // Those are not very useful
324 let inst = fx.bcx.func.layout.last_inst(cur_ebb).unwrap();
325 fx.add_comment(inst, format!("{:?}", stmt));
330 StatementKind::SetDiscriminant {
334 let place = trans_place(fx, place);
335 let layout = place.layout();
336 if layout.for_variant(&*fx, *variant_index).abi == layout::Abi::Uninhabited {
339 match layout.variants {
340 layout::Variants::Single { index } => {
341 assert_eq!(index, *variant_index);
343 layout::Variants::Tagged { .. } => {
344 let ptr = place.place_field(fx, mir::Field::new(0));
349 .discriminant_for_variant(fx.tcx, *variant_index)
351 let discr = CValue::const_val(fx, ptr.layout().ty, to as u64 as i64);
352 ptr.write_cvalue(fx, discr);
354 layout::Variants::NicheFilling {
360 if *variant_index != dataful_variant {
361 let niche = place.place_field(fx, mir::Field::new(0));
362 //let niche_llty = niche.layout.immediate_llvm_type(bx.cx);
364 ((variant_index.as_u32() - niche_variants.start().as_u32()) as u128)
365 .wrapping_add(niche_start);
366 // FIXME(eddyb) Check the actual primitive type here.
367 let niche_llval = if niche_value == 0 {
368 CValue::const_val(fx, niche.layout().ty, 0)
370 CValue::const_val(fx, niche.layout().ty, niche_value as u64 as i64)
372 niche.write_cvalue(fx, niche_llval);
377 StatementKind::Assign(to_place, rval) => {
378 let lval = trans_place(fx, to_place);
379 let dest_layout = lval.layout();
381 Rvalue::Use(operand) => {
382 let val = trans_operand(fx, operand);
383 lval.write_cvalue(fx, val);
385 Rvalue::Ref(_, _, place) => {
386 let place = trans_place(fx, place);
387 place.write_place_ref(fx, lval);
389 Rvalue::BinaryOp(bin_op, lhs, rhs) => {
390 let ty = fx.monomorphize(&lhs.ty(fx.mir, fx.tcx));
391 let lhs = trans_operand(fx, lhs);
392 let rhs = trans_operand(fx, rhs);
394 let res = match ty.sty {
395 ty::Bool => trans_bool_binop(fx, *bin_op, lhs, rhs, lval.layout().ty),
397 trans_int_binop(fx, *bin_op, lhs, rhs, lval.layout().ty, false)
400 trans_int_binop(fx, *bin_op, lhs, rhs, lval.layout().ty, true)
402 ty::Float(_) => trans_float_binop(fx, *bin_op, lhs, rhs, lval.layout().ty),
403 ty::Char => trans_char_binop(fx, *bin_op, lhs, rhs, lval.layout().ty),
404 ty::RawPtr(..) => trans_ptr_binop(fx, *bin_op, lhs, rhs, lval.layout().ty),
405 _ => unimplemented!("binop {:?} for {:?}", bin_op, ty),
407 lval.write_cvalue(fx, res);
409 Rvalue::CheckedBinaryOp(bin_op, lhs, rhs) => {
410 let ty = fx.monomorphize(&lhs.ty(fx.mir, fx.tcx));
411 let lhs = trans_operand(fx, lhs);
412 let rhs = trans_operand(fx, rhs);
414 let res = match ty.sty {
416 trans_checked_int_binop(fx, *bin_op, lhs, rhs, lval.layout().ty, false)
419 trans_checked_int_binop(fx, *bin_op, lhs, rhs, lval.layout().ty, true)
421 _ => unimplemented!("checked binop {:?} for {:?}", bin_op, ty),
423 lval.write_cvalue(fx, res);
425 Rvalue::UnaryOp(un_op, operand) => {
426 let operand = trans_operand(fx, operand);
427 let layout = operand.layout();
428 let val = operand.load_value(fx);
429 let res = match un_op {
431 match layout.ty.sty {
433 let val = fx.bcx.ins().uextend(types::I32, val); // WORKAROUND for CraneStation/cranelift#466
434 let res = fx.bcx.ins().icmp_imm(IntCC::Equal, val, 0);
435 fx.bcx.ins().bint(types::I8, res)
437 ty::Uint(_) | ty::Int(_) => fx.bcx.ins().bnot(val),
438 _ => unimplemented!("un op Not for {:?}", layout.ty),
441 UnOp::Neg => match layout.ty.sty {
443 let clif_ty = fx.clif_type(layout.ty).unwrap();
444 let zero = fx.bcx.ins().iconst(clif_ty, 0);
445 fx.bcx.ins().isub(zero, val)
447 ty::Float(_) => fx.bcx.ins().fneg(val),
448 _ => unimplemented!("un op Neg for {:?}", layout.ty),
451 lval.write_cvalue(fx, CValue::ByVal(res, layout));
453 Rvalue::Cast(CastKind::ReifyFnPointer, operand, ty) => {
454 let operand = trans_operand(fx, operand);
455 let layout = fx.layout_of(ty);
456 lval.write_cvalue(fx, operand.unchecked_cast_to(layout));
458 Rvalue::Cast(CastKind::UnsafeFnPointer, operand, ty) => {
459 let operand = trans_operand(fx, operand);
460 let layout = fx.layout_of(ty);
461 lval.write_cvalue(fx, operand.unchecked_cast_to(layout));
463 Rvalue::Cast(CastKind::Misc, operand, to_ty) => {
464 let operand = trans_operand(fx, operand);
465 let from_ty = operand.layout().ty;
466 match (&from_ty.sty, &to_ty.sty) {
467 (ty::Ref(..), ty::Ref(..))
468 | (ty::Ref(..), ty::RawPtr(..))
469 | (ty::RawPtr(..), ty::Ref(..))
470 | (ty::RawPtr(..), ty::RawPtr(..))
471 | (ty::FnPtr(..), ty::RawPtr(..)) => {
472 lval.write_cvalue(fx, operand.unchecked_cast_to(dest_layout));
474 (ty::RawPtr(..), ty::Uint(_))
475 | (ty::RawPtr(..), ty::Int(_))
476 | (ty::FnPtr(..), ty::Uint(_))
477 if to_ty.sty == fx.tcx.types.usize.sty
478 || to_ty.sty == fx.tcx.types.isize.sty
479 || fx.clif_type(to_ty).unwrap() == pointer_ty(fx.tcx) =>
481 lval.write_cvalue(fx, operand.unchecked_cast_to(dest_layout));
483 (ty::Uint(_), ty::RawPtr(..)) if from_ty.sty == fx.tcx.types.usize.sty => {
484 lval.write_cvalue(fx, operand.unchecked_cast_to(dest_layout));
486 (ty::Char, ty::Uint(_))
487 | (ty::Uint(_), ty::Char)
488 | (ty::Uint(_), ty::Int(_))
489 | (ty::Uint(_), ty::Uint(_)) => {
490 let from = operand.load_value(fx);
491 let res = crate::common::clif_intcast(
494 fx.clif_type(to_ty).unwrap(),
497 lval.write_cvalue(fx, CValue::ByVal(res, dest_layout));
499 (ty::Int(_), ty::Int(_)) | (ty::Int(_), ty::Uint(_)) => {
500 let from = operand.load_value(fx);
501 let res = crate::common::clif_intcast(
504 fx.clif_type(to_ty).unwrap(),
507 lval.write_cvalue(fx, CValue::ByVal(res, dest_layout));
509 (ty::Float(from_flt), ty::Float(to_flt)) => {
510 let from = operand.load_value(fx);
511 let res = match (from_flt, to_flt) {
512 (FloatTy::F32, FloatTy::F64) => {
513 fx.bcx.ins().fpromote(types::F64, from)
515 (FloatTy::F64, FloatTy::F32) => {
516 fx.bcx.ins().fdemote(types::F32, from)
520 lval.write_cvalue(fx, CValue::ByVal(res, dest_layout));
522 (ty::Int(_), ty::Float(_)) => {
523 let from_ty = fx.clif_type(from_ty).unwrap();
524 let from = operand.load_value(fx);
525 // FIXME missing encoding for fcvt_from_sint.f32.i8
526 let from = if from_ty == types::I8 || from_ty == types::I16 {
527 fx.bcx.ins().sextend(types::I32, from)
531 let f_type = fx.clif_type(to_ty).unwrap();
532 let res = fx.bcx.ins().fcvt_from_sint(f_type, from);
533 lval.write_cvalue(fx, CValue::ByVal(res, dest_layout));
535 (ty::Uint(_), ty::Float(_)) => {
536 let from_ty = fx.clif_type(from_ty).unwrap();
537 let from = operand.load_value(fx);
538 // FIXME missing encoding for fcvt_from_uint.f32.i8
539 let from = if from_ty == types::I8 || from_ty == types::I16 {
540 fx.bcx.ins().uextend(types::I32, from)
544 let f_type = fx.clif_type(to_ty).unwrap();
545 let res = fx.bcx.ins().fcvt_from_uint(f_type, from);
546 lval.write_cvalue(fx, CValue::ByVal(res, dest_layout));
548 (ty::Bool, ty::Uint(_)) | (ty::Bool, ty::Int(_)) => {
549 let to_ty = fx.clif_type(to_ty).unwrap();
550 let from = operand.load_value(fx);
551 let res = if to_ty != types::I8 {
552 fx.bcx.ins().uextend(to_ty, from)
556 lval.write_cvalue(fx, CValue::ByVal(res, dest_layout));
558 (ty::Adt(adt_def, _substs), ty::Uint(_)) | (ty::Adt(adt_def, _substs), ty::Int(_)) if adt_def.is_enum() => {
559 let discr = trans_get_discriminant(fx, operand, fx.layout_of(to_ty));
560 lval.write_cvalue(fx, discr);
562 _ => unimpl!("rval misc {:?} {:?}", from_ty, to_ty),
565 Rvalue::Cast(CastKind::ClosureFnPointer, operand, ty) => {
566 unimplemented!("rval closure_fn_ptr {:?} {:?}", operand, ty)
568 Rvalue::Cast(CastKind::Unsize, operand, _ty) => {
569 let operand = trans_operand(fx, operand);
570 operand.unsize_value(fx, lval);
572 Rvalue::Discriminant(place) => {
573 let place = trans_place(fx, place).to_cvalue(fx);
574 let discr = trans_get_discriminant(fx, place, dest_layout);
575 lval.write_cvalue(fx, discr);
577 Rvalue::Repeat(operand, times) => {
578 let operand = trans_operand(fx, operand);
580 let index = fx.bcx.ins().iconst(fx.pointer_type, i as i64);
581 let to = lval.place_index(fx, index);
582 to.write_cvalue(fx, operand);
585 Rvalue::Len(place) => {
586 let place = trans_place(fx, place);
587 let usize_layout = fx.layout_of(fx.tcx.types.usize);
588 let len = codegen_array_len(fx, place);
589 lval.write_cvalue(fx, CValue::ByVal(len, usize_layout));
591 Rvalue::NullaryOp(NullOp::Box, content_ty) => {
592 use rustc::middle::lang_items::ExchangeMallocFnLangItem;
594 let usize_type = fx.clif_type(fx.tcx.types.usize).unwrap();
595 let layout = fx.layout_of(content_ty);
596 let llsize = fx.bcx.ins().iconst(usize_type, layout.size.bytes() as i64);
600 .iconst(usize_type, layout.align.abi.bytes() as i64);
601 let box_layout = fx.layout_of(fx.tcx.mk_box(content_ty));
604 let def_id = match fx.tcx.lang_items().require(ExchangeMallocFnLangItem) {
609 .fatal(&format!("allocation of `{}` {}", box_layout.ty, s));
612 let instance = ty::Instance::mono(fx.tcx, def_id);
613 let func_ref = fx.get_function_ref(instance);
614 let call = fx.bcx.ins().call(func_ref, &[llsize, llalign]);
615 let ptr = fx.bcx.inst_results(call)[0];
616 lval.write_cvalue(fx, CValue::ByVal(ptr, box_layout));
618 Rvalue::NullaryOp(NullOp::SizeOf, ty) => {
622 .is_sized(fx.tcx.at(DUMMY_SP), ParamEnv::reveal_all()));
623 let ty_size = fx.layout_of(ty).size.bytes();
624 let val = CValue::const_val(fx, fx.tcx.types.usize, ty_size as i64);
625 lval.write_cvalue(fx, val);
627 Rvalue::Aggregate(kind, operands) => match **kind {
628 AggregateKind::Array(_ty) => {
629 for (i, operand) in operands.into_iter().enumerate() {
630 let operand = trans_operand(fx, operand);
631 let index = fx.bcx.ins().iconst(fx.pointer_type, i as i64);
632 let to = lval.place_index(fx, index);
633 to.write_cvalue(fx, operand);
636 _ => unimpl!("shouldn't exist at trans {:?}", rval),
640 StatementKind::StorageLive(_)
641 | StatementKind::StorageDead(_)
643 | StatementKind::FakeRead(..)
644 | StatementKind::Retag { .. }
645 | StatementKind::AscribeUserType(..) => {}
647 StatementKind::InlineAsm { .. } => unimpl!("Inline assembly is not supported"),
651 fn codegen_array_len<'a, 'tcx: 'a>(
652 fx: &mut FunctionCx<'a, 'tcx, impl Backend>,
655 match place.layout().ty.sty {
656 ty::Array(_elem_ty, len) => {
657 let len = crate::constant::force_eval_const(fx, len).unwrap_usize(fx.tcx) as i64;
658 fx.bcx.ins().iconst(fx.pointer_type, len)
660 ty::Slice(_elem_ty) => match place {
661 CPlace::Addr(_, size, _) => size.unwrap(),
662 CPlace::Var(_, _) => unreachable!(),
664 _ => bug!("Rvalue::Len({:?})", place),
668 pub fn trans_get_discriminant<'a, 'tcx: 'a>(
669 fx: &mut FunctionCx<'a, 'tcx, impl Backend>,
671 dest_layout: TyLayout<'tcx>,
673 let layout = value.layout();
675 if layout.abi == layout::Abi::Uninhabited {
676 trap_unreachable(&mut fx.bcx);
678 match layout.variants {
679 layout::Variants::Single { index } => {
680 let discr_val = layout
683 .map_or(index.as_u32() as u128, |def| {
684 def.discriminant_for_variant(fx.tcx, index).val
686 return CValue::const_val(fx, dest_layout.ty, discr_val as u64 as i64);
688 layout::Variants::Tagged { .. } | layout::Variants::NicheFilling { .. } => {}
691 let discr = value.value_field(fx, mir::Field::new(0));
692 let discr_ty = discr.layout().ty;
693 let lldiscr = discr.load_value(fx);
694 match layout.variants {
695 layout::Variants::Single { .. } => bug!(),
696 layout::Variants::Tagged { ref tag, .. } => {
697 let signed = match tag.value {
698 layout::Int(_, signed) => signed,
701 let val = clif_intcast(fx, lldiscr, fx.clif_type(dest_layout.ty).unwrap(), signed);
702 return CValue::ByVal(val, dest_layout);
704 layout::Variants::NicheFilling {
710 let niche_llty = fx.clif_type(discr_ty).unwrap();
711 let dest_clif_ty = fx.clif_type(dest_layout.ty).unwrap();
712 if niche_variants.start() == niche_variants.end() {
716 .icmp_imm(IntCC::Equal, lldiscr, niche_start as u64 as i64);
720 .iconst(dest_clif_ty, niche_variants.start().as_u32() as i64);
724 .iconst(dest_clif_ty, dataful_variant.as_u32() as i64);
725 let val = fx.bcx.ins().select(b, if_true, if_false);
726 return CValue::ByVal(val, dest_layout);
728 // Rebase from niche values to discriminant values.
729 let delta = niche_start.wrapping_sub(niche_variants.start().as_u32() as u128);
730 let delta = fx.bcx.ins().iconst(niche_llty, delta as u64 as i64);
731 let lldiscr = fx.bcx.ins().isub(lldiscr, delta);
732 let b = fx.bcx.ins().icmp_imm(
733 IntCC::UnsignedLessThanOrEqual,
735 niche_variants.end().as_u32() as i64,
738 clif_intcast(fx, lldiscr, fx.clif_type(dest_layout.ty).unwrap(), false);
742 .iconst(dest_clif_ty, dataful_variant.as_u32() as i64);
743 let val = fx.bcx.ins().select(b, if_true, if_false);
744 return CValue::ByVal(val, dest_layout);
750 macro_rules! binop_match {
751 (@single $fx:expr, $bug_fmt:expr, $var:expr, $signed:expr, $lhs:expr, $rhs:expr, $ret_ty:expr, bug) => {
752 bug!("binop {} on {} lhs: {:?} rhs: {:?}", stringify!($var), $bug_fmt, $lhs, $rhs)
754 (@single $fx:expr, $bug_fmt:expr, $var:expr, $signed:expr, $lhs:expr, $rhs:expr, $ret_ty:expr, icmp($cc:ident)) => {{
755 assert_eq!($fx.tcx.types.bool, $ret_ty);
756 let ret_layout = $fx.layout_of($ret_ty);
758 let b = $fx.bcx.ins().icmp(IntCC::$cc, $lhs, $rhs);
759 CValue::ByVal($fx.bcx.ins().bint(types::I8, b), ret_layout)
761 (@single $fx:expr, $bug_fmt:expr, $var:expr, $signed:expr, $lhs:expr, $rhs:expr, $ret_ty:expr, fcmp($cc:ident)) => {{
762 assert_eq!($fx.tcx.types.bool, $ret_ty);
763 let ret_layout = $fx.layout_of($ret_ty);
764 let b = $fx.bcx.ins().fcmp(FloatCC::$cc, $lhs, $rhs);
765 CValue::ByVal($fx.bcx.ins().bint(types::I8, b), ret_layout)
767 (@single $fx:expr, $bug_fmt:expr, $var:expr, $signed:expr, $lhs:expr, $rhs:expr, $ret_ty:expr, custom(|| $body:expr)) => {{
770 (@single $fx:expr, $bug_fmt:expr, $var:expr, $signed:expr, $lhs:expr, $rhs:expr, $ret_ty:expr, $name:ident) => {{
771 let ret_layout = $fx.layout_of($ret_ty);
772 CValue::ByVal($fx.bcx.ins().$name($lhs, $rhs), ret_layout)
775 $fx:expr, $bin_op:expr, $signed:expr, $lhs:expr, $rhs:expr, $ret_ty:expr, $bug_fmt:expr;
777 $var:ident ($sign:pat) $name:tt $( ( $($next:tt)* ) )? ;
780 let lhs = $lhs.load_value($fx);
781 let rhs = $rhs.load_value($fx);
782 match ($bin_op, $signed) {
784 (BinOp::$var, $sign) => binop_match!(@single $fx, $bug_fmt, $var, $signed, lhs, rhs, $ret_ty, $name $( ( $($next)* ) )?),
790 fn trans_bool_binop<'a, 'tcx: 'a>(
791 fx: &mut FunctionCx<'a, 'tcx, impl Backend>,
797 let res = binop_match! {
798 fx, bin_op, false, lhs, rhs, ty, "bool";
811 Lt (_) icmp(UnsignedLessThan);
812 Le (_) icmp(UnsignedLessThanOrEqual);
813 Ne (_) icmp(NotEqual);
814 Ge (_) icmp(UnsignedGreaterThanOrEqual);
815 Gt (_) icmp(UnsignedGreaterThan);
823 pub fn trans_int_binop<'a, 'tcx: 'a>(
824 fx: &mut FunctionCx<'a, 'tcx, impl Backend>,
831 if bin_op != BinOp::Shl && bin_op != BinOp::Shr {
835 "int binop requires lhs and rhs of same type"
839 fx, bin_op, signed, lhs, rhs, out_ty, "int/uint";
855 Lt (false) icmp(UnsignedLessThan);
856 Lt (true) icmp(SignedLessThan);
857 Le (false) icmp(UnsignedLessThanOrEqual);
858 Le (true) icmp(SignedLessThanOrEqual);
859 Ne (_) icmp(NotEqual);
860 Ge (false) icmp(UnsignedGreaterThanOrEqual);
861 Ge (true) icmp(SignedGreaterThanOrEqual);
862 Gt (false) icmp(UnsignedGreaterThan);
863 Gt (true) icmp(SignedGreaterThan);
869 pub fn trans_checked_int_binop<'a, 'tcx: 'a>(
870 fx: &mut FunctionCx<'a, 'tcx, impl Backend>,
872 in_lhs: CValue<'tcx>,
873 in_rhs: CValue<'tcx>,
877 if bin_op != BinOp::Shl && bin_op != BinOp::Shr {
881 "checked int binop requires lhs and rhs of same type"
885 let lhs = in_lhs.load_value(fx);
886 let rhs = in_rhs.load_value(fx);
887 let res = match bin_op {
888 BinOp::Add => fx.bcx.ins().iadd(lhs, rhs),
889 BinOp::Sub => fx.bcx.ins().isub(lhs, rhs),
890 BinOp::Mul => fx.bcx.ins().imul(lhs, rhs),
891 BinOp::Shl => fx.bcx.ins().ishl(lhs, rhs),
894 fx.bcx.ins().ushr(lhs, rhs)
896 fx.bcx.ins().sshr(lhs, rhs)
900 "binop {:?} on checked int/uint lhs: {:?} rhs: {:?}",
907 // TODO: check for overflow
908 let has_overflow = fx.bcx.ins().iconst(types::I8, 0);
910 let out_place = CPlace::temp(fx, out_ty);
911 let out_layout = out_place.layout();
912 out_place.write_cvalue(fx, CValue::ByValPair(res, has_overflow, out_layout));
914 out_place.to_cvalue(fx)
917 fn trans_float_binop<'a, 'tcx: 'a>(
918 fx: &mut FunctionCx<'a, 'tcx, impl Backend>,
924 let res = binop_match! {
925 fx, bin_op, false, lhs, rhs, ty, "float";
931 assert_eq!(lhs.layout().ty, ty);
932 assert_eq!(rhs.layout().ty, ty);
934 ty::Float(FloatTy::F32) => fx.easy_call("fmodf", &[lhs, rhs], ty),
935 ty::Float(FloatTy::F64) => fx.easy_call("fmod", &[lhs, rhs], ty),
946 Lt (_) fcmp(LessThan);
947 Le (_) fcmp(LessThanOrEqual);
948 Ne (_) fcmp(NotEqual);
949 Ge (_) fcmp(GreaterThanOrEqual);
950 Gt (_) fcmp(GreaterThan);
958 fn trans_char_binop<'a, 'tcx: 'a>(
959 fx: &mut FunctionCx<'a, 'tcx, impl Backend>,
965 let res = binop_match! {
966 fx, bin_op, false, lhs, rhs, ty, "char";
979 Lt (_) icmp(UnsignedLessThan);
980 Le (_) icmp(UnsignedLessThanOrEqual);
981 Ne (_) icmp(NotEqual);
982 Ge (_) icmp(UnsignedGreaterThanOrEqual);
983 Gt (_) icmp(UnsignedGreaterThan);
991 fn trans_ptr_binop<'a, 'tcx: 'a>(
992 fx: &mut FunctionCx<'a, 'tcx, impl Backend>,
998 match lhs.layout().ty.sty {
999 ty::RawPtr(TypeAndMut { ty, mutbl: _ }) => {
1000 if ty.is_sized(fx.tcx.at(DUMMY_SP), ParamEnv::reveal_all()) {
1002 fx, bin_op, false, lhs, rhs, ret_ty, "ptr";
1015 Lt (_) icmp(UnsignedLessThan);
1016 Le (_) icmp(UnsignedLessThanOrEqual);
1017 Ne (_) icmp(NotEqual);
1018 Ge (_) icmp(UnsignedGreaterThanOrEqual);
1019 Gt (_) icmp(UnsignedGreaterThan);
1024 let lhs = lhs.load_value_pair(fx).0;
1025 let rhs = rhs.load_value_pair(fx).0;
1026 let res = match bin_op {
1027 BinOp::Eq => fx.bcx.ins().icmp(IntCC::Equal, lhs, rhs),
1028 BinOp::Ne => fx.bcx.ins().icmp(IntCC::NotEqual, lhs, rhs),
1029 _ => unimplemented!(
1030 "trans_ptr_binop({:?}, <fat ptr>, <fat ptr>) not implemented",
1035 assert_eq!(fx.tcx.types.bool, ret_ty);
1036 let ret_layout = fx.layout_of(ret_ty);
1037 CValue::ByVal(fx.bcx.ins().bint(types::I8, res), ret_layout)
1040 _ => bug!("trans_ptr_binop on non ptr"),
1044 pub fn trans_place<'a, 'tcx: 'a>(
1045 fx: &mut FunctionCx<'a, 'tcx, impl Backend>,
1046 place: &Place<'tcx>,
1049 Place::Local(local) => fx.get_local_place(*local),
1050 Place::Promoted(promoted) => crate::constant::trans_promoted(fx, promoted.0),
1051 Place::Static(static_) => crate::constant::codegen_static_ref(fx, static_),
1052 Place::Projection(projection) => {
1053 let base = trans_place(fx, &projection.base);
1054 match projection.elem {
1055 ProjectionElem::Deref => base.place_deref(fx),
1056 ProjectionElem::Field(field, _ty) => base.place_field(fx, field),
1057 ProjectionElem::Index(local) => {
1058 let index = fx.get_local_place(local).to_cvalue(fx).load_value(fx);
1059 base.place_index(fx, index)
1061 ProjectionElem::ConstantIndex {
1066 let index = if !from_end {
1067 fx.bcx.ins().iconst(fx.pointer_type, offset as i64)
1069 let len = codegen_array_len(fx, base);
1070 fx.bcx.ins().iadd_imm(len, -(offset as i64))
1072 base.place_index(fx, index)
1074 ProjectionElem::Subslice { from, to } => unimpl!(
1075 "projection subslice {:?} from {} to {}",
1080 ProjectionElem::Downcast(_adt_def, variant) => base.downcast_variant(fx, variant),
1086 pub fn trans_operand<'a, 'tcx>(
1087 fx: &mut FunctionCx<'a, 'tcx, impl Backend>,
1088 operand: &Operand<'tcx>,
1091 Operand::Move(place) | Operand::Copy(place) => {
1092 let cplace = trans_place(fx, place);
1093 cplace.to_cvalue(fx)
1095 Operand::Constant(const_) => crate::constant::trans_constant(fx, const_),