macro_rules! compress (
($v0:expr, $v1:expr, $v2:expr, $v3:expr) =>
- {
+ ({
$v0 += $v1; $v1 = rotl!($v1, 13); $v1 ^= $v0;
$v0 = rotl!($v0, 32);
$v2 += $v3; $v3 = rotl!($v3, 16); $v3 ^= $v2;
$v0 += $v3; $v3 = rotl!($v3, 21); $v3 ^= $v0;
$v2 += $v1; $v1 = rotl!($v1, 17); $v1 ^= $v2;
$v2 = rotl!($v2, 32);
- }
+ })
);
let length = msg.len();
const SPIN_COUNT: uint = 0;
macro_rules! move_it (
- { $x:expr } => { unsafe { let y = move *ptr::addr_of(&($x)); move y } }
+ { $x:expr } => ( unsafe { let y = move *ptr::addr_of(&($x)); move y } )
)
#[doc(hidden)]
use rt::rust_closure;
macro_rules! move_it (
- { $x:expr } => { unsafe { let y = move *ptr::addr_of(&($x)); move y } }
+ { $x:expr } => ( unsafe { let y = move *ptr::addr_of(&($x)); move y } )
)
type TaskSet = send_map::linear::LinearMap<*rust_task,()>;
// matches should fit that sort of pattern or NONE (however, some of the
// matches may be wildcards like _ or identifiers).
macro_rules! any_pat (
- ($m:expr, $pattern:pat) => {
+ ($m:expr, $pattern:pat) => (
vec::any($m, |br| {
match br.pats[col].node {
$pattern => true,
_ => false
}
})
- }
+ )
)
fn any_box_pat(m: &[@Match], col: uint) -> bool {
success(named_matches) => {
let rhs = match rhses[i] {
// okay, what's your transcriber?
- @matched_nonterminal(nt_tt(@tt)) => tt,
- _ => cx.span_bug(sp, ~"bad thing in rhs")
+ @matched_nonterminal(nt_tt(@tt)) => {
+ match tt {
+ // cut off delimiters; don't parse 'em
+ tt_delim(tts) => tts.slice(1u,tts.len()-1u),
+ _ => cx.span_fatal(
+ sp, ~"macro rhs must be delimited")
+ }
+ },
+ _ => cx.span_bug(sp, ~"bad thing in rhs")
};
// rhs has holes ( `$id` and `$(...)` that need filled)
let trncbr = new_tt_reader(s_d, itr, Some(named_matches),
- ~[rhs]);
+ rhs);
let p = @Parser(cx.parse_sess(), cx.cfg(),
trncbr as reader);
The important thing is to make sure that lookahead doesn't balk
at INTERPOLATED tokens */
macro_rules! maybe_whole_expr (
- ($p:expr) => { match copy $p.token {
+ ($p:expr) => ( match copy $p.token {
INTERPOLATED(token::nt_expr(e)) => {
$p.bump();
return e;
expr_path(pt));
}
_ => ()
- }}
+ })
)
macro_rules! maybe_whole (
- ($p:expr, $constructor:ident) => { match copy $p.token {
+ ($p:expr, $constructor:ident) => ( match copy $p.token {
INTERPOLATED(token::$constructor(x)) => { $p.bump(); return x; }
_ => ()
- }} ;
- (deref $p:expr, $constructor:ident) => { match copy $p.token {
+ }) ;
+ (deref $p:expr, $constructor:ident) => ( match copy $p.token {
INTERPOLATED(token::$constructor(x)) => { $p.bump(); return *x; }
_ => ()
- }} ;
- (Some $p:expr, $constructor:ident) => { match copy $p.token {
+ }) ;
+ (Some $p:expr, $constructor:ident) => ( match copy $p.token {
INTERPOLATED(token::$constructor(x)) => { $p.bump(); return Some(x); }
_ => ()
- }} ;
- (iovi $p:expr, $constructor:ident) => { match copy $p.token {
+ }) ;
+ (iovi $p:expr, $constructor:ident) => ( match copy $p.token {
INTERPOLATED(token::$constructor(x)) => {
$p.bump();
return iovi_item(x);
}
_ => ()
- }} ;
- (pair_empty $p:expr, $constructor:ident) => { match copy $p.token {
+ }) ;
+ (pair_empty $p:expr, $constructor:ident) => ( match copy $p.token {
INTERPOLATED(token::$constructor(x)) => { $p.bump(); return (~[], x); }
_ => ()
- }}
+ })
)