3
3
#![ no_std]
4
4
#![ feature( llvm_asm) ]
5
5
#![ allow( clippy:: missing_safety_doc) ]
6
+ #![ allow( clippy:: manual_flatten) ]
6
7
7
8
#[ macro_use]
8
9
extern crate alloc;
@@ -144,7 +145,7 @@ impl Iterator for Smmstore {
144
145
145
146
/// Check if SMMSTORE data is corrupted.
146
147
pub fn is_corrupted ( data : & [ u8 ] ) -> bool {
147
- let smmstore = Smmstore :: from_raw ( & data) ;
148
+ let smmstore = Smmstore :: from_raw ( data) ;
148
149
for entry in smmstore {
149
150
if let Err ( _err) = entry {
150
151
return true ;
@@ -159,7 +160,7 @@ pub fn is_corrupted(data: &[u8]) -> bool {
159
160
/// No error is returned if a corrupted entry is encountered. Instead, the used
160
161
/// size up to the corrupted entry is returned.
161
162
pub fn used_size ( data : & [ u8 ] ) -> usize {
162
- let smmstore = Smmstore :: from_raw ( & data) ;
163
+ let smmstore = Smmstore :: from_raw ( data) ;
163
164
164
165
let mut used = 0 ;
165
166
for entry in smmstore {
@@ -180,7 +181,7 @@ pub fn count_duplicates(data: &[u8]) -> usize {
180
181
let mut kv = BTreeMap :: < Vec < u8 > , Vec < u8 > > :: new ( ) ;
181
182
let mut duplicates = 0 ;
182
183
183
- let smmstore = Smmstore :: from_raw ( & data) ;
184
+ let smmstore = Smmstore :: from_raw ( data) ;
184
185
for entry in smmstore {
185
186
if let Ok ( entry) = entry {
186
187
if kv. insert ( entry. key , entry. value ) . is_some ( ) {
@@ -199,7 +200,7 @@ pub fn count_duplicates(data: &[u8]) -> usize {
199
200
pub fn deserialize ( data : & [ u8 ] ) -> BTreeMap :: < Vec < u8 > , Vec < u8 > > {
200
201
let mut kv = BTreeMap :: < Vec < u8 > , Vec < u8 > > :: new ( ) ;
201
202
202
- let smmstore = Smmstore :: from_raw ( & data) ;
203
+ let smmstore = Smmstore :: from_raw ( data) ;
203
204
for entry in smmstore {
204
205
if let Ok ( entry) = entry {
205
206
kv. insert ( entry. key , entry. value ) ;
@@ -232,11 +233,11 @@ pub fn serialize(data: BTreeMap::<Vec<u8>, Vec<u8>>) -> Vec<u8> {
232
233
}
233
234
234
235
// Key
235
- raw. extend_from_slice ( & key) ;
236
+ raw. extend_from_slice ( key) ;
236
237
offset += key. len ( ) ;
237
238
238
239
// Value
239
- raw. extend_from_slice ( & value) ;
240
+ raw. extend_from_slice ( value) ;
240
241
offset += value. len ( ) ;
241
242
242
243
// NULL byte
@@ -256,9 +257,9 @@ pub fn serialize(data: BTreeMap::<Vec<u8>, Vec<u8>>) -> Vec<u8> {
256
257
257
258
/// Convenience function to create new region of same size with compacted data.
258
259
pub fn compact ( data : & [ u8 ] ) -> Vec < u8 > {
259
- let compact = serialize ( deserialize ( & data) ) ;
260
+ let compact = serialize ( deserialize ( data) ) ;
260
261
let mut new_data = vec ! [ 0xFF ; data. len( ) ] ;
261
- new_data[ ..compact. len ( ) ] . copy_from_slice ( & compact. as_slice ( ) ) ;
262
+ new_data[ ..compact. len ( ) ] . copy_from_slice ( compact. as_slice ( ) ) ;
262
263
new_data
263
264
}
264
265
0 commit comments