blob: a872157a07001edc8d115b43db0c6c82c722303c [file] [log] [blame]
David Woodhousea1452a32010-08-08 20:58:20 +01001/*
2 * Copyright © 2000-2010 David Woodhouse <dwmw2@infradead.org> et al.
3 *
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation; either version 2 of the License, or
7 * (at your option) any later version.
8 *
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
13 *
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the Free Software
16 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
17 *
18 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070019
20/* Overhauled routines for dealing with different mmap regions of flash */
Linus Torvalds1da177e2005-04-16 15:20:36 -070021
22#ifndef __LINUX_MTD_MAP_H__
23#define __LINUX_MTD_MAP_H__
24
Linus Torvalds1da177e2005-04-16 15:20:36 -070025#include <linux/types.h>
26#include <linux/list.h>
Tim Schmielau4e57b682005-10-30 15:03:48 -080027#include <linux/string.h>
Kevin Cernekee709c4efb2010-05-04 12:51:34 -070028#include <linux/bug.h>
Artem Bityutskiy4a422432011-12-30 18:28:01 +020029#include <linux/kernel.h>
Tim Schmielau4e57b682005-10-30 15:03:48 -080030
Linus Torvalds1da177e2005-04-16 15:20:36 -070031#include <asm/unaligned.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070032#include <asm/io.h>
David Howells96f951e2012-03-28 18:30:03 +010033#include <asm/barrier.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070034
35#ifdef CONFIG_MTD_MAP_BANK_WIDTH_1
36#define map_bankwidth(map) 1
37#define map_bankwidth_is_1(map) (map_bankwidth(map) == 1)
38#define map_bankwidth_is_large(map) (0)
39#define map_words(map) (1)
40#define MAX_MAP_BANKWIDTH 1
41#else
42#define map_bankwidth_is_1(map) (0)
43#endif
44
45#ifdef CONFIG_MTD_MAP_BANK_WIDTH_2
46# ifdef map_bankwidth
47# undef map_bankwidth
48# define map_bankwidth(map) ((map)->bankwidth)
49# else
50# define map_bankwidth(map) 2
51# define map_bankwidth_is_large(map) (0)
52# define map_words(map) (1)
53# endif
54#define map_bankwidth_is_2(map) (map_bankwidth(map) == 2)
55#undef MAX_MAP_BANKWIDTH
56#define MAX_MAP_BANKWIDTH 2
57#else
58#define map_bankwidth_is_2(map) (0)
59#endif
60
61#ifdef CONFIG_MTD_MAP_BANK_WIDTH_4
62# ifdef map_bankwidth
63# undef map_bankwidth
64# define map_bankwidth(map) ((map)->bankwidth)
65# else
66# define map_bankwidth(map) 4
67# define map_bankwidth_is_large(map) (0)
68# define map_words(map) (1)
69# endif
70#define map_bankwidth_is_4(map) (map_bankwidth(map) == 4)
71#undef MAX_MAP_BANKWIDTH
72#define MAX_MAP_BANKWIDTH 4
73#else
74#define map_bankwidth_is_4(map) (0)
75#endif
76
77/* ensure we never evaluate anything shorted than an unsigned long
78 * to zero, and ensure we'll never miss the end of an comparison (bjd) */
79
80#define map_calc_words(map) ((map_bankwidth(map) + (sizeof(unsigned long)-1))/ sizeof(unsigned long))
81
82#ifdef CONFIG_MTD_MAP_BANK_WIDTH_8
83# ifdef map_bankwidth
84# undef map_bankwidth
85# define map_bankwidth(map) ((map)->bankwidth)
86# if BITS_PER_LONG < 64
87# undef map_bankwidth_is_large
88# define map_bankwidth_is_large(map) (map_bankwidth(map) > BITS_PER_LONG/8)
89# undef map_words
90# define map_words(map) map_calc_words(map)
91# endif
92# else
93# define map_bankwidth(map) 8
94# define map_bankwidth_is_large(map) (BITS_PER_LONG < 64)
95# define map_words(map) map_calc_words(map)
96# endif
97#define map_bankwidth_is_8(map) (map_bankwidth(map) == 8)
98#undef MAX_MAP_BANKWIDTH
99#define MAX_MAP_BANKWIDTH 8
100#else
101#define map_bankwidth_is_8(map) (0)
102#endif
103
104#ifdef CONFIG_MTD_MAP_BANK_WIDTH_16
105# ifdef map_bankwidth
106# undef map_bankwidth
107# define map_bankwidth(map) ((map)->bankwidth)
108# undef map_bankwidth_is_large
109# define map_bankwidth_is_large(map) (map_bankwidth(map) > BITS_PER_LONG/8)
110# undef map_words
111# define map_words(map) map_calc_words(map)
112# else
113# define map_bankwidth(map) 16
114# define map_bankwidth_is_large(map) (1)
115# define map_words(map) map_calc_words(map)
116# endif
117#define map_bankwidth_is_16(map) (map_bankwidth(map) == 16)
118#undef MAX_MAP_BANKWIDTH
119#define MAX_MAP_BANKWIDTH 16
120#else
121#define map_bankwidth_is_16(map) (0)
122#endif
123
124#ifdef CONFIG_MTD_MAP_BANK_WIDTH_32
125# ifdef map_bankwidth
126# undef map_bankwidth
127# define map_bankwidth(map) ((map)->bankwidth)
128# undef map_bankwidth_is_large
129# define map_bankwidth_is_large(map) (map_bankwidth(map) > BITS_PER_LONG/8)
130# undef map_words
131# define map_words(map) map_calc_words(map)
132# else
133# define map_bankwidth(map) 32
134# define map_bankwidth_is_large(map) (1)
135# define map_words(map) map_calc_words(map)
136# endif
137#define map_bankwidth_is_32(map) (map_bankwidth(map) == 32)
138#undef MAX_MAP_BANKWIDTH
139#define MAX_MAP_BANKWIDTH 32
140#else
141#define map_bankwidth_is_32(map) (0)
142#endif
143
144#ifndef map_bankwidth
David Woodhouse241651d2007-09-06 09:40:21 +0100145#warning "No CONFIG_MTD_MAP_BANK_WIDTH_xx selected. No NOR chip support can work"
146static inline int map_bankwidth(void *map)
147{
148 BUG();
149 return 0;
150}
151#define map_bankwidth_is_large(map) (0)
152#define map_words(map) (0)
153#define MAX_MAP_BANKWIDTH 1
Linus Torvalds1da177e2005-04-16 15:20:36 -0700154#endif
155
156static inline int map_bankwidth_supported(int w)
157{
158 switch (w) {
159#ifdef CONFIG_MTD_MAP_BANK_WIDTH_1
160 case 1:
161#endif
162#ifdef CONFIG_MTD_MAP_BANK_WIDTH_2
163 case 2:
164#endif
165#ifdef CONFIG_MTD_MAP_BANK_WIDTH_4
166 case 4:
167#endif
168#ifdef CONFIG_MTD_MAP_BANK_WIDTH_8
169 case 8:
170#endif
171#ifdef CONFIG_MTD_MAP_BANK_WIDTH_16
172 case 16:
173#endif
174#ifdef CONFIG_MTD_MAP_BANK_WIDTH_32
175 case 32:
176#endif
177 return 1;
178
179 default:
180 return 0;
181 }
182}
183
184#define MAX_MAP_LONGS ( ((MAX_MAP_BANKWIDTH*8) + BITS_PER_LONG - 1) / BITS_PER_LONG )
185
186typedef union {
187 unsigned long x[MAX_MAP_LONGS];
188} map_word;
189
190/* The map stuff is very simple. You fill in your struct map_info with
191 a handful of routines for accessing the device, making sure they handle
192 paging etc. correctly if your device needs it. Then you pass it off
193 to a chip probe routine -- either JEDEC or CFI probe or both -- via
194 do_map_probe(). If a chip is recognised, the probe code will invoke the
195 appropriate chip driver (if present) and return a struct mtd_info.
Thomas Gleixner61ecfa82005-11-07 11:15:31 +0000196 At which point, you fill in the mtd->module with your own module
Linus Torvalds1da177e2005-04-16 15:20:36 -0700197 address, and register it with the MTD core code. Or you could partition
198 it and register the partitions instead, or keep it for your own private
199 use; whatever.
Thomas Gleixner61ecfa82005-11-07 11:15:31 +0000200
Linus Torvalds1da177e2005-04-16 15:20:36 -0700201 The mtd->priv field will point to the struct map_info, and any further
Thomas Gleixner61ecfa82005-11-07 11:15:31 +0000202 private data required by the chip driver is linked from the
203 mtd->priv->fldrv_priv field. This allows the map driver to get at
Linus Torvalds1da177e2005-04-16 15:20:36 -0700204 the destructor function map->fldrv_destroy() when it's tired
205 of living.
206*/
207
208struct map_info {
Greg Kroah-Hartmaneadcf0d2008-07-02 12:46:22 -0700209 const char *name;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700210 unsigned long size;
Stefan Roese0d36da32007-01-19 08:40:04 +0100211 resource_size_t phys;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700212#define NO_XIP (-1UL)
213
214 void __iomem *virt;
215 void *cached;
216
Aaron Sierra8e987462011-11-14 18:44:34 -0600217 int swap; /* this mapping's byte-swapping requirement */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700218 int bankwidth; /* in octets. This isn't necessarily the width
219 of actual bus cycles -- it's the repeat interval
220 in bytes, before you are talking to the first chip again.
221 */
222
223#ifdef CONFIG_MTD_COMPLEX_MAPPINGS
224 map_word (*read)(struct map_info *, unsigned long);
225 void (*copy_from)(struct map_info *, void *, unsigned long, ssize_t);
226
227 void (*write)(struct map_info *, const map_word, unsigned long);
228 void (*copy_to)(struct map_info *, unsigned long, const void *, ssize_t);
229
230 /* We can perhaps put in 'point' and 'unpoint' methods, if we really
231 want to enable XIP for non-linear mappings. Not yet though. */
232#endif
233 /* It's possible for the map driver to use cached memory in its
234 copy_from implementation (and _only_ with copy_from). However,
235 when the chip driver knows some flash area has changed contents,
236 it will signal it to the map driver through this routine to let
237 the map driver invalidate the corresponding cache as needed.
238 If there is no cache to care about this can be set to NULL. */
239 void (*inval_cache)(struct map_info *, unsigned long, ssize_t);
240
Thomas Gleixner61ecfa82005-11-07 11:15:31 +0000241 /* set_vpp() must handle being reentered -- enable, enable, disable
Linus Torvalds1da177e2005-04-16 15:20:36 -0700242 must leave it enabled. */
243 void (*set_vpp)(struct map_info *, int);
244
Alexey Korolevd13e51e2008-12-16 18:21:10 +0000245 unsigned long pfow_base;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700246 unsigned long map_priv_1;
247 unsigned long map_priv_2;
Stefan Roese1648eaa2013-01-18 13:10:05 +0100248 struct device_node *device_node;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700249 void *fldrv_priv;
250 struct mtd_chip_driver *fldrv;
251};
252
253struct mtd_chip_driver {
254 struct mtd_info *(*probe)(struct map_info *map);
255 void (*destroy)(struct mtd_info *);
256 struct module *module;
257 char *name;
258 struct list_head list;
259};
260
261void register_mtd_chip_driver(struct mtd_chip_driver *);
262void unregister_mtd_chip_driver(struct mtd_chip_driver *);
263
264struct mtd_info *do_map_probe(const char *name, struct map_info *map);
265void map_destroy(struct mtd_info *mtd);
266
267#define ENABLE_VPP(map) do { if(map->set_vpp) map->set_vpp(map, 1); } while(0)
268#define DISABLE_VPP(map) do { if(map->set_vpp) map->set_vpp(map, 0); } while(0)
269
270#define INVALIDATE_CACHED_RANGE(map, from, size) \
271 do { if(map->inval_cache) map->inval_cache(map, from, size); } while(0)
272
273
274static inline int map_word_equal(struct map_info *map, map_word val1, map_word val2)
275{
276 int i;
277 for (i=0; i<map_words(map); i++) {
278 if (val1.x[i] != val2.x[i])
279 return 0;
280 }
281 return 1;
282}
283
284static inline map_word map_word_and(struct map_info *map, map_word val1, map_word val2)
285{
286 map_word r;
287 int i;
288
289 for (i=0; i<map_words(map); i++) {
290 r.x[i] = val1.x[i] & val2.x[i];
291 }
292 return r;
293}
294
Nicolas Pitref77814d2005-02-08 17:11:19 +0000295static inline map_word map_word_clr(struct map_info *map, map_word val1, map_word val2)
296{
297 map_word r;
298 int i;
299
300 for (i=0; i<map_words(map); i++) {
301 r.x[i] = val1.x[i] & ~val2.x[i];
302 }
303 return r;
304}
305
Linus Torvalds1da177e2005-04-16 15:20:36 -0700306static inline map_word map_word_or(struct map_info *map, map_word val1, map_word val2)
307{
308 map_word r;
309 int i;
310
311 for (i=0; i<map_words(map); i++) {
312 r.x[i] = val1.x[i] | val2.x[i];
313 }
314 return r;
315}
Nicolas Pitref77814d2005-02-08 17:11:19 +0000316
Arnd Bergmannd09957f2015-03-10 17:48:37 +0100317static inline int map_word_andequal(struct map_info *map, map_word val1, map_word val2, map_word val3)
318{
319 int i;
320
321 for (i = 0; i < map_words(map); i++) {
322 if ((val1.x[i] & val2.x[i]) != val3.x[i])
323 return 0;
324 }
325
326 return 1;
327}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700328
329static inline int map_word_bitsset(struct map_info *map, map_word val1, map_word val2)
330{
331 int i;
332
333 for (i=0; i<map_words(map); i++) {
334 if (val1.x[i] & val2.x[i])
335 return 1;
336 }
337 return 0;
338}
339
340static inline map_word map_word_load(struct map_info *map, const void *ptr)
341{
Dmitry Eremin-Solenikov24dea0c2013-01-31 21:06:34 +0400342 map_word r;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700343
344 if (map_bankwidth_is_1(map))
345 r.x[0] = *(unsigned char *)ptr;
346 else if (map_bankwidth_is_2(map))
347 r.x[0] = get_unaligned((uint16_t *)ptr);
348 else if (map_bankwidth_is_4(map))
349 r.x[0] = get_unaligned((uint32_t *)ptr);
350#if BITS_PER_LONG >= 64
351 else if (map_bankwidth_is_8(map))
352 r.x[0] = get_unaligned((uint64_t *)ptr);
353#endif
354 else if (map_bankwidth_is_large(map))
355 memcpy(r.x, ptr, map->bankwidth);
Dmitry Eremin-Solenikov24dea0c2013-01-31 21:06:34 +0400356 else
357 BUG();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700358
359 return r;
360}
361
362static inline map_word map_word_load_partial(struct map_info *map, map_word orig, const unsigned char *buf, int start, int len)
363{
364 int i;
365
366 if (map_bankwidth_is_large(map)) {
367 char *dest = (char *)&orig;
368 memcpy(dest+start, buf, len);
369 } else {
370 for (i=start; i < start+len; i++) {
371 int bitpos;
372#ifdef __LITTLE_ENDIAN
373 bitpos = i*8;
374#else /* __BIG_ENDIAN */
375 bitpos = (map_bankwidth(map)-1-i)*8;
376#endif
377 orig.x[0] &= ~(0xff << bitpos);
Wang Haitaoa4d62ba2013-08-22 19:32:38 +0800378 orig.x[0] |= (unsigned long)buf[i-start] << bitpos;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700379 }
380 }
381 return orig;
382}
383
Thomas Gleixner3a3ab482005-05-24 20:50:18 +0200384#if BITS_PER_LONG < 64
385#define MAP_FF_LIMIT 4
386#else
387#define MAP_FF_LIMIT 8
388#endif
389
Linus Torvalds1da177e2005-04-16 15:20:36 -0700390static inline map_word map_word_ff(struct map_info *map)
391{
392 map_word r;
393 int i;
Thomas Gleixner61ecfa82005-11-07 11:15:31 +0000394
Thomas Gleixnerb0435692005-05-25 12:20:29 +0200395 if (map_bankwidth(map) < MAP_FF_LIMIT) {
Thomas Gleixnera8aff8a2005-05-25 12:32:37 +0200396 int bw = 8 * map_bankwidth(map);
Wang Haitaoa4d62ba2013-08-22 19:32:38 +0800397 r.x[0] = (1UL << bw) - 1;
Thomas Gleixner3a3ab482005-05-24 20:50:18 +0200398 } else {
399 for (i=0; i<map_words(map); i++)
400 r.x[i] = ~0UL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700401 }
402 return r;
403}
Nicolas Pitref77814d2005-02-08 17:11:19 +0000404
Linus Torvalds1da177e2005-04-16 15:20:36 -0700405static inline map_word inline_map_read(struct map_info *map, unsigned long ofs)
406{
Dmitry Eremin-Solenikov24dea0c2013-01-31 21:06:34 +0400407 map_word r;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700408
409 if (map_bankwidth_is_1(map))
410 r.x[0] = __raw_readb(map->virt + ofs);
411 else if (map_bankwidth_is_2(map))
412 r.x[0] = __raw_readw(map->virt + ofs);
413 else if (map_bankwidth_is_4(map))
414 r.x[0] = __raw_readl(map->virt + ofs);
415#if BITS_PER_LONG >= 64
416 else if (map_bankwidth_is_8(map))
417 r.x[0] = __raw_readq(map->virt + ofs);
418#endif
419 else if (map_bankwidth_is_large(map))
420 memcpy_fromio(r.x, map->virt+ofs, map->bankwidth);
Kevin Cernekee9ea59732010-04-10 11:18:58 -0700421 else
422 BUG();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700423
424 return r;
425}
426
427static inline void inline_map_write(struct map_info *map, const map_word datum, unsigned long ofs)
428{
429 if (map_bankwidth_is_1(map))
430 __raw_writeb(datum.x[0], map->virt + ofs);
431 else if (map_bankwidth_is_2(map))
432 __raw_writew(datum.x[0], map->virt + ofs);
433 else if (map_bankwidth_is_4(map))
434 __raw_writel(datum.x[0], map->virt + ofs);
435#if BITS_PER_LONG >= 64
436 else if (map_bankwidth_is_8(map))
437 __raw_writeq(datum.x[0], map->virt + ofs);
438#endif
439 else if (map_bankwidth_is_large(map))
440 memcpy_toio(map->virt+ofs, datum.x, map->bankwidth);
Dmitry Eremin-Solenikov24dea0c2013-01-31 21:06:34 +0400441 else
442 BUG();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700443 mb();
444}
445
446static inline void inline_map_copy_from(struct map_info *map, void *to, unsigned long from, ssize_t len)
447{
448 if (map->cached)
449 memcpy(to, (char *)map->cached + from, len);
450 else
451 memcpy_fromio(to, map->virt + from, len);
452}
453
454static inline void inline_map_copy_to(struct map_info *map, unsigned long to, const void *from, ssize_t len)
455{
456 memcpy_toio(map->virt + to, from, len);
457}
458
459#ifdef CONFIG_MTD_COMPLEX_MAPPINGS
460#define map_read(map, ofs) (map)->read(map, ofs)
461#define map_copy_from(map, to, from, len) (map)->copy_from(map, to, from, len)
462#define map_write(map, datum, ofs) (map)->write(map, datum, ofs)
463#define map_copy_to(map, to, from, len) (map)->copy_to(map, to, from, len)
464
465extern void simple_map_init(struct map_info *);
466#define map_is_linear(map) (map->phys != NO_XIP)
467
468#else
469#define map_read(map, ofs) inline_map_read(map, ofs)
470#define map_copy_from(map, to, from, len) inline_map_copy_from(map, to, from, len)
471#define map_write(map, datum, ofs) inline_map_write(map, datum, ofs)
472#define map_copy_to(map, to, from, len) inline_map_copy_to(map, to, from, len)
473
474
475#define simple_map_init(map) BUG_ON(!map_bankwidth_supported((map)->bankwidth))
Nicolas Pitref16407d2005-02-16 15:55:03 +0000476#define map_is_linear(map) ({ (void)(map); 1; })
Linus Torvalds1da177e2005-04-16 15:20:36 -0700477
478#endif /* !CONFIG_MTD_COMPLEX_MAPPINGS */
479
480#endif /* __LINUX_MTD_MAP_H__ */