oxedyne/fe2o3/fe2o3_mail/tests/mailqx_deep.rs
2.6 KiB, 9 runs
created by r2968587332:77966, which is this file's identity for as long as the history lasts, whatever it is later renamed to
download · who wrote it · its history
| 1 | //! MAILq-x examiner's depth cases: each runs alone (a stack overflow aborts the whole binary). |
| 2 | //! Each runs on a thread with an 8 MiB stack, a main thread's, more than a test thread's 2 MiB. |
| 3 | |
| 4 | use oxedyne_fe2o3_mail::search::{ |
| 5 | Day, |
| 6 | Limits, |
| 7 | Mail, |
| 8 | Matcher, |
| 9 | Mode, |
| 10 | Query, |
| 11 | Term, |
| 12 | }; |
| 13 | |
| 14 | const TODAY: Day = Day { year: 2026, month: 3, day: 4 }; |
| 15 | const LIM: Limits = Limits { search_regex_max_len: 200, search_max_depth: 64, search_max_terms: 64, |
| 16 | snippet_chars: 40, snippets_per_part: 2, ..Limits::DEFAULT }; |
| 17 | |
| 18 | fn on_big_stack<F: FnOnce() + Send + 'static>(f: F) { |
| 19 | let h = std::thread::Builder::new().stack_size(8 << 20).spawn(f); |
| 20 | match h { |
| 21 | Ok(h) => { let _ = h.join(); } |
| 22 | Err(e) => panic!("{}", e), |
| 23 | } |
| 24 | } |
| 25 | |
| 26 | fn depth() -> usize { |
| 27 | std::env::var("QX_DEPTH").ok().and_then(|s| s.parse().ok()).unwrap_or(10_000) |
| 28 | } |
| 29 | |
| 30 | #[test] |
| 31 | fn qx_deep_parse_parens() { |
| 32 | let n = depth(); |
| 33 | on_big_stack(move || { |
| 34 | let s = "(".repeat(n) + "a" + &")".repeat(n); |
| 35 | let q = Query::parse(&s, &LIM); |
| 36 | eprintln!("QX deep parens {} parsed: {}", n, q.is_ok()); |
| 37 | }); |
| 38 | } |
| 39 | |
| 40 | #[test] |
| 41 | fn qx_deep_parse_neg() { |
| 42 | let n = depth(); |
| 43 | on_big_stack(move || { |
| 44 | let s = "-".repeat(n) + "a"; |
| 45 | let q = Query::parse(&s, &LIM); |
| 46 | eprintln!("QX deep neg {} parsed: {}", n, q.is_ok()); |
| 47 | }); |
| 48 | } |
| 49 | |
| 50 | fn deep_term(n: usize) -> Term { |
| 51 | let mut t = Term::Text { scope: None, mode: Mode::Word, text: "a".into() }; |
| 52 | for i in 0..n { t = if i % 2 == 0 { Term::All(vec![t]) } else { Term::Not(Box::new(t)) }; } |
| 53 | t |
| 54 | } |
| 55 | |
| 56 | #[test] |
| 57 | fn qx_deep_match() { |
| 58 | let n = depth(); |
| 59 | on_big_stack(move || { |
| 60 | let q = Query { terms: deep_term(n), ..Query::default() }; |
| 61 | let raw = b"Subject: a\r\n\r\na\r\n"; |
| 62 | let m = Matcher::new(&q, &LIM, TODAY); |
| 63 | eprintln!("QX deep compile {}: {}", n, m.is_ok()); |
| 64 | if let Ok(m) = m { |
| 65 | let a = m.matches(&Mail { raw, seen: false, flagged: false, size: 1, day: None }); |
| 66 | eprintln!("QX deep match {}: {:?}", n, a.map(|h| h.is_some()).map_err(|e| e.to_string())); |
| 67 | } |
| 68 | std::mem::forget(q); |
| 69 | }); |
| 70 | } |
| 71 | |
| 72 | #[test] |
| 73 | fn qx_deep_display() { |
| 74 | let n = depth(); |
| 75 | on_big_stack(move || { |
| 76 | let q = Query { terms: deep_term(n), ..Query::default() }; |
| 77 | let s = q.to_string(); |
| 78 | eprintln!("QX deep display {}: {} bytes", n, s.len()); |
| 79 | std::mem::forget(q); |
| 80 | }); |
| 81 | } |
| 82 | |
| 83 | #[test] |
| 84 | fn qx_deep_drop() { |
| 85 | let n = depth(); |
| 86 | on_big_stack(move || { |
| 87 | let q = Query { terms: deep_term(n), ..Query::default() }; |
| 88 | drop(q); |
| 89 | eprintln!("QX deep drop {}: ok", n); |
| 90 | }); |
| 91 | } |