126 lines
3.6 KiB
Rust
126 lines
3.6 KiB
Rust
//! Unsafe linked list.
|
|
//! Translated from ST's C by `c2rust` tool.
|
|
|
|
#![allow(
|
|
dead_code,
|
|
mutable_transmutes,
|
|
non_camel_case_types,
|
|
non_snake_case,
|
|
non_upper_case_globals,
|
|
unused_assignments,
|
|
unused_mut
|
|
)]
|
|
|
|
use cortex_m::interrupt;
|
|
|
|
#[derive(Copy, Clone)]
|
|
#[repr(C, packed(4))]
|
|
pub struct LinkedListNode {
|
|
pub next: *mut LinkedListNode,
|
|
pub prev: *mut LinkedListNode,
|
|
}
|
|
|
|
impl Default for LinkedListNode {
|
|
fn default() -> Self {
|
|
LinkedListNode {
|
|
next: core::ptr::null_mut(),
|
|
prev: core::ptr::null_mut(),
|
|
}
|
|
}
|
|
}
|
|
|
|
impl LinkedListNode {
|
|
pub unsafe fn init_head(mut list_head: *mut LinkedListNode) {
|
|
(*list_head).next = list_head;
|
|
(*list_head).prev = list_head;
|
|
}
|
|
|
|
pub unsafe fn is_empty(mut list_head: *mut LinkedListNode) -> bool {
|
|
interrupt::free(|_| ((*list_head).next) == list_head)
|
|
}
|
|
|
|
pub unsafe fn insert_head(mut list_head: *mut LinkedListNode, mut node: *mut LinkedListNode) {
|
|
interrupt::free(|_| {
|
|
(*node).next = (*list_head).next;
|
|
(*node).prev = list_head;
|
|
(*list_head).next = node;
|
|
(*(*node).next).prev = node;
|
|
});
|
|
}
|
|
|
|
pub unsafe fn insert_tail(mut list_head: *mut LinkedListNode, mut node: *mut LinkedListNode) {
|
|
interrupt::free(|_| {
|
|
(*node).next = list_head;
|
|
(*node).prev = (*list_head).prev;
|
|
(*list_head).prev = node;
|
|
(*(*node).prev).next = node;
|
|
});
|
|
}
|
|
|
|
pub unsafe fn remove_node(mut node: *mut LinkedListNode) {
|
|
interrupt::free(|_| {
|
|
(*(*node).prev).next = (*node).next;
|
|
(*(*node).next).prev = (*node).prev;
|
|
});
|
|
}
|
|
|
|
pub unsafe fn remove_head(mut list_head: *mut LinkedListNode, mut node: *mut *mut LinkedListNode) {
|
|
interrupt::free(|_| {
|
|
*node = (*list_head).next;
|
|
Self::remove_node((*list_head).next);
|
|
});
|
|
}
|
|
|
|
pub unsafe fn remove_tail(mut list_head: *mut LinkedListNode, mut node: *mut *mut LinkedListNode) {
|
|
interrupt::free(|_| {
|
|
*node = (*list_head).prev;
|
|
Self::remove_node((*list_head).prev);
|
|
});
|
|
}
|
|
|
|
pub unsafe fn insert_node_after(mut node: *mut LinkedListNode, mut ref_node: *mut LinkedListNode) {
|
|
interrupt::free(|_| {
|
|
(*node).next = (*ref_node).next;
|
|
(*node).prev = ref_node;
|
|
(*ref_node).next = node;
|
|
(*(*node).next).prev = node;
|
|
});
|
|
}
|
|
|
|
pub unsafe fn insert_node_before(mut node: *mut LinkedListNode, mut ref_node: *mut LinkedListNode) {
|
|
interrupt::free(|_| {
|
|
(*node).next = ref_node;
|
|
(*node).prev = (*ref_node).prev;
|
|
(*ref_node).prev = node;
|
|
(*(*node).prev).next = node;
|
|
});
|
|
}
|
|
|
|
pub unsafe fn get_size(mut list_head: *mut LinkedListNode) -> usize {
|
|
interrupt::free(|_| {
|
|
let mut size = 0;
|
|
let mut temp: *mut LinkedListNode = core::ptr::null_mut::<LinkedListNode>();
|
|
|
|
temp = (*list_head).next;
|
|
while temp != list_head {
|
|
size += 1;
|
|
temp = (*temp).next
|
|
}
|
|
|
|
size
|
|
})
|
|
}
|
|
|
|
pub unsafe fn get_next_node(mut ref_node: *mut LinkedListNode, mut node: *mut *mut LinkedListNode) {
|
|
interrupt::free(|_| {
|
|
*node = (*ref_node).next;
|
|
});
|
|
}
|
|
|
|
pub unsafe fn get_prev_node(mut ref_node: *mut LinkedListNode, mut node: *mut *mut LinkedListNode) {
|
|
interrupt::free(|_| {
|
|
*node = (*ref_node).prev;
|
|
});
|
|
}
|
|
}
|