2022-10-20 16:25:34 +08:00
|
|
|
/*!
|
|
|
|
This crate defines the index scheduler, which is responsible for:
|
|
|
|
1. Keeping references to meilisearch's indexes and mapping them to their
|
|
|
|
user-defined names.
|
|
|
|
2. Scheduling tasks given by the user and executing them, in batch if possible.
|
|
|
|
|
|
|
|
When an `IndexScheduler` is created, a new thread containing a reference to the
|
|
|
|
scheduler is created. This thread runs the scheduler's run loop, where the
|
|
|
|
scheduler waits to be woken up to process new tasks. It wakes up when:
|
|
|
|
|
|
|
|
1. it is launched for the first time
|
|
|
|
2. a new task is registered
|
|
|
|
3. a batch of tasks has been processed
|
|
|
|
|
|
|
|
It is only within this thread that the scheduler is allowed to process tasks.
|
|
|
|
On the other hand, the publicly accessible methods of the scheduler can be
|
|
|
|
called asynchronously from any thread. These methods can either query the
|
|
|
|
content of the scheduler or enqueue new tasks.
|
|
|
|
*/
|
|
|
|
|
2022-09-09 18:16:19 +08:00
|
|
|
mod autobatcher;
|
2022-09-07 06:10:14 +08:00
|
|
|
mod batch;
|
2022-09-06 22:43:59 +08:00
|
|
|
pub mod error;
|
2022-09-14 18:35:33 +08:00
|
|
|
mod index_mapper;
|
2022-10-10 18:57:17 +08:00
|
|
|
#[cfg(test)]
|
2022-10-25 16:23:14 +08:00
|
|
|
mod insta_snapshot;
|
2022-09-07 06:10:14 +08:00
|
|
|
mod utils;
|
2022-09-06 22:43:59 +08:00
|
|
|
|
2022-09-07 05:49:19 +08:00
|
|
|
pub type Result<T> = std::result::Result<T, Error>;
|
2022-09-06 22:43:59 +08:00
|
|
|
pub type TaskId = u32;
|
|
|
|
|
2022-10-24 19:32:46 +08:00
|
|
|
use std::ops::{Bound, RangeBounds};
|
2022-10-03 22:15:10 +08:00
|
|
|
use std::path::PathBuf;
|
2022-10-21 00:00:07 +08:00
|
|
|
use std::sync::atomic::AtomicBool;
|
|
|
|
use std::sync::atomic::Ordering::Relaxed;
|
2022-10-03 22:15:10 +08:00
|
|
|
use std::sync::{Arc, RwLock};
|
2022-10-24 20:16:14 +08:00
|
|
|
use std::time::Duration;
|
2022-10-03 22:15:10 +08:00
|
|
|
|
2022-10-25 16:59:06 +08:00
|
|
|
use dump::{KindDump, TaskDump, UpdateFile};
|
|
|
|
pub use error::Error;
|
2022-10-16 07:39:01 +08:00
|
|
|
use file_store::FileStore;
|
2022-10-05 22:48:43 +08:00
|
|
|
use meilisearch_types::error::ResponseError;
|
2022-10-21 00:00:07 +08:00
|
|
|
use meilisearch_types::heed::types::{OwnedType, SerdeBincode, SerdeJson, Str};
|
2022-10-27 17:17:50 +08:00
|
|
|
use meilisearch_types::heed::{self, Database, Env, RoTxn};
|
2022-10-17 23:19:17 +08:00
|
|
|
use meilisearch_types::milli;
|
2022-10-25 16:59:06 +08:00
|
|
|
use meilisearch_types::milli::documents::DocumentsBatchBuilder;
|
2022-10-21 00:00:07 +08:00
|
|
|
use meilisearch_types::milli::update::IndexerConfig;
|
|
|
|
use meilisearch_types::milli::{CboRoaringBitmapCodec, Index, RoaringBitmapCodec, BEU32};
|
2022-10-25 16:59:06 +08:00
|
|
|
use meilisearch_types::tasks::{Kind, KindWithContent, Status, Task};
|
2022-10-03 22:15:10 +08:00
|
|
|
use roaring::RoaringBitmap;
|
|
|
|
use synchronoise::SignalEvent;
|
|
|
|
use time::OffsetDateTime;
|
2022-10-25 22:10:14 +08:00
|
|
|
use utils::{filter_out_references_to_newer_tasks, keep_tasks_within_datetimes, map_bound};
|
2022-10-03 22:15:10 +08:00
|
|
|
use uuid::Uuid;
|
|
|
|
|
|
|
|
use crate::index_mapper::IndexMapper;
|
2022-10-27 15:41:32 +08:00
|
|
|
use crate::utils::check_index_swap_validity;
|
2022-10-03 22:15:10 +08:00
|
|
|
|
2022-10-20 19:11:50 +08:00
|
|
|
pub(crate) type BEI128 =
|
|
|
|
meilisearch_types::heed::zerocopy::I128<meilisearch_types::heed::byteorder::BE>;
|
2022-10-19 18:59:12 +08:00
|
|
|
|
2022-10-20 16:25:34 +08:00
|
|
|
/// Defines a subset of tasks to be retrieved from the [`IndexScheduler`].
|
|
|
|
///
|
|
|
|
/// An empty/default query (where each field is set to `None`) matches all tasks.
|
|
|
|
/// Each non-null field restricts the set of tasks further.
|
2022-10-19 22:07:04 +08:00
|
|
|
#[derive(Default, Debug, Clone, PartialEq, Eq)]
|
2022-10-03 22:15:10 +08:00
|
|
|
pub struct Query {
|
2022-10-20 16:25:34 +08:00
|
|
|
/// The maximum number of tasks to be matched
|
2022-10-13 18:48:23 +08:00
|
|
|
pub limit: Option<u32>,
|
2022-10-20 16:25:34 +08:00
|
|
|
/// The minimum [task id](`meilisearch_types::tasks::Task::uid`) to be matched
|
2022-10-03 22:15:10 +08:00
|
|
|
pub from: Option<u32>,
|
2022-10-20 16:25:34 +08:00
|
|
|
/// The allowed [statuses](`meilisearch_types::tasks::Task::status`) of the matched tasls
|
2022-11-07 19:24:39 +08:00
|
|
|
pub statuses: Option<Vec<Status>>,
|
2022-10-20 16:25:34 +08:00
|
|
|
/// The allowed [kinds](meilisearch_types::tasks::Kind) of the matched tasks.
|
|
|
|
///
|
|
|
|
/// The kind of a task is given by:
|
|
|
|
/// ```
|
|
|
|
/// # use meilisearch_types::tasks::{Task, Kind};
|
|
|
|
/// # fn doc_func(task: Task) -> Kind {
|
|
|
|
/// task.kind.as_kind()
|
|
|
|
/// # }
|
|
|
|
/// ```
|
2022-11-07 19:24:39 +08:00
|
|
|
pub types: Option<Vec<Kind>>,
|
2022-10-20 16:25:34 +08:00
|
|
|
/// The allowed [index ids](meilisearch_types::tasks::Task::index_uid) of the matched tasks
|
2022-11-07 19:24:39 +08:00
|
|
|
pub index_uids: Option<Vec<String>>,
|
2022-10-20 16:25:34 +08:00
|
|
|
/// The [task ids](`meilisearch_types::tasks::Task::uid`) to be matched
|
2022-11-07 19:24:39 +08:00
|
|
|
pub uids: Option<Vec<TaskId>>,
|
2022-10-03 22:15:10 +08:00
|
|
|
|
2022-10-20 16:25:34 +08:00
|
|
|
/// Exclusive upper bound of the matched tasks' [`enqueued_at`](meilisearch_types::tasks::Task::enqueued_at) field.
|
2022-10-19 18:59:12 +08:00
|
|
|
pub before_enqueued_at: Option<OffsetDateTime>,
|
2022-10-20 16:25:34 +08:00
|
|
|
/// Exclusive lower bound of the matched tasks' [`enqueued_at`](meilisearch_types::tasks::Task::enqueued_at) field.
|
2022-10-19 18:59:12 +08:00
|
|
|
pub after_enqueued_at: Option<OffsetDateTime>,
|
2022-10-20 16:25:34 +08:00
|
|
|
/// Exclusive upper bound of the matched tasks' [`started_at`](meilisearch_types::tasks::Task::started_at) field.
|
2022-10-19 18:59:12 +08:00
|
|
|
pub before_started_at: Option<OffsetDateTime>,
|
2022-10-20 16:25:34 +08:00
|
|
|
/// Exclusive lower bound of the matched tasks' [`started_at`](meilisearch_types::tasks::Task::started_at) field.
|
2022-10-19 18:59:12 +08:00
|
|
|
pub after_started_at: Option<OffsetDateTime>,
|
2022-10-20 16:25:34 +08:00
|
|
|
/// Exclusive upper bound of the matched tasks' [`finished_at`](meilisearch_types::tasks::Task::finished_at) field.
|
2022-10-19 18:59:12 +08:00
|
|
|
pub before_finished_at: Option<OffsetDateTime>,
|
2022-10-20 16:25:34 +08:00
|
|
|
/// Exclusive lower bound of the matched tasks' [`finished_at`](meilisearch_types::tasks::Task::finished_at) field.
|
2022-10-19 18:59:12 +08:00
|
|
|
pub after_finished_at: Option<OffsetDateTime>,
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
impl Query {
|
2022-10-27 22:23:50 +08:00
|
|
|
/// Return `true` if every field of the query is set to `None`, such that the query
|
2022-10-20 16:25:34 +08:00
|
|
|
/// matches all tasks.
|
2022-10-15 17:17:06 +08:00
|
|
|
pub fn is_empty(&self) -> bool {
|
|
|
|
matches!(
|
|
|
|
self,
|
|
|
|
Query {
|
|
|
|
limit: None,
|
|
|
|
from: None,
|
2022-11-07 19:24:39 +08:00
|
|
|
statuses: None,
|
|
|
|
types: None,
|
|
|
|
index_uids: None,
|
|
|
|
uids: None,
|
2022-10-19 18:59:12 +08:00
|
|
|
before_enqueued_at: None,
|
|
|
|
after_enqueued_at: None,
|
|
|
|
before_started_at: None,
|
|
|
|
after_started_at: None,
|
|
|
|
before_finished_at: None,
|
|
|
|
after_finished_at: None,
|
2022-10-15 17:17:06 +08:00
|
|
|
}
|
|
|
|
)
|
|
|
|
}
|
2022-10-03 22:15:10 +08:00
|
|
|
|
2022-10-20 16:25:34 +08:00
|
|
|
/// Add an [index id](meilisearch_types::tasks::Task::index_uid) to the list of permitted indexes.
|
2022-10-03 22:15:10 +08:00
|
|
|
pub fn with_index(self, index_uid: String) -> Self {
|
2022-11-07 19:24:39 +08:00
|
|
|
let mut index_vec = self.index_uids.unwrap_or_default();
|
2022-10-03 22:15:10 +08:00
|
|
|
index_vec.push(index_uid);
|
2022-11-07 19:24:39 +08:00
|
|
|
Self { index_uids: Some(index_vec), ..self }
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-10-17 19:54:35 +08:00
|
|
|
#[derive(Debug, Clone)]
|
|
|
|
struct ProcessingTasks {
|
|
|
|
/// The date and time at which the indexation started.
|
|
|
|
started_at: OffsetDateTime,
|
|
|
|
/// The list of tasks ids that are currently running.
|
|
|
|
processing: RoaringBitmap,
|
|
|
|
}
|
|
|
|
|
|
|
|
impl ProcessingTasks {
|
2022-10-19 17:26:55 +08:00
|
|
|
/// Creates an empty `ProcessingAt` struct.
|
|
|
|
fn new() -> ProcessingTasks {
|
2022-10-21 00:00:07 +08:00
|
|
|
ProcessingTasks { started_at: OffsetDateTime::now_utc(), processing: RoaringBitmap::new() }
|
2022-10-19 17:26:55 +08:00
|
|
|
}
|
|
|
|
|
2022-10-19 17:22:59 +08:00
|
|
|
/// Stores the currently processing tasks, and the date time at which it started.
|
2022-10-17 19:54:35 +08:00
|
|
|
fn start_processing_at(&mut self, started_at: OffsetDateTime, processing: RoaringBitmap) {
|
|
|
|
self.started_at = started_at;
|
|
|
|
self.processing = processing;
|
|
|
|
}
|
|
|
|
|
2022-11-02 22:38:07 +08:00
|
|
|
/// Set the processing tasks to an empty list
|
|
|
|
fn stop_processing(&mut self) {
|
2022-10-17 19:54:35 +08:00
|
|
|
self.processing = RoaringBitmap::new();
|
|
|
|
}
|
|
|
|
|
2022-11-02 22:38:07 +08:00
|
|
|
/// Returns `true` if there, at least, is one task that is currently processing that we must stop.
|
2022-10-19 17:22:59 +08:00
|
|
|
fn must_cancel_processing_tasks(&self, canceled_tasks: &RoaringBitmap) -> bool {
|
|
|
|
!self.processing.is_disjoint(canceled_tasks)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#[derive(Default, Clone, Debug)]
|
|
|
|
struct MustStopProcessing(Arc<AtomicBool>);
|
|
|
|
|
|
|
|
impl MustStopProcessing {
|
|
|
|
fn get(&self) -> bool {
|
|
|
|
self.0.load(Relaxed)
|
|
|
|
}
|
|
|
|
|
|
|
|
fn must_stop(&self) {
|
|
|
|
self.0.store(true, Relaxed);
|
|
|
|
}
|
|
|
|
|
|
|
|
fn reset(&self) {
|
|
|
|
self.0.store(false, Relaxed);
|
2022-10-17 19:54:35 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-10-03 22:15:10 +08:00
|
|
|
/// Database const names for the `IndexScheduler`.
|
|
|
|
mod db_name {
|
|
|
|
pub const ALL_TASKS: &str = "all-tasks";
|
|
|
|
pub const STATUS: &str = "status";
|
|
|
|
pub const KIND: &str = "kind";
|
|
|
|
pub const INDEX_TASKS: &str = "index-tasks";
|
2022-10-19 18:59:12 +08:00
|
|
|
pub const ENQUEUED_AT: &str = "enqueued-at";
|
|
|
|
pub const STARTED_AT: &str = "started-at";
|
|
|
|
pub const FINISHED_AT: &str = "finished-at";
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
|
|
|
|
2022-10-26 17:41:59 +08:00
|
|
|
#[cfg(test)]
|
|
|
|
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
|
|
|
|
pub enum Breakpoint {
|
|
|
|
Start,
|
|
|
|
BatchCreated,
|
|
|
|
BeforeProcessing,
|
|
|
|
AfterProcessing,
|
|
|
|
AbortedIndexation,
|
|
|
|
ProcessBatchSucceeded,
|
|
|
|
ProcessBatchFailed,
|
|
|
|
InsideProcessBatch,
|
|
|
|
}
|
|
|
|
|
|
|
|
#[derive(Debug)]
|
|
|
|
pub struct IndexSchedulerOptions {
|
|
|
|
/// The path to the version file of Meilisearch.
|
2022-10-26 17:47:49 +08:00
|
|
|
pub version_file_path: PathBuf,
|
2022-10-26 17:41:59 +08:00
|
|
|
/// The path to the folder containing the auth LMDB env.
|
2022-10-26 17:47:49 +08:00
|
|
|
pub auth_path: PathBuf,
|
2022-10-26 17:41:59 +08:00
|
|
|
/// The path to the folder containing the task databases.
|
2022-10-26 17:47:49 +08:00
|
|
|
pub tasks_path: PathBuf,
|
2022-10-26 17:41:59 +08:00
|
|
|
/// The path to the file store containing the files associated to the tasks.
|
2022-10-26 17:47:49 +08:00
|
|
|
pub update_file_path: PathBuf,
|
2022-10-26 17:41:59 +08:00
|
|
|
/// The path to the folder containing meilisearch's indexes.
|
2022-10-26 17:47:49 +08:00
|
|
|
pub indexes_path: PathBuf,
|
2022-10-26 17:41:59 +08:00
|
|
|
/// The path to the folder containing the snapshots.
|
2022-10-26 17:47:49 +08:00
|
|
|
pub snapshots_path: PathBuf,
|
2022-10-26 17:41:59 +08:00
|
|
|
/// The path to the folder containing the dumps.
|
2022-10-26 17:47:49 +08:00
|
|
|
pub dumps_path: PathBuf,
|
2022-10-26 17:41:59 +08:00
|
|
|
/// The maximum size, in bytes, of each meilisearch index.
|
2022-10-26 17:47:49 +08:00
|
|
|
pub task_db_size: usize,
|
2022-10-26 17:41:59 +08:00
|
|
|
/// The maximum size, in bytes, of the tasks index.
|
2022-10-26 17:47:49 +08:00
|
|
|
pub index_size: usize,
|
2022-10-26 17:41:59 +08:00
|
|
|
/// Configuration used during indexing for each meilisearch index.
|
2022-10-26 17:47:49 +08:00
|
|
|
pub indexer_config: IndexerConfig,
|
2022-10-26 17:41:59 +08:00
|
|
|
/// Set to `true` iff the index scheduler is allowed to automatically
|
|
|
|
/// batch tasks together, to process multiple tasks at once.
|
2022-10-26 17:47:49 +08:00
|
|
|
pub autobatching_enabled: bool,
|
2022-10-26 17:41:59 +08:00
|
|
|
}
|
|
|
|
|
2022-10-20 16:25:34 +08:00
|
|
|
/// Structure which holds meilisearch's indexes and schedules the tasks
|
|
|
|
/// to be performed on them.
|
2022-10-03 22:15:10 +08:00
|
|
|
pub struct IndexScheduler {
|
|
|
|
/// The LMDB environment which the DBs are associated with.
|
|
|
|
pub(crate) env: Env,
|
|
|
|
|
2022-10-19 17:22:59 +08:00
|
|
|
/// A boolean that can be set to true to stop the currently processing tasks.
|
|
|
|
pub(crate) must_stop_processing: MustStopProcessing,
|
2022-10-20 16:25:34 +08:00
|
|
|
|
|
|
|
/// The list of tasks currently processing
|
2022-10-17 19:54:35 +08:00
|
|
|
pub(crate) processing_tasks: Arc<RwLock<ProcessingTasks>>,
|
2022-10-20 16:25:34 +08:00
|
|
|
|
|
|
|
/// The list of files referenced by the tasks
|
2022-10-17 19:54:35 +08:00
|
|
|
pub(crate) file_store: FileStore,
|
|
|
|
|
2022-10-03 22:15:10 +08:00
|
|
|
// The main database, it contains all the tasks accessible by their Id.
|
|
|
|
pub(crate) all_tasks: Database<OwnedType<BEU32>, SerdeJson<Task>>,
|
|
|
|
|
|
|
|
/// All the tasks ids grouped by their status.
|
2022-10-17 23:19:17 +08:00
|
|
|
// TODO we should not be able to serialize a `Status::Processing` in this database.
|
2022-10-03 22:15:10 +08:00
|
|
|
pub(crate) status: Database<SerdeBincode<Status>, RoaringBitmapCodec>,
|
|
|
|
/// All the tasks ids grouped by their kind.
|
|
|
|
pub(crate) kind: Database<SerdeBincode<Kind>, RoaringBitmapCodec>,
|
|
|
|
/// Store the tasks associated to an index.
|
|
|
|
pub(crate) index_tasks: Database<Str, RoaringBitmapCodec>,
|
|
|
|
|
2022-10-19 18:59:12 +08:00
|
|
|
/// Store the task ids of tasks which were enqueued at a specific date
|
|
|
|
pub(crate) enqueued_at: Database<OwnedType<BEI128>, CboRoaringBitmapCodec>,
|
|
|
|
|
|
|
|
/// Store the task ids of finished tasks which started being processed at a specific date
|
|
|
|
pub(crate) started_at: Database<OwnedType<BEI128>, CboRoaringBitmapCodec>,
|
|
|
|
|
|
|
|
/// Store the task ids of tasks which finished at a specific date
|
|
|
|
pub(crate) finished_at: Database<OwnedType<BEI128>, CboRoaringBitmapCodec>,
|
|
|
|
|
2022-10-03 22:15:10 +08:00
|
|
|
/// In charge of creating, opening, storing and returning indexes.
|
|
|
|
pub(crate) index_mapper: IndexMapper,
|
|
|
|
|
|
|
|
/// Get a signal when a batch needs to be processed.
|
|
|
|
pub(crate) wake_up: Arc<SignalEvent>,
|
|
|
|
|
2022-10-17 19:54:35 +08:00
|
|
|
/// Whether auto-batching is enabled or not.
|
2022-10-10 23:00:56 +08:00
|
|
|
pub(crate) autobatching_enabled: bool,
|
|
|
|
|
2022-10-13 21:02:59 +08:00
|
|
|
/// The path used to create the dumps.
|
|
|
|
pub(crate) dumps_path: PathBuf,
|
|
|
|
|
2022-10-25 16:53:25 +08:00
|
|
|
/// The path used to create the snapshots.
|
|
|
|
pub(crate) snapshots_path: PathBuf,
|
|
|
|
|
2022-10-25 20:35:10 +08:00
|
|
|
/// The path to the folder containing the auth LMDB env.
|
|
|
|
pub(crate) auth_path: PathBuf,
|
|
|
|
|
2022-10-25 21:06:28 +08:00
|
|
|
/// The path to the version file of Meilisearch.
|
|
|
|
pub(crate) version_file_path: PathBuf,
|
|
|
|
|
2022-10-03 22:15:10 +08:00
|
|
|
// ================= test
|
2022-10-25 15:48:51 +08:00
|
|
|
// The next entry is dedicated to the tests.
|
|
|
|
/// Provide a way to set a breakpoint in multiple part of the scheduler.
|
|
|
|
///
|
|
|
|
/// See [self.breakpoint()](`IndexScheduler::breakpoint`) for an explanation.
|
2022-10-03 22:15:10 +08:00
|
|
|
#[cfg(test)]
|
2022-10-20 23:11:44 +08:00
|
|
|
test_breakpoint_sdr: crossbeam::channel::Sender<(Breakpoint, bool)>,
|
|
|
|
|
|
|
|
/// A list of planned failures within the [`tick`](IndexScheduler::tick) method of the index scheduler.
|
|
|
|
///
|
|
|
|
/// The first field is the iteration index and the second field identifies a location in the code.
|
2022-10-26 23:31:23 +08:00
|
|
|
#[cfg(test)]
|
2022-10-20 23:11:44 +08:00
|
|
|
planned_failures: Vec<(usize, tests::FailureLocation)>,
|
|
|
|
|
|
|
|
/// A counter that is incremented before every call to [`tick`](IndexScheduler::tick)
|
2022-10-26 23:31:23 +08:00
|
|
|
#[cfg(test)]
|
2022-10-20 23:11:44 +08:00
|
|
|
run_loop_iteration: Arc<RwLock<usize>>,
|
|
|
|
}
|
2022-10-26 17:41:59 +08:00
|
|
|
|
2022-10-20 23:11:44 +08:00
|
|
|
impl IndexScheduler {
|
2022-10-25 16:53:25 +08:00
|
|
|
fn private_clone(&self) -> IndexScheduler {
|
|
|
|
IndexScheduler {
|
2022-10-20 23:11:44 +08:00
|
|
|
env: self.env.clone(),
|
|
|
|
must_stop_processing: self.must_stop_processing.clone(),
|
|
|
|
processing_tasks: self.processing_tasks.clone(),
|
|
|
|
file_store: self.file_store.clone(),
|
2022-10-25 16:53:29 +08:00
|
|
|
all_tasks: self.all_tasks,
|
|
|
|
status: self.status,
|
|
|
|
kind: self.kind,
|
|
|
|
index_tasks: self.index_tasks,
|
|
|
|
enqueued_at: self.enqueued_at,
|
|
|
|
started_at: self.started_at,
|
|
|
|
finished_at: self.finished_at,
|
2022-10-20 23:11:44 +08:00
|
|
|
index_mapper: self.index_mapper.clone(),
|
|
|
|
wake_up: self.wake_up.clone(),
|
2022-10-25 16:53:29 +08:00
|
|
|
autobatching_enabled: self.autobatching_enabled,
|
2022-10-25 16:53:25 +08:00
|
|
|
snapshots_path: self.snapshots_path.clone(),
|
2022-10-20 23:11:44 +08:00
|
|
|
dumps_path: self.dumps_path.clone(),
|
2022-10-25 20:35:10 +08:00
|
|
|
auth_path: self.auth_path.clone(),
|
2022-10-25 21:06:28 +08:00
|
|
|
version_file_path: self.version_file_path.clone(),
|
2022-10-20 23:11:44 +08:00
|
|
|
#[cfg(test)]
|
|
|
|
test_breakpoint_sdr: self.test_breakpoint_sdr.clone(),
|
|
|
|
#[cfg(test)]
|
|
|
|
planned_failures: self.planned_failures.clone(),
|
|
|
|
#[cfg(test)]
|
|
|
|
run_loop_iteration: self.run_loop_iteration.clone(),
|
|
|
|
}
|
|
|
|
}
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
impl IndexScheduler {
|
2022-10-20 16:25:34 +08:00
|
|
|
/// Create an index scheduler and start its run loop.
|
2022-10-03 22:15:10 +08:00
|
|
|
pub fn new(
|
2022-10-26 17:41:59 +08:00
|
|
|
options: IndexSchedulerOptions,
|
2022-10-20 23:11:44 +08:00
|
|
|
#[cfg(test)] test_breakpoint_sdr: crossbeam::channel::Sender<(Breakpoint, bool)>,
|
|
|
|
#[cfg(test)] planned_failures: Vec<(usize, tests::FailureLocation)>,
|
2022-10-03 22:15:10 +08:00
|
|
|
) -> Result<Self> {
|
2022-10-26 17:41:59 +08:00
|
|
|
std::fs::create_dir_all(&options.tasks_path)?;
|
|
|
|
std::fs::create_dir_all(&options.update_file_path)?;
|
|
|
|
std::fs::create_dir_all(&options.indexes_path)?;
|
|
|
|
std::fs::create_dir_all(&options.dumps_path)?;
|
2022-10-03 22:15:10 +08:00
|
|
|
|
2022-10-26 17:41:59 +08:00
|
|
|
let env = heed::EnvOpenOptions::new()
|
|
|
|
.max_dbs(9)
|
|
|
|
.map_size(options.task_db_size)
|
|
|
|
.open(options.tasks_path)?;
|
|
|
|
let file_store = FileStore::new(&options.update_file_path)?;
|
2022-10-03 22:15:10 +08:00
|
|
|
|
|
|
|
// allow unreachable_code to get rids of the warning in the case of a test build.
|
|
|
|
let this = Self {
|
2022-10-19 17:22:59 +08:00
|
|
|
must_stop_processing: MustStopProcessing::default(),
|
2022-10-19 17:26:55 +08:00
|
|
|
processing_tasks: Arc::new(RwLock::new(ProcessingTasks::new())),
|
2022-10-03 22:15:10 +08:00
|
|
|
file_store,
|
|
|
|
all_tasks: env.create_database(Some(db_name::ALL_TASKS))?,
|
|
|
|
status: env.create_database(Some(db_name::STATUS))?,
|
|
|
|
kind: env.create_database(Some(db_name::KIND))?,
|
|
|
|
index_tasks: env.create_database(Some(db_name::INDEX_TASKS))?,
|
2022-10-19 18:59:12 +08:00
|
|
|
enqueued_at: env.create_database(Some(db_name::ENQUEUED_AT))?,
|
|
|
|
started_at: env.create_database(Some(db_name::STARTED_AT))?,
|
|
|
|
finished_at: env.create_database(Some(db_name::FINISHED_AT))?,
|
2022-10-26 17:41:59 +08:00
|
|
|
index_mapper: IndexMapper::new(
|
|
|
|
&env,
|
|
|
|
options.indexes_path,
|
|
|
|
options.index_size,
|
|
|
|
options.indexer_config,
|
|
|
|
)?,
|
2022-10-03 22:15:10 +08:00
|
|
|
env,
|
|
|
|
// we want to start the loop right away in case meilisearch was ctrl+Ced while processing things
|
|
|
|
wake_up: Arc::new(SignalEvent::auto(true)),
|
2022-10-26 17:41:59 +08:00
|
|
|
autobatching_enabled: options.autobatching_enabled,
|
|
|
|
dumps_path: options.dumps_path,
|
|
|
|
snapshots_path: options.snapshots_path,
|
|
|
|
auth_path: options.auth_path,
|
|
|
|
version_file_path: options.version_file_path,
|
2022-10-03 22:15:10 +08:00
|
|
|
|
|
|
|
#[cfg(test)]
|
|
|
|
test_breakpoint_sdr,
|
2022-10-20 23:11:44 +08:00
|
|
|
#[cfg(test)]
|
|
|
|
planned_failures,
|
|
|
|
#[cfg(test)]
|
|
|
|
run_loop_iteration: Arc::new(RwLock::new(0)),
|
2022-10-03 22:15:10 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
this.run();
|
|
|
|
Ok(this)
|
|
|
|
}
|
|
|
|
|
2022-10-27 17:17:50 +08:00
|
|
|
pub fn read_txn(&self) -> Result<RoTxn> {
|
|
|
|
self.env.read_txn().map_err(|e| e.into())
|
|
|
|
}
|
|
|
|
|
2022-10-20 16:25:34 +08:00
|
|
|
/// Start the run loop for the given index scheduler.
|
|
|
|
///
|
|
|
|
/// This function will execute in a different thread and must be called
|
|
|
|
/// only once per index scheduler.
|
2022-10-03 22:15:10 +08:00
|
|
|
fn run(&self) {
|
2022-10-20 23:11:44 +08:00
|
|
|
let run = self.private_clone();
|
2022-10-03 22:15:10 +08:00
|
|
|
|
|
|
|
std::thread::spawn(move || loop {
|
|
|
|
run.wake_up.wait();
|
|
|
|
|
|
|
|
match run.tick() {
|
2022-10-10 22:19:23 +08:00
|
|
|
Ok(0) => (),
|
|
|
|
Ok(_) => run.wake_up.signal(),
|
2022-10-24 20:16:14 +08:00
|
|
|
Err(e) => {
|
|
|
|
log::error!("{}", e);
|
|
|
|
// Wait one second when an irrecoverable error occurs.
|
2022-10-25 15:48:51 +08:00
|
|
|
if matches!(
|
|
|
|
e,
|
2022-10-24 20:16:14 +08:00
|
|
|
Error::CorruptedTaskQueue
|
2022-10-25 15:48:51 +08:00
|
|
|
| Error::TaskDatabaseUpdate(_)
|
|
|
|
| Error::HeedTransaction(_)
|
|
|
|
| Error::CreateBatch(_)
|
|
|
|
) {
|
2022-10-26 23:31:23 +08:00
|
|
|
std::thread::sleep(Duration::from_secs(1));
|
2022-10-24 20:16:14 +08:00
|
|
|
}
|
|
|
|
}
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
|
|
|
});
|
|
|
|
}
|
|
|
|
|
2022-10-16 07:39:01 +08:00
|
|
|
pub fn indexer_config(&self) -> &IndexerConfig {
|
|
|
|
&self.index_mapper.indexer_config
|
|
|
|
}
|
|
|
|
|
2022-10-20 16:25:34 +08:00
|
|
|
/// Return the index corresponding to the name.
|
|
|
|
///
|
|
|
|
/// * If the index wasn't opened before, the index will be opened.
|
|
|
|
/// * If the index doesn't exist on disk, the `IndexNotFoundError` is thrown.
|
2022-10-03 22:15:10 +08:00
|
|
|
pub fn index(&self, name: &str) -> Result<Index> {
|
|
|
|
let rtxn = self.env.read_txn()?;
|
|
|
|
self.index_mapper.index(&rtxn, name)
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Return and open all the indexes.
|
2022-10-04 17:06:48 +08:00
|
|
|
pub fn indexes(&self) -> Result<Vec<(String, Index)>> {
|
2022-10-03 22:15:10 +08:00
|
|
|
let rtxn = self.env.read_txn()?;
|
|
|
|
self.index_mapper.indexes(&rtxn)
|
|
|
|
}
|
|
|
|
|
2022-10-27 17:17:50 +08:00
|
|
|
/// Return the task ids matched by the given query from the index scheduler's point of view.
|
|
|
|
pub(crate) fn get_task_ids(&self, rtxn: &RoTxn, query: &Query) -> Result<RoaringBitmap> {
|
2022-11-02 22:38:07 +08:00
|
|
|
let ProcessingTasks {
|
|
|
|
started_at: started_at_processing, processing: processing_tasks, ..
|
|
|
|
} = self.processing_tasks.read().unwrap().clone();
|
2022-10-03 22:15:10 +08:00
|
|
|
|
2022-10-27 19:00:30 +08:00
|
|
|
let mut tasks = self.all_task_ids(rtxn)?;
|
2022-10-03 22:15:10 +08:00
|
|
|
|
2022-10-26 18:56:01 +08:00
|
|
|
if let Some(from) = &query.from {
|
|
|
|
tasks.remove_range(from.saturating_add(1)..);
|
|
|
|
}
|
|
|
|
|
2022-11-07 19:24:39 +08:00
|
|
|
if let Some(status) = &query.statuses {
|
2022-10-03 22:15:10 +08:00
|
|
|
let mut status_tasks = RoaringBitmap::new();
|
|
|
|
for status in status {
|
2022-10-24 19:32:46 +08:00
|
|
|
match status {
|
|
|
|
// special case for Processing tasks
|
|
|
|
Status::Processing => {
|
2022-10-25 15:48:51 +08:00
|
|
|
status_tasks |= &processing_tasks;
|
2022-10-24 19:32:46 +08:00
|
|
|
}
|
2022-10-27 19:00:30 +08:00
|
|
|
status => status_tasks |= &self.get_status(rtxn, *status)?,
|
2022-10-24 19:32:46 +08:00
|
|
|
};
|
|
|
|
}
|
2022-10-25 15:48:51 +08:00
|
|
|
if !status.contains(&Status::Processing) {
|
|
|
|
tasks -= &processing_tasks;
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
|
|
|
tasks &= status_tasks;
|
|
|
|
}
|
|
|
|
|
2022-11-07 19:24:39 +08:00
|
|
|
if let Some(uids) = &query.uids {
|
2022-10-24 19:32:46 +08:00
|
|
|
let uids = RoaringBitmap::from_iter(uids);
|
|
|
|
tasks &= &uids;
|
|
|
|
}
|
|
|
|
|
2022-11-07 19:24:39 +08:00
|
|
|
if let Some(kind) = &query.types {
|
2022-10-03 22:15:10 +08:00
|
|
|
let mut kind_tasks = RoaringBitmap::new();
|
|
|
|
for kind in kind {
|
2022-10-27 19:00:30 +08:00
|
|
|
kind_tasks |= self.get_kind(rtxn, *kind)?;
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
2022-10-24 19:32:46 +08:00
|
|
|
tasks &= &kind_tasks;
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
|
|
|
|
2022-11-07 19:24:39 +08:00
|
|
|
if let Some(index) = &query.index_uids {
|
2022-10-03 22:15:10 +08:00
|
|
|
let mut index_tasks = RoaringBitmap::new();
|
|
|
|
for index in index {
|
2022-10-27 19:00:30 +08:00
|
|
|
index_tasks |= self.index_tasks(rtxn, index)?;
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
2022-10-24 19:32:46 +08:00
|
|
|
tasks &= &index_tasks;
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
2022-10-17 22:30:18 +08:00
|
|
|
|
2022-10-24 19:32:46 +08:00
|
|
|
// For the started_at filter, we need to treat the part of the tasks that are processing from the part of the
|
|
|
|
// tasks that are not processing. The non-processing ones are filtered normally while the processing ones
|
|
|
|
// are entirely removed unless the in-memory startedAt variable falls within the date filter.
|
|
|
|
// Once we have filtered the two subsets, we put them back together and assign it back to `tasks`.
|
|
|
|
tasks = {
|
|
|
|
let (mut filtered_non_processing_tasks, mut filtered_processing_tasks) =
|
2022-10-25 15:48:51 +08:00
|
|
|
(&tasks - &processing_tasks, &tasks & &processing_tasks);
|
2022-10-24 19:32:46 +08:00
|
|
|
|
|
|
|
// special case for Processing tasks
|
2022-10-25 15:48:51 +08:00
|
|
|
// A closure that clears the filtered_processing_tasks if their started_at date falls outside the given bounds
|
|
|
|
let mut clear_filtered_processing_tasks =
|
|
|
|
|start: Bound<OffsetDateTime>, end: Bound<OffsetDateTime>| {
|
|
|
|
let start = map_bound(start, |b| b.unix_timestamp_nanos());
|
|
|
|
let end = map_bound(end, |b| b.unix_timestamp_nanos());
|
|
|
|
let is_within_dates = RangeBounds::contains(
|
|
|
|
&(start, end),
|
|
|
|
&started_at_processing.unix_timestamp_nanos(),
|
|
|
|
);
|
|
|
|
if !is_within_dates {
|
|
|
|
filtered_processing_tasks.clear();
|
2022-10-24 19:32:46 +08:00
|
|
|
}
|
|
|
|
};
|
2022-10-25 15:48:51 +08:00
|
|
|
match (query.after_started_at, query.before_started_at) {
|
|
|
|
(None, None) => (),
|
|
|
|
(None, Some(before)) => {
|
|
|
|
clear_filtered_processing_tasks(Bound::Unbounded, Bound::Excluded(before))
|
2022-10-24 19:32:46 +08:00
|
|
|
}
|
2022-10-25 15:48:51 +08:00
|
|
|
(Some(after), None) => {
|
|
|
|
clear_filtered_processing_tasks(Bound::Excluded(after), Bound::Unbounded)
|
|
|
|
}
|
|
|
|
(Some(after), Some(before)) => {
|
|
|
|
clear_filtered_processing_tasks(Bound::Excluded(after), Bound::Excluded(before))
|
|
|
|
}
|
|
|
|
};
|
2022-10-24 19:32:46 +08:00
|
|
|
|
|
|
|
keep_tasks_within_datetimes(
|
2022-10-27 19:00:30 +08:00
|
|
|
rtxn,
|
2022-10-24 19:32:46 +08:00
|
|
|
&mut filtered_non_processing_tasks,
|
|
|
|
self.started_at,
|
|
|
|
query.after_started_at,
|
|
|
|
query.before_started_at,
|
|
|
|
)?;
|
|
|
|
filtered_non_processing_tasks | filtered_processing_tasks
|
|
|
|
};
|
|
|
|
|
2022-10-19 18:59:12 +08:00
|
|
|
keep_tasks_within_datetimes(
|
2022-10-27 19:00:30 +08:00
|
|
|
rtxn,
|
2022-10-19 18:59:12 +08:00
|
|
|
&mut tasks,
|
|
|
|
self.enqueued_at,
|
|
|
|
query.after_enqueued_at,
|
|
|
|
query.before_enqueued_at,
|
|
|
|
)?;
|
|
|
|
|
|
|
|
keep_tasks_within_datetimes(
|
2022-10-27 19:00:30 +08:00
|
|
|
rtxn,
|
2022-10-19 18:59:12 +08:00
|
|
|
&mut tasks,
|
|
|
|
self.finished_at,
|
|
|
|
query.after_finished_at,
|
|
|
|
query.before_finished_at,
|
|
|
|
)?;
|
|
|
|
|
2022-10-26 18:56:01 +08:00
|
|
|
if let Some(limit) = query.limit {
|
|
|
|
tasks = tasks.into_iter().rev().take(limit as usize).collect();
|
|
|
|
}
|
|
|
|
|
2022-10-13 17:09:00 +08:00
|
|
|
Ok(tasks)
|
|
|
|
}
|
|
|
|
|
2022-10-27 17:17:50 +08:00
|
|
|
/// Return true iff there is at least one task associated with this index
|
|
|
|
/// that is processing.
|
|
|
|
pub fn is_index_processing(&self, index: &str) -> Result<bool> {
|
2022-10-13 19:04:49 +08:00
|
|
|
let rtxn = self.env.read_txn()?;
|
2022-10-27 17:17:50 +08:00
|
|
|
let processing_tasks = self.processing_tasks.read().unwrap().processing.clone();
|
|
|
|
let index_tasks = self.index_tasks(&rtxn, index)?;
|
|
|
|
let nbr_index_processing_tasks = processing_tasks.intersection_len(&index_tasks);
|
|
|
|
Ok(nbr_index_processing_tasks > 0)
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Return the task ids matching the query from the user's point of view.
|
|
|
|
///
|
|
|
|
/// There are two differences between an internal query and a query executed by
|
|
|
|
/// the user.
|
|
|
|
///
|
|
|
|
/// 1. IndexSwap tasks are not publicly associated with any index, but they are associated
|
|
|
|
/// with many indexes internally.
|
2022-10-27 22:23:50 +08:00
|
|
|
/// 2. The user may not have the rights to access the tasks (internally) associated with all indexes.
|
2022-10-27 17:17:50 +08:00
|
|
|
pub fn get_task_ids_from_authorized_indexes(
|
|
|
|
&self,
|
|
|
|
rtxn: &RoTxn,
|
|
|
|
query: &Query,
|
|
|
|
authorized_indexes: &Option<Vec<String>>,
|
|
|
|
) -> Result<RoaringBitmap> {
|
2022-10-27 19:00:30 +08:00
|
|
|
let mut tasks = self.get_task_ids(rtxn, query)?;
|
2022-10-27 17:17:50 +08:00
|
|
|
|
2022-10-28 00:00:04 +08:00
|
|
|
// If the query contains a list of `index_uid`, then we must exclude all the kind that
|
|
|
|
// arn't associated to one and only one index.
|
2022-11-07 19:24:39 +08:00
|
|
|
if query.index_uids.is_some() {
|
2022-10-28 00:00:04 +08:00
|
|
|
for kind in enum_iterator::all::<Kind>().filter(|kind| !kind.related_to_one_index()) {
|
|
|
|
tasks -= self.get_kind(rtxn, kind)?;
|
|
|
|
}
|
2022-10-27 17:17:50 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Any task that is internally associated with a non-authorized index
|
|
|
|
// must be discarded.
|
|
|
|
if let Some(authorized_indexes) = authorized_indexes {
|
|
|
|
let all_indexes_iter = self.index_tasks.iter(rtxn)?;
|
2022-10-27 22:23:50 +08:00
|
|
|
for result in all_indexes_iter {
|
|
|
|
let (index, index_tasks) = result?;
|
2022-10-27 17:17:50 +08:00
|
|
|
if !authorized_indexes.contains(&index.to_owned()) {
|
|
|
|
tasks -= index_tasks;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Ok(tasks)
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Return the tasks matching the query from the user's point of view.
|
|
|
|
///
|
|
|
|
/// There are two differences between an internal query and a query executed by
|
|
|
|
/// the user.
|
|
|
|
///
|
|
|
|
/// 1. IndexSwap tasks are not publicly associated with any index, but they are associated
|
|
|
|
/// with many indexes internally.
|
2022-10-27 22:23:50 +08:00
|
|
|
/// 2. The user may not have the rights to access the tasks (internally) associated with all indexes.
|
2022-10-27 17:17:50 +08:00
|
|
|
pub fn get_tasks_from_authorized_indexes(
|
|
|
|
&self,
|
|
|
|
query: Query,
|
|
|
|
authorized_indexes: Option<Vec<String>>,
|
|
|
|
) -> Result<Vec<Task>> {
|
|
|
|
let rtxn = self.env.read_txn()?;
|
|
|
|
|
|
|
|
let tasks =
|
|
|
|
self.get_task_ids_from_authorized_indexes(&rtxn, &query, &authorized_indexes)?;
|
2022-10-03 22:15:10 +08:00
|
|
|
|
2022-10-13 18:48:23 +08:00
|
|
|
let tasks = self.get_existing_tasks(
|
|
|
|
&rtxn,
|
2022-10-21 00:00:07 +08:00
|
|
|
tasks.into_iter().rev().take(query.limit.unwrap_or(u32::MAX) as usize),
|
2022-10-13 18:48:23 +08:00
|
|
|
)?;
|
|
|
|
|
2022-10-21 00:00:07 +08:00
|
|
|
let ProcessingTasks { started_at, processing, .. } =
|
|
|
|
self.processing_tasks.read().map_err(|_| Error::CorruptedTaskQueue)?.clone();
|
2022-10-03 22:15:10 +08:00
|
|
|
|
2022-10-12 09:21:25 +08:00
|
|
|
let ret = tasks.into_iter();
|
2022-10-03 22:15:10 +08:00
|
|
|
if processing.is_empty() {
|
|
|
|
Ok(ret.collect())
|
|
|
|
} else {
|
|
|
|
Ok(ret
|
|
|
|
.map(|task| match processing.contains(task.uid) {
|
2022-10-21 00:00:07 +08:00
|
|
|
true => {
|
|
|
|
Task { status: Status::Processing, started_at: Some(started_at), ..task }
|
|
|
|
}
|
2022-10-03 22:15:10 +08:00
|
|
|
false => task,
|
|
|
|
})
|
|
|
|
.collect())
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-10-20 16:25:34 +08:00
|
|
|
/// Register a new task in the scheduler.
|
|
|
|
///
|
|
|
|
/// If it fails and data was associated with the task, it tries to delete the associated data.
|
2022-10-17 23:19:17 +08:00
|
|
|
pub fn register(&self, kind: KindWithContent) -> Result<Task> {
|
2022-10-03 22:15:10 +08:00
|
|
|
let mut wtxn = self.env.write_txn()?;
|
|
|
|
|
2022-10-25 22:10:14 +08:00
|
|
|
let mut task = Task {
|
2022-10-03 22:15:10 +08:00
|
|
|
uid: self.next_task_id(&wtxn)?,
|
|
|
|
enqueued_at: time::OffsetDateTime::now_utc(),
|
|
|
|
started_at: None,
|
|
|
|
finished_at: None,
|
|
|
|
error: None,
|
2022-10-18 19:57:58 +08:00
|
|
|
canceled_by: None,
|
2022-10-17 23:19:17 +08:00
|
|
|
details: kind.default_details(),
|
2022-10-03 22:15:10 +08:00
|
|
|
status: Status::Enqueued,
|
2022-10-17 23:19:17 +08:00
|
|
|
kind: kind.clone(),
|
2022-10-03 22:15:10 +08:00
|
|
|
};
|
2022-10-25 22:10:14 +08:00
|
|
|
// For deletion and cancelation tasks, we want to make extra sure that they
|
|
|
|
// don't attempt to delete/cancel tasks that are newer than themselves.
|
|
|
|
filter_out_references_to_newer_tasks(&mut task);
|
2022-10-27 15:41:32 +08:00
|
|
|
// If the register task is an index swap task, verify that it is well-formed
|
|
|
|
// (that it does not contain duplicate indexes).
|
|
|
|
check_index_swap_validity(&task)?;
|
|
|
|
|
2022-10-25 22:10:14 +08:00
|
|
|
// Get rid of the mutability.
|
|
|
|
let task = task;
|
|
|
|
|
2022-10-21 00:00:07 +08:00
|
|
|
self.all_tasks.append(&mut wtxn, &BEU32::new(task.uid), &task)?;
|
2022-10-03 22:15:10 +08:00
|
|
|
|
2022-10-25 16:26:51 +08:00
|
|
|
for index in task.indexes() {
|
|
|
|
self.update_index(&mut wtxn, index, |bitmap| {
|
|
|
|
bitmap.insert(task.uid);
|
|
|
|
})?;
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
self.update_status(&mut wtxn, Status::Enqueued, |bitmap| {
|
|
|
|
bitmap.insert(task.uid);
|
|
|
|
})?;
|
|
|
|
|
|
|
|
self.update_kind(&mut wtxn, task.kind.as_kind(), |bitmap| {
|
2022-10-26 23:31:23 +08:00
|
|
|
bitmap.insert(task.uid);
|
2022-10-03 22:15:10 +08:00
|
|
|
})?;
|
|
|
|
|
2022-10-19 18:59:12 +08:00
|
|
|
utils::insert_task_datetime(&mut wtxn, self.enqueued_at, task.enqueued_at, task.uid)?;
|
|
|
|
|
2022-10-19 17:31:08 +08:00
|
|
|
if let Err(e) = wtxn.commit() {
|
|
|
|
self.delete_persisted_task_data(&task)?;
|
|
|
|
return Err(e.into());
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
|
|
|
|
2022-10-17 23:19:17 +08:00
|
|
|
// If the registered task is a task cancelation
|
|
|
|
// we inform the processing tasks to stop (if necessary).
|
|
|
|
if let KindWithContent::TaskCancelation { tasks, .. } = kind {
|
|
|
|
let tasks_to_cancel = RoaringBitmap::from_iter(tasks);
|
2022-10-21 00:00:07 +08:00
|
|
|
if self.processing_tasks.read().unwrap().must_cancel_processing_tasks(&tasks_to_cancel)
|
2022-10-19 17:22:59 +08:00
|
|
|
{
|
|
|
|
self.must_stop_processing.must_stop();
|
|
|
|
}
|
2022-10-17 23:19:17 +08:00
|
|
|
}
|
|
|
|
|
2022-10-10 22:20:35 +08:00
|
|
|
// notify the scheduler loop to execute a new tick
|
|
|
|
self.wake_up.signal();
|
2022-10-03 22:15:10 +08:00
|
|
|
|
2022-10-12 09:21:25 +08:00
|
|
|
Ok(task)
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
|
|
|
|
2022-10-16 07:39:01 +08:00
|
|
|
/// Register a new task comming from a dump in the scheduler.
|
|
|
|
/// By takinig a mutable ref we're pretty sure no one will ever import a dump while actix is running.
|
2022-10-17 22:45:00 +08:00
|
|
|
pub fn register_dumped_task(
|
2022-10-16 07:39:01 +08:00
|
|
|
&mut self,
|
|
|
|
task: TaskDump,
|
|
|
|
content_file: Option<Box<UpdateFile>>,
|
|
|
|
) -> Result<Task> {
|
|
|
|
// Currently we don't need to access the tasks queue while loading a dump thus I can block everything.
|
|
|
|
let mut wtxn = self.env.write_txn()?;
|
|
|
|
|
2022-10-16 08:38:36 +08:00
|
|
|
let content_uuid = match content_file {
|
|
|
|
Some(content_file) if task.status == Status::Enqueued => {
|
|
|
|
let (uuid, mut file) = self.create_update_file()?;
|
|
|
|
let mut builder = DocumentsBatchBuilder::new(file.as_file_mut());
|
|
|
|
for doc in content_file {
|
|
|
|
builder.append_json_object(&doc?)?;
|
|
|
|
}
|
|
|
|
builder.into_inner()?;
|
|
|
|
file.persist()?;
|
|
|
|
|
|
|
|
Some(uuid)
|
2022-10-16 07:39:01 +08:00
|
|
|
}
|
2022-10-16 08:38:36 +08:00
|
|
|
// If the task isn't `Enqueued` then just generate a recognisable `Uuid`
|
|
|
|
// in case we try to open it later.
|
2022-10-17 22:45:00 +08:00
|
|
|
_ if task.status != Status::Enqueued => Some(Uuid::nil()),
|
2022-10-16 08:38:36 +08:00
|
|
|
_ => None,
|
2022-10-16 07:39:01 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
let task = Task {
|
|
|
|
uid: task.uid,
|
|
|
|
enqueued_at: task.enqueued_at,
|
|
|
|
started_at: task.started_at,
|
|
|
|
finished_at: task.finished_at,
|
|
|
|
error: task.error,
|
2022-10-18 19:57:58 +08:00
|
|
|
canceled_by: task.canceled_by,
|
2022-10-16 07:39:01 +08:00
|
|
|
details: task.details,
|
|
|
|
status: task.status,
|
|
|
|
kind: match task.kind {
|
|
|
|
KindDump::DocumentImport {
|
|
|
|
primary_key,
|
|
|
|
method,
|
|
|
|
documents_count,
|
|
|
|
allow_index_creation,
|
2022-10-22 00:03:10 +08:00
|
|
|
} => KindWithContent::DocumentAdditionOrUpdate {
|
2022-10-16 07:39:01 +08:00
|
|
|
index_uid: task.index_uid.ok_or(Error::CorruptedDump)?,
|
|
|
|
primary_key,
|
|
|
|
method,
|
|
|
|
content_file: content_uuid.ok_or(Error::CorruptedDump)?,
|
|
|
|
documents_count,
|
|
|
|
allow_index_creation,
|
|
|
|
},
|
|
|
|
KindDump::DocumentDeletion { documents_ids } => KindWithContent::DocumentDeletion {
|
|
|
|
documents_ids,
|
|
|
|
index_uid: task.index_uid.ok_or(Error::CorruptedDump)?,
|
|
|
|
},
|
|
|
|
KindDump::DocumentClear => KindWithContent::DocumentClear {
|
|
|
|
index_uid: task.index_uid.ok_or(Error::CorruptedDump)?,
|
|
|
|
},
|
2022-10-21 00:00:07 +08:00
|
|
|
KindDump::Settings { settings, is_deletion, allow_index_creation } => {
|
2022-10-22 00:03:10 +08:00
|
|
|
KindWithContent::SettingsUpdate {
|
2022-10-21 00:00:07 +08:00
|
|
|
index_uid: task.index_uid.ok_or(Error::CorruptedDump)?,
|
|
|
|
new_settings: settings,
|
|
|
|
is_deletion,
|
|
|
|
allow_index_creation,
|
|
|
|
}
|
|
|
|
}
|
2022-10-16 07:39:01 +08:00
|
|
|
KindDump::IndexDeletion => KindWithContent::IndexDeletion {
|
|
|
|
index_uid: task.index_uid.ok_or(Error::CorruptedDump)?,
|
|
|
|
},
|
|
|
|
KindDump::IndexCreation { primary_key } => KindWithContent::IndexCreation {
|
|
|
|
index_uid: task.index_uid.ok_or(Error::CorruptedDump)?,
|
|
|
|
primary_key,
|
|
|
|
},
|
|
|
|
KindDump::IndexUpdate { primary_key } => KindWithContent::IndexUpdate {
|
|
|
|
index_uid: task.index_uid.ok_or(Error::CorruptedDump)?,
|
|
|
|
primary_key,
|
|
|
|
},
|
2022-10-17 22:30:18 +08:00
|
|
|
KindDump::IndexSwap { swaps } => KindWithContent::IndexSwap { swaps },
|
2022-10-17 23:19:17 +08:00
|
|
|
KindDump::TaskCancelation { query, tasks } => {
|
|
|
|
KindWithContent::TaskCancelation { query, tasks }
|
|
|
|
}
|
2022-10-18 00:11:28 +08:00
|
|
|
KindDump::TasksDeletion { query, tasks } => {
|
2022-10-17 21:11:35 +08:00
|
|
|
KindWithContent::TaskDeletion { query, tasks }
|
2022-10-16 07:39:01 +08:00
|
|
|
}
|
2022-10-25 01:08:15 +08:00
|
|
|
KindDump::DumpCreation { dump_uid, keys, instance_uid } => {
|
|
|
|
KindWithContent::DumpCreation { dump_uid, keys, instance_uid }
|
2022-10-21 00:00:07 +08:00
|
|
|
}
|
2022-10-25 16:44:58 +08:00
|
|
|
KindDump::SnapshotCreation => KindWithContent::SnapshotCreation,
|
2022-10-16 07:39:01 +08:00
|
|
|
},
|
|
|
|
};
|
|
|
|
|
2022-10-21 00:00:07 +08:00
|
|
|
self.all_tasks.put(&mut wtxn, &BEU32::new(task.uid), &task)?;
|
2022-10-16 07:39:01 +08:00
|
|
|
|
2022-10-25 16:26:51 +08:00
|
|
|
for index in task.indexes() {
|
|
|
|
self.update_index(&mut wtxn, index, |bitmap| {
|
|
|
|
bitmap.insert(task.uid);
|
|
|
|
})?;
|
2022-10-16 07:39:01 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
self.update_status(&mut wtxn, task.status, |bitmap| {
|
|
|
|
bitmap.insert(task.uid);
|
|
|
|
})?;
|
|
|
|
|
|
|
|
self.update_kind(&mut wtxn, task.kind.as_kind(), |bitmap| {
|
|
|
|
(bitmap.insert(task.uid));
|
|
|
|
})?;
|
|
|
|
|
2022-10-17 23:14:44 +08:00
|
|
|
wtxn.commit()?;
|
2022-10-16 08:44:27 +08:00
|
|
|
self.wake_up.signal();
|
2022-10-17 23:14:44 +08:00
|
|
|
|
2022-10-16 07:39:01 +08:00
|
|
|
Ok(task)
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Create a new index without any associated task.
|
|
|
|
pub fn create_raw_index(&self, name: &str) -> Result<Index> {
|
2022-10-26 20:19:56 +08:00
|
|
|
let wtxn = self.env.write_txn()?;
|
|
|
|
let index = self.index_mapper.create_index(wtxn, name)?;
|
2022-10-16 09:14:01 +08:00
|
|
|
|
|
|
|
Ok(index)
|
2022-10-16 07:39:01 +08:00
|
|
|
}
|
|
|
|
|
2022-10-20 16:25:34 +08:00
|
|
|
/// Create a file and register it in the index scheduler.
|
|
|
|
///
|
|
|
|
/// The returned file and uuid can be used to associate
|
|
|
|
/// some data to a task. The file will be kept until
|
|
|
|
/// the task has been fully processed.
|
2022-10-16 07:39:01 +08:00
|
|
|
pub fn create_update_file(&self) -> Result<(Uuid, file_store::File)> {
|
2022-10-03 22:15:10 +08:00
|
|
|
Ok(self.file_store.new_update()?)
|
|
|
|
}
|
2022-10-17 19:11:12 +08:00
|
|
|
|
2022-10-10 21:51:28 +08:00
|
|
|
#[cfg(test)]
|
2022-10-16 07:39:01 +08:00
|
|
|
pub fn create_update_file_with_uuid(&self, uuid: u128) -> Result<(Uuid, file_store::File)> {
|
2022-10-11 15:55:03 +08:00
|
|
|
Ok(self.file_store.new_update_with_uuid(uuid)?)
|
2022-10-10 21:51:28 +08:00
|
|
|
}
|
2022-10-03 22:15:10 +08:00
|
|
|
|
2022-10-20 16:25:34 +08:00
|
|
|
/// Delete a file from the index scheduler.
|
|
|
|
///
|
|
|
|
/// Counterpart to the [`create_update_file`](IndexScheduler::create_update_file) method.
|
2022-10-03 22:15:10 +08:00
|
|
|
pub fn delete_update_file(&self, uuid: Uuid) -> Result<()> {
|
|
|
|
Ok(self.file_store.delete(uuid)?)
|
|
|
|
}
|
|
|
|
|
2022-10-20 16:25:34 +08:00
|
|
|
/// Perform one iteration of the run loop.
|
|
|
|
///
|
|
|
|
/// 1. Find the next batch of tasks to be processed.
|
|
|
|
/// 2. Update the information of these tasks following the start of their processing.
|
|
|
|
/// 3. Update the in-memory list of processed tasks accordingly.
|
|
|
|
/// 4. Process the batch:
|
|
|
|
/// - perform the actions of each batched task
|
|
|
|
/// - update the information of each batched task following the end
|
|
|
|
/// of their processing.
|
|
|
|
/// 5. Reset the in-memory list of processed tasks.
|
2022-10-10 22:19:23 +08:00
|
|
|
///
|
|
|
|
/// Returns the number of processed tasks.
|
|
|
|
fn tick(&self) -> Result<usize> {
|
2022-10-03 22:15:10 +08:00
|
|
|
#[cfg(test)]
|
2022-10-20 23:11:44 +08:00
|
|
|
{
|
|
|
|
*self.run_loop_iteration.write().unwrap() += 1;
|
|
|
|
self.breakpoint(Breakpoint::Start);
|
|
|
|
}
|
2022-10-03 22:15:10 +08:00
|
|
|
|
2022-10-24 20:16:14 +08:00
|
|
|
let rtxn = self.env.read_txn().map_err(Error::HeedTransaction)?;
|
|
|
|
let batch =
|
|
|
|
match self.create_next_batch(&rtxn).map_err(|e| Error::CreateBatch(Box::new(e)))? {
|
|
|
|
Some(batch) => batch,
|
|
|
|
None => return Ok(0),
|
|
|
|
};
|
2022-10-19 13:34:10 +08:00
|
|
|
drop(rtxn);
|
2022-10-03 22:15:10 +08:00
|
|
|
|
|
|
|
// 1. store the starting date with the bitmap of processing tasks.
|
|
|
|
let mut ids = batch.ids();
|
|
|
|
ids.sort_unstable();
|
2022-10-10 22:19:23 +08:00
|
|
|
let processed_tasks = ids.len();
|
2022-10-03 22:15:10 +08:00
|
|
|
let processing_tasks = RoaringBitmap::from_sorted_iter(ids.iter().copied()).unwrap();
|
|
|
|
let started_at = OffsetDateTime::now_utc();
|
2022-10-19 17:22:59 +08:00
|
|
|
|
|
|
|
// We reset the must_stop flag to be sure that we don't stop processing tasks
|
|
|
|
self.must_stop_processing.reset();
|
2022-10-21 00:00:07 +08:00
|
|
|
self.processing_tasks.write().unwrap().start_processing_at(started_at, processing_tasks);
|
2022-10-03 22:15:10 +08:00
|
|
|
|
|
|
|
#[cfg(test)]
|
2022-10-20 23:11:44 +08:00
|
|
|
self.breakpoint(Breakpoint::BatchCreated);
|
2022-10-03 22:15:10 +08:00
|
|
|
|
|
|
|
// 2. Process the tasks
|
2022-10-20 23:11:44 +08:00
|
|
|
let res = {
|
|
|
|
let cloned_index_scheduler = self.private_clone();
|
|
|
|
let handle = std::thread::spawn(move || cloned_index_scheduler.process_batch(batch));
|
2022-10-25 16:53:29 +08:00
|
|
|
handle.join().unwrap_or(Err(Error::ProcessBatchPanicked))
|
2022-10-20 23:11:44 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
#[cfg(test)]
|
|
|
|
self.maybe_fail(tests::FailureLocation::AcquiringWtxn)?;
|
|
|
|
|
2022-10-24 20:16:14 +08:00
|
|
|
let mut wtxn = self.env.write_txn().map_err(Error::HeedTransaction)?;
|
2022-10-17 22:30:18 +08:00
|
|
|
|
2022-10-03 22:15:10 +08:00
|
|
|
let finished_at = OffsetDateTime::now_utc();
|
|
|
|
match res {
|
|
|
|
Ok(tasks) => {
|
2022-10-24 20:16:14 +08:00
|
|
|
#[cfg(test)]
|
|
|
|
self.breakpoint(Breakpoint::ProcessBatchSucceeded);
|
2022-10-20 23:11:44 +08:00
|
|
|
#[allow(unused_variables)]
|
|
|
|
for (i, mut task) in tasks.into_iter().enumerate() {
|
2022-10-03 22:15:10 +08:00
|
|
|
task.started_at = Some(started_at);
|
|
|
|
task.finished_at = Some(finished_at);
|
2022-10-20 23:11:44 +08:00
|
|
|
|
|
|
|
#[cfg(test)]
|
|
|
|
self.maybe_fail(
|
|
|
|
tests::FailureLocation::UpdatingTaskAfterProcessBatchSuccess {
|
|
|
|
task_uid: i as u32,
|
|
|
|
},
|
|
|
|
)?;
|
|
|
|
|
2022-10-24 20:16:14 +08:00
|
|
|
self.update_task(&mut wtxn, &task)
|
|
|
|
.map_err(|e| Error::TaskDatabaseUpdate(Box::new(e)))?;
|
|
|
|
if let Err(e) = self.delete_persisted_task_data(&task) {
|
|
|
|
log::error!("Failure to delete the content files associated with task {}. Error: {e}", task.uid);
|
|
|
|
}
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
2022-10-13 21:02:59 +08:00
|
|
|
log::info!("A batch of tasks was successfully completed.");
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
2022-10-17 23:19:17 +08:00
|
|
|
// If we have an abortion error we must stop the tick here and re-schedule tasks.
|
|
|
|
Err(Error::Milli(milli::Error::InternalError(
|
|
|
|
milli::InternalError::AbortedIndexation,
|
|
|
|
))) => {
|
2022-10-24 20:16:14 +08:00
|
|
|
#[cfg(test)]
|
|
|
|
self.breakpoint(Breakpoint::AbortedIndexation);
|
|
|
|
wtxn.abort().map_err(Error::HeedTransaction)?;
|
2022-11-02 22:38:07 +08:00
|
|
|
|
|
|
|
// We make sure that we don't call `stop_processing` on the `processing_tasks`,
|
|
|
|
// this is because we want to let the next tick call `create_next_batch` and keep
|
|
|
|
// the `started_at` date times and `processings` of the current processing tasks.
|
|
|
|
// This date time is used by the task cancelation to store the right `started_at`
|
|
|
|
// date in the task on disk.
|
2022-10-17 23:19:17 +08:00
|
|
|
return Ok(0);
|
|
|
|
}
|
2022-10-03 22:15:10 +08:00
|
|
|
// In case of a failure we must get back and patch all the tasks with the error.
|
2022-10-05 22:48:43 +08:00
|
|
|
Err(err) => {
|
2022-10-24 20:16:14 +08:00
|
|
|
#[cfg(test)]
|
|
|
|
self.breakpoint(Breakpoint::ProcessBatchFailed);
|
2022-10-05 22:48:43 +08:00
|
|
|
let error: ResponseError = err.into();
|
2022-10-03 22:15:10 +08:00
|
|
|
for id in ids {
|
2022-10-24 20:16:14 +08:00
|
|
|
let mut task = self
|
|
|
|
.get_task(&wtxn, id)
|
|
|
|
.map_err(|e| Error::TaskDatabaseUpdate(Box::new(e)))?
|
|
|
|
.ok_or(Error::CorruptedTaskQueue)?;
|
2022-10-03 22:15:10 +08:00
|
|
|
task.started_at = Some(started_at);
|
|
|
|
task.finished_at = Some(finished_at);
|
|
|
|
task.status = Status::Failed;
|
2022-10-05 22:48:43 +08:00
|
|
|
task.error = Some(error.clone());
|
2022-10-03 22:15:10 +08:00
|
|
|
|
2022-10-20 23:11:44 +08:00
|
|
|
#[cfg(test)]
|
|
|
|
self.maybe_fail(tests::FailureLocation::UpdatingTaskAfterProcessBatchFailure)?;
|
|
|
|
|
2022-10-24 20:16:14 +08:00
|
|
|
if let Err(e) = self.delete_persisted_task_data(&task) {
|
|
|
|
log::error!("Failure to delete the content files associated with task {}. Error: {e}", task.uid);
|
|
|
|
}
|
|
|
|
self.update_task(&mut wtxn, &task)
|
|
|
|
.map_err(|e| Error::TaskDatabaseUpdate(Box::new(e)))?;
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2022-10-26 23:31:23 +08:00
|
|
|
|
2022-11-02 22:38:07 +08:00
|
|
|
self.processing_tasks.write().unwrap().stop_processing();
|
2022-10-20 23:11:44 +08:00
|
|
|
|
|
|
|
#[cfg(test)]
|
|
|
|
self.maybe_fail(tests::FailureLocation::CommittingWtxn)?;
|
|
|
|
|
2022-10-24 20:16:14 +08:00
|
|
|
wtxn.commit().map_err(Error::HeedTransaction)?;
|
2022-10-03 22:15:10 +08:00
|
|
|
|
|
|
|
#[cfg(test)]
|
2022-10-20 23:11:44 +08:00
|
|
|
self.breakpoint(Breakpoint::AfterProcessing);
|
2022-10-03 22:15:10 +08:00
|
|
|
|
2022-10-10 22:19:23 +08:00
|
|
|
Ok(processed_tasks)
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
2022-10-18 21:04:14 +08:00
|
|
|
|
|
|
|
pub(crate) fn delete_persisted_task_data(&self, task: &Task) -> Result<()> {
|
2022-10-19 17:33:05 +08:00
|
|
|
match task.content_uuid() {
|
2022-10-25 20:09:01 +08:00
|
|
|
Some(content_file) => self.delete_update_file(content_file),
|
2022-10-19 17:33:05 +08:00
|
|
|
None => Ok(()),
|
2022-10-18 21:04:14 +08:00
|
|
|
}
|
|
|
|
}
|
2022-10-20 23:11:44 +08:00
|
|
|
|
2022-10-25 15:48:51 +08:00
|
|
|
/// Blocks the thread until the test handle asks to progress to/through this breakpoint.
|
|
|
|
///
|
|
|
|
/// Two messages are sent through the channel for each breakpoint.
|
|
|
|
/// The first message is `(b, false)` and the second message is `(b, true)`.
|
|
|
|
///
|
|
|
|
/// Since the channel has a capacity of zero, the `send` and `recv` calls wait for each other.
|
|
|
|
/// So when the index scheduler calls `test_breakpoint_sdr.send(b, false)`, it blocks
|
|
|
|
/// the thread until the test catches up by calling `test_breakpoint_rcv.recv()` enough.
|
|
|
|
/// From the test side, we call `recv()` repeatedly until we find the message `(breakpoint, false)`.
|
|
|
|
/// As soon as we find it, the index scheduler is unblocked but then wait again on the call to
|
|
|
|
/// `test_breakpoint_sdr.send(b, true)`. This message will only be able to send once the
|
|
|
|
/// test asks to progress to the next `(b2, false)`.
|
2022-10-20 23:11:44 +08:00
|
|
|
#[cfg(test)]
|
|
|
|
fn breakpoint(&self, b: Breakpoint) {
|
|
|
|
// We send two messages. The first one will sync with the call
|
|
|
|
// to `handle.wait_until(b)`. The second one will block until the
|
|
|
|
// the next call to `handle.wait_until(..)`.
|
|
|
|
self.test_breakpoint_sdr.send((b, false)).unwrap();
|
|
|
|
// This one will only be able to be sent if the test handle stays alive.
|
|
|
|
// If it fails, then it means that we have exited the test.
|
|
|
|
// By crashing with `unwrap`, we kill the run loop.
|
|
|
|
self.test_breakpoint_sdr.send((b, true)).unwrap();
|
|
|
|
}
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
|
|
|
|
2022-09-15 18:23:41 +08:00
|
|
|
#[cfg(test)]
|
|
|
|
mod tests {
|
2022-10-24 20:16:14 +08:00
|
|
|
use std::time::Instant;
|
|
|
|
|
2022-10-03 22:15:10 +08:00
|
|
|
use big_s::S;
|
2022-10-18 01:24:06 +08:00
|
|
|
use file_store::File;
|
2022-10-13 17:09:00 +08:00
|
|
|
use meili_snap::snapshot;
|
2022-10-24 23:29:17 +08:00
|
|
|
use meilisearch_types::milli::obkv_to_json;
|
|
|
|
use meilisearch_types::milli::update::IndexDocumentsMethod::{
|
|
|
|
ReplaceDocuments, UpdateDocuments,
|
|
|
|
};
|
2022-10-26 18:57:29 +08:00
|
|
|
use meilisearch_types::tasks::IndexSwap;
|
2022-10-25 21:51:15 +08:00
|
|
|
use meilisearch_types::VERSION_FILE_NAME;
|
2022-10-03 22:15:10 +08:00
|
|
|
use tempfile::TempDir;
|
2022-10-24 19:32:46 +08:00
|
|
|
use time::Duration;
|
2022-10-03 22:15:10 +08:00
|
|
|
use uuid::Uuid;
|
|
|
|
|
|
|
|
use super::*;
|
2022-10-25 16:23:14 +08:00
|
|
|
use crate::insta_snapshot::{snapshot_bitmap, snapshot_index_scheduler};
|
2022-10-20 23:11:44 +08:00
|
|
|
|
|
|
|
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
|
|
|
|
pub enum FailureLocation {
|
|
|
|
InsideCreateBatch,
|
|
|
|
InsideProcessBatch,
|
|
|
|
PanicInsideProcessBatch,
|
|
|
|
AcquiringWtxn,
|
|
|
|
UpdatingTaskAfterProcessBatchSuccess { task_uid: u32 },
|
|
|
|
UpdatingTaskAfterProcessBatchFailure,
|
|
|
|
CommittingWtxn,
|
|
|
|
}
|
|
|
|
|
|
|
|
impl IndexScheduler {
|
|
|
|
pub fn test(
|
2022-10-26 17:41:59 +08:00
|
|
|
autobatching_enabled: bool,
|
2022-10-20 23:11:44 +08:00
|
|
|
planned_failures: Vec<(usize, FailureLocation)>,
|
|
|
|
) -> (Self, IndexSchedulerHandle) {
|
|
|
|
let tempdir = TempDir::new().unwrap();
|
|
|
|
let (sender, receiver) = crossbeam::channel::bounded(0);
|
|
|
|
|
2022-10-26 17:41:59 +08:00
|
|
|
let options = IndexSchedulerOptions {
|
|
|
|
version_file_path: tempdir.path().join(VERSION_FILE_NAME),
|
|
|
|
auth_path: tempdir.path().join("auth"),
|
|
|
|
tasks_path: tempdir.path().join("db_path"),
|
|
|
|
update_file_path: tempdir.path().join("file_store"),
|
|
|
|
indexes_path: tempdir.path().join("indexes"),
|
|
|
|
snapshots_path: tempdir.path().join("snapshots"),
|
|
|
|
dumps_path: tempdir.path().join("dumps"),
|
|
|
|
task_db_size: 1024 * 1024, // 1 MiB
|
|
|
|
index_size: 1024 * 1024, // 1 MiB
|
|
|
|
indexer_config: IndexerConfig::default(),
|
|
|
|
autobatching_enabled,
|
|
|
|
};
|
|
|
|
|
|
|
|
let index_scheduler = Self::new(options, sender, planned_failures).unwrap();
|
2022-10-20 23:11:44 +08:00
|
|
|
|
|
|
|
let index_scheduler_handle =
|
|
|
|
IndexSchedulerHandle { _tempdir: tempdir, test_breakpoint_rcv: receiver };
|
|
|
|
|
|
|
|
(index_scheduler, index_scheduler_handle)
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Return a [`CorruptedTaskQueue`](Error::CorruptedTaskQueue) error if a failure is planned
|
|
|
|
/// for the given location and current run loop iteration.
|
|
|
|
pub fn maybe_fail(&self, location: FailureLocation) -> Result<()> {
|
|
|
|
if self.planned_failures.contains(&(*self.run_loop_iteration.read().unwrap(), location))
|
|
|
|
{
|
|
|
|
match location {
|
|
|
|
FailureLocation::PanicInsideProcessBatch => {
|
|
|
|
panic!("simulated panic")
|
|
|
|
}
|
|
|
|
_ => Err(Error::CorruptedTaskQueue),
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
Ok(())
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2022-10-03 22:15:10 +08:00
|
|
|
|
2022-10-10 23:02:28 +08:00
|
|
|
/// Return a `KindWithContent::IndexCreation` task
|
|
|
|
fn index_creation_task(index: &'static str, primary_key: &'static str) -> KindWithContent {
|
2022-10-21 00:00:07 +08:00
|
|
|
KindWithContent::IndexCreation { index_uid: S(index), primary_key: Some(S(primary_key)) }
|
2022-10-10 23:02:28 +08:00
|
|
|
}
|
|
|
|
/// Create a `KindWithContent::DocumentImport` task that imports documents.
|
|
|
|
///
|
|
|
|
/// - `index_uid` is given as parameter
|
|
|
|
/// - `primary_key` is given as parameter
|
|
|
|
/// - `method` is set to `ReplaceDocuments`
|
|
|
|
/// - `content_file` is given as parameter
|
|
|
|
/// - `documents_count` is given as parameter
|
|
|
|
/// - `allow_index_creation` is set to `true`
|
|
|
|
fn replace_document_import_task(
|
|
|
|
index: &'static str,
|
|
|
|
primary_key: Option<&'static str>,
|
|
|
|
content_file_uuid: u128,
|
|
|
|
documents_count: u64,
|
|
|
|
) -> KindWithContent {
|
2022-10-22 00:03:10 +08:00
|
|
|
KindWithContent::DocumentAdditionOrUpdate {
|
2022-10-10 23:02:28 +08:00
|
|
|
index_uid: S(index),
|
|
|
|
primary_key: primary_key.map(ToOwned::to_owned),
|
|
|
|
method: ReplaceDocuments,
|
|
|
|
content_file: Uuid::from_u128(content_file_uuid),
|
2022-10-22 22:35:42 +08:00
|
|
|
documents_count,
|
2022-10-10 23:02:28 +08:00
|
|
|
allow_index_creation: true,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Create an update file with the given file uuid.
|
|
|
|
///
|
|
|
|
/// The update file contains just one simple document whose id is given by `document_id`.
|
|
|
|
///
|
|
|
|
/// The uuid of the file and its documents count is returned.
|
|
|
|
fn sample_documents(
|
|
|
|
index_scheduler: &IndexScheduler,
|
|
|
|
file_uuid: u128,
|
|
|
|
document_id: usize,
|
|
|
|
) -> (File, u64) {
|
|
|
|
let content = format!(
|
|
|
|
r#"
|
|
|
|
{{
|
|
|
|
"id" : "{document_id}"
|
|
|
|
}}"#
|
|
|
|
);
|
|
|
|
|
2022-10-21 00:00:07 +08:00
|
|
|
let (_uuid, mut file) = index_scheduler.create_update_file_with_uuid(file_uuid).unwrap();
|
2022-10-10 23:02:28 +08:00
|
|
|
let documents_count =
|
2022-10-11 23:42:43 +08:00
|
|
|
meilisearch_types::document_formats::read_json(content.as_bytes(), file.as_file_mut())
|
|
|
|
.unwrap() as u64;
|
2022-10-10 23:02:28 +08:00
|
|
|
(file, documents_count)
|
|
|
|
}
|
|
|
|
|
2022-10-03 22:15:10 +08:00
|
|
|
pub struct IndexSchedulerHandle {
|
|
|
|
_tempdir: TempDir,
|
2022-10-20 23:11:44 +08:00
|
|
|
test_breakpoint_rcv: crossbeam::channel::Receiver<(Breakpoint, bool)>,
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
impl IndexSchedulerHandle {
|
|
|
|
/// Wait until the provided breakpoint is reached.
|
|
|
|
fn wait_till(&self, breakpoint: Breakpoint) {
|
2022-10-20 23:11:44 +08:00
|
|
|
self.test_breakpoint_rcv.iter().find(|b| *b == (breakpoint, false));
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
2022-10-24 23:29:17 +08:00
|
|
|
|
|
|
|
/// Wait for `n` tasks.
|
|
|
|
fn advance_n_batch(&self, n: usize) {
|
|
|
|
for _ in 0..n {
|
|
|
|
self.wait_till(Breakpoint::AfterProcessing);
|
|
|
|
}
|
|
|
|
}
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn register() {
|
2022-10-10 23:02:28 +08:00
|
|
|
// In this test, the handle doesn't make any progress, we only check that the tasks are registered
|
2022-10-20 23:11:44 +08:00
|
|
|
let (index_scheduler, _handle) = IndexScheduler::test(true, vec![]);
|
2022-10-03 22:15:10 +08:00
|
|
|
|
|
|
|
let kinds = [
|
2022-10-10 23:02:28 +08:00
|
|
|
index_creation_task("catto", "mouse"),
|
|
|
|
replace_document_import_task("catto", None, 0, 12),
|
|
|
|
replace_document_import_task("catto", None, 1, 50),
|
|
|
|
replace_document_import_task("doggo", Some("bone"), 2, 5000),
|
2022-10-03 22:15:10 +08:00
|
|
|
];
|
2022-10-20 19:11:50 +08:00
|
|
|
let (_, file) = index_scheduler.create_update_file_with_uuid(0).unwrap();
|
|
|
|
file.persist().unwrap();
|
|
|
|
let (_, file) = index_scheduler.create_update_file_with_uuid(1).unwrap();
|
|
|
|
file.persist().unwrap();
|
|
|
|
let (_, file) = index_scheduler.create_update_file_with_uuid(2).unwrap();
|
|
|
|
file.persist().unwrap();
|
|
|
|
|
2022-10-03 22:15:10 +08:00
|
|
|
for (idx, kind) in kinds.into_iter().enumerate() {
|
|
|
|
let k = kind.as_kind();
|
|
|
|
let task = index_scheduler.register(kind).unwrap();
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-03 22:15:10 +08:00
|
|
|
|
|
|
|
assert_eq!(task.uid, idx as u32);
|
|
|
|
assert_eq!(task.status, Status::Enqueued);
|
2022-10-12 09:21:25 +08:00
|
|
|
assert_eq!(task.kind.as_kind(), k);
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
|
|
|
|
2022-10-13 17:09:00 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn insert_task_while_another_task_is_processing() {
|
2022-10-20 23:11:44 +08:00
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(true, vec![]);
|
2022-10-03 22:15:10 +08:00
|
|
|
|
2022-10-21 00:00:07 +08:00
|
|
|
index_scheduler.register(index_creation_task("index_a", "id")).unwrap();
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-03 22:15:10 +08:00
|
|
|
handle.wait_till(Breakpoint::BatchCreated);
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-03 22:15:10 +08:00
|
|
|
// while the task is processing can we register another task?
|
2022-10-21 00:00:07 +08:00
|
|
|
index_scheduler.register(index_creation_task("index_b", "id")).unwrap();
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-17 22:30:18 +08:00
|
|
|
index_scheduler
|
2022-10-21 00:00:07 +08:00
|
|
|
.register(KindWithContent::IndexDeletion { index_uid: S("index_a") })
|
2022-10-03 22:15:10 +08:00
|
|
|
.unwrap();
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-03 22:15:10 +08:00
|
|
|
|
2022-10-13 17:09:00 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
|
|
|
|
2022-10-10 22:18:35 +08:00
|
|
|
/// We send a lot of tasks but notify the tasks scheduler only once as
|
|
|
|
/// we send them very fast, we must make sure that they are all processed.
|
|
|
|
#[test]
|
|
|
|
fn process_tasks_inserted_without_new_signal() {
|
2022-10-20 23:11:44 +08:00
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(true, vec![]);
|
2022-10-10 22:18:35 +08:00
|
|
|
|
|
|
|
index_scheduler
|
2022-10-21 00:00:07 +08:00
|
|
|
.register(KindWithContent::IndexCreation { index_uid: S("doggos"), primary_key: None })
|
2022-10-10 22:18:35 +08:00
|
|
|
.unwrap();
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-10 22:18:35 +08:00
|
|
|
index_scheduler
|
2022-10-21 00:00:07 +08:00
|
|
|
.register(KindWithContent::IndexCreation { index_uid: S("cattos"), primary_key: None })
|
2022-10-10 22:18:35 +08:00
|
|
|
.unwrap();
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-10 22:18:35 +08:00
|
|
|
index_scheduler
|
2022-10-21 00:00:07 +08:00
|
|
|
.register(KindWithContent::IndexDeletion { index_uid: S("doggos") })
|
2022-10-10 22:18:35 +08:00
|
|
|
.unwrap();
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-10 22:18:35 +08:00
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::Start);
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-10 22:18:35 +08:00
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-10 22:18:35 +08:00
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-10 22:18:35 +08:00
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-10 22:18:35 +08:00
|
|
|
|
2022-10-27 17:17:50 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "all_tasks_processed");
|
2022-10-10 22:18:35 +08:00
|
|
|
}
|
|
|
|
|
2022-10-10 23:00:56 +08:00
|
|
|
#[test]
|
|
|
|
fn process_tasks_without_autobatching() {
|
2022-10-20 23:11:44 +08:00
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(false, vec![]);
|
2022-10-10 23:00:56 +08:00
|
|
|
|
|
|
|
index_scheduler
|
2022-10-21 00:00:07 +08:00
|
|
|
.register(KindWithContent::IndexCreation { index_uid: S("doggos"), primary_key: None })
|
2022-10-10 23:00:56 +08:00
|
|
|
.unwrap();
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-10 23:00:56 +08:00
|
|
|
index_scheduler
|
2022-10-21 00:00:07 +08:00
|
|
|
.register(KindWithContent::DocumentClear { index_uid: S("doggos") })
|
2022-10-10 23:00:56 +08:00
|
|
|
.unwrap();
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-10 23:00:56 +08:00
|
|
|
index_scheduler
|
2022-10-21 00:00:07 +08:00
|
|
|
.register(KindWithContent::DocumentClear { index_uid: S("doggos") })
|
2022-10-10 23:00:56 +08:00
|
|
|
.unwrap();
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-10 23:00:56 +08:00
|
|
|
index_scheduler
|
2022-10-21 00:00:07 +08:00
|
|
|
.register(KindWithContent::DocumentClear { index_uid: S("doggos") })
|
2022-10-10 23:00:56 +08:00
|
|
|
.unwrap();
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-10 23:00:56 +08:00
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-10 23:00:56 +08:00
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-10 23:00:56 +08:00
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-10 23:00:56 +08:00
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-10 23:00:56 +08:00
|
|
|
|
2022-10-27 17:17:50 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "all_tasks_processed");
|
2022-10-10 23:00:56 +08:00
|
|
|
}
|
|
|
|
|
2022-10-06 22:53:21 +08:00
|
|
|
#[test]
|
2022-10-10 23:02:28 +08:00
|
|
|
fn task_deletion_undeleteable() {
|
2022-10-20 23:11:44 +08:00
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(true, vec![]);
|
2022-10-06 22:53:21 +08:00
|
|
|
|
2022-10-20 19:11:50 +08:00
|
|
|
let (file0, documents_count0) = sample_documents(&index_scheduler, 0, 0);
|
|
|
|
let (file1, documents_count1) = sample_documents(&index_scheduler, 1, 1);
|
|
|
|
file0.persist().unwrap();
|
|
|
|
file1.persist().unwrap();
|
|
|
|
|
2022-10-06 22:53:21 +08:00
|
|
|
let to_enqueue = [
|
2022-10-10 23:02:28 +08:00
|
|
|
index_creation_task("catto", "mouse"),
|
2022-10-20 19:11:50 +08:00
|
|
|
replace_document_import_task("catto", None, 0, documents_count0),
|
|
|
|
replace_document_import_task("doggo", Some("bone"), 1, documents_count1),
|
2022-10-06 22:53:21 +08:00
|
|
|
];
|
2022-10-20 19:11:50 +08:00
|
|
|
|
2022-10-06 22:53:21 +08:00
|
|
|
for task in to_enqueue {
|
|
|
|
let _ = index_scheduler.register(task).unwrap();
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-06 22:53:21 +08:00
|
|
|
}
|
2022-10-10 21:51:28 +08:00
|
|
|
|
2022-10-10 23:02:28 +08:00
|
|
|
// here we have registered all the tasks, but the index scheduler
|
|
|
|
// has not progressed at all
|
2022-10-13 17:09:00 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "initial_tasks_enqueued");
|
2022-10-06 22:53:21 +08:00
|
|
|
|
2022-10-10 23:02:28 +08:00
|
|
|
index_scheduler
|
2022-10-13 17:09:00 +08:00
|
|
|
.register(KindWithContent::TaskDeletion {
|
2022-10-10 23:02:28 +08:00
|
|
|
query: "test_query".to_owned(),
|
2022-10-25 16:53:29 +08:00
|
|
|
tasks: RoaringBitmap::from_iter([0, 1]),
|
2022-10-10 23:02:28 +08:00
|
|
|
})
|
|
|
|
.unwrap();
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-10 23:02:28 +08:00
|
|
|
|
|
|
|
// again, no progress made at all, but one more task is registered
|
2022-10-13 17:09:00 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "task_deletion_enqueued");
|
2022-10-06 22:53:21 +08:00
|
|
|
|
2022-10-10 23:02:28 +08:00
|
|
|
// now we create the first batch
|
2022-10-06 22:53:21 +08:00
|
|
|
handle.wait_till(Breakpoint::BatchCreated);
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-06 22:53:21 +08:00
|
|
|
|
2022-10-10 23:02:28 +08:00
|
|
|
// the task deletion should now be "processing"
|
2022-10-13 17:09:00 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "task_deletion_processing");
|
2022-10-06 22:53:21 +08:00
|
|
|
|
2022-10-10 18:57:17 +08:00
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-06 22:53:21 +08:00
|
|
|
|
2022-10-10 23:02:28 +08:00
|
|
|
// after the task deletion is processed, no task should actually have been deleted,
|
|
|
|
// because the tasks with ids 0 and 1 were still "enqueued", and thus undeleteable
|
|
|
|
// the "task deletion" task should be marked as "succeeded" and, in its details, the
|
|
|
|
// number of deleted tasks should be 0
|
2022-10-13 17:09:00 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "task_deletion_done");
|
2022-10-10 23:02:28 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn task_deletion_deleteable() {
|
2022-10-20 23:11:44 +08:00
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(true, vec![]);
|
2022-10-10 23:02:28 +08:00
|
|
|
|
|
|
|
let (file0, documents_count0) = sample_documents(&index_scheduler, 0, 0);
|
|
|
|
let (file1, documents_count1) = sample_documents(&index_scheduler, 1, 1);
|
2022-10-20 19:11:50 +08:00
|
|
|
file0.persist().unwrap();
|
|
|
|
file1.persist().unwrap();
|
2022-10-10 23:02:28 +08:00
|
|
|
|
|
|
|
let to_enqueue = [
|
|
|
|
replace_document_import_task("catto", None, 0, documents_count0),
|
|
|
|
replace_document_import_task("doggo", Some("bone"), 1, documents_count1),
|
|
|
|
];
|
|
|
|
|
|
|
|
for task in to_enqueue {
|
|
|
|
let _ = index_scheduler.register(task).unwrap();
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-10 23:02:28 +08:00
|
|
|
}
|
|
|
|
|
2022-10-13 17:09:00 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "initial_tasks_enqueued");
|
2022-10-10 23:02:28 +08:00
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-10 23:02:28 +08:00
|
|
|
// first addition of documents should be successful
|
2022-10-13 17:09:00 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "initial_tasks_processed");
|
2022-10-10 23:02:28 +08:00
|
|
|
|
|
|
|
// Now we delete the first task
|
|
|
|
index_scheduler
|
2022-10-13 17:09:00 +08:00
|
|
|
.register(KindWithContent::TaskDeletion {
|
2022-10-10 23:02:28 +08:00
|
|
|
query: "test_query".to_owned(),
|
2022-10-25 16:53:29 +08:00
|
|
|
tasks: RoaringBitmap::from_iter([0]),
|
2022-10-10 23:02:28 +08:00
|
|
|
})
|
|
|
|
.unwrap();
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-10 23:02:28 +08:00
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-13 17:09:00 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "task_deletion_processed");
|
2022-10-06 22:53:21 +08:00
|
|
|
}
|
|
|
|
|
2022-10-15 17:38:43 +08:00
|
|
|
#[test]
|
|
|
|
fn task_deletion_delete_same_task_twice() {
|
2022-10-20 23:11:44 +08:00
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(true, vec![]);
|
2022-10-15 17:38:43 +08:00
|
|
|
|
|
|
|
let (file0, documents_count0) = sample_documents(&index_scheduler, 0, 0);
|
|
|
|
let (file1, documents_count1) = sample_documents(&index_scheduler, 1, 1);
|
2022-10-20 19:11:50 +08:00
|
|
|
file0.persist().unwrap();
|
|
|
|
file1.persist().unwrap();
|
2022-10-15 17:38:43 +08:00
|
|
|
|
|
|
|
let to_enqueue = [
|
|
|
|
replace_document_import_task("catto", None, 0, documents_count0),
|
|
|
|
replace_document_import_task("doggo", Some("bone"), 1, documents_count1),
|
|
|
|
];
|
|
|
|
|
|
|
|
for task in to_enqueue {
|
|
|
|
let _ = index_scheduler.register(task).unwrap();
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-15 17:38:43 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "initial_tasks_enqueued");
|
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-15 17:38:43 +08:00
|
|
|
// first addition of documents should be successful
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "initial_tasks_processed");
|
|
|
|
|
|
|
|
// Now we delete the first task multiple times in a row
|
|
|
|
for _ in 0..2 {
|
|
|
|
index_scheduler
|
|
|
|
.register(KindWithContent::TaskDeletion {
|
|
|
|
query: "test_query".to_owned(),
|
2022-10-25 16:53:29 +08:00
|
|
|
tasks: RoaringBitmap::from_iter([0]),
|
2022-10-15 17:38:43 +08:00
|
|
|
})
|
|
|
|
.unwrap();
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-15 17:38:43 +08:00
|
|
|
}
|
|
|
|
for _ in 0..2 {
|
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-15 17:38:43 +08:00
|
|
|
}
|
2022-10-20 19:11:50 +08:00
|
|
|
|
2022-10-15 17:38:43 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "task_deletion_processed");
|
|
|
|
}
|
|
|
|
|
2022-10-03 22:15:10 +08:00
|
|
|
#[test]
|
|
|
|
fn document_addition() {
|
2022-10-20 23:11:44 +08:00
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(true, vec![]);
|
2022-10-03 22:15:10 +08:00
|
|
|
|
|
|
|
let content = r#"
|
|
|
|
{
|
|
|
|
"id": 1,
|
|
|
|
"doggo": "bob"
|
|
|
|
}"#;
|
|
|
|
|
2022-10-10 21:51:28 +08:00
|
|
|
let (uuid, mut file) = index_scheduler.create_update_file_with_uuid(0).unwrap();
|
2022-10-03 22:15:10 +08:00
|
|
|
let documents_count =
|
2022-10-11 23:42:43 +08:00
|
|
|
meilisearch_types::document_formats::read_json(content.as_bytes(), file.as_file_mut())
|
|
|
|
.unwrap() as u64;
|
2022-10-20 19:11:50 +08:00
|
|
|
file.persist().unwrap();
|
2022-10-03 22:15:10 +08:00
|
|
|
index_scheduler
|
2022-10-22 00:03:10 +08:00
|
|
|
.register(KindWithContent::DocumentAdditionOrUpdate {
|
2022-10-03 22:15:10 +08:00
|
|
|
index_uid: S("doggos"),
|
|
|
|
primary_key: Some(S("id")),
|
|
|
|
method: ReplaceDocuments,
|
|
|
|
content_file: uuid,
|
|
|
|
documents_count,
|
|
|
|
allow_index_creation: true,
|
|
|
|
})
|
|
|
|
.unwrap();
|
2022-10-20 19:11:50 +08:00
|
|
|
|
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-03 22:15:10 +08:00
|
|
|
|
2022-10-13 17:09:00 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
2022-10-03 22:15:10 +08:00
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::BatchCreated);
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-03 22:15:10 +08:00
|
|
|
|
2022-10-13 17:09:00 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
2022-10-03 22:15:10 +08:00
|
|
|
|
2022-10-10 21:51:28 +08:00
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-03 22:15:10 +08:00
|
|
|
|
2022-10-13 17:09:00 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
2022-10-03 22:15:10 +08:00
|
|
|
}
|
|
|
|
|
2022-10-19 22:44:42 +08:00
|
|
|
#[test]
|
|
|
|
fn document_addition_and_index_deletion() {
|
2022-10-20 23:11:44 +08:00
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(true, vec![]);
|
2022-10-19 22:44:42 +08:00
|
|
|
|
|
|
|
let content = r#"
|
|
|
|
{
|
|
|
|
"id": 1,
|
|
|
|
"doggo": "bob"
|
|
|
|
}"#;
|
|
|
|
|
|
|
|
index_scheduler
|
2022-10-21 00:00:07 +08:00
|
|
|
.register(KindWithContent::IndexCreation { index_uid: S("doggos"), primary_key: None })
|
2022-10-19 22:44:42 +08:00
|
|
|
.unwrap();
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-19 22:44:42 +08:00
|
|
|
|
|
|
|
let (uuid, mut file) = index_scheduler.create_update_file_with_uuid(0).unwrap();
|
|
|
|
let documents_count =
|
|
|
|
meilisearch_types::document_formats::read_json(content.as_bytes(), file.as_file_mut())
|
|
|
|
.unwrap() as u64;
|
|
|
|
file.persist().unwrap();
|
|
|
|
index_scheduler
|
2022-10-22 00:03:10 +08:00
|
|
|
.register(KindWithContent::DocumentAdditionOrUpdate {
|
2022-10-19 22:44:42 +08:00
|
|
|
index_uid: S("doggos"),
|
|
|
|
primary_key: Some(S("id")),
|
|
|
|
method: ReplaceDocuments,
|
|
|
|
content_file: uuid,
|
|
|
|
documents_count,
|
|
|
|
allow_index_creation: true,
|
|
|
|
})
|
|
|
|
.unwrap();
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-19 22:44:42 +08:00
|
|
|
index_scheduler
|
2022-10-21 00:00:07 +08:00
|
|
|
.register(KindWithContent::IndexDeletion { index_uid: S("doggos") })
|
2022-10-19 22:44:42 +08:00
|
|
|
.unwrap();
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-19 22:44:42 +08:00
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::Start); // The index creation.
|
|
|
|
handle.wait_till(Breakpoint::Start); // before anything happens.
|
|
|
|
handle.wait_till(Breakpoint::Start); // after the execution of the two tasks in a single batch.
|
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
}
|
|
|
|
|
2022-10-13 16:57:33 +08:00
|
|
|
#[test]
|
|
|
|
fn do_not_batch_task_of_different_indexes() {
|
2022-10-20 23:11:44 +08:00
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(true, vec![]);
|
2022-10-13 16:57:33 +08:00
|
|
|
let index_names = ["doggos", "cattos", "girafos"];
|
|
|
|
|
|
|
|
for name in index_names {
|
|
|
|
index_scheduler
|
|
|
|
.register(KindWithContent::IndexCreation {
|
|
|
|
index_uid: name.to_string(),
|
|
|
|
primary_key: None,
|
|
|
|
})
|
|
|
|
.unwrap();
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-13 16:57:33 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
for name in index_names {
|
|
|
|
index_scheduler
|
2022-10-21 00:00:07 +08:00
|
|
|
.register(KindWithContent::DocumentClear { index_uid: name.to_string() })
|
2022-10-13 16:57:33 +08:00
|
|
|
.unwrap();
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-13 16:57:33 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
for _ in 0..(index_names.len() * 2) {
|
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
2022-10-20 19:11:50 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-13 16:57:33 +08:00
|
|
|
}
|
|
|
|
|
2022-10-27 17:17:50 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "all_tasks_processed");
|
2022-10-13 16:57:33 +08:00
|
|
|
}
|
|
|
|
|
2022-10-17 22:30:18 +08:00
|
|
|
#[test]
|
|
|
|
fn swap_indexes() {
|
2022-10-20 23:11:44 +08:00
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(true, vec![]);
|
2022-10-17 22:30:18 +08:00
|
|
|
|
|
|
|
let to_enqueue = [
|
|
|
|
index_creation_task("a", "id"),
|
|
|
|
index_creation_task("b", "id"),
|
|
|
|
index_creation_task("c", "id"),
|
|
|
|
index_creation_task("d", "id"),
|
|
|
|
];
|
|
|
|
|
|
|
|
for task in to_enqueue {
|
|
|
|
let _ = index_scheduler.register(task).unwrap();
|
2022-10-24 14:12:03 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-17 22:30:18 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
2022-10-24 14:12:03 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-17 22:30:18 +08:00
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
2022-10-24 14:12:03 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-17 22:30:18 +08:00
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
2022-10-24 14:12:03 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-17 22:30:18 +08:00
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
2022-10-24 14:12:03 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-17 22:30:18 +08:00
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "initial_tasks_processed");
|
|
|
|
|
|
|
|
index_scheduler
|
|
|
|
.register(KindWithContent::IndexSwap {
|
2022-10-26 18:57:29 +08:00
|
|
|
swaps: vec![
|
|
|
|
IndexSwap { indexes: ("a".to_owned(), "b".to_owned()) },
|
|
|
|
IndexSwap { indexes: ("c".to_owned(), "d".to_owned()) },
|
|
|
|
],
|
2022-10-17 22:30:18 +08:00
|
|
|
})
|
|
|
|
.unwrap();
|
2022-10-24 14:12:03 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-17 22:30:18 +08:00
|
|
|
index_scheduler
|
2022-10-26 18:57:29 +08:00
|
|
|
.register(KindWithContent::IndexSwap {
|
|
|
|
swaps: vec![IndexSwap { indexes: ("a".to_owned(), "c".to_owned()) }],
|
|
|
|
})
|
2022-10-17 22:30:18 +08:00
|
|
|
.unwrap();
|
2022-10-24 14:12:03 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-27 15:41:32 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "two_swaps_registered");
|
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "first_swap_processed");
|
2022-10-24 14:12:03 +08:00
|
|
|
|
2022-10-17 22:30:18 +08:00
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
2022-10-24 14:12:03 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-17 22:30:18 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "second_swap_processed");
|
2022-10-25 16:26:51 +08:00
|
|
|
|
|
|
|
index_scheduler.register(KindWithContent::IndexSwap { swaps: vec![] }).unwrap();
|
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "third_empty_swap_processed");
|
2022-10-17 22:30:18 +08:00
|
|
|
}
|
|
|
|
|
2022-10-27 15:41:32 +08:00
|
|
|
#[test]
|
|
|
|
fn swap_indexes_errors() {
|
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(true, vec![]);
|
|
|
|
|
|
|
|
let to_enqueue = [
|
|
|
|
index_creation_task("a", "id"),
|
|
|
|
index_creation_task("b", "id"),
|
|
|
|
index_creation_task("c", "id"),
|
|
|
|
index_creation_task("d", "id"),
|
|
|
|
];
|
|
|
|
|
|
|
|
for task in to_enqueue {
|
|
|
|
let _ = index_scheduler.register(task).unwrap();
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
}
|
|
|
|
handle.advance_n_batch(4);
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
|
|
|
let first_snap = snapshot_index_scheduler(&index_scheduler);
|
|
|
|
snapshot!(first_snap, name: "initial_tasks_processed");
|
|
|
|
|
|
|
|
let err = index_scheduler
|
|
|
|
.register(KindWithContent::IndexSwap {
|
|
|
|
swaps: vec![
|
|
|
|
IndexSwap { indexes: ("a".to_owned(), "b".to_owned()) },
|
|
|
|
IndexSwap { indexes: ("b".to_owned(), "a".to_owned()) },
|
|
|
|
],
|
|
|
|
})
|
|
|
|
.unwrap_err();
|
|
|
|
snapshot!(format!("{err}"), @"Indexes must be declared only once during a swap. `a`, `b` were specified several times.");
|
|
|
|
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
let second_snap = snapshot_index_scheduler(&index_scheduler);
|
|
|
|
assert_eq!(first_snap, second_snap);
|
|
|
|
|
|
|
|
// Index `e` does not exist, but we don't check its existence yet
|
|
|
|
index_scheduler
|
|
|
|
.register(KindWithContent::IndexSwap {
|
|
|
|
swaps: vec![
|
|
|
|
IndexSwap { indexes: ("a".to_owned(), "b".to_owned()) },
|
|
|
|
IndexSwap { indexes: ("c".to_owned(), "e".to_owned()) },
|
|
|
|
IndexSwap { indexes: ("d".to_owned(), "f".to_owned()) },
|
|
|
|
],
|
|
|
|
})
|
|
|
|
.unwrap();
|
|
|
|
handle.advance_n_batch(1);
|
|
|
|
// Now the first swap should have an error message saying `e` and `f` do not exist
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "first_swap_failed");
|
|
|
|
}
|
|
|
|
|
2022-10-20 19:18:25 +08:00
|
|
|
#[test]
|
|
|
|
fn document_addition_and_index_deletion_on_unexisting_index() {
|
2022-10-20 23:11:44 +08:00
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(true, vec![]);
|
2022-10-20 19:18:25 +08:00
|
|
|
|
|
|
|
let content = r#"
|
|
|
|
{
|
|
|
|
"id": 1,
|
|
|
|
"doggo": "bob"
|
|
|
|
}"#;
|
|
|
|
|
|
|
|
let (uuid, mut file) = index_scheduler.create_update_file_with_uuid(0).unwrap();
|
|
|
|
let documents_count =
|
|
|
|
meilisearch_types::document_formats::read_json(content.as_bytes(), file.as_file_mut())
|
|
|
|
.unwrap() as u64;
|
|
|
|
file.persist().unwrap();
|
|
|
|
index_scheduler
|
2022-10-22 00:03:10 +08:00
|
|
|
.register(KindWithContent::DocumentAdditionOrUpdate {
|
2022-10-20 19:18:25 +08:00
|
|
|
index_uid: S("doggos"),
|
|
|
|
primary_key: Some(S("id")),
|
|
|
|
method: ReplaceDocuments,
|
|
|
|
content_file: uuid,
|
|
|
|
documents_count,
|
|
|
|
allow_index_creation: true,
|
|
|
|
})
|
|
|
|
.unwrap();
|
|
|
|
index_scheduler
|
2022-10-21 00:00:07 +08:00
|
|
|
.register(KindWithContent::IndexDeletion { index_uid: S("doggos") })
|
2022-10-20 19:18:25 +08:00
|
|
|
.unwrap();
|
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::Start); // before anything happens.
|
|
|
|
handle.wait_till(Breakpoint::Start); // after the execution of the two tasks in a single batch.
|
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
}
|
|
|
|
|
2022-10-25 17:42:14 +08:00
|
|
|
#[test]
|
|
|
|
fn cancel_enqueued_task() {
|
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(true, vec![]);
|
|
|
|
|
|
|
|
let (file0, documents_count0) = sample_documents(&index_scheduler, 0, 0);
|
|
|
|
file0.persist().unwrap();
|
|
|
|
|
|
|
|
let to_enqueue = [
|
|
|
|
replace_document_import_task("catto", None, 0, documents_count0),
|
|
|
|
KindWithContent::TaskCancelation {
|
|
|
|
query: "test_query".to_owned(),
|
|
|
|
tasks: RoaringBitmap::from_iter([0]),
|
|
|
|
},
|
|
|
|
];
|
|
|
|
for task in to_enqueue {
|
|
|
|
let _ = index_scheduler.register(task).unwrap();
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
}
|
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "initial_tasks_enqueued");
|
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "cancel_processed");
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn cancel_succeeded_task() {
|
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(true, vec![]);
|
|
|
|
|
|
|
|
let (file0, documents_count0) = sample_documents(&index_scheduler, 0, 0);
|
|
|
|
file0.persist().unwrap();
|
|
|
|
|
|
|
|
let _ = index_scheduler
|
|
|
|
.register(replace_document_import_task("catto", None, 0, documents_count0))
|
|
|
|
.unwrap();
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "initial_task_processed");
|
|
|
|
|
|
|
|
index_scheduler
|
|
|
|
.register(KindWithContent::TaskCancelation {
|
|
|
|
query: "test_query".to_owned(),
|
|
|
|
tasks: RoaringBitmap::from_iter([0]),
|
|
|
|
})
|
|
|
|
.unwrap();
|
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "cancel_processed");
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn cancel_processing_task() {
|
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(true, vec![]);
|
|
|
|
|
|
|
|
let (file0, documents_count0) = sample_documents(&index_scheduler, 0, 0);
|
|
|
|
file0.persist().unwrap();
|
|
|
|
|
|
|
|
let _ = index_scheduler
|
|
|
|
.register(replace_document_import_task("catto", None, 0, documents_count0))
|
|
|
|
.unwrap();
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::InsideProcessBatch);
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "initial_task_processing");
|
|
|
|
|
|
|
|
index_scheduler
|
|
|
|
.register(KindWithContent::TaskCancelation {
|
|
|
|
query: "test_query".to_owned(),
|
|
|
|
tasks: RoaringBitmap::from_iter([0]),
|
|
|
|
})
|
|
|
|
.unwrap();
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
|
|
|
// Now we check that we can reach the AbortedIndexation error handling
|
|
|
|
handle.wait_till(Breakpoint::AbortedIndexation);
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
|
|
|
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "cancel_processed");
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn cancel_mix_of_tasks() {
|
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(true, vec![]);
|
|
|
|
|
|
|
|
let (file0, documents_count0) = sample_documents(&index_scheduler, 0, 0);
|
|
|
|
file0.persist().unwrap();
|
|
|
|
let (file1, documents_count1) = sample_documents(&index_scheduler, 1, 1);
|
|
|
|
file1.persist().unwrap();
|
|
|
|
let (file2, documents_count2) = sample_documents(&index_scheduler, 2, 2);
|
|
|
|
file2.persist().unwrap();
|
|
|
|
|
|
|
|
let to_enqueue = [
|
|
|
|
replace_document_import_task("catto", None, 0, documents_count0),
|
|
|
|
replace_document_import_task("beavero", None, 1, documents_count1),
|
|
|
|
replace_document_import_task("wolfo", None, 2, documents_count2),
|
|
|
|
];
|
|
|
|
for task in to_enqueue {
|
|
|
|
let _ = index_scheduler.register(task).unwrap();
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
}
|
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "first_task_processed");
|
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::InsideProcessBatch);
|
|
|
|
index_scheduler
|
|
|
|
.register(KindWithContent::TaskCancelation {
|
|
|
|
query: "test_query".to_owned(),
|
|
|
|
tasks: RoaringBitmap::from_iter([0, 1, 2]),
|
|
|
|
})
|
|
|
|
.unwrap();
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "processing_second_task_cancel_enqueued");
|
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::AbortedIndexation);
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "cancel_processed");
|
|
|
|
}
|
|
|
|
|
2022-10-24 23:29:17 +08:00
|
|
|
#[test]
|
|
|
|
fn test_document_replace() {
|
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(true, vec![]);
|
|
|
|
|
|
|
|
for i in 0..10 {
|
|
|
|
let content = format!(
|
|
|
|
r#"{{
|
|
|
|
"id": {},
|
|
|
|
"doggo": "bob {}"
|
|
|
|
}}"#,
|
|
|
|
i, i
|
|
|
|
);
|
|
|
|
|
|
|
|
let (uuid, mut file) = index_scheduler.create_update_file_with_uuid(i).unwrap();
|
|
|
|
let documents_count = meilisearch_types::document_formats::read_json(
|
|
|
|
content.as_bytes(),
|
|
|
|
file.as_file_mut(),
|
|
|
|
)
|
|
|
|
.unwrap() as u64;
|
|
|
|
file.persist().unwrap();
|
|
|
|
index_scheduler
|
|
|
|
.register(KindWithContent::DocumentAdditionOrUpdate {
|
|
|
|
index_uid: S("doggos"),
|
|
|
|
primary_key: Some(S("id")),
|
|
|
|
method: ReplaceDocuments,
|
|
|
|
content_file: uuid,
|
|
|
|
documents_count,
|
|
|
|
allow_index_creation: true,
|
|
|
|
})
|
|
|
|
.unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-24 23:29:17 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-24 23:29:17 +08:00
|
|
|
// everything should be batched together.
|
|
|
|
handle.advance_n_batch(1);
|
2022-10-25 21:30:36 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-24 23:29:17 +08:00
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
|
|
|
// has everything being pushed successfully in milli?
|
|
|
|
let index = index_scheduler.index("doggos").unwrap();
|
|
|
|
let rtxn = index.read_txn().unwrap();
|
|
|
|
let field_ids_map = index.fields_ids_map(&rtxn).unwrap();
|
|
|
|
let field_ids = field_ids_map.ids().collect::<Vec<_>>();
|
|
|
|
let documents = index
|
|
|
|
.all_documents(&rtxn)
|
|
|
|
.unwrap()
|
|
|
|
.map(|ret| obkv_to_json(&field_ids, &field_ids_map, ret.unwrap().1).unwrap())
|
|
|
|
.collect::<Vec<_>>();
|
|
|
|
snapshot!(serde_json::to_string_pretty(&documents).unwrap());
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_document_update() {
|
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(true, vec![]);
|
|
|
|
|
|
|
|
for i in 0..10 {
|
|
|
|
let content = format!(
|
|
|
|
r#"{{
|
|
|
|
"id": {},
|
|
|
|
"doggo": "bob {}"
|
|
|
|
}}"#,
|
|
|
|
i, i
|
|
|
|
);
|
|
|
|
|
|
|
|
let (uuid, mut file) = index_scheduler.create_update_file_with_uuid(i).unwrap();
|
|
|
|
let documents_count = meilisearch_types::document_formats::read_json(
|
|
|
|
content.as_bytes(),
|
|
|
|
file.as_file_mut(),
|
|
|
|
)
|
|
|
|
.unwrap() as u64;
|
|
|
|
file.persist().unwrap();
|
|
|
|
index_scheduler
|
|
|
|
.register(KindWithContent::DocumentAdditionOrUpdate {
|
|
|
|
index_uid: S("doggos"),
|
|
|
|
primary_key: Some(S("id")),
|
|
|
|
method: UpdateDocuments,
|
|
|
|
content_file: uuid,
|
|
|
|
documents_count,
|
|
|
|
allow_index_creation: true,
|
|
|
|
})
|
|
|
|
.unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-24 23:29:17 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-24 23:29:17 +08:00
|
|
|
// everything should be batched together.
|
|
|
|
handle.advance_n_batch(1);
|
2022-10-25 21:30:36 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-24 23:29:17 +08:00
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
|
|
|
// has everything being pushed successfully in milli?
|
|
|
|
let index = index_scheduler.index("doggos").unwrap();
|
|
|
|
let rtxn = index.read_txn().unwrap();
|
|
|
|
let field_ids_map = index.fields_ids_map(&rtxn).unwrap();
|
|
|
|
let field_ids = field_ids_map.ids().collect::<Vec<_>>();
|
|
|
|
let documents = index
|
|
|
|
.all_documents(&rtxn)
|
|
|
|
.unwrap()
|
|
|
|
.map(|ret| obkv_to_json(&field_ids, &field_ids_map, ret.unwrap().1).unwrap())
|
|
|
|
.collect::<Vec<_>>();
|
|
|
|
snapshot!(serde_json::to_string_pretty(&documents).unwrap());
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_mixed_document_addition() {
|
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(true, vec![]);
|
|
|
|
|
|
|
|
for i in 0..10 {
|
|
|
|
let method = if i % 2 == 0 { UpdateDocuments } else { ReplaceDocuments };
|
|
|
|
|
|
|
|
let content = format!(
|
|
|
|
r#"{{
|
|
|
|
"id": {},
|
|
|
|
"doggo": "bob {}"
|
|
|
|
}}"#,
|
|
|
|
i, i
|
|
|
|
);
|
|
|
|
|
|
|
|
let (uuid, mut file) = index_scheduler.create_update_file_with_uuid(i).unwrap();
|
|
|
|
let documents_count = meilisearch_types::document_formats::read_json(
|
|
|
|
content.as_bytes(),
|
|
|
|
file.as_file_mut(),
|
|
|
|
)
|
|
|
|
.unwrap() as u64;
|
|
|
|
file.persist().unwrap();
|
|
|
|
index_scheduler
|
|
|
|
.register(KindWithContent::DocumentAdditionOrUpdate {
|
|
|
|
index_uid: S("doggos"),
|
|
|
|
primary_key: Some(S("id")),
|
|
|
|
method,
|
|
|
|
content_file: uuid,
|
|
|
|
documents_count,
|
|
|
|
allow_index_creation: true,
|
|
|
|
})
|
|
|
|
.unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-24 23:29:17 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
|
|
|
// Only half of the task should've been processed since we can't autobatch replace and update together.
|
|
|
|
handle.advance_n_batch(5);
|
2022-10-25 21:30:36 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-24 23:29:17 +08:00
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
|
|
|
handle.advance_n_batch(5);
|
2022-10-25 21:30:36 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-24 23:29:17 +08:00
|
|
|
|
|
|
|
// has everything being pushed successfully in milli?
|
|
|
|
let index = index_scheduler.index("doggos").unwrap();
|
|
|
|
let rtxn = index.read_txn().unwrap();
|
|
|
|
let field_ids_map = index.fields_ids_map(&rtxn).unwrap();
|
|
|
|
let field_ids = field_ids_map.ids().collect::<Vec<_>>();
|
|
|
|
let documents = index
|
|
|
|
.all_documents(&rtxn)
|
|
|
|
.unwrap()
|
|
|
|
.map(|ret| obkv_to_json(&field_ids, &field_ids_map, ret.unwrap().1).unwrap())
|
|
|
|
.collect::<Vec<_>>();
|
|
|
|
snapshot!(serde_json::to_string_pretty(&documents).unwrap());
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_document_replace_without_autobatching() {
|
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(false, vec![]);
|
|
|
|
|
|
|
|
for i in 0..10 {
|
|
|
|
let content = format!(
|
|
|
|
r#"{{
|
|
|
|
"id": {},
|
|
|
|
"doggo": "bob {}"
|
|
|
|
}}"#,
|
|
|
|
i, i
|
|
|
|
);
|
|
|
|
|
|
|
|
let (uuid, mut file) = index_scheduler.create_update_file_with_uuid(i).unwrap();
|
|
|
|
let documents_count = meilisearch_types::document_formats::read_json(
|
|
|
|
content.as_bytes(),
|
|
|
|
file.as_file_mut(),
|
|
|
|
)
|
|
|
|
.unwrap() as u64;
|
|
|
|
file.persist().unwrap();
|
|
|
|
index_scheduler
|
|
|
|
.register(KindWithContent::DocumentAdditionOrUpdate {
|
|
|
|
index_uid: S("doggos"),
|
|
|
|
primary_key: Some(S("id")),
|
|
|
|
method: ReplaceDocuments,
|
|
|
|
content_file: uuid,
|
|
|
|
documents_count,
|
|
|
|
allow_index_creation: true,
|
|
|
|
})
|
|
|
|
.unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-24 23:29:17 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
|
|
|
// Nothing should be batched thus half of the tasks are processed.
|
|
|
|
handle.advance_n_batch(5);
|
2022-10-25 21:30:36 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-24 23:29:17 +08:00
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
|
|
|
// Everything is processed.
|
|
|
|
handle.advance_n_batch(5);
|
2022-10-25 21:30:36 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-24 23:29:17 +08:00
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
|
|
|
// has everything being pushed successfully in milli?
|
|
|
|
let index = index_scheduler.index("doggos").unwrap();
|
|
|
|
let rtxn = index.read_txn().unwrap();
|
|
|
|
let field_ids_map = index.fields_ids_map(&rtxn).unwrap();
|
|
|
|
let field_ids = field_ids_map.ids().collect::<Vec<_>>();
|
|
|
|
let documents = index
|
|
|
|
.all_documents(&rtxn)
|
|
|
|
.unwrap()
|
|
|
|
.map(|ret| obkv_to_json(&field_ids, &field_ids_map, ret.unwrap().1).unwrap())
|
|
|
|
.collect::<Vec<_>>();
|
|
|
|
snapshot!(serde_json::to_string_pretty(&documents).unwrap());
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_document_update_without_autobatching() {
|
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(false, vec![]);
|
|
|
|
|
|
|
|
for i in 0..10 {
|
|
|
|
let content = format!(
|
|
|
|
r#"{{
|
|
|
|
"id": {},
|
|
|
|
"doggo": "bob {}"
|
|
|
|
}}"#,
|
|
|
|
i, i
|
|
|
|
);
|
|
|
|
|
|
|
|
let (uuid, mut file) = index_scheduler.create_update_file_with_uuid(i).unwrap();
|
|
|
|
let documents_count = meilisearch_types::document_formats::read_json(
|
|
|
|
content.as_bytes(),
|
|
|
|
file.as_file_mut(),
|
|
|
|
)
|
|
|
|
.unwrap() as u64;
|
|
|
|
file.persist().unwrap();
|
|
|
|
index_scheduler
|
|
|
|
.register(KindWithContent::DocumentAdditionOrUpdate {
|
|
|
|
index_uid: S("doggos"),
|
|
|
|
primary_key: Some(S("id")),
|
|
|
|
method: UpdateDocuments,
|
|
|
|
content_file: uuid,
|
|
|
|
documents_count,
|
|
|
|
allow_index_creation: true,
|
|
|
|
})
|
|
|
|
.unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-24 23:29:17 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
|
|
|
// Nothing should be batched thus half of the tasks are processed.
|
|
|
|
handle.advance_n_batch(5);
|
2022-10-25 21:30:36 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-24 23:29:17 +08:00
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
|
|
|
// Everything is processed.
|
|
|
|
handle.advance_n_batch(5);
|
2022-10-25 21:30:36 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-24 23:29:17 +08:00
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
|
|
|
// has everything being pushed successfully in milli?
|
|
|
|
let index = index_scheduler.index("doggos").unwrap();
|
|
|
|
let rtxn = index.read_txn().unwrap();
|
|
|
|
let field_ids_map = index.fields_ids_map(&rtxn).unwrap();
|
|
|
|
let field_ids = field_ids_map.ids().collect::<Vec<_>>();
|
|
|
|
let documents = index
|
|
|
|
.all_documents(&rtxn)
|
|
|
|
.unwrap()
|
|
|
|
.map(|ret| obkv_to_json(&field_ids, &field_ids_map, ret.unwrap().1).unwrap())
|
2022-10-25 18:30:56 +08:00
|
|
|
.collect::<Vec<_>>();
|
|
|
|
snapshot!(serde_json::to_string_pretty(&documents).unwrap());
|
|
|
|
}
|
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
#[macro_export]
|
|
|
|
macro_rules! debug_snapshot {
|
|
|
|
($value:expr, @$snapshot:literal) => {{
|
|
|
|
let value = format!("{:?}", $value);
|
|
|
|
meili_snap::snapshot!(value, @$snapshot);
|
|
|
|
}};
|
|
|
|
}
|
2022-10-25 18:30:56 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
#[test]
|
|
|
|
fn simple_new() {
|
|
|
|
crate::IndexScheduler::test(true, vec![]);
|
2022-10-25 18:30:56 +08:00
|
|
|
}
|
|
|
|
|
2022-10-26 18:56:01 +08:00
|
|
|
#[test]
|
|
|
|
fn query_tasks_from_and_limit() {
|
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(true, vec![]);
|
|
|
|
|
|
|
|
let kind = index_creation_task("doggo", "bone");
|
|
|
|
let _task = index_scheduler.register(kind).unwrap();
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
let kind = index_creation_task("whalo", "plankton");
|
|
|
|
let _task = index_scheduler.register(kind).unwrap();
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
let kind = index_creation_task("catto", "his_own_vomit");
|
|
|
|
let _task = index_scheduler.register(kind).unwrap();
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "start");
|
|
|
|
|
|
|
|
handle.advance_n_batch(3);
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "finished");
|
|
|
|
|
2022-10-27 17:17:50 +08:00
|
|
|
let rtxn = index_scheduler.env.read_txn().unwrap();
|
2022-10-26 18:56:01 +08:00
|
|
|
let query = Query { limit: Some(0), ..Default::default() };
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
2022-10-26 18:56:01 +08:00
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[]");
|
|
|
|
|
|
|
|
let query = Query { limit: Some(1), ..Default::default() };
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
2022-10-26 18:56:01 +08:00
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[2,]");
|
|
|
|
|
|
|
|
let query = Query { limit: Some(2), ..Default::default() };
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
2022-10-26 18:56:01 +08:00
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[1,2,]");
|
|
|
|
|
|
|
|
let query = Query { from: Some(1), ..Default::default() };
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
2022-10-26 18:56:01 +08:00
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[0,1,]");
|
|
|
|
|
|
|
|
let query = Query { from: Some(2), ..Default::default() };
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
2022-10-26 18:56:01 +08:00
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[0,1,2,]");
|
|
|
|
|
|
|
|
let query = Query { from: Some(1), limit: Some(1), ..Default::default() };
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
2022-10-26 18:56:01 +08:00
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[1,]");
|
|
|
|
|
|
|
|
let query = Query { from: Some(1), limit: Some(2), ..Default::default() };
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
2022-10-26 18:56:01 +08:00
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[0,1,]");
|
|
|
|
}
|
|
|
|
|
2022-10-25 18:30:56 +08:00
|
|
|
#[test]
|
2022-10-27 17:17:50 +08:00
|
|
|
fn query_tasks_simple() {
|
2022-10-25 21:30:36 +08:00
|
|
|
let start_time = OffsetDateTime::now_utc();
|
2022-10-25 18:30:56 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
let (index_scheduler, handle) =
|
|
|
|
IndexScheduler::test(true, vec![(3, FailureLocation::InsideProcessBatch)]);
|
2022-10-25 18:30:56 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
let kind = index_creation_task("catto", "mouse");
|
|
|
|
let _task = index_scheduler.register(kind).unwrap();
|
|
|
|
let kind = index_creation_task("doggo", "sheep");
|
|
|
|
let _task = index_scheduler.register(kind).unwrap();
|
|
|
|
let kind = index_creation_task("whalo", "fish");
|
|
|
|
let _task = index_scheduler.register(kind).unwrap();
|
2022-10-25 18:30:56 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "start");
|
2022-10-25 18:30:56 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
handle.wait_till(Breakpoint::BatchCreated);
|
2022-10-25 18:30:56 +08:00
|
|
|
|
2022-10-27 17:17:50 +08:00
|
|
|
let rtxn = index_scheduler.env.read_txn().unwrap();
|
|
|
|
|
2022-11-07 19:24:39 +08:00
|
|
|
let query = Query { statuses: Some(vec![Status::Processing]), ..Default::default() };
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[0,]"); // only the processing tasks in the first tick
|
2022-10-25 18:30:56 +08:00
|
|
|
|
2022-11-07 19:24:39 +08:00
|
|
|
let query = Query { statuses: Some(vec![Status::Enqueued]), ..Default::default() };
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[1,2,]"); // only the enqueued tasks in the first tick
|
2022-10-25 18:30:56 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
let query = Query {
|
2022-11-07 19:24:39 +08:00
|
|
|
statuses: Some(vec![Status::Enqueued, Status::Processing]),
|
2022-10-25 21:30:36 +08:00
|
|
|
..Default::default()
|
|
|
|
};
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[0,1,2,]"); // both enqueued and processing tasks in the first tick
|
2022-10-25 18:30:56 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
let query = Query {
|
2022-11-07 19:24:39 +08:00
|
|
|
statuses: Some(vec![Status::Enqueued, Status::Processing]),
|
2022-10-25 21:30:36 +08:00
|
|
|
after_started_at: Some(start_time),
|
|
|
|
..Default::default()
|
|
|
|
};
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
// both enqueued and processing tasks in the first tick, but limited to those with a started_at
|
|
|
|
// that comes after the start of the test, which should excludes the enqueued tasks
|
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[0,]");
|
2022-10-25 18:30:56 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
let query = Query {
|
2022-11-07 19:24:39 +08:00
|
|
|
statuses: Some(vec![Status::Enqueued, Status::Processing]),
|
2022-10-25 21:30:36 +08:00
|
|
|
before_started_at: Some(start_time),
|
|
|
|
..Default::default()
|
|
|
|
};
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
// both enqueued and processing tasks in the first tick, but limited to those with a started_at
|
|
|
|
// that comes before the start of the test, which should excludes all of them
|
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[]");
|
2022-10-25 18:30:56 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
let query = Query {
|
2022-11-07 19:24:39 +08:00
|
|
|
statuses: Some(vec![Status::Enqueued, Status::Processing]),
|
2022-10-25 21:30:36 +08:00
|
|
|
after_started_at: Some(start_time),
|
|
|
|
before_started_at: Some(start_time + Duration::minutes(1)),
|
|
|
|
..Default::default()
|
|
|
|
};
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
// both enqueued and processing tasks in the first tick, but limited to those with a started_at
|
|
|
|
// that comes after the start of the test and before one minute after the start of the test,
|
|
|
|
// which should exclude the enqueued tasks and include the only processing task
|
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[0,]");
|
2022-10-25 18:30:56 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
handle.wait_till(Breakpoint::BatchCreated);
|
2022-10-25 18:30:56 +08:00
|
|
|
|
2022-10-27 17:17:50 +08:00
|
|
|
let rtxn = index_scheduler.env.read_txn().unwrap();
|
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
let second_start_time = OffsetDateTime::now_utc();
|
2022-10-25 18:30:56 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
let query = Query {
|
2022-11-07 19:24:39 +08:00
|
|
|
statuses: Some(vec![Status::Succeeded, Status::Processing]),
|
2022-10-25 21:30:36 +08:00
|
|
|
after_started_at: Some(start_time),
|
|
|
|
before_started_at: Some(start_time + Duration::minutes(1)),
|
|
|
|
..Default::default()
|
|
|
|
};
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
// both succeeded and processing tasks in the first tick, but limited to those with a started_at
|
|
|
|
// that comes after the start of the test and before one minute after the start of the test,
|
|
|
|
// which should include all tasks
|
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[0,1,]");
|
2022-10-25 18:30:56 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
let query = Query {
|
2022-11-07 19:24:39 +08:00
|
|
|
statuses: Some(vec![Status::Succeeded, Status::Processing]),
|
2022-10-25 21:30:36 +08:00
|
|
|
before_started_at: Some(start_time),
|
|
|
|
..Default::default()
|
|
|
|
};
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
// both succeeded and processing tasks in the first tick, but limited to those with a started_at
|
|
|
|
// that comes before the start of the test, which should exclude all tasks
|
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[]");
|
2022-10-25 18:30:56 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
let query = Query {
|
2022-11-07 19:24:39 +08:00
|
|
|
statuses: Some(vec![Status::Enqueued, Status::Succeeded, Status::Processing]),
|
2022-10-25 21:30:36 +08:00
|
|
|
after_started_at: Some(second_start_time),
|
|
|
|
before_started_at: Some(second_start_time + Duration::minutes(1)),
|
|
|
|
..Default::default()
|
|
|
|
};
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
// both succeeded and processing tasks in the first tick, but limited to those with a started_at
|
|
|
|
// that comes after the start of the second part of the test and before one minute after the
|
|
|
|
// second start of the test, which should exclude all tasks
|
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[]");
|
2022-10-25 18:30:56 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
// now we make one more batch, the started_at field of the new tasks will be past `second_start_time`
|
|
|
|
handle.wait_till(Breakpoint::BatchCreated);
|
2022-10-27 17:17:50 +08:00
|
|
|
|
|
|
|
let rtxn = index_scheduler.env.read_txn().unwrap();
|
|
|
|
|
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
// we run the same query to verify that, and indeed find that the last task is matched
|
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[2,]");
|
|
|
|
|
|
|
|
let query = Query {
|
2022-11-07 19:24:39 +08:00
|
|
|
statuses: Some(vec![Status::Enqueued, Status::Succeeded, Status::Processing]),
|
2022-10-25 21:30:36 +08:00
|
|
|
after_started_at: Some(second_start_time),
|
|
|
|
before_started_at: Some(second_start_time + Duration::minutes(1)),
|
|
|
|
..Default::default()
|
|
|
|
};
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
// enqueued, succeeded, or processing tasks started after the second part of the test, should
|
|
|
|
// again only return the last task
|
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[2,]");
|
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
2022-10-27 17:17:50 +08:00
|
|
|
let rtxn = index_scheduler.read_txn().unwrap();
|
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
// now the last task should have failed
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "end");
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
// so running the last query should return nothing
|
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[]");
|
|
|
|
|
|
|
|
let query = Query {
|
2022-11-07 19:24:39 +08:00
|
|
|
statuses: Some(vec![Status::Failed]),
|
2022-10-25 21:30:36 +08:00
|
|
|
after_started_at: Some(second_start_time),
|
|
|
|
before_started_at: Some(second_start_time + Duration::minutes(1)),
|
|
|
|
..Default::default()
|
|
|
|
};
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
// but the same query on failed tasks should return the last task
|
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[2,]");
|
|
|
|
|
|
|
|
let query = Query {
|
2022-11-07 19:24:39 +08:00
|
|
|
statuses: Some(vec![Status::Failed]),
|
2022-10-25 21:30:36 +08:00
|
|
|
after_started_at: Some(second_start_time),
|
|
|
|
before_started_at: Some(second_start_time + Duration::minutes(1)),
|
|
|
|
..Default::default()
|
|
|
|
};
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
// but the same query on failed tasks should return the last task
|
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[2,]");
|
|
|
|
|
|
|
|
let query = Query {
|
2022-11-07 19:24:39 +08:00
|
|
|
statuses: Some(vec![Status::Failed]),
|
|
|
|
uids: Some(vec![1]),
|
2022-10-25 21:30:36 +08:00
|
|
|
after_started_at: Some(second_start_time),
|
|
|
|
before_started_at: Some(second_start_time + Duration::minutes(1)),
|
|
|
|
..Default::default()
|
|
|
|
};
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
// same query but with an invalid uid
|
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[]");
|
|
|
|
|
|
|
|
let query = Query {
|
2022-11-07 19:24:39 +08:00
|
|
|
statuses: Some(vec![Status::Failed]),
|
|
|
|
uids: Some(vec![2]),
|
2022-10-25 21:30:36 +08:00
|
|
|
after_started_at: Some(second_start_time),
|
|
|
|
before_started_at: Some(second_start_time + Duration::minutes(1)),
|
|
|
|
..Default::default()
|
|
|
|
};
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
// same query but with a valid uid
|
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[2,]");
|
|
|
|
}
|
2022-10-25 18:30:56 +08:00
|
|
|
|
2022-10-27 17:17:50 +08:00
|
|
|
#[test]
|
|
|
|
fn query_tasks_special_rules() {
|
|
|
|
let (index_scheduler, handle) =
|
|
|
|
IndexScheduler::test(true, vec![(3, FailureLocation::InsideProcessBatch)]);
|
|
|
|
|
|
|
|
let kind = index_creation_task("catto", "mouse");
|
|
|
|
let _task = index_scheduler.register(kind).unwrap();
|
|
|
|
let kind = index_creation_task("doggo", "sheep");
|
|
|
|
let _task = index_scheduler.register(kind).unwrap();
|
|
|
|
let kind = KindWithContent::IndexSwap {
|
|
|
|
swaps: vec![IndexSwap { indexes: ("catto".to_owned(), "doggo".to_owned()) }],
|
|
|
|
};
|
|
|
|
let _task = index_scheduler.register(kind).unwrap();
|
|
|
|
let kind = KindWithContent::IndexSwap {
|
|
|
|
swaps: vec![IndexSwap { indexes: ("catto".to_owned(), "whalo".to_owned()) }],
|
|
|
|
};
|
|
|
|
let _task = index_scheduler.register(kind).unwrap();
|
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "start");
|
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::BatchCreated);
|
|
|
|
|
|
|
|
let rtxn = index_scheduler.env.read_txn().unwrap();
|
|
|
|
|
2022-11-07 19:24:39 +08:00
|
|
|
let query = Query { index_uids: Some(vec!["catto".to_owned()]), ..Default::default() };
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
|
|
|
// only the first task associated with catto is returned, the indexSwap tasks are excluded!
|
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[0,]");
|
|
|
|
|
2022-11-07 19:24:39 +08:00
|
|
|
let query = Query { index_uids: Some(vec!["catto".to_owned()]), ..Default::default() };
|
2022-10-27 17:17:50 +08:00
|
|
|
let tasks = index_scheduler
|
|
|
|
.get_task_ids_from_authorized_indexes(&rtxn, &query, &Some(vec!["doggo".to_owned()]))
|
|
|
|
.unwrap();
|
|
|
|
// we have asked for only the tasks associated with catto, but are only authorized to retrieve the tasks
|
|
|
|
// associated with doggo -> empty result
|
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[]");
|
|
|
|
|
|
|
|
let query = Query::default();
|
|
|
|
let tasks = index_scheduler
|
|
|
|
.get_task_ids_from_authorized_indexes(&rtxn, &query, &Some(vec!["doggo".to_owned()]))
|
|
|
|
.unwrap();
|
|
|
|
// we asked for all the tasks, but we are only authorized to retrieve the doggo tasks
|
|
|
|
// -> only the index creation of doggo should be returned
|
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[1,]");
|
|
|
|
|
|
|
|
let query = Query::default();
|
|
|
|
let tasks = index_scheduler
|
|
|
|
.get_task_ids_from_authorized_indexes(
|
|
|
|
&rtxn,
|
|
|
|
&query,
|
|
|
|
&Some(vec!["catto".to_owned(), "doggo".to_owned()]),
|
|
|
|
)
|
|
|
|
.unwrap();
|
|
|
|
// we asked for all the tasks, but we are only authorized to retrieve the doggo and catto tasks
|
|
|
|
// -> all tasks except the swap of catto with whalo are returned
|
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[0,1,2,]");
|
|
|
|
|
|
|
|
let query = Query::default();
|
|
|
|
let tasks =
|
|
|
|
index_scheduler.get_task_ids_from_authorized_indexes(&rtxn, &query, &None).unwrap();
|
|
|
|
// we asked for all the tasks with all index authorized -> all tasks returned
|
|
|
|
snapshot!(snapshot_bitmap(&tasks), @"[0,1,2,3,]");
|
|
|
|
}
|
|
|
|
|
2022-10-25 18:30:56 +08:00
|
|
|
#[test]
|
2022-10-25 21:30:36 +08:00
|
|
|
fn fail_in_create_batch_for_index_creation() {
|
|
|
|
let (index_scheduler, handle) =
|
|
|
|
IndexScheduler::test(true, vec![(1, FailureLocation::InsideCreateBatch)]);
|
2022-10-25 18:30:56 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
let kinds = [index_creation_task("catto", "mouse")];
|
|
|
|
|
|
|
|
for kind in kinds {
|
|
|
|
let _task = index_scheduler.register(kind).unwrap();
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
}
|
|
|
|
handle.wait_till(Breakpoint::BatchCreated);
|
|
|
|
|
|
|
|
// We skipped an iteration of `tick` to reach BatchCreated
|
|
|
|
assert_eq!(*index_scheduler.run_loop_iteration.read().unwrap(), 2);
|
|
|
|
// Otherwise nothing weird happened
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn fail_in_process_batch_for_index_creation() {
|
|
|
|
let (index_scheduler, handle) =
|
|
|
|
IndexScheduler::test(true, vec![(1, FailureLocation::InsideProcessBatch)]);
|
|
|
|
|
|
|
|
let kind = index_creation_task("catto", "mouse");
|
|
|
|
|
|
|
|
let _task = index_scheduler.register(kind).unwrap();
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
|
|
|
|
|
|
|
// Still in the first iteration
|
|
|
|
assert_eq!(*index_scheduler.run_loop_iteration.read().unwrap(), 1);
|
|
|
|
// No matter what happens in process_batch, the index_scheduler should be internally consistent
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "index_creation_failed");
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn fail_in_process_batch_for_document_addition() {
|
|
|
|
let (index_scheduler, handle) =
|
|
|
|
IndexScheduler::test(true, vec![(1, FailureLocation::InsideProcessBatch)]);
|
|
|
|
|
|
|
|
let content = r#"
|
|
|
|
{
|
|
|
|
"id": 1,
|
|
|
|
"doggo": "bob"
|
|
|
|
}"#;
|
|
|
|
|
|
|
|
let (uuid, mut file) = index_scheduler.create_update_file_with_uuid(0).unwrap();
|
|
|
|
let documents_count =
|
|
|
|
meilisearch_types::document_formats::read_json(content.as_bytes(), file.as_file_mut())
|
|
|
|
.unwrap() as u64;
|
|
|
|
file.persist().unwrap();
|
2022-10-25 18:30:56 +08:00
|
|
|
index_scheduler
|
2022-10-25 21:30:36 +08:00
|
|
|
.register(KindWithContent::DocumentAdditionOrUpdate {
|
|
|
|
index_uid: S("doggos"),
|
|
|
|
primary_key: Some(S("id")),
|
|
|
|
method: ReplaceDocuments,
|
|
|
|
content_file: uuid,
|
|
|
|
documents_count,
|
|
|
|
allow_index_creation: true,
|
|
|
|
})
|
2022-10-25 18:30:56 +08:00
|
|
|
.unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
handle.wait_till(Breakpoint::BatchCreated);
|
|
|
|
|
|
|
|
snapshot!(
|
|
|
|
snapshot_index_scheduler(&index_scheduler),
|
|
|
|
name: "document_addition_batch_created"
|
|
|
|
);
|
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "document_addition_failed");
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn fail_in_update_task_after_process_batch_success_for_document_addition() {
|
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(
|
|
|
|
true,
|
|
|
|
vec![(1, FailureLocation::UpdatingTaskAfterProcessBatchSuccess { task_uid: 0 })],
|
|
|
|
);
|
|
|
|
|
|
|
|
let content = r#"
|
|
|
|
{
|
|
|
|
"id": 1,
|
|
|
|
"doggo": "bob"
|
|
|
|
}"#;
|
|
|
|
|
|
|
|
let (uuid, mut file) = index_scheduler.create_update_file_with_uuid(0).unwrap();
|
|
|
|
let documents_count =
|
|
|
|
meilisearch_types::document_formats::read_json(content.as_bytes(), file.as_file_mut())
|
|
|
|
.unwrap() as u64;
|
|
|
|
file.persist().unwrap();
|
|
|
|
index_scheduler
|
|
|
|
.register(KindWithContent::DocumentAdditionOrUpdate {
|
|
|
|
index_uid: S("doggos"),
|
|
|
|
primary_key: Some(S("id")),
|
|
|
|
method: ReplaceDocuments,
|
|
|
|
content_file: uuid,
|
|
|
|
documents_count,
|
|
|
|
allow_index_creation: true,
|
|
|
|
})
|
|
|
|
.unwrap();
|
|
|
|
|
|
|
|
// This tests that the index scheduler pauses for one second when an irrecoverable failure occurs
|
|
|
|
let start_time = Instant::now();
|
|
|
|
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
handle.wait_till(Breakpoint::Start);
|
|
|
|
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "document_addition_succeeded_but_index_scheduler_not_updated");
|
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "second_iteration");
|
|
|
|
|
|
|
|
let test_duration = start_time.elapsed();
|
|
|
|
assert!(test_duration.as_millis() > 1000);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_document_addition_cant_create_index_without_index() {
|
|
|
|
// We're going to autobatch multiple document addition that don't have
|
|
|
|
// the right to create an index while there is no index currently.
|
|
|
|
// Thus, everything should be batched together and a IndexDoesNotExists
|
|
|
|
// error should be throwed.
|
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(true, vec![]);
|
2022-10-25 18:30:56 +08:00
|
|
|
|
|
|
|
for i in 0..10 {
|
|
|
|
let content = format!(
|
|
|
|
r#"{{
|
|
|
|
"id": {},
|
|
|
|
"doggo": "bob {}"
|
|
|
|
}}"#,
|
|
|
|
i, i
|
|
|
|
);
|
|
|
|
|
|
|
|
let (uuid, mut file) = index_scheduler.create_update_file_with_uuid(i).unwrap();
|
|
|
|
let documents_count = meilisearch_types::document_formats::read_json(
|
|
|
|
content.as_bytes(),
|
|
|
|
file.as_file_mut(),
|
|
|
|
)
|
|
|
|
.unwrap() as u64;
|
|
|
|
file.persist().unwrap();
|
|
|
|
index_scheduler
|
|
|
|
.register(KindWithContent::DocumentAdditionOrUpdate {
|
|
|
|
index_uid: S("doggos"),
|
|
|
|
primary_key: Some(S("id")),
|
|
|
|
method: ReplaceDocuments,
|
|
|
|
content_file: uuid,
|
|
|
|
documents_count,
|
|
|
|
allow_index_creation: false,
|
|
|
|
})
|
|
|
|
.unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-25 18:30:56 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
// Everything should be batched together.
|
|
|
|
handle.advance_n_batch(1);
|
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-25 18:30:56 +08:00
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
// The index should not exists.
|
|
|
|
snapshot!(format!("{}", index_scheduler.index("doggos").map(|_| ()).unwrap_err()), @"Index `doggos` not found.");
|
2022-10-25 18:30:56 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
2022-10-25 21:30:36 +08:00
|
|
|
fn test_document_addition_cant_create_index_without_index_without_autobatching() {
|
|
|
|
// We're going to execute multiple document addition that don't have
|
|
|
|
// the right to create an index while there is no index currently.
|
|
|
|
// Since the autobatching is disabled, every tasks should be processed
|
|
|
|
// sequentially and throw an IndexDoesNotExists.
|
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(false, vec![]);
|
2022-10-25 18:30:56 +08:00
|
|
|
|
|
|
|
for i in 0..10 {
|
|
|
|
let content = format!(
|
|
|
|
r#"{{
|
|
|
|
"id": {},
|
|
|
|
"doggo": "bob {}"
|
|
|
|
}}"#,
|
|
|
|
i, i
|
|
|
|
);
|
|
|
|
|
|
|
|
let (uuid, mut file) = index_scheduler.create_update_file_with_uuid(i).unwrap();
|
|
|
|
let documents_count = meilisearch_types::document_formats::read_json(
|
|
|
|
content.as_bytes(),
|
|
|
|
file.as_file_mut(),
|
|
|
|
)
|
|
|
|
.unwrap() as u64;
|
|
|
|
file.persist().unwrap();
|
|
|
|
index_scheduler
|
|
|
|
.register(KindWithContent::DocumentAdditionOrUpdate {
|
|
|
|
index_uid: S("doggos"),
|
|
|
|
primary_key: Some(S("id")),
|
|
|
|
method: ReplaceDocuments,
|
|
|
|
content_file: uuid,
|
|
|
|
documents_count,
|
2022-10-25 21:30:36 +08:00
|
|
|
allow_index_creation: false,
|
2022-10-25 18:30:56 +08:00
|
|
|
})
|
|
|
|
.unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-25 18:30:56 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
// Nothing should be batched thus half of the tasks are processed.
|
|
|
|
handle.advance_n_batch(5);
|
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-25 18:30:56 +08:00
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
// Everything is processed.
|
|
|
|
handle.advance_n_batch(5);
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
|
|
|
// The index should not exists.
|
|
|
|
snapshot!(format!("{}", index_scheduler.index("doggos").map(|_| ()).unwrap_err()), @"Index `doggos` not found.");
|
2022-10-25 18:30:56 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
2022-10-25 21:30:36 +08:00
|
|
|
fn test_document_addition_cant_create_index_with_index() {
|
|
|
|
// We're going to autobatch multiple document addition that don't have
|
|
|
|
// the right to create an index while there is already an index.
|
|
|
|
// Thus, everything should be batched together and no error should be
|
|
|
|
// throwed.
|
2022-10-25 18:30:56 +08:00
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(true, vec![]);
|
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
// Create the index.
|
|
|
|
index_scheduler
|
|
|
|
.register(KindWithContent::IndexCreation { index_uid: S("doggos"), primary_key: None })
|
|
|
|
.unwrap();
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
handle.advance_n_batch(1);
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-25 18:30:56 +08:00
|
|
|
for i in 0..10 {
|
|
|
|
let content = format!(
|
|
|
|
r#"{{
|
|
|
|
"id": {},
|
|
|
|
"doggo": "bob {}"
|
|
|
|
}}"#,
|
|
|
|
i, i
|
|
|
|
);
|
|
|
|
|
|
|
|
let (uuid, mut file) = index_scheduler.create_update_file_with_uuid(i).unwrap();
|
|
|
|
let documents_count = meilisearch_types::document_formats::read_json(
|
|
|
|
content.as_bytes(),
|
|
|
|
file.as_file_mut(),
|
|
|
|
)
|
|
|
|
.unwrap() as u64;
|
|
|
|
file.persist().unwrap();
|
|
|
|
index_scheduler
|
|
|
|
.register(KindWithContent::DocumentAdditionOrUpdate {
|
|
|
|
index_uid: S("doggos"),
|
|
|
|
primary_key: Some(S("id")),
|
|
|
|
method: ReplaceDocuments,
|
|
|
|
content_file: uuid,
|
|
|
|
documents_count,
|
2022-10-25 21:30:36 +08:00
|
|
|
allow_index_creation: false,
|
2022-10-25 18:30:56 +08:00
|
|
|
})
|
|
|
|
.unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-25 18:30:56 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
// Everything should be batched together.
|
2022-10-25 18:30:56 +08:00
|
|
|
handle.advance_n_batch(1);
|
2022-10-25 21:30:36 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-25 18:30:56 +08:00
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
|
|
|
// Has everything being pushed successfully in milli?
|
|
|
|
let index = index_scheduler.index("doggos").unwrap();
|
|
|
|
let rtxn = index.read_txn().unwrap();
|
|
|
|
let field_ids_map = index.fields_ids_map(&rtxn).unwrap();
|
|
|
|
let field_ids = field_ids_map.ids().collect::<Vec<_>>();
|
|
|
|
let documents = index
|
|
|
|
.all_documents(&rtxn)
|
|
|
|
.unwrap()
|
|
|
|
.map(|ret| obkv_to_json(&field_ids, &field_ids_map, ret.unwrap().1).unwrap())
|
2022-10-24 23:29:17 +08:00
|
|
|
.collect::<Vec<_>>();
|
|
|
|
snapshot!(serde_json::to_string_pretty(&documents).unwrap());
|
|
|
|
}
|
|
|
|
|
2022-09-21 18:01:46 +08:00
|
|
|
#[test]
|
2022-10-25 21:30:36 +08:00
|
|
|
fn test_document_addition_cant_create_index_with_index_without_autobatching() {
|
|
|
|
// We're going to execute multiple document addition that don't have
|
|
|
|
// the right to create an index while there is no index currently.
|
|
|
|
// Since the autobatching is disabled, every tasks should be processed
|
|
|
|
// sequentially and throw an IndexDoesNotExists.
|
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(false, vec![]);
|
2022-10-20 23:11:44 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
// Create the index.
|
|
|
|
index_scheduler
|
|
|
|
.register(KindWithContent::IndexCreation { index_uid: S("doggos"), primary_key: None })
|
|
|
|
.unwrap();
|
|
|
|
handle.advance_n_batch(1);
|
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-20 23:11:44 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
for i in 0..10 {
|
|
|
|
let content = format!(
|
|
|
|
r#"{{
|
|
|
|
"id": {},
|
|
|
|
"doggo": "bob {}"
|
|
|
|
}}"#,
|
|
|
|
i, i
|
|
|
|
);
|
2022-10-20 23:11:44 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
let (uuid, mut file) = index_scheduler.create_update_file_with_uuid(i).unwrap();
|
|
|
|
let documents_count = meilisearch_types::document_formats::read_json(
|
|
|
|
content.as_bytes(),
|
|
|
|
file.as_file_mut(),
|
|
|
|
)
|
|
|
|
.unwrap() as u64;
|
|
|
|
file.persist().unwrap();
|
|
|
|
index_scheduler
|
|
|
|
.register(KindWithContent::DocumentAdditionOrUpdate {
|
|
|
|
index_uid: S("doggos"),
|
|
|
|
primary_key: Some(S("id")),
|
|
|
|
method: ReplaceDocuments,
|
|
|
|
content_file: uuid,
|
|
|
|
documents_count,
|
|
|
|
allow_index_creation: false,
|
|
|
|
})
|
|
|
|
.unwrap();
|
2022-10-20 23:11:44 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
}
|
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
// Nothing should be batched thus half of the tasks are processed.
|
|
|
|
handle.advance_n_batch(5);
|
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-20 23:11:44 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
2022-10-20 23:11:44 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
// Everything is processed.
|
|
|
|
handle.advance_n_batch(5);
|
2022-10-20 23:11:44 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
2022-10-20 23:11:44 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
// Has everything being pushed successfully in milli?
|
|
|
|
let index = index_scheduler.index("doggos").unwrap();
|
|
|
|
let rtxn = index.read_txn().unwrap();
|
|
|
|
let field_ids_map = index.fields_ids_map(&rtxn).unwrap();
|
|
|
|
let field_ids = field_ids_map.ids().collect::<Vec<_>>();
|
|
|
|
let documents = index
|
|
|
|
.all_documents(&rtxn)
|
|
|
|
.unwrap()
|
|
|
|
.map(|ret| obkv_to_json(&field_ids, &field_ids_map, ret.unwrap().1).unwrap())
|
|
|
|
.collect::<Vec<_>>();
|
|
|
|
snapshot!(serde_json::to_string_pretty(&documents).unwrap());
|
2022-10-20 23:11:44 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
2022-10-25 21:30:36 +08:00
|
|
|
fn test_document_addition_mixed_rights_with_index() {
|
|
|
|
// We're going to autobatch multiple document addition.
|
|
|
|
// - The index already exists
|
|
|
|
// - The first document addition don't have the right to create an index
|
|
|
|
// can it batch with the other one?
|
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(true, vec![]);
|
2022-10-20 23:11:44 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
// Create the index.
|
2022-10-20 23:11:44 +08:00
|
|
|
index_scheduler
|
2022-10-25 21:30:36 +08:00
|
|
|
.register(KindWithContent::IndexCreation { index_uid: S("doggos"), primary_key: None })
|
2022-10-20 23:11:44 +08:00
|
|
|
.unwrap();
|
2022-10-25 21:30:36 +08:00
|
|
|
handle.advance_n_batch(1);
|
2022-10-20 23:11:44 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
for i in 0..10 {
|
|
|
|
let content = format!(
|
|
|
|
r#"{{
|
|
|
|
"id": {},
|
|
|
|
"doggo": "bob {}"
|
|
|
|
}}"#,
|
|
|
|
i, i
|
|
|
|
);
|
2022-10-26 21:14:46 +08:00
|
|
|
let allow_index_creation = i % 2 != 0;
|
2022-10-20 23:11:44 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
let (uuid, mut file) = index_scheduler.create_update_file_with_uuid(i).unwrap();
|
|
|
|
let documents_count = meilisearch_types::document_formats::read_json(
|
|
|
|
content.as_bytes(),
|
|
|
|
file.as_file_mut(),
|
|
|
|
)
|
|
|
|
.unwrap() as u64;
|
|
|
|
file.persist().unwrap();
|
|
|
|
index_scheduler
|
|
|
|
.register(KindWithContent::DocumentAdditionOrUpdate {
|
|
|
|
index_uid: S("doggos"),
|
|
|
|
primary_key: Some(S("id")),
|
|
|
|
method: ReplaceDocuments,
|
|
|
|
content_file: uuid,
|
|
|
|
documents_count,
|
|
|
|
allow_index_creation,
|
|
|
|
})
|
|
|
|
.unwrap();
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
}
|
|
|
|
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
|
|
|
// Everything should be batched together.
|
|
|
|
handle.advance_n_batch(1);
|
2022-10-20 23:11:44 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
|
|
|
// Has everything being pushed successfully in milli?
|
|
|
|
let index = index_scheduler.index("doggos").unwrap();
|
|
|
|
let rtxn = index.read_txn().unwrap();
|
|
|
|
let field_ids_map = index.fields_ids_map(&rtxn).unwrap();
|
|
|
|
let field_ids = field_ids_map.ids().collect::<Vec<_>>();
|
|
|
|
let documents = index
|
|
|
|
.all_documents(&rtxn)
|
|
|
|
.unwrap()
|
|
|
|
.map(|ret| obkv_to_json(&field_ids, &field_ids_map, ret.unwrap().1).unwrap())
|
|
|
|
.collect::<Vec<_>>();
|
|
|
|
snapshot!(serde_json::to_string_pretty(&documents).unwrap());
|
2022-10-20 23:11:44 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
2022-10-25 21:30:36 +08:00
|
|
|
fn test_document_addition_mixed_right_without_index_starts_with_cant_create() {
|
|
|
|
// We're going to autobatch multiple document addition.
|
|
|
|
// - The index does not exists
|
|
|
|
// - The first document addition don't have the right to create an index
|
|
|
|
// - The second do. They should not batch together.
|
|
|
|
// - The second should batch with everything else as it's going to create an index.
|
|
|
|
let (index_scheduler, handle) = IndexScheduler::test(true, vec![]);
|
2022-10-20 23:11:44 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
for i in 0..10 {
|
|
|
|
let content = format!(
|
|
|
|
r#"{{
|
|
|
|
"id": {},
|
|
|
|
"doggo": "bob {}"
|
|
|
|
}}"#,
|
|
|
|
i, i
|
|
|
|
);
|
2022-10-26 21:14:46 +08:00
|
|
|
let allow_index_creation = i % 2 != 0;
|
2022-10-20 23:11:44 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
let (uuid, mut file) = index_scheduler.create_update_file_with_uuid(i).unwrap();
|
|
|
|
let documents_count = meilisearch_types::document_formats::read_json(
|
|
|
|
content.as_bytes(),
|
|
|
|
file.as_file_mut(),
|
|
|
|
)
|
|
|
|
.unwrap() as u64;
|
|
|
|
file.persist().unwrap();
|
|
|
|
index_scheduler
|
|
|
|
.register(KindWithContent::DocumentAdditionOrUpdate {
|
|
|
|
index_uid: S("doggos"),
|
|
|
|
primary_key: Some(S("id")),
|
|
|
|
method: ReplaceDocuments,
|
|
|
|
content_file: uuid,
|
|
|
|
documents_count,
|
|
|
|
allow_index_creation,
|
|
|
|
})
|
|
|
|
.unwrap();
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
}
|
2022-10-24 20:16:14 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
2022-10-24 20:16:14 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
// A first batch should be processed with only the first documentAddition that's going to fail.
|
|
|
|
handle.advance_n_batch(1);
|
2022-10-20 23:11:44 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
2022-10-20 23:11:44 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
// Everything else should be batched together.
|
|
|
|
handle.advance_n_batch(1);
|
2022-10-20 23:11:44 +08:00
|
|
|
index_scheduler.assert_internally_consistent();
|
2022-10-24 20:16:14 +08:00
|
|
|
|
2022-10-25 21:30:36 +08:00
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler));
|
|
|
|
|
|
|
|
// Has everything being pushed successfully in milli?
|
|
|
|
let index = index_scheduler.index("doggos").unwrap();
|
|
|
|
let rtxn = index.read_txn().unwrap();
|
|
|
|
let field_ids_map = index.fields_ids_map(&rtxn).unwrap();
|
|
|
|
let field_ids = field_ids_map.ids().collect::<Vec<_>>();
|
|
|
|
let documents = index
|
|
|
|
.all_documents(&rtxn)
|
|
|
|
.unwrap()
|
|
|
|
.map(|ret| obkv_to_json(&field_ids, &field_ids_map, ret.unwrap().1).unwrap())
|
|
|
|
.collect::<Vec<_>>();
|
|
|
|
snapshot!(serde_json::to_string_pretty(&documents).unwrap());
|
2022-10-20 23:11:44 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn panic_in_process_batch_for_index_creation() {
|
|
|
|
let (index_scheduler, handle) =
|
|
|
|
IndexScheduler::test(true, vec![(1, FailureLocation::PanicInsideProcessBatch)]);
|
|
|
|
|
|
|
|
let kind = index_creation_task("catto", "mouse");
|
|
|
|
|
|
|
|
let _task = index_scheduler.register(kind).unwrap();
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
|
|
|
|
handle.wait_till(Breakpoint::AfterProcessing);
|
|
|
|
|
|
|
|
// Still in the first iteration
|
|
|
|
assert_eq!(*index_scheduler.run_loop_iteration.read().unwrap(), 1);
|
|
|
|
// No matter what happens in process_batch, the index_scheduler should be internally consistent
|
|
|
|
index_scheduler.assert_internally_consistent();
|
|
|
|
snapshot!(snapshot_index_scheduler(&index_scheduler), name: "index_creation_failed");
|
2022-09-21 18:01:46 +08:00
|
|
|
}
|
2022-09-15 18:23:41 +08:00
|
|
|
}
|