queue.rs 3.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111
  1. /*
  2. * Copyright (c) 2006-2025, RT-Thread Development Team
  3. *
  4. * SPDX-License-Identifier: Apache-2.0
  5. *
  6. * Change Logs:
  7. * Date Author Notes
  8. * 2025-10-10 foxglove RT-Thread Queue implementation
  9. */
  10. use crate::api::*;
  11. use crate::{panic::panic_on_atomic_context, RTTError};
  12. use core::cell::UnsafeCell;
  13. use core::marker::PhantomData;
  14. use core::mem::{size_of, MaybeUninit};
  15. use core::ffi::c_void;
  16. const RT_WAITING_FOREVER: isize = -1;
  17. unsafe impl<T> Send for Queue<T> where T: Send {}
  18. unsafe impl<T> Sync for Queue<T> where T: Send {}
  19. #[derive(Debug)]
  20. pub struct Queue<T> {
  21. queue: APIRawQueue,
  22. item_type: PhantomData<UnsafeCell<T>>,
  23. }
  24. impl<T> Queue<T> {
  25. pub fn new(max_size: usize) -> Result<Queue<T>, RTTError> {
  26. queue_create("Unnamed", max_size as _, size_of::<T>() as _)
  27. .ok_or(RTTError::OutOfMemory)
  28. .map(|m| Queue {
  29. queue: m,
  30. item_type: PhantomData,
  31. })
  32. }
  33. pub fn new_with_name(name: &str, max_size: usize) -> Result<Queue<T>, RTTError> {
  34. queue_create(name, max_size as _, size_of::<T>() as _)
  35. .ok_or(RTTError::OutOfMemory)
  36. .map(|m| Queue {
  37. queue: m,
  38. item_type: PhantomData,
  39. })
  40. }
  41. pub fn try_send(&self, item: T) -> Result<(), (RTTError, T)> {
  42. self._send(item, 0)
  43. }
  44. pub fn send(&self, item: T, max_wait: i32) -> Result<(), (RTTError, T)> {
  45. panic_on_atomic_context("send");
  46. self._send(item, max_wait)
  47. }
  48. pub fn send_wait_forever(&self, item: T) -> Result<(), (RTTError, T)> {
  49. panic_on_atomic_context("send_wait_forever");
  50. self._send(item, RT_WAITING_FOREVER as _)
  51. }
  52. fn _send(&self, item: T, max_wait: i32) -> Result<(), (RTTError, T)> {
  53. let inner = MaybeUninit::new(item);
  54. let ret = queue_send_wait(
  55. self.queue,
  56. inner.as_ptr() as *const c_void,
  57. size_of::<T>() as _,
  58. max_wait,
  59. );
  60. return if !is_eok(ret) {
  61. unsafe { Err((RTTError::QueueSendTimeout, inner.assume_init())) }
  62. } else {
  63. Ok(())
  64. };
  65. }
  66. pub fn try_recv(&self) -> Result<T, RTTError> {
  67. self._receive(0)
  68. }
  69. pub fn recv(&self, max_wait: i32) -> Result<T, RTTError> {
  70. panic_on_atomic_context("recv");
  71. self._receive(max_wait)
  72. }
  73. pub fn recv_wait_forever(&self) -> Result<T, RTTError> {
  74. panic_on_atomic_context("recv_wait_forever");
  75. self._receive(RT_WAITING_FOREVER as _)
  76. }
  77. fn _receive(&self, max_wait: i32) -> Result<T, RTTError> {
  78. let mut inner = MaybeUninit::<T>::uninit();
  79. let ret = queue_receive_wait(
  80. self.queue,
  81. inner.as_mut_ptr() as *mut c_void,
  82. size_of::<T>() as _,
  83. max_wait,
  84. );
  85. return if is_eok(ret) {
  86. Ok(unsafe { inner.assume_init() })
  87. } else {
  88. Err(RTTError::QueueReceiveTimeout)
  89. };
  90. }
  91. }
  92. impl<T> Drop for Queue<T> {
  93. fn drop(&mut self) {
  94. queue_delete(self.queue);
  95. }
  96. }