blob: fc20045fbb0ced02094211dedd52d78de0b1f9f7 [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 Hailfingerd1be52d2010-07-03 12:14:25 +000044/* Is writing allowed with this programmer? */
Felix Singer980d6b82022-08-19 02:48:15 +020045bool programmer_may_write;
Carl-Daniel Hailfingerd1be52d2010-07-03 12:14:25 +000046
Carl-Daniel Hailfinger2bee8cf2010-11-10 15:25:18 +000047#define SHUTDOWN_MAXFN 32
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000048static int shutdown_fn_count = 0;
Nico Huber454f6132012-12-10 13:34:10 +000049/** @private */
Richard Hughes93e16252018-12-19 11:54:47 +000050static struct shutdown_func_data {
David Hendricks8bb20212011-06-14 01:35:36 +000051 int (*func) (void *data);
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000052 void *data;
Richard Hughes93e16252018-12-19 11:54:47 +000053} shutdown_fn[SHUTDOWN_MAXFN];
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +000054/* Initialize to 0 to make sure nobody registers a shutdown function before
55 * programmer init.
56 */
Felix Singerf25447e2022-08-19 02:44:28 +020057static bool may_register_shutdown = false;
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000058
Stefan Taunerc4f44df2013-08-12 22:58:43 +000059/* Did we change something or was every erase/write skipped (if any)? */
60static bool all_skipped = true;
61
Carl-Daniel Hailfinger63fd9022011-12-14 22:25:15 +000062static int check_block_eraser(const struct flashctx *flash, int k, int log);
Stefan Tauner5368dca2011-07-01 00:19:12 +000063
Stefan Tauner2a1ed772014-08-31 00:09:21 +000064int shutdown_free(void *data)
65{
66 free(data);
67 return 0;
68}
69
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000070/* Register a function to be executed on programmer shutdown.
71 * The advantage over atexit() is that you can supply a void pointer which will
72 * be used as parameter to the registered function upon programmer shutdown.
73 * This pointer can point to arbitrary data used by said function, e.g. undo
74 * information for GPIO settings etc. If unneeded, set data=NULL.
75 * Please note that the first (void *data) belongs to the function signature of
76 * the function passed as first parameter.
77 */
David Hendricks8bb20212011-06-14 01:35:36 +000078int register_shutdown(int (*function) (void *data), void *data)
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000079{
80 if (shutdown_fn_count >= SHUTDOWN_MAXFN) {
Carl-Daniel Hailfinger9f5f2152010-06-04 23:20:21 +000081 msg_perr("Tried to register more than %i shutdown functions.\n",
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000082 SHUTDOWN_MAXFN);
83 return 1;
84 }
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +000085 if (!may_register_shutdown) {
86 msg_perr("Tried to register a shutdown function before "
87 "programmer init.\n");
88 return 1;
89 }
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000090 shutdown_fn[shutdown_fn_count].func = function;
91 shutdown_fn[shutdown_fn_count].data = data;
92 shutdown_fn_count++;
93
94 return 0;
95}
96
Nikolai Artemiev4ad48642020-11-05 13:54:27 +110097int register_chip_restore(chip_restore_fn_cb_t func,
98 struct flashctx *flash, uint8_t status)
99{
100 if (flash->chip_restore_fn_count >= MAX_CHIP_RESTORE_FUNCTIONS) {
101 msg_perr("Tried to register more than %i chip restore"
102 " functions.\n", MAX_CHIP_RESTORE_FUNCTIONS);
103 return 1;
104 }
105 flash->chip_restore_fn[flash->chip_restore_fn_count].func = func;
106 flash->chip_restore_fn[flash->chip_restore_fn_count].status = status;
107 flash->chip_restore_fn_count++;
108
109 return 0;
110}
111
112static int deregister_chip_restore(struct flashctx *flash)
113{
114 int rc = 0;
115
116 while (flash->chip_restore_fn_count > 0) {
117 int i = --flash->chip_restore_fn_count;
118 rc |= flash->chip_restore_fn[i].func(
119 flash, flash->chip_restore_fn[i].status);
120 }
121
122 return rc;
123}
124
Nico Huber2b66ad92023-01-11 20:15:15 +0100125int programmer_init(struct flashprog_programmer *const prog)
Uwe Hermann09e04f72009-05-16 22:36:00 +0000126{
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000127 int ret;
Carl-Daniel Hailfinger2e681602011-09-08 00:00:29 +0000128
Nico Huber2b66ad92023-01-11 20:15:15 +0100129 if (prog == NULL || prog->driver == NULL) {
Carl-Daniel Hailfinger2e681602011-09-08 00:00:29 +0000130 msg_perr("Invalid programmer specified!\n");
131 return -1;
132 }
Nico Huber2b66ad92023-01-11 20:15:15 +0100133 programmer = prog->driver;
134 programmer_param = prog->param;
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000135 /* Registering shutdown functions is now allowed. */
Felix Singerf25447e2022-08-19 02:44:28 +0200136 may_register_shutdown = true;
Carl-Daniel Hailfingerd1be52d2010-07-03 12:14:25 +0000137 /* Default to allowing writes. Broken programmers set this to 0. */
Felix Singer980d6b82022-08-19 02:48:15 +0200138 programmer_may_write = true;
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000139
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +0200140 msg_pdbg("Initializing %s programmer\n", programmer->name);
Nico Hubere3a26882023-01-11 21:45:51 +0100141 ret = programmer->init(prog);
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000142 if (programmer_param && strlen(programmer_param)) {
Carl-Daniel Hailfinger20a36ba2013-08-13 07:09:57 +0000143 if (ret != 0) {
144 /* It is quite possible that any unhandled programmer parameter would have been valid,
145 * but an error in actual programmer init happened before the parameter was evaluated.
146 */
147 msg_pwarn("Unhandled programmer parameters (possibly due to another failure): %s\n",
148 programmer_param);
149 } else {
150 /* Actual programmer init was successful, but the user specified an invalid or unusable
151 * (for the current programmer configuration) parameter.
152 */
153 msg_perr("Unhandled programmer parameters: %s\n", programmer_param);
154 msg_perr("Aborting.\n");
155 ret = ERROR_FATAL;
156 }
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000157 }
Nico Huber6a2ebeb2022-08-26 11:36:48 +0200158 programmer_param = NULL;
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000159 return ret;
Uwe Hermann09e04f72009-05-16 22:36:00 +0000160}
161
Stefan Tauner20da4aa2014-05-07 22:07:23 +0000162/** Calls registered shutdown functions and resets internal programmer-related variables.
163 * Calling it is safe even without previous initialization, but further interactions with programmer support
164 * require a call to programmer_init() (afterwards).
165 *
166 * @return The OR-ed result values of all shutdown functions (i.e. 0 on success). */
Nico Huber2b66ad92023-01-11 20:15:15 +0100167int programmer_shutdown(struct flashprog_programmer *const prog)
Uwe Hermann09e04f72009-05-16 22:36:00 +0000168{
David Hendricks8bb20212011-06-14 01:35:36 +0000169 int ret = 0;
170
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000171 /* Registering shutdown functions is no longer allowed. */
Felix Singerf25447e2022-08-19 02:44:28 +0200172 may_register_shutdown = false;
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000173 while (shutdown_fn_count > 0) {
174 int i = --shutdown_fn_count;
David Hendricks8bb20212011-06-14 01:35:36 +0000175 ret |= shutdown_fn[i].func(shutdown_fn[i].data);
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000176 }
Nico Huberaf9d7382023-05-01 13:33:26 +0200177
178 int i;
179 for (i = 0; i < registered_master_count; ++i) {
180 struct found_id *found_id, *next;
181 for (found_id = registered_masters[i].found_ids; found_id; found_id = next) {
182 next = found_id->next;
183 free(found_id);
184 }
185 }
Carl-Daniel Hailfingera5bcbce2014-07-19 22:03:29 +0000186 registered_master_count = 0;
Stefan Taunere34e3e82013-01-01 00:06:51 +0000187
David Hendricks8bb20212011-06-14 01:35:36 +0000188 return ret;
Uwe Hermann09e04f72009-05-16 22:36:00 +0000189}
190
Stefan Taunerf80419c2014-05-02 15:41:42 +0000191void programmer_delay(unsigned int usecs)
Carl-Daniel Hailfingerca8bfc62009-06-05 17:48:08 +0000192{
Edward O'Callaghan56684d92022-09-07 10:47:45 +1000193 if (usecs > 0) {
194 if (programmer->delay)
195 programmer->delay(usecs);
196 else
197 internal_delay(usecs);
198 }
Carl-Daniel Hailfingerca8bfc62009-06-05 17:48:08 +0000199}
200
Nico Hubercdcfda22023-04-29 13:29:33 +0200201static int read_memmapped_chunk(struct flashctx *flash, uint8_t *buf, unsigned int start, unsigned int len)
Carl-Daniel Hailfinger03b4e712009-05-08 12:49:03 +0000202{
Carl-Daniel Hailfinger8a3c60c2011-12-18 15:01:24 +0000203 chip_readn(flash, buf, flash->virtual_memory + start, len);
Carl-Daniel Hailfinger03b4e712009-05-08 12:49:03 +0000204 return 0;
205}
Nico Hubercdcfda22023-04-29 13:29:33 +0200206int read_memmapped(struct flashctx *flash, uint8_t *buf, unsigned int start, int unsigned len)
207{
208 return flashprog_read_chunked(flash, buf, start, len, MAX_DATA_READ_UNLIMITED, read_memmapped_chunk);
209}
Carl-Daniel Hailfinger03b4e712009-05-08 12:49:03 +0000210
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000211/* This is a somewhat hacked function similar in some ways to strtok().
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000212 * It will look for needle with a subsequent '=' in haystack, return a copy of
213 * needle and remove everything from the first occurrence of needle to the next
214 * delimiter from haystack.
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000215 */
Nico Huber6a2ebeb2022-08-26 11:36:48 +0200216static char *extract_param(char *const *haystack, const char *needle, const char *delim)
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000217{
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000218 char *param_pos, *opt_pos, *rest;
219 char *opt = NULL;
220 int optlen;
Carl-Daniel Hailfinger27023762010-04-28 15:22:14 +0000221 int needlelen;
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000222
Carl-Daniel Hailfinger27023762010-04-28 15:22:14 +0000223 needlelen = strlen(needle);
224 if (!needlelen) {
225 msg_gerr("%s: empty needle! Please report a bug at "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200226 "flashprog@flashprog.org\n", __func__);
Carl-Daniel Hailfinger27023762010-04-28 15:22:14 +0000227 return NULL;
228 }
229 /* No programmer parameters given. */
230 if (*haystack == NULL)
231 return NULL;
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000232 param_pos = strstr(*haystack, needle);
233 do {
234 if (!param_pos)
235 return NULL;
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000236 /* Needle followed by '='? */
237 if (param_pos[needlelen] == '=') {
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000238 /* Beginning of the string? */
239 if (param_pos == *haystack)
240 break;
241 /* After a delimiter? */
242 if (strchr(delim, *(param_pos - 1)))
243 break;
244 }
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000245 /* Continue searching. */
246 param_pos++;
247 param_pos = strstr(param_pos, needle);
248 } while (1);
Uwe Hermann91f4afa2011-07-28 08:13:25 +0000249
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000250 if (param_pos) {
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000251 /* Get the string after needle and '='. */
252 opt_pos = param_pos + needlelen + 1;
253 optlen = strcspn(opt_pos, delim);
254 /* Return an empty string if the parameter was empty. */
255 opt = malloc(optlen + 1);
256 if (!opt) {
Sean Nelson316a29f2010-05-07 20:09:04 +0000257 msg_gerr("Out of memory!\n");
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000258 exit(1);
259 }
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000260 strncpy(opt, opt_pos, optlen);
261 opt[optlen] = '\0';
262 rest = opt_pos + optlen;
263 /* Skip all delimiters after the current parameter. */
264 rest += strspn(rest, delim);
265 memmove(param_pos, rest, strlen(rest) + 1);
266 /* We could shrink haystack, but the effort is not worth it. */
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000267 }
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000268
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000269 return opt;
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000270}
271
Stefan Tauner66652442011-06-26 17:38:17 +0000272char *extract_programmer_param(const char *param_name)
Carl-Daniel Hailfinger2b6dcb32010-07-08 10:13:37 +0000273{
274 return extract_param(&programmer_param, param_name, ",");
275}
276
Richard Hughes842d6782021-01-15 09:48:12 +0000277static void flashprog_progress_report(struct flashprog_progress *const p)
278{
279 if (p->current > p->total) {
280 msg_gdbg2("Sanitizing progress report: %zu bytes off.", p->current - p->total);
281 p->current = p->total;
282 }
283
284 if (!p->callback)
285 return;
286
287 p->callback(p->stage, p->current, p->total, p->user_data);
288}
289
290static void flashprog_progress_start(struct flashprog_flashctx *const flashctx,
291 const enum flashprog_progress_stage stage, const size_t total)
292{
293 flashctx->progress.stage = stage;
294 flashctx->progress.current = 0;
295 flashctx->progress.total = total;
296 flashprog_progress_report(&flashctx->progress);
297}
298
299static void flashprog_progress_start_by_layout(struct flashprog_flashctx *const flashctx,
300 const enum flashprog_progress_stage stage,
301 const struct flashprog_layout *const layout)
302{
303 const struct romentry *entry = NULL;
304 size_t total = 0;
305
306 while ((entry = layout_next_included(layout, entry)))
307 total += entry->end - entry->start + 1;
308
309 flashprog_progress_start(flashctx, stage, total);
310}
311
312static void flashprog_progress_set(struct flashprog_flashctx *const flashctx, const size_t current)
313{
314 flashctx->progress.current = current;
315 flashprog_progress_report(&flashctx->progress);
316}
317
318/** @private */
319void flashprog_progress_add(struct flashprog_flashctx *const flashctx, const size_t progress)
320{
321 flashctx->progress.current += progress;
322 flashprog_progress_report(&flashctx->progress);
323}
324
325static void flashprog_progress_finish(struct flashprog_flashctx *const flashctx)
326{
327 if (flashctx->progress.current == flashctx->progress.total)
328 return;
329
330 flashctx->progress.current = flashctx->progress.total;
331 flashprog_progress_report(&flashctx->progress);
332}
333
Sylvain "ythier" Hitier9db45512011-07-04 07:27:17 +0000334/* Returns the number of well-defined erasers for a chip. */
Carl-Daniel Hailfinger63fd9022011-12-14 22:25:15 +0000335static unsigned int count_usable_erasers(const struct flashctx *flash)
Stefan Tauner5368dca2011-07-01 00:19:12 +0000336{
337 unsigned int usable_erasefunctions = 0;
338 int k;
339 for (k = 0; k < NUM_ERASEFUNCTIONS; k++) {
340 if (!check_block_eraser(flash, k, 0))
341 usable_erasefunctions++;
342 }
343 return usable_erasefunctions;
344}
345
Mark Marshallf20b7be2014-05-09 21:16:21 +0000346static int compare_range(const uint8_t *wantbuf, const uint8_t *havebuf, unsigned int start, unsigned int len)
Stefan Tauner78ffbea2012-10-27 15:36:56 +0000347{
348 int ret = 0, failcount = 0;
349 unsigned int i;
350 for (i = 0; i < len; i++) {
351 if (wantbuf[i] != havebuf[i]) {
352 /* Only print the first failure. */
353 if (!failcount++)
354 msg_cerr("FAILED at 0x%08x! Expected=0x%02x, Found=0x%02x,",
355 start + i, wantbuf[i], havebuf[i]);
356 }
357 }
358 if (failcount) {
359 msg_cerr(" failed byte count from 0x%08x-0x%08x: 0x%x\n",
360 start, start + len - 1, failcount);
361 ret = -1;
362 }
363 return ret;
364}
365
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000366/* start is an offset to the base address of the flash chip */
Jacob Garberbeeb8bc2019-06-21 15:24:17 -0600367static int check_erased_range(struct flashctx *flash, unsigned int start, unsigned int len)
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000368{
369 int ret;
Paul Kocialkowski995f7552018-01-15 01:06:09 +0300370 const uint8_t erased_value = ERASED_VALUE(flash);
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000371
Edward O'Callaghanf60f64f2022-11-12 12:08:01 +1100372 uint8_t *cmpbuf = malloc(len);
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000373 if (!cmpbuf) {
Edward O'Callaghana31a5722022-11-12 12:05:36 +1100374 msg_gerr("Out of memory!\n");
Edward O'Callaghan6edf9f82022-11-12 12:08:46 +1100375 return -1;
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000376 }
Paul Kocialkowski995f7552018-01-15 01:06:09 +0300377 memset(cmpbuf, erased_value, len);
Stefan Tauner78ffbea2012-10-27 15:36:56 +0000378 ret = verify_range(flash, cmpbuf, start, len);
Edward O'Callaghanf60f64f2022-11-12 12:08:01 +1100379
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000380 free(cmpbuf);
381 return ret;
382}
383
Richard Hughes842d6782021-01-15 09:48:12 +0000384int flashprog_read_range(struct flashctx *flash, uint8_t *buf, unsigned int start, unsigned int len)
385{
386 flashprog_progress_start(flash, FLASHPROG_PROGRESS_READ, len);
387 const int ret = flash->chip->read(flash, buf, start, len);
388 flashprog_progress_finish(flash);
389 return ret;
390}
391
Uwe Hermann48ec1b12010-08-08 17:01:18 +0000392/*
Carl-Daniel Hailfingerd0250a32009-11-25 17:05:52 +0000393 * @cmpbuf buffer to compare against, cmpbuf[0] is expected to match the
Uwe Hermann91f4afa2011-07-28 08:13:25 +0000394 * flash content at location start
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000395 * @start offset to the base address of the flash chip
396 * @len length of the verified area
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000397 * @return 0 for success, -1 for failure
398 */
Mark Marshallf20b7be2014-05-09 21:16:21 +0000399int verify_range(struct flashctx *flash, const uint8_t *cmpbuf, unsigned int start, unsigned int len)
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000400{
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000401 if (!len)
Stefan Taunerdf64a422014-05-27 00:06:14 +0000402 return -1;
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000403
Edward O'Callaghan6ae640b2021-11-17 14:24:04 +1100404 if (start + len > flash->chip->total_size * 1024) {
405 msg_gerr("Error: %s called with start 0x%x + len 0x%x >"
406 " total_size 0x%x\n", __func__, start, len,
407 flash->chip->total_size * 1024);
408 return -1;
409 }
410
Stefan Taunerdf64a422014-05-27 00:06:14 +0000411 uint8_t *readbuf = malloc(len);
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000412 if (!readbuf) {
Edward O'Callaghana31a5722022-11-12 12:05:36 +1100413 msg_gerr("Out of memory!\n");
Stefan Taunerdf64a422014-05-27 00:06:14 +0000414 return -1;
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000415 }
416
Edward O'Callaghan6ae640b2021-11-17 14:24:04 +1100417 int ret = flash->chip->read(flash, readbuf, start, len);
Carl-Daniel Hailfingerd8369412010-11-16 17:21:58 +0000418 if (ret) {
419 msg_gerr("Verification impossible because read failed "
420 "at 0x%x (len 0x%x)\n", start, len);
Stefan Taunerdf64a422014-05-27 00:06:14 +0000421 ret = -1;
422 goto out_free;
Carl-Daniel Hailfingerd8369412010-11-16 17:21:58 +0000423 }
424
Stefan Tauner78ffbea2012-10-27 15:36:56 +0000425 ret = compare_range(cmpbuf, readbuf, start, len);
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000426out_free:
427 free(readbuf);
428 return ret;
429}
430
Nico Huber3ac761c2023-01-16 02:43:17 +0100431size_t gran_to_bytes(const enum write_granularity gran)
Nico Huberb77607f2023-01-16 02:25:45 +0100432{
433 switch (gran) {
434 case write_gran_1bit: return 1;
435 case write_gran_1byte: return 1;
436 case write_gran_1byte_implicit_erase: return 1;
437 case write_gran_128bytes: return 128;
438 case write_gran_256bytes: return 256;
439 case write_gran_264bytes: return 264;
440 case write_gran_512bytes: return 512;
441 case write_gran_528bytes: return 528;
442 case write_gran_1024bytes: return 1024;
443 case write_gran_1056bytes: return 1056;
444 default: return 0;
445 }
446}
447
Stefan Tauner02437452013-04-01 19:34:53 +0000448/* Helper function for need_erase() that focuses on granularities of gran bytes. */
Paul Kocialkowski995f7552018-01-15 01:06:09 +0300449static int need_erase_gran_bytes(const uint8_t *have, const uint8_t *want, unsigned int len,
450 unsigned int gran, const uint8_t erased_value)
Stefan Tauner02437452013-04-01 19:34:53 +0000451{
452 unsigned int i, j, limit;
453 for (j = 0; j < len / gran; j++) {
454 limit = min (gran, len - j * gran);
455 /* Are 'have' and 'want' identical? */
456 if (!memcmp(have + j * gran, want + j * gran, limit))
457 continue;
458 /* have needs to be in erased state. */
459 for (i = 0; i < limit; i++)
Paul Kocialkowski995f7552018-01-15 01:06:09 +0300460 if (have[j * gran + i] != erased_value)
Stefan Tauner02437452013-04-01 19:34:53 +0000461 return 1;
462 }
463 return 0;
464}
465
Uwe Hermann48ec1b12010-08-08 17:01:18 +0000466/*
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000467 * Check if the buffer @have can be programmed to the content of @want without
468 * erasing. This is only possible if all chunks of size @gran are either kept
469 * as-is or changed from an all-ones state to any other state.
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000470 *
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000471 * Warning: This function assumes that @have and @want point to naturally
472 * aligned regions.
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000473 *
474 * @have buffer with current content
475 * @want buffer with desired content
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000476 * @len length of the checked area
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000477 * @gran write granularity (enum, not count)
478 * @return 0 if no erase is needed, 1 otherwise
479 */
Edward O'Callaghana1805092022-05-16 11:10:36 +1000480static int need_erase(const uint8_t *have, const uint8_t *want, unsigned int len,
481 enum write_granularity gran, const uint8_t erased_value)
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000482{
Stefan Tauner02437452013-04-01 19:34:53 +0000483 unsigned int i;
Nico Huberb77607f2023-01-16 02:25:45 +0100484 size_t stride;
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000485
486 switch (gran) {
487 case write_gran_1bit:
Nico Huberb77607f2023-01-16 02:25:45 +0100488 for (i = 0; i < len; i++) {
489 if ((have[i] & want[i]) != want[i])
490 return 1;
491 }
492 return 0;
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000493 case write_gran_1byte:
Nico Huberb77607f2023-01-16 02:25:45 +0100494 for (i = 0; i < len; i++) {
495 if ((have[i] != want[i]) && (have[i] != erased_value))
496 return 1;
497 }
498 return 0;
Carl-Daniel Hailfinger1b0e9fc2014-06-16 22:36:17 +0000499 case write_gran_1byte_implicit_erase:
500 /* Do not erase, handle content changes from anything->0xff by writing 0xff. */
Nico Huberb77607f2023-01-16 02:25:45 +0100501 return 0;
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000502 default:
Nico Huberb77607f2023-01-16 02:25:45 +0100503 stride = gran_to_bytes(gran);
504 if (stride) {
505 return need_erase_gran_bytes(have, want, len, stride, erased_value);
506 }
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000507 msg_cerr("%s: Unsupported granularity! Please report a bug at "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200508 "flashprog@flashprog.org\n", __func__);
Nico Huberb77607f2023-01-16 02:25:45 +0100509 return 0;
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000510 }
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000511}
512
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000513/**
514 * Check if the buffer @have needs to be programmed to get the content of @want.
515 * If yes, return 1 and fill in first_start with the start address of the
516 * write operation and first_len with the length of the first to-be-written
517 * chunk. If not, return 0 and leave first_start and first_len undefined.
518 *
519 * Warning: This function assumes that @have and @want point to naturally
520 * aligned regions.
521 *
522 * @have buffer with current content
523 * @want buffer with desired content
524 * @len length of the checked area
525 * @gran write granularity (enum, not count)
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000526 * @first_start offset of the first byte which needs to be written (passed in
527 * value is increased by the offset of the first needed write
528 * relative to have/want or unchanged if no write is needed)
529 * @return length of the first contiguous area which needs to be written
530 * 0 if no write is needed
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000531 *
532 * FIXME: This function needs a parameter which tells it about coalescing
533 * in relation to the max write length of the programmer and the max write
534 * length of the chip.
535 */
Nico Huber3b9c86d2023-01-15 22:58:06 +0100536static unsigned int get_next_write(const uint8_t *have, const uint8_t *want, chipsize_t len,
537 chipoff_t *first_start, enum write_granularity gran)
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000538{
Felix Singerf25447e2022-08-19 02:44:28 +0200539 bool need_write = false;
Stefan Taunerc69c9c82011-11-23 09:13:48 +0000540 unsigned int rel_start = 0, first_len = 0;
Nico Huberb77607f2023-01-16 02:25:45 +0100541 unsigned int i, limit;
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000542
Nico Huberb77607f2023-01-16 02:25:45 +0100543 const size_t stride = gran_to_bytes(gran);
544 if (!stride) {
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000545 msg_cerr("%s: Unsupported granularity! Please report a bug at "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200546 "flashprog@flashprog.org\n", __func__);
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000547 /* Claim that no write was needed. A write with unknown
548 * granularity is too dangerous to try.
549 */
550 return 0;
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000551 }
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000552 for (i = 0; i < len / stride; i++) {
553 limit = min(stride, len - i * stride);
554 /* Are 'have' and 'want' identical? */
555 if (memcmp(have + i * stride, want + i * stride, limit)) {
556 if (!need_write) {
557 /* First location where have and want differ. */
Felix Singerf25447e2022-08-19 02:44:28 +0200558 need_write = true;
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000559 rel_start = i * stride;
560 }
561 } else {
562 if (need_write) {
563 /* First location where have and want
564 * do not differ anymore.
565 */
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000566 break;
567 }
568 }
569 }
Carl-Daniel Hailfinger202bf532010-12-06 13:05:44 +0000570 if (need_write)
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000571 first_len = min(i * stride - rel_start, len);
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000572 *first_start += rel_start;
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000573 return first_len;
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000574}
575
Nico Huber2d625722016-05-03 10:48:02 +0200576/*
577 * Return a string corresponding to the bustype parameter.
578 * Memory is obtained with malloc() and must be freed with free() by the caller.
579 */
580char *flashbuses_to_text(enum chipbustype bustype)
581{
582 char *ret = calloc(1, 1);
583 /*
584 * FIXME: Once all chipsets and flash chips have been updated, NONSPI
585 * will cease to exist and should be eliminated here as well.
586 */
587 if (bustype == BUS_NONSPI) {
588 ret = strcat_realloc(ret, "Non-SPI, ");
589 } else {
590 if (bustype & BUS_PARALLEL)
591 ret = strcat_realloc(ret, "Parallel, ");
592 if (bustype & BUS_LPC)
593 ret = strcat_realloc(ret, "LPC, ");
594 if (bustype & BUS_FWH)
595 ret = strcat_realloc(ret, "FWH, ");
596 if (bustype & BUS_SPI)
597 ret = strcat_realloc(ret, "SPI, ");
598 if (bustype & BUS_PROG)
599 ret = strcat_realloc(ret, "Programmer-specific, ");
600 if (bustype == BUS_NONE)
601 ret = strcat_realloc(ret, "None, ");
602 }
603 /* Kill last comma. */
604 ret[strlen(ret) - 2] = '\0';
605 ret = realloc(ret, strlen(ret) + 1);
606 return ret;
607}
608
Edward O'Callaghan00ea3892022-10-11 21:27:37 +1100609static int init_default_layout(struct flashctx *flash)
610{
611 /* Fill default layout covering the whole chip. */
Nico Huberc3b02dc2023-08-12 01:13:45 +0200612 if (flashprog_layout_new(&flash->default_layout) ||
613 flashprog_layout_add_region(flash->default_layout,
Edward O'Callaghan00ea3892022-10-11 21:27:37 +1100614 0, flash->chip->total_size * 1024 - 1, "complete flash") ||
Nico Huberc3b02dc2023-08-12 01:13:45 +0200615 flashprog_layout_include_region(flash->default_layout, "complete flash"))
Edward O'Callaghan00ea3892022-10-11 21:27:37 +1100616 return -1;
617 return 0;
618}
619
Nico Huberdae90222026-03-09 20:36:56 +0100620static void probe_bus(struct registered_master *const mst, const struct flashchip *const chip)
Nico Huberaf9d7382023-05-01 13:33:26 +0200621{
Nico Huberac138732026-02-28 17:42:27 +0100622 unsigned int least_priority, priority, i;
Nico Huberaf9d7382023-05-01 13:33:26 +0200623 struct found_id **next_ptr;
Nico Huberaf9d7382023-05-01 13:33:26 +0200624
625 if (mst->probed)
626 return;
627
Nico Huberac138732026-02-28 17:42:27 +0100628 for (i = 0, least_priority = 0; i < mst->probing.probe_count; ++i) {
629 if (least_priority < mst->probing.probes[i].priority)
630 least_priority = mst->probing.probes[i].priority;
631 }
632
Nico Huberaf9d7382023-05-01 13:33:26 +0200633 next_ptr = &mst->found_ids;
Nico Huberac138732026-02-28 17:42:27 +0100634 for (priority = 0; priority <= least_priority; ++priority) {
635 bool found = false;
Nico Huberaf9d7382023-05-01 13:33:26 +0200636
Nico Huberac138732026-02-28 17:42:27 +0100637 for (i = 0; i < mst->probing.probe_count; ++i) {
638 if (mst->probing.probes[i].priority != priority)
639 continue;
Nico Huberaf9d7382023-05-01 13:33:26 +0200640
Nico Huberdae90222026-03-09 20:36:56 +0100641 if (chip && chip->id.type != mst->probing.probes[i].type)
Nico Huberac138732026-02-28 17:42:27 +0100642 continue;
643
Nico Huberdae90222026-03-09 20:36:56 +0100644 *next_ptr = mst->probing.probes[i].run(&mst->probing.probes[i], &mst->common, chip);
Nico Huberac138732026-02-28 17:42:27 +0100645 found |= !!*next_ptr;
646
647 /* walk to end in case multiple IDs were found in a single call */
648 while (*next_ptr)
649 next_ptr = &(*next_ptr)->next;
650 }
651
652 /* Skip lower-priority probing if anything was found. */
653 if (found)
654 break;
Nico Huberaf9d7382023-05-01 13:33:26 +0200655 }
656
657 mst->probed = true;
658}
659
Nico Huberdae90222026-03-09 20:36:56 +0100660static bool chip_on_bus(struct registered_master *const mst, const struct flashchip *const chip)
Nico Huberaf9d7382023-05-01 13:33:26 +0200661{
662 static const char *const id_names[] = {
663 [ID_82802AB] = "82802AB",
664 [ID_EN29LV640B] = "EN29LV640B",
665 [ID_JEDEC] = "JEDEC",
666 [ID_JEDEC_29GL] = "JEDEC_29GL",
667 [ID_OPAQUE] = "OPAQUE",
668 [ID_SPI_AT25F] = "SPI_AT25F",
669 [ID_SPI_RDID] = "SPI_RDID",
Nico Huberaf9d7382023-05-01 13:33:26 +0200670 [ID_SPI_REMS] = "SPI_REMS",
671 [ID_SPI_RES1] = "SPI_RES1",
672 [ID_SPI_RES2] = "SPI_RES2",
673 [ID_SPI_RES3] = "SPI_RES3",
674 [ID_SPI_SFDP] = "SPI_SFDP",
675 [ID_SPI_ST95] = "SPI_ST95",
676 [ID_W29EE011] = "W29EE011",
677 [ID_EDI] = "EDI",
678 };
679
680 if (chip_to_probe) {
Nico Huber966dc9b2026-03-07 21:59:15 +0100681 /* We are looking for a particular chip.
682 If it can't be probed, assume it's there... */
683 if (chip->id.type == ID_NONE)
684 return true;
Nico Huberdae90222026-03-09 20:36:56 +0100685 /* ...otherwise, limit the probing sequences by its properties. */
686 probe_bus(mst, chip);
Nico Huberaf9d7382023-05-01 13:33:26 +0200687 } else {
Nico Huberdae90222026-03-09 20:36:56 +0100688 probe_bus(mst, NULL);
Nico Huberaf9d7382023-05-01 13:33:26 +0200689 }
690
691 struct found_id *found_id;
692 for (found_id = mst->found_ids; found_id; found_id = found_id->next) {
693 if (found_id->info.id.type != chip->id.type)
694 continue;
695
696 if (found_id->info.id.type < ARRAY_SIZE(id_names))
697 msg_cdbg("%s: id1 0x%02x, id2 0x%02x ",
698 id_names[found_id->info.id.type],
699 found_id->info.id.id1, found_id->info.id.id2);
700
701 if (mst->probing.match(chip, &found_id->info))
702 break;
703 }
704
705 msg_cdbg("\n");
706 return !!found_id;
707}
708
709/* wrapper that's used until all probing functions are ported to per-bus probing */
710int probe_buses(struct flashctx *const flash)
711{
712 int i;
713 for (i = 0; i < registered_master_count; ++i) {
714 if (flash->mst.common == &registered_masters[i].common &&
715 chip_on_bus(&registered_masters[i], flash->chip))
716 return 1;
717 }
718 return 0;
719}
720
Carl-Daniel Hailfingera5bcbce2014-07-19 22:03:29 +0000721int probe_flash(struct registered_master *mst, int startchip, struct flashctx *flash, int force)
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000722{
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000723 const struct flashchip *chip;
Carl-Daniel Hailfinger115d3902009-10-31 01:53:09 +0000724 enum chipbustype buses_common;
Carl-Daniel Hailfingerb22918c2009-06-01 02:08:58 +0000725 char *tmp;
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000726
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000727 for (chip = flashchips + startchip; chip && chip->name; chip++) {
728 if (chip_to_probe && strcmp(chip->name, chip_to_probe) != 0)
Ollie Lhocbbf1252004-03-17 22:22:08 +0000729 continue;
Carl-Daniel Hailfingera5bcbce2014-07-19 22:03:29 +0000730 buses_common = mst->buses_supported & chip->bustype;
Carl-Daniel Hailfingerc40cff72011-12-20 00:19:29 +0000731 if (!buses_common)
Carl-Daniel Hailfinger6573b742011-06-17 22:38:53 +0000732 continue;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000733 msg_gdbg("Probing for %s %s, %d kB: ", chip->vendor, chip->name, chip->total_size);
734 if (!chip->probe && !force) {
Nico Huberc3b02dc2023-08-12 01:13:45 +0200735 msg_gdbg("failed! flashprog has no probe function for this flash chip.\n");
Carl-Daniel Hailfingerb22918c2009-06-01 02:08:58 +0000736 continue;
737 }
Stefan Reinauer70385642007-04-06 11:58:03 +0000738
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000739 /* Start filling in the dynamic data. */
Angel Pons690a9442021-06-07 12:33:53 +0200740 flash->chip = calloc(1, sizeof(*flash->chip));
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000741 if (!flash->chip) {
742 msg_gerr("Out of memory!\n");
Edward O'Callaghan6edf9f82022-11-12 12:08:46 +1100743 return -1;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000744 }
Angel Pons7e134562021-06-07 13:29:13 +0200745 *flash->chip = *chip;
Nico Huber9a11cbf2023-01-13 01:19:07 +0100746 flash->mst.par = &mst->par; /* both `mst` are unions, so we need only one pointer */
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000747
Nico Huber5469c152026-02-12 22:56:52 +0100748 /* If we probe for a specific chip, we can adapt the voltage early. */
749 if (chip_to_probe && flash->mst.common->adapt_voltage) {
750 if (flash->mst.common->adapt_voltage(flash->mst.common,
751 chip->voltage.min, chip->voltage.max))
752 goto free_chip;
753 }
754
Nico Huber9eec4072023-01-12 01:17:30 +0100755 if (flash->chip->prepare_access && flash->chip->prepare_access(flash, PREPARE_PROBE))
756 goto free_chip;
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000757
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000758 /* We handle a forced match like a real match, we just avoid probing. Note that probe_flash()
759 * is only called with force=1 after normal probing failed.
760 */
Peter Stuge27c3e2d2008-07-02 17:15:47 +0000761 if (force)
762 break;
Stefan Reinauerfcb63682006-03-16 16:57:41 +0000763
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000764 if (flash->chip->probe(flash) != 1)
Peter Stuge483b8f02008-09-03 23:10:05 +0000765 goto notfound;
766
Nico Huberb89c4522024-12-04 23:30:13 +0100767 if (flash->chip->prepare_access && flash->chip->prepare_access(flash, PREPARE_POST_PROBE))
768 goto notfound;
769
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000770 /* If this is the first chip found, accept it.
771 * If this is not the first chip found, accept it only if it is
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000772 * a non-generic match. SFDP and CFI are generic matches.
773 * startchip==0 means this call to probe_flash() is the first
Carl-Daniel Hailfingera5bcbce2014-07-19 22:03:29 +0000774 * one for this programmer interface (master) and thus no other chip has
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000775 * been found on this interface.
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000776 */
Nico Huber11136c22023-05-01 12:00:09 +0200777 if (startchip == 0 && flash->chip->id.model == SFDP_DEVICE_ID) {
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000778 msg_cinfo("===\n"
779 "SFDP has autodetected a flash chip which is "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200780 "not natively supported by flashprog yet.\n");
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000781 if (count_usable_erasers(flash) == 0)
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000782 msg_cinfo("The standard operations read and "
783 "verify should work, but to support "
784 "erase, write and all other "
785 "possible features");
786 else
787 msg_cinfo("All standard operations (read, "
788 "verify, erase and write) should "
789 "work, but to support all possible "
790 "features");
791
Stefan Taunerb4e06bd2012-08-20 00:24:22 +0000792 msg_cinfo(" we need to add them manually.\n"
793 "You can help us by mailing us the output of the following command to "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200794 "flashprog@flashprog.org:\n"
795 "'flashprog -VV [plus the -p/--programmer parameter]'\n"
Stefan Taunerb4e06bd2012-08-20 00:24:22 +0000796 "Thanks for your help!\n"
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000797 "===\n");
798 }
799
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000800 /* First flash chip detected on this bus. */
801 if (startchip == 0)
Peter Stuge27c3e2d2008-07-02 17:15:47 +0000802 break;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000803 /* Not the first flash chip detected on this bus, but not a generic match either. */
Nico Huber11136c22023-05-01 12:00:09 +0200804 if ((flash->chip->id.model != GENERIC_DEVICE_ID) && (flash->chip->id.model != SFDP_DEVICE_ID))
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000805 break;
806 /* 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 +0000807notfound:
Nico Huber9eec4072023-01-12 01:17:30 +0100808 if (flash->chip->finish_access)
809 flash->chip->finish_access(flash);
810free_chip:
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000811 free(flash->chip);
812 flash->chip = NULL;
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000813 }
Uwe Hermannffec5f32007-08-23 16:08:21 +0000814
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000815 if (!flash->chip)
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000816 return -1;
Peter Stuge27c3e2d2008-07-02 17:15:47 +0000817
Edward O'Callaghan00ea3892022-10-11 21:27:37 +1100818 if (init_default_layout(flash) < 0)
819 return -1;
Stefan Reinauer051e2362011-01-19 06:21:54 +0000820
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000821 tmp = flashbuses_to_text(flash->chip->bustype);
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000822 msg_cinfo("%s %s flash chip \"%s\" (%d kB, %s) ", force ? "Assuming" : "Found",
823 flash->chip->vendor, flash->chip->name, flash->chip->total_size, tmp);
Stefan Tauner00155492011-06-26 20:45:35 +0000824 free(tmp);
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000825#if CONFIG_INTERNAL == 1
Nico Huber0e76d992023-01-12 20:22:55 +0100826 if (flash->physical_memory != 0 && mst->par.map_flash == physmap)
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000827 msg_cinfo("mapped at physical address 0x%0*" PRIxPTR ".\n",
828 PRIxPTR_WIDTH, flash->physical_memory);
829 else
830#endif
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +0200831 msg_cinfo("on %s.\n", programmer->name);
Uwe Hermann9899cad2009-06-28 21:47:57 +0000832
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000833 /* Flash registers may more likely not be mapped if the chip was forced.
834 * Lock info may be stored in registers, so avoid lock info printing. */
Carl-Daniel Hailfinger859f3f02010-12-02 21:59:42 +0000835 if (!force)
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000836 if (flash->chip->printlock)
837 flash->chip->printlock(flash);
Sean Nelson6e0b9122010-02-19 00:52:10 +0000838
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000839 /* Get out of the way for later runs. */
Nico Huber9eec4072023-01-12 01:17:30 +0100840 if (flash->chip->finish_access)
841 flash->chip->finish_access(flash);
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000842
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000843 /* Return position of matching chip. */
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000844 return chip - flashchips;
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000845}
846
Stefan Tauner96658be2014-05-26 22:05:31 +0000847/* Even if an error is found, the function will keep going and check the rest. */
Nico Huber72d0ada2026-01-26 18:28:20 +0100848static int selfcheck_eraseblocks(const struct flashchip *chip, const char *label)
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000849{
Carl-Daniel Hailfinger082c8b52011-08-15 19:54:20 +0000850 int i, j, k;
851 int ret = 0;
Aarya Chaumal478e1792022-06-04 01:34:44 +0530852 unsigned int prev_eraseblock_count = chip->total_size * 1024;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000853
854 for (k = 0; k < NUM_ERASEFUNCTIONS; k++) {
855 unsigned int done = 0;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000856 struct block_eraser eraser = chip->block_erasers[k];
Aarya Chaumal478e1792022-06-04 01:34:44 +0530857 unsigned int curr_eraseblock_count = 0;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000858
859 for (i = 0; i < NUM_ERASEREGIONS; i++) {
860 /* Blocks with zero size 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 size 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 /* Blocks with zero count are bugs in flashchips.c. */
869 if (!eraser.eraseblocks[i].count &&
870 eraser.eraseblocks[i].size) {
Nico Huberac90af62022-12-18 00:22:47 +0000871 msg_gerr("ERROR: Flash chip %s erase function %i region %i has count 0.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +0200872 "Please report a bug at flashprog@flashprog.org\n",
Nico Huber72d0ada2026-01-26 18:28:20 +0100873 label, k, i);
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000874 ret = 1;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000875 }
876 done += eraser.eraseblocks[i].count *
877 eraser.eraseblocks[i].size;
Aarya Chaumal478e1792022-06-04 01:34:44 +0530878 curr_eraseblock_count += eraser.eraseblocks[i].count;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000879 }
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000880 /* Empty eraseblock definition with erase function. */
881 if (!done && eraser.block_erase)
Sean Nelson316a29f2010-05-07 20:09:04 +0000882 msg_gspew("Strange: Empty eraseblock definition with "
Uwe Hermann91f4afa2011-07-28 08:13:25 +0000883 "non-empty erase function. Not an error.\n");
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000884 if (!done)
885 continue;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000886 if (done != chip->total_size * 1024) {
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000887 msg_gerr("ERROR: Flash chip %s erase function %i "
888 "region walking resulted in 0x%06x bytes total,"
Nico Huberac90af62022-12-18 00:22:47 +0000889 " expected 0x%06x bytes.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +0200890 "Please report a bug at flashprog@flashprog.org\n",
Nico Huber72d0ada2026-01-26 18:28:20 +0100891 label, k, done, chip->total_size * 1024);
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000892 ret = 1;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000893 }
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000894 if (!eraser.block_erase)
895 continue;
896 /* Check if there are identical erase functions for different
897 * layouts. That would imply "magic" erase functions. The
898 * easiest way to check this is with function pointers.
899 */
Uwe Hermann43959702010-03-13 17:28:29 +0000900 for (j = k + 1; j < NUM_ERASEFUNCTIONS; j++) {
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000901 if (eraser.block_erase ==
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000902 chip->block_erasers[j].block_erase) {
Nico Huberac90af62022-12-18 00:22:47 +0000903 msg_gerr("ERROR: Flash chip %s erase function %i and %i are identical.\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, j);
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000906 ret = 1;
907 }
Uwe Hermann43959702010-03-13 17:28:29 +0000908 }
Aarya Chaumal478e1792022-06-04 01:34:44 +0530909 if(curr_eraseblock_count > prev_eraseblock_count)
910 {
Nico Huberac90af62022-12-18 00:22:47 +0000911 msg_gerr("ERROR: Flash chip %s erase function %i is not in order.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +0200912 "Please report a bug at flashprog@flashprog.org\n",
Nico Huber72d0ada2026-01-26 18:28:20 +0100913 label, k);
Aarya Chaumal478e1792022-06-04 01:34:44 +0530914 ret = 1;
915 }
916 prev_eraseblock_count = curr_eraseblock_count;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000917 }
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000918 return ret;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000919}
920
Carl-Daniel Hailfinger63fd9022011-12-14 22:25:15 +0000921static int check_block_eraser(const struct flashctx *flash, int k, int log)
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000922{
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000923 struct block_eraser eraser = flash->chip->block_erasers[k];
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000924
925 if (!eraser.block_erase && !eraser.eraseblocks[0].count) {
926 if (log)
927 msg_cdbg("not defined. ");
928 return 1;
929 }
930 if (!eraser.block_erase && eraser.eraseblocks[0].count) {
931 if (log)
932 msg_cdbg("eraseblock layout is known, but matching "
Stefan Tauner355cbfd2011-05-28 02:37:14 +0000933 "block erase function is not implemented. ");
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000934 return 1;
935 }
936 if (eraser.block_erase && !eraser.eraseblocks[0].count) {
937 if (log)
938 msg_cdbg("block erase function found, but "
Stefan Tauner355cbfd2011-05-28 02:37:14 +0000939 "eraseblock layout is not defined. ");
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000940 return 1;
941 }
Aarya Chaumal6d98aec2022-08-14 23:16:44 +0530942
Nico Hubere149fbe2024-08-21 10:23:53 +0200943 if (flash->chip->bustype == BUS_SPI && flash->chip->spi_cmd_set == SPI25) {
Nico Huber13389362024-03-05 18:35:30 +0100944 bool native_4ba;
Nico Huber13f97a52023-01-14 23:55:06 +0100945 int i;
Nico Huber13389362024-03-05 18:35:30 +0100946
947 const uint8_t *opcode = spi_get_opcode_from_erasefn(eraser.block_erase, &native_4ba);
Nico Huber07ebc682024-08-21 10:18:27 +0200948 if (!opcode)
949 return 1;
950
Nico Huber13f97a52023-01-14 23:55:06 +0100951 for (i = 0; opcode[i]; i++) {
Nico Huber13389362024-03-05 18:35:30 +0100952 if ((native_4ba && !spi_master_4ba(flash)) ||
Nico Huber9a11cbf2023-01-13 01:19:07 +0100953 !flash->mst.spi->probe_opcode(flash, opcode[i])) {
Aarya Chaumal6d98aec2022-08-14 23:16:44 +0530954 if (log)
955 msg_cdbg("block erase function and layout found "
956 "but SPI master doesn't support the function. ");
957 return 1;
958 }
959 }
960 }
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000961 // TODO: Once erase functions are annotated with allowed buses, check that as well.
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000962 return 0;
963}
964
Nico Huber7af0e792016-04-29 16:40:15 +0200965/**
966 * @brief Reads the included layout regions into a buffer.
967 *
968 * If there is no layout set in the given flash context, the whole chip will
969 * be read.
970 *
971 * @param flashctx Flash context to be used.
972 * @param buffer Buffer of full chip size to read into.
973 * @return 0 on success,
974 * 1 if any read fails.
975 */
976static int read_by_layout(struct flashctx *const flashctx, uint8_t *const buffer)
977{
Nico Huberc3b02dc2023-08-12 01:13:45 +0200978 const struct flashprog_layout *const layout = get_layout(flashctx);
Nico Huber5ca55232019-06-15 22:29:08 +0200979 const struct romentry *entry = NULL;
Nico Huber7af0e792016-04-29 16:40:15 +0200980
Richard Hughes842d6782021-01-15 09:48:12 +0000981 flashprog_progress_start_by_layout(flashctx, FLASHPROG_PROGRESS_READ, layout);
982
Nico Huber5ca55232019-06-15 22:29:08 +0200983 while ((entry = layout_next_included(layout, entry))) {
984 const chipoff_t region_start = entry->start;
985 const chipsize_t region_len = entry->end - entry->start + 1;
Nico Huber7af0e792016-04-29 16:40:15 +0200986
987 if (flashctx->chip->read(flashctx, buffer + region_start, region_start, region_len))
988 return 1;
989 }
Richard Hughes842d6782021-01-15 09:48:12 +0000990
991 flashprog_progress_finish(flashctx);
992
Nico Huber7af0e792016-04-29 16:40:15 +0200993 return 0;
994}
995
Nico Huber7af0e792016-04-29 16:40:15 +0200996/**
997 * @private
998 *
999 * For read-erase-write, `curcontents` and `newcontents` shall point
1000 * to buffers of the chip's size. Both are supposed to be prefilled
1001 * with at least the included layout regions of the current flash
1002 * contents (`curcontents`) and the data to be written to the flash
1003 * (`newcontents`).
1004 *
1005 * For erase, `curcontents` and `newcontents` shall be NULL-pointers.
1006 *
1007 * The `chipoff_t` values are used internally by `walk_by_layout()`.
1008 */
1009struct walk_info {
1010 uint8_t *curcontents;
1011 const uint8_t *newcontents;
1012 chipoff_t region_start;
1013 chipoff_t region_end;
1014 chipoff_t erase_start;
1015 chipoff_t erase_end;
1016};
Nico Huber3b9c86d2023-01-15 22:58:06 +01001017
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301018struct eraseblock_data {
1019 chipoff_t start_addr;
1020 chipoff_t end_addr;
1021 bool selected;
1022 size_t block_num;
1023 size_t first_sub_block_index;
1024 size_t last_sub_block_index;
1025};
1026
1027struct erase_layout {
1028 struct eraseblock_data* layout_list;
1029 size_t block_count;
1030 const struct block_eraser *eraser;
1031};
1032
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001033static bool explicit_erase(const struct walk_info *const info)
1034{
1035 /* For explicit erase, we are called without new contents. */
1036 return !info->newcontents;
1037}
1038
Nico Huberd96e7032023-01-14 22:31:48 +01001039static size_t calculate_block_count(const struct block_eraser *const eraser)
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301040{
Nico Huberd96e7032023-01-14 22:31:48 +01001041 size_t block_count = 0, i;
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301042
Nico Huberd96e7032023-01-14 22:31:48 +01001043 for (i = 0; i < ARRAY_SIZE(eraser->eraseblocks); ++i)
1044 block_count += eraser->eraseblocks[i].count;
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301045
1046 return block_count;
1047}
1048
1049static void init_eraseblock(struct erase_layout *layout, size_t idx, size_t block_num,
1050 chipoff_t start_addr, chipoff_t end_addr, size_t *sub_block_index)
1051{
1052 struct eraseblock_data *edata = &layout[idx].layout_list[block_num];
1053 edata->start_addr = start_addr;
1054 edata->end_addr = end_addr;
1055 edata->selected = false;
1056 edata->block_num = block_num;
1057
1058 if (!idx)
1059 return;
Nico Hubera02df332023-01-14 23:06:27 +01001060 const struct erase_layout *const sub_layout = &layout[idx - 1];
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301061
1062 edata->first_sub_block_index = *sub_block_index;
Nico Hubera02df332023-01-14 23:06:27 +01001063 for (; *sub_block_index < sub_layout->block_count; ++*sub_block_index) {
1064 if (sub_layout->layout_list[*sub_block_index].end_addr > end_addr)
1065 break;
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301066 }
1067 edata->last_sub_block_index = *sub_block_index - 1;
1068}
1069
1070/*
1071 * @brief Function to free the created erase_layout
1072 *
1073 * @param layout pointer to allocated layout
1074 * @param erasefn_count number of erase functions for which the layout was created
1075 *
1076 */
1077static void free_erase_layout(struct erase_layout *layout, unsigned int erasefn_count)
1078{
Nico Huber13f97a52023-01-14 23:55:06 +01001079 size_t i;
1080
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301081 if (!layout)
1082 return;
Nico Huber13f97a52023-01-14 23:55:06 +01001083 for (i = 0; i < erasefn_count; i++) {
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301084 free(layout[i].layout_list);
1085 }
1086 free(layout);
1087}
1088
1089/*
1090 * @brief Function to create an erase layout
1091 *
1092 * @param flashctx flash context
1093 * @param e_layout address to the pointer to store the layout
1094 * @return 0 on success,
1095 * -1 if layout creation fails
1096 *
1097 * This function creates a layout of which erase functions erase which regions
1098 * of the flash chip. This helps to optimally select the erase functions for
1099 * erase/write operations.
1100 */
Nico Huberc09fca42023-01-29 15:58:09 +01001101static int create_erase_layout(struct flashctx *const flashctx, struct erase_layout **e_layout)
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301102{
1103 const struct flashchip *chip = flashctx->chip;
1104 const size_t erasefn_count = count_usable_erasers(flashctx);
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301105
1106 if (!erasefn_count) {
1107 msg_gerr("No erase functions supported\n");
1108 return 0;
1109 }
1110
Nico Huberd34864b2023-01-14 23:47:19 +01001111 struct erase_layout *layout = calloc(erasefn_count, sizeof(struct erase_layout));
1112 if (!layout) {
1113 msg_gerr("Out of memory!\n");
1114 return -1;
1115 }
1116
Nico Huber13f97a52023-01-14 23:55:06 +01001117 size_t layout_idx = 0, eraser_idx;
1118 for (eraser_idx = 0; eraser_idx < NUM_ERASEFUNCTIONS; eraser_idx++) {
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301119 if (check_block_eraser(flashctx, eraser_idx, 0))
1120 continue;
1121
1122 layout[layout_idx].eraser = &chip->block_erasers[eraser_idx];
Nico Huberd96e7032023-01-14 22:31:48 +01001123 const size_t block_count = calculate_block_count(&chip->block_erasers[eraser_idx]);
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301124 size_t sub_block_index = 0;
1125
1126 layout[layout_idx].block_count = block_count;
1127 layout[layout_idx].layout_list = (struct eraseblock_data *)calloc(block_count,
1128 sizeof(struct eraseblock_data));
1129
1130 if (!layout[layout_idx].layout_list) {
1131 free_erase_layout(layout, layout_idx);
1132 return -1;
1133 }
1134
1135 size_t block_num = 0;
1136 chipoff_t start_addr = 0;
1137
Nico Huber13f97a52023-01-14 23:55:06 +01001138 int i;
1139 for (i = 0; block_num < block_count; i++) {
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301140 const struct eraseblock *block = &chip->block_erasers[eraser_idx].eraseblocks[i];
1141
Nico Huber13f97a52023-01-14 23:55:06 +01001142 size_t num;
1143 for (num = 0; num < block->count; num++) {
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301144 chipoff_t end_addr = start_addr + block->size - 1;
1145 init_eraseblock(layout, layout_idx, block_num,
1146 start_addr, end_addr, &sub_block_index);
1147 block_num += 1;
1148 start_addr = end_addr + 1;
1149 }
1150 }
1151 layout_idx++;
1152 }
1153
1154 *e_layout = layout;
1155 return layout_idx;
1156}
1157
Nico Huber20073e72024-05-10 01:31:40 +02001158static void deselect_erase_block_rec(const struct erase_layout *layout, size_t findex, size_t block_num)
1159{
1160 struct eraseblock_data *const ed = &layout[findex].layout_list[block_num];
1161 size_t i;
1162
1163 if (ed->selected) {
1164 ed->selected = false;
1165 } else if (findex > 0) {
1166 for (i = ed->first_sub_block_index; i <= ed->last_sub_block_index; ++i)
1167 deselect_erase_block_rec(layout, findex - 1, i);
1168 }
1169}
1170
Aarya Chaumald33bea42022-07-14 12:51:14 +05301171/*
1172 * @brief Function to select the list of sectors that need erasing
1173 *
1174 * @param flashctx flash context
1175 * @param layout erase layout
1176 * @param findex index of the erase function
1177 * @param block_num index of the block to erase according to the erase function index
Nico Huber00d1b9f2023-01-29 15:07:33 +01001178 * @param info current info from walking the regions
Nico Huberaa714dd2023-04-22 14:59:33 +02001179 * @return number of bytes selected for erase
Aarya Chaumald33bea42022-07-14 12:51:14 +05301180 */
Nico Huberaa714dd2023-04-22 14:59:33 +02001181static size_t select_erase_functions_rec(const struct flashctx *flashctx, const struct erase_layout *layout,
1182 size_t findex, size_t block_num, const struct walk_info *info)
Aarya Chaumald33bea42022-07-14 12:51:14 +05301183{
1184 struct eraseblock_data *ll = &layout[findex].layout_list[block_num];
Nico Huberaa714dd2023-04-22 14:59:33 +02001185 const size_t eraseblock_size = ll->end_addr - ll->start_addr + 1;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301186 if (!findex) {
Nico Hubercf6ff0a2023-01-29 15:45:06 +01001187 if (ll->start_addr <= info->region_end && ll->end_addr >= info->region_start) {
Nico Huber1494f8e2023-01-29 15:48:00 +01001188 if (explicit_erase(info)) {
1189 ll->selected = true;
Nico Huberaa714dd2023-04-22 14:59:33 +02001190 return eraseblock_size;
Nico Huber1494f8e2023-01-29 15:48:00 +01001191 }
Nico Hubera6212482023-01-29 15:39:26 +01001192 const chipoff_t write_start = MAX(info->region_start, ll->start_addr);
1193 const chipoff_t write_end = MIN(info->region_end, ll->end_addr);
1194 const chipsize_t write_len = write_end - write_start + 1;
1195 const uint8_t erased_value = ERASED_VALUE(flashctx);
Nico Huber00d1b9f2023-01-29 15:07:33 +01001196 ll->selected = need_erase(
Nico Hubera6212482023-01-29 15:39:26 +01001197 info->curcontents + write_start, info->newcontents + write_start,
1198 write_len, flashctx->chip->gran, erased_value);
Nico Huberaa714dd2023-04-22 14:59:33 +02001199 if (ll->selected)
1200 return eraseblock_size;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301201 }
Nico Huberaa714dd2023-04-22 14:59:33 +02001202 return 0;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301203 } else {
Aarya Chaumald33bea42022-07-14 12:51:14 +05301204 const int sub_block_start = ll->first_sub_block_index;
1205 const int sub_block_end = ll->last_sub_block_index;
Nico Huberaa714dd2023-04-22 14:59:33 +02001206 size_t bytes = 0;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301207
Nico Huber13f97a52023-01-14 23:55:06 +01001208 int j;
Nico Huberaa714dd2023-04-22 14:59:33 +02001209 for (j = sub_block_start; j <= sub_block_end; j++)
1210 bytes += select_erase_functions_rec(flashctx, layout, findex - 1, j, info);
Aarya Chaumald33bea42022-07-14 12:51:14 +05301211
Nico Huberaa714dd2023-04-22 14:59:33 +02001212 if (bytes > eraseblock_size / 2) {
Nico Huber00d1b9f2023-01-29 15:07:33 +01001213 if (ll->start_addr >= info->region_start && ll->end_addr <= info->region_end) {
Nico Huber20073e72024-05-10 01:31:40 +02001214 deselect_erase_block_rec(layout, findex, block_num);
Aarya Chaumald33bea42022-07-14 12:51:14 +05301215 ll->selected = true;
Nico Huberaa714dd2023-04-22 14:59:33 +02001216 bytes = eraseblock_size;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301217 }
1218 }
Nico Huberaa714dd2023-04-22 14:59:33 +02001219 return bytes;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301220 }
1221}
1222
Nico Huberaa714dd2023-04-22 14:59:33 +02001223static size_t select_erase_functions(const struct flashctx *flashctx, const struct erase_layout *layout,
1224 size_t erasefn_count, const struct walk_info *info)
Nico Huberb11b72c2023-01-29 15:33:11 +01001225{
Nico Huberaa714dd2023-04-22 14:59:33 +02001226 size_t bytes = 0;
Nico Huberb11b72c2023-01-29 15:33:11 +01001227 size_t block_num;
1228 for (block_num = 0; block_num < layout[erasefn_count - 1].block_count; ++block_num)
Nico Huberaa714dd2023-04-22 14:59:33 +02001229 bytes += select_erase_functions_rec(flashctx, layout, erasefn_count - 1, block_num, info);
1230 return bytes;
Nico Huberb11b72c2023-01-29 15:33:11 +01001231}
1232
Nico Huber3b9c86d2023-01-15 22:58:06 +01001233static int write_range(struct flashctx *const flashctx, const chipoff_t flash_offset,
1234 const uint8_t *const curcontents, const uint8_t *const newcontents,
1235 const chipsize_t len, bool *const skipped)
1236{
1237 unsigned int writecount = 0;
1238 chipoff_t starthere = 0;
1239 chipsize_t lenhere = 0;
1240
1241 while ((lenhere = get_next_write(curcontents + starthere, newcontents + starthere,
1242 len - starthere, &starthere, flashctx->chip->gran))) {
1243 if (!writecount++)
1244 msg_cdbg("W");
1245 if (flashctx->chip->write(flashctx, newcontents + starthere,
1246 flash_offset + starthere, lenhere))
1247 return 1;
1248 starthere += lenhere;
Richard Hughes842d6782021-01-15 09:48:12 +00001249 if (skipped) {
1250 flashprog_progress_set(flashctx, starthere);
Nico Huber3b9c86d2023-01-15 22:58:06 +01001251 *skipped = false;
Richard Hughes842d6782021-01-15 09:48:12 +00001252 }
Nico Huber3b9c86d2023-01-15 22:58:06 +01001253 }
1254 return 0;
1255}
1256
1257typedef int (*erasefn_t)(struct flashctx *, unsigned int addr, unsigned int len);
Nico Huber7af0e792016-04-29 16:40:15 +02001258/* returns 0 on success, 1 to retry with another erase function, 2 for immediate abort */
1259typedef int (*per_blockfn_t)(struct flashctx *, const struct walk_info *, erasefn_t);
1260
1261static int walk_eraseblocks(struct flashctx *const flashctx,
Nico Huberc09fca42023-01-29 15:58:09 +01001262 struct erase_layout *const layouts,
1263 const size_t layout_count,
Nico Huber7af0e792016-04-29 16:40:15 +02001264 struct walk_info *const info,
Nico Huberc09fca42023-01-29 15:58:09 +01001265 const per_blockfn_t per_blockfn)
Nico Huber7af0e792016-04-29 16:40:15 +02001266{
1267 int ret;
1268 size_t i, j;
1269 bool first = true;
Nico Huber7af0e792016-04-29 16:40:15 +02001270
Nico Huberc09fca42023-01-29 15:58:09 +01001271 for (i = 0; i < layout_count; ++i) {
1272 const struct erase_layout *const layout = &layouts[i];
Nico Huber7af0e792016-04-29 16:40:15 +02001273
Nico Huberc09fca42023-01-29 15:58:09 +01001274 for (j = 0; j < layout->block_count; ++j) {
1275 struct eraseblock_data *const eb = &layout->layout_list[j];
1276
1277 if (eb->start_addr > info->region_end)
Nico Huber7af0e792016-04-29 16:40:15 +02001278 break;
Nico Huberc09fca42023-01-29 15:58:09 +01001279 if (eb->end_addr < info->region_start)
1280 continue;
1281 if (!eb->selected)
1282 continue;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001283
Nico Huber7af0e792016-04-29 16:40:15 +02001284 /* Print this for every block except the first one. */
1285 if (first)
1286 first = false;
1287 else
1288 msg_cdbg(", ");
Nico Huberc09fca42023-01-29 15:58:09 +01001289 msg_cdbg("0x%06x-0x%06x:", eb->start_addr, eb->end_addr);
Nico Huber7af0e792016-04-29 16:40:15 +02001290
Nico Huberc09fca42023-01-29 15:58:09 +01001291 info->erase_start = eb->start_addr;
1292 info->erase_end = eb->end_addr;
1293 ret = per_blockfn(flashctx, info, layout->eraser->block_erase);
Nico Huber7af0e792016-04-29 16:40:15 +02001294 if (ret)
1295 return ret;
Nico Huberc09fca42023-01-29 15:58:09 +01001296
1297 /* Clean the erase layout up for future use on other
1298 regions. `.selected` is the only field we alter. */
1299 eb->selected = false;
Nico Huber7af0e792016-04-29 16:40:15 +02001300 }
Nico Huber7af0e792016-04-29 16:40:15 +02001301 }
1302 msg_cdbg("\n");
1303 return 0;
1304}
1305
1306static int walk_by_layout(struct flashctx *const flashctx, struct walk_info *const info,
1307 const per_blockfn_t per_blockfn)
1308{
Nico Huberc09fca42023-01-29 15:58:09 +01001309 const bool do_erase = explicit_erase(info) || !(flashctx->chip->feature_bits & FEATURE_NO_ERASE);
Nico Huberc3b02dc2023-08-12 01:13:45 +02001310 const struct flashprog_layout *const layout = get_layout(flashctx);
Nico Huberc09fca42023-01-29 15:58:09 +01001311 struct erase_layout *erase_layouts = NULL;
Nico Huber5ca55232019-06-15 22:29:08 +02001312 const struct romentry *entry = NULL;
Nico Huberc09fca42023-01-29 15:58:09 +01001313 int ret = 0, layout_count = 0;
Nico Huber7af0e792016-04-29 16:40:15 +02001314
1315 all_skipped = true;
Nico Huberc6a924a2024-09-04 15:09:52 +02001316 msg_cinfo("Erasing %sflash chip... ", info->newcontents ? "and writing " : "");
Nico Huber7af0e792016-04-29 16:40:15 +02001317
Nico Huberc09fca42023-01-29 15:58:09 +01001318 if (do_erase) {
1319 layout_count = create_erase_layout(flashctx, &erase_layouts);
1320 if (layout_count <= 0)
1321 return 1;
1322 }
1323
Nico Huber5ca55232019-06-15 22:29:08 +02001324 while ((entry = layout_next_included(layout, entry))) {
1325 info->region_start = entry->start;
1326 info->region_end = entry->end;
Nico Huber7af0e792016-04-29 16:40:15 +02001327
Nico Huberc09fca42023-01-29 15:58:09 +01001328 if (do_erase) {
Richard Hughes842d6782021-01-15 09:48:12 +00001329 const size_t total = select_erase_functions(flashctx, erase_layouts, layout_count, info);
1330
1331 /* We verify every erased block manually. Technically that's
1332 reading, but accounting for it as part of the erase helps
1333 to provide a smooth, overall progress. Hence `total * 2`. */
1334 flashprog_progress_start(flashctx, FLASHPROG_PROGRESS_ERASE, total * 2);
1335
Nico Huberc09fca42023-01-29 15:58:09 +01001336 ret = walk_eraseblocks(flashctx, erase_layouts, layout_count, info, per_blockfn);
1337 if (ret) {
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001338 msg_cerr("FAILED!\n");
Nico Huberc09fca42023-01-29 15:58:09 +01001339 goto free_ret;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001340 }
Richard Hughes842d6782021-01-15 09:48:12 +00001341
1342 flashprog_progress_finish(flashctx);
Nico Huber7af0e792016-04-29 16:40:15 +02001343 }
Nico Huberd34af7a2023-01-15 23:58:18 +01001344
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001345 if (info->newcontents) {
1346 bool skipped = true;
1347 msg_cdbg("0x%06x-0x%06x:", info->region_start, info->region_end);
Richard Hughes842d6782021-01-15 09:48:12 +00001348 flashprog_progress_start(flashctx, FLASHPROG_PROGRESS_WRITE,
1349 info->region_end - info->region_start + 1);
Nico Huberc09fca42023-01-29 15:58:09 +01001350 ret = write_range(flashctx, info->region_start,
1351 info->curcontents + info->region_start,
1352 info->newcontents + info->region_start,
1353 info->region_end + 1 - info->region_start, &skipped);
1354 if (ret) {
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001355 msg_cerr("FAILED!\n");
Nico Huberc09fca42023-01-29 15:58:09 +01001356 goto free_ret;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001357 }
Richard Hughes842d6782021-01-15 09:48:12 +00001358 flashprog_progress_finish(flashctx);
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001359 if (skipped) {
1360 msg_cdbg("S\n");
1361 } else {
1362 msg_cdbg("\n");
1363 all_skipped = false;
1364 }
Nico Huberd34af7a2023-01-15 23:58:18 +01001365 }
Nico Huber7af0e792016-04-29 16:40:15 +02001366 }
1367 if (all_skipped)
1368 msg_cinfo("\nWarning: Chip content is identical to the requested image.\n");
Nico Huberc6a924a2024-09-04 15:09:52 +02001369 msg_cinfo("Erase%s done.\n", info->newcontents ? "/write" : "");
Nico Huberc09fca42023-01-29 15:58:09 +01001370
1371free_ret:
1372 free_erase_layout(erase_layouts, layout_count);
1373 return ret;
Nico Huber7af0e792016-04-29 16:40:15 +02001374}
1375
1376static int erase_block(struct flashctx *const flashctx,
1377 const struct walk_info *const info, const erasefn_t erasefn)
1378{
1379 const unsigned int erase_len = info->erase_end + 1 - info->erase_start;
Nico Huber6e61e0c2019-01-23 17:07:49 +01001380 const bool region_unaligned = info->region_start > info->erase_start ||
1381 info->erase_end > info->region_end;
1382 uint8_t *backup_contents = NULL, *erased_contents = NULL;
Nico Huberd34af7a2023-01-15 23:58:18 +01001383 int ret = 1;
Nico Huber7af0e792016-04-29 16:40:15 +02001384
Nico Huber6e61e0c2019-01-23 17:07:49 +01001385 /*
1386 * If the region is not erase-block aligned, merge current flash con-
1387 * tents into a new buffer `backup_contents`.
1388 */
1389 if (region_unaligned) {
1390 backup_contents = malloc(erase_len);
1391 erased_contents = malloc(erase_len);
1392 if (!backup_contents || !erased_contents) {
1393 msg_cerr("Out of memory!\n");
Nico Huber6e61e0c2019-01-23 17:07:49 +01001394 goto _free_ret;
1395 }
1396 memset(backup_contents, ERASED_VALUE(flashctx), erase_len);
1397 memset(erased_contents, ERASED_VALUE(flashctx), erase_len);
1398
1399 msg_cdbg("R");
1400 /* Merge data preceding the current region. */
1401 if (info->region_start > info->erase_start) {
1402 const chipoff_t start = info->erase_start;
1403 const chipsize_t len = info->region_start - info->erase_start;
1404 if (flashctx->chip->read(flashctx, backup_contents, start, len)) {
1405 msg_cerr("Can't read! Aborting.\n");
1406 goto _free_ret;
1407 }
1408 }
1409 /* Merge data following the current region. */
1410 if (info->erase_end > info->region_end) {
1411 const chipoff_t start = info->region_end + 1;
1412 const chipoff_t rel_start = start - info->erase_start; /* within this erase block */
1413 const chipsize_t len = info->erase_end - info->region_end;
1414 if (flashctx->chip->read(flashctx, backup_contents + rel_start, start, len)) {
1415 msg_cerr("Can't read! Aborting.\n");
1416 goto _free_ret;
1417 }
1418 }
1419 }
1420
Nico Huber7af0e792016-04-29 16:40:15 +02001421 all_skipped = false;
1422
1423 msg_cdbg("E");
1424 if (erasefn(flashctx, info->erase_start, erase_len))
Nico Huber6e61e0c2019-01-23 17:07:49 +01001425 goto _free_ret;
Richard Hughes842d6782021-01-15 09:48:12 +00001426 flashprog_progress_add(flashctx, erase_len);
Nico Huber7af0e792016-04-29 16:40:15 +02001427 if (check_erased_range(flashctx, info->erase_start, erase_len)) {
1428 msg_cerr("ERASE FAILED!\n");
Nico Huber6e61e0c2019-01-23 17:07:49 +01001429 goto _free_ret;
Nico Huber7af0e792016-04-29 16:40:15 +02001430 }
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001431 if (info->curcontents)
1432 memset(info->curcontents + info->erase_start, ERASED_VALUE(flashctx), erase_len);
Nico Huber6e61e0c2019-01-23 17:07:49 +01001433
1434 if (region_unaligned) {
Nico Huber3b9c86d2023-01-15 22:58:06 +01001435 if (write_range(flashctx, info->erase_start, erased_contents, backup_contents, erase_len, NULL))
1436 goto _free_ret;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001437 if (info->curcontents)
1438 memcpy(info->curcontents + info->erase_start, backup_contents, erase_len);
Nico Huber6e61e0c2019-01-23 17:07:49 +01001439 }
1440
1441 ret = 0;
1442
1443_free_ret:
1444 free(erased_contents);
1445 free(backup_contents);
1446 return ret;
Nico Huber7af0e792016-04-29 16:40:15 +02001447}
1448
1449/**
1450 * @brief Erases the included layout regions.
1451 *
1452 * If there is no layout set in the given flash context, the whole chip will
1453 * be erased.
1454 *
1455 * @param flashctx Flash context to be used.
Nico Huber7af0e792016-04-29 16:40:15 +02001456 * @return 0 on success,
1457 * 1 if all available erase functions failed.
1458 */
Nico Huber454f6132012-12-10 13:34:10 +00001459static int erase_by_layout(struct flashctx *const flashctx)
Nico Huber7af0e792016-04-29 16:40:15 +02001460{
1461 struct walk_info info = { 0 };
1462 return walk_by_layout(flashctx, &info, &erase_block);
1463}
1464
Nico Huber7af0e792016-04-29 16:40:15 +02001465/**
1466 * @brief Writes the included layout regions from a given image.
1467 *
1468 * If there is no layout set in the given flash context, the whole image
1469 * will be written.
1470 *
1471 * @param flashctx Flash context to be used.
1472 * @param curcontents A buffer of full chip size with current chip contents of included regions.
1473 * @param newcontents The new image to be written.
1474 * @return 0 on success,
1475 * 1 if anything has gone wrong.
1476 */
Nico Huber454f6132012-12-10 13:34:10 +00001477static int write_by_layout(struct flashctx *const flashctx,
1478 void *const curcontents, const void *const newcontents)
Nico Huber7af0e792016-04-29 16:40:15 +02001479{
1480 struct walk_info info;
1481 info.curcontents = curcontents;
1482 info.newcontents = newcontents;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001483 return walk_by_layout(flashctx, &info, erase_block);
Nico Huber7af0e792016-04-29 16:40:15 +02001484}
1485
1486/**
1487 * @brief Compares the included layout regions with content from a buffer.
1488 *
1489 * If there is no layout set in the given flash context, the whole chip's
1490 * contents will be compared.
1491 *
1492 * @param flashctx Flash context to be used.
Nico Huber74d09d42019-06-16 03:27:26 +02001493 * @param layout Flash layout information.
Nico Huber7af0e792016-04-29 16:40:15 +02001494 * @param curcontents A buffer of full chip size to read current chip contents into.
1495 * @param newcontents The new image to compare to.
1496 * @return 0 on success,
1497 * 1 if reading failed,
1498 * 3 if the contents don't match.
1499 */
Nico Huber74d09d42019-06-16 03:27:26 +02001500static int verify_by_layout(
1501 struct flashctx *const flashctx,
Nico Huberc3b02dc2023-08-12 01:13:45 +02001502 const struct flashprog_layout *const layout,
Nico Huber74d09d42019-06-16 03:27:26 +02001503 void *const curcontents, const uint8_t *const newcontents)
Nico Huber7af0e792016-04-29 16:40:15 +02001504{
Nico Huber5ca55232019-06-15 22:29:08 +02001505 const struct romentry *entry = NULL;
Nico Huber7af0e792016-04-29 16:40:15 +02001506
Richard Hughes842d6782021-01-15 09:48:12 +00001507 flashprog_progress_start_by_layout(flashctx, FLASHPROG_PROGRESS_READ, layout);
1508
Nico Huber5ca55232019-06-15 22:29:08 +02001509 while ((entry = layout_next_included(layout, entry))) {
1510 const chipoff_t region_start = entry->start;
1511 const chipsize_t region_len = entry->end - entry->start + 1;
Nico Huber7af0e792016-04-29 16:40:15 +02001512
1513 if (flashctx->chip->read(flashctx, curcontents + region_start, region_start, region_len))
1514 return 1;
1515 if (compare_range(newcontents + region_start, curcontents + region_start,
1516 region_start, region_len))
1517 return 3;
1518 }
Richard Hughes842d6782021-01-15 09:48:12 +00001519
1520 flashprog_progress_finish(flashctx);
1521
Nico Huber7af0e792016-04-29 16:40:15 +02001522 return 0;
1523}
1524
Stefan Tauner136388f2013-07-15 10:47:53 +00001525static void nonfatal_help_message(void)
Carl-Daniel Hailfinger42d38a92010-10-19 22:06:20 +00001526{
Stefan Taunera58f6e92014-05-10 09:25:44 +00001527 msg_gerr("Good, writing to the flash chip apparently didn't do anything.\n");
Stefan Tauner136388f2013-07-15 10:47:53 +00001528#if CONFIG_INTERNAL == 1
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +02001529 if (programmer == &programmer_internal)
Stefan Tauner136388f2013-07-15 10:47:53 +00001530 msg_gerr("This means we have to add special support for your board, programmer or flash\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +02001531 "chip. Please report this to the mailing list at flashprog@flashprog.org or\n"
1532 "on IRC (see https://www.flashprog.org/Contact for details), thanks!\n"
Stefan Tauner136388f2013-07-15 10:47:53 +00001533 "-------------------------------------------------------------------------------\n"
1534 "You may now reboot or simply leave the machine running.\n");
1535 else
1536#endif
1537 msg_gerr("Please check the connections (especially those to write protection pins) between\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +02001538 "the programmer and the flash chip. If you think the error is caused by flashprog\n"
1539 "please report this to the mailing list at flashprog@flashprog.org or on IRC\n"
1540 "(see https://www.flashprog.org/Contact for details), thanks!\n");
Carl-Daniel Hailfinger42d38a92010-10-19 22:06:20 +00001541}
1542
Edward O'Callaghanc72d20a2021-12-13 12:30:03 +11001543void emergency_help_message(void)
Carl-Daniel Hailfinger8ab49e72009-08-19 13:55:34 +00001544{
Stefan Tauner136388f2013-07-15 10:47:53 +00001545 msg_gerr("Your flash chip is in an unknown state.\n");
1546#if CONFIG_INTERNAL == 1
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +02001547 if (programmer == &programmer_internal)
Nico Huberc3b02dc2023-08-12 01:13:45 +02001548 msg_gerr("Get help on IRC (see https://www.flashprog.org/Contact) or mail\n"
1549 "flashprog@flashprog.org with the subject \"FAILED: <your board name>\"!\n"
Stefan Tauner136388f2013-07-15 10:47:53 +00001550 "-------------------------------------------------------------------------------\n"
1551 "DO NOT REBOOT OR POWEROFF!\n");
1552 else
1553#endif
Nico Huberc3b02dc2023-08-12 01:13:45 +02001554 msg_gerr("Please report this to the mailing list at flashprog@flashprog.org\n"
1555 "or on IRC (see https://www.flashprog.org/Contact for details), thanks!\n");
Carl-Daniel Hailfinger8ab49e72009-08-19 13:55:34 +00001556}
1557
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001558void list_programmers_linebreak(int startcol, int cols, int paren)
1559{
1560 const char *pname;
Carl-Daniel Hailfinger082c8b52011-08-15 19:54:20 +00001561 int pnamelen;
1562 int remaining = 0, firstline = 1;
Thomas Heijligen9163b812021-06-01 14:25:01 +02001563 size_t p;
Carl-Daniel Hailfinger082c8b52011-08-15 19:54:20 +00001564 int i;
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001565
Thomas Heijligend45cb592021-05-19 14:12:18 +02001566 for (p = 0; p < programmer_table_size; p++) {
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001567 pname = programmer_table[p]->name;
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001568 pnamelen = strlen(pname);
1569 if (remaining - pnamelen - 2 < 0) {
1570 if (firstline)
1571 firstline = 0;
1572 else
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001573 msg_ginfo("\n");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001574 for (i = 0; i < startcol; i++)
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001575 msg_ginfo(" ");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001576 remaining = cols - startcol;
1577 } else {
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001578 msg_ginfo(" ");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001579 remaining--;
1580 }
1581 if (paren && (p == 0)) {
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001582 msg_ginfo("(");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001583 remaining--;
1584 }
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001585 msg_ginfo("%s", pname);
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001586 remaining -= pnamelen;
Thomas Heijligend45cb592021-05-19 14:12:18 +02001587 if (p < programmer_table_size - 1) {
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001588 msg_ginfo(",");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001589 remaining--;
1590 } else {
1591 if (paren)
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001592 msg_ginfo(")");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001593 }
1594 }
1595}
1596
Nico Huber32fa5082026-01-26 18:26:49 +01001597int selfcheck_chip(const struct flashchip *const chip, const int idx)
1598{
1599 int ret = 0;
Nico Huber72d0ada2026-01-26 18:28:20 +01001600 char label[80];
Nico Huber32fa5082026-01-26 18:26:49 +01001601 const char *const name = chip->name != NULL ? chip->name : "unnamed";
1602
Nico Huber72d0ada2026-01-26 18:28:20 +01001603 if (idx >= 0)
1604 snprintf(label, sizeof(label), "#%d (%s)", idx, name);
1605 else
1606 snprintf(label, sizeof(label), "%s", name);
1607
Nico Huber11136c22023-05-01 12:00:09 +02001608 if (chip->vendor == NULL || chip->name == NULL || chip->bustype == BUS_NONE ||
1609 chip->id.type == ID_FIXME) {
Nico Huber32fa5082026-01-26 18:26:49 +01001610 ret = 1;
Nico Huber72d0ada2026-01-26 18:28:20 +01001611 msg_gerr("ERROR: Some field of flash chip %s is misconfigured.\n"
1612 "Please report a bug at flashprog@flashprog.org\n", label);
Nico Huber32fa5082026-01-26 18:26:49 +01001613 }
1614 if (chip->feature_bits &
1615 (FEATURE_4BA_ENTER | FEATURE_4BA_ENTER_WREN | FEATURE_4BA_ENTER_EAR7 |
1616 FEATURE_ANY_DUAL | FEATURE_ANY_QUAD)
1617 && !chip->prepare_access) {
Nico Huber72d0ada2026-01-26 18:28:20 +01001618 msg_gerr("ERROR: Flash chip %s misses chip\n"
Nico Huber32fa5082026-01-26 18:26:49 +01001619 "preparation function for 4BA and multi-i/o modes.\n"
Nico Huber72d0ada2026-01-26 18:28:20 +01001620 "Please report a bug at flashprog@flashprog.org\n", label);
Nico Huber32fa5082026-01-26 18:26:49 +01001621 ret = 1;
1622 }
1623 uint8_t zero_cycles[sizeof(chip->dummy_cycles)] = { 0 };
1624 if ((chip->feature_bits & (FEATURE_QPI_35_F5 | FEATURE_QPI_38_FF)) &&
1625 !memcmp(&chip->dummy_cycles, zero_cycles, sizeof(zero_cycles))) {
Nico Huber72d0ada2026-01-26 18:28:20 +01001626 msg_gerr("ERROR: Flash chip %s misses QPI dummy-cycle\n"
Nico Huber32fa5082026-01-26 18:26:49 +01001627 "settings. Please report a bug at flashprog@flashprog.org\n",
Nico Huber72d0ada2026-01-26 18:28:20 +01001628 label);
Nico Huber32fa5082026-01-26 18:26:49 +01001629 ret = 1;
1630 }
1631 if (chip->reg_bits.bp[0].reg != INVALID_REG &&
1632 (!chip->wp_write_cfg || !chip->wp_read_cfg ||
1633 !chip->wp_get_ranges || !chip->decode_range)) {
Nico Huber72d0ada2026-01-26 18:28:20 +01001634 msg_gerr("ERROR: Flash chip %s advertises block-protection\n"
Nico Huber32fa5082026-01-26 18:26:49 +01001635 "bits, but misses one or more write-protection functions.\n"
Nico Huber72d0ada2026-01-26 18:28:20 +01001636 "Please report a bug at flashprog@flashprog.org\n", label);
Nico Huber32fa5082026-01-26 18:26:49 +01001637 ret = 1;
1638 }
Nico Huber72d0ada2026-01-26 18:28:20 +01001639 if (selfcheck_eraseblocks(chip, label)) {
Nico Huber32fa5082026-01-26 18:26:49 +01001640 ret = 1;
1641 }
1642
1643 return ret;
1644}
1645
Carl-Daniel Hailfinger552420b2009-12-24 02:15:55 +00001646int selfcheck(void)
1647{
Stefan Tauner96658be2014-05-26 22:05:31 +00001648 unsigned int i;
Stefan Taunera6d96482012-12-26 19:51:23 +00001649 int ret = 0;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +00001650
Thomas Heijligend45cb592021-05-19 14:12:18 +02001651 for (i = 0; i < programmer_table_size; i++) {
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001652 const struct programmer_entry *const p = programmer_table[i];
1653 if (p == NULL) {
1654 msg_gerr("Programmer with index %d is NULL instead of a valid pointer!\n", i);
1655 ret = 1;
1656 continue;
1657 }
1658 if (p->name == NULL) {
Stefan Taunera6d96482012-12-26 19:51:23 +00001659 msg_gerr("All programmers need a valid name, but the one with index %d does not!\n", i);
1660 ret = 1;
1661 /* This might hide other problems with this programmer, but allows for better error
1662 * messages below without jumping through hoops. */
1663 continue;
1664 }
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001665 switch (p->type) {
Stefan Tauneraf358d62012-12-27 18:40:26 +00001666 case USB:
1667 case PCI:
1668 case OTHER:
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001669 if (p->devs.note == NULL) {
1670 if (strcmp("internal", p->name) == 0)
Stefan Tauneraf358d62012-12-27 18:40:26 +00001671 break; /* This one has its device list stored separately. */
1672 msg_gerr("Programmer %s has neither a device list nor a textual description!\n",
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001673 p->name);
Stefan Tauneraf358d62012-12-27 18:40:26 +00001674 ret = 1;
1675 }
1676 break;
1677 default:
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001678 msg_gerr("Programmer %s does not have a valid type set!\n", p->name);
Stefan Tauneraf358d62012-12-27 18:40:26 +00001679 ret = 1;
1680 break;
1681 }
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001682 if (p->init == NULL) {
1683 msg_gerr("Programmer %s does not have a valid init function!\n", p->name);
Stefan Taunera6d96482012-12-26 19:51:23 +00001684 ret = 1;
1685 }
Stefan Taunera6d96482012-12-26 19:51:23 +00001686 }
Stefan Tauner96658be2014-05-26 22:05:31 +00001687
1688 /* It would be favorable if we could check for the correct layout (especially termination) of various
1689 * constant arrays: flashchips, chipset_enables, board_matches, boards_known, laptops_known.
1690 * They are all defined as externs in this compilation unit so we don't know their sizes which vary
1691 * depending on compiler flags, e.g. the target architecture, and can sometimes be 0.
1692 * For 'flashchips' we export the size explicitly to work around this and to be able to implement the
1693 * checks below. */
Stefan Tauner6697f712014-08-06 15:09:15 +00001694 if (flashchips_size <= 1 || flashchips[flashchips_size - 1].name != NULL) {
Stefan Tauner7bcacb12011-05-26 01:35:19 +00001695 msg_gerr("Flashchips table miscompilation!\n");
1696 ret = 1;
Stefan Tauner96658be2014-05-26 22:05:31 +00001697 } else {
1698 for (i = 0; i < flashchips_size - 1; i++) {
Nico Huber32fa5082026-01-26 18:26:49 +01001699 if (selfcheck_chip(&flashchips[i], i))
Stefan Tauner96658be2014-05-26 22:05:31 +00001700 ret = 1;
Stefan Tauner96658be2014-05-26 22:05:31 +00001701 }
Stefan Tauner7bcacb12011-05-26 01:35:19 +00001702 }
Stefan Tauner7bcacb12011-05-26 01:35:19 +00001703
Stefan Tauner600576b2014-06-12 22:57:36 +00001704#if CONFIG_INTERNAL == 1
1705 ret |= selfcheck_board_enables();
1706#endif
1707
Stefan Tauner96658be2014-05-26 22:05:31 +00001708 /* TODO: implement similar sanity checks for other arrays where deemed necessary. */
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +00001709 return ret;
Carl-Daniel Hailfinger552420b2009-12-24 02:15:55 +00001710}
1711
Edward O'Callaghanacb24d42021-04-15 13:44:39 +10001712/* FIXME: This function signature needs to be improved once prepare_flash_access()
1713 * has a better function signature.
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001714 */
Jacob Garberbeeb8bc2019-06-21 15:24:17 -06001715static int chip_safety_check(const struct flashctx *flash, int force,
1716 int read_it, int write_it, int erase_it, int verify_it)
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001717{
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +00001718 const struct flashchip *chip = flash->chip;
1719
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001720 if (!programmer_may_write && (write_it || erase_it)) {
1721 msg_perr("Write/erase is not working yet on your programmer in "
1722 "its current configuration.\n");
1723 /* --force is the wrong approach, but it's the best we can do
1724 * until the generic programmer parameter parser is merged.
1725 */
1726 if (!force)
1727 return 1;
1728 msg_cerr("Continuing anyway.\n");
1729 }
1730
1731 if (read_it || erase_it || write_it || verify_it) {
1732 /* Everything needs read. */
Stefan Tauner6455dff2014-05-26 00:36:24 +00001733 if (chip->tested.read == BAD) {
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001734 msg_cerr("Read is not working on this chip. ");
1735 if (!force)
1736 return 1;
1737 msg_cerr("Continuing anyway.\n");
1738 }
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +00001739 if (!chip->read) {
Nico Huberc3b02dc2023-08-12 01:13:45 +02001740 msg_cerr("flashprog has no read function for this "
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001741 "flash chip.\n");
1742 return 1;
1743 }
1744 }
1745 if (erase_it || write_it) {
1746 /* Write needs erase. */
Stefan Tauner6455dff2014-05-26 00:36:24 +00001747 if (chip->tested.erase == NA) {
1748 msg_cerr("Erase is not possible on this chip.\n");
1749 return 1;
1750 }
1751 if (chip->tested.erase == BAD) {
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001752 msg_cerr("Erase is not working on this chip. ");
1753 if (!force)
1754 return 1;
1755 msg_cerr("Continuing anyway.\n");
1756 }
Sylvain "ythier" Hitier9db45512011-07-04 07:27:17 +00001757 if(count_usable_erasers(flash) == 0) {
Nico Huberc3b02dc2023-08-12 01:13:45 +02001758 msg_cerr("flashprog has no erase function for this "
Stefan Tauner5368dca2011-07-01 00:19:12 +00001759 "flash chip.\n");
1760 return 1;
1761 }
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001762 }
1763 if (write_it) {
Stefan Tauner6455dff2014-05-26 00:36:24 +00001764 if (chip->tested.write == NA) {
1765 msg_cerr("Write is not possible on this chip.\n");
1766 return 1;
1767 }
1768 if (chip->tested.write == BAD) {
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001769 msg_cerr("Write is not working on this chip. ");
1770 if (!force)
1771 return 1;
1772 msg_cerr("Continuing anyway.\n");
1773 }
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +00001774 if (!chip->write) {
Nico Huberc3b02dc2023-08-12 01:13:45 +02001775 msg_cerr("flashprog has no write function for this "
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001776 "flash chip.\n");
1777 return 1;
1778 }
1779 }
1780 return 0;
1781}
1782
Nico Huber305f4172013-06-14 11:55:26 +02001783int prepare_flash_access(struct flashctx *const flash,
1784 const bool read_it, const bool write_it,
1785 const bool erase_it, const bool verify_it)
Nico Huber454f6132012-12-10 13:34:10 +00001786{
1787 if (chip_safety_check(flash, flash->flags.force, read_it, write_it, erase_it, verify_it)) {
1788 msg_cerr("Aborting.\n");
1789 return 1;
1790 }
1791
Nico Huber3ac761c2023-01-16 02:43:17 +01001792 if (layout_sanity_checks(flash, write_it)) {
Nico Huber454f6132012-12-10 13:34:10 +00001793 msg_cerr("Requested regions can not be handled. Aborting.\n");
1794 return 1;
1795 }
1796
Nico Huber5469c152026-02-12 22:56:52 +01001797 if (flash->mst.common->adapt_voltage) {
1798 if (flash->mst.common->adapt_voltage(flash->mst.common,
1799 flash->chip->voltage.min, flash->chip->voltage.max))
1800 return 1;
1801 }
1802
Nico Huber901fb952023-01-11 23:24:23 +01001803 if (flash->chip->prepare_access && flash->chip->prepare_access(flash, PREPARE_FULL))
1804 return 1;
1805
Nikolai Artemiev4ad48642020-11-05 13:54:27 +11001806 /* Initialize chip_restore_fn_count before chip unlock calls. */
1807 flash->chip_restore_fn_count = 0;
1808
Nico Huber454f6132012-12-10 13:34:10 +00001809 /* Given the existence of read locks, we want to unlock for read,
1810 erase and write. */
1811 if (flash->chip->unlock)
1812 flash->chip->unlock(flash);
1813
1814 return 0;
1815}
1816
Nico Huber305f4172013-06-14 11:55:26 +02001817void finalize_flash_access(struct flashctx *const flash)
Nico Huber454f6132012-12-10 13:34:10 +00001818{
Nikolai Artemiev4ad48642020-11-05 13:54:27 +11001819 deregister_chip_restore(flash);
Nico Huber901fb952023-01-11 23:24:23 +01001820 if (flash->chip->finish_access)
1821 flash->chip->finish_access(flash);
Nico Huber454f6132012-12-10 13:34:10 +00001822}
1823
1824/**
Nico Huberc3b02dc2023-08-12 01:13:45 +02001825 * @addtogroup flashprog-flash
Nico Huber454f6132012-12-10 13:34:10 +00001826 * @{
1827 */
1828
1829/**
1830 * @brief Erase the specified ROM chip.
1831 *
1832 * If a layout is set in the given flash context, only included regions
1833 * will be erased.
1834 *
1835 * @param flashctx The context of the flash chip to erase.
1836 * @return 0 on success.
1837 */
Nico Huberc3b02dc2023-08-12 01:13:45 +02001838int flashprog_flash_erase(struct flashctx *const flashctx)
Nico Huber454f6132012-12-10 13:34:10 +00001839{
1840 if (prepare_flash_access(flashctx, false, false, true, false))
1841 return 1;
1842
1843 const int ret = erase_by_layout(flashctx);
1844
1845 finalize_flash_access(flashctx);
1846
1847 return ret;
1848}
1849
Nico Huberc3b02dc2023-08-12 01:13:45 +02001850/** @} */ /* end flashprog-flash */
Nico Huber454f6132012-12-10 13:34:10 +00001851
1852/**
Nico Huberc3b02dc2023-08-12 01:13:45 +02001853 * @defgroup flashprog-ops Operations
Nico Huber454f6132012-12-10 13:34:10 +00001854 * @{
1855 */
1856
1857/**
1858 * @brief Read the current image from the specified ROM chip.
1859 *
1860 * If a layout is set in the specified flash context, only included regions
1861 * will be read.
1862 *
1863 * @param flashctx The context of the flash chip.
1864 * @param buffer Target buffer to write image to.
1865 * @param buffer_len Size of target buffer in bytes.
1866 * @return 0 on success,
1867 * 2 if buffer_len is too short for the flash chip's contents,
1868 * or 1 on any other failure.
1869 */
Nico Huberc3b02dc2023-08-12 01:13:45 +02001870int flashprog_image_read(struct flashctx *const flashctx, void *const buffer, const size_t buffer_len)
Nico Huber454f6132012-12-10 13:34:10 +00001871{
1872 const size_t flash_size = flashctx->chip->total_size * 1024;
1873
1874 if (flash_size > buffer_len)
1875 return 2;
1876
1877 if (prepare_flash_access(flashctx, true, false, false, false))
1878 return 1;
1879
1880 msg_cinfo("Reading flash... ");
1881
1882 int ret = 1;
1883 if (read_by_layout(flashctx, buffer)) {
1884 msg_cerr("Read operation failed!\n");
1885 msg_cinfo("FAILED.\n");
1886 goto _finalize_ret;
1887 }
1888 msg_cinfo("done.\n");
1889 ret = 0;
1890
1891_finalize_ret:
1892 finalize_flash_access(flashctx);
1893 return ret;
1894}
1895
1896static void combine_image_by_layout(const struct flashctx *const flashctx,
1897 uint8_t *const newcontents, const uint8_t *const oldcontents)
1898{
Nico Huberc3b02dc2023-08-12 01:13:45 +02001899 const struct flashprog_layout *const layout = get_layout(flashctx);
Nico Huber3d7b1e32018-12-22 00:53:14 +01001900 const struct romentry *included;
1901 chipoff_t start = 0;
Nico Huber454f6132012-12-10 13:34:10 +00001902
Nico Huber3d7b1e32018-12-22 00:53:14 +01001903 while ((included = layout_next_included_region(layout, start))) {
1904 if (included->start > start) {
1905 /* copy everything up to the start of this included region */
1906 memcpy(newcontents + start, oldcontents + start, included->start - start);
1907 }
1908 /* skip this included region */
1909 start = included->end + 1;
1910 if (start == 0)
1911 return;
Nico Huber454f6132012-12-10 13:34:10 +00001912 }
Nico Huber3d7b1e32018-12-22 00:53:14 +01001913
1914 /* copy the rest of the chip */
1915 const chipsize_t copy_len = flashctx->chip->total_size * 1024 - start;
1916 memcpy(newcontents + start, oldcontents + start, copy_len);
Nico Huber454f6132012-12-10 13:34:10 +00001917}
1918
1919/**
1920 * @brief Write the specified image to the ROM chip.
1921 *
1922 * If a layout is set in the specified flash context, only erase blocks
1923 * containing included regions will be touched.
1924 *
1925 * @param flashctx The context of the flash chip.
Nico Huber1b172f22017-06-19 12:35:24 +02001926 * @param buffer Source buffer to read image from (may be altered for full verification).
Nico Huber454f6132012-12-10 13:34:10 +00001927 * @param buffer_len Size of source buffer in bytes.
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001928 * @param refbuffer If given, assume flash chip contains same data as `refbuffer`.
Nico Huber454f6132012-12-10 13:34:10 +00001929 * @return 0 on success,
1930 * 4 if buffer_len doesn't match the size of the flash chip,
1931 * 3 if write was tried but nothing has changed,
1932 * 2 if write failed and flash contents changed,
1933 * or 1 on any other failure.
1934 */
Nico Huberc3b02dc2023-08-12 01:13:45 +02001935int flashprog_image_write(struct flashctx *const flashctx, void *const buffer, const size_t buffer_len,
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001936 const void *const refbuffer)
Nico Huber454f6132012-12-10 13:34:10 +00001937{
1938 const size_t flash_size = flashctx->chip->total_size * 1024;
1939 const bool verify_all = flashctx->flags.verify_whole_chip;
1940 const bool verify = flashctx->flags.verify_after_write;
Nico Huberc3b02dc2023-08-12 01:13:45 +02001941 const struct flashprog_layout *const verify_layout =
Nico Huber74d09d42019-06-16 03:27:26 +02001942 verify_all ? get_default_layout(flashctx) : get_layout(flashctx);
Nico Huber454f6132012-12-10 13:34:10 +00001943
1944 if (buffer_len != flash_size)
1945 return 4;
1946
1947 int ret = 1;
1948
1949 uint8_t *const newcontents = buffer;
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001950 const uint8_t *const refcontents = refbuffer;
Nico Huber454f6132012-12-10 13:34:10 +00001951 uint8_t *const curcontents = malloc(flash_size);
1952 uint8_t *oldcontents = NULL;
1953 if (verify_all)
1954 oldcontents = malloc(flash_size);
1955 if (!curcontents || (verify_all && !oldcontents)) {
1956 msg_gerr("Out of memory!\n");
1957 goto _free_ret;
1958 }
1959
1960#if CONFIG_INTERNAL == 1
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +02001961 if (programmer == &programmer_internal && cb_check_image(newcontents, flash_size) < 0) {
Nico Huber454f6132012-12-10 13:34:10 +00001962 if (flashctx->flags.force_boardmismatch) {
1963 msg_pinfo("Proceeding anyway because user forced us to.\n");
1964 } else {
1965 msg_perr("Aborting. You can override this with "
1966 "-p internal:boardmismatch=force.\n");
1967 goto _free_ret;
1968 }
1969 }
1970#endif
1971
1972 if (prepare_flash_access(flashctx, false, true, false, verify))
1973 goto _free_ret;
1974
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001975 /* If given, assume flash chip contains same data as `refcontents`. */
1976 if (refcontents) {
1977 msg_cinfo("Assuming old flash chip contents as ref-file...\n");
1978 memcpy(curcontents, refcontents, flash_size);
1979 if (oldcontents)
1980 memcpy(oldcontents, refcontents, flash_size);
Nico Huber454f6132012-12-10 13:34:10 +00001981 } else {
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001982 /*
1983 * Read the whole chip to be able to check whether regions need to be
1984 * erased and to give better diagnostics in case write fails.
1985 * The alternative is to read only the regions which are to be
1986 * preserved, but in that case we might perform unneeded erase which
1987 * takes time as well.
1988 */
1989 msg_cinfo("Reading old flash chip contents... ");
1990 if (verify_all) {
Richard Hughes842d6782021-01-15 09:48:12 +00001991 if (flashprog_read_range(flashctx, oldcontents, 0, flash_size)) {
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001992 msg_cinfo("FAILED.\n");
1993 goto _finalize_ret;
1994 }
1995 memcpy(curcontents, oldcontents, flash_size);
1996 } else {
1997 if (read_by_layout(flashctx, curcontents)) {
1998 msg_cinfo("FAILED.\n");
1999 goto _finalize_ret;
2000 }
Nico Huber454f6132012-12-10 13:34:10 +00002001 }
Paul Kocialkowskif701f342018-01-15 01:10:36 +03002002 msg_cinfo("done.\n");
Nico Huber454f6132012-12-10 13:34:10 +00002003 }
Nico Huber454f6132012-12-10 13:34:10 +00002004
2005 if (write_by_layout(flashctx, curcontents, newcontents)) {
2006 msg_cerr("Uh oh. Erase/write failed. ");
2007 ret = 2;
2008 if (verify_all) {
2009 msg_cerr("Checking if anything has changed.\n");
2010 msg_cinfo("Reading current flash chip contents... ");
Richard Hughes842d6782021-01-15 09:48:12 +00002011 if (!flashprog_read_range(flashctx, curcontents, 0, flash_size)) {
Nico Huber454f6132012-12-10 13:34:10 +00002012 msg_cinfo("done.\n");
2013 if (!memcmp(oldcontents, curcontents, flash_size)) {
2014 nonfatal_help_message();
2015 goto _finalize_ret;
2016 }
2017 msg_cerr("Apparently at least some data has changed.\n");
2018 } else
2019 msg_cerr("Can't even read anymore!\n");
2020 emergency_help_message();
2021 goto _finalize_ret;
2022 } else {
2023 msg_cerr("\n");
2024 }
2025 emergency_help_message();
2026 goto _finalize_ret;
2027 }
2028
2029 /* Verify only if we actually changed something. */
2030 if (verify && !all_skipped) {
Nico Huber454f6132012-12-10 13:34:10 +00002031 msg_cinfo("Verifying flash... ");
2032
Nico Huber74d09d42019-06-16 03:27:26 +02002033 if (verify_all)
Nico Huber454f6132012-12-10 13:34:10 +00002034 combine_image_by_layout(flashctx, newcontents, oldcontents);
Nico Huber74d09d42019-06-16 03:27:26 +02002035 ret = verify_by_layout(flashctx, verify_layout, curcontents, newcontents);
Nico Huber454f6132012-12-10 13:34:10 +00002036 /* If we tried to write, and verification now fails, we
2037 might have an emergency situation. */
2038 if (ret)
2039 emergency_help_message();
2040 else
2041 msg_cinfo("VERIFIED.\n");
2042 } else {
2043 /* We didn't change anything. */
2044 ret = 0;
2045 }
2046
2047_finalize_ret:
2048 finalize_flash_access(flashctx);
2049_free_ret:
2050 free(oldcontents);
2051 free(curcontents);
2052 return ret;
2053}
2054
2055/**
2056 * @brief Verify the ROM chip's contents with the specified image.
2057 *
2058 * If a layout is set in the specified flash context, only included regions
2059 * will be verified.
2060 *
2061 * @param flashctx The context of the flash chip.
2062 * @param buffer Source buffer to verify with.
2063 * @param buffer_len Size of source buffer in bytes.
2064 * @return 0 on success,
2065 * 3 if the chip's contents don't match,
2066 * 2 if buffer_len doesn't match the size of the flash chip,
2067 * or 1 on any other failure.
2068 */
Nico Huberc3b02dc2023-08-12 01:13:45 +02002069int flashprog_image_verify(struct flashctx *const flashctx, const void *const buffer, const size_t buffer_len)
Nico Huber454f6132012-12-10 13:34:10 +00002070{
Nico Huberc3b02dc2023-08-12 01:13:45 +02002071 const struct flashprog_layout *const layout = get_layout(flashctx);
Nico Huber454f6132012-12-10 13:34:10 +00002072 const size_t flash_size = flashctx->chip->total_size * 1024;
2073
2074 if (buffer_len != flash_size)
2075 return 2;
2076
2077 const uint8_t *const newcontents = buffer;
2078 uint8_t *const curcontents = malloc(flash_size);
2079 if (!curcontents) {
2080 msg_gerr("Out of memory!\n");
2081 return 1;
2082 }
2083
2084 int ret = 1;
2085
2086 if (prepare_flash_access(flashctx, false, false, false, true))
2087 goto _free_ret;
2088
2089 msg_cinfo("Verifying flash... ");
Nico Huber74d09d42019-06-16 03:27:26 +02002090 ret = verify_by_layout(flashctx, layout, curcontents, newcontents);
Nico Huber454f6132012-12-10 13:34:10 +00002091 if (!ret)
2092 msg_cinfo("VERIFIED.\n");
2093
2094 finalize_flash_access(flashctx);
2095_free_ret:
2096 free(curcontents);
2097 return ret;
2098}
2099
Nico Huberc3b02dc2023-08-12 01:13:45 +02002100/** @} */ /* end flashprog-ops */