blob: 423ca38482d3cb0c456f72cb729c32a45a1225fc [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 Huberfbc41d22026-02-22 23:04:01 +010035#include "chipdrivers/spi.h"
Nico Huber9d09e0f2025-03-02 22:55:10 +010036#include "version.h"
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +000037
Nico Huberc3b02dc2023-08-12 01:13:45 +020038const char flashprog_version[] = FLASHPROG_VERSION;
Nico Huberbcb2e5a2012-12-30 01:23:17 +000039const char *chip_to_probe = NULL;
Carl-Daniel Hailfinger66ef4e52009-12-13 22:28:00 +000040
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +020041static const struct programmer_entry *programmer = NULL;
Nico Huber6a2ebeb2022-08-26 11:36:48 +020042static char *programmer_param = NULL;
Stefan Reinauer70385642007-04-06 11:58:03 +000043
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +000044/* If nonzero, used as the start address of bottom-aligned flash. */
45unsigned long flashbase;
Carl-Daniel Hailfinger66ef4e52009-12-13 22:28:00 +000046
Carl-Daniel Hailfingerd1be52d2010-07-03 12:14:25 +000047/* Is writing allowed with this programmer? */
Felix Singer980d6b82022-08-19 02:48:15 +020048bool programmer_may_write;
Carl-Daniel Hailfingerd1be52d2010-07-03 12:14:25 +000049
Carl-Daniel Hailfinger2bee8cf2010-11-10 15:25:18 +000050#define SHUTDOWN_MAXFN 32
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000051static int shutdown_fn_count = 0;
Nico Huber454f6132012-12-10 13:34:10 +000052/** @private */
Richard Hughes93e16252018-12-19 11:54:47 +000053static struct shutdown_func_data {
David Hendricks8bb20212011-06-14 01:35:36 +000054 int (*func) (void *data);
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000055 void *data;
Richard Hughes93e16252018-12-19 11:54:47 +000056} shutdown_fn[SHUTDOWN_MAXFN];
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +000057/* Initialize to 0 to make sure nobody registers a shutdown function before
58 * programmer init.
59 */
Felix Singerf25447e2022-08-19 02:44:28 +020060static bool may_register_shutdown = false;
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000061
Stefan Taunerc4f44df2013-08-12 22:58:43 +000062/* Did we change something or was every erase/write skipped (if any)? */
63static bool all_skipped = true;
64
Carl-Daniel Hailfinger63fd9022011-12-14 22:25:15 +000065static int check_block_eraser(const struct flashctx *flash, int k, int log);
Stefan Tauner5368dca2011-07-01 00:19:12 +000066
Stefan Tauner2a1ed772014-08-31 00:09:21 +000067int shutdown_free(void *data)
68{
69 free(data);
70 return 0;
71}
72
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000073/* Register a function to be executed on programmer shutdown.
74 * The advantage over atexit() is that you can supply a void pointer which will
75 * be used as parameter to the registered function upon programmer shutdown.
76 * This pointer can point to arbitrary data used by said function, e.g. undo
77 * information for GPIO settings etc. If unneeded, set data=NULL.
78 * Please note that the first (void *data) belongs to the function signature of
79 * the function passed as first parameter.
80 */
David Hendricks8bb20212011-06-14 01:35:36 +000081int register_shutdown(int (*function) (void *data), void *data)
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000082{
83 if (shutdown_fn_count >= SHUTDOWN_MAXFN) {
Carl-Daniel Hailfinger9f5f2152010-06-04 23:20:21 +000084 msg_perr("Tried to register more than %i shutdown functions.\n",
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000085 SHUTDOWN_MAXFN);
86 return 1;
87 }
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +000088 if (!may_register_shutdown) {
89 msg_perr("Tried to register a shutdown function before "
90 "programmer init.\n");
91 return 1;
92 }
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000093 shutdown_fn[shutdown_fn_count].func = function;
94 shutdown_fn[shutdown_fn_count].data = data;
95 shutdown_fn_count++;
96
97 return 0;
98}
99
Nikolai Artemiev4ad48642020-11-05 13:54:27 +1100100int register_chip_restore(chip_restore_fn_cb_t func,
101 struct flashctx *flash, uint8_t status)
102{
103 if (flash->chip_restore_fn_count >= MAX_CHIP_RESTORE_FUNCTIONS) {
104 msg_perr("Tried to register more than %i chip restore"
105 " functions.\n", MAX_CHIP_RESTORE_FUNCTIONS);
106 return 1;
107 }
108 flash->chip_restore_fn[flash->chip_restore_fn_count].func = func;
109 flash->chip_restore_fn[flash->chip_restore_fn_count].status = status;
110 flash->chip_restore_fn_count++;
111
112 return 0;
113}
114
115static int deregister_chip_restore(struct flashctx *flash)
116{
117 int rc = 0;
118
119 while (flash->chip_restore_fn_count > 0) {
120 int i = --flash->chip_restore_fn_count;
121 rc |= flash->chip_restore_fn[i].func(
122 flash, flash->chip_restore_fn[i].status);
123 }
124
125 return rc;
126}
127
Nico Huber2b66ad92023-01-11 20:15:15 +0100128int programmer_init(struct flashprog_programmer *const prog)
Uwe Hermann09e04f72009-05-16 22:36:00 +0000129{
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000130 int ret;
Carl-Daniel Hailfinger2e681602011-09-08 00:00:29 +0000131
Nico Huber2b66ad92023-01-11 20:15:15 +0100132 if (prog == NULL || prog->driver == NULL) {
Carl-Daniel Hailfinger2e681602011-09-08 00:00:29 +0000133 msg_perr("Invalid programmer specified!\n");
134 return -1;
135 }
Nico Huber2b66ad92023-01-11 20:15:15 +0100136 programmer = prog->driver;
137 programmer_param = prog->param;
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000138 /* Initialize all programmer specific data. */
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000139 /* Default to top aligned flash at 4 GB. */
140 flashbase = 0;
141 /* Registering shutdown functions is now allowed. */
Felix Singerf25447e2022-08-19 02:44:28 +0200142 may_register_shutdown = true;
Carl-Daniel Hailfingerd1be52d2010-07-03 12:14:25 +0000143 /* Default to allowing writes. Broken programmers set this to 0. */
Felix Singer980d6b82022-08-19 02:48:15 +0200144 programmer_may_write = true;
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000145
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +0200146 msg_pdbg("Initializing %s programmer\n", programmer->name);
Nico Hubere3a26882023-01-11 21:45:51 +0100147 ret = programmer->init(prog);
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000148 if (programmer_param && strlen(programmer_param)) {
Carl-Daniel Hailfinger20a36ba2013-08-13 07:09:57 +0000149 if (ret != 0) {
150 /* It is quite possible that any unhandled programmer parameter would have been valid,
151 * but an error in actual programmer init happened before the parameter was evaluated.
152 */
153 msg_pwarn("Unhandled programmer parameters (possibly due to another failure): %s\n",
154 programmer_param);
155 } else {
156 /* Actual programmer init was successful, but the user specified an invalid or unusable
157 * (for the current programmer configuration) parameter.
158 */
159 msg_perr("Unhandled programmer parameters: %s\n", programmer_param);
160 msg_perr("Aborting.\n");
161 ret = ERROR_FATAL;
162 }
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000163 }
Nico Huber6a2ebeb2022-08-26 11:36:48 +0200164 programmer_param = NULL;
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000165 return ret;
Uwe Hermann09e04f72009-05-16 22:36:00 +0000166}
167
Stefan Tauner20da4aa2014-05-07 22:07:23 +0000168/** Calls registered shutdown functions and resets internal programmer-related variables.
169 * Calling it is safe even without previous initialization, but further interactions with programmer support
170 * require a call to programmer_init() (afterwards).
171 *
172 * @return The OR-ed result values of all shutdown functions (i.e. 0 on success). */
Nico Huber2b66ad92023-01-11 20:15:15 +0100173int programmer_shutdown(struct flashprog_programmer *const prog)
Uwe Hermann09e04f72009-05-16 22:36:00 +0000174{
David Hendricks8bb20212011-06-14 01:35:36 +0000175 int ret = 0;
176
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000177 /* Registering shutdown functions is no longer allowed. */
Felix Singerf25447e2022-08-19 02:44:28 +0200178 may_register_shutdown = false;
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000179 while (shutdown_fn_count > 0) {
180 int i = --shutdown_fn_count;
David Hendricks8bb20212011-06-14 01:35:36 +0000181 ret |= shutdown_fn[i].func(shutdown_fn[i].data);
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000182 }
Nico Huberaf9d7382023-05-01 13:33:26 +0200183
184 int i;
185 for (i = 0; i < registered_master_count; ++i) {
186 struct found_id *found_id, *next;
187 for (found_id = registered_masters[i].found_ids; found_id; found_id = next) {
188 next = found_id->next;
189 free(found_id);
190 }
191 }
Carl-Daniel Hailfingera5bcbce2014-07-19 22:03:29 +0000192 registered_master_count = 0;
Stefan Taunere34e3e82013-01-01 00:06:51 +0000193
David Hendricks8bb20212011-06-14 01:35:36 +0000194 return ret;
Uwe Hermann09e04f72009-05-16 22:36:00 +0000195}
196
Stefan Taunerf80419c2014-05-02 15:41:42 +0000197void programmer_delay(unsigned int usecs)
Carl-Daniel Hailfingerca8bfc62009-06-05 17:48:08 +0000198{
Edward O'Callaghan56684d92022-09-07 10:47:45 +1000199 if (usecs > 0) {
200 if (programmer->delay)
201 programmer->delay(usecs);
202 else
203 internal_delay(usecs);
204 }
Carl-Daniel Hailfingerca8bfc62009-06-05 17:48:08 +0000205}
206
Nico Hubercdcfda22023-04-29 13:29:33 +0200207static int read_memmapped_chunk(struct flashctx *flash, uint8_t *buf, unsigned int start, unsigned int len)
Carl-Daniel Hailfinger03b4e712009-05-08 12:49:03 +0000208{
Carl-Daniel Hailfinger8a3c60c2011-12-18 15:01:24 +0000209 chip_readn(flash, buf, flash->virtual_memory + start, len);
Carl-Daniel Hailfinger03b4e712009-05-08 12:49:03 +0000210 return 0;
211}
Nico Hubercdcfda22023-04-29 13:29:33 +0200212int read_memmapped(struct flashctx *flash, uint8_t *buf, unsigned int start, int unsigned len)
213{
214 return flashprog_read_chunked(flash, buf, start, len, MAX_DATA_READ_UNLIMITED, read_memmapped_chunk);
215}
Carl-Daniel Hailfinger03b4e712009-05-08 12:49:03 +0000216
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000217/* This is a somewhat hacked function similar in some ways to strtok().
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000218 * It will look for needle with a subsequent '=' in haystack, return a copy of
219 * needle and remove everything from the first occurrence of needle to the next
220 * delimiter from haystack.
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000221 */
Nico Huber6a2ebeb2022-08-26 11:36:48 +0200222static char *extract_param(char *const *haystack, const char *needle, const char *delim)
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000223{
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000224 char *param_pos, *opt_pos, *rest;
225 char *opt = NULL;
226 int optlen;
Carl-Daniel Hailfinger27023762010-04-28 15:22:14 +0000227 int needlelen;
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000228
Carl-Daniel Hailfinger27023762010-04-28 15:22:14 +0000229 needlelen = strlen(needle);
230 if (!needlelen) {
231 msg_gerr("%s: empty needle! Please report a bug at "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200232 "flashprog@flashprog.org\n", __func__);
Carl-Daniel Hailfinger27023762010-04-28 15:22:14 +0000233 return NULL;
234 }
235 /* No programmer parameters given. */
236 if (*haystack == NULL)
237 return NULL;
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000238 param_pos = strstr(*haystack, needle);
239 do {
240 if (!param_pos)
241 return NULL;
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000242 /* Needle followed by '='? */
243 if (param_pos[needlelen] == '=') {
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000244 /* Beginning of the string? */
245 if (param_pos == *haystack)
246 break;
247 /* After a delimiter? */
248 if (strchr(delim, *(param_pos - 1)))
249 break;
250 }
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000251 /* Continue searching. */
252 param_pos++;
253 param_pos = strstr(param_pos, needle);
254 } while (1);
Uwe Hermann91f4afa2011-07-28 08:13:25 +0000255
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000256 if (param_pos) {
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000257 /* Get the string after needle and '='. */
258 opt_pos = param_pos + needlelen + 1;
259 optlen = strcspn(opt_pos, delim);
260 /* Return an empty string if the parameter was empty. */
261 opt = malloc(optlen + 1);
262 if (!opt) {
Sean Nelson316a29f2010-05-07 20:09:04 +0000263 msg_gerr("Out of memory!\n");
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000264 exit(1);
265 }
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000266 strncpy(opt, opt_pos, optlen);
267 opt[optlen] = '\0';
268 rest = opt_pos + optlen;
269 /* Skip all delimiters after the current parameter. */
270 rest += strspn(rest, delim);
271 memmove(param_pos, rest, strlen(rest) + 1);
272 /* We could shrink haystack, but the effort is not worth it. */
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000273 }
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000274
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000275 return opt;
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000276}
277
Stefan Tauner66652442011-06-26 17:38:17 +0000278char *extract_programmer_param(const char *param_name)
Carl-Daniel Hailfinger2b6dcb32010-07-08 10:13:37 +0000279{
280 return extract_param(&programmer_param, param_name, ",");
281}
282
Richard Hughes842d6782021-01-15 09:48:12 +0000283static void flashprog_progress_report(struct flashprog_progress *const p)
284{
285 if (p->current > p->total) {
286 msg_gdbg2("Sanitizing progress report: %zu bytes off.", p->current - p->total);
287 p->current = p->total;
288 }
289
290 if (!p->callback)
291 return;
292
293 p->callback(p->stage, p->current, p->total, p->user_data);
294}
295
296static void flashprog_progress_start(struct flashprog_flashctx *const flashctx,
297 const enum flashprog_progress_stage stage, const size_t total)
298{
299 flashctx->progress.stage = stage;
300 flashctx->progress.current = 0;
301 flashctx->progress.total = total;
302 flashprog_progress_report(&flashctx->progress);
303}
304
305static void flashprog_progress_start_by_layout(struct flashprog_flashctx *const flashctx,
306 const enum flashprog_progress_stage stage,
307 const struct flashprog_layout *const layout)
308{
309 const struct romentry *entry = NULL;
310 size_t total = 0;
311
312 while ((entry = layout_next_included(layout, entry)))
313 total += entry->end - entry->start + 1;
314
315 flashprog_progress_start(flashctx, stage, total);
316}
317
318static void flashprog_progress_set(struct flashprog_flashctx *const flashctx, const size_t current)
319{
320 flashctx->progress.current = current;
321 flashprog_progress_report(&flashctx->progress);
322}
323
324/** @private */
325void flashprog_progress_add(struct flashprog_flashctx *const flashctx, const size_t progress)
326{
327 flashctx->progress.current += progress;
328 flashprog_progress_report(&flashctx->progress);
329}
330
331static void flashprog_progress_finish(struct flashprog_flashctx *const flashctx)
332{
333 if (flashctx->progress.current == flashctx->progress.total)
334 return;
335
336 flashctx->progress.current = flashctx->progress.total;
337 flashprog_progress_report(&flashctx->progress);
338}
339
Sylvain "ythier" Hitier9db45512011-07-04 07:27:17 +0000340/* Returns the number of well-defined erasers for a chip. */
Carl-Daniel Hailfinger63fd9022011-12-14 22:25:15 +0000341static unsigned int count_usable_erasers(const struct flashctx *flash)
Stefan Tauner5368dca2011-07-01 00:19:12 +0000342{
343 unsigned int usable_erasefunctions = 0;
344 int k;
345 for (k = 0; k < NUM_ERASEFUNCTIONS; k++) {
346 if (!check_block_eraser(flash, k, 0))
347 usable_erasefunctions++;
348 }
349 return usable_erasefunctions;
350}
351
Mark Marshallf20b7be2014-05-09 21:16:21 +0000352static int compare_range(const uint8_t *wantbuf, const uint8_t *havebuf, unsigned int start, unsigned int len)
Stefan Tauner78ffbea2012-10-27 15:36:56 +0000353{
354 int ret = 0, failcount = 0;
355 unsigned int i;
356 for (i = 0; i < len; i++) {
357 if (wantbuf[i] != havebuf[i]) {
358 /* Only print the first failure. */
359 if (!failcount++)
360 msg_cerr("FAILED at 0x%08x! Expected=0x%02x, Found=0x%02x,",
361 start + i, wantbuf[i], havebuf[i]);
362 }
363 }
364 if (failcount) {
365 msg_cerr(" failed byte count from 0x%08x-0x%08x: 0x%x\n",
366 start, start + len - 1, failcount);
367 ret = -1;
368 }
369 return ret;
370}
371
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000372/* start is an offset to the base address of the flash chip */
Jacob Garberbeeb8bc2019-06-21 15:24:17 -0600373static int check_erased_range(struct flashctx *flash, unsigned int start, unsigned int len)
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000374{
375 int ret;
Paul Kocialkowski995f7552018-01-15 01:06:09 +0300376 const uint8_t erased_value = ERASED_VALUE(flash);
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000377
Edward O'Callaghanf60f64f2022-11-12 12:08:01 +1100378 uint8_t *cmpbuf = malloc(len);
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000379 if (!cmpbuf) {
Edward O'Callaghana31a5722022-11-12 12:05:36 +1100380 msg_gerr("Out of memory!\n");
Edward O'Callaghan6edf9f82022-11-12 12:08:46 +1100381 return -1;
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000382 }
Paul Kocialkowski995f7552018-01-15 01:06:09 +0300383 memset(cmpbuf, erased_value, len);
Stefan Tauner78ffbea2012-10-27 15:36:56 +0000384 ret = verify_range(flash, cmpbuf, start, len);
Edward O'Callaghanf60f64f2022-11-12 12:08:01 +1100385
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000386 free(cmpbuf);
387 return ret;
388}
389
Richard Hughes842d6782021-01-15 09:48:12 +0000390int flashprog_read_range(struct flashctx *flash, uint8_t *buf, unsigned int start, unsigned int len)
391{
392 flashprog_progress_start(flash, FLASHPROG_PROGRESS_READ, len);
393 const int ret = flash->chip->read(flash, buf, start, len);
394 flashprog_progress_finish(flash);
395 return ret;
396}
397
Uwe Hermann48ec1b12010-08-08 17:01:18 +0000398/*
Carl-Daniel Hailfingerd0250a32009-11-25 17:05:52 +0000399 * @cmpbuf buffer to compare against, cmpbuf[0] is expected to match the
Uwe Hermann91f4afa2011-07-28 08:13:25 +0000400 * flash content at location start
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000401 * @start offset to the base address of the flash chip
402 * @len length of the verified area
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000403 * @return 0 for success, -1 for failure
404 */
Mark Marshallf20b7be2014-05-09 21:16:21 +0000405int verify_range(struct flashctx *flash, const uint8_t *cmpbuf, unsigned int start, unsigned int len)
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000406{
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000407 if (!len)
Stefan Taunerdf64a422014-05-27 00:06:14 +0000408 return -1;
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000409
Edward O'Callaghan6ae640b2021-11-17 14:24:04 +1100410 if (start + len > flash->chip->total_size * 1024) {
411 msg_gerr("Error: %s called with start 0x%x + len 0x%x >"
412 " total_size 0x%x\n", __func__, start, len,
413 flash->chip->total_size * 1024);
414 return -1;
415 }
416
Stefan Taunerdf64a422014-05-27 00:06:14 +0000417 uint8_t *readbuf = malloc(len);
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000418 if (!readbuf) {
Edward O'Callaghana31a5722022-11-12 12:05:36 +1100419 msg_gerr("Out of memory!\n");
Stefan Taunerdf64a422014-05-27 00:06:14 +0000420 return -1;
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000421 }
422
Edward O'Callaghan6ae640b2021-11-17 14:24:04 +1100423 int ret = flash->chip->read(flash, readbuf, start, len);
Carl-Daniel Hailfingerd8369412010-11-16 17:21:58 +0000424 if (ret) {
425 msg_gerr("Verification impossible because read failed "
426 "at 0x%x (len 0x%x)\n", start, len);
Stefan Taunerdf64a422014-05-27 00:06:14 +0000427 ret = -1;
428 goto out_free;
Carl-Daniel Hailfingerd8369412010-11-16 17:21:58 +0000429 }
430
Stefan Tauner78ffbea2012-10-27 15:36:56 +0000431 ret = compare_range(cmpbuf, readbuf, start, len);
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000432out_free:
433 free(readbuf);
434 return ret;
435}
436
Nico Huber3ac761c2023-01-16 02:43:17 +0100437size_t gran_to_bytes(const enum write_granularity gran)
Nico Huberb77607f2023-01-16 02:25:45 +0100438{
439 switch (gran) {
440 case write_gran_1bit: return 1;
441 case write_gran_1byte: return 1;
442 case write_gran_1byte_implicit_erase: return 1;
443 case write_gran_128bytes: return 128;
444 case write_gran_256bytes: return 256;
445 case write_gran_264bytes: return 264;
446 case write_gran_512bytes: return 512;
447 case write_gran_528bytes: return 528;
448 case write_gran_1024bytes: return 1024;
449 case write_gran_1056bytes: return 1056;
450 default: return 0;
451 }
452}
453
Stefan Tauner02437452013-04-01 19:34:53 +0000454/* Helper function for need_erase() that focuses on granularities of gran bytes. */
Paul Kocialkowski995f7552018-01-15 01:06:09 +0300455static int need_erase_gran_bytes(const uint8_t *have, const uint8_t *want, unsigned int len,
456 unsigned int gran, const uint8_t erased_value)
Stefan Tauner02437452013-04-01 19:34:53 +0000457{
458 unsigned int i, j, limit;
459 for (j = 0; j < len / gran; j++) {
460 limit = min (gran, len - j * gran);
461 /* Are 'have' and 'want' identical? */
462 if (!memcmp(have + j * gran, want + j * gran, limit))
463 continue;
464 /* have needs to be in erased state. */
465 for (i = 0; i < limit; i++)
Paul Kocialkowski995f7552018-01-15 01:06:09 +0300466 if (have[j * gran + i] != erased_value)
Stefan Tauner02437452013-04-01 19:34:53 +0000467 return 1;
468 }
469 return 0;
470}
471
Uwe Hermann48ec1b12010-08-08 17:01:18 +0000472/*
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000473 * Check if the buffer @have can be programmed to the content of @want without
474 * erasing. This is only possible if all chunks of size @gran are either kept
475 * as-is or changed from an all-ones state to any other state.
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000476 *
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000477 * Warning: This function assumes that @have and @want point to naturally
478 * aligned regions.
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000479 *
480 * @have buffer with current content
481 * @want buffer with desired content
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000482 * @len length of the checked area
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000483 * @gran write granularity (enum, not count)
484 * @return 0 if no erase is needed, 1 otherwise
485 */
Edward O'Callaghana1805092022-05-16 11:10:36 +1000486static int need_erase(const uint8_t *have, const uint8_t *want, unsigned int len,
487 enum write_granularity gran, const uint8_t erased_value)
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000488{
Stefan Tauner02437452013-04-01 19:34:53 +0000489 unsigned int i;
Nico Huberb77607f2023-01-16 02:25:45 +0100490 size_t stride;
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000491
492 switch (gran) {
493 case write_gran_1bit:
Nico Huberb77607f2023-01-16 02:25:45 +0100494 for (i = 0; i < len; i++) {
495 if ((have[i] & want[i]) != want[i])
496 return 1;
497 }
498 return 0;
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000499 case write_gran_1byte:
Nico Huberb77607f2023-01-16 02:25:45 +0100500 for (i = 0; i < len; i++) {
501 if ((have[i] != want[i]) && (have[i] != erased_value))
502 return 1;
503 }
504 return 0;
Carl-Daniel Hailfinger1b0e9fc2014-06-16 22:36:17 +0000505 case write_gran_1byte_implicit_erase:
506 /* Do not erase, handle content changes from anything->0xff by writing 0xff. */
Nico Huberb77607f2023-01-16 02:25:45 +0100507 return 0;
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000508 default:
Nico Huberb77607f2023-01-16 02:25:45 +0100509 stride = gran_to_bytes(gran);
510 if (stride) {
511 return need_erase_gran_bytes(have, want, len, stride, erased_value);
512 }
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000513 msg_cerr("%s: Unsupported granularity! Please report a bug at "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200514 "flashprog@flashprog.org\n", __func__);
Nico Huberb77607f2023-01-16 02:25:45 +0100515 return 0;
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000516 }
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000517}
518
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000519/**
520 * Check if the buffer @have needs to be programmed to get the content of @want.
521 * If yes, return 1 and fill in first_start with the start address of the
522 * write operation and first_len with the length of the first to-be-written
523 * chunk. If not, return 0 and leave first_start and first_len undefined.
524 *
525 * Warning: This function assumes that @have and @want point to naturally
526 * aligned regions.
527 *
528 * @have buffer with current content
529 * @want buffer with desired content
530 * @len length of the checked area
531 * @gran write granularity (enum, not count)
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000532 * @first_start offset of the first byte which needs to be written (passed in
533 * value is increased by the offset of the first needed write
534 * relative to have/want or unchanged if no write is needed)
535 * @return length of the first contiguous area which needs to be written
536 * 0 if no write is needed
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000537 *
538 * FIXME: This function needs a parameter which tells it about coalescing
539 * in relation to the max write length of the programmer and the max write
540 * length of the chip.
541 */
Nico Huber3b9c86d2023-01-15 22:58:06 +0100542static unsigned int get_next_write(const uint8_t *have, const uint8_t *want, chipsize_t len,
543 chipoff_t *first_start, enum write_granularity gran)
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000544{
Felix Singerf25447e2022-08-19 02:44:28 +0200545 bool need_write = false;
Stefan Taunerc69c9c82011-11-23 09:13:48 +0000546 unsigned int rel_start = 0, first_len = 0;
Nico Huberb77607f2023-01-16 02:25:45 +0100547 unsigned int i, limit;
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000548
Nico Huberb77607f2023-01-16 02:25:45 +0100549 const size_t stride = gran_to_bytes(gran);
550 if (!stride) {
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000551 msg_cerr("%s: Unsupported granularity! Please report a bug at "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200552 "flashprog@flashprog.org\n", __func__);
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000553 /* Claim that no write was needed. A write with unknown
554 * granularity is too dangerous to try.
555 */
556 return 0;
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000557 }
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000558 for (i = 0; i < len / stride; i++) {
559 limit = min(stride, len - i * stride);
560 /* Are 'have' and 'want' identical? */
561 if (memcmp(have + i * stride, want + i * stride, limit)) {
562 if (!need_write) {
563 /* First location where have and want differ. */
Felix Singerf25447e2022-08-19 02:44:28 +0200564 need_write = true;
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000565 rel_start = i * stride;
566 }
567 } else {
568 if (need_write) {
569 /* First location where have and want
570 * do not differ anymore.
571 */
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000572 break;
573 }
574 }
575 }
Carl-Daniel Hailfinger202bf532010-12-06 13:05:44 +0000576 if (need_write)
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000577 first_len = min(i * stride - rel_start, len);
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000578 *first_start += rel_start;
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000579 return first_len;
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000580}
581
Nico Huber2d625722016-05-03 10:48:02 +0200582/*
583 * Return a string corresponding to the bustype parameter.
584 * Memory is obtained with malloc() and must be freed with free() by the caller.
585 */
586char *flashbuses_to_text(enum chipbustype bustype)
587{
588 char *ret = calloc(1, 1);
589 /*
590 * FIXME: Once all chipsets and flash chips have been updated, NONSPI
591 * will cease to exist and should be eliminated here as well.
592 */
593 if (bustype == BUS_NONSPI) {
594 ret = strcat_realloc(ret, "Non-SPI, ");
595 } else {
596 if (bustype & BUS_PARALLEL)
597 ret = strcat_realloc(ret, "Parallel, ");
598 if (bustype & BUS_LPC)
599 ret = strcat_realloc(ret, "LPC, ");
600 if (bustype & BUS_FWH)
601 ret = strcat_realloc(ret, "FWH, ");
602 if (bustype & BUS_SPI)
603 ret = strcat_realloc(ret, "SPI, ");
604 if (bustype & BUS_PROG)
605 ret = strcat_realloc(ret, "Programmer-specific, ");
606 if (bustype == BUS_NONE)
607 ret = strcat_realloc(ret, "None, ");
608 }
609 /* Kill last comma. */
610 ret[strlen(ret) - 2] = '\0';
611 ret = realloc(ret, strlen(ret) + 1);
612 return ret;
613}
614
Edward O'Callaghan00ea3892022-10-11 21:27:37 +1100615static int init_default_layout(struct flashctx *flash)
616{
617 /* Fill default layout covering the whole chip. */
Nico Huberc3b02dc2023-08-12 01:13:45 +0200618 if (flashprog_layout_new(&flash->default_layout) ||
619 flashprog_layout_add_region(flash->default_layout,
Edward O'Callaghan00ea3892022-10-11 21:27:37 +1100620 0, flash->chip->total_size * 1024 - 1, "complete flash") ||
Nico Huberc3b02dc2023-08-12 01:13:45 +0200621 flashprog_layout_include_region(flash->default_layout, "complete flash"))
Edward O'Callaghan00ea3892022-10-11 21:27:37 +1100622 return -1;
623 return 0;
624}
625
Nico Huberaf9d7382023-05-01 13:33:26 +0200626static void probe_bus(struct registered_master *const mst, const enum id_type type)
627{
628 struct found_id **next_ptr;
629 unsigned int i;
630
631 if (mst->probed)
632 return;
633
634 next_ptr = &mst->found_ids;
635 for (i = 0; i < mst->probing.probe_count; ++i) {
636 if (type && type != mst->probing.probes[i].type)
637 continue;
638
639 *next_ptr = mst->probing.probes[i].run(&mst->probing.probes[i], &mst->common);
640
641 /* walk to end in case multiple IDs were found in a single call */
642 while (*next_ptr)
643 next_ptr = &(*next_ptr)->next;
644 }
645
646 mst->probed = true;
647}
648
649static bool chip_on_bus(struct registered_master *const mst, const struct flashprog_chip *const chip)
650{
651 static const char *const id_names[] = {
652 [ID_82802AB] = "82802AB",
653 [ID_EN29LV640B] = "EN29LV640B",
654 [ID_JEDEC] = "JEDEC",
655 [ID_JEDEC_29GL] = "JEDEC_29GL",
656 [ID_OPAQUE] = "OPAQUE",
657 [ID_SPI_AT25F] = "SPI_AT25F",
658 [ID_SPI_RDID] = "SPI_RDID",
Nico Huberaf9d7382023-05-01 13:33:26 +0200659 [ID_SPI_REMS] = "SPI_REMS",
660 [ID_SPI_RES1] = "SPI_RES1",
661 [ID_SPI_RES2] = "SPI_RES2",
662 [ID_SPI_RES3] = "SPI_RES3",
663 [ID_SPI_SFDP] = "SPI_SFDP",
664 [ID_SPI_ST95] = "SPI_ST95",
665 [ID_W29EE011] = "W29EE011",
666 [ID_EDI] = "EDI",
667 };
668
669 if (chip_to_probe) {
Nico Huber966dc9b2026-03-07 21:59:15 +0100670 /* We are looking for a particular chip.
671 If it can't be probed, assume it's there... */
672 if (chip->id.type == ID_NONE)
673 return true;
674 /* ...otherwise, limit the probing functions to its type. */
Nico Huberaf9d7382023-05-01 13:33:26 +0200675 probe_bus(mst, chip->id.type);
676 } else {
677 probe_bus(mst, 0);
678 }
679
680 struct found_id *found_id;
681 for (found_id = mst->found_ids; found_id; found_id = found_id->next) {
682 if (found_id->info.id.type != chip->id.type)
683 continue;
684
685 if (found_id->info.id.type < ARRAY_SIZE(id_names))
686 msg_cdbg("%s: id1 0x%02x, id2 0x%02x ",
687 id_names[found_id->info.id.type],
688 found_id->info.id.id1, found_id->info.id.id2);
689
690 if (mst->probing.match(chip, &found_id->info))
691 break;
692 }
693
694 msg_cdbg("\n");
695 return !!found_id;
696}
697
698/* wrapper that's used until all probing functions are ported to per-bus probing */
699int probe_buses(struct flashctx *const flash)
700{
701 int i;
702 for (i = 0; i < registered_master_count; ++i) {
703 if (flash->mst.common == &registered_masters[i].common &&
704 chip_on_bus(&registered_masters[i], flash->chip))
705 return 1;
706 }
707 return 0;
708}
709
Carl-Daniel Hailfingera5bcbce2014-07-19 22:03:29 +0000710int probe_flash(struct registered_master *mst, int startchip, struct flashctx *flash, int force)
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000711{
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000712 const struct flashchip *chip;
Carl-Daniel Hailfinger115d3902009-10-31 01:53:09 +0000713 enum chipbustype buses_common;
Carl-Daniel Hailfingerb22918c2009-06-01 02:08:58 +0000714 char *tmp;
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000715
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000716 for (chip = flashchips + startchip; chip && chip->name; chip++) {
717 if (chip_to_probe && strcmp(chip->name, chip_to_probe) != 0)
Ollie Lhocbbf1252004-03-17 22:22:08 +0000718 continue;
Carl-Daniel Hailfingera5bcbce2014-07-19 22:03:29 +0000719 buses_common = mst->buses_supported & chip->bustype;
Carl-Daniel Hailfingerc40cff72011-12-20 00:19:29 +0000720 if (!buses_common)
Carl-Daniel Hailfinger6573b742011-06-17 22:38:53 +0000721 continue;
Mike Banon31b5e3b2018-01-15 01:10:00 +0300722 /* Only probe for SPI25 chips by default. */
723 if (chip->bustype == BUS_SPI && !chip_to_probe && chip->spi_cmd_set != SPI25)
724 continue;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000725 msg_gdbg("Probing for %s %s, %d kB: ", chip->vendor, chip->name, chip->total_size);
726 if (!chip->probe && !force) {
Nico Huberc3b02dc2023-08-12 01:13:45 +0200727 msg_gdbg("failed! flashprog has no probe function for this flash chip.\n");
Carl-Daniel Hailfingerb22918c2009-06-01 02:08:58 +0000728 continue;
729 }
Stefan Reinauer70385642007-04-06 11:58:03 +0000730
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000731 /* Start filling in the dynamic data. */
Angel Pons690a9442021-06-07 12:33:53 +0200732 flash->chip = calloc(1, sizeof(*flash->chip));
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000733 if (!flash->chip) {
734 msg_gerr("Out of memory!\n");
Edward O'Callaghan6edf9f82022-11-12 12:08:46 +1100735 return -1;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000736 }
Angel Pons7e134562021-06-07 13:29:13 +0200737 *flash->chip = *chip;
Nico Huber9a11cbf2023-01-13 01:19:07 +0100738 flash->mst.par = &mst->par; /* both `mst` are unions, so we need only one pointer */
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000739
Nico Huber5469c152026-02-12 22:56:52 +0100740 /* If we probe for a specific chip, we can adapt the voltage early. */
741 if (chip_to_probe && flash->mst.common->adapt_voltage) {
742 if (flash->mst.common->adapt_voltage(flash->mst.common,
743 chip->voltage.min, chip->voltage.max))
744 goto free_chip;
745 }
746
Nico Huber9eec4072023-01-12 01:17:30 +0100747 if (flash->chip->prepare_access && flash->chip->prepare_access(flash, PREPARE_PROBE))
748 goto free_chip;
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000749
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000750 /* We handle a forced match like a real match, we just avoid probing. Note that probe_flash()
751 * is only called with force=1 after normal probing failed.
752 */
Peter Stuge27c3e2d2008-07-02 17:15:47 +0000753 if (force)
754 break;
Stefan Reinauerfcb63682006-03-16 16:57:41 +0000755
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000756 if (flash->chip->probe(flash) != 1)
Peter Stuge483b8f02008-09-03 23:10:05 +0000757 goto notfound;
758
Nico Huberb89c4522024-12-04 23:30:13 +0100759 if (flash->chip->prepare_access && flash->chip->prepare_access(flash, PREPARE_POST_PROBE))
760 goto notfound;
761
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000762 /* If this is the first chip found, accept it.
763 * If this is not the first chip found, accept it only if it is
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000764 * a non-generic match. SFDP and CFI are generic matches.
765 * startchip==0 means this call to probe_flash() is the first
Carl-Daniel Hailfingera5bcbce2014-07-19 22:03:29 +0000766 * one for this programmer interface (master) and thus no other chip has
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000767 * been found on this interface.
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000768 */
Nico Huber11136c22023-05-01 12:00:09 +0200769 if (startchip == 0 && flash->chip->id.model == SFDP_DEVICE_ID) {
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000770 msg_cinfo("===\n"
771 "SFDP has autodetected a flash chip which is "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200772 "not natively supported by flashprog yet.\n");
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000773 if (count_usable_erasers(flash) == 0)
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000774 msg_cinfo("The standard operations read and "
775 "verify should work, but to support "
776 "erase, write and all other "
777 "possible features");
778 else
779 msg_cinfo("All standard operations (read, "
780 "verify, erase and write) should "
781 "work, but to support all possible "
782 "features");
783
Stefan Taunerb4e06bd2012-08-20 00:24:22 +0000784 msg_cinfo(" we need to add them manually.\n"
785 "You can help us by mailing us the output of the following command to "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200786 "flashprog@flashprog.org:\n"
787 "'flashprog -VV [plus the -p/--programmer parameter]'\n"
Stefan Taunerb4e06bd2012-08-20 00:24:22 +0000788 "Thanks for your help!\n"
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000789 "===\n");
790 }
791
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000792 /* First flash chip detected on this bus. */
793 if (startchip == 0)
Peter Stuge27c3e2d2008-07-02 17:15:47 +0000794 break;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000795 /* Not the first flash chip detected on this bus, but not a generic match either. */
Nico Huber11136c22023-05-01 12:00:09 +0200796 if ((flash->chip->id.model != GENERIC_DEVICE_ID) && (flash->chip->id.model != SFDP_DEVICE_ID))
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000797 break;
798 /* 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 +0000799notfound:
Nico Huber9eec4072023-01-12 01:17:30 +0100800 if (flash->chip->finish_access)
801 flash->chip->finish_access(flash);
802free_chip:
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000803 free(flash->chip);
804 flash->chip = NULL;
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000805 }
Uwe Hermannffec5f32007-08-23 16:08:21 +0000806
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000807 if (!flash->chip)
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000808 return -1;
Peter Stuge27c3e2d2008-07-02 17:15:47 +0000809
Edward O'Callaghan00ea3892022-10-11 21:27:37 +1100810 if (init_default_layout(flash) < 0)
811 return -1;
Stefan Reinauer051e2362011-01-19 06:21:54 +0000812
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000813 tmp = flashbuses_to_text(flash->chip->bustype);
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000814 msg_cinfo("%s %s flash chip \"%s\" (%d kB, %s) ", force ? "Assuming" : "Found",
815 flash->chip->vendor, flash->chip->name, flash->chip->total_size, tmp);
Stefan Tauner00155492011-06-26 20:45:35 +0000816 free(tmp);
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000817#if CONFIG_INTERNAL == 1
Nico Huber0e76d992023-01-12 20:22:55 +0100818 if (flash->physical_memory != 0 && mst->par.map_flash == physmap)
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000819 msg_cinfo("mapped at physical address 0x%0*" PRIxPTR ".\n",
820 PRIxPTR_WIDTH, flash->physical_memory);
821 else
822#endif
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +0200823 msg_cinfo("on %s.\n", programmer->name);
Uwe Hermann9899cad2009-06-28 21:47:57 +0000824
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000825 /* Flash registers may more likely not be mapped if the chip was forced.
826 * Lock info may be stored in registers, so avoid lock info printing. */
Carl-Daniel Hailfinger859f3f02010-12-02 21:59:42 +0000827 if (!force)
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000828 if (flash->chip->printlock)
829 flash->chip->printlock(flash);
Sean Nelson6e0b9122010-02-19 00:52:10 +0000830
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000831 /* Get out of the way for later runs. */
Nico Huber9eec4072023-01-12 01:17:30 +0100832 if (flash->chip->finish_access)
833 flash->chip->finish_access(flash);
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000834
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000835 /* Return position of matching chip. */
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000836 return chip - flashchips;
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000837}
838
Stefan Tauner96658be2014-05-26 22:05:31 +0000839/* Even if an error is found, the function will keep going and check the rest. */
Nico Huber72d0ada2026-01-26 18:28:20 +0100840static int selfcheck_eraseblocks(const struct flashchip *chip, const char *label)
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000841{
Carl-Daniel Hailfinger082c8b52011-08-15 19:54:20 +0000842 int i, j, k;
843 int ret = 0;
Aarya Chaumal478e1792022-06-04 01:34:44 +0530844 unsigned int prev_eraseblock_count = chip->total_size * 1024;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000845
846 for (k = 0; k < NUM_ERASEFUNCTIONS; k++) {
847 unsigned int done = 0;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000848 struct block_eraser eraser = chip->block_erasers[k];
Aarya Chaumal478e1792022-06-04 01:34:44 +0530849 unsigned int curr_eraseblock_count = 0;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000850
851 for (i = 0; i < NUM_ERASEREGIONS; i++) {
852 /* Blocks with zero size are bugs in flashchips.c. */
853 if (eraser.eraseblocks[i].count &&
854 !eraser.eraseblocks[i].size) {
Nico Huberac90af62022-12-18 00:22:47 +0000855 msg_gerr("ERROR: Flash chip %s erase function %i region %i has size 0.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +0200856 "Please report a bug at flashprog@flashprog.org\n",
Nico Huber72d0ada2026-01-26 18:28:20 +0100857 label, k, i);
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000858 ret = 1;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000859 }
860 /* Blocks with zero count are bugs in flashchips.c. */
861 if (!eraser.eraseblocks[i].count &&
862 eraser.eraseblocks[i].size) {
Nico Huberac90af62022-12-18 00:22:47 +0000863 msg_gerr("ERROR: Flash chip %s erase function %i region %i has count 0.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +0200864 "Please report a bug at flashprog@flashprog.org\n",
Nico Huber72d0ada2026-01-26 18:28:20 +0100865 label, k, i);
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000866 ret = 1;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000867 }
868 done += eraser.eraseblocks[i].count *
869 eraser.eraseblocks[i].size;
Aarya Chaumal478e1792022-06-04 01:34:44 +0530870 curr_eraseblock_count += eraser.eraseblocks[i].count;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000871 }
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000872 /* Empty eraseblock definition with erase function. */
873 if (!done && eraser.block_erase)
Sean Nelson316a29f2010-05-07 20:09:04 +0000874 msg_gspew("Strange: Empty eraseblock definition with "
Uwe Hermann91f4afa2011-07-28 08:13:25 +0000875 "non-empty erase function. Not an error.\n");
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000876 if (!done)
877 continue;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000878 if (done != chip->total_size * 1024) {
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000879 msg_gerr("ERROR: Flash chip %s erase function %i "
880 "region walking resulted in 0x%06x bytes total,"
Nico Huberac90af62022-12-18 00:22:47 +0000881 " expected 0x%06x bytes.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +0200882 "Please report a bug at flashprog@flashprog.org\n",
Nico Huber72d0ada2026-01-26 18:28:20 +0100883 label, k, done, chip->total_size * 1024);
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000884 ret = 1;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000885 }
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000886 if (!eraser.block_erase)
887 continue;
888 /* Check if there are identical erase functions for different
889 * layouts. That would imply "magic" erase functions. The
890 * easiest way to check this is with function pointers.
891 */
Uwe Hermann43959702010-03-13 17:28:29 +0000892 for (j = k + 1; j < NUM_ERASEFUNCTIONS; j++) {
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000893 if (eraser.block_erase ==
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000894 chip->block_erasers[j].block_erase) {
Nico Huberac90af62022-12-18 00:22:47 +0000895 msg_gerr("ERROR: Flash chip %s erase function %i and %i are identical.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +0200896 "Please report a bug at flashprog@flashprog.org\n",
Nico Huber72d0ada2026-01-26 18:28:20 +0100897 label, k, j);
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000898 ret = 1;
899 }
Uwe Hermann43959702010-03-13 17:28:29 +0000900 }
Aarya Chaumal478e1792022-06-04 01:34:44 +0530901 if(curr_eraseblock_count > prev_eraseblock_count)
902 {
Nico Huberac90af62022-12-18 00:22:47 +0000903 msg_gerr("ERROR: Flash chip %s erase function %i is not in order.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +0200904 "Please report a bug at flashprog@flashprog.org\n",
Nico Huber72d0ada2026-01-26 18:28:20 +0100905 label, k);
Aarya Chaumal478e1792022-06-04 01:34:44 +0530906 ret = 1;
907 }
908 prev_eraseblock_count = curr_eraseblock_count;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000909 }
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000910 return ret;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000911}
912
Carl-Daniel Hailfinger63fd9022011-12-14 22:25:15 +0000913static int check_block_eraser(const struct flashctx *flash, int k, int log)
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000914{
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000915 struct block_eraser eraser = flash->chip->block_erasers[k];
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000916
917 if (!eraser.block_erase && !eraser.eraseblocks[0].count) {
918 if (log)
919 msg_cdbg("not defined. ");
920 return 1;
921 }
922 if (!eraser.block_erase && eraser.eraseblocks[0].count) {
923 if (log)
924 msg_cdbg("eraseblock layout is known, but matching "
Stefan Tauner355cbfd2011-05-28 02:37:14 +0000925 "block erase function is not implemented. ");
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000926 return 1;
927 }
928 if (eraser.block_erase && !eraser.eraseblocks[0].count) {
929 if (log)
930 msg_cdbg("block erase function found, but "
Stefan Tauner355cbfd2011-05-28 02:37:14 +0000931 "eraseblock layout is not defined. ");
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000932 return 1;
933 }
Aarya Chaumal6d98aec2022-08-14 23:16:44 +0530934
Nico Hubere149fbe2024-08-21 10:23:53 +0200935 if (flash->chip->bustype == BUS_SPI && flash->chip->spi_cmd_set == SPI25) {
Nico Huber13389362024-03-05 18:35:30 +0100936 bool native_4ba;
Nico Huber13f97a52023-01-14 23:55:06 +0100937 int i;
Nico Huber13389362024-03-05 18:35:30 +0100938
939 const uint8_t *opcode = spi_get_opcode_from_erasefn(eraser.block_erase, &native_4ba);
Nico Huber07ebc682024-08-21 10:18:27 +0200940 if (!opcode)
941 return 1;
942
Nico Huber13f97a52023-01-14 23:55:06 +0100943 for (i = 0; opcode[i]; i++) {
Nico Huber13389362024-03-05 18:35:30 +0100944 if ((native_4ba && !spi_master_4ba(flash)) ||
Nico Huber9a11cbf2023-01-13 01:19:07 +0100945 !flash->mst.spi->probe_opcode(flash, opcode[i])) {
Aarya Chaumal6d98aec2022-08-14 23:16:44 +0530946 if (log)
947 msg_cdbg("block erase function and layout found "
948 "but SPI master doesn't support the function. ");
949 return 1;
950 }
951 }
952 }
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000953 // TODO: Once erase functions are annotated with allowed buses, check that as well.
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000954 return 0;
955}
956
Nico Huber7af0e792016-04-29 16:40:15 +0200957/**
958 * @brief Reads the included layout regions into a buffer.
959 *
960 * If there is no layout set in the given flash context, the whole chip will
961 * be read.
962 *
963 * @param flashctx Flash context to be used.
964 * @param buffer Buffer of full chip size to read into.
965 * @return 0 on success,
966 * 1 if any read fails.
967 */
968static int read_by_layout(struct flashctx *const flashctx, uint8_t *const buffer)
969{
Nico Huberc3b02dc2023-08-12 01:13:45 +0200970 const struct flashprog_layout *const layout = get_layout(flashctx);
Nico Huber5ca55232019-06-15 22:29:08 +0200971 const struct romentry *entry = NULL;
Nico Huber7af0e792016-04-29 16:40:15 +0200972
Richard Hughes842d6782021-01-15 09:48:12 +0000973 flashprog_progress_start_by_layout(flashctx, FLASHPROG_PROGRESS_READ, layout);
974
Nico Huber5ca55232019-06-15 22:29:08 +0200975 while ((entry = layout_next_included(layout, entry))) {
976 const chipoff_t region_start = entry->start;
977 const chipsize_t region_len = entry->end - entry->start + 1;
Nico Huber7af0e792016-04-29 16:40:15 +0200978
979 if (flashctx->chip->read(flashctx, buffer + region_start, region_start, region_len))
980 return 1;
981 }
Richard Hughes842d6782021-01-15 09:48:12 +0000982
983 flashprog_progress_finish(flashctx);
984
Nico Huber7af0e792016-04-29 16:40:15 +0200985 return 0;
986}
987
Nico Huber7af0e792016-04-29 16:40:15 +0200988/**
989 * @private
990 *
991 * For read-erase-write, `curcontents` and `newcontents` shall point
992 * to buffers of the chip's size. Both are supposed to be prefilled
993 * with at least the included layout regions of the current flash
994 * contents (`curcontents`) and the data to be written to the flash
995 * (`newcontents`).
996 *
997 * For erase, `curcontents` and `newcontents` shall be NULL-pointers.
998 *
999 * The `chipoff_t` values are used internally by `walk_by_layout()`.
1000 */
1001struct walk_info {
1002 uint8_t *curcontents;
1003 const uint8_t *newcontents;
1004 chipoff_t region_start;
1005 chipoff_t region_end;
1006 chipoff_t erase_start;
1007 chipoff_t erase_end;
1008};
Nico Huber3b9c86d2023-01-15 22:58:06 +01001009
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301010struct eraseblock_data {
1011 chipoff_t start_addr;
1012 chipoff_t end_addr;
1013 bool selected;
1014 size_t block_num;
1015 size_t first_sub_block_index;
1016 size_t last_sub_block_index;
1017};
1018
1019struct erase_layout {
1020 struct eraseblock_data* layout_list;
1021 size_t block_count;
1022 const struct block_eraser *eraser;
1023};
1024
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001025static bool explicit_erase(const struct walk_info *const info)
1026{
1027 /* For explicit erase, we are called without new contents. */
1028 return !info->newcontents;
1029}
1030
Nico Huberd96e7032023-01-14 22:31:48 +01001031static size_t calculate_block_count(const struct block_eraser *const eraser)
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301032{
Nico Huberd96e7032023-01-14 22:31:48 +01001033 size_t block_count = 0, i;
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301034
Nico Huberd96e7032023-01-14 22:31:48 +01001035 for (i = 0; i < ARRAY_SIZE(eraser->eraseblocks); ++i)
1036 block_count += eraser->eraseblocks[i].count;
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301037
1038 return block_count;
1039}
1040
1041static void init_eraseblock(struct erase_layout *layout, size_t idx, size_t block_num,
1042 chipoff_t start_addr, chipoff_t end_addr, size_t *sub_block_index)
1043{
1044 struct eraseblock_data *edata = &layout[idx].layout_list[block_num];
1045 edata->start_addr = start_addr;
1046 edata->end_addr = end_addr;
1047 edata->selected = false;
1048 edata->block_num = block_num;
1049
1050 if (!idx)
1051 return;
Nico Hubera02df332023-01-14 23:06:27 +01001052 const struct erase_layout *const sub_layout = &layout[idx - 1];
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301053
1054 edata->first_sub_block_index = *sub_block_index;
Nico Hubera02df332023-01-14 23:06:27 +01001055 for (; *sub_block_index < sub_layout->block_count; ++*sub_block_index) {
1056 if (sub_layout->layout_list[*sub_block_index].end_addr > end_addr)
1057 break;
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301058 }
1059 edata->last_sub_block_index = *sub_block_index - 1;
1060}
1061
1062/*
1063 * @brief Function to free the created erase_layout
1064 *
1065 * @param layout pointer to allocated layout
1066 * @param erasefn_count number of erase functions for which the layout was created
1067 *
1068 */
1069static void free_erase_layout(struct erase_layout *layout, unsigned int erasefn_count)
1070{
Nico Huber13f97a52023-01-14 23:55:06 +01001071 size_t i;
1072
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301073 if (!layout)
1074 return;
Nico Huber13f97a52023-01-14 23:55:06 +01001075 for (i = 0; i < erasefn_count; i++) {
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301076 free(layout[i].layout_list);
1077 }
1078 free(layout);
1079}
1080
1081/*
1082 * @brief Function to create an erase layout
1083 *
1084 * @param flashctx flash context
1085 * @param e_layout address to the pointer to store the layout
1086 * @return 0 on success,
1087 * -1 if layout creation fails
1088 *
1089 * This function creates a layout of which erase functions erase which regions
1090 * of the flash chip. This helps to optimally select the erase functions for
1091 * erase/write operations.
1092 */
Nico Huberc09fca42023-01-29 15:58:09 +01001093static int create_erase_layout(struct flashctx *const flashctx, struct erase_layout **e_layout)
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301094{
1095 const struct flashchip *chip = flashctx->chip;
1096 const size_t erasefn_count = count_usable_erasers(flashctx);
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301097
1098 if (!erasefn_count) {
1099 msg_gerr("No erase functions supported\n");
1100 return 0;
1101 }
1102
Nico Huberd34864b2023-01-14 23:47:19 +01001103 struct erase_layout *layout = calloc(erasefn_count, sizeof(struct erase_layout));
1104 if (!layout) {
1105 msg_gerr("Out of memory!\n");
1106 return -1;
1107 }
1108
Nico Huber13f97a52023-01-14 23:55:06 +01001109 size_t layout_idx = 0, eraser_idx;
1110 for (eraser_idx = 0; eraser_idx < NUM_ERASEFUNCTIONS; eraser_idx++) {
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301111 if (check_block_eraser(flashctx, eraser_idx, 0))
1112 continue;
1113
1114 layout[layout_idx].eraser = &chip->block_erasers[eraser_idx];
Nico Huberd96e7032023-01-14 22:31:48 +01001115 const size_t block_count = calculate_block_count(&chip->block_erasers[eraser_idx]);
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301116 size_t sub_block_index = 0;
1117
1118 layout[layout_idx].block_count = block_count;
1119 layout[layout_idx].layout_list = (struct eraseblock_data *)calloc(block_count,
1120 sizeof(struct eraseblock_data));
1121
1122 if (!layout[layout_idx].layout_list) {
1123 free_erase_layout(layout, layout_idx);
1124 return -1;
1125 }
1126
1127 size_t block_num = 0;
1128 chipoff_t start_addr = 0;
1129
Nico Huber13f97a52023-01-14 23:55:06 +01001130 int i;
1131 for (i = 0; block_num < block_count; i++) {
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301132 const struct eraseblock *block = &chip->block_erasers[eraser_idx].eraseblocks[i];
1133
Nico Huber13f97a52023-01-14 23:55:06 +01001134 size_t num;
1135 for (num = 0; num < block->count; num++) {
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301136 chipoff_t end_addr = start_addr + block->size - 1;
1137 init_eraseblock(layout, layout_idx, block_num,
1138 start_addr, end_addr, &sub_block_index);
1139 block_num += 1;
1140 start_addr = end_addr + 1;
1141 }
1142 }
1143 layout_idx++;
1144 }
1145
1146 *e_layout = layout;
1147 return layout_idx;
1148}
1149
Nico Huber20073e72024-05-10 01:31:40 +02001150static void deselect_erase_block_rec(const struct erase_layout *layout, size_t findex, size_t block_num)
1151{
1152 struct eraseblock_data *const ed = &layout[findex].layout_list[block_num];
1153 size_t i;
1154
1155 if (ed->selected) {
1156 ed->selected = false;
1157 } else if (findex > 0) {
1158 for (i = ed->first_sub_block_index; i <= ed->last_sub_block_index; ++i)
1159 deselect_erase_block_rec(layout, findex - 1, i);
1160 }
1161}
1162
Aarya Chaumald33bea42022-07-14 12:51:14 +05301163/*
1164 * @brief Function to select the list of sectors that need erasing
1165 *
1166 * @param flashctx flash context
1167 * @param layout erase layout
1168 * @param findex index of the erase function
1169 * @param block_num index of the block to erase according to the erase function index
Nico Huber00d1b9f2023-01-29 15:07:33 +01001170 * @param info current info from walking the regions
Nico Huberaa714dd2023-04-22 14:59:33 +02001171 * @return number of bytes selected for erase
Aarya Chaumald33bea42022-07-14 12:51:14 +05301172 */
Nico Huberaa714dd2023-04-22 14:59:33 +02001173static size_t select_erase_functions_rec(const struct flashctx *flashctx, const struct erase_layout *layout,
1174 size_t findex, size_t block_num, const struct walk_info *info)
Aarya Chaumald33bea42022-07-14 12:51:14 +05301175{
1176 struct eraseblock_data *ll = &layout[findex].layout_list[block_num];
Nico Huberaa714dd2023-04-22 14:59:33 +02001177 const size_t eraseblock_size = ll->end_addr - ll->start_addr + 1;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301178 if (!findex) {
Nico Hubercf6ff0a2023-01-29 15:45:06 +01001179 if (ll->start_addr <= info->region_end && ll->end_addr >= info->region_start) {
Nico Huber1494f8e2023-01-29 15:48:00 +01001180 if (explicit_erase(info)) {
1181 ll->selected = true;
Nico Huberaa714dd2023-04-22 14:59:33 +02001182 return eraseblock_size;
Nico Huber1494f8e2023-01-29 15:48:00 +01001183 }
Nico Hubera6212482023-01-29 15:39:26 +01001184 const chipoff_t write_start = MAX(info->region_start, ll->start_addr);
1185 const chipoff_t write_end = MIN(info->region_end, ll->end_addr);
1186 const chipsize_t write_len = write_end - write_start + 1;
1187 const uint8_t erased_value = ERASED_VALUE(flashctx);
Nico Huber00d1b9f2023-01-29 15:07:33 +01001188 ll->selected = need_erase(
Nico Hubera6212482023-01-29 15:39:26 +01001189 info->curcontents + write_start, info->newcontents + write_start,
1190 write_len, flashctx->chip->gran, erased_value);
Nico Huberaa714dd2023-04-22 14:59:33 +02001191 if (ll->selected)
1192 return eraseblock_size;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301193 }
Nico Huberaa714dd2023-04-22 14:59:33 +02001194 return 0;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301195 } else {
Aarya Chaumald33bea42022-07-14 12:51:14 +05301196 const int sub_block_start = ll->first_sub_block_index;
1197 const int sub_block_end = ll->last_sub_block_index;
Nico Huberaa714dd2023-04-22 14:59:33 +02001198 size_t bytes = 0;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301199
Nico Huber13f97a52023-01-14 23:55:06 +01001200 int j;
Nico Huberaa714dd2023-04-22 14:59:33 +02001201 for (j = sub_block_start; j <= sub_block_end; j++)
1202 bytes += select_erase_functions_rec(flashctx, layout, findex - 1, j, info);
Aarya Chaumald33bea42022-07-14 12:51:14 +05301203
Nico Huberaa714dd2023-04-22 14:59:33 +02001204 if (bytes > eraseblock_size / 2) {
Nico Huber00d1b9f2023-01-29 15:07:33 +01001205 if (ll->start_addr >= info->region_start && ll->end_addr <= info->region_end) {
Nico Huber20073e72024-05-10 01:31:40 +02001206 deselect_erase_block_rec(layout, findex, block_num);
Aarya Chaumald33bea42022-07-14 12:51:14 +05301207 ll->selected = true;
Nico Huberaa714dd2023-04-22 14:59:33 +02001208 bytes = eraseblock_size;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301209 }
1210 }
Nico Huberaa714dd2023-04-22 14:59:33 +02001211 return bytes;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301212 }
1213}
1214
Nico Huberaa714dd2023-04-22 14:59:33 +02001215static size_t select_erase_functions(const struct flashctx *flashctx, const struct erase_layout *layout,
1216 size_t erasefn_count, const struct walk_info *info)
Nico Huberb11b72c2023-01-29 15:33:11 +01001217{
Nico Huberaa714dd2023-04-22 14:59:33 +02001218 size_t bytes = 0;
Nico Huberb11b72c2023-01-29 15:33:11 +01001219 size_t block_num;
1220 for (block_num = 0; block_num < layout[erasefn_count - 1].block_count; ++block_num)
Nico Huberaa714dd2023-04-22 14:59:33 +02001221 bytes += select_erase_functions_rec(flashctx, layout, erasefn_count - 1, block_num, info);
1222 return bytes;
Nico Huberb11b72c2023-01-29 15:33:11 +01001223}
1224
Nico Huber3b9c86d2023-01-15 22:58:06 +01001225static int write_range(struct flashctx *const flashctx, const chipoff_t flash_offset,
1226 const uint8_t *const curcontents, const uint8_t *const newcontents,
1227 const chipsize_t len, bool *const skipped)
1228{
1229 unsigned int writecount = 0;
1230 chipoff_t starthere = 0;
1231 chipsize_t lenhere = 0;
1232
1233 while ((lenhere = get_next_write(curcontents + starthere, newcontents + starthere,
1234 len - starthere, &starthere, flashctx->chip->gran))) {
1235 if (!writecount++)
1236 msg_cdbg("W");
1237 if (flashctx->chip->write(flashctx, newcontents + starthere,
1238 flash_offset + starthere, lenhere))
1239 return 1;
1240 starthere += lenhere;
Richard Hughes842d6782021-01-15 09:48:12 +00001241 if (skipped) {
1242 flashprog_progress_set(flashctx, starthere);
Nico Huber3b9c86d2023-01-15 22:58:06 +01001243 *skipped = false;
Richard Hughes842d6782021-01-15 09:48:12 +00001244 }
Nico Huber3b9c86d2023-01-15 22:58:06 +01001245 }
1246 return 0;
1247}
1248
1249typedef int (*erasefn_t)(struct flashctx *, unsigned int addr, unsigned int len);
Nico Huber7af0e792016-04-29 16:40:15 +02001250/* returns 0 on success, 1 to retry with another erase function, 2 for immediate abort */
1251typedef int (*per_blockfn_t)(struct flashctx *, const struct walk_info *, erasefn_t);
1252
1253static int walk_eraseblocks(struct flashctx *const flashctx,
Nico Huberc09fca42023-01-29 15:58:09 +01001254 struct erase_layout *const layouts,
1255 const size_t layout_count,
Nico Huber7af0e792016-04-29 16:40:15 +02001256 struct walk_info *const info,
Nico Huberc09fca42023-01-29 15:58:09 +01001257 const per_blockfn_t per_blockfn)
Nico Huber7af0e792016-04-29 16:40:15 +02001258{
1259 int ret;
1260 size_t i, j;
1261 bool first = true;
Nico Huber7af0e792016-04-29 16:40:15 +02001262
Nico Huberc09fca42023-01-29 15:58:09 +01001263 for (i = 0; i < layout_count; ++i) {
1264 const struct erase_layout *const layout = &layouts[i];
Nico Huber7af0e792016-04-29 16:40:15 +02001265
Nico Huberc09fca42023-01-29 15:58:09 +01001266 for (j = 0; j < layout->block_count; ++j) {
1267 struct eraseblock_data *const eb = &layout->layout_list[j];
1268
1269 if (eb->start_addr > info->region_end)
Nico Huber7af0e792016-04-29 16:40:15 +02001270 break;
Nico Huberc09fca42023-01-29 15:58:09 +01001271 if (eb->end_addr < info->region_start)
1272 continue;
1273 if (!eb->selected)
1274 continue;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001275
Nico Huber7af0e792016-04-29 16:40:15 +02001276 /* Print this for every block except the first one. */
1277 if (first)
1278 first = false;
1279 else
1280 msg_cdbg(", ");
Nico Huberc09fca42023-01-29 15:58:09 +01001281 msg_cdbg("0x%06x-0x%06x:", eb->start_addr, eb->end_addr);
Nico Huber7af0e792016-04-29 16:40:15 +02001282
Nico Huberc09fca42023-01-29 15:58:09 +01001283 info->erase_start = eb->start_addr;
1284 info->erase_end = eb->end_addr;
1285 ret = per_blockfn(flashctx, info, layout->eraser->block_erase);
Nico Huber7af0e792016-04-29 16:40:15 +02001286 if (ret)
1287 return ret;
Nico Huberc09fca42023-01-29 15:58:09 +01001288
1289 /* Clean the erase layout up for future use on other
1290 regions. `.selected` is the only field we alter. */
1291 eb->selected = false;
Nico Huber7af0e792016-04-29 16:40:15 +02001292 }
Nico Huber7af0e792016-04-29 16:40:15 +02001293 }
1294 msg_cdbg("\n");
1295 return 0;
1296}
1297
1298static int walk_by_layout(struct flashctx *const flashctx, struct walk_info *const info,
1299 const per_blockfn_t per_blockfn)
1300{
Nico Huberc09fca42023-01-29 15:58:09 +01001301 const bool do_erase = explicit_erase(info) || !(flashctx->chip->feature_bits & FEATURE_NO_ERASE);
Nico Huberc3b02dc2023-08-12 01:13:45 +02001302 const struct flashprog_layout *const layout = get_layout(flashctx);
Nico Huberc09fca42023-01-29 15:58:09 +01001303 struct erase_layout *erase_layouts = NULL;
Nico Huber5ca55232019-06-15 22:29:08 +02001304 const struct romentry *entry = NULL;
Nico Huberc09fca42023-01-29 15:58:09 +01001305 int ret = 0, layout_count = 0;
Nico Huber7af0e792016-04-29 16:40:15 +02001306
1307 all_skipped = true;
Nico Huberc6a924a2024-09-04 15:09:52 +02001308 msg_cinfo("Erasing %sflash chip... ", info->newcontents ? "and writing " : "");
Nico Huber7af0e792016-04-29 16:40:15 +02001309
Nico Huberc09fca42023-01-29 15:58:09 +01001310 if (do_erase) {
1311 layout_count = create_erase_layout(flashctx, &erase_layouts);
1312 if (layout_count <= 0)
1313 return 1;
1314 }
1315
Nico Huber5ca55232019-06-15 22:29:08 +02001316 while ((entry = layout_next_included(layout, entry))) {
1317 info->region_start = entry->start;
1318 info->region_end = entry->end;
Nico Huber7af0e792016-04-29 16:40:15 +02001319
Nico Huberc09fca42023-01-29 15:58:09 +01001320 if (do_erase) {
Richard Hughes842d6782021-01-15 09:48:12 +00001321 const size_t total = select_erase_functions(flashctx, erase_layouts, layout_count, info);
1322
1323 /* We verify every erased block manually. Technically that's
1324 reading, but accounting for it as part of the erase helps
1325 to provide a smooth, overall progress. Hence `total * 2`. */
1326 flashprog_progress_start(flashctx, FLASHPROG_PROGRESS_ERASE, total * 2);
1327
Nico Huberc09fca42023-01-29 15:58:09 +01001328 ret = walk_eraseblocks(flashctx, erase_layouts, layout_count, info, per_blockfn);
1329 if (ret) {
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001330 msg_cerr("FAILED!\n");
Nico Huberc09fca42023-01-29 15:58:09 +01001331 goto free_ret;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001332 }
Richard Hughes842d6782021-01-15 09:48:12 +00001333
1334 flashprog_progress_finish(flashctx);
Nico Huber7af0e792016-04-29 16:40:15 +02001335 }
Nico Huberd34af7a2023-01-15 23:58:18 +01001336
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001337 if (info->newcontents) {
1338 bool skipped = true;
1339 msg_cdbg("0x%06x-0x%06x:", info->region_start, info->region_end);
Richard Hughes842d6782021-01-15 09:48:12 +00001340 flashprog_progress_start(flashctx, FLASHPROG_PROGRESS_WRITE,
1341 info->region_end - info->region_start + 1);
Nico Huberc09fca42023-01-29 15:58:09 +01001342 ret = write_range(flashctx, info->region_start,
1343 info->curcontents + info->region_start,
1344 info->newcontents + info->region_start,
1345 info->region_end + 1 - info->region_start, &skipped);
1346 if (ret) {
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001347 msg_cerr("FAILED!\n");
Nico Huberc09fca42023-01-29 15:58:09 +01001348 goto free_ret;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001349 }
Richard Hughes842d6782021-01-15 09:48:12 +00001350 flashprog_progress_finish(flashctx);
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001351 if (skipped) {
1352 msg_cdbg("S\n");
1353 } else {
1354 msg_cdbg("\n");
1355 all_skipped = false;
1356 }
Nico Huberd34af7a2023-01-15 23:58:18 +01001357 }
Nico Huber7af0e792016-04-29 16:40:15 +02001358 }
1359 if (all_skipped)
1360 msg_cinfo("\nWarning: Chip content is identical to the requested image.\n");
Nico Huberc6a924a2024-09-04 15:09:52 +02001361 msg_cinfo("Erase%s done.\n", info->newcontents ? "/write" : "");
Nico Huberc09fca42023-01-29 15:58:09 +01001362
1363free_ret:
1364 free_erase_layout(erase_layouts, layout_count);
1365 return ret;
Nico Huber7af0e792016-04-29 16:40:15 +02001366}
1367
1368static int erase_block(struct flashctx *const flashctx,
1369 const struct walk_info *const info, const erasefn_t erasefn)
1370{
1371 const unsigned int erase_len = info->erase_end + 1 - info->erase_start;
Nico Huber6e61e0c2019-01-23 17:07:49 +01001372 const bool region_unaligned = info->region_start > info->erase_start ||
1373 info->erase_end > info->region_end;
1374 uint8_t *backup_contents = NULL, *erased_contents = NULL;
Nico Huberd34af7a2023-01-15 23:58:18 +01001375 int ret = 1;
Nico Huber7af0e792016-04-29 16:40:15 +02001376
Nico Huber6e61e0c2019-01-23 17:07:49 +01001377 /*
1378 * If the region is not erase-block aligned, merge current flash con-
1379 * tents into a new buffer `backup_contents`.
1380 */
1381 if (region_unaligned) {
1382 backup_contents = malloc(erase_len);
1383 erased_contents = malloc(erase_len);
1384 if (!backup_contents || !erased_contents) {
1385 msg_cerr("Out of memory!\n");
Nico Huber6e61e0c2019-01-23 17:07:49 +01001386 goto _free_ret;
1387 }
1388 memset(backup_contents, ERASED_VALUE(flashctx), erase_len);
1389 memset(erased_contents, ERASED_VALUE(flashctx), erase_len);
1390
1391 msg_cdbg("R");
1392 /* Merge data preceding the current region. */
1393 if (info->region_start > info->erase_start) {
1394 const chipoff_t start = info->erase_start;
1395 const chipsize_t len = info->region_start - info->erase_start;
1396 if (flashctx->chip->read(flashctx, backup_contents, start, len)) {
1397 msg_cerr("Can't read! Aborting.\n");
1398 goto _free_ret;
1399 }
1400 }
1401 /* Merge data following the current region. */
1402 if (info->erase_end > info->region_end) {
1403 const chipoff_t start = info->region_end + 1;
1404 const chipoff_t rel_start = start - info->erase_start; /* within this erase block */
1405 const chipsize_t len = info->erase_end - info->region_end;
1406 if (flashctx->chip->read(flashctx, backup_contents + rel_start, start, len)) {
1407 msg_cerr("Can't read! Aborting.\n");
1408 goto _free_ret;
1409 }
1410 }
1411 }
1412
Nico Huber7af0e792016-04-29 16:40:15 +02001413 all_skipped = false;
1414
1415 msg_cdbg("E");
1416 if (erasefn(flashctx, info->erase_start, erase_len))
Nico Huber6e61e0c2019-01-23 17:07:49 +01001417 goto _free_ret;
Richard Hughes842d6782021-01-15 09:48:12 +00001418 flashprog_progress_add(flashctx, erase_len);
Nico Huber7af0e792016-04-29 16:40:15 +02001419 if (check_erased_range(flashctx, info->erase_start, erase_len)) {
1420 msg_cerr("ERASE FAILED!\n");
Nico Huber6e61e0c2019-01-23 17:07:49 +01001421 goto _free_ret;
Nico Huber7af0e792016-04-29 16:40:15 +02001422 }
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001423 if (info->curcontents)
1424 memset(info->curcontents + info->erase_start, ERASED_VALUE(flashctx), erase_len);
Nico Huber6e61e0c2019-01-23 17:07:49 +01001425
1426 if (region_unaligned) {
Nico Huber3b9c86d2023-01-15 22:58:06 +01001427 if (write_range(flashctx, info->erase_start, erased_contents, backup_contents, erase_len, NULL))
1428 goto _free_ret;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001429 if (info->curcontents)
1430 memcpy(info->curcontents + info->erase_start, backup_contents, erase_len);
Nico Huber6e61e0c2019-01-23 17:07:49 +01001431 }
1432
1433 ret = 0;
1434
1435_free_ret:
1436 free(erased_contents);
1437 free(backup_contents);
1438 return ret;
Nico Huber7af0e792016-04-29 16:40:15 +02001439}
1440
1441/**
1442 * @brief Erases the included layout regions.
1443 *
1444 * If there is no layout set in the given flash context, the whole chip will
1445 * be erased.
1446 *
1447 * @param flashctx Flash context to be used.
Nico Huber7af0e792016-04-29 16:40:15 +02001448 * @return 0 on success,
1449 * 1 if all available erase functions failed.
1450 */
Nico Huber454f6132012-12-10 13:34:10 +00001451static int erase_by_layout(struct flashctx *const flashctx)
Nico Huber7af0e792016-04-29 16:40:15 +02001452{
1453 struct walk_info info = { 0 };
1454 return walk_by_layout(flashctx, &info, &erase_block);
1455}
1456
Nico Huber7af0e792016-04-29 16:40:15 +02001457/**
1458 * @brief Writes the included layout regions from a given image.
1459 *
1460 * If there is no layout set in the given flash context, the whole image
1461 * will be written.
1462 *
1463 * @param flashctx Flash context to be used.
1464 * @param curcontents A buffer of full chip size with current chip contents of included regions.
1465 * @param newcontents The new image to be written.
1466 * @return 0 on success,
1467 * 1 if anything has gone wrong.
1468 */
Nico Huber454f6132012-12-10 13:34:10 +00001469static int write_by_layout(struct flashctx *const flashctx,
1470 void *const curcontents, const void *const newcontents)
Nico Huber7af0e792016-04-29 16:40:15 +02001471{
1472 struct walk_info info;
1473 info.curcontents = curcontents;
1474 info.newcontents = newcontents;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001475 return walk_by_layout(flashctx, &info, erase_block);
Nico Huber7af0e792016-04-29 16:40:15 +02001476}
1477
1478/**
1479 * @brief Compares the included layout regions with content from a buffer.
1480 *
1481 * If there is no layout set in the given flash context, the whole chip's
1482 * contents will be compared.
1483 *
1484 * @param flashctx Flash context to be used.
Nico Huber74d09d42019-06-16 03:27:26 +02001485 * @param layout Flash layout information.
Nico Huber7af0e792016-04-29 16:40:15 +02001486 * @param curcontents A buffer of full chip size to read current chip contents into.
1487 * @param newcontents The new image to compare to.
1488 * @return 0 on success,
1489 * 1 if reading failed,
1490 * 3 if the contents don't match.
1491 */
Nico Huber74d09d42019-06-16 03:27:26 +02001492static int verify_by_layout(
1493 struct flashctx *const flashctx,
Nico Huberc3b02dc2023-08-12 01:13:45 +02001494 const struct flashprog_layout *const layout,
Nico Huber74d09d42019-06-16 03:27:26 +02001495 void *const curcontents, const uint8_t *const newcontents)
Nico Huber7af0e792016-04-29 16:40:15 +02001496{
Nico Huber5ca55232019-06-15 22:29:08 +02001497 const struct romentry *entry = NULL;
Nico Huber7af0e792016-04-29 16:40:15 +02001498
Richard Hughes842d6782021-01-15 09:48:12 +00001499 flashprog_progress_start_by_layout(flashctx, FLASHPROG_PROGRESS_READ, layout);
1500
Nico Huber5ca55232019-06-15 22:29:08 +02001501 while ((entry = layout_next_included(layout, entry))) {
1502 const chipoff_t region_start = entry->start;
1503 const chipsize_t region_len = entry->end - entry->start + 1;
Nico Huber7af0e792016-04-29 16:40:15 +02001504
1505 if (flashctx->chip->read(flashctx, curcontents + region_start, region_start, region_len))
1506 return 1;
1507 if (compare_range(newcontents + region_start, curcontents + region_start,
1508 region_start, region_len))
1509 return 3;
1510 }
Richard Hughes842d6782021-01-15 09:48:12 +00001511
1512 flashprog_progress_finish(flashctx);
1513
Nico Huber7af0e792016-04-29 16:40:15 +02001514 return 0;
1515}
1516
Stefan Tauner136388f2013-07-15 10:47:53 +00001517static void nonfatal_help_message(void)
Carl-Daniel Hailfinger42d38a92010-10-19 22:06:20 +00001518{
Stefan Taunera58f6e92014-05-10 09:25:44 +00001519 msg_gerr("Good, writing to the flash chip apparently didn't do anything.\n");
Stefan Tauner136388f2013-07-15 10:47:53 +00001520#if CONFIG_INTERNAL == 1
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +02001521 if (programmer == &programmer_internal)
Stefan Tauner136388f2013-07-15 10:47:53 +00001522 msg_gerr("This means we have to add special support for your board, programmer or flash\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +02001523 "chip. Please report this to the mailing list at flashprog@flashprog.org or\n"
1524 "on IRC (see https://www.flashprog.org/Contact for details), thanks!\n"
Stefan Tauner136388f2013-07-15 10:47:53 +00001525 "-------------------------------------------------------------------------------\n"
1526 "You may now reboot or simply leave the machine running.\n");
1527 else
1528#endif
1529 msg_gerr("Please check the connections (especially those to write protection pins) between\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +02001530 "the programmer and the flash chip. If you think the error is caused by flashprog\n"
1531 "please report this to the mailing list at flashprog@flashprog.org or on IRC\n"
1532 "(see https://www.flashprog.org/Contact for details), thanks!\n");
Carl-Daniel Hailfinger42d38a92010-10-19 22:06:20 +00001533}
1534
Edward O'Callaghanc72d20a2021-12-13 12:30:03 +11001535void emergency_help_message(void)
Carl-Daniel Hailfinger8ab49e72009-08-19 13:55:34 +00001536{
Stefan Tauner136388f2013-07-15 10:47:53 +00001537 msg_gerr("Your flash chip is in an unknown state.\n");
1538#if CONFIG_INTERNAL == 1
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +02001539 if (programmer == &programmer_internal)
Nico Huberc3b02dc2023-08-12 01:13:45 +02001540 msg_gerr("Get help on IRC (see https://www.flashprog.org/Contact) or mail\n"
1541 "flashprog@flashprog.org with the subject \"FAILED: <your board name>\"!\n"
Stefan Tauner136388f2013-07-15 10:47:53 +00001542 "-------------------------------------------------------------------------------\n"
1543 "DO NOT REBOOT OR POWEROFF!\n");
1544 else
1545#endif
Nico Huberc3b02dc2023-08-12 01:13:45 +02001546 msg_gerr("Please report this to the mailing list at flashprog@flashprog.org\n"
1547 "or on IRC (see https://www.flashprog.org/Contact for details), thanks!\n");
Carl-Daniel Hailfinger8ab49e72009-08-19 13:55:34 +00001548}
1549
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001550void list_programmers_linebreak(int startcol, int cols, int paren)
1551{
1552 const char *pname;
Carl-Daniel Hailfinger082c8b52011-08-15 19:54:20 +00001553 int pnamelen;
1554 int remaining = 0, firstline = 1;
Thomas Heijligen9163b812021-06-01 14:25:01 +02001555 size_t p;
Carl-Daniel Hailfinger082c8b52011-08-15 19:54:20 +00001556 int i;
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001557
Thomas Heijligend45cb592021-05-19 14:12:18 +02001558 for (p = 0; p < programmer_table_size; p++) {
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001559 pname = programmer_table[p]->name;
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001560 pnamelen = strlen(pname);
1561 if (remaining - pnamelen - 2 < 0) {
1562 if (firstline)
1563 firstline = 0;
1564 else
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001565 msg_ginfo("\n");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001566 for (i = 0; i < startcol; i++)
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001567 msg_ginfo(" ");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001568 remaining = cols - startcol;
1569 } else {
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001570 msg_ginfo(" ");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001571 remaining--;
1572 }
1573 if (paren && (p == 0)) {
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001574 msg_ginfo("(");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001575 remaining--;
1576 }
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001577 msg_ginfo("%s", pname);
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001578 remaining -= pnamelen;
Thomas Heijligend45cb592021-05-19 14:12:18 +02001579 if (p < programmer_table_size - 1) {
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001580 msg_ginfo(",");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001581 remaining--;
1582 } else {
1583 if (paren)
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001584 msg_ginfo(")");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001585 }
1586 }
1587}
1588
Nico Huber32fa5082026-01-26 18:26:49 +01001589int selfcheck_chip(const struct flashchip *const chip, const int idx)
1590{
1591 int ret = 0;
Nico Huber72d0ada2026-01-26 18:28:20 +01001592 char label[80];
Nico Huber32fa5082026-01-26 18:26:49 +01001593 const char *const name = chip->name != NULL ? chip->name : "unnamed";
1594
Nico Huber72d0ada2026-01-26 18:28:20 +01001595 if (idx >= 0)
1596 snprintf(label, sizeof(label), "#%d (%s)", idx, name);
1597 else
1598 snprintf(label, sizeof(label), "%s", name);
1599
Nico Huber11136c22023-05-01 12:00:09 +02001600 if (chip->vendor == NULL || chip->name == NULL || chip->bustype == BUS_NONE ||
1601 chip->id.type == ID_FIXME) {
Nico Huber32fa5082026-01-26 18:26:49 +01001602 ret = 1;
Nico Huber72d0ada2026-01-26 18:28:20 +01001603 msg_gerr("ERROR: Some field of flash chip %s is misconfigured.\n"
1604 "Please report a bug at flashprog@flashprog.org\n", label);
Nico Huber32fa5082026-01-26 18:26:49 +01001605 }
1606 if (chip->feature_bits &
1607 (FEATURE_4BA_ENTER | FEATURE_4BA_ENTER_WREN | FEATURE_4BA_ENTER_EAR7 |
1608 FEATURE_ANY_DUAL | FEATURE_ANY_QUAD)
1609 && !chip->prepare_access) {
Nico Huber72d0ada2026-01-26 18:28:20 +01001610 msg_gerr("ERROR: Flash chip %s misses chip\n"
Nico Huber32fa5082026-01-26 18:26:49 +01001611 "preparation function for 4BA and multi-i/o modes.\n"
Nico Huber72d0ada2026-01-26 18:28:20 +01001612 "Please report a bug at flashprog@flashprog.org\n", label);
Nico Huber32fa5082026-01-26 18:26:49 +01001613 ret = 1;
1614 }
1615 uint8_t zero_cycles[sizeof(chip->dummy_cycles)] = { 0 };
1616 if ((chip->feature_bits & (FEATURE_QPI_35_F5 | FEATURE_QPI_38_FF)) &&
1617 !memcmp(&chip->dummy_cycles, zero_cycles, sizeof(zero_cycles))) {
Nico Huber72d0ada2026-01-26 18:28:20 +01001618 msg_gerr("ERROR: Flash chip %s misses QPI dummy-cycle\n"
Nico Huber32fa5082026-01-26 18:26:49 +01001619 "settings. Please report a bug at flashprog@flashprog.org\n",
Nico Huber72d0ada2026-01-26 18:28:20 +01001620 label);
Nico Huber32fa5082026-01-26 18:26:49 +01001621 ret = 1;
1622 }
1623 if (chip->reg_bits.bp[0].reg != INVALID_REG &&
1624 (!chip->wp_write_cfg || !chip->wp_read_cfg ||
1625 !chip->wp_get_ranges || !chip->decode_range)) {
Nico Huber72d0ada2026-01-26 18:28:20 +01001626 msg_gerr("ERROR: Flash chip %s advertises block-protection\n"
Nico Huber32fa5082026-01-26 18:26:49 +01001627 "bits, but misses one or more write-protection functions.\n"
Nico Huber72d0ada2026-01-26 18:28:20 +01001628 "Please report a bug at flashprog@flashprog.org\n", label);
Nico Huber32fa5082026-01-26 18:26:49 +01001629 ret = 1;
1630 }
Nico Huber72d0ada2026-01-26 18:28:20 +01001631 if (selfcheck_eraseblocks(chip, label)) {
Nico Huber32fa5082026-01-26 18:26:49 +01001632 ret = 1;
1633 }
1634
1635 return ret;
1636}
1637
Carl-Daniel Hailfinger552420b2009-12-24 02:15:55 +00001638int selfcheck(void)
1639{
Stefan Tauner96658be2014-05-26 22:05:31 +00001640 unsigned int i;
Stefan Taunera6d96482012-12-26 19:51:23 +00001641 int ret = 0;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +00001642
Thomas Heijligend45cb592021-05-19 14:12:18 +02001643 for (i = 0; i < programmer_table_size; i++) {
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001644 const struct programmer_entry *const p = programmer_table[i];
1645 if (p == NULL) {
1646 msg_gerr("Programmer with index %d is NULL instead of a valid pointer!\n", i);
1647 ret = 1;
1648 continue;
1649 }
1650 if (p->name == NULL) {
Stefan Taunera6d96482012-12-26 19:51:23 +00001651 msg_gerr("All programmers need a valid name, but the one with index %d does not!\n", i);
1652 ret = 1;
1653 /* This might hide other problems with this programmer, but allows for better error
1654 * messages below without jumping through hoops. */
1655 continue;
1656 }
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001657 switch (p->type) {
Stefan Tauneraf358d62012-12-27 18:40:26 +00001658 case USB:
1659 case PCI:
1660 case OTHER:
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001661 if (p->devs.note == NULL) {
1662 if (strcmp("internal", p->name) == 0)
Stefan Tauneraf358d62012-12-27 18:40:26 +00001663 break; /* This one has its device list stored separately. */
1664 msg_gerr("Programmer %s has neither a device list nor a textual description!\n",
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001665 p->name);
Stefan Tauneraf358d62012-12-27 18:40:26 +00001666 ret = 1;
1667 }
1668 break;
1669 default:
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001670 msg_gerr("Programmer %s does not have a valid type set!\n", p->name);
Stefan Tauneraf358d62012-12-27 18:40:26 +00001671 ret = 1;
1672 break;
1673 }
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001674 if (p->init == NULL) {
1675 msg_gerr("Programmer %s does not have a valid init function!\n", p->name);
Stefan Taunera6d96482012-12-26 19:51:23 +00001676 ret = 1;
1677 }
Stefan Taunera6d96482012-12-26 19:51:23 +00001678 }
Stefan Tauner96658be2014-05-26 22:05:31 +00001679
1680 /* It would be favorable if we could check for the correct layout (especially termination) of various
1681 * constant arrays: flashchips, chipset_enables, board_matches, boards_known, laptops_known.
1682 * They are all defined as externs in this compilation unit so we don't know their sizes which vary
1683 * depending on compiler flags, e.g. the target architecture, and can sometimes be 0.
1684 * For 'flashchips' we export the size explicitly to work around this and to be able to implement the
1685 * checks below. */
Stefan Tauner6697f712014-08-06 15:09:15 +00001686 if (flashchips_size <= 1 || flashchips[flashchips_size - 1].name != NULL) {
Stefan Tauner7bcacb12011-05-26 01:35:19 +00001687 msg_gerr("Flashchips table miscompilation!\n");
1688 ret = 1;
Stefan Tauner96658be2014-05-26 22:05:31 +00001689 } else {
1690 for (i = 0; i < flashchips_size - 1; i++) {
Nico Huber32fa5082026-01-26 18:26:49 +01001691 if (selfcheck_chip(&flashchips[i], i))
Stefan Tauner96658be2014-05-26 22:05:31 +00001692 ret = 1;
Stefan Tauner96658be2014-05-26 22:05:31 +00001693 }
Stefan Tauner7bcacb12011-05-26 01:35:19 +00001694 }
Stefan Tauner7bcacb12011-05-26 01:35:19 +00001695
Stefan Tauner600576b2014-06-12 22:57:36 +00001696#if CONFIG_INTERNAL == 1
1697 ret |= selfcheck_board_enables();
1698#endif
1699
Stefan Tauner96658be2014-05-26 22:05:31 +00001700 /* TODO: implement similar sanity checks for other arrays where deemed necessary. */
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +00001701 return ret;
Carl-Daniel Hailfinger552420b2009-12-24 02:15:55 +00001702}
1703
Edward O'Callaghanacb24d42021-04-15 13:44:39 +10001704/* FIXME: This function signature needs to be improved once prepare_flash_access()
1705 * has a better function signature.
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001706 */
Jacob Garberbeeb8bc2019-06-21 15:24:17 -06001707static int chip_safety_check(const struct flashctx *flash, int force,
1708 int read_it, int write_it, int erase_it, int verify_it)
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001709{
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +00001710 const struct flashchip *chip = flash->chip;
1711
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001712 if (!programmer_may_write && (write_it || erase_it)) {
1713 msg_perr("Write/erase is not working yet on your programmer in "
1714 "its current configuration.\n");
1715 /* --force is the wrong approach, but it's the best we can do
1716 * until the generic programmer parameter parser is merged.
1717 */
1718 if (!force)
1719 return 1;
1720 msg_cerr("Continuing anyway.\n");
1721 }
1722
1723 if (read_it || erase_it || write_it || verify_it) {
1724 /* Everything needs read. */
Stefan Tauner6455dff2014-05-26 00:36:24 +00001725 if (chip->tested.read == BAD) {
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001726 msg_cerr("Read is not working on this chip. ");
1727 if (!force)
1728 return 1;
1729 msg_cerr("Continuing anyway.\n");
1730 }
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +00001731 if (!chip->read) {
Nico Huberc3b02dc2023-08-12 01:13:45 +02001732 msg_cerr("flashprog has no read function for this "
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001733 "flash chip.\n");
1734 return 1;
1735 }
1736 }
1737 if (erase_it || write_it) {
1738 /* Write needs erase. */
Stefan Tauner6455dff2014-05-26 00:36:24 +00001739 if (chip->tested.erase == NA) {
1740 msg_cerr("Erase is not possible on this chip.\n");
1741 return 1;
1742 }
1743 if (chip->tested.erase == BAD) {
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001744 msg_cerr("Erase is not working on this chip. ");
1745 if (!force)
1746 return 1;
1747 msg_cerr("Continuing anyway.\n");
1748 }
Sylvain "ythier" Hitier9db45512011-07-04 07:27:17 +00001749 if(count_usable_erasers(flash) == 0) {
Nico Huberc3b02dc2023-08-12 01:13:45 +02001750 msg_cerr("flashprog has no erase function for this "
Stefan Tauner5368dca2011-07-01 00:19:12 +00001751 "flash chip.\n");
1752 return 1;
1753 }
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001754 }
1755 if (write_it) {
Stefan Tauner6455dff2014-05-26 00:36:24 +00001756 if (chip->tested.write == NA) {
1757 msg_cerr("Write is not possible on this chip.\n");
1758 return 1;
1759 }
1760 if (chip->tested.write == BAD) {
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001761 msg_cerr("Write is not working on this chip. ");
1762 if (!force)
1763 return 1;
1764 msg_cerr("Continuing anyway.\n");
1765 }
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +00001766 if (!chip->write) {
Nico Huberc3b02dc2023-08-12 01:13:45 +02001767 msg_cerr("flashprog has no write function for this "
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001768 "flash chip.\n");
1769 return 1;
1770 }
1771 }
1772 return 0;
1773}
1774
Nico Huber305f4172013-06-14 11:55:26 +02001775int prepare_flash_access(struct flashctx *const flash,
1776 const bool read_it, const bool write_it,
1777 const bool erase_it, const bool verify_it)
Nico Huber454f6132012-12-10 13:34:10 +00001778{
1779 if (chip_safety_check(flash, flash->flags.force, read_it, write_it, erase_it, verify_it)) {
1780 msg_cerr("Aborting.\n");
1781 return 1;
1782 }
1783
Nico Huber3ac761c2023-01-16 02:43:17 +01001784 if (layout_sanity_checks(flash, write_it)) {
Nico Huber454f6132012-12-10 13:34:10 +00001785 msg_cerr("Requested regions can not be handled. Aborting.\n");
1786 return 1;
1787 }
1788
Nico Huber5469c152026-02-12 22:56:52 +01001789 if (flash->mst.common->adapt_voltage) {
1790 if (flash->mst.common->adapt_voltage(flash->mst.common,
1791 flash->chip->voltage.min, flash->chip->voltage.max))
1792 return 1;
1793 }
1794
Nico Huber901fb952023-01-11 23:24:23 +01001795 if (flash->chip->prepare_access && flash->chip->prepare_access(flash, PREPARE_FULL))
1796 return 1;
1797
Nikolai Artemiev4ad48642020-11-05 13:54:27 +11001798 /* Initialize chip_restore_fn_count before chip unlock calls. */
1799 flash->chip_restore_fn_count = 0;
1800
Nico Huber454f6132012-12-10 13:34:10 +00001801 /* Given the existence of read locks, we want to unlock for read,
1802 erase and write. */
1803 if (flash->chip->unlock)
1804 flash->chip->unlock(flash);
1805
1806 return 0;
1807}
1808
Nico Huber305f4172013-06-14 11:55:26 +02001809void finalize_flash_access(struct flashctx *const flash)
Nico Huber454f6132012-12-10 13:34:10 +00001810{
Nikolai Artemiev4ad48642020-11-05 13:54:27 +11001811 deregister_chip_restore(flash);
Nico Huber901fb952023-01-11 23:24:23 +01001812 if (flash->chip->finish_access)
1813 flash->chip->finish_access(flash);
Nico Huber454f6132012-12-10 13:34:10 +00001814}
1815
1816/**
Nico Huberc3b02dc2023-08-12 01:13:45 +02001817 * @addtogroup flashprog-flash
Nico Huber454f6132012-12-10 13:34:10 +00001818 * @{
1819 */
1820
1821/**
1822 * @brief Erase the specified ROM chip.
1823 *
1824 * If a layout is set in the given flash context, only included regions
1825 * will be erased.
1826 *
1827 * @param flashctx The context of the flash chip to erase.
1828 * @return 0 on success.
1829 */
Nico Huberc3b02dc2023-08-12 01:13:45 +02001830int flashprog_flash_erase(struct flashctx *const flashctx)
Nico Huber454f6132012-12-10 13:34:10 +00001831{
1832 if (prepare_flash_access(flashctx, false, false, true, false))
1833 return 1;
1834
1835 const int ret = erase_by_layout(flashctx);
1836
1837 finalize_flash_access(flashctx);
1838
1839 return ret;
1840}
1841
Nico Huberc3b02dc2023-08-12 01:13:45 +02001842/** @} */ /* end flashprog-flash */
Nico Huber454f6132012-12-10 13:34:10 +00001843
1844/**
Nico Huberc3b02dc2023-08-12 01:13:45 +02001845 * @defgroup flashprog-ops Operations
Nico Huber454f6132012-12-10 13:34:10 +00001846 * @{
1847 */
1848
1849/**
1850 * @brief Read the current image from the specified ROM chip.
1851 *
1852 * If a layout is set in the specified flash context, only included regions
1853 * will be read.
1854 *
1855 * @param flashctx The context of the flash chip.
1856 * @param buffer Target buffer to write image to.
1857 * @param buffer_len Size of target buffer in bytes.
1858 * @return 0 on success,
1859 * 2 if buffer_len is too short for the flash chip's contents,
1860 * or 1 on any other failure.
1861 */
Nico Huberc3b02dc2023-08-12 01:13:45 +02001862int flashprog_image_read(struct flashctx *const flashctx, void *const buffer, const size_t buffer_len)
Nico Huber454f6132012-12-10 13:34:10 +00001863{
1864 const size_t flash_size = flashctx->chip->total_size * 1024;
1865
1866 if (flash_size > buffer_len)
1867 return 2;
1868
1869 if (prepare_flash_access(flashctx, true, false, false, false))
1870 return 1;
1871
1872 msg_cinfo("Reading flash... ");
1873
1874 int ret = 1;
1875 if (read_by_layout(flashctx, buffer)) {
1876 msg_cerr("Read operation failed!\n");
1877 msg_cinfo("FAILED.\n");
1878 goto _finalize_ret;
1879 }
1880 msg_cinfo("done.\n");
1881 ret = 0;
1882
1883_finalize_ret:
1884 finalize_flash_access(flashctx);
1885 return ret;
1886}
1887
1888static void combine_image_by_layout(const struct flashctx *const flashctx,
1889 uint8_t *const newcontents, const uint8_t *const oldcontents)
1890{
Nico Huberc3b02dc2023-08-12 01:13:45 +02001891 const struct flashprog_layout *const layout = get_layout(flashctx);
Nico Huber3d7b1e32018-12-22 00:53:14 +01001892 const struct romentry *included;
1893 chipoff_t start = 0;
Nico Huber454f6132012-12-10 13:34:10 +00001894
Nico Huber3d7b1e32018-12-22 00:53:14 +01001895 while ((included = layout_next_included_region(layout, start))) {
1896 if (included->start > start) {
1897 /* copy everything up to the start of this included region */
1898 memcpy(newcontents + start, oldcontents + start, included->start - start);
1899 }
1900 /* skip this included region */
1901 start = included->end + 1;
1902 if (start == 0)
1903 return;
Nico Huber454f6132012-12-10 13:34:10 +00001904 }
Nico Huber3d7b1e32018-12-22 00:53:14 +01001905
1906 /* copy the rest of the chip */
1907 const chipsize_t copy_len = flashctx->chip->total_size * 1024 - start;
1908 memcpy(newcontents + start, oldcontents + start, copy_len);
Nico Huber454f6132012-12-10 13:34:10 +00001909}
1910
1911/**
1912 * @brief Write the specified image to the ROM chip.
1913 *
1914 * If a layout is set in the specified flash context, only erase blocks
1915 * containing included regions will be touched.
1916 *
1917 * @param flashctx The context of the flash chip.
Nico Huber1b172f22017-06-19 12:35:24 +02001918 * @param buffer Source buffer to read image from (may be altered for full verification).
Nico Huber454f6132012-12-10 13:34:10 +00001919 * @param buffer_len Size of source buffer in bytes.
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001920 * @param refbuffer If given, assume flash chip contains same data as `refbuffer`.
Nico Huber454f6132012-12-10 13:34:10 +00001921 * @return 0 on success,
1922 * 4 if buffer_len doesn't match the size of the flash chip,
1923 * 3 if write was tried but nothing has changed,
1924 * 2 if write failed and flash contents changed,
1925 * or 1 on any other failure.
1926 */
Nico Huberc3b02dc2023-08-12 01:13:45 +02001927int flashprog_image_write(struct flashctx *const flashctx, void *const buffer, const size_t buffer_len,
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001928 const void *const refbuffer)
Nico Huber454f6132012-12-10 13:34:10 +00001929{
1930 const size_t flash_size = flashctx->chip->total_size * 1024;
1931 const bool verify_all = flashctx->flags.verify_whole_chip;
1932 const bool verify = flashctx->flags.verify_after_write;
Nico Huberc3b02dc2023-08-12 01:13:45 +02001933 const struct flashprog_layout *const verify_layout =
Nico Huber74d09d42019-06-16 03:27:26 +02001934 verify_all ? get_default_layout(flashctx) : get_layout(flashctx);
Nico Huber454f6132012-12-10 13:34:10 +00001935
1936 if (buffer_len != flash_size)
1937 return 4;
1938
1939 int ret = 1;
1940
1941 uint8_t *const newcontents = buffer;
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001942 const uint8_t *const refcontents = refbuffer;
Nico Huber454f6132012-12-10 13:34:10 +00001943 uint8_t *const curcontents = malloc(flash_size);
1944 uint8_t *oldcontents = NULL;
1945 if (verify_all)
1946 oldcontents = malloc(flash_size);
1947 if (!curcontents || (verify_all && !oldcontents)) {
1948 msg_gerr("Out of memory!\n");
1949 goto _free_ret;
1950 }
1951
1952#if CONFIG_INTERNAL == 1
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +02001953 if (programmer == &programmer_internal && cb_check_image(newcontents, flash_size) < 0) {
Nico Huber454f6132012-12-10 13:34:10 +00001954 if (flashctx->flags.force_boardmismatch) {
1955 msg_pinfo("Proceeding anyway because user forced us to.\n");
1956 } else {
1957 msg_perr("Aborting. You can override this with "
1958 "-p internal:boardmismatch=force.\n");
1959 goto _free_ret;
1960 }
1961 }
1962#endif
1963
1964 if (prepare_flash_access(flashctx, false, true, false, verify))
1965 goto _free_ret;
1966
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001967 /* If given, assume flash chip contains same data as `refcontents`. */
1968 if (refcontents) {
1969 msg_cinfo("Assuming old flash chip contents as ref-file...\n");
1970 memcpy(curcontents, refcontents, flash_size);
1971 if (oldcontents)
1972 memcpy(oldcontents, refcontents, flash_size);
Nico Huber454f6132012-12-10 13:34:10 +00001973 } else {
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001974 /*
1975 * Read the whole chip to be able to check whether regions need to be
1976 * erased and to give better diagnostics in case write fails.
1977 * The alternative is to read only the regions which are to be
1978 * preserved, but in that case we might perform unneeded erase which
1979 * takes time as well.
1980 */
1981 msg_cinfo("Reading old flash chip contents... ");
1982 if (verify_all) {
Richard Hughes842d6782021-01-15 09:48:12 +00001983 if (flashprog_read_range(flashctx, oldcontents, 0, flash_size)) {
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001984 msg_cinfo("FAILED.\n");
1985 goto _finalize_ret;
1986 }
1987 memcpy(curcontents, oldcontents, flash_size);
1988 } else {
1989 if (read_by_layout(flashctx, curcontents)) {
1990 msg_cinfo("FAILED.\n");
1991 goto _finalize_ret;
1992 }
Nico Huber454f6132012-12-10 13:34:10 +00001993 }
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001994 msg_cinfo("done.\n");
Nico Huber454f6132012-12-10 13:34:10 +00001995 }
Nico Huber454f6132012-12-10 13:34:10 +00001996
1997 if (write_by_layout(flashctx, curcontents, newcontents)) {
1998 msg_cerr("Uh oh. Erase/write failed. ");
1999 ret = 2;
2000 if (verify_all) {
2001 msg_cerr("Checking if anything has changed.\n");
2002 msg_cinfo("Reading current flash chip contents... ");
Richard Hughes842d6782021-01-15 09:48:12 +00002003 if (!flashprog_read_range(flashctx, curcontents, 0, flash_size)) {
Nico Huber454f6132012-12-10 13:34:10 +00002004 msg_cinfo("done.\n");
2005 if (!memcmp(oldcontents, curcontents, flash_size)) {
2006 nonfatal_help_message();
2007 goto _finalize_ret;
2008 }
2009 msg_cerr("Apparently at least some data has changed.\n");
2010 } else
2011 msg_cerr("Can't even read anymore!\n");
2012 emergency_help_message();
2013 goto _finalize_ret;
2014 } else {
2015 msg_cerr("\n");
2016 }
2017 emergency_help_message();
2018 goto _finalize_ret;
2019 }
2020
2021 /* Verify only if we actually changed something. */
2022 if (verify && !all_skipped) {
Nico Huber454f6132012-12-10 13:34:10 +00002023 msg_cinfo("Verifying flash... ");
2024
Nico Huber74d09d42019-06-16 03:27:26 +02002025 if (verify_all)
Nico Huber454f6132012-12-10 13:34:10 +00002026 combine_image_by_layout(flashctx, newcontents, oldcontents);
Nico Huber74d09d42019-06-16 03:27:26 +02002027 ret = verify_by_layout(flashctx, verify_layout, curcontents, newcontents);
Nico Huber454f6132012-12-10 13:34:10 +00002028 /* If we tried to write, and verification now fails, we
2029 might have an emergency situation. */
2030 if (ret)
2031 emergency_help_message();
2032 else
2033 msg_cinfo("VERIFIED.\n");
2034 } else {
2035 /* We didn't change anything. */
2036 ret = 0;
2037 }
2038
2039_finalize_ret:
2040 finalize_flash_access(flashctx);
2041_free_ret:
2042 free(oldcontents);
2043 free(curcontents);
2044 return ret;
2045}
2046
2047/**
2048 * @brief Verify the ROM chip's contents with the specified image.
2049 *
2050 * If a layout is set in the specified flash context, only included regions
2051 * will be verified.
2052 *
2053 * @param flashctx The context of the flash chip.
2054 * @param buffer Source buffer to verify with.
2055 * @param buffer_len Size of source buffer in bytes.
2056 * @return 0 on success,
2057 * 3 if the chip's contents don't match,
2058 * 2 if buffer_len doesn't match the size of the flash chip,
2059 * or 1 on any other failure.
2060 */
Nico Huberc3b02dc2023-08-12 01:13:45 +02002061int flashprog_image_verify(struct flashctx *const flashctx, const void *const buffer, const size_t buffer_len)
Nico Huber454f6132012-12-10 13:34:10 +00002062{
Nico Huberc3b02dc2023-08-12 01:13:45 +02002063 const struct flashprog_layout *const layout = get_layout(flashctx);
Nico Huber454f6132012-12-10 13:34:10 +00002064 const size_t flash_size = flashctx->chip->total_size * 1024;
2065
2066 if (buffer_len != flash_size)
2067 return 2;
2068
2069 const uint8_t *const newcontents = buffer;
2070 uint8_t *const curcontents = malloc(flash_size);
2071 if (!curcontents) {
2072 msg_gerr("Out of memory!\n");
2073 return 1;
2074 }
2075
2076 int ret = 1;
2077
2078 if (prepare_flash_access(flashctx, false, false, false, true))
2079 goto _free_ret;
2080
2081 msg_cinfo("Verifying flash... ");
Nico Huber74d09d42019-06-16 03:27:26 +02002082 ret = verify_by_layout(flashctx, layout, curcontents, newcontents);
Nico Huber454f6132012-12-10 13:34:10 +00002083 if (!ret)
2084 msg_cinfo("VERIFIED.\n");
2085
2086 finalize_flash_access(flashctx);
2087_free_ret:
2088 free(curcontents);
2089 return ret;
2090}
2091
Nico Huberc3b02dc2023-08-12 01:13:45 +02002092/** @} */ /* end flashprog-ops */