Protocol Buffers - Google's data interchange format (grpc依赖)
https://developers.google.com/protocol-buffers/
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
228 lines
7.7 KiB
228 lines
7.7 KiB
// Protocol Buffers - Google's data interchange format |
|
// Copyright 2023 Google LLC. All rights reserved. |
|
// https://developers.google.com/protocol-buffers/ |
|
// |
|
// Redistribution and use in source and binary forms, with or without |
|
// modification, are permitted provided that the following conditions are |
|
// met: |
|
// |
|
// * Redistributions of source code must retain the above copyright |
|
// notice, this list of conditions and the following disclaimer. |
|
// * Redistributions in binary form must reproduce the above |
|
// copyright notice, this list of conditions and the following disclaimer |
|
// in the documentation and/or other materials provided with the |
|
// distribution. |
|
// * Neither the name of Google LLC. nor the names of its |
|
// contributors may be used to endorse or promote products derived from |
|
// this software without specific prior written permission. |
|
// |
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
|
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
|
|
//! UPB FFI wrapper code for use by Rust Protobuf. |
|
|
|
use crate::__internal::RawArena; |
|
use std::alloc; |
|
use std::alloc::Layout; |
|
use std::cell::UnsafeCell; |
|
use std::fmt; |
|
use std::marker::PhantomData; |
|
use std::mem::MaybeUninit; |
|
use std::ops::Deref; |
|
use std::ptr::{self, NonNull}; |
|
use std::slice; |
|
|
|
/// See `upb/port/def.inc`. |
|
const UPB_MALLOC_ALIGN: usize = 8; |
|
|
|
/// A wrapper over a `upb_Arena`. |
|
/// |
|
/// This is not a safe wrapper per se, because the allocation functions still |
|
/// have sharp edges (see their safety docs for more info). |
|
/// |
|
/// This is an owning type and will automatically free the arena when |
|
/// dropped. |
|
/// |
|
/// Note that this type is neither `Sync` nor `Send`. |
|
#[derive(Debug)] |
|
pub struct Arena { |
|
// Safety invariant: this must always be a valid arena |
|
raw: RawArena, |
|
_not_sync: PhantomData<UnsafeCell<()>>, |
|
} |
|
|
|
extern "C" { |
|
// `Option<NonNull<T: Sized>>` is ABI-compatible with `*mut T` |
|
fn upb_Arena_New() -> Option<RawArena>; |
|
fn upb_Arena_Free(arena: RawArena); |
|
fn upb_Arena_Malloc(arena: RawArena, size: usize) -> *mut u8; |
|
fn upb_Arena_Realloc(arena: RawArena, ptr: *mut u8, old: usize, new: usize) -> *mut u8; |
|
} |
|
|
|
impl Arena { |
|
/// Allocates a fresh arena. |
|
#[inline] |
|
pub fn new() -> Self { |
|
#[inline(never)] |
|
#[cold] |
|
fn arena_new_failed() -> ! { |
|
panic!("Could not create a new UPB arena"); |
|
} |
|
|
|
// SAFETY: |
|
// - `upb_Arena_New` is assumed to be implemented correctly and always sound to |
|
// call; if it returned a non-null pointer, it is a valid arena. |
|
unsafe { |
|
let Some(raw) = upb_Arena_New() else { arena_new_failed() }; |
|
Self { raw, _not_sync: PhantomData } |
|
} |
|
} |
|
|
|
/// Returns the raw, UPB-managed pointer to the arena. |
|
#[inline] |
|
pub fn raw(&self) -> RawArena { |
|
self.raw |
|
} |
|
|
|
/// Allocates some memory on the arena. |
|
/// |
|
/// # Safety |
|
/// |
|
/// - `layout`'s alignment must be less than `UPB_MALLOC_ALIGN`. |
|
#[inline] |
|
pub unsafe fn alloc(&self, layout: Layout) -> &mut [MaybeUninit<u8>] { |
|
debug_assert!(layout.align() <= UPB_MALLOC_ALIGN); |
|
// SAFETY: `self.raw` is a valid UPB arena |
|
let ptr = unsafe { upb_Arena_Malloc(self.raw, layout.size()) }; |
|
if ptr.is_null() { |
|
alloc::handle_alloc_error(layout); |
|
} |
|
|
|
// SAFETY: |
|
// - `upb_Arena_Malloc` promises that if the return pointer is non-null, it is |
|
// dereferencable for `size` bytes and has an alignment of `UPB_MALLOC_ALIGN` |
|
// until the arena is destroyed. |
|
// - `[MaybeUninit<u8>]` has no alignment requirement, and `ptr` is aligned to a |
|
// `UPB_MALLOC_ALIGN` boundary. |
|
unsafe { slice::from_raw_parts_mut(ptr.cast(), layout.size()) } |
|
} |
|
|
|
/// Resizes some memory on the arena. |
|
/// |
|
/// # Safety |
|
/// |
|
/// - `ptr` must be the data pointer returned by a previous call to `alloc` |
|
/// or `resize` on `self`. |
|
/// - After calling this function, `ptr` is no longer dereferencable - it is |
|
/// zapped. |
|
/// - `old` must be the layout `ptr` was allocated with via `alloc` or |
|
/// `realloc`. |
|
/// - `new`'s alignment must be less than `UPB_MALLOC_ALIGN`. |
|
#[inline] |
|
pub unsafe fn resize(&self, ptr: *mut u8, old: Layout, new: Layout) -> &mut [MaybeUninit<u8>] { |
|
debug_assert!(new.align() <= UPB_MALLOC_ALIGN); |
|
// SAFETY: |
|
// - `self.raw` is a valid UPB arena |
|
// - `ptr` was allocated by a previous call to `alloc` or `realloc` as promised |
|
// by the caller. |
|
let ptr = unsafe { upb_Arena_Realloc(self.raw, ptr, old.size(), new.size()) }; |
|
if ptr.is_null() { |
|
alloc::handle_alloc_error(new); |
|
} |
|
|
|
// SAFETY: |
|
// - `upb_Arena_Realloc` promises that if the return pointer is non-null, it is |
|
// dereferencable for the new `size` in bytes until the arena is destroyed. |
|
// - `[MaybeUninit<u8>]` has no alignment requirement, and `ptr` is aligned to a |
|
// `UPB_MALLOC_ALIGN` boundary. |
|
unsafe { slice::from_raw_parts_mut(ptr.cast(), new.size()) } |
|
} |
|
} |
|
|
|
impl Drop for Arena { |
|
#[inline] |
|
fn drop(&mut self) { |
|
unsafe { |
|
upb_Arena_Free(self.raw); |
|
} |
|
} |
|
} |
|
|
|
/// Serialized Protobuf wire format data. |
|
/// |
|
/// It's typically produced by `<Message>::serialize()`. |
|
pub struct SerializedData { |
|
data: NonNull<u8>, |
|
len: usize, |
|
|
|
// The arena that owns `data`. |
|
_arena: Arena, |
|
} |
|
|
|
impl SerializedData { |
|
/// Construct `SerializedData` from raw pointers and its owning arena. |
|
/// |
|
/// # Safety |
|
/// - `arena` must be have allocated `data` |
|
/// - `data` must be readable for `len` bytes and not mutate while this |
|
/// struct exists |
|
pub unsafe fn from_raw_parts(arena: Arena, data: NonNull<u8>, len: usize) -> Self { |
|
SerializedData { _arena: arena, data, len } |
|
} |
|
|
|
/// Gets a raw slice pointer. |
|
pub fn as_ptr(&self) -> *const [u8] { |
|
ptr::slice_from_raw_parts(self.data.as_ptr(), self.len) |
|
} |
|
} |
|
|
|
impl Deref for SerializedData { |
|
type Target = [u8]; |
|
fn deref(&self) -> &Self::Target { |
|
// SAFETY: `data` is valid for `len` bytes as promised by |
|
// the caller of `SerializedData::from_raw_parts`. |
|
unsafe { slice::from_raw_parts(self.data.as_ptr(), self.len) } |
|
} |
|
} |
|
|
|
impl fmt::Debug for SerializedData { |
|
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result { |
|
fmt::Debug::fmt(self.deref(), f) |
|
} |
|
} |
|
|
|
#[cfg(test)] |
|
mod tests { |
|
use super::*; |
|
|
|
#[test] |
|
fn test_arena_new_and_free() { |
|
let arena = Arena::new(); |
|
drop(arena); |
|
} |
|
|
|
#[test] |
|
fn test_serialized_data_roundtrip() { |
|
let arena = Arena::new(); |
|
let original_data = b"Hello world"; |
|
let len = original_data.len(); |
|
|
|
let serialized_data = unsafe { |
|
SerializedData::from_raw_parts( |
|
arena, |
|
NonNull::new(original_data as *const _ as *mut _).unwrap(), |
|
len, |
|
) |
|
}; |
|
assert_eq!(&*serialized_data, b"Hello world"); |
|
} |
|
}
|
|
|