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 | /** @addtogroup drvusbxhci
|
---|
30 | * @{
|
---|
31 | */
|
---|
32 | /** @file
|
---|
33 | * TRB Ring is a data structure for communication between HC and software.
|
---|
34 | *
|
---|
35 | * Despite this description, it is not used as an hardware structure - all but
|
---|
36 | * the Event ring is used as buffer of the TRBs itself, linked by Link TRB to
|
---|
37 | * form a (possibly multi-segment) circular buffer.
|
---|
38 | *
|
---|
39 | * This data structure abstracts this behavior.
|
---|
40 | */
|
---|
41 |
|
---|
42 | #ifndef XHCI_TRB_RING_H
|
---|
43 | #define XHCI_TRB_RING_H
|
---|
44 |
|
---|
45 | #include <adt/list.h>
|
---|
46 | #include <libarch/config.h>
|
---|
47 |
|
---|
48 | typedef struct trb_segment trb_segment_t;
|
---|
49 | typedef struct xhci_hc xhci_hc_t;
|
---|
50 | typedef struct xhci_trb xhci_trb_t;
|
---|
51 | typedef struct xhci_erst_entry xhci_erst_entry_t;
|
---|
52 |
|
---|
53 | /**
|
---|
54 | * A TRB ring of which the software is a producer - command / transfer.
|
---|
55 | */
|
---|
56 | typedef struct xhci_trb_ring {
|
---|
57 | list_t segments; /* List of assigned segments */
|
---|
58 | int segment_count; /* Number of segments assigned */
|
---|
59 |
|
---|
60 | /*
|
---|
61 | * As the link TRBs connect physical addresses, we need to keep track of
|
---|
62 | * active segment in virtual memory. The enqueue ptr should always belong
|
---|
63 | * to the enqueue segment.
|
---|
64 | */
|
---|
65 | trb_segment_t *enqueue_segment;
|
---|
66 | xhci_trb_t *enqueue_trb;
|
---|
67 |
|
---|
68 | uintptr_t dequeue; /* Last reported position of the dequeue pointer */
|
---|
69 | bool pcs; /* Producer Cycle State: section 4.9.2 */
|
---|
70 | } xhci_trb_ring_t;
|
---|
71 |
|
---|
72 | int xhci_trb_ring_init(xhci_trb_ring_t *, xhci_hc_t *);
|
---|
73 | int xhci_trb_ring_fini(xhci_trb_ring_t *);
|
---|
74 | int xhci_trb_ring_enqueue(xhci_trb_ring_t *, xhci_trb_t *);
|
---|
75 |
|
---|
76 | /**
|
---|
77 | * Get the initial value to fill into CRCR.
|
---|
78 | */
|
---|
79 | static inline uintptr_t xhci_trb_ring_get_dequeue_ptr(xhci_trb_ring_t *ring)
|
---|
80 | {
|
---|
81 | return ring->dequeue;
|
---|
82 | }
|
---|
83 |
|
---|
84 | /**
|
---|
85 | * When an event is received by the upper layer, it needs to update the dequeue
|
---|
86 | * pointer inside the ring. Otherwise, the ring will soon show up as full.
|
---|
87 | */
|
---|
88 | void xhci_trb_ring_update_dequeue(xhci_trb_ring_t *, uintptr_t);
|
---|
89 | uintptr_t xhci_trb_ring_get_dequeue_ptr(xhci_trb_ring_t *);
|
---|
90 |
|
---|
91 | /**
|
---|
92 | * A TRB ring of which the software is a consumer (event rings).
|
---|
93 | */
|
---|
94 | typedef struct xhci_event_ring {
|
---|
95 | list_t segments; /* List of assigned segments */
|
---|
96 | int segment_count; /* Number of segments assigned */
|
---|
97 |
|
---|
98 | trb_segment_t *dequeue_segment; /* Current segment of the dequeue ptr */
|
---|
99 | xhci_trb_t *dequeue_trb; /* Next TRB to be processed */
|
---|
100 | uintptr_t dequeue_ptr; /* Physical address of the ERDP to be reported to the HC */
|
---|
101 |
|
---|
102 | xhci_erst_entry_t *erst; /* ERST given to the HC */
|
---|
103 |
|
---|
104 | bool ccs; /* Consumer Cycle State: section 4.9.2 */
|
---|
105 | } xhci_event_ring_t;
|
---|
106 |
|
---|
107 | int xhci_event_ring_init(xhci_event_ring_t *, xhci_hc_t *);
|
---|
108 | int xhci_event_ring_fini(xhci_event_ring_t *);
|
---|
109 | int xhci_event_ring_dequeue(xhci_event_ring_t *, xhci_trb_t *);
|
---|
110 |
|
---|
111 | #endif
|
---|