| 1 | /*␊ |
| 2 | * This file is part of the flashrom project.␊ |
| 3 | *␊ |
| 4 | * Copyright (C) 2000 Silicon Integrated System Corporation␊ |
| 5 | * Copyright (C) 2004 Tyan Corp <yhlu@tyan.com>␊ |
| 6 | * Copyright (C) 2005-2008 coresystems GmbH␊ |
| 7 | * Copyright (C) 2008,2009 Carl-Daniel Hailfinger␊ |
| 8 | *␊ |
| 9 | * This program is free software; you can redistribute it and/or modify␊ |
| 10 | * it under the terms of the GNU General Public License as published by␊ |
| 11 | * the Free Software Foundation; either version 2 of the License, or␊ |
| 12 | * (at your option) any later version.␊ |
| 13 | *␊ |
| 14 | * This program is distributed in the hope that it will be useful,␊ |
| 15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of␊ |
| 16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the␊ |
| 17 | * GNU General Public License for more details.␊ |
| 18 | *␊ |
| 19 | * You should have received a copy of the GNU General Public License␊ |
| 20 | * along with this program; if not, write to the Free Software␊ |
| 21 | * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA␊ |
| 22 | */␊ |
| 23 | ␊ |
| 24 | #include <stdio.h>␊ |
| 25 | #include <sys/types.h>␊ |
| 26 | #ifndef __LIBPAYLOAD__␊ |
| 27 | #include <fcntl.h>␊ |
| 28 | #include <sys/stat.h>␊ |
| 29 | #endif␊ |
| 30 | #include <string.h>␊ |
| 31 | #include <stdlib.h>␊ |
| 32 | #include <ctype.h>␊ |
| 33 | #include <getopt.h>␊ |
| 34 | #if HAVE_UTSNAME == 1␊ |
| 35 | #include <sys/utsname.h>␊ |
| 36 | #endif␊ |
| 37 | #include "flash.h"␊ |
| 38 | #include "flashchips.h"␊ |
| 39 | #include "programmer.h"␊ |
| 40 | ␊ |
| 41 | const char flashrom_version[] = FLASHROM_VERSION;␊ |
| 42 | char *chip_to_probe = NULL;␊ |
| 43 | int verbose = 0;␊ |
| 44 | ␊ |
| 45 | static enum programmer programmer = PROGRAMMER_INVALID;␊ |
| 46 | ␊ |
| 47 | static char *programmer_param = NULL;␊ |
| 48 | ␊ |
| 49 | /*␊ |
| 50 | * Programmers supporting multiple buses can have differing size limits on␊ |
| 51 | * each bus. Store the limits for each bus in a common struct.␊ |
| 52 | */␊ |
| 53 | struct decode_sizes max_rom_decode;␊ |
| 54 | ␊ |
| 55 | /* If nonzero, used as the start address of bottom-aligned flash. */␊ |
| 56 | unsigned long flashbase;␊ |
| 57 | ␊ |
| 58 | /* Is writing allowed with this programmer? */␊ |
| 59 | int programmer_may_write;␊ |
| 60 | ␊ |
| 61 | const struct programmer_entry programmer_table[] = {␊ |
| 62 | #if CONFIG_INTERNAL == 1␊ |
| 63 | ␉{␊ |
| 64 | ␉␉.name␉␉␉= "internal",␊ |
| 65 | ␉␉.init␉␉␉= internal_init,␊ |
| 66 | ␉␉.map_flash_region␉= physmap,␊ |
| 67 | ␉␉.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 | ␉␉.map_flash_region␉= dummy_map,␊ |
| 77 | ␉␉.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 | ␉␉.map_flash_region␉= fallback_map,␊ |
| 87 | ␉␉.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 | ␉␉.name␉␉␉= "nicrealtek",␊ |
| 96 | ␉␉//.name␉␉␉= "nicsmc1211",␊ |
| 97 | ␉␉.init␉␉␉= nicrealtek_init,␊ |
| 98 | ␉␉.map_flash_region␉= fallback_map,␊ |
| 99 | ␉␉.unmap_flash_region␉= fallback_unmap,␊ |
| 100 | ␉␉.delay␉␉␉= internal_delay,␊ |
| 101 | ␉},␊ |
| 102 | #endif␊ |
| 103 | ␊ |
| 104 | #if CONFIG_NICNATSEMI == 1␊ |
| 105 | ␉{␊ |
| 106 | ␉␉.name␉␉␉= "nicnatsemi",␊ |
| 107 | ␉␉.init␉␉␉= nicnatsemi_init,␊ |
| 108 | ␉␉.map_flash_region␉= fallback_map,␊ |
| 109 | ␉␉.unmap_flash_region␉= fallback_unmap,␊ |
| 110 | ␉␉.delay␉␉␉= internal_delay,␊ |
| 111 | ␉},␊ |
| 112 | #endif␊ |
| 113 | ␊ |
| 114 | #if CONFIG_GFXNVIDIA == 1␊ |
| 115 | ␉{␊ |
| 116 | ␉␉.name␉␉␉= "gfxnvidia",␊ |
| 117 | ␉␉.init␉␉␉= gfxnvidia_init,␊ |
| 118 | ␉␉.map_flash_region␉= fallback_map,␊ |
| 119 | ␉␉.unmap_flash_region␉= fallback_unmap,␊ |
| 120 | ␉␉.delay␉␉␉= internal_delay,␊ |
| 121 | ␉},␊ |
| 122 | #endif␊ |
| 123 | ␊ |
| 124 | #if CONFIG_DRKAISER == 1␊ |
| 125 | ␉{␊ |
| 126 | ␉␉.name␉␉␉= "drkaiser",␊ |
| 127 | ␉␉.init␉␉␉= drkaiser_init,␊ |
| 128 | ␉␉.map_flash_region␉= fallback_map,␊ |
| 129 | ␉␉.unmap_flash_region␉= fallback_unmap,␊ |
| 130 | ␉␉.delay␉␉␉= internal_delay,␊ |
| 131 | ␉},␊ |
| 132 | #endif␊ |
| 133 | ␊ |
| 134 | #if CONFIG_SATASII == 1␊ |
| 135 | ␉{␊ |
| 136 | ␉␉.name␉␉␉= "satasii",␊ |
| 137 | ␉␉.init␉␉␉= satasii_init,␊ |
| 138 | ␉␉.map_flash_region␉= fallback_map,␊ |
| 139 | ␉␉.unmap_flash_region␉= fallback_unmap,␊ |
| 140 | ␉␉.delay␉␉␉= internal_delay,␊ |
| 141 | ␉},␊ |
| 142 | #endif␊ |
| 143 | ␊ |
| 144 | #if CONFIG_ATAHPT == 1␊ |
| 145 | ␉{␊ |
| 146 | ␉␉.name␉␉␉= "atahpt",␊ |
| 147 | ␉␉.init␉␉␉= atahpt_init,␊ |
| 148 | ␉␉.map_flash_region␉= fallback_map,␊ |
| 149 | ␉␉.unmap_flash_region␉= fallback_unmap,␊ |
| 150 | ␉␉.delay␉␉␉= internal_delay,␊ |
| 151 | ␉},␊ |
| 152 | #endif␊ |
| 153 | ␊ |
| 154 | #if CONFIG_FT2232_SPI == 1␊ |
| 155 | ␉{␊ |
| 156 | ␉␉.name␉␉␉= "ft2232_spi",␊ |
| 157 | ␉␉.init␉␉␉= ft2232_spi_init,␊ |
| 158 | ␉␉.map_flash_region␉= fallback_map,␊ |
| 159 | ␉␉.unmap_flash_region␉= fallback_unmap,␊ |
| 160 | ␉␉.delay␉␉␉= internal_delay,␊ |
| 161 | ␉},␊ |
| 162 | #endif␊ |
| 163 | ␊ |
| 164 | #if CONFIG_SERPROG == 1␊ |
| 165 | ␉{␊ |
| 166 | ␉␉.name␉␉␉= "serprog",␊ |
| 167 | ␉␉.init␉␉␉= serprog_init,␊ |
| 168 | ␉␉.map_flash_region␉= fallback_map,␊ |
| 169 | ␉␉.unmap_flash_region␉= fallback_unmap,␊ |
| 170 | ␉␉.delay␉␉␉= serprog_delay,␊ |
| 171 | ␉},␊ |
| 172 | #endif␊ |
| 173 | ␊ |
| 174 | #if CONFIG_BUSPIRATE_SPI == 1␊ |
| 175 | ␉{␊ |
| 176 | ␉␉.name␉␉␉= "buspirate_spi",␊ |
| 177 | ␉␉.init␉␉␉= buspirate_spi_init,␊ |
| 178 | ␉␉.map_flash_region␉= fallback_map,␊ |
| 179 | ␉␉.unmap_flash_region␉= fallback_unmap,␊ |
| 180 | ␉␉.delay␉␉␉= internal_delay,␊ |
| 181 | ␉},␊ |
| 182 | #endif␊ |
| 183 | ␊ |
| 184 | #if CONFIG_DEDIPROG == 1␊ |
| 185 | ␉{␊ |
| 186 | ␉␉.name␉␉␉= "dediprog",␊ |
| 187 | ␉␉.init␉␉␉= dediprog_init,␊ |
| 188 | ␉␉.map_flash_region␉= fallback_map,␊ |
| 189 | ␉␉.unmap_flash_region␉= fallback_unmap,␊ |
| 190 | ␉␉.delay␉␉␉= internal_delay,␊ |
| 191 | ␉},␊ |
| 192 | #endif␊ |
| 193 | ␊ |
| 194 | #if CONFIG_RAYER_SPI == 1␊ |
| 195 | ␉{␊ |
| 196 | ␉␉.name␉␉␉= "rayer_spi",␊ |
| 197 | ␉␉.init␉␉␉= rayer_spi_init,␊ |
| 198 | ␉␉.map_flash_region␉= fallback_map,␊ |
| 199 | ␉␉.unmap_flash_region␉= fallback_unmap,␊ |
| 200 | ␉␉.delay␉␉␉= internal_delay,␊ |
| 201 | ␉},␊ |
| 202 | #endif␊ |
| 203 | ␊ |
| 204 | #if CONFIG_NICINTEL == 1␊ |
| 205 | ␉{␊ |
| 206 | ␉␉.name␉␉␉= "nicintel",␊ |
| 207 | ␉␉.init␉␉␉= nicintel_init,␊ |
| 208 | ␉␉.map_flash_region␉= fallback_map,␊ |
| 209 | ␉␉.unmap_flash_region␉= fallback_unmap,␊ |
| 210 | ␉␉.delay␉␉␉= internal_delay,␊ |
| 211 | ␉},␊ |
| 212 | #endif␊ |
| 213 | ␊ |
| 214 | #if CONFIG_NICINTEL_SPI == 1␊ |
| 215 | ␉{␊ |
| 216 | ␉␉.name␉␉␉= "nicintel_spi",␊ |
| 217 | ␉␉.init␉␉␉= nicintel_spi_init,␊ |
| 218 | ␉␉.map_flash_region␉= fallback_map,␊ |
| 219 | ␉␉.unmap_flash_region␉= fallback_unmap,␊ |
| 220 | ␉␉.delay␉␉␉= internal_delay,␊ |
| 221 | ␉},␊ |
| 222 | #endif␊ |
| 223 | ␊ |
| 224 | #if CONFIG_OGP_SPI == 1␊ |
| 225 | ␉{␊ |
| 226 | ␉␉.name␉␉␉= "ogp_spi",␊ |
| 227 | ␉␉.init␉␉␉= ogp_spi_init,␊ |
| 228 | ␉␉.map_flash_region␉= fallback_map,␊ |
| 229 | ␉␉.unmap_flash_region␉= fallback_unmap,␊ |
| 230 | ␉␉.delay␉␉␉= internal_delay,␊ |
| 231 | ␉},␊ |
| 232 | #endif␊ |
| 233 | ␊ |
| 234 | #if CONFIG_SATAMV == 1␊ |
| 235 | ␉{␊ |
| 236 | ␉␉.name␉␉␉= "satamv",␊ |
| 237 | ␉␉.init␉␉␉= satamv_init,␊ |
| 238 | ␉␉.map_flash_region␉= fallback_map,␊ |
| 239 | ␉␉.unmap_flash_region␉= fallback_unmap,␊ |
| 240 | ␉␉.delay␉␉␉= internal_delay,␊ |
| 241 | ␉},␊ |
| 242 | #endif␊ |
| 243 | ␊ |
| 244 | #if CONFIG_LINUX_SPI == 1␊ |
| 245 | ␉{␊ |
| 246 | ␉␉.name␉␉␉= "linux_spi",␊ |
| 247 | ␉␉.init␉␉␉= linux_spi_init,␊ |
| 248 | ␉␉.map_flash_region␉= fallback_map,␊ |
| 249 | ␉␉.unmap_flash_region␉= fallback_unmap,␊ |
| 250 | ␉␉.delay␉␉␉= internal_delay,␊ |
| 251 | ␉},␊ |
| 252 | #endif␊ |
| 253 | ␊ |
| 254 | ␉{}, /* This entry corresponds to PROGRAMMER_INVALID. */␊ |
| 255 | };␊ |
| 256 | ␊ |
| 257 | #define SHUTDOWN_MAXFN 32␊ |
| 258 | static int shutdown_fn_count = 0;␊ |
| 259 | struct shutdown_func_data {␊ |
| 260 | ␉int (*func) (void *data);␊ |
| 261 | ␉void *data;␊ |
| 262 | } static shutdown_fn[SHUTDOWN_MAXFN];␊ |
| 263 | /* Initialize to 0 to make sure nobody registers a shutdown function before␊ |
| 264 | * programmer init.␊ |
| 265 | */␊ |
| 266 | static int may_register_shutdown = 0;␊ |
| 267 | ␊ |
| 268 | static int check_block_eraser(const struct flashctx *flash, int k, int log);␊ |
| 269 | ␊ |
| 270 | /* Register a function to be executed on programmer shutdown.␊ |
| 271 | * The advantage over atexit() is that you can supply a void pointer which will␊ |
| 272 | * be used as parameter to the registered function upon programmer shutdown.␊ |
| 273 | * This pointer can point to arbitrary data used by said function, e.g. undo␊ |
| 274 | * information for GPIO settings etc. If unneeded, set data=NULL.␊ |
| 275 | * Please note that the first (void *data) belongs to the function signature of␊ |
| 276 | * the function passed as first parameter.␊ |
| 277 | */␊ |
| 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 | ␉␉␉ SHUTDOWN_MAXFN);␊ |
| 283 | ␉␉return 1;␊ |
| 284 | ␉}␊ |
| 285 | ␉if (!may_register_shutdown) {␊ |
| 286 | ␉␉msg_perr("Tried to register a shutdown function before "␊ |
| 287 | ␉␉␉ "programmer init.\n");␊ |
| 288 | ␉␉return 1;␊ |
| 289 | ␉}␊ |
| 290 | ␉shutdown_fn[shutdown_fn_count].func = function;␊ |
| 291 | ␉shutdown_fn[shutdown_fn_count].data = data;␊ |
| 292 | ␉shutdown_fn_count++;␊ |
| 293 | ␊ |
| 294 | ␉return 0;␊ |
| 295 | }␊ |
| 296 | ␊ |
| 297 | int programmer_init(enum programmer prog, char *param)␊ |
| 298 | {␊ |
| 299 | ␉int ret;␊ |
| 300 | ␊ |
| 301 | ␉if (prog >= PROGRAMMER_INVALID) {␊ |
| 302 | ␉␉msg_perr("Invalid programmer specified!\n");␊ |
| 303 | ␉␉return -1;␊ |
| 304 | ␉}␊ |
| 305 | ␉programmer = prog;␊ |
| 306 | ␉/* Initialize all programmer specific data. */␊ |
| 307 | ␉/* Default to unlimited decode sizes. */␊ |
| 308 | ␉max_rom_decode = (const struct decode_sizes) {␊ |
| 309 | ␉␉.parallel␉= 0xffffffff,␊ |
| 310 | ␉␉.lpc␉␉= 0xffffffff,␊ |
| 311 | ␉␉.fwh␉␉= 0xffffffff,␊ |
| 312 | ␉␉.spi␉␉= 0xffffffff,␊ |
| 313 | ␉};␊ |
| 314 | ␉/* Default to top aligned flash at 4 GB. */␊ |
| 315 | ␉flashbase = 0;␊ |
| 316 | ␉/* Registering shutdown functions is now allowed. */␊ |
| 317 | ␉may_register_shutdown = 1;␊ |
| 318 | ␉/* Default to allowing writes. Broken programmers set this to 0. */␊ |
| 319 | ␉programmer_may_write = 1;␊ |
| 320 | ␊ |
| 321 | ␉programmer_param = param;␊ |
| 322 | ␉msg_pdbg("Initializing %s programmer\n",␊ |
| 323 | ␉␉ programmer_table[programmer].name);␊ |
| 324 | ␉ret = programmer_table[programmer].init();␊ |
| 325 | ␉if (programmer_param && strlen(programmer_param)) {␊ |
| 326 | ␉␉msg_perr("Unhandled programmer parameters: %s\n",␊ |
| 327 | ␉␉␉ programmer_param);␊ |
| 328 | ␉␉/* Do not error out here, the init itself was successful. */␊ |
| 329 | ␉}␊ |
| 330 | ␉return ret;␊ |
| 331 | }␊ |
| 332 | ␊ |
| 333 | int programmer_shutdown(void)␊ |
| 334 | {␊ |
| 335 | ␉int ret = 0;␊ |
| 336 | ␊ |
| 337 | ␉/* Registering shutdown functions is no longer allowed. */␊ |
| 338 | ␉may_register_shutdown = 0;␊ |
| 339 | ␉while (shutdown_fn_count > 0) {␊ |
| 340 | ␉␉int i = --shutdown_fn_count;␊ |
| 341 | ␉␉ret |= shutdown_fn[i].func(shutdown_fn[i].data);␊ |
| 342 | ␉}␊ |
| 343 | ␉return ret;␊ |
| 344 | }␊ |
| 345 | ␊ |
| 346 | void *programmer_map_flash_region(const char *descr, unsigned long phys_addr,␊ |
| 347 | ␉␉␉␉ size_t len)␊ |
| 348 | {␊ |
| 349 | ␉return programmer_table[programmer].map_flash_region(descr,␊ |
| 350 | ␉␉␉␉␉␉␉ phys_addr, len);␊ |
| 351 | }␊ |
| 352 | ␊ |
| 353 | void programmer_unmap_flash_region(void *virt_addr, size_t len)␊ |
| 354 | {␊ |
| 355 | ␉programmer_table[programmer].unmap_flash_region(virt_addr, len);␊ |
| 356 | }␊ |
| 357 | ␊ |
| 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 | void chip_writen(const struct flashctx *flash, uint8_t *buf, chipaddr addr,␊ |
| 374 | ␉␉ 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 | void chip_readn(const struct flashctx *flash, uint8_t *buf, chipaddr addr,␊ |
| 395 | ␉␉size_t len)␊ |
| 396 | {␊ |
| 397 | ␉flash->pgm->par.chip_readn(flash, buf, addr, len);␊ |
| 398 | }␊ |
| 399 | ␊ |
| 400 | void programmer_delay(int usecs)␊ |
| 401 | {␊ |
| 402 | ␉programmer_table[programmer].delay(usecs);␊ |
| 403 | }␊ |
| 404 | ␊ |
| 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. */␊ |
| 410 | ␉flash->virtual_registers = (chipaddr)programmer_map_flash_region("flash chip registers", (0xFFFFFFFF - 0x400000 - size + 1), size);␊ |
| 411 | }␊ |
| 412 | ␊ |
| 413 | int read_memmapped(struct flashctx *flash, uint8_t *buf, unsigned int start,␊ |
| 414 | ␉␉ int unsigned len)␊ |
| 415 | {␊ |
| 416 | ␉chip_readn(flash, buf, flash->virtual_memory + start, len);␊ |
| 417 | ␊ |
| 418 | ␉return 0;␊ |
| 419 | }␊ |
| 420 | ␊ |
| 421 | int min(int a, int b)␊ |
| 422 | {␊ |
| 423 | ␉return (a < b) ? a : b;␊ |
| 424 | }␊ |
| 425 | ␊ |
| 426 | int max(int a, int b)␊ |
| 427 | {␊ |
| 428 | ␉return (a > b) ? a : b;␊ |
| 429 | }␊ |
| 430 | ␊ |
| 431 | int bitcount(unsigned long a)␊ |
| 432 | {␊ |
| 433 | ␉int i = 0;␊ |
| 434 | ␉for (; a != 0; a >>= 1)␊ |
| 435 | ␉␉if (a & 1)␊ |
| 436 | ␉␉␉i++;␊ |
| 437 | ␉return i;␊ |
| 438 | }␊ |
| 439 | ␊ |
| 440 | void tolower_string(char *str)␊ |
| 441 | {␊ |
| 442 | ␉for (; *str != '\0'; str++)␊ |
| 443 | ␉␉*str = (char)tolower((unsigned char)*str);␊ |
| 444 | }␊ |
| 445 | ␊ |
| 446 | char *strcat_realloc(char *dest, const char *src)␊ |
| 447 | {␊ |
| 448 | ␉dest = realloc(dest, strlen(dest) + strlen(src) + 1);␊ |
| 449 | ␉if (!dest) {␊ |
| 450 | ␉␉msg_gerr("Out of memory!\n");␊ |
| 451 | ␉␉return NULL;␊ |
| 452 | ␉}␊ |
| 453 | ␉strcat(dest, src);␊ |
| 454 | ␉return dest;␊ |
| 455 | }␊ |
| 456 | ␊ |
| 457 | /* This is a somewhat hacked function similar in some ways to strtok().␊ |
| 458 | * It will look for needle with a subsequent '=' in haystack, return a copy of␊ |
| 459 | * needle and remove everything from the first occurrence of needle to the next␊ |
| 460 | * delimiter from haystack.␊ |
| 461 | */␊ |
| 462 | char *extract_param(char **haystack, const char *needle, const char *delim)␊ |
| 463 | {␊ |
| 464 | ␉char *param_pos, *opt_pos, *rest;␊ |
| 465 | ␉char *opt = NULL;␊ |
| 466 | ␉int optlen;␊ |
| 467 | ␉int needlelen;␊ |
| 468 | ␊ |
| 469 | ␉needlelen = strlen(needle);␊ |
| 470 | ␉if (!needlelen) {␊ |
| 471 | ␉␉msg_gerr("%s: empty needle! Please report a bug at "␊ |
| 472 | ␉␉␉ "flashrom@flashrom.org\n", __func__);␊ |
| 473 | ␉␉return NULL;␊ |
| 474 | ␉}␊ |
| 475 | ␉/* No programmer parameters given. */␊ |
| 476 | ␉if (*haystack == NULL)␊ |
| 477 | ␉␉return NULL;␊ |
| 478 | ␉param_pos = strstr(*haystack, needle);␊ |
| 479 | ␉do {␊ |
| 480 | ␉␉if (!param_pos)␊ |
| 481 | ␉␉␉return NULL;␊ |
| 482 | ␉␉/* Needle followed by '='? */␊ |
| 483 | ␉␉if (param_pos[needlelen] == '=') {␊ |
| 484 | ␉␉␉␊ |
| 485 | ␉␉␉/* Beginning of the string? */␊ |
| 486 | ␉␉␉if (param_pos == *haystack)␊ |
| 487 | ␉␉␉␉break;␊ |
| 488 | ␉␉␉/* After a delimiter? */␊ |
| 489 | ␉␉␉if (strchr(delim, *(param_pos - 1)))␊ |
| 490 | ␉␉␉␉break;␊ |
| 491 | ␉␉}␊ |
| 492 | ␉␉/* Continue searching. */␊ |
| 493 | ␉␉param_pos++;␊ |
| 494 | ␉␉param_pos = strstr(param_pos, needle);␊ |
| 495 | ␉} while (1);␊ |
| 496 | ␊ |
| 497 | ␉if (param_pos) {␊ |
| 498 | ␉␉/* Get the string after needle and '='. */␊ |
| 499 | ␉␉opt_pos = param_pos + needlelen + 1;␊ |
| 500 | ␉␉optlen = strcspn(opt_pos, delim);␊ |
| 501 | ␉␉/* Return an empty string if the parameter was empty. */␊ |
| 502 | ␉␉opt = malloc(optlen + 1);␊ |
| 503 | ␉␉if (!opt) {␊ |
| 504 | ␉␉␉msg_gerr("Out of memory!\n");␊ |
| 505 | ␉␉␉exit(1);␊ |
| 506 | ␉␉}␊ |
| 507 | ␉␉strncpy(opt, opt_pos, optlen);␊ |
| 508 | ␉␉opt[optlen] = '\0';␊ |
| 509 | ␉␉rest = opt_pos + optlen;␊ |
| 510 | ␉␉/* Skip all delimiters after the current parameter. */␊ |
| 511 | ␉␉rest += strspn(rest, delim);␊ |
| 512 | ␉␉memmove(param_pos, rest, strlen(rest) + 1);␊ |
| 513 | ␉␉/* 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 | ␉return extract_param(&programmer_param, param_name, ",");␊ |
| 522 | }␊ |
| 523 | ␊ |
| 524 | /* Returns the number of well-defined erasers for a chip. */␊ |
| 525 | static unsigned int count_usable_erasers(const struct flashctx *flash)␊ |
| 526 | {␊ |
| 527 | ␉unsigned int usable_erasefunctions = 0;␊ |
| 528 | ␉int k;␊ |
| 529 | ␉for (k = 0; k < NUM_ERASEFUNCTIONS; k++) {␊ |
| 530 | ␉␉if (!check_block_eraser(flash, k, 0))␊ |
| 531 | ␉␉␉usable_erasefunctions++;␊ |
| 532 | ␉}␊ |
| 533 | ␉return usable_erasefunctions;␊ |
| 534 | }␊ |
| 535 | ␊ |
| 536 | /* start is an offset to the base address of the flash chip */␊ |
| 537 | int check_erased_range(struct flashctx *flash, unsigned int start,␊ |
| 538 | ␉␉ unsigned int len)␊ |
| 539 | {␊ |
| 540 | ␉int ret;␊ |
| 541 | ␉uint8_t *cmpbuf = malloc(len);␊ |
| 542 | ␊ |
| 543 | ␉if (!cmpbuf) {␊ |
| 544 | ␉␉msg_gerr("Could not allocate memory!\n");␊ |
| 545 | ␉␉exit(1);␊ |
| 546 | ␉}␊ |
| 547 | ␉memset(cmpbuf, 0xff, len);␊ |
| 548 | ␉ret = verify_range(flash, cmpbuf, start, len, "ERASE");␊ |
| 549 | ␉free(cmpbuf);␊ |
| 550 | ␉return ret;␊ |
| 551 | }␊ |
| 552 | ␊ |
| 553 | /*␊ |
| 554 | * @cmpbuf␉buffer to compare against, cmpbuf[0] is expected to match the␊ |
| 555 | *␉␉flash content at location start␊ |
| 556 | * @start␉offset to the base address of the flash chip␊ |
| 557 | * @len␉␉length of the verified area␊ |
| 558 | * @message␉string to print in the "FAILED" message␊ |
| 559 | * @return␉0 for success, -1 for failure␊ |
| 560 | */␊ |
| 561 | int verify_range(struct flashctx *flash, uint8_t *cmpbuf, unsigned int start,␊ |
| 562 | ␉␉ unsigned int len, const char *message)␊ |
| 563 | {␊ |
| 564 | ␉unsigned int i;␊ |
| 565 | ␉uint8_t *readbuf = malloc(len);␊ |
| 566 | ␉int ret = 0, failcount = 0;␊ |
| 567 | ␊ |
| 568 | ␉if (!len)␊ |
| 569 | ␉␉goto out_free;␊ |
| 570 | ␊ |
| 571 | ␉if (!flash->read) {␊ |
| 572 | ␉␉msg_cerr("ERROR: flashrom has no read function for this flash chip.\n");␊ |
| 573 | ␉␉return 1;␊ |
| 574 | ␉}␊ |
| 575 | ␉if (!readbuf) {␊ |
| 576 | ␉␉msg_gerr("Could not allocate memory!\n");␊ |
| 577 | ␉␉exit(1);␊ |
| 578 | ␉}␊ |
| 579 | ␊ |
| 580 | ␉if (start + len > flash->total_size * 1024) {␊ |
| 581 | ␉␉msg_gerr("Error: %s called with start 0x%x + len 0x%x >"␊ |
| 582 | ␉␉␉" total_size 0x%x\n", __func__, start, len,␊ |
| 583 | ␉␉␉flash->total_size * 1024);␊ |
| 584 | ␉␉ret = -1;␊ |
| 585 | ␉␉goto out_free;␊ |
| 586 | ␉}␊ |
| 587 | ␉if (!message)␊ |
| 588 | ␉␉message = "VERIFY";␊ |
| 589 | ␊ |
| 590 | ␉ret = flash->read(flash, readbuf, start, len);␊ |
| 591 | ␉if (ret) {␊ |
| 592 | ␉␉msg_gerr("Verification impossible because read failed "␊ |
| 593 | ␉␉␉ "at 0x%x (len 0x%x)\n", start, len);␊ |
| 594 | ␉␉return ret;␊ |
| 595 | ␉}␊ |
| 596 | ␊ |
| 597 | ␉for (i = 0; i < len; i++) {␊ |
| 598 | ␉␉if (cmpbuf[i] != readbuf[i]) {␊ |
| 599 | ␉␉␉/* Only print the first failure. */␊ |
| 600 | ␉␉␉if (!failcount++)␊ |
| 601 | ␉␉␉␉msg_cerr("%s FAILED at 0x%08x! "␊ |
| 602 | ␉␉␉␉␉ "Expected=0x%02x, Read=0x%02x,",␊ |
| 603 | ␉␉␉␉␉ message, start + i, cmpbuf[i],␊ |
| 604 | ␉␉␉␉␉ 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 | ␉␉ret = -1;␊ |
| 611 | ␉}␊ |
| 612 | ␊ |
| 613 | out_free:␊ |
| 614 | ␉free(readbuf);␊ |
| 615 | ␉return ret;␊ |
| 616 | }␊ |
| 617 | ␊ |
| 618 | /*␊ |
| 619 | * Check if the buffer @have can be programmed to the content of @want without␊ |
| 620 | * erasing. This is only possible if all chunks of size @gran are either kept␊ |
| 621 | * as-is or changed from an all-ones state to any other state.␊ |
| 622 | *␊ |
| 623 | * The following write granularities (enum @gran) are known:␊ |
| 624 | * - 1 bit. Each bit can be cleared individually.␊ |
| 625 | * - 1 byte. A byte can be written once. Further writes to an already written␊ |
| 626 | * byte cause the contents to be either undefined or to stay unchanged.␊ |
| 627 | * - 128 bytes. If less than 128 bytes are written, the rest will be␊ |
| 628 | * erased. Each write to a 128-byte region will trigger an automatic erase␊ |
| 629 | * before anything is written. Very uncommon behaviour and unsupported by␊ |
| 630 | * this function.␊ |
| 631 | * - 256 bytes. If less than 256 bytes are written, the contents of the␊ |
| 632 | * unwritten bytes are undefined.␊ |
| 633 | * Warning: This function assumes that @have and @want point to naturally␊ |
| 634 | * aligned regions.␊ |
| 635 | *␊ |
| 636 | * @have buffer with current content␊ |
| 637 | * @want buffer with desired content␊ |
| 638 | * @len␉␉length of the checked area␊ |
| 639 | * @gran␉write granularity (enum, not count)␊ |
| 640 | * @return 0 if no erase is needed, 1 otherwise␊ |
| 641 | */␊ |
| 642 | int need_erase(uint8_t *have, uint8_t *want, unsigned int len, enum write_granularity gran)␊ |
| 643 | {␊ |
| 644 | ␉int result = 0;␊ |
| 645 | ␉unsigned int i, j, limit;␊ |
| 646 | ␊ |
| 647 | ␉switch (gran) {␊ |
| 648 | ␉case write_gran_1bit:␊ |
| 649 | ␉␉for (i = 0; i < len; i++)␊ |
| 650 | ␉␉␉if ((have[i] & want[i]) != want[i]) {␊ |
| 651 | ␉␉␉␉result = 1;␊ |
| 652 | ␉␉␉␉break;␊ |
| 653 | ␉␉␉}␊ |
| 654 | ␉␉break;␊ |
| 655 | ␉case write_gran_1byte:␊ |
| 656 | ␉␉for (i = 0; i < len; i++)␊ |
| 657 | ␉␉␉if ((have[i] != want[i]) && (have[i] != 0xff)) {␊ |
| 658 | ␉␉␉␉result = 1;␊ |
| 659 | ␉␉␉␉break;␊ |
| 660 | ␉␉␉}␊ |
| 661 | ␉␉break;␊ |
| 662 | ␉case write_gran_256bytes:␊ |
| 663 | ␉␉for (j = 0; j < len / 256; j++) {␊ |
| 664 | ␉␉␉limit = min (256, len - j * 256);␊ |
| 665 | ␉␉␉/* Are 'have' and 'want' identical? */␊ |
| 666 | ␉␉␉if (!memcmp(have + j * 256, want + j * 256, limit))␊ |
| 667 | ␉␉␉␉continue;␊ |
| 668 | ␉␉␉/* have needs to be in erased state. */␊ |
| 669 | ␉␉␉for (i = 0; i < limit; i++)␊ |
| 670 | ␉␉␉␉if (have[j * 256 + i] != 0xff) {␊ |
| 671 | ␉␉␉␉␉result = 1;␊ |
| 672 | ␉␉␉␉␉break;␊ |
| 673 | ␉␉␉␉}␊ |
| 674 | ␉␉␉if (result)␊ |
| 675 | ␉␉␉␉break;␊ |
| 676 | ␉␉}␊ |
| 677 | ␉␉break;␊ |
| 678 | ␉default:␊ |
| 679 | ␉␉msg_cerr("%s: Unsupported granularity! Please report a bug at "␊ |
| 680 | ␉␉␉ "flashrom@flashrom.org\n", __func__);␊ |
| 681 | ␉}␊ |
| 682 | ␉return result;␊ |
| 683 | }␊ |
| 684 | ␊ |
| 685 | /**␊ |
| 686 | * Check if the buffer @have needs to be programmed to get the content of @want.␊ |
| 687 | * If yes, return 1 and fill in first_start with the start address of the␊ |
| 688 | * write operation and first_len with the length of the first to-be-written␊ |
| 689 | * chunk. If not, return 0 and leave first_start and first_len undefined.␊ |
| 690 | *␊ |
| 691 | * Warning: This function assumes that @have and @want point to naturally␊ |
| 692 | * aligned regions.␊ |
| 693 | *␊ |
| 694 | * @have␉buffer with current content␊ |
| 695 | * @want␉buffer with desired content␊ |
| 696 | * @len␉␉length of the checked area␊ |
| 697 | * @gran␉write granularity (enum, not count)␊ |
| 698 | * @first_start␉offset of the first byte which needs to be written (passed in␊ |
| 699 | *␉␉value is increased by the offset of the first needed write␊ |
| 700 | *␉␉relative to have/want or unchanged if no write is needed)␊ |
| 701 | * @return␉length of the first contiguous area which needs to be written␊ |
| 702 | *␉␉0 if no write is needed␊ |
| 703 | *␊ |
| 704 | * FIXME: This function needs a parameter which tells it about coalescing␊ |
| 705 | * in relation to the max write length of the programmer and the max write␊ |
| 706 | * length of the chip.␊ |
| 707 | */␊ |
| 708 | static unsigned int get_next_write(uint8_t *have, uint8_t *want, unsigned int len,␊ |
| 709 | ␉␉␉ unsigned int *first_start,␊ |
| 710 | ␉␉␉ enum write_granularity gran)␊ |
| 711 | {␊ |
| 712 | ␉int need_write = 0;␊ |
| 713 | ␉unsigned int rel_start = 0, first_len = 0;␊ |
| 714 | ␉unsigned int i, limit, stride;␊ |
| 715 | ␊ |
| 716 | ␉switch (gran) {␊ |
| 717 | ␉case write_gran_1bit:␊ |
| 718 | ␉case write_gran_1byte:␊ |
| 719 | ␉␉stride = 1;␊ |
| 720 | ␉␉break;␊ |
| 721 | ␉case write_gran_256bytes:␊ |
| 722 | ␉␉stride = 256;␊ |
| 723 | ␉␉break;␊ |
| 724 | ␉default:␊ |
| 725 | ␉␉msg_cerr("%s: Unsupported granularity! Please report a bug at "␊ |
| 726 | ␉␉␉ "flashrom@flashrom.org\n", __func__);␊ |
| 727 | ␉␉/* Claim that no write was needed. A write with unknown␊ |
| 728 | ␉␉ * granularity is too dangerous to try.␊ |
| 729 | ␉␉ */␊ |
| 730 | ␉␉return 0;␊ |
| 731 | ␉}␊ |
| 732 | ␉for (i = 0; i < len / stride; i++) {␊ |
| 733 | ␉␉limit = min(stride, len - i * stride);␊ |
| 734 | ␉␉/* Are 'have' and 'want' identical? */␊ |
| 735 | ␉␉if (memcmp(have + i * stride, want + i * stride, limit)) {␊ |
| 736 | ␉␉␉if (!need_write) {␊ |
| 737 | ␉␉␉␉/* First location where have and want differ. */␊ |
| 738 | ␉␉␉␉need_write = 1;␊ |
| 739 | ␉␉␉␉rel_start = i * stride;␊ |
| 740 | ␉␉␉}␊ |
| 741 | ␉␉} else {␊ |
| 742 | ␉␉␉if (need_write) {␊ |
| 743 | ␉␉␉␉/* First location where have and want␊ |
| 744 | ␉␉␉␉ * do not differ anymore.␊ |
| 745 | ␉␉␉␉ */␊ |
| 746 | ␉␉␉␉break;␊ |
| 747 | ␉␉␉}␊ |
| 748 | ␉␉}␊ |
| 749 | ␉}␊ |
| 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 | /* This function generates various test patterns useful for testing controller␊ |
| 757 | * and chip communication as well as chip behaviour.␊ |
| 758 | *␊ |
| 759 | * If a byte can be written multiple times, each time keeping 0-bits at 0␊ |
| 760 | * and changing 1-bits to 0 if the new value for that bit is 0, the effect␊ |
| 761 | * is essentially an AND operation. That's also the reason why this function␊ |
| 762 | * provides the result of AND between various patterns.␊ |
| 763 | *␊ |
| 764 | * Below is a list of patterns (and their block length).␊ |
| 765 | * Pattern 0 is 05 15 25 35 45 55 65 75 85 95 a5 b5 c5 d5 e5 f5 (16 Bytes)␊ |
| 766 | * Pattern 1 is 0a 1a 2a 3a 4a 5a 6a 7a 8a 9a aa ba ca da ea fa (16 Bytes)␊ |
| 767 | * Pattern 2 is 50 51 52 53 54 55 56 57 58 59 5a 5b 5c 5d 5e 5f (16 Bytes)␊ |
| 768 | * Pattern 3 is a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 aa ab ac ad ae af (16 Bytes)␊ |
| 769 | * Pattern 4 is 00 10 20 30 40 50 60 70 80 90 a0 b0 c0 d0 e0 f0 (16 Bytes)␊ |
| 770 | * Pattern 5 is 00 01 02 03 04 05 06 07 08 09 0a 0b 0c 0d 0e 0f (16 Bytes)␊ |
| 771 | * Pattern 6 is 00 (1 Byte)␊ |
| 772 | * Pattern 7 is ff (1 Byte)␊ |
| 773 | * Patterns 0-7 have a big-endian block number in the last 2 bytes of each 256␊ |
| 774 | * byte block.␊ |
| 775 | *␊ |
| 776 | * Pattern 8 is 00 01 02 03 04 05 06 07 08 09 0a 0b 0c 0d 0e 0f 10 11... (256 B)␊ |
| 777 | * Pattern 9 is ff fe fd fc fb fa f9 f8 f7 f6 f5 f4 f3 f2 f1 f0 ef ee... (256 B)␊ |
| 778 | * Pattern 10 is 00 00 00 01 00 02 00 03 00 04... (128 kB big-endian counter)␊ |
| 779 | * Pattern 11 is ff ff ff fe ff fd ff fc ff fb... (128 kB big-endian downwards)␊ |
| 780 | * Pattern 12 is 00 (1 Byte)␊ |
| 781 | * Pattern 13 is ff (1 Byte)␊ |
| 782 | * Patterns 8-13 have no block number.␊ |
| 783 | *␊ |
| 784 | * Patterns 0-3 are created to detect and efficiently diagnose communication␊ |
| 785 | * slips like missed bits or bytes and their repetitive nature gives good visual␊ |
| 786 | * cues to the person inspecting the results. In addition, the following holds:␊ |
| 787 | * AND Pattern 0/1 == Pattern 4␊ |
| 788 | * AND Pattern 2/3 == Pattern 5␊ |
| 789 | * AND Pattern 0/1/2/3 == AND Pattern 4/5 == Pattern 6␊ |
| 790 | * A weakness of pattern 0-5 is the inability to detect swaps/copies between␊ |
| 791 | * any two 16-byte blocks except for the last 16-byte block in a 256-byte bloc.␊ |
| 792 | * They work perfectly for detecting any swaps/aliasing of blocks >= 256 bytes.␊ |
| 793 | * 0x5 and 0xa were picked because they are 0101 and 1010 binary.␊ |
| 794 | * Patterns 8-9 are best for detecting swaps/aliasing of blocks < 256 bytes.␊ |
| 795 | * Besides that, they provide for bit testing of the last two bytes of every␊ |
| 796 | * 256 byte block which contains the block number for patterns 0-6.␊ |
| 797 | * Patterns 10-11 are special purpose for detecting subblock aliasing with␊ |
| 798 | * block sizes >256 bytes (some Dataflash chips etc.)␊ |
| 799 | * AND Pattern 8/9 == Pattern 12␊ |
| 800 | * AND Pattern 10/11 == Pattern 12␊ |
| 801 | * Pattern 13 is the completely erased state.␊ |
| 802 | * None of the patterns can detect aliasing at boundaries which are a multiple␊ |
| 803 | * of 16 MBytes (but such chips do not exist anyway for Parallel/LPC/FWH/SPI).␊ |
| 804 | */␊ |
| 805 | int generate_testpattern(uint8_t *buf, uint32_t size, int variant)␊ |
| 806 | {␊ |
| 807 | ␉int i;␊ |
| 808 | ␊ |
| 809 | ␉if (!buf) {␊ |
| 810 | ␉␉msg_gerr("Invalid buffer!\n");␊ |
| 811 | ␉␉return 1;␊ |
| 812 | ␉}␊ |
| 813 | ␊ |
| 814 | ␉switch (variant) {␊ |
| 815 | ␉case 0:␊ |
| 816 | ␉␉for (i = 0; i < size; i++)␊ |
| 817 | ␉␉␉buf[i] = (i & 0xf) << 4 | 0x5;␊ |
| 818 | ␉␉break;␊ |
| 819 | ␉case 1:␊ |
| 820 | ␉␉for (i = 0; i < size; i++)␊ |
| 821 | ␉␉␉buf[i] = (i & 0xf) << 4 | 0xa;␊ |
| 822 | ␉␉break;␊ |
| 823 | ␉case 2:␊ |
| 824 | ␉␉for (i = 0; i < size; i++)␊ |
| 825 | ␉␉␉buf[i] = 0x50 | (i & 0xf);␊ |
| 826 | ␉␉break;␊ |
| 827 | ␉case 3:␊ |
| 828 | ␉␉for (i = 0; i < size; i++)␊ |
| 829 | ␉␉␉buf[i] = 0xa0 | (i & 0xf);␊ |
| 830 | ␉␉break;␊ |
| 831 | ␉case 4:␊ |
| 832 | ␉␉for (i = 0; i < size; i++)␊ |
| 833 | ␉␉␉buf[i] = (i & 0xf) << 4;␊ |
| 834 | ␉␉break;␊ |
| 835 | ␉case 5:␊ |
| 836 | ␉␉for (i = 0; i < size; i++)␊ |
| 837 | ␉␉␉buf[i] = i & 0xf;␊ |
| 838 | ␉␉break;␊ |
| 839 | ␉case 6:␊ |
| 840 | ␉␉memset(buf, 0x00, size);␊ |
| 841 | ␉␉break;␊ |
| 842 | ␉case 7:␊ |
| 843 | ␉␉memset(buf, 0xff, size);␊ |
| 844 | ␉␉break;␊ |
| 845 | ␉case 8:␊ |
| 846 | ␉␉for (i = 0; i < size; i++)␊ |
| 847 | ␉␉␉buf[i] = i & 0xff;␊ |
| 848 | ␉␉break;␊ |
| 849 | ␉case 9:␊ |
| 850 | ␉␉for (i = 0; i < size; i++)␊ |
| 851 | ␉␉␉buf[i] = ~(i & 0xff);␊ |
| 852 | ␉␉break;␊ |
| 853 | ␉case 10:␊ |
| 854 | ␉␉for (i = 0; i < size % 2; i++) {␊ |
| 855 | ␉␉␉buf[i * 2] = (i >> 8) & 0xff;␊ |
| 856 | ␉␉␉buf[i * 2 + 1] = i & 0xff;␊ |
| 857 | ␉␉}␊ |
| 858 | ␉␉if (size & 0x1)␊ |
| 859 | ␉␉␉buf[i * 2] = (i >> 8) & 0xff;␊ |
| 860 | ␉␉break;␊ |
| 861 | ␉case 11:␊ |
| 862 | ␉␉for (i = 0; i < size % 2; i++) {␊ |
| 863 | ␉␉␉buf[i * 2] = ~((i >> 8) & 0xff);␊ |
| 864 | ␉␉␉buf[i * 2 + 1] = ~(i & 0xff);␊ |
| 865 | ␉␉}␊ |
| 866 | ␉␉if (size & 0x1)␊ |
| 867 | ␉␉␉buf[i * 2] = ~((i >> 8) & 0xff);␊ |
| 868 | ␉␉break;␊ |
| 869 | ␉case 12:␊ |
| 870 | ␉␉memset(buf, 0x00, size);␊ |
| 871 | ␉␉break;␊ |
| 872 | ␉case 13:␊ |
| 873 | ␉␉memset(buf, 0xff, size);␊ |
| 874 | ␉␉break;␊ |
| 875 | ␉}␊ |
| 876 | ␊ |
| 877 | ␉if ((variant >= 0) && (variant <= 7)) {␊ |
| 878 | ␉␉/* Write block number in the last two bytes of each 256-byte␊ |
| 879 | ␉␉ * block, big endian for easier reading of the hexdump.␊ |
| 880 | ␉␉ * Note that this wraps around for chips larger than 2^24 bytes␊ |
| 881 | ␉␉ * (16 MB).␊ |
| 882 | ␉␉ */␊ |
| 883 | ␉␉for (i = 0; i < size / 256; i++) {␊ |
| 884 | ␉␉␉buf[i * 256 + 254] = (i >> 8) & 0xff;␊ |
| 885 | ␉␉␉buf[i * 256 + 255] = i & 0xff;␊ |
| 886 | ␉␉}␊ |
| 887 | ␉}␊ |
| 888 | ␊ |
| 889 | ␉return 0;␊ |
| 890 | }␊ |
| 891 | ␊ |
| 892 | int check_max_decode(enum chipbustype buses, uint32_t size)␊ |
| 893 | {␊ |
| 894 | ␉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 | ␉␉␉ "size %u kB of chipset/board/programmer "␊ |
| 900 | ␉␉␉ "for %s interface, "␊ |
| 901 | ␉␉␉ "probe/read/erase/write may fail. ", size / 1024,␊ |
| 902 | ␉␉␉ 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 | ␉␉␉ "size %u kB of chipset/board/programmer "␊ |
| 908 | ␉␉␉ "for %s interface, "␊ |
| 909 | ␉␉␉ "probe/read/erase/write may fail. ", size / 1024,␊ |
| 910 | ␉␉␉ 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 | ␉␉␉ "size %u kB of chipset/board/programmer "␊ |
| 916 | ␉␉␉ "for %s interface, "␊ |
| 917 | ␉␉␉ "probe/read/erase/write may fail. ", size / 1024,␊ |
| 918 | ␉␉␉ 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 | ␉␉␉ "size %u kB of chipset/board/programmer "␊ |
| 924 | ␉␉␉ "for %s interface, "␊ |
| 925 | ␉␉␉ "probe/read/erase/write may fail. ", size / 1024,␊ |
| 926 | ␉␉␉ max_rom_decode.spi / 1024, "SPI");␊ |
| 927 | ␉}␊ |
| 928 | ␉if (!limitexceeded)␊ |
| 929 | ␉␉return 0;␊ |
| 930 | ␉/* Sometimes chip and programmer have more than one bus in common,␊ |
| 931 | ␉ * and the limit is not exceeded on all buses. Tell the user.␊ |
| 932 | ␉ */␊ |
| 933 | ␉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 | ␉␉␉ "interface which can support a chip of this size. "␊ |
| 937 | ␉␉␉ "You can try --force at your own risk.\n");␊ |
| 938 | ␉return 1;␊ |
| 939 | }␊ |
| 940 | ␊ |
| 941 | int probe_flash(struct registered_programmer *pgm, int startchip,␊ |
| 942 | ␉␉struct flashctx *fill_flash, int force)␊ |
| 943 | {␊ |
| 944 | ␉const struct flashchip *flash;␊ |
| 945 | ␉unsigned long base = 0;␊ |
| 946 | ␉char location[64];␊ |
| 947 | ␉uint32_t size;␊ |
| 948 | ␉enum chipbustype buses_common;␊ |
| 949 | ␉char *tmp;␊ |
| 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 | ␉␉buses_common = pgm->buses_supported & flash->bustype;␊ |
| 955 | ␉␉if (!buses_common)␊ |
| 956 | ␉␉␉continue;␊ |
| 957 | ␉␉msg_gdbg("Probing for %s %s, %d kB: ",␊ |
| 958 | ␉␉␉ flash->vendor, flash->name, flash->total_size);␊ |
| 959 | ␉␉if (!flash->probe && !force) {␊ |
| 960 | ␉␉␉msg_gdbg("failed! flashrom has no probe function for "␊ |
| 961 | ␉␉␉␉ "this flash chip.\n");␊ |
| 962 | ␉␉␉continue;␊ |
| 963 | ␉␉}␊ |
| 964 | ␊ |
| 965 | ␉␉size = flash->total_size * 1024;␊ |
| 966 | ␉␉check_max_decode(buses_common, size);␊ |
| 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 | ␉␉if (force)␊ |
| 976 | ␉␉␉break;␊ |
| 977 | ␊ |
| 978 | ␉␉if (fill_flash->probe(fill_flash) != 1)␊ |
| 979 | ␉␉␉goto notfound;␊ |
| 980 | ␊ |
| 981 | ␉␉/* If this is the first chip found, accept it.␊ |
| 982 | ␉␉ * If this is not the first chip found, accept it only if it is␊ |
| 983 | ␉␉ * a non-generic match.␊ |
| 984 | ␉␉ * We could either make chipcount global or provide it as␊ |
| 985 | ␉␉ * parameter, or we assume that startchip==0 means this call to␊ |
| 986 | ␉␉ * probe_flash() is the first one and thus no chip has been␊ |
| 987 | ␉␉ * found before.␊ |
| 988 | ␉␉ */␊ |
| 989 | ␉␉if (startchip == 0 || fill_flash->model_id != GENERIC_DEVICE_ID)␊ |
| 990 | ␉␉␉break;␊ |
| 991 | ␊ |
| 992 | notfound:␊ |
| 993 | ␉␉programmer_unmap_flash_region((void *)fill_flash->virtual_memory, size);␊ |
| 994 | ␉}␊ |
| 995 | ␊ |
| 996 | ␉if (!flash || !flash->name)␊ |
| 997 | ␉␉return -1;␊ |
| 998 | ␊ |
| 999 | #if CONFIG_INTERNAL == 1␊ |
| 1000 | ␉if (programmer_table[programmer].map_flash_region == physmap)␊ |
| 1001 | ␉␉snprintf(location, sizeof(location), "at physical address 0x%lx", base);␊ |
| 1002 | ␉else␊ |
| 1003 | #endif␊ |
| 1004 | ␉␉snprintf(location, sizeof(location), "on %s", programmer_table[programmer].name);␊ |
| 1005 | ␊ |
| 1006 | ␉tmp = flashbuses_to_text(flash->bustype);␊ |
| 1007 | ␉msg_cinfo("%s %s flash chip \"%s\" (%d kB, %s) %s.\n",␊ |
| 1008 | ␉␉ force ? "Assuming" : "Found", fill_flash->vendor,␊ |
| 1009 | ␉␉ fill_flash->name, fill_flash->total_size, tmp, location);␊ |
| 1010 | ␉free(tmp);␊ |
| 1011 | ␊ |
| 1012 | ␉/* Flash registers will not be mapped if the chip was forced. Lock info␊ |
| 1013 | ␉ * may be stored in registers, so avoid lock info printing.␊ |
| 1014 | ␉ */␊ |
| 1015 | ␉if (!force)␊ |
| 1016 | ␉␉if (fill_flash->printlock)␊ |
| 1017 | ␉␉␉fill_flash->printlock(fill_flash);␊ |
| 1018 | ␊ |
| 1019 | ␉/* Return position of matching chip. */␊ |
| 1020 | ␉return flash - flashchips;␊ |
| 1021 | }␊ |
| 1022 | ␊ |
| 1023 | int verify_flash(struct flashctx *flash, uint8_t *buf)␊ |
| 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;␊ |
| 1036 | }␊ |
| 1037 | ␊ |
| 1038 | int read_buf_from_file(unsigned char *buf, unsigned long size,␊ |
| 1039 | ␉␉ const char *filename)␊ |
| 1040 | {␊ |
| 1041 | ␉unsigned long numbytes;␊ |
| 1042 | ␉FILE *image;␊ |
| 1043 | ␉struct stat image_stat;␊ |
| 1044 | ␊ |
| 1045 | ␉if ((image = fopen(filename, "rb")) == NULL) {␊ |
| 1046 | ␉␉perror(filename);␊ |
| 1047 | ␉␉return 1;␊ |
| 1048 | ␉}␊ |
| 1049 | ␉if (fstat(fileno(image), &image_stat) != 0) {␊ |
| 1050 | ␉␉perror(filename);␊ |
| 1051 | ␉␉fclose(image);␊ |
| 1052 | ␉␉return 1;␊ |
| 1053 | ␉}␊ |
| 1054 | ␉if (image_stat.st_size != size) {␊ |
| 1055 | ␉␉msg_gerr("Error: Image size doesn't match\n");␊ |
| 1056 | ␉␉fclose(image);␊ |
| 1057 | ␉␉return 1;␊ |
| 1058 | ␉}␊ |
| 1059 | ␉numbytes = fread(buf, 1, size, image);␊ |
| 1060 | ␉if (fclose(image)) {␊ |
| 1061 | ␉␉perror(filename);␊ |
| 1062 | ␉␉return 1;␊ |
| 1063 | ␉}␊ |
| 1064 | ␉if (numbytes != size) {␊ |
| 1065 | ␉␉msg_gerr("Error: Failed to read complete file. Got %ld bytes, "␊ |
| 1066 | ␉␉␉ "wanted %ld!\n", numbytes, size);␊ |
| 1067 | ␉␉return 1;␊ |
| 1068 | ␉}␊ |
| 1069 | ␉return 0;␊ |
| 1070 | }␊ |
| 1071 | ␊ |
| 1072 | int write_buf_to_file(unsigned char *buf, unsigned long size,␊ |
| 1073 | ␉␉ const char *filename)␊ |
| 1074 | {␊ |
| 1075 | ␉unsigned long numbytes;␊ |
| 1076 | ␉FILE *image;␊ |
| 1077 | ␊ |
| 1078 | ␉if (!filename) {␊ |
| 1079 | ␉␉msg_gerr("No filename specified.\n");␊ |
| 1080 | ␉␉return 1;␊ |
| 1081 | ␉}␊ |
| 1082 | ␉if ((image = fopen(filename, "wb")) == NULL) {␊ |
| 1083 | ␉␉perror(filename);␊ |
| 1084 | ␉␉return 1;␊ |
| 1085 | ␉}␊ |
| 1086 | ␊ |
| 1087 | ␉numbytes = fwrite(buf, 1, size, image);␊ |
| 1088 | ␉fclose(image);␊ |
| 1089 | ␉if (numbytes != size) {␊ |
| 1090 | ␉␉msg_gerr("File %s could not be written completely.\n",␊ |
| 1091 | ␉␉␉ filename);␊ |
| 1092 | ␉␉return 1;␊ |
| 1093 | ␉}␊ |
| 1094 | ␉return 0;␊ |
| 1095 | }␊ |
| 1096 | ␊ |
| 1097 | int read_flash_to_file(struct flashctx *flash, const char *filename)␊ |
| 1098 | {␊ |
| 1099 | ␉unsigned long size = flash->total_size * 1024;␊ |
| 1100 | ␉unsigned char *buf = calloc(size, sizeof(char));␊ |
| 1101 | ␉int ret = 0;␊ |
| 1102 | ␊ |
| 1103 | ␉msg_cinfo("Reading flash... ");␊ |
| 1104 | ␉if (!buf) {␊ |
| 1105 | ␉␉msg_gerr("Memory allocation failed!\n");␊ |
| 1106 | ␉␉msg_cinfo("FAILED.\n");␊ |
| 1107 | ␉␉return 1;␊ |
| 1108 | ␉}␊ |
| 1109 | ␉if (!flash->read) {␊ |
| 1110 | ␉␉msg_cerr("No read function available for this flash chip.\n");␊ |
| 1111 | ␉␉ret = 1;␊ |
| 1112 | ␉␉goto out_free;␊ |
| 1113 | ␉}␊ |
| 1114 | ␉if (flash->read(flash, buf, 0, size)) {␊ |
| 1115 | ␉␉msg_cerr("Read operation failed!\n");␊ |
| 1116 | ␉␉ret = 1;␊ |
| 1117 | ␉␉goto out_free;␊ |
| 1118 | ␉}␊ |
| 1119 | ␊ |
| 1120 | ␉ret = write_buf_to_file(buf, size, filename);␊ |
| 1121 | out_free:␊ |
| 1122 | ␉free(buf);␊ |
| 1123 | ␉msg_cinfo("%s.\n", ret ? "FAILED" : "done");␊ |
| 1124 | ␉return ret;␊ |
| 1125 | }␊ |
| 1126 | ␊ |
| 1127 | /* This function shares a lot of its structure with erase_and_write_flash() and␊ |
| 1128 | * walk_eraseregions().␊ |
| 1129 | * Even if an error is found, the function will keep going and check the rest.␊ |
| 1130 | */␊ |
| 1131 | static int selfcheck_eraseblocks(const struct flashchip *flash)␊ |
| 1132 | {␊ |
| 1133 | ␉int i, j, k;␊ |
| 1134 | ␉int ret = 0;␊ |
| 1135 | ␊ |
| 1136 | ␉for (k = 0; k < NUM_ERASEFUNCTIONS; k++) {␊ |
| 1137 | ␉␉unsigned int done = 0;␊ |
| 1138 | ␉␉struct block_eraser eraser = flash->block_erasers[k];␊ |
| 1139 | ␊ |
| 1140 | ␉␉for (i = 0; i < NUM_ERASEREGIONS; i++) {␊ |
| 1141 | ␉␉␉/* Blocks with zero size are bugs in flashchips.c. */␊ |
| 1142 | ␉␉␉if (eraser.eraseblocks[i].count &&␊ |
| 1143 | ␉␉␉ !eraser.eraseblocks[i].size) {␊ |
| 1144 | ␉␉␉␉msg_gerr("ERROR: Flash chip %s erase function "␊ |
| 1145 | ␉␉␉␉␉"%i region %i has size 0. Please report"␊ |
| 1146 | ␉␉␉␉␉" a bug at flashrom@flashrom.org\n",␊ |
| 1147 | ␉␉␉␉␉flash->name, k, i);␊ |
| 1148 | ␉␉␉␉ret = 1;␊ |
| 1149 | ␉␉␉}␊ |
| 1150 | ␉␉␉/* Blocks with zero count are bugs in flashchips.c. */␊ |
| 1151 | ␉␉␉if (!eraser.eraseblocks[i].count &&␊ |
| 1152 | ␉␉␉ eraser.eraseblocks[i].size) {␊ |
| 1153 | ␉␉␉␉msg_gerr("ERROR: Flash chip %s erase function "␊ |
| 1154 | ␉␉␉␉␉"%i region %i has count 0. Please report"␊ |
| 1155 | ␉␉␉␉␉" a bug at flashrom@flashrom.org\n",␊ |
| 1156 | ␉␉␉␉␉flash->name, k, i);␊ |
| 1157 | ␉␉␉␉ret = 1;␊ |
| 1158 | ␉␉␉}␊ |
| 1159 | ␉␉␉done += eraser.eraseblocks[i].count *␊ |
| 1160 | ␉␉␉␉eraser.eraseblocks[i].size;␊ |
| 1161 | ␉␉}␊ |
| 1162 | ␉␉/* Empty eraseblock definition with erase function. */␊ |
| 1163 | ␉␉if (!done && eraser.block_erase)␊ |
| 1164 | ␉␉␉msg_gspew("Strange: Empty eraseblock definition with "␊ |
| 1165 | ␉␉␉␉ "non-empty erase function. Not an error.\n");␊ |
| 1166 | ␉␉if (!done)␊ |
| 1167 | ␉␉␉continue;␊ |
| 1168 | ␉␉if (done != flash->total_size * 1024) {␊ |
| 1169 | ␉␉␉msg_gerr("ERROR: Flash chip %s erase function %i "␊ |
| 1170 | ␉␉␉␉"region walking resulted in 0x%06x bytes total,"␊ |
| 1171 | ␉␉␉␉" expected 0x%06x bytes. Please report a bug at"␊ |
| 1172 | ␉␉␉␉" flashrom@flashrom.org\n", flash->name, k,␊ |
| 1173 | ␉␉␉␉done, flash->total_size * 1024);␊ |
| 1174 | ␉␉␉ret = 1;␊ |
| 1175 | ␉␉}␊ |
| 1176 | ␉␉if (!eraser.block_erase)␊ |
| 1177 | ␉␉␉continue;␊ |
| 1178 | ␉␉/* Check if there are identical erase functions for different␊ |
| 1179 | ␉␉ * layouts. That would imply "magic" erase functions. The␊ |
| 1180 | ␉␉ * easiest way to check this is with function pointers.␊ |
| 1181 | ␉␉ */␊ |
| 1182 | ␉␉for (j = k + 1; j < NUM_ERASEFUNCTIONS; j++) {␊ |
| 1183 | ␉␉␉if (eraser.block_erase ==␊ |
| 1184 | ␉␉␉ flash->block_erasers[j].block_erase) {␊ |
| 1185 | ␉␉␉␉msg_gerr("ERROR: Flash chip %s erase function "␊ |
| 1186 | ␉␉␉␉␉"%i and %i are identical. Please report"␊ |
| 1187 | ␉␉␉␉␉" a bug at flashrom@flashrom.org\n",␊ |
| 1188 | ␉␉␉␉␉flash->name, k, j);␊ |
| 1189 | ␉␉␉␉ret = 1;␊ |
| 1190 | ␉␉␉}␊ |
| 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 | ␉␉␉␉␉␉␉unsigned int addr,␊ |
| 1202 | ␉␉␉␉␉␉␉unsigned int len))␊ |
| 1203 | {␊ |
| 1204 | ␉unsigned int starthere = 0, lenhere = 0;␊ |
| 1205 | ␉int ret = 0, skip = 1, writecount = 0;␊ |
| 1206 | ␉enum write_granularity gran = write_gran_256bytes; /* FIXME */␊ |
| 1207 | ␊ |
| 1208 | ␉/* curcontents and newcontents are opaque to walk_eraseregions, and␊ |
| 1209 | ␉ * need to be adjusted here to keep the impression of proper abstraction␊ |
| 1210 | ␉ */␊ |
| 1211 | ␉curcontents += start;␊ |
| 1212 | ␉newcontents += start;␊ |
| 1213 | ␉msg_cdbg(":");␊ |
| 1214 | ␉/* FIXME: Assume 256 byte granularity for now to play it safe. */␊ |
| 1215 | ␉if (need_erase(curcontents, newcontents, len, gran)) {␊ |
| 1216 | ␉␉msg_cdbg("E");␊ |
| 1217 | ␉␉ret = erasefn(flash, start, len);␊ |
| 1218 | ␉␉if (ret)␊ |
| 1219 | ␉␉␉return ret;␊ |
| 1220 | ␉␉if (check_erased_range(flash, start, len)) {␊ |
| 1221 | ␉␉␉msg_cerr("ERASE FAILED!\n");␊ |
| 1222 | ␉␉␉return -1;␊ |
| 1223 | ␉␉}␊ |
| 1224 | ␉␉/* Erase was successful. Adjust curcontents. */␊ |
| 1225 | ␉␉memset(curcontents, 0xff, len);␊ |
| 1226 | ␉␉skip = 0;␊ |
| 1227 | ␉}␊ |
| 1228 | ␉/* get_next_write() sets starthere to a new value after the call. */␊ |
| 1229 | ␉while ((lenhere = get_next_write(curcontents + starthere,␊ |
| 1230 | ␉␉␉␉␉ newcontents + starthere,␊ |
| 1231 | ␉␉␉␉␉ len - starthere, &starthere, gran))) {␊ |
| 1232 | ␉␉if (!writecount++)␊ |
| 1233 | ␉␉␉msg_cdbg("W");␊ |
| 1234 | ␉␉/* Needs the partial write function signature. */␊ |
| 1235 | ␉␉ret = flash->write(flash, newcontents + starthere,␊ |
| 1236 | ␉␉␉␉ start + starthere, lenhere);␊ |
| 1237 | ␉␉if (ret)␊ |
| 1238 | ␉␉␉return ret;␊ |
| 1239 | ␉␉starthere += lenhere;␊ |
| 1240 | ␉␉skip = 0;␊ |
| 1241 | ␉}␊ |
| 1242 | ␉if (skip)␊ |
| 1243 | ␉␉msg_cdbg("S");␊ |
| 1244 | ␉return ret;␊ |
| 1245 | }␊ |
| 1246 | ␊ |
| 1247 | static int walk_eraseregions(struct flashctx *flash, int erasefunction,␊ |
| 1248 | ␉␉␉ int (*do_something) (struct flashctx *flash,␊ |
| 1249 | ␉␉␉␉␉␉ unsigned int addr,␊ |
| 1250 | ␉␉␉␉␉␉ unsigned int len,␊ |
| 1251 | ␉␉␉␉␉␉ uint8_t *param1,␊ |
| 1252 | ␉␉␉␉␉␉ uint8_t *param2,␊ |
| 1253 | ␉␉␉␉␉␉ int (*erasefn) (␊ |
| 1254 | ␉␉␉␉␉␉␉struct flashctx *flash,␊ |
| 1255 | ␉␉␉␉␉␉␉unsigned int addr,␊ |
| 1256 | ␉␉␉␉␉␉␉unsigned int len)),␊ |
| 1257 | ␉␉␉ void *param1, void *param2)␊ |
| 1258 | {␊ |
| 1259 | ␉int i, j;␊ |
| 1260 | ␉unsigned int start = 0;␊ |
| 1261 | ␉unsigned int len;␊ |
| 1262 | ␉struct block_eraser eraser = flash->block_erasers[erasefunction];␊ |
| 1263 | ␊ |
| 1264 | ␉for (i = 0; i < NUM_ERASEREGIONS; i++) {␊ |
| 1265 | ␉␉/* count==0 for all automatically initialized array␊ |
| 1266 | ␉␉ * members so the loop below won't be executed for them.␊ |
| 1267 | ␉␉ */␊ |
| 1268 | ␉␉len = eraser.eraseblocks[i].size;␊ |
| 1269 | ␉␉for (j = 0; j < eraser.eraseblocks[i].count; j++) {␊ |
| 1270 | ␉␉␉/* Print this for every block except the first one. */␊ |
| 1271 | ␉␉␉if (i || j)␊ |
| 1272 | ␉␉␉␉msg_cdbg(", ");␊ |
| 1273 | ␉␉␉msg_cdbg("0x%06x-0x%06x", start,␊ |
| 1274 | ␉␉␉␉ start + len - 1);␊ |
| 1275 | ␉␉␉if (do_something(flash, start, len, param1, param2,␊ |
| 1276 | ␉␉␉␉␉ eraser.block_erase)) {␊ |
| 1277 | ␉␉␉␉return 1;␊ |
| 1278 | ␉␉␉}␊ |
| 1279 | ␉␉␉start += len;␊ |
| 1280 | ␉␉}␊ |
| 1281 | ␉}␊ |
| 1282 | ␉msg_cdbg("\n");␊ |
| 1283 | ␉return 0;␊ |
| 1284 | }␊ |
| 1285 | ␊ |
| 1286 | static int check_block_eraser(const struct flashctx *flash, int k, int log)␊ |
| 1287 | {␊ |
| 1288 | ␉struct block_eraser eraser = flash->block_erasers[k];␊ |
| 1289 | ␊ |
| 1290 | ␉if (!eraser.block_erase && !eraser.eraseblocks[0].count) {␊ |
| 1291 | ␉␉if (log)␊ |
| 1292 | ␉␉␉msg_cdbg("not defined. ");␊ |
| 1293 | ␉␉return 1;␊ |
| 1294 | ␉}␊ |
| 1295 | ␉if (!eraser.block_erase && eraser.eraseblocks[0].count) {␊ |
| 1296 | ␉␉if (log)␊ |
| 1297 | ␉␉␉msg_cdbg("eraseblock layout is known, but matching "␊ |
| 1298 | ␉␉␉␉ "block erase function is not implemented. ");␊ |
| 1299 | ␉␉return 1;␊ |
| 1300 | ␉}␊ |
| 1301 | ␉if (eraser.block_erase && !eraser.eraseblocks[0].count) {␊ |
| 1302 | ␉␉if (log)␊ |
| 1303 | ␉␉␉msg_cdbg("block erase function found, but "␊ |
| 1304 | ␉␉␉␉ "eraseblock layout is not defined. ");␊ |
| 1305 | ␉␉return 1;␊ |
| 1306 | ␉}␊ |
| 1307 | ␉return 0;␊ |
| 1308 | }␊ |
| 1309 | ␊ |
| 1310 | int erase_and_write_flash(struct flashctx *flash, uint8_t *oldcontents,␊ |
| 1311 | ␉␉␉ uint8_t *newcontents)␊ |
| 1312 | {␊ |
| 1313 | ␉int k, ret = 1;␊ |
| 1314 | ␉uint8_t *curcontents;␊ |
| 1315 | ␉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 | ␉curcontents = malloc(size);␊ |
| 1320 | ␉if (!curcontents) {␊ |
| 1321 | ␉␉msg_gerr("Out of memory!\n");␊ |
| 1322 | ␉␉exit(1);␊ |
| 1323 | ␉}␊ |
| 1324 | ␉/* Copy oldcontents to curcontents to avoid clobbering oldcontents. */␊ |
| 1325 | ␉memcpy(curcontents, oldcontents, size);␊ |
| 1326 | ␊ |
| 1327 | ␉for (k = 0; k < NUM_ERASEFUNCTIONS; k++) {␊ |
| 1328 | ␉␉if (k != 0)␊ |
| 1329 | ␉␉␉msg_cdbg("Looking for another erase function.\n");␊ |
| 1330 | ␉␉if (!usable_erasefunctions) {␊ |
| 1331 | ␉␉␉msg_cdbg("No usable erase functions left.\n");␊ |
| 1332 | ␉␉␉break;␊ |
| 1333 | ␉␉}␊ |
| 1334 | ␉␉msg_cdbg("Trying erase function %i... ", k);␊ |
| 1335 | ␉␉if (check_block_eraser(flash, k, 1))␊ |
| 1336 | ␉␉␉continue;␊ |
| 1337 | ␉␉usable_erasefunctions--;␊ |
| 1338 | ␉␉ret = walk_eraseregions(flash, k, &erase_and_write_block_helper,␊ |
| 1339 | ␉␉␉␉␉curcontents, newcontents);␊ |
| 1340 | ␉␉/* If everything is OK, don't try another erase function. */␊ |
| 1341 | ␉␉if (!ret)␊ |
| 1342 | ␉␉␉break;␊ |
| 1343 | ␉␉/* Write/erase failed, so try to find out what the current chip␊ |
| 1344 | ␉␉ * contents are. If no usable erase functions remain, we can␊ |
| 1345 | ␉␉ * skip this: the next iteration will break immediately anyway.␊ |
| 1346 | ␉␉ */␊ |
| 1347 | ␉␉if (!usable_erasefunctions)␊ |
| 1348 | ␉␉␉continue;␊ |
| 1349 | ␉␉/* Reading the whole chip may take a while, inform the user even␊ |
| 1350 | ␉␉ * in non-verbose mode.␊ |
| 1351 | ␉␉ */␊ |
| 1352 | ␉␉msg_cinfo("Reading current flash chip contents... ");␊ |
| 1353 | ␉␉if (flash->read(flash, curcontents, 0, size)) {␊ |
| 1354 | ␉␉␉/* Now we are truly screwed. Read failed as well. */␊ |
| 1355 | ␉␉␉msg_cerr("Can't read anymore! Aborting.\n");␊ |
| 1356 | ␉␉␉/* We have no idea about the flash chip contents, so␊ |
| 1357 | ␉␉␉ * retrying with another erase function is pointless.␊ |
| 1358 | ␉␉␉ */␊ |
| 1359 | ␉␉␉break;␊ |
| 1360 | ␉␉}␊ |
| 1361 | ␉␉msg_cinfo("done. ");␊ |
| 1362 | ␉}␊ |
| 1363 | ␉/* Free the scratchpad. */␊ |
| 1364 | ␉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 | void nonfatal_help_message(void)␊ |
| 1375 | {␊ |
| 1376 | ␉msg_gerr("Writing to the flash chip apparently didn't do anything.\n"␊ |
| 1377 | ␉␉"This means we have to add special support for your board, "␊ |
| 1378 | ␉␉ "programmer or flash chip.\n"␊ |
| 1379 | ␉␉"Please report this on IRC at irc.freenode.net (channel "␊ |
| 1380 | ␉␉ "#flashrom) or\n"␊ |
| 1381 | ␉␉"mail flashrom@flashrom.org!\n"␊ |
| 1382 | ␉␉"-------------------------------------------------------------"␊ |
| 1383 | ␉␉ "------------------\n"␊ |
| 1384 | ␉␉"You may now reboot or simply leave the machine running.\n");␊ |
| 1385 | }␊ |
| 1386 | ␊ |
| 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 | ␉␉"mail flashrom@flashrom.org with FAILED: your board name in "␊ |
| 1392 | ␉␉ "the subject line!\n"␊ |
| 1393 | ␉␉"-------------------------------------------------------------"␊ |
| 1394 | ␉␉ "------------------\n"␊ |
| 1395 | ␉␉"DO NOT REBOOT OR POWEROFF!\n");␊ |
| 1396 | }␊ |
| 1397 | ␊ |
| 1398 | /* The way to go if you want a delimited list of programmers */␊ |
| 1399 | void list_programmers(const char *delim)␊ |
| 1400 | {␊ |
| 1401 | ␉enum programmer p;␊ |
| 1402 | ␉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 | void list_programmers_linebreak(int startcol, int cols, int paren)␊ |
| 1411 | {␊ |
| 1412 | ␉const char *pname;␊ |
| 1413 | ␉int pnamelen;␊ |
| 1414 | ␉int remaining = 0, firstline = 1;␊ |
| 1415 | ␉enum programmer p;␊ |
| 1416 | ␉int i;␊ |
| 1417 | ␊ |
| 1418 | ␉for (p = 0; p < PROGRAMMER_INVALID; p++) {␊ |
| 1419 | ␉␉pname = programmer_table[p].name;␊ |
| 1420 | ␉␉pnamelen = strlen(pname);␊ |
| 1421 | ␉␉if (remaining - pnamelen - 2 < 0) {␊ |
| 1422 | ␉␉␉if (firstline)␊ |
| 1423 | ␉␉␉␉firstline = 0;␊ |
| 1424 | ␉␉␉else␊ |
| 1425 | ␉␉␉␉printf("\n");␊ |
| 1426 | ␉␉␉for (i = 0; i < startcol; i++)␊ |
| 1427 | ␉␉␉␉printf(" ");␊ |
| 1428 | ␉␉␉remaining = cols - startcol;␊ |
| 1429 | ␉␉} else {␊ |
| 1430 | ␉␉␉printf(" ");␊ |
| 1431 | ␉␉␉remaining--;␊ |
| 1432 | ␉␉}␊ |
| 1433 | ␉␉if (paren && (p == 0)) {␊ |
| 1434 | ␉␉␉printf("(");␊ |
| 1435 | ␉␉␉remaining--;␊ |
| 1436 | ␉␉}␊ |
| 1437 | ␉␉printf("%s", pname);␊ |
| 1438 | ␉␉remaining -= pnamelen;␊ |
| 1439 | ␉␉if (p < PROGRAMMER_INVALID - 1) {␊ |
| 1440 | ␉␉␉printf(",");␊ |
| 1441 | ␉␉␉remaining--;␊ |
| 1442 | ␉␉} else {␊ |
| 1443 | ␉␉␉if (paren)␊ |
| 1444 | ␉␉␉␉printf(")");␊ |
| 1445 | ␉␉␉printf("\n");␊ |
| 1446 | ␉␉}␊ |
| 1447 | ␉}␊ |
| 1448 | }␊ |
| 1449 | ␊ |
| 1450 | void print_sysinfo(void)␊ |
| 1451 | {␊ |
| 1452 | #if HAVE_UTSNAME == 1␊ |
| 1453 | ␉struct utsname osinfo;␊ |
| 1454 | ␉uname(&osinfo);␊ |
| 1455 | ␊ |
| 1456 | ␉msg_ginfo(" on %s %s (%s)", osinfo.sysname, osinfo.release,␊ |
| 1457 | ␉␉ osinfo.machine);␊ |
| 1458 | #else␊ |
| 1459 | ␉msg_ginfo(" on unknown machine");␊ |
| 1460 | #endif␊ |
| 1461 | ␉msg_ginfo(", built with");␊ |
| 1462 | #if NEED_PCI == 1␊ |
| 1463 | #ifdef PCILIB_VERSION␊ |
| 1464 | ␉msg_ginfo(" libpci %s,", PCILIB_VERSION);␊ |
| 1465 | #else␊ |
| 1466 | ␉msg_ginfo(" unknown PCI library,");␊ |
| 1467 | #endif␊ |
| 1468 | #endif␊ |
| 1469 | #ifdef __clang__␊ |
| 1470 | ␉msg_ginfo(" LLVM Clang");␊ |
| 1471 | #ifdef __clang_version__␊ |
| 1472 | ␉msg_ginfo(" %s,", __clang_version__);␊ |
| 1473 | #else␊ |
| 1474 | ␉msg_ginfo(" unknown version (before r102686),");␊ |
| 1475 | #endif␊ |
| 1476 | #elif defined(__GNUC__)␊ |
| 1477 | ␉msg_ginfo(" GCC");␊ |
| 1478 | #ifdef __VERSION__␊ |
| 1479 | ␉msg_ginfo(" %s,", __VERSION__);␊ |
| 1480 | #else␊ |
| 1481 | ␉msg_ginfo(" unknown version,");␊ |
| 1482 | #endif␊ |
| 1483 | #else␊ |
| 1484 | ␉msg_ginfo(" unknown compiler,");␊ |
| 1485 | #endif␊ |
| 1486 | #if defined (__FLASHROM_LITTLE_ENDIAN__)␊ |
| 1487 | ␉msg_ginfo(" little endian");␊ |
| 1488 | #else␊ |
| 1489 | ␉msg_ginfo(" big endian");␊ |
| 1490 | #endif␊ |
| 1491 | ␉msg_ginfo("\n");␊ |
| 1492 | }␊ |
| 1493 | ␊ |
| 1494 | void print_version(void)␊ |
| 1495 | {␊ |
| 1496 | ␉msg_ginfo("flashrom v%s", flashrom_version);␊ |
| 1497 | ␉print_sysinfo();␊ |
| 1498 | }␊ |
| 1499 | ␊ |
| 1500 | void print_banner(void)␊ |
| 1501 | {␊ |
| 1502 | ␉msg_ginfo("flashrom is free software, get the source code at "␊ |
| 1503 | ␉␉ "http://www.flashrom.org\n");␊ |
| 1504 | ␉msg_ginfo("\n");␊ |
| 1505 | }␊ |
| 1506 | ␊ |
| 1507 | int selfcheck(void)␊ |
| 1508 | {␊ |
| 1509 | ␉int ret = 0;␊ |
| 1510 | ␉const struct flashchip *flash;␊ |
| 1511 | ␊ |
| 1512 | ␉/* Safety check. Instead of aborting after the first error, check␊ |
| 1513 | ␉ * if more errors exist.␊ |
| 1514 | ␉ */␊ |
| 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 | ␉ * For 'flashchips' we check the first element to be non-null. In the␊ |
| 1522 | ␉ * other cases there exist use cases where the first element can be␊ |
| 1523 | ␉ * null. */␊ |
| 1524 | ␉if (flashchips == NULL || flashchips[0].vendor == NULL) {␊ |
| 1525 | ␉␉msg_gerr("Flashchips table miscompilation!\n");␊ |
| 1526 | ␉␉ret = 1;␊ |
| 1527 | ␉}␊ |
| 1528 | ␉/* Check that virtual_memory in struct flashctx is placed directly␊ |
| 1529 | ␉ * after the members copied from struct flashchip.␊ |
| 1530 | ␉ */␊ |
| 1531 | ␉if (sizeof(struct flashchip) !=␊ |
| 1532 | ␉ offsetof(struct flashctx, virtual_memory)) {␊ |
| 1533 | ␉␉msg_gerr("struct flashctx broken!\n");␊ |
| 1534 | ␉␉ret = 1;␊ |
| 1535 | ␉}␊ |
| 1536 | ␉for (flash = flashchips; flash && flash->name; flash++)␊ |
| 1537 | ␉␉if (selfcheck_eraseblocks(flash))␊ |
| 1538 | ␉␉␉ret = 1;␊ |
| 1539 | ␊ |
| 1540 | #if CONFIG_INTERNAL == 1␊ |
| 1541 | ␉if (chipset_enables == NULL) {␊ |
| 1542 | ␉␉msg_gerr("Chipset enables table does not exist!\n");␊ |
| 1543 | ␉␉ret = 1;␊ |
| 1544 | ␉}␊ |
| 1545 | ␉if (board_matches == NULL) {␊ |
| 1546 | ␉␉msg_gerr("Board enables table does not exist!\n");␊ |
| 1547 | ␉␉ret = 1;␊ |
| 1548 | ␉}␊ |
| 1549 | ␉if (boards_known == NULL) {␊ |
| 1550 | ␉␉msg_gerr("Known boards table does not exist!\n");␊ |
| 1551 | ␉␉ret = 1;␊ |
| 1552 | ␉}␊ |
| 1553 | ␉if (laptops_known == NULL) {␊ |
| 1554 | ␉␉msg_gerr("Known laptops table does not exist!\n");␊ |
| 1555 | ␉␉ret = 1;␊ |
| 1556 | ␉}␊ |
| 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 | ␉␉␉␉msg_cinfo(" WRITE");␊ |
| 1575 | ␉␉␉msg_cinfo("\n");␊ |
| 1576 | ␉␉}␊ |
| 1577 | ␉␉if ((!(flash->tested & TEST_BAD_PROBE) && !(flash->tested & TEST_OK_PROBE)) ||␊ |
| 1578 | ␉␉ (!(flash->tested & TEST_BAD_READ) && !(flash->tested & TEST_OK_READ)) ||␊ |
| 1579 | ␉␉ (!(flash->tested & TEST_BAD_ERASE) && !(flash->tested & TEST_OK_ERASE)) ||␊ |
| 1580 | ␉␉ (!(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 | ␉␉␉␉msg_cinfo(" WRITE");␊ |
| 1590 | ␉␉␉msg_cinfo("\n");␊ |
| 1591 | ␉␉}␊ |
| 1592 | ␉␉/* FIXME: This message is designed towards CLI users. */␊ |
| 1593 | ␉␉msg_cinfo("The test status of this chip may have been updated "␊ |
| 1594 | ␉␉␉ "in the latest development\n"␊ |
| 1595 | ␉␉␉ "version of flashrom. If you are running the latest "␊ |
| 1596 | ␉␉␉ "development version,\n"␊ |
| 1597 | ␉␉␉ "please email a report to flashrom@flashrom.org if "␊ |
| 1598 | ␉␉␉ "any of the above operations\n"␊ |
| 1599 | ␉␉␉ "work correctly for you with this flash part. Please "␊ |
| 1600 | ␉␉␉ "include the flashrom\n"␊ |
| 1601 | ␉␉␉ "output with the additional -V option for all "␊ |
| 1602 | ␉␉␉ "operations you tested (-V, -Vr,\n"␊ |
| 1603 | ␉␉␉ "-VE, -Vw), and mention which mainboard or "␊ |
| 1604 | ␉␉␉ "programmer you tested.\n"␊ |
| 1605 | ␉␉␉ "Please mention your board in the subject line. "␊ |
| 1606 | ␉␉␉ "Thanks for your help!\n");␊ |
| 1607 | ␉}␊ |
| 1608 | }␊ |
| 1609 | ␊ |
| 1610 | /* FIXME: This function signature needs to be improved once doit() has a better␊ |
| 1611 | * function signature.␊ |
| 1612 | */␊ |
| 1613 | int chip_safety_check(struct flashctx *flash, int force, int read_it,␊ |
| 1614 | ␉␉ int write_it, int erase_it, int verify_it)␊ |
| 1615 | {␊ |
| 1616 | ␉if (!programmer_may_write && (write_it || erase_it)) {␊ |
| 1617 | ␉␉msg_perr("Write/erase is not working yet on your programmer in "␊ |
| 1618 | ␉␉␉ "its current configuration.\n");␊ |
| 1619 | ␉␉/* --force is the wrong approach, but it's the best we can do␊ |
| 1620 | ␉␉ * until the generic programmer parameter parser is merged.␊ |
| 1621 | ␉␉ */␊ |
| 1622 | ␉␉if (!force)␊ |
| 1623 | ␉␉␉return 1;␊ |
| 1624 | ␉␉msg_cerr("Continuing anyway.\n");␊ |
| 1625 | ␉}␊ |
| 1626 | ␊ |
| 1627 | ␉if (read_it || erase_it || write_it || verify_it) {␊ |
| 1628 | ␉␉/* Everything needs read. */␊ |
| 1629 | ␉␉if (flash->tested & TEST_BAD_READ) {␊ |
| 1630 | ␉␉␉msg_cerr("Read is not working on this chip. ");␊ |
| 1631 | ␉␉␉if (!force)␊ |
| 1632 | ␉␉␉␉return 1;␊ |
| 1633 | ␉␉␉msg_cerr("Continuing anyway.\n");␊ |
| 1634 | ␉␉}␊ |
| 1635 | ␉␉if (!flash->read) {␊ |
| 1636 | ␉␉␉msg_cerr("flashrom has no read function for this "␊ |
| 1637 | ␉␉␉␉ "flash chip.\n");␊ |
| 1638 | ␉␉␉return 1;␊ |
| 1639 | ␉␉}␊ |
| 1640 | ␉}␊ |
| 1641 | ␉if (erase_it || write_it) {␊ |
| 1642 | ␉␉/* Write needs erase. */␊ |
| 1643 | ␉␉if (flash->tested & TEST_BAD_ERASE) {␊ |
| 1644 | ␉␉␉msg_cerr("Erase is not working on this chip. ");␊ |
| 1645 | ␉␉␉if (!force)␊ |
| 1646 | ␉␉␉␉return 1;␊ |
| 1647 | ␉␉␉msg_cerr("Continuing anyway.\n");␊ |
| 1648 | ␉␉}␊ |
| 1649 | ␉␉if(count_usable_erasers(flash) == 0) {␊ |
| 1650 | ␉␉␉msg_cerr("flashrom has no erase function for this "␊ |
| 1651 | ␉␉␉␉ "flash chip.\n");␊ |
| 1652 | ␉␉␉return 1;␊ |
| 1653 | ␉␉}␊ |
| 1654 | ␉}␊ |
| 1655 | ␉if (write_it) {␊ |
| 1656 | ␉␉if (flash->tested & TEST_BAD_WRITE) {␊ |
| 1657 | ␉␉␉msg_cerr("Write is not working on this chip. ");␊ |
| 1658 | ␉␉␉if (!force)␊ |
| 1659 | ␉␉␉␉return 1;␊ |
| 1660 | ␉␉␉msg_cerr("Continuing anyway.\n");␊ |
| 1661 | ␉␉}␊ |
| 1662 | ␉␉if (!flash->write) {␊ |
| 1663 | ␉␉␉msg_cerr("flashrom has no write function for this "␊ |
| 1664 | ␉␉␉␉ "flash chip.\n");␊ |
| 1665 | ␉␉␉return 1;␊ |
| 1666 | ␉␉}␊ |
| 1667 | ␉}␊ |
| 1668 | ␉return 0;␊ |
| 1669 | }␊ |
| 1670 | ␊ |
| 1671 | /* This function signature is horrible. We need to design a better interface,␊ |
| 1672 | * but right now it allows us to split off the CLI code.␊ |
| 1673 | * Besides that, the function itself is a textbook example of abysmal code flow.␊ |
| 1674 | */␊ |
| 1675 | int doit(struct flashctx *flash, int force, const char *filename, int read_it,␊ |
| 1676 | ␉ int write_it, int erase_it, int verify_it)␊ |
| 1677 | {␊ |
| 1678 | ␉uint8_t *oldcontents;␊ |
| 1679 | ␉uint8_t *newcontents;␊ |
| 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)) {␊ |
| 1684 | ␉␉msg_cerr("Aborting.\n");␊ |
| 1685 | ␉␉ret = 1;␊ |
| 1686 | ␉␉goto out_nofree;␊ |
| 1687 | ␉}␊ |
| 1688 | ␊ |
| 1689 | ␉/* Given the existence of read locks, we want to unlock for read,␊ |
| 1690 | ␉ * erase and write.␊ |
| 1691 | ␉ */␊ |
| 1692 | ␉if (flash->unlock)␊ |
| 1693 | ␉␉flash->unlock(flash);␊ |
| 1694 | ␊ |
| 1695 | ␉if (read_it) {␊ |
| 1696 | ␉␉ret = read_flash_to_file(flash, filename);␊ |
| 1697 | ␉␉goto out_nofree;␊ |
| 1698 | ␉}␊ |
| 1699 | ␊ |
| 1700 | ␉oldcontents = malloc(size);␊ |
| 1701 | ␉if (!oldcontents) {␊ |
| 1702 | ␉␉msg_gerr("Out of memory!\n");␊ |
| 1703 | ␉␉exit(1);␊ |
| 1704 | ␉}␊ |
| 1705 | ␉/* Assume worst case: All bits are 0. */␊ |
| 1706 | ␉memset(oldcontents, 0x00, size);␊ |
| 1707 | ␉newcontents = malloc(size);␊ |
| 1708 | ␉if (!newcontents) {␊ |
| 1709 | ␉␉msg_gerr("Out of memory!\n");␊ |
| 1710 | ␉␉exit(1);␊ |
| 1711 | ␉}␊ |
| 1712 | ␉/* Assume best case: All bits should be 1. */␊ |
| 1713 | ␉memset(newcontents, 0xff, size);␊ |
| 1714 | ␉/* Side effect of the assumptions above: Default write action is erase␊ |
| 1715 | ␉ * because newcontents looks like a completely erased chip, and␊ |
| 1716 | ␉ * oldcontents being completely 0x00 means we have to erase everything␊ |
| 1717 | ␉ * before we can write.␊ |
| 1718 | ␉ */␊ |
| 1719 | ␊ |
| 1720 | ␉if (erase_it) {␊ |
| 1721 | ␉␉/* FIXME: Do we really want the scary warning if erase failed?␊ |
| 1722 | ␉␉ * After all, after erase the chip is either blank or partially␊ |
| 1723 | ␉␉ * blank or it has the old contents. A blank chip won't boot,␊ |
| 1724 | ␉␉ * so if the user wanted erase and reboots afterwards, the user␊ |
| 1725 | ␉␉ * knows very well that booting won't work.␊ |
| 1726 | ␉␉ */␊ |
| 1727 | ␉␉if (erase_and_write_flash(flash, oldcontents, newcontents)) {␊ |
| 1728 | ␉␉␉emergency_help_message();␊ |
| 1729 | ␉␉␉ret = 1;␊ |
| 1730 | ␉␉}␊ |
| 1731 | ␉␉goto out;␊ |
| 1732 | ␉}␊ |
| 1733 | ␊ |
| 1734 | ␉if (write_it || verify_it) {␊ |
| 1735 | ␉␉if (read_buf_from_file(newcontents, size, filename)) {␊ |
| 1736 | ␉␉␉ret = 1;␊ |
| 1737 | ␉␉␉goto out;␊ |
| 1738 | ␉␉}␊ |
| 1739 | ␊ |
| 1740 | #if CONFIG_INTERNAL == 1␊ |
| 1741 | ␉␉if (programmer == PROGRAMMER_INTERNAL)␊ |
| 1742 | ␉␉␉show_id(newcontents, size, force);␊ |
| 1743 | #endif␊ |
| 1744 | ␉}␊ |
| 1745 | ␊ |
| 1746 | ␉/* Read the whole chip to be able to check whether regions need to be␊ |
| 1747 | ␉ * erased and to give better diagnostics in case write fails.␊ |
| 1748 | ␉ * The alternative would be to read only the regions which are to be␊ |
| 1749 | ␉ * preserved, but in that case we might perform unneeded erase which␊ |
| 1750 | ␉ * takes time as well.␊ |
| 1751 | ␉ */␊ |
| 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 | ␉// This should be moved into each flash part's code to do it ␊ |
| 1761 | ␉// cleanly. This does the job.␊ |
| 1762 | ␉handle_romentries(flash, oldcontents, newcontents);␊ |
| 1763 | ␊ |
| 1764 | ␉// ////////////////////////////////////////////////////////////␊ |
| 1765 | ␊ |
| 1766 | ␉if (write_it) {␊ |
| 1767 | ␉␉if (erase_and_write_flash(flash, oldcontents, newcontents)) {␊ |
| 1768 | ␉␉␉msg_cerr("Uh oh. Erase/write failed. Checking if "␊ |
| 1769 | ␉␉␉␉ "anything changed.\n");␊ |
| 1770 | ␉␉␉if (!flash->read(flash, newcontents, 0, size)) {␊ |
| 1771 | ␉␉␉␉if (!memcmp(oldcontents, newcontents, size)) {␊ |
| 1772 | ␉␉␉␉␉msg_cinfo("Good. It seems nothing was "␊ |
| 1773 | ␉␉␉␉␉␉ "changed.\n");␊ |
| 1774 | ␉␉␉␉␉nonfatal_help_message();␊ |
| 1775 | ␉␉␉␉␉ret = 1;␊ |
| 1776 | ␉␉␉␉␉goto out;␊ |
| 1777 | ␉␉␉␉}␊ |
| 1778 | ␉␉␉}␊ |
| 1779 | ␉␉␉emergency_help_message();␊ |
| 1780 | ␉␉␉ret = 1;␊ |
| 1781 | ␉␉␉goto out;␊ |
| 1782 | ␉␉}␊ |
| 1783 | ␉}␊ |
| 1784 | ␊ |
| 1785 | ␉if (verify_it) {␊ |
| 1786 | ␉␉/* Work around chips which need some time to calm down. */␊ |
| 1787 | ␉␉if (write_it)␊ |
| 1788 | ␉␉␉programmer_delay(1000*1000);␊ |
| 1789 | ␉␉ret = verify_flash(flash, newcontents);␊ |
| 1790 | ␉␉/* If we tried to write, and verification now fails, we␊ |
| 1791 | ␉␉ * might have an emergency situation.␊ |
| 1792 | ␉␉ */␊ |
| 1793 | ␉␉if (ret && write_it)␊ |
| 1794 | ␉␉␉emergency_help_message();␊ |
| 1795 | ␉}␊ |
| 1796 | ␊ |
| 1797 | out:␊ |
| 1798 | ␉free(oldcontents);␊ |
| 1799 | ␉free(newcontents);␊ |
| 1800 | out_nofree:␊ |
| 1801 | ␉programmer_shutdown();␊ |
| 1802 | ␉return ret;␊ |
| 1803 | }␊ |
| 1804 | |
