|
| 1 | +#![no_main] |
| 2 | + |
| 3 | +use crate::arbitrary_ops::*; |
| 4 | +use bitvec::prelude::*; |
| 5 | +use croaring::Bitmap; |
| 6 | +use libfuzzer_sys::arbitrary; |
| 7 | +use libfuzzer_sys::arbitrary::Arbitrary; |
| 8 | +use libfuzzer_sys::fuzz_target; |
| 9 | + |
| 10 | +mod arbitrary_ops; |
| 11 | + |
| 12 | +fuzz_target!(|input: FuzzInput| { |
| 13 | + let mut lhs = Bitmap::create(); |
| 14 | + let mut rhs = Bitmap::create(); |
| 15 | + |
| 16 | + let mut lhs_check = bitvec![0; 4 * 0x1_0000]; |
| 17 | + let mut rhs_check = bitvec![0; 4 * 0x1_0000]; |
| 18 | + |
| 19 | + for op in input.lhs_ops { |
| 20 | + op.on_roaring(&mut lhs); |
| 21 | + op.on_bitvec(&mut lhs_check); |
| 22 | + check_equal(&lhs, &lhs_check); |
| 23 | + } |
| 24 | + for op in input.rhs_ops { |
| 25 | + op.on_roaring(&mut rhs); |
| 26 | + op.on_bitvec(&mut rhs_check); |
| 27 | + check_equal(&rhs, &rhs_check); |
| 28 | + } |
| 29 | + |
| 30 | + for op in &input.comp_ops { |
| 31 | + op.on_roaring(&mut lhs, &rhs); |
| 32 | + op.on_bitvec(&mut lhs_check, &rhs); |
| 33 | + check_equal(&lhs, &lhs_check); |
| 34 | + } |
| 35 | + |
| 36 | + for op in &input.view_ops { |
| 37 | + op.on_both(&rhs, &rhs_check); |
| 38 | + op.on_both(&lhs, &lhs_check); |
| 39 | + } |
| 40 | +}); |
| 41 | + |
| 42 | +#[derive(Arbitrary, Debug)] |
| 43 | +struct FuzzInput { |
| 44 | + lhs_ops: Vec<MutableBitmapOperation>, |
| 45 | + rhs_ops: Vec<MutableBitmapOperation>, |
| 46 | + comp_ops: Vec<BitmapCompOperation>, |
| 47 | + view_ops: Vec<ReadBitmapOp>, |
| 48 | +} |
| 49 | + |
| 50 | +impl ReadBitmapOp { |
| 51 | + fn on_both(&self, b: &Bitmap, v: &BitSlice) { |
| 52 | + match *self { |
| 53 | + ReadBitmapOp::ContainsRange(ref r) => { |
| 54 | + assert_eq!( |
| 55 | + v[r.start().0 as usize..=r.end().0 as usize].all(), |
| 56 | + b.contains_range(r.start().0..=r.end().0) |
| 57 | + ); |
| 58 | + } |
| 59 | + ReadBitmapOp::Contains(i) => { |
| 60 | + assert_eq!(v[i.0 as usize], b.contains(i.0)); |
| 61 | + } |
| 62 | + ReadBitmapOp::RangeCardinality(ref r) => { |
| 63 | + assert_eq!( |
| 64 | + v[r.start().0 as usize..=r.end().0 as usize].count_ones() as u64, |
| 65 | + b.range_cardinality(r.start().0..=r.end().0) |
| 66 | + ); |
| 67 | + } |
| 68 | + ReadBitmapOp::Cardinality => { |
| 69 | + assert_eq!(v.count_ones() as u64, b.cardinality()); |
| 70 | + } |
| 71 | + ReadBitmapOp::Flip(ref r) => { |
| 72 | + b.flip(r.start().0..=r.end().0); |
| 73 | + } |
| 74 | + ReadBitmapOp::ToVec => { |
| 75 | + let vec_iter = b.to_vec(); |
| 76 | + assert!(vec_iter.into_iter().eq(v.iter_ones().map(|i| i as u32))); |
| 77 | + } |
| 78 | + ReadBitmapOp::GetSerializedSizeInBytes => { |
| 79 | + b.get_serialized_size_in_bytes(); |
| 80 | + } |
| 81 | + ReadBitmapOp::GetFrozenSerializedSizeInBytes => { |
| 82 | + b.get_frozen_serialized_size_in_bytes(); |
| 83 | + } |
| 84 | + ReadBitmapOp::IsEmpty => { |
| 85 | + assert_eq!(v.not_any(), b.is_empty()); |
| 86 | + } |
| 87 | + ReadBitmapOp::IntersectWithRange(ref r) => { |
| 88 | + assert_eq!( |
| 89 | + v[r.start().0 as usize..=r.end().0 as usize].any(), |
| 90 | + b.intersect_with_range(r.start().0..=r.end().0) |
| 91 | + ); |
| 92 | + } |
| 93 | + ReadBitmapOp::Minimum => { |
| 94 | + assert_eq!(v.first_one().map(|i| i as u32), b.minimum()); |
| 95 | + } |
| 96 | + ReadBitmapOp::Maximum => { |
| 97 | + assert_eq!(v.last_one().map(|i| i as u32), b.maximum()); |
| 98 | + } |
| 99 | + ReadBitmapOp::Rank(i) => { |
| 100 | + assert_eq!( |
| 101 | + v.iter_ones().take_while(|&n| n <= i.0 as usize).count() as u64, |
| 102 | + b.rank(i.0), |
| 103 | + ); |
| 104 | + } |
| 105 | + ReadBitmapOp::Select(i) => { |
| 106 | + assert_eq!( |
| 107 | + v.iter_ones().nth(i.0 as usize).map(|n| n as u32), |
| 108 | + b.select(i.0), |
| 109 | + ); |
| 110 | + } |
| 111 | + ReadBitmapOp::Statistics => { |
| 112 | + b.statistics(); |
| 113 | + } |
| 114 | + ReadBitmapOp::Clone => { |
| 115 | + drop(b.clone()); |
| 116 | + } |
| 117 | + ReadBitmapOp::Debug => { |
| 118 | + use std::io::Write; |
| 119 | + write!(std::io::sink(), "{:?}", b).unwrap(); |
| 120 | + } |
| 121 | + ReadBitmapOp::WithIter(ref iter_ops) => { |
| 122 | + let mut iter = b.iter(); |
| 123 | + for op in iter_ops { |
| 124 | + match *op { |
| 125 | + IterOperation::ResetAtOrAfter(i) => { |
| 126 | + iter.reset_at_or_after(i); |
| 127 | + } |
| 128 | + IterOperation::ReadNext => { |
| 129 | + iter.next(); |
| 130 | + } |
| 131 | + IterOperation::NextMany(n) => { |
| 132 | + let mut v = vec![0; n as usize]; |
| 133 | + iter.next_many(&mut v); |
| 134 | + } |
| 135 | + } |
| 136 | + } |
| 137 | + } |
| 138 | + ReadBitmapOp::AddOffset(i) => { |
| 139 | + b.add_offset(i); |
| 140 | + } |
| 141 | + } |
| 142 | + } |
| 143 | +} |
| 144 | + |
| 145 | +impl MutableBitmapOperation { |
| 146 | + fn on_bitvec(&self, b: &mut BitSlice) { |
| 147 | + match *self { |
| 148 | + MutableBitmapOperation::Add(i) | MutableBitmapOperation::AddChecked(i) => { |
| 149 | + b.set(i.0 as usize, true); |
| 150 | + } |
| 151 | + MutableBitmapOperation::AddMany(ref items) => { |
| 152 | + for i in items { |
| 153 | + b.set(i.0 as usize, true); |
| 154 | + } |
| 155 | + } |
| 156 | + MutableBitmapOperation::AddRange(ref r) => { |
| 157 | + b[r.start().0 as usize..=r.end().0 as usize].fill(true); |
| 158 | + } |
| 159 | + MutableBitmapOperation::RemoveRange(ref r) => { |
| 160 | + b[r.start().0 as usize..=r.end().0 as usize].fill(false); |
| 161 | + } |
| 162 | + MutableBitmapOperation::Clear => { |
| 163 | + b.fill(false); |
| 164 | + } |
| 165 | + MutableBitmapOperation::Remove(i) | MutableBitmapOperation::RemoveChecked(i) => { |
| 166 | + b.set(i.0 as usize, false); |
| 167 | + } |
| 168 | + MutableBitmapOperation::FlipInplace(ref r) => { |
| 169 | + let _ = !&mut b[r.start().0 as usize..=r.end().0 as usize]; |
| 170 | + } |
| 171 | + MutableBitmapOperation::ShrinkToFit |
| 172 | + | MutableBitmapOperation::RunOptimize |
| 173 | + | MutableBitmapOperation::RemoveRunCompression => {} |
| 174 | + MutableBitmapOperation::MakeBitmap { key } => { |
| 175 | + if key < (MAX_NUM / 0x1_0000) as u16 { |
| 176 | + let key = usize::from(key); |
| 177 | + let start = key * 0x1_0000; |
| 178 | + let end = start + 9 * 1024; |
| 179 | + for i in (start..end).step_by(2) { |
| 180 | + b.set(i, true); |
| 181 | + } |
| 182 | + } |
| 183 | + } |
| 184 | + MutableBitmapOperation::MakeRange { key } => { |
| 185 | + if key < (MAX_NUM / 0x1_0000) as u16 { |
| 186 | + let key = usize::from(key); |
| 187 | + let start = key * 0x1_0000; |
| 188 | + let end = start + 0x0_FFFF; |
| 189 | + b[start..=end].fill(true); |
| 190 | + } |
| 191 | + } |
| 192 | + } |
| 193 | + } |
| 194 | +} |
| 195 | + |
| 196 | +impl BitmapCompOperation { |
| 197 | + fn on_bitvec(&self, lhs: &mut BitSlice, rhs: &Bitmap) { |
| 198 | + match *self { |
| 199 | + BitmapCompOperation::Eq |
| 200 | + | BitmapCompOperation::IsSubset |
| 201 | + | BitmapCompOperation::IsStrictSubset |
| 202 | + | BitmapCompOperation::Intersect |
| 203 | + | BitmapCompOperation::JacardIndex => {} |
| 204 | + BitmapCompOperation::And => { |
| 205 | + let tmp = to_bitvec(rhs, lhs.len()); |
| 206 | + *lhs &= &tmp; |
| 207 | + } |
| 208 | + BitmapCompOperation::Or => { |
| 209 | + for i in rhs.iter() { |
| 210 | + let i = i as usize; |
| 211 | + if i >= lhs.len() { |
| 212 | + break; |
| 213 | + } |
| 214 | + lhs.set(i, true); |
| 215 | + } |
| 216 | + } |
| 217 | + BitmapCompOperation::Xor => { |
| 218 | + for i in rhs.iter() { |
| 219 | + let i = i as usize; |
| 220 | + if i >= lhs.len() { |
| 221 | + break; |
| 222 | + } |
| 223 | + let old_val = *lhs.get(i).unwrap(); |
| 224 | + lhs.set(i, !old_val); |
| 225 | + } |
| 226 | + } |
| 227 | + BitmapCompOperation::AndNot => { |
| 228 | + for i in rhs.iter() { |
| 229 | + let i = i as usize; |
| 230 | + if i >= lhs.len() { |
| 231 | + break; |
| 232 | + } |
| 233 | + lhs.set(i, false); |
| 234 | + } |
| 235 | + } |
| 236 | + } |
| 237 | + } |
| 238 | +} |
| 239 | + |
| 240 | +fn to_bitvec(b: &Bitmap, max: usize) -> BitVec { |
| 241 | + let mut res = bitvec![0; max]; |
| 242 | + for i in b.iter() { |
| 243 | + let i = i as usize; |
| 244 | + if i >= max { |
| 245 | + break; |
| 246 | + } |
| 247 | + res.set(i, true); |
| 248 | + } |
| 249 | + res |
| 250 | +} |
| 251 | + |
| 252 | +fn check_equal(b: &Bitmap, v: &BitSlice) { |
| 253 | + let lhs = b.iter().take_while(|&i| i < v.len() as u32); |
| 254 | + let rhs = v.iter_ones().map(|i| i as u32); |
| 255 | + |
| 256 | + assert!(lhs.eq(rhs), "{b:?}") |
| 257 | +} |
0 commit comments