mirror of
https://github.com/aljazceru/turso.git
synced 2025-12-18 17:14:20 +01:00
1374 lines
57 KiB
Rust
1374 lines
57 KiB
Rust
use serde::{Deserialize, Serialize};
|
|
use turso_core::{types, LimboError};
|
|
use turso_sqlite3_parser::ast::{self};
|
|
|
|
use crate::{
|
|
generation::Shadow as _,
|
|
model::{
|
|
query::{
|
|
predicate::Predicate,
|
|
select::{
|
|
CompoundOperator, CompoundSelect, Distinctness, ResultColumn, SelectBody,
|
|
SelectInner,
|
|
},
|
|
transaction::{Begin, Commit, Rollback},
|
|
update::Update,
|
|
Create, Delete, Drop, Insert, Query, Select,
|
|
},
|
|
table::SimValue,
|
|
FAULT_ERROR_MSG,
|
|
},
|
|
runner::env::SimulatorEnv,
|
|
};
|
|
|
|
use super::{
|
|
frequency, pick, pick_index,
|
|
plan::{Assertion, Interaction, InteractionStats, ResultSet},
|
|
ArbitraryFrom,
|
|
};
|
|
|
|
/// Properties are representations of executable specifications
|
|
/// about the database behavior.
|
|
#[derive(Debug, Clone, Serialize, Deserialize)]
|
|
pub(crate) enum Property {
|
|
/// Insert-Select is a property in which the inserted row
|
|
/// must be in the resulting rows of a select query that has a
|
|
/// where clause that matches the inserted row.
|
|
/// The execution of the property is as follows
|
|
/// INSERT INTO <t> VALUES (...)
|
|
/// I_0
|
|
/// I_1
|
|
/// ...
|
|
/// I_n
|
|
/// SELECT * FROM <t> WHERE <predicate>
|
|
/// The interactions in the middle has the following constraints;
|
|
/// - There will be no errors in the middle interactions.
|
|
/// - The inserted row will not be deleted.
|
|
/// - The inserted row will not be updated.
|
|
/// - The table `t` will not be renamed, dropped, or altered.
|
|
InsertValuesSelect {
|
|
/// The insert query
|
|
insert: Insert,
|
|
/// Selected row index
|
|
row_index: usize,
|
|
/// Additional interactions in the middle of the property
|
|
queries: Vec<Query>,
|
|
/// The select query
|
|
select: Select,
|
|
/// Interactive query information if any
|
|
interactive: Option<InteractiveQueryInfo>,
|
|
},
|
|
/// Double Create Failure is a property in which creating
|
|
/// the same table twice leads to an error.
|
|
/// The execution of the property is as follows
|
|
/// CREATE TABLE <t> (...)
|
|
/// I_0
|
|
/// I_1
|
|
/// ...
|
|
/// I_n
|
|
/// CREATE TABLE <t> (...) -> Error
|
|
/// The interactions in the middle has the following constraints;
|
|
/// - There will be no errors in the middle interactions.
|
|
/// - Table `t` will not be renamed or dropped.
|
|
DoubleCreateFailure {
|
|
/// The create query
|
|
create: Create,
|
|
/// Additional interactions in the middle of the property
|
|
queries: Vec<Query>,
|
|
},
|
|
/// Select Limit is a property in which the select query
|
|
/// has a limit clause that is respected by the query.
|
|
/// The execution of the property is as follows
|
|
/// SELECT * FROM <t> WHERE <predicate> LIMIT <n>
|
|
/// This property is a single-interaction property.
|
|
/// The interaction has the following constraints;
|
|
/// - The select query will respect the limit clause.
|
|
SelectLimit {
|
|
/// The select query
|
|
select: Select,
|
|
},
|
|
/// Delete-Select is a property in which the deleted row
|
|
/// must not be in the resulting rows of a select query that has a
|
|
/// where clause that matches the deleted row. In practice, `p1` of
|
|
/// the delete query will be used as the predicate for the select query,
|
|
/// hence the select should return NO ROWS.
|
|
/// The execution of the property is as follows
|
|
/// DELETE FROM <t> WHERE <predicate>
|
|
/// I_0
|
|
/// I_1
|
|
/// ...
|
|
/// I_n
|
|
/// SELECT * FROM <t> WHERE <predicate>
|
|
/// The interactions in the middle has the following constraints;
|
|
/// - There will be no errors in the middle interactions.
|
|
/// - A row that holds for the predicate will not be inserted.
|
|
/// - The table `t` will not be renamed, dropped, or altered.
|
|
DeleteSelect {
|
|
table: String,
|
|
predicate: Predicate,
|
|
queries: Vec<Query>,
|
|
},
|
|
/// Drop-Select is a property in which selecting from a dropped table
|
|
/// should result in an error.
|
|
/// The execution of the property is as follows
|
|
/// DROP TABLE <t>
|
|
/// I_0
|
|
/// I_1
|
|
/// ...
|
|
/// I_n
|
|
/// SELECT * FROM <t> WHERE <predicate> -> Error
|
|
/// The interactions in the middle has the following constraints;
|
|
/// - There will be no errors in the middle interactions.
|
|
/// - The table `t` will not be created, no table will be renamed to `t`.
|
|
DropSelect {
|
|
table: String,
|
|
queries: Vec<Query>,
|
|
select: Select,
|
|
},
|
|
/// Select-Select-Optimizer is a property in which we test the optimizer by
|
|
/// running two equivalent select queries, one with `SELECT <predicate> from <t>`
|
|
/// and the other with `SELECT * from <t> WHERE <predicate>`. As highlighted by
|
|
/// Rigger et al. in Non-Optimizing Reference Engine Construction(NoREC), SQLite
|
|
/// tends to optimize `where` statements while keeping the result column expressions
|
|
/// unoptimized. This property is used to test the optimizer. The property is successful
|
|
/// if the two queries return the same number of rows.
|
|
SelectSelectOptimizer {
|
|
table: String,
|
|
predicate: Predicate,
|
|
},
|
|
/// Where-True-False-Null is a property that tests the boolean logic implementation
|
|
/// in the database. It relies on the fact that `P == true || P == false || P == null` should return true,
|
|
/// as SQLite uses a ternary logic system. This property is invented in "Finding Bugs in Database Systems via Query Partitioning"
|
|
/// by Rigger et al. and it is canonically called Ternary Logic Partitioning (TLP).
|
|
WhereTrueFalseNull {
|
|
select: Select,
|
|
predicate: Predicate,
|
|
},
|
|
/// UNION-ALL-Preserves-Cardinality is a property that tests the UNION ALL operator
|
|
/// implementation in the database. It relies on the fact that `SELECT * FROM <t
|
|
/// > WHERE <predicate> UNION ALL SELECT * FROM <t> WHERE <predicate>`
|
|
/// should return the same number of rows as `SELECT <predicate> FROM <t> WHERE <predicate>`.
|
|
/// > The property is succesfull when the UNION ALL of 2 select queries returns the same number of rows
|
|
/// > as the sum of the two select queries.
|
|
UNIONAllPreservesCardinality {
|
|
select: Select,
|
|
where_clause: Predicate,
|
|
},
|
|
/// FsyncNoWait is a property which tests if we do not loose any data after not waiting for fsync.
|
|
///
|
|
/// # Interactions
|
|
/// - Executes the `query` without waiting for fsync
|
|
/// - Drop all connections and Reopen the database
|
|
/// - Execute the `query` again
|
|
/// - Query tables to assert that the values were inserted
|
|
///
|
|
FsyncNoWait {
|
|
query: Query,
|
|
tables: Vec<String>,
|
|
},
|
|
FaultyQuery {
|
|
query: Query,
|
|
tables: Vec<String>,
|
|
},
|
|
}
|
|
|
|
#[derive(Debug, Clone, Serialize, Deserialize)]
|
|
pub struct InteractiveQueryInfo {
|
|
start_with_immediate: bool,
|
|
end_with_commit: bool,
|
|
}
|
|
|
|
impl Property {
|
|
pub(crate) fn name(&self) -> &str {
|
|
match self {
|
|
Property::InsertValuesSelect { .. } => "Insert-Values-Select",
|
|
Property::DoubleCreateFailure { .. } => "Double-Create-Failure",
|
|
Property::SelectLimit { .. } => "Select-Limit",
|
|
Property::DeleteSelect { .. } => "Delete-Select",
|
|
Property::DropSelect { .. } => "Drop-Select",
|
|
Property::SelectSelectOptimizer { .. } => "Select-Select-Optimizer",
|
|
Property::WhereTrueFalseNull { .. } => "Where-True-False-Null",
|
|
Property::FsyncNoWait { .. } => "FsyncNoWait",
|
|
Property::FaultyQuery { .. } => "FaultyQuery",
|
|
Property::UNIONAllPreservesCardinality { .. } => "UNION-All-Preserves-Cardinality",
|
|
}
|
|
}
|
|
/// interactions construct a list of interactions, which is an executable representation of the property.
|
|
/// the requirement of property -> vec<interaction> conversion emerges from the need to serialize the property,
|
|
/// and `interaction` cannot be serialized directly.
|
|
pub(crate) fn interactions(&self) -> Vec<Interaction> {
|
|
match self {
|
|
Property::InsertValuesSelect {
|
|
insert,
|
|
row_index,
|
|
queries,
|
|
select,
|
|
interactive,
|
|
} => {
|
|
let (table, values) = if let Insert::Values { table, values } = insert {
|
|
(table, values)
|
|
} else {
|
|
unreachable!(
|
|
"insert query should be Insert::Values for Insert-Values-Select property"
|
|
)
|
|
};
|
|
// Check that the insert query has at least 1 value
|
|
assert!(
|
|
!values.is_empty(),
|
|
"insert query should have at least 1 value"
|
|
);
|
|
|
|
// Pick a random row within the insert values
|
|
let row = values[*row_index].clone();
|
|
|
|
// Assume that the table exists
|
|
let assumption = Interaction::Assumption(Assertion {
|
|
name: format!("table {} exists", insert.table()),
|
|
func: Box::new({
|
|
let table_name = table.clone();
|
|
move |_: &Vec<ResultSet>, env: &mut SimulatorEnv| {
|
|
if env.tables.iter().any(|t| t.name == table_name) {
|
|
Ok(Ok(()))
|
|
} else {
|
|
Ok(Err(format!("table {table_name} does not exist")))
|
|
}
|
|
}
|
|
}),
|
|
});
|
|
|
|
let assertion = Interaction::Assertion(Assertion {
|
|
name: format!(
|
|
"row [{:?}] should be found in table {}, interactive={} commit={}, rollback={}",
|
|
row.iter().map(|v| v.to_string()).collect::<Vec<String>>(),
|
|
insert.table(),
|
|
interactive.is_some(),
|
|
interactive
|
|
.as_ref()
|
|
.map(|i| i.end_with_commit)
|
|
.unwrap_or(false),
|
|
interactive
|
|
.as_ref()
|
|
.map(|i| !i.end_with_commit)
|
|
.unwrap_or(false),
|
|
),
|
|
func: Box::new(move |stack: &Vec<ResultSet>, _| {
|
|
let rows = stack.last().unwrap();
|
|
match rows {
|
|
Ok(rows) => {
|
|
let found = rows.iter().any(|r| r == &row);
|
|
if found {
|
|
Ok(Ok(()))
|
|
} else {
|
|
Ok(Err(format!("row [{:?}] not found in table", row.iter().map(|v| v.to_string()).collect::<Vec<String>>())))
|
|
}
|
|
}
|
|
Err(err) => Err(LimboError::InternalError(err.to_string())),
|
|
}
|
|
}),
|
|
});
|
|
|
|
let mut interactions = Vec::new();
|
|
interactions.push(assumption);
|
|
interactions.push(Interaction::Query(Query::Insert(insert.clone())));
|
|
interactions.extend(queries.clone().into_iter().map(Interaction::Query));
|
|
interactions.push(Interaction::Query(Query::Select(select.clone())));
|
|
interactions.push(assertion);
|
|
|
|
interactions
|
|
}
|
|
Property::DoubleCreateFailure { create, queries } => {
|
|
let table_name = create.table.name.clone();
|
|
|
|
let assumption = Interaction::Assumption(Assertion {
|
|
name: "Double-Create-Failure should not be called on an existing table"
|
|
.to_string(),
|
|
func: Box::new(move |_: &Vec<ResultSet>, env: &mut SimulatorEnv| {
|
|
if !env.tables.iter().any(|t| t.name == table_name) {
|
|
Ok(Ok(()))
|
|
} else {
|
|
Ok(Err(format!("table {table_name} already exists")))
|
|
}
|
|
}),
|
|
});
|
|
|
|
let cq1 = Interaction::Query(Query::Create(create.clone()));
|
|
let cq2 = Interaction::Query(Query::Create(create.clone()));
|
|
|
|
let table_name = create.table.name.clone();
|
|
|
|
let assertion = Interaction::Assertion(Assertion {
|
|
name:
|
|
"creating two tables with the name should result in a failure for the second query"
|
|
.to_string(),
|
|
func: Box::new(move |stack: &Vec<ResultSet>, _| {
|
|
let last = stack.last().unwrap();
|
|
match last {
|
|
Ok(success) => Ok(Err(format!("expected table creation to fail but it succeeded: {success:?}"))),
|
|
Err(e) => {
|
|
if e.to_string().to_lowercase().contains(&format!("table {table_name} already exists")) {
|
|
Ok(Ok(()))
|
|
} else {
|
|
Ok(Err(format!("expected table already exists error, got: {e}")))
|
|
}
|
|
}
|
|
}
|
|
}),
|
|
});
|
|
|
|
let mut interactions = Vec::new();
|
|
interactions.push(assumption);
|
|
interactions.push(cq1);
|
|
interactions.extend(queries.clone().into_iter().map(Interaction::Query));
|
|
interactions.push(cq2);
|
|
interactions.push(assertion);
|
|
|
|
interactions
|
|
}
|
|
Property::SelectLimit { select } => {
|
|
let assumption = Interaction::Assumption(Assertion {
|
|
name: format!(
|
|
"table ({}) exists",
|
|
select
|
|
.dependencies()
|
|
.into_iter()
|
|
.collect::<Vec<_>>()
|
|
.join(", ")
|
|
),
|
|
func: Box::new({
|
|
let table_name = select.dependencies();
|
|
move |_: &Vec<ResultSet>, env: &mut SimulatorEnv| {
|
|
if table_name
|
|
.iter()
|
|
.all(|table| env.tables.iter().any(|t| t.name == *table))
|
|
{
|
|
Ok(Ok(()))
|
|
} else {
|
|
let missing_tables = table_name
|
|
.iter()
|
|
.filter(|t| !env.tables.iter().any(|t2| t2.name == **t))
|
|
.collect::<Vec<&String>>();
|
|
Ok(Err(format!("missing tables: {missing_tables:?}")))
|
|
}
|
|
}
|
|
}),
|
|
});
|
|
|
|
let limit = select
|
|
.limit
|
|
.expect("Property::SelectLimit without a LIMIT clause");
|
|
|
|
let assertion = Interaction::Assertion(Assertion {
|
|
name: "select query should respect the limit clause".to_string(),
|
|
func: Box::new(move |stack: &Vec<ResultSet>, _| {
|
|
let last = stack.last().unwrap();
|
|
match last {
|
|
Ok(rows) => {
|
|
if limit >= rows.len() {
|
|
Ok(Ok(()))
|
|
} else {
|
|
Ok(Err(format!(
|
|
"limit {} violated: got {} rows",
|
|
limit,
|
|
rows.len()
|
|
)))
|
|
}
|
|
}
|
|
Err(_) => Ok(Ok(())),
|
|
}
|
|
}),
|
|
});
|
|
|
|
vec![
|
|
assumption,
|
|
Interaction::Query(Query::Select(select.clone())),
|
|
assertion,
|
|
]
|
|
}
|
|
Property::DeleteSelect {
|
|
table,
|
|
predicate,
|
|
queries,
|
|
} => {
|
|
let assumption = Interaction::Assumption(Assertion {
|
|
name: format!("table {table} exists"),
|
|
func: Box::new({
|
|
let table = table.clone();
|
|
move |_: &Vec<ResultSet>, env: &mut SimulatorEnv| {
|
|
if env.tables.iter().any(|t| t.name == table) {
|
|
Ok(Ok(()))
|
|
} else {
|
|
{
|
|
let available_tables: Vec<String> =
|
|
env.tables.iter().map(|t| t.name.clone()).collect();
|
|
Ok(Err(format!(
|
|
"table \'{table}\' not found. Available tables: {available_tables:?}"
|
|
)))
|
|
}
|
|
}
|
|
}
|
|
}),
|
|
});
|
|
|
|
let delete = Interaction::Query(Query::Delete(Delete {
|
|
table: table.clone(),
|
|
predicate: predicate.clone(),
|
|
}));
|
|
|
|
let select = Interaction::Query(Query::Select(Select::simple(
|
|
table.clone(),
|
|
predicate.clone(),
|
|
)));
|
|
|
|
let assertion = Interaction::Assertion(Assertion {
|
|
name: format!("`{select}` should return no values for table `{table}`",),
|
|
func: Box::new(move |stack: &Vec<ResultSet>, _| {
|
|
let rows = stack.last().unwrap();
|
|
match rows {
|
|
Ok(rows) => {
|
|
if rows.is_empty() {
|
|
Ok(Ok(()))
|
|
} else {
|
|
Ok(Err(format!(
|
|
"expected no rows but got {} rows: {:?}",
|
|
rows.len(),
|
|
rows.iter()
|
|
.map(|r| print_row(r))
|
|
.collect::<Vec<String>>()
|
|
.join(", ")
|
|
)))
|
|
}
|
|
}
|
|
Err(err) => Err(LimboError::InternalError(err.to_string())),
|
|
}
|
|
}),
|
|
});
|
|
|
|
let mut interactions = Vec::new();
|
|
interactions.push(assumption);
|
|
interactions.push(delete);
|
|
interactions.extend(queries.clone().into_iter().map(Interaction::Query));
|
|
interactions.push(select);
|
|
interactions.push(assertion);
|
|
|
|
interactions
|
|
}
|
|
Property::DropSelect {
|
|
table,
|
|
queries,
|
|
select,
|
|
} => {
|
|
let assumption = Interaction::Assumption(Assertion {
|
|
name: format!("table {table} exists"),
|
|
func: Box::new({
|
|
let table = table.clone();
|
|
move |_, env: &mut SimulatorEnv| {
|
|
if env.tables.iter().any(|t| t.name == table) {
|
|
Ok(Ok(()))
|
|
} else {
|
|
{
|
|
let available_tables: Vec<String> =
|
|
env.tables.iter().map(|t| t.name.clone()).collect();
|
|
Ok(Err(format!(
|
|
"table \'{table}\' not found. Available tables: {available_tables:?}"
|
|
)))
|
|
}
|
|
}
|
|
}
|
|
}),
|
|
});
|
|
|
|
let table_name = table.clone();
|
|
|
|
let assertion = Interaction::Assertion(Assertion {
|
|
name: format!("select query should result in an error for table '{table}'"),
|
|
func: Box::new(move |stack: &Vec<ResultSet>, _| {
|
|
let last = stack.last().unwrap();
|
|
match last {
|
|
Ok(success) => Ok(Err(format!(
|
|
"expected table creation to fail but it succeeded: {success:?}"
|
|
))),
|
|
Err(e) => {
|
|
if e.to_string()
|
|
.contains(&format!("Table {table_name} does not exist"))
|
|
{
|
|
Ok(Ok(()))
|
|
} else {
|
|
Ok(Err(format!(
|
|
"expected table does not exist error, got: {e}"
|
|
)))
|
|
}
|
|
}
|
|
}
|
|
}),
|
|
});
|
|
|
|
let drop = Interaction::Query(Query::Drop(Drop {
|
|
table: table.clone(),
|
|
}));
|
|
|
|
let select = Interaction::Query(Query::Select(select.clone()));
|
|
|
|
let mut interactions = Vec::new();
|
|
|
|
interactions.push(assumption);
|
|
interactions.push(drop);
|
|
interactions.extend(queries.clone().into_iter().map(Interaction::Query));
|
|
interactions.push(select);
|
|
interactions.push(assertion);
|
|
|
|
interactions
|
|
}
|
|
Property::SelectSelectOptimizer { table, predicate } => {
|
|
let assumption = Interaction::Assumption(Assertion {
|
|
name: format!("table {table} exists"),
|
|
func: Box::new({
|
|
let table = table.clone();
|
|
move |_: &Vec<ResultSet>, env: &mut SimulatorEnv| {
|
|
if env.tables.iter().any(|t| t.name == table) {
|
|
Ok(Ok(()))
|
|
} else {
|
|
{
|
|
let available_tables: Vec<String> =
|
|
env.tables.iter().map(|t| t.name.clone()).collect();
|
|
Ok(Err(format!(
|
|
"table \'{table}\' not found. Available tables: {available_tables:?}"
|
|
)))
|
|
}
|
|
}
|
|
}
|
|
}),
|
|
});
|
|
|
|
let select1 = Interaction::Query(Query::Select(Select::single(
|
|
table.clone(),
|
|
vec![ResultColumn::Expr(predicate.clone())],
|
|
Predicate::true_(),
|
|
None,
|
|
Distinctness::All,
|
|
)));
|
|
|
|
let select2_query = Query::Select(Select::simple(table.clone(), predicate.clone()));
|
|
|
|
let select2 = Interaction::Query(select2_query);
|
|
|
|
let assertion = Interaction::Assertion(Assertion {
|
|
name: "select queries should return the same amount of results".to_string(),
|
|
func: Box::new(move |stack: &Vec<ResultSet>, _| {
|
|
let select_star = stack.last().unwrap();
|
|
let select_predicate = stack.get(stack.len() - 2).unwrap();
|
|
match (select_predicate, select_star) {
|
|
(Ok(rows1), Ok(rows2)) => {
|
|
// If rows1 results have more than 1 column, there is a problem
|
|
if rows1.iter().any(|vs| vs.len() > 1) {
|
|
return Err(LimboError::InternalError(
|
|
"Select query without the star should return only one column".to_string(),
|
|
));
|
|
}
|
|
// Count the 1s in the select query without the star
|
|
let rows1_count = rows1
|
|
.iter()
|
|
.filter(|vs| {
|
|
let v = vs.first().unwrap();
|
|
v.as_bool()
|
|
})
|
|
.count();
|
|
tracing::debug!(
|
|
"select1 returned {} rows, select2 returned {} rows",
|
|
rows1_count,
|
|
rows2.len()
|
|
);
|
|
if rows1_count == rows2.len() {
|
|
Ok(Ok(()))
|
|
} else {
|
|
Ok(Err(format!(
|
|
"row counts don't match: {} vs {}",
|
|
rows1_count,
|
|
rows2.len()
|
|
)))
|
|
}
|
|
}
|
|
(Err(e1), Err(e2)) => {
|
|
tracing::debug!("Error in select1 AND select2: {}, {}", e1, e2);
|
|
Ok(Ok(()))
|
|
}
|
|
(Err(e), _) | (_, Err(e)) => {
|
|
tracing::error!("Error in select1 OR select2: {}", e);
|
|
Err(LimboError::InternalError(e.to_string()))
|
|
}
|
|
}
|
|
}),
|
|
});
|
|
|
|
vec![assumption, select1, select2, assertion]
|
|
}
|
|
Property::FsyncNoWait { query, tables } => {
|
|
let checks = assert_all_table_values(tables);
|
|
Vec::from_iter(
|
|
std::iter::once(Interaction::FsyncQuery(query.clone())).chain(checks),
|
|
)
|
|
}
|
|
Property::FaultyQuery { query, tables } => {
|
|
let checks = assert_all_table_values(tables);
|
|
let query_clone = query.clone();
|
|
let assert = Assertion {
|
|
// A fault may not occur as we first signal we want a fault injected,
|
|
// then when IO is called the fault triggers. It may happen that a fault is injected
|
|
// but no IO happens right after it
|
|
name: "fault occured".to_string(),
|
|
func: Box::new(move |stack, env: &mut SimulatorEnv| {
|
|
let last = stack.last().unwrap();
|
|
match last {
|
|
Ok(_) => {
|
|
let _ = query_clone.shadow(&mut env.tables);
|
|
Ok(Ok(()))
|
|
}
|
|
Err(err) => {
|
|
let msg = format!("{err}");
|
|
if msg.contains(FAULT_ERROR_MSG) {
|
|
Ok(Ok(()))
|
|
} else {
|
|
Err(LimboError::InternalError(msg))
|
|
}
|
|
}
|
|
}
|
|
}),
|
|
};
|
|
let first = [
|
|
Interaction::FaultyQuery(query.clone()),
|
|
Interaction::Assertion(assert),
|
|
]
|
|
.into_iter();
|
|
Vec::from_iter(first.chain(checks))
|
|
}
|
|
Property::WhereTrueFalseNull { select, predicate } => {
|
|
let assumption = Interaction::Assumption(Assertion {
|
|
name: format!(
|
|
"tables ({}) exists",
|
|
select
|
|
.dependencies()
|
|
.into_iter()
|
|
.collect::<Vec<_>>()
|
|
.join(", ")
|
|
),
|
|
func: Box::new({
|
|
let tables = select.dependencies();
|
|
move |_: &Vec<ResultSet>, env: &mut SimulatorEnv| {
|
|
if tables
|
|
.iter()
|
|
.all(|table| env.tables.iter().any(|t| t.name == *table))
|
|
{
|
|
Ok(Ok(()))
|
|
} else {
|
|
let missing_tables = tables
|
|
.iter()
|
|
.filter(|t| !env.tables.iter().any(|t2| t2.name == **t))
|
|
.collect::<Vec<&String>>();
|
|
Ok(Err(format!("missing tables: {missing_tables:?}")))
|
|
}
|
|
}
|
|
}),
|
|
});
|
|
|
|
let old_predicate = select.body.select.where_clause.clone();
|
|
|
|
let p_true = Predicate::and(vec![old_predicate.clone(), predicate.clone()]);
|
|
let p_false = Predicate::and(vec![
|
|
old_predicate.clone(),
|
|
Predicate::not(predicate.clone()),
|
|
]);
|
|
let p_null = Predicate::and(vec![
|
|
old_predicate.clone(),
|
|
Predicate::is(predicate.clone(), Predicate::null()),
|
|
]);
|
|
|
|
let select_tlp = Select {
|
|
body: SelectBody {
|
|
select: Box::new(SelectInner {
|
|
distinctness: select.body.select.distinctness,
|
|
columns: select.body.select.columns.clone(),
|
|
from: select.body.select.from.clone(),
|
|
where_clause: p_true,
|
|
order_by: None,
|
|
}),
|
|
compounds: vec![
|
|
CompoundSelect {
|
|
operator: CompoundOperator::UnionAll,
|
|
select: Box::new(SelectInner {
|
|
distinctness: select.body.select.distinctness,
|
|
columns: select.body.select.columns.clone(),
|
|
from: select.body.select.from.clone(),
|
|
where_clause: p_false,
|
|
order_by: None,
|
|
}),
|
|
},
|
|
CompoundSelect {
|
|
operator: CompoundOperator::UnionAll,
|
|
select: Box::new(SelectInner {
|
|
distinctness: select.body.select.distinctness,
|
|
columns: select.body.select.columns.clone(),
|
|
from: select.body.select.from.clone(),
|
|
where_clause: p_null,
|
|
order_by: None,
|
|
}),
|
|
},
|
|
],
|
|
},
|
|
limit: None,
|
|
};
|
|
|
|
let select = Interaction::Query(Query::Select(select.clone()));
|
|
let select_tlp = Interaction::Query(Query::Select(select_tlp));
|
|
|
|
// select and select_tlp should return the same rows
|
|
let assertion = Interaction::Assertion(Assertion {
|
|
name: "select and select_tlp should return the same rows".to_string(),
|
|
func: Box::new(move |stack: &Vec<ResultSet>, _: &mut SimulatorEnv| {
|
|
if stack.len() < 2 {
|
|
return Err(LimboError::InternalError(
|
|
"Not enough result sets on the stack".to_string(),
|
|
));
|
|
}
|
|
|
|
let select_result_set = stack.get(stack.len() - 2).unwrap();
|
|
let select_tlp_result_set = stack.last().unwrap();
|
|
|
|
match (select_result_set, select_tlp_result_set) {
|
|
(Ok(select_rows), Ok(select_tlp_rows)) => {
|
|
if select_rows.len() != select_tlp_rows.len() {
|
|
return Ok(Err(format!("row count mismatch: select returned {} rows, select_tlp returned {} rows", select_rows.len(), select_tlp_rows.len())));
|
|
}
|
|
// Check if any row in select_rows is not in select_tlp_rows
|
|
for row in select_rows.iter() {
|
|
if !select_tlp_rows.iter().any(|r| r == row) {
|
|
tracing::debug!(
|
|
"select and select_tlp returned different rows, ({}) is in select but not in select_tlp",
|
|
row.iter().map(|v| v.to_string()).collect::<Vec<String>>().join(", ")
|
|
);
|
|
return Ok(Err(format!(
|
|
"row mismatch: row [{}] exists in select results but not in select_tlp results",
|
|
print_row(row)
|
|
)));
|
|
}
|
|
}
|
|
// Check if any row in select_tlp_rows is not in select_rows
|
|
for row in select_tlp_rows.iter() {
|
|
if !select_rows.iter().any(|r| r == row) {
|
|
tracing::debug!(
|
|
"select and select_tlp returned different rows, ({}) is in select_tlp but not in select",
|
|
row.iter().map(|v| v.to_string()).collect::<Vec<String>>().join(", ")
|
|
);
|
|
|
|
return Ok(Err(format!(
|
|
"row mismatch: row [{}] exists in select_tlp but not in select",
|
|
print_row(row)
|
|
)));
|
|
}
|
|
}
|
|
// If we reach here, the rows are the same
|
|
tracing::trace!(
|
|
"select and select_tlp returned the same rows: {:?}",
|
|
select_rows
|
|
);
|
|
|
|
Ok(Ok(()))
|
|
}
|
|
(Err(e), _) | (_, Err(e)) => {
|
|
tracing::error!("Error in select or select_tlp: {}", e);
|
|
Err(LimboError::InternalError(e.to_string()))
|
|
}
|
|
}
|
|
}),
|
|
});
|
|
|
|
vec![assumption, select, select_tlp, assertion]
|
|
}
|
|
Property::UNIONAllPreservesCardinality {
|
|
select,
|
|
where_clause,
|
|
} => {
|
|
let s1 = select.clone();
|
|
let mut s2 = select.clone();
|
|
s2.body.select.where_clause = where_clause.clone();
|
|
let s3 = Select::compound(s1.clone(), s2.clone(), CompoundOperator::UnionAll);
|
|
|
|
vec![
|
|
Interaction::Query(Query::Select(s1.clone())),
|
|
Interaction::Query(Query::Select(s2.clone())),
|
|
Interaction::Query(Query::Select(s3.clone())),
|
|
Interaction::Assertion(Assertion {
|
|
name: "UNION ALL should preserve cardinality".to_string(),
|
|
func: Box::new(move |stack: &Vec<ResultSet>, _: &mut SimulatorEnv| {
|
|
if stack.len() < 3 {
|
|
return Err(LimboError::InternalError(
|
|
"Not enough result sets on the stack".to_string(),
|
|
));
|
|
}
|
|
|
|
let select1 = stack.get(stack.len() - 3).unwrap();
|
|
let select2 = stack.get(stack.len() - 2).unwrap();
|
|
let union_all = stack.last().unwrap();
|
|
|
|
match (select1, select2, union_all) {
|
|
(Ok(rows1), Ok(rows2), Ok(union_rows)) => {
|
|
let count1 = rows1.len();
|
|
let count2 = rows2.len();
|
|
let union_count = union_rows.len();
|
|
if union_count == count1 + count2 {
|
|
Ok(Ok(()))
|
|
} else {
|
|
Ok(Err(format!("UNION ALL should preserve cardinality but it didn't: {count1} + {count2} != {union_count}")))
|
|
}
|
|
}
|
|
(Err(e), _, _) | (_, Err(e), _) | (_, _, Err(e)) => {
|
|
tracing::error!("Error in select queries: {}", e);
|
|
Err(LimboError::InternalError(e.to_string()))
|
|
}
|
|
}
|
|
}),
|
|
}),
|
|
]
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
fn assert_all_table_values(tables: &[String]) -> impl Iterator<Item = Interaction> + use<'_> {
|
|
let checks = tables.iter().flat_map(|table| {
|
|
let select = Interaction::Query(Query::Select(Select::simple(
|
|
table.clone(),
|
|
Predicate::true_(),
|
|
)));
|
|
|
|
let assertion = Interaction::Assertion(Assertion {
|
|
name: format!("table {table} should contain all of its expected values"),
|
|
func: Box::new({
|
|
let table = table.clone();
|
|
move |stack: &Vec<ResultSet>, env: &mut SimulatorEnv| {
|
|
let table = env.tables.iter().find(|t| t.name == table).ok_or_else(|| {
|
|
LimboError::InternalError(format!(
|
|
"table {table} should exist in simulator env"
|
|
))
|
|
})?;
|
|
let last = stack.last().unwrap();
|
|
match last {
|
|
Ok(vals) => {
|
|
// Check if all values in the table are present in the result set
|
|
// Find a value in the table that is not in the result set
|
|
let model_contains_db = table.rows.iter().find(|v| {
|
|
!vals.iter().any(|r| {
|
|
&r == v
|
|
})
|
|
});
|
|
let db_contains_model = vals.iter().find(|v| {
|
|
!table.rows.iter().any(|r| &r == v)
|
|
});
|
|
|
|
if let Some(model_contains_db) = model_contains_db {
|
|
tracing::debug!(
|
|
"table {} does not contain the expected values, the simulator model has more rows than the database: {:?}",
|
|
table.name,
|
|
print_row(model_contains_db)
|
|
);
|
|
Ok(Err(format!("table {} does not contain the expected values, the simulator model has more rows than the database: {:?}", table.name, print_row(model_contains_db))))
|
|
} else if let Some(db_contains_model) = db_contains_model {
|
|
tracing::debug!(
|
|
"table {} does not contain the expected values, the database has more rows than the simulator model: {:?}",
|
|
table.name,
|
|
print_row(db_contains_model)
|
|
);
|
|
Ok(Err(format!("table {} does not contain the expected values, the database has more rows than the simulator model: {:?}", table.name, print_row(db_contains_model))))
|
|
} else {
|
|
Ok(Ok(()))
|
|
}
|
|
}
|
|
Err(err) => Err(LimboError::InternalError(format!("{err}"))),
|
|
}
|
|
}
|
|
}),
|
|
});
|
|
[select, assertion].into_iter()
|
|
});
|
|
checks
|
|
}
|
|
|
|
#[derive(Debug)]
|
|
pub(crate) struct Remaining {
|
|
pub(crate) read: f64,
|
|
pub(crate) write: f64,
|
|
pub(crate) create: f64,
|
|
pub(crate) create_index: f64,
|
|
pub(crate) delete: f64,
|
|
pub(crate) update: f64,
|
|
pub(crate) drop: f64,
|
|
}
|
|
|
|
pub(crate) fn remaining(env: &SimulatorEnv, stats: &InteractionStats) -> Remaining {
|
|
let remaining_read = ((env.opts.max_interactions as f64 * env.opts.read_percent / 100.0)
|
|
- (stats.read_count as f64))
|
|
.max(0.0);
|
|
let remaining_write = ((env.opts.max_interactions as f64 * env.opts.write_percent / 100.0)
|
|
- (stats.write_count as f64))
|
|
.max(0.0);
|
|
let remaining_create = ((env.opts.max_interactions as f64 * env.opts.create_percent / 100.0)
|
|
- (stats.create_count as f64))
|
|
.max(0.0);
|
|
|
|
let remaining_create_index =
|
|
((env.opts.max_interactions as f64 * env.opts.create_index_percent / 100.0)
|
|
- (stats.create_index_count as f64))
|
|
.max(0.0);
|
|
|
|
let remaining_delete = ((env.opts.max_interactions as f64 * env.opts.delete_percent / 100.0)
|
|
- (stats.delete_count as f64))
|
|
.max(0.0);
|
|
let remaining_update = ((env.opts.max_interactions as f64 * env.opts.update_percent / 100.0)
|
|
- (stats.update_count as f64))
|
|
.max(0.0);
|
|
let remaining_drop = ((env.opts.max_interactions as f64 * env.opts.drop_percent / 100.0)
|
|
- (stats.drop_count as f64))
|
|
.max(0.0);
|
|
|
|
Remaining {
|
|
read: remaining_read,
|
|
write: remaining_write,
|
|
create: remaining_create,
|
|
create_index: remaining_create_index,
|
|
delete: remaining_delete,
|
|
drop: remaining_drop,
|
|
update: remaining_update,
|
|
}
|
|
}
|
|
|
|
fn property_insert_values_select<R: rand::Rng>(
|
|
rng: &mut R,
|
|
env: &SimulatorEnv,
|
|
remaining: &Remaining,
|
|
) -> Property {
|
|
// Get a random table
|
|
let table = pick(&env.tables, rng);
|
|
// Generate rows to insert
|
|
let rows = (0..rng.gen_range(1..=5))
|
|
.map(|_| Vec::<SimValue>::arbitrary_from(rng, table))
|
|
.collect::<Vec<_>>();
|
|
|
|
// Pick a random row to select
|
|
let row_index = pick_index(rows.len(), rng);
|
|
let row = rows[row_index].clone();
|
|
|
|
// Insert the rows
|
|
let insert_query = Insert::Values {
|
|
table: table.name.clone(),
|
|
values: rows,
|
|
};
|
|
|
|
// Choose if we want queries to be executed in an interactive transaction
|
|
let interactive = if rng.gen_bool(0.5) {
|
|
Some(InteractiveQueryInfo {
|
|
start_with_immediate: rng.gen_bool(0.5),
|
|
end_with_commit: rng.gen_bool(0.5),
|
|
})
|
|
} else {
|
|
None
|
|
};
|
|
// Create random queries respecting the constraints
|
|
let mut queries = Vec::new();
|
|
// - [x] There will be no errors in the middle interactions. (this constraint is impossible to check, so this is just best effort)
|
|
// - [x] The inserted row will not be deleted.
|
|
// - [x] The inserted row will not be updated.
|
|
// - [ ] The table `t` will not be renamed, dropped, or altered. (todo: add this constraint once ALTER or DROP is implemented)
|
|
if let Some(ref interactive) = interactive {
|
|
queries.push(Query::Begin(Begin {
|
|
immediate: interactive.start_with_immediate,
|
|
}));
|
|
}
|
|
for _ in 0..rng.gen_range(0..3) {
|
|
let query = Query::arbitrary_from(rng, (env, remaining));
|
|
match &query {
|
|
Query::Delete(Delete {
|
|
table: t,
|
|
predicate,
|
|
}) => {
|
|
// The inserted row will not be deleted.
|
|
if t == &table.name && predicate.test(&row, table) {
|
|
continue;
|
|
}
|
|
}
|
|
Query::Create(Create { table: t }) => {
|
|
// There will be no errors in the middle interactions.
|
|
// - Creating the same table is an error
|
|
if t.name == table.name {
|
|
continue;
|
|
}
|
|
}
|
|
Query::Update(Update {
|
|
table: t,
|
|
set_values: _,
|
|
predicate,
|
|
}) => {
|
|
// The inserted row will not be updated.
|
|
if t == &table.name && predicate.test(&row, table) {
|
|
continue;
|
|
}
|
|
}
|
|
_ => (),
|
|
}
|
|
queries.push(query);
|
|
}
|
|
if let Some(ref interactive) = interactive {
|
|
queries.push(if interactive.end_with_commit {
|
|
Query::Commit(Commit)
|
|
} else {
|
|
Query::Rollback(Rollback)
|
|
});
|
|
}
|
|
|
|
// Select the row
|
|
let select_query = Select::simple(
|
|
table.name.clone(),
|
|
Predicate::arbitrary_from(rng, (table, &row)),
|
|
);
|
|
|
|
Property::InsertValuesSelect {
|
|
insert: insert_query,
|
|
row_index,
|
|
queries,
|
|
select: select_query,
|
|
interactive,
|
|
}
|
|
}
|
|
|
|
fn property_select_limit<R: rand::Rng>(rng: &mut R, env: &SimulatorEnv) -> Property {
|
|
// Get a random table
|
|
let table = pick(&env.tables, rng);
|
|
// Select the table
|
|
let select = Select::single(
|
|
table.name.clone(),
|
|
vec![ResultColumn::Star],
|
|
Predicate::arbitrary_from(rng, table),
|
|
Some(rng.gen_range(1..=5)),
|
|
Distinctness::All,
|
|
);
|
|
Property::SelectLimit { select }
|
|
}
|
|
|
|
fn property_double_create_failure<R: rand::Rng>(
|
|
rng: &mut R,
|
|
env: &SimulatorEnv,
|
|
remaining: &Remaining,
|
|
) -> Property {
|
|
// Get a random table
|
|
let table = pick(&env.tables, rng);
|
|
// Create the table
|
|
let create_query = Create {
|
|
table: table.clone(),
|
|
};
|
|
|
|
// Create random queries respecting the constraints
|
|
let mut queries = Vec::new();
|
|
// The interactions in the middle has the following constraints;
|
|
// - [x] There will be no errors in the middle interactions.(best effort)
|
|
// - [ ] Table `t` will not be renamed or dropped.(todo: add this constraint once ALTER or DROP is implemented)
|
|
for _ in 0..rng.gen_range(0..3) {
|
|
let query = Query::arbitrary_from(rng, (env, remaining));
|
|
if let Query::Create(Create { table: t }) = &query {
|
|
// There will be no errors in the middle interactions.
|
|
// - Creating the same table is an error
|
|
if t.name == table.name {
|
|
continue;
|
|
}
|
|
}
|
|
queries.push(query);
|
|
}
|
|
|
|
Property::DoubleCreateFailure {
|
|
create: create_query,
|
|
queries,
|
|
}
|
|
}
|
|
|
|
fn property_delete_select<R: rand::Rng>(
|
|
rng: &mut R,
|
|
env: &SimulatorEnv,
|
|
remaining: &Remaining,
|
|
) -> Property {
|
|
// Get a random table
|
|
let table = pick(&env.tables, rng);
|
|
// Generate a random predicate
|
|
let predicate = Predicate::arbitrary_from(rng, table);
|
|
|
|
// Create random queries respecting the constraints
|
|
let mut queries = Vec::new();
|
|
// - [x] There will be no errors in the middle interactions. (this constraint is impossible to check, so this is just best effort)
|
|
// - [x] A row that holds for the predicate will not be inserted.
|
|
// - [ ] The table `t` will not be renamed, dropped, or altered. (todo: add this constraint once ALTER or DROP is implemented)
|
|
for _ in 0..rng.gen_range(0..3) {
|
|
let query = Query::arbitrary_from(rng, (env, remaining));
|
|
match &query {
|
|
Query::Insert(Insert::Values { table: t, values }) => {
|
|
// A row that holds for the predicate will not be inserted.
|
|
if t == &table.name && values.iter().any(|v| predicate.test(v, table)) {
|
|
continue;
|
|
}
|
|
}
|
|
Query::Insert(Insert::Select {
|
|
table: t,
|
|
select: _,
|
|
}) => {
|
|
// A row that holds for the predicate will not be inserted.
|
|
if t == &table.name {
|
|
continue;
|
|
}
|
|
}
|
|
Query::Update(Update { table: t, .. }) => {
|
|
// A row that holds for the predicate will not be updated.
|
|
if t == &table.name {
|
|
continue;
|
|
}
|
|
}
|
|
Query::Create(Create { table: t }) => {
|
|
// There will be no errors in the middle interactions.
|
|
// - Creating the same table is an error
|
|
if t.name == table.name {
|
|
continue;
|
|
}
|
|
}
|
|
_ => (),
|
|
}
|
|
queries.push(query);
|
|
}
|
|
|
|
Property::DeleteSelect {
|
|
table: table.name.clone(),
|
|
predicate,
|
|
queries,
|
|
}
|
|
}
|
|
|
|
fn property_drop_select<R: rand::Rng>(
|
|
rng: &mut R,
|
|
env: &SimulatorEnv,
|
|
remaining: &Remaining,
|
|
) -> Property {
|
|
// Get a random table
|
|
let table = pick(&env.tables, rng);
|
|
|
|
// Create random queries respecting the constraints
|
|
let mut queries = Vec::new();
|
|
// - [x] There will be no errors in the middle interactions. (this constraint is impossible to check, so this is just best effort)
|
|
// - [-] The table `t` will not be created, no table will be renamed to `t`. (todo: update this constraint once ALTER is implemented)
|
|
for _ in 0..rng.gen_range(0..3) {
|
|
let query = Query::arbitrary_from(rng, (env, remaining));
|
|
if let Query::Create(Create { table: t }) = &query {
|
|
// - The table `t` will not be created
|
|
if t.name == table.name {
|
|
continue;
|
|
}
|
|
}
|
|
queries.push(query);
|
|
}
|
|
|
|
let select = Select::simple(table.name.clone(), Predicate::arbitrary_from(rng, table));
|
|
|
|
Property::DropSelect {
|
|
table: table.name.clone(),
|
|
queries,
|
|
select,
|
|
}
|
|
}
|
|
|
|
fn property_select_select_optimizer<R: rand::Rng>(rng: &mut R, env: &SimulatorEnv) -> Property {
|
|
// Get a random table
|
|
let table = pick(&env.tables, rng);
|
|
// Generate a random predicate
|
|
let predicate = Predicate::arbitrary_from(rng, table);
|
|
// Transform into a Binary predicate to force values to be casted to a bool
|
|
let expr = ast::Expr::Binary(
|
|
Box::new(predicate.0),
|
|
ast::Operator::And,
|
|
Box::new(Predicate::true_().0),
|
|
);
|
|
|
|
Property::SelectSelectOptimizer {
|
|
table: table.name.clone(),
|
|
predicate: Predicate(expr),
|
|
}
|
|
}
|
|
|
|
fn property_where_true_false_null<R: rand::Rng>(rng: &mut R, env: &SimulatorEnv) -> Property {
|
|
// Get a random table
|
|
let table = pick(&env.tables, rng);
|
|
// Generate a random predicate
|
|
let p1 = Predicate::arbitrary_from(rng, table);
|
|
let p2 = Predicate::arbitrary_from(rng, table);
|
|
|
|
// Create the select query
|
|
let select = Select::simple(table.name.clone(), p1);
|
|
|
|
Property::WhereTrueFalseNull {
|
|
select,
|
|
predicate: p2,
|
|
}
|
|
}
|
|
|
|
fn property_union_all_preserves_cardinality<R: rand::Rng>(
|
|
rng: &mut R,
|
|
env: &SimulatorEnv,
|
|
) -> Property {
|
|
// Get a random table
|
|
let table = pick(&env.tables, rng);
|
|
// Generate a random predicate
|
|
let p1 = Predicate::arbitrary_from(rng, table);
|
|
let p2 = Predicate::arbitrary_from(rng, table);
|
|
|
|
// Create the select query
|
|
let select = Select::single(
|
|
table.name.clone(),
|
|
vec![ResultColumn::Star],
|
|
p1,
|
|
None,
|
|
Distinctness::All,
|
|
);
|
|
|
|
Property::UNIONAllPreservesCardinality {
|
|
select,
|
|
where_clause: p2,
|
|
}
|
|
}
|
|
|
|
fn property_fsync_no_wait<R: rand::Rng>(
|
|
rng: &mut R,
|
|
env: &SimulatorEnv,
|
|
remaining: &Remaining,
|
|
) -> Property {
|
|
Property::FsyncNoWait {
|
|
query: Query::arbitrary_from(rng, (env, remaining)),
|
|
tables: env.tables.iter().map(|t| t.name.clone()).collect(),
|
|
}
|
|
}
|
|
|
|
fn property_faulty_query<R: rand::Rng>(
|
|
rng: &mut R,
|
|
env: &SimulatorEnv,
|
|
remaining: &Remaining,
|
|
) -> Property {
|
|
Property::FaultyQuery {
|
|
query: Query::arbitrary_from(rng, (env, remaining)),
|
|
tables: env.tables.iter().map(|t| t.name.clone()).collect(),
|
|
}
|
|
}
|
|
|
|
impl ArbitraryFrom<(&SimulatorEnv, &InteractionStats)> for Property {
|
|
fn arbitrary_from<R: rand::Rng>(
|
|
rng: &mut R,
|
|
(env, stats): (&SimulatorEnv, &InteractionStats),
|
|
) -> Self {
|
|
let remaining_ = remaining(env, stats);
|
|
|
|
frequency(
|
|
vec![
|
|
(
|
|
if !env.opts.disable_insert_values_select {
|
|
f64::min(remaining_.read, remaining_.write)
|
|
} else {
|
|
0.0
|
|
},
|
|
Box::new(|rng: &mut R| property_insert_values_select(rng, env, &remaining_)),
|
|
),
|
|
(
|
|
if !env.opts.disable_double_create_failure {
|
|
remaining_.create / 2.0
|
|
} else {
|
|
0.0
|
|
},
|
|
Box::new(|rng: &mut R| property_double_create_failure(rng, env, &remaining_)),
|
|
),
|
|
(
|
|
if !env.opts.disable_select_limit {
|
|
remaining_.read
|
|
} else {
|
|
0.0
|
|
},
|
|
Box::new(|rng: &mut R| property_select_limit(rng, env)),
|
|
),
|
|
(
|
|
if !env.opts.disable_delete_select {
|
|
f64::min(remaining_.read, remaining_.write).min(remaining_.delete)
|
|
} else {
|
|
0.0
|
|
},
|
|
Box::new(|rng: &mut R| property_delete_select(rng, env, &remaining_)),
|
|
),
|
|
(
|
|
if !env.opts.disable_drop_select {
|
|
// remaining_.drop
|
|
0.0
|
|
} else {
|
|
0.0
|
|
},
|
|
Box::new(|rng: &mut R| property_drop_select(rng, env, &remaining_)),
|
|
),
|
|
(
|
|
if !env.opts.disable_select_optimizer {
|
|
remaining_.read / 2.0
|
|
} else {
|
|
0.0
|
|
},
|
|
Box::new(|rng: &mut R| property_select_select_optimizer(rng, env)),
|
|
),
|
|
(
|
|
if env.opts.experimental_indexes && !env.opts.disable_where_true_false_null {
|
|
remaining_.read / 2.0
|
|
} else {
|
|
0.0
|
|
},
|
|
Box::new(|rng: &mut R| property_where_true_false_null(rng, env)),
|
|
),
|
|
(
|
|
if env.opts.experimental_indexes
|
|
&& !env.opts.disable_union_all_preserves_cardinality
|
|
{
|
|
remaining_.read / 3.0
|
|
} else {
|
|
0.0
|
|
},
|
|
Box::new(|rng: &mut R| property_union_all_preserves_cardinality(rng, env)),
|
|
),
|
|
(
|
|
if !env.opts.disable_fsync_no_wait {
|
|
50.0 // Freestyle number
|
|
} else {
|
|
0.0
|
|
},
|
|
Box::new(|rng: &mut R| property_fsync_no_wait(rng, env, &remaining_)),
|
|
),
|
|
(
|
|
if env.opts.enable_faulty_query {
|
|
20.0
|
|
} else {
|
|
0.0
|
|
},
|
|
Box::new(|rng: &mut R| property_faulty_query(rng, env, &remaining_)),
|
|
),
|
|
],
|
|
rng,
|
|
)
|
|
}
|
|
}
|
|
|
|
fn print_row(row: &[SimValue]) -> String {
|
|
row.iter()
|
|
.map(|v| match &v.0 {
|
|
types::Value::Null => "NULL".to_string(),
|
|
types::Value::Integer(i) => i.to_string(),
|
|
types::Value::Float(f) => f.to_string(),
|
|
types::Value::Text(t) => t.to_string(),
|
|
types::Value::Blob(b) => format!(
|
|
"X'{}'",
|
|
b.iter()
|
|
.fold(String::new(), |acc, b| acc + &format!("{b:02X}"))
|
|
),
|
|
})
|
|
.collect::<Vec<String>>()
|
|
.join(", ")
|
|
}
|