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
|
/*
* Ouroboros - Copyright (C) 2016
*
* The IPC Resource Manager - Application Instance Table
*
* Dimitri Staessens <dimitri.staessens@intec.ugent.be>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* 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.
*/
#include <ouroboros/config.h>
#include <ouroboros/list.h>
#include <ouroboros/errno.h>
#include "api_table.h"
#include <stdlib.h>
struct api_entry * api_entry_create(pid_t api,
char * apn,
char * ap_subset)
{
struct api_entry * e = malloc(sizeof(*e));
if (e == NULL)
return NULL;
INIT_LIST_HEAD(&e->next);
e->api = api;
e->apn = apn;
e->ap_subset = ap_subset;
return e;
}
void api_entry_destroy(struct api_entry * e)
{
if (e->apn != NULL)
free(e->apn);
if (e->ap_subset != NULL)
free(e->ap_subset);
free(e);
}
int api_table_add_api(struct list_head * api_table,
pid_t api, char * apn, char * ap_subset)
{
if (apn == NULL)
return -EINVAL;
struct api_entry * e = api_entry_create(api, apn, ap_subset);
if (e == NULL)
return -ENOMEM;
list_add(&e->next, api_table);
return 0;
}
void api_table_del_api(struct list_head * api_table, pid_t api)
{
struct list_head * p;
struct list_head * h;
list_for_each_safe(p, h, api_table) {
struct api_entry * e =
list_entry(p, struct api_entry, next);
if (api == e->api) {
list_del(&e->next);
api_entry_destroy(e);
}
}
}
char * api_table_get_apn(struct list_head * api_table, pid_t api)
{
struct list_head * h;
list_for_each(h, api_table) {
struct api_entry * e =
list_entry(h, struct api_entry, next);
if (api == e->api)
return e->apn;
}
return NULL;
}
char * api_table_get_ap_subset(struct list_head * api_table, pid_t api)
{
struct list_head * h;
list_for_each(h, api_table) {
struct api_entry * e =
list_entry(h, struct api_entry, next);
if (api == e->api)
return e->ap_subset;
}
return NULL;
}
|
