summaryrefslogtreecommitdiff
path: root/src/ipcpd/normal/fa.c
blob: be1080b1120dd167f707536cf944b6a0c689c2e1 (plain)
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
/*
 * Ouroboros - Copyright (C) 2016 - 2017
 *
 * Flow allocator of the IPC Process
 *
 *    Dimitri Staessens <dimitri.staessens@ugent.be>
 *    Sander Vrijders   <sander.vrijders@ugent.be>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 2 as
 * published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 */

#define OUROBOROS_PREFIX "flow-allocator"

#include <ouroboros/config.h>
#include <ouroboros/logs.h>
#include <ouroboros/fqueue.h>
#include <ouroboros/rib.h>
#include <ouroboros/errno.h>
#include <ouroboros/dev.h>

#include "fa.h"
#include "sdu_sched.h"
#include "ipcp.h"
#include "ribconfig.h"

#include <pthread.h>
#include <stdlib.h>
#include <string.h>

#include "flow_alloc.pb-c.h"
typedef FlowAllocMsg flow_alloc_msg_t;

#define TIMEOUT 10000 /* nanoseconds */

struct {
        pthread_rwlock_t   flows_lock;
        cep_id_t           fd_to_cep_id[AP_MAX_FLOWS];
        int                cep_id_to_fd[IPCPD_MAX_CONNS];

        flow_set_t *       set[QOS_CUBE_MAX];
        struct sdu_sched * sdu_sched;
} fa;

static int sdu_handler(int                  fd,
                       qoscube_t            qc,
                       struct shm_du_buff * sdb)
{
        (void) qc;

        pthread_rwlock_rdlock(&fa.flows_lock);

        if (frct_i_write_sdu(fa.fd_to_cep_id[fd], sdb)) {
                pthread_rwlock_unlock(&fa.flows_lock);
                ipcp_flow_del(sdb);
                log_warn("Failed to hand SDU to FRCT.");
                return -1;
        }

        pthread_rwlock_unlock(&fa.flows_lock);

        return 0;
}

int fa_init(void)
{
        int i;

        for (i = 0; i < AP_MAX_FLOWS; ++i)
                fa.fd_to_cep_id[i] = INVALID_CEP_ID;

        for (i = 0; i < IPCPD_MAX_CONNS; ++i)
                fa.cep_id_to_fd[i] = -1;

        for (i = 0; i < QOS_CUBE_MAX; ++i) {
                fa.set[i] = flow_set_create();
                if (fa.set[i] == NULL)
                        goto fail_flows;
        }

        if (pthread_rwlock_init(&fa.flows_lock, NULL))
                goto fail_flows;

        return 0;
fail_flows:
        for (i = 0; i < QOS_CUBE_MAX; ++i)
                flow_set_destroy(fa.set[i]);

        return -1;
}

void fa_fini(void)
{
        int i;

        for (i = 0; i < QOS_CUBE_MAX; ++i)
                flow_set_destroy(fa.set[i]);

        pthread_rwlock_destroy(&fa.flows_lock);
}

int fa_start(void)
{
        fa.sdu_sched = sdu_sched_create(fa.set, sdu_handler);
        if (fa.sdu_sched == NULL) {
                log_err("Failed to create SDU scheduler.");
                return -1;
        }

        return 0;
}

void fa_stop(void)
{
        sdu_sched_destroy(fa.sdu_sched);
}

int fa_alloc(int             fd,
             const uint8_t * dst,
             qoscube_t       qc)
{
        cep_id_t         cep_id;
        buffer_t         buf;
        flow_alloc_msg_t msg = FLOW_ALLOC_MSG__INIT;
        char             path[RIB_MAX_PATH_LEN + 1];
        uint64_t         addr;
        ssize_t          ch;
        ssize_t          i;
        char **          children;
        char             hashstr[ipcp_dir_hash_strlen() + 1];
        char *           dst_ipcp = NULL;

        ipcp_hash_str(hashstr, dst);

        assert(strlen(hashstr) + strlen(DIR_PATH) + 1
               < RIB_MAX_PATH_LEN);

        strcpy(path, DIR_PATH);

        rib_path_append(path, hashstr);

        ch = rib_children(path, &children);
        if (ch <= 0)
                return -1;

        for (i = 0; i < ch; ++i)
                if (dst_ipcp == NULL && strcmp(children[i], ipcpi.name) != 0)
                        dst_ipcp = children[i];
                else
                        free(children[i]);

        free(children);

        if (dst_ipcp == NULL)
                return -1;

        strcpy(path, MEMBERS_PATH);

        rib_path_append(path, dst_ipcp);

        free(dst_ipcp);

        if (rib_read(path, &addr, sizeof(addr)) < 0)
                return -1;

        msg.code        = FLOW_ALLOC_CODE__FLOW_REQ;
        msg.has_hash    = true;
        msg.hash.len    = ipcp_dir_hash_len();
        msg.hash.data   = (uint8_t *) dst;
        msg.has_qoscube = true;
        msg.qoscube     = qc;

        buf.len = flow_alloc_msg__get_packed_size(&msg);
        if (buf.len == 0)
                return -1;

        buf.data = malloc(buf.len);
        if (buf.data == NULL)
                return -1;

        flow_alloc_msg__pack(&msg, buf.data);

        pthread_rwlock_wrlock(&fa.flows_lock);

        cep_id = frct_i_create(addr, &buf, qc);
        if (cep_id == INVALID_CEP_ID) {
                pthread_rwlock_unlock(&fa.flows_lock);
                free(buf.data);
                return -1;
        }

        free(buf.data);

        fa.fd_to_cep_id[fd] = cep_id;
        fa.cep_id_to_fd[cep_id] = fd;

        pthread_rwlock_unlock(&fa.flows_lock);

        return 0;
}

/* Call under flows lock */
static int fa_flow_dealloc(int fd)
{
        flow_alloc_msg_t msg = FLOW_ALLOC_MSG__INIT;
        buffer_t         buf;
        int              ret;
        qoscube_t        qc;

        ipcp_flow_get_qoscube(fd, &qc);
        flow_set_del(fa.set[qc], fd);

        msg.code = FLOW_ALLOC_CODE__FLOW_DEALLOC;

        buf.len = flow_alloc_msg__get_packed_size(&msg);
        if (buf.len == 0)
                return -1;

        buf.data = malloc(buf.len);
        if (buf.data == NULL)
                return -ENOMEM;

        flow_alloc_msg__pack(&msg, buf.data);

        ret = frct_i_destroy(fa.fd_to_cep_id[fd], &buf);

        fa.cep_id_to_fd[fa.fd_to_cep_id[fd]] = -1;
        fa.fd_to_cep_id[fd] = INVALID_CEP_ID;

        free(buf.data);

        return ret;
}

int fa_alloc_resp(int fd,
                  int response)
{
        struct timespec ts = {0, TIMEOUT * 1000};
        flow_alloc_msg_t msg = FLOW_ALLOC_MSG__INIT;
        buffer_t         buf;

        msg.code = FLOW_ALLOC_CODE__FLOW_REPLY;
        msg.response = response;
        msg.has_response = true;

        pthread_mutex_lock(&ipcpi.alloc_lock);

        while (ipcpi.alloc_id != fd && ipcp_get_state() == IPCP_OPERATIONAL)
                pthread_cond_timedwait(&ipcpi.alloc_cond,
                                       &ipcpi.alloc_lock,
                                       &ts);

        if (ipcp_get_state() != IPCP_OPERATIONAL) {
                pthread_mutex_unlock(&ipcpi.alloc_lock);
                return -1;
        }

        ipcpi.alloc_id = -1;
        pthread_cond_broadcast(&ipcpi.alloc_cond);

        pthread_mutex_unlock(&ipcpi.alloc_lock);

        buf.len = flow_alloc_msg__get_packed_size(&msg);
        if (buf.len == 0)
                return -1;

        buf.data = malloc(buf.len);
        if (buf.data == NULL)
                return -ENOMEM;

        flow_alloc_msg__pack(&msg, buf.data);

        pthread_rwlock_wrlock(&fa.flows_lock);

        if (response < 0) {
                frct_i_destroy(fa.fd_to_cep_id[fd], &buf);
                free(buf.data);
                fa.cep_id_to_fd[fa.fd_to_cep_id[fd]]
                        = INVALID_CEP_ID;
                fa.fd_to_cep_id[fd] = -1;
        } else {
                qoscube_t qc;
                ipcp_flow_get_qoscube(fd, &qc);
                if (frct_i_accept(fa.fd_to_cep_id[fd], &buf, qc)) {
                        pthread_rwlock_unlock(&fa.flows_lock);
                        free(buf.data);
                        return -1;
                }
                flow_set_add(fa.set[qc], fd);
        }

        pthread_rwlock_unlock(&fa.flows_lock);

        free(buf.data);

        return 0;
}

int fa_dealloc(int fd)
{
        int ret;

        pthread_rwlock_wrlock(&fa.flows_lock);

        ret = fa_flow_dealloc(fd);

        pthread_rwlock_unlock(&fa.flows_lock);

        return ret;
}

int fa_post_buf(cep_id_t   cep_id,
                buffer_t * buf)
{
        struct timespec    ts  = {0, TIMEOUT * 1000};
        int                ret = 0;
        int                fd;
        flow_alloc_msg_t * msg;
        qoscube_t          qc;

        /* Depending on the message call the function in ipcp-dev.h */

        msg = flow_alloc_msg__unpack(NULL, buf->len, buf->data);
        if (msg == NULL) {
                log_err("Failed to unpack flow alloc message");
                return -1;
        }

        switch (msg->code) {
        case FLOW_ALLOC_CODE__FLOW_REQ:
                pthread_mutex_lock(&ipcpi.alloc_lock);

                if (!msg->has_hash) {
                        log_err("Bad flow request.");
                        pthread_mutex_unlock(&ipcpi.alloc_lock);
                        return -1;
                }

                while (ipcpi.alloc_id != -1 &&
                       ipcp_get_state() == IPCP_OPERATIONAL)
                        pthread_cond_timedwait(&ipcpi.alloc_cond,
                                               &ipcpi.alloc_lock,
                                               &ts);

                if (ipcp_get_state() != IPCP_OPERATIONAL) {
                        log_dbg("Won't allocate over non-operational IPCP.");
                        pthread_mutex_unlock(&ipcpi.alloc_lock);
                        return -1;
                }

                assert(ipcpi.alloc_id == -1);

                fd = ipcp_flow_req_arr(getpid(),
                                       msg->hash.data,
                                       ipcp_dir_hash_len(),
                                       msg->qoscube);
                if (fd < 0) {
                        pthread_mutex_unlock(&ipcpi.alloc_lock);
                        flow_alloc_msg__free_unpacked(msg, NULL);
                        log_err("Failed to get fd for flow.");
                        return -1;
                }

                pthread_rwlock_wrlock(&fa.flows_lock);

                fa.fd_to_cep_id[fd] = cep_id;
                fa.cep_id_to_fd[cep_id] = fd;

                pthread_rwlock_unlock(&fa.flows_lock);

                ipcpi.alloc_id = fd;
                pthread_cond_broadcast(&ipcpi.alloc_cond);

                pthread_mutex_unlock(&ipcpi.alloc_lock);

                break;
        case FLOW_ALLOC_CODE__FLOW_REPLY:
                pthread_rwlock_wrlock(&fa.flows_lock);

                fd = fa.cep_id_to_fd[cep_id];
                ret = ipcp_flow_alloc_reply(fd, msg->response);
                if (msg->response < 0) {
                        fa.fd_to_cep_id[fd] = INVALID_CEP_ID;
                        fa.cep_id_to_fd[cep_id] = -1;
                } else {
                        ipcp_flow_get_qoscube(fd, &qc);
                        flow_set_add(fa.set[qc],
                                     fa.cep_id_to_fd[cep_id]);
                }

                pthread_rwlock_unlock(&fa.flows_lock);

                break;
        case FLOW_ALLOC_CODE__FLOW_DEALLOC:
                fd = fa.cep_id_to_fd[cep_id];
                ipcp_flow_get_qoscube(fd, &qc);
                flow_set_del(fa.set[qc], fd);
                ret = flow_dealloc(fd);
                break;
        default:
                log_err("Got an unknown flow allocation message.");
                ret = -1;
                break;
        }

        flow_alloc_msg__free_unpacked(msg, NULL);

        return ret;
}

int fa_post_sdu(cep_id_t             cep_id,
                struct shm_du_buff * sdb)
{
        int fd;

        pthread_rwlock_rdlock(&fa.flows_lock);

        fd = fa.cep_id_to_fd[cep_id];
        if (ipcp_flow_write(fd, sdb)) {
                pthread_rwlock_unlock(&fa.flows_lock);
                log_err("Failed to hand SDU to N flow.");
                return -1;
        }

        pthread_rwlock_unlock(&fa.flows_lock);

        return 0;
}