//! Check if a reduction makes file smaller, and keep best reductions. //! Works asynchronously when possible use crate::atomicmin::AtomicMin; use crate::deflate; use crate::png::PngData; use crate::png::PngImage; use crate::png::STD_COMPRESSION; use crate::png::STD_FILTERS; use crate::png::STD_STRATEGY; use crate::png::STD_WINDOW; #[cfg(not(feature = "parallel"))] use crate::rayon; use crate::Deadline; #[cfg(feature = "parallel")] use rayon; use rayon::prelude::*; use std::sync::atomic::AtomicUsize; use std::sync::atomic::Ordering::SeqCst; use std::sync::mpsc::*; use std::sync::Arc; use std::thread; struct Candidate { image: PngData, filter: u8, // first wins tie-breaker nth: usize, } impl Candidate { fn cmp_key(&self) -> impl Ord { ( self.image.idat_data.len(), self.image.raw.data.len(), self.image.raw.ihdr.bit_depth, self.filter, self.nth, ) } } /// Collect image versions and pick one that compresses best pub(crate) struct Evaluator { deadline: Arc, nth: AtomicUsize, best_candidate_size: Arc, /// images are sent to the thread for evaluation eval_send: SyncSender, // the thread helps evaluate images asynchronously eval_thread: thread::JoinHandle>, } impl Evaluator { pub fn new(deadline: Arc) -> Self { let (tx, rx) = sync_channel(4); Self { deadline, best_candidate_size: Arc::new(AtomicMin::new(None)), nth: AtomicUsize::new(0), eval_send: tx, eval_thread: thread::spawn(move || rx.into_iter().min_by_key(Candidate::cmp_key)), } } /// Wait for all evaluations to finish and return smallest reduction /// Or `None` if all reductions were worse than baseline. fn get_best_candidate(self) -> Option { drop(self.eval_send); // disconnect the sender, breaking the loop in the thread self.eval_thread.join().expect("eval thread") } pub fn get_result(self) -> Option { self.get_best_candidate().map(|candidate| candidate.image) } /// Set baseline image. It will be used only to measure minimum compression level required pub fn set_baseline(&self, image: Arc) { self.try_image_inner(image, false) } /// Check if the image is smaller than others pub fn try_image(&self, image: Arc) { self.try_image_inner(image, true) } fn try_image_inner(&self, image: Arc, is_reduction: bool) { let nth = self.nth.fetch_add(1, SeqCst); // These clones are only cheap refcounts let deadline = self.deadline.clone(); let best_candidate_size = self.best_candidate_size.clone(); // sends it off asynchronously for compression, // but results will be collected via the message queue let eval_send = self.eval_send.clone(); rayon::spawn(move || { let filters_iter = STD_FILTERS.par_iter().with_max_len(1); // Updating of best result inside the parallel loop would require locks, // which are dangerous to do in side Rayon's loop. // Instead, only update (atomic) best size in real time, // and the best result later without need for locks. filters_iter.for_each(|&filter| { if deadline.passed() { return; } if let Ok(idat_data) = deflate::deflate( &image.filter_image(filter), STD_COMPRESSION, STD_STRATEGY, STD_WINDOW, &best_candidate_size, &deadline, ) { best_candidate_size.set_min(idat_data.len()); // ignore baseline images after this point if !is_reduction { return; } // the rest is shipped to the evavluation/collection thread let new = Candidate { image: PngData { idat_data, raw: Arc::clone(&image), }, filter, nth, }; eval_send.send(new).expect("send"); } }); }); } }