Dennis Shen | adc7b73 | 2023-12-11 18:59:13 +0000 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2023 The Android Open Source Project |
| 3 | * |
| 4 | * Licensed under the Apache License, Version 2.0 (the "License"); |
| 5 | * you may not use this file except in compliance with the License. |
| 6 | * You may obtain a copy of the License at |
| 7 | * |
| 8 | * http://www.apache.org/licenses/LICENSE-2.0 |
| 9 | * |
| 10 | * Unless required by applicable law or agreed to in writing, software |
| 11 | * distributed under the License is distributed on an "AS IS" BASIS, |
| 12 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 13 | * See the License for the specific language governing permissions and |
| 14 | * limitations under the License. |
| 15 | */ |
| 16 | |
| 17 | use crate::storage::{self, FlagPackage}; |
| 18 | use anyhow::Result; |
| 19 | |
| 20 | #[derive(PartialEq, Debug)] |
| 21 | pub struct PackageTableHeader { |
| 22 | pub version: u32, |
| 23 | pub container: String, |
| 24 | pub file_size: u32, |
| 25 | pub num_packages: u32, |
| 26 | pub bucket_offset: u32, |
| 27 | pub node_offset: u32, |
| 28 | } |
| 29 | |
| 30 | impl PackageTableHeader { |
| 31 | fn new(container: &str, num_packages: u32) -> Self { |
| 32 | Self { |
| 33 | version: storage::FILE_VERSION, |
| 34 | container: String::from(container), |
| 35 | file_size: 0, |
| 36 | num_packages, |
| 37 | bucket_offset: 0, |
| 38 | node_offset: 0, |
| 39 | } |
| 40 | } |
| 41 | |
| 42 | fn as_bytes(&self) -> Vec<u8> { |
| 43 | let mut result = Vec::new(); |
| 44 | result.extend_from_slice(&self.version.to_le_bytes()); |
| 45 | let container_bytes = self.container.as_bytes(); |
| 46 | result.extend_from_slice(&(container_bytes.len() as u32).to_le_bytes()); |
| 47 | result.extend_from_slice(container_bytes); |
| 48 | result.extend_from_slice(&self.file_size.to_le_bytes()); |
| 49 | result.extend_from_slice(&self.num_packages.to_le_bytes()); |
| 50 | result.extend_from_slice(&self.bucket_offset.to_le_bytes()); |
| 51 | result.extend_from_slice(&self.node_offset.to_le_bytes()); |
| 52 | result |
| 53 | } |
| 54 | } |
| 55 | |
| 56 | #[derive(PartialEq, Debug)] |
| 57 | pub struct PackageTableNode { |
| 58 | pub package_name: String, |
| 59 | pub package_id: u32, |
| 60 | pub boolean_offset: u32, |
| 61 | pub next_offset: Option<u32>, |
| 62 | pub bucket_index: u32, |
| 63 | } |
| 64 | |
| 65 | impl PackageTableNode { |
| 66 | fn new(package: &FlagPackage, num_buckets: u32) -> Self { |
| 67 | let bucket_index = |
| 68 | storage::get_bucket_index(&package.package_name.to_string(), num_buckets); |
| 69 | Self { |
| 70 | package_name: String::from(package.package_name), |
| 71 | package_id: package.package_id, |
| 72 | boolean_offset: package.boolean_offset, |
| 73 | next_offset: None, |
| 74 | bucket_index, |
| 75 | } |
| 76 | } |
| 77 | |
| 78 | fn as_bytes(&self) -> Vec<u8> { |
| 79 | let mut result = Vec::new(); |
| 80 | let name_bytes = self.package_name.as_bytes(); |
| 81 | result.extend_from_slice(&(name_bytes.len() as u32).to_le_bytes()); |
| 82 | result.extend_from_slice(name_bytes); |
| 83 | result.extend_from_slice(&self.package_id.to_le_bytes()); |
| 84 | result.extend_from_slice(&self.boolean_offset.to_le_bytes()); |
| 85 | result.extend_from_slice(&self.next_offset.unwrap_or(0).to_le_bytes()); |
| 86 | result |
| 87 | } |
| 88 | } |
| 89 | |
| 90 | pub struct PackageTable { |
| 91 | pub header: PackageTableHeader, |
| 92 | pub buckets: Vec<Option<u32>>, |
| 93 | pub nodes: Vec<PackageTableNode>, |
| 94 | } |
| 95 | |
| 96 | impl PackageTable { |
| 97 | pub fn new(container: &str, packages: &[FlagPackage]) -> Result<Self> { |
| 98 | // create table |
| 99 | let num_packages = packages.len() as u32; |
| 100 | let num_buckets = storage::get_table_size(num_packages)?; |
| 101 | let mut table = Self { |
| 102 | header: PackageTableHeader::new(container, num_packages), |
| 103 | buckets: vec![None; num_buckets as usize], |
| 104 | nodes: packages.iter().map(|pkg| PackageTableNode::new(pkg, num_buckets)).collect(), |
| 105 | }; |
| 106 | |
| 107 | // sort nodes by bucket index for efficiency |
| 108 | table.nodes.sort_by(|a, b| a.bucket_index.cmp(&b.bucket_index)); |
| 109 | |
| 110 | // fill all node offset |
| 111 | let mut offset = 0; |
| 112 | for i in 0..table.nodes.len() { |
| 113 | let node_bucket_idx = table.nodes[i].bucket_index; |
| 114 | let next_node_bucket_idx = if i + 1 < table.nodes.len() { |
| 115 | Some(table.nodes[i + 1].bucket_index) |
| 116 | } else { |
| 117 | None |
| 118 | }; |
| 119 | |
| 120 | if table.buckets[node_bucket_idx as usize].is_none() { |
| 121 | table.buckets[node_bucket_idx as usize] = Some(offset); |
| 122 | } |
| 123 | offset += table.nodes[i].as_bytes().len() as u32; |
| 124 | |
| 125 | if let Some(index) = next_node_bucket_idx { |
| 126 | if index == node_bucket_idx { |
| 127 | table.nodes[i].next_offset = Some(offset); |
| 128 | } |
| 129 | } |
| 130 | } |
| 131 | |
| 132 | // fill table region offset |
| 133 | table.header.bucket_offset = table.header.as_bytes().len() as u32; |
| 134 | table.header.node_offset = table.header.bucket_offset + num_buckets * 4; |
| 135 | table.header.file_size = table.header.node_offset |
| 136 | + table.nodes.iter().map(|x| x.as_bytes().len()).sum::<usize>() as u32; |
| 137 | |
| 138 | Ok(table) |
| 139 | } |
| 140 | |
| 141 | pub fn as_bytes(&self) -> Vec<u8> { |
| 142 | [ |
| 143 | self.header.as_bytes(), |
| 144 | self.buckets.iter().map(|v| v.unwrap_or(0).to_le_bytes()).collect::<Vec<_>>().concat(), |
| 145 | self.nodes.iter().map(|v| v.as_bytes()).collect::<Vec<_>>().concat(), |
| 146 | ] |
| 147 | .concat() |
| 148 | } |
| 149 | } |
| 150 | |
| 151 | #[cfg(test)] |
| 152 | mod tests { |
| 153 | use super::*; |
| 154 | use crate::storage::{ |
| 155 | group_flags_by_package, tests::parse_all_test_flags, tests::read_str_from_bytes, |
| 156 | tests::read_u32_from_bytes, |
| 157 | }; |
| 158 | |
| 159 | impl PackageTableHeader { |
| 160 | // test only method to deserialize back into the header struct |
| 161 | fn from_bytes(bytes: &[u8]) -> Result<Self> { |
| 162 | let mut head = 0; |
| 163 | Ok(Self { |
| 164 | version: read_u32_from_bytes(bytes, &mut head)?, |
| 165 | container: read_str_from_bytes(bytes, &mut head)?, |
| 166 | file_size: read_u32_from_bytes(bytes, &mut head)?, |
| 167 | num_packages: read_u32_from_bytes(bytes, &mut head)?, |
| 168 | bucket_offset: read_u32_from_bytes(bytes, &mut head)?, |
| 169 | node_offset: read_u32_from_bytes(bytes, &mut head)?, |
| 170 | }) |
| 171 | } |
| 172 | } |
| 173 | |
| 174 | impl PackageTableNode { |
| 175 | // test only method to deserialize back into the node struct |
| 176 | fn from_bytes(bytes: &[u8], num_buckets: u32) -> Result<Self> { |
| 177 | let mut head = 0; |
| 178 | let mut node = Self { |
| 179 | package_name: read_str_from_bytes(bytes, &mut head)?, |
| 180 | package_id: read_u32_from_bytes(bytes, &mut head)?, |
| 181 | boolean_offset: read_u32_from_bytes(bytes, &mut head)?, |
| 182 | next_offset: match read_u32_from_bytes(bytes, &mut head)? { |
| 183 | 0 => None, |
| 184 | val => Some(val), |
| 185 | }, |
| 186 | bucket_index: 0, |
| 187 | }; |
| 188 | node.bucket_index = storage::get_bucket_index(&node.package_name, num_buckets); |
| 189 | Ok(node) |
| 190 | } |
| 191 | } |
| 192 | |
| 193 | pub fn create_test_package_table() -> Result<PackageTable> { |
| 194 | let caches = parse_all_test_flags(); |
| 195 | let packages = group_flags_by_package(caches.iter()); |
| 196 | PackageTable::new("system", &packages) |
| 197 | } |
| 198 | |
| 199 | #[test] |
| 200 | // this test point locks down the table creation and each field |
| 201 | fn test_table_contents() { |
| 202 | let package_table = create_test_package_table(); |
| 203 | assert!(package_table.is_ok()); |
| 204 | |
| 205 | let header: &PackageTableHeader = &package_table.as_ref().unwrap().header; |
| 206 | let expected_header = PackageTableHeader { |
| 207 | version: storage::FILE_VERSION, |
| 208 | container: String::from("system"), |
Dennis Shen | 8bab859 | 2023-12-20 17:45:00 +0000 | [diff] [blame^] | 209 | file_size: 208, |
| 210 | num_packages: 3, |
Dennis Shen | adc7b73 | 2023-12-11 18:59:13 +0000 | [diff] [blame] | 211 | bucket_offset: 30, |
| 212 | node_offset: 58, |
| 213 | }; |
| 214 | assert_eq!(header, &expected_header); |
| 215 | |
| 216 | let buckets: &Vec<Option<u32>> = &package_table.as_ref().unwrap().buckets; |
| 217 | let expected: Vec<Option<u32>> = vec![Some(0), None, None, Some(50), None, None, None]; |
| 218 | assert_eq!(buckets, &expected); |
| 219 | |
| 220 | let nodes: &Vec<PackageTableNode> = &package_table.as_ref().unwrap().nodes; |
Dennis Shen | 8bab859 | 2023-12-20 17:45:00 +0000 | [diff] [blame^] | 221 | assert_eq!(nodes.len(), 3); |
Dennis Shen | adc7b73 | 2023-12-11 18:59:13 +0000 | [diff] [blame] | 222 | let first_node_expected = PackageTableNode { |
| 223 | package_name: String::from("com.android.aconfig.storage.test_2"), |
| 224 | package_id: 1, |
| 225 | boolean_offset: 10, |
| 226 | next_offset: None, |
| 227 | bucket_index: 0, |
| 228 | }; |
| 229 | assert_eq!(nodes[0], first_node_expected); |
| 230 | let second_node_expected = PackageTableNode { |
| 231 | package_name: String::from("com.android.aconfig.storage.test_1"), |
| 232 | package_id: 0, |
| 233 | boolean_offset: 0, |
Dennis Shen | 8bab859 | 2023-12-20 17:45:00 +0000 | [diff] [blame^] | 234 | next_offset: Some(100), |
Dennis Shen | adc7b73 | 2023-12-11 18:59:13 +0000 | [diff] [blame] | 235 | bucket_index: 3, |
| 236 | }; |
| 237 | assert_eq!(nodes[1], second_node_expected); |
Dennis Shen | 8bab859 | 2023-12-20 17:45:00 +0000 | [diff] [blame^] | 238 | let third_node_expected = PackageTableNode { |
| 239 | package_name: String::from("com.android.aconfig.storage.test_4"), |
| 240 | package_id: 2, |
| 241 | boolean_offset: 16, |
| 242 | next_offset: None, |
| 243 | bucket_index: 3, |
| 244 | }; |
| 245 | assert_eq!(nodes[2], third_node_expected); |
Dennis Shen | adc7b73 | 2023-12-11 18:59:13 +0000 | [diff] [blame] | 246 | } |
| 247 | |
| 248 | #[test] |
| 249 | // this test point locks down the table serialization |
| 250 | fn test_serialization() { |
| 251 | let package_table = create_test_package_table(); |
| 252 | assert!(package_table.is_ok()); |
| 253 | |
| 254 | let header: &PackageTableHeader = &package_table.as_ref().unwrap().header; |
| 255 | let reinterpreted_header = PackageTableHeader::from_bytes(&header.as_bytes()); |
| 256 | assert!(reinterpreted_header.is_ok()); |
| 257 | assert_eq!(header, &reinterpreted_header.unwrap()); |
| 258 | |
| 259 | let nodes: &Vec<PackageTableNode> = &package_table.as_ref().unwrap().nodes; |
| 260 | let num_buckets = storage::get_table_size(header.num_packages).unwrap(); |
| 261 | for node in nodes.iter() { |
| 262 | let reinterpreted_node = PackageTableNode::from_bytes(&node.as_bytes(), num_buckets); |
| 263 | assert!(reinterpreted_node.is_ok()); |
| 264 | assert_eq!(node, &reinterpreted_node.unwrap()); |
| 265 | } |
| 266 | } |
| 267 | } |