blob: 30e56684a880d393ad3993628b7defe695345f06 [file] [log] [blame]
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +00001/*
Uwe Hermannd1107642007-08-29 17:52:32 +00002 * This file is part of the flashrom project.
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +00003 *
Uwe Hermannd22a1d42007-09-09 20:21:05 +00004 * Copyright (C) 2000 Silicon Integrated System Corporation
5 * Copyright (C) 2004 Tyan Corp <yhlu@tyan.com>
Uwe Hermannc7e8a0c2009-05-19 14:14:21 +00006 * Copyright (C) 2005-2008 coresystems GmbH
Carl-Daniel Hailfinger03b4e712009-05-08 12:49:03 +00007 * Copyright (C) 2008,2009 Carl-Daniel Hailfinger
Nico Huber7af0e792016-04-29 16:40:15 +02008 * Copyright (C) 2016 secunet Security Networks AG
9 * (Written by Nico Huber <nico.huber@secunet.com> for secunet)
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +000010 *
Uwe Hermannd1107642007-08-29 17:52:32 +000011 * This program is free software; you can redistribute it and/or modify
12 * it under the terms of the GNU General Public License as published by
13 * the Free Software Foundation; either version 2 of the License, or
14 * (at your option) any later version.
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +000015 *
Uwe Hermannd1107642007-08-29 17:52:32 +000016 * This program is distributed in the hope that it will be useful,
17 * but WITHOUT ANY WARRANTY; without even the implied warranty of
18 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
19 * GNU General Public License for more details.
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +000020 */
21
Felix Singerf25447e2022-08-19 02:44:28 +020022#include <stdbool.h>
Carl-Daniel Hailfinger831e8f42010-05-30 22:24:40 +000023#include <stdio.h>
Stefan Reinauer018aca82006-11-21 23:48:51 +000024#include <sys/types.h>
Ronald G. Minnichceec4202003-07-25 04:37:41 +000025#include <string.h>
Stefan Tauner16687702015-12-25 21:59:45 +000026#include <unistd.h>
Ronald G. Minnicheaab50b2003-09-12 22:41:53 +000027#include <stdlib.h>
Stefan Tauner363fd7e2013-04-07 13:08:30 +000028#include <errno.h>
Carl-Daniel Hailfingerc2441382010-11-09 22:00:31 +000029#include <ctype.h>
Edward O'Callaghan3b64d812022-08-12 13:07:51 +100030
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +000031#include "flash.h"
Carl-Daniel Hailfinger08454642009-06-15 14:14:48 +000032#include "flashchips.h"
Carl-Daniel Hailfinger5b997c32010-07-27 22:41:39 +000033#include "programmer.h"
Thomas Heijligen74b4aa02021-12-14 17:52:30 +010034#include "hwaccess_physmap.h"
Nico Huberfe34d2a2017-11-10 21:10:20 +010035#include "chipdrivers.h"
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +000036
Nico Huberc3b02dc2023-08-12 01:13:45 +020037const char flashprog_version[] = FLASHPROG_VERSION;
Nico Huberbcb2e5a2012-12-30 01:23:17 +000038const char *chip_to_probe = NULL;
Carl-Daniel Hailfinger66ef4e52009-12-13 22:28:00 +000039
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +020040static const struct programmer_entry *programmer = NULL;
Nico Huber6a2ebeb2022-08-26 11:36:48 +020041static char *programmer_param = NULL;
Stefan Reinauer70385642007-04-06 11:58:03 +000042
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +000043/* If nonzero, used as the start address of bottom-aligned flash. */
44unsigned long flashbase;
Carl-Daniel Hailfinger66ef4e52009-12-13 22:28:00 +000045
Carl-Daniel Hailfingerd1be52d2010-07-03 12:14:25 +000046/* Is writing allowed with this programmer? */
Felix Singer980d6b82022-08-19 02:48:15 +020047bool programmer_may_write;
Carl-Daniel Hailfingerd1be52d2010-07-03 12:14:25 +000048
Carl-Daniel Hailfinger2bee8cf2010-11-10 15:25:18 +000049#define SHUTDOWN_MAXFN 32
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000050static int shutdown_fn_count = 0;
Nico Huber454f6132012-12-10 13:34:10 +000051/** @private */
Richard Hughes93e16252018-12-19 11:54:47 +000052static struct shutdown_func_data {
David Hendricks8bb20212011-06-14 01:35:36 +000053 int (*func) (void *data);
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000054 void *data;
Richard Hughes93e16252018-12-19 11:54:47 +000055} shutdown_fn[SHUTDOWN_MAXFN];
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +000056/* Initialize to 0 to make sure nobody registers a shutdown function before
57 * programmer init.
58 */
Felix Singerf25447e2022-08-19 02:44:28 +020059static bool may_register_shutdown = false;
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000060
Stefan Taunerc4f44df2013-08-12 22:58:43 +000061/* Did we change something or was every erase/write skipped (if any)? */
62static bool all_skipped = true;
63
Carl-Daniel Hailfinger63fd9022011-12-14 22:25:15 +000064static int check_block_eraser(const struct flashctx *flash, int k, int log);
Stefan Tauner5368dca2011-07-01 00:19:12 +000065
Stefan Tauner2a1ed772014-08-31 00:09:21 +000066int shutdown_free(void *data)
67{
68 free(data);
69 return 0;
70}
71
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000072/* Register a function to be executed on programmer shutdown.
73 * The advantage over atexit() is that you can supply a void pointer which will
74 * be used as parameter to the registered function upon programmer shutdown.
75 * This pointer can point to arbitrary data used by said function, e.g. undo
76 * information for GPIO settings etc. If unneeded, set data=NULL.
77 * Please note that the first (void *data) belongs to the function signature of
78 * the function passed as first parameter.
79 */
David Hendricks8bb20212011-06-14 01:35:36 +000080int register_shutdown(int (*function) (void *data), void *data)
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000081{
82 if (shutdown_fn_count >= SHUTDOWN_MAXFN) {
Carl-Daniel Hailfinger9f5f2152010-06-04 23:20:21 +000083 msg_perr("Tried to register more than %i shutdown functions.\n",
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000084 SHUTDOWN_MAXFN);
85 return 1;
86 }
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +000087 if (!may_register_shutdown) {
88 msg_perr("Tried to register a shutdown function before "
89 "programmer init.\n");
90 return 1;
91 }
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000092 shutdown_fn[shutdown_fn_count].func = function;
93 shutdown_fn[shutdown_fn_count].data = data;
94 shutdown_fn_count++;
95
96 return 0;
97}
98
Nikolai Artemiev4ad48642020-11-05 13:54:27 +110099int register_chip_restore(chip_restore_fn_cb_t func,
100 struct flashctx *flash, uint8_t status)
101{
102 if (flash->chip_restore_fn_count >= MAX_CHIP_RESTORE_FUNCTIONS) {
103 msg_perr("Tried to register more than %i chip restore"
104 " functions.\n", MAX_CHIP_RESTORE_FUNCTIONS);
105 return 1;
106 }
107 flash->chip_restore_fn[flash->chip_restore_fn_count].func = func;
108 flash->chip_restore_fn[flash->chip_restore_fn_count].status = status;
109 flash->chip_restore_fn_count++;
110
111 return 0;
112}
113
114static int deregister_chip_restore(struct flashctx *flash)
115{
116 int rc = 0;
117
118 while (flash->chip_restore_fn_count > 0) {
119 int i = --flash->chip_restore_fn_count;
120 rc |= flash->chip_restore_fn[i].func(
121 flash, flash->chip_restore_fn[i].status);
122 }
123
124 return rc;
125}
126
Nico Huber2b66ad92023-01-11 20:15:15 +0100127int programmer_init(struct flashprog_programmer *const prog)
Uwe Hermann09e04f72009-05-16 22:36:00 +0000128{
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000129 int ret;
Carl-Daniel Hailfinger2e681602011-09-08 00:00:29 +0000130
Nico Huber2b66ad92023-01-11 20:15:15 +0100131 if (prog == NULL || prog->driver == NULL) {
Carl-Daniel Hailfinger2e681602011-09-08 00:00:29 +0000132 msg_perr("Invalid programmer specified!\n");
133 return -1;
134 }
Nico Huber2b66ad92023-01-11 20:15:15 +0100135 programmer = prog->driver;
136 programmer_param = prog->param;
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000137 /* Initialize all programmer specific data. */
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000138 /* Default to top aligned flash at 4 GB. */
139 flashbase = 0;
140 /* Registering shutdown functions is now allowed. */
Felix Singerf25447e2022-08-19 02:44:28 +0200141 may_register_shutdown = true;
Carl-Daniel Hailfingerd1be52d2010-07-03 12:14:25 +0000142 /* Default to allowing writes. Broken programmers set this to 0. */
Felix Singer980d6b82022-08-19 02:48:15 +0200143 programmer_may_write = true;
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000144
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +0200145 msg_pdbg("Initializing %s programmer\n", programmer->name);
Nico Hubere3a26882023-01-11 21:45:51 +0100146 ret = programmer->init(prog);
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000147 if (programmer_param && strlen(programmer_param)) {
Carl-Daniel Hailfinger20a36ba2013-08-13 07:09:57 +0000148 if (ret != 0) {
149 /* It is quite possible that any unhandled programmer parameter would have been valid,
150 * but an error in actual programmer init happened before the parameter was evaluated.
151 */
152 msg_pwarn("Unhandled programmer parameters (possibly due to another failure): %s\n",
153 programmer_param);
154 } else {
155 /* Actual programmer init was successful, but the user specified an invalid or unusable
156 * (for the current programmer configuration) parameter.
157 */
158 msg_perr("Unhandled programmer parameters: %s\n", programmer_param);
159 msg_perr("Aborting.\n");
160 ret = ERROR_FATAL;
161 }
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000162 }
Nico Huber6a2ebeb2022-08-26 11:36:48 +0200163 programmer_param = NULL;
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000164 return ret;
Uwe Hermann09e04f72009-05-16 22:36:00 +0000165}
166
Stefan Tauner20da4aa2014-05-07 22:07:23 +0000167/** Calls registered shutdown functions and resets internal programmer-related variables.
168 * Calling it is safe even without previous initialization, but further interactions with programmer support
169 * require a call to programmer_init() (afterwards).
170 *
171 * @return The OR-ed result values of all shutdown functions (i.e. 0 on success). */
Nico Huber2b66ad92023-01-11 20:15:15 +0100172int programmer_shutdown(struct flashprog_programmer *const prog)
Uwe Hermann09e04f72009-05-16 22:36:00 +0000173{
David Hendricks8bb20212011-06-14 01:35:36 +0000174 int ret = 0;
175
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000176 /* Registering shutdown functions is no longer allowed. */
Felix Singerf25447e2022-08-19 02:44:28 +0200177 may_register_shutdown = false;
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000178 while (shutdown_fn_count > 0) {
179 int i = --shutdown_fn_count;
David Hendricks8bb20212011-06-14 01:35:36 +0000180 ret |= shutdown_fn[i].func(shutdown_fn[i].data);
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000181 }
Carl-Daniel Hailfingera5bcbce2014-07-19 22:03:29 +0000182 registered_master_count = 0;
Stefan Taunere34e3e82013-01-01 00:06:51 +0000183
David Hendricks8bb20212011-06-14 01:35:36 +0000184 return ret;
Uwe Hermann09e04f72009-05-16 22:36:00 +0000185}
186
Stefan Taunerf80419c2014-05-02 15:41:42 +0000187void programmer_delay(unsigned int usecs)
Carl-Daniel Hailfingerca8bfc62009-06-05 17:48:08 +0000188{
Edward O'Callaghan56684d92022-09-07 10:47:45 +1000189 if (usecs > 0) {
190 if (programmer->delay)
191 programmer->delay(usecs);
192 else
193 internal_delay(usecs);
194 }
Carl-Daniel Hailfingerca8bfc62009-06-05 17:48:08 +0000195}
196
Nico Hubercdcfda22023-04-29 13:29:33 +0200197static int read_memmapped_chunk(struct flashctx *flash, uint8_t *buf, unsigned int start, unsigned int len)
Carl-Daniel Hailfinger03b4e712009-05-08 12:49:03 +0000198{
Carl-Daniel Hailfinger8a3c60c2011-12-18 15:01:24 +0000199 chip_readn(flash, buf, flash->virtual_memory + start, len);
Carl-Daniel Hailfinger03b4e712009-05-08 12:49:03 +0000200 return 0;
201}
Nico Hubercdcfda22023-04-29 13:29:33 +0200202int read_memmapped(struct flashctx *flash, uint8_t *buf, unsigned int start, int unsigned len)
203{
204 return flashprog_read_chunked(flash, buf, start, len, MAX_DATA_READ_UNLIMITED, read_memmapped_chunk);
205}
Carl-Daniel Hailfinger03b4e712009-05-08 12:49:03 +0000206
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000207/* This is a somewhat hacked function similar in some ways to strtok().
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000208 * It will look for needle with a subsequent '=' in haystack, return a copy of
209 * needle and remove everything from the first occurrence of needle to the next
210 * delimiter from haystack.
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000211 */
Nico Huber6a2ebeb2022-08-26 11:36:48 +0200212static char *extract_param(char *const *haystack, const char *needle, const char *delim)
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000213{
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000214 char *param_pos, *opt_pos, *rest;
215 char *opt = NULL;
216 int optlen;
Carl-Daniel Hailfinger27023762010-04-28 15:22:14 +0000217 int needlelen;
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000218
Carl-Daniel Hailfinger27023762010-04-28 15:22:14 +0000219 needlelen = strlen(needle);
220 if (!needlelen) {
221 msg_gerr("%s: empty needle! Please report a bug at "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200222 "flashprog@flashprog.org\n", __func__);
Carl-Daniel Hailfinger27023762010-04-28 15:22:14 +0000223 return NULL;
224 }
225 /* No programmer parameters given. */
226 if (*haystack == NULL)
227 return NULL;
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000228 param_pos = strstr(*haystack, needle);
229 do {
230 if (!param_pos)
231 return NULL;
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000232 /* Needle followed by '='? */
233 if (param_pos[needlelen] == '=') {
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000234 /* Beginning of the string? */
235 if (param_pos == *haystack)
236 break;
237 /* After a delimiter? */
238 if (strchr(delim, *(param_pos - 1)))
239 break;
240 }
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000241 /* Continue searching. */
242 param_pos++;
243 param_pos = strstr(param_pos, needle);
244 } while (1);
Uwe Hermann91f4afa2011-07-28 08:13:25 +0000245
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000246 if (param_pos) {
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000247 /* Get the string after needle and '='. */
248 opt_pos = param_pos + needlelen + 1;
249 optlen = strcspn(opt_pos, delim);
250 /* Return an empty string if the parameter was empty. */
251 opt = malloc(optlen + 1);
252 if (!opt) {
Sean Nelson316a29f2010-05-07 20:09:04 +0000253 msg_gerr("Out of memory!\n");
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000254 exit(1);
255 }
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000256 strncpy(opt, opt_pos, optlen);
257 opt[optlen] = '\0';
258 rest = opt_pos + optlen;
259 /* Skip all delimiters after the current parameter. */
260 rest += strspn(rest, delim);
261 memmove(param_pos, rest, strlen(rest) + 1);
262 /* We could shrink haystack, but the effort is not worth it. */
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000263 }
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000264
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000265 return opt;
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000266}
267
Stefan Tauner66652442011-06-26 17:38:17 +0000268char *extract_programmer_param(const char *param_name)
Carl-Daniel Hailfinger2b6dcb32010-07-08 10:13:37 +0000269{
270 return extract_param(&programmer_param, param_name, ",");
271}
272
Richard Hughes842d6782021-01-15 09:48:12 +0000273static void flashprog_progress_report(struct flashprog_progress *const p)
274{
275 if (p->current > p->total) {
276 msg_gdbg2("Sanitizing progress report: %zu bytes off.", p->current - p->total);
277 p->current = p->total;
278 }
279
280 if (!p->callback)
281 return;
282
283 p->callback(p->stage, p->current, p->total, p->user_data);
284}
285
286static void flashprog_progress_start(struct flashprog_flashctx *const flashctx,
287 const enum flashprog_progress_stage stage, const size_t total)
288{
289 flashctx->progress.stage = stage;
290 flashctx->progress.current = 0;
291 flashctx->progress.total = total;
292 flashprog_progress_report(&flashctx->progress);
293}
294
295static void flashprog_progress_start_by_layout(struct flashprog_flashctx *const flashctx,
296 const enum flashprog_progress_stage stage,
297 const struct flashprog_layout *const layout)
298{
299 const struct romentry *entry = NULL;
300 size_t total = 0;
301
302 while ((entry = layout_next_included(layout, entry)))
303 total += entry->end - entry->start + 1;
304
305 flashprog_progress_start(flashctx, stage, total);
306}
307
308static void flashprog_progress_set(struct flashprog_flashctx *const flashctx, const size_t current)
309{
310 flashctx->progress.current = current;
311 flashprog_progress_report(&flashctx->progress);
312}
313
314/** @private */
315void flashprog_progress_add(struct flashprog_flashctx *const flashctx, const size_t progress)
316{
317 flashctx->progress.current += progress;
318 flashprog_progress_report(&flashctx->progress);
319}
320
321static void flashprog_progress_finish(struct flashprog_flashctx *const flashctx)
322{
323 if (flashctx->progress.current == flashctx->progress.total)
324 return;
325
326 flashctx->progress.current = flashctx->progress.total;
327 flashprog_progress_report(&flashctx->progress);
328}
329
Sylvain "ythier" Hitier9db45512011-07-04 07:27:17 +0000330/* Returns the number of well-defined erasers for a chip. */
Carl-Daniel Hailfinger63fd9022011-12-14 22:25:15 +0000331static unsigned int count_usable_erasers(const struct flashctx *flash)
Stefan Tauner5368dca2011-07-01 00:19:12 +0000332{
333 unsigned int usable_erasefunctions = 0;
334 int k;
335 for (k = 0; k < NUM_ERASEFUNCTIONS; k++) {
336 if (!check_block_eraser(flash, k, 0))
337 usable_erasefunctions++;
338 }
339 return usable_erasefunctions;
340}
341
Mark Marshallf20b7be2014-05-09 21:16:21 +0000342static int compare_range(const uint8_t *wantbuf, const uint8_t *havebuf, unsigned int start, unsigned int len)
Stefan Tauner78ffbea2012-10-27 15:36:56 +0000343{
344 int ret = 0, failcount = 0;
345 unsigned int i;
346 for (i = 0; i < len; i++) {
347 if (wantbuf[i] != havebuf[i]) {
348 /* Only print the first failure. */
349 if (!failcount++)
350 msg_cerr("FAILED at 0x%08x! Expected=0x%02x, Found=0x%02x,",
351 start + i, wantbuf[i], havebuf[i]);
352 }
353 }
354 if (failcount) {
355 msg_cerr(" failed byte count from 0x%08x-0x%08x: 0x%x\n",
356 start, start + len - 1, failcount);
357 ret = -1;
358 }
359 return ret;
360}
361
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000362/* start is an offset to the base address of the flash chip */
Jacob Garberbeeb8bc2019-06-21 15:24:17 -0600363static int check_erased_range(struct flashctx *flash, unsigned int start, unsigned int len)
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000364{
365 int ret;
Paul Kocialkowski995f7552018-01-15 01:06:09 +0300366 const uint8_t erased_value = ERASED_VALUE(flash);
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000367
Edward O'Callaghanf60f64f2022-11-12 12:08:01 +1100368 uint8_t *cmpbuf = malloc(len);
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000369 if (!cmpbuf) {
Edward O'Callaghana31a5722022-11-12 12:05:36 +1100370 msg_gerr("Out of memory!\n");
Edward O'Callaghan6edf9f82022-11-12 12:08:46 +1100371 return -1;
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000372 }
Paul Kocialkowski995f7552018-01-15 01:06:09 +0300373 memset(cmpbuf, erased_value, len);
Stefan Tauner78ffbea2012-10-27 15:36:56 +0000374 ret = verify_range(flash, cmpbuf, start, len);
Edward O'Callaghanf60f64f2022-11-12 12:08:01 +1100375
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000376 free(cmpbuf);
377 return ret;
378}
379
Richard Hughes842d6782021-01-15 09:48:12 +0000380int flashprog_read_range(struct flashctx *flash, uint8_t *buf, unsigned int start, unsigned int len)
381{
382 flashprog_progress_start(flash, FLASHPROG_PROGRESS_READ, len);
383 const int ret = flash->chip->read(flash, buf, start, len);
384 flashprog_progress_finish(flash);
385 return ret;
386}
387
Uwe Hermann48ec1b12010-08-08 17:01:18 +0000388/*
Carl-Daniel Hailfingerd0250a32009-11-25 17:05:52 +0000389 * @cmpbuf buffer to compare against, cmpbuf[0] is expected to match the
Uwe Hermann91f4afa2011-07-28 08:13:25 +0000390 * flash content at location start
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000391 * @start offset to the base address of the flash chip
392 * @len length of the verified area
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000393 * @return 0 for success, -1 for failure
394 */
Mark Marshallf20b7be2014-05-09 21:16:21 +0000395int verify_range(struct flashctx *flash, const uint8_t *cmpbuf, unsigned int start, unsigned int len)
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000396{
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000397 if (!len)
Stefan Taunerdf64a422014-05-27 00:06:14 +0000398 return -1;
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000399
Edward O'Callaghan6ae640b2021-11-17 14:24:04 +1100400 if (start + len > flash->chip->total_size * 1024) {
401 msg_gerr("Error: %s called with start 0x%x + len 0x%x >"
402 " total_size 0x%x\n", __func__, start, len,
403 flash->chip->total_size * 1024);
404 return -1;
405 }
406
Stefan Taunerdf64a422014-05-27 00:06:14 +0000407 uint8_t *readbuf = malloc(len);
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000408 if (!readbuf) {
Edward O'Callaghana31a5722022-11-12 12:05:36 +1100409 msg_gerr("Out of memory!\n");
Stefan Taunerdf64a422014-05-27 00:06:14 +0000410 return -1;
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000411 }
412
Edward O'Callaghan6ae640b2021-11-17 14:24:04 +1100413 int ret = flash->chip->read(flash, readbuf, start, len);
Carl-Daniel Hailfingerd8369412010-11-16 17:21:58 +0000414 if (ret) {
415 msg_gerr("Verification impossible because read failed "
416 "at 0x%x (len 0x%x)\n", start, len);
Stefan Taunerdf64a422014-05-27 00:06:14 +0000417 ret = -1;
418 goto out_free;
Carl-Daniel Hailfingerd8369412010-11-16 17:21:58 +0000419 }
420
Stefan Tauner78ffbea2012-10-27 15:36:56 +0000421 ret = compare_range(cmpbuf, readbuf, start, len);
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000422out_free:
423 free(readbuf);
424 return ret;
425}
426
Nico Huber3ac761c2023-01-16 02:43:17 +0100427size_t gran_to_bytes(const enum write_granularity gran)
Nico Huberb77607f2023-01-16 02:25:45 +0100428{
429 switch (gran) {
430 case write_gran_1bit: return 1;
431 case write_gran_1byte: return 1;
432 case write_gran_1byte_implicit_erase: return 1;
433 case write_gran_128bytes: return 128;
434 case write_gran_256bytes: return 256;
435 case write_gran_264bytes: return 264;
436 case write_gran_512bytes: return 512;
437 case write_gran_528bytes: return 528;
438 case write_gran_1024bytes: return 1024;
439 case write_gran_1056bytes: return 1056;
440 default: return 0;
441 }
442}
443
Stefan Tauner02437452013-04-01 19:34:53 +0000444/* Helper function for need_erase() that focuses on granularities of gran bytes. */
Paul Kocialkowski995f7552018-01-15 01:06:09 +0300445static int need_erase_gran_bytes(const uint8_t *have, const uint8_t *want, unsigned int len,
446 unsigned int gran, const uint8_t erased_value)
Stefan Tauner02437452013-04-01 19:34:53 +0000447{
448 unsigned int i, j, limit;
449 for (j = 0; j < len / gran; j++) {
450 limit = min (gran, len - j * gran);
451 /* Are 'have' and 'want' identical? */
452 if (!memcmp(have + j * gran, want + j * gran, limit))
453 continue;
454 /* have needs to be in erased state. */
455 for (i = 0; i < limit; i++)
Paul Kocialkowski995f7552018-01-15 01:06:09 +0300456 if (have[j * gran + i] != erased_value)
Stefan Tauner02437452013-04-01 19:34:53 +0000457 return 1;
458 }
459 return 0;
460}
461
Uwe Hermann48ec1b12010-08-08 17:01:18 +0000462/*
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000463 * Check if the buffer @have can be programmed to the content of @want without
464 * erasing. This is only possible if all chunks of size @gran are either kept
465 * as-is or changed from an all-ones state to any other state.
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000466 *
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000467 * Warning: This function assumes that @have and @want point to naturally
468 * aligned regions.
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000469 *
470 * @have buffer with current content
471 * @want buffer with desired content
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000472 * @len length of the checked area
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000473 * @gran write granularity (enum, not count)
474 * @return 0 if no erase is needed, 1 otherwise
475 */
Edward O'Callaghana1805092022-05-16 11:10:36 +1000476static int need_erase(const uint8_t *have, const uint8_t *want, unsigned int len,
477 enum write_granularity gran, const uint8_t erased_value)
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000478{
Stefan Tauner02437452013-04-01 19:34:53 +0000479 unsigned int i;
Nico Huberb77607f2023-01-16 02:25:45 +0100480 size_t stride;
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000481
482 switch (gran) {
483 case write_gran_1bit:
Nico Huberb77607f2023-01-16 02:25:45 +0100484 for (i = 0; i < len; i++) {
485 if ((have[i] & want[i]) != want[i])
486 return 1;
487 }
488 return 0;
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000489 case write_gran_1byte:
Nico Huberb77607f2023-01-16 02:25:45 +0100490 for (i = 0; i < len; i++) {
491 if ((have[i] != want[i]) && (have[i] != erased_value))
492 return 1;
493 }
494 return 0;
Carl-Daniel Hailfinger1b0e9fc2014-06-16 22:36:17 +0000495 case write_gran_1byte_implicit_erase:
496 /* Do not erase, handle content changes from anything->0xff by writing 0xff. */
Nico Huberb77607f2023-01-16 02:25:45 +0100497 return 0;
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000498 default:
Nico Huberb77607f2023-01-16 02:25:45 +0100499 stride = gran_to_bytes(gran);
500 if (stride) {
501 return need_erase_gran_bytes(have, want, len, stride, erased_value);
502 }
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000503 msg_cerr("%s: Unsupported granularity! Please report a bug at "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200504 "flashprog@flashprog.org\n", __func__);
Nico Huberb77607f2023-01-16 02:25:45 +0100505 return 0;
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000506 }
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000507}
508
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000509/**
510 * Check if the buffer @have needs to be programmed to get the content of @want.
511 * If yes, return 1 and fill in first_start with the start address of the
512 * write operation and first_len with the length of the first to-be-written
513 * chunk. If not, return 0 and leave first_start and first_len undefined.
514 *
515 * Warning: This function assumes that @have and @want point to naturally
516 * aligned regions.
517 *
518 * @have buffer with current content
519 * @want buffer with desired content
520 * @len length of the checked area
521 * @gran write granularity (enum, not count)
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000522 * @first_start offset of the first byte which needs to be written (passed in
523 * value is increased by the offset of the first needed write
524 * relative to have/want or unchanged if no write is needed)
525 * @return length of the first contiguous area which needs to be written
526 * 0 if no write is needed
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000527 *
528 * FIXME: This function needs a parameter which tells it about coalescing
529 * in relation to the max write length of the programmer and the max write
530 * length of the chip.
531 */
Nico Huber3b9c86d2023-01-15 22:58:06 +0100532static unsigned int get_next_write(const uint8_t *have, const uint8_t *want, chipsize_t len,
533 chipoff_t *first_start, enum write_granularity gran)
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000534{
Felix Singerf25447e2022-08-19 02:44:28 +0200535 bool need_write = false;
Stefan Taunerc69c9c82011-11-23 09:13:48 +0000536 unsigned int rel_start = 0, first_len = 0;
Nico Huberb77607f2023-01-16 02:25:45 +0100537 unsigned int i, limit;
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000538
Nico Huberb77607f2023-01-16 02:25:45 +0100539 const size_t stride = gran_to_bytes(gran);
540 if (!stride) {
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000541 msg_cerr("%s: Unsupported granularity! Please report a bug at "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200542 "flashprog@flashprog.org\n", __func__);
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000543 /* Claim that no write was needed. A write with unknown
544 * granularity is too dangerous to try.
545 */
546 return 0;
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000547 }
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000548 for (i = 0; i < len / stride; i++) {
549 limit = min(stride, len - i * stride);
550 /* Are 'have' and 'want' identical? */
551 if (memcmp(have + i * stride, want + i * stride, limit)) {
552 if (!need_write) {
553 /* First location where have and want differ. */
Felix Singerf25447e2022-08-19 02:44:28 +0200554 need_write = true;
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000555 rel_start = i * stride;
556 }
557 } else {
558 if (need_write) {
559 /* First location where have and want
560 * do not differ anymore.
561 */
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000562 break;
563 }
564 }
565 }
Carl-Daniel Hailfinger202bf532010-12-06 13:05:44 +0000566 if (need_write)
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000567 first_len = min(i * stride - rel_start, len);
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000568 *first_start += rel_start;
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000569 return first_len;
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000570}
571
Nico Huber2d625722016-05-03 10:48:02 +0200572/*
573 * Return a string corresponding to the bustype parameter.
574 * Memory is obtained with malloc() and must be freed with free() by the caller.
575 */
576char *flashbuses_to_text(enum chipbustype bustype)
577{
578 char *ret = calloc(1, 1);
579 /*
580 * FIXME: Once all chipsets and flash chips have been updated, NONSPI
581 * will cease to exist and should be eliminated here as well.
582 */
583 if (bustype == BUS_NONSPI) {
584 ret = strcat_realloc(ret, "Non-SPI, ");
585 } else {
586 if (bustype & BUS_PARALLEL)
587 ret = strcat_realloc(ret, "Parallel, ");
588 if (bustype & BUS_LPC)
589 ret = strcat_realloc(ret, "LPC, ");
590 if (bustype & BUS_FWH)
591 ret = strcat_realloc(ret, "FWH, ");
592 if (bustype & BUS_SPI)
593 ret = strcat_realloc(ret, "SPI, ");
594 if (bustype & BUS_PROG)
595 ret = strcat_realloc(ret, "Programmer-specific, ");
596 if (bustype == BUS_NONE)
597 ret = strcat_realloc(ret, "None, ");
598 }
599 /* Kill last comma. */
600 ret[strlen(ret) - 2] = '\0';
601 ret = realloc(ret, strlen(ret) + 1);
602 return ret;
603}
604
Edward O'Callaghan00ea3892022-10-11 21:27:37 +1100605static int init_default_layout(struct flashctx *flash)
606{
607 /* Fill default layout covering the whole chip. */
Nico Huberc3b02dc2023-08-12 01:13:45 +0200608 if (flashprog_layout_new(&flash->default_layout) ||
609 flashprog_layout_add_region(flash->default_layout,
Edward O'Callaghan00ea3892022-10-11 21:27:37 +1100610 0, flash->chip->total_size * 1024 - 1, "complete flash") ||
Nico Huberc3b02dc2023-08-12 01:13:45 +0200611 flashprog_layout_include_region(flash->default_layout, "complete flash"))
Edward O'Callaghan00ea3892022-10-11 21:27:37 +1100612 return -1;
613 return 0;
614}
615
Carl-Daniel Hailfingera5bcbce2014-07-19 22:03:29 +0000616int probe_flash(struct registered_master *mst, int startchip, struct flashctx *flash, int force)
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000617{
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000618 const struct flashchip *chip;
Carl-Daniel Hailfinger115d3902009-10-31 01:53:09 +0000619 enum chipbustype buses_common;
Carl-Daniel Hailfingerb22918c2009-06-01 02:08:58 +0000620 char *tmp;
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000621
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000622 for (chip = flashchips + startchip; chip && chip->name; chip++) {
623 if (chip_to_probe && strcmp(chip->name, chip_to_probe) != 0)
Ollie Lhocbbf1252004-03-17 22:22:08 +0000624 continue;
Carl-Daniel Hailfingera5bcbce2014-07-19 22:03:29 +0000625 buses_common = mst->buses_supported & chip->bustype;
Carl-Daniel Hailfingerc40cff72011-12-20 00:19:29 +0000626 if (!buses_common)
Carl-Daniel Hailfinger6573b742011-06-17 22:38:53 +0000627 continue;
Mike Banon31b5e3b2018-01-15 01:10:00 +0300628 /* Only probe for SPI25 chips by default. */
629 if (chip->bustype == BUS_SPI && !chip_to_probe && chip->spi_cmd_set != SPI25)
630 continue;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000631 msg_gdbg("Probing for %s %s, %d kB: ", chip->vendor, chip->name, chip->total_size);
632 if (!chip->probe && !force) {
Nico Huberc3b02dc2023-08-12 01:13:45 +0200633 msg_gdbg("failed! flashprog has no probe function for this flash chip.\n");
Carl-Daniel Hailfingerb22918c2009-06-01 02:08:58 +0000634 continue;
635 }
Stefan Reinauer70385642007-04-06 11:58:03 +0000636
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000637 /* Start filling in the dynamic data. */
Angel Pons690a9442021-06-07 12:33:53 +0200638 flash->chip = calloc(1, sizeof(*flash->chip));
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000639 if (!flash->chip) {
640 msg_gerr("Out of memory!\n");
Edward O'Callaghan6edf9f82022-11-12 12:08:46 +1100641 return -1;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000642 }
Angel Pons7e134562021-06-07 13:29:13 +0200643 *flash->chip = *chip;
Nico Huber9a11cbf2023-01-13 01:19:07 +0100644 flash->mst.par = &mst->par; /* both `mst` are unions, so we need only one pointer */
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000645
Nico Huber9eec4072023-01-12 01:17:30 +0100646 if (flash->chip->prepare_access && flash->chip->prepare_access(flash, PREPARE_PROBE))
647 goto free_chip;
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000648
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000649 /* We handle a forced match like a real match, we just avoid probing. Note that probe_flash()
650 * is only called with force=1 after normal probing failed.
651 */
Peter Stuge27c3e2d2008-07-02 17:15:47 +0000652 if (force)
653 break;
Stefan Reinauerfcb63682006-03-16 16:57:41 +0000654
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000655 if (flash->chip->probe(flash) != 1)
Peter Stuge483b8f02008-09-03 23:10:05 +0000656 goto notfound;
657
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000658 /* If this is the first chip found, accept it.
659 * If this is not the first chip found, accept it only if it is
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000660 * a non-generic match. SFDP and CFI are generic matches.
661 * startchip==0 means this call to probe_flash() is the first
Carl-Daniel Hailfingera5bcbce2014-07-19 22:03:29 +0000662 * one for this programmer interface (master) and thus no other chip has
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000663 * been found on this interface.
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000664 */
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000665 if (startchip == 0 && flash->chip->model_id == SFDP_DEVICE_ID) {
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000666 msg_cinfo("===\n"
667 "SFDP has autodetected a flash chip which is "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200668 "not natively supported by flashprog yet.\n");
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000669 if (count_usable_erasers(flash) == 0)
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000670 msg_cinfo("The standard operations read and "
671 "verify should work, but to support "
672 "erase, write and all other "
673 "possible features");
674 else
675 msg_cinfo("All standard operations (read, "
676 "verify, erase and write) should "
677 "work, but to support all possible "
678 "features");
679
Stefan Taunerb4e06bd2012-08-20 00:24:22 +0000680 msg_cinfo(" we need to add them manually.\n"
681 "You can help us by mailing us the output of the following command to "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200682 "flashprog@flashprog.org:\n"
683 "'flashprog -VV [plus the -p/--programmer parameter]'\n"
Stefan Taunerb4e06bd2012-08-20 00:24:22 +0000684 "Thanks for your help!\n"
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000685 "===\n");
686 }
687
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000688 /* First flash chip detected on this bus. */
689 if (startchip == 0)
Peter Stuge27c3e2d2008-07-02 17:15:47 +0000690 break;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000691 /* Not the first flash chip detected on this bus, but not a generic match either. */
692 if ((flash->chip->model_id != GENERIC_DEVICE_ID) && (flash->chip->model_id != SFDP_DEVICE_ID))
693 break;
694 /* 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 +0000695notfound:
Nico Huber9eec4072023-01-12 01:17:30 +0100696 if (flash->chip->finish_access)
697 flash->chip->finish_access(flash);
698free_chip:
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000699 free(flash->chip);
700 flash->chip = NULL;
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000701 }
Uwe Hermannffec5f32007-08-23 16:08:21 +0000702
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000703 if (!flash->chip)
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000704 return -1;
Peter Stuge27c3e2d2008-07-02 17:15:47 +0000705
Edward O'Callaghan00ea3892022-10-11 21:27:37 +1100706 if (init_default_layout(flash) < 0)
707 return -1;
Stefan Reinauer051e2362011-01-19 06:21:54 +0000708
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000709 tmp = flashbuses_to_text(flash->chip->bustype);
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000710 msg_cinfo("%s %s flash chip \"%s\" (%d kB, %s) ", force ? "Assuming" : "Found",
711 flash->chip->vendor, flash->chip->name, flash->chip->total_size, tmp);
Stefan Tauner00155492011-06-26 20:45:35 +0000712 free(tmp);
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000713#if CONFIG_INTERNAL == 1
Nico Huber0e76d992023-01-12 20:22:55 +0100714 if (flash->physical_memory != 0 && mst->par.map_flash == physmap)
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000715 msg_cinfo("mapped at physical address 0x%0*" PRIxPTR ".\n",
716 PRIxPTR_WIDTH, flash->physical_memory);
717 else
718#endif
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +0200719 msg_cinfo("on %s.\n", programmer->name);
Uwe Hermann9899cad2009-06-28 21:47:57 +0000720
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000721 /* Flash registers may more likely not be mapped if the chip was forced.
722 * Lock info may be stored in registers, so avoid lock info printing. */
Carl-Daniel Hailfinger859f3f02010-12-02 21:59:42 +0000723 if (!force)
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000724 if (flash->chip->printlock)
725 flash->chip->printlock(flash);
Sean Nelson6e0b9122010-02-19 00:52:10 +0000726
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000727 /* Get out of the way for later runs. */
Nico Huber9eec4072023-01-12 01:17:30 +0100728 if (flash->chip->finish_access)
729 flash->chip->finish_access(flash);
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000730
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000731 /* Return position of matching chip. */
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000732 return chip - flashchips;
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000733}
734
Stefan Tauner96658be2014-05-26 22:05:31 +0000735/* Even if an error is found, the function will keep going and check the rest. */
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000736static int selfcheck_eraseblocks(const struct flashchip *chip)
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000737{
Carl-Daniel Hailfinger082c8b52011-08-15 19:54:20 +0000738 int i, j, k;
739 int ret = 0;
Aarya Chaumal478e1792022-06-04 01:34:44 +0530740 unsigned int prev_eraseblock_count = chip->total_size * 1024;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000741
742 for (k = 0; k < NUM_ERASEFUNCTIONS; k++) {
743 unsigned int done = 0;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000744 struct block_eraser eraser = chip->block_erasers[k];
Aarya Chaumal478e1792022-06-04 01:34:44 +0530745 unsigned int curr_eraseblock_count = 0;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000746
747 for (i = 0; i < NUM_ERASEREGIONS; i++) {
748 /* Blocks with zero size are bugs in flashchips.c. */
749 if (eraser.eraseblocks[i].count &&
750 !eraser.eraseblocks[i].size) {
Nico Huberac90af62022-12-18 00:22:47 +0000751 msg_gerr("ERROR: Flash chip %s erase function %i region %i has size 0.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +0200752 "Please report a bug at flashprog@flashprog.org\n",
Nico Huberac90af62022-12-18 00:22:47 +0000753 chip->name, k, i);
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000754 ret = 1;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000755 }
756 /* Blocks with zero count are bugs in flashchips.c. */
757 if (!eraser.eraseblocks[i].count &&
758 eraser.eraseblocks[i].size) {
Nico Huberac90af62022-12-18 00:22:47 +0000759 msg_gerr("ERROR: Flash chip %s erase function %i region %i has count 0.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +0200760 "Please report a bug at flashprog@flashprog.org\n",
Nico Huberac90af62022-12-18 00:22:47 +0000761 chip->name, k, i);
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000762 ret = 1;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000763 }
764 done += eraser.eraseblocks[i].count *
765 eraser.eraseblocks[i].size;
Aarya Chaumal478e1792022-06-04 01:34:44 +0530766 curr_eraseblock_count += eraser.eraseblocks[i].count;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000767 }
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000768 /* Empty eraseblock definition with erase function. */
769 if (!done && eraser.block_erase)
Sean Nelson316a29f2010-05-07 20:09:04 +0000770 msg_gspew("Strange: Empty eraseblock definition with "
Uwe Hermann91f4afa2011-07-28 08:13:25 +0000771 "non-empty erase function. Not an error.\n");
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000772 if (!done)
773 continue;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000774 if (done != chip->total_size * 1024) {
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000775 msg_gerr("ERROR: Flash chip %s erase function %i "
776 "region walking resulted in 0x%06x bytes total,"
Nico Huberac90af62022-12-18 00:22:47 +0000777 " expected 0x%06x bytes.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +0200778 "Please report a bug at flashprog@flashprog.org\n",
Nico Huberac90af62022-12-18 00:22:47 +0000779 chip->name, k, done, chip->total_size * 1024);
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000780 ret = 1;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000781 }
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000782 if (!eraser.block_erase)
783 continue;
784 /* Check if there are identical erase functions for different
785 * layouts. That would imply "magic" erase functions. The
786 * easiest way to check this is with function pointers.
787 */
Uwe Hermann43959702010-03-13 17:28:29 +0000788 for (j = k + 1; j < NUM_ERASEFUNCTIONS; j++) {
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000789 if (eraser.block_erase ==
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000790 chip->block_erasers[j].block_erase) {
Nico Huberac90af62022-12-18 00:22:47 +0000791 msg_gerr("ERROR: Flash chip %s erase function %i and %i are identical.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +0200792 "Please report a bug at flashprog@flashprog.org\n",
Nico Huberac90af62022-12-18 00:22:47 +0000793 chip->name, k, j);
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000794 ret = 1;
795 }
Uwe Hermann43959702010-03-13 17:28:29 +0000796 }
Aarya Chaumal478e1792022-06-04 01:34:44 +0530797 if(curr_eraseblock_count > prev_eraseblock_count)
798 {
Nico Huberac90af62022-12-18 00:22:47 +0000799 msg_gerr("ERROR: Flash chip %s erase function %i is not in order.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +0200800 "Please report a bug at flashprog@flashprog.org\n",
Nico Huberac90af62022-12-18 00:22:47 +0000801 chip->name, k);
Aarya Chaumal478e1792022-06-04 01:34:44 +0530802 ret = 1;
803 }
804 prev_eraseblock_count = curr_eraseblock_count;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000805 }
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000806 return ret;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000807}
808
Carl-Daniel Hailfinger63fd9022011-12-14 22:25:15 +0000809static int check_block_eraser(const struct flashctx *flash, int k, int log)
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000810{
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000811 struct block_eraser eraser = flash->chip->block_erasers[k];
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000812
813 if (!eraser.block_erase && !eraser.eraseblocks[0].count) {
814 if (log)
815 msg_cdbg("not defined. ");
816 return 1;
817 }
818 if (!eraser.block_erase && eraser.eraseblocks[0].count) {
819 if (log)
820 msg_cdbg("eraseblock layout is known, but matching "
Stefan Tauner355cbfd2011-05-28 02:37:14 +0000821 "block erase function is not implemented. ");
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000822 return 1;
823 }
824 if (eraser.block_erase && !eraser.eraseblocks[0].count) {
825 if (log)
826 msg_cdbg("block erase function found, but "
Stefan Tauner355cbfd2011-05-28 02:37:14 +0000827 "eraseblock layout is not defined. ");
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000828 return 1;
829 }
Aarya Chaumal6d98aec2022-08-14 23:16:44 +0530830
831 if (flash->chip->bustype == BUS_SPI) {
Nico Huber13389362024-03-05 18:35:30 +0100832 bool native_4ba;
Nico Huber13f97a52023-01-14 23:55:06 +0100833 int i;
Nico Huber13389362024-03-05 18:35:30 +0100834
835 const uint8_t *opcode = spi_get_opcode_from_erasefn(eraser.block_erase, &native_4ba);
Nico Huber3e8ccab2024-08-21 10:18:27 +0200836 if (!opcode)
837 return 1;
838
Nico Huber13f97a52023-01-14 23:55:06 +0100839 for (i = 0; opcode[i]; i++) {
Nico Huber13389362024-03-05 18:35:30 +0100840 if ((native_4ba && !spi_master_4ba(flash)) ||
Nico Huber9a11cbf2023-01-13 01:19:07 +0100841 !flash->mst.spi->probe_opcode(flash, opcode[i])) {
Aarya Chaumal6d98aec2022-08-14 23:16:44 +0530842 if (log)
843 msg_cdbg("block erase function and layout found "
844 "but SPI master doesn't support the function. ");
845 return 1;
846 }
847 }
848 }
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000849 // TODO: Once erase functions are annotated with allowed buses, check that as well.
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000850 return 0;
851}
852
Nico Huber7af0e792016-04-29 16:40:15 +0200853/**
854 * @brief Reads the included layout regions into a buffer.
855 *
856 * If there is no layout set in the given flash context, the whole chip will
857 * be read.
858 *
859 * @param flashctx Flash context to be used.
860 * @param buffer Buffer of full chip size to read into.
861 * @return 0 on success,
862 * 1 if any read fails.
863 */
864static int read_by_layout(struct flashctx *const flashctx, uint8_t *const buffer)
865{
Nico Huberc3b02dc2023-08-12 01:13:45 +0200866 const struct flashprog_layout *const layout = get_layout(flashctx);
Nico Huber5ca55232019-06-15 22:29:08 +0200867 const struct romentry *entry = NULL;
Nico Huber7af0e792016-04-29 16:40:15 +0200868
Richard Hughes842d6782021-01-15 09:48:12 +0000869 flashprog_progress_start_by_layout(flashctx, FLASHPROG_PROGRESS_READ, layout);
870
Nico Huber5ca55232019-06-15 22:29:08 +0200871 while ((entry = layout_next_included(layout, entry))) {
872 const chipoff_t region_start = entry->start;
873 const chipsize_t region_len = entry->end - entry->start + 1;
Nico Huber7af0e792016-04-29 16:40:15 +0200874
875 if (flashctx->chip->read(flashctx, buffer + region_start, region_start, region_len))
876 return 1;
877 }
Richard Hughes842d6782021-01-15 09:48:12 +0000878
879 flashprog_progress_finish(flashctx);
880
Nico Huber7af0e792016-04-29 16:40:15 +0200881 return 0;
882}
883
Nico Huber7af0e792016-04-29 16:40:15 +0200884/**
885 * @private
886 *
887 * For read-erase-write, `curcontents` and `newcontents` shall point
888 * to buffers of the chip's size. Both are supposed to be prefilled
889 * with at least the included layout regions of the current flash
890 * contents (`curcontents`) and the data to be written to the flash
891 * (`newcontents`).
892 *
893 * For erase, `curcontents` and `newcontents` shall be NULL-pointers.
894 *
895 * The `chipoff_t` values are used internally by `walk_by_layout()`.
896 */
897struct walk_info {
898 uint8_t *curcontents;
899 const uint8_t *newcontents;
900 chipoff_t region_start;
901 chipoff_t region_end;
902 chipoff_t erase_start;
903 chipoff_t erase_end;
904};
Nico Huber3b9c86d2023-01-15 22:58:06 +0100905
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530906struct eraseblock_data {
907 chipoff_t start_addr;
908 chipoff_t end_addr;
909 bool selected;
910 size_t block_num;
911 size_t first_sub_block_index;
912 size_t last_sub_block_index;
913};
914
915struct erase_layout {
916 struct eraseblock_data* layout_list;
917 size_t block_count;
918 const struct block_eraser *eraser;
919};
920
Nico Huber5ff6fdc2023-01-15 23:43:12 +0100921static bool explicit_erase(const struct walk_info *const info)
922{
923 /* For explicit erase, we are called without new contents. */
924 return !info->newcontents;
925}
926
Nico Huberd96e7032023-01-14 22:31:48 +0100927static size_t calculate_block_count(const struct block_eraser *const eraser)
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530928{
Nico Huberd96e7032023-01-14 22:31:48 +0100929 size_t block_count = 0, i;
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530930
Nico Huberd96e7032023-01-14 22:31:48 +0100931 for (i = 0; i < ARRAY_SIZE(eraser->eraseblocks); ++i)
932 block_count += eraser->eraseblocks[i].count;
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530933
934 return block_count;
935}
936
937static void init_eraseblock(struct erase_layout *layout, size_t idx, size_t block_num,
938 chipoff_t start_addr, chipoff_t end_addr, size_t *sub_block_index)
939{
940 struct eraseblock_data *edata = &layout[idx].layout_list[block_num];
941 edata->start_addr = start_addr;
942 edata->end_addr = end_addr;
943 edata->selected = false;
944 edata->block_num = block_num;
945
946 if (!idx)
947 return;
Nico Hubera02df332023-01-14 23:06:27 +0100948 const struct erase_layout *const sub_layout = &layout[idx - 1];
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530949
950 edata->first_sub_block_index = *sub_block_index;
Nico Hubera02df332023-01-14 23:06:27 +0100951 for (; *sub_block_index < sub_layout->block_count; ++*sub_block_index) {
952 if (sub_layout->layout_list[*sub_block_index].end_addr > end_addr)
953 break;
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530954 }
955 edata->last_sub_block_index = *sub_block_index - 1;
956}
957
958/*
959 * @brief Function to free the created erase_layout
960 *
961 * @param layout pointer to allocated layout
962 * @param erasefn_count number of erase functions for which the layout was created
963 *
964 */
965static void free_erase_layout(struct erase_layout *layout, unsigned int erasefn_count)
966{
Nico Huber13f97a52023-01-14 23:55:06 +0100967 size_t i;
968
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530969 if (!layout)
970 return;
Nico Huber13f97a52023-01-14 23:55:06 +0100971 for (i = 0; i < erasefn_count; i++) {
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530972 free(layout[i].layout_list);
973 }
974 free(layout);
975}
976
977/*
978 * @brief Function to create an erase layout
979 *
980 * @param flashctx flash context
981 * @param e_layout address to the pointer to store the layout
982 * @return 0 on success,
983 * -1 if layout creation fails
984 *
985 * This function creates a layout of which erase functions erase which regions
986 * of the flash chip. This helps to optimally select the erase functions for
987 * erase/write operations.
988 */
Nico Huberc09fca42023-01-29 15:58:09 +0100989static int create_erase_layout(struct flashctx *const flashctx, struct erase_layout **e_layout)
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530990{
991 const struct flashchip *chip = flashctx->chip;
992 const size_t erasefn_count = count_usable_erasers(flashctx);
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530993
994 if (!erasefn_count) {
995 msg_gerr("No erase functions supported\n");
996 return 0;
997 }
998
Nico Huberd34864b2023-01-14 23:47:19 +0100999 struct erase_layout *layout = calloc(erasefn_count, sizeof(struct erase_layout));
1000 if (!layout) {
1001 msg_gerr("Out of memory!\n");
1002 return -1;
1003 }
1004
Nico Huber13f97a52023-01-14 23:55:06 +01001005 size_t layout_idx = 0, eraser_idx;
1006 for (eraser_idx = 0; eraser_idx < NUM_ERASEFUNCTIONS; eraser_idx++) {
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301007 if (check_block_eraser(flashctx, eraser_idx, 0))
1008 continue;
1009
1010 layout[layout_idx].eraser = &chip->block_erasers[eraser_idx];
Nico Huberd96e7032023-01-14 22:31:48 +01001011 const size_t block_count = calculate_block_count(&chip->block_erasers[eraser_idx]);
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301012 size_t sub_block_index = 0;
1013
1014 layout[layout_idx].block_count = block_count;
1015 layout[layout_idx].layout_list = (struct eraseblock_data *)calloc(block_count,
1016 sizeof(struct eraseblock_data));
1017
1018 if (!layout[layout_idx].layout_list) {
1019 free_erase_layout(layout, layout_idx);
1020 return -1;
1021 }
1022
1023 size_t block_num = 0;
1024 chipoff_t start_addr = 0;
1025
Nico Huber13f97a52023-01-14 23:55:06 +01001026 int i;
1027 for (i = 0; block_num < block_count; i++) {
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301028 const struct eraseblock *block = &chip->block_erasers[eraser_idx].eraseblocks[i];
1029
Nico Huber13f97a52023-01-14 23:55:06 +01001030 size_t num;
1031 for (num = 0; num < block->count; num++) {
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301032 chipoff_t end_addr = start_addr + block->size - 1;
1033 init_eraseblock(layout, layout_idx, block_num,
1034 start_addr, end_addr, &sub_block_index);
1035 block_num += 1;
1036 start_addr = end_addr + 1;
1037 }
1038 }
1039 layout_idx++;
1040 }
1041
1042 *e_layout = layout;
1043 return layout_idx;
1044}
1045
Nico Huber20073e72024-05-10 01:31:40 +02001046static void deselect_erase_block_rec(const struct erase_layout *layout, size_t findex, size_t block_num)
1047{
1048 struct eraseblock_data *const ed = &layout[findex].layout_list[block_num];
1049 size_t i;
1050
1051 if (ed->selected) {
1052 ed->selected = false;
1053 } else if (findex > 0) {
1054 for (i = ed->first_sub_block_index; i <= ed->last_sub_block_index; ++i)
1055 deselect_erase_block_rec(layout, findex - 1, i);
1056 }
1057}
1058
Aarya Chaumald33bea42022-07-14 12:51:14 +05301059/*
1060 * @brief Function to select the list of sectors that need erasing
1061 *
1062 * @param flashctx flash context
1063 * @param layout erase layout
1064 * @param findex index of the erase function
1065 * @param block_num index of the block to erase according to the erase function index
Nico Huber00d1b9f2023-01-29 15:07:33 +01001066 * @param info current info from walking the regions
Nico Huberaa714dd2023-04-22 14:59:33 +02001067 * @return number of bytes selected for erase
Aarya Chaumald33bea42022-07-14 12:51:14 +05301068 */
Nico Huberaa714dd2023-04-22 14:59:33 +02001069static size_t select_erase_functions_rec(const struct flashctx *flashctx, const struct erase_layout *layout,
1070 size_t findex, size_t block_num, const struct walk_info *info)
Aarya Chaumald33bea42022-07-14 12:51:14 +05301071{
1072 struct eraseblock_data *ll = &layout[findex].layout_list[block_num];
Nico Huberaa714dd2023-04-22 14:59:33 +02001073 const size_t eraseblock_size = ll->end_addr - ll->start_addr + 1;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301074 if (!findex) {
Nico Hubercf6ff0a2023-01-29 15:45:06 +01001075 if (ll->start_addr <= info->region_end && ll->end_addr >= info->region_start) {
Nico Huber1494f8e2023-01-29 15:48:00 +01001076 if (explicit_erase(info)) {
1077 ll->selected = true;
Nico Huberaa714dd2023-04-22 14:59:33 +02001078 return eraseblock_size;
Nico Huber1494f8e2023-01-29 15:48:00 +01001079 }
Nico Hubera6212482023-01-29 15:39:26 +01001080 const chipoff_t write_start = MAX(info->region_start, ll->start_addr);
1081 const chipoff_t write_end = MIN(info->region_end, ll->end_addr);
1082 const chipsize_t write_len = write_end - write_start + 1;
1083 const uint8_t erased_value = ERASED_VALUE(flashctx);
Nico Huber00d1b9f2023-01-29 15:07:33 +01001084 ll->selected = need_erase(
Nico Hubera6212482023-01-29 15:39:26 +01001085 info->curcontents + write_start, info->newcontents + write_start,
1086 write_len, flashctx->chip->gran, erased_value);
Nico Huberaa714dd2023-04-22 14:59:33 +02001087 if (ll->selected)
1088 return eraseblock_size;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301089 }
Nico Huberaa714dd2023-04-22 14:59:33 +02001090 return 0;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301091 } else {
Aarya Chaumald33bea42022-07-14 12:51:14 +05301092 const int sub_block_start = ll->first_sub_block_index;
1093 const int sub_block_end = ll->last_sub_block_index;
Nico Huberaa714dd2023-04-22 14:59:33 +02001094 size_t bytes = 0;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301095
Nico Huber13f97a52023-01-14 23:55:06 +01001096 int j;
Nico Huberaa714dd2023-04-22 14:59:33 +02001097 for (j = sub_block_start; j <= sub_block_end; j++)
1098 bytes += select_erase_functions_rec(flashctx, layout, findex - 1, j, info);
Aarya Chaumald33bea42022-07-14 12:51:14 +05301099
Nico Huberaa714dd2023-04-22 14:59:33 +02001100 if (bytes > eraseblock_size / 2) {
Nico Huber00d1b9f2023-01-29 15:07:33 +01001101 if (ll->start_addr >= info->region_start && ll->end_addr <= info->region_end) {
Nico Huber20073e72024-05-10 01:31:40 +02001102 deselect_erase_block_rec(layout, findex, block_num);
Aarya Chaumald33bea42022-07-14 12:51:14 +05301103 ll->selected = true;
Nico Huberaa714dd2023-04-22 14:59:33 +02001104 bytes = eraseblock_size;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301105 }
1106 }
Nico Huberaa714dd2023-04-22 14:59:33 +02001107 return bytes;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301108 }
1109}
1110
Nico Huberaa714dd2023-04-22 14:59:33 +02001111static size_t select_erase_functions(const struct flashctx *flashctx, const struct erase_layout *layout,
1112 size_t erasefn_count, const struct walk_info *info)
Nico Huberb11b72c2023-01-29 15:33:11 +01001113{
Nico Huberaa714dd2023-04-22 14:59:33 +02001114 size_t bytes = 0;
Nico Huberb11b72c2023-01-29 15:33:11 +01001115 size_t block_num;
1116 for (block_num = 0; block_num < layout[erasefn_count - 1].block_count; ++block_num)
Nico Huberaa714dd2023-04-22 14:59:33 +02001117 bytes += select_erase_functions_rec(flashctx, layout, erasefn_count - 1, block_num, info);
1118 return bytes;
Nico Huberb11b72c2023-01-29 15:33:11 +01001119}
1120
Nico Huber3b9c86d2023-01-15 22:58:06 +01001121static int write_range(struct flashctx *const flashctx, const chipoff_t flash_offset,
1122 const uint8_t *const curcontents, const uint8_t *const newcontents,
1123 const chipsize_t len, bool *const skipped)
1124{
1125 unsigned int writecount = 0;
1126 chipoff_t starthere = 0;
1127 chipsize_t lenhere = 0;
1128
1129 while ((lenhere = get_next_write(curcontents + starthere, newcontents + starthere,
1130 len - starthere, &starthere, flashctx->chip->gran))) {
1131 if (!writecount++)
1132 msg_cdbg("W");
1133 if (flashctx->chip->write(flashctx, newcontents + starthere,
1134 flash_offset + starthere, lenhere))
1135 return 1;
1136 starthere += lenhere;
Richard Hughes842d6782021-01-15 09:48:12 +00001137 if (skipped) {
1138 flashprog_progress_set(flashctx, starthere);
Nico Huber3b9c86d2023-01-15 22:58:06 +01001139 *skipped = false;
Richard Hughes842d6782021-01-15 09:48:12 +00001140 }
Nico Huber3b9c86d2023-01-15 22:58:06 +01001141 }
1142 return 0;
1143}
1144
1145typedef int (*erasefn_t)(struct flashctx *, unsigned int addr, unsigned int len);
Nico Huber7af0e792016-04-29 16:40:15 +02001146/* returns 0 on success, 1 to retry with another erase function, 2 for immediate abort */
1147typedef int (*per_blockfn_t)(struct flashctx *, const struct walk_info *, erasefn_t);
1148
1149static int walk_eraseblocks(struct flashctx *const flashctx,
Nico Huberc09fca42023-01-29 15:58:09 +01001150 struct erase_layout *const layouts,
1151 const size_t layout_count,
Nico Huber7af0e792016-04-29 16:40:15 +02001152 struct walk_info *const info,
Nico Huberc09fca42023-01-29 15:58:09 +01001153 const per_blockfn_t per_blockfn)
Nico Huber7af0e792016-04-29 16:40:15 +02001154{
1155 int ret;
1156 size_t i, j;
1157 bool first = true;
Nico Huber7af0e792016-04-29 16:40:15 +02001158
Nico Huberc09fca42023-01-29 15:58:09 +01001159 for (i = 0; i < layout_count; ++i) {
1160 const struct erase_layout *const layout = &layouts[i];
Nico Huber7af0e792016-04-29 16:40:15 +02001161
Nico Huberc09fca42023-01-29 15:58:09 +01001162 for (j = 0; j < layout->block_count; ++j) {
1163 struct eraseblock_data *const eb = &layout->layout_list[j];
1164
1165 if (eb->start_addr > info->region_end)
Nico Huber7af0e792016-04-29 16:40:15 +02001166 break;
Nico Huberc09fca42023-01-29 15:58:09 +01001167 if (eb->end_addr < info->region_start)
1168 continue;
1169 if (!eb->selected)
1170 continue;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001171
Nico Huber7af0e792016-04-29 16:40:15 +02001172 /* Print this for every block except the first one. */
1173 if (first)
1174 first = false;
1175 else
1176 msg_cdbg(", ");
Nico Huberc09fca42023-01-29 15:58:09 +01001177 msg_cdbg("0x%06x-0x%06x:", eb->start_addr, eb->end_addr);
Nico Huber7af0e792016-04-29 16:40:15 +02001178
Nico Huberc09fca42023-01-29 15:58:09 +01001179 info->erase_start = eb->start_addr;
1180 info->erase_end = eb->end_addr;
1181 ret = per_blockfn(flashctx, info, layout->eraser->block_erase);
Nico Huber7af0e792016-04-29 16:40:15 +02001182 if (ret)
1183 return ret;
Nico Huberc09fca42023-01-29 15:58:09 +01001184
1185 /* Clean the erase layout up for future use on other
1186 regions. `.selected` is the only field we alter. */
1187 eb->selected = false;
Nico Huber7af0e792016-04-29 16:40:15 +02001188 }
Nico Huber7af0e792016-04-29 16:40:15 +02001189 }
1190 msg_cdbg("\n");
1191 return 0;
1192}
1193
1194static int walk_by_layout(struct flashctx *const flashctx, struct walk_info *const info,
1195 const per_blockfn_t per_blockfn)
1196{
Nico Huberc09fca42023-01-29 15:58:09 +01001197 const bool do_erase = explicit_erase(info) || !(flashctx->chip->feature_bits & FEATURE_NO_ERASE);
Nico Huberc3b02dc2023-08-12 01:13:45 +02001198 const struct flashprog_layout *const layout = get_layout(flashctx);
Nico Huberc09fca42023-01-29 15:58:09 +01001199 struct erase_layout *erase_layouts = NULL;
Nico Huber5ca55232019-06-15 22:29:08 +02001200 const struct romentry *entry = NULL;
Nico Huberc09fca42023-01-29 15:58:09 +01001201 int ret = 0, layout_count = 0;
Nico Huber7af0e792016-04-29 16:40:15 +02001202
1203 all_skipped = true;
1204 msg_cinfo("Erasing and writing flash chip... ");
1205
Nico Huberc09fca42023-01-29 15:58:09 +01001206 if (do_erase) {
1207 layout_count = create_erase_layout(flashctx, &erase_layouts);
1208 if (layout_count <= 0)
1209 return 1;
1210 }
1211
Nico Huber5ca55232019-06-15 22:29:08 +02001212 while ((entry = layout_next_included(layout, entry))) {
1213 info->region_start = entry->start;
1214 info->region_end = entry->end;
Nico Huber7af0e792016-04-29 16:40:15 +02001215
Nico Huberc09fca42023-01-29 15:58:09 +01001216 if (do_erase) {
Richard Hughes842d6782021-01-15 09:48:12 +00001217 const size_t total = select_erase_functions(flashctx, erase_layouts, layout_count, info);
1218
1219 /* We verify every erased block manually. Technically that's
1220 reading, but accounting for it as part of the erase helps
1221 to provide a smooth, overall progress. Hence `total * 2`. */
1222 flashprog_progress_start(flashctx, FLASHPROG_PROGRESS_ERASE, total * 2);
1223
Nico Huberc09fca42023-01-29 15:58:09 +01001224 ret = walk_eraseblocks(flashctx, erase_layouts, layout_count, info, per_blockfn);
1225 if (ret) {
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001226 msg_cerr("FAILED!\n");
Nico Huberc09fca42023-01-29 15:58:09 +01001227 goto free_ret;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001228 }
Richard Hughes842d6782021-01-15 09:48:12 +00001229
1230 flashprog_progress_finish(flashctx);
Nico Huber7af0e792016-04-29 16:40:15 +02001231 }
Nico Huberd34af7a2023-01-15 23:58:18 +01001232
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001233 if (info->newcontents) {
1234 bool skipped = true;
1235 msg_cdbg("0x%06x-0x%06x:", info->region_start, info->region_end);
Richard Hughes842d6782021-01-15 09:48:12 +00001236 flashprog_progress_start(flashctx, FLASHPROG_PROGRESS_WRITE,
1237 info->region_end - info->region_start + 1);
Nico Huberc09fca42023-01-29 15:58:09 +01001238 ret = write_range(flashctx, info->region_start,
1239 info->curcontents + info->region_start,
1240 info->newcontents + info->region_start,
1241 info->region_end + 1 - info->region_start, &skipped);
1242 if (ret) {
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001243 msg_cerr("FAILED!\n");
Nico Huberc09fca42023-01-29 15:58:09 +01001244 goto free_ret;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001245 }
Richard Hughes842d6782021-01-15 09:48:12 +00001246 flashprog_progress_finish(flashctx);
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001247 if (skipped) {
1248 msg_cdbg("S\n");
1249 } else {
1250 msg_cdbg("\n");
1251 all_skipped = false;
1252 }
Nico Huberd34af7a2023-01-15 23:58:18 +01001253 }
Nico Huber7af0e792016-04-29 16:40:15 +02001254 }
1255 if (all_skipped)
1256 msg_cinfo("\nWarning: Chip content is identical to the requested image.\n");
1257 msg_cinfo("Erase/write done.\n");
Nico Huberc09fca42023-01-29 15:58:09 +01001258
1259free_ret:
1260 free_erase_layout(erase_layouts, layout_count);
1261 return ret;
Nico Huber7af0e792016-04-29 16:40:15 +02001262}
1263
1264static int erase_block(struct flashctx *const flashctx,
1265 const struct walk_info *const info, const erasefn_t erasefn)
1266{
1267 const unsigned int erase_len = info->erase_end + 1 - info->erase_start;
Nico Huber6e61e0c2019-01-23 17:07:49 +01001268 const bool region_unaligned = info->region_start > info->erase_start ||
1269 info->erase_end > info->region_end;
1270 uint8_t *backup_contents = NULL, *erased_contents = NULL;
Nico Huberd34af7a2023-01-15 23:58:18 +01001271 int ret = 1;
Nico Huber7af0e792016-04-29 16:40:15 +02001272
Nico Huber6e61e0c2019-01-23 17:07:49 +01001273 /*
1274 * If the region is not erase-block aligned, merge current flash con-
1275 * tents into a new buffer `backup_contents`.
1276 */
1277 if (region_unaligned) {
1278 backup_contents = malloc(erase_len);
1279 erased_contents = malloc(erase_len);
1280 if (!backup_contents || !erased_contents) {
1281 msg_cerr("Out of memory!\n");
Nico Huber6e61e0c2019-01-23 17:07:49 +01001282 goto _free_ret;
1283 }
1284 memset(backup_contents, ERASED_VALUE(flashctx), erase_len);
1285 memset(erased_contents, ERASED_VALUE(flashctx), erase_len);
1286
1287 msg_cdbg("R");
1288 /* Merge data preceding the current region. */
1289 if (info->region_start > info->erase_start) {
1290 const chipoff_t start = info->erase_start;
1291 const chipsize_t len = info->region_start - info->erase_start;
1292 if (flashctx->chip->read(flashctx, backup_contents, start, len)) {
1293 msg_cerr("Can't read! Aborting.\n");
1294 goto _free_ret;
1295 }
1296 }
1297 /* Merge data following the current region. */
1298 if (info->erase_end > info->region_end) {
1299 const chipoff_t start = info->region_end + 1;
1300 const chipoff_t rel_start = start - info->erase_start; /* within this erase block */
1301 const chipsize_t len = info->erase_end - info->region_end;
1302 if (flashctx->chip->read(flashctx, backup_contents + rel_start, start, len)) {
1303 msg_cerr("Can't read! Aborting.\n");
1304 goto _free_ret;
1305 }
1306 }
1307 }
1308
Nico Huber7af0e792016-04-29 16:40:15 +02001309 all_skipped = false;
1310
1311 msg_cdbg("E");
1312 if (erasefn(flashctx, info->erase_start, erase_len))
Nico Huber6e61e0c2019-01-23 17:07:49 +01001313 goto _free_ret;
Richard Hughes842d6782021-01-15 09:48:12 +00001314 flashprog_progress_add(flashctx, erase_len);
Nico Huber7af0e792016-04-29 16:40:15 +02001315 if (check_erased_range(flashctx, info->erase_start, erase_len)) {
1316 msg_cerr("ERASE FAILED!\n");
Nico Huber6e61e0c2019-01-23 17:07:49 +01001317 goto _free_ret;
Nico Huber7af0e792016-04-29 16:40:15 +02001318 }
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001319 if (info->curcontents)
1320 memset(info->curcontents + info->erase_start, ERASED_VALUE(flashctx), erase_len);
Nico Huber6e61e0c2019-01-23 17:07:49 +01001321
1322 if (region_unaligned) {
Nico Huber3b9c86d2023-01-15 22:58:06 +01001323 if (write_range(flashctx, info->erase_start, erased_contents, backup_contents, erase_len, NULL))
1324 goto _free_ret;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001325 if (info->curcontents)
1326 memcpy(info->curcontents + info->erase_start, backup_contents, erase_len);
Nico Huber6e61e0c2019-01-23 17:07:49 +01001327 }
1328
1329 ret = 0;
1330
1331_free_ret:
1332 free(erased_contents);
1333 free(backup_contents);
1334 return ret;
Nico Huber7af0e792016-04-29 16:40:15 +02001335}
1336
1337/**
1338 * @brief Erases the included layout regions.
1339 *
1340 * If there is no layout set in the given flash context, the whole chip will
1341 * be erased.
1342 *
1343 * @param flashctx Flash context to be used.
Nico Huber7af0e792016-04-29 16:40:15 +02001344 * @return 0 on success,
1345 * 1 if all available erase functions failed.
1346 */
Nico Huber454f6132012-12-10 13:34:10 +00001347static int erase_by_layout(struct flashctx *const flashctx)
Nico Huber7af0e792016-04-29 16:40:15 +02001348{
1349 struct walk_info info = { 0 };
1350 return walk_by_layout(flashctx, &info, &erase_block);
1351}
1352
Nico Huber7af0e792016-04-29 16:40:15 +02001353/**
1354 * @brief Writes the included layout regions from a given image.
1355 *
1356 * If there is no layout set in the given flash context, the whole image
1357 * will be written.
1358 *
1359 * @param flashctx Flash context to be used.
1360 * @param curcontents A buffer of full chip size with current chip contents of included regions.
1361 * @param newcontents The new image to be written.
1362 * @return 0 on success,
1363 * 1 if anything has gone wrong.
1364 */
Nico Huber454f6132012-12-10 13:34:10 +00001365static int write_by_layout(struct flashctx *const flashctx,
1366 void *const curcontents, const void *const newcontents)
Nico Huber7af0e792016-04-29 16:40:15 +02001367{
1368 struct walk_info info;
1369 info.curcontents = curcontents;
1370 info.newcontents = newcontents;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001371 return walk_by_layout(flashctx, &info, erase_block);
Nico Huber7af0e792016-04-29 16:40:15 +02001372}
1373
1374/**
1375 * @brief Compares the included layout regions with content from a buffer.
1376 *
1377 * If there is no layout set in the given flash context, the whole chip's
1378 * contents will be compared.
1379 *
1380 * @param flashctx Flash context to be used.
Nico Huber74d09d42019-06-16 03:27:26 +02001381 * @param layout Flash layout information.
Nico Huber7af0e792016-04-29 16:40:15 +02001382 * @param curcontents A buffer of full chip size to read current chip contents into.
1383 * @param newcontents The new image to compare to.
1384 * @return 0 on success,
1385 * 1 if reading failed,
1386 * 3 if the contents don't match.
1387 */
Nico Huber74d09d42019-06-16 03:27:26 +02001388static int verify_by_layout(
1389 struct flashctx *const flashctx,
Nico Huberc3b02dc2023-08-12 01:13:45 +02001390 const struct flashprog_layout *const layout,
Nico Huber74d09d42019-06-16 03:27:26 +02001391 void *const curcontents, const uint8_t *const newcontents)
Nico Huber7af0e792016-04-29 16:40:15 +02001392{
Nico Huber5ca55232019-06-15 22:29:08 +02001393 const struct romentry *entry = NULL;
Nico Huber7af0e792016-04-29 16:40:15 +02001394
Richard Hughes842d6782021-01-15 09:48:12 +00001395 flashprog_progress_start_by_layout(flashctx, FLASHPROG_PROGRESS_READ, layout);
1396
Nico Huber5ca55232019-06-15 22:29:08 +02001397 while ((entry = layout_next_included(layout, entry))) {
1398 const chipoff_t region_start = entry->start;
1399 const chipsize_t region_len = entry->end - entry->start + 1;
Nico Huber7af0e792016-04-29 16:40:15 +02001400
1401 if (flashctx->chip->read(flashctx, curcontents + region_start, region_start, region_len))
1402 return 1;
1403 if (compare_range(newcontents + region_start, curcontents + region_start,
1404 region_start, region_len))
1405 return 3;
1406 }
Richard Hughes842d6782021-01-15 09:48:12 +00001407
1408 flashprog_progress_finish(flashctx);
1409
Nico Huber7af0e792016-04-29 16:40:15 +02001410 return 0;
1411}
1412
Stefan Tauner136388f2013-07-15 10:47:53 +00001413static void nonfatal_help_message(void)
Carl-Daniel Hailfinger42d38a92010-10-19 22:06:20 +00001414{
Stefan Taunera58f6e92014-05-10 09:25:44 +00001415 msg_gerr("Good, writing to the flash chip apparently didn't do anything.\n");
Stefan Tauner136388f2013-07-15 10:47:53 +00001416#if CONFIG_INTERNAL == 1
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +02001417 if (programmer == &programmer_internal)
Stefan Tauner136388f2013-07-15 10:47:53 +00001418 msg_gerr("This means we have to add special support for your board, programmer or flash\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +02001419 "chip. Please report this to the mailing list at flashprog@flashprog.org or\n"
1420 "on IRC (see https://www.flashprog.org/Contact for details), thanks!\n"
Stefan Tauner136388f2013-07-15 10:47:53 +00001421 "-------------------------------------------------------------------------------\n"
1422 "You may now reboot or simply leave the machine running.\n");
1423 else
1424#endif
1425 msg_gerr("Please check the connections (especially those to write protection pins) between\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +02001426 "the programmer and the flash chip. If you think the error is caused by flashprog\n"
1427 "please report this to the mailing list at flashprog@flashprog.org or on IRC\n"
1428 "(see https://www.flashprog.org/Contact for details), thanks!\n");
Carl-Daniel Hailfinger42d38a92010-10-19 22:06:20 +00001429}
1430
Edward O'Callaghanc72d20a2021-12-13 12:30:03 +11001431void emergency_help_message(void)
Carl-Daniel Hailfinger8ab49e72009-08-19 13:55:34 +00001432{
Stefan Tauner136388f2013-07-15 10:47:53 +00001433 msg_gerr("Your flash chip is in an unknown state.\n");
1434#if CONFIG_INTERNAL == 1
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +02001435 if (programmer == &programmer_internal)
Nico Huberc3b02dc2023-08-12 01:13:45 +02001436 msg_gerr("Get help on IRC (see https://www.flashprog.org/Contact) or mail\n"
1437 "flashprog@flashprog.org with the subject \"FAILED: <your board name>\"!\n"
Stefan Tauner136388f2013-07-15 10:47:53 +00001438 "-------------------------------------------------------------------------------\n"
1439 "DO NOT REBOOT OR POWEROFF!\n");
1440 else
1441#endif
Nico Huberc3b02dc2023-08-12 01:13:45 +02001442 msg_gerr("Please report this to the mailing list at flashprog@flashprog.org\n"
1443 "or on IRC (see https://www.flashprog.org/Contact for details), thanks!\n");
Carl-Daniel Hailfinger8ab49e72009-08-19 13:55:34 +00001444}
1445
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001446void list_programmers_linebreak(int startcol, int cols, int paren)
1447{
1448 const char *pname;
Carl-Daniel Hailfinger082c8b52011-08-15 19:54:20 +00001449 int pnamelen;
1450 int remaining = 0, firstline = 1;
Thomas Heijligen9163b812021-06-01 14:25:01 +02001451 size_t p;
Carl-Daniel Hailfinger082c8b52011-08-15 19:54:20 +00001452 int i;
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001453
Thomas Heijligend45cb592021-05-19 14:12:18 +02001454 for (p = 0; p < programmer_table_size; p++) {
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001455 pname = programmer_table[p]->name;
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001456 pnamelen = strlen(pname);
1457 if (remaining - pnamelen - 2 < 0) {
1458 if (firstline)
1459 firstline = 0;
1460 else
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001461 msg_ginfo("\n");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001462 for (i = 0; i < startcol; i++)
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001463 msg_ginfo(" ");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001464 remaining = cols - startcol;
1465 } else {
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001466 msg_ginfo(" ");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001467 remaining--;
1468 }
1469 if (paren && (p == 0)) {
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001470 msg_ginfo("(");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001471 remaining--;
1472 }
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001473 msg_ginfo("%s", pname);
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001474 remaining -= pnamelen;
Thomas Heijligend45cb592021-05-19 14:12:18 +02001475 if (p < programmer_table_size - 1) {
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001476 msg_ginfo(",");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001477 remaining--;
1478 } else {
1479 if (paren)
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001480 msg_ginfo(")");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001481 }
1482 }
1483}
1484
Carl-Daniel Hailfinger552420b2009-12-24 02:15:55 +00001485int selfcheck(void)
1486{
Stefan Tauner96658be2014-05-26 22:05:31 +00001487 unsigned int i;
Stefan Taunera6d96482012-12-26 19:51:23 +00001488 int ret = 0;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +00001489
Thomas Heijligend45cb592021-05-19 14:12:18 +02001490 for (i = 0; i < programmer_table_size; i++) {
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001491 const struct programmer_entry *const p = programmer_table[i];
1492 if (p == NULL) {
1493 msg_gerr("Programmer with index %d is NULL instead of a valid pointer!\n", i);
1494 ret = 1;
1495 continue;
1496 }
1497 if (p->name == NULL) {
Stefan Taunera6d96482012-12-26 19:51:23 +00001498 msg_gerr("All programmers need a valid name, but the one with index %d does not!\n", i);
1499 ret = 1;
1500 /* This might hide other problems with this programmer, but allows for better error
1501 * messages below without jumping through hoops. */
1502 continue;
1503 }
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001504 switch (p->type) {
Stefan Tauneraf358d62012-12-27 18:40:26 +00001505 case USB:
1506 case PCI:
1507 case OTHER:
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001508 if (p->devs.note == NULL) {
1509 if (strcmp("internal", p->name) == 0)
Stefan Tauneraf358d62012-12-27 18:40:26 +00001510 break; /* This one has its device list stored separately. */
1511 msg_gerr("Programmer %s has neither a device list nor a textual description!\n",
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001512 p->name);
Stefan Tauneraf358d62012-12-27 18:40:26 +00001513 ret = 1;
1514 }
1515 break;
1516 default:
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001517 msg_gerr("Programmer %s does not have a valid type set!\n", p->name);
Stefan Tauneraf358d62012-12-27 18:40:26 +00001518 ret = 1;
1519 break;
1520 }
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001521 if (p->init == NULL) {
1522 msg_gerr("Programmer %s does not have a valid init function!\n", p->name);
Stefan Taunera6d96482012-12-26 19:51:23 +00001523 ret = 1;
1524 }
Stefan Taunera6d96482012-12-26 19:51:23 +00001525 }
Stefan Tauner96658be2014-05-26 22:05:31 +00001526
1527 /* It would be favorable if we could check for the correct layout (especially termination) of various
1528 * constant arrays: flashchips, chipset_enables, board_matches, boards_known, laptops_known.
1529 * They are all defined as externs in this compilation unit so we don't know their sizes which vary
1530 * depending on compiler flags, e.g. the target architecture, and can sometimes be 0.
1531 * For 'flashchips' we export the size explicitly to work around this and to be able to implement the
1532 * checks below. */
Stefan Tauner6697f712014-08-06 15:09:15 +00001533 if (flashchips_size <= 1 || flashchips[flashchips_size - 1].name != NULL) {
Stefan Tauner7bcacb12011-05-26 01:35:19 +00001534 msg_gerr("Flashchips table miscompilation!\n");
1535 ret = 1;
Stefan Tauner96658be2014-05-26 22:05:31 +00001536 } else {
1537 for (i = 0; i < flashchips_size - 1; i++) {
1538 const struct flashchip *chip = &flashchips[i];
1539 if (chip->vendor == NULL || chip->name == NULL || chip->bustype == BUS_NONE) {
1540 ret = 1;
1541 msg_gerr("ERROR: Some field of flash chip #%d (%s) is misconfigured.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +02001542 "Please report a bug at flashprog@flashprog.org\n", i,
Stefan Tauner96658be2014-05-26 22:05:31 +00001543 chip->name == NULL ? "unnamed" : chip->name);
1544 }
Nico Huber930d4212024-05-04 18:59:15 +02001545 if (chip->feature_bits &
1546 (FEATURE_4BA_ENTER | FEATURE_4BA_ENTER_WREN | FEATURE_4BA_ENTER_EAR7 |
1547 FEATURE_ANY_DUAL | FEATURE_ANY_QUAD)
1548 && !chip->prepare_access) {
1549 msg_gerr("ERROR: Flash chip #%d (%s) misses chip\n"
1550 "preparation function for 4BA and multi-i/o modes.\n"
1551 "Please report a bug at flashprog@flashprog.org\n", i,
1552 chip->name == NULL ? "unnamed" : chip->name);
1553 ret = 1;
1554 }
Stefan Tauner96658be2014-05-26 22:05:31 +00001555 if (selfcheck_eraseblocks(chip)) {
1556 ret = 1;
1557 }
1558 }
Stefan Tauner7bcacb12011-05-26 01:35:19 +00001559 }
Stefan Tauner7bcacb12011-05-26 01:35:19 +00001560
Stefan Tauner600576b2014-06-12 22:57:36 +00001561#if CONFIG_INTERNAL == 1
1562 ret |= selfcheck_board_enables();
1563#endif
1564
Stefan Tauner96658be2014-05-26 22:05:31 +00001565 /* TODO: implement similar sanity checks for other arrays where deemed necessary. */
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +00001566 return ret;
Carl-Daniel Hailfinger552420b2009-12-24 02:15:55 +00001567}
1568
Edward O'Callaghanacb24d42021-04-15 13:44:39 +10001569/* FIXME: This function signature needs to be improved once prepare_flash_access()
1570 * has a better function signature.
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001571 */
Jacob Garberbeeb8bc2019-06-21 15:24:17 -06001572static int chip_safety_check(const struct flashctx *flash, int force,
1573 int read_it, int write_it, int erase_it, int verify_it)
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001574{
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +00001575 const struct flashchip *chip = flash->chip;
1576
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001577 if (!programmer_may_write && (write_it || erase_it)) {
1578 msg_perr("Write/erase is not working yet on your programmer in "
1579 "its current configuration.\n");
1580 /* --force is the wrong approach, but it's the best we can do
1581 * until the generic programmer parameter parser is merged.
1582 */
1583 if (!force)
1584 return 1;
1585 msg_cerr("Continuing anyway.\n");
1586 }
1587
1588 if (read_it || erase_it || write_it || verify_it) {
1589 /* Everything needs read. */
Stefan Tauner6455dff2014-05-26 00:36:24 +00001590 if (chip->tested.read == BAD) {
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001591 msg_cerr("Read is not working on this chip. ");
1592 if (!force)
1593 return 1;
1594 msg_cerr("Continuing anyway.\n");
1595 }
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +00001596 if (!chip->read) {
Nico Huberc3b02dc2023-08-12 01:13:45 +02001597 msg_cerr("flashprog has no read function for this "
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001598 "flash chip.\n");
1599 return 1;
1600 }
1601 }
1602 if (erase_it || write_it) {
1603 /* Write needs erase. */
Stefan Tauner6455dff2014-05-26 00:36:24 +00001604 if (chip->tested.erase == NA) {
1605 msg_cerr("Erase is not possible on this chip.\n");
1606 return 1;
1607 }
1608 if (chip->tested.erase == BAD) {
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001609 msg_cerr("Erase is not working on this chip. ");
1610 if (!force)
1611 return 1;
1612 msg_cerr("Continuing anyway.\n");
1613 }
Sylvain "ythier" Hitier9db45512011-07-04 07:27:17 +00001614 if(count_usable_erasers(flash) == 0) {
Nico Huberc3b02dc2023-08-12 01:13:45 +02001615 msg_cerr("flashprog has no erase function for this "
Stefan Tauner5368dca2011-07-01 00:19:12 +00001616 "flash chip.\n");
1617 return 1;
1618 }
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001619 }
1620 if (write_it) {
Stefan Tauner6455dff2014-05-26 00:36:24 +00001621 if (chip->tested.write == NA) {
1622 msg_cerr("Write is not possible on this chip.\n");
1623 return 1;
1624 }
1625 if (chip->tested.write == BAD) {
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001626 msg_cerr("Write is not working on this chip. ");
1627 if (!force)
1628 return 1;
1629 msg_cerr("Continuing anyway.\n");
1630 }
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +00001631 if (!chip->write) {
Nico Huberc3b02dc2023-08-12 01:13:45 +02001632 msg_cerr("flashprog has no write function for this "
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001633 "flash chip.\n");
1634 return 1;
1635 }
1636 }
1637 return 0;
1638}
1639
Nico Huber305f4172013-06-14 11:55:26 +02001640int prepare_flash_access(struct flashctx *const flash,
1641 const bool read_it, const bool write_it,
1642 const bool erase_it, const bool verify_it)
Nico Huber454f6132012-12-10 13:34:10 +00001643{
1644 if (chip_safety_check(flash, flash->flags.force, read_it, write_it, erase_it, verify_it)) {
1645 msg_cerr("Aborting.\n");
1646 return 1;
1647 }
1648
Nico Huber3ac761c2023-01-16 02:43:17 +01001649 if (layout_sanity_checks(flash, write_it)) {
Nico Huber454f6132012-12-10 13:34:10 +00001650 msg_cerr("Requested regions can not be handled. Aborting.\n");
1651 return 1;
1652 }
1653
Nico Huber901fb952023-01-11 23:24:23 +01001654 if (flash->chip->prepare_access && flash->chip->prepare_access(flash, PREPARE_FULL))
1655 return 1;
1656
Nikolai Artemiev4ad48642020-11-05 13:54:27 +11001657 /* Initialize chip_restore_fn_count before chip unlock calls. */
1658 flash->chip_restore_fn_count = 0;
1659
Nico Huber454f6132012-12-10 13:34:10 +00001660 /* Given the existence of read locks, we want to unlock for read,
1661 erase and write. */
1662 if (flash->chip->unlock)
1663 flash->chip->unlock(flash);
1664
1665 return 0;
1666}
1667
Nico Huber305f4172013-06-14 11:55:26 +02001668void finalize_flash_access(struct flashctx *const flash)
Nico Huber454f6132012-12-10 13:34:10 +00001669{
Nikolai Artemiev4ad48642020-11-05 13:54:27 +11001670 deregister_chip_restore(flash);
Nico Huber901fb952023-01-11 23:24:23 +01001671 if (flash->chip->finish_access)
1672 flash->chip->finish_access(flash);
Nico Huber454f6132012-12-10 13:34:10 +00001673}
1674
1675/**
Nico Huberc3b02dc2023-08-12 01:13:45 +02001676 * @addtogroup flashprog-flash
Nico Huber454f6132012-12-10 13:34:10 +00001677 * @{
1678 */
1679
1680/**
1681 * @brief Erase the specified ROM chip.
1682 *
1683 * If a layout is set in the given flash context, only included regions
1684 * will be erased.
1685 *
1686 * @param flashctx The context of the flash chip to erase.
1687 * @return 0 on success.
1688 */
Nico Huberc3b02dc2023-08-12 01:13:45 +02001689int flashprog_flash_erase(struct flashctx *const flashctx)
Nico Huber454f6132012-12-10 13:34:10 +00001690{
1691 if (prepare_flash_access(flashctx, false, false, true, false))
1692 return 1;
1693
1694 const int ret = erase_by_layout(flashctx);
1695
1696 finalize_flash_access(flashctx);
1697
1698 return ret;
1699}
1700
Nico Huberc3b02dc2023-08-12 01:13:45 +02001701/** @} */ /* end flashprog-flash */
Nico Huber454f6132012-12-10 13:34:10 +00001702
1703/**
Nico Huberc3b02dc2023-08-12 01:13:45 +02001704 * @defgroup flashprog-ops Operations
Nico Huber454f6132012-12-10 13:34:10 +00001705 * @{
1706 */
1707
1708/**
1709 * @brief Read the current image from the specified ROM chip.
1710 *
1711 * If a layout is set in the specified flash context, only included regions
1712 * will be read.
1713 *
1714 * @param flashctx The context of the flash chip.
1715 * @param buffer Target buffer to write image to.
1716 * @param buffer_len Size of target buffer in bytes.
1717 * @return 0 on success,
1718 * 2 if buffer_len is too short for the flash chip's contents,
1719 * or 1 on any other failure.
1720 */
Nico Huberc3b02dc2023-08-12 01:13:45 +02001721int flashprog_image_read(struct flashctx *const flashctx, void *const buffer, const size_t buffer_len)
Nico Huber454f6132012-12-10 13:34:10 +00001722{
1723 const size_t flash_size = flashctx->chip->total_size * 1024;
1724
1725 if (flash_size > buffer_len)
1726 return 2;
1727
1728 if (prepare_flash_access(flashctx, true, false, false, false))
1729 return 1;
1730
1731 msg_cinfo("Reading flash... ");
1732
1733 int ret = 1;
1734 if (read_by_layout(flashctx, buffer)) {
1735 msg_cerr("Read operation failed!\n");
1736 msg_cinfo("FAILED.\n");
1737 goto _finalize_ret;
1738 }
1739 msg_cinfo("done.\n");
1740 ret = 0;
1741
1742_finalize_ret:
1743 finalize_flash_access(flashctx);
1744 return ret;
1745}
1746
1747static void combine_image_by_layout(const struct flashctx *const flashctx,
1748 uint8_t *const newcontents, const uint8_t *const oldcontents)
1749{
Nico Huberc3b02dc2023-08-12 01:13:45 +02001750 const struct flashprog_layout *const layout = get_layout(flashctx);
Nico Huber3d7b1e32018-12-22 00:53:14 +01001751 const struct romentry *included;
1752 chipoff_t start = 0;
Nico Huber454f6132012-12-10 13:34:10 +00001753
Nico Huber3d7b1e32018-12-22 00:53:14 +01001754 while ((included = layout_next_included_region(layout, start))) {
1755 if (included->start > start) {
1756 /* copy everything up to the start of this included region */
1757 memcpy(newcontents + start, oldcontents + start, included->start - start);
1758 }
1759 /* skip this included region */
1760 start = included->end + 1;
1761 if (start == 0)
1762 return;
Nico Huber454f6132012-12-10 13:34:10 +00001763 }
Nico Huber3d7b1e32018-12-22 00:53:14 +01001764
1765 /* copy the rest of the chip */
1766 const chipsize_t copy_len = flashctx->chip->total_size * 1024 - start;
1767 memcpy(newcontents + start, oldcontents + start, copy_len);
Nico Huber454f6132012-12-10 13:34:10 +00001768}
1769
1770/**
1771 * @brief Write the specified image to the ROM chip.
1772 *
1773 * If a layout is set in the specified flash context, only erase blocks
1774 * containing included regions will be touched.
1775 *
1776 * @param flashctx The context of the flash chip.
Nico Huber1b172f22017-06-19 12:35:24 +02001777 * @param buffer Source buffer to read image from (may be altered for full verification).
Nico Huber454f6132012-12-10 13:34:10 +00001778 * @param buffer_len Size of source buffer in bytes.
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001779 * @param refbuffer If given, assume flash chip contains same data as `refbuffer`.
Nico Huber454f6132012-12-10 13:34:10 +00001780 * @return 0 on success,
1781 * 4 if buffer_len doesn't match the size of the flash chip,
1782 * 3 if write was tried but nothing has changed,
1783 * 2 if write failed and flash contents changed,
1784 * or 1 on any other failure.
1785 */
Nico Huberc3b02dc2023-08-12 01:13:45 +02001786int flashprog_image_write(struct flashctx *const flashctx, void *const buffer, const size_t buffer_len,
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001787 const void *const refbuffer)
Nico Huber454f6132012-12-10 13:34:10 +00001788{
1789 const size_t flash_size = flashctx->chip->total_size * 1024;
1790 const bool verify_all = flashctx->flags.verify_whole_chip;
1791 const bool verify = flashctx->flags.verify_after_write;
Nico Huberc3b02dc2023-08-12 01:13:45 +02001792 const struct flashprog_layout *const verify_layout =
Nico Huber74d09d42019-06-16 03:27:26 +02001793 verify_all ? get_default_layout(flashctx) : get_layout(flashctx);
Nico Huber454f6132012-12-10 13:34:10 +00001794
1795 if (buffer_len != flash_size)
1796 return 4;
1797
1798 int ret = 1;
1799
1800 uint8_t *const newcontents = buffer;
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001801 const uint8_t *const refcontents = refbuffer;
Nico Huber454f6132012-12-10 13:34:10 +00001802 uint8_t *const curcontents = malloc(flash_size);
1803 uint8_t *oldcontents = NULL;
1804 if (verify_all)
1805 oldcontents = malloc(flash_size);
1806 if (!curcontents || (verify_all && !oldcontents)) {
1807 msg_gerr("Out of memory!\n");
1808 goto _free_ret;
1809 }
1810
1811#if CONFIG_INTERNAL == 1
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +02001812 if (programmer == &programmer_internal && cb_check_image(newcontents, flash_size) < 0) {
Nico Huber454f6132012-12-10 13:34:10 +00001813 if (flashctx->flags.force_boardmismatch) {
1814 msg_pinfo("Proceeding anyway because user forced us to.\n");
1815 } else {
1816 msg_perr("Aborting. You can override this with "
1817 "-p internal:boardmismatch=force.\n");
1818 goto _free_ret;
1819 }
1820 }
1821#endif
1822
1823 if (prepare_flash_access(flashctx, false, true, false, verify))
1824 goto _free_ret;
1825
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001826 /* If given, assume flash chip contains same data as `refcontents`. */
1827 if (refcontents) {
1828 msg_cinfo("Assuming old flash chip contents as ref-file...\n");
1829 memcpy(curcontents, refcontents, flash_size);
1830 if (oldcontents)
1831 memcpy(oldcontents, refcontents, flash_size);
Nico Huber454f6132012-12-10 13:34:10 +00001832 } else {
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001833 /*
1834 * Read the whole chip to be able to check whether regions need to be
1835 * erased and to give better diagnostics in case write fails.
1836 * The alternative is to read only the regions which are to be
1837 * preserved, but in that case we might perform unneeded erase which
1838 * takes time as well.
1839 */
1840 msg_cinfo("Reading old flash chip contents... ");
1841 if (verify_all) {
Richard Hughes842d6782021-01-15 09:48:12 +00001842 if (flashprog_read_range(flashctx, oldcontents, 0, flash_size)) {
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001843 msg_cinfo("FAILED.\n");
1844 goto _finalize_ret;
1845 }
1846 memcpy(curcontents, oldcontents, flash_size);
1847 } else {
1848 if (read_by_layout(flashctx, curcontents)) {
1849 msg_cinfo("FAILED.\n");
1850 goto _finalize_ret;
1851 }
Nico Huber454f6132012-12-10 13:34:10 +00001852 }
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001853 msg_cinfo("done.\n");
Nico Huber454f6132012-12-10 13:34:10 +00001854 }
Nico Huber454f6132012-12-10 13:34:10 +00001855
1856 if (write_by_layout(flashctx, curcontents, newcontents)) {
1857 msg_cerr("Uh oh. Erase/write failed. ");
1858 ret = 2;
1859 if (verify_all) {
1860 msg_cerr("Checking if anything has changed.\n");
1861 msg_cinfo("Reading current flash chip contents... ");
Richard Hughes842d6782021-01-15 09:48:12 +00001862 if (!flashprog_read_range(flashctx, curcontents, 0, flash_size)) {
Nico Huber454f6132012-12-10 13:34:10 +00001863 msg_cinfo("done.\n");
1864 if (!memcmp(oldcontents, curcontents, flash_size)) {
1865 nonfatal_help_message();
1866 goto _finalize_ret;
1867 }
1868 msg_cerr("Apparently at least some data has changed.\n");
1869 } else
1870 msg_cerr("Can't even read anymore!\n");
1871 emergency_help_message();
1872 goto _finalize_ret;
1873 } else {
1874 msg_cerr("\n");
1875 }
1876 emergency_help_message();
1877 goto _finalize_ret;
1878 }
1879
1880 /* Verify only if we actually changed something. */
1881 if (verify && !all_skipped) {
Nico Huber454f6132012-12-10 13:34:10 +00001882 msg_cinfo("Verifying flash... ");
1883
1884 /* Work around chips which need some time to calm down. */
1885 programmer_delay(1000*1000);
1886
Nico Huber74d09d42019-06-16 03:27:26 +02001887 if (verify_all)
Nico Huber454f6132012-12-10 13:34:10 +00001888 combine_image_by_layout(flashctx, newcontents, oldcontents);
Nico Huber74d09d42019-06-16 03:27:26 +02001889 ret = verify_by_layout(flashctx, verify_layout, curcontents, newcontents);
Nico Huber454f6132012-12-10 13:34:10 +00001890 /* If we tried to write, and verification now fails, we
1891 might have an emergency situation. */
1892 if (ret)
1893 emergency_help_message();
1894 else
1895 msg_cinfo("VERIFIED.\n");
1896 } else {
1897 /* We didn't change anything. */
1898 ret = 0;
1899 }
1900
1901_finalize_ret:
1902 finalize_flash_access(flashctx);
1903_free_ret:
1904 free(oldcontents);
1905 free(curcontents);
1906 return ret;
1907}
1908
1909/**
1910 * @brief Verify the ROM chip's contents with the specified image.
1911 *
1912 * If a layout is set in the specified flash context, only included regions
1913 * will be verified.
1914 *
1915 * @param flashctx The context of the flash chip.
1916 * @param buffer Source buffer to verify with.
1917 * @param buffer_len Size of source buffer in bytes.
1918 * @return 0 on success,
1919 * 3 if the chip's contents don't match,
1920 * 2 if buffer_len doesn't match the size of the flash chip,
1921 * or 1 on any other failure.
1922 */
Nico Huberc3b02dc2023-08-12 01:13:45 +02001923int flashprog_image_verify(struct flashctx *const flashctx, const void *const buffer, const size_t buffer_len)
Nico Huber454f6132012-12-10 13:34:10 +00001924{
Nico Huberc3b02dc2023-08-12 01:13:45 +02001925 const struct flashprog_layout *const layout = get_layout(flashctx);
Nico Huber454f6132012-12-10 13:34:10 +00001926 const size_t flash_size = flashctx->chip->total_size * 1024;
1927
1928 if (buffer_len != flash_size)
1929 return 2;
1930
1931 const uint8_t *const newcontents = buffer;
1932 uint8_t *const curcontents = malloc(flash_size);
1933 if (!curcontents) {
1934 msg_gerr("Out of memory!\n");
1935 return 1;
1936 }
1937
1938 int ret = 1;
1939
1940 if (prepare_flash_access(flashctx, false, false, false, true))
1941 goto _free_ret;
1942
1943 msg_cinfo("Verifying flash... ");
Nico Huber74d09d42019-06-16 03:27:26 +02001944 ret = verify_by_layout(flashctx, layout, curcontents, newcontents);
Nico Huber454f6132012-12-10 13:34:10 +00001945 if (!ret)
1946 msg_cinfo("VERIFIED.\n");
1947
1948 finalize_flash_access(flashctx);
1949_free_ret:
1950 free(curcontents);
1951 return ret;
1952}
1953
Nico Huberc3b02dc2023-08-12 01:13:45 +02001954/** @} */ /* end flashprog-ops */