cfi_mtd.c 6.3 KB
Newer Older
P
Piotr Ziecik 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27
/*
 * (C) Copyright 2008 Semihalf
 *
 * Written by: Piotr Ziecik <kosmo@semihalf.com>
 *
 * See file CREDITS for list of people who contributed to this
 * project.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License as
 * published by the Free Software Foundation; either version 2 of
 * the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.	 See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston,
 * MA 02111-1307 USA
 *
 */

#include <common.h>
#include <flash.h>
28
#include <malloc.h>
P
Piotr Ziecik 已提交
29 30 31

#include <asm/errno.h>
#include <linux/mtd/mtd.h>
32
#include <linux/mtd/concat.h>
33
#include <mtd/cfi_flash.h>
P
Piotr Ziecik 已提交
34

35 36
static struct mtd_info cfi_mtd_info[CFI_MAX_FLASH_BANKS];
static char cfi_mtd_names[CFI_MAX_FLASH_BANKS][16];
37 38 39
#ifdef CONFIG_MTD_CONCAT
static char c_mtd_name[16];
#endif
P
Piotr Ziecik 已提交
40 41 42 43 44 45 46 47 48 49

static int cfi_mtd_erase(struct mtd_info *mtd, struct erase_info *instr)
{
	flash_info_t *fi = mtd->priv;
	size_t a_start = fi->start[0] + instr->addr;
	size_t a_end = a_start + instr->len;
	int s_first = -1;
	int s_last = -1;
	int error, sect;

50
	for (sect = 0; sect < fi->sector_count; sect++) {
P
Piotr Ziecik 已提交
51 52 53
		if (a_start == fi->start[sect])
			s_first = sect;

54 55 56 57 58 59
		if (sect < fi->sector_count - 1) {
			if (a_end == fi->start[sect + 1]) {
				s_last = sect;
				break;
			}
		} else {
P
Piotr Ziecik 已提交
60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124
			s_last = sect;
			break;
		}
	}

	if (s_first >= 0 && s_first <= s_last) {
		instr->state = MTD_ERASING;

		flash_set_verbose(0);
		error = flash_erase(fi, s_first, s_last);
		flash_set_verbose(1);

		if (error) {
			instr->state = MTD_ERASE_FAILED;
			return -EIO;
		}

		instr->state = MTD_ERASE_DONE;
		mtd_erase_callback(instr);
		return 0;
	}

	return -EINVAL;
}

static int cfi_mtd_read(struct mtd_info *mtd, loff_t from, size_t len,
	size_t *retlen, u_char *buf)
{
	flash_info_t *fi = mtd->priv;
	u_char *f = (u_char*)(fi->start[0]) + from;

	memcpy(buf, f, len);
	*retlen = len;

	return 0;
}

static int cfi_mtd_write(struct mtd_info *mtd, loff_t to, size_t len,
	size_t *retlen, const u_char *buf)
{
	flash_info_t *fi = mtd->priv;
	u_long t = fi->start[0] + to;
	int error;

	flash_set_verbose(0);
	error = write_buff(fi, (u_char*)buf, t, len);
	flash_set_verbose(1);

	if (!error) {
		*retlen = len;
		return 0;
	}

	return -EIO;
}

static void cfi_mtd_sync(struct mtd_info *mtd)
{
	/*
	 * This function should wait until all pending operations
	 * finish. However this driver is fully synchronous, so
	 * this function returns immediately
	 */
}

125
static int cfi_mtd_lock(struct mtd_info *mtd, loff_t ofs, uint64_t len)
P
Piotr Ziecik 已提交
126 127 128 129 130 131 132 133 134 135 136
{
	flash_info_t *fi = mtd->priv;

	flash_set_verbose(0);
	flash_protect(FLAG_PROTECT_SET, fi->start[0] + ofs,
					fi->start[0] + ofs + len - 1, fi);
	flash_set_verbose(1);

	return 0;
}

137
static int cfi_mtd_unlock(struct mtd_info *mtd, loff_t ofs, uint64_t len)
P
Piotr Ziecik 已提交
138 139 140 141 142 143 144 145 146 147 148 149 150 151
{
	flash_info_t *fi = mtd->priv;

	flash_set_verbose(0);
	flash_protect(FLAG_PROTECT_CLEAR, fi->start[0] + ofs,
					fi->start[0] + ofs + len - 1, fi);
	flash_set_verbose(1);

	return 0;
}

static int cfi_mtd_set_erasesize(struct mtd_info *mtd, flash_info_t *fi)
{
	int sect_size = 0;
152
	int sect_size_old = 0;
P
Piotr Ziecik 已提交
153
	int sect;
154 155
	int regions = 0;
	int numblocks = 0;
L
Ladislav Michl 已提交
156 157
	ulong offset;
	ulong base_addr;
P
Piotr Ziecik 已提交
158

159
	/*
160 161
	 * First detect the number of eraseregions so that we can allocate
	 * the array of eraseregions correctly
162
	 */
P
Piotr Ziecik 已提交
163
	for (sect = 0; sect < fi->sector_count; sect++) {
164 165 166 167 168
		if (sect_size_old != flash_sector_size(fi, sect))
			regions++;
		sect_size_old = flash_sector_size(fi, sect);
	}

L
Ladislav Michl 已提交
169 170 171 172 173 174 175 176 177 178
	switch (regions) {
	case 0:
		return 1;
	case 1:	/* flash has uniform erase size */
		mtd->numeraseregions = 0;
		mtd->erasesize = sect_size_old;
		return 0;
	}

	mtd->numeraseregions = regions;
179 180 181 182 183 184
	mtd->eraseregions = malloc(sizeof(struct mtd_erase_region_info) * regions);

	/*
	 * Now detect the largest sector and fill the eraseregions
	 */
	regions = 0;
L
Ladislav Michl 已提交
185 186
	base_addr = offset = fi->start[0];
	sect_size_old = flash_sector_size(fi, 0);
187
	for (sect = 0; sect < fi->sector_count; sect++) {
L
Ladislav Michl 已提交
188
		if (sect_size_old != flash_sector_size(fi, sect)) {
189 190 191 192 193 194 195
			mtd->eraseregions[regions].offset = offset - base_addr;
			mtd->eraseregions[regions].erasesize = sect_size_old;
			mtd->eraseregions[regions].numblocks = numblocks;
			/* Now start counting the next eraseregions */
			numblocks = 0;
			regions++;
			offset = fi->start[sect];
L
Ladislav Michl 已提交
196 197
		}
		numblocks++;
198 199 200 201

		/*
		 * Select the largest sector size as erasesize (e.g. for UBI)
		 */
202
		if (flash_sector_size(fi, sect) > sect_size)
P
Piotr Ziecik 已提交
203
			sect_size = flash_sector_size(fi, sect);
204 205

		sect_size_old = flash_sector_size(fi, sect);
P
Piotr Ziecik 已提交
206 207
	}

208 209 210 211 212
	/*
	 * Set the last region
	 */
	mtd->eraseregions[regions].offset = offset - base_addr;
	mtd->eraseregions[regions].erasesize = sect_size_old;
L
Ladislav Michl 已提交
213
	mtd->eraseregions[regions].numblocks = numblocks;
214

P
Piotr Ziecik 已提交
215 216 217 218 219 220 221 222 223 224
	mtd->erasesize = sect_size;

	return 0;
}

int cfi_mtd_init(void)
{
	struct mtd_info *mtd;
	flash_info_t *fi;
	int error, i;
225
#ifdef CONFIG_MTD_CONCAT
226 227
	int devices_found = 0;
	struct mtd_info *mtd_list[CONFIG_SYS_MAX_FLASH_BANKS];
228
#endif
P
Piotr Ziecik 已提交
229 230 231 232 233 234 235 236 237 238 239

	for (i = 0; i < CONFIG_SYS_MAX_FLASH_BANKS; i++) {
		fi = &flash_info[i];
		mtd = &cfi_mtd_info[i];

		memset(mtd, 0, sizeof(struct mtd_info));

		error = cfi_mtd_set_erasesize(mtd, fi);
		if (error)
			continue;

240 241
		sprintf(cfi_mtd_names[i], "nor%d", i);
		mtd->name		= cfi_mtd_names[i];
P
Piotr Ziecik 已提交
242 243 244 245 246
		mtd->type		= MTD_NORFLASH;
		mtd->flags		= MTD_CAP_NORFLASH;
		mtd->size		= fi->size;
		mtd->writesize		= 1;

S
Sergey Lapin 已提交
247 248 249 250 251 252
		mtd->_erase		= cfi_mtd_erase;
		mtd->_read		= cfi_mtd_read;
		mtd->_write		= cfi_mtd_write;
		mtd->_sync		= cfi_mtd_sync;
		mtd->_lock		= cfi_mtd_lock;
		mtd->_unlock		= cfi_mtd_unlock;
P
Piotr Ziecik 已提交
253 254 255 256
		mtd->priv		= fi;

		if (add_mtd_device(mtd))
			return -ENOMEM;
257

258
#ifdef CONFIG_MTD_CONCAT
259
		mtd_list[devices_found++] = mtd;
260
#endif
261 262 263 264 265 266 267 268 269 270 271 272 273 274 275
	}

#ifdef CONFIG_MTD_CONCAT
	if (devices_found > 1) {
		/*
		 * We detected multiple devices. Concatenate them together.
		 */
		sprintf(c_mtd_name, "nor%d", devices_found);
		mtd = mtd_concat_create(mtd_list, devices_found, c_mtd_name);

		if (mtd == NULL)
			return -ENXIO;

		if (add_mtd_device(mtd))
			return -ENOMEM;
P
Piotr Ziecik 已提交
276
	}
277
#endif /* CONFIG_MTD_CONCAT */
P
Piotr Ziecik 已提交
278 279 280

	return 0;
}