// This file is part of Moonfire NVR, a security camera network video recorder. // Copyright (C) 2016 The Moonfire NVR Authors // // This program is free software: you can redistribute it and/or modify // it under the terms of the GNU General Public License as published by // the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // // In addition, as a special exception, the copyright holders give // permission to link the code of portions of this program with the // OpenSSL library under certain conditions as described in each // individual source file, and distribute linked combinations including // the two. // // You must obey the GNU General Public License in all respects for all // of the code used other than OpenSSL. If you modify file(s) with this // exception, you may extend this exception to your version of the // file(s), but you are not obligated to do so. If you do not wish to do // so, delete this exception statement from your version. If you delete // this exception statement from all source files in the program, then // also delete it here. // // This program is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // // You should have received a copy of the GNU General Public License // along with this program. If not, see . use lazy_static::lazy_static; use regex::Regex; use std::fmt::Write as _; use std::str::FromStr as _; static MULTIPLIERS: [(char, u64); 4] = [ // (suffix character, power of 2) ('T', 40), ('G', 30), ('M', 20), ('K', 10), ]; /// Encodes a size into human-readable form. pub fn encode_size(mut raw: i64) -> String { let mut encoded = String::new(); for &(c, n) in &MULTIPLIERS { if raw >= 1i64<> n, c).unwrap(); raw &= (1i64 << n) - 1; } } if raw > 0 || encoded.len() == 0 { write!(&mut encoded, "{}", raw).unwrap(); } else { encoded.pop(); // remove trailing space. } encoded } /// Decodes a human-readable size as output by encode_size. pub fn decode_size(encoded: &str) -> Result { let mut decoded = 0i64; lazy_static! { static ref RE: Regex = Regex::new(r"\s*([0-9]+)([TGMK])?,?\s*").unwrap(); } let mut last_pos = 0; for cap in RE.captures_iter(encoded) { let whole_cap = cap.get(0).unwrap(); if whole_cap.start() > last_pos { return Err(()); } last_pos = whole_cap.end(); let mut piece = i64::from_str(&cap[1]).map_err(|_| ())?; if let Some(m) = cap.get(2) { let m = m.as_str().as_bytes()[0] as char; for &(some_m, n) in &MULTIPLIERS { if some_m == m { piece *= 1i64< String { const HEX_CHARS: [u8; 16] = [b'0', b'1', b'2', b'3', b'4', b'5', b'6', b'7', b'8', b'9', b'a', b'b', b'c', b'd', b'e', b'f']; let mut hex = Vec::with_capacity(2 * raw.len()); for b in raw { hex.push(HEX_CHARS[((b & 0xf0) >> 4) as usize]); hex.push(HEX_CHARS[( b & 0x0f ) as usize]); } unsafe { String::from_utf8_unchecked(hex) } } /// Returns [0, 16) or error. fn dehex_byte(hex_byte: u8) -> Result { match hex_byte { b'0' ..= b'9' => Ok(hex_byte - b'0'), b'a' ..= b'f' => Ok(hex_byte - b'a' + 10), _ => Err(()), } } /// Returns a 20-byte raw form of the given hex string. /// (This is the size of a SHA1 hash, the only current use of this function.) pub fn dehex(hexed: &[u8]) -> Result<[u8; 20], ()> { if hexed.len() != 40 { return Err(()); } let mut out = [0; 20]; for i in 0..20 { out[i] = (dehex_byte(hexed[i<<1])? << 4) + dehex_byte(hexed[(i<<1) + 1])?; } Ok(out) } #[cfg(test)] mod tests { use super::*; #[test] fn test_decode() { assert_eq!(super::decode_size("100M").unwrap(), 100i64 << 20); } #[test] fn round_trip() { let s = "de382684a471f178e4e3a163762711b0653bfd83"; let dehexed = dehex(s.as_bytes()).unwrap(); assert_eq!(&hex(&dehexed[..]), s); } #[test] fn dehex_errors() { dehex(b"").unwrap_err(); dehex(b"de382684a471f178e4e3a163762711b0653bfd8g").unwrap_err(); } }