环形缓存区 linux内核

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdatomic.h>

#define BUFFER_SIZE 10

typedef struct {
    int buffer[BUFFER_SIZE];
    atomic_int head;
    atomic_int tail;
} RingBuffer;

void rb_init(RingBuffer *rb) {
    atomic_init(&rb->head, 0);
    atomic_init(&rb->tail, 0);
}

int rb_push(RingBuffer *rb, int value) {
    int head = atomic_load(&rb->head);
    int next_head = (head + 1) % BUFFER_SIZE;
    if (next_head == atomic_load(&rb->tail)) {
        return -1; // Buffer is full
    }
    rb->buffer[head] = value;
    atomic_store(&rb->head, next_head);
    return 0;
}

int rb_pop(RingBuffer *rb, int *value) {
    int tail = atomic_load(&rb->tail);
    if (tail == atomic_load(&rb->head)) {
        return -1; // Buffer is empty
    }
    *value = rb->buffer[tail];
    int next_tail = (tail + 1) % BUFFER_SIZE;
    atomic_store(&rb->tail, next_tail);
    return 0;
}

int main() {
    RingBuffer rb;
    rb_init(&rb);

    // Example usage
    for (int i = 0; i < 15; i++) {
        if (rb_push(&rb, i) == -1) {
            printf("Buffer is full
");
        }
    }

    int value;
    while (rb_pop(&rb, &value) == 0) {
        printf("Popped value: %d
", value);
    }

    return 0;
}