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
use crate::error::*; use crate::ir; use std::cmp::{Ordering, PartialOrd}; use std::collections::HashSet; #[derive(Clone, Debug, PartialEq)] pub struct LocationSet { locations: HashSet<ir::ProgramLocation>, } impl LocationSet { pub fn new() -> LocationSet { LocationSet { locations: HashSet::default(), } } pub fn insert(&mut self, location: ir::ProgramLocation) { self.locations.insert(location); } pub fn contains(&self, location: &ir::ProgramLocation) -> bool { self.locations.contains(location) } pub fn locations(&self) -> &HashSet<ir::ProgramLocation> { &self.locations } pub fn remove(&mut self, location: &ir::ProgramLocation) { self.locations.remove(location); } pub fn is_empty(&self) -> bool { self.locations.is_empty() } pub fn apply<'f, V: 'f + ir::Value>( &self, function: &'f ir::Function<V>, ) -> Result<RefLocationSet<'f, V>> { let mut rls = RefLocationSet::new(); for location in self.locations() { rls.insert(location.apply(function)?); } Ok(rls) } pub fn join(mut self, other: &LocationSet) -> LocationSet { other .locations .iter() .for_each(|location| self.insert(location.clone())); self } } impl PartialOrd for LocationSet { fn partial_cmp(&self, rhs: &LocationSet) -> Option<Ordering> { let mut order = self .locations .iter() .fold(Ordering::Equal, |order, location| { if order == Ordering::Greater { Ordering::Greater } else if !rhs.contains(location) { Ordering::Greater } else { Ordering::Equal } }); for location in rhs.locations() { if !self.contains(location) { if order == Ordering::Greater { return None; } else { order = Ordering::Less; } } } Some(order) } } #[derive(Clone, Debug, PartialEq)] pub struct RefLocationSet<'f, V: 'f + ir::Value> { locations: HashSet<ir::RefProgramLocation<'f, V>>, } impl<'f, V: ir::Value> RefLocationSet<'f, V> { pub fn new() -> RefLocationSet<'f, V> { RefLocationSet { locations: HashSet::default(), } } pub fn insert(&mut self, location: ir::RefProgramLocation<'f, V>) { self.locations.insert(location); } pub fn contains(&self, location: &ir::RefProgramLocation<'f, V>) -> bool { self.locations.contains(location) } pub fn locations(&self) -> &HashSet<ir::RefProgramLocation<'f, V>> { &self.locations } pub fn remove(&mut self, location: &ir::RefProgramLocation<'f, V>) { self.locations.remove(location); } pub fn is_empty(&self) -> bool { self.locations.is_empty() } } impl<'f, V: ir::Value> PartialOrd for RefLocationSet<'f, V> { fn partial_cmp(&self, rhs: &RefLocationSet<'f, V>) -> Option<Ordering> { let mut order = self .locations .iter() .fold(Ordering::Equal, |order, location| { if order == Ordering::Greater { Ordering::Greater } else if !rhs.contains(location) { Ordering::Greater } else { Ordering::Equal } }); for location in rhs.locations() { if !self.contains(location) { if order == Ordering::Greater { return None; } else { order = Ordering::Less; } } } Some(order) } }