Commit | Line | Data |
---|---|---|
1291e49e ZQ |
1 | /* |
2 | * Common CPM code | |
3 | * | |
4 | * Author: Scott Wood <scottwood@freescale.com> | |
5 | * | |
6 | * Copyright 2007-2008,2010 Freescale Semiconductor, Inc. | |
7 | * | |
8 | * Some parts derived from commproc.c/cpm2_common.c, which is: | |
9 | * Copyright (c) 1997 Dan error_act (dmalek@jlc.net) | |
10 | * Copyright (c) 1999-2001 Dan Malek <dan@embeddedalley.com> | |
11 | * Copyright (c) 2000 MontaVista Software, Inc (source@mvista.com) | |
12 | * 2006 (c) MontaVista Software, Inc. | |
13 | * Vitaly Bordug <vbordug@ru.mvista.com> | |
14 | * | |
15 | * This program is free software; you can redistribute it and/or modify | |
16 | * it under the terms of version 2 of the GNU General Public License as | |
17 | * published by the Free Software Foundation. | |
18 | */ | |
19 | #include <linux/genalloc.h> | |
20 | #include <linux/init.h> | |
21 | #include <linux/list.h> | |
22 | #include <linux/of_device.h> | |
23 | #include <linux/spinlock.h> | |
24 | #include <linux/export.h> | |
25 | #include <linux/of.h> | |
26 | #include <linux/of_address.h> | |
27 | #include <linux/slab.h> | |
28 | #include <linux/io.h> | |
29 | #include <asm/qe.h> | |
30 | ||
31 | static struct gen_pool *muram_pool; | |
32 | static spinlock_t cpm_muram_lock; | |
33 | static u8 __iomem *muram_vbase; | |
34 | static phys_addr_t muram_pbase; | |
35 | ||
36 | struct muram_block { | |
37 | struct list_head head; | |
38 | unsigned long start; | |
39 | int size; | |
40 | }; | |
41 | ||
42 | static LIST_HEAD(muram_block_list); | |
43 | ||
44 | /* max address size we deal with */ | |
45 | #define OF_MAX_ADDR_CELLS 4 | |
46 | #define GENPOOL_OFFSET (4096 * 8) | |
47 | ||
48 | int cpm_muram_init(void) | |
49 | { | |
50 | struct device_node *np; | |
51 | struct resource r; | |
52 | u32 zero[OF_MAX_ADDR_CELLS] = {}; | |
53 | resource_size_t max = 0; | |
54 | int i = 0; | |
55 | int ret = 0; | |
56 | ||
57 | if (muram_pbase) | |
58 | return 0; | |
59 | ||
60 | spin_lock_init(&cpm_muram_lock); | |
61 | np = of_find_compatible_node(NULL, NULL, "fsl,cpm-muram-data"); | |
62 | if (!np) { | |
63 | /* try legacy bindings */ | |
64 | np = of_find_node_by_name(NULL, "data-only"); | |
65 | if (!np) { | |
66 | pr_err("Cannot find CPM muram data node"); | |
67 | ret = -ENODEV; | |
68 | goto out_muram; | |
69 | } | |
70 | } | |
71 | ||
72 | muram_pool = gen_pool_create(0, -1); | |
73 | muram_pbase = of_translate_address(np, zero); | |
74 | if (muram_pbase == (phys_addr_t)OF_BAD_ADDR) { | |
75 | pr_err("Cannot translate zero through CPM muram node"); | |
76 | ret = -ENODEV; | |
77 | goto out_pool; | |
78 | } | |
79 | ||
80 | while (of_address_to_resource(np, i++, &r) == 0) { | |
81 | if (r.end > max) | |
82 | max = r.end; | |
83 | ret = gen_pool_add(muram_pool, r.start - muram_pbase + | |
84 | GENPOOL_OFFSET, resource_size(&r), -1); | |
85 | if (ret) { | |
86 | pr_err("QE: couldn't add muram to pool!\n"); | |
87 | goto out_pool; | |
88 | } | |
89 | } | |
90 | ||
91 | muram_vbase = ioremap(muram_pbase, max - muram_pbase + 1); | |
92 | if (!muram_vbase) { | |
93 | pr_err("Cannot map QE muram"); | |
94 | ret = -ENOMEM; | |
95 | goto out_pool; | |
96 | } | |
97 | goto out_muram; | |
98 | out_pool: | |
99 | gen_pool_destroy(muram_pool); | |
100 | out_muram: | |
101 | of_node_put(np); | |
102 | return ret; | |
103 | } | |
104 | ||
105 | /* | |
106 | * cpm_muram_alloc - allocate the requested size worth of multi-user ram | |
107 | * @size: number of bytes to allocate | |
108 | * @align: requested alignment, in bytes | |
109 | * | |
110 | * This function returns an offset into the muram area. | |
111 | * Use cpm_dpram_addr() to get the virtual address of the area. | |
112 | * Use cpm_muram_free() to free the allocation. | |
113 | */ | |
114 | unsigned long cpm_muram_alloc(unsigned long size, unsigned long align) | |
115 | { | |
116 | unsigned long start; | |
117 | unsigned long flags; | |
118 | struct genpool_data_align muram_pool_data; | |
119 | ||
120 | spin_lock_irqsave(&cpm_muram_lock, flags); | |
121 | muram_pool_data.align = align; | |
122 | start = cpm_muram_alloc_common(size, gen_pool_first_fit_align, | |
123 | &muram_pool_data); | |
124 | spin_unlock_irqrestore(&cpm_muram_lock, flags); | |
125 | return start; | |
126 | } | |
127 | EXPORT_SYMBOL(cpm_muram_alloc); | |
128 | ||
129 | /** | |
130 | * cpm_muram_free - free a chunk of multi-user ram | |
131 | * @offset: The beginning of the chunk as returned by cpm_muram_alloc(). | |
132 | */ | |
133 | int cpm_muram_free(unsigned long offset) | |
134 | { | |
135 | unsigned long flags; | |
136 | int size; | |
137 | struct muram_block *tmp; | |
138 | ||
139 | size = 0; | |
140 | spin_lock_irqsave(&cpm_muram_lock, flags); | |
141 | list_for_each_entry(tmp, &muram_block_list, head) { | |
142 | if (tmp->start == offset) { | |
143 | size = tmp->size; | |
144 | list_del(&tmp->head); | |
145 | kfree(tmp); | |
146 | break; | |
147 | } | |
148 | } | |
149 | gen_pool_free(muram_pool, offset + GENPOOL_OFFSET, size); | |
150 | spin_unlock_irqrestore(&cpm_muram_lock, flags); | |
151 | return size; | |
152 | } | |
153 | EXPORT_SYMBOL(cpm_muram_free); | |
154 | ||
155 | /* | |
156 | * cpm_muram_alloc_fixed - reserve a specific region of multi-user ram | |
157 | * @offset: offset of allocation start address | |
158 | * @size: number of bytes to allocate | |
159 | * This function returns an offset into the muram area | |
160 | * Use cpm_dpram_addr() to get the virtual address of the area. | |
161 | * Use cpm_muram_free() to free the allocation. | |
162 | */ | |
163 | unsigned long cpm_muram_alloc_fixed(unsigned long offset, unsigned long size) | |
164 | { | |
165 | unsigned long start; | |
166 | unsigned long flags; | |
167 | struct genpool_data_fixed muram_pool_data_fixed; | |
168 | ||
169 | spin_lock_irqsave(&cpm_muram_lock, flags); | |
170 | muram_pool_data_fixed.offset = offset + GENPOOL_OFFSET; | |
171 | start = cpm_muram_alloc_common(size, gen_pool_fixed_alloc, | |
172 | &muram_pool_data_fixed); | |
173 | spin_unlock_irqrestore(&cpm_muram_lock, flags); | |
174 | return start; | |
175 | } | |
176 | EXPORT_SYMBOL(cpm_muram_alloc_fixed); | |
177 | ||
178 | /* | |
179 | * cpm_muram_alloc_common - cpm_muram_alloc common code | |
180 | * @size: number of bytes to allocate | |
181 | * @algo: algorithm for alloc. | |
182 | * @data: data for genalloc's algorithm. | |
183 | * | |
184 | * This function returns an offset into the muram area. | |
185 | */ | |
186 | unsigned long cpm_muram_alloc_common(unsigned long size, genpool_algo_t algo, | |
187 | void *data) | |
188 | { | |
189 | struct muram_block *entry; | |
190 | unsigned long start; | |
191 | ||
192 | start = gen_pool_alloc_algo(muram_pool, size, algo, data); | |
193 | if (!start) | |
194 | goto out2; | |
195 | start = start - GENPOOL_OFFSET; | |
196 | memset_io(cpm_muram_addr(start), 0, size); | |
197 | entry = kmalloc(sizeof(*entry), GFP_KERNEL); | |
198 | if (!entry) | |
199 | goto out1; | |
200 | entry->start = start; | |
201 | entry->size = size; | |
202 | list_add(&entry->head, &muram_block_list); | |
203 | ||
204 | return start; | |
205 | out1: | |
206 | gen_pool_free(muram_pool, start, size); | |
207 | out2: | |
208 | return (unsigned long)-ENOMEM; | |
209 | } | |
210 | ||
211 | /** | |
212 | * cpm_muram_addr - turn a muram offset into a virtual address | |
213 | * @offset: muram offset to convert | |
214 | */ | |
215 | void __iomem *cpm_muram_addr(unsigned long offset) | |
216 | { | |
217 | return muram_vbase + offset; | |
218 | } | |
219 | EXPORT_SYMBOL(cpm_muram_addr); | |
220 | ||
221 | unsigned long cpm_muram_offset(void __iomem *addr) | |
222 | { | |
223 | return addr - (void __iomem *)muram_vbase; | |
224 | } | |
225 | EXPORT_SYMBOL(cpm_muram_offset); | |
226 | ||
227 | /** | |
228 | * cpm_muram_dma - turn a muram virtual address into a DMA address | |
229 | * @offset: virtual address from cpm_muram_addr() to convert | |
230 | */ | |
231 | dma_addr_t cpm_muram_dma(void __iomem *addr) | |
232 | { | |
233 | return muram_pbase + ((u8 __iomem *)addr - muram_vbase); | |
234 | } | |
235 | EXPORT_SYMBOL(cpm_muram_dma); |