pub mod grammar_generator; #[cfg(test)] mod tests { use std::collections::HashSet; use rand::{seq::IndexedRandom, Rng, SeedableRng}; use rand_chacha::ChaCha8Rng; use rusqlite::params; use crate::{ common::{limbo_exec_rows, sqlite_exec_rows, TempDatabase}, fuzz::grammar_generator::{const_str, rand_int, rand_str, GrammarGenerator}, }; use super::grammar_generator::SymbolHandle; fn rng_from_time() -> (ChaCha8Rng, u64) { let seed = std::time::SystemTime::now() .duration_since(std::time::UNIX_EPOCH) .unwrap() .as_secs(); let rng = ChaCha8Rng::seed_from_u64(seed); (rng, seed) } #[test] pub fn arithmetic_expression_fuzz_ex1() { let db = TempDatabase::new_empty(); let limbo_conn = db.connect_limbo(); let sqlite_conn = rusqlite::Connection::open_in_memory().unwrap(); for query in [ "SELECT ~1 >> 1536", "SELECT ~ + 3 << - ~ (~ (8)) - + -1 - 3 >> 3 + -6 * (-7 * 9 >> - 2)", ] { let limbo = limbo_exec_rows(&db, &limbo_conn, query); let sqlite = sqlite_exec_rows(&sqlite_conn, query); assert_eq!( limbo, sqlite, "query: {}, limbo: {:?}, sqlite: {:?}", query, limbo, sqlite ); } } #[test] pub fn rowid_seek_fuzz() { let db = TempDatabase::new_with_rusqlite("CREATE TABLE t(x INTEGER PRIMARY KEY)"); // INTEGER PRIMARY KEY is a rowid alias, so an index is not created let sqlite_conn = rusqlite::Connection::open(db.path.clone()).unwrap(); let insert = format!( "INSERT INTO t VALUES {}", (1..10000) .map(|x| format!("({})", x)) .collect::>() .join(", ") ); sqlite_conn.execute(&insert, params![]).unwrap(); sqlite_conn.close().unwrap(); let sqlite_conn = rusqlite::Connection::open(db.path.clone()).unwrap(); let limbo_conn = db.connect_limbo(); const COMPARISONS: [&str; 4] = ["<", "<=", ">", ">="]; const ORDER_BY: [Option<&str>; 4] = [ None, Some("ORDER BY x"), Some("ORDER BY x DESC"), Some("ORDER BY x ASC"), ]; for comp in COMPARISONS.iter() { for order_by in ORDER_BY.iter() { for max in 0..=10000 { let query = format!( "SELECT * FROM t WHERE x {} {} {} LIMIT 3", comp, max, order_by.unwrap_or("") ); log::trace!("query: {}", query); let limbo = limbo_exec_rows(&db, &limbo_conn, &query); let sqlite = sqlite_exec_rows(&sqlite_conn, &query); assert_eq!( limbo, sqlite, "query: {}, limbo: {:?}, sqlite: {:?}", query, limbo, sqlite ); } } } } #[test] pub fn index_scan_fuzz() { let db = TempDatabase::new_with_rusqlite("CREATE TABLE t(x PRIMARY KEY)"); let sqlite_conn = rusqlite::Connection::open(db.path.clone()).unwrap(); let insert = format!( "INSERT INTO t VALUES {}", (0..10000) .map(|x| format!("({})", x)) .collect::>() .join(", ") ); sqlite_conn.execute(&insert, params![]).unwrap(); sqlite_conn.close().unwrap(); let sqlite_conn = rusqlite::Connection::open(db.path.clone()).unwrap(); let limbo_conn = db.connect_limbo(); const COMPARISONS: [&str; 5] = ["=", "<", "<=", ">", ">="]; const ORDER_BY: [Option<&str>; 4] = [ None, Some("ORDER BY x"), Some("ORDER BY x DESC"), Some("ORDER BY x ASC"), ]; for comp in COMPARISONS.iter() { for order_by in ORDER_BY.iter() { for max in 0..=10000 { let query = format!( "SELECT * FROM t WHERE x {} {} {} LIMIT 3", comp, max, order_by.unwrap_or(""), ); let limbo = limbo_exec_rows(&db, &limbo_conn, &query); let sqlite = sqlite_exec_rows(&sqlite_conn, &query); assert_eq!( limbo, sqlite, "query: {}, limbo: {:?}, sqlite: {:?}", query, limbo, sqlite ); } } } } #[test] /// A test for verifying that index seek+scan works correctly for compound keys /// on indexes with various column orderings. pub fn index_scan_compound_key_fuzz() { let (mut rng, seed) = if std::env::var("SEED").is_ok() { let seed = std::env::var("SEED").unwrap().parse::().unwrap(); (ChaCha8Rng::seed_from_u64(seed), seed) } else { rng_from_time() }; let table_defs: [&str; 8] = [ "CREATE TABLE t(x, y, z, nonindexed_col, PRIMARY KEY (x, y, z))", "CREATE TABLE t(x, y, z, nonindexed_col, PRIMARY KEY (x desc, y, z))", "CREATE TABLE t(x, y, z, nonindexed_col, PRIMARY KEY (x, y desc, z))", "CREATE TABLE t(x, y, z, nonindexed_col, PRIMARY KEY (x, y, z desc))", "CREATE TABLE t(x, y, z, nonindexed_col, PRIMARY KEY (x desc, y desc, z))", "CREATE TABLE t(x, y, z, nonindexed_col, PRIMARY KEY (x desc, y, z desc))", "CREATE TABLE t(x, y, z, nonindexed_col, PRIMARY KEY (x, y desc, z desc))", "CREATE TABLE t(x, y, z, nonindexed_col, PRIMARY KEY (x desc, y desc, z desc))", ]; // Create all different 3-column primary key permutations let dbs = [ TempDatabase::new_with_rusqlite(table_defs[0]), TempDatabase::new_with_rusqlite(table_defs[1]), TempDatabase::new_with_rusqlite(table_defs[2]), TempDatabase::new_with_rusqlite(table_defs[3]), TempDatabase::new_with_rusqlite(table_defs[4]), TempDatabase::new_with_rusqlite(table_defs[5]), TempDatabase::new_with_rusqlite(table_defs[6]), TempDatabase::new_with_rusqlite(table_defs[7]), ]; let mut pk_tuples = HashSet::new(); while pk_tuples.len() < 100000 { pk_tuples.insert(( rng.random_range(0..3000), rng.random_range(0..3000), rng.random_range(0..3000), )); } let mut tuples = Vec::new(); for pk_tuple in pk_tuples { tuples.push(format!( "({}, {}, {}, {})", pk_tuple.0, pk_tuple.1, pk_tuple.2, rng.random_range(0..3000) )); } let insert = format!("INSERT INTO t VALUES {}", tuples.join(", ")); // Insert all tuples into all databases let sqlite_conns = dbs .iter() .map(|db| rusqlite::Connection::open(db.path.clone()).unwrap()) .collect::>(); for sqlite_conn in sqlite_conns.into_iter() { sqlite_conn.execute(&insert, params![]).unwrap(); sqlite_conn.close().unwrap(); } let sqlite_conns = dbs .iter() .map(|db| rusqlite::Connection::open(db.path.clone()).unwrap()) .collect::>(); let limbo_conns = dbs.iter().map(|db| db.connect_limbo()).collect::>(); const COMPARISONS: [&str; 5] = ["=", "<", "<=", ">", ">="]; // For verifying index scans, we only care about cases where all but potentially the last column are constrained by an equality (=), // because this is the only way to utilize an index efficiently for seeking. This is called the "left-prefix rule" of indexes. // Hence we generate constraint combinations in this manner; as soon as a comparison is not an equality, we stop generating more constraints for the where clause. // Examples: // x = 1 AND y = 2 AND z > 3 // x = 1 AND y > 2 // x > 1 let col_comp_first = COMPARISONS .iter() .cloned() .map(|x| (Some(x), None, None)) .collect::>(); let col_comp_second = COMPARISONS .iter() .cloned() .map(|x| (Some("="), Some(x), None)) .collect::>(); let col_comp_third = COMPARISONS .iter() .cloned() .map(|x| (Some("="), Some("="), Some(x))) .collect::>(); let all_comps = [col_comp_first, col_comp_second, col_comp_third].concat(); const ORDER_BY: [Option<&str>; 3] = [None, Some("DESC"), Some("ASC")]; const ITERATIONS: usize = 10000; for i in 0..ITERATIONS { if i % (ITERATIONS / 100) == 0 { println!( "index_scan_compound_key_fuzz: iteration {}/{}", i + 1, ITERATIONS ); } // let's choose random columns from the table let col_choices = ["x", "y", "z", "nonindexed_col"]; let col_choices_weights = [10.0, 10.0, 10.0, 3.0]; let num_cols_in_select = rng.random_range(1..=4); let mut select_cols = col_choices .choose_multiple_weighted(&mut rng, num_cols_in_select, |s| { let idx = col_choices.iter().position(|c| c == s).unwrap(); col_choices_weights[idx] }) .unwrap() .collect::>() .iter() .map(|x| x.to_string()) .collect::>(); // sort select cols by index of col_choices select_cols.sort_by_cached_key(|x| col_choices.iter().position(|c| c == x).unwrap()); let (comp1, comp2, comp3) = all_comps[rng.random_range(0..all_comps.len())]; // Similarly as for the constraints, generate order by permutations so that the only columns involved in the index seek are potentially part of the ORDER BY. let (order_by1, order_by2, order_by3) = { if comp1.is_some() && comp2.is_some() && comp3.is_some() { ( ORDER_BY[rng.random_range(0..ORDER_BY.len())], ORDER_BY[rng.random_range(0..ORDER_BY.len())], ORDER_BY[rng.random_range(0..ORDER_BY.len())], ) } else if comp1.is_some() && comp2.is_some() { ( ORDER_BY[rng.random_range(0..ORDER_BY.len())], ORDER_BY[rng.random_range(0..ORDER_BY.len())], None, ) } else { (ORDER_BY[rng.random_range(0..ORDER_BY.len())], None, None) } }; // Generate random values for the WHERE clause constraints. Only involve primary key columns. let (col_val_first, col_val_second, col_val_third) = { if comp1.is_some() && comp2.is_some() && comp3.is_some() { ( Some(rng.random_range(0..=3000)), Some(rng.random_range(0..=3000)), Some(rng.random_range(0..=3000)), ) } else if comp1.is_some() && comp2.is_some() { ( Some(rng.random_range(0..=3000)), Some(rng.random_range(0..=3000)), None, ) } else { (Some(rng.random_range(0..=3000)), None, None) } }; // Use a small limit to make the test complete faster let limit = 5; // Generate WHERE clause string let where_clause_components = vec![ comp1.map(|x| format!("x {} {}", x, col_val_first.unwrap())), comp2.map(|x| format!("y {} {}", x, col_val_second.unwrap())), comp3.map(|x| format!("z {} {}", x, col_val_third.unwrap())), ] .into_iter() .filter_map(|x| x) .collect::>(); let where_clause = if where_clause_components.is_empty() { "".to_string() } else { format!("WHERE {}", where_clause_components.join(" AND ")) }; // Generate ORDER BY string let order_by_components = vec![ order_by1.map(|x| format!("x {}", x)), order_by2.map(|x| format!("y {}", x)), order_by3.map(|x| format!("z {}", x)), ] .into_iter() .filter_map(|x| x) .collect::>(); let order_by = if order_by_components.is_empty() { "".to_string() } else { format!("ORDER BY {}", order_by_components.join(", ")) }; // Generate final query string let query = format!( "SELECT {} FROM t {} {} LIMIT {}", select_cols.join(", "), where_clause, order_by, limit ); log::debug!("query: {}", query); // Execute the query on all databases and compare the results for (i, sqlite_conn) in sqlite_conns.iter().enumerate() { let limbo = limbo_exec_rows(&dbs[i], &limbo_conns[i], &query); let sqlite = sqlite_exec_rows(&sqlite_conn, &query); if limbo != sqlite { // if the order by contains exclusively components that are constrained by an equality (=), // sqlite sometimes doesn't bother with ASC/DESC because it doesn't semantically matter // so we need to check that limbo and sqlite return the same results when the ordering is reversed. // because we are generally using LIMIT (to make the test complete faster), we need to rerun the query // without limit and then check that the results are the same if reversed. let order_by_only_equalities = !order_by_components.is_empty() && order_by_components.iter().all(|o: &String| { if o.starts_with("x ") { comp1.map_or(false, |c| c == "=") } else if o.starts_with("y ") { comp2.map_or(false, |c| c == "=") } else { comp3.map_or(false, |c| c == "=") } }); let query_no_limit = format!("SELECT * FROM t {} {} {}", where_clause, order_by, ""); let limbo_no_limit = limbo_exec_rows(&dbs[i], &limbo_conns[i], &query_no_limit); let sqlite_no_limit = sqlite_exec_rows(&sqlite_conn, &query_no_limit); let limbo_rev = limbo_no_limit.iter().cloned().rev().collect::>(); if limbo_rev == sqlite_no_limit && order_by_only_equalities { continue; } // finally, if the order by columns specified contain duplicates, sqlite might've returned the rows in an arbitrary different order. // e.g. SELECT x,y,z FROM t ORDER BY x,y -- if there are duplicates on (x,y), the ordering returned might be different for limbo and sqlite. // let's check this case and forgive ourselves if the ordering is different for this reason (but no other reason!) let order_by_cols = select_cols .iter() .enumerate() .filter(|(i, _)| { order_by_components .iter() .any(|o| o.starts_with(col_choices[*i])) }) .map(|(i, _)| i) .collect::>(); let duplicate_on_order_by_exists = { let mut exists = false; 'outer: for (i, row) in limbo_no_limit.iter().enumerate() { for (j, other_row) in limbo_no_limit.iter().enumerate() { if i != j && order_by_cols.iter().all(|&col| row[col] == other_row[col]) { exists = true; break 'outer; } } } exists }; if duplicate_on_order_by_exists { let len_equal = limbo_no_limit.len() == sqlite_no_limit.len(); let all_contained = len_equal && limbo_no_limit.iter().all(|x| sqlite_no_limit.contains(x)); if all_contained { continue; } } panic!( "DIFFERENT RESULTS! limbo: {:?}, sqlite: {:?}, seed: {}, query: {}, table def: {}", limbo, sqlite, seed, query, table_defs[i] ); } } } } #[test] pub fn arithmetic_expression_fuzz() { let _ = env_logger::try_init(); let g = GrammarGenerator::new(); let (expr, expr_builder) = g.create_handle(); let (bin_op, bin_op_builder) = g.create_handle(); let (unary_op, unary_op_builder) = g.create_handle(); let (paren, paren_builder) = g.create_handle(); paren_builder .concat("") .push_str("(") .push(expr) .push_str(")") .build(); unary_op_builder .concat(" ") .push(g.create().choice().options_str(["~", "+", "-"]).build()) .push(expr) .build(); bin_op_builder .concat(" ") .push(expr) .push( g.create() .choice() .options_str(["+", "-", "*", "/", "%", "&", "|", "<<", ">>"]) .build(), ) .push(expr) .build(); expr_builder .choice() .option_w(unary_op, 1.0) .option_w(bin_op, 1.0) .option_w(paren, 1.0) .option_symbol_w(rand_int(-10..10), 1.0) .build(); let sql = g.create().concat(" ").push_str("SELECT").push(expr).build(); let db = TempDatabase::new_empty(); let limbo_conn = db.connect_limbo(); let sqlite_conn = rusqlite::Connection::open_in_memory().unwrap(); let (mut rng, seed) = rng_from_time(); log::info!("seed: {}", seed); for _ in 0..1024 { let query = g.generate(&mut rng, sql, 50); let limbo = limbo_exec_rows(&db, &limbo_conn, &query); let sqlite = sqlite_exec_rows(&sqlite_conn, &query); assert_eq!( limbo, sqlite, "query: {}, limbo: {:?}, sqlite: {:?} seed: {}", query, limbo, sqlite, seed ); } } #[test] pub fn fuzz_ex() { let _ = env_logger::try_init(); let db = TempDatabase::new_empty(); let limbo_conn = db.connect_limbo(); let sqlite_conn = rusqlite::Connection::open_in_memory().unwrap(); for query in [ "SELECT FALSE", "SELECT NOT FALSE", "SELECT ((NULL) IS NOT TRUE <= ((NOT (FALSE))))", "SELECT ifnull(0, NOT 0)", "SELECT like('a%', 'a') = 1", "SELECT CASE ( NULL < NULL ) WHEN ( 0 ) THEN ( NULL ) ELSE ( 2.0 ) END;", "SELECT (COALESCE(0, COALESCE(0, 0)));", "SELECT CAST((1 > 0) AS INTEGER);", "SELECT substr('ABC', -1)", ] { let limbo = limbo_exec_rows(&db, &limbo_conn, query); let sqlite = sqlite_exec_rows(&sqlite_conn, query); assert_eq!( limbo, sqlite, "query: {}, limbo: {:?}, sqlite: {:?}", query, limbo, sqlite ); } } #[test] pub fn math_expression_fuzz_run() { let _ = env_logger::try_init(); let g = GrammarGenerator::new(); let (expr, expr_builder) = g.create_handle(); let (bin_op, bin_op_builder) = g.create_handle(); let (scalar, scalar_builder) = g.create_handle(); let (paren, paren_builder) = g.create_handle(); paren_builder .concat("") .push_str("(") .push(expr) .push_str(")") .build(); bin_op_builder .concat(" ") .push(expr) .push( g.create() .choice() .options_str(["+", "-", "/", "*"]) .build(), ) .push(expr) .build(); scalar_builder .choice() .option( g.create() .concat("") .push( g.create() .choice() .options_str([ "acos", "acosh", "asin", "asinh", "atan", "atanh", "ceil", "ceiling", "cos", "cosh", "degrees", "exp", "floor", "ln", "log", "log10", "log2", "radians", "sin", "sinh", "sqrt", "tan", "tanh", "trunc", ]) .build(), ) .push_str("(") .push(expr) .push_str(")") .build(), ) .option( g.create() .concat("") .push( g.create() .choice() .options_str(["atan2", "log", "mod", "pow", "power"]) .build(), ) .push_str("(") .push(g.create().concat("").push(expr).repeat(2..3, ", ").build()) .push_str(")") .build(), ) .build(); expr_builder .choice() .options_str(["-2.0", "-1.0", "0.0", "0.5", "1.0", "2.0"]) .option_w(bin_op, 10.0) .option_w(paren, 10.0) .option_w(scalar, 10.0) .build(); let sql = g.create().concat(" ").push_str("SELECT").push(expr).build(); let db = TempDatabase::new_empty(); let limbo_conn = db.connect_limbo(); let sqlite_conn = rusqlite::Connection::open_in_memory().unwrap(); let (mut rng, seed) = rng_from_time(); log::info!("seed: {}", seed); for _ in 0..1024 { let query = g.generate(&mut rng, sql, 50); log::info!("query: {}", query); let limbo = limbo_exec_rows(&db, &limbo_conn, &query); let sqlite = sqlite_exec_rows(&sqlite_conn, &query); match (&limbo[0][0], &sqlite[0][0]) { // compare only finite results because some evaluations are not so stable around infinity (rusqlite::types::Value::Real(limbo), rusqlite::types::Value::Real(sqlite)) if limbo.is_finite() && sqlite.is_finite() => { assert!( (limbo - sqlite).abs() < 1e-9 || (limbo - sqlite) / (limbo.abs().max(sqlite.abs())) < 1e-9, "query: {}, limbo: {:?}, sqlite: {:?} seed: {}", query, limbo, sqlite, seed ) } _ => {} } } } #[test] pub fn string_expression_fuzz_run() { let _ = env_logger::try_init(); let g = GrammarGenerator::new(); let (expr, expr_builder) = g.create_handle(); let (bin_op, bin_op_builder) = g.create_handle(); let (scalar, scalar_builder) = g.create_handle(); let (paren, paren_builder) = g.create_handle(); let (number, number_builder) = g.create_handle(); number_builder .choice() .option_symbol(rand_int(-5..10)) .option( g.create() .concat(" ") .push(number) .push(g.create().choice().options_str(["+", "-", "*"]).build()) .push(number) .build(), ) .build(); paren_builder .concat("") .push_str("(") .push(expr) .push_str(")") .build(); bin_op_builder .concat(" ") .push(expr) .push(g.create().choice().options_str(["||"]).build()) .push(expr) .build(); scalar_builder .choice() .option( g.create() .concat("") .push_str("char(") .push( g.create() .concat("") .push_symbol(rand_int(65..91)) .repeat(1..8, ", ") .build(), ) .push_str(")") .build(), ) .option( g.create() .concat("") .push( g.create() .choice() .options_str(["ltrim", "rtrim", "trim"]) .build(), ) .push_str("(") .push(g.create().concat("").push(expr).repeat(2..3, ", ").build()) .push_str(")") .build(), ) .option( g.create() .concat("") .push( g.create() .choice() .options_str([ "ltrim", "rtrim", "lower", "upper", "quote", "hex", "trim", ]) .build(), ) .push_str("(") .push(expr) .push_str(")") .build(), ) .option( g.create() .concat("") .push(g.create().choice().options_str(["replace"]).build()) .push_str("(") .push(g.create().concat("").push(expr).repeat(3..4, ", ").build()) .push_str(")") .build(), ) .option( g.create() .concat("") .push( g.create() .choice() .options_str(["substr", "substring"]) .build(), ) .push_str("(") .push(expr) .push_str(", ") .push( g.create() .concat("") .push(number) .repeat(1..3, ", ") .build(), ) .push_str(")") .build(), ) .build(); expr_builder .choice() .option_w(bin_op, 1.0) .option_w(paren, 1.0) .option_w(scalar, 1.0) .option( g.create() .concat("") .push_str("'") .push_symbol(rand_str("", 2)) .push_str("'") .build(), ) .build(); let sql = g.create().concat(" ").push_str("SELECT").push(expr).build(); let db = TempDatabase::new_empty(); let limbo_conn = db.connect_limbo(); let sqlite_conn = rusqlite::Connection::open_in_memory().unwrap(); let (mut rng, seed) = rng_from_time(); log::info!("seed: {}", seed); for _ in 0..1024 { let query = g.generate(&mut rng, sql, 50); log::info!("query: {}", query); let limbo = limbo_exec_rows(&db, &limbo_conn, &query); let sqlite = sqlite_exec_rows(&sqlite_conn, &query); assert_eq!( limbo, sqlite, "query: {}, limbo: {:?}, sqlite: {:?} seed: {}", query, limbo, sqlite, seed ); } } struct TestTable { pub name: &'static str, pub columns: Vec<&'static str>, } /// Expressions that can be used in both SELECT and WHERE positions. struct CommonBuilders { pub bin_op: SymbolHandle, pub unary_infix_op: SymbolHandle, pub scalar: SymbolHandle, pub paren: SymbolHandle, pub coalesce_expr: SymbolHandle, pub cast_expr: SymbolHandle, pub case_expr: SymbolHandle, pub cmp_op: SymbolHandle, pub number: SymbolHandle, } /// Expressions that can be used only in WHERE position due to Limbo limitations. struct PredicateBuilders { pub in_op: SymbolHandle, } fn common_builders(g: &GrammarGenerator, tables: Option<&[TestTable]>) -> CommonBuilders { let (expr, expr_builder) = g.create_handle(); let (bin_op, bin_op_builder) = g.create_handle(); let (unary_infix_op, unary_infix_op_builder) = g.create_handle(); let (scalar, scalar_builder) = g.create_handle(); let (paren, paren_builder) = g.create_handle(); let (like_pattern, like_pattern_builder) = g.create_handle(); let (glob_pattern, glob_pattern_builder) = g.create_handle(); let (coalesce_expr, coalesce_expr_builder) = g.create_handle(); let (cast_expr, cast_expr_builder) = g.create_handle(); let (case_expr, case_expr_builder) = g.create_handle(); let (cmp_op, cmp_op_builder) = g.create_handle(); let (column, column_builder) = g.create_handle(); paren_builder .concat("") .push_str("(") .push(expr) .push_str(")") .build(); unary_infix_op_builder .concat(" ") .push(g.create().choice().options_str(["NOT"]).build()) .push(expr) .build(); bin_op_builder .concat(" ") .push(expr) .push( g.create() .choice() .options_str(["AND", "OR", "IS", "IS NOT", "=", "<>", ">", "<", ">=", "<="]) .build(), ) .push(expr) .build(); like_pattern_builder .choice() .option_str("%") .option_str("_") .option_symbol(rand_str("", 1)) .repeat(1..10, "") .build(); glob_pattern_builder .choice() .option_str("*") .option_str("**") .option_str("A") .option_str("B") .repeat(1..10, "") .build(); coalesce_expr_builder .concat("") .push_str("COALESCE(") .push(g.create().concat("").push(expr).repeat(2..5, ",").build()) .push_str(")") .build(); cast_expr_builder .concat(" ") .push_str("CAST ( (") .push(expr) .push_str(") AS ") // cast to INTEGER/REAL/TEXT types can be added when Limbo will use proper equality semantic between values (e.g. 1 = 1.0) .push(g.create().choice().options_str(["NUMERIC"]).build()) .push_str(")") .build(); case_expr_builder .concat(" ") .push_str("CASE (") .push(expr) .push_str(")") .push( g.create() .concat(" ") .push_str("WHEN (") .push(expr) .push_str(") THEN (") .push(expr) .push_str(")") .repeat(1..5, " ") .build(), ) .push_str("ELSE (") .push(expr) .push_str(") END") .build(); scalar_builder .choice() .option(coalesce_expr) .option( g.create() .concat("") .push_str("like('") .push(like_pattern) .push_str("', '") .push(like_pattern) .push_str("')") .build(), ) .option( g.create() .concat("") .push_str("glob('") .push(glob_pattern) .push_str("', '") .push(glob_pattern) .push_str("')") .build(), ) .option( g.create() .concat("") .push_str("ifnull(") .push(expr) .push_str(",") .push(expr) .push_str(")") .build(), ) .option( g.create() .concat("") .push_str("iif(") .push(expr) .push_str(",") .push(expr) .push_str(",") .push(expr) .push_str(")") .build(), ) .build(); let number = g .create() .choice() .option_symbol(rand_int(-0xff..0x100)) .option_symbol(rand_int(-0xffff..0x10000)) .option_symbol(rand_int(-0xffffff..0x1000000)) .option_symbol(rand_int(-0xffffffff..0x100000000)) .option_symbol(rand_int(-0xffffffffffff..0x1000000000000)) .build(); let mut column_builder = column_builder .choice() .option( g.create() .concat(" ") .push_str("(") .push(column) .push_str(")") .build(), ) .option(number) .option( g.create() .concat(" ") .push_str("(") .push(column) .push( g.create() .choice() .options_str([ "+", "-", "*", "/", "||", "=", "<>", ">", "<", ">=", "<=", "IS", "IS NOT", ]) .build(), ) .push(column) .push_str(")") .build(), ); if let Some(tables) = tables { for table in tables.iter() { for column in table.columns.iter() { column_builder = column_builder .option_symbol_w(const_str(&format!("{}.{}", table.name, column)), 1.0); } } } column_builder.build(); cmp_op_builder .concat(" ") .push(column) .push( g.create() .choice() .options_str(["=", "<>", ">", "<", ">=", "<=", "IS", "IS NOT"]) .build(), ) .push(column) .build(); expr_builder .choice() .option_w(bin_op, 3.0) .option_w(unary_infix_op, 2.0) .option_w(paren, 2.0) .option_w(scalar, 4.0) .option_w(coalesce_expr, 1.0) .option_w(cast_expr, 1.0) .option_w(case_expr, 1.0) .option_w(cmp_op, 1.0) .options_str(["1", "0", "NULL", "2.0", "1.5", "-0.5", "-2.0", "(1 / 0)"]) .build(); CommonBuilders { bin_op, unary_infix_op, scalar, paren, coalesce_expr, cast_expr, case_expr, cmp_op, number, } } fn predicate_builders(g: &GrammarGenerator, tables: Option<&[TestTable]>) -> PredicateBuilders { let (in_op, in_op_builder) = g.create_handle(); let (column, column_builder) = g.create_handle(); let mut column_builder = column_builder .choice() .option( g.create() .concat(" ") .push_str("(") .push(column) .push_str(")") .build(), ) .option_symbol(rand_int(-0xffffffff..0x100000000)) .option( g.create() .concat(" ") .push_str("(") .push(column) .push(g.create().choice().options_str(["+", "-"]).build()) .push(column) .push_str(")") .build(), ); if let Some(tables) = tables { for table in tables.iter() { for column in table.columns.iter() { column_builder = column_builder .option_symbol_w(const_str(&format!("{}.{}", table.name, column)), 1.0); } } } column_builder.build(); in_op_builder .concat(" ") .push(column) .push(g.create().choice().options_str(["IN", "NOT IN"]).build()) .push_str("(") .push( g.create() .concat("") .push(column) .repeat(1..5, ", ") .build(), ) .push_str(")") .build(); PredicateBuilders { in_op } } fn build_logical_expr( g: &GrammarGenerator, common: &CommonBuilders, predicate: Option<&PredicateBuilders>, ) -> SymbolHandle { let (handle, builder) = g.create_handle(); let mut builder = builder .choice() .option_w(common.cast_expr, 1.0) .option_w(common.case_expr, 1.0) .option_w(common.cmp_op, 1.0) .option_w(common.coalesce_expr, 1.0) .option_w(common.unary_infix_op, 2.0) .option_w(common.bin_op, 3.0) .option_w(common.paren, 2.0) .option_w(common.scalar, 4.0) // unfortunately, sqlite behaves weirdly when IS operator is used with TRUE/FALSE constants // e.g. 8 IS TRUE == 1 (although 8 = TRUE == 0) // so, we do not use TRUE/FALSE constants as they will produce diff with sqlite results .options_str(["1", "0", "NULL", "2.0", "1.5", "-0.5", "-2.0", "(1 / 0)"]); if let Some(predicate) = predicate { builder = builder.option_w(predicate.in_op, 1.0); } builder.build(); handle } #[test] pub fn logical_expression_fuzz_run() { let _ = env_logger::try_init(); let g = GrammarGenerator::new(); let builders = common_builders(&g, None); let expr = build_logical_expr(&g, &builders, None); let sql = g .create() .concat(" ") .push_str("SELECT ") .push(expr) .build(); let db = TempDatabase::new_empty(); let limbo_conn = db.connect_limbo(); let sqlite_conn = rusqlite::Connection::open_in_memory().unwrap(); let (mut rng, seed) = rng_from_time(); log::info!("seed: {}", seed); for _ in 0..1024 { let query = g.generate(&mut rng, sql, 50); log::info!("query: {}", query); let limbo = limbo_exec_rows(&db, &limbo_conn, &query); let sqlite = sqlite_exec_rows(&sqlite_conn, &query); assert_eq!( limbo, sqlite, "query: {}, limbo: {:?}, sqlite: {:?} seed: {}", query, limbo, sqlite, seed ); } } #[test] pub fn table_logical_expression_fuzz_ex1() { let _ = env_logger::try_init(); for queries in [ [ "CREATE TABLE t(x)", "INSERT INTO t VALUES (10)", "SELECT * FROM t WHERE x = 1 AND 1 OR 0", ], [ "CREATE TABLE t(x)", "INSERT INTO t VALUES (-3258184727)", "SELECT * FROM t", ], ] { let db = TempDatabase::new_empty(); let limbo_conn = db.connect_limbo(); let sqlite_conn = rusqlite::Connection::open_in_memory().unwrap(); for query in queries.iter() { let limbo = limbo_exec_rows(&db, &limbo_conn, query); let sqlite = sqlite_exec_rows(&sqlite_conn, query); assert_eq!( limbo, sqlite, "queries: {:?}, query: {}, limbo: {:?}, sqlite: {:?}", queries, query, limbo, sqlite ); } } } #[test] pub fn table_logical_expression_fuzz_run() { let _ = env_logger::try_init(); let g = GrammarGenerator::new(); let tables = vec![TestTable { name: "t", columns: vec!["x", "y", "z"], }]; let builders = common_builders(&g, Some(&tables)); let predicate = predicate_builders(&g, Some(&tables)); let expr = build_logical_expr(&g, &builders, Some(&predicate)); let db = TempDatabase::new_empty(); let limbo_conn = db.connect_limbo(); let sqlite_conn = rusqlite::Connection::open_in_memory().unwrap(); for table in tables.iter() { let columns_with_first_column_as_pk = { let mut columns = vec![]; columns.push(format!("{} PRIMARY KEY", table.columns[0])); columns.extend(table.columns[1..].iter().map(|c| c.to_string())); columns.join(", ") }; let query = format!( "CREATE TABLE {} ({})", table.name, columns_with_first_column_as_pk ); let limbo = limbo_exec_rows(&db, &limbo_conn, &query); let sqlite = sqlite_exec_rows(&sqlite_conn, &query); assert_eq!( limbo, sqlite, "query: {}, limbo: {:?}, sqlite: {:?}", query, limbo, sqlite ); } let (mut rng, seed) = rng_from_time(); log::info!("seed: {}", seed); let mut i = 0; let mut primary_key_set = HashSet::with_capacity(100); while i < 100 { let x = g.generate(&mut rng, builders.number, 1); if primary_key_set.contains(&x) { continue; } primary_key_set.insert(x.clone()); let (y, z) = ( g.generate(&mut rng, builders.number, 1), g.generate(&mut rng, builders.number, 1), ); let query = format!("INSERT INTO t VALUES ({}, {}, {})", x, y, z); log::info!("insert: {}", query); assert_eq!( limbo_exec_rows(&db, &limbo_conn, &query), sqlite_exec_rows(&sqlite_conn, &query), "seed: {}", seed, ); i += 1; } // verify the same number of rows in both tables let query = format!("SELECT COUNT(*) FROM t"); let limbo = limbo_exec_rows(&db, &limbo_conn, &query); let sqlite = sqlite_exec_rows(&sqlite_conn, &query); assert_eq!(limbo, sqlite, "seed: {}", seed); let sql = g .create() .concat(" ") .push_str("SELECT * FROM t WHERE ") .push(expr) .build(); for _ in 0..1024 { let query = g.generate(&mut rng, sql, 50); log::info!("query: {}", query); let limbo = limbo_exec_rows(&db, &limbo_conn, &query); let sqlite = sqlite_exec_rows(&sqlite_conn, &query); if limbo.len() != sqlite.len() { panic!("MISMATCHING ROW COUNT (limbo: {}, sqlite: {}) for query: {}\n\n limbo: {:?}\n\n sqlite: {:?}", limbo.len(), sqlite.len(), query, limbo, sqlite); } // find first row where limbo and sqlite differ let diff_rows = limbo .iter() .zip(sqlite.iter()) .filter(|(l, s)| l != s) .collect::>(); if !diff_rows.is_empty() { // due to different choices in index usage (usually in these cases sqlite is smart enough to use an index and we aren't), // sqlite might return rows in a different order // check if all limbo rows are present in sqlite let all_present = limbo.iter().all(|l| sqlite.iter().any(|s| l == s)); if !all_present { panic!("MISMATCHING ROWS (limbo: {}, sqlite: {}) for query: {}\n\n limbo: {:?}\n\n sqlite: {:?}\n\n differences: {:?}", limbo.len(), sqlite.len(), query, limbo, sqlite, diff_rows); } } } } }