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
|
#ifndef __RINGBUF_H__
#define __RINGBUF_H__
#include "config.h"
#include <stdio.h>
#ifdef HAVE_STDINT_H
#include <stdint.h>
#endif
#ifdef HAVE_INTTYPES_H
#include <inttypes.h>
#endif
#include <unistd.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <stdlib.h>
#include <pwd.h>
#include <ctype.h>
#include <math.h>
#include <string>
#include <map>
#include <vector>
class RingBuffer {
public:
RingBuffer(int in_size);
~RingBuffer();
// See if an insert would succeed (for multi-stage inserts that must
// all succeed
int InsertDummy(int in_len);
// Add data to the ring buffer
int InsertData(uint8_t *in_data, int in_len);
// Fetch the length of the longest continual piece of data
int FetchLen();
// Fetch the longest continual piece of data
void FetchPtr(uint8_t *in_dptr, int max_len, int *in_len);
// Flag bytes as read. Will only flag as many bytes are available
void MarkRead(int in_len);
protected:
int ring_len;
uint8_t *ring_data;
uint8_t *ring_rptr, *ring_wptr;
};
#endif
|
