1 | /*
|
---|
2 | * Copyright (c) 2009 Lukas Mejdrech
|
---|
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 net
|
---|
30 | * @{
|
---|
31 | */
|
---|
32 |
|
---|
33 | /** @file
|
---|
34 | * Character string to module map implementation.
|
---|
35 | */
|
---|
36 |
|
---|
37 | #include <malloc.h>
|
---|
38 | #include <task.h>
|
---|
39 | #include <unistd.h>
|
---|
40 |
|
---|
41 | #include <ipc/services.h>
|
---|
42 |
|
---|
43 | #include "../err.h"
|
---|
44 | #include "../modules.h"
|
---|
45 |
|
---|
46 | #include "generic_char_map.h"
|
---|
47 | #include "module_map.h"
|
---|
48 |
|
---|
49 | GENERIC_CHAR_MAP_IMPLEMENT(modules, module_t)
|
---|
50 |
|
---|
51 | int add_module(module_ref * module, modules_ref modules, const char * name, const char * filename, services_t service, task_id_t task_id, connect_module_t connect_module){
|
---|
52 | ERROR_DECLARE;
|
---|
53 |
|
---|
54 | module_ref tmp_module;
|
---|
55 |
|
---|
56 | tmp_module = (module_ref) malloc(sizeof(module_t));
|
---|
57 | if(! tmp_module){
|
---|
58 | return ENOMEM;
|
---|
59 | }
|
---|
60 | tmp_module->task_id = task_id;
|
---|
61 | tmp_module->phone = 0;
|
---|
62 | tmp_module->usage = 0;
|
---|
63 | tmp_module->name = name;
|
---|
64 | tmp_module->filename = filename;
|
---|
65 | tmp_module->service = service;
|
---|
66 | tmp_module->connect_module = connect_module;
|
---|
67 | if(ERROR_OCCURRED(modules_add(modules, tmp_module->name, 0, tmp_module))){
|
---|
68 | free(tmp_module);
|
---|
69 | return ERROR_CODE;
|
---|
70 | }
|
---|
71 | if(module){
|
---|
72 | *module = tmp_module;
|
---|
73 | }
|
---|
74 | return EOK;
|
---|
75 | }
|
---|
76 |
|
---|
77 | module_ref get_running_module(modules_ref modules, char * name){
|
---|
78 | module_ref module;
|
---|
79 |
|
---|
80 | module = modules_find(modules, name, 0);
|
---|
81 | if(! module){
|
---|
82 | return NULL;
|
---|
83 | }
|
---|
84 | if(! module->task_id){
|
---|
85 | module->task_id = spawn(module->filename);
|
---|
86 | if(! module->task_id){
|
---|
87 | return NULL;
|
---|
88 | }
|
---|
89 | }
|
---|
90 | if(! module->phone){
|
---|
91 | module->phone = module->connect_module(module->service);
|
---|
92 | }
|
---|
93 | return module;
|
---|
94 | }
|
---|
95 |
|
---|
96 | task_id_t spawn(const char * fname){
|
---|
97 | const char * argv[2];
|
---|
98 | task_id_t res;
|
---|
99 |
|
---|
100 | argv[0] = fname;
|
---|
101 | argv[1] = NULL;
|
---|
102 | res = task_spawn(fname, argv);
|
---|
103 |
|
---|
104 | return res;
|
---|
105 | }
|
---|
106 |
|
---|
107 | /** @}
|
---|
108 | */
|
---|