2012-12-03 18:48:01 -06:00
|
|
|
// Copyright 2012 The Rust Project Developers. See the COPYRIGHT
|
|
|
|
// file at the top-level directory of this distribution and at
|
|
|
|
// http://rust-lang.org/COPYRIGHT.
|
|
|
|
//
|
|
|
|
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
|
|
|
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
|
|
|
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
|
|
|
// option. This file may not be copied, modified, or distributed
|
|
|
|
// except according to those terms.
|
|
|
|
|
2013-02-25 13:11:21 -06:00
|
|
|
use lib::llvm::*;
|
2013-07-15 22:42:13 -05:00
|
|
|
use middle::lang_items::{FailFnLangItem, FailBoundsCheckFnLangItem};
|
2012-12-13 15:05:22 -06:00
|
|
|
use middle::trans::base::*;
|
2013-02-25 13:11:21 -06:00
|
|
|
use middle::trans::build::*;
|
2012-12-23 16:41:37 -06:00
|
|
|
use middle::trans::callee;
|
2012-12-13 15:05:22 -06:00
|
|
|
use middle::trans::common::*;
|
2013-11-18 09:56:44 -06:00
|
|
|
use middle::trans::debuginfo;
|
2013-02-25 13:11:21 -06:00
|
|
|
use middle::trans::expr;
|
|
|
|
use middle::ty;
|
|
|
|
use util::common::indenter;
|
|
|
|
use util::ppaux;
|
2012-08-28 17:54:45 -05:00
|
|
|
|
2013-06-16 05:52:44 -05:00
|
|
|
use middle::trans::type_::Type;
|
|
|
|
|
2013-02-25 13:11:21 -06:00
|
|
|
use syntax::ast;
|
2013-09-10 14:01:44 -05:00
|
|
|
use syntax::ast::Name;
|
2013-02-25 13:11:21 -06:00
|
|
|
use syntax::ast_util;
|
2013-08-31 11:13:04 -05:00
|
|
|
use syntax::codemap::Span;
|
2013-09-24 20:18:40 -05:00
|
|
|
use syntax::visit::Visitor;
|
2012-12-23 16:41:37 -06:00
|
|
|
|
2014-01-07 10:54:58 -06:00
|
|
|
pub fn trans_block<'a>(bcx: &'a Block<'a>, b: &ast::Block, dest: expr::Dest)
|
|
|
|
-> &'a Block<'a> {
|
2013-06-16 23:23:24 -05:00
|
|
|
let _icx = push_ctxt("trans_block");
|
2012-08-28 17:54:45 -05:00
|
|
|
let mut bcx = bcx;
|
2013-08-03 11:45:23 -05:00
|
|
|
for s in b.stmts.iter() {
|
2013-04-17 11:15:37 -05:00
|
|
|
bcx = trans_stmt(bcx, *s);
|
2012-08-28 17:54:45 -05:00
|
|
|
}
|
2013-07-16 13:08:35 -05:00
|
|
|
match b.expr {
|
2012-08-28 17:54:45 -05:00
|
|
|
Some(e) => {
|
|
|
|
bcx = expr::trans_into(bcx, e, dest);
|
|
|
|
}
|
|
|
|
None => {
|
2013-12-18 16:54:42 -06:00
|
|
|
assert!(dest == expr::Ignore || bcx.unreachable.get());
|
2012-08-28 17:54:45 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return bcx;
|
|
|
|
}
|
|
|
|
|
2014-01-07 10:54:58 -06:00
|
|
|
pub fn trans_if<'a>(
|
|
|
|
bcx: &'a Block<'a>,
|
|
|
|
cond: &ast::Expr,
|
|
|
|
thn: ast::P<ast::Block>,
|
|
|
|
els: Option<@ast::Expr>,
|
|
|
|
dest: expr::Dest)
|
|
|
|
-> &'a Block<'a> {
|
2013-10-21 15:08:31 -05:00
|
|
|
debug!("trans_if(bcx={}, cond={}, thn={:?}, dest={})",
|
2013-07-16 13:08:35 -05:00
|
|
|
bcx.to_str(), bcx.expr_to_str(cond), thn.id,
|
2012-08-28 17:54:45 -05:00
|
|
|
dest.to_str(bcx.ccx()));
|
|
|
|
let _indenter = indenter();
|
|
|
|
|
2013-06-16 23:23:24 -05:00
|
|
|
let _icx = push_ctxt("trans_if");
|
2013-07-17 03:13:41 -05:00
|
|
|
|
2013-07-25 03:53:27 -05:00
|
|
|
let Result {bcx, val: cond_val} =
|
|
|
|
expr::trans_to_datum(bcx, cond).to_result();
|
|
|
|
|
|
|
|
let cond_val = bool_to_i1(bcx, cond_val);
|
|
|
|
|
|
|
|
// Drop branches that are known to be impossible
|
|
|
|
if is_const(cond_val) && !is_undef(cond_val) {
|
|
|
|
if const_to_uint(cond_val) == 1 {
|
2013-09-24 20:18:40 -05:00
|
|
|
match els {
|
|
|
|
Some(elexpr) => {
|
|
|
|
let mut trans = TransItemVisitor { ccx: bcx.fcx.ccx };
|
|
|
|
trans.visit_expr(elexpr, ());
|
|
|
|
}
|
|
|
|
None => {}
|
|
|
|
}
|
2013-07-25 03:53:27 -05:00
|
|
|
// if true { .. } [else { .. }]
|
2013-11-21 17:42:55 -06:00
|
|
|
return with_scope(bcx, thn.info(), "if_true_then", |bcx| {
|
2013-07-25 10:03:46 -05:00
|
|
|
let bcx_out = trans_block(bcx, thn, dest);
|
2013-11-18 09:56:44 -06:00
|
|
|
debuginfo::clear_source_location(bcx.fcx);
|
2013-11-30 02:26:21 -06:00
|
|
|
bcx_out
|
2013-11-21 17:42:55 -06:00
|
|
|
})
|
2013-07-25 03:53:27 -05:00
|
|
|
} else {
|
2013-09-24 20:18:40 -05:00
|
|
|
let mut trans = TransItemVisitor { ccx: bcx.fcx.ccx } ;
|
|
|
|
trans.visit_block(thn, ());
|
|
|
|
|
2013-07-25 03:53:27 -05:00
|
|
|
match els {
|
|
|
|
// if false { .. } else { .. }
|
|
|
|
Some(elexpr) => {
|
2013-11-21 17:42:55 -06:00
|
|
|
return with_scope(bcx,
|
|
|
|
elexpr.info(),
|
|
|
|
"if_false_then",
|
|
|
|
|bcx| {
|
2013-11-30 02:26:21 -06:00
|
|
|
let bcx_out = trans_if_else(bcx, elexpr, dest, false);
|
2013-11-18 09:56:44 -06:00
|
|
|
debuginfo::clear_source_location(bcx.fcx);
|
2013-11-30 02:26:21 -06:00
|
|
|
bcx_out
|
2013-11-21 17:42:55 -06:00
|
|
|
})
|
2013-07-17 03:13:41 -05:00
|
|
|
}
|
2013-07-25 03:53:27 -05:00
|
|
|
// if false { .. }
|
|
|
|
None => return bcx,
|
2013-07-17 03:13:41 -05:00
|
|
|
}
|
2013-07-25 03:53:27 -05:00
|
|
|
}
|
2013-07-17 03:13:41 -05:00
|
|
|
}
|
|
|
|
|
2013-05-02 03:16:07 -05:00
|
|
|
let then_bcx_in = scope_block(bcx, thn.info(), "then");
|
2013-02-06 16:28:02 -06:00
|
|
|
|
2012-08-28 17:54:45 -05:00
|
|
|
let then_bcx_out = trans_block(then_bcx_in, thn, dest);
|
2013-11-18 09:56:44 -06:00
|
|
|
|
|
|
|
debuginfo::clear_source_location(bcx.fcx);
|
2012-08-28 17:54:45 -05:00
|
|
|
let then_bcx_out = trans_block_cleanups(then_bcx_out,
|
|
|
|
block_cleanups(then_bcx_in));
|
|
|
|
|
|
|
|
// Calling trans_block directly instead of trans_expr
|
|
|
|
// because trans_expr will create another scope block
|
|
|
|
// context for the block, but we've already got the
|
|
|
|
// 'else' context
|
2013-07-12 21:10:41 -05:00
|
|
|
let (else_bcx_in, next_bcx) = match els {
|
2012-08-28 17:54:45 -05:00
|
|
|
Some(elexpr) => {
|
2013-07-25 10:03:46 -05:00
|
|
|
let else_bcx_in = scope_block(bcx, elexpr.info(), "else");
|
2013-11-30 02:26:21 -06:00
|
|
|
let else_bcx_out = trans_if_else(else_bcx_in, elexpr, dest, true);
|
2013-07-17 03:13:41 -05:00
|
|
|
(else_bcx_in, join_blocks(bcx, [then_bcx_out, else_bcx_out]))
|
2013-07-12 21:10:41 -05:00
|
|
|
}
|
|
|
|
_ => {
|
|
|
|
let next_bcx = sub_block(bcx, "next");
|
|
|
|
Br(then_bcx_out, next_bcx.llbb);
|
|
|
|
|
|
|
|
(next_bcx, next_bcx)
|
2012-08-28 17:54:45 -05:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2013-10-21 15:08:31 -05:00
|
|
|
debug!("then_bcx_in={}, else_bcx_in={}",
|
2013-07-12 21:10:41 -05:00
|
|
|
then_bcx_in.to_str(), else_bcx_in.to_str());
|
|
|
|
|
2013-11-18 09:56:44 -06:00
|
|
|
// Clear the source location because it is still set to whatever has been translated
|
|
|
|
// right before.
|
|
|
|
debuginfo::clear_source_location(else_bcx_in.fcx);
|
2013-07-12 21:10:41 -05:00
|
|
|
CondBr(bcx, cond_val, then_bcx_in.llbb, else_bcx_in.llbb);
|
2013-07-17 03:13:41 -05:00
|
|
|
return next_bcx;
|
|
|
|
|
|
|
|
// trans `else [ if { .. } ... | { .. } ]`
|
2014-01-07 10:54:58 -06:00
|
|
|
fn trans_if_else<'a>(
|
|
|
|
else_bcx_in: &'a Block<'a>,
|
|
|
|
elexpr: @ast::Expr,
|
|
|
|
dest: expr::Dest,
|
|
|
|
cleanup: bool)
|
|
|
|
-> &'a Block<'a> {
|
2013-07-17 03:13:41 -05:00
|
|
|
let else_bcx_out = match elexpr.node {
|
2013-09-01 20:45:37 -05:00
|
|
|
ast::ExprIf(_, _, _) => {
|
2013-07-17 03:13:41 -05:00
|
|
|
let elseif_blk = ast_util::block_from_expr(elexpr);
|
2013-11-30 16:00:39 -06:00
|
|
|
trans_block(else_bcx_in, elseif_blk, dest)
|
2013-07-17 03:13:41 -05:00
|
|
|
}
|
2013-11-30 16:00:39 -06:00
|
|
|
ast::ExprBlock(blk) => {
|
2013-07-17 03:13:41 -05:00
|
|
|
trans_block(else_bcx_in, blk, dest)
|
|
|
|
}
|
|
|
|
// would be nice to have a constraint on ifs
|
2013-07-25 10:03:46 -05:00
|
|
|
_ => else_bcx_in.tcx().sess.bug("strange alternative in if")
|
2013-07-17 03:13:41 -05:00
|
|
|
};
|
2013-11-30 02:26:21 -06:00
|
|
|
if cleanup {
|
|
|
|
debuginfo::clear_source_location(else_bcx_in.fcx);
|
|
|
|
trans_block_cleanups(else_bcx_out, block_cleanups(else_bcx_in))
|
|
|
|
} else {
|
|
|
|
else_bcx_out
|
|
|
|
}
|
2013-07-17 03:13:41 -05:00
|
|
|
}
|
2012-08-28 17:54:45 -05:00
|
|
|
}
|
|
|
|
|
2014-01-07 10:54:58 -06:00
|
|
|
pub fn join_blocks<'a>(
|
|
|
|
parent_bcx: &'a Block<'a>,
|
|
|
|
in_cxs: &[&'a Block<'a>])
|
|
|
|
-> &'a Block<'a> {
|
2013-05-02 03:16:07 -05:00
|
|
|
let out = sub_block(parent_bcx, "join");
|
2012-08-28 17:54:45 -05:00
|
|
|
let mut reachable = false;
|
2013-08-03 11:45:23 -05:00
|
|
|
for bcx in in_cxs.iter() {
|
2013-12-18 16:54:42 -06:00
|
|
|
if !bcx.unreachable.get() {
|
2012-09-18 23:41:37 -05:00
|
|
|
Br(*bcx, out.llbb);
|
2012-08-28 17:54:45 -05:00
|
|
|
reachable = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if !reachable {
|
|
|
|
Unreachable(out);
|
|
|
|
}
|
|
|
|
return out;
|
|
|
|
}
|
|
|
|
|
2014-01-07 10:54:58 -06:00
|
|
|
pub fn trans_while<'a>(
|
|
|
|
bcx: &'a Block<'a>,
|
|
|
|
cond: &ast::Expr,
|
|
|
|
body: &ast::Block)
|
|
|
|
-> &'a Block<'a> {
|
2013-06-16 23:23:24 -05:00
|
|
|
let _icx = push_ctxt("trans_while");
|
2013-05-02 03:16:07 -05:00
|
|
|
let next_bcx = sub_block(bcx, "while next");
|
2012-08-28 17:54:45 -05:00
|
|
|
|
|
|
|
// bcx
|
|
|
|
// |
|
|
|
|
// loop_bcx
|
|
|
|
// |
|
|
|
|
// cond_bcx_in <--------+
|
|
|
|
// | |
|
|
|
|
// cond_bcx_out |
|
|
|
|
// | | |
|
|
|
|
// | body_bcx_in |
|
|
|
|
// +------+ | |
|
|
|
|
// | body_bcx_out --+
|
|
|
|
// next_bcx
|
|
|
|
|
2013-05-02 03:16:07 -05:00
|
|
|
let loop_bcx = loop_scope_block(bcx, next_bcx, None, "`while`",
|
2012-10-18 14:20:18 -05:00
|
|
|
body.info());
|
2013-05-02 03:16:07 -05:00
|
|
|
let cond_bcx_in = scope_block(loop_bcx, cond.info(), "while loop cond");
|
|
|
|
let body_bcx_in = scope_block(loop_bcx, body.info(), "while loop body");
|
2012-08-28 17:54:45 -05:00
|
|
|
Br(bcx, loop_bcx.llbb);
|
|
|
|
Br(loop_bcx, cond_bcx_in.llbb);
|
|
|
|
|
|
|
|
// compile the condition
|
|
|
|
let Result {bcx: cond_bcx_out, val: cond_val} =
|
2012-09-11 23:25:01 -05:00
|
|
|
expr::trans_to_datum(cond_bcx_in, cond).to_result();
|
2013-02-06 16:28:02 -06:00
|
|
|
let cond_val = bool_to_i1(cond_bcx_out, cond_val);
|
2012-08-28 17:54:45 -05:00
|
|
|
let cond_bcx_out =
|
|
|
|
trans_block_cleanups(cond_bcx_out, block_cleanups(cond_bcx_in));
|
|
|
|
CondBr(cond_bcx_out, cond_val, body_bcx_in.llbb, next_bcx.llbb);
|
|
|
|
|
|
|
|
// loop body:
|
|
|
|
let body_bcx_out = trans_block(body_bcx_in, body, expr::Ignore);
|
|
|
|
cleanup_and_Br(body_bcx_out, body_bcx_in, cond_bcx_in.llbb);
|
|
|
|
|
|
|
|
return next_bcx;
|
|
|
|
}
|
|
|
|
|
2014-01-07 10:54:58 -06:00
|
|
|
pub fn trans_loop<'a>(
|
|
|
|
bcx: &'a Block<'a>,
|
2013-07-19 00:38:55 -05:00
|
|
|
body: &ast::Block,
|
2013-09-10 14:01:44 -05:00
|
|
|
opt_label: Option<Name>)
|
2014-01-07 10:54:58 -06:00
|
|
|
-> &'a Block<'a> {
|
2013-06-16 23:23:24 -05:00
|
|
|
let _icx = push_ctxt("trans_loop");
|
2013-05-02 03:16:07 -05:00
|
|
|
let next_bcx = sub_block(bcx, "next");
|
|
|
|
let body_bcx_in = loop_scope_block(bcx, next_bcx, opt_label, "`loop`",
|
2012-10-18 14:20:18 -05:00
|
|
|
body.info());
|
2012-08-28 17:54:45 -05:00
|
|
|
Br(bcx, body_bcx_in.llbb);
|
|
|
|
let body_bcx_out = trans_block(body_bcx_in, body, expr::Ignore);
|
|
|
|
cleanup_and_Br(body_bcx_out, body_bcx_in, body_bcx_in.llbb);
|
|
|
|
return next_bcx;
|
|
|
|
}
|
|
|
|
|
2014-01-07 10:54:58 -06:00
|
|
|
pub fn trans_break_cont<'a>(
|
|
|
|
bcx: &'a Block<'a>,
|
2013-09-10 14:01:44 -05:00
|
|
|
opt_label: Option<Name>,
|
2013-01-29 19:57:02 -06:00
|
|
|
to_end: bool)
|
2014-01-07 10:54:58 -06:00
|
|
|
-> &'a Block<'a> {
|
2013-06-16 23:23:24 -05:00
|
|
|
let _icx = push_ctxt("trans_break_cont");
|
2012-08-28 17:54:45 -05:00
|
|
|
// Locate closest loop block, outputting cleanup as we go.
|
|
|
|
let mut unwind = bcx;
|
2013-12-18 16:54:42 -06:00
|
|
|
let mut cur_scope = unwind.scope.get();
|
2013-07-12 03:56:40 -05:00
|
|
|
let mut target;
|
2012-08-28 17:54:45 -05:00
|
|
|
loop {
|
Implement scopes independent of LLVM basic blocks
Currently, scopes are tied to LLVM basic blocks. For each scope, there
are two new basic blocks, which means two extra jumps in the unoptimized
IR. These blocks aren't actually required, but only used to act as the
boundary for cleanups.
By keeping track of the current scope within a single basic block, we
can avoid those extra blocks and jumps, shrinking the pre-optimization
IR quite considerably. For example, the IR for trans_intrinsic goes
from ~22k lines to ~16k lines, almost 30% less.
The impact on the build times of optimized builds is rather small (about
1%), but unoptimized builds are about 11% faster. The testsuite for
unoptimized builds runs between 15% (CPU time) and 7.5% (wallclock time on
my i7) faster.
Also, in some situations this helps LLVM to generate better code by
inlining functions that it previously considered to be too large.
Likely because of the pointless blocks/jumps that were still present at
the time the inlining pass runs.
Refs #7462
2013-07-07 07:53:57 -05:00
|
|
|
cur_scope = match cur_scope {
|
2014-01-07 10:54:58 -06:00
|
|
|
Some(&ScopeInfo {
|
Implement scopes independent of LLVM basic blocks
Currently, scopes are tied to LLVM basic blocks. For each scope, there
are two new basic blocks, which means two extra jumps in the unoptimized
IR. These blocks aren't actually required, but only used to act as the
boundary for cleanups.
By keeping track of the current scope within a single basic block, we
can avoid those extra blocks and jumps, shrinking the pre-optimization
IR quite considerably. For example, the IR for trans_intrinsic goes
from ~22k lines to ~16k lines, almost 30% less.
The impact on the build times of optimized builds is rather small (about
1%), but unoptimized builds are about 11% faster. The testsuite for
unoptimized builds runs between 15% (CPU time) and 7.5% (wallclock time on
my i7) faster.
Also, in some situations this helps LLVM to generate better code by
inlining functions that it previously considered to be too large.
Likely because of the pointless blocks/jumps that were still present at
the time the inlining pass runs.
Refs #7462
2013-07-07 07:53:57 -05:00
|
|
|
loop_break: Some(brk),
|
|
|
|
loop_label: l,
|
|
|
|
parent,
|
2013-11-28 14:22:53 -06:00
|
|
|
..
|
Implement scopes independent of LLVM basic blocks
Currently, scopes are tied to LLVM basic blocks. For each scope, there
are two new basic blocks, which means two extra jumps in the unoptimized
IR. These blocks aren't actually required, but only used to act as the
boundary for cleanups.
By keeping track of the current scope within a single basic block, we
can avoid those extra blocks and jumps, shrinking the pre-optimization
IR quite considerably. For example, the IR for trans_intrinsic goes
from ~22k lines to ~16k lines, almost 30% less.
The impact on the build times of optimized builds is rather small (about
1%), but unoptimized builds are about 11% faster. The testsuite for
unoptimized builds runs between 15% (CPU time) and 7.5% (wallclock time on
my i7) faster.
Also, in some situations this helps LLVM to generate better code by
inlining functions that it previously considered to be too large.
Likely because of the pointless blocks/jumps that were still present at
the time the inlining pass runs.
Refs #7462
2013-07-07 07:53:57 -05:00
|
|
|
}) => {
|
|
|
|
// If we're looking for a labeled loop, check the label...
|
|
|
|
target = if to_end {
|
|
|
|
brk
|
|
|
|
} else {
|
|
|
|
unwind
|
|
|
|
};
|
|
|
|
match opt_label {
|
|
|
|
Some(desired) => match l {
|
|
|
|
Some(actual) if actual == desired => break,
|
|
|
|
// If it doesn't match the one we want,
|
|
|
|
// don't break
|
|
|
|
_ => parent,
|
|
|
|
},
|
|
|
|
None => break,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
Some(inf) => inf.parent,
|
|
|
|
None => {
|
|
|
|
unwind = match unwind.parent {
|
|
|
|
Some(bcx) => bcx,
|
|
|
|
// This is a return from a loop body block
|
|
|
|
None => {
|
2013-12-20 22:36:07 -06:00
|
|
|
Store(bcx,
|
|
|
|
C_bool(!to_end),
|
|
|
|
bcx.fcx.llretptr.get().unwrap());
|
2013-07-12 20:25:46 -05:00
|
|
|
cleanup_and_leave(bcx, None, Some(bcx.fcx.get_llreturn()));
|
Implement scopes independent of LLVM basic blocks
Currently, scopes are tied to LLVM basic blocks. For each scope, there
are two new basic blocks, which means two extra jumps in the unoptimized
IR. These blocks aren't actually required, but only used to act as the
boundary for cleanups.
By keeping track of the current scope within a single basic block, we
can avoid those extra blocks and jumps, shrinking the pre-optimization
IR quite considerably. For example, the IR for trans_intrinsic goes
from ~22k lines to ~16k lines, almost 30% less.
The impact on the build times of optimized builds is rather small (about
1%), but unoptimized builds are about 11% faster. The testsuite for
unoptimized builds runs between 15% (CPU time) and 7.5% (wallclock time on
my i7) faster.
Also, in some situations this helps LLVM to generate better code by
inlining functions that it previously considered to be too large.
Likely because of the pointless blocks/jumps that were still present at
the time the inlining pass runs.
Refs #7462
2013-07-07 07:53:57 -05:00
|
|
|
Unreachable(bcx);
|
|
|
|
return bcx;
|
|
|
|
}
|
|
|
|
};
|
2013-12-18 16:54:42 -06:00
|
|
|
unwind.scope.get()
|
Implement scopes independent of LLVM basic blocks
Currently, scopes are tied to LLVM basic blocks. For each scope, there
are two new basic blocks, which means two extra jumps in the unoptimized
IR. These blocks aren't actually required, but only used to act as the
boundary for cleanups.
By keeping track of the current scope within a single basic block, we
can avoid those extra blocks and jumps, shrinking the pre-optimization
IR quite considerably. For example, the IR for trans_intrinsic goes
from ~22k lines to ~16k lines, almost 30% less.
The impact on the build times of optimized builds is rather small (about
1%), but unoptimized builds are about 11% faster. The testsuite for
unoptimized builds runs between 15% (CPU time) and 7.5% (wallclock time on
my i7) faster.
Also, in some situations this helps LLVM to generate better code by
inlining functions that it previously considered to be too large.
Likely because of the pointless blocks/jumps that were still present at
the time the inlining pass runs.
Refs #7462
2013-07-07 07:53:57 -05:00
|
|
|
}
|
2012-08-28 17:54:45 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
cleanup_and_Br(bcx, unwind, target.llbb);
|
|
|
|
Unreachable(bcx);
|
|
|
|
return bcx;
|
|
|
|
}
|
|
|
|
|
2014-01-07 10:54:58 -06:00
|
|
|
pub fn trans_break<'a>(bcx: &'a Block<'a>, label_opt: Option<Name>)
|
|
|
|
-> &'a Block<'a> {
|
2012-10-18 14:20:18 -05:00
|
|
|
return trans_break_cont(bcx, label_opt, true);
|
2012-08-28 17:54:45 -05:00
|
|
|
}
|
|
|
|
|
2014-01-07 10:54:58 -06:00
|
|
|
pub fn trans_cont<'a>(bcx: &'a Block<'a>, label_opt: Option<Name>)
|
|
|
|
-> &'a Block<'a> {
|
2012-10-18 14:20:18 -05:00
|
|
|
return trans_break_cont(bcx, label_opt, false);
|
2012-08-28 17:54:45 -05:00
|
|
|
}
|
|
|
|
|
2014-01-07 10:54:58 -06:00
|
|
|
pub fn trans_ret<'a>(bcx: &'a Block<'a>, e: Option<@ast::Expr>)
|
|
|
|
-> &'a Block<'a> {
|
2013-06-16 23:23:24 -05:00
|
|
|
let _icx = push_ctxt("trans_ret");
|
2012-08-28 17:54:45 -05:00
|
|
|
let mut bcx = bcx;
|
2013-12-20 22:36:07 -06:00
|
|
|
let dest = match bcx.fcx.llretptr.get() {
|
2013-06-20 09:42:44 -05:00
|
|
|
None => expr::Ignore,
|
|
|
|
Some(retptr) => expr::SaveIn(retptr),
|
2012-08-28 17:54:45 -05:00
|
|
|
};
|
|
|
|
match e {
|
2013-08-11 20:12:57 -05:00
|
|
|
Some(x) => {
|
|
|
|
bcx = expr::trans_into(bcx, x, dest);
|
|
|
|
}
|
|
|
|
_ => ()
|
2012-08-28 17:54:45 -05:00
|
|
|
}
|
2013-07-12 20:25:46 -05:00
|
|
|
cleanup_and_leave(bcx, None, Some(bcx.fcx.get_llreturn()));
|
2012-08-28 17:54:45 -05:00
|
|
|
Unreachable(bcx);
|
|
|
|
return bcx;
|
|
|
|
}
|
2013-01-29 19:57:02 -06:00
|
|
|
|
2014-01-07 10:54:58 -06:00
|
|
|
pub fn trans_fail_expr<'a>(
|
|
|
|
bcx: &'a Block<'a>,
|
2013-08-31 11:13:04 -05:00
|
|
|
sp_opt: Option<Span>,
|
2013-09-01 20:45:37 -05:00
|
|
|
fail_expr: Option<@ast::Expr>)
|
2014-01-07 10:54:58 -06:00
|
|
|
-> &'a Block<'a> {
|
2013-06-16 23:23:24 -05:00
|
|
|
let _icx = push_ctxt("trans_fail_expr");
|
2012-08-28 17:54:45 -05:00
|
|
|
let mut bcx = bcx;
|
|
|
|
match fail_expr {
|
|
|
|
Some(arg_expr) => {
|
2013-06-04 23:43:41 -05:00
|
|
|
let ccx = bcx.ccx();
|
|
|
|
let tcx = ccx.tcx;
|
2012-08-28 17:54:45 -05:00
|
|
|
let arg_datum = unpack_datum!(
|
|
|
|
bcx, expr::trans_to_datum(bcx, arg_expr));
|
|
|
|
|
|
|
|
if ty::type_is_str(arg_datum.ty) {
|
2013-05-03 15:26:43 -05:00
|
|
|
let (lldata, _) = arg_datum.get_vec_base_and_len_no_root(bcx);
|
2012-08-28 17:54:45 -05:00
|
|
|
return trans_fail_value(bcx, sp_opt, lldata);
|
2013-12-18 16:54:42 -06:00
|
|
|
} else if bcx.unreachable.get() || ty::type_is_bot(arg_datum.ty) {
|
2012-08-28 17:54:45 -05:00
|
|
|
return bcx;
|
|
|
|
} else {
|
|
|
|
bcx.sess().span_bug(
|
|
|
|
arg_expr.span, ~"fail called with unsupported type " +
|
|
|
|
ppaux::ty_to_str(tcx, arg_datum.ty));
|
|
|
|
}
|
|
|
|
}
|
2013-06-12 12:02:55 -05:00
|
|
|
_ => trans_fail(bcx, sp_opt, @"explicit failure")
|
2012-08-28 17:54:45 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-01-07 10:54:58 -06:00
|
|
|
pub fn trans_fail<'a>(
|
|
|
|
bcx: &'a Block<'a>,
|
2013-08-31 11:13:04 -05:00
|
|
|
sp_opt: Option<Span>,
|
2013-06-12 12:02:55 -05:00
|
|
|
fail_str: @str)
|
2014-01-07 10:54:58 -06:00
|
|
|
-> &'a Block<'a> {
|
2013-06-16 23:23:24 -05:00
|
|
|
let _icx = push_ctxt("trans_fail");
|
2012-08-28 17:54:45 -05:00
|
|
|
let V_fail_str = C_cstr(bcx.ccx(), fail_str);
|
|
|
|
return trans_fail_value(bcx, sp_opt, V_fail_str);
|
|
|
|
}
|
|
|
|
|
2014-01-07 10:54:58 -06:00
|
|
|
fn trans_fail_value<'a>(
|
|
|
|
bcx: &'a Block<'a>,
|
2013-08-31 11:13:04 -05:00
|
|
|
sp_opt: Option<Span>,
|
2013-01-29 19:57:02 -06:00
|
|
|
V_fail_str: ValueRef)
|
2014-01-07 10:54:58 -06:00
|
|
|
-> &'a Block<'a> {
|
2013-06-16 23:23:24 -05:00
|
|
|
let _icx = push_ctxt("trans_fail_value");
|
2012-08-28 17:54:45 -05:00
|
|
|
let ccx = bcx.ccx();
|
2013-02-19 01:40:42 -06:00
|
|
|
let (V_filename, V_line) = match sp_opt {
|
2012-08-28 17:54:45 -05:00
|
|
|
Some(sp) => {
|
|
|
|
let sess = bcx.sess();
|
2012-11-12 20:24:56 -06:00
|
|
|
let loc = sess.parse_sess.cm.lookup_char_pos(sp.lo);
|
2013-06-12 12:02:55 -05:00
|
|
|
(C_cstr(bcx.ccx(), loc.file.name),
|
2013-02-20 18:41:21 -06:00
|
|
|
loc.line as int)
|
2012-08-28 17:54:45 -05:00
|
|
|
}
|
|
|
|
None => {
|
2013-06-12 12:02:55 -05:00
|
|
|
(C_cstr(bcx.ccx(), @"<runtime>"), 0)
|
2012-08-28 17:54:45 -05:00
|
|
|
}
|
|
|
|
};
|
2013-06-15 22:45:48 -05:00
|
|
|
let V_str = PointerCast(bcx, V_fail_str, Type::i8p());
|
|
|
|
let V_filename = PointerCast(bcx, V_filename, Type::i8p());
|
2012-08-28 17:54:45 -05:00
|
|
|
let args = ~[V_str, V_filename, C_int(ccx, V_line)];
|
2013-07-15 22:42:13 -05:00
|
|
|
let did = langcall(bcx, sp_opt, "", FailFnLangItem);
|
|
|
|
let bcx = callee::trans_lang_call(bcx, did, args, Some(expr::Ignore)).bcx;
|
2012-08-28 17:54:45 -05:00
|
|
|
Unreachable(bcx);
|
|
|
|
return bcx;
|
|
|
|
}
|
2012-09-29 06:34:11 -05:00
|
|
|
|
2014-01-07 10:54:58 -06:00
|
|
|
pub fn trans_fail_bounds_check<'a>(
|
|
|
|
bcx: &'a Block<'a>,
|
|
|
|
sp: Span,
|
|
|
|
index: ValueRef,
|
|
|
|
len: ValueRef)
|
|
|
|
-> &'a Block<'a> {
|
2013-06-16 23:23:24 -05:00
|
|
|
let _icx = push_ctxt("trans_fail_bounds_check");
|
2013-05-04 13:29:32 -05:00
|
|
|
let (filename, line) = filename_and_line_num_from_span(bcx, sp);
|
2012-09-29 06:34:11 -05:00
|
|
|
let args = ~[filename, line, index, len];
|
2013-07-15 22:42:13 -05:00
|
|
|
let did = langcall(bcx, Some(sp), "", FailBoundsCheckFnLangItem);
|
|
|
|
let bcx = callee::trans_lang_call(bcx, did, args, Some(expr::Ignore)).bcx;
|
2012-09-29 06:34:11 -05:00
|
|
|
Unreachable(bcx);
|
|
|
|
return bcx;
|
|
|
|
}
|