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
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
//! Glob pattern matching and expansion for the interpreter.
//!
//! Extracted from mod.rs to reduce the god-module size.
//! Contains: pattern matching (glob, extglob, bracket expressions),
//! glob expansion against the filesystem, and related option helpers.
use std::path::{Path, PathBuf};
use crate::error::Result;
use super::Interpreter;
/// Expand a POSIX character class name into a list of characters.
pub(super) fn expand_posix_class(name: &str, out: &mut Vec<char>) {
match name {
"space" => out.extend([' ', '\t', '\n', '\r', '\x0b', '\x0c']),
"blank" => out.extend([' ', '\t']),
"digit" => out.extend('0'..='9'),
"lower" => out.extend('a'..='z'),
"upper" => out.extend('A'..='Z'),
"alpha" => {
out.extend('a'..='z');
out.extend('A'..='Z');
}
"alnum" => {
out.extend('a'..='z');
out.extend('A'..='Z');
out.extend('0'..='9');
}
"xdigit" => {
out.extend('0'..='9');
out.extend('a'..='f');
out.extend('A'..='F');
}
"punct" => {
for c in '!'..='/' {
out.push(c);
}
for c in ':'..='@' {
out.push(c);
}
for c in '['..='`' {
out.push(c);
}
for c in '{'..='~' {
out.push(c);
}
}
"print" => {
out.extend(' '..='~');
}
"graph" => {
out.extend('!'..='~');
}
"cntrl" => {
out.extend((0u8..=31).map(|b| b as char));
out.push(127 as char);
}
_ => {} // Unknown class: ignore
}
}
impl Interpreter {
// ── Pattern matching ──────────────────────────────────────────────
/// Check if pattern contains extglob operators
pub(crate) fn contains_extglob(&self, s: &str) -> bool {
if !self.is_extglob() {
return false;
}
let bytes = s.as_bytes();
for i in 0..bytes.len().saturating_sub(1) {
if matches!(bytes[i], b'@' | b'?' | b'*' | b'+' | b'!') && bytes[i + 1] == b'(' {
return true;
}
}
false
}
/// Check if a value matches a shell pattern
pub(crate) fn pattern_matches(&self, value: &str, pattern: &str) -> bool {
// Handle special case of * (match anything)
if pattern == "*" {
return true;
}
// Glob pattern matching with *, ?, [], and extglob support
if pattern.contains('*')
|| pattern.contains('?')
|| pattern.contains('[')
|| self.contains_extglob(pattern)
{
self.glob_match(value, pattern)
} else {
// Literal match
value == pattern
}
}
/// Simple glob pattern matching with support for *, ?, and [...]
pub(crate) fn glob_match(&self, value: &str, pattern: &str) -> bool {
self.glob_match_impl(value, pattern, false, 0)
}
/// Parse an extglob pattern-list from pattern string starting after '('.
/// Returns (alternatives, rest_of_pattern) or None if malformed.
fn parse_extglob_pattern_list(pattern: &str) -> Option<(Vec<String>, String)> {
let mut depth = 1;
let mut end = 0;
let chars: Vec<char> = pattern.chars().collect();
while end < chars.len() {
match chars[end] {
'(' => depth += 1,
')' => {
depth -= 1;
if depth == 0 {
let inner: String = chars[..end].iter().collect();
let rest: String = chars[end + 1..].iter().collect();
// Split on | at depth 0
let mut alts = Vec::new();
let mut current = String::new();
let mut d = 0;
for c in inner.chars() {
match c {
'(' => {
d += 1;
current.push(c);
}
')' => {
d -= 1;
current.push(c);
}
'|' if d == 0 => {
alts.push(current.clone());
current.clear();
}
_ => current.push(c),
}
}
alts.push(current);
return Some((alts, rest));
}
}
'\\' => {
end += 1; // skip escaped char
}
_ => {}
}
end += 1;
}
None // unclosed paren
}
/// Glob match with optional case-insensitive mode
pub(crate) fn glob_match_impl(
&self,
value: &str,
pattern: &str,
nocase: bool,
depth: usize,
) -> bool {
// THREAT[TM-DOS-031]: Bail on excessive recursion depth
if depth >= Self::MAX_GLOB_DEPTH {
return false;
}
let extglob = self.is_extglob();
// Check for extglob at the start of pattern
if extglob && pattern.len() >= 2 {
let bytes = pattern.as_bytes();
if matches!(bytes[0], b'@' | b'?' | b'*' | b'+' | b'!') && bytes[1] == b'(' {
let op = bytes[0];
if let Some((alts, rest)) = Self::parse_extglob_pattern_list(&pattern[2..]) {
return self.match_extglob(op, &alts, &rest, value, nocase, depth + 1);
}
}
}
let mut value_chars = value.chars().peekable();
let mut pattern_chars = pattern.chars().peekable();
loop {
match (pattern_chars.peek().copied(), value_chars.peek().copied()) {
(None, None) => return true,
(None, Some(_)) => return false,
(Some('*'), _) => {
// Check for extglob *(...)
let mut pc_clone = pattern_chars.clone();
pc_clone.next();
if extglob && pc_clone.peek() == Some(&'(') {
// Extglob *(pattern-list) — collect remaining pattern
let remaining_pattern: String = pattern_chars.collect();
let remaining_value: String = value_chars.collect();
return self.glob_match_impl(
&remaining_value,
&remaining_pattern,
nocase,
depth + 1,
);
}
pattern_chars.next();
// * matches zero or more characters
if pattern_chars.peek().is_none() {
return true; // * at end matches everything
}
// Try matching from each position
while value_chars.peek().is_some() {
let remaining_value: String = value_chars.clone().collect();
let remaining_pattern: String = pattern_chars.clone().collect();
if self.glob_match_impl(
&remaining_value,
&remaining_pattern,
nocase,
depth + 1,
) {
return true;
}
value_chars.next();
}
// Also try with empty match
let remaining_pattern: String = pattern_chars.collect();
return self.glob_match_impl("", &remaining_pattern, nocase, depth + 1);
}
(Some('?'), _) => {
// Check for extglob ?(...)
let mut pc_clone = pattern_chars.clone();
pc_clone.next();
if extglob && pc_clone.peek() == Some(&'(') {
let remaining_pattern: String = pattern_chars.collect();
let remaining_value: String = value_chars.collect();
return self.glob_match_impl(
&remaining_value,
&remaining_pattern,
nocase,
depth + 1,
);
}
if value_chars.peek().is_some() {
pattern_chars.next();
value_chars.next();
} else {
return false;
}
}
(Some('['), Some(v)) => {
// Save state before consuming '[' — if bracket expr is
// invalid (e.g. "[]"), we fall back to literal '[' match.
let saved_pattern = pattern_chars.clone();
pattern_chars.next(); // consume '['
let match_char = if nocase { v.to_ascii_lowercase() } else { v };
if let Some(matched) =
self.match_bracket_expr(&mut pattern_chars, match_char, nocase)
{
if matched {
value_chars.next();
} else {
return false;
}
} else {
// Invalid bracket expression — treat '[' as literal
pattern_chars = saved_pattern;
pattern_chars.next(); // consume '[' as literal
let p = '[';
let match_ok = if nocase {
p.eq_ignore_ascii_case(&v)
} else {
p == v
};
if match_ok {
value_chars.next();
} else {
return false;
}
}
}
(Some('['), None) => return false,
(Some(p), Some(v)) => {
// Check for extglob operators: @(, +(, !(
if extglob && matches!(p, '@' | '+' | '!') {
let mut pc_clone = pattern_chars.clone();
pc_clone.next();
if pc_clone.peek() == Some(&'(') {
let remaining_pattern: String = pattern_chars.collect();
let remaining_value: String = value_chars.collect();
return self.glob_match_impl(
&remaining_value,
&remaining_pattern,
nocase,
depth + 1,
);
}
}
let matches = if nocase {
p.eq_ignore_ascii_case(&v)
} else {
p == v
};
if matches {
pattern_chars.next();
value_chars.next();
} else {
return false;
}
}
(Some(_), None) => return false,
}
}
}
/// Match an extglob pattern against a value.
/// op: b'@', b'?', b'*', b'+', b'!'
/// alts: the | separated alternatives
/// rest: pattern after the closing )
fn match_extglob(
&self,
op: u8,
alts: &[String],
rest: &str,
value: &str,
nocase: bool,
depth: usize,
) -> bool {
// THREAT[TM-DOS-031]: Bail on excessive recursion depth
if depth >= Self::MAX_GLOB_DEPTH {
return false;
}
match op {
b'@' => {
// @(a|b) — exactly one of the alternatives
for alt in alts {
let full = format!("{}{}", alt, rest);
if self.glob_match_impl(value, &full, nocase, depth + 1) {
return true;
}
}
false
}
b'?' => {
// ?(a|b) — zero or one of the alternatives
// Try zero: skip the extglob entirely
if self.glob_match_impl(value, rest, nocase, depth + 1) {
return true;
}
// Try one
for alt in alts {
let full = format!("{}{}", alt, rest);
if self.glob_match_impl(value, &full, nocase, depth + 1) {
return true;
}
}
false
}
b'+' => {
// +(a|b) — one or more of the alternatives
for alt in alts {
let full = format!("{}{}", alt, rest);
if self.glob_match_impl(value, &full, nocase, depth + 1) {
return true;
}
// Try alt followed by more +(a|b)rest
// We need to try consuming `alt` prefix then matching +(...)rest again
for split in 1..=value.len() {
let prefix = &value[..split];
let suffix = &value[split..];
if self.glob_match_impl(prefix, alt, nocase, depth + 1) {
// Rebuild the extglob for the suffix
let inner = alts.join("|");
let re_pattern = format!("+({}){}", inner, rest);
if self.glob_match_impl(suffix, &re_pattern, nocase, depth + 1) {
return true;
}
}
}
}
false
}
b'*' => {
// *(a|b) — zero or more of the alternatives
// Try zero
if self.glob_match_impl(value, rest, nocase, depth + 1) {
return true;
}
// Try one or more (same as +(...))
for alt in alts {
let full = format!("{}{}", alt, rest);
if self.glob_match_impl(value, &full, nocase, depth + 1) {
return true;
}
for split in 1..=value.len() {
let prefix = &value[..split];
let suffix = &value[split..];
if self.glob_match_impl(prefix, alt, nocase, depth + 1) {
let inner = alts.join("|");
let re_pattern = format!("*({}){}", inner, rest);
if self.glob_match_impl(suffix, &re_pattern, nocase, depth + 1) {
return true;
}
}
}
}
false
}
b'!' => {
// !(a|b) — match anything except one of the alternatives
// Try every possible split point: prefix must NOT match any alt, rest matches
// Actually: !(pat) matches anything that doesn't match @(pat)
let inner = alts.join("|");
let positive = format!("@({}){}", inner, rest);
!self.glob_match_impl(value, &positive, nocase, depth + 1)
&& self.glob_match_impl(value, rest, nocase, depth + 1)
|| {
// !(pat) can also consume characters — try each split
for split in 1..=value.len() {
let prefix = &value[..split];
let suffix = &value[split..];
// prefix must not match any alt
let prefix_matches_any = alts
.iter()
.any(|a| self.glob_match_impl(prefix, a, nocase, depth + 1));
if !prefix_matches_any
&& self.glob_match_impl(suffix, rest, nocase, depth + 1)
{
return true;
}
}
false
}
}
_ => false,
}
}
/// Match a bracket expression [abc], [a-z], [!abc], [^abc]
/// Returns Some(true) if matched, Some(false) if not matched, None if invalid
pub(crate) fn match_bracket_expr(
&self,
pattern_chars: &mut std::iter::Peekable<std::str::Chars<'_>>,
value_char: char,
nocase: bool,
) -> Option<bool> {
let mut chars_in_class = Vec::new();
let mut negate = false;
// Check for negation
if matches!(pattern_chars.peek(), Some('!') | Some('^')) {
negate = true;
pattern_chars.next();
}
// Collect all characters in the bracket expression
loop {
match pattern_chars.next() {
Some(']') if !chars_in_class.is_empty() => break,
Some(']') if chars_in_class.is_empty() => {
// ] as first char is literal
chars_in_class.push(']');
}
Some('[') if matches!(pattern_chars.peek(), Some(':')) => {
// POSIX character class [:name:]
pattern_chars.next(); // consume ':'
let mut class_name = String::new();
loop {
match pattern_chars.next() {
Some(':') if matches!(pattern_chars.peek(), Some(']')) => {
pattern_chars.next(); // consume ']'
break;
}
Some(c) => class_name.push(c),
None => return None,
}
}
expand_posix_class(&class_name, &mut chars_in_class);
}
Some('-') if !chars_in_class.is_empty() => {
// Could be a range
if let Some(&next) = pattern_chars.peek() {
if next == ']' {
// - at end is literal
chars_in_class.push('-');
} else {
// Range: prev-next
pattern_chars.next();
if let Some(&prev) = chars_in_class.last() {
for c in prev..=next {
chars_in_class.push(c);
}
}
}
} else {
return None; // Unclosed bracket
}
}
Some(c) => chars_in_class.push(c),
None => return None, // Unclosed bracket
}
}
let matched = if nocase {
let lc = value_char.to_ascii_lowercase();
chars_in_class.iter().any(|&c| c.to_ascii_lowercase() == lc)
} else {
chars_in_class.contains(&value_char)
};
Some(if negate { !matched } else { matched })
}
// ── Glob option helpers ───────────────────────────────────────────
pub(crate) fn contains_glob_chars(&self, s: &str) -> bool {
s.contains('*') || s.contains('?') || s.contains('[')
}
/// Check if dotglob shopt is enabled
pub(crate) fn is_dotglob(&self) -> bool {
self.variables
.get("SHOPT_dotglob")
.map(|v| v == "1")
.unwrap_or(false)
}
/// Check if nocaseglob shopt is enabled
pub(crate) fn is_nocaseglob(&self) -> bool {
self.variables
.get("SHOPT_nocaseglob")
.map(|v| v == "1")
.unwrap_or(false)
}
/// Check if noglob (set -f) is enabled
pub(crate) fn is_noglob(&self) -> bool {
self.variables
.get("SHOPT_f")
.map(|v| v == "1")
.unwrap_or(false)
}
/// Check if failglob shopt is enabled
pub(crate) fn is_failglob(&self) -> bool {
self.variables
.get("SHOPT_failglob")
.map(|v| v == "1")
.unwrap_or(false)
}
/// Check if globstar shopt is enabled
pub(crate) fn is_globstar(&self) -> bool {
self.variables
.get("SHOPT_globstar")
.map(|v| v == "1")
.unwrap_or(false)
}
/// Check if extglob shopt is enabled
pub(crate) fn is_extglob(&self) -> bool {
self.variables
.get("SHOPT_extglob")
.map(|v| v == "1")
.unwrap_or(false)
}
// ── Glob expansion against filesystem ─────────────────────────────
/// Expand glob for a single item, applying noglob/failglob/nullglob.
/// Returns Err(pattern) if failglob triggers, Ok(items) otherwise.
pub(crate) async fn expand_glob_item(
&self,
item: &str,
) -> std::result::Result<Vec<String>, String> {
if !self.contains_glob_chars(item) || self.is_noglob() {
return Ok(vec![item.to_string()]);
}
let glob_matches = self.expand_glob(item).await.unwrap_or_default();
if glob_matches.is_empty() {
if self.is_failglob() {
return Err(item.to_string());
}
let nullglob = self
.variables
.get("SHOPT_nullglob")
.map(|v| v == "1")
.unwrap_or(false);
if nullglob {
Ok(vec![])
} else {
Ok(vec![item.to_string()])
}
} else {
Ok(glob_matches)
}
}
/// Expand a glob pattern against the filesystem
pub(crate) async fn expand_glob(&self, pattern: &str) -> Result<Vec<String>> {
// Check for ** (recursive glob) — only when globstar is enabled
if pattern.contains("**") && self.is_globstar() {
return self.expand_glob_recursive(pattern).await;
}
let mut matches = Vec::new();
let dotglob = self.is_dotglob();
let nocase = self.is_nocaseglob();
// Split pattern into directory and filename parts
let path = Path::new(pattern);
let (dir, file_pattern) = if path.is_absolute() {
let parent = path.parent().unwrap_or(Path::new("/"));
let name = path.file_name().map(|s| s.to_string_lossy().to_string());
(parent.to_path_buf(), name)
} else {
// Relative path - use cwd
let parent = path.parent();
let name = path.file_name().map(|s| s.to_string_lossy().to_string());
if let Some(p) = parent {
if p.as_os_str().is_empty() {
(self.cwd.clone(), name)
} else {
(self.cwd.join(p), name)
}
} else {
(self.cwd.clone(), name)
}
};
let file_pattern = match file_pattern {
Some(p) => p,
None => return Ok(matches),
};
// Check if the directory exists
if !self.fs.exists(&dir).await.unwrap_or(false) {
return Ok(matches);
}
// Read directory entries
let entries = match self.fs.read_dir(&dir).await {
Ok(e) => e,
Err(_) => return Ok(matches),
};
// Check if pattern explicitly starts with dot
let pattern_starts_with_dot = file_pattern.starts_with('.');
// Match each entry against the pattern
for entry in entries {
// Skip dotfiles unless dotglob is set or pattern explicitly starts with '.'
if entry.name.starts_with('.') && !dotglob && !pattern_starts_with_dot {
continue;
}
if self.glob_match_impl(&entry.name, &file_pattern, nocase, 0) {
// Construct the full path
let full_path = if path.is_absolute() {
dir.join(&entry.name).to_string_lossy().to_string()
} else {
// For relative patterns, return relative path
if let Some(parent) = path.parent() {
if parent.as_os_str().is_empty() {
entry.name.clone()
} else {
format!("{}/{}", parent.to_string_lossy(), entry.name)
}
} else {
entry.name.clone()
}
};
matches.push(full_path);
}
}
// Sort matches alphabetically (bash behavior)
matches.sort();
Ok(matches)
}
/// Expand a glob pattern containing ** (recursive directory matching).
async fn expand_glob_recursive(&self, pattern: &str) -> Result<Vec<String>> {
let is_absolute = pattern.starts_with('/');
let components: Vec<&str> = pattern.split('/').filter(|s| !s.is_empty()).collect();
let dotglob = self.is_dotglob();
let nocase = self.is_nocaseglob();
// Find the ** component
let star_star_idx = match components.iter().position(|&c| c == "**") {
Some(i) => i,
None => return Ok(Vec::new()),
};
// Build the base directory from components before **
let base_dir = if is_absolute {
let mut p = PathBuf::from("/");
for c in &components[..star_star_idx] {
p.push(c);
}
p
} else {
let mut p = self.cwd.clone();
for c in &components[..star_star_idx] {
p.push(c);
}
p
};
// Pattern components after **
let after_pattern: Vec<&str> = components[star_star_idx + 1..].to_vec();
// Collect all directories recursively (including the base)
let mut all_dirs = vec![base_dir.clone()];
// THREAT[TM-DOS-049]: Cap recursion depth using filesystem path depth limit
let max_depth = self.fs.limits().max_path_depth;
self.collect_dirs_recursive(&base_dir, &mut all_dirs, max_depth)
.await;
let mut matches = Vec::new();
for dir in &all_dirs {
if after_pattern.is_empty() {
// ** alone matches all files recursively
if let Ok(entries) = self.fs.read_dir(dir).await {
for entry in entries {
if entry.name.starts_with('.') && !dotglob {
continue;
}
if !entry.metadata.file_type.is_dir() {
matches.push(dir.join(&entry.name).to_string_lossy().to_string());
}
}
}
} else if after_pattern.len() == 1 {
// Single pattern after **: match files in this directory
let pat = after_pattern[0];
let pattern_starts_with_dot = pat.starts_with('.');
if let Ok(entries) = self.fs.read_dir(dir).await {
for entry in entries {
if entry.name.starts_with('.') && !dotglob && !pattern_starts_with_dot {
continue;
}
if self.glob_match_impl(&entry.name, pat, nocase, 0) {
matches.push(dir.join(&entry.name).to_string_lossy().to_string());
}
}
}
}
}
matches.sort();
Ok(matches)
}
/// Recursively collect all subdirectories starting from dir.
/// THREAT[TM-DOS-049]: `max_depth` caps recursion to prevent stack exhaustion.
pub(crate) fn collect_dirs_recursive<'a>(
&'a self,
dir: &'a Path,
result: &'a mut Vec<PathBuf>,
max_depth: usize,
) -> std::pin::Pin<Box<dyn std::future::Future<Output = ()> + Send + 'a>> {
Box::pin(async move {
if max_depth == 0 {
return;
}
if let Ok(entries) = self.fs.read_dir(dir).await {
for entry in entries {
if entry.metadata.file_type.is_dir() {
let subdir = dir.join(&entry.name);
result.push(subdir.clone());
self.collect_dirs_recursive(&subdir, result, max_depth - 1)
.await;
}
}
}
})
}
}