blob: e525f4852a02bee882bd2ec5086b8bd3a98ea165 [file] [log] [blame]
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +00001/*
Uwe Hermannd1107642007-08-29 17:52:32 +00002 * This file is part of the flashrom project.
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +00003 *
Uwe Hermannd22a1d42007-09-09 20:21:05 +00004 * Copyright (C) 2000 Silicon Integrated System Corporation
5 * Copyright (C) 2004 Tyan Corp <yhlu@tyan.com>
Uwe Hermannc7e8a0c2009-05-19 14:14:21 +00006 * Copyright (C) 2005-2008 coresystems GmbH
Carl-Daniel Hailfinger03b4e712009-05-08 12:49:03 +00007 * Copyright (C) 2008,2009 Carl-Daniel Hailfinger
Nico Huber7af0e792016-04-29 16:40:15 +02008 * Copyright (C) 2016 secunet Security Networks AG
9 * (Written by Nico Huber <nico.huber@secunet.com> for secunet)
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +000010 *
Uwe Hermannd1107642007-08-29 17:52:32 +000011 * This program is free software; you can redistribute it and/or modify
12 * it under the terms of the GNU General Public License as published by
13 * the Free Software Foundation; either version 2 of the License, or
14 * (at your option) any later version.
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +000015 *
Uwe Hermannd1107642007-08-29 17:52:32 +000016 * This program is distributed in the hope that it will be useful,
17 * but WITHOUT ANY WARRANTY; without even the implied warranty of
18 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
19 * GNU General Public License for more details.
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +000020 */
21
Felix Singerf25447e2022-08-19 02:44:28 +020022#include <stdbool.h>
Carl-Daniel Hailfinger831e8f42010-05-30 22:24:40 +000023#include <stdio.h>
Stefan Reinauer018aca82006-11-21 23:48:51 +000024#include <sys/types.h>
Ronald G. Minnichceec4202003-07-25 04:37:41 +000025#include <string.h>
Stefan Tauner16687702015-12-25 21:59:45 +000026#include <unistd.h>
Ronald G. Minnicheaab50b2003-09-12 22:41:53 +000027#include <stdlib.h>
Stefan Tauner363fd7e2013-04-07 13:08:30 +000028#include <errno.h>
Carl-Daniel Hailfingerc2441382010-11-09 22:00:31 +000029#include <ctype.h>
Edward O'Callaghan3b64d812022-08-12 13:07:51 +100030
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +000031#include "flash.h"
Carl-Daniel Hailfinger08454642009-06-15 14:14:48 +000032#include "flashchips.h"
Carl-Daniel Hailfinger5b997c32010-07-27 22:41:39 +000033#include "programmer.h"
Thomas Heijligen74b4aa02021-12-14 17:52:30 +010034#include "hwaccess_physmap.h"
Nico Huberfe34d2a2017-11-10 21:10:20 +010035#include "chipdrivers.h"
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +000036
Nico Huberc3b02dc2023-08-12 01:13:45 +020037const char flashprog_version[] = FLASHPROG_VERSION;
Nico Huberbcb2e5a2012-12-30 01:23:17 +000038const char *chip_to_probe = NULL;
Carl-Daniel Hailfinger66ef4e52009-12-13 22:28:00 +000039
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +020040static const struct programmer_entry *programmer = NULL;
Nico Huber6a2ebeb2022-08-26 11:36:48 +020041static char *programmer_param = NULL;
Stefan Reinauer70385642007-04-06 11:58:03 +000042
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +000043/* If nonzero, used as the start address of bottom-aligned flash. */
44unsigned long flashbase;
Carl-Daniel Hailfinger66ef4e52009-12-13 22:28:00 +000045
Carl-Daniel Hailfingerd1be52d2010-07-03 12:14:25 +000046/* Is writing allowed with this programmer? */
Felix Singer980d6b82022-08-19 02:48:15 +020047bool programmer_may_write;
Carl-Daniel Hailfingerd1be52d2010-07-03 12:14:25 +000048
Carl-Daniel Hailfinger2bee8cf2010-11-10 15:25:18 +000049#define SHUTDOWN_MAXFN 32
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000050static int shutdown_fn_count = 0;
Nico Huber454f6132012-12-10 13:34:10 +000051/** @private */
Richard Hughes93e16252018-12-19 11:54:47 +000052static struct shutdown_func_data {
David Hendricks8bb20212011-06-14 01:35:36 +000053 int (*func) (void *data);
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000054 void *data;
Richard Hughes93e16252018-12-19 11:54:47 +000055} shutdown_fn[SHUTDOWN_MAXFN];
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +000056/* Initialize to 0 to make sure nobody registers a shutdown function before
57 * programmer init.
58 */
Felix Singerf25447e2022-08-19 02:44:28 +020059static bool may_register_shutdown = false;
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000060
Stefan Taunerc4f44df2013-08-12 22:58:43 +000061/* Did we change something or was every erase/write skipped (if any)? */
62static bool all_skipped = true;
63
Carl-Daniel Hailfinger63fd9022011-12-14 22:25:15 +000064static int check_block_eraser(const struct flashctx *flash, int k, int log);
Stefan Tauner5368dca2011-07-01 00:19:12 +000065
Stefan Tauner2a1ed772014-08-31 00:09:21 +000066int shutdown_free(void *data)
67{
68 free(data);
69 return 0;
70}
71
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000072/* Register a function to be executed on programmer shutdown.
73 * The advantage over atexit() is that you can supply a void pointer which will
74 * be used as parameter to the registered function upon programmer shutdown.
75 * This pointer can point to arbitrary data used by said function, e.g. undo
76 * information for GPIO settings etc. If unneeded, set data=NULL.
77 * Please note that the first (void *data) belongs to the function signature of
78 * the function passed as first parameter.
79 */
David Hendricks8bb20212011-06-14 01:35:36 +000080int register_shutdown(int (*function) (void *data), void *data)
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000081{
82 if (shutdown_fn_count >= SHUTDOWN_MAXFN) {
Carl-Daniel Hailfinger9f5f2152010-06-04 23:20:21 +000083 msg_perr("Tried to register more than %i shutdown functions.\n",
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000084 SHUTDOWN_MAXFN);
85 return 1;
86 }
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +000087 if (!may_register_shutdown) {
88 msg_perr("Tried to register a shutdown function before "
89 "programmer init.\n");
90 return 1;
91 }
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000092 shutdown_fn[shutdown_fn_count].func = function;
93 shutdown_fn[shutdown_fn_count].data = data;
94 shutdown_fn_count++;
95
96 return 0;
97}
98
Nikolai Artemiev4ad48642020-11-05 13:54:27 +110099int register_chip_restore(chip_restore_fn_cb_t func,
100 struct flashctx *flash, uint8_t status)
101{
102 if (flash->chip_restore_fn_count >= MAX_CHIP_RESTORE_FUNCTIONS) {
103 msg_perr("Tried to register more than %i chip restore"
104 " functions.\n", MAX_CHIP_RESTORE_FUNCTIONS);
105 return 1;
106 }
107 flash->chip_restore_fn[flash->chip_restore_fn_count].func = func;
108 flash->chip_restore_fn[flash->chip_restore_fn_count].status = status;
109 flash->chip_restore_fn_count++;
110
111 return 0;
112}
113
114static int deregister_chip_restore(struct flashctx *flash)
115{
116 int rc = 0;
117
118 while (flash->chip_restore_fn_count > 0) {
119 int i = --flash->chip_restore_fn_count;
120 rc |= flash->chip_restore_fn[i].func(
121 flash, flash->chip_restore_fn[i].status);
122 }
123
124 return rc;
125}
126
Nico Huber2b66ad92023-01-11 20:15:15 +0100127int programmer_init(struct flashprog_programmer *const prog)
Uwe Hermann09e04f72009-05-16 22:36:00 +0000128{
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000129 int ret;
Carl-Daniel Hailfinger2e681602011-09-08 00:00:29 +0000130
Nico Huber2b66ad92023-01-11 20:15:15 +0100131 if (prog == NULL || prog->driver == NULL) {
Carl-Daniel Hailfinger2e681602011-09-08 00:00:29 +0000132 msg_perr("Invalid programmer specified!\n");
133 return -1;
134 }
Nico Huber2b66ad92023-01-11 20:15:15 +0100135 programmer = prog->driver;
136 programmer_param = prog->param;
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000137 /* Initialize all programmer specific data. */
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000138 /* Default to top aligned flash at 4 GB. */
139 flashbase = 0;
140 /* Registering shutdown functions is now allowed. */
Felix Singerf25447e2022-08-19 02:44:28 +0200141 may_register_shutdown = true;
Carl-Daniel Hailfingerd1be52d2010-07-03 12:14:25 +0000142 /* Default to allowing writes. Broken programmers set this to 0. */
Felix Singer980d6b82022-08-19 02:48:15 +0200143 programmer_may_write = true;
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000144
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +0200145 msg_pdbg("Initializing %s programmer\n", programmer->name);
Nico Hubere3a26882023-01-11 21:45:51 +0100146 ret = programmer->init(prog);
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000147 if (programmer_param && strlen(programmer_param)) {
Carl-Daniel Hailfinger20a36ba2013-08-13 07:09:57 +0000148 if (ret != 0) {
149 /* It is quite possible that any unhandled programmer parameter would have been valid,
150 * but an error in actual programmer init happened before the parameter was evaluated.
151 */
152 msg_pwarn("Unhandled programmer parameters (possibly due to another failure): %s\n",
153 programmer_param);
154 } else {
155 /* Actual programmer init was successful, but the user specified an invalid or unusable
156 * (for the current programmer configuration) parameter.
157 */
158 msg_perr("Unhandled programmer parameters: %s\n", programmer_param);
159 msg_perr("Aborting.\n");
160 ret = ERROR_FATAL;
161 }
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000162 }
Nico Huber6a2ebeb2022-08-26 11:36:48 +0200163 programmer_param = NULL;
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000164 return ret;
Uwe Hermann09e04f72009-05-16 22:36:00 +0000165}
166
Stefan Tauner20da4aa2014-05-07 22:07:23 +0000167/** Calls registered shutdown functions and resets internal programmer-related variables.
168 * Calling it is safe even without previous initialization, but further interactions with programmer support
169 * require a call to programmer_init() (afterwards).
170 *
171 * @return The OR-ed result values of all shutdown functions (i.e. 0 on success). */
Nico Huber2b66ad92023-01-11 20:15:15 +0100172int programmer_shutdown(struct flashprog_programmer *const prog)
Uwe Hermann09e04f72009-05-16 22:36:00 +0000173{
David Hendricks8bb20212011-06-14 01:35:36 +0000174 int ret = 0;
175
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000176 /* Registering shutdown functions is no longer allowed. */
Felix Singerf25447e2022-08-19 02:44:28 +0200177 may_register_shutdown = false;
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000178 while (shutdown_fn_count > 0) {
179 int i = --shutdown_fn_count;
David Hendricks8bb20212011-06-14 01:35:36 +0000180 ret |= shutdown_fn[i].func(shutdown_fn[i].data);
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000181 }
Carl-Daniel Hailfingera5bcbce2014-07-19 22:03:29 +0000182 registered_master_count = 0;
Stefan Taunere34e3e82013-01-01 00:06:51 +0000183
David Hendricks8bb20212011-06-14 01:35:36 +0000184 return ret;
Uwe Hermann09e04f72009-05-16 22:36:00 +0000185}
186
Stefan Taunerf80419c2014-05-02 15:41:42 +0000187void programmer_delay(unsigned int usecs)
Carl-Daniel Hailfingerca8bfc62009-06-05 17:48:08 +0000188{
Edward O'Callaghan56684d92022-09-07 10:47:45 +1000189 if (usecs > 0) {
190 if (programmer->delay)
191 programmer->delay(usecs);
192 else
193 internal_delay(usecs);
194 }
Carl-Daniel Hailfingerca8bfc62009-06-05 17:48:08 +0000195}
196
Carl-Daniel Hailfinger8a3c60c2011-12-18 15:01:24 +0000197int read_memmapped(struct flashctx *flash, uint8_t *buf, unsigned int start,
198 int unsigned len)
Carl-Daniel Hailfinger03b4e712009-05-08 12:49:03 +0000199{
Carl-Daniel Hailfinger8a3c60c2011-12-18 15:01:24 +0000200 chip_readn(flash, buf, flash->virtual_memory + start, len);
Uwe Hermann91f4afa2011-07-28 08:13:25 +0000201
Carl-Daniel Hailfinger03b4e712009-05-08 12:49:03 +0000202 return 0;
203}
204
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000205/* This is a somewhat hacked function similar in some ways to strtok().
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000206 * It will look for needle with a subsequent '=' in haystack, return a copy of
207 * needle and remove everything from the first occurrence of needle to the next
208 * delimiter from haystack.
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000209 */
Nico Huber6a2ebeb2022-08-26 11:36:48 +0200210static char *extract_param(char *const *haystack, const char *needle, const char *delim)
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000211{
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000212 char *param_pos, *opt_pos, *rest;
213 char *opt = NULL;
214 int optlen;
Carl-Daniel Hailfinger27023762010-04-28 15:22:14 +0000215 int needlelen;
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000216
Carl-Daniel Hailfinger27023762010-04-28 15:22:14 +0000217 needlelen = strlen(needle);
218 if (!needlelen) {
219 msg_gerr("%s: empty needle! Please report a bug at "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200220 "flashprog@flashprog.org\n", __func__);
Carl-Daniel Hailfinger27023762010-04-28 15:22:14 +0000221 return NULL;
222 }
223 /* No programmer parameters given. */
224 if (*haystack == NULL)
225 return NULL;
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000226 param_pos = strstr(*haystack, needle);
227 do {
228 if (!param_pos)
229 return NULL;
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000230 /* Needle followed by '='? */
231 if (param_pos[needlelen] == '=') {
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000232 /* Beginning of the string? */
233 if (param_pos == *haystack)
234 break;
235 /* After a delimiter? */
236 if (strchr(delim, *(param_pos - 1)))
237 break;
238 }
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000239 /* Continue searching. */
240 param_pos++;
241 param_pos = strstr(param_pos, needle);
242 } while (1);
Uwe Hermann91f4afa2011-07-28 08:13:25 +0000243
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000244 if (param_pos) {
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000245 /* Get the string after needle and '='. */
246 opt_pos = param_pos + needlelen + 1;
247 optlen = strcspn(opt_pos, delim);
248 /* Return an empty string if the parameter was empty. */
249 opt = malloc(optlen + 1);
250 if (!opt) {
Sean Nelson316a29f2010-05-07 20:09:04 +0000251 msg_gerr("Out of memory!\n");
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000252 exit(1);
253 }
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000254 strncpy(opt, opt_pos, optlen);
255 opt[optlen] = '\0';
256 rest = opt_pos + optlen;
257 /* Skip all delimiters after the current parameter. */
258 rest += strspn(rest, delim);
259 memmove(param_pos, rest, strlen(rest) + 1);
260 /* We could shrink haystack, but the effort is not worth it. */
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000261 }
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000262
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000263 return opt;
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000264}
265
Stefan Tauner66652442011-06-26 17:38:17 +0000266char *extract_programmer_param(const char *param_name)
Carl-Daniel Hailfinger2b6dcb32010-07-08 10:13:37 +0000267{
268 return extract_param(&programmer_param, param_name, ",");
269}
270
Richard Hughes842d6782021-01-15 09:48:12 +0000271static void flashprog_progress_report(struct flashprog_progress *const p)
272{
273 if (p->current > p->total) {
274 msg_gdbg2("Sanitizing progress report: %zu bytes off.", p->current - p->total);
275 p->current = p->total;
276 }
277
278 if (!p->callback)
279 return;
280
281 p->callback(p->stage, p->current, p->total, p->user_data);
282}
283
284static void flashprog_progress_start(struct flashprog_flashctx *const flashctx,
285 const enum flashprog_progress_stage stage, const size_t total)
286{
287 flashctx->progress.stage = stage;
288 flashctx->progress.current = 0;
289 flashctx->progress.total = total;
290 flashprog_progress_report(&flashctx->progress);
291}
292
293static void flashprog_progress_start_by_layout(struct flashprog_flashctx *const flashctx,
294 const enum flashprog_progress_stage stage,
295 const struct flashprog_layout *const layout)
296{
297 const struct romentry *entry = NULL;
298 size_t total = 0;
299
300 while ((entry = layout_next_included(layout, entry)))
301 total += entry->end - entry->start + 1;
302
303 flashprog_progress_start(flashctx, stage, total);
304}
305
306static void flashprog_progress_set(struct flashprog_flashctx *const flashctx, const size_t current)
307{
308 flashctx->progress.current = current;
309 flashprog_progress_report(&flashctx->progress);
310}
311
312/** @private */
313void flashprog_progress_add(struct flashprog_flashctx *const flashctx, const size_t progress)
314{
315 flashctx->progress.current += progress;
316 flashprog_progress_report(&flashctx->progress);
317}
318
319static void flashprog_progress_finish(struct flashprog_flashctx *const flashctx)
320{
321 if (flashctx->progress.current == flashctx->progress.total)
322 return;
323
324 flashctx->progress.current = flashctx->progress.total;
325 flashprog_progress_report(&flashctx->progress);
326}
327
Sylvain "ythier" Hitier9db45512011-07-04 07:27:17 +0000328/* Returns the number of well-defined erasers for a chip. */
Carl-Daniel Hailfinger63fd9022011-12-14 22:25:15 +0000329static unsigned int count_usable_erasers(const struct flashctx *flash)
Stefan Tauner5368dca2011-07-01 00:19:12 +0000330{
331 unsigned int usable_erasefunctions = 0;
332 int k;
333 for (k = 0; k < NUM_ERASEFUNCTIONS; k++) {
334 if (!check_block_eraser(flash, k, 0))
335 usable_erasefunctions++;
336 }
337 return usable_erasefunctions;
338}
339
Mark Marshallf20b7be2014-05-09 21:16:21 +0000340static int compare_range(const uint8_t *wantbuf, const uint8_t *havebuf, unsigned int start, unsigned int len)
Stefan Tauner78ffbea2012-10-27 15:36:56 +0000341{
342 int ret = 0, failcount = 0;
343 unsigned int i;
344 for (i = 0; i < len; i++) {
345 if (wantbuf[i] != havebuf[i]) {
346 /* Only print the first failure. */
347 if (!failcount++)
348 msg_cerr("FAILED at 0x%08x! Expected=0x%02x, Found=0x%02x,",
349 start + i, wantbuf[i], havebuf[i]);
350 }
351 }
352 if (failcount) {
353 msg_cerr(" failed byte count from 0x%08x-0x%08x: 0x%x\n",
354 start, start + len - 1, failcount);
355 ret = -1;
356 }
357 return ret;
358}
359
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000360/* start is an offset to the base address of the flash chip */
Jacob Garberbeeb8bc2019-06-21 15:24:17 -0600361static int check_erased_range(struct flashctx *flash, unsigned int start, unsigned int len)
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000362{
363 int ret;
Paul Kocialkowski995f7552018-01-15 01:06:09 +0300364 const uint8_t erased_value = ERASED_VALUE(flash);
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000365
Edward O'Callaghanf60f64f2022-11-12 12:08:01 +1100366 uint8_t *cmpbuf = malloc(len);
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000367 if (!cmpbuf) {
Edward O'Callaghana31a5722022-11-12 12:05:36 +1100368 msg_gerr("Out of memory!\n");
Edward O'Callaghan6edf9f82022-11-12 12:08:46 +1100369 return -1;
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000370 }
Paul Kocialkowski995f7552018-01-15 01:06:09 +0300371 memset(cmpbuf, erased_value, len);
Stefan Tauner78ffbea2012-10-27 15:36:56 +0000372 ret = verify_range(flash, cmpbuf, start, len);
Edward O'Callaghanf60f64f2022-11-12 12:08:01 +1100373
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000374 free(cmpbuf);
375 return ret;
376}
377
Richard Hughes842d6782021-01-15 09:48:12 +0000378int flashprog_read_range(struct flashctx *flash, uint8_t *buf, unsigned int start, unsigned int len)
379{
380 flashprog_progress_start(flash, FLASHPROG_PROGRESS_READ, len);
381 const int ret = flash->chip->read(flash, buf, start, len);
382 flashprog_progress_finish(flash);
383 return ret;
384}
385
Uwe Hermann48ec1b12010-08-08 17:01:18 +0000386/*
Carl-Daniel Hailfingerd0250a32009-11-25 17:05:52 +0000387 * @cmpbuf buffer to compare against, cmpbuf[0] is expected to match the
Uwe Hermann91f4afa2011-07-28 08:13:25 +0000388 * flash content at location start
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000389 * @start offset to the base address of the flash chip
390 * @len length of the verified area
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000391 * @return 0 for success, -1 for failure
392 */
Mark Marshallf20b7be2014-05-09 21:16:21 +0000393int verify_range(struct flashctx *flash, const uint8_t *cmpbuf, unsigned int start, unsigned int len)
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000394{
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000395 if (!len)
Stefan Taunerdf64a422014-05-27 00:06:14 +0000396 return -1;
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000397
Edward O'Callaghan6ae640b2021-11-17 14:24:04 +1100398 if (start + len > flash->chip->total_size * 1024) {
399 msg_gerr("Error: %s called with start 0x%x + len 0x%x >"
400 " total_size 0x%x\n", __func__, start, len,
401 flash->chip->total_size * 1024);
402 return -1;
403 }
404
Stefan Taunerdf64a422014-05-27 00:06:14 +0000405 uint8_t *readbuf = malloc(len);
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000406 if (!readbuf) {
Edward O'Callaghana31a5722022-11-12 12:05:36 +1100407 msg_gerr("Out of memory!\n");
Stefan Taunerdf64a422014-05-27 00:06:14 +0000408 return -1;
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000409 }
410
Edward O'Callaghan6ae640b2021-11-17 14:24:04 +1100411 int ret = flash->chip->read(flash, readbuf, start, len);
Carl-Daniel Hailfingerd8369412010-11-16 17:21:58 +0000412 if (ret) {
413 msg_gerr("Verification impossible because read failed "
414 "at 0x%x (len 0x%x)\n", start, len);
Stefan Taunerdf64a422014-05-27 00:06:14 +0000415 ret = -1;
416 goto out_free;
Carl-Daniel Hailfingerd8369412010-11-16 17:21:58 +0000417 }
418
Stefan Tauner78ffbea2012-10-27 15:36:56 +0000419 ret = compare_range(cmpbuf, readbuf, start, len);
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000420out_free:
421 free(readbuf);
422 return ret;
423}
424
Nico Huber3ac761c2023-01-16 02:43:17 +0100425size_t gran_to_bytes(const enum write_granularity gran)
Nico Huberb77607f2023-01-16 02:25:45 +0100426{
427 switch (gran) {
428 case write_gran_1bit: return 1;
429 case write_gran_1byte: return 1;
430 case write_gran_1byte_implicit_erase: return 1;
431 case write_gran_128bytes: return 128;
432 case write_gran_256bytes: return 256;
433 case write_gran_264bytes: return 264;
434 case write_gran_512bytes: return 512;
435 case write_gran_528bytes: return 528;
436 case write_gran_1024bytes: return 1024;
437 case write_gran_1056bytes: return 1056;
438 default: return 0;
439 }
440}
441
Stefan Tauner02437452013-04-01 19:34:53 +0000442/* Helper function for need_erase() that focuses on granularities of gran bytes. */
Paul Kocialkowski995f7552018-01-15 01:06:09 +0300443static int need_erase_gran_bytes(const uint8_t *have, const uint8_t *want, unsigned int len,
444 unsigned int gran, const uint8_t erased_value)
Stefan Tauner02437452013-04-01 19:34:53 +0000445{
446 unsigned int i, j, limit;
447 for (j = 0; j < len / gran; j++) {
448 limit = min (gran, len - j * gran);
449 /* Are 'have' and 'want' identical? */
450 if (!memcmp(have + j * gran, want + j * gran, limit))
451 continue;
452 /* have needs to be in erased state. */
453 for (i = 0; i < limit; i++)
Paul Kocialkowski995f7552018-01-15 01:06:09 +0300454 if (have[j * gran + i] != erased_value)
Stefan Tauner02437452013-04-01 19:34:53 +0000455 return 1;
456 }
457 return 0;
458}
459
Uwe Hermann48ec1b12010-08-08 17:01:18 +0000460/*
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000461 * Check if the buffer @have can be programmed to the content of @want without
462 * erasing. This is only possible if all chunks of size @gran are either kept
463 * as-is or changed from an all-ones state to any other state.
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000464 *
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000465 * Warning: This function assumes that @have and @want point to naturally
466 * aligned regions.
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000467 *
468 * @have buffer with current content
469 * @want buffer with desired content
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000470 * @len length of the checked area
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000471 * @gran write granularity (enum, not count)
472 * @return 0 if no erase is needed, 1 otherwise
473 */
Edward O'Callaghana1805092022-05-16 11:10:36 +1000474static int need_erase(const uint8_t *have, const uint8_t *want, unsigned int len,
475 enum write_granularity gran, const uint8_t erased_value)
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000476{
Stefan Tauner02437452013-04-01 19:34:53 +0000477 unsigned int i;
Nico Huberb77607f2023-01-16 02:25:45 +0100478 size_t stride;
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000479
480 switch (gran) {
481 case write_gran_1bit:
Nico Huberb77607f2023-01-16 02:25:45 +0100482 for (i = 0; i < len; i++) {
483 if ((have[i] & want[i]) != want[i])
484 return 1;
485 }
486 return 0;
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000487 case write_gran_1byte:
Nico Huberb77607f2023-01-16 02:25:45 +0100488 for (i = 0; i < len; i++) {
489 if ((have[i] != want[i]) && (have[i] != erased_value))
490 return 1;
491 }
492 return 0;
Carl-Daniel Hailfinger1b0e9fc2014-06-16 22:36:17 +0000493 case write_gran_1byte_implicit_erase:
494 /* Do not erase, handle content changes from anything->0xff by writing 0xff. */
Nico Huberb77607f2023-01-16 02:25:45 +0100495 return 0;
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000496 default:
Nico Huberb77607f2023-01-16 02:25:45 +0100497 stride = gran_to_bytes(gran);
498 if (stride) {
499 return need_erase_gran_bytes(have, want, len, stride, erased_value);
500 }
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000501 msg_cerr("%s: Unsupported granularity! Please report a bug at "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200502 "flashprog@flashprog.org\n", __func__);
Nico Huberb77607f2023-01-16 02:25:45 +0100503 return 0;
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000504 }
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000505}
506
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000507/**
508 * Check if the buffer @have needs to be programmed to get the content of @want.
509 * If yes, return 1 and fill in first_start with the start address of the
510 * write operation and first_len with the length of the first to-be-written
511 * chunk. If not, return 0 and leave first_start and first_len undefined.
512 *
513 * Warning: This function assumes that @have and @want point to naturally
514 * aligned regions.
515 *
516 * @have buffer with current content
517 * @want buffer with desired content
518 * @len length of the checked area
519 * @gran write granularity (enum, not count)
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000520 * @first_start offset of the first byte which needs to be written (passed in
521 * value is increased by the offset of the first needed write
522 * relative to have/want or unchanged if no write is needed)
523 * @return length of the first contiguous area which needs to be written
524 * 0 if no write is needed
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000525 *
526 * FIXME: This function needs a parameter which tells it about coalescing
527 * in relation to the max write length of the programmer and the max write
528 * length of the chip.
529 */
Nico Huber3b9c86d2023-01-15 22:58:06 +0100530static unsigned int get_next_write(const uint8_t *have, const uint8_t *want, chipsize_t len,
531 chipoff_t *first_start, enum write_granularity gran)
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000532{
Felix Singerf25447e2022-08-19 02:44:28 +0200533 bool need_write = false;
Stefan Taunerc69c9c82011-11-23 09:13:48 +0000534 unsigned int rel_start = 0, first_len = 0;
Nico Huberb77607f2023-01-16 02:25:45 +0100535 unsigned int i, limit;
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000536
Nico Huberb77607f2023-01-16 02:25:45 +0100537 const size_t stride = gran_to_bytes(gran);
538 if (!stride) {
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000539 msg_cerr("%s: Unsupported granularity! Please report a bug at "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200540 "flashprog@flashprog.org\n", __func__);
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000541 /* Claim that no write was needed. A write with unknown
542 * granularity is too dangerous to try.
543 */
544 return 0;
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000545 }
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000546 for (i = 0; i < len / stride; i++) {
547 limit = min(stride, len - i * stride);
548 /* Are 'have' and 'want' identical? */
549 if (memcmp(have + i * stride, want + i * stride, limit)) {
550 if (!need_write) {
551 /* First location where have and want differ. */
Felix Singerf25447e2022-08-19 02:44:28 +0200552 need_write = true;
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000553 rel_start = i * stride;
554 }
555 } else {
556 if (need_write) {
557 /* First location where have and want
558 * do not differ anymore.
559 */
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000560 break;
561 }
562 }
563 }
Carl-Daniel Hailfinger202bf532010-12-06 13:05:44 +0000564 if (need_write)
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000565 first_len = min(i * stride - rel_start, len);
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000566 *first_start += rel_start;
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000567 return first_len;
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000568}
569
Nico Huber2d625722016-05-03 10:48:02 +0200570/*
571 * Return a string corresponding to the bustype parameter.
572 * Memory is obtained with malloc() and must be freed with free() by the caller.
573 */
574char *flashbuses_to_text(enum chipbustype bustype)
575{
576 char *ret = calloc(1, 1);
577 /*
578 * FIXME: Once all chipsets and flash chips have been updated, NONSPI
579 * will cease to exist and should be eliminated here as well.
580 */
581 if (bustype == BUS_NONSPI) {
582 ret = strcat_realloc(ret, "Non-SPI, ");
583 } else {
584 if (bustype & BUS_PARALLEL)
585 ret = strcat_realloc(ret, "Parallel, ");
586 if (bustype & BUS_LPC)
587 ret = strcat_realloc(ret, "LPC, ");
588 if (bustype & BUS_FWH)
589 ret = strcat_realloc(ret, "FWH, ");
590 if (bustype & BUS_SPI)
591 ret = strcat_realloc(ret, "SPI, ");
592 if (bustype & BUS_PROG)
593 ret = strcat_realloc(ret, "Programmer-specific, ");
594 if (bustype == BUS_NONE)
595 ret = strcat_realloc(ret, "None, ");
596 }
597 /* Kill last comma. */
598 ret[strlen(ret) - 2] = '\0';
599 ret = realloc(ret, strlen(ret) + 1);
600 return ret;
601}
602
Edward O'Callaghan00ea3892022-10-11 21:27:37 +1100603static int init_default_layout(struct flashctx *flash)
604{
605 /* Fill default layout covering the whole chip. */
Nico Huberc3b02dc2023-08-12 01:13:45 +0200606 if (flashprog_layout_new(&flash->default_layout) ||
607 flashprog_layout_add_region(flash->default_layout,
Edward O'Callaghan00ea3892022-10-11 21:27:37 +1100608 0, flash->chip->total_size * 1024 - 1, "complete flash") ||
Nico Huberc3b02dc2023-08-12 01:13:45 +0200609 flashprog_layout_include_region(flash->default_layout, "complete flash"))
Edward O'Callaghan00ea3892022-10-11 21:27:37 +1100610 return -1;
611 return 0;
612}
613
Carl-Daniel Hailfingera5bcbce2014-07-19 22:03:29 +0000614int probe_flash(struct registered_master *mst, int startchip, struct flashctx *flash, int force)
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000615{
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000616 const struct flashchip *chip;
Carl-Daniel Hailfinger115d3902009-10-31 01:53:09 +0000617 enum chipbustype buses_common;
Carl-Daniel Hailfingerb22918c2009-06-01 02:08:58 +0000618 char *tmp;
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000619
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000620 for (chip = flashchips + startchip; chip && chip->name; chip++) {
621 if (chip_to_probe && strcmp(chip->name, chip_to_probe) != 0)
Ollie Lhocbbf1252004-03-17 22:22:08 +0000622 continue;
Carl-Daniel Hailfingera5bcbce2014-07-19 22:03:29 +0000623 buses_common = mst->buses_supported & chip->bustype;
Carl-Daniel Hailfingerc40cff72011-12-20 00:19:29 +0000624 if (!buses_common)
Carl-Daniel Hailfinger6573b742011-06-17 22:38:53 +0000625 continue;
Mike Banon31b5e3b2018-01-15 01:10:00 +0300626 /* Only probe for SPI25 chips by default. */
627 if (chip->bustype == BUS_SPI && !chip_to_probe && chip->spi_cmd_set != SPI25)
628 continue;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000629 msg_gdbg("Probing for %s %s, %d kB: ", chip->vendor, chip->name, chip->total_size);
630 if (!chip->probe && !force) {
Nico Huberc3b02dc2023-08-12 01:13:45 +0200631 msg_gdbg("failed! flashprog has no probe function for this flash chip.\n");
Carl-Daniel Hailfingerb22918c2009-06-01 02:08:58 +0000632 continue;
633 }
Stefan Reinauer70385642007-04-06 11:58:03 +0000634
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000635 /* Start filling in the dynamic data. */
Angel Pons690a9442021-06-07 12:33:53 +0200636 flash->chip = calloc(1, sizeof(*flash->chip));
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000637 if (!flash->chip) {
638 msg_gerr("Out of memory!\n");
Edward O'Callaghan6edf9f82022-11-12 12:08:46 +1100639 return -1;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000640 }
Angel Pons7e134562021-06-07 13:29:13 +0200641 *flash->chip = *chip;
Nico Huber9a11cbf2023-01-13 01:19:07 +0100642 flash->mst.par = &mst->par; /* both `mst` are unions, so we need only one pointer */
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000643
Nico Huber9eec4072023-01-12 01:17:30 +0100644 if (flash->chip->prepare_access && flash->chip->prepare_access(flash, PREPARE_PROBE))
645 goto free_chip;
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000646
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000647 /* We handle a forced match like a real match, we just avoid probing. Note that probe_flash()
648 * is only called with force=1 after normal probing failed.
649 */
Peter Stuge27c3e2d2008-07-02 17:15:47 +0000650 if (force)
651 break;
Stefan Reinauerfcb63682006-03-16 16:57:41 +0000652
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000653 if (flash->chip->probe(flash) != 1)
Peter Stuge483b8f02008-09-03 23:10:05 +0000654 goto notfound;
655
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000656 /* If this is the first chip found, accept it.
657 * If this is not the first chip found, accept it only if it is
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000658 * a non-generic match. SFDP and CFI are generic matches.
659 * startchip==0 means this call to probe_flash() is the first
Carl-Daniel Hailfingera5bcbce2014-07-19 22:03:29 +0000660 * one for this programmer interface (master) and thus no other chip has
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000661 * been found on this interface.
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000662 */
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000663 if (startchip == 0 && flash->chip->model_id == SFDP_DEVICE_ID) {
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000664 msg_cinfo("===\n"
665 "SFDP has autodetected a flash chip which is "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200666 "not natively supported by flashprog yet.\n");
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000667 if (count_usable_erasers(flash) == 0)
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000668 msg_cinfo("The standard operations read and "
669 "verify should work, but to support "
670 "erase, write and all other "
671 "possible features");
672 else
673 msg_cinfo("All standard operations (read, "
674 "verify, erase and write) should "
675 "work, but to support all possible "
676 "features");
677
Stefan Taunerb4e06bd2012-08-20 00:24:22 +0000678 msg_cinfo(" we need to add them manually.\n"
679 "You can help us by mailing us the output of the following command to "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200680 "flashprog@flashprog.org:\n"
681 "'flashprog -VV [plus the -p/--programmer parameter]'\n"
Stefan Taunerb4e06bd2012-08-20 00:24:22 +0000682 "Thanks for your help!\n"
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000683 "===\n");
684 }
685
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000686 /* First flash chip detected on this bus. */
687 if (startchip == 0)
Peter Stuge27c3e2d2008-07-02 17:15:47 +0000688 break;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000689 /* Not the first flash chip detected on this bus, but not a generic match either. */
690 if ((flash->chip->model_id != GENERIC_DEVICE_ID) && (flash->chip->model_id != SFDP_DEVICE_ID))
691 break;
692 /* Not the first flash chip detected on this bus, and it's just a generic match. Ignore it. */
Peter Stuge483b8f02008-09-03 23:10:05 +0000693notfound:
Nico Huber9eec4072023-01-12 01:17:30 +0100694 if (flash->chip->finish_access)
695 flash->chip->finish_access(flash);
696free_chip:
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000697 free(flash->chip);
698 flash->chip = NULL;
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000699 }
Uwe Hermannffec5f32007-08-23 16:08:21 +0000700
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000701 if (!flash->chip)
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000702 return -1;
Peter Stuge27c3e2d2008-07-02 17:15:47 +0000703
Edward O'Callaghan00ea3892022-10-11 21:27:37 +1100704 if (init_default_layout(flash) < 0)
705 return -1;
Stefan Reinauer051e2362011-01-19 06:21:54 +0000706
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000707 tmp = flashbuses_to_text(flash->chip->bustype);
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000708 msg_cinfo("%s %s flash chip \"%s\" (%d kB, %s) ", force ? "Assuming" : "Found",
709 flash->chip->vendor, flash->chip->name, flash->chip->total_size, tmp);
Stefan Tauner00155492011-06-26 20:45:35 +0000710 free(tmp);
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000711#if CONFIG_INTERNAL == 1
Nico Huber0e76d992023-01-12 20:22:55 +0100712 if (flash->physical_memory != 0 && mst->par.map_flash == physmap)
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000713 msg_cinfo("mapped at physical address 0x%0*" PRIxPTR ".\n",
714 PRIxPTR_WIDTH, flash->physical_memory);
715 else
716#endif
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +0200717 msg_cinfo("on %s.\n", programmer->name);
Uwe Hermann9899cad2009-06-28 21:47:57 +0000718
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000719 /* Flash registers may more likely not be mapped if the chip was forced.
720 * Lock info may be stored in registers, so avoid lock info printing. */
Carl-Daniel Hailfinger859f3f02010-12-02 21:59:42 +0000721 if (!force)
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000722 if (flash->chip->printlock)
723 flash->chip->printlock(flash);
Sean Nelson6e0b9122010-02-19 00:52:10 +0000724
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000725 /* Get out of the way for later runs. */
Nico Huber9eec4072023-01-12 01:17:30 +0100726 if (flash->chip->finish_access)
727 flash->chip->finish_access(flash);
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000728
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000729 /* Return position of matching chip. */
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000730 return chip - flashchips;
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000731}
732
Stefan Tauner96658be2014-05-26 22:05:31 +0000733/* Even if an error is found, the function will keep going and check the rest. */
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000734static int selfcheck_eraseblocks(const struct flashchip *chip)
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000735{
Carl-Daniel Hailfinger082c8b52011-08-15 19:54:20 +0000736 int i, j, k;
737 int ret = 0;
Aarya Chaumal478e1792022-06-04 01:34:44 +0530738 unsigned int prev_eraseblock_count = chip->total_size * 1024;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000739
740 for (k = 0; k < NUM_ERASEFUNCTIONS; k++) {
741 unsigned int done = 0;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000742 struct block_eraser eraser = chip->block_erasers[k];
Aarya Chaumal478e1792022-06-04 01:34:44 +0530743 unsigned int curr_eraseblock_count = 0;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000744
745 for (i = 0; i < NUM_ERASEREGIONS; i++) {
746 /* Blocks with zero size are bugs in flashchips.c. */
747 if (eraser.eraseblocks[i].count &&
748 !eraser.eraseblocks[i].size) {
Nico Huberac90af62022-12-18 00:22:47 +0000749 msg_gerr("ERROR: Flash chip %s erase function %i region %i has size 0.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +0200750 "Please report a bug at flashprog@flashprog.org\n",
Nico Huberac90af62022-12-18 00:22:47 +0000751 chip->name, k, i);
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000752 ret = 1;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000753 }
754 /* Blocks with zero count are bugs in flashchips.c. */
755 if (!eraser.eraseblocks[i].count &&
756 eraser.eraseblocks[i].size) {
Nico Huberac90af62022-12-18 00:22:47 +0000757 msg_gerr("ERROR: Flash chip %s erase function %i region %i has count 0.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +0200758 "Please report a bug at flashprog@flashprog.org\n",
Nico Huberac90af62022-12-18 00:22:47 +0000759 chip->name, k, i);
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000760 ret = 1;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000761 }
762 done += eraser.eraseblocks[i].count *
763 eraser.eraseblocks[i].size;
Aarya Chaumal478e1792022-06-04 01:34:44 +0530764 curr_eraseblock_count += eraser.eraseblocks[i].count;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000765 }
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000766 /* Empty eraseblock definition with erase function. */
767 if (!done && eraser.block_erase)
Sean Nelson316a29f2010-05-07 20:09:04 +0000768 msg_gspew("Strange: Empty eraseblock definition with "
Uwe Hermann91f4afa2011-07-28 08:13:25 +0000769 "non-empty erase function. Not an error.\n");
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000770 if (!done)
771 continue;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000772 if (done != chip->total_size * 1024) {
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000773 msg_gerr("ERROR: Flash chip %s erase function %i "
774 "region walking resulted in 0x%06x bytes total,"
Nico Huberac90af62022-12-18 00:22:47 +0000775 " expected 0x%06x bytes.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +0200776 "Please report a bug at flashprog@flashprog.org\n",
Nico Huberac90af62022-12-18 00:22:47 +0000777 chip->name, k, done, chip->total_size * 1024);
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000778 ret = 1;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000779 }
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000780 if (!eraser.block_erase)
781 continue;
782 /* Check if there are identical erase functions for different
783 * layouts. That would imply "magic" erase functions. The
784 * easiest way to check this is with function pointers.
785 */
Uwe Hermann43959702010-03-13 17:28:29 +0000786 for (j = k + 1; j < NUM_ERASEFUNCTIONS; j++) {
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000787 if (eraser.block_erase ==
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000788 chip->block_erasers[j].block_erase) {
Nico Huberac90af62022-12-18 00:22:47 +0000789 msg_gerr("ERROR: Flash chip %s erase function %i and %i are identical.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +0200790 "Please report a bug at flashprog@flashprog.org\n",
Nico Huberac90af62022-12-18 00:22:47 +0000791 chip->name, k, j);
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000792 ret = 1;
793 }
Uwe Hermann43959702010-03-13 17:28:29 +0000794 }
Aarya Chaumal478e1792022-06-04 01:34:44 +0530795 if(curr_eraseblock_count > prev_eraseblock_count)
796 {
Nico Huberac90af62022-12-18 00:22:47 +0000797 msg_gerr("ERROR: Flash chip %s erase function %i is not in order.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +0200798 "Please report a bug at flashprog@flashprog.org\n",
Nico Huberac90af62022-12-18 00:22:47 +0000799 chip->name, k);
Aarya Chaumal478e1792022-06-04 01:34:44 +0530800 ret = 1;
801 }
802 prev_eraseblock_count = curr_eraseblock_count;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000803 }
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000804 return ret;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000805}
806
Carl-Daniel Hailfinger63fd9022011-12-14 22:25:15 +0000807static int check_block_eraser(const struct flashctx *flash, int k, int log)
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000808{
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000809 struct block_eraser eraser = flash->chip->block_erasers[k];
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000810
811 if (!eraser.block_erase && !eraser.eraseblocks[0].count) {
812 if (log)
813 msg_cdbg("not defined. ");
814 return 1;
815 }
816 if (!eraser.block_erase && eraser.eraseblocks[0].count) {
817 if (log)
818 msg_cdbg("eraseblock layout is known, but matching "
Stefan Tauner355cbfd2011-05-28 02:37:14 +0000819 "block erase function is not implemented. ");
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000820 return 1;
821 }
822 if (eraser.block_erase && !eraser.eraseblocks[0].count) {
823 if (log)
824 msg_cdbg("block erase function found, but "
Stefan Tauner355cbfd2011-05-28 02:37:14 +0000825 "eraseblock layout is not defined. ");
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000826 return 1;
827 }
Aarya Chaumal6d98aec2022-08-14 23:16:44 +0530828
829 if (flash->chip->bustype == BUS_SPI) {
Nico Huber13389362024-03-05 18:35:30 +0100830 bool native_4ba;
Nico Huber13f97a52023-01-14 23:55:06 +0100831 int i;
Nico Huber13389362024-03-05 18:35:30 +0100832
833 const uint8_t *opcode = spi_get_opcode_from_erasefn(eraser.block_erase, &native_4ba);
Nico Huber13f97a52023-01-14 23:55:06 +0100834 for (i = 0; opcode[i]; i++) {
Nico Huber13389362024-03-05 18:35:30 +0100835 if ((native_4ba && !spi_master_4ba(flash)) ||
Nico Huber9a11cbf2023-01-13 01:19:07 +0100836 !flash->mst.spi->probe_opcode(flash, opcode[i])) {
Aarya Chaumal6d98aec2022-08-14 23:16:44 +0530837 if (log)
838 msg_cdbg("block erase function and layout found "
839 "but SPI master doesn't support the function. ");
840 return 1;
841 }
842 }
843 }
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000844 // TODO: Once erase functions are annotated with allowed buses, check that as well.
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000845 return 0;
846}
847
Nico Huber7af0e792016-04-29 16:40:15 +0200848/**
849 * @brief Reads the included layout regions into a buffer.
850 *
851 * If there is no layout set in the given flash context, the whole chip will
852 * be read.
853 *
854 * @param flashctx Flash context to be used.
855 * @param buffer Buffer of full chip size to read into.
856 * @return 0 on success,
857 * 1 if any read fails.
858 */
859static int read_by_layout(struct flashctx *const flashctx, uint8_t *const buffer)
860{
Nico Huberc3b02dc2023-08-12 01:13:45 +0200861 const struct flashprog_layout *const layout = get_layout(flashctx);
Nico Huber5ca55232019-06-15 22:29:08 +0200862 const struct romentry *entry = NULL;
Nico Huber7af0e792016-04-29 16:40:15 +0200863
Richard Hughes842d6782021-01-15 09:48:12 +0000864 flashprog_progress_start_by_layout(flashctx, FLASHPROG_PROGRESS_READ, layout);
865
Nico Huber5ca55232019-06-15 22:29:08 +0200866 while ((entry = layout_next_included(layout, entry))) {
867 const chipoff_t region_start = entry->start;
868 const chipsize_t region_len = entry->end - entry->start + 1;
Nico Huber7af0e792016-04-29 16:40:15 +0200869
870 if (flashctx->chip->read(flashctx, buffer + region_start, region_start, region_len))
871 return 1;
872 }
Richard Hughes842d6782021-01-15 09:48:12 +0000873
874 flashprog_progress_finish(flashctx);
875
Nico Huber7af0e792016-04-29 16:40:15 +0200876 return 0;
877}
878
Nico Huber7af0e792016-04-29 16:40:15 +0200879/**
880 * @private
881 *
882 * For read-erase-write, `curcontents` and `newcontents` shall point
883 * to buffers of the chip's size. Both are supposed to be prefilled
884 * with at least the included layout regions of the current flash
885 * contents (`curcontents`) and the data to be written to the flash
886 * (`newcontents`).
887 *
888 * For erase, `curcontents` and `newcontents` shall be NULL-pointers.
889 *
890 * The `chipoff_t` values are used internally by `walk_by_layout()`.
891 */
892struct walk_info {
893 uint8_t *curcontents;
894 const uint8_t *newcontents;
895 chipoff_t region_start;
896 chipoff_t region_end;
897 chipoff_t erase_start;
898 chipoff_t erase_end;
899};
Nico Huber3b9c86d2023-01-15 22:58:06 +0100900
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530901struct eraseblock_data {
902 chipoff_t start_addr;
903 chipoff_t end_addr;
904 bool selected;
905 size_t block_num;
906 size_t first_sub_block_index;
907 size_t last_sub_block_index;
908};
909
910struct erase_layout {
911 struct eraseblock_data* layout_list;
912 size_t block_count;
913 const struct block_eraser *eraser;
914};
915
Nico Huber5ff6fdc2023-01-15 23:43:12 +0100916static bool explicit_erase(const struct walk_info *const info)
917{
918 /* For explicit erase, we are called without new contents. */
919 return !info->newcontents;
920}
921
Nico Huberd96e7032023-01-14 22:31:48 +0100922static size_t calculate_block_count(const struct block_eraser *const eraser)
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530923{
Nico Huberd96e7032023-01-14 22:31:48 +0100924 size_t block_count = 0, i;
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530925
Nico Huberd96e7032023-01-14 22:31:48 +0100926 for (i = 0; i < ARRAY_SIZE(eraser->eraseblocks); ++i)
927 block_count += eraser->eraseblocks[i].count;
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530928
929 return block_count;
930}
931
932static void init_eraseblock(struct erase_layout *layout, size_t idx, size_t block_num,
933 chipoff_t start_addr, chipoff_t end_addr, size_t *sub_block_index)
934{
935 struct eraseblock_data *edata = &layout[idx].layout_list[block_num];
936 edata->start_addr = start_addr;
937 edata->end_addr = end_addr;
938 edata->selected = false;
939 edata->block_num = block_num;
940
941 if (!idx)
942 return;
Nico Hubera02df332023-01-14 23:06:27 +0100943 const struct erase_layout *const sub_layout = &layout[idx - 1];
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530944
945 edata->first_sub_block_index = *sub_block_index;
Nico Hubera02df332023-01-14 23:06:27 +0100946 for (; *sub_block_index < sub_layout->block_count; ++*sub_block_index) {
947 if (sub_layout->layout_list[*sub_block_index].end_addr > end_addr)
948 break;
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530949 }
950 edata->last_sub_block_index = *sub_block_index - 1;
951}
952
953/*
954 * @brief Function to free the created erase_layout
955 *
956 * @param layout pointer to allocated layout
957 * @param erasefn_count number of erase functions for which the layout was created
958 *
959 */
960static void free_erase_layout(struct erase_layout *layout, unsigned int erasefn_count)
961{
Nico Huber13f97a52023-01-14 23:55:06 +0100962 size_t i;
963
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530964 if (!layout)
965 return;
Nico Huber13f97a52023-01-14 23:55:06 +0100966 for (i = 0; i < erasefn_count; i++) {
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530967 free(layout[i].layout_list);
968 }
969 free(layout);
970}
971
972/*
973 * @brief Function to create an erase layout
974 *
975 * @param flashctx flash context
976 * @param e_layout address to the pointer to store the layout
977 * @return 0 on success,
978 * -1 if layout creation fails
979 *
980 * This function creates a layout of which erase functions erase which regions
981 * of the flash chip. This helps to optimally select the erase functions for
982 * erase/write operations.
983 */
Nico Huberc09fca42023-01-29 15:58:09 +0100984static int create_erase_layout(struct flashctx *const flashctx, struct erase_layout **e_layout)
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530985{
986 const struct flashchip *chip = flashctx->chip;
987 const size_t erasefn_count = count_usable_erasers(flashctx);
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530988
989 if (!erasefn_count) {
990 msg_gerr("No erase functions supported\n");
991 return 0;
992 }
993
Nico Huberd34864b2023-01-14 23:47:19 +0100994 struct erase_layout *layout = calloc(erasefn_count, sizeof(struct erase_layout));
995 if (!layout) {
996 msg_gerr("Out of memory!\n");
997 return -1;
998 }
999
Nico Huber13f97a52023-01-14 23:55:06 +01001000 size_t layout_idx = 0, eraser_idx;
1001 for (eraser_idx = 0; eraser_idx < NUM_ERASEFUNCTIONS; eraser_idx++) {
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301002 if (check_block_eraser(flashctx, eraser_idx, 0))
1003 continue;
1004
1005 layout[layout_idx].eraser = &chip->block_erasers[eraser_idx];
Nico Huberd96e7032023-01-14 22:31:48 +01001006 const size_t block_count = calculate_block_count(&chip->block_erasers[eraser_idx]);
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301007 size_t sub_block_index = 0;
1008
1009 layout[layout_idx].block_count = block_count;
1010 layout[layout_idx].layout_list = (struct eraseblock_data *)calloc(block_count,
1011 sizeof(struct eraseblock_data));
1012
1013 if (!layout[layout_idx].layout_list) {
1014 free_erase_layout(layout, layout_idx);
1015 return -1;
1016 }
1017
1018 size_t block_num = 0;
1019 chipoff_t start_addr = 0;
1020
Nico Huber13f97a52023-01-14 23:55:06 +01001021 int i;
1022 for (i = 0; block_num < block_count; i++) {
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301023 const struct eraseblock *block = &chip->block_erasers[eraser_idx].eraseblocks[i];
1024
Nico Huber13f97a52023-01-14 23:55:06 +01001025 size_t num;
1026 for (num = 0; num < block->count; num++) {
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301027 chipoff_t end_addr = start_addr + block->size - 1;
1028 init_eraseblock(layout, layout_idx, block_num,
1029 start_addr, end_addr, &sub_block_index);
1030 block_num += 1;
1031 start_addr = end_addr + 1;
1032 }
1033 }
1034 layout_idx++;
1035 }
1036
1037 *e_layout = layout;
1038 return layout_idx;
1039}
1040
Aarya Chaumald33bea42022-07-14 12:51:14 +05301041/*
1042 * @brief Function to select the list of sectors that need erasing
1043 *
1044 * @param flashctx flash context
1045 * @param layout erase layout
1046 * @param findex index of the erase function
1047 * @param block_num index of the block to erase according to the erase function index
Nico Huber00d1b9f2023-01-29 15:07:33 +01001048 * @param info current info from walking the regions
Nico Huberaa714dd2023-04-22 14:59:33 +02001049 * @return number of bytes selected for erase
Aarya Chaumald33bea42022-07-14 12:51:14 +05301050 */
Nico Huberaa714dd2023-04-22 14:59:33 +02001051static size_t select_erase_functions_rec(const struct flashctx *flashctx, const struct erase_layout *layout,
1052 size_t findex, size_t block_num, const struct walk_info *info)
Aarya Chaumald33bea42022-07-14 12:51:14 +05301053{
1054 struct eraseblock_data *ll = &layout[findex].layout_list[block_num];
Nico Huberaa714dd2023-04-22 14:59:33 +02001055 const size_t eraseblock_size = ll->end_addr - ll->start_addr + 1;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301056 if (!findex) {
Nico Hubercf6ff0a2023-01-29 15:45:06 +01001057 if (ll->start_addr <= info->region_end && ll->end_addr >= info->region_start) {
Nico Huber1494f8e2023-01-29 15:48:00 +01001058 if (explicit_erase(info)) {
1059 ll->selected = true;
Nico Huberaa714dd2023-04-22 14:59:33 +02001060 return eraseblock_size;
Nico Huber1494f8e2023-01-29 15:48:00 +01001061 }
Nico Hubera6212482023-01-29 15:39:26 +01001062 const chipoff_t write_start = MAX(info->region_start, ll->start_addr);
1063 const chipoff_t write_end = MIN(info->region_end, ll->end_addr);
1064 const chipsize_t write_len = write_end - write_start + 1;
1065 const uint8_t erased_value = ERASED_VALUE(flashctx);
Nico Huber00d1b9f2023-01-29 15:07:33 +01001066 ll->selected = need_erase(
Nico Hubera6212482023-01-29 15:39:26 +01001067 info->curcontents + write_start, info->newcontents + write_start,
1068 write_len, flashctx->chip->gran, erased_value);
Nico Huberaa714dd2023-04-22 14:59:33 +02001069 if (ll->selected)
1070 return eraseblock_size;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301071 }
Nico Huberaa714dd2023-04-22 14:59:33 +02001072 return 0;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301073 } else {
Aarya Chaumald33bea42022-07-14 12:51:14 +05301074 const int sub_block_start = ll->first_sub_block_index;
1075 const int sub_block_end = ll->last_sub_block_index;
Nico Huberaa714dd2023-04-22 14:59:33 +02001076 size_t bytes = 0;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301077
Nico Huber13f97a52023-01-14 23:55:06 +01001078 int j;
Nico Huberaa714dd2023-04-22 14:59:33 +02001079 for (j = sub_block_start; j <= sub_block_end; j++)
1080 bytes += select_erase_functions_rec(flashctx, layout, findex - 1, j, info);
Aarya Chaumald33bea42022-07-14 12:51:14 +05301081
Nico Huberaa714dd2023-04-22 14:59:33 +02001082 if (bytes > eraseblock_size / 2) {
Nico Huber00d1b9f2023-01-29 15:07:33 +01001083 if (ll->start_addr >= info->region_start && ll->end_addr <= info->region_end) {
Nico Huber13f97a52023-01-14 23:55:06 +01001084 for (j = sub_block_start; j <= sub_block_end; j++)
Aarya Chaumald33bea42022-07-14 12:51:14 +05301085 layout[findex - 1].layout_list[j].selected = false;
1086 ll->selected = true;
Nico Huberaa714dd2023-04-22 14:59:33 +02001087 bytes = eraseblock_size;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301088 }
1089 }
Nico Huberaa714dd2023-04-22 14:59:33 +02001090 return bytes;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301091 }
1092}
1093
Nico Huberaa714dd2023-04-22 14:59:33 +02001094static size_t select_erase_functions(const struct flashctx *flashctx, const struct erase_layout *layout,
1095 size_t erasefn_count, const struct walk_info *info)
Nico Huberb11b72c2023-01-29 15:33:11 +01001096{
Nico Huberaa714dd2023-04-22 14:59:33 +02001097 size_t bytes = 0;
Nico Huberb11b72c2023-01-29 15:33:11 +01001098 size_t block_num;
1099 for (block_num = 0; block_num < layout[erasefn_count - 1].block_count; ++block_num)
Nico Huberaa714dd2023-04-22 14:59:33 +02001100 bytes += select_erase_functions_rec(flashctx, layout, erasefn_count - 1, block_num, info);
1101 return bytes;
Nico Huberb11b72c2023-01-29 15:33:11 +01001102}
1103
Nico Huber3b9c86d2023-01-15 22:58:06 +01001104static int write_range(struct flashctx *const flashctx, const chipoff_t flash_offset,
1105 const uint8_t *const curcontents, const uint8_t *const newcontents,
1106 const chipsize_t len, bool *const skipped)
1107{
1108 unsigned int writecount = 0;
1109 chipoff_t starthere = 0;
1110 chipsize_t lenhere = 0;
1111
1112 while ((lenhere = get_next_write(curcontents + starthere, newcontents + starthere,
1113 len - starthere, &starthere, flashctx->chip->gran))) {
1114 if (!writecount++)
1115 msg_cdbg("W");
1116 if (flashctx->chip->write(flashctx, newcontents + starthere,
1117 flash_offset + starthere, lenhere))
1118 return 1;
1119 starthere += lenhere;
Richard Hughes842d6782021-01-15 09:48:12 +00001120 if (skipped) {
1121 flashprog_progress_set(flashctx, starthere);
Nico Huber3b9c86d2023-01-15 22:58:06 +01001122 *skipped = false;
Richard Hughes842d6782021-01-15 09:48:12 +00001123 }
Nico Huber3b9c86d2023-01-15 22:58:06 +01001124 }
1125 return 0;
1126}
1127
1128typedef int (*erasefn_t)(struct flashctx *, unsigned int addr, unsigned int len);
Nico Huber7af0e792016-04-29 16:40:15 +02001129/* returns 0 on success, 1 to retry with another erase function, 2 for immediate abort */
1130typedef int (*per_blockfn_t)(struct flashctx *, const struct walk_info *, erasefn_t);
1131
1132static int walk_eraseblocks(struct flashctx *const flashctx,
Nico Huberc09fca42023-01-29 15:58:09 +01001133 struct erase_layout *const layouts,
1134 const size_t layout_count,
Nico Huber7af0e792016-04-29 16:40:15 +02001135 struct walk_info *const info,
Nico Huberc09fca42023-01-29 15:58:09 +01001136 const per_blockfn_t per_blockfn)
Nico Huber7af0e792016-04-29 16:40:15 +02001137{
1138 int ret;
1139 size_t i, j;
1140 bool first = true;
Nico Huber7af0e792016-04-29 16:40:15 +02001141
Nico Huberc09fca42023-01-29 15:58:09 +01001142 for (i = 0; i < layout_count; ++i) {
1143 const struct erase_layout *const layout = &layouts[i];
Nico Huber7af0e792016-04-29 16:40:15 +02001144
Nico Huberc09fca42023-01-29 15:58:09 +01001145 for (j = 0; j < layout->block_count; ++j) {
1146 struct eraseblock_data *const eb = &layout->layout_list[j];
1147
1148 if (eb->start_addr > info->region_end)
Nico Huber7af0e792016-04-29 16:40:15 +02001149 break;
Nico Huberc09fca42023-01-29 15:58:09 +01001150 if (eb->end_addr < info->region_start)
1151 continue;
1152 if (!eb->selected)
1153 continue;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001154
Nico Huber7af0e792016-04-29 16:40:15 +02001155 /* Print this for every block except the first one. */
1156 if (first)
1157 first = false;
1158 else
1159 msg_cdbg(", ");
Nico Huberc09fca42023-01-29 15:58:09 +01001160 msg_cdbg("0x%06x-0x%06x:", eb->start_addr, eb->end_addr);
Nico Huber7af0e792016-04-29 16:40:15 +02001161
Nico Huberc09fca42023-01-29 15:58:09 +01001162 info->erase_start = eb->start_addr;
1163 info->erase_end = eb->end_addr;
1164 ret = per_blockfn(flashctx, info, layout->eraser->block_erase);
Nico Huber7af0e792016-04-29 16:40:15 +02001165 if (ret)
1166 return ret;
Nico Huberc09fca42023-01-29 15:58:09 +01001167
1168 /* Clean the erase layout up for future use on other
1169 regions. `.selected` is the only field we alter. */
1170 eb->selected = false;
Nico Huber7af0e792016-04-29 16:40:15 +02001171 }
Nico Huber7af0e792016-04-29 16:40:15 +02001172 }
1173 msg_cdbg("\n");
1174 return 0;
1175}
1176
1177static int walk_by_layout(struct flashctx *const flashctx, struct walk_info *const info,
1178 const per_blockfn_t per_blockfn)
1179{
Nico Huberc09fca42023-01-29 15:58:09 +01001180 const bool do_erase = explicit_erase(info) || !(flashctx->chip->feature_bits & FEATURE_NO_ERASE);
Nico Huberc3b02dc2023-08-12 01:13:45 +02001181 const struct flashprog_layout *const layout = get_layout(flashctx);
Nico Huberc09fca42023-01-29 15:58:09 +01001182 struct erase_layout *erase_layouts = NULL;
Nico Huber5ca55232019-06-15 22:29:08 +02001183 const struct romentry *entry = NULL;
Nico Huberc09fca42023-01-29 15:58:09 +01001184 int ret = 0, layout_count = 0;
Nico Huber7af0e792016-04-29 16:40:15 +02001185
1186 all_skipped = true;
1187 msg_cinfo("Erasing and writing flash chip... ");
1188
Nico Huberc09fca42023-01-29 15:58:09 +01001189 if (do_erase) {
1190 layout_count = create_erase_layout(flashctx, &erase_layouts);
1191 if (layout_count <= 0)
1192 return 1;
1193 }
1194
Nico Huber5ca55232019-06-15 22:29:08 +02001195 while ((entry = layout_next_included(layout, entry))) {
1196 info->region_start = entry->start;
1197 info->region_end = entry->end;
Nico Huber7af0e792016-04-29 16:40:15 +02001198
Nico Huberc09fca42023-01-29 15:58:09 +01001199 if (do_erase) {
Richard Hughes842d6782021-01-15 09:48:12 +00001200 const size_t total = select_erase_functions(flashctx, erase_layouts, layout_count, info);
1201
1202 /* We verify every erased block manually. Technically that's
1203 reading, but accounting for it as part of the erase helps
1204 to provide a smooth, overall progress. Hence `total * 2`. */
1205 flashprog_progress_start(flashctx, FLASHPROG_PROGRESS_ERASE, total * 2);
1206
Nico Huberc09fca42023-01-29 15:58:09 +01001207 ret = walk_eraseblocks(flashctx, erase_layouts, layout_count, info, per_blockfn);
1208 if (ret) {
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001209 msg_cerr("FAILED!\n");
Nico Huberc09fca42023-01-29 15:58:09 +01001210 goto free_ret;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001211 }
Richard Hughes842d6782021-01-15 09:48:12 +00001212
1213 flashprog_progress_finish(flashctx);
Nico Huber7af0e792016-04-29 16:40:15 +02001214 }
Nico Huberd34af7a2023-01-15 23:58:18 +01001215
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001216 if (info->newcontents) {
1217 bool skipped = true;
1218 msg_cdbg("0x%06x-0x%06x:", info->region_start, info->region_end);
Richard Hughes842d6782021-01-15 09:48:12 +00001219 flashprog_progress_start(flashctx, FLASHPROG_PROGRESS_WRITE,
1220 info->region_end - info->region_start + 1);
Nico Huberc09fca42023-01-29 15:58:09 +01001221 ret = write_range(flashctx, info->region_start,
1222 info->curcontents + info->region_start,
1223 info->newcontents + info->region_start,
1224 info->region_end + 1 - info->region_start, &skipped);
1225 if (ret) {
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001226 msg_cerr("FAILED!\n");
Nico Huberc09fca42023-01-29 15:58:09 +01001227 goto free_ret;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001228 }
Richard Hughes842d6782021-01-15 09:48:12 +00001229 flashprog_progress_finish(flashctx);
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001230 if (skipped) {
1231 msg_cdbg("S\n");
1232 } else {
1233 msg_cdbg("\n");
1234 all_skipped = false;
1235 }
Nico Huberd34af7a2023-01-15 23:58:18 +01001236 }
Nico Huber7af0e792016-04-29 16:40:15 +02001237 }
1238 if (all_skipped)
1239 msg_cinfo("\nWarning: Chip content is identical to the requested image.\n");
1240 msg_cinfo("Erase/write done.\n");
Nico Huberc09fca42023-01-29 15:58:09 +01001241
1242free_ret:
1243 free_erase_layout(erase_layouts, layout_count);
1244 return ret;
Nico Huber7af0e792016-04-29 16:40:15 +02001245}
1246
1247static int erase_block(struct flashctx *const flashctx,
1248 const struct walk_info *const info, const erasefn_t erasefn)
1249{
1250 const unsigned int erase_len = info->erase_end + 1 - info->erase_start;
Nico Huber6e61e0c2019-01-23 17:07:49 +01001251 const bool region_unaligned = info->region_start > info->erase_start ||
1252 info->erase_end > info->region_end;
1253 uint8_t *backup_contents = NULL, *erased_contents = NULL;
Nico Huberd34af7a2023-01-15 23:58:18 +01001254 int ret = 1;
Nico Huber7af0e792016-04-29 16:40:15 +02001255
Nico Huber6e61e0c2019-01-23 17:07:49 +01001256 /*
1257 * If the region is not erase-block aligned, merge current flash con-
1258 * tents into a new buffer `backup_contents`.
1259 */
1260 if (region_unaligned) {
1261 backup_contents = malloc(erase_len);
1262 erased_contents = malloc(erase_len);
1263 if (!backup_contents || !erased_contents) {
1264 msg_cerr("Out of memory!\n");
Nico Huber6e61e0c2019-01-23 17:07:49 +01001265 goto _free_ret;
1266 }
1267 memset(backup_contents, ERASED_VALUE(flashctx), erase_len);
1268 memset(erased_contents, ERASED_VALUE(flashctx), erase_len);
1269
1270 msg_cdbg("R");
1271 /* Merge data preceding the current region. */
1272 if (info->region_start > info->erase_start) {
1273 const chipoff_t start = info->erase_start;
1274 const chipsize_t len = info->region_start - info->erase_start;
1275 if (flashctx->chip->read(flashctx, backup_contents, start, len)) {
1276 msg_cerr("Can't read! Aborting.\n");
1277 goto _free_ret;
1278 }
1279 }
1280 /* Merge data following the current region. */
1281 if (info->erase_end > info->region_end) {
1282 const chipoff_t start = info->region_end + 1;
1283 const chipoff_t rel_start = start - info->erase_start; /* within this erase block */
1284 const chipsize_t len = info->erase_end - info->region_end;
1285 if (flashctx->chip->read(flashctx, backup_contents + rel_start, start, len)) {
1286 msg_cerr("Can't read! Aborting.\n");
1287 goto _free_ret;
1288 }
1289 }
1290 }
1291
Nico Huber7af0e792016-04-29 16:40:15 +02001292 all_skipped = false;
1293
1294 msg_cdbg("E");
1295 if (erasefn(flashctx, info->erase_start, erase_len))
Nico Huber6e61e0c2019-01-23 17:07:49 +01001296 goto _free_ret;
Richard Hughes842d6782021-01-15 09:48:12 +00001297 flashprog_progress_add(flashctx, erase_len);
Nico Huber7af0e792016-04-29 16:40:15 +02001298 if (check_erased_range(flashctx, info->erase_start, erase_len)) {
1299 msg_cerr("ERASE FAILED!\n");
Nico Huber6e61e0c2019-01-23 17:07:49 +01001300 goto _free_ret;
Nico Huber7af0e792016-04-29 16:40:15 +02001301 }
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001302 if (info->curcontents)
1303 memset(info->curcontents + info->erase_start, ERASED_VALUE(flashctx), erase_len);
Nico Huber6e61e0c2019-01-23 17:07:49 +01001304
1305 if (region_unaligned) {
Nico Huber3b9c86d2023-01-15 22:58:06 +01001306 if (write_range(flashctx, info->erase_start, erased_contents, backup_contents, erase_len, NULL))
1307 goto _free_ret;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001308 if (info->curcontents)
1309 memcpy(info->curcontents + info->erase_start, backup_contents, erase_len);
Nico Huber6e61e0c2019-01-23 17:07:49 +01001310 }
1311
1312 ret = 0;
1313
1314_free_ret:
1315 free(erased_contents);
1316 free(backup_contents);
1317 return ret;
Nico Huber7af0e792016-04-29 16:40:15 +02001318}
1319
1320/**
1321 * @brief Erases the included layout regions.
1322 *
1323 * If there is no layout set in the given flash context, the whole chip will
1324 * be erased.
1325 *
1326 * @param flashctx Flash context to be used.
Nico Huber7af0e792016-04-29 16:40:15 +02001327 * @return 0 on success,
1328 * 1 if all available erase functions failed.
1329 */
Nico Huber454f6132012-12-10 13:34:10 +00001330static int erase_by_layout(struct flashctx *const flashctx)
Nico Huber7af0e792016-04-29 16:40:15 +02001331{
1332 struct walk_info info = { 0 };
1333 return walk_by_layout(flashctx, &info, &erase_block);
1334}
1335
Nico Huber7af0e792016-04-29 16:40:15 +02001336/**
1337 * @brief Writes the included layout regions from a given image.
1338 *
1339 * If there is no layout set in the given flash context, the whole image
1340 * will be written.
1341 *
1342 * @param flashctx Flash context to be used.
1343 * @param curcontents A buffer of full chip size with current chip contents of included regions.
1344 * @param newcontents The new image to be written.
1345 * @return 0 on success,
1346 * 1 if anything has gone wrong.
1347 */
Nico Huber454f6132012-12-10 13:34:10 +00001348static int write_by_layout(struct flashctx *const flashctx,
1349 void *const curcontents, const void *const newcontents)
Nico Huber7af0e792016-04-29 16:40:15 +02001350{
1351 struct walk_info info;
1352 info.curcontents = curcontents;
1353 info.newcontents = newcontents;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001354 return walk_by_layout(flashctx, &info, erase_block);
Nico Huber7af0e792016-04-29 16:40:15 +02001355}
1356
1357/**
1358 * @brief Compares the included layout regions with content from a buffer.
1359 *
1360 * If there is no layout set in the given flash context, the whole chip's
1361 * contents will be compared.
1362 *
1363 * @param flashctx Flash context to be used.
Nico Huber74d09d42019-06-16 03:27:26 +02001364 * @param layout Flash layout information.
Nico Huber7af0e792016-04-29 16:40:15 +02001365 * @param curcontents A buffer of full chip size to read current chip contents into.
1366 * @param newcontents The new image to compare to.
1367 * @return 0 on success,
1368 * 1 if reading failed,
1369 * 3 if the contents don't match.
1370 */
Nico Huber74d09d42019-06-16 03:27:26 +02001371static int verify_by_layout(
1372 struct flashctx *const flashctx,
Nico Huberc3b02dc2023-08-12 01:13:45 +02001373 const struct flashprog_layout *const layout,
Nico Huber74d09d42019-06-16 03:27:26 +02001374 void *const curcontents, const uint8_t *const newcontents)
Nico Huber7af0e792016-04-29 16:40:15 +02001375{
Nico Huber5ca55232019-06-15 22:29:08 +02001376 const struct romentry *entry = NULL;
Nico Huber7af0e792016-04-29 16:40:15 +02001377
Richard Hughes842d6782021-01-15 09:48:12 +00001378 flashprog_progress_start_by_layout(flashctx, FLASHPROG_PROGRESS_READ, layout);
1379
Nico Huber5ca55232019-06-15 22:29:08 +02001380 while ((entry = layout_next_included(layout, entry))) {
1381 const chipoff_t region_start = entry->start;
1382 const chipsize_t region_len = entry->end - entry->start + 1;
Nico Huber7af0e792016-04-29 16:40:15 +02001383
1384 if (flashctx->chip->read(flashctx, curcontents + region_start, region_start, region_len))
1385 return 1;
1386 if (compare_range(newcontents + region_start, curcontents + region_start,
1387 region_start, region_len))
1388 return 3;
1389 }
Richard Hughes842d6782021-01-15 09:48:12 +00001390
1391 flashprog_progress_finish(flashctx);
1392
Nico Huber7af0e792016-04-29 16:40:15 +02001393 return 0;
1394}
1395
Stefan Tauner136388f2013-07-15 10:47:53 +00001396static void nonfatal_help_message(void)
Carl-Daniel Hailfinger42d38a92010-10-19 22:06:20 +00001397{
Stefan Taunera58f6e92014-05-10 09:25:44 +00001398 msg_gerr("Good, writing to the flash chip apparently didn't do anything.\n");
Stefan Tauner136388f2013-07-15 10:47:53 +00001399#if CONFIG_INTERNAL == 1
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +02001400 if (programmer == &programmer_internal)
Stefan Tauner136388f2013-07-15 10:47:53 +00001401 msg_gerr("This means we have to add special support for your board, programmer or flash\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +02001402 "chip. Please report this to the mailing list at flashprog@flashprog.org or\n"
1403 "on IRC (see https://www.flashprog.org/Contact for details), thanks!\n"
Stefan Tauner136388f2013-07-15 10:47:53 +00001404 "-------------------------------------------------------------------------------\n"
1405 "You may now reboot or simply leave the machine running.\n");
1406 else
1407#endif
1408 msg_gerr("Please check the connections (especially those to write protection pins) between\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +02001409 "the programmer and the flash chip. If you think the error is caused by flashprog\n"
1410 "please report this to the mailing list at flashprog@flashprog.org or on IRC\n"
1411 "(see https://www.flashprog.org/Contact for details), thanks!\n");
Carl-Daniel Hailfinger42d38a92010-10-19 22:06:20 +00001412}
1413
Edward O'Callaghanc72d20a2021-12-13 12:30:03 +11001414void emergency_help_message(void)
Carl-Daniel Hailfinger8ab49e72009-08-19 13:55:34 +00001415{
Stefan Tauner136388f2013-07-15 10:47:53 +00001416 msg_gerr("Your flash chip is in an unknown state.\n");
1417#if CONFIG_INTERNAL == 1
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +02001418 if (programmer == &programmer_internal)
Nico Huberc3b02dc2023-08-12 01:13:45 +02001419 msg_gerr("Get help on IRC (see https://www.flashprog.org/Contact) or mail\n"
1420 "flashprog@flashprog.org with the subject \"FAILED: <your board name>\"!\n"
Stefan Tauner136388f2013-07-15 10:47:53 +00001421 "-------------------------------------------------------------------------------\n"
1422 "DO NOT REBOOT OR POWEROFF!\n");
1423 else
1424#endif
Nico Huberc3b02dc2023-08-12 01:13:45 +02001425 msg_gerr("Please report this to the mailing list at flashprog@flashprog.org\n"
1426 "or on IRC (see https://www.flashprog.org/Contact for details), thanks!\n");
Carl-Daniel Hailfinger8ab49e72009-08-19 13:55:34 +00001427}
1428
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001429void list_programmers_linebreak(int startcol, int cols, int paren)
1430{
1431 const char *pname;
Carl-Daniel Hailfinger082c8b52011-08-15 19:54:20 +00001432 int pnamelen;
1433 int remaining = 0, firstline = 1;
Thomas Heijligen9163b812021-06-01 14:25:01 +02001434 size_t p;
Carl-Daniel Hailfinger082c8b52011-08-15 19:54:20 +00001435 int i;
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001436
Thomas Heijligend45cb592021-05-19 14:12:18 +02001437 for (p = 0; p < programmer_table_size; p++) {
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001438 pname = programmer_table[p]->name;
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001439 pnamelen = strlen(pname);
1440 if (remaining - pnamelen - 2 < 0) {
1441 if (firstline)
1442 firstline = 0;
1443 else
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001444 msg_ginfo("\n");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001445 for (i = 0; i < startcol; i++)
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001446 msg_ginfo(" ");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001447 remaining = cols - startcol;
1448 } else {
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001449 msg_ginfo(" ");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001450 remaining--;
1451 }
1452 if (paren && (p == 0)) {
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001453 msg_ginfo("(");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001454 remaining--;
1455 }
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001456 msg_ginfo("%s", pname);
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001457 remaining -= pnamelen;
Thomas Heijligend45cb592021-05-19 14:12:18 +02001458 if (p < programmer_table_size - 1) {
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001459 msg_ginfo(",");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001460 remaining--;
1461 } else {
1462 if (paren)
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001463 msg_ginfo(")");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001464 }
1465 }
1466}
1467
Carl-Daniel Hailfinger552420b2009-12-24 02:15:55 +00001468int selfcheck(void)
1469{
Stefan Tauner96658be2014-05-26 22:05:31 +00001470 unsigned int i;
Stefan Taunera6d96482012-12-26 19:51:23 +00001471 int ret = 0;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +00001472
Thomas Heijligend45cb592021-05-19 14:12:18 +02001473 for (i = 0; i < programmer_table_size; i++) {
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001474 const struct programmer_entry *const p = programmer_table[i];
1475 if (p == NULL) {
1476 msg_gerr("Programmer with index %d is NULL instead of a valid pointer!\n", i);
1477 ret = 1;
1478 continue;
1479 }
1480 if (p->name == NULL) {
Stefan Taunera6d96482012-12-26 19:51:23 +00001481 msg_gerr("All programmers need a valid name, but the one with index %d does not!\n", i);
1482 ret = 1;
1483 /* This might hide other problems with this programmer, but allows for better error
1484 * messages below without jumping through hoops. */
1485 continue;
1486 }
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001487 switch (p->type) {
Stefan Tauneraf358d62012-12-27 18:40:26 +00001488 case USB:
1489 case PCI:
1490 case OTHER:
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001491 if (p->devs.note == NULL) {
1492 if (strcmp("internal", p->name) == 0)
Stefan Tauneraf358d62012-12-27 18:40:26 +00001493 break; /* This one has its device list stored separately. */
1494 msg_gerr("Programmer %s has neither a device list nor a textual description!\n",
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001495 p->name);
Stefan Tauneraf358d62012-12-27 18:40:26 +00001496 ret = 1;
1497 }
1498 break;
1499 default:
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001500 msg_gerr("Programmer %s does not have a valid type set!\n", p->name);
Stefan Tauneraf358d62012-12-27 18:40:26 +00001501 ret = 1;
1502 break;
1503 }
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001504 if (p->init == NULL) {
1505 msg_gerr("Programmer %s does not have a valid init function!\n", p->name);
Stefan Taunera6d96482012-12-26 19:51:23 +00001506 ret = 1;
1507 }
Stefan Taunera6d96482012-12-26 19:51:23 +00001508 }
Stefan Tauner96658be2014-05-26 22:05:31 +00001509
1510 /* It would be favorable if we could check for the correct layout (especially termination) of various
1511 * constant arrays: flashchips, chipset_enables, board_matches, boards_known, laptops_known.
1512 * They are all defined as externs in this compilation unit so we don't know their sizes which vary
1513 * depending on compiler flags, e.g. the target architecture, and can sometimes be 0.
1514 * For 'flashchips' we export the size explicitly to work around this and to be able to implement the
1515 * checks below. */
Stefan Tauner6697f712014-08-06 15:09:15 +00001516 if (flashchips_size <= 1 || flashchips[flashchips_size - 1].name != NULL) {
Stefan Tauner7bcacb12011-05-26 01:35:19 +00001517 msg_gerr("Flashchips table miscompilation!\n");
1518 ret = 1;
Stefan Tauner96658be2014-05-26 22:05:31 +00001519 } else {
1520 for (i = 0; i < flashchips_size - 1; i++) {
1521 const struct flashchip *chip = &flashchips[i];
1522 if (chip->vendor == NULL || chip->name == NULL || chip->bustype == BUS_NONE) {
1523 ret = 1;
1524 msg_gerr("ERROR: Some field of flash chip #%d (%s) is misconfigured.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +02001525 "Please report a bug at flashprog@flashprog.org\n", i,
Stefan Tauner96658be2014-05-26 22:05:31 +00001526 chip->name == NULL ? "unnamed" : chip->name);
1527 }
1528 if (selfcheck_eraseblocks(chip)) {
1529 ret = 1;
1530 }
1531 }
Stefan Tauner7bcacb12011-05-26 01:35:19 +00001532 }
Stefan Tauner7bcacb12011-05-26 01:35:19 +00001533
Stefan Tauner600576b2014-06-12 22:57:36 +00001534#if CONFIG_INTERNAL == 1
1535 ret |= selfcheck_board_enables();
1536#endif
1537
Stefan Tauner96658be2014-05-26 22:05:31 +00001538 /* TODO: implement similar sanity checks for other arrays where deemed necessary. */
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +00001539 return ret;
Carl-Daniel Hailfinger552420b2009-12-24 02:15:55 +00001540}
1541
Edward O'Callaghanacb24d42021-04-15 13:44:39 +10001542/* FIXME: This function signature needs to be improved once prepare_flash_access()
1543 * has a better function signature.
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001544 */
Jacob Garberbeeb8bc2019-06-21 15:24:17 -06001545static int chip_safety_check(const struct flashctx *flash, int force,
1546 int read_it, int write_it, int erase_it, int verify_it)
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001547{
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +00001548 const struct flashchip *chip = flash->chip;
1549
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001550 if (!programmer_may_write && (write_it || erase_it)) {
1551 msg_perr("Write/erase is not working yet on your programmer in "
1552 "its current configuration.\n");
1553 /* --force is the wrong approach, but it's the best we can do
1554 * until the generic programmer parameter parser is merged.
1555 */
1556 if (!force)
1557 return 1;
1558 msg_cerr("Continuing anyway.\n");
1559 }
1560
1561 if (read_it || erase_it || write_it || verify_it) {
1562 /* Everything needs read. */
Stefan Tauner6455dff2014-05-26 00:36:24 +00001563 if (chip->tested.read == BAD) {
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001564 msg_cerr("Read is not working on this chip. ");
1565 if (!force)
1566 return 1;
1567 msg_cerr("Continuing anyway.\n");
1568 }
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +00001569 if (!chip->read) {
Nico Huberc3b02dc2023-08-12 01:13:45 +02001570 msg_cerr("flashprog has no read function for this "
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001571 "flash chip.\n");
1572 return 1;
1573 }
1574 }
1575 if (erase_it || write_it) {
1576 /* Write needs erase. */
Stefan Tauner6455dff2014-05-26 00:36:24 +00001577 if (chip->tested.erase == NA) {
1578 msg_cerr("Erase is not possible on this chip.\n");
1579 return 1;
1580 }
1581 if (chip->tested.erase == BAD) {
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001582 msg_cerr("Erase is not working on this chip. ");
1583 if (!force)
1584 return 1;
1585 msg_cerr("Continuing anyway.\n");
1586 }
Sylvain "ythier" Hitier9db45512011-07-04 07:27:17 +00001587 if(count_usable_erasers(flash) == 0) {
Nico Huberc3b02dc2023-08-12 01:13:45 +02001588 msg_cerr("flashprog has no erase function for this "
Stefan Tauner5368dca2011-07-01 00:19:12 +00001589 "flash chip.\n");
1590 return 1;
1591 }
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001592 }
1593 if (write_it) {
Stefan Tauner6455dff2014-05-26 00:36:24 +00001594 if (chip->tested.write == NA) {
1595 msg_cerr("Write is not possible on this chip.\n");
1596 return 1;
1597 }
1598 if (chip->tested.write == BAD) {
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001599 msg_cerr("Write is not working on this chip. ");
1600 if (!force)
1601 return 1;
1602 msg_cerr("Continuing anyway.\n");
1603 }
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +00001604 if (!chip->write) {
Nico Huberc3b02dc2023-08-12 01:13:45 +02001605 msg_cerr("flashprog has no write function for this "
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001606 "flash chip.\n");
1607 return 1;
1608 }
1609 }
1610 return 0;
1611}
1612
Nico Huber305f4172013-06-14 11:55:26 +02001613int prepare_flash_access(struct flashctx *const flash,
1614 const bool read_it, const bool write_it,
1615 const bool erase_it, const bool verify_it)
Nico Huber454f6132012-12-10 13:34:10 +00001616{
1617 if (chip_safety_check(flash, flash->flags.force, read_it, write_it, erase_it, verify_it)) {
1618 msg_cerr("Aborting.\n");
1619 return 1;
1620 }
1621
Nico Huber3ac761c2023-01-16 02:43:17 +01001622 if (layout_sanity_checks(flash, write_it)) {
Nico Huber454f6132012-12-10 13:34:10 +00001623 msg_cerr("Requested regions can not be handled. Aborting.\n");
1624 return 1;
1625 }
1626
Nico Huber901fb952023-01-11 23:24:23 +01001627 if (flash->chip->prepare_access && flash->chip->prepare_access(flash, PREPARE_FULL))
1628 return 1;
1629
Nikolai Artemiev4ad48642020-11-05 13:54:27 +11001630 /* Initialize chip_restore_fn_count before chip unlock calls. */
1631 flash->chip_restore_fn_count = 0;
1632
Nico Huber454f6132012-12-10 13:34:10 +00001633 /* Given the existence of read locks, we want to unlock for read,
1634 erase and write. */
1635 if (flash->chip->unlock)
1636 flash->chip->unlock(flash);
1637
1638 return 0;
1639}
1640
Nico Huber305f4172013-06-14 11:55:26 +02001641void finalize_flash_access(struct flashctx *const flash)
Nico Huber454f6132012-12-10 13:34:10 +00001642{
Nikolai Artemiev4ad48642020-11-05 13:54:27 +11001643 deregister_chip_restore(flash);
Nico Huber901fb952023-01-11 23:24:23 +01001644 if (flash->chip->finish_access)
1645 flash->chip->finish_access(flash);
Nico Huber454f6132012-12-10 13:34:10 +00001646}
1647
1648/**
Nico Huberc3b02dc2023-08-12 01:13:45 +02001649 * @addtogroup flashprog-flash
Nico Huber454f6132012-12-10 13:34:10 +00001650 * @{
1651 */
1652
1653/**
1654 * @brief Erase the specified ROM chip.
1655 *
1656 * If a layout is set in the given flash context, only included regions
1657 * will be erased.
1658 *
1659 * @param flashctx The context of the flash chip to erase.
1660 * @return 0 on success.
1661 */
Nico Huberc3b02dc2023-08-12 01:13:45 +02001662int flashprog_flash_erase(struct flashctx *const flashctx)
Nico Huber454f6132012-12-10 13:34:10 +00001663{
1664 if (prepare_flash_access(flashctx, false, false, true, false))
1665 return 1;
1666
1667 const int ret = erase_by_layout(flashctx);
1668
1669 finalize_flash_access(flashctx);
1670
1671 return ret;
1672}
1673
Nico Huberc3b02dc2023-08-12 01:13:45 +02001674/** @} */ /* end flashprog-flash */
Nico Huber454f6132012-12-10 13:34:10 +00001675
1676/**
Nico Huberc3b02dc2023-08-12 01:13:45 +02001677 * @defgroup flashprog-ops Operations
Nico Huber454f6132012-12-10 13:34:10 +00001678 * @{
1679 */
1680
1681/**
1682 * @brief Read the current image from the specified ROM chip.
1683 *
1684 * If a layout is set in the specified flash context, only included regions
1685 * will be read.
1686 *
1687 * @param flashctx The context of the flash chip.
1688 * @param buffer Target buffer to write image to.
1689 * @param buffer_len Size of target buffer in bytes.
1690 * @return 0 on success,
1691 * 2 if buffer_len is too short for the flash chip's contents,
1692 * or 1 on any other failure.
1693 */
Nico Huberc3b02dc2023-08-12 01:13:45 +02001694int flashprog_image_read(struct flashctx *const flashctx, void *const buffer, const size_t buffer_len)
Nico Huber454f6132012-12-10 13:34:10 +00001695{
1696 const size_t flash_size = flashctx->chip->total_size * 1024;
1697
1698 if (flash_size > buffer_len)
1699 return 2;
1700
1701 if (prepare_flash_access(flashctx, true, false, false, false))
1702 return 1;
1703
1704 msg_cinfo("Reading flash... ");
1705
1706 int ret = 1;
1707 if (read_by_layout(flashctx, buffer)) {
1708 msg_cerr("Read operation failed!\n");
1709 msg_cinfo("FAILED.\n");
1710 goto _finalize_ret;
1711 }
1712 msg_cinfo("done.\n");
1713 ret = 0;
1714
1715_finalize_ret:
1716 finalize_flash_access(flashctx);
1717 return ret;
1718}
1719
1720static void combine_image_by_layout(const struct flashctx *const flashctx,
1721 uint8_t *const newcontents, const uint8_t *const oldcontents)
1722{
Nico Huberc3b02dc2023-08-12 01:13:45 +02001723 const struct flashprog_layout *const layout = get_layout(flashctx);
Nico Huber3d7b1e32018-12-22 00:53:14 +01001724 const struct romentry *included;
1725 chipoff_t start = 0;
Nico Huber454f6132012-12-10 13:34:10 +00001726
Nico Huber3d7b1e32018-12-22 00:53:14 +01001727 while ((included = layout_next_included_region(layout, start))) {
1728 if (included->start > start) {
1729 /* copy everything up to the start of this included region */
1730 memcpy(newcontents + start, oldcontents + start, included->start - start);
1731 }
1732 /* skip this included region */
1733 start = included->end + 1;
1734 if (start == 0)
1735 return;
Nico Huber454f6132012-12-10 13:34:10 +00001736 }
Nico Huber3d7b1e32018-12-22 00:53:14 +01001737
1738 /* copy the rest of the chip */
1739 const chipsize_t copy_len = flashctx->chip->total_size * 1024 - start;
1740 memcpy(newcontents + start, oldcontents + start, copy_len);
Nico Huber454f6132012-12-10 13:34:10 +00001741}
1742
1743/**
1744 * @brief Write the specified image to the ROM chip.
1745 *
1746 * If a layout is set in the specified flash context, only erase blocks
1747 * containing included regions will be touched.
1748 *
1749 * @param flashctx The context of the flash chip.
Nico Huber1b172f22017-06-19 12:35:24 +02001750 * @param buffer Source buffer to read image from (may be altered for full verification).
Nico Huber454f6132012-12-10 13:34:10 +00001751 * @param buffer_len Size of source buffer in bytes.
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001752 * @param refbuffer If given, assume flash chip contains same data as `refbuffer`.
Nico Huber454f6132012-12-10 13:34:10 +00001753 * @return 0 on success,
1754 * 4 if buffer_len doesn't match the size of the flash chip,
1755 * 3 if write was tried but nothing has changed,
1756 * 2 if write failed and flash contents changed,
1757 * or 1 on any other failure.
1758 */
Nico Huberc3b02dc2023-08-12 01:13:45 +02001759int flashprog_image_write(struct flashctx *const flashctx, void *const buffer, const size_t buffer_len,
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001760 const void *const refbuffer)
Nico Huber454f6132012-12-10 13:34:10 +00001761{
1762 const size_t flash_size = flashctx->chip->total_size * 1024;
1763 const bool verify_all = flashctx->flags.verify_whole_chip;
1764 const bool verify = flashctx->flags.verify_after_write;
Nico Huberc3b02dc2023-08-12 01:13:45 +02001765 const struct flashprog_layout *const verify_layout =
Nico Huber74d09d42019-06-16 03:27:26 +02001766 verify_all ? get_default_layout(flashctx) : get_layout(flashctx);
Nico Huber454f6132012-12-10 13:34:10 +00001767
1768 if (buffer_len != flash_size)
1769 return 4;
1770
1771 int ret = 1;
1772
1773 uint8_t *const newcontents = buffer;
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001774 const uint8_t *const refcontents = refbuffer;
Nico Huber454f6132012-12-10 13:34:10 +00001775 uint8_t *const curcontents = malloc(flash_size);
1776 uint8_t *oldcontents = NULL;
1777 if (verify_all)
1778 oldcontents = malloc(flash_size);
1779 if (!curcontents || (verify_all && !oldcontents)) {
1780 msg_gerr("Out of memory!\n");
1781 goto _free_ret;
1782 }
1783
1784#if CONFIG_INTERNAL == 1
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +02001785 if (programmer == &programmer_internal && cb_check_image(newcontents, flash_size) < 0) {
Nico Huber454f6132012-12-10 13:34:10 +00001786 if (flashctx->flags.force_boardmismatch) {
1787 msg_pinfo("Proceeding anyway because user forced us to.\n");
1788 } else {
1789 msg_perr("Aborting. You can override this with "
1790 "-p internal:boardmismatch=force.\n");
1791 goto _free_ret;
1792 }
1793 }
1794#endif
1795
1796 if (prepare_flash_access(flashctx, false, true, false, verify))
1797 goto _free_ret;
1798
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001799 /* If given, assume flash chip contains same data as `refcontents`. */
1800 if (refcontents) {
1801 msg_cinfo("Assuming old flash chip contents as ref-file...\n");
1802 memcpy(curcontents, refcontents, flash_size);
1803 if (oldcontents)
1804 memcpy(oldcontents, refcontents, flash_size);
Nico Huber454f6132012-12-10 13:34:10 +00001805 } else {
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001806 /*
1807 * Read the whole chip to be able to check whether regions need to be
1808 * erased and to give better diagnostics in case write fails.
1809 * The alternative is to read only the regions which are to be
1810 * preserved, but in that case we might perform unneeded erase which
1811 * takes time as well.
1812 */
1813 msg_cinfo("Reading old flash chip contents... ");
1814 if (verify_all) {
Richard Hughes842d6782021-01-15 09:48:12 +00001815 if (flashprog_read_range(flashctx, oldcontents, 0, flash_size)) {
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001816 msg_cinfo("FAILED.\n");
1817 goto _finalize_ret;
1818 }
1819 memcpy(curcontents, oldcontents, flash_size);
1820 } else {
1821 if (read_by_layout(flashctx, curcontents)) {
1822 msg_cinfo("FAILED.\n");
1823 goto _finalize_ret;
1824 }
Nico Huber454f6132012-12-10 13:34:10 +00001825 }
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001826 msg_cinfo("done.\n");
Nico Huber454f6132012-12-10 13:34:10 +00001827 }
Nico Huber454f6132012-12-10 13:34:10 +00001828
1829 if (write_by_layout(flashctx, curcontents, newcontents)) {
1830 msg_cerr("Uh oh. Erase/write failed. ");
1831 ret = 2;
1832 if (verify_all) {
1833 msg_cerr("Checking if anything has changed.\n");
1834 msg_cinfo("Reading current flash chip contents... ");
Richard Hughes842d6782021-01-15 09:48:12 +00001835 if (!flashprog_read_range(flashctx, curcontents, 0, flash_size)) {
Nico Huber454f6132012-12-10 13:34:10 +00001836 msg_cinfo("done.\n");
1837 if (!memcmp(oldcontents, curcontents, flash_size)) {
1838 nonfatal_help_message();
1839 goto _finalize_ret;
1840 }
1841 msg_cerr("Apparently at least some data has changed.\n");
1842 } else
1843 msg_cerr("Can't even read anymore!\n");
1844 emergency_help_message();
1845 goto _finalize_ret;
1846 } else {
1847 msg_cerr("\n");
1848 }
1849 emergency_help_message();
1850 goto _finalize_ret;
1851 }
1852
1853 /* Verify only if we actually changed something. */
1854 if (verify && !all_skipped) {
Nico Huber454f6132012-12-10 13:34:10 +00001855 msg_cinfo("Verifying flash... ");
1856
1857 /* Work around chips which need some time to calm down. */
1858 programmer_delay(1000*1000);
1859
Nico Huber74d09d42019-06-16 03:27:26 +02001860 if (verify_all)
Nico Huber454f6132012-12-10 13:34:10 +00001861 combine_image_by_layout(flashctx, newcontents, oldcontents);
Nico Huber74d09d42019-06-16 03:27:26 +02001862 ret = verify_by_layout(flashctx, verify_layout, curcontents, newcontents);
Nico Huber454f6132012-12-10 13:34:10 +00001863 /* If we tried to write, and verification now fails, we
1864 might have an emergency situation. */
1865 if (ret)
1866 emergency_help_message();
1867 else
1868 msg_cinfo("VERIFIED.\n");
1869 } else {
1870 /* We didn't change anything. */
1871 ret = 0;
1872 }
1873
1874_finalize_ret:
1875 finalize_flash_access(flashctx);
1876_free_ret:
1877 free(oldcontents);
1878 free(curcontents);
1879 return ret;
1880}
1881
1882/**
1883 * @brief Verify the ROM chip's contents with the specified image.
1884 *
1885 * If a layout is set in the specified flash context, only included regions
1886 * will be verified.
1887 *
1888 * @param flashctx The context of the flash chip.
1889 * @param buffer Source buffer to verify with.
1890 * @param buffer_len Size of source buffer in bytes.
1891 * @return 0 on success,
1892 * 3 if the chip's contents don't match,
1893 * 2 if buffer_len doesn't match the size of the flash chip,
1894 * or 1 on any other failure.
1895 */
Nico Huberc3b02dc2023-08-12 01:13:45 +02001896int flashprog_image_verify(struct flashctx *const flashctx, const void *const buffer, const size_t buffer_len)
Nico Huber454f6132012-12-10 13:34:10 +00001897{
Nico Huberc3b02dc2023-08-12 01:13:45 +02001898 const struct flashprog_layout *const layout = get_layout(flashctx);
Nico Huber454f6132012-12-10 13:34:10 +00001899 const size_t flash_size = flashctx->chip->total_size * 1024;
1900
1901 if (buffer_len != flash_size)
1902 return 2;
1903
1904 const uint8_t *const newcontents = buffer;
1905 uint8_t *const curcontents = malloc(flash_size);
1906 if (!curcontents) {
1907 msg_gerr("Out of memory!\n");
1908 return 1;
1909 }
1910
1911 int ret = 1;
1912
1913 if (prepare_flash_access(flashctx, false, false, false, true))
1914 goto _free_ret;
1915
1916 msg_cinfo("Verifying flash... ");
Nico Huber74d09d42019-06-16 03:27:26 +02001917 ret = verify_by_layout(flashctx, layout, curcontents, newcontents);
Nico Huber454f6132012-12-10 13:34:10 +00001918 if (!ret)
1919 msg_cinfo("VERIFIED.\n");
1920
1921 finalize_flash_access(flashctx);
1922_free_ret:
1923 free(curcontents);
1924 return ret;
1925}
1926
Nico Huberc3b02dc2023-08-12 01:13:45 +02001927/** @} */ /* end flashprog-ops */