source: mainline/uspace/srv/devman/devman.c@ 14c5005

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 14c5005 was 4820360, checked in by Jiri Svoboda <jiri@…>, 13 years ago

Synchronize device tree transitions.

  • Property mode set to 100644
File size: 36.5 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/** @file Device Manager
33 *
34 * Locking order:
35 * (1) driver_t.driver_mutex
36 * (2) dev_tree_t.rwlock
37 *
38 * Synchronization:
39 * - device_tree.rwlock protects:
40 * - tree root, complete tree topology
41 * - complete contents of device and function nodes
42 * - dev_node_t.refcnt, fun_node_t.refcnt prevent nodes from
43 * being deallocated
44 * - find_xxx() functions increase reference count of returned object
45 * - find_xxx_no_lock() do not increase reference count
46 *
47 * TODO
48 * - Track all steady and transient device/function states
49 * - Check states, wait for steady state on certain operations
50 */
51
52#include <errno.h>
53#include <fcntl.h>
54#include <sys/stat.h>
55#include <io/log.h>
56#include <ipc/driver.h>
57#include <ipc/devman.h>
58#include <loc.h>
59#include <str_error.h>
60#include <stdio.h>
61
62#include "devman.h"
63
64static fun_node_t *find_node_child(dev_tree_t *, fun_node_t *, const char *);
65
66/* hash table operations */
67
68static hash_index_t devices_hash(unsigned long key[])
69{
70 return key[0] % DEVICE_BUCKETS;
71}
72
73static int devman_devices_compare(unsigned long key[], hash_count_t keys,
74 link_t *item)
75{
76 dev_node_t *dev = hash_table_get_instance(item, dev_node_t, devman_dev);
77 return (dev->handle == (devman_handle_t) key[0]);
78}
79
80static int devman_functions_compare(unsigned long key[], hash_count_t keys,
81 link_t *item)
82{
83 fun_node_t *fun = hash_table_get_instance(item, fun_node_t, devman_fun);
84 return (fun->handle == (devman_handle_t) key[0]);
85}
86
87static int loc_functions_compare(unsigned long key[], hash_count_t keys,
88 link_t *item)
89{
90 fun_node_t *fun = hash_table_get_instance(item, fun_node_t, loc_fun);
91 return (fun->service_id == (service_id_t) key[0]);
92}
93
94static void devices_remove_callback(link_t *item)
95{
96}
97
98static hash_table_operations_t devman_devices_ops = {
99 .hash = devices_hash,
100 .compare = devman_devices_compare,
101 .remove_callback = devices_remove_callback
102};
103
104static hash_table_operations_t devman_functions_ops = {
105 .hash = devices_hash,
106 .compare = devman_functions_compare,
107 .remove_callback = devices_remove_callback
108};
109
110static hash_table_operations_t loc_devices_ops = {
111 .hash = devices_hash,
112 .compare = loc_functions_compare,
113 .remove_callback = devices_remove_callback
114};
115
116/**
117 * Initialize the list of device driver's.
118 *
119 * @param drv_list the list of device driver's.
120 *
121 */
122void init_driver_list(driver_list_t *drv_list)
123{
124 assert(drv_list != NULL);
125
126 list_initialize(&drv_list->drivers);
127 fibril_mutex_initialize(&drv_list->drivers_mutex);
128}
129
130/** Allocate and initialize a new driver structure.
131 *
132 * @return Driver structure.
133 */
134driver_t *create_driver(void)
135{
136 driver_t *res = malloc(sizeof(driver_t));
137 if (res != NULL)
138 init_driver(res);
139 return res;
140}
141
142/** Add a driver to the list of drivers.
143 *
144 * @param drivers_list List of drivers.
145 * @param drv Driver structure.
146 */
147void add_driver(driver_list_t *drivers_list, driver_t *drv)
148{
149 fibril_mutex_lock(&drivers_list->drivers_mutex);
150 list_prepend(&drv->drivers, &drivers_list->drivers);
151 fibril_mutex_unlock(&drivers_list->drivers_mutex);
152
153 log_msg(LVL_NOTE, "Driver `%s' was added to the list of available "
154 "drivers.", drv->name);
155}
156
157/** Read match id at the specified position of a string and set the position in
158 * the string to the first character following the id.
159 *
160 * @param buf The position in the input string.
161 * @return The match id.
162 */
163char *read_match_id(char **buf)
164{
165 char *res = NULL;
166 size_t len = get_nonspace_len(*buf);
167
168 if (len > 0) {
169 res = malloc(len + 1);
170 if (res != NULL) {
171 str_ncpy(res, len + 1, *buf, len);
172 *buf += len;
173 }
174 }
175
176 return res;
177}
178
179/**
180 * Read match ids and associated match scores from a string.
181 *
182 * Each match score in the string is followed by its match id.
183 * The match ids and match scores are separated by whitespaces.
184 * Neither match ids nor match scores can contain whitespaces.
185 *
186 * @param buf The string from which the match ids are read.
187 * @param ids The list of match ids into which the match ids and
188 * scores are added.
189 * @return True if at least one match id and associated match score
190 * was successfully read, false otherwise.
191 */
192bool parse_match_ids(char *buf, match_id_list_t *ids)
193{
194 int score = 0;
195 char *id = NULL;
196 int ids_read = 0;
197
198 while (true) {
199 /* skip spaces */
200 if (!skip_spaces(&buf))
201 break;
202
203 /* read score */
204 score = strtoul(buf, &buf, 10);
205
206 /* skip spaces */
207 if (!skip_spaces(&buf))
208 break;
209
210 /* read id */
211 id = read_match_id(&buf);
212 if (NULL == id)
213 break;
214
215 /* create new match_id structure */
216 match_id_t *mid = create_match_id();
217 mid->id = id;
218 mid->score = score;
219
220 /* add it to the list */
221 add_match_id(ids, mid);
222
223 ids_read++;
224 }
225
226 return ids_read > 0;
227}
228
229/**
230 * Read match ids and associated match scores from a file.
231 *
232 * Each match score in the file is followed by its match id.
233 * The match ids and match scores are separated by whitespaces.
234 * Neither match ids nor match scores can contain whitespaces.
235 *
236 * @param buf The path to the file from which the match ids are read.
237 * @param ids The list of match ids into which the match ids and
238 * scores are added.
239 * @return True if at least one match id and associated match score
240 * was successfully read, false otherwise.
241 */
242bool read_match_ids(const char *conf_path, match_id_list_t *ids)
243{
244 log_msg(LVL_DEBUG, "read_match_ids(conf_path=\"%s\")", conf_path);
245
246 bool suc = false;
247 char *buf = NULL;
248 bool opened = false;
249 int fd;
250 size_t len = 0;
251
252 fd = open(conf_path, O_RDONLY);
253 if (fd < 0) {
254 log_msg(LVL_ERROR, "Unable to open `%s' for reading: %s.",
255 conf_path, str_error(fd));
256 goto cleanup;
257 }
258 opened = true;
259
260 len = lseek(fd, 0, SEEK_END);
261 lseek(fd, 0, SEEK_SET);
262 if (len == 0) {
263 log_msg(LVL_ERROR, "Configuration file '%s' is empty.",
264 conf_path);
265 goto cleanup;
266 }
267
268 buf = malloc(len + 1);
269 if (buf == NULL) {
270 log_msg(LVL_ERROR, "Memory allocation failed when parsing file "
271 "'%s'.", conf_path);
272 goto cleanup;
273 }
274
275 ssize_t read_bytes = read_all(fd, buf, len);
276 if (read_bytes <= 0) {
277 log_msg(LVL_ERROR, "Unable to read file '%s' (%zd).", conf_path,
278 read_bytes);
279 goto cleanup;
280 }
281 buf[read_bytes] = 0;
282
283 suc = parse_match_ids(buf, ids);
284
285cleanup:
286 free(buf);
287
288 if (opened)
289 close(fd);
290
291 return suc;
292}
293
294/**
295 * Get information about a driver.
296 *
297 * Each driver has its own directory in the base directory.
298 * The name of the driver's directory is the same as the name of the driver.
299 * The driver's directory contains driver's binary (named as the driver without
300 * extension) and the configuration file with match ids for device-to-driver
301 * matching (named as the driver with a special extension).
302 *
303 * This function searches for the driver's directory and containing
304 * configuration files. If all the files needed are found, they are parsed and
305 * the information about the driver is stored in the driver's structure.
306 *
307 * @param base_path The base directory, in which we look for driver's
308 * subdirectory.
309 * @param name The name of the driver.
310 * @param drv The driver structure to fill information in.
311 *
312 * @return True on success, false otherwise.
313 */
314bool get_driver_info(const char *base_path, const char *name, driver_t *drv)
315{
316 log_msg(LVL_DEBUG, "get_driver_info(base_path=\"%s\", name=\"%s\")",
317 base_path, name);
318
319 assert(base_path != NULL && name != NULL && drv != NULL);
320
321 bool suc = false;
322 char *match_path = NULL;
323 size_t name_size = 0;
324
325 /* Read the list of match ids from the driver's configuration file. */
326 match_path = get_abs_path(base_path, name, MATCH_EXT);
327 if (match_path == NULL)
328 goto cleanup;
329
330 if (!read_match_ids(match_path, &drv->match_ids))
331 goto cleanup;
332
333 /* Allocate and fill driver's name. */
334 name_size = str_size(name) + 1;
335 drv->name = malloc(name_size);
336 if (drv->name == NULL)
337 goto cleanup;
338 str_cpy(drv->name, name_size, name);
339
340 /* Initialize path with driver's binary. */
341 drv->binary_path = get_abs_path(base_path, name, "");
342 if (drv->binary_path == NULL)
343 goto cleanup;
344
345 /* Check whether the driver's binary exists. */
346 struct stat s;
347 if (stat(drv->binary_path, &s) == ENOENT) { /* FIXME!! */
348 log_msg(LVL_ERROR, "Driver not found at path `%s'.",
349 drv->binary_path);
350 goto cleanup;
351 }
352
353 suc = true;
354
355cleanup:
356 if (!suc) {
357 free(drv->binary_path);
358 free(drv->name);
359 /* Set the driver structure to the default state. */
360 init_driver(drv);
361 }
362
363 free(match_path);
364
365 return suc;
366}
367
368/** Lookup drivers in the directory.
369 *
370 * @param drivers_list The list of available drivers.
371 * @param dir_path The path to the directory where we search for drivers.
372 * @return Number of drivers which were found.
373 */
374int lookup_available_drivers(driver_list_t *drivers_list, const char *dir_path)
375{
376 log_msg(LVL_DEBUG, "lookup_available_drivers(dir=\"%s\")", dir_path);
377
378 int drv_cnt = 0;
379 DIR *dir = NULL;
380 struct dirent *diren;
381
382 dir = opendir(dir_path);
383
384 if (dir != NULL) {
385 driver_t *drv = create_driver();
386 while ((diren = readdir(dir))) {
387 if (get_driver_info(dir_path, diren->d_name, drv)) {
388 add_driver(drivers_list, drv);
389 drv_cnt++;
390 drv = create_driver();
391 }
392 }
393 delete_driver(drv);
394 closedir(dir);
395 }
396
397 return drv_cnt;
398}
399
400/** Create root device and function node in the device tree.
401 *
402 * @param tree The device tree.
403 * @return True on success, false otherwise.
404 */
405bool create_root_nodes(dev_tree_t *tree)
406{
407 fun_node_t *fun;
408 dev_node_t *dev;
409
410 log_msg(LVL_DEBUG, "create_root_nodes()");
411
412 fibril_rwlock_write_lock(&tree->rwlock);
413
414 /*
415 * Create root function. This is a pseudo function to which
416 * the root device node is attached. It allows us to match
417 * the root device driver in a standard manner, i.e. against
418 * the parent function.
419 */
420
421 fun = create_fun_node();
422 if (fun == NULL) {
423 fibril_rwlock_write_unlock(&tree->rwlock);
424 return false;
425 }
426
427 fun_add_ref(fun);
428 insert_fun_node(tree, fun, str_dup(""), NULL);
429
430 match_id_t *id = create_match_id();
431 id->id = str_dup("root");
432 id->score = 100;
433 add_match_id(&fun->match_ids, id);
434 tree->root_node = fun;
435
436 /*
437 * Create root device node.
438 */
439 dev = create_dev_node();
440 if (dev == NULL) {
441 fibril_rwlock_write_unlock(&tree->rwlock);
442 return false;
443 }
444
445 dev_add_ref(dev);
446 insert_dev_node(tree, dev, fun);
447
448 fibril_rwlock_write_unlock(&tree->rwlock);
449
450 return dev != NULL;
451}
452
453/** Lookup the best matching driver for the specified device in the list of
454 * drivers.
455 *
456 * A match between a device and a driver is found if one of the driver's match
457 * ids match one of the device's match ids. The score of the match is the
458 * product of the driver's and device's score associated with the matching id.
459 * The best matching driver for a device is the driver with the highest score
460 * of the match between the device and the driver.
461 *
462 * @param drivers_list The list of drivers, where we look for the driver
463 * suitable for handling the device.
464 * @param node The device node structure of the device.
465 * @return The best matching driver or NULL if no matching driver
466 * is found.
467 */
468driver_t *find_best_match_driver(driver_list_t *drivers_list, dev_node_t *node)
469{
470 driver_t *best_drv = NULL, *drv = NULL;
471 int best_score = 0, score = 0;
472
473 fibril_mutex_lock(&drivers_list->drivers_mutex);
474
475 list_foreach(drivers_list->drivers, link) {
476 drv = list_get_instance(link, driver_t, drivers);
477 score = get_match_score(drv, node);
478 if (score > best_score) {
479 best_score = score;
480 best_drv = drv;
481 }
482 }
483
484 fibril_mutex_unlock(&drivers_list->drivers_mutex);
485
486 return best_drv;
487}
488
489/** Assign a driver to a device.
490 *
491 * @param tree Device tree
492 * @param node The device's node in the device tree.
493 * @param drv The driver.
494 */
495void attach_driver(dev_tree_t *tree, dev_node_t *dev, driver_t *drv)
496{
497 log_msg(LVL_DEBUG, "attach_driver(dev=\"%s\",drv=\"%s\")",
498 dev->pfun->pathname, drv->name);
499
500 fibril_mutex_lock(&drv->driver_mutex);
501 fibril_rwlock_write_lock(&tree->rwlock);
502
503 dev->drv = drv;
504 list_append(&dev->driver_devices, &drv->devices);
505
506 fibril_rwlock_write_unlock(&tree->rwlock);
507 fibril_mutex_unlock(&drv->driver_mutex);
508}
509
510/** Detach driver from device.
511 *
512 * @param tree Device tree
513 * @param node The device's node in the device tree.
514 * @param drv The driver.
515 */
516void detach_driver(dev_tree_t *tree, dev_node_t *dev)
517{
518 driver_t *drv = dev->drv;
519
520 assert(drv != NULL);
521
522 log_msg(LVL_DEBUG, "detach_driver(dev=\"%s\",drv=\"%s\")",
523 dev->pfun->pathname, drv->name);
524
525 fibril_mutex_lock(&drv->driver_mutex);
526 fibril_rwlock_write_lock(&tree->rwlock);
527
528 dev->drv = NULL;
529 list_remove(&dev->driver_devices);
530
531 fibril_rwlock_write_unlock(&tree->rwlock);
532 fibril_mutex_unlock(&drv->driver_mutex);
533}
534
535/** Start a driver
536 *
537 * @param drv The driver's structure.
538 * @return True if the driver's task is successfully spawned, false
539 * otherwise.
540 */
541bool start_driver(driver_t *drv)
542{
543 int rc;
544
545 assert(fibril_mutex_is_locked(&drv->driver_mutex));
546
547 log_msg(LVL_DEBUG, "start_driver(drv=\"%s\")", drv->name);
548
549 rc = task_spawnl(NULL, drv->binary_path, drv->binary_path, NULL);
550 if (rc != EOK) {
551 log_msg(LVL_ERROR, "Spawning driver `%s' (%s) failed: %s.",
552 drv->name, drv->binary_path, str_error(rc));
553 return false;
554 }
555
556 drv->state = DRIVER_STARTING;
557 return true;
558}
559
560/** Find device driver in the list of device drivers.
561 *
562 * @param drv_list The list of device drivers.
563 * @param drv_name The name of the device driver which is searched.
564 * @return The device driver of the specified name, if it is in the
565 * list, NULL otherwise.
566 */
567driver_t *find_driver(driver_list_t *drv_list, const char *drv_name)
568{
569 driver_t *res = NULL;
570 driver_t *drv = NULL;
571
572 fibril_mutex_lock(&drv_list->drivers_mutex);
573
574 list_foreach(drv_list->drivers, link) {
575 drv = list_get_instance(link, driver_t, drivers);
576 if (str_cmp(drv->name, drv_name) == 0) {
577 res = drv;
578 break;
579 }
580 }
581
582 fibril_mutex_unlock(&drv_list->drivers_mutex);
583
584 return res;
585}
586
587/** Notify driver about the devices to which it was assigned.
588 *
589 * @param driver The driver to which the devices are passed.
590 */
591static void pass_devices_to_driver(driver_t *driver, dev_tree_t *tree)
592{
593 dev_node_t *dev;
594 link_t *link;
595
596 log_msg(LVL_DEBUG, "pass_devices_to_driver(driver=\"%s\")",
597 driver->name);
598
599 fibril_mutex_lock(&driver->driver_mutex);
600
601 /*
602 * Go through devices list as long as there is some device
603 * that has not been passed to the driver.
604 */
605 link = driver->devices.head.next;
606 while (link != &driver->devices.head) {
607 dev = list_get_instance(link, dev_node_t, driver_devices);
608 fibril_rwlock_write_lock(&tree->rwlock);
609
610 if (dev->passed_to_driver) {
611 fibril_rwlock_write_unlock(&tree->rwlock);
612 link = link->next;
613 continue;
614 }
615
616 log_msg(LVL_DEBUG, "pass_devices_to_driver: dev->refcnt=%d\n",
617 (int)atomic_get(&dev->refcnt));
618 dev_add_ref(dev);
619
620 /*
621 * Unlock to avoid deadlock when adding device
622 * handled by itself.
623 */
624 fibril_mutex_unlock(&driver->driver_mutex);
625 fibril_rwlock_write_unlock(&tree->rwlock);
626
627 add_device(driver, dev, tree);
628
629 dev_del_ref(dev);
630
631 /*
632 * Lock again as we will work with driver's
633 * structure.
634 */
635 fibril_mutex_lock(&driver->driver_mutex);
636
637 /*
638 * Restart the cycle to go through all devices again.
639 */
640 link = driver->devices.head.next;
641 }
642
643 /*
644 * Once we passed all devices to the driver, we need to mark the
645 * driver as running.
646 * It is vital to do it here and inside critical section.
647 *
648 * If we would change the state earlier, other devices added to
649 * the driver would be added to the device list and started
650 * immediately and possibly started here as well.
651 */
652 log_msg(LVL_DEBUG, "Driver `%s' enters running state.", driver->name);
653 driver->state = DRIVER_RUNNING;
654
655 fibril_mutex_unlock(&driver->driver_mutex);
656}
657
658/** Finish the initialization of a driver after it has succesfully started
659 * and after it has registered itself by the device manager.
660 *
661 * Pass devices formerly matched to the driver to the driver and remember the
662 * driver is running and fully functional now.
663 *
664 * @param driver The driver which registered itself as running by the
665 * device manager.
666 */
667void initialize_running_driver(driver_t *driver, dev_tree_t *tree)
668{
669 log_msg(LVL_DEBUG, "initialize_running_driver(driver=\"%s\")",
670 driver->name);
671
672 /*
673 * Pass devices which have been already assigned to the driver to the
674 * driver.
675 */
676 pass_devices_to_driver(driver, tree);
677}
678
679/** Initialize device driver structure.
680 *
681 * @param drv The device driver structure.
682 */
683void init_driver(driver_t *drv)
684{
685 assert(drv != NULL);
686
687 memset(drv, 0, sizeof(driver_t));
688 list_initialize(&drv->match_ids.ids);
689 list_initialize(&drv->devices);
690 fibril_mutex_initialize(&drv->driver_mutex);
691 drv->sess = NULL;
692}
693
694/** Device driver structure clean-up.
695 *
696 * @param drv The device driver structure.
697 */
698void clean_driver(driver_t *drv)
699{
700 assert(drv != NULL);
701
702 free_not_null(drv->name);
703 free_not_null(drv->binary_path);
704
705 clean_match_ids(&drv->match_ids);
706
707 init_driver(drv);
708}
709
710/** Delete device driver structure.
711 *
712 * @param drv The device driver structure.
713 */
714void delete_driver(driver_t *drv)
715{
716 assert(drv != NULL);
717
718 clean_driver(drv);
719 free(drv);
720}
721
722/** Create loc path and name for the function. */
723void loc_register_tree_function(fun_node_t *fun, dev_tree_t *tree)
724{
725 char *loc_pathname = NULL;
726 char *loc_name = NULL;
727
728 assert(fibril_rwlock_is_locked(&tree->rwlock));
729
730 asprintf(&loc_name, "%s", fun->pathname);
731 if (loc_name == NULL)
732 return;
733
734 replace_char(loc_name, '/', LOC_SEPARATOR);
735
736 asprintf(&loc_pathname, "%s/%s", LOC_DEVICE_NAMESPACE,
737 loc_name);
738 if (loc_pathname == NULL) {
739 free(loc_name);
740 return;
741 }
742
743 loc_service_register_with_iface(loc_pathname,
744 &fun->service_id, DEVMAN_CONNECT_FROM_LOC);
745
746 tree_add_loc_function(tree, fun);
747
748 free(loc_name);
749 free(loc_pathname);
750}
751
752/** Pass a device to running driver.
753 *
754 * @param drv The driver's structure.
755 * @param node The device's node in the device tree.
756 */
757void add_device(driver_t *drv, dev_node_t *dev, dev_tree_t *tree)
758{
759 /*
760 * We do not expect to have driver's mutex locked as we do not
761 * access any structures that would affect driver_t.
762 */
763 log_msg(LVL_DEBUG, "add_device(drv=\"%s\", dev=\"%s\")",
764 drv->name, dev->pfun->name);
765
766 /* Send the device to the driver. */
767 devman_handle_t parent_handle;
768 if (dev->pfun) {
769 parent_handle = dev->pfun->handle;
770 } else {
771 parent_handle = 0;
772 }
773
774 async_exch_t *exch = async_exchange_begin(drv->sess);
775
776 ipc_call_t answer;
777 aid_t req = async_send_2(exch, DRIVER_DEV_ADD, dev->handle,
778 parent_handle, &answer);
779
780 /* Send the device name to the driver. */
781 sysarg_t rc = async_data_write_start(exch, dev->pfun->name,
782 str_size(dev->pfun->name) + 1);
783
784 async_exchange_end(exch);
785
786 if (rc != EOK) {
787 /* TODO handle error */
788 }
789
790 /* Wait for answer from the driver. */
791 async_wait_for(req, &rc);
792
793 switch(rc) {
794 case EOK:
795 dev->state = DEVICE_USABLE;
796 break;
797 case ENOENT:
798 dev->state = DEVICE_NOT_PRESENT;
799 break;
800 default:
801 dev->state = DEVICE_INVALID;
802 break;
803 }
804
805 dev->passed_to_driver = true;
806
807 return;
808}
809
810/** Find suitable driver for a device and assign the driver to it.
811 *
812 * @param node The device node of the device in the device tree.
813 * @param drivers_list The list of available drivers.
814 * @return True if the suitable driver is found and
815 * successfully assigned to the device, false otherwise.
816 */
817bool assign_driver(dev_node_t *dev, driver_list_t *drivers_list,
818 dev_tree_t *tree)
819{
820 assert(dev != NULL);
821 assert(drivers_list != NULL);
822 assert(tree != NULL);
823
824 /*
825 * Find the driver which is the most suitable for handling this device.
826 */
827 driver_t *drv = find_best_match_driver(drivers_list, dev);
828 if (drv == NULL) {
829 log_msg(LVL_ERROR, "No driver found for device `%s'.",
830 dev->pfun->pathname);
831 return false;
832 }
833
834 /* Attach the driver to the device. */
835 attach_driver(tree, dev, drv);
836
837 fibril_mutex_lock(&drv->driver_mutex);
838 if (drv->state == DRIVER_NOT_STARTED) {
839 /* Start the driver. */
840 start_driver(drv);
841 }
842 bool is_running = drv->state == DRIVER_RUNNING;
843 fibril_mutex_unlock(&drv->driver_mutex);
844
845 /* Notify the driver about the new device. */
846 if (is_running)
847 add_device(drv, dev, tree);
848
849 fibril_mutex_lock(&drv->driver_mutex);
850 fibril_mutex_unlock(&drv->driver_mutex);
851
852 fibril_rwlock_write_lock(&tree->rwlock);
853 if (dev->pfun != NULL) {
854 dev->pfun->state = FUN_ON_LINE;
855 }
856 fibril_rwlock_write_unlock(&tree->rwlock);
857 return true;
858}
859
860int driver_dev_remove(dev_tree_t *tree, dev_node_t *dev)
861{
862 async_exch_t *exch;
863 sysarg_t retval;
864 driver_t *drv;
865 devman_handle_t handle;
866
867 assert(dev != NULL);
868
869 log_msg(LVL_DEBUG, "driver_dev_remove(%p)", dev);
870
871 fibril_rwlock_read_lock(&tree->rwlock);
872 drv = dev->drv;
873 handle = dev->handle;
874 fibril_rwlock_read_unlock(&tree->rwlock);
875
876 exch = async_exchange_begin(drv->sess);
877 retval = async_req_1_0(exch, DRIVER_DEV_REMOVE, handle);
878 async_exchange_end(exch);
879
880 return retval;
881}
882
883int driver_dev_gone(dev_tree_t *tree, dev_node_t *dev)
884{
885 async_exch_t *exch;
886 sysarg_t retval;
887 driver_t *drv;
888 devman_handle_t handle;
889
890 assert(dev != NULL);
891
892 log_msg(LVL_DEBUG, "driver_dev_gone(%p)", dev);
893
894 fibril_rwlock_read_lock(&tree->rwlock);
895 drv = dev->drv;
896 handle = dev->handle;
897 fibril_rwlock_read_unlock(&tree->rwlock);
898
899 exch = async_exchange_begin(drv->sess);
900 retval = async_req_1_0(exch, DRIVER_DEV_GONE, handle);
901 async_exchange_end(exch);
902
903 return retval;
904}
905
906int driver_fun_online(dev_tree_t *tree, fun_node_t *fun)
907{
908 async_exch_t *exch;
909 sysarg_t retval;
910 driver_t *drv;
911 devman_handle_t handle;
912
913 log_msg(LVL_DEBUG, "driver_fun_online(%p)", fun);
914
915 fibril_rwlock_read_lock(&tree->rwlock);
916
917 if (fun->dev == NULL) {
918 /* XXX root function? */
919 fibril_rwlock_read_unlock(&tree->rwlock);
920 return EINVAL;
921 }
922
923 drv = fun->dev->drv;
924 handle = fun->handle;
925 fibril_rwlock_read_unlock(&tree->rwlock);
926
927 exch = async_exchange_begin(drv->sess);
928 retval = async_req_1_0(exch, DRIVER_FUN_ONLINE, handle);
929 loc_exchange_end(exch);
930
931 return retval;
932}
933
934int driver_fun_offline(dev_tree_t *tree, fun_node_t *fun)
935{
936 async_exch_t *exch;
937 sysarg_t retval;
938 driver_t *drv;
939 devman_handle_t handle;
940
941 log_msg(LVL_DEBUG, "driver_fun_offline(%p)", fun);
942
943 fibril_rwlock_read_lock(&tree->rwlock);
944 if (fun->dev == NULL) {
945 /* XXX root function? */
946 fibril_rwlock_read_unlock(&tree->rwlock);
947 return EINVAL;
948 }
949
950 drv = fun->dev->drv;
951 handle = fun->handle;
952 fibril_rwlock_read_unlock(&tree->rwlock);
953
954 exch = async_exchange_begin(drv->sess);
955 retval = async_req_1_0(exch, DRIVER_FUN_OFFLINE, handle);
956 loc_exchange_end(exch);
957
958 return retval;
959
960}
961
962/** Initialize the device tree.
963 *
964 * Create root device node of the tree and assign driver to it.
965 *
966 * @param tree The device tree.
967 * @param drivers_list the list of available drivers.
968 * @return True on success, false otherwise.
969 */
970bool init_device_tree(dev_tree_t *tree, driver_list_t *drivers_list)
971{
972 log_msg(LVL_DEBUG, "init_device_tree()");
973
974 tree->current_handle = 0;
975
976 hash_table_create(&tree->devman_devices, DEVICE_BUCKETS, 1,
977 &devman_devices_ops);
978 hash_table_create(&tree->devman_functions, DEVICE_BUCKETS, 1,
979 &devman_functions_ops);
980 hash_table_create(&tree->loc_functions, DEVICE_BUCKETS, 1,
981 &loc_devices_ops);
982
983 fibril_rwlock_initialize(&tree->rwlock);
984
985 /* Create root function and root device and add them to the device tree. */
986 if (!create_root_nodes(tree))
987 return false;
988
989 /* Find suitable driver and start it. */
990 dev_node_t *rdev = tree->root_node->child;
991 dev_add_ref(rdev);
992 int rc = assign_driver(rdev, drivers_list, tree);
993 dev_del_ref(rdev);
994
995 return rc;
996}
997
998/* Device nodes */
999
1000/** Create a new device node.
1001 *
1002 * @return A device node structure.
1003 */
1004dev_node_t *create_dev_node(void)
1005{
1006 dev_node_t *dev;
1007
1008 dev = calloc(1, sizeof(dev_node_t));
1009 if (dev == NULL)
1010 return NULL;
1011
1012 atomic_set(&dev->refcnt, 0);
1013 list_initialize(&dev->functions);
1014 link_initialize(&dev->driver_devices);
1015 link_initialize(&dev->devman_dev);
1016
1017 return dev;
1018}
1019
1020/** Delete a device node.
1021 *
1022 * @param node The device node structure.
1023 */
1024void delete_dev_node(dev_node_t *dev)
1025{
1026 assert(list_empty(&dev->functions));
1027 assert(dev->pfun == NULL);
1028 assert(dev->drv == NULL);
1029
1030 free(dev);
1031}
1032
1033/** Increase device node reference count.
1034 *
1035 * @param dev Device node
1036 */
1037void dev_add_ref(dev_node_t *dev)
1038{
1039 atomic_inc(&dev->refcnt);
1040}
1041
1042/** Decrease device node reference count.
1043 *
1044 * When the count drops to zero the device node is freed.
1045 *
1046 * @param dev Device node
1047 */
1048void dev_del_ref(dev_node_t *dev)
1049{
1050 if (atomic_predec(&dev->refcnt) == 0)
1051 delete_dev_node(dev);
1052}
1053
1054/** Find the device node structure of the device witch has the specified handle.
1055 *
1056 * @param tree The device tree where we look for the device node.
1057 * @param handle The handle of the device.
1058 * @return The device node.
1059 */
1060dev_node_t *find_dev_node_no_lock(dev_tree_t *tree, devman_handle_t handle)
1061{
1062 unsigned long key = handle;
1063 link_t *link;
1064
1065 assert(fibril_rwlock_is_locked(&tree->rwlock));
1066
1067 link = hash_table_find(&tree->devman_devices, &key);
1068 if (link == NULL)
1069 return NULL;
1070
1071 return hash_table_get_instance(link, dev_node_t, devman_dev);
1072}
1073
1074/** Find the device node structure of the device witch has the specified handle.
1075 *
1076 * @param tree The device tree where we look for the device node.
1077 * @param handle The handle of the device.
1078 * @return The device node.
1079 */
1080dev_node_t *find_dev_node(dev_tree_t *tree, devman_handle_t handle)
1081{
1082 dev_node_t *dev = NULL;
1083
1084 fibril_rwlock_read_lock(&tree->rwlock);
1085 dev = find_dev_node_no_lock(tree, handle);
1086 if (dev != NULL)
1087 dev_add_ref(dev);
1088
1089 fibril_rwlock_read_unlock(&tree->rwlock);
1090
1091 return dev;
1092}
1093
1094/** Get list of device functions. */
1095int dev_get_functions(dev_tree_t *tree, dev_node_t *dev,
1096 devman_handle_t *hdl_buf, size_t buf_size, size_t *act_size)
1097{
1098 size_t act_cnt;
1099 size_t buf_cnt;
1100
1101 assert(fibril_rwlock_is_locked(&tree->rwlock));
1102
1103 buf_cnt = buf_size / sizeof(devman_handle_t);
1104
1105 act_cnt = list_count(&dev->functions);
1106 *act_size = act_cnt * sizeof(devman_handle_t);
1107
1108 if (buf_size % sizeof(devman_handle_t) != 0)
1109 return EINVAL;
1110
1111 size_t pos = 0;
1112 list_foreach(dev->functions, item) {
1113 fun_node_t *fun =
1114 list_get_instance(item, fun_node_t, dev_functions);
1115
1116 if (pos < buf_cnt) {
1117 hdl_buf[pos] = fun->handle;
1118 }
1119
1120 pos++;
1121 }
1122
1123 return EOK;
1124}
1125
1126
1127/* Function nodes */
1128
1129/** Create a new function node.
1130 *
1131 * @return A function node structure.
1132 */
1133fun_node_t *create_fun_node(void)
1134{
1135 fun_node_t *fun;
1136
1137 fun = calloc(1, sizeof(fun_node_t));
1138 if (fun == NULL)
1139 return NULL;
1140
1141 fun->state = FUN_INIT;
1142 atomic_set(&fun->refcnt, 0);
1143 fibril_mutex_initialize(&fun->busy_lock);
1144 link_initialize(&fun->dev_functions);
1145 list_initialize(&fun->match_ids.ids);
1146 link_initialize(&fun->devman_fun);
1147 link_initialize(&fun->loc_fun);
1148
1149 return fun;
1150}
1151
1152/** Delete a function node.
1153 *
1154 * @param fun The device node structure.
1155 */
1156void delete_fun_node(fun_node_t *fun)
1157{
1158 assert(fun->dev == NULL);
1159 assert(fun->child == NULL);
1160
1161 clean_match_ids(&fun->match_ids);
1162 free_not_null(fun->name);
1163 free_not_null(fun->pathname);
1164 free(fun);
1165}
1166
1167/** Increase function node reference count.
1168 *
1169 * @param fun Function node
1170 */
1171void fun_add_ref(fun_node_t *fun)
1172{
1173 atomic_inc(&fun->refcnt);
1174}
1175
1176/** Decrease function node reference count.
1177 *
1178 * When the count drops to zero the function node is freed.
1179 *
1180 * @param fun Function node
1181 */
1182void fun_del_ref(fun_node_t *fun)
1183{
1184 if (atomic_predec(&fun->refcnt) == 0)
1185 delete_fun_node(fun);
1186}
1187
1188/** Make function busy for reconfiguration operations. */
1189void fun_busy_lock(fun_node_t *fun)
1190{
1191 fibril_mutex_lock(&fun->busy_lock);
1192}
1193
1194/** Mark end of reconfiguration operation. */
1195void fun_busy_unlock(fun_node_t *fun)
1196{
1197 fibril_mutex_unlock(&fun->busy_lock);
1198}
1199
1200/** Find the function node with the specified handle.
1201 *
1202 * @param tree The device tree where we look for the device node.
1203 * @param handle The handle of the function.
1204 * @return The function node.
1205 */
1206fun_node_t *find_fun_node_no_lock(dev_tree_t *tree, devman_handle_t handle)
1207{
1208 unsigned long key = handle;
1209 link_t *link;
1210 fun_node_t *fun;
1211
1212 assert(fibril_rwlock_is_locked(&tree->rwlock));
1213
1214 link = hash_table_find(&tree->devman_functions, &key);
1215 if (link == NULL)
1216 return NULL;
1217
1218 fun = hash_table_get_instance(link, fun_node_t, devman_fun);
1219
1220 return fun;
1221}
1222
1223/** Find the function node with the specified handle.
1224 *
1225 * @param tree The device tree where we look for the device node.
1226 * @param handle The handle of the function.
1227 * @return The function node.
1228 */
1229fun_node_t *find_fun_node(dev_tree_t *tree, devman_handle_t handle)
1230{
1231 fun_node_t *fun = NULL;
1232
1233 fibril_rwlock_read_lock(&tree->rwlock);
1234
1235 fun = find_fun_node_no_lock(tree, handle);
1236 if (fun != NULL)
1237 fun_add_ref(fun);
1238
1239 fibril_rwlock_read_unlock(&tree->rwlock);
1240
1241 return fun;
1242}
1243
1244/** Create and set device's full path in device tree.
1245 *
1246 * @param tree Device tree
1247 * @param node The device's device node.
1248 * @param parent The parent device node.
1249 * @return True on success, false otherwise (insufficient
1250 * resources etc.).
1251 */
1252static bool set_fun_path(dev_tree_t *tree, fun_node_t *fun, fun_node_t *parent)
1253{
1254 assert(fibril_rwlock_is_write_locked(&tree->rwlock));
1255 assert(fun->name != NULL);
1256
1257 size_t pathsize = (str_size(fun->name) + 1);
1258 if (parent != NULL)
1259 pathsize += str_size(parent->pathname) + 1;
1260
1261 fun->pathname = (char *) malloc(pathsize);
1262 if (fun->pathname == NULL) {
1263 log_msg(LVL_ERROR, "Failed to allocate device path.");
1264 return false;
1265 }
1266
1267 if (parent != NULL) {
1268 str_cpy(fun->pathname, pathsize, parent->pathname);
1269 str_append(fun->pathname, pathsize, "/");
1270 str_append(fun->pathname, pathsize, fun->name);
1271 } else {
1272 str_cpy(fun->pathname, pathsize, fun->name);
1273 }
1274
1275 return true;
1276}
1277
1278/** Insert new device into device tree.
1279 *
1280 * @param tree The device tree.
1281 * @param dev The newly added device node.
1282 * @param pfun The parent function node.
1283 *
1284 * @return True on success, false otherwise (insufficient resources
1285 * etc.).
1286 */
1287bool insert_dev_node(dev_tree_t *tree, dev_node_t *dev, fun_node_t *pfun)
1288{
1289 assert(fibril_rwlock_is_write_locked(&tree->rwlock));
1290
1291 log_msg(LVL_DEBUG, "insert_dev_node(dev=%p, pfun=%p [\"%s\"])",
1292 dev, pfun, pfun->pathname);
1293
1294 /* Add the node to the handle-to-node map. */
1295 dev->handle = ++tree->current_handle;
1296 unsigned long key = dev->handle;
1297 hash_table_insert(&tree->devman_devices, &key, &dev->devman_dev);
1298
1299 /* Add the node to the list of its parent's children. */
1300 dev->pfun = pfun;
1301 pfun->child = dev;
1302
1303 return true;
1304}
1305
1306/** Remove device from device tree.
1307 *
1308 * @param tree Device tree
1309 * @param dev Device node
1310 */
1311void remove_dev_node(dev_tree_t *tree, dev_node_t *dev)
1312{
1313 assert(fibril_rwlock_is_write_locked(&tree->rwlock));
1314
1315 log_msg(LVL_DEBUG, "remove_dev_node(dev=%p)", dev);
1316
1317 /* Remove node from the handle-to-node map. */
1318 unsigned long key = dev->handle;
1319 hash_table_remove(&tree->devman_devices, &key, 1);
1320
1321 /* Unlink from parent function. */
1322 dev->pfun->child = NULL;
1323 dev->pfun = NULL;
1324
1325 dev->state = DEVICE_REMOVED;
1326}
1327
1328
1329/** Insert new function into device tree.
1330 *
1331 * @param tree The device tree.
1332 * @param fun The newly added function node.
1333 * @param fun_name The name of the newly added function.
1334 * @param dev Owning device node.
1335 *
1336 * @return True on success, false otherwise (insufficient resources
1337 * etc.).
1338 */
1339bool insert_fun_node(dev_tree_t *tree, fun_node_t *fun, char *fun_name,
1340 dev_node_t *dev)
1341{
1342 fun_node_t *pfun;
1343
1344 assert(fun_name != NULL);
1345 assert(fibril_rwlock_is_write_locked(&tree->rwlock));
1346
1347 /*
1348 * The root function is a special case, it does not belong to any
1349 * device so for the root function dev == NULL.
1350 */
1351 pfun = (dev != NULL) ? dev->pfun : NULL;
1352
1353 fun->name = fun_name;
1354 if (!set_fun_path(tree, fun, pfun)) {
1355 return false;
1356 }
1357
1358 /* Add the node to the handle-to-node map. */
1359 fun->handle = ++tree->current_handle;
1360 unsigned long key = fun->handle;
1361 hash_table_insert(&tree->devman_functions, &key, &fun->devman_fun);
1362
1363 /* Add the node to the list of its parent's children. */
1364 fun->dev = dev;
1365 if (dev != NULL)
1366 list_append(&fun->dev_functions, &dev->functions);
1367
1368 return true;
1369}
1370
1371/** Remove function from device tree.
1372 *
1373 * @param tree Device tree
1374 * @param node Function node to remove
1375 */
1376void remove_fun_node(dev_tree_t *tree, fun_node_t *fun)
1377{
1378 assert(fibril_rwlock_is_write_locked(&tree->rwlock));
1379
1380 /* Remove the node from the handle-to-node map. */
1381 unsigned long key = fun->handle;
1382 hash_table_remove(&tree->devman_functions, &key, 1);
1383
1384 /* Remove the node from the list of its parent's children. */
1385 if (fun->dev != NULL)
1386 list_remove(&fun->dev_functions);
1387
1388 fun->dev = NULL;
1389 fun->state = FUN_REMOVED;
1390}
1391
1392/** Find function node with a specified path in the device tree.
1393 *
1394 * @param path The path of the function node in the device tree.
1395 * @param tree The device tree.
1396 * @return The function node if it is present in the tree, NULL
1397 * otherwise.
1398 */
1399fun_node_t *find_fun_node_by_path(dev_tree_t *tree, char *path)
1400{
1401 assert(path != NULL);
1402
1403 bool is_absolute = path[0] == '/';
1404 if (!is_absolute) {
1405 return NULL;
1406 }
1407
1408 fibril_rwlock_read_lock(&tree->rwlock);
1409
1410 fun_node_t *fun = tree->root_node;
1411 fun_add_ref(fun);
1412 /*
1413 * Relative path to the function from its parent (but with '/' at the
1414 * beginning)
1415 */
1416 char *rel_path = path;
1417 char *next_path_elem = NULL;
1418 bool cont = (rel_path[1] != '\0');
1419
1420 while (cont && fun != NULL) {
1421 next_path_elem = get_path_elem_end(rel_path + 1);
1422 if (next_path_elem[0] == '/') {
1423 cont = true;
1424 next_path_elem[0] = 0;
1425 } else {
1426 cont = false;
1427 }
1428
1429 fun_node_t *cfun = find_node_child(tree, fun, rel_path + 1);
1430 fun_del_ref(fun);
1431 fun = cfun;
1432
1433 if (cont) {
1434 /* Restore the original path. */
1435 next_path_elem[0] = '/';
1436 }
1437 rel_path = next_path_elem;
1438 }
1439
1440 fibril_rwlock_read_unlock(&tree->rwlock);
1441
1442 return fun;
1443}
1444
1445/** Find function with a specified name belonging to given device.
1446 *
1447 * Device tree rwlock should be held at least for reading.
1448 *
1449 * @param tree Device tree
1450 * @param dev Device the function belongs to.
1451 * @param name Function name (not path).
1452 * @return Function node.
1453 * @retval NULL No function with given name.
1454 */
1455fun_node_t *find_fun_node_in_device(dev_tree_t *tree, dev_node_t *dev,
1456 const char *name)
1457{
1458 assert(name != NULL);
1459 assert(fibril_rwlock_is_locked(&tree->rwlock));
1460
1461 fun_node_t *fun;
1462
1463 list_foreach(dev->functions, link) {
1464 fun = list_get_instance(link, fun_node_t, dev_functions);
1465
1466 if (str_cmp(name, fun->name) == 0) {
1467 fun_add_ref(fun);
1468 return fun;
1469 }
1470 }
1471
1472 return NULL;
1473}
1474
1475/** Find child function node with a specified name.
1476 *
1477 * Device tree rwlock should be held at least for reading.
1478 *
1479 * @param tree Device tree
1480 * @param parent The parent function node.
1481 * @param name The name of the child function.
1482 * @return The child function node.
1483 */
1484static fun_node_t *find_node_child(dev_tree_t *tree, fun_node_t *pfun,
1485 const char *name)
1486{
1487 return find_fun_node_in_device(tree, pfun->child, name);
1488}
1489
1490/* loc devices */
1491
1492fun_node_t *find_loc_tree_function(dev_tree_t *tree, service_id_t service_id)
1493{
1494 fun_node_t *fun = NULL;
1495 link_t *link;
1496 unsigned long key = (unsigned long) service_id;
1497
1498 fibril_rwlock_read_lock(&tree->rwlock);
1499 link = hash_table_find(&tree->loc_functions, &key);
1500 if (link != NULL) {
1501 fun = hash_table_get_instance(link, fun_node_t, loc_fun);
1502 fun_add_ref(fun);
1503 }
1504 fibril_rwlock_read_unlock(&tree->rwlock);
1505
1506 return fun;
1507}
1508
1509void tree_add_loc_function(dev_tree_t *tree, fun_node_t *fun)
1510{
1511 assert(fibril_rwlock_is_write_locked(&tree->rwlock));
1512
1513 unsigned long key = (unsigned long) fun->service_id;
1514 hash_table_insert(&tree->loc_functions, &key, &fun->loc_fun);
1515}
1516
1517/** @}
1518 */
Note: See TracBrowser for help on using the repository browser.