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

lfn serial ticket/834-toolchain-update topic/fix-logger-deadlock topic/msim-upgrade topic/simplify-dev-export
Last change on this file since a2b0ba3 was a2b0ba3, checked in by Jaroslav Jindrak <dzejrou@…>, 9 years ago

Added synchronization to trb rin enqueue.

  • Property mode set to 100644
File size: 9.0 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, xhci_hc_t *hc)
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_debug("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 a TD composed of TRBs.
159 *
160 * This will copy all TRBs chained together into the ring. The cycle flag in
161 * TRBs may be changed.
162 *
163 * The chained 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 td the first TRB of TD
168 * @param phys returns address of the first TRB enqueued
169 * @return EOK on success,
170 * EAGAIN when the ring is too full to fit all TRBs (temporary)
171 */
172int xhci_trb_ring_enqueue(xhci_trb_ring_t *ring, xhci_trb_t *td, uintptr_t *phys)
173{
174 fibril_mutex_lock(&ring->guard);
175
176 xhci_trb_t * const saved_enqueue_trb = ring->enqueue_trb;
177 trb_segment_t * const saved_enqueue_segment = ring->enqueue_segment;
178 if (phys)
179 *phys = (uintptr_t)NULL;
180
181 /*
182 * First, dry run and advance the enqueue pointer to see if the ring would
183 * be full anytime during the transaction.
184 */
185 xhci_trb_t *trb = td;
186 do {
187 ring->enqueue_trb++;
188
189 if (TRB_TYPE(*ring->enqueue_trb) == XHCI_TRB_TYPE_LINK)
190 trb_ring_resolve_link(ring);
191
192 if (trb_ring_enqueue_phys(ring) == ring->dequeue)
193 goto err_again;
194 } while (xhci_trb_is_chained(trb++));
195
196 ring->enqueue_segment = saved_enqueue_segment;
197 ring->enqueue_trb = saved_enqueue_trb;
198 if (phys)
199 *phys = trb_ring_enqueue_phys(ring);
200
201 /*
202 * Now, copy the TRBs without further checking.
203 */
204 trb = td;
205 do {
206 xhci_trb_set_cycle(trb, ring->pcs);
207 xhci_trb_copy(ring->enqueue_trb, trb);
208
209 usb_log_debug2("TRB ring(%p): Enqueued TRB %p", ring, trb);
210 usb_log_error("RING->PCS: %u", ring->pcs);
211 ring->enqueue_trb++;
212
213 if (TRB_TYPE(*ring->enqueue_trb) == XHCI_TRB_TYPE_LINK) {
214 // XXX: Check, whether the order here is correct (ambiguous instructions in 4.11.5.1)
215 xhci_trb_set_cycle(ring->enqueue_trb, ring->pcs);
216
217 if (TRB_LINK_TC(*ring->enqueue_trb)) {
218 ring->pcs = !ring->pcs;
219 usb_log_debug2("TRB ring(%p): PCS toggled", ring);
220 }
221
222 trb_ring_resolve_link(ring);
223 }
224 } while (xhci_trb_is_chained(trb++));
225
226 fibril_mutex_unlock(&ring->guard);
227 return EOK;
228
229err_again:
230 ring->enqueue_segment = saved_enqueue_segment;
231 ring->enqueue_trb = saved_enqueue_trb;
232 fibril_mutex_unlock(&ring->guard);
233 return EAGAIN;
234}
235
236/**
237 * Initializes an event ring.
238 * Even when it fails, the structure needs to be finalized.
239 */
240int xhci_event_ring_init(xhci_event_ring_t *ring, xhci_hc_t *hc)
241{
242 struct trb_segment *segment;
243 int err;
244
245 list_initialize(&ring->segments);
246
247 if ((err = trb_segment_allocate(&segment)) != EOK)
248 return err;
249
250 list_append(&segment->segments_link, &ring->segments);
251 ring->segment_count = 1;
252
253 ring->dequeue_segment = segment;
254 ring->dequeue_trb = segment_begin(segment);
255 ring->dequeue_ptr = segment->phys;
256
257 ring->erst = malloc32(PAGE_SIZE);
258 if (ring->erst == NULL)
259 return ENOMEM;
260 memset(ring->erst, 0, PAGE_SIZE);
261
262 xhci_fill_erst_entry(&ring->erst[0], segment->phys, SEGMENT_TRB_COUNT);
263
264 ring->ccs = 1;
265
266 usb_log_debug("Initialized event ring.");
267
268 return EOK;
269}
270
271int xhci_event_ring_fini(xhci_event_ring_t *ring)
272{
273 list_foreach(ring->segments, segments_link, trb_segment_t, segment)
274 dmamem_unmap_anonymous(segment);
275
276 if (ring->erst)
277 free32(ring->erst);
278
279 return EOK;
280}
281
282static uintptr_t event_ring_dequeue_phys(xhci_event_ring_t *ring)
283{
284 uintptr_t trb_id = ring->dequeue_trb - segment_begin(ring->dequeue_segment);
285 return ring->dequeue_segment->phys + trb_id * sizeof(xhci_trb_t);
286}
287
288/**
289 * Fill the event with next valid event from the ring.
290 *
291 * @param event pointer to event to be overwritten
292 * @return EOK on success,
293 * ENOENT when the ring is empty
294 */
295int xhci_event_ring_dequeue(xhci_event_ring_t *ring, xhci_trb_t *event)
296{
297 /**
298 * The ERDP reported to the HC is a half-phase off the one we need to
299 * maintain. Therefore, we keep it extra.
300 */
301 ring->dequeue_ptr = event_ring_dequeue_phys(ring);
302
303 if (TRB_CYCLE(*ring->dequeue_trb) != ring->ccs)
304 return ENOENT; /* The ring is empty. */
305
306 memcpy(event, ring->dequeue_trb, sizeof(xhci_trb_t));
307
308 ring->dequeue_trb++;
309 const unsigned index = ring->dequeue_trb - segment_begin(ring->dequeue_segment);
310
311 /* Wrapping around segment boundary */
312 if (index >= SEGMENT_TRB_COUNT) {
313 link_t *next_segment = list_next(&ring->dequeue_segment->segments_link, &ring->segments);
314
315 /* Wrapping around table boundary */
316 if (!next_segment) {
317 next_segment = list_first(&ring->segments);
318 ring->ccs = !ring->ccs;
319 }
320
321 ring->dequeue_segment = list_get_instance(next_segment, trb_segment_t, segments_link);
322 ring->dequeue_trb = segment_begin(ring->dequeue_segment);
323 }
324
325 return EOK;
326}
Note: See TracBrowser for help on using the repository browser.