1235537Sgber/*- 2235537Sgber * Copyright (c) 2010-2012 Semihalf. 3235537Sgber * All rights reserved. 4235537Sgber * 5235537Sgber * Redistribution and use in source and binary forms, with or without 6235537Sgber * modification, are permitted provided that the following conditions 7235537Sgber * are met: 8235537Sgber * 1. Redistributions of source code must retain the above copyright 9235537Sgber * notice, this list of conditions and the following disclaimer. 10235537Sgber * 2. Redistributions in binary form must reproduce the above copyright 11235537Sgber * notice, this list of conditions and the following disclaimer in the 12235537Sgber * documentation and/or other materials provided with the distribution. 13235537Sgber * 14235537Sgber * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 15235537Sgber * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 16235537Sgber * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 17235537Sgber * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 18235537Sgber * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19235537Sgber * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 20235537Sgber * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21235537Sgber * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22235537Sgber * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23235537Sgber * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24235537Sgber * SUCH DAMAGE. 25235537Sgber */ 26235537Sgber 27235537Sgber#include <sys/cdefs.h> 28235537Sgber__FBSDID("$FreeBSD: releng/11.0/usr.sbin/nandtool/nand_erase.c 235537 2012-05-17 10:11:18Z gber $"); 29235537Sgber 30235537Sgber#include <stdio.h> 31235537Sgber#include <stdlib.h> 32235537Sgber#include <unistd.h> 33235537Sgber#include <sys/types.h> 34235537Sgber#include <sys/disk.h> 35235537Sgber#include <libgeom.h> 36235537Sgber#include <dev/nand/nand_dev.h> 37235537Sgber#include "nandtool.h" 38235537Sgber 39235537Sgberint nand_erase(struct cmd_param *params) 40235537Sgber{ 41235537Sgber struct chip_param_io chip_params; 42235537Sgber char *dev; 43235537Sgber int fd = -1, ret = 0; 44235537Sgber off_t pos, count; 45235537Sgber off_t start, nblocks, i; 46235537Sgber int block_size, mult; 47235537Sgber 48235537Sgber if (!(dev = param_get_string(params, "dev"))) { 49235537Sgber fprintf(stderr, "Please supply valid 'dev' parameter.\n"); 50235537Sgber return (1); 51235537Sgber } 52235537Sgber 53235537Sgber if (param_has_value(params, "count")) 54235537Sgber count = param_get_intx(params, "count"); 55235537Sgber else 56235537Sgber count = 1; 57235537Sgber 58235537Sgber if ((fd = g_open(dev, 1)) < 0) { 59235537Sgber perrorf("Cannot open %s", dev); 60235537Sgber return (1); 61235537Sgber } 62235537Sgber 63235537Sgber if (ioctl(fd, NAND_IO_GET_CHIP_PARAM, &chip_params) == -1) { 64235537Sgber perrorf("Cannot ioctl(NAND_IO_GET_CHIP_PARAM)"); 65235537Sgber ret = 1; 66235537Sgber goto out; 67235537Sgber } 68235537Sgber 69235537Sgber block_size = chip_params.page_size * chip_params.pages_per_block; 70235537Sgber 71235537Sgber if (param_has_value(params, "page")) { 72235537Sgber pos = chip_params.page_size * param_get_intx(params, "page"); 73235537Sgber mult = chip_params.page_size; 74235537Sgber } else if (param_has_value(params, "block")) { 75235537Sgber pos = block_size * param_get_intx(params, "block"); 76235537Sgber mult = block_size; 77235537Sgber } else if (param_has_value(params, "pos")) { 78235537Sgber pos = param_get_intx(params, "pos"); 79235537Sgber mult = 1; 80235537Sgber } else { 81235537Sgber /* Erase whole chip */ 82235537Sgber if (ioctl(fd, DIOCGMEDIASIZE, &count) == -1) { 83235537Sgber ret = 1; 84235537Sgber goto out; 85235537Sgber } 86235537Sgber 87235537Sgber pos = 0; 88235537Sgber mult = 1; 89235537Sgber } 90235537Sgber 91235537Sgber if (pos % block_size) { 92235537Sgber fprintf(stderr, "Position must be block-size aligned!\n"); 93235537Sgber ret = 1; 94235537Sgber goto out; 95235537Sgber } 96235537Sgber 97235537Sgber count *= mult; 98235537Sgber start = pos / block_size; 99235537Sgber nblocks = count / block_size; 100235537Sgber 101235537Sgber for (i = 0; i < nblocks; i++) { 102235537Sgber if (g_delete(fd, (start + i) * block_size, block_size) == -1) { 103235537Sgber perrorf("Cannot erase block %d - probably a bad block", 104235537Sgber start + i); 105235537Sgber ret = 1; 106235537Sgber } 107235537Sgber } 108235537Sgber 109235537Sgberout: 110235537Sgber g_close(fd); 111235537Sgber 112235537Sgber return (ret); 113235537Sgber} 114235537Sgber 115