source: mainline/uspace/lib/usb/src/hcdhubd.c@ 2cb6571

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 2cb6571 was 2cb6571, checked in by smekideki@…>, 15 years ago

merge with smekideki

  • Property mode set to 100644
File size: 8.3 KB
Line 
1/*
2 * Copyright (c) 2010 Vojtech Horky
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 libusb usb
30 * @{
31 */
32/** @file
33 * @brief Common stuff for both HC driver and hub driver.
34 */
35#include <usb/hcdhubd.h>
36#include <usb/devreq.h>
37#include <usbhc_iface.h>
38#include <usb/descriptor.h>
39#include <driver.h>
40#include <bool.h>
41#include <errno.h>
42#include <str_error.h>
43#include <usb/classes/hub.h>
44
45#include "hcdhubd_private.h"
46
47/** Callback when new device is detected and must be handled by this driver.
48 *
49 * @param dev New device.
50 * @return Error code.
51 */
52static int add_device(device_t *dev) {
53 bool is_hc = str_cmp(dev->name, USB_HUB_DEVICE_NAME) != 0;
54 printf("%s: add_device(name=\"%s\")\n", hc_driver->name, dev->name);
55
56 if (is_hc) {
57 /*
58 * We are the HC itself.
59 */
60 return usb_add_hc_device(dev);
61 } else {
62 /*
63 * We are some (maybe deeply nested) hub.
64 * Thus, assign our own operations and explore already
65 * connected devices.
66 */
67 return usb_add_hub_device(dev);
68 }
69}
70
71/** Operations for combined HC and HUB driver. */
72static driver_ops_t hc_driver_generic_ops = {
73 .add_device = add_device
74};
75
76/** Combined HC and HUB driver. */
77static driver_t hc_driver_generic = {
78 .driver_ops = &hc_driver_generic_ops
79};
80
81/** Main USB host controller driver routine.
82 *
83 * @see driver_main
84 *
85 * @param hc Host controller driver.
86 * @return Error code.
87 */
88int usb_hcd_main(usb_hc_driver_t *hc) {
89 hc_driver = hc;
90 hc_driver_generic.name = hc->name;
91
92 /*
93 * Run the device driver framework.
94 */
95 return driver_main(&hc_driver_generic);
96}
97
98/** Add a root hub for given host controller.
99 * This function shall be called only once for each host controller driven
100 * by this driver.
101 * It takes care of creating child device - hub - that will be driven by
102 * this task.
103 *
104 * @param dev Host controller device.
105 * @return Error code.
106 */
107int usb_hcd_add_root_hub(usb_hc_device_t *dev) {
108 char *id;
109 int rc = asprintf(&id, "usb&hc=%s&hub", hc_driver->name);
110 if (rc <= 0) {
111 return rc;
112 }
113
114 rc = usb_hc_add_child_device(dev->generic, USB_HUB_DEVICE_NAME, id, true);
115 if (rc != EOK) {
116 free(id);
117 }
118
119 return rc;
120}
121
122/** Info about child device. */
123struct child_device_info {
124 device_t *parent;
125 const char *name;
126 const char *match_id;
127};
128
129/** Adds a child device fibril worker. */
130static int fibril_add_child_device(void *arg) {
131 struct child_device_info *child_info
132 = (struct child_device_info *) arg;
133 int rc;
134
135 async_usleep(1000);
136
137 device_t *child = create_device();
138 match_id_t *match_id = NULL;
139
140 if (child == NULL) {
141 rc = ENOMEM;
142 goto failure;
143 }
144 child->name = child_info->name;
145
146 match_id = create_match_id();
147 if (match_id == NULL) {
148 rc = ENOMEM;
149 goto failure;
150 }
151 match_id->id = child_info->match_id;
152 match_id->score = 10;
153 add_match_id(&child->match_ids, match_id);
154
155 printf("%s: adding child device `%s' with match \"%s\"\n",
156 hc_driver->name, child->name, match_id->id);
157 rc = child_device_register(child, child_info->parent);
158 printf("%s: child device `%s' registration: %s\n",
159 hc_driver->name, child->name, str_error(rc));
160
161 if (rc != EOK) {
162 goto failure;
163 }
164
165 goto leave;
166
167failure:
168 if (child != NULL) {
169 child->name = NULL;
170 delete_device(child);
171 }
172
173 if (match_id != NULL) {
174 match_id->id = NULL;
175 delete_match_id(match_id);
176 }
177
178leave:
179 free(arg);
180 return EOK;
181}
182
183/** Adds a child.
184 * Due to deadlock in devman when parent registers child that oughts to be
185 * driven by the same task, the child adding is done in separate fibril.
186 * Not optimal, but it works.
187 * Update: not under all circumstances the new fibril is successful either.
188 * Thus the last parameter to let the caller choose.
189 *
190 * @param parent Parent device.
191 * @param name Device name.
192 * @param match_id Match id.
193 * @param create_fibril Whether to run the addition in new fibril.
194 * @return Error code.
195 */
196int usb_hc_add_child_device(device_t *parent, const char *name,
197 const char *match_id, bool create_fibril) {
198 printf("%s: about to add child device `%s' (%s)\n", hc_driver->name,
199 name, match_id);
200
201 /*
202 * Seems that creating fibril which postpones the action
203 * is the best solution.
204 */
205 create_fibril = true;
206
207 struct child_device_info *child_info
208 = malloc(sizeof (struct child_device_info));
209
210 child_info->parent = parent;
211 child_info->name = name;
212 child_info->match_id = match_id;
213
214 if (create_fibril) {
215 fid_t fibril = fibril_create(fibril_add_child_device, child_info);
216 if (!fibril) {
217 return ENOMEM;
218 }
219 fibril_add_ready(fibril);
220 } else {
221 fibril_add_child_device(child_info);
222 }
223
224 return EOK;
225}
226
227/** Tell USB address of given device.
228 *
229 * @param handle Devman handle of the device.
230 * @return USB device address or error code.
231 */
232usb_address_t usb_get_address_by_handle(devman_handle_t handle) {
233 /* TODO: search list of attached devices. */
234 return ENOENT;
235}
236
237usb_address_t usb_use_free_address(usb_hc_device_t * this_hcd) {
238 //is there free address?
239 link_t * addresses = &this_hcd->addresses;
240 if (list_empty(addresses)) return -1;
241 link_t * link_addr = addresses;
242 bool found = false;
243 usb_address_list_t * range = NULL;
244 while (!found) {
245 link_addr = link_addr->next;
246 if (link_addr == addresses) return -2;
247 range = list_get_instance(link_addr,
248 usb_address_list_t, link);
249 if (range->upper_bound - range->lower_bound > 0) {
250 found = true;
251 }
252 }
253 //now we have interval
254 int result = range->lower_bound;
255 ++(range->lower_bound);
256 if (range->upper_bound - range->lower_bound == 0) {
257 list_remove(&range->link);
258 free(range);
259 }
260 return result;
261}
262
263void usb_free_used_address(usb_hc_device_t * this_hcd, usb_address_t addr) {
264 //check range
265 if (addr < usb_lowest_address || addr > usb_highest_address)
266 return;
267 link_t * addresses = &this_hcd->addresses;
268 link_t * link_addr = addresses;
269 //find 'good' interval
270 usb_address_list_t * found_range = NULL;
271 bool found = false;
272 while (!found) {
273 link_addr = link_addr->next;
274 if (link_addr == addresses) {
275 found = true;
276 } else {
277 usb_address_list_t * range = list_get_instance(link_addr,
278 usb_address_list_t, link);
279 if ( (range->lower_bound - 1 == addr) ||
280 (range->upper_bound == addr)) {
281 found = true;
282 found_range = range;
283 }
284 if (range->lower_bound - 1 > addr) {
285 found = true;
286 }
287
288 }
289 }
290 if (found_range == NULL) {
291 //no suitable range found
292 usb_address_list_t * result_range =
293 (usb_address_list_t*) malloc(sizeof (usb_address_list_t));
294 result_range->lower_bound = addr;
295 result_range->upper_bound = addr + 1;
296 list_insert_before(&result_range->link, link_addr);
297 } else {
298 //we have good range
299 if (found_range->lower_bound - 1 == addr) {
300 --found_range->lower_bound;
301 } else {
302 //only one possible case
303 ++found_range->upper_bound;
304 if (found_range->link.next != addresses) {
305 usb_address_list_t * next_range =
306 list_get_instance( &found_range->link.next,
307 usb_address_list_t, link);
308 //check neighbour range
309 if (next_range->lower_bound == addr + 1) {
310 //join ranges
311 found_range->upper_bound = next_range->upper_bound;
312 list_remove(&next_range->link);
313 free(next_range);
314 }
315 }
316 }
317 }
318
319}
320
321/**
322 * @}
323 */
Note: See TracBrowser for help on using the repository browser.