Rev 2071 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
1321 | vana | 1 | /* |
2071 | jermar | 2 | * Copyright (c) 2006 Jakub Vana |
1321 | vana | 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 | |||
1757 | jermar | 29 | /** @addtogroup generic |
1702 | cejka | 30 | * @{ |
31 | */ |
||
32 | /** @file |
||
33 | */ |
||
34 | |||
1317 | vana | 35 | #include <sysinfo/sysinfo.h> |
36 | #include <mm/slab.h> |
||
37 | #include <print.h> |
||
1318 | vana | 38 | #include <syscall/copy.h> |
1317 | vana | 39 | |
1326 | decky | 40 | sysinfo_item_t *_root = NULL; |
1317 | vana | 41 | |
42 | |||
1326 | decky | 43 | static sysinfo_item_t *sysinfo_find_item(const char *name, sysinfo_item_t *subtree) |
1317 | vana | 44 | { |
1326 | decky | 45 | if (subtree == NULL) |
46 | return NULL; |
||
47 | |||
48 | while (subtree != NULL) { |
||
49 | int i = 0; |
||
50 | char *a = (char *) name; |
||
51 | char *b = subtree->name; |
||
52 | |||
53 | while ((a[i] == b[i]) && (b[i])) |
||
54 | i++; |
||
55 | |||
56 | if ((!a[i]) && (!b[i])) /* Last name in path matches */ |
||
57 | return subtree; |
||
58 | |||
59 | if ((a[i] == '.') && (!b[i])) { /* Middle name in path matches */ |
||
60 | if (subtree->subinfo_type == SYSINFO_SUBINFO_TABLE) |
||
61 | return sysinfo_find_item(a + i + 1, subtree->subinfo.table); |
||
62 | |||
63 | //if (subtree->subinfo_type == SYSINFO_SUBINFO_FUNCTION) /* Subinfo managed by subsystem */ |
||
64 | // return NULL; |
||
65 | |||
66 | return NULL; /* No subinfo */ |
||
1317 | vana | 67 | } |
1326 | decky | 68 | /* No matches try next */ |
69 | subtree = subtree->next; |
||
70 | i = 0; |
||
1317 | vana | 71 | } |
72 | return NULL; |
||
73 | } |
||
74 | |||
1326 | decky | 75 | static sysinfo_item_t *sysinfo_create_path(const char *name, sysinfo_item_t **psubtree) |
1317 | vana | 76 | { |
77 | sysinfo_item_t *subtree; |
||
78 | subtree = *psubtree; |
||
79 | |||
1326 | decky | 80 | if (subtree == NULL) { |
1880 | jermar | 81 | sysinfo_item_t *item = malloc(sizeof(sysinfo_item_t), 0); |
82 | int i = 0, j; |
||
1317 | vana | 83 | |
1880 | jermar | 84 | ASSERT(item); |
85 | *psubtree = item; |
||
86 | item->next = NULL; |
||
87 | item->val_type = SYSINFO_VAL_UNDEFINED; |
||
88 | item->subinfo.table = NULL; |
||
1317 | vana | 89 | |
1880 | jermar | 90 | while (name[i] && (name[i] != '.')) |
91 | i++; |
||
1317 | vana | 92 | |
1880 | jermar | 93 | item->name = malloc(i, 0); |
94 | ASSERT(item->name); |
||
1317 | vana | 95 | |
1880 | jermar | 96 | for (j = 0; j < i; j++) |
97 | item->name[j] = name[j]; |
||
98 | item->name[j] = 0; |
||
1317 | vana | 99 | |
1880 | jermar | 100 | if (name[i]) { /* =='.' */ |
101 | item->subinfo_type = SYSINFO_SUBINFO_TABLE; |
||
102 | return sysinfo_create_path(name + i + 1, &(item->subinfo.table)); |
||
103 | } |
||
104 | item->subinfo_type = SYSINFO_SUBINFO_NONE; |
||
105 | return item; |
||
1317 | vana | 106 | } |
107 | |||
1326 | decky | 108 | while (subtree != NULL) { |
109 | int i = 0, j; |
||
110 | char *a = (char *) name; |
||
111 | char *b = subtree->name; |
||
112 | |||
113 | while ((a[i] == b[i]) && (b[i])) |
||
114 | i++; |
||
115 | |||
116 | if ((!a[i]) && (!b[i])) /* Last name in path matches */ |
||
117 | return subtree; |
||
118 | |||
119 | if ((a[i] == '.') && (!b[i])) { /* Middle name in path matches */ |
||
120 | if (subtree->subinfo_type == SYSINFO_SUBINFO_TABLE) |
||
121 | return sysinfo_create_path(a + i + 1, &(subtree->subinfo.table)); |
||
122 | |||
123 | if (subtree->subinfo_type == SYSINFO_SUBINFO_NONE) { |
||
124 | subtree->subinfo_type = SYSINFO_SUBINFO_TABLE; |
||
125 | return sysinfo_create_path(a + i + 1,&(subtree->subinfo.table)); |
||
126 | } |
||
127 | |||
128 | //if (subtree->subinfo_type == SYSINFO_SUBINFO_FUNCTION) /* Subinfo managed by subsystem */ |
||
129 | // return NULL; |
||
130 | |||
1317 | vana | 131 | return NULL; |
132 | } |
||
133 | /* No matches try next or create new*/ |
||
1326 | decky | 134 | if (subtree->next == NULL) { |
135 | sysinfo_item_t *item = malloc(sizeof(sysinfo_item_t), 0); |
||
1317 | vana | 136 | |
137 | ASSERT(item); |
||
1326 | decky | 138 | subtree->next = item; |
139 | item->next = NULL; |
||
140 | item->val_type = SYSINFO_VAL_UNDEFINED; |
||
141 | item->subinfo.table = NULL; |
||
1317 | vana | 142 | |
1326 | decky | 143 | i = 0; |
144 | while (name[i] && (name[i] != '.')) |
||
145 | i++; |
||
1317 | vana | 146 | |
1326 | decky | 147 | item->name = malloc(i, 0); |
148 | ASSERT(item->name); |
||
149 | |||
150 | for (j = 0; j < i; j++) |
||
151 | item->name[j] = name[j]; |
||
152 | |||
153 | item->name[j] = 0; |
||
1317 | vana | 154 | |
1326 | decky | 155 | if(name[i]) { /* =='.' */ |
156 | item->subinfo_type = SYSINFO_SUBINFO_TABLE; |
||
157 | return sysinfo_create_path(name + i + 1, &(item->subinfo.table)); |
||
1317 | vana | 158 | } |
1326 | decky | 159 | item->subinfo_type = SYSINFO_SUBINFO_NONE; |
1317 | vana | 160 | return item; |
1326 | decky | 161 | } else { |
162 | subtree = subtree->next; |
||
163 | i = 0; |
||
1317 | vana | 164 | } |
165 | } |
||
166 | panic("Not reached\n"); |
||
167 | return NULL; |
||
168 | } |
||
169 | |||
1780 | jermar | 170 | void sysinfo_set_item_val(const char *name, sysinfo_item_t **root, unative_t val) |
1317 | vana | 171 | { |
1326 | decky | 172 | if (root == NULL) |
173 | root = &_root; |
||
174 | |||
175 | /* If already created create only returns pointer |
||
176 | If not, create it */ |
||
177 | sysinfo_item_t *item = sysinfo_create_path(name, root); |
||
178 | |||
179 | if (item != NULL) { /* If in subsystem, unable to create or return so unable to set */ |
||
3056 | decky | 180 | item->val.val = val; |
1326 | decky | 181 | item->val_type = SYSINFO_VAL_VAL; |
182 | } |
||
1317 | vana | 183 | } |
184 | |||
1326 | decky | 185 | void sysinfo_set_item_function(const char *name, sysinfo_item_t **root, sysinfo_val_fn_t fn) |
1317 | vana | 186 | { |
1326 | decky | 187 | if (root == NULL) |
188 | root = &_root; |
||
189 | |||
190 | /* If already created create only returns pointer |
||
191 | If not, create it */ |
||
192 | sysinfo_item_t *item = sysinfo_create_path(name, root); |
||
193 | |||
194 | if (item != NULL) { /* If in subsystem, unable to create or return so unable to set */ |
||
3056 | decky | 195 | item->val.fn = fn; |
1326 | decky | 196 | item->val_type = SYSINFO_VAL_FUNCTION; |
197 | } |
||
1317 | vana | 198 | } |
199 | |||
200 | |||
1326 | decky | 201 | void sysinfo_set_item_undefined(const char *name, sysinfo_item_t **root) |
1317 | vana | 202 | { |
1326 | decky | 203 | if (root == NULL) |
204 | root = &_root; |
||
205 | |||
206 | /* If already created create only returns pointer |
||
207 | If not, create it */ |
||
208 | sysinfo_item_t *item = sysinfo_create_path(name, root); |
||
209 | |||
210 | if (item != NULL) |
||
211 | item->val_type = SYSINFO_VAL_UNDEFINED; |
||
1317 | vana | 212 | } |
213 | |||
214 | |||
1326 | decky | 215 | void sysinfo_dump(sysinfo_item_t **proot, int depth) |
1317 | vana | 216 | { |
217 | sysinfo_item_t *root; |
||
1326 | decky | 218 | if (proot == NULL) |
219 | proot = &_root; |
||
220 | |||
1317 | vana | 221 | root = *proot; |
222 | |||
1326 | decky | 223 | while (root != NULL) { |
1317 | vana | 224 | int i; |
1780 | jermar | 225 | unative_t val = 0; |
1326 | decky | 226 | char *vtype = NULL; |
1317 | vana | 227 | |
228 | |||
1326 | decky | 229 | for (i = 0; i < depth; i++) |
230 | printf(" "); |
||
1317 | vana | 231 | |
1326 | decky | 232 | switch (root->val_type) { |
2015 | jermar | 233 | case SYSINFO_VAL_UNDEFINED: |
234 | val = 0; |
||
235 | vtype = "UND"; |
||
236 | break; |
||
237 | case SYSINFO_VAL_VAL: |
||
238 | val = root->val.val; |
||
239 | vtype = "VAL"; |
||
240 | break; |
||
241 | case SYSINFO_VAL_FUNCTION: |
||
242 | val = ((sysinfo_val_fn_t) (root->val.fn)) (root); |
||
243 | vtype = "FUN"; |
||
244 | break; |
||
1326 | decky | 245 | } |
1317 | vana | 246 | |
3056 | decky | 247 | printf("%s %s val:%" PRIun "(%" PRIxn ") sub:%s\n", root->name, vtype, val, |
2015 | jermar | 248 | val, (root->subinfo_type == SYSINFO_SUBINFO_NONE) ? |
249 | "NON" : ((root->subinfo_type == SYSINFO_SUBINFO_TABLE) ? |
||
250 | "TAB" : "FUN")); |
||
1317 | vana | 251 | |
1326 | decky | 252 | if (root->subinfo_type == SYSINFO_SUBINFO_TABLE) |
253 | sysinfo_dump(&(root -> subinfo.table), depth + 1); |
||
254 | |||
255 | root = root->next; |
||
256 | } |
||
1317 | vana | 257 | } |
258 | |||
1326 | decky | 259 | sysinfo_rettype_t sysinfo_get_val(const char *name, sysinfo_item_t **root) |
1317 | vana | 260 | { |
1326 | decky | 261 | // TODO: Implement Subsystem subinfo (by function implemented subinfo) |
1317 | vana | 262 | |
1326 | decky | 263 | sysinfo_rettype_t ret = {0, false}; |
1317 | vana | 264 | |
1326 | decky | 265 | if (root == NULL) |
266 | root = &_root; |
||
267 | |||
268 | sysinfo_item_t *item = sysinfo_find_item(name, *root); |
||
269 | |||
270 | if (item != NULL) { |
||
271 | if (item->val_type == SYSINFO_VAL_UNDEFINED) |
||
1317 | vana | 272 | return ret; |
1326 | decky | 273 | else |
274 | ret.valid = true; |
||
275 | |||
276 | if (item->val_type == SYSINFO_VAL_VAL) |
||
277 | ret.val = item->val.val; |
||
278 | else |
||
279 | ret.val = ((sysinfo_val_fn_t) (item->val.fn)) (item); |
||
1317 | vana | 280 | } |
281 | return ret; |
||
282 | } |
||
1318 | vana | 283 | |
1780 | jermar | 284 | unative_t sys_sysinfo_valid(unative_t ptr, unative_t len) |
1318 | vana | 285 | { |
286 | char *str; |
||
1326 | decky | 287 | sysinfo_rettype_t ret = {0, 0}; |
288 | str = malloc(len + 1, 0); |
||
289 | |||
1318 | vana | 290 | ASSERT(str); |
1326 | decky | 291 | if (!((copy_from_uspace(str, (void *) ptr, len + 1)) || (str[len]))) |
292 | ret = sysinfo_get_val(str, NULL); |
||
293 | |||
1318 | vana | 294 | free(str); |
295 | return ret.valid; |
||
296 | } |
||
297 | |||
1780 | jermar | 298 | unative_t sys_sysinfo_value(unative_t ptr, unative_t len) |
1318 | vana | 299 | { |
300 | char *str; |
||
1326 | decky | 301 | sysinfo_rettype_t ret = {0, 0}; |
302 | str = malloc(len + 1, 0); |
||
303 | |||
1318 | vana | 304 | ASSERT(str); |
1326 | decky | 305 | if (!((copy_from_uspace(str, (void *) ptr, len + 1)) || (str[len]))) |
306 | ret = sysinfo_get_val(str, NULL); |
||
307 | |||
1318 | vana | 308 | free(str); |
309 | return ret.val; |
||
310 | } |
||
1702 | cejka | 311 | |
1757 | jermar | 312 | /** @} |
1702 | cejka | 313 | */ |