rust/src/base.rs

1230 lines
48 KiB
Rust
Raw Normal View History

use rustc::ty::adjustment::PointerCast;
use crate::prelude::*;
2018-06-17 11:05:11 -05:00
2019-05-04 09:54:25 -05:00
pub fn trans_fn<'a, 'clif, 'tcx: 'a, B: Backend + 'static>(
cx: &mut crate::CodegenCx<'clif, 'tcx, B>,
instance: Instance<'tcx>,
linkage: Linkage,
2018-08-17 05:57:41 -05:00
) {
2018-12-18 11:28:02 -06:00
let tcx = cx.tcx;
let mir = tcx.instance_mir(instance.def);
2018-08-14 11:52:43 -05:00
2019-05-14 09:12:58 -05:00
// Check fn sig for u128 and i128 and replace those functions with a trap.
{
// FIXME implement u128 and i128 support
2019-05-14 09:12:58 -05:00
// Check sig for u128 and i128
let fn_sig = tcx.normalize_erasing_late_bound_regions(ParamEnv::reveal_all(), &instance.fn_sig(tcx));
struct UI128Visitor<'tcx>(TyCtxt<'tcx>, bool);
impl<'tcx> rustc::ty::fold::TypeVisitor<'tcx> for UI128Visitor<'tcx> {
fn visit_ty(&mut self, t: Ty<'tcx>) -> bool {
if t.sty == self.0.types.u128.sty || t.sty == self.0.types.i128.sty {
self.1 = true;
return false; // stop visiting
}
t.super_visit_with(self)
}
}
let mut visitor = UI128Visitor(tcx, false);
fn_sig.visit_with(&mut visitor);
2019-05-14 09:12:58 -05:00
//If found replace function with a trap.
if visitor.1 {
tcx.sess.warn("u128 and i128 are not yet supported. \
Functions using these as args will be replaced with a trap.");
2019-05-14 09:12:58 -05:00
// Declare function with fake signature
let sig = Signature {
params: vec![AbiParam::new(types::INVALID)],
returns: vec![],
call_conv: CallConv::Fast,
};
let name = tcx.symbol_name(instance).as_str();
let func_id = cx.module.declare_function(&*name, linkage, &sig).unwrap();
2019-05-14 09:12:58 -05:00
// Create trapping function
let mut func = Function::with_name_signature(ExternalName::user(0, 0), sig);
let mut func_ctx = FunctionBuilderContext::new();
let mut bcx = FunctionBuilder::new(&mut func, &mut func_ctx);
let start_ebb = bcx.create_ebb();
bcx.append_ebb_params_for_function_params(start_ebb);
bcx.switch_to_block(start_ebb);
2019-03-23 07:06:35 -05:00
let mut fx = FunctionCx {
tcx,
module: cx.module,
pointer_type: pointer_ty(tcx),
instance,
mir,
bcx,
ebb_map: HashMap::new(),
local_map: HashMap::new(),
clif_comments: crate::pretty_clif::CommentWriter::new(tcx, instance),
constants: &mut cx.ccx,
caches: &mut cx.caches,
source_info_set: indexmap::IndexSet::new(),
};
crate::trap::trap_unreachable(&mut fx, "[unimplemented] Called function with u128 or i128 as argument.");
fx.bcx.seal_all_blocks();
fx.bcx.finalize();
2019-05-14 09:12:58 -05:00
// Define function
cx.caches.context.func = func;
cx.module
.define_function(func_id, &mut cx.caches.context)
.unwrap();
cx.caches.context.clear();
return;
}
}
2019-05-14 09:12:58 -05:00
// Declare function
2019-02-11 12:18:52 -06:00
let (name, sig) = get_function_name_and_sig(tcx, instance, false);
2019-02-21 08:06:09 -06:00
let func_id = cx.module.declare_function(&name, linkage, &sig).unwrap();
let mut debug_context = cx
.debug_context
.as_mut()
.map(|debug_context| FunctionDebugContext::new(tcx, debug_context, mir, &name, &sig));
2018-08-14 11:52:43 -05:00
2019-05-14 09:12:58 -05:00
// Make FunctionBuilder
2018-08-14 11:52:43 -05:00
let mut func = Function::with_name_signature(ExternalName::user(0, 0), sig);
2018-06-17 11:05:11 -05:00
let mut func_ctx = FunctionBuilderContext::new();
2018-11-17 11:23:52 -06:00
let mut bcx = FunctionBuilder::new(&mut func, &mut func_ctx);
2018-06-17 11:05:11 -05:00
2019-05-14 09:12:58 -05:00
// Predefine ebb's
2018-06-17 11:05:11 -05:00
let start_ebb = bcx.create_ebb();
let mut ebb_map: HashMap<BasicBlock, Ebb> = HashMap::new();
for (bb, _bb_data) in mir.basic_blocks().iter_enumerated() {
ebb_map.insert(bb, bcx.create_ebb());
}
2019-05-14 09:12:58 -05:00
// Make FunctionCx
2018-12-18 11:28:02 -06:00
let pointer_type = cx.module.target_config().pointer_type();
let clif_comments = crate::pretty_clif::CommentWriter::new(tcx, instance);
let mut fx = FunctionCx {
2018-08-14 11:52:43 -05:00
tcx,
2018-12-18 11:28:02 -06:00
module: cx.module,
pointer_type,
2018-12-01 04:49:44 -06:00
2018-06-23 11:54:15 -05:00
instance,
mir,
2018-12-01 04:49:44 -06:00
2018-06-23 11:54:15 -05:00
bcx,
ebb_map,
local_map: HashMap::new(),
2018-12-01 04:49:44 -06:00
clif_comments,
2018-12-18 11:28:02 -06:00
constants: &mut cx.ccx,
caches: &mut cx.caches,
source_info_set: indexmap::IndexSet::new(),
};
2018-11-16 12:53:27 -06:00
with_unimpl_span(fx.mir.span, || {
crate::abi::codegen_fn_prelude(&mut fx, start_ebb);
codegen_fn_content(&mut fx);
});
2018-08-14 11:52:43 -05:00
2019-05-14 09:12:58 -05:00
// Recover all necessary data from fx, before accessing func will prevent future access to it.
let instance = fx.instance;
let clif_comments = fx.clif_comments;
let source_info_set = fx.source_info_set;
2018-12-28 10:07:40 -06:00
#[cfg(debug_assertions)]
2019-05-14 09:12:58 -05:00
crate::pretty_clif::write_clif_file(cx.tcx, "unopt", instance, &func, &clif_comments, None);
2018-08-14 11:52:43 -05:00
2019-05-14 09:12:58 -05:00
// Verify function
verify_func(tcx, &clif_comments, &func);
2018-08-14 11:52:43 -05:00
2019-05-14 09:12:58 -05:00
// Define function
let context = &mut cx.caches.context;
context.func = func;
2019-02-21 08:06:09 -06:00
cx.module
2019-05-14 09:12:58 -05:00
.define_function(func_id, context)
2019-02-21 08:06:09 -06:00
.unwrap();
2019-02-18 11:26:59 -06:00
2019-05-14 09:12:58 -05:00
let value_ranges = context.build_value_labels_ranges(cx.module.isa()).expect("value location ranges");
// Write optimized function to file for debugging
#[cfg(debug_assertions)]
crate::pretty_clif::write_clif_file(cx.tcx, "opt", instance, &context.func, &clif_comments, Some(&value_ranges));
// Define debuginfo for function
2019-02-18 11:26:59 -06:00
let isa = cx.module.isa();
2019-02-21 08:06:09 -06:00
debug_context
.as_mut()
.map(|x| x.define(tcx, context, isa, &source_info_set));
2019-02-18 11:26:59 -06:00
2019-05-14 09:12:58 -05:00
// Clear context to make it usable for the next function
context.clear();
2018-08-14 11:52:43 -05:00
}
2018-06-17 11:05:11 -05:00
2019-05-14 09:12:58 -05:00
fn verify_func(tcx: TyCtxt, writer: &crate::pretty_clif::CommentWriter, func: &Function) {
2018-08-14 11:52:43 -05:00
let flags = settings::Flags::new(settings::builder());
match ::cranelift::codegen::verify_function(&func, &flags) {
Ok(_) => {}
Err(err) => {
tcx.sess.err(&format!("{:?}", err));
let pretty_error = ::cranelift::codegen::print_errors::pretty_verifier_error(
&func,
None,
2019-05-14 09:12:58 -05:00
Some(Box::new(writer)),
2018-08-15 05:36:13 -05:00
err,
2018-08-14 11:52:43 -05:00
);
tcx.sess
2018-11-12 09:20:25 -06:00
.fatal(&format!("cranelift verify error:\n{}", pretty_error));
2018-08-14 11:52:43 -05:00
}
}
}
2018-08-14 13:31:16 -05:00
fn codegen_fn_content<'a, 'tcx: 'a>(fx: &mut FunctionCx<'a, 'tcx, impl Backend>) {
2018-08-14 11:52:43 -05:00
for (bb, bb_data) in fx.mir.basic_blocks().iter_enumerated() {
if bb_data.is_cleanup {
// Unwinding after panicking is not supported
continue;
}
2018-06-19 12:51:29 -05:00
let ebb = fx.get_ebb(bb);
fx.bcx.switch_to_block(ebb);
2018-06-17 11:05:11 -05:00
2018-07-20 06:51:34 -05:00
fx.bcx.ins().nop();
2018-06-17 11:05:11 -05:00
for stmt in &bb_data.statements {
2019-01-17 11:07:27 -06:00
fx.set_debug_loc(stmt.source_info);
2018-08-08 08:38:03 -05:00
trans_stmt(fx, ebb, stmt);
2018-06-17 11:05:11 -05:00
}
2018-12-28 10:07:40 -06:00
#[cfg(debug_assertions)]
{
let mut terminator_head = "\n".to_string();
bb_data
.terminator()
.kind
.fmt_head(&mut terminator_head)
.unwrap();
let inst = fx.bcx.func.layout.last_inst(ebb).unwrap();
fx.add_comment(inst, terminator_head);
}
2018-07-20 06:51:34 -05:00
2019-01-17 11:07:27 -06:00
fx.set_debug_loc(bb_data.terminator().source_info);
2018-07-20 06:51:34 -05:00
match &bb_data.terminator().kind {
2018-06-17 11:05:11 -05:00
TerminatorKind::Goto { target } => {
2018-06-19 12:51:29 -05:00
let ebb = fx.get_ebb(*target);
2018-07-20 06:51:34 -05:00
fx.bcx.ins().jump(ebb, &[]);
2018-06-17 11:05:11 -05:00
}
TerminatorKind::Return => {
2018-08-11 04:01:48 -05:00
crate::abi::codegen_return(fx);
2018-06-17 11:05:11 -05:00
}
TerminatorKind::Assert {
cond,
expected,
2019-03-23 07:06:35 -05:00
msg,
target,
cleanup: _,
} => {
let cond = trans_operand(fx, cond).load_scalar(fx);
2018-08-13 12:14:55 -05:00
// TODO HACK brz/brnz for i8/i16 is not yet implemented
let cond = fx.bcx.ins().uextend(types::I32, cond);
2018-06-19 12:51:29 -05:00
let target = fx.get_ebb(*target);
2018-07-20 06:51:34 -05:00
if *expected {
fx.bcx.ins().brnz(cond, target, &[]);
2018-08-09 08:36:02 -05:00
} else {
fx.bcx.ins().brz(cond, target, &[]);
};
2019-03-23 07:06:35 -05:00
trap_panic(fx, format!("[panic] Assert {:?} failed.", msg));
2018-06-17 11:05:11 -05:00
}
TerminatorKind::SwitchInt {
discr,
switch_ty: _,
values,
targets,
} => {
let discr = trans_operand(fx, discr).load_scalar(fx);
let mut switch = ::cranelift::frontend::Switch::new();
for (i, value) in values.iter().enumerate() {
let ebb = fx.get_ebb(targets[i]);
switch.set_entry(*value as u64, ebb);
2018-06-17 11:05:11 -05:00
}
let otherwise_ebb = fx.get_ebb(targets[targets.len() - 1]);
switch.emit(&mut fx.bcx, discr, otherwise_ebb);
2018-06-17 11:05:11 -05:00
}
TerminatorKind::Call {
func,
args,
destination,
cleanup: _,
from_hir_call: _,
} => {
2018-09-11 12:27:57 -05:00
crate::abi::codegen_terminator_call(fx, func, args, destination);
2018-06-17 11:05:11 -05:00
}
2019-03-23 07:06:35 -05:00
TerminatorKind::Resume | TerminatorKind::Abort => {
trap_unreachable(fx, "[corruption] Unwinding bb reached.");
}
TerminatorKind::Unreachable => {
trap_unreachable(fx, "[corruption] Hit unreachable code.");
2018-06-17 12:10:00 -05:00
}
TerminatorKind::Yield { .. }
| TerminatorKind::FalseEdges { .. }
2018-09-11 12:27:57 -05:00
| TerminatorKind::FalseUnwind { .. }
2019-02-07 13:45:15 -06:00
| TerminatorKind::DropAndReplace { .. }
| TerminatorKind::GeneratorDrop => {
2018-06-18 11:39:07 -05:00
bug!("shouldn't exist at trans {:?}", bb_data.terminator());
}
2018-09-11 12:27:57 -05:00
TerminatorKind::Drop {
location,
target,
unwind: _,
} => {
2019-06-16 08:57:53 -05:00
let drop_place = trans_place(fx, location);
crate::abi::codegen_drop(fx, drop_place);
2018-09-11 12:27:57 -05:00
2018-06-28 13:27:43 -05:00
let target_ebb = fx.get_ebb(*target);
2018-07-20 06:51:34 -05:00
fx.bcx.ins().jump(target_ebb, &[]);
2018-06-28 13:27:43 -05:00
}
};
2018-06-17 11:05:11 -05:00
}
2018-06-19 12:51:29 -05:00
fx.bcx.seal_all_blocks();
fx.bcx.finalize();
2018-06-17 11:05:11 -05:00
}
2018-08-14 13:31:16 -05:00
fn trans_stmt<'a, 'tcx: 'a>(
fx: &mut FunctionCx<'a, 'tcx, impl Backend>,
cur_ebb: Ebb,
stmt: &Statement<'tcx>,
) {
2018-08-31 12:50:26 -05:00
let _print_guard = PrintOnPanic(|| format!("stmt {:?}", stmt));
2019-01-17 11:07:27 -06:00
fx.set_debug_loc(stmt.source_info);
2018-12-28 10:07:40 -06:00
#[cfg(debug_assertions)]
match &stmt.kind {
StatementKind::StorageLive(..) | StatementKind::StorageDead(..) => {} // Those are not very useful
_ => {
let inst = fx.bcx.func.layout.last_inst(cur_ebb).unwrap();
fx.add_comment(inst, format!("{:?}", stmt));
}
}
2018-06-17 11:05:11 -05:00
match &stmt.kind {
StatementKind::SetDiscriminant {
place,
variant_index,
} => {
2018-06-24 07:29:56 -05:00
let place = trans_place(fx, place);
let layout = place.layout();
2018-06-24 07:29:56 -05:00
if layout.for_variant(&*fx, *variant_index).abi == layout::Abi::Uninhabited {
2018-08-08 08:38:03 -05:00
return;
2018-06-23 11:54:15 -05:00
}
2018-06-24 07:29:56 -05:00
match layout.variants {
2018-06-23 11:54:15 -05:00
layout::Variants::Single { index } => {
2018-06-24 07:29:56 -05:00
assert_eq!(index, *variant_index);
2018-06-23 11:54:15 -05:00
}
layout::Variants::Multiple {
discr: _,
discr_index,
discr_kind: layout::DiscriminantKind::Tag,
variants: _,
} => {
let ptr = place.place_field(fx, mir::Field::new(discr_index));
let to = layout
.ty
2018-06-24 07:29:56 -05:00
.discriminant_for_variant(fx.tcx, *variant_index)
2019-06-02 09:25:10 -05:00
.unwrap()
2018-06-23 11:54:15 -05:00
.val;
let discr = CValue::const_val(fx, ptr.layout().ty, to as u64 as i64);
ptr.write_cvalue(fx, discr);
2018-06-23 11:54:15 -05:00
}
layout::Variants::Multiple {
discr: _,
discr_index,
discr_kind: layout::DiscriminantKind::Niche {
dataful_variant,
ref niche_variants,
niche_start,
},
variants: _,
2018-06-23 11:54:15 -05:00
} => {
2018-06-24 07:29:56 -05:00
if *variant_index != dataful_variant {
let niche = place.place_field(fx, mir::Field::new(discr_index));
2018-06-24 07:29:56 -05:00
//let niche_llty = niche.layout.immediate_llvm_type(bx.cx);
2018-11-24 05:47:53 -06:00
let niche_value =
((variant_index.as_u32() - niche_variants.start().as_u32()) as u128)
.wrapping_add(niche_start);
2018-06-23 11:54:15 -05:00
// FIXME(eddyb) Check the actual primitive type here.
let niche_llval = if niche_value == 0 {
CValue::const_val(fx, niche.layout().ty, 0)
2018-06-23 11:54:15 -05:00
} else {
CValue::const_val(fx, niche.layout().ty, niche_value as u64 as i64)
2018-06-23 11:54:15 -05:00
};
niche.write_cvalue(fx, niche_llval);
2018-06-23 11:54:15 -05:00
}
}
}
2018-06-24 07:29:56 -05:00
}
2018-06-23 11:26:54 -05:00
StatementKind::Assign(to_place, rval) => {
let lval = trans_place(fx, to_place);
let dest_layout = lval.layout();
2018-09-28 11:21:11 -05:00
match &**rval {
2018-06-20 08:29:50 -05:00
Rvalue::Use(operand) => {
let val = trans_operand(fx, operand);
lval.write_cvalue(fx, val);
2018-06-27 09:01:30 -05:00
}
Rvalue::Ref(_, _, place) => {
let place = trans_place(fx, place);
2018-08-22 08:38:10 -05:00
place.write_place_ref(fx, lval);
2018-06-27 09:01:30 -05:00
}
2018-06-23 11:26:54 -05:00
Rvalue::BinaryOp(bin_op, lhs, rhs) => {
let ty = fx.monomorphize(&lhs.ty(fx.mir, fx.tcx));
2018-07-30 08:34:34 -05:00
let lhs = trans_operand(fx, lhs);
let rhs = trans_operand(fx, rhs);
2018-06-23 11:26:54 -05:00
let res = match ty.sty {
2018-08-24 07:54:22 -05:00
ty::Bool => trans_bool_binop(fx, *bin_op, lhs, rhs, lval.layout().ty),
ty::Uint(_) => {
trans_int_binop(fx, *bin_op, lhs, rhs, lval.layout().ty, false)
2018-06-23 11:26:54 -05:00
}
ty::Int(_) => {
trans_int_binop(fx, *bin_op, lhs, rhs, lval.layout().ty, true)
2018-06-23 11:54:15 -05:00
}
2018-08-24 07:54:22 -05:00
ty::Float(_) => trans_float_binop(fx, *bin_op, lhs, rhs, lval.layout().ty),
ty::Char => trans_char_binop(fx, *bin_op, lhs, rhs, lval.layout().ty),
ty::RawPtr(..) => trans_ptr_binop(fx, *bin_op, lhs, rhs, lval.layout().ty),
ty::FnPtr(..) => trans_ptr_binop(fx, *bin_op, lhs, rhs, lval.layout().ty),
_ => unimplemented!("binop {:?} for {:?}", bin_op, ty),
2018-06-23 11:26:54 -05:00
};
2018-06-27 08:47:58 -05:00
lval.write_cvalue(fx, res);
2018-06-23 11:26:54 -05:00
}
2018-06-20 08:29:50 -05:00
Rvalue::CheckedBinaryOp(bin_op, lhs, rhs) => {
let ty = fx.monomorphize(&lhs.ty(fx.mir, fx.tcx));
2018-07-30 08:34:34 -05:00
let lhs = trans_operand(fx, lhs);
let rhs = trans_operand(fx, rhs);
2018-06-20 08:29:50 -05:00
let res = match ty.sty {
ty::Uint(_) => {
trans_checked_int_binop(fx, *bin_op, lhs, rhs, lval.layout().ty, false)
2018-06-20 08:29:50 -05:00
}
ty::Int(_) => {
trans_checked_int_binop(fx, *bin_op, lhs, rhs, lval.layout().ty, true)
2018-06-24 07:29:56 -05:00
}
_ => unimplemented!("checked binop {:?} for {:?}", bin_op, ty),
2018-06-20 08:29:50 -05:00
};
2018-06-28 13:13:51 -05:00
lval.write_cvalue(fx, res);
2018-06-20 08:29:50 -05:00
}
2018-06-27 08:57:52 -05:00
Rvalue::UnaryOp(un_op, operand) => {
let operand = trans_operand(fx, operand);
let layout = operand.layout();
let val = operand.load_scalar(fx);
2018-06-27 08:57:52 -05:00
let res = match un_op {
UnOp::Not => {
match layout.ty.sty {
ty::Bool => {
let val = fx.bcx.ins().uextend(types::I32, val); // WORKAROUND for CraneStation/cranelift#466
let res = fx.bcx.ins().icmp_imm(IntCC::Equal, val, 0);
fx.bcx.ins().bint(types::I8, res)
}
2018-09-26 08:40:11 -05:00
ty::Uint(_) | ty::Int(_) => fx.bcx.ins().bnot(val),
_ => unimplemented!("un op Not for {:?}", layout.ty),
}
2018-09-26 08:40:11 -05:00
}
UnOp::Neg => match layout.ty.sty {
ty::Int(_) => {
2018-11-12 09:23:39 -06:00
let clif_ty = fx.clif_type(layout.ty).unwrap();
let zero = fx.bcx.ins().iconst(clif_ty, 0);
2018-08-08 03:39:10 -05:00
fx.bcx.ins().isub(zero, val)
2018-08-08 05:45:34 -05:00
}
ty::Float(_) => fx.bcx.ins().fneg(val),
_ => unimplemented!("un op Neg for {:?}", layout.ty),
},
2018-06-27 08:57:52 -05:00
};
2019-06-11 08:32:30 -05:00
lval.write_cvalue(fx, CValue::by_val(res, layout));
2018-06-27 08:57:52 -05:00
}
Rvalue::Cast(CastKind::Pointer(PointerCast::ReifyFnPointer), operand, ty) => {
let layout = fx.layout_of(ty);
2019-02-21 08:06:09 -06:00
match fx
.monomorphize(&operand.ty(&fx.mir.local_decls, fx.tcx))
.sty
{
ty::FnDef(def_id, substs) => {
let func_ref = fx.get_function_ref(
2019-02-21 08:06:09 -06:00
Instance::resolve(fx.tcx, ParamEnv::reveal_all(), def_id, substs)
.unwrap(),
);
let func_addr = fx.bcx.ins().func_addr(fx.pointer_type, func_ref);
2019-06-11 08:32:30 -05:00
lval.write_cvalue(fx, CValue::by_val(func_addr, layout));
}
_ => bug!("Trying to ReifyFnPointer on non FnDef {:?}", ty),
}
2018-06-20 08:29:50 -05:00
}
Rvalue::Cast(CastKind::Pointer(PointerCast::UnsafeFnPointer), operand, ty)
| Rvalue::Cast(CastKind::Pointer(PointerCast::MutToConstPointer), operand, ty) => {
2018-06-20 08:29:50 -05:00
let operand = trans_operand(fx, operand);
let layout = fx.layout_of(ty);
lval.write_cvalue(fx, operand.unchecked_cast_to(layout));
2018-06-23 11:26:54 -05:00
}
2018-07-18 09:22:29 -05:00
Rvalue::Cast(CastKind::Misc, operand, to_ty) => {
let operand = trans_operand(fx, operand);
2018-07-18 09:22:29 -05:00
let from_ty = operand.layout().ty;
fn is_fat_ptr<'a, 'tcx: 'a>(fx: &FunctionCx<'a, 'tcx, impl Backend>, ty: Ty<'tcx>) -> bool {
ty
.builtin_deref(true)
.map(|ty::TypeAndMut {ty: pointee_ty, mutbl: _ }| fx.layout_of(pointee_ty).is_unsized())
.unwrap_or(false)
}
if is_fat_ptr(fx, from_ty) {
if is_fat_ptr(fx, to_ty) {
// fat-ptr -> fat-ptr
2019-02-16 09:37:30 -06:00
lval.write_cvalue(fx, operand.unchecked_cast_to(dest_layout));
} else {
// fat-ptr -> thin-ptr
let (ptr, _extra) = operand.load_scalar_pair(fx);
2019-06-11 08:32:30 -05:00
lval.write_cvalue(fx, CValue::by_val(ptr, dest_layout))
2019-02-16 09:37:30 -06:00
}
} else if let ty::Adt(adt_def, _substs) = from_ty.sty {
// enum -> discriminant value
assert!(adt_def.is_enum());
match to_ty.sty {
ty::Uint(_) | ty::Int(_) => {},
_ => unreachable!("cast adt {} -> {}", from_ty, to_ty),
2018-07-18 09:22:29 -05:00
}
// FIXME avoid forcing to stack
let place =
2019-06-11 09:30:47 -05:00
CPlace::for_addr(operand.force_stack(fx), operand.layout());
let discr = trans_get_discriminant(fx, place, fx.layout_of(to_ty));
lval.write_cvalue(fx, discr);
} else {
let from_clif_ty = fx.clif_type(from_ty).unwrap();
let to_clif_ty = fx.clif_type(to_ty).unwrap();
let from = operand.load_scalar(fx);
let signed = match from_ty.sty {
ty::Ref(..) | ty::RawPtr(..) | ty::FnPtr(..) | ty::Char | ty::Uint(..) | ty::Bool => false,
ty::Int(..) => true,
ty::Float(..) => false, // `signed` is unused for floats
_ => panic!("{}", from_ty),
};
let res = if from_clif_ty.is_int() && to_clif_ty.is_int() {
// int-like -> int-like
crate::common::clif_intcast(
2018-08-14 05:13:07 -05:00
fx,
from,
to_clif_ty,
signed,
)
} else if from_clif_ty.is_int() && to_clif_ty.is_float() {
// int-like -> float
if signed {
fx.bcx.ins().fcvt_from_sint(to_clif_ty, from)
} else {
fx.bcx.ins().fcvt_from_uint(to_clif_ty, from)
}
} else if from_clif_ty.is_float() && to_clif_ty.is_int() {
// float -> int-like
let from = operand.load_scalar(fx);
if signed {
fx.bcx.ins().fcvt_to_sint_sat(to_clif_ty, from)
2018-08-09 08:44:01 -05:00
} else {
fx.bcx.ins().fcvt_to_uint_sat(to_clif_ty, from)
}
} else if from_clif_ty.is_float() && to_clif_ty.is_float() {
// float -> float
match (from_clif_ty, to_clif_ty) {
(types::F32, types::F64) => {
fx.bcx.ins().fpromote(types::F64, from)
}
(types::F64, types::F32) => {
fx.bcx.ins().fdemote(types::F32, from)
}
_ => from,
}
} else {
unimpl!("rval misc {:?} {:?}", from_ty, to_ty)
};
2019-06-11 08:32:30 -05:00
lval.write_cvalue(fx, CValue::by_val(res, dest_layout));
}
}
Rvalue::Cast(CastKind::Pointer(PointerCast::ClosureFnPointer(_)), operand, _ty) => {
2019-02-24 11:15:23 -06:00
let operand = trans_operand(fx, operand);
match operand.layout().ty.sty {
ty::Closure(def_id, substs) => {
let instance = Instance::resolve_closure(
2019-02-24 11:15:23 -06:00
fx.tcx,
def_id,
substs,
ty::ClosureKind::FnOnce,
);
let func_ref = fx.get_function_ref(instance);
let func_addr = fx.bcx.ins().func_addr(fx.pointer_type, func_ref);
2019-06-11 08:32:30 -05:00
lval.write_cvalue(fx, CValue::by_val(func_addr, lval.layout()));
2019-02-24 11:15:23 -06:00
}
_ => {
bug!("{} cannot be cast to a fn ptr", operand.layout().ty)
}
}
}
Rvalue::Cast(CastKind::Pointer(PointerCast::Unsize), operand, _ty) => {
let operand = trans_operand(fx, operand);
operand.unsize_value(fx, lval);
}
2018-06-23 11:26:54 -05:00
Rvalue::Discriminant(place) => {
let place = trans_place(fx, place);
let discr = trans_get_discriminant(fx, place, dest_layout);
lval.write_cvalue(fx, discr);
2018-06-20 08:29:50 -05:00
}
Rvalue::Repeat(operand, times) => {
2018-08-08 05:30:25 -05:00
let operand = trans_operand(fx, operand);
for i in 0..*times {
let index = fx.bcx.ins().iconst(fx.pointer_type, i as i64);
2018-08-08 05:30:25 -05:00
let to = lval.place_index(fx, index);
to.write_cvalue(fx, operand);
}
}
2018-08-22 10:58:25 -05:00
Rvalue::Len(place) => {
let place = trans_place(fx, place);
let usize_layout = fx.layout_of(fx.tcx.types.usize);
let len = codegen_array_len(fx, place);
2019-06-11 08:32:30 -05:00
lval.write_cvalue(fx, CValue::by_val(len, usize_layout));
2018-08-22 10:58:25 -05:00
}
2018-09-04 12:04:25 -05:00
Rvalue::NullaryOp(NullOp::Box, content_ty) => {
use rustc::middle::lang_items::ExchangeMallocFnLangItem;
2018-09-04 12:04:25 -05:00
2018-11-12 09:23:39 -06:00
let usize_type = fx.clif_type(fx.tcx.types.usize).unwrap();
let layout = fx.layout_of(content_ty);
let llsize = fx.bcx.ins().iconst(usize_type, layout.size.bytes() as i64);
2018-11-24 05:47:53 -06:00
let llalign = fx
.bcx
.ins()
.iconst(usize_type, layout.align.abi.bytes() as i64);
2018-09-04 12:04:25 -05:00
let box_layout = fx.layout_of(fx.tcx.mk_box(content_ty));
// Allocate space:
let def_id = match fx.tcx.lang_items().require(ExchangeMallocFnLangItem) {
Ok(id) => id,
Err(s) => {
2018-09-08 10:24:52 -05:00
fx.tcx
.sess
.fatal(&format!("allocation of `{}` {}", box_layout.ty, s));
2018-09-04 12:04:25 -05:00
}
};
let instance = ty::Instance::mono(fx.tcx, def_id);
let func_ref = fx.get_function_ref(instance);
let call = fx.bcx.ins().call(func_ref, &[llsize, llalign]);
let ptr = fx.bcx.inst_results(call)[0];
2019-06-11 08:32:30 -05:00
lval.write_cvalue(fx, CValue::by_val(ptr, box_layout));
2018-09-08 10:24:52 -05:00
}
2018-08-08 05:44:41 -05:00
Rvalue::NullaryOp(NullOp::SizeOf, ty) => {
2018-11-07 06:32:02 -06:00
assert!(lval
.layout()
.ty
.is_sized(fx.tcx.at(DUMMY_SP), ParamEnv::reveal_all()));
2018-08-08 05:44:41 -05:00
let ty_size = fx.layout_of(ty).size.bytes();
let val = CValue::const_val(fx, fx.tcx.types.usize, ty_size as i64);
lval.write_cvalue(fx, val);
2018-08-08 05:45:34 -05:00
}
Rvalue::Aggregate(kind, operands) => match **kind {
AggregateKind::Array(_ty) => {
for (i, operand) in operands.into_iter().enumerate() {
let operand = trans_operand(fx, operand);
let index = fx.bcx.ins().iconst(fx.pointer_type, i as i64);
let to = lval.place_index(fx, index);
to.write_cvalue(fx, operand);
}
}
_ => unimpl!("shouldn't exist at trans {:?}", rval),
},
2018-06-20 08:29:50 -05:00
}
2018-06-17 11:05:11 -05:00
}
StatementKind::StorageLive(_)
| StatementKind::StorageDead(_)
| StatementKind::Nop
| StatementKind::FakeRead(..)
| StatementKind::Retag { .. }
| StatementKind::AscribeUserType(..) => {}
StatementKind::InlineAsm(asm) => {
use syntax::ast::Name;
let InlineAsm { asm, outputs: _, inputs: _ } = &**asm;
let rustc::hir::InlineAsm {
asm: asm_code, // Name
outputs, // Vec<Name>
inputs, // Vec<Name>
clobbers, // Vec<Name>
volatile, // bool
alignstack, // bool
dialect, // syntax::ast::AsmDialect
asm_str_style: _,
ctxt: _,
} = asm;
match &*asm_code.as_str() {
"cpuid" | "cpuid\n" => {
assert_eq!(inputs, &[Name::intern("{eax}"), Name::intern("{ecx}")]);
assert_eq!(outputs.len(), 4);
for (i, c) in (&["={eax}", "={ebx}", "={ecx}", "={edx}"]).iter().enumerate() {
assert_eq!(&outputs[i].constraint.as_str(), c);
assert!(!outputs[i].is_rw);
assert!(!outputs[i].is_indirect);
}
assert_eq!(clobbers, &[Name::intern("rbx")]);
assert!(!volatile);
assert!(!alignstack);
crate::trap::trap_unimplemented(fx, "__cpuid_count arch intrinsic is not supported");
}
"xgetbv" => {
assert_eq!(inputs, &[Name::intern("{ecx}")]);
assert_eq!(outputs.len(), 2);
for (i, c) in (&["={eax}", "={edx}"]).iter().enumerate() {
assert_eq!(&outputs[i].constraint.as_str(), c);
assert!(!outputs[i].is_rw);
assert!(!outputs[i].is_indirect);
}
assert_eq!(clobbers, &[]);
assert!(!volatile);
assert!(!alignstack);
crate::trap::trap_unimplemented(fx, "_xgetbv arch intrinsic is not supported");
}
_ => unimpl!("Inline assembly is not supported"),
}
}
2018-06-17 11:05:11 -05:00
}
}
fn codegen_array_len<'a, 'tcx: 'a>(
fx: &mut FunctionCx<'a, 'tcx, impl Backend>,
place: CPlace<'tcx>,
) -> Value {
match place.layout().ty.sty {
ty::Array(_elem_ty, len) => {
let len = crate::constant::force_eval_const(fx, len).unwrap_usize(fx.tcx) as i64;
fx.bcx.ins().iconst(fx.pointer_type, len)
}
2019-02-21 08:06:09 -06:00
ty::Slice(_elem_ty) => place
.to_addr_maybe_unsized(fx)
.1
.expect("Length metadata for slice place"),
_ => bug!("Rvalue::Len({:?})", place),
}
}
pub fn trans_get_discriminant<'a, 'tcx: 'a>(
2018-08-14 13:31:16 -05:00
fx: &mut FunctionCx<'a, 'tcx, impl Backend>,
place: CPlace<'tcx>,
dest_layout: TyLayout<'tcx>,
) -> CValue<'tcx> {
let layout = place.layout();
if layout.abi == layout::Abi::Uninhabited {
2019-03-23 07:06:35 -05:00
return trap_unreachable_ret_value(fx, dest_layout, "[panic] Tried to get discriminant for uninhabited type.");
}
let (discr_scalar, discr_index, discr_kind) = match &layout.variants {
layout::Variants::Single { index } => {
2018-11-24 05:47:53 -06:00
let discr_val = layout
.ty
.ty_adt_def()
.map_or(index.as_u32() as u128, |def| {
def.discriminant_for_variant(fx.tcx, *index).val
2018-11-24 05:47:53 -06:00
});
return CValue::const_val(fx, dest_layout.ty, discr_val as u64 as i64);
}
layout::Variants::Multiple { discr, discr_index, discr_kind, variants: _ } => {
(discr, *discr_index, discr_kind)
}
};
let discr = place.place_field(fx, mir::Field::new(discr_index)).to_cvalue(fx);
let discr_ty = discr.layout().ty;
let lldiscr = discr.load_scalar(fx);
match discr_kind {
layout::DiscriminantKind::Tag => {
let signed = match discr_scalar.value {
layout::Int(_, signed) => signed,
_ => false,
};
2018-11-12 09:23:39 -06:00
let val = clif_intcast(fx, lldiscr, fx.clif_type(dest_layout.ty).unwrap(), signed);
2019-06-11 08:32:30 -05:00
return CValue::by_val(val, dest_layout);
}
layout::DiscriminantKind::Niche {
dataful_variant,
ref niche_variants,
niche_start,
} => {
2018-11-12 09:23:39 -06:00
let niche_llty = fx.clif_type(discr_ty).unwrap();
let dest_clif_ty = fx.clif_type(dest_layout.ty).unwrap();
if niche_variants.start() == niche_variants.end() {
let b = fx
.bcx
.ins()
.icmp_imm(IntCC::Equal, lldiscr, *niche_start as u64 as i64);
let if_true = fx
.bcx
.ins()
.iconst(dest_clif_ty, niche_variants.start().as_u32() as i64);
let if_false = fx
.bcx
.ins()
.iconst(dest_clif_ty, dataful_variant.as_u32() as i64);
let val = fx.bcx.ins().select(b, if_true, if_false);
2019-06-11 08:32:30 -05:00
return CValue::by_val(val, dest_layout);
} else {
// Rebase from niche values to discriminant values.
let delta = niche_start.wrapping_sub(niche_variants.start().as_u32() as u128);
let delta = fx.bcx.ins().iconst(niche_llty, delta as u64 as i64);
let lldiscr = fx.bcx.ins().isub(lldiscr, delta);
let b = fx.bcx.ins().icmp_imm(
IntCC::UnsignedLessThanOrEqual,
lldiscr,
niche_variants.end().as_u32() as i64,
);
2018-08-14 05:13:07 -05:00
let if_true =
2018-11-12 09:23:39 -06:00
clif_intcast(fx, lldiscr, fx.clif_type(dest_layout.ty).unwrap(), false);
let if_false = fx
.bcx
.ins()
.iconst(dest_clif_ty, dataful_variant.as_u32() as i64);
let val = fx.bcx.ins().select(b, if_true, if_false);
2019-06-11 08:32:30 -05:00
return CValue::by_val(val, dest_layout);
}
}
}
}
2018-07-18 08:17:22 -05:00
macro_rules! binop_match {
(@single $fx:expr, $bug_fmt:expr, $var:expr, $signed:expr, $lhs:expr, $rhs:expr, $ret_ty:expr, bug) => {
bug!("binop {} on {} lhs: {:?} rhs: {:?}", stringify!($var), $bug_fmt, $lhs, $rhs)
2018-07-18 08:17:22 -05:00
};
(@single $fx:expr, $bug_fmt:expr, $var:expr, $signed:expr, $lhs:expr, $rhs:expr, $ret_ty:expr, icmp($cc:ident)) => {{
2018-07-30 08:34:34 -05:00
assert_eq!($fx.tcx.types.bool, $ret_ty);
let ret_layout = $fx.layout_of($ret_ty);
let b = $fx.bcx.ins().icmp(IntCC::$cc, $lhs, $rhs);
2019-06-11 08:32:30 -05:00
CValue::by_val($fx.bcx.ins().bint(types::I8, b), ret_layout)
2018-07-18 08:17:22 -05:00
}};
(@single $fx:expr, $bug_fmt:expr, $var:expr, $signed:expr, $lhs:expr, $rhs:expr, $ret_ty:expr, fcmp($cc:ident)) => {{
2018-07-30 08:34:34 -05:00
assert_eq!($fx.tcx.types.bool, $ret_ty);
let ret_layout = $fx.layout_of($ret_ty);
2018-07-29 10:09:17 -05:00
let b = $fx.bcx.ins().fcmp(FloatCC::$cc, $lhs, $rhs);
2019-06-11 08:32:30 -05:00
CValue::by_val($fx.bcx.ins().bint(types::I8, b), ret_layout)
2018-07-30 08:34:34 -05:00
}};
(@single $fx:expr, $bug_fmt:expr, $var:expr, $signed:expr, $lhs:expr, $rhs:expr, $ret_ty:expr, custom(|| $body:expr)) => {{
2018-07-30 08:34:34 -05:00
$body
}};
(@single $fx:expr, $bug_fmt:expr, $var:expr, $signed:expr, $lhs:expr, $rhs:expr, $ret_ty:expr, $name:ident) => {{
2018-07-30 08:34:34 -05:00
let ret_layout = $fx.layout_of($ret_ty);
2019-06-11 08:32:30 -05:00
CValue::by_val($fx.bcx.ins().$name($lhs, $rhs), ret_layout)
2018-07-29 10:09:17 -05:00
}};
2018-07-18 08:17:22 -05:00
(
2018-07-30 08:34:34 -05:00
$fx:expr, $bin_op:expr, $signed:expr, $lhs:expr, $rhs:expr, $ret_ty:expr, $bug_fmt:expr;
2018-07-18 08:17:22 -05:00
$(
2018-07-30 08:34:34 -05:00
$var:ident ($sign:pat) $name:tt $( ( $($next:tt)* ) )? ;
2018-07-18 08:17:22 -05:00
)*
2018-07-30 08:34:34 -05:00
) => {{
let lhs = $lhs.load_scalar($fx);
let rhs = $rhs.load_scalar($fx);
2018-07-18 08:17:22 -05:00
match ($bin_op, $signed) {
$(
(BinOp::$var, $sign) => binop_match!(@single $fx, $bug_fmt, $var, $signed, lhs, rhs, $ret_ty, $name $( ( $($next)* ) )?),
2018-07-18 08:17:22 -05:00
)*
}
2018-07-30 08:34:34 -05:00
}}
2018-07-18 08:17:22 -05:00
}
fn trans_bool_binop<'a, 'tcx: 'a>(
2018-08-14 13:31:16 -05:00
fx: &mut FunctionCx<'a, 'tcx, impl Backend>,
bin_op: BinOp,
lhs: CValue<'tcx>,
rhs: CValue<'tcx>,
ty: Ty<'tcx>,
) -> CValue<'tcx> {
2018-07-26 03:59:57 -05:00
let res = binop_match! {
2018-07-30 08:34:34 -05:00
fx, bin_op, false, lhs, rhs, ty, "bool";
2018-07-26 03:59:57 -05:00
Add (_) bug;
Sub (_) bug;
Mul (_) bug;
Div (_) bug;
Rem (_) bug;
BitXor (_) bxor;
BitAnd (_) band;
BitOr (_) bor;
Shl (_) bug;
Shr (_) bug;
Eq (_) icmp(Equal);
Lt (_) icmp(UnsignedLessThan);
Le (_) icmp(UnsignedLessThanOrEqual);
Ne (_) icmp(NotEqual);
Ge (_) icmp(UnsignedGreaterThanOrEqual);
Gt (_) icmp(UnsignedGreaterThan);
Offset (_) bug;
};
2018-07-30 08:34:34 -05:00
res
2018-07-26 03:59:57 -05:00
}
pub fn trans_int_binop<'a, 'tcx: 'a>(
2018-08-14 13:31:16 -05:00
fx: &mut FunctionCx<'a, 'tcx, impl Backend>,
bin_op: BinOp,
lhs: CValue<'tcx>,
rhs: CValue<'tcx>,
out_ty: Ty<'tcx>,
signed: bool,
) -> CValue<'tcx> {
if bin_op != BinOp::Shl && bin_op != BinOp::Shr {
2018-08-08 05:45:34 -05:00
assert_eq!(
lhs.layout().ty,
rhs.layout().ty,
"int binop requires lhs and rhs of same type"
);
}
binop_match! {
fx, bin_op, signed, lhs, rhs, out_ty, "int/uint";
2018-07-18 08:17:22 -05:00
Add (_) iadd;
Sub (_) isub;
Mul (_) imul;
Div (false) udiv;
Div (true) sdiv;
Rem (false) urem;
Rem (true) srem;
BitXor (_) bxor;
BitAnd (_) band;
BitOr (_) bor;
Shl (_) ishl;
Shr (false) ushr;
Shr (true) sshr;
Eq (_) icmp(Equal);
Lt (false) icmp(UnsignedLessThan);
Lt (true) icmp(SignedLessThan);
Le (false) icmp(UnsignedLessThanOrEqual);
Le (true) icmp(SignedLessThanOrEqual);
Ne (_) icmp(NotEqual);
Ge (false) icmp(UnsignedGreaterThanOrEqual);
Ge (true) icmp(SignedGreaterThanOrEqual);
Gt (false) icmp(UnsignedGreaterThan);
Gt (true) icmp(SignedGreaterThan);
Offset (_) bug;
}
}
pub fn trans_checked_int_binop<'a, 'tcx: 'a>(
2018-08-14 13:31:16 -05:00
fx: &mut FunctionCx<'a, 'tcx, impl Backend>,
bin_op: BinOp,
2018-08-22 05:35:07 -05:00
in_lhs: CValue<'tcx>,
in_rhs: CValue<'tcx>,
out_ty: Ty<'tcx>,
signed: bool,
) -> CValue<'tcx> {
if bin_op != BinOp::Shl && bin_op != BinOp::Shr {
2018-08-08 05:45:34 -05:00
assert_eq!(
2018-08-22 05:35:07 -05:00
in_lhs.layout().ty,
in_rhs.layout().ty,
2018-08-08 05:45:34 -05:00
"checked int binop requires lhs and rhs of same type"
);
}
2018-07-18 08:17:22 -05:00
let lhs = in_lhs.load_scalar(fx);
let rhs = in_rhs.load_scalar(fx);
2018-08-22 05:35:07 -05:00
let res = match bin_op {
BinOp::Add => fx.bcx.ins().iadd(lhs, rhs),
BinOp::Sub => fx.bcx.ins().isub(lhs, rhs),
BinOp::Mul => fx.bcx.ins().imul(lhs, rhs),
BinOp::Shl => fx.bcx.ins().ishl(lhs, rhs),
2018-10-10 12:07:13 -05:00
BinOp::Shr => {
if !signed {
fx.bcx.ins().ushr(lhs, rhs)
} else {
fx.bcx.ins().sshr(lhs, rhs)
}
}
2018-08-22 05:35:07 -05:00
_ => bug!(
"binop {:?} on checked int/uint lhs: {:?} rhs: {:?}",
bin_op,
in_lhs,
in_rhs
),
};
// TODO: check for overflow
2018-08-22 05:35:07 -05:00
let has_overflow = fx.bcx.ins().iconst(types::I8, 0);
2019-02-04 12:27:58 -06:00
let out_place = CPlace::new_stack_slot(fx, out_ty);
2018-08-22 05:35:07 -05:00
let out_layout = out_place.layout();
out_place.write_cvalue(fx, CValue::by_val_pair(res, has_overflow, out_layout));
out_place.to_cvalue(fx)
2018-07-18 08:17:22 -05:00
}
fn trans_float_binop<'a, 'tcx: 'a>(
2018-08-14 13:31:16 -05:00
fx: &mut FunctionCx<'a, 'tcx, impl Backend>,
bin_op: BinOp,
lhs: CValue<'tcx>,
rhs: CValue<'tcx>,
ty: Ty<'tcx>,
) -> CValue<'tcx> {
2018-07-29 10:09:17 -05:00
let res = binop_match! {
2018-07-30 08:34:34 -05:00
fx, bin_op, false, lhs, rhs, ty, "float";
2018-07-29 10:09:17 -05:00
Add (_) fadd;
Sub (_) fsub;
Mul (_) fmul;
Div (_) fdiv;
2018-07-30 08:34:34 -05:00
Rem (_) custom(|| {
assert_eq!(lhs.layout().ty, ty);
assert_eq!(rhs.layout().ty, ty);
match ty.sty {
ty::Float(FloatTy::F32) => fx.easy_call("fmodf", &[lhs, rhs], ty),
ty::Float(FloatTy::F64) => fx.easy_call("fmod", &[lhs, rhs], ty),
2018-07-30 08:34:34 -05:00
_ => bug!(),
}
});
2018-07-29 10:09:17 -05:00
BitXor (_) bxor;
BitAnd (_) band;
BitOr (_) bor;
Shl (_) bug;
Shr (_) bug;
Eq (_) fcmp(Equal);
Lt (_) fcmp(LessThan);
Le (_) fcmp(LessThanOrEqual);
Ne (_) fcmp(NotEqual);
Ge (_) fcmp(GreaterThanOrEqual);
Gt (_) fcmp(GreaterThan);
Offset (_) bug;
};
2018-07-30 08:34:34 -05:00
res
2018-07-29 10:09:17 -05:00
}
fn trans_char_binop<'a, 'tcx: 'a>(
2018-08-14 13:31:16 -05:00
fx: &mut FunctionCx<'a, 'tcx, impl Backend>,
bin_op: BinOp,
lhs: CValue<'tcx>,
rhs: CValue<'tcx>,
ty: Ty<'tcx>,
) -> CValue<'tcx> {
2018-07-26 03:48:50 -05:00
let res = binop_match! {
2018-07-30 08:34:34 -05:00
fx, bin_op, false, lhs, rhs, ty, "char";
2018-07-26 03:48:50 -05:00
Add (_) bug;
Sub (_) bug;
Mul (_) bug;
Div (_) bug;
Rem (_) bug;
BitXor (_) bug;
BitAnd (_) bug;
BitOr (_) bug;
Shl (_) bug;
Shr (_) bug;
Eq (_) icmp(Equal);
Lt (_) icmp(UnsignedLessThan);
Le (_) icmp(UnsignedLessThanOrEqual);
Ne (_) icmp(NotEqual);
Ge (_) icmp(UnsignedGreaterThanOrEqual);
Gt (_) icmp(UnsignedGreaterThan);
Offset (_) bug;
};
2018-07-30 08:34:34 -05:00
res
2018-07-26 03:48:50 -05:00
}
fn trans_ptr_binop<'a, 'tcx: 'a>(
2018-08-14 13:31:16 -05:00
fx: &mut FunctionCx<'a, 'tcx, impl Backend>,
bin_op: BinOp,
lhs: CValue<'tcx>,
rhs: CValue<'tcx>,
ret_ty: Ty<'tcx>,
) -> CValue<'tcx> {
let not_fat = match lhs.layout().ty.sty {
2019-02-21 08:06:09 -06:00
ty::RawPtr(TypeAndMut { ty, mutbl: _ }) => {
ty.is_sized(fx.tcx.at(DUMMY_SP), ParamEnv::reveal_all())
}
ty::FnPtr(..) => true,
_ => bug!("trans_ptr_binop on non ptr"),
};
if not_fat {
2019-02-16 07:02:15 -06:00
if let BinOp::Offset = bin_op {
let (base, offset) = (lhs, rhs.load_scalar(fx));
let pointee_ty = base.layout().ty.builtin_deref(true).unwrap().ty;
let pointee_size = fx.layout_of(pointee_ty).size.bytes();
let ptr_diff = fx.bcx.ins().imul_imm(offset, pointee_size as i64);
let base_val = base.load_scalar(fx);
let res = fx.bcx.ins().iadd(base_val, ptr_diff);
2019-06-11 08:32:30 -05:00
return CValue::by_val(res, base.layout());
2019-02-16 07:02:15 -06:00
}
binop_match! {
fx, bin_op, false, lhs, rhs, ret_ty, "ptr";
Add (_) bug;
Sub (_) bug;
Mul (_) bug;
Div (_) bug;
Rem (_) bug;
BitXor (_) bug;
BitAnd (_) bug;
BitOr (_) bug;
Shl (_) bug;
Shr (_) bug;
Eq (_) icmp(Equal);
Lt (_) icmp(UnsignedLessThan);
Le (_) icmp(UnsignedLessThanOrEqual);
Ne (_) icmp(NotEqual);
Ge (_) icmp(UnsignedGreaterThanOrEqual);
Gt (_) icmp(UnsignedGreaterThan);
2019-02-16 07:02:15 -06:00
Offset (_) bug; // Handled above
}
} else {
let (lhs_ptr, lhs_extra) = lhs.load_scalar_pair(fx);
let (rhs_ptr, rhs_extra) = rhs.load_scalar_pair(fx);
let res = match bin_op {
2019-02-16 06:49:42 -06:00
BinOp::Eq => {
let ptr_eq = fx.bcx.ins().icmp(IntCC::Equal, lhs_ptr, rhs_ptr);
let extra_eq = fx.bcx.ins().icmp(IntCC::Equal, lhs_extra, rhs_extra);
fx.bcx.ins().band(ptr_eq, extra_eq)
}
BinOp::Ne => {
let ptr_ne = fx.bcx.ins().icmp(IntCC::NotEqual, lhs_ptr, rhs_ptr);
let extra_ne = fx.bcx.ins().icmp(IntCC::NotEqual, lhs_extra, rhs_extra);
fx.bcx.ins().bor(ptr_ne, extra_ne)
}
BinOp::Lt | BinOp::Le | BinOp::Ge | BinOp::Gt => {
let ptr_eq = fx.bcx.ins().icmp(IntCC::Equal, lhs_ptr, rhs_ptr);
let ptr_cmp = fx.bcx.ins().icmp(match bin_op {
BinOp::Lt => IntCC::UnsignedLessThan,
BinOp::Le => IntCC::UnsignedLessThanOrEqual,
BinOp::Ge => IntCC::UnsignedGreaterThanOrEqual,
BinOp::Gt => IntCC::UnsignedGreaterThan,
_ => unreachable!(),
}, lhs_ptr, rhs_ptr);
let extra_cmp = fx.bcx.ins().icmp(match bin_op {
BinOp::Lt => IntCC::UnsignedLessThan,
BinOp::Le => IntCC::UnsignedLessThanOrEqual,
BinOp::Ge => IntCC::UnsignedGreaterThanOrEqual,
BinOp::Gt => IntCC::UnsignedGreaterThan,
_ => unreachable!(),
}, lhs_extra, rhs_extra);
fx.bcx.ins().select(ptr_eq, extra_cmp, ptr_cmp)
}
_ => panic!("bin_op {:?} on ptr", bin_op),
};
assert_eq!(fx.tcx.types.bool, ret_ty);
let ret_layout = fx.layout_of(ret_ty);
2019-06-11 08:32:30 -05:00
CValue::by_val(fx.bcx.ins().bint(types::I8, res), ret_layout)
}
2018-06-27 08:47:58 -05:00
}
pub fn trans_place<'a, 'tcx: 'a>(
2018-08-14 13:31:16 -05:00
fx: &mut FunctionCx<'a, 'tcx, impl Backend>,
place: &Place<'tcx>,
) -> CPlace<'tcx> {
2018-06-17 11:05:11 -05:00
match place {
Place::Base(base) => match base {
PlaceBase::Local(local) => fx.get_local_place(*local),
PlaceBase::Static(static_) => match static_.kind {
StaticKind::Static(def_id) => {
crate::constant::codegen_static_ref(fx, def_id, static_.ty)
}
StaticKind::Promoted(promoted) => {
crate::constant::trans_promoted(fx, promoted, static_.ty)
}
}
}
2018-06-17 11:05:11 -05:00
Place::Projection(projection) => {
2018-06-23 11:26:54 -05:00
let base = trans_place(fx, &projection.base);
2018-06-17 11:05:11 -05:00
match projection.elem {
2018-08-22 08:38:10 -05:00
ProjectionElem::Deref => base.place_deref(fx),
ProjectionElem::Field(field, _ty) => base.place_field(fx, field),
ProjectionElem::Index(local) => {
let index = fx.get_local_place(local).to_cvalue(fx).load_scalar(fx);
2018-08-08 05:22:16 -05:00
base.place_index(fx, index)
2018-06-17 11:05:11 -05:00
}
ProjectionElem::ConstantIndex {
offset,
min_length: _,
from_end,
} => {
let index = if !from_end {
fx.bcx.ins().iconst(fx.pointer_type, offset as i64)
} else {
let len = codegen_array_len(fx, base);
fx.bcx.ins().iadd_imm(len, -(offset as i64))
};
base.place_index(fx, index)
}
2019-02-24 05:38:06 -06:00
ProjectionElem::Subslice { from, to } => {
// These indices are generated by slice patterns.
// slice[from:-to] in Python terms.
match base.layout().ty.sty {
ty::Array(elem_ty, len) => {
let elem_layout = fx.layout_of(elem_ty);
let ptr = base.to_addr(fx);
let len = crate::constant::force_eval_const(fx, len).unwrap_usize(fx.tcx);
2019-06-11 09:30:47 -05:00
CPlace::for_addr(
2019-02-24 05:38:06 -06:00
fx.bcx.ins().iadd_imm(ptr, elem_layout.size.bytes() as i64 * from as i64),
fx.layout_of(fx.tcx.mk_array(elem_ty, len - from as u64 - to as u64)),
)
}
ty::Slice(elem_ty) => {
let elem_layout = fx.layout_of(elem_ty);
let (ptr, len) = base.to_addr_maybe_unsized(fx);
let len = len.unwrap();
2019-06-11 09:30:47 -05:00
CPlace::for_addr_with_extra(
2019-02-24 05:38:06 -06:00
fx.bcx.ins().iadd_imm(ptr, elem_layout.size.bytes() as i64 * from as i64),
2019-06-11 09:30:47 -05:00
fx.bcx.ins().iadd_imm(len, -(from as i64 + to as i64)),
2019-02-24 05:38:06 -06:00
base.layout(),
)
}
_ => unreachable!(),
}
}
ProjectionElem::Downcast(_adt_def, variant) => base.downcast_variant(fx, variant),
2018-06-17 11:05:11 -05:00
}
}
}
}
pub fn trans_operand<'a, 'tcx>(
2018-08-14 13:31:16 -05:00
fx: &mut FunctionCx<'a, 'tcx, impl Backend>,
operand: &Operand<'tcx>,
) -> CValue<'tcx> {
2018-06-17 11:05:11 -05:00
match operand {
Operand::Move(place) | Operand::Copy(place) => {
let cplace = trans_place(fx, place);
cplace.to_cvalue(fx)
2018-06-17 11:05:11 -05:00
}
Operand::Constant(const_) => crate::constant::trans_constant(fx, const_),
2018-06-17 11:05:11 -05:00
}
}