v_queue 0.2.9

simple file based queue
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
use crate::fs2::FileExt;
use crate::record::*;
use crc32fast::Hasher;
use std::fs::*;
use std::io::prelude::*;
use std::io::SeekFrom;
use std::io::{BufRead, BufReader};
use std::path::*;

pub struct Queue {
    pub base_path: String,
    mode: Mode,
    pub is_ready: bool,
    pub name: String,
    pub ff_queue: File,
    ff_info_push: File,
    ff_info_queue: File,
    // Holds the advisory lock for the queue lifetime. Dropping releases the lock.
    _lock_file: Option<File>,
    pub(crate) right_edge: u64,
    pub count_pushed: u32,
    pub id: u32,
}

impl Queue {
    pub fn new(base_path: &str, queue_name: &str, in_mode: Mode) -> Result<Queue, ErrorQueue> {
        if !Path::new(&base_path).exists() {
            if let Err(e) = create_dir_all(base_path) {
                error!("queue:{} create path, err={}", queue_name, e);
                return Err(ErrorQueue::FailWrite);
            }
        }

        let file_name_info_queue = base_path.to_owned() + "/" + queue_name + "_info_queue";

        let wfqi = if in_mode == Mode::ReadWrite {
            OpenOptions::new().read(true).write(true).create(true).open(file_name_info_queue)
        } else {
            OpenOptions::new().read(true).open(file_name_info_queue)
        };

        if let Ok(fqi) = wfqi {
            let tmp_f1 = match fqi.try_clone() {
                Ok(f) => f,
                Err(e) => {
                    error!("queue:{} clone info_queue fd, err={}", queue_name, e);
                    return Err(ErrorQueue::FailOpen);
                },
            };
            let tmp_f2 = match fqi.try_clone() {
                Ok(f) => f,
                Err(e) => {
                    error!("queue:{} clone info_push fd, err={}", queue_name, e);
                    return Err(ErrorQueue::FailOpen);
                },
            };

            let mut queue = Queue {
                base_path: base_path.to_string(),
                mode: in_mode,
                is_ready: true,
                name: queue_name.to_owned(),
                count_pushed: 0,
                right_edge: 0,
                ff_queue: fqi,
                ff_info_queue: tmp_f1,
                ff_info_push: tmp_f2,
                _lock_file: None,
                id: 0,
            };

            let info_is_ok = queue.get_info_queue();

            if in_mode == Mode::ReadWrite {
                let file_name_lock = queue.base_path.to_owned() + "/" + queue_name + "_queue.lock";

                match OpenOptions::new().read(true).write(true).create(true).open(file_name_lock) {
                    Ok(file) => {
                        // try_lock_exclusive returns immediately so a second
                        // ReadWrite open surfaces AlreadyOpen instead of
                        // blocking. blocking on lock_exclusive would deadlock
                        // a single-threaded caller waiting for itself.
                        if let Err(e) = file.try_lock_exclusive() {
                            error!("queue:{}:{} attempt lock, err={}", queue.name, queue.id, e);
                            return Err(ErrorQueue::AlreadyOpen);
                        }
                        queue._lock_file = Some(file);
                    },
                    Err(e) => {
                        error!("queue:{}:{} prepare lock, err={}", queue.name, queue.id, e);
                        return Err(ErrorQueue::FailOpen);
                    },
                }

                if info_is_ok {
                    // Inspect the previous part: if the writer was just
                    // restarted and never pushed anything, reuse its empty
                    // part instead of allocating a fresh one. This avoids
                    // accumulating empty <name>-N directories that consumers
                    // would otherwise have to walk through.
                    let previous_id = queue.id;
                    let previous_is_empty = match queue.get_info_of_part(previous_id, true) {
                        Ok(()) => queue.count_pushed == 0,
                        Err(_) => false,
                    };

                    if previous_is_empty {
                        queue.right_edge = 0;
                    } else {
                        queue.id = previous_id + 1;
                        queue.count_pushed = 0;
                        queue.right_edge = 0;
                    }
                }

                let part_name = queue.name.to_owned() + "-" + &queue.id.to_string();

                if !Path::new(&part_name).exists() {
                    if let Err(e) = create_dir_all(queue.base_path.to_owned() + "/" + &part_name) {
                        error!("queue:{}:{} create path, err={}", queue.name, queue.id, e);
                        return Err(ErrorQueue::FailWrite);
                    }
                }

                if let Err(e) = queue.open_part(queue.id) {
                    error!("queue:{}:{} open part, err={:?}", queue.name, queue.id, e);
                    return Err(ErrorQueue::FailOpen);
                }

                if let Err(e) = queue.put_info_push() {
                    error!("queue:{}:{} open, write info of part, err={:?}", queue.name, queue.id, e);
                    return Err(ErrorQueue::FailWrite);
                }

                if let Err(e) = queue.put_info_queue() {
                    error!("queue:{}:{} open, write info of queue, err={:?}", queue.name, queue.id, e);
                    return Err(ErrorQueue::FailWrite);
                }
            }

            if info_is_ok {
                if let Err(e) = queue.get_info_of_part(queue.id, true) {
                    error!("queue:{}:{} open, get info of part: {}", queue.name, queue.id, e.as_str());
                    // In Read mode there is no chance to repair: surface the
                    // corruption to the caller. In ReadWrite mode the writer
                    // has already created a fresh part above and can keep
                    // appending, so we tolerate a stale info_of_part for the
                    // newly opened (empty) part.
                    if in_mode == Mode::Read {
                        return Err(e);
                    }
                }
            } else if in_mode == Mode::Read {
                // info_queue could not be parsed or its CRC did not match.
                // For a reader this means we cannot trust the queue id, so
                // refuse to open instead of silently reading from id=0.
                error!("queue:{} open(Read), info_queue unreadable or CRC mismatch", queue.name);
                return Err(ErrorQueue::InvalidChecksum);
            }

            return Ok(queue);
        }

        Err(ErrorQueue::NotReady)
    }

    pub fn push(&mut self, data: &[u8], in_msg_type: MsgType) -> Result<u64, ErrorQueue> {
        if !self.is_ready || self.mode == Mode::Read || data.len() > std::u32::MAX as usize / 2 {
            return Err(ErrorQueue::NotReady);
        }

        let header = Header {
            start_pos: self.right_edge,
            msg_length: data.len() as u32,
            magic_marker: MAGIC_MARKER,
            count_pushed: self.count_pushed + 1,
            crc: 0,
            msg_type: in_msg_type,
        };

        let mut bheader = [0; HEADER_SIZE];
        header.to_buf(&mut bheader);

        let mut hash = Hasher::new();
        hash.update(&bheader);
        hash.update(data);

        let bhash = u32::to_ne_bytes(hash.finalize());

        bheader[21] = bhash[0];
        bheader[22] = bhash[1];
        bheader[23] = bhash[2];
        bheader[24] = bhash[3];

        // Snapshot the last known good boundary; on any failure we truncate
        // the queue file back to it so partial writes do not leave a corrupt
        // record at the tail.
        let restore_pos = self.right_edge;

        if let Err(e) = self.ff_queue.write_all(&bheader) {
            error!("queue:{}:{} push, write header, err={}", self.name, self.id, e);
            self.rollback_queue_tail(restore_pos);
            return Err(ErrorQueue::FailWrite);
        }
        if let Err(e) = self.ff_queue.write_all(data) {
            error!("queue:{}:{} push, write body, err={}", self.name, self.id, e);
            self.rollback_queue_tail(restore_pos);
            return Err(ErrorQueue::FailWrite);
        }

        self.right_edge += bheader.len() as u64 + data.len() as u64;
        self.count_pushed += 1;

        if let Err(e) = self.put_info_push() {
            error!("queue:{}:{} push, write info, err={:?}", self.name, self.id, e);
            self.right_edge = restore_pos;
            self.count_pushed -= 1;
            self.rollback_queue_tail(restore_pos);
            return Err(ErrorQueue::FailWrite);
        }

        Ok(self.right_edge)
    }

    // Best-effort truncate of the queue file back to `pos` and reset of the
    // write cursor. Called after a failed write or info update to recover the
    // on-disk tail. Failure to truncate or seek is logged but does not poison
    // the queue: in-memory counters have already been restored to the last
    // known good state and the caller has been told the push failed.
    fn rollback_queue_tail(&mut self, pos: u64) {
        if let Err(e) = self.ff_queue.set_len(pos) {
            warn!("queue:{}:{} rollback set_len({}), err={}", self.name, self.id, pos, e);
        }
        if let Err(e) = self.ff_queue.seek(SeekFrom::Start(pos)) {
            warn!("queue:{}:{} rollback seek({}), err={}", self.name, self.id, pos, e);
        }
    }

    fn put_info_push(&mut self) -> Result<(), ErrorQueue> {
        let p = format!("{};{};{};", self.name, self.right_edge, self.count_pushed);
        let mut hash = Hasher::new();
        hash.update(p.as_bytes());
        let payload = format!("{}{}\n", p, hash.finalize());

        // Truncate first, then rewind, then write the full record. Without
        // set_len(0) a shorter new record would leave stale tail bytes from
        // the previous write that confuse readers.
        if let Err(e) = self.ff_info_push.set_len(0) {
            error!("fail put info push, set_len err={}", e);
            self.is_ready = false;
            return Err(ErrorQueue::FailWrite);
        }
        if let Err(e) = self.ff_info_push.seek(SeekFrom::Start(0)) {
            error!("fail put info push, seek err={}", e);
            self.is_ready = false;
            return Err(ErrorQueue::FailWrite);
        }
        if let Err(e) = self.ff_info_push.write_all(payload.as_bytes()) {
            error!("fail put info push, write err={}", e);
            self.is_ready = false;
            return Err(ErrorQueue::FailWrite);
        }

        Ok(())
    }

    fn put_info_queue(&mut self) -> Result<(), ErrorQueue> {
        let p = format!("{};{};", self.name, self.id);
        let mut hash = Hasher::new();
        hash.update(p.as_bytes());
        let payload = format!("{}{}\n", p, hash.finalize());

        if let Err(e) = self.ff_info_queue.set_len(0) {
            error!("fail put info queue, set_len err={}", e);
            self.is_ready = false;
            return Err(ErrorQueue::FailWrite);
        }
        if let Err(e) = self.ff_info_queue.seek(SeekFrom::Start(0)) {
            error!("fail put info queue, seek err={}", e);
            self.is_ready = false;
            return Err(ErrorQueue::FailWrite);
        }
        if let Err(e) = self.ff_info_queue.write_all(payload.as_bytes()) {
            error!("fail put info queue, write err={}", e);
            self.is_ready = false;
            return Err(ErrorQueue::FailWrite);
        }

        Ok(())
    }

    fn open_info_push(&mut self, part_id: u32) -> Result<(), ErrorQueue> {
        let ipp = self.base_path.to_owned() + "/" + &self.name + "-" + &part_id.to_string() + "/" + &self.name + "_info_push";

        let ffiq = if self.mode == Mode::ReadWrite {
            OpenOptions::new().read(true).write(true).create(true).open(&ipp)
        } else {
            OpenOptions::new().read(true).open(&ipp)
        };

        match ffiq {
            Ok(ff) => self.ff_info_push = ff,
            Err(e) => {
                debug!("[{}] fail open info push, part {}, mode={:?}, err={:?} {}", self.name, part_id, self.mode, e, ipp);
                self.is_ready = false;
                return Err(ErrorQueue::FailOpen);
            },
        }

        Ok(())
    }

    pub fn open_part(&mut self, part_id: u32) -> Result<(), ErrorQueue> {
        if !self.is_ready {
            return Err(ErrorQueue::NotReady);
        }

        self.open_info_push(part_id)?;

        let qpp = self.base_path.to_owned() + "/" + &self.name + "-" + &part_id.to_string() + "/" + &self.name + "_queue";
        let ffq = if self.mode == Mode::ReadWrite {
            OpenOptions::new().read(true).write(true).create(true).open(qpp)
        } else {
            OpenOptions::new().read(true).open(qpp)
        };

        if let Ok(f) = ffq {
            self.ff_queue = f;
        } else {
            debug!("[{}] fail open part {}", self.name, part_id);
            self.is_ready = false;
            return Err(ErrorQueue::FailOpen);
        }

        self.id = part_id;

        debug!("[{}] open part {}", self.name, part_id);

        self.get_info_of_part(self.id, false)
    }

    pub fn get_info_queue(&mut self) -> bool {
        if self.ff_info_queue.seek(SeekFrom::Start(0)).is_err() {
            return false;
        }

        let line = match BufReader::new(&self.ff_info_queue).lines().next() {
            Some(Ok(s)) => s,
            Some(Err(e)) => {
                error!("queue:{} get_info_queue, read line err={}", self.name, e);
                return false;
            },
            None => return false,
        };

        let (queue_name, parsed_id, parsed_crc) = match scan_fmt!(&line, "{};{};{}", String, u32, u32) {
            Ok(v) => v,
            Err(e) => {
                error!("queue:{} get_info_queue, parse err={}, line=[{}]", self.name, e, line);
                return false;
            },
        };

        if queue_name != self.name {
            return false;
        }

        // The on-disk CRC is computed over the prefix "name;id;" including
        // the trailing semicolon. Re-derive the same prefix to verify.
        let prefix = format!("{};{};", queue_name, parsed_id);
        let mut hash = Hasher::new();
        hash.update(prefix.as_bytes());
        if hash.finalize() != parsed_crc {
            error!("queue:{} get_info_queue, CRC mismatch", self.name);
            return false;
        }

        self.id = parsed_id;

        true
    }

    pub fn get_info_of_part(&mut self, part_id: u32, reopen: bool) -> Result<(), ErrorQueue> {
        if self.id != part_id || reopen {
            self.open_info_push(part_id)?;
        }

        if self.ff_info_push.seek(SeekFrom::Start(0)).is_err() {
            return Err(ErrorQueue::FailRead);
        }

        let first_line = match BufReader::new(&self.ff_info_push).lines().next() {
            Some(Ok(s)) => Some(s),
            Some(Err(e)) => {
                error!("queue:{}:{} get_info_of_part, read line err={}", self.name, part_id, e);
                return Err(ErrorQueue::FailRead);
            },
            // An empty info_push file is legitimate: a freshly created part
            // that has not received any push yet. Counters stay at zero.
            None => None,
        };

        let (right_edge, count_pushed) = match first_line {
            None => (0u64, 0u32),
            Some(ll) => {
                let (queue_name, position, pushed, parsed_crc) = match scan_fmt!(&ll, "{};{};{};{}", String, u64, u32, u32) {
                    Ok(v) => v,
                    Err(e) => {
                        error!("queue:{}:{} get_info_of_part, parse err={}, line=[{}]", self.name, part_id, e, ll);
                        return Err(ErrorQueue::Other);
                    },
                };

                if queue_name != self.name {
                    return Err(ErrorQueue::Other);
                }

                let prefix = format!("{};{};{};", queue_name, position, pushed);
                let mut hash = Hasher::new();
                hash.update(prefix.as_bytes());
                if hash.finalize() != parsed_crc {
                    error!("queue:{}:{} get_info_of_part, CRC mismatch", self.name, part_id);
                    return Err(ErrorQueue::InvalidChecksum);
                }

                (position, pushed)
            },
        };

        self.right_edge = right_edge;
        self.count_pushed = count_pushed;

        Ok(())
    }
}