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
use crate::{ adapter::{Adapter, Filter}, model::Model, Result, }; use async_trait::async_trait; use indexmap::IndexSet; #[derive(Default)] pub struct MemoryAdapter { policy: IndexSet<Vec<String>>, is_filtered: bool, } #[async_trait] impl Adapter for MemoryAdapter { async fn load_policy(&self, m: &mut dyn Model) -> Result<()> { for line in self.policy.iter() { let sec = &line[0]; let ptype = &line[1]; let rule = line[1..].to_vec().clone(); if let Some(t1) = m.get_mut_model().get_mut(sec) { if let Some(t2) = t1.get_mut(ptype) { t2.get_mut_policy().insert(rule); } } } Ok(()) } async fn load_filtered_policy<'a>(&mut self, m: &mut dyn Model, f: Filter<'a>) -> Result<()> { for line in self.policy.iter() { let sec = &line[0]; let ptype = &line[1]; let rule = line[1..].to_vec().clone(); let mut is_filtered = false; if sec == "p" { for (i, r) in f.p.iter().enumerate() { if !r.is_empty() && r != &rule[i + 1] { is_filtered = true; } } } if sec == "g" { for (i, r) in f.g.iter().enumerate() { if !r.is_empty() && r != &rule[i + 1] { is_filtered = true; } } } if !is_filtered { if let Some(ast_map) = m.get_mut_model().get_mut(sec) { if let Some(ast) = ast_map.get_mut(ptype) { ast.get_mut_policy().insert(rule); } } } else { self.is_filtered = true; } } Ok(()) } async fn save_policy(&mut self, m: &mut dyn Model) -> Result<()> { self.policy.clear(); if let Some(ast_map) = m.get_model().get("p") { for (ptype, ast) in ast_map { if let Some(sec) = ptype.chars().next().map(|x| x.to_string()) { for policy in ast.get_policy() { let mut rule = policy.clone(); rule.insert(0, ptype.clone()); rule.insert(0, sec.clone()); self.policy.insert(rule); } } } } if let Some(ast_map) = m.get_model().get("g") { for (ptype, ast) in ast_map { if let Some(sec) = ptype.chars().next().map(|x| x.to_string()) { for policy in ast.get_policy() { let mut rule = policy.clone(); rule.insert(0, ptype.clone()); rule.insert(0, sec.clone()); self.policy.insert(rule); } } } } Ok(()) } async fn add_policy(&mut self, sec: &str, ptype: &str, mut rule: Vec<String>) -> Result<bool> { rule.insert(0, ptype.to_owned()); rule.insert(0, sec.to_owned()); Ok(self.policy.insert(rule)) } async fn add_policies( &mut self, sec: &str, ptype: &str, rules: Vec<Vec<String>>, ) -> Result<bool> { let mut all_added = true; let rules: Vec<Vec<String>> = rules .into_iter() .map(|mut rule| { rule.insert(0, ptype.to_owned()); rule.insert(0, sec.to_owned()); rule }) .collect(); for rule in &rules { if self.policy.contains(rule) { all_added = false; return Ok(all_added); } } self.policy.extend(rules); Ok(all_added) } async fn remove_policies( &mut self, sec: &str, ptype: &str, rules: Vec<Vec<String>>, ) -> Result<bool> { let mut all_removed = true; let rules: Vec<Vec<String>> = rules .into_iter() .map(|mut rule| { rule.insert(0, ptype.to_owned()); rule.insert(0, sec.to_owned()); rule }) .collect(); for rule in &rules { if !self.policy.contains(rule) { all_removed = false; return Ok(all_removed); } } for rule in &rules { self.policy.remove(rule); } Ok(all_removed) } async fn remove_policy( &mut self, sec: &str, ptype: &str, mut rule: Vec<String>, ) -> Result<bool> { rule.insert(0, ptype.to_owned()); rule.insert(0, sec.to_owned()); Ok(self.policy.remove(&rule)) } async fn remove_filtered_policy( &mut self, sec: &str, ptype: &str, field_index: usize, field_values: Vec<String>, ) -> Result<bool> { let mut tmp = IndexSet::new(); let mut res = false; for rule in &self.policy { if sec == rule[0] && ptype == rule[1] { let mut matched = true; for (i, field_value) in field_values.iter().enumerate() { if !field_value.is_empty() && &rule[field_index + i + 2] != field_value { matched = false; break; } } if matched { res = true; } else { tmp.insert(rule.clone()); } } else { tmp.insert(rule.clone()); } } self.policy = tmp; Ok(res) } fn is_filtered(&self) -> bool { self.is_filtered } }