-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdaemon.c
198 lines (159 loc) · 6.17 KB
/
daemon.c
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
/*
* Copyright (c) 2017 Sam Kumar <[email protected]>
* Copyright (c) 2017 Michael P Andersen <[email protected]>
* Copyright (c) 2017 University of California, Berkeley
* 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 University of California, Berkeley 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 COPYRIGHT OWNERS OR CONTRIBUTORS 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.
*/
#include <errno.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include <unistd.h>
#include "api.h"
#include "daemon.h"
#include "errors.h"
#include "frame.h"
#include "osutil.h"
void bw2_daemon(struct bw2_client* client, char* frameheap, size_t heapsize) {
struct bw2_frame frame;
int rv;
while (true) {
rv = bw2_readFrame(&frame, frameheap, heapsize, client->connfd);
bw2_mutexLock(&client->reqslock);
struct bw2_reqctx** currptr = &client->reqs;
struct bw2_reqctx* curr = *currptr;
if (rv != 0 || !client->connected) {
/* Mark the client as disconnected so that future requests can just
* fail immediately.
*/
bw2_mutexLock(&client->outlock);
if (client->connected) {
close(client->connfd);
client->connected = false;
}
bw2_mutexUnlock(&client->outlock);
/* Release all resources and close the socket. */
while (curr != NULL) {
curr->rv = BW2_ERROR_CONNECTION_LOST;
curr->onframe(NULL, true, curr, curr->ctx);
}
client->reqs = NULL;
bw2_mutexUnlock(&client->reqslock);
return;
}
while (curr != NULL) {
if (curr->seqno == frame.seqno) {
struct bw2_header* finishhdr = bw2_getFirstHeader(&frame, "finished");
struct bw2_reqctx* next = curr->next;
bool final = (finishhdr != NULL && strncmp(finishhdr->value, "true", finishhdr->len) == 0);
curr->rv = 0; // Normal frame
bool stoplistening = curr->onframe(&frame, final, curr, curr->ctx);
if (final || stoplistening) {
/* At this point, curr may no longer be a valid pointer. */
*currptr = next;
} else {
currptr = &curr->next;
}
} else {
currptr = &curr->next;
}
curr = *currptr;
}
bw2_mutexUnlock(&client->reqslock);
/* If frameheap == NULL, the frame headers/POs/ROs were allocated
* with malloc, so we need to free all of the allocated resources.
*/
if (frameheap == NULL) {
bw2_frameFreeResources(&frame);
}
}
}
int bw2_transact(struct bw2_client* client, struct bw2_frame* frame, struct bw2_reqctx* reqctx) {
int rv;
if (reqctx != NULL) {
reqctx->seqno = frame->seqno;
bw2_mutexLock(&client->reqslock);
if (!client->connected) {
bw2_mutexUnlock(&client->reqslock);
return BW2_ERROR_CONNECTION_LOST;
}
reqctx->next = client->reqs;
client->reqs = reqctx;
bw2_mutexUnlock(&client->reqslock);
}
bw2_mutexLock(&client->outlock);
rv = bw2_writeFrame(frame, client->connfd);
if (rv == -1 && (errno == ETIMEDOUT || errno == ECONNRESET
|| errno == ECONNREFUSED || errno == EBADF)) {
close(client->connfd);
client->connected = false;
bw2_mutexUnlock(&client->outlock);
return BW2_ERROR_CONNECTION_LOST;
}
bw2_mutexUnlock(&client->outlock);
return 0;
}
int bw2_reqctxInit(struct bw2_reqctx* rctx, bool (*onframe)(struct bw2_frame*, bool, struct bw2_reqctx*, void*), void* ctx) {
rctx->onframe = onframe;
rctx->ctx = ctx;
bw2_mutexInit(&rctx->lock);
bw2_condInit(&rctx->condvar);
rctx->ready = false;
return 0;
}
int bw2_reqctxWait(struct bw2_reqctx* rctx) {
bw2_mutexLock(&rctx->lock);
while (!rctx->ready) {
bw2_condWait(&rctx->condvar, &rctx->lock);
}
bw2_mutexUnlock(&rctx->lock);
return 0;
}
int bw2_reqctxSignalled(struct bw2_reqctx* rctx, bool* signalled) {
bw2_mutexLock(&rctx->lock);
*signalled = rctx->ready;
bw2_mutexUnlock(&rctx->lock);
return 0;
}
int bw2_reqctxSignal(struct bw2_reqctx* rctx) {
bw2_mutexLock(&rctx->lock);
rctx->ready = true;
bw2_condSignal(&rctx->condvar);
bw2_mutexUnlock(&rctx->lock);
return 0;
}
int bw2_reqctxBroadcast(struct bw2_reqctx* rctx) {
bw2_mutexLock(&rctx->lock);
rctx->ready = true;
bw2_condBroadcast(&rctx->condvar);
bw2_mutexUnlock(&rctx->lock);
return 0;
}
int bw2_reqctxDestroy(struct bw2_reqctx* rctx) {
bw2_mutexDestroy(&rctx->lock);
bw2_condDestroy(&rctx->condvar);
return 0;
}