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 <libarch/barrier.h>
|
---|
35 | #include <usb/debug.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 |
|
---|
46 | struct 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 |
|
---|
54 | /**
|
---|
55 | * Get the first TRB of a segment.
|
---|
56 | */
|
---|
57 | static inline xhci_trb_t *segment_begin(trb_segment_t *segment)
|
---|
58 | {
|
---|
59 | return segment->trb_storage;
|
---|
60 | }
|
---|
61 |
|
---|
62 | /**
|
---|
63 | * Get the one-past-end TRB of a segment.
|
---|
64 | */
|
---|
65 | static inline xhci_trb_t *segment_end(trb_segment_t *segment)
|
---|
66 | {
|
---|
67 | return segment_begin(segment) + SEGMENT_TRB_COUNT;
|
---|
68 | }
|
---|
69 |
|
---|
70 | /**
|
---|
71 | * Allocate and initialize new segment.
|
---|
72 | *
|
---|
73 | * TODO: When the HC supports 64-bit addressing, there's no need to restrict
|
---|
74 | * to DMAMEM_4GiB.
|
---|
75 | */
|
---|
76 | static int trb_segment_alloc(trb_segment_t **segment)
|
---|
77 | {
|
---|
78 | dma_buffer_t dbuf;
|
---|
79 |
|
---|
80 | const int err = dma_buffer_alloc(&dbuf, PAGE_SIZE);
|
---|
81 | if (err)
|
---|
82 | return err;
|
---|
83 |
|
---|
84 | *segment = dbuf.virt;
|
---|
85 | memset(*segment, 0, PAGE_SIZE);
|
---|
86 | (*segment)->phys = dbuf.phys;
|
---|
87 | usb_log_debug2("Allocated new ring segment.");
|
---|
88 | return EOK;
|
---|
89 | }
|
---|
90 |
|
---|
91 | static void trb_segment_free(trb_segment_t *segment)
|
---|
92 | {
|
---|
93 | dma_buffer_t dbuf = { .virt = segment, .phys = segment->phys };
|
---|
94 | dma_buffer_free(&dbuf);
|
---|
95 | }
|
---|
96 |
|
---|
97 | /**
|
---|
98 | * Initializes the ring with one segment.
|
---|
99 | */
|
---|
100 | int xhci_trb_ring_init(xhci_trb_ring_t *ring)
|
---|
101 | {
|
---|
102 | struct trb_segment *segment;
|
---|
103 | int err;
|
---|
104 |
|
---|
105 | list_initialize(&ring->segments);
|
---|
106 |
|
---|
107 | if ((err = trb_segment_alloc(&segment)) != EOK)
|
---|
108 | return err;
|
---|
109 |
|
---|
110 | list_append(&segment->segments_link, &ring->segments);
|
---|
111 | ring->segment_count = 1;
|
---|
112 |
|
---|
113 | xhci_trb_t *last = segment_end(segment) - 1;
|
---|
114 | xhci_trb_link_fill(last, segment->phys);
|
---|
115 | TRB_LINK_SET_TC(*last, true);
|
---|
116 |
|
---|
117 | ring->enqueue_segment = segment;
|
---|
118 | ring->enqueue_trb = segment_begin(segment);
|
---|
119 | ring->dequeue = segment->phys;
|
---|
120 | ring->pcs = 1;
|
---|
121 |
|
---|
122 | fibril_mutex_initialize(&ring->guard);
|
---|
123 |
|
---|
124 | return EOK;
|
---|
125 | }
|
---|
126 |
|
---|
127 | /**
|
---|
128 | * Free all segments inside the ring.
|
---|
129 | */
|
---|
130 | void xhci_trb_ring_fini(xhci_trb_ring_t *ring)
|
---|
131 | {
|
---|
132 | assert(ring);
|
---|
133 |
|
---|
134 | list_foreach_safe(ring->segments, cur, next) {
|
---|
135 | trb_segment_t *segment = list_get_instance(cur, trb_segment_t, segments_link);
|
---|
136 | trb_segment_free(segment);
|
---|
137 | }
|
---|
138 | }
|
---|
139 |
|
---|
140 | /**
|
---|
141 | * When the enqueue pointer targets a Link TRB, resolve it.
|
---|
142 | *
|
---|
143 | * Relies on segments being in the segment list in linked order.
|
---|
144 | *
|
---|
145 | * According to section 4.9.2.2, figure 16, the link TRBs cannot be chained, so
|
---|
146 | * it shall not be called in cycle, nor have an inner cycle.
|
---|
147 | */
|
---|
148 | static void trb_ring_resolve_link(xhci_trb_ring_t *ring)
|
---|
149 | {
|
---|
150 | link_t *next_segment = list_next(&ring->enqueue_segment->segments_link, &ring->segments);
|
---|
151 | if (!next_segment)
|
---|
152 | next_segment = list_first(&ring->segments);
|
---|
153 |
|
---|
154 | ring->enqueue_segment = list_get_instance(next_segment, trb_segment_t, segments_link);
|
---|
155 | ring->enqueue_trb = segment_begin(ring->enqueue_segment);
|
---|
156 | }
|
---|
157 |
|
---|
158 | /**
|
---|
159 | * Get the physical address of the enqueue pointer.
|
---|
160 | */
|
---|
161 | static uintptr_t trb_ring_enqueue_phys(xhci_trb_ring_t *ring)
|
---|
162 | {
|
---|
163 | uintptr_t trb_id = ring->enqueue_trb - segment_begin(ring->enqueue_segment);
|
---|
164 | return ring->enqueue_segment->phys + trb_id * sizeof(xhci_trb_t);
|
---|
165 | }
|
---|
166 |
|
---|
167 | /**
|
---|
168 | * Decides whether the TRB will trigger an interrupt after being processed.
|
---|
169 | */
|
---|
170 | static bool trb_generates_interrupt(xhci_trb_t *trb)
|
---|
171 | {
|
---|
172 | return TRB_TYPE(*trb) >= XHCI_TRB_TYPE_ENABLE_SLOT_CMD
|
---|
173 | || TRB_IOC(*trb);
|
---|
174 | }
|
---|
175 |
|
---|
176 | /**
|
---|
177 | * Enqueue TD composed of TRBs.
|
---|
178 | *
|
---|
179 | * This will copy specified number of TRBs chained together into the ring. The
|
---|
180 | * cycle flag in TRBs may be changed.
|
---|
181 | *
|
---|
182 | * The copied TRBs must be contiguous in memory, and must not contain Link TRBs.
|
---|
183 | *
|
---|
184 | * We cannot avoid the copying, because the TRB in ring should be updated atomically.
|
---|
185 | *
|
---|
186 | * @param first_trb the first TRB
|
---|
187 | * @param trbs number of TRBS to enqueue
|
---|
188 | * @param phys returns address of the last TRB enqueued
|
---|
189 | * @return EOK on success,
|
---|
190 | * EAGAIN when the ring is too full to fit all TRBs (temporary)
|
---|
191 | */
|
---|
192 | int xhci_trb_ring_enqueue_multiple(xhci_trb_ring_t *ring, xhci_trb_t *first_trb,
|
---|
193 | size_t trbs, uintptr_t *phys)
|
---|
194 | {
|
---|
195 | assert(trbs > 0);
|
---|
196 | fibril_mutex_lock(&ring->guard);
|
---|
197 |
|
---|
198 | xhci_trb_t * const saved_enqueue_trb = ring->enqueue_trb;
|
---|
199 | trb_segment_t * const saved_enqueue_segment = ring->enqueue_segment;
|
---|
200 | if (phys)
|
---|
201 | *phys = (uintptr_t)NULL;
|
---|
202 |
|
---|
203 | /*
|
---|
204 | * First, dry run and advance the enqueue pointer to see if the ring would
|
---|
205 | * be full anytime during the transaction.
|
---|
206 | */
|
---|
207 | xhci_trb_t *trb = first_trb;
|
---|
208 | for (size_t i = 0; i < trbs; ++i, ++trb) {
|
---|
209 | if (trb_generates_interrupt(trb)) {
|
---|
210 | if (*phys)
|
---|
211 | return ENOTSUP;
|
---|
212 | *phys = trb_ring_enqueue_phys(ring);
|
---|
213 | }
|
---|
214 |
|
---|
215 | ring->enqueue_trb++;
|
---|
216 |
|
---|
217 | if (TRB_TYPE(*ring->enqueue_trb) == XHCI_TRB_TYPE_LINK)
|
---|
218 | trb_ring_resolve_link(ring);
|
---|
219 |
|
---|
220 | if (trb_ring_enqueue_phys(ring) == ring->dequeue)
|
---|
221 | goto err_again;
|
---|
222 | }
|
---|
223 |
|
---|
224 | ring->enqueue_segment = saved_enqueue_segment;
|
---|
225 | ring->enqueue_trb = saved_enqueue_trb;
|
---|
226 |
|
---|
227 | /*
|
---|
228 | * Now, copy the TRBs without further checking.
|
---|
229 | */
|
---|
230 | trb = first_trb;
|
---|
231 | for (size_t i = 0; i < trbs; ++i, ++trb) {
|
---|
232 | TRB_SET_CYCLE(*trb, ring->pcs);
|
---|
233 | xhci_trb_copy_to_pio(ring->enqueue_trb, trb);
|
---|
234 |
|
---|
235 | usb_log_debug2("TRB ring(%p): Enqueued TRB %p", ring, trb);
|
---|
236 | ring->enqueue_trb++;
|
---|
237 |
|
---|
238 | if (TRB_TYPE(*ring->enqueue_trb) == XHCI_TRB_TYPE_LINK) {
|
---|
239 | TRB_SET_CYCLE(*ring->enqueue_trb, ring->pcs);
|
---|
240 |
|
---|
241 | if (TRB_LINK_TC(*ring->enqueue_trb)) {
|
---|
242 | ring->pcs = !ring->pcs;
|
---|
243 | usb_log_debug2("TRB ring(%p): PCS toggled", ring);
|
---|
244 | }
|
---|
245 |
|
---|
246 | trb_ring_resolve_link(ring);
|
---|
247 | }
|
---|
248 | }
|
---|
249 |
|
---|
250 | fibril_mutex_unlock(&ring->guard);
|
---|
251 | return EOK;
|
---|
252 |
|
---|
253 | err_again:
|
---|
254 | ring->enqueue_segment = saved_enqueue_segment;
|
---|
255 | ring->enqueue_trb = saved_enqueue_trb;
|
---|
256 | fibril_mutex_unlock(&ring->guard);
|
---|
257 | return EAGAIN;
|
---|
258 | }
|
---|
259 |
|
---|
260 | /**
|
---|
261 | * Enqueue TD composed of a single TRB. See: `xhci_trb_ring_enqueue_multiple`
|
---|
262 | */
|
---|
263 | int xhci_trb_ring_enqueue(xhci_trb_ring_t *ring, xhci_trb_t *td, uintptr_t *phys)
|
---|
264 | {
|
---|
265 | return xhci_trb_ring_enqueue_multiple(ring, td, 1, phys);
|
---|
266 | }
|
---|
267 |
|
---|
268 | /**
|
---|
269 | * Initializes an event ring.
|
---|
270 | */
|
---|
271 | int xhci_event_ring_init(xhci_event_ring_t *ring)
|
---|
272 | {
|
---|
273 | struct trb_segment *segment;
|
---|
274 | int err;
|
---|
275 |
|
---|
276 | list_initialize(&ring->segments);
|
---|
277 |
|
---|
278 | if ((err = trb_segment_alloc(&segment)) != EOK)
|
---|
279 | return err;
|
---|
280 |
|
---|
281 | list_append(&segment->segments_link, &ring->segments);
|
---|
282 | ring->segment_count = 1;
|
---|
283 |
|
---|
284 | ring->dequeue_segment = segment;
|
---|
285 | ring->dequeue_trb = segment_begin(segment);
|
---|
286 | ring->dequeue_ptr = segment->phys;
|
---|
287 |
|
---|
288 | if (dma_buffer_alloc(&ring->erst, PAGE_SIZE)) {
|
---|
289 | xhci_event_ring_fini(ring);
|
---|
290 | return ENOMEM;
|
---|
291 | }
|
---|
292 | xhci_erst_entry_t *erst = ring->erst.virt;
|
---|
293 |
|
---|
294 | memset(erst, 0, PAGE_SIZE);
|
---|
295 | xhci_fill_erst_entry(&erst[0], segment->phys, SEGMENT_TRB_COUNT);
|
---|
296 |
|
---|
297 | ring->ccs = 1;
|
---|
298 |
|
---|
299 | fibril_mutex_initialize(&ring->guard);
|
---|
300 |
|
---|
301 | usb_log_debug("Initialized event ring.");
|
---|
302 |
|
---|
303 | return EOK;
|
---|
304 | }
|
---|
305 |
|
---|
306 | void xhci_event_ring_fini(xhci_event_ring_t *ring)
|
---|
307 | {
|
---|
308 | list_foreach_safe(ring->segments, cur, next) {
|
---|
309 | trb_segment_t *segment = list_get_instance(cur, trb_segment_t, segments_link);
|
---|
310 | dmamem_unmap_anonymous(segment);
|
---|
311 | }
|
---|
312 |
|
---|
313 | dma_buffer_free(&ring->erst);
|
---|
314 | }
|
---|
315 |
|
---|
316 | /**
|
---|
317 | * Get the physical address of the dequeue pointer.
|
---|
318 | */
|
---|
319 | static uintptr_t event_ring_dequeue_phys(xhci_event_ring_t *ring)
|
---|
320 | {
|
---|
321 | uintptr_t trb_id = ring->dequeue_trb - segment_begin(ring->dequeue_segment);
|
---|
322 | return ring->dequeue_segment->phys + trb_id * sizeof(xhci_trb_t);
|
---|
323 | }
|
---|
324 |
|
---|
325 | /**
|
---|
326 | * Fill the event with next valid event from the ring.
|
---|
327 | *
|
---|
328 | * @param event pointer to event to be overwritten
|
---|
329 | * @return EOK on success,
|
---|
330 | * ENOENT when the ring is empty
|
---|
331 | */
|
---|
332 | int xhci_event_ring_dequeue(xhci_event_ring_t *ring, xhci_trb_t *event)
|
---|
333 | {
|
---|
334 | fibril_mutex_lock(&ring->guard);
|
---|
335 |
|
---|
336 | /**
|
---|
337 | * The ERDP reported to the HC is a half-phase off the one we need to
|
---|
338 | * maintain. Therefore, we keep it extra.
|
---|
339 | */
|
---|
340 | ring->dequeue_ptr = event_ring_dequeue_phys(ring);
|
---|
341 |
|
---|
342 | if (TRB_CYCLE(*ring->dequeue_trb) != ring->ccs) {
|
---|
343 | fibril_mutex_unlock(&ring->guard);
|
---|
344 | return ENOENT; /* The ring is empty. */
|
---|
345 | }
|
---|
346 |
|
---|
347 | /* Do not reorder the Cycle bit reading with memcpy */
|
---|
348 | read_barrier();
|
---|
349 |
|
---|
350 | memcpy(event, ring->dequeue_trb, sizeof(xhci_trb_t));
|
---|
351 |
|
---|
352 | ring->dequeue_trb++;
|
---|
353 | const unsigned index = ring->dequeue_trb - segment_begin(ring->dequeue_segment);
|
---|
354 |
|
---|
355 | /* Wrapping around segment boundary */
|
---|
356 | if (index >= SEGMENT_TRB_COUNT) {
|
---|
357 | link_t *next_segment = list_next(&ring->dequeue_segment->segments_link, &ring->segments);
|
---|
358 |
|
---|
359 | /* Wrapping around table boundary */
|
---|
360 | if (!next_segment) {
|
---|
361 | next_segment = list_first(&ring->segments);
|
---|
362 | ring->ccs = !ring->ccs;
|
---|
363 | }
|
---|
364 |
|
---|
365 | ring->dequeue_segment = list_get_instance(next_segment, trb_segment_t, segments_link);
|
---|
366 | ring->dequeue_trb = segment_begin(ring->dequeue_segment);
|
---|
367 | }
|
---|
368 |
|
---|
369 | fibril_mutex_unlock(&ring->guard);
|
---|
370 | return EOK;
|
---|
371 | }
|
---|