source: mainline/uspace/drv/bus/usb/xhci/trb_ring.c@ 74b852b

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 74b852b was d1d7a92, checked in by Petr Manek <petr.manek@…>, 8 years ago

Added option to enqueue multiple TDs at once. Demoted some log messages.

  • Property mode set to 100644
File size: 9.4 KB
Line 
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>
34#include <usb/debug.h>
35#include <usb/host/utils/malloc32.h>
36#include "hw_struct/trb.h"
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 {
47 xhci_trb_t trb_storage [SEGMENT_TRB_COUNT];
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
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 */
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;
83
84 usb_log_debug2("Allocated new ring segment.");
85 }
86
87 return err;
88}
89
90/**
91 * Initializes the ring with one segment.
92 * Event when it fails, the structure needs to be finalized.
93 */
94int xhci_trb_ring_init(xhci_trb_ring_t *ring)
95{
96 struct trb_segment *segment;
97 int err;
98
99 list_initialize(&ring->segments);
100
101 if ((err = trb_segment_allocate(&segment)) != EOK)
102 return err;
103
104 list_append(&segment->segments_link, &ring->segments);
105 ring->segment_count = 1;
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
116 fibril_mutex_initialize(&ring->guard);
117
118 usb_log_debug2("Initialized new TRB ring.");
119
120 return EOK;
121}
122
123int xhci_trb_ring_fini(xhci_trb_ring_t *ring)
124{
125 if (!ring)
126 return EOK;
127
128 list_foreach(ring->segments, segments_link, trb_segment_t, segment)
129 dmamem_unmap_anonymous(segment);
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
151static uintptr_t trb_ring_enqueue_phys(xhci_trb_ring_t *ring)
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
157/**
158 * Enqueue TDs composed of TRBs.
159 *
160 * This will copy specified number of TRBs chained together into the ring. The
161 * cycle flag in TRBs may be changed.
162 *
163 * The copied TRBs must be contiguous in memory, and must not contain Link TRBs.
164 *
165 * We cannot avoid the copying, because the TRB in ring should be updated atomically.
166 *
167 * @param first_trb the first TRB
168 * @param trbs number of TRBS to enqueue
169 * @param phys returns address of the last TRB enqueued
170 * @return EOK on success,
171 * EAGAIN when the ring is too full to fit all TRBs (temporary)
172 */
173int xhci_trb_ring_enqueue_multiple(xhci_trb_ring_t *ring, xhci_trb_t *first_trb,
174 size_t trbs, uintptr_t *phys)
175{
176 assert(trbs > 0);
177 fibril_mutex_lock(&ring->guard);
178
179 xhci_trb_t * const saved_enqueue_trb = ring->enqueue_trb;
180 trb_segment_t * const saved_enqueue_segment = ring->enqueue_segment;
181 if (phys)
182 *phys = (uintptr_t)NULL;
183
184 /*
185 * First, dry run and advance the enqueue pointer to see if the ring would
186 * be full anytime during the transaction.
187 */
188 xhci_trb_t *trb = first_trb;
189 for (size_t i = 0; i < trbs; ++i, ++trb) {
190 ring->enqueue_trb++;
191
192 if (TRB_TYPE(*ring->enqueue_trb) == XHCI_TRB_TYPE_LINK)
193 trb_ring_resolve_link(ring);
194
195 if (trb_ring_enqueue_phys(ring) == ring->dequeue)
196 goto err_again;
197 }
198
199 ring->enqueue_segment = saved_enqueue_segment;
200 ring->enqueue_trb = saved_enqueue_trb;
201
202 /*
203 * Now, copy the TRBs without further checking.
204 */
205 trb = first_trb;
206 for (size_t i = 0; i < trbs; ++i, ++trb) {
207 if (phys && i == trbs - 1)
208 *phys = trb_ring_enqueue_phys(ring);
209
210 xhci_trb_set_cycle(trb, ring->pcs);
211 xhci_trb_copy(ring->enqueue_trb, trb);
212
213 usb_log_debug2("TRB ring(%p): Enqueued TRB %p", ring, trb);
214 ring->enqueue_trb++;
215
216 if (TRB_TYPE(*ring->enqueue_trb) == XHCI_TRB_TYPE_LINK) {
217 // XXX: Check, whether the order here is correct (ambiguous instructions in 4.11.5.1)
218 xhci_trb_set_cycle(ring->enqueue_trb, ring->pcs);
219
220 if (TRB_LINK_TC(*ring->enqueue_trb)) {
221 ring->pcs = !ring->pcs;
222 usb_log_debug2("TRB ring(%p): PCS toggled", ring);
223 }
224
225 trb_ring_resolve_link(ring);
226 }
227 }
228
229 fibril_mutex_unlock(&ring->guard);
230 return EOK;
231
232err_again:
233 ring->enqueue_segment = saved_enqueue_segment;
234 ring->enqueue_trb = saved_enqueue_trb;
235 fibril_mutex_unlock(&ring->guard);
236 return EAGAIN;
237}
238
239/**
240 * Enqueue TD composed of a single TRB. See: `xhci_trb_ring_enqueue_multiple`
241 */
242int xhci_trb_ring_enqueue(xhci_trb_ring_t *ring, xhci_trb_t *td, uintptr_t *phys)
243{
244 return xhci_trb_ring_enqueue_multiple(ring, td, 1, phys);
245}
246
247/**
248 * Initializes an event ring.
249 * Even when it fails, the structure needs to be finalized.
250 */
251int xhci_event_ring_init(xhci_event_ring_t *ring)
252{
253 struct trb_segment *segment;
254 int err;
255
256 list_initialize(&ring->segments);
257
258 if ((err = trb_segment_allocate(&segment)) != EOK)
259 return err;
260
261 list_append(&segment->segments_link, &ring->segments);
262 ring->segment_count = 1;
263
264 ring->dequeue_segment = segment;
265 ring->dequeue_trb = segment_begin(segment);
266 ring->dequeue_ptr = segment->phys;
267
268 ring->erst = malloc32(PAGE_SIZE);
269 if (ring->erst == NULL)
270 return ENOMEM;
271 memset(ring->erst, 0, PAGE_SIZE);
272
273 xhci_fill_erst_entry(&ring->erst[0], segment->phys, SEGMENT_TRB_COUNT);
274
275 ring->ccs = 1;
276
277 fibril_mutex_initialize(&ring->guard);
278
279 usb_log_debug("Initialized event ring.");
280
281 return EOK;
282}
283
284int xhci_event_ring_fini(xhci_event_ring_t *ring)
285{
286 list_foreach(ring->segments, segments_link, trb_segment_t, segment)
287 dmamem_unmap_anonymous(segment);
288
289 if (ring->erst)
290 free32(ring->erst);
291
292 return EOK;
293}
294
295static uintptr_t event_ring_dequeue_phys(xhci_event_ring_t *ring)
296{
297 uintptr_t trb_id = ring->dequeue_trb - segment_begin(ring->dequeue_segment);
298 return ring->dequeue_segment->phys + trb_id * sizeof(xhci_trb_t);
299}
300
301/**
302 * Fill the event with next valid event from the ring.
303 *
304 * @param event pointer to event to be overwritten
305 * @return EOK on success,
306 * ENOENT when the ring is empty
307 */
308int xhci_event_ring_dequeue(xhci_event_ring_t *ring, xhci_trb_t *event)
309{
310 fibril_mutex_lock(&ring->guard);
311
312 /**
313 * The ERDP reported to the HC is a half-phase off the one we need to
314 * maintain. Therefore, we keep it extra.
315 */
316 ring->dequeue_ptr = event_ring_dequeue_phys(ring);
317
318 if (TRB_CYCLE(*ring->dequeue_trb) != ring->ccs) {
319 fibril_mutex_unlock(&ring->guard);
320 return ENOENT; /* The ring is empty. */
321 }
322
323 memcpy(event, ring->dequeue_trb, sizeof(xhci_trb_t));
324
325 ring->dequeue_trb++;
326 const unsigned index = ring->dequeue_trb - segment_begin(ring->dequeue_segment);
327
328 /* Wrapping around segment boundary */
329 if (index >= SEGMENT_TRB_COUNT) {
330 link_t *next_segment = list_next(&ring->dequeue_segment->segments_link, &ring->segments);
331
332 /* Wrapping around table boundary */
333 if (!next_segment) {
334 next_segment = list_first(&ring->segments);
335 ring->ccs = !ring->ccs;
336 }
337
338 ring->dequeue_segment = list_get_instance(next_segment, trb_segment_t, segments_link);
339 ring->dequeue_trb = segment_begin(ring->dequeue_segment);
340 }
341
342 fibril_mutex_unlock(&ring->guard);
343 return EOK;
344}
Note: See TracBrowser for help on using the repository browser.