sui_proc_macros/lib.rs
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585
// Copyright (c) Mysten Labs, Inc.
// SPDX-License-Identifier: Apache-2.0
use proc_macro::TokenStream;
use quote::{quote, quote_spanned, ToTokens};
use syn::{
fold::{fold_expr, fold_item_macro, fold_stmt, Fold},
parse::Parser,
parse2, parse_macro_input,
punctuated::Punctuated,
spanned::Spanned,
Attribute, BinOp, Data, DataEnum, DeriveInput, Expr, ExprBinary, ExprMacro, Item, ItemMacro,
Stmt, StmtMacro, Token, UnOp,
};
#[proc_macro_attribute]
pub fn init_static_initializers(_args: TokenStream, item: TokenStream) -> TokenStream {
let mut input = parse_macro_input!(item as syn::ItemFn);
let body = &input.block;
input.block = syn::parse2(quote! {
{
// We have some lazily-initialized static state in the program. The initializers
// alter the thread-local hash container state any time they create a new hash
// container. Therefore, we need to ensure that these initializers are run in a
// separate thread before the first test thread is launched. Otherwise, they would
// run inside of the first test thread, but not subsequent ones.
//
// Note that none of this has any effect on process-level determinism. Without this
// code, we can still get the same test results from two processes started with the
// same seed.
//
// However, when using sim_test(check_determinism) or MSIM_TEST_CHECK_DETERMINISM=1,
// we want the same test invocation to be deterministic when run twice
// _in the same process_, so we need to take care of this. This will also
// be very important for being able to reproduce a failure that occurs in the Nth
// iteration of a multi-iteration test run.
std::thread::spawn(|| {
use sui_protocol_config::ProtocolConfig;
::sui_simulator::telemetry_subscribers::init_for_testing();
::sui_simulator::sui_types::execution::get_denied_certificates();
::sui_simulator::sui_framework::BuiltInFramework::all_package_ids();
::sui_simulator::sui_types::gas::SuiGasStatus::new_unmetered();
// For reasons I can't understand, LruCache causes divergent behavior the second
// time one is constructed and inserted into, so construct one before the first
// test run for determinism.
let mut cache = ::sui_simulator::lru::LruCache::new(1.try_into().unwrap());
cache.put(1, 1);
{
// Initialize the static initializers here:
// https://github.com/move-language/move/blob/652badf6fd67e1d4cc2aa6dc69d63ad14083b673/language/tools/move-package/src/package_lock.rs#L12
use std::path::PathBuf;
use sui_simulator::sui_move_build::{BuildConfig, SuiPackageHooks};
use sui_simulator::tempfile::TempDir;
use sui_simulator::move_package::package_hooks::register_package_hooks;
register_package_hooks(Box::new(SuiPackageHooks {}));
let mut path = PathBuf::from(env!("SIMTEST_STATIC_INIT_MOVE"));
let mut build_config = BuildConfig::new_for_testing();
build_config.config.install_dir = Some(TempDir::new().unwrap().into_path());
let _all_module_bytes = build_config
.build(&path)
.unwrap()
.get_package_bytes(/* with_unpublished_deps */ false);
}
use std::sync::Arc;
use ::sui_simulator::anemo_tower::callback::CallbackLayer;
use ::sui_simulator::anemo_tower::trace::DefaultMakeSpan;
use ::sui_simulator::anemo_tower::trace::DefaultOnFailure;
use ::sui_simulator::anemo_tower::trace::TraceLayer;
use ::sui_simulator::fastcrypto::traits::KeyPair;
use ::sui_simulator::mysten_network::metrics::MetricsMakeCallbackHandler;
use ::sui_simulator::mysten_network::metrics::NetworkMetrics;
use ::sui_simulator::rand_crate::rngs::{StdRng, OsRng};
use ::sui_simulator::rand::SeedableRng;
use ::sui_simulator::tower::ServiceBuilder;
// anemo uses x509-parser, which has many lazy static variables. start a network to
// initialize all that static state before the first test.
let rt = ::sui_simulator::runtime::Runtime::new();
rt.block_on(async move {
use ::sui_simulator::anemo::{Network, Request};
let make_network = |port: u16| {
let registry = prometheus::Registry::new();
let inbound_network_metrics =
NetworkMetrics::new("sui", "inbound", ®istry);
let outbound_network_metrics =
NetworkMetrics::new("sui", "outbound", ®istry);
let service = ServiceBuilder::new()
.layer(
TraceLayer::new_for_server_errors()
.make_span_with(DefaultMakeSpan::new().level(tracing::Level::INFO))
.on_failure(DefaultOnFailure::new().level(tracing::Level::WARN)),
)
.layer(CallbackLayer::new(MetricsMakeCallbackHandler::new(
Arc::new(inbound_network_metrics),
usize::MAX,
)))
.service(::sui_simulator::anemo::Router::new());
let outbound_layer = ServiceBuilder::new()
.layer(
TraceLayer::new_for_client_and_server_errors()
.make_span_with(DefaultMakeSpan::new().level(tracing::Level::INFO))
.on_failure(DefaultOnFailure::new().level(tracing::Level::WARN)),
)
.layer(CallbackLayer::new(MetricsMakeCallbackHandler::new(
Arc::new(outbound_network_metrics),
usize::MAX,
)))
.into_inner();
Network::bind(format!("127.0.0.1:{}", port))
.server_name("static-init-network")
.private_key(
::sui_simulator::fastcrypto::ed25519::Ed25519KeyPair::generate(&mut StdRng::from_rng(OsRng).unwrap())
.private()
.0
.to_bytes(),
)
.start(service)
.unwrap()
};
let n1 = make_network(80);
let n2 = make_network(81);
let _peer = n1.connect(n2.local_addr()).await.unwrap();
});
}).join().unwrap();
#body
}
})
.expect("Parsing failure");
let result = quote! {
#input
};
result.into()
}
/// The sui_test macro will invoke either `#[msim::test]` or `#[tokio::test]`,
/// depending on whether the simulator config var is enabled.
///
/// This should be used for tests that can meaningfully run in either environment.
#[proc_macro_attribute]
pub fn sui_test(args: TokenStream, item: TokenStream) -> TokenStream {
let input = parse_macro_input!(item as syn::ItemFn);
let arg_parser = Punctuated::<syn::Meta, Token![,]>::parse_terminated;
let args = arg_parser.parse(args).unwrap().into_iter();
let header = if cfg!(msim) {
quote! {
#[::sui_simulator::sim_test(crate = "sui_simulator", #(#args)* )]
}
} else {
quote! {
#[::tokio::test(#(#args)*)]
}
};
let result = quote! {
#header
#[::sui_macros::init_static_initializers]
#input
};
result.into()
}
/// The sim_test macro will invoke `#[msim::test]` if the simulator config var is enabled.
///
/// Otherwise, it will emit an ignored test - if forcibly run, the ignored test will panic.
///
/// This macro must be used in order to pass any simulator-specific arguments, such as
/// `check_determinism`, which is not understood by tokio.
#[proc_macro_attribute]
pub fn sim_test(args: TokenStream, item: TokenStream) -> TokenStream {
let input = parse_macro_input!(item as syn::ItemFn);
let arg_parser = Punctuated::<syn::Meta, Token![,]>::parse_terminated;
let args = arg_parser.parse(args).unwrap().into_iter();
let ignore = input
.attrs
.iter()
.find(|attr| attr.path().is_ident("ignore"))
.map_or(quote! {}, |_| quote! { #[ignore] });
let result = if cfg!(msim) {
let sig = &input.sig;
let return_type = &sig.output;
let body = &input.block;
quote! {
#[::sui_simulator::sim_test(crate = "sui_simulator", #(#args),*)]
#[::sui_macros::init_static_initializers]
#ignore
#sig {
async fn body_fn() #return_type { #body }
let ret = body_fn().await;
::sui_simulator::task::shutdown_all_nodes();
// all node handles should have been dropped after the above block exits, but task
// shutdown is asynchronous, so we need a brief delay before checking for leaks.
tokio::time::sleep(tokio::time::Duration::from_millis(10)).await;
assert_eq!(
sui_simulator::NodeLeakDetector::get_current_node_count(),
0,
"SuiNode leak detected"
);
ret
}
}
} else {
let fn_name = &input.sig.ident;
let sig = &input.sig;
let body = &input.block;
quote! {
#[allow(clippy::needless_return)]
#[tokio::test]
#ignore
#sig {
if std::env::var("SUI_SKIP_SIMTESTS").is_ok() {
println!("not running test {} in `cargo test`: SUI_SKIP_SIMTESTS is set", stringify!(#fn_name));
struct Ret;
impl From<Ret> for () {
fn from(_ret: Ret) -> Self {
}
}
impl<E> From<Ret> for Result<(), E> {
fn from(_ret: Ret) -> Self {
Ok(())
}
}
return Ret.into();
}
#body
}
}
};
result.into()
}
#[proc_macro]
pub fn checked_arithmetic(input: TokenStream) -> TokenStream {
let input_file = CheckArithmetic.fold_file(parse_macro_input!(input));
let output_items = input_file.items;
let output = quote! {
#(#output_items)*
};
TokenStream::from(output)
}
#[proc_macro_attribute]
pub fn with_checked_arithmetic(_attr: TokenStream, item: TokenStream) -> TokenStream {
let input_item = parse_macro_input!(item as Item);
match input_item {
Item::Fn(input_fn) => {
let transformed_fn = CheckArithmetic.fold_item_fn(input_fn);
TokenStream::from(quote! { #transformed_fn })
}
Item::Impl(input_impl) => {
let transformed_impl = CheckArithmetic.fold_item_impl(input_impl);
TokenStream::from(quote! { #transformed_impl })
}
item => {
let transformed_impl = CheckArithmetic.fold_item(item);
TokenStream::from(quote! { #transformed_impl })
}
}
}
struct CheckArithmetic;
impl CheckArithmetic {
fn maybe_skip_macro(&self, attrs: &mut Vec<Attribute>) -> bool {
if let Some(idx) = attrs
.iter()
.position(|attr| attr.path().is_ident("skip_checked_arithmetic"))
{
// Skip processing macro because it is annotated with
// #[skip_checked_arithmetic]
attrs.remove(idx);
true
} else {
false
}
}
fn process_macro_contents(
&mut self,
tokens: proc_macro2::TokenStream,
) -> syn::Result<proc_macro2::TokenStream> {
// Parse the macro's contents as a comma-separated list of expressions.
let parser = Punctuated::<Expr, Token![,]>::parse_terminated;
let Ok(exprs) = parser.parse(tokens.clone().into()) else {
return Err(syn::Error::new_spanned(
tokens,
"could not process macro contents - use #[skip_checked_arithmetic] to skip this macro"
));
};
// Fold each sub expression.
let folded_exprs = exprs
.into_iter()
.map(|expr| self.fold_expr(expr))
.collect::<Vec<_>>();
// Convert the folded expressions back into tokens and reconstruct the macro.
let mut folded_tokens = proc_macro2::TokenStream::new();
for (i, folded_expr) in folded_exprs.into_iter().enumerate() {
if i > 0 {
folded_tokens.extend(std::iter::once::<proc_macro2::TokenTree>(
proc_macro2::Punct::new(',', proc_macro2::Spacing::Alone).into(),
));
}
folded_expr.to_tokens(&mut folded_tokens);
}
Ok(folded_tokens)
}
}
impl Fold for CheckArithmetic {
fn fold_stmt(&mut self, stmt: Stmt) -> Stmt {
let stmt = fold_stmt(self, stmt);
if let Stmt::Macro(stmt_macro) = stmt {
let StmtMacro {
mut attrs,
mut mac,
semi_token,
} = stmt_macro;
if self.maybe_skip_macro(&mut attrs) {
Stmt::Macro(StmtMacro {
attrs,
mac,
semi_token,
})
} else {
match self.process_macro_contents(mac.tokens.clone()) {
Ok(folded_tokens) => {
mac.tokens = folded_tokens;
Stmt::Macro(StmtMacro {
attrs,
mac,
semi_token,
})
}
Err(error) => parse2(error.to_compile_error()).unwrap(),
}
}
} else {
stmt
}
}
fn fold_item_macro(&mut self, mut item_macro: ItemMacro) -> ItemMacro {
if !self.maybe_skip_macro(&mut item_macro.attrs) {
let err = syn::Error::new_spanned(
item_macro.to_token_stream(),
"cannot process macros - use #[skip_checked_arithmetic] to skip \
processing this macro",
);
return parse2(err.to_compile_error()).unwrap();
}
fold_item_macro(self, item_macro)
}
fn fold_expr(&mut self, expr: Expr) -> Expr {
let span = expr.span();
let expr = fold_expr(self, expr);
let expr = match expr {
Expr::Macro(expr_macro) => {
let ExprMacro { mut attrs, mut mac } = expr_macro;
if self.maybe_skip_macro(&mut attrs) {
return Expr::Macro(ExprMacro { attrs, mac });
} else {
match self.process_macro_contents(mac.tokens.clone()) {
Ok(folded_tokens) => {
mac.tokens = folded_tokens;
let expr_macro = Expr::Macro(ExprMacro { attrs, mac });
quote!(#expr_macro)
}
Err(error) => {
return Expr::Verbatim(error.to_compile_error());
}
}
}
}
Expr::Binary(expr_binary) => {
let ExprBinary {
attrs,
mut left,
op,
mut right,
} = expr_binary;
fn remove_parens(expr: &mut Expr) {
if let Expr::Paren(paren) = expr {
// i don't even think rust allows this, but just in case
assert!(paren.attrs.is_empty(), "TODO: attrs on parenthesized");
*expr = *paren.expr.clone();
}
}
macro_rules! wrap_op {
($left: expr, $right: expr, $method: ident, $span: expr) => {{
// Remove parens from exprs since both sides get assigned to tmp variables.
// otherwise we get lint errors
remove_parens(&mut $left);
remove_parens(&mut $right);
quote_spanned!($span => {
// assign in one stmt in case either #left or #right contains
// references to `left` or `right` symbols.
let (left, right) = (#left, #right);
left.$method(right)
.unwrap_or_else(||
panic!(
"Overflow or underflow in {} {} + {}",
stringify!($method),
left,
right,
)
)
})
}};
}
macro_rules! wrap_op_assign {
($left: expr, $right: expr, $method: ident, $span: expr) => {{
// Remove parens from exprs since both sides get assigned to tmp variables.
// otherwise we get lint errors
remove_parens(&mut $left);
remove_parens(&mut $right);
quote_spanned!($span => {
// assign in one stmt in case either #left or #right contains
// references to `left` or `right` symbols.
let (left, right) = (&mut #left, #right);
*left = (*left).$method(right)
.unwrap_or_else(||
panic!(
"Overflow or underflow in {} {} + {}",
stringify!($method),
*left,
right
)
)
})
}};
}
match op {
BinOp::Add(_) => {
wrap_op!(left, right, checked_add, span)
}
BinOp::Sub(_) => {
wrap_op!(left, right, checked_sub, span)
}
BinOp::Mul(_) => {
wrap_op!(left, right, checked_mul, span)
}
BinOp::Div(_) => {
wrap_op!(left, right, checked_div, span)
}
BinOp::Rem(_) => {
wrap_op!(left, right, checked_rem, span)
}
BinOp::AddAssign(_) => {
wrap_op_assign!(left, right, checked_add, span)
}
BinOp::SubAssign(_) => {
wrap_op_assign!(left, right, checked_sub, span)
}
BinOp::MulAssign(_) => {
wrap_op_assign!(left, right, checked_mul, span)
}
BinOp::DivAssign(_) => {
wrap_op_assign!(left, right, checked_div, span)
}
BinOp::RemAssign(_) => {
wrap_op_assign!(left, right, checked_rem, span)
}
_ => {
let expr_binary = ExprBinary {
attrs,
left,
op,
right,
};
quote_spanned!(span => #expr_binary)
}
}
}
Expr::Unary(expr_unary) => {
let op = &expr_unary.op;
let operand = &expr_unary.expr;
match op {
UnOp::Neg(_) => {
quote_spanned!(span => #operand.checked_neg().expect("Overflow or underflow in negation"))
}
_ => quote_spanned!(span => #expr_unary),
}
}
_ => quote_spanned!(span => #expr),
};
parse2(expr).unwrap()
}
}
/// This proc macro generates a function `order_to_variant_map` which returns a map
/// of the position of each variant to the name of the variant.
/// It is intended to catch changes in enum order when backward compat is required.
/// ```rust,ignore
/// /// Example for this enum
/// #[derive(EnumVariantOrder)]
/// pub enum MyEnum {
/// A,
/// B(u64),
/// C{x: bool, y: i8},
/// }
/// let order_map = MyEnum::order_to_variant_map();
/// assert!(order_map.get(0).unwrap() == "A");
/// assert!(order_map.get(1).unwrap() == "B");
/// assert!(order_map.get(2).unwrap() == "C");
/// ```
#[proc_macro_derive(EnumVariantOrder)]
pub fn enum_variant_order_derive(input: TokenStream) -> TokenStream {
let ast = parse_macro_input!(input as DeriveInput);
let name = &ast.ident;
if let Data::Enum(DataEnum { variants, .. }) = ast.data {
let variant_entries = variants
.iter()
.enumerate()
.map(|(index, variant)| {
let variant_name = variant.ident.to_string();
quote! {
map.insert( #index as u64, (#variant_name).to_string());
}
})
.collect::<Vec<_>>();
let deriv = quote! {
impl sui_enum_compat_util::EnumOrderMap for #name {
fn order_to_variant_map() -> std::collections::BTreeMap<u64, String > {
let mut map = std::collections::BTreeMap::new();
#(#variant_entries)*
map
}
}
};
deriv.into()
} else {
panic!("EnumVariantOrder can only be used with enums.");
}
}