1 | /*
|
---|
2 | * Copyright (c) 2011 Jiri Svoboda
|
---|
3 | * All rights reserved.
|
---|
4 | *
|
---|
5 | * Redistribution and use in source and binary forms, with or without
|
---|
6 | * modification, are permitted provided that the following conditions
|
---|
7 | * are met:
|
---|
8 | *
|
---|
9 | * - Redistributions of source code must retain the above copyright
|
---|
10 | * notice, this list of conditions and the following disclaimer.
|
---|
11 | * - Redistributions in binary form must reproduce the above copyright
|
---|
12 | * notice, this list of conditions and the following disclaimer in the
|
---|
13 | * documentation and/or other materials provided with the distribution.
|
---|
14 | * - The name of the author may not be used to endorse or promote products
|
---|
15 | * derived from this software without specific prior written permission.
|
---|
16 | *
|
---|
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
---|
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
---|
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
---|
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
---|
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
---|
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
---|
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
---|
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
---|
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
---|
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
---|
27 | */
|
---|
28 |
|
---|
29 | /** @addtogroup loc
|
---|
30 | * @{
|
---|
31 | */
|
---|
32 | /** @file Categories for location service.
|
---|
33 | */
|
---|
34 |
|
---|
35 | #include <adt/list.h>
|
---|
36 | #include <errno.h>
|
---|
37 | #include <fibril_synch.h>
|
---|
38 | #include <stdlib.h>
|
---|
39 | #include <str.h>
|
---|
40 |
|
---|
41 | #include "category.h"
|
---|
42 | #include "loc.h"
|
---|
43 |
|
---|
44 | /** Initialize category directory. */
|
---|
45 | void categ_dir_init(categ_dir_t *cdir)
|
---|
46 | {
|
---|
47 | fibril_mutex_initialize(&cdir->mutex);
|
---|
48 | list_initialize(&cdir->categories);
|
---|
49 | }
|
---|
50 |
|
---|
51 | /** Add new category to directory. */
|
---|
52 | void categ_dir_add_cat(categ_dir_t *cdir, category_t *cat)
|
---|
53 | {
|
---|
54 | list_append(&cat->cat_list, &cdir->categories);
|
---|
55 | }
|
---|
56 |
|
---|
57 | /** Get list of categories. */
|
---|
58 | int categ_dir_get_categories(categ_dir_t *cdir, category_id_t *id_buf,
|
---|
59 | size_t buf_size, size_t *act_size)
|
---|
60 | {
|
---|
61 | size_t act_cnt;
|
---|
62 | size_t buf_cnt;
|
---|
63 |
|
---|
64 | assert(fibril_mutex_is_locked(&cdir->mutex));
|
---|
65 |
|
---|
66 | buf_cnt = buf_size / sizeof(category_id_t);
|
---|
67 |
|
---|
68 | act_cnt = list_count(&cdir->categories);
|
---|
69 | *act_size = act_cnt * sizeof(category_id_t);
|
---|
70 |
|
---|
71 | if (buf_size % sizeof(category_id_t) != 0)
|
---|
72 | return EINVAL;
|
---|
73 |
|
---|
74 | size_t pos = 0;
|
---|
75 | list_foreach(cdir->categories, item) {
|
---|
76 | category_t *cat =
|
---|
77 | list_get_instance(item, category_t, cat_list);
|
---|
78 |
|
---|
79 | if (pos < buf_cnt)
|
---|
80 | id_buf[pos] = cat->id;
|
---|
81 | pos++;
|
---|
82 | }
|
---|
83 |
|
---|
84 | return EOK;
|
---|
85 | }
|
---|
86 |
|
---|
87 |
|
---|
88 | /** Initialize category structure. */
|
---|
89 | static void category_init(category_t *cat, const char *name)
|
---|
90 | {
|
---|
91 | fibril_mutex_initialize(&cat->mutex);
|
---|
92 | cat->name = str_dup(name);
|
---|
93 | cat->id = loc_create_id();
|
---|
94 | link_initialize(&cat->cat_list);
|
---|
95 | list_initialize(&cat->svc_memb);
|
---|
96 | }
|
---|
97 |
|
---|
98 | /** Allocate new category. */
|
---|
99 | category_t *category_new(const char *name)
|
---|
100 | {
|
---|
101 | category_t *cat;
|
---|
102 |
|
---|
103 | cat = malloc(sizeof(category_t));
|
---|
104 | if (cat == NULL)
|
---|
105 | return NULL;
|
---|
106 |
|
---|
107 | category_init(cat, name);
|
---|
108 | return cat;
|
---|
109 | }
|
---|
110 |
|
---|
111 | /** Add service to category. */
|
---|
112 | int category_add_service(category_t *cat, loc_service_t *svc)
|
---|
113 | {
|
---|
114 | assert(fibril_mutex_is_locked(&cat->mutex));
|
---|
115 | assert(fibril_mutex_is_locked(&services_list_mutex));
|
---|
116 |
|
---|
117 | /* Verify that category does not contain this service yet. */
|
---|
118 | list_foreach(cat->svc_memb, item) {
|
---|
119 | svc_categ_t *memb = list_get_instance(item, svc_categ_t,
|
---|
120 | cat_link);
|
---|
121 | if (memb->svc == svc) {
|
---|
122 | return EEXIST;
|
---|
123 | }
|
---|
124 | }
|
---|
125 |
|
---|
126 | svc_categ_t *nmemb = malloc(sizeof(svc_categ_t));
|
---|
127 | if (nmemb == NULL)
|
---|
128 | return ENOMEM;
|
---|
129 |
|
---|
130 | nmemb->svc = svc;
|
---|
131 | nmemb->cat = cat;
|
---|
132 |
|
---|
133 | list_append(&nmemb->cat_link, &cat->svc_memb);
|
---|
134 | list_append(&nmemb->svc_link, &svc->cat_memb);
|
---|
135 |
|
---|
136 | return EOK;
|
---|
137 | }
|
---|
138 |
|
---|
139 | /** Remove service from category. */
|
---|
140 | void category_remove_service(svc_categ_t *memb)
|
---|
141 | {
|
---|
142 | assert(fibril_mutex_is_locked(&memb->cat->mutex));
|
---|
143 | assert(fibril_mutex_is_locked(&services_list_mutex));
|
---|
144 |
|
---|
145 | list_remove(&memb->cat_link);
|
---|
146 | list_remove(&memb->svc_link);
|
---|
147 |
|
---|
148 | free(memb);
|
---|
149 | }
|
---|
150 |
|
---|
151 | /** Get category by ID. */
|
---|
152 | category_t *category_get(categ_dir_t *cdir, catid_t catid)
|
---|
153 | {
|
---|
154 | assert(fibril_mutex_is_locked(&cdir->mutex));
|
---|
155 |
|
---|
156 | list_foreach(cdir->categories, item) {
|
---|
157 | category_t *cat = list_get_instance(item, category_t,
|
---|
158 | cat_list);
|
---|
159 | if (cat->id == catid)
|
---|
160 | return cat;
|
---|
161 | }
|
---|
162 |
|
---|
163 | return NULL;
|
---|
164 | }
|
---|
165 |
|
---|
166 | /** Find category by name. */
|
---|
167 | category_t *category_find_by_name(categ_dir_t *cdir, const char *name)
|
---|
168 | {
|
---|
169 | assert(fibril_mutex_is_locked(&cdir->mutex));
|
---|
170 |
|
---|
171 | list_foreach(cdir->categories, item) {
|
---|
172 | category_t *cat = list_get_instance(item, category_t,
|
---|
173 | cat_list);
|
---|
174 | if (str_cmp(cat->name, name) == 0)
|
---|
175 | return cat;
|
---|
176 | }
|
---|
177 |
|
---|
178 | return NULL;
|
---|
179 | }
|
---|
180 |
|
---|
181 | /** Get list of services in category. */
|
---|
182 | int category_get_services(category_t *cat, service_id_t *id_buf,
|
---|
183 | size_t buf_size, size_t *act_size)
|
---|
184 | {
|
---|
185 | size_t act_cnt;
|
---|
186 | size_t buf_cnt;
|
---|
187 |
|
---|
188 | assert(fibril_mutex_is_locked(&cat->mutex));
|
---|
189 |
|
---|
190 | buf_cnt = buf_size / sizeof(service_id_t);
|
---|
191 |
|
---|
192 | act_cnt = list_count(&cat->svc_memb);
|
---|
193 | *act_size = act_cnt * sizeof(service_id_t);
|
---|
194 |
|
---|
195 | if (buf_size % sizeof(service_id_t) != 0)
|
---|
196 | return EINVAL;
|
---|
197 |
|
---|
198 | size_t pos = 0;
|
---|
199 | list_foreach(cat->svc_memb, item) {
|
---|
200 | svc_categ_t *memb =
|
---|
201 | list_get_instance(item, svc_categ_t, cat_link);
|
---|
202 |
|
---|
203 | if (pos < buf_cnt)
|
---|
204 | id_buf[pos] = memb->svc->id;
|
---|
205 | pos++;
|
---|
206 | }
|
---|
207 |
|
---|
208 | return EOK;
|
---|
209 | }
|
---|
210 |
|
---|
211 | /**
|
---|
212 | * @}
|
---|
213 | */
|
---|