source: mainline/uspace/drv/bus/usb/xhci/trb_ring.c@ 56db65d

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 56db65d was 2b61945, checked in by Ondřej Hlavatý <aearsis@…>, 8 years ago

xhci: use device_t for bookkeeping

This started as a little refactoring to move active transfer batch to endpoint. Finding the EP in handler needs devices indexed by slot id. Then I found out we do not use the device_t extendable mechanism. Then there were a lot of errors found while doing all this…

  • Property mode set to 100644
File size: 9.6 KB
RevLine 
[f4eb6c93]1/*
2 * Copyright (c) 2017 Ondrej Hlavaty
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#include <errno.h>
30#include <assert.h>
31#include <ddi.h>
32#include <as.h>
33#include <align.h>
[cb89430]34#include <usb/debug.h>
35#include <usb/host/utils/malloc32.h>
36#include "hw_struct/trb.h"
[f4eb6c93]37#include "trb_ring.h"
38
39#define SEGMENT_HEADER_SIZE (sizeof(link_t) + sizeof(uintptr_t))
40
41/**
42 * Number of TRBs in a segment (with our header).
43 */
44#define SEGMENT_TRB_COUNT ((PAGE_SIZE - SEGMENT_HEADER_SIZE) / sizeof(xhci_trb_t))
45
46struct trb_segment {
[cb89430]47 xhci_trb_t trb_storage [SEGMENT_TRB_COUNT];
[f4eb6c93]48
49 link_t segments_link;
50 uintptr_t phys;
51} __attribute__((aligned(PAGE_SIZE)));
52
53
54static inline xhci_trb_t *segment_begin(trb_segment_t *segment)
55{
56 return segment->trb_storage;
57}
58
59static inline xhci_trb_t *segment_end(trb_segment_t *segment)
60{
61 return segment_begin(segment) + SEGMENT_TRB_COUNT;
62}
63
[cb89430]64/**
65 * Allocate and initialize new segment.
66 *
67 * TODO: When the HC supports 64-bit addressing, there's no need to restrict
68 * to DMAMEM_4GiB.
69 */
[f4eb6c93]70static int trb_segment_allocate(trb_segment_t **segment)
71{
72 uintptr_t phys;
73 int err;
74
75 *segment = AS_AREA_ANY;
76 err = dmamem_map_anonymous(PAGE_SIZE,
77 DMAMEM_4GiB, AS_AREA_READ | AS_AREA_WRITE, 0, &phys,
78 (void *) segment);
79
80 if (err == EOK) {
81 memset(*segment, 0, PAGE_SIZE);
82 (*segment)->phys = phys;
[cb89430]83
84 usb_log_debug2("Allocated new ring segment.");
[f4eb6c93]85 }
86
87 return err;
88}
89
[cb89430]90/**
91 * Initializes the ring with one segment.
92 * Event when it fails, the structure needs to be finalized.
93 */
[9b2f69e]94int xhci_trb_ring_init(xhci_trb_ring_t *ring)
[f4eb6c93]95{
96 struct trb_segment *segment;
97 int err;
98
[cb89430]99 list_initialize(&ring->segments);
100
[f4eb6c93]101 if ((err = trb_segment_allocate(&segment)) != EOK)
102 return err;
103
104 list_append(&segment->segments_link, &ring->segments);
[cb89430]105 ring->segment_count = 1;
[f4eb6c93]106
107 xhci_trb_t *last = segment_end(segment) - 1;
108 xhci_trb_link_fill(last, segment->phys);
109 xhci_trb_set_cycle(last, true);
110
111 ring->enqueue_segment = segment;
112 ring->enqueue_trb = segment_begin(segment);
113 ring->dequeue = segment->phys;
114 ring->pcs = 1;
115
[a2b0ba3]116 fibril_mutex_initialize(&ring->guard);
117
[d1d7a92]118 usb_log_debug2("Initialized new TRB ring.");
[cb89430]119
[f4eb6c93]120 return EOK;
121}
122
[cb89430]123int xhci_trb_ring_fini(xhci_trb_ring_t *ring)
[f4eb6c93]124{
[3d8a3bd]125 if (!ring)
126 return EOK;
127
[cb89430]128 list_foreach(ring->segments, segments_link, trb_segment_t, segment)
129 dmamem_unmap_anonymous(segment);
[f4eb6c93]130 return EOK;
131}
132
133/**
134 * When the enqueue pointer targets a Link TRB, resolve it.
135 *
136 * Relies on segments being in the segment list in linked order.
137 *
138 * According to section 4.9.2.2, figure 16, the link TRBs cannot be chained, so
139 * it shall not be called in cycle, nor have an inner cycle.
140 */
141static void trb_ring_resolve_link(xhci_trb_ring_t *ring)
142{
143 link_t *next_segment = list_next(&ring->enqueue_segment->segments_link, &ring->segments);
144 if (!next_segment)
145 next_segment = list_first(&ring->segments);
146
147 ring->enqueue_segment = list_get_instance(next_segment, trb_segment_t, segments_link);
148 ring->enqueue_trb = segment_begin(ring->enqueue_segment);
149}
150
[cb89430]151static uintptr_t trb_ring_enqueue_phys(xhci_trb_ring_t *ring)
[f4eb6c93]152{
153 uintptr_t trb_id = ring->enqueue_trb - segment_begin(ring->enqueue_segment);
154 return ring->enqueue_segment->phys + trb_id * sizeof(xhci_trb_t);
155}
156
[2b61945]157static bool trb_generates_interrupt(xhci_trb_t *trb)
158{
159 return TRB_TYPE(*trb) >= XHCI_TRB_TYPE_ENABLE_SLOT_CMD
160 || TRB_IOC(*trb);
161}
162
[cb89430]163/**
[d1d7a92]164 * Enqueue TDs composed of TRBs.
[cb89430]165 *
[d1d7a92]166 * This will copy specified number of TRBs chained together into the ring. The
167 * cycle flag in TRBs may be changed.
[cb89430]168 *
[d1d7a92]169 * The copied TRBs must be contiguous in memory, and must not contain Link TRBs.
[cb89430]170 *
171 * We cannot avoid the copying, because the TRB in ring should be updated atomically.
172 *
[d1d7a92]173 * @param first_trb the first TRB
174 * @param trbs number of TRBS to enqueue
175 * @param phys returns address of the last TRB enqueued
[cb89430]176 * @return EOK on success,
177 * EAGAIN when the ring is too full to fit all TRBs (temporary)
178 */
[d1d7a92]179int xhci_trb_ring_enqueue_multiple(xhci_trb_ring_t *ring, xhci_trb_t *first_trb,
180 size_t trbs, uintptr_t *phys)
[f4eb6c93]181{
[d1d7a92]182 assert(trbs > 0);
[a2b0ba3]183 fibril_mutex_lock(&ring->guard);
184
[f4eb6c93]185 xhci_trb_t * const saved_enqueue_trb = ring->enqueue_trb;
186 trb_segment_t * const saved_enqueue_segment = ring->enqueue_segment;
[548c123]187 if (phys)
[cc9ac7c]188 *phys = (uintptr_t)NULL;
[f4eb6c93]189
190 /*
191 * First, dry run and advance the enqueue pointer to see if the ring would
192 * be full anytime during the transaction.
193 */
[d1d7a92]194 xhci_trb_t *trb = first_trb;
195 for (size_t i = 0; i < trbs; ++i, ++trb) {
[2b61945]196 if (trb_generates_interrupt(trb)) {
197 if (*phys)
198 return ENOTSUP;
199 *phys = trb_ring_enqueue_phys(ring);
200 }
201
[f4eb6c93]202 ring->enqueue_trb++;
203
204 if (TRB_TYPE(*ring->enqueue_trb) == XHCI_TRB_TYPE_LINK)
205 trb_ring_resolve_link(ring);
206
[cb89430]207 if (trb_ring_enqueue_phys(ring) == ring->dequeue)
[f4eb6c93]208 goto err_again;
[d1d7a92]209 }
[f4eb6c93]210
211 ring->enqueue_segment = saved_enqueue_segment;
212 ring->enqueue_trb = saved_enqueue_trb;
213
214 /*
215 * Now, copy the TRBs without further checking.
216 */
[d1d7a92]217 trb = first_trb;
218 for (size_t i = 0; i < trbs; ++i, ++trb) {
[f4eb6c93]219 xhci_trb_set_cycle(trb, ring->pcs);
220 xhci_trb_copy(ring->enqueue_trb, trb);
221
[cb89430]222 usb_log_debug2("TRB ring(%p): Enqueued TRB %p", ring, trb);
[f4eb6c93]223 ring->enqueue_trb++;
224
225 if (TRB_TYPE(*ring->enqueue_trb) == XHCI_TRB_TYPE_LINK) {
226 // XXX: Check, whether the order here is correct (ambiguous instructions in 4.11.5.1)
227 xhci_trb_set_cycle(ring->enqueue_trb, ring->pcs);
228
[cb89430]229 if (TRB_LINK_TC(*ring->enqueue_trb)) {
[f4eb6c93]230 ring->pcs = !ring->pcs;
[cb89430]231 usb_log_debug2("TRB ring(%p): PCS toggled", ring);
232 }
[f4eb6c93]233
234 trb_ring_resolve_link(ring);
235 }
[d1d7a92]236 }
[f4eb6c93]237
[a2b0ba3]238 fibril_mutex_unlock(&ring->guard);
[f4eb6c93]239 return EOK;
240
241err_again:
242 ring->enqueue_segment = saved_enqueue_segment;
243 ring->enqueue_trb = saved_enqueue_trb;
[a2b0ba3]244 fibril_mutex_unlock(&ring->guard);
[f4eb6c93]245 return EAGAIN;
246}
[cb89430]247
[d1d7a92]248/**
249 * Enqueue TD composed of a single TRB. See: `xhci_trb_ring_enqueue_multiple`
250 */
251int xhci_trb_ring_enqueue(xhci_trb_ring_t *ring, xhci_trb_t *td, uintptr_t *phys)
252{
253 return xhci_trb_ring_enqueue_multiple(ring, td, 1, phys);
254}
255
[cb89430]256/**
257 * Initializes an event ring.
258 * Even when it fails, the structure needs to be finalized.
259 */
[9b2f69e]260int xhci_event_ring_init(xhci_event_ring_t *ring)
[cb89430]261{
262 struct trb_segment *segment;
263 int err;
264
265 list_initialize(&ring->segments);
266
267 if ((err = trb_segment_allocate(&segment)) != EOK)
268 return err;
269
270 list_append(&segment->segments_link, &ring->segments);
271 ring->segment_count = 1;
272
273 ring->dequeue_segment = segment;
274 ring->dequeue_trb = segment_begin(segment);
275 ring->dequeue_ptr = segment->phys;
276
277 ring->erst = malloc32(PAGE_SIZE);
278 if (ring->erst == NULL)
279 return ENOMEM;
[9af3281]280 memset(ring->erst, 0, PAGE_SIZE);
[cb89430]281
282 xhci_fill_erst_entry(&ring->erst[0], segment->phys, SEGMENT_TRB_COUNT);
283
284 ring->ccs = 1;
285
[a1eb7c67]286 fibril_mutex_initialize(&ring->guard);
287
[cb89430]288 usb_log_debug("Initialized event ring.");
289
290 return EOK;
291}
292
293int xhci_event_ring_fini(xhci_event_ring_t *ring)
294{
295 list_foreach(ring->segments, segments_link, trb_segment_t, segment)
296 dmamem_unmap_anonymous(segment);
297
298 if (ring->erst)
299 free32(ring->erst);
300
301 return EOK;
302}
303
304static uintptr_t event_ring_dequeue_phys(xhci_event_ring_t *ring)
305{
306 uintptr_t trb_id = ring->dequeue_trb - segment_begin(ring->dequeue_segment);
307 return ring->dequeue_segment->phys + trb_id * sizeof(xhci_trb_t);
308}
309
310/**
311 * Fill the event with next valid event from the ring.
312 *
313 * @param event pointer to event to be overwritten
314 * @return EOK on success,
315 * ENOENT when the ring is empty
316 */
317int xhci_event_ring_dequeue(xhci_event_ring_t *ring, xhci_trb_t *event)
318{
[a1eb7c67]319 fibril_mutex_lock(&ring->guard);
320
[cb89430]321 /**
322 * The ERDP reported to the HC is a half-phase off the one we need to
323 * maintain. Therefore, we keep it extra.
324 */
325 ring->dequeue_ptr = event_ring_dequeue_phys(ring);
326
[a1eb7c67]327 if (TRB_CYCLE(*ring->dequeue_trb) != ring->ccs) {
328 fibril_mutex_unlock(&ring->guard);
[cb89430]329 return ENOENT; /* The ring is empty. */
[a1eb7c67]330 }
[cb89430]331
332 memcpy(event, ring->dequeue_trb, sizeof(xhci_trb_t));
333
334 ring->dequeue_trb++;
335 const unsigned index = ring->dequeue_trb - segment_begin(ring->dequeue_segment);
336
337 /* Wrapping around segment boundary */
338 if (index >= SEGMENT_TRB_COUNT) {
339 link_t *next_segment = list_next(&ring->dequeue_segment->segments_link, &ring->segments);
340
341 /* Wrapping around table boundary */
342 if (!next_segment) {
343 next_segment = list_first(&ring->segments);
344 ring->ccs = !ring->ccs;
345 }
346
347 ring->dequeue_segment = list_get_instance(next_segment, trb_segment_t, segments_link);
348 ring->dequeue_trb = segment_begin(ring->dequeue_segment);
349 }
350
[a1eb7c67]351 fibril_mutex_unlock(&ring->guard);
[cb89430]352 return EOK;
353}
Note: See TracBrowser for help on using the repository browser.