2 * OHCI HCD (Host Controller Driver) for USB.
4 * (C) Copyright 1999 Roman Weissgaerber <weissg@vienna.at>
5 * (C) Copyright 2000-2002 David Brownell <dbrownell@users.sourceforge.net>
7 * This file is licenced under the GPL.
10 /*-------------------------------------------------------------------------*/
13 * OHCI deals with three types of memory:
14 * - data used only by the HCD ... kmalloc is fine
15 * - async and periodic schedules, shared by HC and HCD ... these
16 * need to use dma_pool or dma_alloc_coherent
17 * - driver buffers, read/written by HC ... the hcd glue or the
18 * device driver provides us with dma addresses
20 * There's also "register" data, which is memory mapped.
21 * No memory seen by this driver (or any HCD) may be paged out.
24 /*-------------------------------------------------------------------------*/
26 static void admhc_hcd_init(struct admhcd
*ahcd
)
28 ahcd
->next_statechange
= jiffies
;
29 spin_lock_init(&ahcd
->lock
);
30 INIT_LIST_HEAD(&ahcd
->pending
);
33 /*-------------------------------------------------------------------------*/
35 static int admhc_mem_init(struct admhcd
*ahcd
)
37 ahcd
->td_cache
= dma_pool_create("admhc_td",
38 admhcd_to_hcd(ahcd
)->self
.controller
,
40 TD_ALIGN
, /* byte alignment */
41 0 /* no page-crossing issues */
46 ahcd
->ed_cache
= dma_pool_create("admhc_ed",
47 admhcd_to_hcd(ahcd
)->self
.controller
,
49 ED_ALIGN
, /* byte alignment */
50 0 /* no page-crossing issues */
58 dma_pool_destroy(ahcd
->td_cache
);
59 ahcd
->td_cache
= NULL
;
64 static void admhc_mem_cleanup(struct admhcd
*ahcd
)
67 dma_pool_destroy(ahcd
->td_cache
);
68 ahcd
->td_cache
= NULL
;
72 dma_pool_destroy(ahcd
->ed_cache
);
73 ahcd
->ed_cache
= NULL
;
77 /*-------------------------------------------------------------------------*/
79 /* ahcd "done list" processing needs this mapping */
80 static inline struct td
*dma_to_td(struct admhcd
*ahcd
, dma_addr_t td_dma
)
85 td
= ahcd
->td_hash
[TD_HASH_FUNC(td_dma
)];
86 while (td
&& td
->td_dma
!= td_dma
)
93 static struct td
*td_alloc(struct admhcd
*ahcd
, gfp_t mem_flags
)
98 td
= dma_pool_alloc(ahcd
->td_cache
, mem_flags
, &dma
);
102 /* in case ahcd fetches it, make it look dead */
103 memset(td
, 0, sizeof *td
);
104 td
->hwNextTD
= cpu_to_hc32(ahcd
, dma
);
106 /* hashed in td_fill */
111 static void td_free(struct admhcd
*ahcd
, struct td
*td
)
113 struct td
**prev
= &ahcd
->td_hash
[TD_HASH_FUNC(td
->td_dma
)];
115 while (*prev
&& *prev
!= td
)
116 prev
= &(*prev
)->td_hash
;
121 else if ((td
->hwINFO
& cpu_to_hc32(ahcd
, TD_DONE
)) != 0)
122 admhc_dbg (ahcd
, "no hash for td %p\n", td
);
124 else if ((td
->flags
& TD_FLAG_DONE
) != 0)
125 admhc_dbg (ahcd
, "no hash for td %p\n", td
);
127 dma_pool_free(ahcd
->td_cache
, td
, td
->td_dma
);
130 /*-------------------------------------------------------------------------*/
133 static struct ed
*ed_alloc(struct admhcd
*ahcd
, gfp_t mem_flags
)
138 ed
= dma_pool_alloc(ahcd
->ed_cache
, mem_flags
, &dma
);
142 memset(ed
, 0, sizeof(*ed
));
145 INIT_LIST_HEAD(&ed
->td_list
);
146 INIT_LIST_HEAD(&ed
->urb_list
);
151 static void ed_free(struct admhcd
*ahcd
, struct ed
*ed
)
153 dma_pool_free(ahcd
->ed_cache
, ed
, ed
->dma
);
156 /*-------------------------------------------------------------------------*/
159 static void urb_priv_free(struct admhcd
*ahcd
, struct urb_priv
*urb_priv
)
163 for (i
= 0; i
< urb_priv
->td_cnt
; i
++)
165 td_free(ahcd
, urb_priv
->td
[i
]);
167 list_del(&urb_priv
->pending
);
171 static struct urb_priv
*urb_priv_alloc(struct admhcd
*ahcd
, int num_tds
,
174 struct urb_priv
*priv
;
176 /* allocate the private part of the URB */
177 priv
= kzalloc(sizeof(*priv
) + sizeof(struct td
) * num_tds
, mem_flags
);
181 /* allocate the TDs (deferring hash chain updates) */
182 for (priv
->td_cnt
= 0; priv
->td_cnt
< num_tds
; priv
->td_cnt
++) {
183 priv
->td
[priv
->td_cnt
] = td_alloc(ahcd
, mem_flags
);
184 if (priv
->td
[priv
->td_cnt
] == NULL
)
188 INIT_LIST_HEAD(&priv
->pending
);
193 urb_priv_free(ahcd
, priv
);
This page took 0.048982 seconds and 5 git commands to generate.