3e9c2f0b92ac9bc08f2f2c9278a9abf17e6173d8
[openwrt/svn-archive/archive.git] / target / linux / adm5120 / files / drivers / usb / host / adm5120-mem.c
1 /*
2 * OHCI HCD (Host Controller Driver) for USB.
3 *
4 * (C) Copyright 1999 Roman Weissgaerber <weissg@vienna.at>
5 * (C) Copyright 2000-2002 David Brownell <dbrownell@users.sourceforge.net>
6 *
7 * This file is licenced under the GPL.
8 */
9
10 /*-------------------------------------------------------------------------*/
11
12 /*
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
19 *
20 * There's also "register" data, which is memory mapped.
21 * No memory seen by this driver (or any HCD) may be paged out.
22 */
23
24 /*-------------------------------------------------------------------------*/
25
26 static void admhc_hcd_init(struct admhcd *ahcd)
27 {
28 ahcd->next_statechange = jiffies;
29 spin_lock_init(&ahcd->lock);
30 spin_lock_init(&ahcd->dma_lock);
31 }
32
33 /*-------------------------------------------------------------------------*/
34
35 static int admhc_mem_init(struct admhcd *ahcd)
36 {
37 ahcd->td_cache = dma_pool_create("admhc_td",
38 admhcd_to_hcd(ahcd)->self.controller,
39 sizeof(struct td),
40 TD_ALIGN, /* byte alignment */
41 0 /* no page-crossing issues */
42 );
43 if (!ahcd->td_cache)
44 goto err;
45
46 ahcd->ed_cache = dma_pool_create("admhc_ed",
47 admhcd_to_hcd(ahcd)->self.controller,
48 sizeof(struct ed),
49 ED_ALIGN, /* byte alignment */
50 0 /* no page-crossing issues */
51 );
52 if (!ahcd->ed_cache)
53 goto err_td_cache;
54
55 return 0;
56
57 err_td_cache:
58 dma_pool_destroy(ahcd->td_cache);
59 ahcd->td_cache = NULL;
60 err:
61 return -ENOMEM;
62 }
63
64 static void admhc_mem_cleanup(struct admhcd *ahcd)
65 {
66 if (ahcd->td_cache) {
67 dma_pool_destroy(ahcd->td_cache);
68 ahcd->td_cache = NULL;
69 }
70
71 if (ahcd->ed_cache) {
72 dma_pool_destroy(ahcd->ed_cache);
73 ahcd->ed_cache = NULL;
74 }
75 }
76
77 /*-------------------------------------------------------------------------*/
78
79 /* TDs ... */
80 static struct td *td_alloc(struct admhcd *ahcd, gfp_t mem_flags)
81 {
82 dma_addr_t dma;
83 struct td *td;
84
85 td = dma_pool_alloc(ahcd->td_cache, mem_flags, &dma);
86 if (!td)
87 return NULL;
88
89 /* in case ahcd fetches it, make it look dead */
90 memset(td, 0, sizeof *td);
91 td->td_dma = dma;
92
93 return td;
94 }
95
96 static void td_free(struct admhcd *ahcd, struct td *td)
97 {
98 dma_pool_free(ahcd->td_cache, td, td->td_dma);
99 }
100
101 /*-------------------------------------------------------------------------*/
102
103 /* EDs ... */
104 static struct ed *ed_alloc(struct admhcd *ahcd, gfp_t mem_flags)
105 {
106 dma_addr_t dma;
107 struct ed *ed;
108
109 ed = dma_pool_alloc(ahcd->ed_cache, mem_flags, &dma);
110 if (!ed)
111 return NULL;
112
113 memset(ed, 0, sizeof(*ed));
114 ed->dma = dma;
115
116 INIT_LIST_HEAD(&ed->urb_pending);
117
118 return ed;
119 }
120
121 static void ed_free(struct admhcd *ahcd, struct ed *ed)
122 {
123 dma_pool_free(ahcd->ed_cache, ed, ed->dma);
124 }
125
126 /*-------------------------------------------------------------------------*/
127
128 /* URB priv ... */
129 static void urb_priv_free(struct admhcd *ahcd, struct urb_priv *urb_priv)
130 {
131 int i;
132
133 for (i = 0; i < urb_priv->td_cnt; i++)
134 if (urb_priv->td[i])
135 td_free(ahcd, urb_priv->td[i]);
136
137 kfree(urb_priv);
138 }
139
140 static struct urb_priv *urb_priv_alloc(struct admhcd *ahcd, int num_tds,
141 gfp_t mem_flags)
142 {
143 struct urb_priv *priv;
144 int i;
145
146 /* allocate the private part of the URB */
147 priv = kzalloc(sizeof(*priv) + sizeof(struct td) * num_tds, mem_flags);
148 if (!priv)
149 goto err;
150
151 /* allocate the TDs (deferring hash chain updates) */
152 for (i = 0; i < num_tds; i++) {
153 priv->td[i] = td_alloc(ahcd, mem_flags);
154 if (priv->td[i] == NULL)
155 goto err_free;
156 priv->td[i]->index = i;
157 }
158
159 INIT_LIST_HEAD(&priv->pending);
160 priv->td_cnt = num_tds;
161
162 return priv;
163
164 err_free:
165 urb_priv_free(ahcd, priv);
166 err:
167 return NULL;
168 }