source: mainline/uspace/srv/devman/devman.c@ 4087a33

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 4087a33 was 4087a33, checked in by Vojtech Horky <vojtechhorky@…>, 15 years ago

Bypassed problem in devman id matching

  • Property mode set to 100644
File size: 28.7 KB
Line 
1/*
2 * Copyright (c) 2010 Lenka Trochtova
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 devman
30 * @{
31 */
32
33#include <errno.h>
34#include <fcntl.h>
35#include <sys/stat.h>
36#include <ipc/driver.h>
37#include <ipc/devman.h>
38#include <devmap.h>
39#include <str_error.h>
40
41#include "devman.h"
42
43/* hash table operations */
44
45static hash_index_t devices_hash(unsigned long key[])
46{
47 return key[0] % DEVICE_BUCKETS;
48}
49
50static int devman_devices_compare(unsigned long key[], hash_count_t keys,
51 link_t *item)
52{
53 node_t *dev = hash_table_get_instance(item, node_t, devman_link);
54 return (dev->handle == (devman_handle_t) key[0]);
55}
56
57static int devmap_devices_compare(unsigned long key[], hash_count_t keys,
58 link_t *item)
59{
60 node_t *dev = hash_table_get_instance(item, node_t, devmap_link);
61 return (dev->devmap_handle == (devmap_handle_t) key[0]);
62}
63
64static void devices_remove_callback(link_t *item)
65{
66}
67
68static hash_table_operations_t devman_devices_ops = {
69 .hash = devices_hash,
70 .compare = devman_devices_compare,
71 .remove_callback = devices_remove_callback
72};
73
74static hash_table_operations_t devmap_devices_ops = {
75 .hash = devices_hash,
76 .compare = devmap_devices_compare,
77 .remove_callback = devices_remove_callback
78};
79
80/**
81 * Initialize the list of device driver's.
82 *
83 * @param drv_list the list of device driver's.
84 *
85 */
86void init_driver_list(driver_list_t *drv_list)
87{
88 assert(drv_list != NULL);
89
90 list_initialize(&drv_list->drivers);
91 fibril_mutex_initialize(&drv_list->drivers_mutex);
92}
93
94/** Allocate and initialize a new driver structure.
95 *
96 * @return Driver structure.
97 */
98driver_t *create_driver(void)
99{
100 driver_t *res = malloc(sizeof(driver_t));
101 if (res != NULL)
102 init_driver(res);
103 return res;
104}
105
106/** Add a driver to the list of drivers.
107 *
108 * @param drivers_list List of drivers.
109 * @param drv Driver structure.
110 */
111void add_driver(driver_list_t *drivers_list, driver_t *drv)
112{
113 fibril_mutex_lock(&drivers_list->drivers_mutex);
114 list_prepend(&drv->drivers, &drivers_list->drivers);
115 fibril_mutex_unlock(&drivers_list->drivers_mutex);
116
117 printf(NAME": the '%s' driver was added to the list of available "
118 "drivers.\n", drv->name);
119
120 printf(NAME ": match ids:");
121 link_t *cur;
122 for (cur = drv->match_ids.ids.next; cur != &drv->match_ids.ids; cur = cur->next) {
123 match_id_t *match_id = list_get_instance(cur, match_id_t, link);
124 printf(" %d:%s", match_id->score, match_id->id);
125 }
126 printf("\n");
127}
128
129/** Read match id at the specified position of a string and set the position in
130 * the string to the first character following the id.
131 *
132 * @param buf The position in the input string.
133 * @return The match id.
134 */
135char *read_match_id(char **buf)
136{
137 char *res = NULL;
138 size_t len = get_nonspace_len(*buf);
139
140 if (len > 0) {
141 res = malloc(len + 1);
142 if (res != NULL) {
143 str_ncpy(res, len + 1, *buf, len);
144 *buf += len;
145 }
146 }
147
148 return res;
149}
150
151/**
152 * Read match ids and associated match scores from a string.
153 *
154 * Each match score in the string is followed by its match id.
155 * The match ids and match scores are separated by whitespaces.
156 * Neither match ids nor match scores can contain whitespaces.
157 *
158 * @param buf The string from which the match ids are read.
159 * @param ids The list of match ids into which the match ids and
160 * scores are added.
161 * @return True if at least one match id and associated match score
162 * was successfully read, false otherwise.
163 */
164bool parse_match_ids(char *buf, match_id_list_t *ids)
165{
166 int score = 0;
167 char *id = NULL;
168 int ids_read = 0;
169
170 while (true) {
171 /* skip spaces */
172 if (!skip_spaces(&buf))
173 break;
174
175 /* read score */
176 score = strtoul(buf, &buf, 10);
177
178 /* skip spaces */
179 if (!skip_spaces(&buf))
180 break;
181
182 /* read id */
183 id = read_match_id(&buf);
184 if (NULL == id)
185 break;
186
187 /* create new match_id structure */
188 match_id_t *mid = create_match_id();
189 mid->id = id;
190 mid->score = score;
191
192 /* add it to the list */
193 add_match_id(ids, mid);
194
195 ids_read++;
196 }
197
198 return ids_read > 0;
199}
200
201/**
202 * Read match ids and associated match scores from a file.
203 *
204 * Each match score in the file is followed by its match id.
205 * The match ids and match scores are separated by whitespaces.
206 * Neither match ids nor match scores can contain whitespaces.
207 *
208 * @param buf The path to the file from which the match ids are read.
209 * @param ids The list of match ids into which the match ids and
210 * scores are added.
211 * @return True if at least one match id and associated match score
212 * was successfully read, false otherwise.
213 */
214bool read_match_ids(const char *conf_path, match_id_list_t *ids)
215{
216 printf(NAME ": read_match_ids conf_path = %s.\n", conf_path);
217
218 bool suc = false;
219 char *buf = NULL;
220 bool opened = false;
221 int fd;
222 size_t len = 0;
223
224 fd = open(conf_path, O_RDONLY);
225 if (fd < 0) {
226 printf(NAME ": unable to open %s\n", conf_path);
227 goto cleanup;
228 }
229 opened = true;
230
231 len = lseek(fd, 0, SEEK_END);
232 lseek(fd, 0, SEEK_SET);
233 if (len == 0) {
234 printf(NAME ": configuration file '%s' is empty.\n", conf_path);
235 goto cleanup;
236 }
237
238 buf = malloc(len + 1);
239 if (buf == NULL) {
240 printf(NAME ": memory allocation failed when parsing file "
241 "'%s'.\n", conf_path);
242 goto cleanup;
243 }
244
245 if (read(fd, buf, len) <= 0) {
246 printf(NAME ": unable to read file '%s'.\n", conf_path);
247 goto cleanup;
248 }
249 buf[len] = 0;
250
251 suc = parse_match_ids(buf, ids);
252
253cleanup:
254 free(buf);
255
256 if (opened)
257 close(fd);
258
259 return suc;
260}
261
262/**
263 * Get information about a driver.
264 *
265 * Each driver has its own directory in the base directory.
266 * The name of the driver's directory is the same as the name of the driver.
267 * The driver's directory contains driver's binary (named as the driver without
268 * extension) and the configuration file with match ids for device-to-driver
269 * matching (named as the driver with a special extension).
270 *
271 * This function searches for the driver's directory and containing
272 * configuration files. If all the files needed are found, they are parsed and
273 * the information about the driver is stored in the driver's structure.
274 *
275 * @param base_path The base directory, in which we look for driver's
276 * subdirectory.
277 * @param name The name of the driver.
278 * @param drv The driver structure to fill information in.
279 *
280 * @return True on success, false otherwise.
281 */
282bool get_driver_info(const char *base_path, const char *name, driver_t *drv)
283{
284 printf(NAME ": get_driver_info base_path = %s, name = %s.\n",
285 base_path, name);
286
287 assert(base_path != NULL && name != NULL && drv != NULL);
288
289 bool suc = false;
290 char *match_path = NULL;
291 size_t name_size = 0;
292
293 /* Read the list of match ids from the driver's configuration file. */
294 match_path = get_abs_path(base_path, name, MATCH_EXT);
295 if (match_path == NULL)
296 goto cleanup;
297
298 if (!read_match_ids(match_path, &drv->match_ids))
299 goto cleanup;
300
301 /* Allocate and fill driver's name. */
302 name_size = str_size(name) + 1;
303 drv->name = malloc(name_size);
304 if (drv->name == NULL)
305 goto cleanup;
306 str_cpy(drv->name, name_size, name);
307
308 /* Initialize path with driver's binary. */
309 drv->binary_path = get_abs_path(base_path, name, "");
310 if (drv->binary_path == NULL)
311 goto cleanup;
312
313 /* Check whether the driver's binary exists. */
314 struct stat s;
315 if (stat(drv->binary_path, &s) == ENOENT) { /* FIXME!! */
316 printf(NAME ": driver not found at path %s.", drv->binary_path);
317 goto cleanup;
318 }
319
320 suc = true;
321
322cleanup:
323 if (!suc) {
324 free(drv->binary_path);
325 free(drv->name);
326 /* Set the driver structure to the default state. */
327 init_driver(drv);
328 }
329
330 free(match_path);
331
332 return suc;
333}
334
335/** Lookup drivers in the directory.
336 *
337 * @param drivers_list The list of available drivers.
338 * @param dir_path The path to the directory where we search for drivers.
339 * @return Number of drivers which were found.
340 */
341int lookup_available_drivers(driver_list_t *drivers_list, const char *dir_path)
342{
343 printf(NAME ": lookup_available_drivers, dir = %s \n", dir_path);
344
345 int drv_cnt = 0;
346 DIR *dir = NULL;
347 struct dirent *diren;
348
349 dir = opendir(dir_path);
350
351 if (dir != NULL) {
352 driver_t *drv = create_driver();
353 while ((diren = readdir(dir))) {
354 if (get_driver_info(dir_path, diren->d_name, drv)) {
355 add_driver(drivers_list, drv);
356 drv_cnt++;
357 drv = create_driver();
358 }
359 }
360 delete_driver(drv);
361 closedir(dir);
362 }
363
364 return drv_cnt;
365}
366
367/** Create root device node in the device tree.
368 *
369 * @param tree The device tree.
370 * @return True on success, false otherwise.
371 */
372bool create_root_node(dev_tree_t *tree)
373{
374 node_t *node;
375
376 printf(NAME ": create_root_node\n");
377
378 node = create_dev_node();
379 if (node != NULL) {
380 insert_dev_node(tree, node, clone_string(""), NULL);
381 match_id_t *id = create_match_id();
382 id->id = clone_string("root");
383 id->score = 100;
384 add_match_id(&node->match_ids, id);
385 tree->root_node = node;
386 }
387
388 return node != NULL;
389}
390
391/** Lookup the best matching driver for the specified device in the list of
392 * drivers.
393 *
394 * A match between a device and a driver is found if one of the driver's match
395 * ids match one of the device's match ids. The score of the match is the
396 * product of the driver's and device's score associated with the matching id.
397 * The best matching driver for a device is the driver with the highest score
398 * of the match between the device and the driver.
399 *
400 * @param drivers_list The list of drivers, where we look for the driver
401 * suitable for handling the device.
402 * @param node The device node structure of the device.
403 * @return The best matching driver or NULL if no matching driver
404 * is found.
405 */
406driver_t *find_best_match_driver(driver_list_t *drivers_list, node_t *node)
407{
408 driver_t *best_drv = NULL, *drv = NULL;
409 int best_score = 0, score = 0;
410
411 fibril_mutex_lock(&drivers_list->drivers_mutex);
412
413 link_t *link = drivers_list->drivers.next;
414 while (link != &drivers_list->drivers) {
415 drv = list_get_instance(link, driver_t, drivers);
416 score = get_match_score(drv, node);
417 if (score > best_score) {
418 best_score = score;
419 best_drv = drv;
420 }
421 link = link->next;
422 }
423
424 fibril_mutex_unlock(&drivers_list->drivers_mutex);
425
426 return best_drv;
427}
428
429/** Assign a driver to a device.
430 *
431 * @param node The device's node in the device tree.
432 * @param drv The driver.
433 */
434void attach_driver(node_t *node, driver_t *drv)
435{
436 printf(NAME ": attach_driver %s to device %s\n",
437 drv->name, node->pathname);
438
439 fibril_mutex_lock(&drv->driver_mutex);
440
441 node->drv = drv;
442 list_append(&node->driver_devices, &drv->devices);
443
444 fibril_mutex_unlock(&drv->driver_mutex);
445}
446
447/** Start a driver
448 *
449 * The driver's mutex is assumed to be locked.
450 *
451 * @param drv The driver's structure.
452 * @return True if the driver's task is successfully spawned, false
453 * otherwise.
454 */
455bool start_driver(driver_t *drv)
456{
457 int rc;
458
459 printf(NAME ": start_driver '%s'\n", drv->name);
460
461 rc = task_spawnl(NULL, drv->binary_path, drv->binary_path, NULL);
462 if (rc != EOK) {
463 printf(NAME ": error spawning %s (%s)\n",
464 drv->name, str_error(rc));
465 return false;
466 }
467
468 drv->state = DRIVER_STARTING;
469 return true;
470}
471
472/** Find device driver in the list of device drivers.
473 *
474 * @param drv_list The list of device drivers.
475 * @param drv_name The name of the device driver which is searched.
476 * @return The device driver of the specified name, if it is in the
477 * list, NULL otherwise.
478 */
479driver_t *find_driver(driver_list_t *drv_list, const char *drv_name)
480{
481 driver_t *res = NULL;
482 driver_t *drv = NULL;
483 link_t *link;
484
485 fibril_mutex_lock(&drv_list->drivers_mutex);
486
487 link = drv_list->drivers.next;
488 while (link != &drv_list->drivers) {
489 drv = list_get_instance(link, driver_t, drivers);
490 if (str_cmp(drv->name, drv_name) == 0) {
491 res = drv;
492 break;
493 }
494
495 link = link->next;
496 }
497
498 fibril_mutex_unlock(&drv_list->drivers_mutex);
499
500 return res;
501}
502
503/** Remember the driver's phone.
504 *
505 * @param driver The driver.
506 * @param phone The phone to the driver.
507 */
508void set_driver_phone(driver_t *driver, ipcarg_t phone)
509{
510 fibril_mutex_lock(&driver->driver_mutex);
511 assert(driver->state == DRIVER_STARTING);
512 driver->phone = phone;
513 fibril_mutex_unlock(&driver->driver_mutex);
514}
515
516/** Notify driver about the devices to which it was assigned.
517 *
518 * The driver's mutex must be locked.
519 *
520 * @param driver The driver to which the devices are passed.
521 */
522static void pass_devices_to_driver(driver_t *driver, dev_tree_t *tree)
523{
524 node_t *dev;
525 link_t *link;
526 int phone;
527
528 printf(NAME ": pass_devices_to_driver\n");
529
530 phone = ipc_connect_me_to(driver->phone, DRIVER_DEVMAN, 0, 0);
531 if (phone > 0) {
532
533 link = driver->devices.next;
534 while (link != &driver->devices) {
535 dev = list_get_instance(link, node_t, driver_devices);
536 add_device(phone, driver, dev, tree);
537 link = link->next;
538 }
539
540 ipc_hangup(phone);
541 }
542}
543
544/** Finish the initialization of a driver after it has succesfully started
545 * and after it has registered itself by the device manager.
546 *
547 * Pass devices formerly matched to the driver to the driver and remember the
548 * driver is running and fully functional now.
549 *
550 * @param driver The driver which registered itself as running by the
551 * device manager.
552 */
553void initialize_running_driver(driver_t *driver, dev_tree_t *tree)
554{
555 printf(NAME ": initialize_running_driver\n");
556 fibril_mutex_lock(&driver->driver_mutex);
557
558 /*
559 * Pass devices which have been already assigned to the driver to the
560 * driver.
561 */
562 pass_devices_to_driver(driver, tree);
563
564 /* Change driver's state to running. */
565 driver->state = DRIVER_RUNNING;
566
567 fibril_mutex_unlock(&driver->driver_mutex);
568}
569
570/** Initialize device driver structure.
571 *
572 * @param drv The device driver structure.
573 */
574void init_driver(driver_t *drv)
575{
576 assert(drv != NULL);
577
578 memset(drv, 0, sizeof(driver_t));
579 list_initialize(&drv->match_ids.ids);
580 list_initialize(&drv->devices);
581 fibril_mutex_initialize(&drv->driver_mutex);
582}
583
584/** Device driver structure clean-up.
585 *
586 * @param drv The device driver structure.
587 */
588void clean_driver(driver_t *drv)
589{
590 assert(drv != NULL);
591
592 free_not_null(drv->name);
593 free_not_null(drv->binary_path);
594
595 clean_match_ids(&drv->match_ids);
596
597 init_driver(drv);
598}
599
600/** Delete device driver structure.
601 *
602 * @param drv The device driver structure.
603 */
604void delete_driver(driver_t *drv)
605{
606 assert(drv != NULL);
607
608 clean_driver(drv);
609 free(drv);
610}
611
612/** Create devmap path and name for the device. */
613static void devmap_register_tree_device(node_t *node, dev_tree_t *tree)
614{
615 char *devmap_pathname = NULL;
616 char *devmap_name = NULL;
617
618 asprintf(&devmap_name, "%s", node->pathname);
619 if (devmap_name == NULL)
620 return;
621
622 replace_char(devmap_name, '/', DEVMAP_SEPARATOR);
623
624 asprintf(&devmap_pathname, "%s/%s", DEVMAP_DEVICE_NAMESPACE,
625 devmap_name);
626 if (devmap_pathname == NULL) {
627 free(devmap_name);
628 return;
629 }
630
631 devmap_device_register(devmap_pathname, &node->devmap_handle);
632
633 tree_add_devmap_device(tree, node);
634
635 free(devmap_name);
636 free(devmap_pathname);
637}
638
639
640/** Pass a device to running driver.
641 *
642 * @param drv The driver's structure.
643 * @param node The device's node in the device tree.
644 */
645void add_device(int phone, driver_t *drv, node_t *node, dev_tree_t *tree)
646{
647 printf(NAME ": add_device\n");
648
649 ipcarg_t rc;
650 ipc_call_t answer;
651
652 /* Send the device to the driver. */
653 aid_t req = async_send_1(phone, DRIVER_ADD_DEVICE, node->handle,
654 &answer);
655
656 /* Send the device's name to the driver. */
657 rc = async_data_write_start(phone, node->name,
658 str_size(node->name) + 1);
659 if (rc != EOK) {
660 /* TODO handle error */
661 }
662
663 /* Wait for answer from the driver. */
664 async_wait_for(req, &rc);
665 switch(rc) {
666 case EOK:
667 node->state = DEVICE_USABLE;
668 devmap_register_tree_device(node, tree);
669 break;
670 case ENOENT:
671 node->state = DEVICE_NOT_PRESENT;
672 break;
673 default:
674 node->state = DEVICE_INVALID;
675 }
676
677 return;
678}
679
680/** Find suitable driver for a device and assign the driver to it.
681 *
682 * @param node The device node of the device in the device tree.
683 * @param drivers_list The list of available drivers.
684 * @return True if the suitable driver is found and
685 * successfully assigned to the device, false otherwise.
686 */
687bool assign_driver(node_t *node, driver_list_t *drivers_list, dev_tree_t *tree)
688{
689 /*
690 * Find the driver which is the most suitable for handling this device.
691 */
692 driver_t *drv = find_best_match_driver(drivers_list, node);
693 if (drv == NULL) {
694 printf(NAME ": no driver found for device '%s'.\n",
695 node->pathname);
696 return false;
697 }
698
699 /* Attach the driver to the device. */
700 attach_driver(node, drv);
701
702 if (drv->state == DRIVER_NOT_STARTED) {
703 /* Start the driver. */
704 start_driver(drv);
705 }
706
707 if (drv->state == DRIVER_RUNNING) {
708 /* Notify the driver about the new device. */
709 int phone = ipc_connect_me_to(drv->phone, DRIVER_DEVMAN, 0, 0);
710 if (phone > 0) {
711 add_device(phone, drv, node, tree);
712 ipc_hangup(phone);
713 }
714 }
715
716 return true;
717}
718
719/** Initialize the device tree.
720 *
721 * Create root device node of the tree and assign driver to it.
722 *
723 * @param tree The device tree.
724 * @param drivers_list the list of available drivers.
725 * @return True on success, false otherwise.
726 */
727bool init_device_tree(dev_tree_t *tree, driver_list_t *drivers_list)
728{
729 printf(NAME ": init_device_tree.\n");
730
731 tree->current_handle = 0;
732
733 hash_table_create(&tree->devman_devices, DEVICE_BUCKETS, 1,
734 &devman_devices_ops);
735 hash_table_create(&tree->devmap_devices, DEVICE_BUCKETS, 1,
736 &devmap_devices_ops);
737
738 fibril_rwlock_initialize(&tree->rwlock);
739
740 /* Create root node and add it to the device tree. */
741 if (!create_root_node(tree))
742 return false;
743
744 /* Find suitable driver and start it. */
745 return assign_driver(tree->root_node, drivers_list, tree);
746}
747
748/* Device nodes */
749
750/** Create a new device node.
751 *
752 * @return A device node structure.
753 */
754node_t *create_dev_node(void)
755{
756 node_t *res = malloc(sizeof(node_t));
757
758 if (res != NULL) {
759 memset(res, 0, sizeof(node_t));
760 list_initialize(&res->children);
761 list_initialize(&res->match_ids.ids);
762 list_initialize(&res->classes);
763 }
764
765 return res;
766}
767
768/** Delete a device node.
769 *
770 * @param node The device node structure.
771 */
772void delete_dev_node(node_t *node)
773{
774 assert(list_empty(&node->children));
775 assert(node->parent == NULL);
776 assert(node->drv == NULL);
777
778 clean_match_ids(&node->match_ids);
779 free_not_null(node->name);
780 free_not_null(node->pathname);
781 free(node);
782}
783
784/** Find the device node structure of the device witch has the specified handle.
785 *
786 * Device tree's rwlock should be held at least for reading.
787 *
788 * @param tree The device tree where we look for the device node.
789 * @param handle The handle of the device.
790 * @return The device node.
791 */
792node_t *find_dev_node_no_lock(dev_tree_t *tree, devman_handle_t handle)
793{
794 unsigned long key = handle;
795 link_t *link = hash_table_find(&tree->devman_devices, &key);
796 return hash_table_get_instance(link, node_t, devman_link);
797}
798
799/** Find the device node structure of the device witch has the specified handle.
800 *
801 * @param tree The device tree where we look for the device node.
802 * @param handle The handle of the device.
803 * @return The device node.
804 */
805node_t *find_dev_node(dev_tree_t *tree, devman_handle_t handle)
806{
807 node_t *node = NULL;
808
809 fibril_rwlock_read_lock(&tree->rwlock);
810 node = find_dev_node_no_lock(tree, handle);
811 fibril_rwlock_read_unlock(&tree->rwlock);
812
813 return node;
814}
815
816
817/** Create and set device's full path in device tree.
818 *
819 * @param node The device's device node.
820 * @param parent The parent device node.
821 * @return True on success, false otherwise (insufficient
822 * resources etc.).
823 */
824static bool set_dev_path(node_t *node, node_t *parent)
825{
826 assert(node->name != NULL);
827
828 size_t pathsize = (str_size(node->name) + 1);
829 if (parent != NULL)
830 pathsize += str_size(parent->pathname) + 1;
831
832 node->pathname = (char *) malloc(pathsize);
833 if (node->pathname == NULL) {
834 printf(NAME ": failed to allocate device path.\n");
835 return false;
836 }
837
838 if (parent != NULL) {
839 str_cpy(node->pathname, pathsize, parent->pathname);
840 str_append(node->pathname, pathsize, "/");
841 str_append(node->pathname, pathsize, node->name);
842 } else {
843 str_cpy(node->pathname, pathsize, node->name);
844 }
845
846 return true;
847}
848
849/** Insert new device into device tree.
850 *
851 * The device tree's rwlock should be already held exclusively when calling this
852 * function.
853 *
854 * @param tree The device tree.
855 * @param node The newly added device node.
856 * @param dev_name The name of the newly added device.
857 * @param parent The parent device node.
858 *
859 * @return True on success, false otherwise (insufficient resources
860 * etc.).
861 */
862bool insert_dev_node(dev_tree_t *tree, node_t *node, char *dev_name,
863 node_t *parent)
864{
865 assert(node != NULL);
866 assert(tree != NULL);
867 assert(dev_name != NULL);
868
869 node->name = dev_name;
870 if (!set_dev_path(node, parent)) {
871 fibril_rwlock_write_unlock(&tree->rwlock);
872 return false;
873 }
874
875 /* Add the node to the handle-to-node map. */
876 node->handle = ++tree->current_handle;
877 unsigned long key = node->handle;
878 hash_table_insert(&tree->devman_devices, &key, &node->devman_link);
879
880 /* Add the node to the list of its parent's children. */
881 node->parent = parent;
882 if (parent != NULL)
883 list_append(&node->sibling, &parent->children);
884
885 return true;
886}
887
888/** Find device node with a specified path in the device tree.
889 *
890 * @param path The path of the device node in the device tree.
891 * @param tree The device tree.
892 * @return The device node if it is present in the tree, NULL
893 * otherwise.
894 */
895node_t *find_dev_node_by_path(dev_tree_t *tree, char *path)
896{
897 fibril_rwlock_read_lock(&tree->rwlock);
898
899 node_t *dev = tree->root_node;
900 /*
901 * Relative path to the device from its parent (but with '/' at the
902 * beginning)
903 */
904 char *rel_path = path;
905 char *next_path_elem = NULL;
906 bool cont = (rel_path[0] == '/');
907
908 while (cont && dev != NULL) {
909 next_path_elem = get_path_elem_end(rel_path + 1);
910 if (next_path_elem[0] == '/') {
911 cont = true;
912 next_path_elem[0] = 0;
913 } else {
914 cont = false;
915 }
916
917 dev = find_node_child(dev, rel_path + 1);
918
919 if (cont) {
920 /* Restore the original path. */
921 next_path_elem[0] = '/';
922 }
923 rel_path = next_path_elem;
924 }
925
926 fibril_rwlock_read_unlock(&tree->rwlock);
927
928 return dev;
929}
930
931/** Find child device node with a specified name.
932 *
933 * Device tree rwlock should be held at least for reading.
934 *
935 * @param parent The parent device node.
936 * @param name The name of the child device node.
937 * @return The child device node.
938 */
939node_t *find_node_child(node_t *parent, const char *name)
940{
941 node_t *dev;
942 link_t *link;
943
944 link = parent->children.next;
945
946 while (link != &parent->children) {
947 dev = list_get_instance(link, node_t, sibling);
948
949 if (str_cmp(name, dev->name) == 0)
950 return dev;
951
952 link = link->next;
953 }
954
955 return NULL;
956}
957
958/* Device classes */
959
960/** Create device class.
961 *
962 * @return Device class.
963 */
964dev_class_t *create_dev_class(void)
965{
966 dev_class_t *cl;
967
968 cl = (dev_class_t *) malloc(sizeof(dev_class_t));
969 if (cl != NULL) {
970 memset(cl, 0, sizeof(dev_class_t));
971 list_initialize(&cl->devices);
972 fibril_mutex_initialize(&cl->mutex);
973 }
974
975 return cl;
976}
977
978/** Create device class info.
979 *
980 * @return Device class info.
981 */
982dev_class_info_t *create_dev_class_info(void)
983{
984 dev_class_info_t *info;
985
986 info = (dev_class_info_t *) malloc(sizeof(dev_class_info_t));
987 if (info != NULL)
988 memset(info, 0, sizeof(dev_class_info_t));
989
990 return info;
991}
992
993size_t get_new_class_dev_idx(dev_class_t *cl)
994{
995 size_t dev_idx;
996
997 fibril_mutex_lock(&cl->mutex);
998 dev_idx = ++cl->curr_dev_idx;
999 fibril_mutex_unlock(&cl->mutex);
1000
1001 return dev_idx;
1002}
1003
1004
1005/** Create unique device name within the class.
1006 *
1007 * @param cl The class.
1008 * @param base_dev_name Contains the base name for the device if it was
1009 * specified by the driver when it registered the device by
1010 * the class; NULL if driver specified no base name.
1011 * @return The unique name for the device within the class.
1012 */
1013char *create_dev_name_for_class(dev_class_t *cl, const char *base_dev_name)
1014{
1015 char *dev_name;
1016 const char *base_name;
1017
1018 if (base_dev_name != NULL)
1019 base_name = base_dev_name;
1020 else
1021 base_name = cl->base_dev_name;
1022
1023 size_t idx = get_new_class_dev_idx(cl);
1024 asprintf(&dev_name, "%s%d", base_name, idx);
1025
1026 return dev_name;
1027}
1028
1029/** Add the device to the class.
1030 *
1031 * The device may be added to multiple classes and a class may contain multiple
1032 * devices. The class and the device are associated with each other by the
1033 * dev_class_info_t structure.
1034 *
1035 * @param dev The device.
1036 * @param class The class.
1037 * @param base_dev_name The base name of the device within the class if
1038 * specified by the driver, NULL otherwise.
1039 * @return dev_class_info_t structure which associates the device
1040 * with the class.
1041 */
1042dev_class_info_t *add_device_to_class(node_t *dev, dev_class_t *cl,
1043 const char *base_dev_name)
1044{
1045 dev_class_info_t *info = create_dev_class_info();
1046
1047 if (info != NULL) {
1048 info->dev_class = cl;
1049 info->dev = dev;
1050
1051 /* Add the device to the class. */
1052 fibril_mutex_lock(&cl->mutex);
1053 list_append(&info->link, &cl->devices);
1054 fibril_mutex_unlock(&cl->mutex);
1055
1056 /* Add the class to the device. */
1057 list_append(&info->dev_classes, &dev->classes);
1058
1059 /* Create unique name for the device within the class. */
1060 info->dev_name = create_dev_name_for_class(cl, base_dev_name);
1061 }
1062
1063 return info;
1064}
1065
1066dev_class_t *get_dev_class(class_list_t *class_list, char *class_name)
1067{
1068 dev_class_t *cl;
1069
1070 fibril_rwlock_write_lock(&class_list->rwlock);
1071 cl = find_dev_class_no_lock(class_list, class_name);
1072 if (cl == NULL) {
1073 cl = create_dev_class();
1074 if (cl != NULL) {
1075 cl->name = class_name;
1076 cl->base_dev_name = "";
1077 add_dev_class_no_lock(class_list, cl);
1078 }
1079 }
1080
1081 fibril_rwlock_write_unlock(&class_list->rwlock);
1082 return cl;
1083}
1084
1085dev_class_t *find_dev_class_no_lock(class_list_t *class_list,
1086 const char *class_name)
1087{
1088 dev_class_t *cl;
1089 link_t *link = class_list->classes.next;
1090
1091 while (link != &class_list->classes) {
1092 cl = list_get_instance(link, dev_class_t, link);
1093 if (str_cmp(cl->name, class_name) == 0)
1094 return cl;
1095 }
1096
1097 return NULL;
1098}
1099
1100void add_dev_class_no_lock(class_list_t *class_list, dev_class_t *cl)
1101{
1102 list_append(&cl->link, &class_list->classes);
1103}
1104
1105void init_class_list(class_list_t *class_list)
1106{
1107 list_initialize(&class_list->classes);
1108 fibril_rwlock_initialize(&class_list->rwlock);
1109 hash_table_create(&class_list->devmap_devices, DEVICE_BUCKETS, 1,
1110 &devmap_devices_ops);
1111}
1112
1113
1114/* Devmap devices */
1115
1116node_t *find_devmap_tree_device(dev_tree_t *tree, devmap_handle_t devmap_handle)
1117{
1118 node_t *dev = NULL;
1119 link_t *link;
1120 unsigned long key = (unsigned long) devmap_handle;
1121
1122 fibril_rwlock_read_lock(&tree->rwlock);
1123 link = hash_table_find(&tree->devmap_devices, &key);
1124 if (link != NULL)
1125 dev = hash_table_get_instance(link, node_t, devmap_link);
1126 fibril_rwlock_read_unlock(&tree->rwlock);
1127
1128 return dev;
1129}
1130
1131node_t *find_devmap_class_device(class_list_t *classes,
1132 devmap_handle_t devmap_handle)
1133{
1134 node_t *dev = NULL;
1135 dev_class_info_t *cli;
1136 link_t *link;
1137 unsigned long key = (unsigned long)devmap_handle;
1138
1139 fibril_rwlock_read_lock(&classes->rwlock);
1140 link = hash_table_find(&classes->devmap_devices, &key);
1141 if (link != NULL) {
1142 cli = hash_table_get_instance(link, dev_class_info_t,
1143 devmap_link);
1144 dev = cli->dev;
1145 }
1146 fibril_rwlock_read_unlock(&classes->rwlock);
1147
1148 return dev;
1149}
1150
1151void class_add_devmap_device(class_list_t *class_list, dev_class_info_t *cli)
1152{
1153 unsigned long key = (unsigned long) cli->devmap_handle;
1154
1155 fibril_rwlock_write_lock(&class_list->rwlock);
1156 hash_table_insert(&class_list->devmap_devices, &key, &cli->devmap_link);
1157 fibril_rwlock_write_unlock(&class_list->rwlock);
1158}
1159
1160void tree_add_devmap_device(dev_tree_t *tree, node_t *node)
1161{
1162 unsigned long key = (unsigned long) node->devmap_handle;
1163 fibril_rwlock_write_lock(&tree->rwlock);
1164 hash_table_insert(&tree->devmap_devices, &key, &node->devmap_link);
1165 fibril_rwlock_write_unlock(&tree->rwlock);
1166}
1167
1168/** @}
1169 */
Note: See TracBrowser for help on using the repository browser.