reddb-io-server 1.9.1

RedDB server-side engine: storage, runtime, replication, MCP, AI, and the gRPC/HTTP/RedWire/PG-wire dispatchers. Re-exported by the umbrella `reddb` crate.
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
//! Parser for QUEUE commands and CREATE/DROP QUEUE

use super::super::ast::{
    AlterQueueQuery, CreateQueueQuery, DropQueueQuery, QueryExpr, QueueAvailability, QueueCommand,
    QueueMode, QueueSide, DEFAULT_QUEUE_IN_FLIGHT_CAP_PER_GROUP, DEFAULT_QUEUE_LOCK_DEADLINE_MS,
    DEFAULT_QUEUE_MAX_ATTEMPTS,
};
use super::super::lexer::Token;
use super::error::ParseError;
use super::Parser;

impl<'a> Parser<'a> {
    /// Parse CREATE QUEUE body (after CREATE QUEUE consumed)
    pub fn parse_create_queue_body(&mut self) -> Result<QueryExpr, ParseError> {
        let if_not_exists = self.match_if_not_exists()?;
        let name = self.expect_ident()?;

        let mut mode = QueueMode::Work;
        let mut priority = false;
        let mut max_size = None;
        let mut ttl_ms = None;
        let mut dlq = None;
        let mut max_attempts = DEFAULT_QUEUE_MAX_ATTEMPTS;
        let mut lock_deadline_ms = DEFAULT_QUEUE_LOCK_DEADLINE_MS;
        let mut in_flight_cap_per_group = DEFAULT_QUEUE_IN_FLIGHT_CAP_PER_GROUP;
        let mut retry_delay_ms: Option<u64> = None;

        // Parse optional clauses in any order
        loop {
            if let Some(parsed_mode) = self.consume_queue_mode()? {
                mode = parsed_mode;
            } else if self.consume(&Token::Priority)? {
                priority = true;
            } else if self.consume_ident_ci("MAX_SIZE")? || self.consume_ident_ci("MAXSIZE")? {
                max_size = Some(self.parse_positive_integer("MAX_SIZE")? as usize);
            } else if self.consume_ident_ci("MAX_ATTEMPTS")?
                || self.consume_ident_ci("MAXATTEMPTS")?
            {
                max_attempts = self.parse_integer()?.max(1) as u32;
            } else if self.consume_ident_ci("LOCK_DEADLINE_MS")? {
                lock_deadline_ms = self.parse_integer()?.max(1) as u64;
            } else if self.consume_ident_ci("IN_FLIGHT_CAP_PER_GROUP")? {
                in_flight_cap_per_group = self.parse_integer()?.max(1) as u32;
            } else if self.consume_ident_ci("RETRY_DELAY")? {
                let value = self.parse_float()?;
                let unit = self.parse_queue_duration_unit()?;
                retry_delay_ms = Some((value * unit).max(0.0) as u64);
            } else if self.consume(&Token::With)? {
                if self.consume_ident_ci("EVENTS")? {
                    return Err(ParseError::new(
                        "queues cannot have event subscriptions".to_string(),
                        self.position(),
                    ));
                } else if self.consume_ident_ci("TTL")? {
                    let value = self.parse_float()?;
                    let unit = self.parse_queue_duration_unit()?;
                    ttl_ms = Some((value * unit) as u64);
                } else if self.consume_ident_ci("DLQ")? {
                    dlq = Some(self.expect_ident()?);
                }
            } else {
                break;
            }
        }

        Ok(QueryExpr::CreateQueue(CreateQueueQuery {
            name,
            mode,
            priority,
            max_size,
            ttl_ms,
            dlq,
            max_attempts,
            lock_deadline_ms,
            in_flight_cap_per_group,
            if_not_exists,
            retry_delay_ms,
        }))
    }

    /// Parse ALTER QUEUE body (after ALTER QUEUE consumed)
    ///
    /// Syntax: `ALTER QUEUE <name> SET <clause>` where `<clause>` is one of
    ///   `MODE <WORK|FANOUT>`
    ///   `MAX_ATTEMPTS <int>`
    ///   `LOCK_DEADLINE_MS <int>`
    ///   `IN_FLIGHT_CAP_PER_GROUP <int>`
    ///   `DLQ <ident>`
    pub fn parse_alter_queue_body(&mut self) -> Result<QueryExpr, ParseError> {
        let name = self.expect_ident()?;
        if !self.consume(&Token::Set)? && !self.consume_ident_ci("SET")? {
            return Err(ParseError::expected(
                vec!["SET"],
                self.peek(),
                self.position(),
            ));
        }

        let mut alter = AlterQueueQuery {
            name,
            ..Default::default()
        };

        if self.consume(&Token::Mode)? || self.consume_ident_ci("MODE")? {
            alter.mode = Some(self.parse_queue_mode()?);
        } else if self.consume_ident_ci("MAX_ATTEMPTS")? || self.consume_ident_ci("MAXATTEMPTS")? {
            alter.max_attempts = Some(self.parse_integer()?.max(1) as u32);
        } else if self.consume_ident_ci("LOCK_DEADLINE_MS")? {
            alter.lock_deadline_ms = Some(self.parse_integer()?.max(1) as u64);
        } else if self.consume_ident_ci("IN_FLIGHT_CAP_PER_GROUP")? {
            alter.in_flight_cap_per_group = Some(self.parse_integer()?.max(1) as u32);
        } else if self.consume_ident_ci("DLQ")? {
            alter.dlq = Some(self.expect_ident()?);
        } else if self.consume_ident_ci("RETRY_DELAY")? {
            let value = self.parse_float()?;
            let unit = self.parse_queue_duration_unit()?;
            alter.retry_delay_ms = Some((value * unit).max(0.0) as u64);
        } else {
            return Err(ParseError::expected(
                vec![
                    "MODE",
                    "MAX_ATTEMPTS",
                    "LOCK_DEADLINE_MS",
                    "IN_FLIGHT_CAP_PER_GROUP",
                    "DLQ",
                    "RETRY_DELAY",
                ],
                self.peek(),
                self.position(),
            ));
        }

        Ok(QueryExpr::AlterQueue(alter))
    }

    /// Parse DROP QUEUE body (after DROP QUEUE consumed)
    pub fn parse_drop_queue_body(&mut self) -> Result<QueryExpr, ParseError> {
        let if_exists = self.match_if_exists()?;
        let name = self.parse_drop_collection_name()?;
        Ok(QueryExpr::DropQueue(DropQueueQuery { name, if_exists }))
    }

    /// Parse QUEUE subcommand (after QUEUE token consumed)
    pub fn parse_queue_command(&mut self) -> Result<QueryExpr, ParseError> {
        self.expect(Token::Queue)?;

        match self.peek().clone() {
            Token::Push => {
                self.advance()?;
                let queue = self.expect_ident()?;
                let value = self.parse_value()?;
                let (priority, available) = self.parse_push_tail_clauses()?;
                Ok(QueryExpr::QueueCommand(QueueCommand::Push {
                    queue,
                    value,
                    side: QueueSide::Right,
                    priority,
                    available,
                }))
            }
            Token::Pop => {
                self.advance()?;
                let queue = self.expect_ident()?;
                let count = if self.consume(&Token::Count)? {
                    self.parse_integer()? as usize
                } else {
                    1
                };
                self.reject_wait_clause("POP")?;
                Ok(QueryExpr::QueueCommand(QueueCommand::Pop {
                    queue,
                    side: QueueSide::Left,
                    count,
                }))
            }
            Token::Peek => {
                self.advance()?;
                let queue = self.expect_ident()?;
                // Accept either `PEEK <q> COUNT <n>` or a bare `PEEK <q> <n>`.
                // `consume` has a side effect (advances past COUNT), so the
                // short-circuit order matters: only peek for a bare integer
                // when the COUNT keyword was absent.
                let count =
                    if self.consume(&Token::Count)? || matches!(self.peek(), Token::Integer(_)) {
                        self.parse_integer()? as usize
                    } else {
                        1
                    };
                self.reject_wait_clause("PEEK")?;
                Ok(QueryExpr::QueueCommand(QueueCommand::Peek { queue, count }))
            }
            Token::Ident(ref name) if name.eq_ignore_ascii_case("LEN") => {
                self.advance()?;
                let queue = self.expect_ident()?;
                Ok(QueryExpr::QueueCommand(QueueCommand::Len { queue }))
            }
            Token::Ident(ref name) if name.eq_ignore_ascii_case("MOVE") => {
                self.advance()?;
                self.expect(Token::From)?;
                let source = self.expect_ident()?;
                self.expect(Token::To)?;
                let destination = self.expect_ident()?;
                let filter = if self.consume(&Token::Where)? {
                    Some(self.parse_filter()?)
                } else {
                    None
                };
                let limit = if self.consume(&Token::Limit)? {
                    self.parse_positive_integer("LIMIT")? as usize
                } else if filter.is_some() {
                    return Err(ParseError::expected(
                        vec!["LIMIT"],
                        self.peek(),
                        self.position(),
                    ));
                } else {
                    1
                };
                Ok(QueryExpr::QueueCommand(QueueCommand::Move {
                    source,
                    destination,
                    filter,
                    limit,
                }))
            }
            Token::Purge => {
                self.advance()?;
                let queue = self.expect_ident()?;
                Ok(QueryExpr::QueueCommand(QueueCommand::Purge { queue }))
            }
            Token::Ident(ref name) if name.eq_ignore_ascii_case("LPOP") => {
                self.advance()?;
                let queue = self.expect_ident()?;
                Ok(QueryExpr::QueueCommand(QueueCommand::Pop {
                    queue,
                    side: QueueSide::Left,
                    count: 1,
                }))
            }
            Token::Ident(ref name) if name.eq_ignore_ascii_case("RPOP") => {
                self.advance()?;
                let queue = self.expect_ident()?;
                Ok(QueryExpr::QueueCommand(QueueCommand::Pop {
                    queue,
                    side: QueueSide::Right,
                    count: 1,
                }))
            }
            Token::Ident(ref name) if name.eq_ignore_ascii_case("LPUSH") => {
                self.advance()?;
                let queue = self.expect_ident()?;
                let value = self.parse_value()?;
                let (_priority, available) = self.parse_push_tail_clauses()?;
                Ok(QueryExpr::QueueCommand(QueueCommand::Push {
                    queue,
                    value,
                    side: QueueSide::Left,
                    priority: None,
                    available,
                }))
            }
            Token::Ident(ref name) if name.eq_ignore_ascii_case("RPUSH") => {
                self.advance()?;
                let queue = self.expect_ident()?;
                let value = self.parse_value()?;
                let (priority, available) = self.parse_push_tail_clauses()?;
                Ok(QueryExpr::QueueCommand(QueueCommand::Push {
                    queue,
                    value,
                    side: QueueSide::Right,
                    priority,
                    available,
                }))
            }
            Token::Group => {
                self.advance()?;
                self.expect(Token::Create)?;
                let queue = self.expect_ident()?;
                let group = self.expect_ident()?;
                Ok(QueryExpr::QueueCommand(QueueCommand::GroupCreate {
                    queue,
                    group,
                }))
            }
            Token::Ident(ref name) if name.eq_ignore_ascii_case("READ") => {
                self.advance()?;
                let queue = self.expect_ident()?;
                let group = if self.consume(&Token::Group)? {
                    Some(self.expect_ident()?)
                } else {
                    None
                };
                // CONSUMER consumer_name
                if !self.consume_ident_ci("CONSUMER")? {
                    return Err(ParseError::expected(
                        vec!["CONSUMER"],
                        self.peek(),
                        self.position(),
                    ));
                }
                let consumer = self.expect_ident()?;
                let count = if self.consume(&Token::Count)? {
                    self.parse_integer()? as usize
                } else {
                    1
                };
                let wait_ms = self.parse_optional_wait_clause()?;
                Ok(QueryExpr::QueueCommand(QueueCommand::GroupRead {
                    queue,
                    group,
                    consumer,
                    count,
                    wait_ms,
                }))
            }
            Token::Ident(ref name) if name.eq_ignore_ascii_case("PENDING") => {
                self.advance()?;
                let queue = self.expect_ident()?;
                self.expect(Token::Group)?;
                let group = self.expect_ident()?;
                Ok(QueryExpr::QueueCommand(QueueCommand::Pending {
                    queue,
                    group,
                }))
            }
            Token::Ident(ref name) if name.eq_ignore_ascii_case("CLAIM") => {
                self.advance()?;
                let queue = self.expect_ident()?;
                self.expect(Token::Group)?;
                let group = self.expect_ident()?;
                if !self.consume_ident_ci("CONSUMER")? {
                    return Err(ParseError::expected(
                        vec!["CONSUMER"],
                        self.peek(),
                        self.position(),
                    ));
                }
                let consumer = self.expect_ident()?;
                if !self.consume_ident_ci("MIN_IDLE")? {
                    return Err(ParseError::expected(
                        vec!["MIN_IDLE"],
                        self.peek(),
                        self.position(),
                    ));
                }
                let min_idle_ms = self.parse_integer()?.max(0) as u64;
                Ok(QueryExpr::QueueCommand(QueueCommand::Claim {
                    queue,
                    group,
                    consumer,
                    min_idle_ms,
                }))
            }
            Token::Ack => {
                self.advance()?;
                let queue = self.expect_ident()?;
                let (group, message_id, delivery_id, _delay_ms) =
                    self.parse_ack_nack_handle(false)?;
                Ok(QueryExpr::QueueCommand(QueueCommand::Ack {
                    queue,
                    group,
                    message_id,
                    delivery_id,
                }))
            }
            Token::Nack => {
                self.advance()?;
                let queue = self.expect_ident()?;
                let (group, message_id, delivery_id, delay_ms) =
                    self.parse_ack_nack_handle(true)?;
                Ok(QueryExpr::QueueCommand(QueueCommand::Nack {
                    queue,
                    group,
                    message_id,
                    delivery_id,
                    delay_ms,
                }))
            }
            _ => Err(ParseError::expected(
                vec![
                    "PUSH", "POP", "PEEK", "LEN", "PURGE", "GROUP", "READ", "ACK", "NACK", "LPUSH",
                    "RPUSH", "LPOP", "RPOP", "PENDING", "CLAIM", "MOVE",
                ],
                self.peek(),
                self.position(),
            )),
        }
    }

    /// Parse the tuple/`delivery_id` handle that follows `ACK <queue>` /
    /// `NACK <queue>`. Returns `(group, message_id, delivery_id)`:
    ///
    /// - `GROUP <group> '<message_id>'`               → legacy tuple, no delivery_id
    /// - `GROUP <group> '<message_id>' WITH delivery_id = '<base32>'` → both, delivery_id wins (ADR 0026)
    /// - `WITH delivery_id = '<base32>'`              → delivery_id only; group / message_id empty
    ///
    /// Refusing both is a parse error — at least one handle is required.
    fn parse_ack_nack_handle(
        &mut self,
        allow_delay: bool,
    ) -> Result<(String, String, Option<String>, Option<u64>), ParseError> {
        let (group, message_id) = if matches!(self.peek(), Token::Group) {
            self.advance()?;
            let group = self.expect_ident()?;
            let message_id = self.parse_string()?;
            (group, message_id)
        } else {
            (String::new(), String::new())
        };
        // After the optional `GROUP <g> '<mid>'`, we can have any
        // combination of `WITH delivery_id = '<id>'` and (for NACK only)
        // `WITH DELAY <duration>` — in any order. Each clause may appear
        // at most once. A bare `WITH` followed by neither keyword is a
        // parse error.
        let mut delivery_id: Option<String> = None;
        let mut delay_ms: Option<u64> = None;
        while self.consume(&Token::With)? {
            if self.consume_ident_ci("delivery_id")? {
                if delivery_id.is_some() {
                    return Err(ParseError::new(
                        "duplicate WITH delivery_id clause".to_string(),
                        self.position(),
                    ));
                }
                if !self.consume(&Token::Eq)? {
                    return Err(ParseError::expected(
                        vec!["="],
                        self.peek(),
                        self.position(),
                    ));
                }
                delivery_id = Some(self.parse_string()?);
            } else if allow_delay && self.consume_ident_ci("DELAY")? {
                if delay_ms.is_some() {
                    return Err(ParseError::new(
                        "duplicate WITH DELAY clause".to_string(),
                        self.position(),
                    ));
                }
                let value = self.parse_float()?;
                let unit = self.parse_queue_duration_unit()?;
                delay_ms = Some((value * unit).max(0.0) as u64);
            } else {
                let mut expected = vec!["delivery_id"];
                if allow_delay {
                    expected.push("DELAY");
                }
                return Err(ParseError::expected(expected, self.peek(), self.position()));
            }
        }
        if group.is_empty() && delivery_id.is_none() {
            let mut expected = vec!["GROUP", "WITH delivery_id"];
            if allow_delay {
                expected.push("WITH DELAY");
            }
            return Err(ParseError::expected(expected, self.peek(), self.position()));
        }
        Ok((group, message_id, delivery_id, delay_ms))
    }

    /// Parse the optional `PRIORITY <int>`, `DELAY <duration>`, and
    /// `AVAILABLE AT <unix_ms>` tail of a `QUEUE PUSH` / `RPUSH` / `LPUSH`
    /// (issue #722). Clauses may appear in any order; each may appear at
    /// most once. `AVAILABLE AT` and `DELAY` are mutually exclusive — both
    /// produce a per-message availability instant, so accepting both
    /// would force the parser to pick a winner silently.
    fn parse_push_tail_clauses(
        &mut self,
    ) -> Result<(Option<i32>, Option<QueueAvailability>), ParseError> {
        let mut priority: Option<i32> = None;
        let mut available: Option<QueueAvailability> = None;
        loop {
            if self.consume(&Token::Priority)? {
                if priority.is_some() {
                    return Err(ParseError::new(
                        "duplicate PRIORITY clause".to_string(),
                        self.position(),
                    ));
                }
                priority = Some(self.parse_integer()? as i32);
            } else if self.peek_ident_ci("DELAY") {
                self.advance()?;
                if available.is_some() {
                    return Err(ParseError::new(
                        "QUEUE PUSH accepts at most one of DELAY / AVAILABLE AT".to_string(),
                        self.position(),
                    ));
                }
                let value = self.parse_float()?;
                let unit = self.parse_queue_duration_unit()?;
                available = Some(QueueAvailability::DelayMs((value * unit).max(0.0) as u64));
            } else if self.peek_ident_ci("AVAILABLE") {
                self.advance()?;
                if !self.consume_ident_ci("AT")? {
                    return Err(ParseError::expected(
                        vec!["AT"],
                        self.peek(),
                        self.position(),
                    ));
                }
                if available.is_some() {
                    return Err(ParseError::new(
                        "QUEUE PUSH accepts at most one of DELAY / AVAILABLE AT".to_string(),
                        self.position(),
                    ));
                }
                let unix_ms = self.parse_integer()?.max(0) as u64;
                available = Some(QueueAvailability::AtUnixMs(unix_ms));
            } else {
                break;
            }
        }
        Ok((priority, available))
    }

    /// Parse an optional `WAIT <duration>` tail (slice A of PRD #718).
    ///
    /// Returns `None` if the next token is not the `WAIT` keyword. When
    /// `WAIT` is present, a duration literal is mandatory — a bare
    /// `WAIT` with no number errors with a clear "expected: number"
    /// message bubbled up from `parse_float`.
    fn parse_optional_wait_clause(&mut self) -> Result<Option<u64>, ParseError> {
        if !self.peek_ident_ci("WAIT") {
            return Ok(None);
        }
        self.advance()?;
        let value = self.parse_float()?;
        let unit = self.parse_queue_duration_unit()?;
        Ok(Some((value * unit).max(0.0) as u64))
    }

    /// Reject a stray `WAIT …` tail after a command form that does not
    /// support blocking reads (`POP`, `PEEK`). The error names the
    /// command so the operator sees why their statement was refused.
    fn reject_wait_clause(&mut self, command: &'static str) -> Result<(), ParseError> {
        if self.peek_ident_ci("WAIT") {
            return Err(ParseError::new(
                format!("QUEUE {command} does not support WAIT; use QUEUE READ … WAIT <duration>"),
                self.position(),
            ));
        }
        Ok(())
    }

    fn peek_ident_ci(&self, name: &str) -> bool {
        matches!(self.peek(), Token::Ident(id) if id.eq_ignore_ascii_case(name))
    }

    fn consume_queue_mode(&mut self) -> Result<Option<QueueMode>, ParseError> {
        match self.peek() {
            Token::Work => {
                self.advance()?;
                Ok(Some(QueueMode::Work))
            }
            Token::Ident(name) => {
                if let Some(mode) = QueueMode::parse(name) {
                    self.advance()?;
                    Ok(Some(mode))
                } else {
                    Ok(None)
                }
            }
            _ => Ok(None),
        }
    }

    fn parse_queue_mode(&mut self) -> Result<QueueMode, ParseError> {
        match self.consume_queue_mode()? {
            Some(mode) => Ok(mode),
            None => Err(ParseError::expected(
                vec!["FANOUT", "WORK"],
                self.peek(),
                self.position(),
            )),
        }
    }

    /// Parse duration unit for queue TTL
    fn parse_queue_duration_unit(&mut self) -> Result<f64, ParseError> {
        match self.peek().clone() {
            Token::Ident(ref unit) => {
                let mult = match unit.to_ascii_lowercase().as_str() {
                    "ms" => 1.0,
                    "s" | "sec" | "secs" => 1_000.0,
                    "m" | "min" | "mins" => 60_000.0,
                    "h" | "hr" | "hrs" => 3_600_000.0,
                    "d" | "day" | "days" => 86_400_000.0,
                    _ => return Ok(1_000.0),
                };
                self.advance()?;
                Ok(mult)
            }
            _ => Ok(1_000.0),
        }
    }
}