flashrom.c 48.3 KB
Newer Older
Ronald G. Minnich's avatar
Dammit  
Ronald G. Minnich committed
1
/*
2
 * This file is part of the flashrom project.
Ronald G. Minnich's avatar
Dammit  
Ronald G. Minnich committed
3
 *
4 5
 * Copyright (C) 2000 Silicon Integrated System Corporation
 * Copyright (C) 2004 Tyan Corp <yhlu@tyan.com>
6
 * Copyright (C) 2005-2008 coresystems GmbH
7
 * Copyright (C) 2008,2009 Carl-Daniel Hailfinger
Ronald G. Minnich's avatar
Dammit  
Ronald G. Minnich committed
8
 *
9 10 11 12
 * 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.
Ronald G. Minnich's avatar
Dammit  
Ronald G. Minnich committed
13
 *
14 15 16 17
 * 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.
Ronald G. Minnich's avatar
Dammit  
Ronald G. Minnich committed
18
 *
19 20 21
 * 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
Ronald G. Minnich's avatar
Dammit  
Ronald G. Minnich committed
22 23
 */

24
#include <stdio.h>
25
#include <sys/types.h>
26 27
#ifndef __LIBPAYLOAD__
#include <fcntl.h>
28
#include <sys/stat.h>
29
#endif
Ronald G. Minnich's avatar
Ronald G. Minnich committed
30
#include <string.h>
Ronald G. Minnich's avatar
Ronald G. Minnich committed
31
#include <stdlib.h>
32
#include <ctype.h>
33
#include <getopt.h>
34 35 36
#if HAVE_UTSNAME == 1
#include <sys/utsname.h>
#endif
Ronald G. Minnich's avatar
Dammit  
Ronald G. Minnich committed
37
#include "flash.h"
38
#include "flashchips.h"
39
#include "programmer.h"
Ronald G. Minnich's avatar
Dammit  
Ronald G. Minnich committed
40

41
const char flashrom_version[] = FLASHROM_VERSION;
Ronald G. Minnich's avatar
Ronald G. Minnich committed
42
char *chip_to_probe = NULL;
Peter Stuge's avatar
Peter Stuge committed
43
int verbose = 0;
44

45
static enum programmer programmer = PROGRAMMER_INVALID;
46

47
static char *programmer_param = NULL;
48

49
/*
50 51 52
 * Programmers supporting multiple buses can have differing size limits on
 * each bus. Store the limits for each bus in a common struct.
 */
53 54 55 56
struct decode_sizes max_rom_decode;

/* If nonzero, used as the start address of bottom-aligned flash. */
unsigned long flashbase;
57

58 59 60
/* Is writing allowed with this programmer? */
int programmer_may_write;

61
const struct programmer_entry programmer_table[] = {
62
#if CONFIG_INTERNAL == 1
63
	{
64
		.name			= "internal",
65
		.init			= internal_init,
66 67
		.map_flash_region	= physmap,
		.unmap_flash_region	= physunmap,
68
		.delay			= internal_delay,
69
	},
70
#endif
71

72
#if CONFIG_DUMMY == 1
73
	{
74
		.name			= "dummy",
75
		.init			= dummy_init,
76 77
		.map_flash_region	= dummy_map,
		.unmap_flash_region	= dummy_unmap,
78
		.delay			= internal_delay,
79
	},
80
#endif
81

82
#if CONFIG_NIC3COM == 1
83
	{
84
		.name			= "nic3com",
85
		.init			= nic3com_init,
86 87
		.map_flash_region	= fallback_map,
		.unmap_flash_region	= fallback_unmap,
88
		.delay			= internal_delay,
89
	},
90
#endif
91

92
#if CONFIG_NICREALTEK == 1
93
	{
94
		/* This programmer works for Realtek RTL8139 and SMC 1211. */
95 96 97 98 99 100
		.name			= "nicrealtek",
		//.name			= "nicsmc1211",
		.init			= nicrealtek_init,
		.map_flash_region	= fallback_map,
		.unmap_flash_region	= fallback_unmap,
		.delay			= internal_delay,
101 102 103
	},
#endif

104 105
#if CONFIG_NICNATSEMI == 1
	{
106 107 108 109 110
		.name			= "nicnatsemi",
		.init			= nicnatsemi_init,
		.map_flash_region	= fallback_map,
		.unmap_flash_region	= fallback_unmap,
		.delay			= internal_delay,
111 112
	},
#endif
113

114
#if CONFIG_GFXNVIDIA == 1
115 116 117 118 119 120 121 122 123
	{
		.name			= "gfxnvidia",
		.init			= gfxnvidia_init,
		.map_flash_region	= fallback_map,
		.unmap_flash_region	= fallback_unmap,
		.delay			= internal_delay,
	},
#endif

124
#if CONFIG_DRKAISER == 1
125 126 127 128 129 130 131
	{
		.name			= "drkaiser",
		.init			= drkaiser_init,
		.map_flash_region	= fallback_map,
		.unmap_flash_region	= fallback_unmap,
		.delay			= internal_delay,
	},
132
#endif
133

134
#if CONFIG_SATASII == 1
135
	{
136
		.name			= "satasii",
137
		.init			= satasii_init,
138 139
		.map_flash_region	= fallback_map,
		.unmap_flash_region	= fallback_unmap,
140
		.delay			= internal_delay,
141
	},
142
#endif
143

144
#if CONFIG_ATAHPT == 1
145 146 147 148 149 150 151 152 153
	{
		.name			= "atahpt",
		.init			= atahpt_init,
		.map_flash_region	= fallback_map,
		.unmap_flash_region	= fallback_unmap,
		.delay			= internal_delay,
	},
#endif

154
#if CONFIG_FT2232_SPI == 1
155
	{
156
		.name			= "ft2232_spi",
157
		.init			= ft2232_spi_init,
158 159
		.map_flash_region	= fallback_map,
		.unmap_flash_region	= fallback_unmap,
160 161
		.delay			= internal_delay,
	},
162
#endif
163

164
#if CONFIG_SERPROG == 1
165
	{
166
		.name			= "serprog",
167 168 169 170 171
		.init			= serprog_init,
		.map_flash_region	= fallback_map,
		.unmap_flash_region	= fallback_unmap,
		.delay			= serprog_delay,
	},
172
#endif
173

174
#if CONFIG_BUSPIRATE_SPI == 1
175
	{
176
		.name			= "buspirate_spi",
177 178 179 180 181 182 183
		.init			= buspirate_spi_init,
		.map_flash_region	= fallback_map,
		.unmap_flash_region	= fallback_unmap,
		.delay			= internal_delay,
	},
#endif

184
#if CONFIG_DEDIPROG == 1
185 186 187 188 189 190 191 192 193
	{
		.name			= "dediprog",
		.init			= dediprog_init,
		.map_flash_region	= fallback_map,
		.unmap_flash_region	= fallback_unmap,
		.delay			= internal_delay,
	},
#endif

194 195 196 197 198 199 200 201 202 203
#if CONFIG_RAYER_SPI == 1
	{
		.name			= "rayer_spi",
		.init			= rayer_spi_init,
		.map_flash_region	= fallback_map,
		.unmap_flash_region	= fallback_unmap,
		.delay			= internal_delay,
	},
#endif

204 205 206 207 208 209 210 211 212 213
#if CONFIG_NICINTEL == 1
	{
		.name			= "nicintel",
		.init			= nicintel_init,
		.map_flash_region	= fallback_map,
		.unmap_flash_region	= fallback_unmap,
		.delay			= internal_delay,
	},
#endif

214 215
#if CONFIG_NICINTEL_SPI == 1
	{
216 217 218 219 220
		.name			= "nicintel_spi",
		.init			= nicintel_spi_init,
		.map_flash_region	= fallback_map,
		.unmap_flash_region	= fallback_unmap,
		.delay			= internal_delay,
221 222 223
	},
#endif

224 225
#if CONFIG_OGP_SPI == 1
	{
226 227 228 229 230
		.name			= "ogp_spi",
		.init			= ogp_spi_init,
		.map_flash_region	= fallback_map,
		.unmap_flash_region	= fallback_unmap,
		.delay			= internal_delay,
231 232 233
	},
#endif

234 235 236 237 238 239 240 241 242 243
#if CONFIG_SATAMV == 1
	{
		.name			= "satamv",
		.init			= satamv_init,
		.map_flash_region	= fallback_map,
		.unmap_flash_region	= fallback_unmap,
		.delay			= internal_delay,
	},
#endif

244 245 246 247 248 249 250 251 252 253
#if CONFIG_LINUX_SPI == 1
	{
		.name			= "linux_spi",
		.init			= linux_spi_init,
		.map_flash_region	= fallback_map,
		.unmap_flash_region	= fallback_unmap,
		.delay			= internal_delay,
	},
#endif

254
	{}, /* This entry corresponds to PROGRAMMER_INVALID. */
255
};
256

257
#define SHUTDOWN_MAXFN 32
258 259
static int shutdown_fn_count = 0;
struct shutdown_func_data {
260
	int (*func) (void *data);
261
	void *data;
262 263 264 265 266
} static shutdown_fn[SHUTDOWN_MAXFN];
/* Initialize to 0 to make sure nobody registers a shutdown function before
 * programmer init.
 */
static int may_register_shutdown = 0;
267

268
static int check_block_eraser(const struct flashctx *flash, int k, int log);
269

270 271 272 273 274 275 276 277
/* Register a function to be executed on programmer shutdown.
 * The advantage over atexit() is that you can supply a void pointer which will
 * be used as parameter to the registered function upon programmer shutdown.
 * This pointer can point to arbitrary data used by said function, e.g. undo
 * information for GPIO settings etc. If unneeded, set data=NULL.
 * Please note that the first (void *data) belongs to the function signature of
 * the function passed as first parameter.
 */
278
int register_shutdown(int (*function) (void *data), void *data)
279 280
{
	if (shutdown_fn_count >= SHUTDOWN_MAXFN) {
281
		msg_perr("Tried to register more than %i shutdown functions.\n",
282 283 284
			 SHUTDOWN_MAXFN);
		return 1;
	}
285 286 287 288 289
	if (!may_register_shutdown) {
		msg_perr("Tried to register a shutdown function before "
			 "programmer init.\n");
		return 1;
	}
290 291 292 293 294 295 296
	shutdown_fn[shutdown_fn_count].func = function;
	shutdown_fn[shutdown_fn_count].data = data;
	shutdown_fn_count++;

	return 0;
}

297
int programmer_init(enum programmer prog, char *param)
298
{
299
	int ret;
300 301 302 303 304 305

	if (prog >= PROGRAMMER_INVALID) {
		msg_perr("Invalid programmer specified!\n");
		return -1;
	}
	programmer = prog;
306 307 308 309 310 311
	/* Initialize all programmer specific data. */
	/* Default to unlimited decode sizes. */
	max_rom_decode = (const struct decode_sizes) {
		.parallel	= 0xffffffff,
		.lpc		= 0xffffffff,
		.fwh		= 0xffffffff,
312
		.spi		= 0xffffffff,
313 314 315 316 317
	};
	/* Default to top aligned flash at 4 GB. */
	flashbase = 0;
	/* Registering shutdown functions is now allowed. */
	may_register_shutdown = 1;
318 319
	/* Default to allowing writes. Broken programmers set this to 0. */
	programmer_may_write = 1;
320 321 322 323

	programmer_param = param;
	msg_pdbg("Initializing %s programmer\n",
		 programmer_table[programmer].name);
324 325 326 327 328 329 330
	ret = programmer_table[programmer].init();
	if (programmer_param && strlen(programmer_param)) {
		msg_perr("Unhandled programmer parameters: %s\n",
			 programmer_param);
		/* Do not error out here, the init itself was successful. */
	}
	return ret;
331 332 333 334
}

int programmer_shutdown(void)
{
335 336
	int ret = 0;

337 338 339 340
	/* Registering shutdown functions is no longer allowed. */
	may_register_shutdown = 0;
	while (shutdown_fn_count > 0) {
		int i = --shutdown_fn_count;
341
		ret |= shutdown_fn[i].func(shutdown_fn[i].data);
342
	}
343
	return ret;
344 345 346 347 348 349 350 351 352 353 354 355 356 357
}

void *programmer_map_flash_region(const char *descr, unsigned long phys_addr,
				  size_t len)
{
	return programmer_table[programmer].map_flash_region(descr,
							     phys_addr, len);
}

void programmer_unmap_flash_region(void *virt_addr, size_t len)
{
	programmer_table[programmer].unmap_flash_region(virt_addr, len);
}

358
void chip_writeb(const struct flashctx *flash, uint8_t val, chipaddr addr)
359
{
360
	flash->pgm->par.chip_writeb(flash, val, addr);
361 362
}

363
void chip_writew(const struct flashctx *flash, uint16_t val, chipaddr addr)
364
{
365
	flash->pgm->par.chip_writew(flash, val, addr);
366 367
}

368
void chip_writel(const struct flashctx *flash, uint32_t val, chipaddr addr)
369
{
370
	flash->pgm->par.chip_writel(flash, val, addr);
371 372
}

373 374
void chip_writen(const struct flashctx *flash, uint8_t *buf, chipaddr addr,
		 size_t len)
375
{
376
	flash->pgm->par.chip_writen(flash, buf, addr, len);
377 378
}

379
uint8_t chip_readb(const struct flashctx *flash, const chipaddr addr)
380
{
381
	return flash->pgm->par.chip_readb(flash, addr);
382 383
}

384
uint16_t chip_readw(const struct flashctx *flash, const chipaddr addr)
385
{
386
	return flash->pgm->par.chip_readw(flash, addr);
387 388
}

389
uint32_t chip_readl(const struct flashctx *flash, const chipaddr addr)
390
{
391
	return flash->pgm->par.chip_readl(flash, addr);
392 393
}

394 395
void chip_readn(const struct flashctx *flash, uint8_t *buf, chipaddr addr,
		size_t len)
396
{
397
	flash->pgm->par.chip_readn(flash, buf, addr, len);
398 399
}

400 401 402 403 404
void programmer_delay(int usecs)
{
	programmer_table[programmer].delay(usecs);
}

405
void map_flash_registers(struct flashctx *flash)
406 407
{
	size_t size = flash->total_size * 1024;
408
	/* Flash registers live 4 MByte below the flash. */
409
	/* FIXME: This is incorrect for nonstandard flashbase. */
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
410
	flash->virtual_registers = (chipaddr)programmer_map_flash_region("flash chip registers", (0xFFFFFFFF - 0x400000 - size + 1), size);
411 412
}

413 414
int read_memmapped(struct flashctx *flash, uint8_t *buf, unsigned int start,
		   int unsigned len)
415
{
416
	chip_readn(flash, buf, flash->virtual_memory + start, len);
417

418 419 420
	return 0;
}

421 422 423 424 425
int min(int a, int b)
{
	return (a < b) ? a : b;
}

426 427 428 429 430
int max(int a, int b)
{
	return (a > b) ? a : b;
}

431 432 433 434 435 436 437 438 439
int bitcount(unsigned long a)
{
	int i = 0;
	for (; a != 0; a >>= 1)
		if (a & 1)
			i++;
	return i;
}

440 441 442 443 444 445
void tolower_string(char *str)
{
	for (; *str != '\0'; str++)
		*str = (char)tolower((unsigned char)*str);
}

446 447 448
char *strcat_realloc(char *dest, const char *src)
{
	dest = realloc(dest, strlen(dest) + strlen(src) + 1);
449 450
	if (!dest) {
		msg_gerr("Out of memory!\n");
451
		return NULL;
452
	}
453 454 455 456
	strcat(dest, src);
	return dest;
}

457
/* This is a somewhat hacked function similar in some ways to strtok().
458 459 460
 * It will look for needle with a subsequent '=' in haystack, return a copy of
 * needle and remove everything from the first occurrence of needle to the next
 * delimiter from haystack.
461
 */
462
char *extract_param(char **haystack, const char *needle, const char *delim)
463
{
464 465 466
	char *param_pos, *opt_pos, *rest;
	char *opt = NULL;
	int optlen;
467
	int needlelen;
468

469 470 471 472 473 474 475 476 477
	needlelen = strlen(needle);
	if (!needlelen) {
		msg_gerr("%s: empty needle! Please report a bug at "
			 "flashrom@flashrom.org\n", __func__);
		return NULL;
	}
	/* No programmer parameters given. */
	if (*haystack == NULL)
		return NULL;
478 479 480 481
	param_pos = strstr(*haystack, needle);
	do {
		if (!param_pos)
			return NULL;
482 483 484 485 486 487 488 489 490 491
		/* Needle followed by '='? */
		if (param_pos[needlelen] == '=') {
			
			/* Beginning of the string? */
			if (param_pos == *haystack)
				break;
			/* After a delimiter? */
			if (strchr(delim, *(param_pos - 1)))
				break;
		}
492 493 494 495
		/* Continue searching. */
		param_pos++;
		param_pos = strstr(param_pos, needle);
	} while (1);
496

497
	if (param_pos) {
498 499 500 501 502 503
		/* Get the string after needle and '='. */
		opt_pos = param_pos + needlelen + 1;
		optlen = strcspn(opt_pos, delim);
		/* Return an empty string if the parameter was empty. */
		opt = malloc(optlen + 1);
		if (!opt) {
504
			msg_gerr("Out of memory!\n");
505 506
			exit(1);
		}
507 508 509 510 511 512 513
		strncpy(opt, opt_pos, optlen);
		opt[optlen] = '\0';
		rest = opt_pos + optlen;
		/* Skip all delimiters after the current parameter. */
		rest += strspn(rest, delim);
		memmove(param_pos, rest, strlen(rest) + 1);
		/* We could shrink haystack, but the effort is not worth it. */
514 515
	}

516
	return opt;
517 518
}

519
char *extract_programmer_param(const char *param_name)
520 521 522 523
{
	return extract_param(&programmer_param, param_name, ",");
}

524
/* Returns the number of well-defined erasers for a chip. */
525
static unsigned int count_usable_erasers(const struct flashctx *flash)
526 527 528 529 530 531 532 533 534 535
{
	unsigned int usable_erasefunctions = 0;
	int k;
	for (k = 0; k < NUM_ERASEFUNCTIONS; k++) {
		if (!check_block_eraser(flash, k, 0))
			usable_erasefunctions++;
	}
	return usable_erasefunctions;
}

536
/* start is an offset to the base address of the flash chip */
537 538
int check_erased_range(struct flashctx *flash, unsigned int start,
		       unsigned int len)
539 540 541 542 543
{
	int ret;
	uint8_t *cmpbuf = malloc(len);

	if (!cmpbuf) {
544
		msg_gerr("Could not allocate memory!\n");
545 546 547 548 549 550 551 552
		exit(1);
	}
	memset(cmpbuf, 0xff, len);
	ret = verify_range(flash, cmpbuf, start, len, "ERASE");
	free(cmpbuf);
	return ret;
}

553
/*
554
 * @cmpbuf	buffer to compare against, cmpbuf[0] is expected to match the
555
 *		flash content at location start
556 557 558 559 560
 * @start	offset to the base address of the flash chip
 * @len		length of the verified area
 * @message	string to print in the "FAILED" message
 * @return	0 for success, -1 for failure
 */
561 562
int verify_range(struct flashctx *flash, uint8_t *cmpbuf, unsigned int start,
		 unsigned int len, const char *message)
563
{
564
	unsigned int i;
565
	uint8_t *readbuf = malloc(len);
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
566
	int ret = 0, failcount = 0;
567 568 569 570

	if (!len)
		goto out_free;

571
	if (!flash->read) {
572
		msg_cerr("ERROR: flashrom has no read function for this flash chip.\n");
573 574
		return 1;
	}
575
	if (!readbuf) {
576
		msg_gerr("Could not allocate memory!\n");
577 578 579 580
		exit(1);
	}

	if (start + len > flash->total_size * 1024) {
581
		msg_gerr("Error: %s called with start 0x%x + len 0x%x >"
582 583 584 585 586 587 588
			" total_size 0x%x\n", __func__, start, len,
			flash->total_size * 1024);
		ret = -1;
		goto out_free;
	}
	if (!message)
		message = "VERIFY";
589

590 591 592 593 594 595 596 597 598 599 600 601 602 603 604
	ret = flash->read(flash, readbuf, start, len);
	if (ret) {
		msg_gerr("Verification impossible because read failed "
			 "at 0x%x (len 0x%x)\n", start, len);
		return ret;
	}

	for (i = 0; i < len; i++) {
		if (cmpbuf[i] != readbuf[i]) {
			/* Only print the first failure. */
			if (!failcount++)
				msg_cerr("%s FAILED at 0x%08x! "
					 "Expected=0x%02x, Read=0x%02x,",
					 message, start + i, cmpbuf[i],
					 readbuf[i]);
605 606
		}
	}
607
	if (failcount) {
608
		msg_cerr(" failed byte count from 0x%08x-0x%08x: 0x%x\n",
609
			 start, start + len - 1, failcount);
610 611
		ret = -1;
	}
612 613 614 615 616 617

out_free:
	free(readbuf);
	return ret;
}

618
/*
619 620 621
 * Check if the buffer @have can be programmed to the content of @want without
 * erasing. This is only possible if all chunks of size @gran are either kept
 * as-is or changed from an all-ones state to any other state.
622
 *
623 624 625 626 627 628 629 630 631 632
 * The following write granularities (enum @gran) are known:
 * - 1 bit. Each bit can be cleared individually.
 * - 1 byte. A byte can be written once. Further writes to an already written
 *   byte cause the contents to be either undefined or to stay unchanged.
 * - 128 bytes. If less than 128 bytes are written, the rest will be
 *   erased. Each write to a 128-byte region will trigger an automatic erase
 *   before anything is written. Very uncommon behaviour and unsupported by
 *   this function.
 * - 256 bytes. If less than 256 bytes are written, the contents of the
 *   unwritten bytes are undefined.
633 634
 * Warning: This function assumes that @have and @want point to naturally
 * aligned regions.
635 636 637
 *
 * @have        buffer with current content
 * @want        buffer with desired content
638
 * @len		length of the checked area
639 640 641
 * @gran	write granularity (enum, not count)
 * @return      0 if no erase is needed, 1 otherwise
 */
642
int need_erase(uint8_t *have, uint8_t *want, unsigned int len, enum write_granularity gran)
643
{
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
644
	int result = 0;
645
	unsigned int i, j, limit;
646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664

	switch (gran) {
	case write_gran_1bit:
		for (i = 0; i < len; i++)
			if ((have[i] & want[i]) != want[i]) {
				result = 1;
				break;
			}
		break;
	case write_gran_1byte:
		for (i = 0; i < len; i++)
			if ((have[i] != want[i]) && (have[i] != 0xff)) {
				result = 1;
				break;
			}
		break;
	case write_gran_256bytes:
		for (j = 0; j < len / 256; j++) {
			limit = min (256, len - j * 256);
665
			/* Are 'have' and 'want' identical? */
666 667 668 669
			if (!memcmp(have + j * 256, want + j * 256, limit))
				continue;
			/* have needs to be in erased state. */
			for (i = 0; i < limit; i++)
670
				if (have[j * 256 + i] != 0xff) {
671 672 673 674 675 676 677
					result = 1;
					break;
				}
			if (result)
				break;
		}
		break;
678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697
	default:
		msg_cerr("%s: Unsupported granularity! Please report a bug at "
			 "flashrom@flashrom.org\n", __func__);
	}
	return result;
}

/**
 * Check if the buffer @have needs to be programmed to get the content of @want.
 * If yes, return 1 and fill in first_start with the start address of the
 * write operation and first_len with the length of the first to-be-written
 * chunk. If not, return 0 and leave first_start and first_len undefined.
 *
 * Warning: This function assumes that @have and @want point to naturally
 * aligned regions.
 *
 * @have	buffer with current content
 * @want	buffer with desired content
 * @len		length of the checked area
 * @gran	write granularity (enum, not count)
698 699 700 701 702
 * @first_start	offset of the first byte which needs to be written (passed in
 *		value is increased by the offset of the first needed write
 *		relative to have/want or unchanged if no write is needed)
 * @return	length of the first contiguous area which needs to be written
 *		0 if no write is needed
703 704 705 706 707
 *
 * FIXME: This function needs a parameter which tells it about coalescing
 * in relation to the max write length of the programmer and the max write
 * length of the chip.
 */
708 709 710
static unsigned int get_next_write(uint8_t *have, uint8_t *want, unsigned int len,
			  unsigned int *first_start,
			  enum write_granularity gran)
711
{
712 713 714
	int need_write = 0;
	unsigned int rel_start = 0, first_len = 0;
	unsigned int i, limit, stride;
715 716 717 718

	switch (gran) {
	case write_gran_1bit:
	case write_gran_1byte:
719
		stride = 1;
720 721
		break;
	case write_gran_256bytes:
722
		stride = 256;
723 724 725 726
		break;
	default:
		msg_cerr("%s: Unsupported granularity! Please report a bug at "
			 "flashrom@flashrom.org\n", __func__);
727 728 729 730
		/* Claim that no write was needed. A write with unknown
		 * granularity is too dangerous to try.
		 */
		return 0;
731
	}
732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749
	for (i = 0; i < len / stride; i++) {
		limit = min(stride, len - i * stride);
		/* Are 'have' and 'want' identical? */
		if (memcmp(have + i * stride, want + i * stride, limit)) {
			if (!need_write) {
				/* First location where have and want differ. */
				need_write = 1;
				rel_start = i * stride;
			}
		} else {
			if (need_write) {
				/* First location where have and want
				 * do not differ anymore.
				 */
				break;
			}
		}
	}
750
	if (need_write)
751
		first_len = min(i * stride - rel_start, len);
752
	*first_start += rel_start;
753
	return first_len;
754 755
}

756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809
/* This function generates various test patterns useful for testing controller
 * and chip communication as well as chip behaviour.
 *
 * If a byte can be written multiple times, each time keeping 0-bits at 0
 * and changing 1-bits to 0 if the new value for that bit is 0, the effect
 * is essentially an AND operation. That's also the reason why this function
 * provides the result of AND between various patterns.
 *
 * Below is a list of patterns (and their block length).
 * Pattern 0 is 05 15 25 35 45 55 65 75 85 95 a5 b5 c5 d5 e5 f5 (16 Bytes)
 * Pattern 1 is 0a 1a 2a 3a 4a 5a 6a 7a 8a 9a aa ba ca da ea fa (16 Bytes)
 * Pattern 2 is 50 51 52 53 54 55 56 57 58 59 5a 5b 5c 5d 5e 5f (16 Bytes)
 * Pattern 3 is a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 aa ab ac ad ae af (16 Bytes)
 * Pattern 4 is 00 10 20 30 40 50 60 70 80 90 a0 b0 c0 d0 e0 f0 (16 Bytes)
 * Pattern 5 is 00 01 02 03 04 05 06 07 08 09 0a 0b 0c 0d 0e 0f (16 Bytes)
 * Pattern 6 is 00 (1 Byte)
 * Pattern 7 is ff (1 Byte)
 * Patterns 0-7 have a big-endian block number in the last 2 bytes of each 256
 * byte block.
 *
 * Pattern 8 is 00 01 02 03 04 05 06 07 08 09 0a 0b 0c 0d 0e 0f 10 11... (256 B)
 * Pattern 9 is ff fe fd fc fb fa f9 f8 f7 f6 f5 f4 f3 f2 f1 f0 ef ee... (256 B)
 * Pattern 10 is 00 00 00 01 00 02 00 03 00 04... (128 kB big-endian counter)
 * Pattern 11 is ff ff ff fe ff fd ff fc ff fb... (128 kB big-endian downwards)
 * Pattern 12 is 00 (1 Byte)
 * Pattern 13 is ff (1 Byte)
 * Patterns 8-13 have no block number.
 *
 * Patterns 0-3 are created to detect and efficiently diagnose communication
 * slips like missed bits or bytes and their repetitive nature gives good visual
 * cues to the person inspecting the results. In addition, the following holds:
 * AND Pattern 0/1 == Pattern 4
 * AND Pattern 2/3 == Pattern 5
 * AND Pattern 0/1/2/3 == AND Pattern 4/5 == Pattern 6
 * A weakness of pattern 0-5 is the inability to detect swaps/copies between
 * any two 16-byte blocks except for the last 16-byte block in a 256-byte bloc.
 * They work perfectly for detecting any swaps/aliasing of blocks >= 256 bytes.
 * 0x5 and 0xa were picked because they are 0101 and 1010 binary.
 * Patterns 8-9 are best for detecting swaps/aliasing of blocks < 256 bytes.
 * Besides that, they provide for bit testing of the last two bytes of every
 * 256 byte block which contains the block number for patterns 0-6.
 * Patterns 10-11 are special purpose for detecting subblock aliasing with
 * block sizes >256 bytes (some Dataflash chips etc.)
 * AND Pattern 8/9 == Pattern 12
 * AND Pattern 10/11 == Pattern 12
 * Pattern 13 is the completely erased state.
 * None of the patterns can detect aliasing at boundaries which are a multiple
 * of 16 MBytes (but such chips do not exist anyway for Parallel/LPC/FWH/SPI).
 */
int generate_testpattern(uint8_t *buf, uint32_t size, int variant)
{
	int i;

	if (!buf) {
810
		msg_gerr("Invalid buffer!\n");
811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891
		return 1;
	}

	switch (variant) {
	case 0:
		for (i = 0; i < size; i++)
			buf[i] = (i & 0xf) << 4 | 0x5;
		break;
	case 1:
		for (i = 0; i < size; i++)
			buf[i] = (i & 0xf) << 4 | 0xa;
		break;
	case 2:
		for (i = 0; i < size; i++)
			buf[i] = 0x50 | (i & 0xf);
		break;
	case 3:
		for (i = 0; i < size; i++)
			buf[i] = 0xa0 | (i & 0xf);
		break;
	case 4:
		for (i = 0; i < size; i++)
			buf[i] = (i & 0xf) << 4;
		break;
	case 5:
		for (i = 0; i < size; i++)
			buf[i] = i & 0xf;
		break;
	case 6:
		memset(buf, 0x00, size);
		break;
	case 7:
		memset(buf, 0xff, size);
		break;
	case 8:
		for (i = 0; i < size; i++)
			buf[i] = i & 0xff;
		break;
	case 9:
		for (i = 0; i < size; i++)
			buf[i] = ~(i & 0xff);
		break;
	case 10:
		for (i = 0; i < size % 2; i++) {
			buf[i * 2] = (i >> 8) & 0xff;
			buf[i * 2 + 1] = i & 0xff;
		}
		if (size & 0x1)
			buf[i * 2] = (i >> 8) & 0xff;
		break;
	case 11:
		for (i = 0; i < size % 2; i++) {
			buf[i * 2] = ~((i >> 8) & 0xff);
			buf[i * 2 + 1] = ~(i & 0xff);
		}
		if (size & 0x1)
			buf[i * 2] = ~((i >> 8) & 0xff);
		break;
	case 12:
		memset(buf, 0x00, size);
		break;
	case 13:
		memset(buf, 0xff, size);
		break;
	}

	if ((variant >= 0) && (variant <= 7)) {
		/* Write block number in the last two bytes of each 256-byte
		 * block, big endian for easier reading of the hexdump.
		 * Note that this wraps around for chips larger than 2^24 bytes
		 * (16 MB).
		 */
		for (i = 0; i < size / 256; i++) {
			buf[i * 256 + 254] = (i >> 8) & 0xff;
			buf[i * 256 + 255] = i & 0xff;
		}
	}

	return 0;
}

892 893 894
int check_max_decode(enum chipbustype buses, uint32_t size)
{
	int limitexceeded = 0;
895 896

	if ((buses & BUS_PARALLEL) && (max_rom_decode.parallel < size)) {
897
		limitexceeded++;
898
		msg_pdbg("Chip size %u kB is bigger than supported "
899 900 901 902
			 "size %u kB of chipset/board/programmer "
			 "for %s interface, "
			 "probe/read/erase/write may fail. ", size / 1024,
			 max_rom_decode.parallel / 1024, "Parallel");
903
	}
904
	if ((buses & BUS_LPC) && (max_rom_decode.lpc < size)) {
905
		limitexceeded++;
906
		msg_pdbg("Chip size %u kB is bigger than supported "
907 908 909 910
			 "size %u kB of chipset/board/programmer "
			 "for %s interface, "
			 "probe/read/erase/write may fail. ", size / 1024,
			 max_rom_decode.lpc / 1024, "LPC");
911
	}
912
	if ((buses & BUS_FWH) && (max_rom_decode.fwh < size)) {
913
		limitexceeded++;
914
		msg_pdbg("Chip size %u kB is bigger than supported "
915 916 917 918
			 "size %u kB of chipset/board/programmer "
			 "for %s interface, "
			 "probe/read/erase/write may fail. ", size / 1024,
			 max_rom_decode.fwh / 1024, "FWH");
919
	}
920
	if ((buses & BUS_SPI) && (max_rom_decode.spi < size)) {
921
		limitexceeded++;
922
		msg_pdbg("Chip size %u kB is bigger than supported "
923 924 925 926
			 "size %u kB of chipset/board/programmer "
			 "for %s interface, "
			 "probe/read/erase/write may fail. ", size / 1024,
			 max_rom_decode.spi / 1024, "SPI");
927 928 929 930 931 932 933
	}
	if (!limitexceeded)
		return 0;
	/* Sometimes chip and programmer have more than one bus in common,
	 * and the limit is not exceeded on all buses. Tell the user.
	 */
	if (bitcount(buses) > limitexceeded)
934
		/* FIXME: This message is designed towards CLI users. */
935
		msg_pdbg("There is at least one common chip/programmer "
936 937
			 "interface which can support a chip of this size. "
			 "You can try --force at your own risk.\n");
938 939 940
	return 1;
}

941 942
int probe_flash(struct registered_programmer *pgm, int startchip,
		struct flashctx *fill_flash, int force)
Ronald G. Minnich's avatar
Dammit  
Ronald G. Minnich committed
943
{
944
	const struct flashchip *flash;
945
	unsigned long base = 0;
946
	char location[64];
947 948
	uint32_t size;
	enum chipbustype buses_common;
949
	char *tmp;
Ronald G. Minnich's avatar
Dammit  
Ronald G. Minnich committed
950

951
	for (flash = flashchips + startchip; flash && flash->name; flash++) {
952
		if (chip_to_probe && strcmp(flash->name, chip_to_probe) != 0)
953
			continue;
954 955
		buses_common = pgm->buses_supported & flash->bustype;
		if (!buses_common)
956 957 958 959 960 961
			continue;
		msg_gdbg("Probing for %s %s, %d kB: ",
			     flash->vendor, flash->name, flash->total_size);
		if (!flash->probe && !force) {
			msg_gdbg("failed! flashrom has no probe function for "
				 "this flash chip.\n");
962 963
			continue;
		}
Stefan Reinauer's avatar
Stefan Reinauer committed
964

965
		size = flash->total_size * 1024;
966
		check_max_decode(buses_common, size);
Stefan Reinauer's avatar
Stefan Reinauer committed
967

968
		/* Start filling in the dynamic data. */
969
		memcpy(fill_flash, flash, sizeof(struct flashchip));
970
		fill_flash->pgm = pgm;
971

972
		base = flashbase ? flashbase : (0xffffffff - size + 1);
973
		fill_flash->virtual_memory = (chipaddr)programmer_map_flash_region("flash chip", base, size);
974

975 976 977
		if (force)
			break;

978
		if (fill_flash->probe(fill_flash) != 1)
979 980
			goto notfound;

981 982 983 984 985 986 987 988 989
		/* If this is the first chip found, accept it.
		 * If this is not the first chip found, accept it only if it is
		 * a non-generic match.
		 * We could either make chipcount global or provide it as
		 * parameter, or we assume that startchip==0 means this call to
		 * probe_flash() is the first one and thus no chip has been
		 * found before.
		 */
		if (startchip == 0 || fill_flash->model_id != GENERIC_DEVICE_ID)
990
			break;
Stefan Reinauer's avatar
Stefan Reinauer committed
991

992
notfound:
993
		programmer_unmap_flash_region((void *)fill_flash->virtual_memory, size);
Ronald G. Minnich's avatar
Dammit  
Ronald G. Minnich committed
994
	}
Uwe Hermann's avatar
Uwe Hermann committed
995

996
	if (!flash || !flash->name)
997
		return -1;
998

999 1000
#if CONFIG_INTERNAL == 1
	if (programmer_table[programmer].map_flash_region == physmap)
1001
		snprintf(location, sizeof(location), "at physical address 0x%lx", base);
1002 1003
	else
#endif
1004 1005
		snprintf(location, sizeof(location), "on %s", programmer_table[programmer].name);

1006
	tmp = flashbuses_to_text(flash->bustype);
1007
	msg_cinfo("%s %s flash chip \"%s\" (%d kB, %s) %s.\n",
1008 1009 1010
		  force ? "Assuming" : "Found", fill_flash->vendor,
		  fill_flash->name, fill_flash->total_size, tmp, location);
	free(tmp);
1011

1012 1013 1014 1015
	/* Flash registers will not be mapped if the chip was forced. Lock info
	 * may be stored in registers, so avoid lock info printing.
	 */
	if (!force)
1016 1017
		if (fill_flash->printlock)
			fill_flash->printlock(fill_flash);
1018

1019 1020
	/* Return position of matching chip. */
	return flash - flashchips;
Ronald G. Minnich's avatar
Dammit  
Ronald G. Minnich committed
1021 1022
}

1023
int verify_flash(struct flashctx *flash, uint8_t *buf)
Ronald G. Minnich's avatar
Dammit  
Ronald G. Minnich committed
1024
{
1025
	int ret;
1026
	unsigned int total_size = flash->total_size * 1024;
1027

1028
	msg_cinfo("Verifying flash... ");
1029

1030
	ret = verify_range(flash, buf, 0, total_size, NULL);
1031

1032
	if (!ret)
1033
		msg_cinfo("VERIFIED.          \n");
1034

1035
	return ret;
Ronald G. Minnich's avatar
Fixes  
Ronald G. Minnich committed
1036 1037
}

1038 1039
int read_buf_from_file(unsigned char *buf, unsigned long size,
		       const char *filename)
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071
{
	unsigned long numbytes;
	FILE *image;
	struct stat image_stat;

	if ((image = fopen(filename, "rb")) == NULL) {
		perror(filename);
		return 1;
	}
	if (fstat(fileno(image), &image_stat) != 0) {
		perror(filename);
		fclose(image);
		return 1;
	}
	if (image_stat.st_size != size) {
		msg_gerr("Error: Image size doesn't match\n");
		fclose(image);
		return 1;
	}
	numbytes = fread(buf, 1, size, image);
	if (fclose(image)) {
		perror(filename);
		return 1;
	}
	if (numbytes != size) {
		msg_gerr("Error: Failed to read complete file. Got %ld bytes, "
			 "wanted %ld!\n", numbytes, size);
		return 1;
	}
	return 0;
}

1072 1073
int write_buf_to_file(unsigned char *buf, unsigned long size,
		      const char *filename)
1074 1075 1076
{
	unsigned long numbytes;
	FILE *image;
1077 1078

	if (!filename) {
1079
		msg_gerr("No filename specified.\n");
1080 1081
		return 1;
	}
1082
	if ((image = fopen(filename, "wb")) == NULL) {
1083
		perror(filename);
1084
		return 1;
1085
	}
1086 1087 1088

	numbytes = fwrite(buf, 1, size, image);
	fclose(image);
1089 1090 1091
	if (numbytes != size) {
		msg_gerr("File %s could not be written completely.\n",
			 filename);
1092
		return 1;
1093
	}
1094 1095 1096
	return 0;
}

1097
int read_flash_to_file(struct flashctx *flash, const char *filename)
1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119
{
	unsigned long size = flash->total_size * 1024;
	unsigned char *buf = calloc(size, sizeof(char));
	int ret = 0;

	msg_cinfo("Reading flash... ");
	if (!buf) {
		msg_gerr("Memory allocation failed!\n");
		msg_cinfo("FAILED.\n");
		return 1;
	}
	if (!flash->read) {
		msg_cerr("No read function available for this flash chip.\n");
		ret = 1;
		goto out_free;
	}
	if (flash->read(flash, buf, 0, size)) {
		msg_cerr("Read operation failed!\n");
		ret = 1;
		goto out_free;
	}

Stefan Tauner's avatar
Stefan Tauner committed
1120
	ret = write_buf_to_file(buf, size, filename);
1121 1122 1123 1124 1125 1126
out_free:
	free(buf);
	msg_cinfo("%s.\n", ret ? "FAILED" : "done");
	return ret;
}

1127 1128
/* This function shares a lot of its structure with erase_and_write_flash() and
 * walk_eraseregions().
1129 1130
 * Even if an error is found, the function will keep going and check the rest.
 */
1131
static int selfcheck_eraseblocks(const struct flashchip *flash)
1132
{
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1133 1134
	int i, j, k;
	int ret = 0;
1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147

	for (k = 0; k < NUM_ERASEFUNCTIONS; k++) {
		unsigned int done = 0;
		struct block_eraser eraser = flash->block_erasers[k];

		for (i = 0; i < NUM_ERASEREGIONS; i++) {
			/* Blocks with zero size are bugs in flashchips.c. */
			if (eraser.eraseblocks[i].count &&
			    !eraser.eraseblocks[i].size) {
				msg_gerr("ERROR: Flash chip %s erase function "
					"%i region %i has size 0. Please report"
					" a bug at flashrom@flashrom.org\n",
					flash->name, k, i);
1148
				ret = 1;
1149 1150 1151 1152 1153 1154 1155 1156
			}
			/* Blocks with zero count are bugs in flashchips.c. */
			if (!eraser.eraseblocks[i].count &&
			    eraser.eraseblocks[i].size) {
				msg_gerr("ERROR: Flash chip %s erase function "
					"%i region %i has count 0. Please report"
					" a bug at flashrom@flashrom.org\n",
					flash->name, k, i);
1157
				ret = 1;
1158 1159 1160 1161
			}
			done += eraser.eraseblocks[i].count *
				eraser.eraseblocks[i].size;
		}
1162 1163
		/* Empty eraseblock definition with erase function.  */
		if (!done && eraser.block_erase)
1164
			msg_gspew("Strange: Empty eraseblock definition with "
1165
				  "non-empty erase function. Not an error.\n");
1166 1167 1168 1169 1170 1171 1172 1173
		if (!done)
			continue;
		if (done != flash->total_size * 1024) {
			msg_gerr("ERROR: Flash chip %s erase function %i "
				"region walking resulted in 0x%06x bytes total,"
				" expected 0x%06x bytes. Please report a bug at"
				" flashrom@flashrom.org\n", flash->name, k,
				done, flash->total_size * 1024);
1174
			ret = 1;
1175
		}
1176 1177 1178 1179 1180 1181
		if (!eraser.block_erase)
			continue;
		/* Check if there are identical erase functions for different
		 * layouts. That would imply "magic" erase functions. The
		 * easiest way to check this is with function pointers.
		 */
1182
		for (j = k + 1; j < NUM_ERASEFUNCTIONS; j++) {
1183 1184 1185 1186 1187 1188 1189 1190
			if (eraser.block_erase ==
			    flash->block_erasers[j].block_erase) {
				msg_gerr("ERROR: Flash chip %s erase function "
					"%i and %i are identical. Please report"
					" a bug at flashrom@flashrom.org\n",
					flash->name, k, j);
				ret = 1;
			}
1191
		}
1192
	}
1193
	return ret;
1194 1195
}

1196
static int erase_and_write_block_helper(struct flashctx *flash,
1197
					unsigned int start, unsigned int len,
1198
					uint8_t *curcontents,
1199
					uint8_t *newcontents,
1200
					int (*erasefn) (struct flashctx *flash,
1201 1202 1203
							unsigned int addr,
							unsigned int len))
{
1204 1205
	unsigned int starthere = 0, lenhere = 0;
	int ret = 0, skip = 1, writecount = 0;
1206 1207
	enum write_granularity gran = write_gran_256bytes; /* FIXME */

1208
	/* curcontents and newcontents are opaque to walk_eraseregions, and
1209 1210
	 * need to be adjusted here to keep the impression of proper abstraction
	 */
1211
	curcontents += start;
1212 1213 1214
	newcontents += start;
	msg_cdbg(":");
	/* FIXME: Assume 256 byte granularity for now to play it safe. */
1215
	if (need_erase(curcontents, newcontents, len, gran)) {
1216 1217 1218 1219
		msg_cdbg("E");
		ret = erasefn(flash, start, len);
		if (ret)
			return ret;
1220 1221 1222 1223
		if (check_erased_range(flash, start, len)) {
			msg_cerr("ERASE FAILED!\n");
			return -1;
		}
1224 1225
		/* Erase was successful. Adjust curcontents. */
		memset(curcontents, 0xff, len);
1226 1227
		skip = 0;
	}
1228 1229 1230 1231
	/* get_next_write() sets starthere to a new value after the call. */
	while ((lenhere = get_next_write(curcontents + starthere,
					 newcontents + starthere,
					 len - starthere, &starthere, gran))) {
1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246
		if (!writecount++)
			msg_cdbg("W");
		/* Needs the partial write function signature. */
		ret = flash->write(flash, newcontents + starthere,
				   start + starthere, lenhere);
		if (ret)
			return ret;
		starthere += lenhere;
		skip = 0;
	}
	if (skip)
		msg_cdbg("S");
	return ret;
}

1247 1248
static int walk_eraseregions(struct flashctx *flash, int erasefunction,
			     int (*do_something) (struct flashctx *flash,
1249
						  unsigned int addr,
1250 1251 1252 1253
						  unsigned int len,
						  uint8_t *param1,
						  uint8_t *param2,
						  int (*erasefn) (
1254
							struct flashctx *flash,
1255 1256 1257
							unsigned int addr,
							unsigned int len)),
			     void *param1, void *param2)
1258 1259
{
	int i, j;
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1260 1261
	unsigned int start = 0;
	unsigned int len;
1262
	struct block_eraser eraser = flash->block_erasers[erasefunction];
1263

1264 1265 1266 1267 1268 1269
	for (i = 0; i < NUM_ERASEREGIONS; i++) {
		/* count==0 for all automatically initialized array
		 * members so the loop below won't be executed for them.
		 */
		len = eraser.eraseblocks[i].size;
		for (j = 0; j < eraser.eraseblocks[i].count; j++) {
1270 1271 1272 1273
			/* Print this for every block except the first one. */
			if (i || j)
				msg_cdbg(", ");
			msg_cdbg("0x%06x-0x%06x", start,
1274
				     start + len - 1);
1275 1276
			if (do_something(flash, start, len, param1, param2,
					 eraser.block_erase)) {
1277
				return 1;
1278
			}
1279 1280 1281
			start += len;
		}
	}
1282
	msg_cdbg("\n");
1283 1284 1285
	return 0;
}

1286
static int check_block_eraser(const struct flashctx *flash, int k, int log)
1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297
{
	struct block_eraser eraser = flash->block_erasers[k];

	if (!eraser.block_erase && !eraser.eraseblocks[0].count) {
		if (log)
			msg_cdbg("not defined. ");
		return 1;
	}
	if (!eraser.block_erase && eraser.eraseblocks[0].count) {
		if (log)
			msg_cdbg("eraseblock layout is known, but matching "
Stefan Tauner's avatar
Stefan Tauner committed
1298
				 "block erase function is not implemented. ");
1299 1300 1301 1302 1303
		return 1;
	}
	if (eraser.block_erase && !eraser.eraseblocks[0].count) {
		if (log)
			msg_cdbg("block erase function found, but "
Stefan Tauner's avatar
Stefan Tauner committed
1304
				 "eraseblock layout is not defined. ");
1305 1306 1307 1308 1309
		return 1;
	}
	return 0;
}

1310
int erase_and_write_flash(struct flashctx *flash, uint8_t *oldcontents,
1311
			  uint8_t *newcontents)
1312
{
1313
	int k, ret = 1;
1314 1315
	uint8_t *curcontents;
	unsigned long size = flash->total_size * 1024;
1316
	unsigned int usable_erasefunctions = count_usable_erasers(flash);
1317 1318

	msg_cinfo("Erasing and writing flash chip... ");
1319 1320 1321 1322 1323
	curcontents = malloc(size);
	if (!curcontents) {
		msg_gerr("Out of memory!\n");
		exit(1);
	}
1324 1325
	/* Copy oldcontents to curcontents to avoid clobbering oldcontents. */
	memcpy(curcontents, oldcontents, size);
1326 1327

	for (k = 0; k < NUM_ERASEFUNCTIONS; k++) {
1328 1329
		if (k != 0)
			msg_cdbg("Looking for another erase function.\n");
1330 1331 1332 1333
		if (!usable_erasefunctions) {
			msg_cdbg("No usable erase functions left.\n");
			break;
		}
1334 1335
		msg_cdbg("Trying erase function %i... ", k);
		if (check_block_eraser(flash, k, 1))
1336
			continue;
1337
		usable_erasefunctions--;
1338 1339
		ret = walk_eraseregions(flash, k, &erase_and_write_block_helper,
					curcontents, newcontents);
1340 1341 1342
		/* If everything is OK, don't try another erase function. */
		if (!ret)
			break;
1343
		/* Write/erase failed, so try to find out what the current chip
1344 1345
		 * contents are. If no usable erase functions remain, we can
		 * skip this: the next iteration will break immediately anyway.
1346
		 */
1347 1348
		if (!usable_erasefunctions)
			continue;
1349 1350 1351 1352
		/* Reading the whole chip may take a while, inform the user even
		 * in non-verbose mode.
		 */
		msg_cinfo("Reading current flash chip contents... ");
1353 1354
		if (flash->read(flash, curcontents, 0, size)) {
			/* Now we are truly screwed. Read failed as well. */
1355
			msg_cerr("Can't read anymore! Aborting.\n");
1356 1357 1358 1359 1360
			/* We have no idea about the flash chip contents, so
			 * retrying with another erase function is pointless.
			 */
			break;
		}
1361
		msg_cinfo("done. ");
1362
	}
1363 1364
	/* Free the scratchpad. */
	free(curcontents);
1365

1366
	if (ret) {
1367
		msg_cerr("FAILED!\n");
1368
	} else {
1369
		msg_cinfo("Erase/write done.\n");
1370 1371
	}
	return ret;
1372 1373
}

1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386
void nonfatal_help_message(void)
{
	msg_gerr("Writing to the flash chip apparently didn't do anything.\n"
		"This means we have to add special support for your board, "
		  "programmer or flash chip.\n"
		"Please report this on IRC at irc.freenode.net (channel "
		  "#flashrom) or\n"
		"mail flashrom@flashrom.org!\n"
		"-------------------------------------------------------------"
		  "------------------\n"
		"You may now reboot or simply leave the machine running.\n");
}

1387
void emergency_help_message(void)
1388
{
1389
	msg_gerr("Your flash chip is in an unknown state.\n"
1390
		"Get help on IRC at irc.freenode.net (channel #flashrom) or\n"
1391 1392
		"mail flashrom@flashrom.org with FAILED: your board name in "
		  "the subject line!\n"
1393 1394
		"-------------------------------------------------------------"
		  "------------------\n"
1395 1396 1397
		"DO NOT REBOOT OR POWEROFF!\n");
}

1398
/* The way to go if you want a delimited list of programmers */
1399
void list_programmers(const char *delim)
1400 1401 1402
{
	enum programmer p;
	for (p = 0; p < PROGRAMMER_INVALID; p++) {
1403
		msg_ginfo("%s", programmer_table[p].name);
1404
		if (p < PROGRAMMER_INVALID - 1)
1405
			msg_ginfo("%s", delim);
1406
	}
1407
	msg_ginfo("\n");	
1408 1409
}

1410 1411 1412
void list_programmers_linebreak(int startcol, int cols, int paren)
{
	const char *pname;
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1413 1414
	int pnamelen;
	int remaining = 0, firstline = 1;
1415
	enum programmer p;
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1416
	int i;
1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449

	for (p = 0; p < PROGRAMMER_INVALID; p++) {
		pname = programmer_table[p].name;
		pnamelen = strlen(pname);
		if (remaining - pnamelen - 2 < 0) {
			if (firstline)
				firstline = 0;
			else
				printf("\n");
			for (i = 0; i < startcol; i++)
				printf(" ");
			remaining = cols - startcol;
		} else {
			printf(" ");
			remaining--;
		}
		if (paren && (p == 0)) {
			printf("(");
			remaining--;
		}
		printf("%s", pname);
		remaining -= pnamelen;
		if (p < PROGRAMMER_INVALID - 1) {
			printf(",");
			remaining--;
		} else {
			if (paren)
				printf(")");
			printf("\n");
		}
	}
}

1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469
void print_sysinfo(void)
{
#if HAVE_UTSNAME == 1
	struct utsname osinfo;
	uname(&osinfo);

	msg_ginfo(" on %s %s (%s)", osinfo.sysname, osinfo.release,
		  osinfo.machine);
#else
	msg_ginfo(" on unknown machine");
#endif
	msg_ginfo(", built with");
#if NEED_PCI == 1
#ifdef PCILIB_VERSION
	msg_ginfo(" libpci %s,", PCILIB_VERSION);
#else
	msg_ginfo(" unknown PCI library,");
#endif
#endif
#ifdef __clang__
1470 1471 1472 1473 1474 1475
	msg_ginfo(" LLVM Clang");
#ifdef __clang_version__
	msg_ginfo(" %s,", __clang_version__);
#else
	msg_ginfo(" unknown version (before r102686),");
#endif
1476 1477 1478
#elif defined(__GNUC__)
	msg_ginfo(" GCC");
#ifdef __VERSION__
1479 1480 1481 1482
	msg_ginfo(" %s,", __VERSION__);
#else
	msg_ginfo(" unknown version,");
#endif
1483
#else
1484
	msg_ginfo(" unknown compiler,");
1485
#endif
1486 1487
#if defined (__FLASHROM_LITTLE_ENDIAN__)
	msg_ginfo(" little endian");
1488
#else
1489
	msg_ginfo(" big endian");
1490 1491 1492 1493
#endif
	msg_ginfo("\n");
}

1494 1495
void print_version(void)
{
1496
	msg_ginfo("flashrom v%s", flashrom_version);
1497
	print_sysinfo();
1498 1499
}

1500 1501 1502
void print_banner(void)
{
	msg_ginfo("flashrom is free software, get the source code at "
1503
		  "http://www.flashrom.org\n");
1504 1505 1506
	msg_ginfo("\n");
}

1507 1508
int selfcheck(void)
{
1509
	int ret = 0;
1510
	const struct flashchip *flash;
1511 1512 1513 1514

	/* Safety check. Instead of aborting after the first error, check
	 * if more errors exist.
	 */
1515
	if (ARRAY_SIZE(programmer_table) - 1 != PROGRAMMER_INVALID) {
1516
		msg_gerr("Programmer table miscompilation!\n");
1517
		ret = 1;
1518
	}
1519
	/* It would be favorable if we could also check for correct termination
1520
	 * of the following arrays, but we don't know their sizes in here...
1521 1522 1523 1524 1525 1526 1527
	 * For 'flashchips' we check the first element to be non-null. In the
	 * other cases there exist use cases where the first element can be
	 * null. */
	if (flashchips == NULL || flashchips[0].vendor == NULL) {
		msg_gerr("Flashchips table miscompilation!\n");
		ret = 1;
	}
1528 1529 1530
	/* Check that virtual_memory in struct flashctx is placed directly
	 * after the members copied from struct flashchip.
	 */
1531 1532
	if (sizeof(struct flashchip) !=
	    offsetof(struct flashctx, virtual_memory)) {
1533 1534 1535
		msg_gerr("struct flashctx broken!\n");
		ret = 1;
	}
1536 1537 1538
	for (flash = flashchips; flash && flash->name; flash++)
		if (selfcheck_eraseblocks(flash))
			ret = 1;
1539 1540 1541 1542 1543 1544

#if CONFIG_INTERNAL == 1
	if (chipset_enables == NULL) {
		msg_gerr("Chipset enables table does not exist!\n");
		ret = 1;
	}
1545
	if (board_matches == NULL) {
1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556
		msg_gerr("Board enables table does not exist!\n");
		ret = 1;
	}
	if (boards_known == NULL) {
		msg_gerr("Known boards table does not exist!\n");
		ret = 1;
	}
	if (laptops_known == NULL) {
		msg_gerr("Known laptops table does not exist!\n");
		ret = 1;
	}
1557
#endif
1558
	return ret;
1559 1560
}

1561
void check_chip_supported(const struct flashctx *flash)
1562 1563
{
	if (TEST_OK_MASK != (flash->tested & TEST_OK_MASK)) {
1564
		msg_cinfo("===\n");
1565
		if (flash->tested & TEST_BAD_MASK) {
1566
			msg_cinfo("This flash part has status NOT WORKING for operations:");
1567
			if (flash->tested & TEST_BAD_PROBE)
1568
				msg_cinfo(" PROBE");
1569
			if (flash->tested & TEST_BAD_READ)
1570
				msg_cinfo(" READ");
1571
			if (flash->tested & TEST_BAD_ERASE)
1572
				msg_cinfo(" ERASE");
1573
			if (flash->tested & TEST_BAD_WRITE)
1574 1575
				msg_cinfo(" WRITE");
			msg_cinfo("\n");
1576 1577 1578 1579 1580
		}
		if ((!(flash->tested & TEST_BAD_PROBE) && !(flash->tested & TEST_OK_PROBE)) ||
		    (!(flash->tested & TEST_BAD_READ) && !(flash->tested & TEST_OK_READ)) ||
		    (!(flash->tested & TEST_BAD_ERASE) && !(flash->tested & TEST_OK_ERASE)) ||
		    (!(flash->tested & TEST_BAD_WRITE) && !(flash->tested & TEST_OK_WRITE))) {
1581
			msg_cinfo("This flash part has status UNTESTED for operations:");
1582
			if (!(flash->tested & TEST_BAD_PROBE) && !(flash->tested & TEST_OK_PROBE))
1583
				msg_cinfo(" PROBE");
1584
			if (!(flash->tested & TEST_BAD_READ) && !(flash->tested & TEST_OK_READ))
1585
				msg_cinfo(" READ");
1586
			if (!(flash->tested & TEST_BAD_ERASE) && !(flash->tested & TEST_OK_ERASE))
1587
				msg_cinfo(" ERASE");
1588
			if (!(flash->tested & TEST_BAD_WRITE) && !(flash->tested & TEST_OK_WRITE))
1589 1590
				msg_cinfo(" WRITE");
			msg_cinfo("\n");
1591
		}
1592
		/* FIXME: This message is designed towards CLI users. */
1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604
		msg_cinfo("The test status of this chip may have been updated "
			    "in the latest development\n"
			  "version of flashrom. If you are running the latest "
			    "development version,\n"
			  "please email a report to flashrom@flashrom.org if "
			    "any of the above operations\n"
			  "work correctly for you with this flash part. Please "
			    "include the flashrom\n"
			  "output with the additional -V option for all "
			    "operations you tested (-V, -Vr,\n"
			  "-Vw, -VE), and mention which mainboard or "
			    "programmer you tested.\n"
1605 1606
			  "Please mention your board in the subject line. "
			    "Thanks for your help!\n");
1607 1608 1609
	}
}

Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1610 1611
/* FIXME: This function signature needs to be improved once doit() has a better
 * function signature.
1612
 */
1613 1614
int chip_safety_check(struct flashctx *flash, int force, int read_it,
		      int write_it, int erase_it, int verify_it)
1615
{
1616 1617 1618 1619 1620 1621
	if (!programmer_may_write && (write_it || erase_it)) {
		msg_perr("Write/erase is not working yet on your programmer in "
			 "its current configuration.\n");
		/* --force is the wrong approach, but it's the best we can do
		 * until the generic programmer parameter parser is merged.
		 */
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1622
		if (!force)
1623
			return 1;
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1624
		msg_cerr("Continuing anyway.\n");
1625 1626
	}

Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1627 1628 1629 1630 1631
	if (read_it || erase_it || write_it || verify_it) {
		/* Everything needs read. */
		if (flash->tested & TEST_BAD_READ) {
			msg_cerr("Read is not working on this chip. ");
			if (!force)
1632
				return 1;
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1633
			msg_cerr("Continuing anyway.\n");
1634
		}
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1635 1636 1637
		if (!flash->read) {
			msg_cerr("flashrom has no read function for this "
				 "flash chip.\n");
1638
			return 1;
1639
		}
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1640 1641 1642
	}
	if (erase_it || write_it) {
		/* Write needs erase. */
1643
		if (flash->tested & TEST_BAD_ERASE) {
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1644 1645
			msg_cerr("Erase is not working on this chip. ");
			if (!force)
1646
				return 1;
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1647
			msg_cerr("Continuing anyway.\n");
1648
		}
1649
		if(count_usable_erasers(flash) == 0) {
1650 1651 1652 1653
			msg_cerr("flashrom has no erase function for this "
				 "flash chip.\n");
			return 1;
		}
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1654 1655
	}
	if (write_it) {
1656
		if (flash->tested & TEST_BAD_WRITE) {
1657
			msg_cerr("Write is not working on this chip. ");
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1658
			if (!force)
1659
				return 1;
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1660
			msg_cerr("Continuing anyway.\n");
1661
		}
1662
		if (!flash->write) {
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1663 1664
			msg_cerr("flashrom has no write function for this "
				 "flash chip.\n");
1665 1666
			return 1;
		}
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1667 1668 1669 1670 1671 1672 1673 1674
	}
	return 0;
}

/* This function signature is horrible. We need to design a better interface,
 * but right now it allows us to split off the CLI code.
 * Besides that, the function itself is a textbook example of abysmal code flow.
 */
1675 1676
int doit(struct flashctx *flash, int force, const char *filename, int read_it,
	 int write_it, int erase_it, int verify_it)
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1677
{
1678 1679
	uint8_t *oldcontents;
	uint8_t *newcontents;
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1680
	int ret = 0;
1681
	unsigned long size = flash->total_size * 1024;
1682

1683
	if (chip_safety_check(flash, force, read_it, write_it, erase_it, verify_it)) {
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1684
		msg_cerr("Aborting.\n");
1685 1686
		ret = 1;
		goto out_nofree;
1687 1688
	}

Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1689 1690 1691 1692 1693 1694 1695 1696
	/* Given the existence of read locks, we want to unlock for read,
	 * erase and write.
	 */
	if (flash->unlock)
		flash->unlock(flash);

	if (read_it) {
		ret = read_flash_to_file(flash, filename);
1697
		goto out_nofree;
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1698
	}
1699

1700 1701 1702 1703 1704
	oldcontents = malloc(size);
	if (!oldcontents) {
		msg_gerr("Out of memory!\n");
		exit(1);
	}
1705 1706
	/* Assume worst case: All bits are 0. */
	memset(oldcontents, 0x00, size);
1707 1708 1709 1710 1711
	newcontents = malloc(size);
	if (!newcontents) {
		msg_gerr("Out of memory!\n");
		exit(1);
	}
1712 1713 1714 1715 1716 1717 1718 1719
	/* Assume best case: All bits should be 1. */
	memset(newcontents, 0xff, size);
	/* Side effect of the assumptions above: Default write action is erase
	 * because newcontents looks like a completely erased chip, and
	 * oldcontents being completely 0x00 means we have to erase everything
	 * before we can write.
	 */

Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1720
	if (erase_it) {
1721 1722 1723 1724 1725 1726
		/* FIXME: Do we really want the scary warning if erase failed?
		 * After all, after erase the chip is either blank or partially
		 * blank or it has the old contents. A blank chip won't boot,
		 * so if the user wanted erase and reboots afterwards, the user
		 * knows very well that booting won't work.
		 */
1727
		if (erase_and_write_flash(flash, oldcontents, newcontents)) {
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1728
			emergency_help_message();
1729
			ret = 1;
1730
		}
1731
		goto out;
Carl-Daniel Hailfinger's avatar
Carl-Daniel Hailfinger committed
1732 1733 1734
	}

	if (write_it || verify_it) {
1735
		if (read_buf_from_file(newcontents, size, filename)) {
1736 1737
			ret = 1;
			goto out;
1738 1739
		}

1740
#if CONFIG_INTERNAL == 1
1741 1742
		if (programmer == PROGRAMMER_INTERNAL)
			show_id(newcontents, size, force);
1743
#endif
1744
	}
Ronald G. Minnich's avatar
Ronald G. Minnich committed
1745

1746 1747 1748 1749 1750 1751
	/* Read the whole chip to be able to check whether regions need to be
	 * erased and to give better diagnostics in case write fails.
	 * The alternative would be to read only the regions which are to be
	 * preserved, but in that case we might perform unneeded erase which
	 * takes time as well.
	 */
1752
	msg_cinfo("Reading old flash chip contents... ");
1753
	if (flash->read(flash, oldcontents, 0, size)) {
1754
		ret = 1;
1755
		msg_cinfo("FAILED.\n");
1756
		goto out;
1757
	}
1758
	msg_cinfo("done.\n");
1759

1760 1761
	// This should be moved into each flash part's code to do it 
	// cleanly. This does the job.
1762
	handle_romentries(flash, oldcontents, newcontents);
1763

1764
	// ////////////////////////////////////////////////////////////
1765

1766
	if (write_it) {
1767 1768 1769
		if (erase_and_write_flash(flash, oldcontents, newcontents)) {
			msg_cerr("Uh oh. Erase/write failed. Checking if "
				 "anything changed.\n");
1770 1771 1772 1773 1774
			if (!flash->read(flash, newcontents, 0, size)) {
				if (!memcmp(oldcontents, newcontents, size)) {
					msg_cinfo("Good. It seems nothing was "
						  "changed.\n");
					nonfatal_help_message();
1775 1776
					ret = 1;
					goto out;
1777 1778
				}
			}
1779
			emergency_help_message();
1780 1781
			ret = 1;
			goto out;
1782 1783
		}
	}
1784

1785 1786 1787 1788
	if (verify_it) {
		/* Work around chips which need some time to calm down. */
		if (write_it)
			programmer_delay(1000*1000);
1789
		ret = verify_flash(flash, newcontents);
1790
		/* If we tried to write, and verification now fails, we
1791 1792 1793 1794 1795
		 * might have an emergency situation.
		 */
		if (ret && write_it)
			emergency_help_message();
	}
1796

1797 1798 1799 1800
out:
	free(oldcontents);
	free(newcontents);
out_nofree:
1801
	programmer_shutdown();
Stefan Reinauer's avatar
Stefan Reinauer committed
1802
	return ret;
Ronald G. Minnich's avatar
Dammit  
Ronald G. Minnich committed
1803
}