shmipc 0.1.1

Shared memory IPC for Rust
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
// Copyright 2025 CloudWeGo Authors
//
// 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.

use std::{
    cell::UnsafeCell,
    ptr::copy_nonoverlapping,
    sync::{
        Arc, Mutex,
        atomic::{AtomicBool, AtomicU32, Ordering},
    },
    time::Duration,
};

use tokio::sync::Notify;

use crate::{
    buffer::{Buf, BufferReader, BufferWriter, linked::LinkedBuffer, slice::BufferSlice},
    consts::MAGIC_NUMBER,
    error::Error,
    protocol::event::{EventType, FallbackDataEvent},
    queue::QueueElement,
    session::Session,
};

pub const STREAM_OPENED: u32 = 0;
pub const STREAM_CLOSED: u32 = 1;
pub const STREAM_HALF_CLOSED: u32 = 2;

/// Stream is used to represent a logical stream within a session
#[derive(Debug, Clone)]
pub struct Stream {
    inner: Arc<StreamInner>,
    id: u32,
    session: Session,
    session_id: usize,
}

#[derive(Debug)]
pub struct StreamInner {
    recv_buf: UnsafeCell<LinkedBuffer>,
    send_buf: UnsafeCell<LinkedBuffer>,
    pending_data: Mutex<Vec<BufferSliceWrapper>>,
    state: AtomicU32,
    close_notify: Notify,
    recv_notify: Notify,
    // if in_fallback_state is set to true, sending should use uds
    in_fallback_state: AtomicBool,
}

unsafe impl Sync for StreamInner {}

impl Stream {
    /// Construct a new stream within a given session for an ID
    pub(crate) fn new(id: u32, session_id: usize, session: Session) -> Self {
        let recv_notify = Notify::new();
        let close_notify = Notify::new();
        Self {
            id,
            session_id,
            inner: Arc::new(StreamInner {
                recv_buf: UnsafeCell::new(LinkedBuffer::new(session.shared.buffer_manager.clone())),
                send_buf: UnsafeCell::new(LinkedBuffer::new(session.shared.buffer_manager.clone())),
                pending_data: Mutex::new(Vec::new()),
                state: AtomicU32::new(STREAM_OPENED),
                close_notify,
                recv_notify,
                in_fallback_state: AtomicBool::new(false),
            }),
            session,
        }
    }

    #[allow(clippy::mut_from_ref)]
    #[inline]
    pub fn recv_buf(&self) -> &mut LinkedBuffer {
        unsafe { &mut *self.inner.recv_buf.get() }
    }

    #[allow(clippy::mut_from_ref)]
    #[inline]
    pub fn send_buf(&self) -> &mut LinkedBuffer {
        unsafe { &mut *self.inner.send_buf.get() }
    }

    pub const fn stream_id(&self) -> u32 {
        self.id
    }
}

impl Stream {
    /// return underlying read buffer, whose'size >= minSize.
    ///
    /// if current's size is not enough, which will block until
    /// the read buffer's size greater than minSize.
    async fn read_more(&self, min_size: usize, buf: &mut LinkedBuffer) -> Result<(), Error> {
        self.move_pending_data(buf);
        let recv_len = buf.len();
        if recv_len >= min_size {
            return Ok(());
        }

        if recv_len == 0 && self.inner.state.load(Ordering::SeqCst) != STREAM_OPENED {
            return Err(Error::EndOfStream);
        }

        loop {
            let recv_notified = self.inner.recv_notify.notified();
            let close_notified = self.inner.close_notify.notified();

            match futures::future::select(
                std::pin::pin!(recv_notified),
                std::pin::pin!(close_notified),
            )
            .await
            {
                futures::future::Either::Left(_) => {
                    self.move_pending_data(buf);
                    if buf.len() >= min_size {
                        return Ok(());
                    }
                }
                futures::future::Either::Right(_) => {
                    self.move_pending_data(buf);
                    if buf.len() >= min_size {
                        return Ok(());
                    }

                    if self.inner.state.load(Ordering::SeqCst) == STREAM_HALF_CLOSED {
                        return Err(Error::EndOfStream);
                    }

                    return Err(Error::StreamClosed);
                }
            }
        }
    }

    fn move_pending_data(&self, buf: &mut LinkedBuffer) {
        let mut pending_data = self.inner.pending_data.lock().unwrap();
        if pending_data.is_empty() {
            return;
        }
        let pre_len = buf.len();
        for data in pending_data.drain(0..) {
            if let Some(fallback_slice) = data.fallback_slice {
                buf.append_buffer_slice(fallback_slice);
                self.inner.in_fallback_state.store(true, Ordering::SeqCst);
                continue;
            }
            let mut offset = data.offset;
            loop {
                let slice = match self.session.shared.buffer_manager.read_buffer_slice(offset) {
                    Ok(slice) => slice,
                    Err(err) => {
                        // it means that something bug about protocol occurred, underlying
                        // connection will be closed.
                        tracing::error!("read_buffer_slice error {err}");
                        break;
                    }
                };
                if !slice
                    .buffer_header
                    .as_ref()
                    .map(|h| h.has_next())
                    .unwrap_or(false)
                {
                    buf.append_buffer_slice(slice);
                    break;
                }
                offset = slice.buffer_header.as_ref().unwrap().next_buffer_offset();
                buf.append_buffer_slice(slice);
            }
        }
        self.session
            .shared
            .stats
            .in_flow_bytes
            .fetch_add((buf.len() - pre_len) as u64, Ordering::SeqCst);
    }

    pub async fn write_fallback(
        &self,
        stream_status: u32,
        err: Error,
        send_buf: &mut LinkedBuffer,
    ) -> Result<(), Error> {
        tracing::warn!(
            "session {} stream fallback seqID:{} len:{} reason:{}, send_buf.is_from_share_memory: \
             {}",
            self.session.shared.name,
            self.id,
            send_buf.len(),
            err,
            send_buf.is_from_share_memory()
        );
        let mut event = FallbackDataEvent([0u8; 16].as_mut_ptr());
        event.encode(
            send_buf.len() as u32 + 16,
            self.session.shared.communication_version,
            self.id,
            stream_status,
        );
        let mut data = Vec::with_capacity(send_buf.len() + 16);
        data.extend_from_slice(event.as_slice());
        let mut slice = send_buf.slice_list().front();
        while let Some(s) = slice {
            data.extend_from_slice(unsafe {
                std::slice::from_raw_parts(s.data, s.write_index - s.read_index)
            });
            if send_buf
                .slice_list()
                .write()
                .map(|ws| ws == s)
                .unwrap_or(false)
            {
                break;
            }
            slice = s.next();
        }
        send_buf.recycle();
        self.session.open_circuit_breaker().await;
        self.session
            .shared
            .stats
            .fallback_write_count
            .fetch_add(1, Ordering::SeqCst);
        self.session.wait_for_send(None, data).await
    }

    fn clean(&self) {
        self.session
            .on_stream_close(self.id, self.inner.state.load(Ordering::SeqCst));
        self.clean_pending_data();
        self.recv_buf().recycle();
        self.send_buf().recycle();
    }

    fn clean_pending_data(&self) {
        let mut pending_data = self.inner.pending_data.lock().unwrap();
        for data in pending_data.drain(0..) {
            if let Some(fallback_slice) = data.fallback_slice {
                if !fallback_slice.is_from_shm {
                    unsafe {
                        _ = Vec::from_raw_parts(
                            fallback_slice.data,
                            fallback_slice.cap as usize,
                            fallback_slice.cap as usize,
                        )
                    }
                } else {
                    tracing::warn!(
                        "fallback slice is from shm, offset:{}",
                        fallback_slice.offset_in_shm
                    );
                }
                continue;
            }
            match self
                .session
                .shared
                .buffer_manager
                .read_buffer_slice(data.offset)
            {
                Ok(slice) => {
                    self.session.shared.buffer_manager.recycle_buffers(slice);
                }
                Err(err) => {
                    tracing::error!("read_buffer_slice error {}", err);
                    break;
                }
            }
        }
    }

    /// clean the stream's all status for reusing
    pub fn reset(&self) -> Result<(), Error> {
        if self.inner.state.load(Ordering::SeqCst) != STREAM_OPENED {
            return Err(Error::StreamClosed);
        }
        // return error if has any unread data
        let unread_size = self.recv_buf().len();
        if unread_size > 0 {
            return Err(Error::StreamHasUnreadData(unread_size));
        }

        let pending_data_len = self.inner.pending_data.lock().unwrap().len();
        if pending_data_len > 0 {
            return Err(Error::StreamHasPendingData(pending_data_len));
        }

        self.inner.in_fallback_state.store(false, Ordering::SeqCst);
        Ok(())
    }

    /// release the data previous read and reuse the last share memory slice for next write.
    pub fn release_read_and_reuse(&self) {
        let recv_buf = self.recv_buf();
        let send_buf = self.send_buf();
        recv_buf.release_previous_read_and_reserve();
        if recv_buf.is_empty() && recv_buf.slice_list().size() == 1 {
            std::mem::swap(recv_buf, send_buf);
        }
    }

    // fill_data_to_read_buffer is used to handle a data frame
    pub fn fill_data_to_read_buffer(&self, buf: BufferSliceWrapper) -> Result<(), Error> {
        self.inner.pending_data.lock().unwrap().push(buf);
        // stream had closed, which maybe closed by user due to timeout.
        if self.inner.state.load(Ordering::SeqCst) == STREAM_CLOSED {
            self.clean_pending_data();
            self.recv_buf().recycle();
            return Ok(());
        }
        // Unblock any readers
        self.inner.recv_notify.notify_one();

        Ok(())
    }

    pub fn is_open(&self) -> bool {
        self.inner.state.load(Ordering::SeqCst) == STREAM_OPENED
    }

    pub fn safe_close_notify(&self) {
        self.inner.close_notify.notify_waiters();
    }

    pub fn half_close(&self) {
        if self
            .inner
            .state
            .compare_exchange(
                STREAM_OPENED,
                STREAM_HALF_CLOSED,
                Ordering::SeqCst,
                Ordering::SeqCst,
            )
            .is_ok()
        {
            self.safe_close_notify();
        }
    }

    pub const fn session_id(&self) -> usize {
        self.session_id
    }

    pub fn fallback_state(&self) -> bool {
        self.inner.in_fallback_state.load(Ordering::SeqCst)
    }

    pub async fn reuse(&self) {
        self.session.put_or_close_stream(self.clone()).await;
    }

    pub async fn close(&mut self) -> Result<(), Error> {
        let old_state = self.inner.state.swap(STREAM_CLOSED, Ordering::Release);
        if old_state == STREAM_CLOSED {
            return Ok(());
        }
        self.clean();
        if old_state != STREAM_OPENED {
            return Ok(());
        }
        self.safe_close_notify();

        if self.session.shared.shutdown.load(Ordering::SeqCst) == 1 {
            return Ok(());
        }
        // notify peer
        if self
            .session
            .shared
            .queue_manager
            .send_queue
            .put(QueueElement {
                seq_id: self.id,
                offset_in_shm_buf: 0,
                status: STREAM_CLOSED,
            })
            .is_ok()
        {
            return self.session.wake_up_peer().await;
        }
        self.session
            .shared
            .stats
            .queue_full_error_count
            .fetch_add(1, Ordering::SeqCst);
        // notify close
        let mut event = vec![0u8; 12];
        unsafe {
            let ptr = event.as_mut_ptr();
            copy_nonoverlapping(12_u32.to_be_bytes().as_ptr(), ptr, 4);
            copy_nonoverlapping(MAGIC_NUMBER.to_be_bytes().as_ptr(), ptr.offset(4), 2);
            *ptr.offset(6) = self.session.shared.communication_version;
            *ptr.offset(7) = EventType::TYPE_STREAM_CLOSE.inner();
            copy_nonoverlapping(self.id.to_be_bytes().as_ptr(), ptr.offset(8), 4);
        }
        self.session.wait_for_send(None, event).await
    }

    /// Read a shm buffer.
    ///
    /// The length of this buffer depends on how much the peer writes at once.
    ///
    /// To specify a length of buffer, refer to [`Stream::read_bytes`].
    ///
    /// NOTE: after using the buffer, you MUST explicitly call `stream.release_read_and_reuse()`
    /// for releasing it, otherwise it will cause memory leak.
    pub async fn read(&mut self) -> Result<Buf<'_>, Error> {
        let buf = self.recv_buf();
        if buf.is_empty() {
            tracing::debug!("read_bytes seqID:{}", self.id);
            self.read_more(1, buf).await?;
        }
        buf.read_bytes(buf.len())
    }

    /// Read a buffer of at least the given size.
    ///
    /// This function will return when enough data has been read. In other words, if there is not
    /// enough data to fill the length, this function will block forever.
    ///
    /// To return immediately after getting a buffer, refer to [`Stream::read`].
    pub async fn read_bytes(&mut self, size: usize) -> Result<Buf<'_>, Error> {
        let buf = self.recv_buf();
        if buf.len() < size {
            tracing::debug!(
                "read_bytes seqID:{} len:{} size:{}",
                self.id,
                buf.len(),
                size
            );
            self.read_more(size, buf).await?;
        }
        buf.read_bytes(size)
    }

    pub async fn peek(&mut self, size: usize) -> Result<Buf<'_>, Error> {
        let buf = self.recv_buf();
        if buf.len() < size {
            self.read_more(size, buf).await?;
        }
        buf.peek(size)
    }

    pub async fn discard(&mut self, size: usize) -> Result<usize, Error> {
        let buf = self.recv_buf();
        if buf.len() < size {
            self.read_more(size, buf).await?;
        }
        buf.discard(size)
    }

    pub fn reserve(&mut self, size: usize) -> Result<&mut [u8], Error> {
        self.send_buf().reserve(size)
    }

    pub fn write_bytes(&mut self, data: &[u8]) -> Result<usize, Error> {
        self.send_buf().write_bytes(data)
    }

    pub async fn flush(&mut self, end_stream: bool) -> Result<(), Error> {
        let send_buf = self.send_buf();
        if send_buf.is_empty() {
            return Ok(());
        }
        self.session
            .shared
            .stats
            .out_flow_bytes
            .fetch_add(send_buf.len() as u64, Ordering::SeqCst);
        let state = self.inner.state.load(Ordering::SeqCst);
        if state != STREAM_OPENED {
            send_buf.recycle();
            return Err(Error::StreamClosed);
        }
        send_buf.done(end_stream);
        // Once we send data using uds, for this stream we will always use uds later to avoid
        // unordering
        if !send_buf.is_from_share_memory() {
            self.inner.in_fallback_state.store(true, Ordering::SeqCst);
        }
        if self.inner.in_fallback_state.load(Ordering::SeqCst) {
            let ret = self
                .write_fallback(state, Error::NoMoreBuffer, send_buf)
                .await;
            send_buf.clean();
            return ret;
        }

        match self
            .session
            .shared
            .queue_manager
            .send_queue
            .put(QueueElement {
                seq_id: self.id,
                offset_in_shm_buf: send_buf.root_buf_offset(),
                status: state,
            }) {
            Ok(_) => {
                let ret = self.session.wake_up_peer().await;
                send_buf.clean();
                return ret;
            }
            Err(Error::QueueFull) => {}
            Err(err) => {
                send_buf.recycle();
                return Err(err);
            }
        }
        self.session
            .shared
            .stats
            .queue_full_error_count
            .fetch_add(1, Ordering::SeqCst);
        for _ in 0..10 {
            if tokio::time::timeout(
                Duration::from_millis(10),
                self.inner.close_notify.notified(),
            )
            .await
            .is_ok()
            {
                send_buf.recycle();
                return Err(Error::StreamClosed);
            }

            match self
                .session
                .shared
                .queue_manager
                .send_queue
                .put(QueueElement {
                    seq_id: self.id,
                    offset_in_shm_buf: send_buf.root_buf_offset(),
                    status: state,
                }) {
                Ok(_) => {
                    let ret = self.session.wake_up_peer().await;
                    send_buf.clean();
                    return ret;
                }
                Err(Error::QueueFull) => continue,
                Err(err) => {
                    send_buf.recycle();
                    return Err(err);
                }
            }
        }
        Ok(())
    }
}

#[derive(Debug)]
pub struct BufferSliceWrapper {
    pub(crate) fallback_slice: Option<BufferSlice>,
    pub(crate) offset: u32,
}