-
Notifications
You must be signed in to change notification settings - Fork 1
/
buffers.h
147 lines (113 loc) · 4.96 KB
/
buffers.h
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
/*
* Cloud9 Parallel Symbolic Execution Engine
*
* Copyright (c) 2011, Dependable Systems Laboratory, EPFL
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of the Dependable Systems Laboratory, EPFL nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE DEPENDABLE SYSTEMS LABORATORY, EPFL BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* All contributors are listed in CLOUD9-AUTHORS file.
*
*/
#ifndef BUFFERS_H_
#define BUFFERS_H_
#include <unistd.h>
#include <sys/uio.h>
#include "common.h"
//#include "multiprocess.h"
// TODO(sbucur): Get rid of non-vector read/write calls
////////////////////////////////////////////////////////////////////////////////
// Event Queue Utility
////////////////////////////////////////////////////////////////////////////////
#define EVENT_READ (1 << 0)
#define EVENT_WRITE (1 << 1)
typedef struct {
wlist_id_t *queue;
unsigned int count;
} event_queue_t;
void _event_queue_init(event_queue_t *q, unsigned count, int shared);
void _event_queue_finalize(event_queue_t *q);
int _event_queue_register(event_queue_t *q, wlist_id_t wlist);
int _event_queue_clear(event_queue_t *q, wlist_id_t wlist);
void _event_queue_notify(event_queue_t *q);
////////////////////////////////////////////////////////////////////////////////
// Stream Buffers
////////////////////////////////////////////////////////////////////////////////
#define BUFFER_STATUS_DESTROYING (1<<0)
#define BUFFER_STATUS_CLOSED (1<<1)
#define BUFFER_STATUS_SYM_READS (1<<2)
// A basic producer-consumer data structure
typedef struct {
char *contents;
size_t max_size;
size_t max_rsize;
size_t start;
size_t size;
event_queue_t evt_queue;
wlist_id_t empty_wlist;
wlist_id_t full_wlist;
unsigned int queued;
unsigned short status;
} stream_buffer_t;
stream_buffer_t *_stream_create(size_t max_size, int shared);
void _stream_destroy(stream_buffer_t *buff);
ssize_t _stream_read(stream_buffer_t *buff, char *dest, size_t count);
ssize_t _stream_write(stream_buffer_t *buff, const char *src, size_t count);
ssize_t _stream_readv(stream_buffer_t *buff, const struct iovec *iov, int iovcnt);
ssize_t _stream_writev(stream_buffer_t *buff, const struct iovec *iov, int iovcnt);
void _stream_close(stream_buffer_t *buff);
int _stream_register_event(stream_buffer_t *buff, wlist_id_t wlist);
int _stream_clear_event(stream_buffer_t *buff, wlist_id_t wlist);
static inline int _stream_is_empty(stream_buffer_t *buff) {
return (buff->size == 0);
}
static inline int _stream_is_full(stream_buffer_t *buff) {
return (buff->size == buff->max_size);
}
static inline int _stream_is_closed(stream_buffer_t *buff) {
return (buff->status & BUFFER_STATUS_CLOSED);
}
static inline void _stream_set_rsize(stream_buffer_t *buff, size_t rsize) {
if (rsize == 0)
rsize = 1;
if (rsize > buff->max_size)
rsize = buff->max_size;
buff->max_rsize = rsize;
}
////////////////////////////////////////////////////////////////////////////////
// Block Buffers
////////////////////////////////////////////////////////////////////////////////
typedef struct {
char *contents;
size_t max_size;
size_t size;
} block_buffer_t;
void _block_init(block_buffer_t *buff, size_t max_size);
void _block_finalize(block_buffer_t *buff);
ssize_t _block_read(block_buffer_t *buff, char *dest, size_t count, size_t offset);
ssize_t _block_write(block_buffer_t *buff, const char *src, size_t count, size_t offset);
ssize_t _block_readv(block_buffer_t *buff, const struct iovec *iov, int iovcnt,
size_t count, size_t offset);
ssize_t _block_writev(block_buffer_t *buff, const struct iovec *iov, int iovcnt,
size_t count, size_t offset);
#endif /* BUFFERS_H_ */