lingxia-lxapp 0.6.0

LxApp (lightweight application) container and runtime for LingXia framework
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
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
use std::fs;
use std::hash::{Hash, Hasher};
use std::path::{Path, PathBuf};
use std::sync::{Arc, Mutex};
use std::time::{Duration, Instant, SystemTime, UNIX_EPOCH};

use filetime::FileTime;
use rong_rt::download::{self as net, BodySink};
use thiserror::Error;
use tokio::sync::mpsc;

type HashId = String;

pub(crate) const LXAPP_WEBVIEW_CACHE_DIR: &str = ".webview-cache";

struct CacheDownloadSink {
    final_path: PathBuf,
    key_id: String,
    lock_path: PathBuf,
    capacity: Option<Arc<CacheCapacityManager>>,
}

impl CacheDownloadSink {
    fn new(
        final_path: PathBuf,
        key_id: String,
        lock_path: PathBuf,
        capacity: Option<Arc<CacheCapacityManager>>,
    ) -> Self {
        Self {
            final_path,
            key_id,
            lock_path,
            capacity,
        }
    }
}

impl BodySink for CacheDownloadSink {
    fn write(&mut self, _chunk: &[u8]) -> Result<(), String> {
        Ok(())
    }

    fn close(&mut self, result: &Result<(), String>) {
        match result {
            Ok(()) => {
                let _ = fs::write(ok_marker_path(&self.final_path, &self.key_id), b"ok");
                if let Some(capacity) = self.capacity.as_ref() {
                    capacity.on_cache_access(&self.final_path);
                }
            }
            Err(_) => {
                let _ = fs::remove_file(ok_marker_path(&self.final_path, &self.key_id));
            }
        }
        let _ = fs::remove_file(&self.lock_path);
    }
}

struct CacheDownloadSinkWithCallback<F: FnOnce(CacheResult) + Send> {
    final_path: PathBuf,
    key_id: String,
    lock_path: PathBuf,
    capacity: Option<Arc<CacheCapacityManager>>,
    callback: Arc<Mutex<Option<F>>>,
}

impl<F: FnOnce(CacheResult) + Send> CacheDownloadSinkWithCallback<F> {
    fn new(
        final_path: PathBuf,
        key_id: String,
        lock_path: PathBuf,
        capacity: Option<Arc<CacheCapacityManager>>,
        callback: Arc<Mutex<Option<F>>>,
    ) -> Self {
        Self {
            final_path,
            key_id,
            lock_path,
            capacity,
            callback,
        }
    }
}

impl<F: FnOnce(CacheResult) + Send> BodySink for CacheDownloadSinkWithCallback<F> {
    fn write(&mut self, _chunk: &[u8]) -> Result<(), String> {
        Ok(())
    }

    fn close(&mut self, result: &Result<(), String>) {
        match result {
            Ok(()) => {
                let _ = fs::write(ok_marker_path(&self.final_path, &self.key_id), b"ok");
                if let Some(capacity) = self.capacity.as_ref() {
                    capacity.on_cache_access(&self.final_path);
                }
                if let Some(cb) = self.callback.lock().unwrap().take() {
                    cb(CacheResult::Ready);
                }
            }
            Err(err) => {
                let _ = fs::remove_file(ok_marker_path(&self.final_path, &self.key_id));
                if let Some(cb) = self.callback.lock().unwrap().take() {
                    cb(CacheResult::Failed(err.clone()));
                }
            }
        }
        let _ = fs::remove_file(&self.lock_path);
    }
}

/// Lightweight cache for LxApp resources.
///
/// Only tracks in-flight operations; completed files are discovered via the filesystem.
pub struct LxAppCache {
    cache_dir: PathBuf,
    capacity: Arc<CacheCapacityManager>,
}

impl LxAppCache {
    /// Create a cache rooted at `cache_dir`.
    pub(crate) fn new(
        cache_dir: PathBuf,
        max_bytes: u64,
        max_age: Duration,
        min_check_interval: Duration,
    ) -> Result<Self, CacheError> {
        // Assume LxApp already prepared cache_dir; do not create extra directories here.
        Ok(Self {
            capacity: Arc::new(CacheCapacityManager::new(
                cache_dir.clone(),
                max_bytes,
                max_age,
                min_check_interval,
            )),
            cache_dir,
        })
    }

    pub fn on_access(&self, path: &Path) {
        if !path.starts_with(&self.cache_dir) {
            return;
        }
        self.capacity.on_cache_access(path);
    }

    /// Request a cached file; start download in background if missing.
    ///
    /// Returns the intended final file path immediately (with an extension derived
    /// from the URL). If the file isn't available yet, a background task begins
    /// downloading it via the existing async runtime. A sidecar marker `<hash>.ok`
    /// is written on success to distinguish complete files from partial ones.
    pub fn get_or_download<K: Hash + ?Sized>(&self, key: &K, url: &str) -> PathBuf {
        let hash_id = hash_key(key);
        let ext = url_path_ext(url).unwrap_or("bin");
        let target_path = self.cache_dir.join(format!("{hash_id}.{}", ext));

        // If already completed and present, return immediately.
        if self.ok_marker_exists(&hash_id) && target_path.exists() {
            self.capacity.on_cache_access(&target_path);
            return target_path;
        }

        // file-based lock: <hash>.lock indicates a download in progress
        let lock_path = self.cache_dir.join(format!("{}.lock", hash_id));
        let should_spawn = fs::OpenOptions::new()
            .write(true)
            .create_new(true)
            .open(&lock_path)
            .is_ok();

        if should_spawn {
            let final_path = target_path.clone();
            let key_id = hash_id.clone();
            let lock_path_cloned = lock_path.clone();
            let url_owned = url.to_string();
            let capacity = self.capacity.clone();

            let sink = CacheDownloadSink::new(
                final_path.clone(),
                key_id.clone(),
                lock_path_cloned.clone(),
                Some(capacity),
            );
            match net::request_download(url_owned, final_path.clone(), None, Some(Box::new(sink))) {
                Ok(_rx) => {}
                Err(_) => {
                    let _ = fs::remove_file(lock_path);
                }
            }
        }
        self.capacity.enqueue_access_check();

        target_path
    }

    /// Try to resolve an existing path for `key`; returns None if not present.
    fn try_resolve<K: Hash + ?Sized>(&self, key: &K) -> Option<PathBuf> {
        let hash_id = hash_key(key);
        // If we have a complete marker, try to locate a file with any extension
        if self.ok_marker_exists(&hash_id)
            && let Ok(entries) = fs::read_dir(&self.cache_dir)
        {
            for entry in entries.flatten() {
                if let Some(name) = entry.file_name().to_str() {
                    // Ignore cache bookkeeping files
                    if !name.starts_with(&hash_id) {
                        continue;
                    }
                    if name.ends_with(".ok") || name.ends_with(".lock") || name.ends_with(".part") {
                        continue;
                    }
                    // Only return regular files
                    if entry.file_type().map(|t| t.is_file()).unwrap_or(false) {
                        return Some(entry.path());
                    }
                }
            }
        }
        // Fall back to first match without requiring OK marker (e.g., media copies)
        let base = self.cache_dir.join(&hash_id);
        if base.exists() {
            return Some(base);
        }
        if let Ok(entries) = fs::read_dir(&self.cache_dir) {
            for entry in entries.flatten() {
                if let Some(name) = entry.file_name().to_str() {
                    if !name.starts_with(&hash_id) {
                        continue;
                    }
                    if name.ends_with(".ok") || name.ends_with(".lock") || name.ends_with(".part") {
                        continue;
                    }
                    if entry.file_type().map(|t| t.is_file()).unwrap_or(false) {
                        return Some(entry.path());
                    }
                }
            }
        }
        None
    }

    /// Compute the canonical target path for a given key and extension.
    fn target_path_for_ext<K: Hash + ?Sized>(&self, key: &K, ext: &str) -> PathBuf {
        let hash_id = hash_key(key);
        if ext.is_empty() {
            self.cache_dir.join(&hash_id)
        } else {
            self.cache_dir.join(format!("{hash_id}.{}", ext))
        }
    }

    /// Resolve a cache path for `key` with desired extension.
    /// - Exists(path): a cached file already exists.
    /// - NonExists(path): caller may write the file to this path.
    pub fn resolve_path_with_ext<K: Hash + ?Sized>(&self, key: &K, ext: &str) -> ResolveResult {
        // Fast path: if the caller knows the expected extension (common for https resources),
        // avoid scanning the whole cache directory.
        let hash_id = hash_key(key);
        let candidate = self.target_path_for_ext(key, ext);

        if self.ok_marker_exists(&hash_id) && candidate.exists() {
            return ResolveResult::Exists(candidate);
        }

        // Fallback to legacy resolution (supports extension mismatch / media copies).
        if let Some(p) = self.try_resolve(key) {
            ResolveResult::Exists(p)
        } else {
            ResolveResult::NonExists(candidate)
        }
    }

    // media: use resolve_path_with_ext and copy when NonExists
    // cleanup removed; add if needed later
}

impl LxAppCache {
    /// Request download with a completion callback.
    /// The callback fires once when the download succeeds or fails.
    pub fn get_or_download_with_callback<K, F>(&self, key: &K, url: &str, on_complete: F) -> PathBuf
    where
        K: Hash + ?Sized,
        F: FnOnce(CacheResult) + Send + 'static,
    {
        use std::time::Duration;

        let hash_id = hash_key(key);
        let ext = url_path_ext(url).unwrap_or("bin");
        let target_path = self.cache_dir.join(format!("{hash_id}.{}", ext));

        // Already complete? Call callback immediately.
        if self.ok_marker_exists(&hash_id) && target_path.exists() {
            self.capacity.on_cache_access(&target_path);
            on_complete(CacheResult::Ready);
            return target_path;
        }

        let lock_path = self.cache_dir.join(format!("{}.lock", hash_id));
        let acquired = fs::OpenOptions::new()
            .write(true)
            .create_new(true)
            .open(&lock_path)
            .is_ok();

        if acquired {
            let final_path = target_path.clone();
            let key_id = hash_id.clone();
            let lock_path_cloned = lock_path.clone();
            let url_owned = url.to_string();
            let capacity = self.capacity.clone();

            // Share callback so we can invoke it either from the net runtime or on immediate error
            let cb_shared: Arc<Mutex<Option<F>>> = Arc::new(Mutex::new(Some(on_complete)));

            let sink = CacheDownloadSinkWithCallback::new(
                final_path.clone(),
                key_id.clone(),
                lock_path_cloned.clone(),
                Some(capacity),
                cb_shared.clone(),
            );
            match net::request_download(url_owned, final_path.clone(), None, Some(Box::new(sink))) {
                Ok(_rx) => {}
                Err(e) => {
                    let _ = fs::remove_file(lock_path);
                    if let Some(cb) = cb_shared.lock().unwrap().take() {
                        cb(CacheResult::Failed(e));
                    }
                }
            }
        } else {
            // Someone else is downloading; watch for completion and then fire callback
            let final_path = target_path.clone();
            let key_id = hash_id.clone();
            let lock_path_cloned = lock_path.clone();

            let task = async move {
                use tokio::time::sleep;

                loop {
                    let success = ok_marker_path(&final_path, &key_id).exists();
                    let in_progress = lock_path_cloned.exists();
                    if success {
                        on_complete(CacheResult::Ready);
                        break;
                    }
                    if !in_progress {
                        // Not in progress and no success marker -> treat as failure
                        on_complete(CacheResult::Failed("download not completed".to_string()));
                        break;
                    }
                    sleep(Duration::from_millis(200)).await;
                }
            };
            let _ = crate::executor::spawn(task);
        }
        self.capacity.enqueue_access_check();

        target_path
    }
}

fn url_path_ext(url: &str) -> Option<&str> {
    // crude parse: strip query/fragment, take suffix after last '.' if short and sane
    let path = url.split(&['?', '#'][..]).next().unwrap_or(url);
    let seg = path.rsplit('/').next().unwrap_or(path);
    let dot = seg.rfind('.')?;
    let ext = &seg[dot + 1..];
    if !ext.is_empty() && ext.len() <= 8 {
        Some(ext)
    } else {
        None
    }
}

fn ok_marker_path(final_path: &Path, hash_id: &str) -> PathBuf {
    // place marker alongside cache root: <cache_dir>/<hash>.ok
    let dir = final_path.parent().unwrap_or_else(|| Path::new("."));
    dir.join(format!("{}.ok", hash_id))
}

impl LxAppCache {
    fn ok_marker_exists(&self, hash_id: &str) -> bool {
        self.cache_dir.join(format!("{}.ok", hash_id)).exists()
    }
}

#[derive(Debug, Clone)]
pub enum CacheResult {
    Ready,
    Failed(String),
}

#[derive(Debug, Clone)]
pub enum ResolveResult {
    Exists(PathBuf),
    NonExists(PathBuf),
}

#[derive(Debug, Error)]
pub enum CacheError {
    #[error(transparent)]
    Io(#[from] std::io::Error),
}

fn hash_key<K: Hash + ?Sized>(key: &K) -> HashId {
    // Stable 64-bit FNV-1a hasher for deterministic IDs across runs.
    let mut hasher = Fnv64Hasher::new();
    key.hash(&mut hasher);
    format!("{:016x}", hasher.finish())
}

#[derive(Default)]
struct Fnv64Hasher(u64);

impl Fnv64Hasher {
    fn new() -> Self {
        // 64-bit FNV-1a offset basis
        Self(0xcbf29ce484222325)
    }
}

impl Hasher for Fnv64Hasher {
    fn finish(&self) -> u64 {
        self.0
    }

    fn write(&mut self, bytes: &[u8]) {
        // 64-bit FNV-1a prime
        const FNV_PRIME: u64 = 0x00000100000001B3;
        let mut hash = self.0;
        for &b in bytes {
            hash ^= u64::from(b);
            hash = hash.wrapping_mul(FNV_PRIME);
        }
        self.0 = hash;
    }
}

pub fn touch_access_time(path: &Path) {
    let now = FileTime::now();
    let _ = filetime::set_file_atime(path, now);
}

struct CacheEntry {
    path: PathBuf,
    size: u64,
    last_access: SystemTime,
}

pub struct CacheCapacityManager {
    cache_dir: PathBuf,
    max_bytes: u64,
    max_age: Duration,
    min_check_interval: Duration,
    worker: Mutex<Option<CacheCapacityWorker>>,
}

struct CacheCapacityWorker {
    tx: mpsc::Sender<CacheCapacityEvent>,
}

enum CacheCapacityEvent {
    Access,
    Shutdown,
}

impl CacheCapacityManager {
    pub fn new(
        cache_dir: PathBuf,
        max_bytes: u64,
        max_age: Duration,
        min_check_interval: Duration,
    ) -> Self {
        Self {
            cache_dir,
            max_bytes,
            max_age,
            min_check_interval,
            worker: Mutex::new(None),
        }
    }

    pub fn on_cache_access(&self, path: &Path) {
        if path.exists() {
            touch_access_time(path);
        }
        self.enqueue_access_check();
    }

    pub fn shutdown(&self) {
        let worker = self.worker.lock().ok().and_then(|mut worker| worker.take());
        if let Some(worker) = worker {
            // If the queue is full, dropping the sender still closes the channel
            // and lets the worker task exit once pending events are drained.
            let _ = worker.tx.try_send(CacheCapacityEvent::Shutdown);
        }
    }

    pub fn enqueue_access_check(&self) {
        if self.max_bytes == 0 && self.max_age.is_zero() {
            return;
        }

        let Some(tx) = self.ensure_worker_sender() else {
            return;
        };

        match tx.try_send(CacheCapacityEvent::Access) {
            Ok(()) => {}
            Err(mpsc::error::TrySendError::Full(_)) => {}
            Err(mpsc::error::TrySendError::Closed(_)) => {
                self.worker.lock().unwrap().take();
                if let Some(retry_tx) = self.ensure_worker_sender() {
                    let _ = retry_tx.try_send(CacheCapacityEvent::Access);
                }
            }
        }
    }

    fn ensure_worker_sender(&self) -> Option<mpsc::Sender<CacheCapacityEvent>> {
        let mut worker = self.worker.lock().unwrap();
        if let Some(worker) = worker.as_ref() {
            return Some(worker.tx.clone());
        }

        let (tx, rx) = mpsc::channel(32);
        let cache_dir = self.cache_dir.clone();
        let max_bytes = self.max_bytes;
        let max_age = self.max_age;
        let min_check_interval = self.min_check_interval;

        let _ = crate::executor::spawn(async move {
            run_cache_capacity_worker(cache_dir, max_bytes, max_age, min_check_interval, rx).await;
        });
        // Send initial access event so cleanup runs once at startup
        let _ = tx.try_send(CacheCapacityEvent::Access);
        *worker = Some(CacheCapacityWorker { tx: tx.clone() });
        Some(tx)
    }
}

impl Drop for CacheCapacityManager {
    fn drop(&mut self) {
        self.shutdown();
    }
}

async fn run_cache_capacity_worker(
    cache_dir: PathBuf,
    max_bytes: u64,
    max_age: Duration,
    min_check_interval: Duration,
    mut rx: mpsc::Receiver<CacheCapacityEvent>,
) {
    let mut last_check: Option<Instant> = None;

    while let Some(event) = rx.recv().await {
        match event {
            CacheCapacityEvent::Shutdown => break,
            CacheCapacityEvent::Access => {
                let now = Instant::now();
                if let Some(prev) = last_check
                    && now.duration_since(prev) < min_check_interval
                {
                    continue;
                }
                last_check = Some(now);

                let cache_dir_clone = cache_dir.clone();
                let blocking = crate::executor::spawn_blocking(move || {
                    enforce_cache_limits(&cache_dir_clone, max_bytes, max_age)
                });

                match blocking.await {
                    Ok(outcome) => {
                        if outcome.files_removed > 0 {
                            crate::info!(
                                "Cache cleanup: removed {} files, freed {} bytes (limit={} bytes, max_age={}s)",
                                outcome.files_removed,
                                outcome.bytes_freed,
                                max_bytes,
                                max_age.as_secs()
                            );
                        }
                    }
                    Err(e) => {
                        crate::error!("Cache cleanup task failed: {}", e);
                    }
                }
            }
        }
    }
}

struct CapacityCleanupOutcome {
    files_removed: u32,
    bytes_freed: u64,
}

fn enforce_cache_limits(
    cache_dir: &Path,
    max_bytes: u64,
    max_age: Duration,
) -> CapacityCleanupOutcome {
    enforce_cache_limits_keep(cache_dir, max_bytes, max_age, None)
}

fn enforce_cache_limits_keep(
    cache_dir: &Path,
    max_bytes: u64,
    max_age: Duration,
    keep: Option<&Path>,
) -> CapacityCleanupOutcome {
    let mut outcome = CapacityCleanupOutcome {
        files_removed: 0,
        bytes_freed: 0,
    };

    let cache_root = cache_dir
        .canonicalize()
        .unwrap_or_else(|_| cache_dir.to_path_buf());

    let mut total_bytes = 0u64;
    let mut entries = collect_cache_entries(cache_dir, &mut total_bytes);
    let keep = keep.and_then(|path| path.canonicalize().ok());

    // First pass: remove files older than max_age
    if !max_age.is_zero() {
        let now = SystemTime::now();
        entries.retain(|entry| {
            let age = now
                .duration_since(entry.last_access)
                .unwrap_or(Duration::ZERO);
            if age > max_age {
                if keep
                    .as_ref()
                    .is_some_and(|keep| entry.path.canonicalize().is_ok_and(|path| path == *keep))
                {
                    return true;
                }
                if try_remove_cache_entry(cache_dir, &cache_root, &entry.path) {
                    total_bytes = total_bytes.saturating_sub(entry.size);
                    outcome.files_removed += 1;
                    outcome.bytes_freed = outcome.bytes_freed.saturating_add(entry.size);
                }
                false // remove from entries list
            } else {
                true // keep for potential LRU pass
            }
        });
    }

    // Second pass: LRU eviction if still over capacity
    if max_bytes > 0 && total_bytes > max_bytes {
        entries.sort_by_key(|entry| entry.last_access);

        for entry in entries {
            if total_bytes <= max_bytes {
                break;
            }

            if keep
                .as_ref()
                .is_some_and(|keep| entry.path.canonicalize().is_ok_and(|path| path == *keep))
            {
                continue;
            }
            if try_remove_cache_entry(cache_dir, &cache_root, &entry.path) {
                total_bytes = total_bytes.saturating_sub(entry.size);
                outcome.files_removed += 1;
                outcome.bytes_freed = outcome.bytes_freed.saturating_add(entry.size);
            }
        }
    }

    outcome
}

pub fn cleanup_cache_dir(cache_dir: &Path, max_bytes: u64, max_age: Duration) {
    lingxia_service::storage::cleanup_cache_dir(cache_dir, max_bytes, max_age);
}

pub fn cleanup_cache_dir_keep(
    cache_dir: &Path,
    max_bytes: u64,
    max_age: Duration,
    keep: Option<&Path>,
) {
    lingxia_service::storage::cleanup_cache_dir_preserving(cache_dir, max_bytes, max_age, keep);
}

pub fn cleanup_all_cache_dirs(cache_dir: &Path, max_bytes: u64, max_age: Duration) {
    lingxia_service::storage::cleanup_all_cache_dirs(cache_dir, max_bytes, max_age);
}

pub fn cleanup_all_cache_dirs_keep(
    cache_dir: &Path,
    max_bytes: u64,
    max_age: Duration,
    keep: Option<&Path>,
) {
    lingxia_service::storage::cleanup_all_cache_dirs_preserving(
        cache_dir, max_bytes, max_age, keep,
    );
}

pub fn cleanup_cache_for_storage_pressure(
    cache_dir: &Path,
    user_data_root: &Path,
    user_cache_root: &Path,
    destination: &Path,
    incoming_bytes: u64,
    max_bytes: u64,
) -> bool {
    lingxia_service::storage::cleanup_cache_for_storage_pressure(
        cache_dir,
        user_data_root,
        user_cache_root,
        destination,
        incoming_bytes,
        max_bytes,
    )
}

pub fn cleanup_cache_for_storage_pressure_keep(
    cache_dir: &Path,
    user_data_root: &Path,
    user_cache_root: &Path,
    destination: &Path,
    incoming_bytes: u64,
    max_bytes: u64,
    keep: Option<&Path>,
) -> bool {
    lingxia_service::storage::cleanup_cache_for_storage_pressure_preserving(
        cache_dir,
        user_data_root,
        user_cache_root,
        destination,
        incoming_bytes,
        max_bytes,
        keep,
    )
}

fn collect_cache_entries(cache_dir: &Path, total_bytes: &mut u64) -> Vec<CacheEntry> {
    let mut out = Vec::new();
    let mut pending_dirs = vec![cache_dir.to_path_buf()];

    while let Some(dir) = pending_dirs.pop() {
        let Ok(entries) = fs::read_dir(&dir) else {
            continue;
        };

        for entry in entries.flatten() {
            let path = entry.path();
            let Ok(file_type) = entry.file_type() else {
                continue;
            };

            // Never recurse into symlink directories.
            if file_type.is_symlink() {
                continue;
            }
            if file_type.is_dir() {
                pending_dirs.push(path);
                continue;
            }
            if !file_type.is_file() {
                continue;
            }

            let Some(filename) = path.file_name().and_then(|n| n.to_str()) else {
                continue;
            };
            let protected_name = should_skip_cleanup(filename);

            let Ok(metadata) = path.metadata() else {
                continue;
            };
            let size = metadata.len();
            *total_bytes = total_bytes.saturating_add(size);

            // Keep marker files and lock-associated files in total usage accounting,
            // but never evict them directly while protected by an active lock.
            if protected_name || filename.ends_with(".ok") || has_active_lock_for(&path) {
                continue;
            }

            let last_access = metadata
                .accessed()
                .or_else(|_| metadata.modified())
                .unwrap_or(UNIX_EPOCH);

            out.push(CacheEntry {
                path,
                size,
                last_access,
            });
        }
    }

    out
}

fn remove_ok_marker_for(_cache_dir: &Path, data_path: &Path) {
    let Some(parent) = data_path.parent() else {
        return;
    };
    if let Some(stem) = data_path.file_stem().and_then(|s| s.to_str()) {
        let _ = fs::remove_file(parent.join(format!("{}.ok", stem)));
    }
}

fn try_remove_cache_entry(cache_dir: &Path, cache_root: &Path, data_path: &Path) -> bool {
    if !is_path_within_root(cache_root, data_path) {
        crate::warn!(
            "Skip cache cleanup outside root: root={}, path={}",
            cache_root.display(),
            data_path.display()
        );
        return false;
    }
    if fs::remove_file(data_path).is_err() {
        return false;
    }
    remove_ok_marker_for(cache_dir, data_path);
    remove_empty_parent_dirs(cache_dir, data_path);
    true
}

fn is_path_within_root(cache_root: &Path, data_path: &Path) -> bool {
    data_path
        .canonicalize()
        .map(|p| p.starts_with(cache_root))
        .unwrap_or(false)
}

fn has_active_lock_for(data_path: &Path) -> bool {
    let Some(stem) = data_path.file_stem().and_then(|s| s.to_str()) else {
        return false;
    };
    let dir = data_path.parent().unwrap_or_else(|| Path::new("."));
    dir.join(format!("{}.lock", stem)).exists()
}

fn remove_empty_parent_dirs(cache_root: &Path, data_path: &Path) {
    let mut current = data_path.parent();
    while let Some(dir) = current {
        if dir == cache_root {
            break;
        }
        if !dir.starts_with(cache_root) {
            break;
        }
        if fs::remove_dir(dir).is_ok() {
            current = dir.parent();
        } else {
            break;
        }
    }
}

fn should_skip_cleanup(filename: &str) -> bool {
    filename.ends_with(".lock") || filename.ends_with(".part")
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn cache_size_cleanup_removes_cache_files() {
        let temp = tempfile::tempdir().expect("tempdir");
        let cache_dir = temp.path();
        let cache_file = cache_dir.join("cache.bin");
        fs::write(&cache_file, vec![1; 8]).expect("cache file");

        let mut total_bytes = 0;
        let _ = collect_cache_entries(cache_dir, &mut total_bytes);
        assert_eq!(total_bytes, 8);

        cleanup_cache_dir(cache_dir, 1, Duration::ZERO);

        assert!(!cache_file.exists());
    }

    #[test]
    fn storage_pressure_cleanup_removes_usercache_until_storage_fits() {
        let temp = tempfile::tempdir().expect("tempdir");
        let lingxia_dir = temp.path().join("lingxia");
        let cache_dir = lingxia_dir.join("usercache").join("app1");
        let other_cache_dir = lingxia_dir.join("usercache").join("app2");
        let destination = lingxia_dir.join("userdata").join("app1").join("saved.bin");
        fs::create_dir_all(&cache_dir).expect("cache dir");
        fs::create_dir_all(&other_cache_dir).expect("other cache dir");
        fs::create_dir_all(destination.parent().unwrap()).expect("userdata dir");
        let cache_file = cache_dir.join("cache.bin");
        let other_cache_file = other_cache_dir.join("other-cache.bin");
        fs::write(&cache_file, vec![1; 10]).expect("cache file");
        fs::write(&other_cache_file, vec![1; 10]).expect("other cache file");

        assert!(cleanup_cache_for_storage_pressure(
            &cache_dir,
            &lingxia_dir.join("userdata"),
            &lingxia_dir.join("usercache"),
            &destination,
            0,
            5,
        ));

        assert!(!cache_file.exists());
        assert!(!other_cache_file.exists());
    }
}