-
Notifications
You must be signed in to change notification settings - Fork 12.5k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
auto merge of #5593 : luqmana/rust/inline-asm, r=catamorphism
Clean things up a bit. Also, allow selecting intel syntax in addition to the default AT&T dialect.
- Loading branch information
Showing
11 changed files
with
226 additions
and
138 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,154 @@ | ||
// 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. | ||
|
||
/*! | ||
# Translation of inline assembly. | ||
*/ | ||
|
||
use core::prelude::*; | ||
|
||
use lib; | ||
use middle::trans::build::*; | ||
use middle::trans::callee; | ||
use middle::trans::common::*; | ||
use middle::ty; | ||
|
||
use syntax::ast; | ||
|
||
// Take an inline assembly expression and splat it out via LLVM | ||
pub fn trans_inline_asm(bcx: block, ia: &ast::inline_asm) -> block { | ||
|
||
let mut bcx = bcx; | ||
let mut constraints = ~[]; | ||
let mut cleanups = ~[]; | ||
let mut aoutputs = ~[]; | ||
|
||
// Prepare the output operands | ||
let outputs = do ia.outputs.map |&(c, out)| { | ||
constraints.push(copy *c); | ||
|
||
let aoutty = ty::arg { | ||
mode: ast::expl(ast::by_copy), | ||
ty: expr_ty(bcx, out) | ||
}; | ||
aoutputs.push(unpack_result!(bcx, { | ||
callee::trans_arg_expr(bcx, aoutty, out, &mut cleanups, None, callee::DontAutorefArg) | ||
})); | ||
|
||
let e = match out.node { | ||
ast::expr_addr_of(_, e) => e, | ||
_ => fail!(~"Expression must be addr of") | ||
}; | ||
|
||
let outty = ty::arg { | ||
mode: ast::expl(ast::by_copy), | ||
ty: expr_ty(bcx, e) | ||
}; | ||
|
||
unpack_result!(bcx, { | ||
callee::trans_arg_expr(bcx, outty, e, &mut cleanups, None, callee::DontAutorefArg) | ||
}) | ||
|
||
}; | ||
|
||
for cleanups.each |c| { | ||
revoke_clean(bcx, *c); | ||
} | ||
cleanups.clear(); | ||
|
||
// Now the input operands | ||
let inputs = do ia.inputs.map |&(c, in)| { | ||
constraints.push(copy *c); | ||
|
||
let inty = ty::arg { | ||
mode: ast::expl(ast::by_copy), | ||
ty: expr_ty(bcx, in) | ||
}; | ||
|
||
unpack_result!(bcx, { | ||
callee::trans_arg_expr(bcx, inty, in, &mut cleanups, None, callee::DontAutorefArg) | ||
}) | ||
|
||
}; | ||
|
||
for cleanups.each |c| { | ||
revoke_clean(bcx, *c); | ||
} | ||
|
||
let mut constraints = str::connect(constraints, ","); | ||
|
||
let mut clobbers = getClobbers(); | ||
if *ia.clobbers != ~"" && clobbers != ~"" { | ||
clobbers = *ia.clobbers + ~"," + clobbers; | ||
} else { | ||
clobbers += *ia.clobbers; | ||
}; | ||
|
||
// Add the clobbers to our constraints list | ||
if clobbers != ~"" && constraints != ~"" { | ||
constraints += ~"," + clobbers; | ||
} else { | ||
constraints += clobbers; | ||
} | ||
|
||
debug!("Asm Constraints: %?", constraints); | ||
|
||
let numOutputs = outputs.len(); | ||
|
||
// Depending on how many outputs we have, the return type is different | ||
let output = if numOutputs == 0 { | ||
T_void() | ||
} else if numOutputs == 1 { | ||
val_ty(outputs[0]) | ||
} else { | ||
T_struct(outputs.map(|o| val_ty(*o))) | ||
}; | ||
|
||
let dialect = match ia.dialect { | ||
ast::asm_att => lib::llvm::AD_ATT, | ||
ast::asm_intel => lib::llvm::AD_Intel | ||
}; | ||
|
||
let r = do str::as_c_str(*ia.asm) |a| { | ||
do str::as_c_str(constraints) |c| { | ||
InlineAsmCall(bcx, a, c, inputs, output, ia.volatile, ia.alignstack, dialect) | ||
} | ||
}; | ||
|
||
// Again, based on how many outputs we have | ||
if numOutputs == 1 { | ||
let op = PointerCast(bcx, aoutputs[0], T_ptr(val_ty(outputs[0]))); | ||
Store(bcx, r, op); | ||
} else { | ||
for aoutputs.eachi |i, o| { | ||
let v = ExtractValue(bcx, r, i); | ||
let op = PointerCast(bcx, *o, T_ptr(val_ty(outputs[i]))); | ||
Store(bcx, v, op); | ||
} | ||
} | ||
|
||
return bcx; | ||
|
||
} | ||
|
||
// Default per-arch clobbers | ||
// Basically what clang does | ||
|
||
#[cfg(target_arch = "arm")] | ||
#[cfg(target_arch = "mips")] | ||
fn getClobbers() -> ~str { | ||
~"" | ||
} | ||
|
||
#[cfg(target_arch = "x86")] | ||
#[cfg(target_arch = "x86_64")] | ||
fn getClobbers() -> ~str { | ||
~"~{dirflag},~{fpsr},~{flags}" | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.