blob: f9577b483f30e3428c2b0ddfa3ca3038e18e0914 [file]
// Copyright (C) 2024 The Android Open Source Project
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//! Low-level utilities shared across multiple GBL libraries.
#![cfg_attr(not(test), no_std)]
use liberror::{Error, Result};
use safemath::SafeNum;
/// Returns the largest aligned subslice.
///
/// This function drops as many bytes as needed from the front of the given slice to ensure the
/// result is properly-aligned. It does not truncate bytes from the end, so the resulting size may
/// not be a multiple of `alignment`.
///
/// If the next `alignment` boundary would be directly following the last byte, this returns the
/// 0-length slice at that alignment rather than an error, to match standard slicing behavior.
///
/// # Arguments
/// * `bytes`: the byte slice to align
/// * `alignment`: the desired starting alignment
///
/// # Returns
/// * The subslice on success
/// * [Error::ArithmeticOverflow] if `bytes` overflows when finding the next `alignment`
/// * [Error::BufferTooSmall] if `bytes` is not large enough to reach the next `alignment`. The
/// error will contain the size that would have been needed to reach `alignment`.
pub fn aligned_subslice<T>(bytes: &mut [u8], alignment: T) -> Result<&mut [u8]>
where
T: Copy + Into<SafeNum>,
{
let addr = bytes.as_ptr() as usize;
let aligned_offset = (SafeNum::from(addr).round_up(alignment) - addr).try_into()?;
Ok(bytes.get_mut(aligned_offset..).ok_or(Error::BufferTooSmall(Some(aligned_offset)))?)
}
#[cfg(test)]
mod test {
use super::*;
// A byte array that's always at least 8-byte aligned for testing.
#[repr(align(8))]
struct AlignedBytes<const N: usize>([u8; N]);
#[test]
fn aligned_subslice_already_aligned() {
let mut bytes = AlignedBytes([0u8; 16]);
let bytes = &mut bytes.0;
// AlignedBytes is `align(8)`, so must be 1/2/4/8-aligned.
assert_eq!(aligned_subslice(bytes, 1).unwrap().as_ptr_range(), bytes.as_ptr_range());
assert_eq!(aligned_subslice(bytes, 2).unwrap().as_ptr_range(), bytes.as_ptr_range());
assert_eq!(aligned_subslice(bytes, 4).unwrap().as_ptr_range(), bytes.as_ptr_range());
assert_eq!(aligned_subslice(bytes, 8).unwrap().as_ptr_range(), bytes.as_ptr_range());
}
#[test]
fn aligned_subslice_unaligned() {
let mut bytes = AlignedBytes([0u8; 16]);
let bytes = &mut bytes.0;
// AlignedBytes is 8-aligned, so offsetting by <8 should snap to the next 8-alignment.
assert_eq!(
aligned_subslice(&mut bytes[1..], 8).unwrap().as_ptr_range(),
bytes[8..].as_ptr_range()
);
assert_eq!(
aligned_subslice(&mut bytes[4..], 8).unwrap().as_ptr_range(),
bytes[8..].as_ptr_range()
);
assert_eq!(
aligned_subslice(&mut bytes[7..], 8).unwrap().as_ptr_range(),
bytes[8..].as_ptr_range()
);
}
#[test]
fn aligned_subslice_empty_slice() {
let mut bytes = AlignedBytes([0u8; 16]);
let bytes = &mut bytes.0;
// If the next alignment is just past the input, return the empty slice.
assert_eq!(
aligned_subslice(&mut bytes[9..], 8).unwrap().as_ptr_range(),
bytes[16..].as_ptr_range()
);
}
#[test]
fn aligned_subslice_buffer_overflow() {
let mut bytes = AlignedBytes([0u8; 7]); // 7 bytes; can't reach the next 8-alignment.
let bytes = &mut bytes.0;
assert_eq!(aligned_subslice(&mut bytes[1..], 8), Err(Error::BufferTooSmall(Some(7))));
assert_eq!(aligned_subslice(&mut bytes[6..], 8), Err(Error::BufferTooSmall(Some(2))));
}
#[test]
fn aligned_subslice_alignment_overflow() {
let mut bytes = AlignedBytes([0u8; 16]);
let bytes = &mut bytes.0;
assert!(matches!(aligned_subslice(bytes, SafeNum::MAX), Err(Error::ArithmeticOverflow(_))));
}
}