use crate::filters::network::{
FilterPart, NetworkFilter, NetworkFilterMask, NetworkFilterMaskHelper,
};
use itertools::*;
use std::collections::HashMap;
trait Optimization {
fn fusion(&self, filters: &[NetworkFilter]) -> NetworkFilter;
fn group_by_criteria(&self, filter: &NetworkFilter) -> String;
fn select(&self, filter: &NetworkFilter) -> bool;
}
pub fn is_filter_optimizable_by_patterns(filter: &NetworkFilter) -> bool {
filter.opt_domains.is_none()
&& filter.opt_not_domains.is_none()
&& !filter.is_hostname_anchor()
&& !filter.is_redirect()
&& !filter.is_csp()
}
pub fn optimize(filters: Vec<NetworkFilter>) -> Vec<NetworkFilter> {
let mut optimized: Vec<NetworkFilter> = Vec::new();
let simple_pattern_group = SimplePatternGroup {};
let (fused, unfused) = apply_optimisation(&simple_pattern_group, filters);
optimized.extend(fused);
optimized.extend(unfused);
optimized.sort_by_key(|f| f.id);
optimized
}
fn apply_optimisation<T: Optimization>(
optimization: &T,
filters: Vec<NetworkFilter>,
) -> (Vec<NetworkFilter>, Vec<NetworkFilter>) {
let (positive, mut negative): (Vec<NetworkFilter>, Vec<NetworkFilter>) =
filters.into_iter().partition_map(|f| {
if optimization.select(&f) {
Either::Left(f)
} else {
Either::Right(f)
}
});
let mut to_fuse: HashMap<String, Vec<NetworkFilter>> = HashMap::with_capacity(positive.len());
positive
.into_iter()
.for_each(|f| insert_dup(&mut to_fuse, optimization.group_by_criteria(&f), f));
let mut fused = Vec::with_capacity(to_fuse.len());
for (_, group) in to_fuse {
if group.len() > 1 {
fused.push(optimization.fusion(group.as_slice()));
} else {
group.into_iter().for_each(|f| negative.push(f));
}
}
fused.shrink_to_fit();
(fused, negative)
}
fn insert_dup<K, V>(map: &mut HashMap<K, Vec<V>>, k: K, v: V)
where
K: std::cmp::Ord + std::hash::Hash,
{
map.entry(k).or_default().push(v)
}
struct SimplePatternGroup {}
impl Optimization for SimplePatternGroup {
fn fusion(&self, filters: &[NetworkFilter]) -> NetworkFilter {
let base_filter = &filters[0]; let mut filter = base_filter.clone();
if filters
.iter()
.any(|f| matches!(f.filter, FilterPart::Empty))
{
filter.filter = FilterPart::Empty
} else {
let mut flat_patterns: Vec<String> = Vec::with_capacity(filters.len());
for f in filters {
match &f.filter {
FilterPart::Empty => (),
FilterPart::Simple(s) => flat_patterns.push(s.clone()),
FilterPart::AnyOf(s) => flat_patterns.extend_from_slice(s),
}
}
if flat_patterns.is_empty() {
filter.filter = FilterPart::Empty;
} else if flat_patterns.len() == 1 {
filter.filter = FilterPart::Simple(flat_patterns[0].clone())
} else {
filter.filter = FilterPart::AnyOf(flat_patterns)
}
}
let is_regex = filters.iter().any(NetworkFilter::is_regex);
filter.mask.set(NetworkFilterMask::IS_REGEX, is_regex);
let is_complete_regex = filters.iter().any(|f| f.is_complete_regex());
filter
.mask
.set(NetworkFilterMask::IS_COMPLETE_REGEX, is_complete_regex);
if base_filter.raw_line.is_some() {
filter.raw_line = Some(Box::new(
filters
.iter()
.flat_map(|f| f.raw_line.clone())
.join(" <+> "),
))
}
filter
}
fn group_by_criteria(&self, filter: &NetworkFilter) -> String {
format!("{:b}:{:?}", filter.mask, filter.is_complete_regex())
}
fn select(&self, filter: &NetworkFilter) -> bool {
is_filter_optimizable_by_patterns(filter)
}
}
#[cfg(test)]
#[path = "../tests/unit/optimizer.rs"]
mod unit_tests;