blob: 07025d9600a4a1bf6a3d353bb10565c3554c76c9 [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"
Nico Huber9d09e0f2025-03-02 22:55:10 +010036#include "version.h"
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +000037
Nico Huberc3b02dc2023-08-12 01:13:45 +020038const char flashprog_version[] = FLASHPROG_VERSION;
Nico Huberbcb2e5a2012-12-30 01:23:17 +000039const char *chip_to_probe = NULL;
Carl-Daniel Hailfinger66ef4e52009-12-13 22:28:00 +000040
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +020041static const struct programmer_entry *programmer = NULL;
Nico Huber6a2ebeb2022-08-26 11:36:48 +020042static char *programmer_param = NULL;
Stefan Reinauer70385642007-04-06 11:58:03 +000043
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +000044/* If nonzero, used as the start address of bottom-aligned flash. */
45unsigned long flashbase;
Carl-Daniel Hailfinger66ef4e52009-12-13 22:28:00 +000046
Carl-Daniel Hailfingerd1be52d2010-07-03 12:14:25 +000047/* Is writing allowed with this programmer? */
Felix Singer980d6b82022-08-19 02:48:15 +020048bool programmer_may_write;
Carl-Daniel Hailfingerd1be52d2010-07-03 12:14:25 +000049
Carl-Daniel Hailfinger2bee8cf2010-11-10 15:25:18 +000050#define SHUTDOWN_MAXFN 32
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000051static int shutdown_fn_count = 0;
Nico Huber454f6132012-12-10 13:34:10 +000052/** @private */
Richard Hughes93e16252018-12-19 11:54:47 +000053static struct shutdown_func_data {
David Hendricks8bb20212011-06-14 01:35:36 +000054 int (*func) (void *data);
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000055 void *data;
Richard Hughes93e16252018-12-19 11:54:47 +000056} shutdown_fn[SHUTDOWN_MAXFN];
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +000057/* Initialize to 0 to make sure nobody registers a shutdown function before
58 * programmer init.
59 */
Felix Singerf25447e2022-08-19 02:44:28 +020060static bool may_register_shutdown = false;
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000061
Stefan Taunerc4f44df2013-08-12 22:58:43 +000062/* Did we change something or was every erase/write skipped (if any)? */
63static bool all_skipped = true;
64
Carl-Daniel Hailfinger63fd9022011-12-14 22:25:15 +000065static int check_block_eraser(const struct flashctx *flash, int k, int log);
Stefan Tauner5368dca2011-07-01 00:19:12 +000066
Stefan Tauner2a1ed772014-08-31 00:09:21 +000067int shutdown_free(void *data)
68{
69 free(data);
70 return 0;
71}
72
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000073/* Register a function to be executed on programmer shutdown.
74 * The advantage over atexit() is that you can supply a void pointer which will
75 * be used as parameter to the registered function upon programmer shutdown.
76 * This pointer can point to arbitrary data used by said function, e.g. undo
77 * information for GPIO settings etc. If unneeded, set data=NULL.
78 * Please note that the first (void *data) belongs to the function signature of
79 * the function passed as first parameter.
80 */
David Hendricks8bb20212011-06-14 01:35:36 +000081int register_shutdown(int (*function) (void *data), void *data)
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000082{
83 if (shutdown_fn_count >= SHUTDOWN_MAXFN) {
Carl-Daniel Hailfinger9f5f2152010-06-04 23:20:21 +000084 msg_perr("Tried to register more than %i shutdown functions.\n",
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000085 SHUTDOWN_MAXFN);
86 return 1;
87 }
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +000088 if (!may_register_shutdown) {
89 msg_perr("Tried to register a shutdown function before "
90 "programmer init.\n");
91 return 1;
92 }
Carl-Daniel Hailfingercc389fc2010-02-14 01:20:28 +000093 shutdown_fn[shutdown_fn_count].func = function;
94 shutdown_fn[shutdown_fn_count].data = data;
95 shutdown_fn_count++;
96
97 return 0;
98}
99
Nikolai Artemiev4ad48642020-11-05 13:54:27 +1100100int register_chip_restore(chip_restore_fn_cb_t func,
101 struct flashctx *flash, uint8_t status)
102{
103 if (flash->chip_restore_fn_count >= MAX_CHIP_RESTORE_FUNCTIONS) {
104 msg_perr("Tried to register more than %i chip restore"
105 " functions.\n", MAX_CHIP_RESTORE_FUNCTIONS);
106 return 1;
107 }
108 flash->chip_restore_fn[flash->chip_restore_fn_count].func = func;
109 flash->chip_restore_fn[flash->chip_restore_fn_count].status = status;
110 flash->chip_restore_fn_count++;
111
112 return 0;
113}
114
115static int deregister_chip_restore(struct flashctx *flash)
116{
117 int rc = 0;
118
119 while (flash->chip_restore_fn_count > 0) {
120 int i = --flash->chip_restore_fn_count;
121 rc |= flash->chip_restore_fn[i].func(
122 flash, flash->chip_restore_fn[i].status);
123 }
124
125 return rc;
126}
127
Nico Huber2b66ad92023-01-11 20:15:15 +0100128int programmer_init(struct flashprog_programmer *const prog)
Uwe Hermann09e04f72009-05-16 22:36:00 +0000129{
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000130 int ret;
Carl-Daniel Hailfinger2e681602011-09-08 00:00:29 +0000131
Nico Huber2b66ad92023-01-11 20:15:15 +0100132 if (prog == NULL || prog->driver == NULL) {
Carl-Daniel Hailfinger2e681602011-09-08 00:00:29 +0000133 msg_perr("Invalid programmer specified!\n");
134 return -1;
135 }
Nico Huber2b66ad92023-01-11 20:15:15 +0100136 programmer = prog->driver;
137 programmer_param = prog->param;
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000138 /* Initialize all programmer specific data. */
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000139 /* Default to top aligned flash at 4 GB. */
140 flashbase = 0;
141 /* Registering shutdown functions is now allowed. */
Felix Singerf25447e2022-08-19 02:44:28 +0200142 may_register_shutdown = true;
Carl-Daniel Hailfingerd1be52d2010-07-03 12:14:25 +0000143 /* Default to allowing writes. Broken programmers set this to 0. */
Felix Singer980d6b82022-08-19 02:48:15 +0200144 programmer_may_write = true;
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000145
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +0200146 msg_pdbg("Initializing %s programmer\n", programmer->name);
Nico Hubere3a26882023-01-11 21:45:51 +0100147 ret = programmer->init(prog);
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000148 if (programmer_param && strlen(programmer_param)) {
Carl-Daniel Hailfinger20a36ba2013-08-13 07:09:57 +0000149 if (ret != 0) {
150 /* It is quite possible that any unhandled programmer parameter would have been valid,
151 * but an error in actual programmer init happened before the parameter was evaluated.
152 */
153 msg_pwarn("Unhandled programmer parameters (possibly due to another failure): %s\n",
154 programmer_param);
155 } else {
156 /* Actual programmer init was successful, but the user specified an invalid or unusable
157 * (for the current programmer configuration) parameter.
158 */
159 msg_perr("Unhandled programmer parameters: %s\n", programmer_param);
160 msg_perr("Aborting.\n");
161 ret = ERROR_FATAL;
162 }
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000163 }
Nico Huber6a2ebeb2022-08-26 11:36:48 +0200164 programmer_param = NULL;
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000165 return ret;
Uwe Hermann09e04f72009-05-16 22:36:00 +0000166}
167
Stefan Tauner20da4aa2014-05-07 22:07:23 +0000168/** Calls registered shutdown functions and resets internal programmer-related variables.
169 * Calling it is safe even without previous initialization, but further interactions with programmer support
170 * require a call to programmer_init() (afterwards).
171 *
172 * @return The OR-ed result values of all shutdown functions (i.e. 0 on success). */
Nico Huber2b66ad92023-01-11 20:15:15 +0100173int programmer_shutdown(struct flashprog_programmer *const prog)
Uwe Hermann09e04f72009-05-16 22:36:00 +0000174{
David Hendricks8bb20212011-06-14 01:35:36 +0000175 int ret = 0;
176
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000177 /* Registering shutdown functions is no longer allowed. */
Felix Singerf25447e2022-08-19 02:44:28 +0200178 may_register_shutdown = false;
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000179 while (shutdown_fn_count > 0) {
180 int i = --shutdown_fn_count;
David Hendricks8bb20212011-06-14 01:35:36 +0000181 ret |= shutdown_fn[i].func(shutdown_fn[i].data);
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +0000182 }
Carl-Daniel Hailfingera5bcbce2014-07-19 22:03:29 +0000183 registered_master_count = 0;
Stefan Taunere34e3e82013-01-01 00:06:51 +0000184
David Hendricks8bb20212011-06-14 01:35:36 +0000185 return ret;
Uwe Hermann09e04f72009-05-16 22:36:00 +0000186}
187
Stefan Taunerf80419c2014-05-02 15:41:42 +0000188void programmer_delay(unsigned int usecs)
Carl-Daniel Hailfingerca8bfc62009-06-05 17:48:08 +0000189{
Edward O'Callaghan56684d92022-09-07 10:47:45 +1000190 if (usecs > 0) {
191 if (programmer->delay)
192 programmer->delay(usecs);
193 else
194 internal_delay(usecs);
195 }
Carl-Daniel Hailfingerca8bfc62009-06-05 17:48:08 +0000196}
197
Nico Hubercdcfda22023-04-29 13:29:33 +0200198static int read_memmapped_chunk(struct flashctx *flash, uint8_t *buf, unsigned int start, unsigned int len)
Carl-Daniel Hailfinger03b4e712009-05-08 12:49:03 +0000199{
Carl-Daniel Hailfinger8a3c60c2011-12-18 15:01:24 +0000200 chip_readn(flash, buf, flash->virtual_memory + start, len);
Carl-Daniel Hailfinger03b4e712009-05-08 12:49:03 +0000201 return 0;
202}
Nico Hubercdcfda22023-04-29 13:29:33 +0200203int read_memmapped(struct flashctx *flash, uint8_t *buf, unsigned int start, int unsigned len)
204{
205 return flashprog_read_chunked(flash, buf, start, len, MAX_DATA_READ_UNLIMITED, read_memmapped_chunk);
206}
Carl-Daniel Hailfinger03b4e712009-05-08 12:49:03 +0000207
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000208/* This is a somewhat hacked function similar in some ways to strtok().
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000209 * It will look for needle with a subsequent '=' in haystack, return a copy of
210 * needle and remove everything from the first occurrence of needle to the next
211 * delimiter from haystack.
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000212 */
Nico Huber6a2ebeb2022-08-26 11:36:48 +0200213static char *extract_param(char *const *haystack, const char *needle, const char *delim)
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000214{
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000215 char *param_pos, *opt_pos, *rest;
216 char *opt = NULL;
217 int optlen;
Carl-Daniel Hailfinger27023762010-04-28 15:22:14 +0000218 int needlelen;
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000219
Carl-Daniel Hailfinger27023762010-04-28 15:22:14 +0000220 needlelen = strlen(needle);
221 if (!needlelen) {
222 msg_gerr("%s: empty needle! Please report a bug at "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200223 "flashprog@flashprog.org\n", __func__);
Carl-Daniel Hailfinger27023762010-04-28 15:22:14 +0000224 return NULL;
225 }
226 /* No programmer parameters given. */
227 if (*haystack == NULL)
228 return NULL;
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000229 param_pos = strstr(*haystack, needle);
230 do {
231 if (!param_pos)
232 return NULL;
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000233 /* Needle followed by '='? */
234 if (param_pos[needlelen] == '=') {
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000235 /* Beginning of the string? */
236 if (param_pos == *haystack)
237 break;
238 /* After a delimiter? */
239 if (strchr(delim, *(param_pos - 1)))
240 break;
241 }
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000242 /* Continue searching. */
243 param_pos++;
244 param_pos = strstr(param_pos, needle);
245 } while (1);
Uwe Hermann91f4afa2011-07-28 08:13:25 +0000246
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000247 if (param_pos) {
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000248 /* Get the string after needle and '='. */
249 opt_pos = param_pos + needlelen + 1;
250 optlen = strcspn(opt_pos, delim);
251 /* Return an empty string if the parameter was empty. */
252 opt = malloc(optlen + 1);
253 if (!opt) {
Sean Nelson316a29f2010-05-07 20:09:04 +0000254 msg_gerr("Out of memory!\n");
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000255 exit(1);
256 }
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000257 strncpy(opt, opt_pos, optlen);
258 opt[optlen] = '\0';
259 rest = opt_pos + optlen;
260 /* Skip all delimiters after the current parameter. */
261 rest += strspn(rest, delim);
262 memmove(param_pos, rest, strlen(rest) + 1);
263 /* We could shrink haystack, but the effort is not worth it. */
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000264 }
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000265
Carl-Daniel Hailfinger744132a2010-07-06 09:55:48 +0000266 return opt;
Carl-Daniel Hailfingerd5b28fa2009-11-24 18:27:10 +0000267}
268
Stefan Tauner66652442011-06-26 17:38:17 +0000269char *extract_programmer_param(const char *param_name)
Carl-Daniel Hailfinger2b6dcb32010-07-08 10:13:37 +0000270{
271 return extract_param(&programmer_param, param_name, ",");
272}
273
Richard Hughes842d6782021-01-15 09:48:12 +0000274static void flashprog_progress_report(struct flashprog_progress *const p)
275{
276 if (p->current > p->total) {
277 msg_gdbg2("Sanitizing progress report: %zu bytes off.", p->current - p->total);
278 p->current = p->total;
279 }
280
281 if (!p->callback)
282 return;
283
284 p->callback(p->stage, p->current, p->total, p->user_data);
285}
286
287static void flashprog_progress_start(struct flashprog_flashctx *const flashctx,
288 const enum flashprog_progress_stage stage, const size_t total)
289{
290 flashctx->progress.stage = stage;
291 flashctx->progress.current = 0;
292 flashctx->progress.total = total;
293 flashprog_progress_report(&flashctx->progress);
294}
295
296static void flashprog_progress_start_by_layout(struct flashprog_flashctx *const flashctx,
297 const enum flashprog_progress_stage stage,
298 const struct flashprog_layout *const layout)
299{
300 const struct romentry *entry = NULL;
301 size_t total = 0;
302
303 while ((entry = layout_next_included(layout, entry)))
304 total += entry->end - entry->start + 1;
305
306 flashprog_progress_start(flashctx, stage, total);
307}
308
309static void flashprog_progress_set(struct flashprog_flashctx *const flashctx, const size_t current)
310{
311 flashctx->progress.current = current;
312 flashprog_progress_report(&flashctx->progress);
313}
314
315/** @private */
316void flashprog_progress_add(struct flashprog_flashctx *const flashctx, const size_t progress)
317{
318 flashctx->progress.current += progress;
319 flashprog_progress_report(&flashctx->progress);
320}
321
322static void flashprog_progress_finish(struct flashprog_flashctx *const flashctx)
323{
324 if (flashctx->progress.current == flashctx->progress.total)
325 return;
326
327 flashctx->progress.current = flashctx->progress.total;
328 flashprog_progress_report(&flashctx->progress);
329}
330
Sylvain "ythier" Hitier9db45512011-07-04 07:27:17 +0000331/* Returns the number of well-defined erasers for a chip. */
Carl-Daniel Hailfinger63fd9022011-12-14 22:25:15 +0000332static unsigned int count_usable_erasers(const struct flashctx *flash)
Stefan Tauner5368dca2011-07-01 00:19:12 +0000333{
334 unsigned int usable_erasefunctions = 0;
335 int k;
336 for (k = 0; k < NUM_ERASEFUNCTIONS; k++) {
337 if (!check_block_eraser(flash, k, 0))
338 usable_erasefunctions++;
339 }
340 return usable_erasefunctions;
341}
342
Mark Marshallf20b7be2014-05-09 21:16:21 +0000343static int compare_range(const uint8_t *wantbuf, const uint8_t *havebuf, unsigned int start, unsigned int len)
Stefan Tauner78ffbea2012-10-27 15:36:56 +0000344{
345 int ret = 0, failcount = 0;
346 unsigned int i;
347 for (i = 0; i < len; i++) {
348 if (wantbuf[i] != havebuf[i]) {
349 /* Only print the first failure. */
350 if (!failcount++)
351 msg_cerr("FAILED at 0x%08x! Expected=0x%02x, Found=0x%02x,",
352 start + i, wantbuf[i], havebuf[i]);
353 }
354 }
355 if (failcount) {
356 msg_cerr(" failed byte count from 0x%08x-0x%08x: 0x%x\n",
357 start, start + len - 1, failcount);
358 ret = -1;
359 }
360 return ret;
361}
362
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000363/* start is an offset to the base address of the flash chip */
Jacob Garberbeeb8bc2019-06-21 15:24:17 -0600364static int check_erased_range(struct flashctx *flash, unsigned int start, unsigned int len)
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000365{
366 int ret;
Paul Kocialkowski995f7552018-01-15 01:06:09 +0300367 const uint8_t erased_value = ERASED_VALUE(flash);
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000368
Edward O'Callaghanf60f64f2022-11-12 12:08:01 +1100369 uint8_t *cmpbuf = malloc(len);
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000370 if (!cmpbuf) {
Edward O'Callaghana31a5722022-11-12 12:05:36 +1100371 msg_gerr("Out of memory!\n");
Edward O'Callaghan6edf9f82022-11-12 12:08:46 +1100372 return -1;
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000373 }
Paul Kocialkowski995f7552018-01-15 01:06:09 +0300374 memset(cmpbuf, erased_value, len);
Stefan Tauner78ffbea2012-10-27 15:36:56 +0000375 ret = verify_range(flash, cmpbuf, start, len);
Edward O'Callaghanf60f64f2022-11-12 12:08:01 +1100376
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000377 free(cmpbuf);
378 return ret;
379}
380
Richard Hughes842d6782021-01-15 09:48:12 +0000381int flashprog_read_range(struct flashctx *flash, uint8_t *buf, unsigned int start, unsigned int len)
382{
383 flashprog_progress_start(flash, FLASHPROG_PROGRESS_READ, len);
384 const int ret = flash->chip->read(flash, buf, start, len);
385 flashprog_progress_finish(flash);
386 return ret;
387}
388
Uwe Hermann48ec1b12010-08-08 17:01:18 +0000389/*
Carl-Daniel Hailfingerd0250a32009-11-25 17:05:52 +0000390 * @cmpbuf buffer to compare against, cmpbuf[0] is expected to match the
Uwe Hermann91f4afa2011-07-28 08:13:25 +0000391 * flash content at location start
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000392 * @start offset to the base address of the flash chip
393 * @len length of the verified area
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000394 * @return 0 for success, -1 for failure
395 */
Mark Marshallf20b7be2014-05-09 21:16:21 +0000396int verify_range(struct flashctx *flash, const uint8_t *cmpbuf, unsigned int start, unsigned int len)
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000397{
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000398 if (!len)
Stefan Taunerdf64a422014-05-27 00:06:14 +0000399 return -1;
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000400
Edward O'Callaghan6ae640b2021-11-17 14:24:04 +1100401 if (start + len > flash->chip->total_size * 1024) {
402 msg_gerr("Error: %s called with start 0x%x + len 0x%x >"
403 " total_size 0x%x\n", __func__, start, len,
404 flash->chip->total_size * 1024);
405 return -1;
406 }
407
Stefan Taunerdf64a422014-05-27 00:06:14 +0000408 uint8_t *readbuf = malloc(len);
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000409 if (!readbuf) {
Edward O'Callaghana31a5722022-11-12 12:05:36 +1100410 msg_gerr("Out of memory!\n");
Stefan Taunerdf64a422014-05-27 00:06:14 +0000411 return -1;
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000412 }
413
Edward O'Callaghan6ae640b2021-11-17 14:24:04 +1100414 int ret = flash->chip->read(flash, readbuf, start, len);
Carl-Daniel Hailfingerd8369412010-11-16 17:21:58 +0000415 if (ret) {
416 msg_gerr("Verification impossible because read failed "
417 "at 0x%x (len 0x%x)\n", start, len);
Stefan Taunerdf64a422014-05-27 00:06:14 +0000418 ret = -1;
419 goto out_free;
Carl-Daniel Hailfingerd8369412010-11-16 17:21:58 +0000420 }
421
Stefan Tauner78ffbea2012-10-27 15:36:56 +0000422 ret = compare_range(cmpbuf, readbuf, start, len);
Carl-Daniel Hailfinger30f7cb22009-06-15 17:23:36 +0000423out_free:
424 free(readbuf);
425 return ret;
426}
427
Nico Huber3ac761c2023-01-16 02:43:17 +0100428size_t gran_to_bytes(const enum write_granularity gran)
Nico Huberb77607f2023-01-16 02:25:45 +0100429{
430 switch (gran) {
431 case write_gran_1bit: return 1;
432 case write_gran_1byte: return 1;
433 case write_gran_1byte_implicit_erase: return 1;
434 case write_gran_128bytes: return 128;
435 case write_gran_256bytes: return 256;
436 case write_gran_264bytes: return 264;
437 case write_gran_512bytes: return 512;
438 case write_gran_528bytes: return 528;
439 case write_gran_1024bytes: return 1024;
440 case write_gran_1056bytes: return 1056;
441 default: return 0;
442 }
443}
444
Stefan Tauner02437452013-04-01 19:34:53 +0000445/* Helper function for need_erase() that focuses on granularities of gran bytes. */
Paul Kocialkowski995f7552018-01-15 01:06:09 +0300446static int need_erase_gran_bytes(const uint8_t *have, const uint8_t *want, unsigned int len,
447 unsigned int gran, const uint8_t erased_value)
Stefan Tauner02437452013-04-01 19:34:53 +0000448{
449 unsigned int i, j, limit;
450 for (j = 0; j < len / gran; j++) {
451 limit = min (gran, len - j * gran);
452 /* Are 'have' and 'want' identical? */
453 if (!memcmp(have + j * gran, want + j * gran, limit))
454 continue;
455 /* have needs to be in erased state. */
456 for (i = 0; i < limit; i++)
Paul Kocialkowski995f7552018-01-15 01:06:09 +0300457 if (have[j * gran + i] != erased_value)
Stefan Tauner02437452013-04-01 19:34:53 +0000458 return 1;
459 }
460 return 0;
461}
462
Uwe Hermann48ec1b12010-08-08 17:01:18 +0000463/*
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000464 * Check if the buffer @have can be programmed to the content of @want without
465 * erasing. This is only possible if all chunks of size @gran are either kept
466 * as-is or changed from an all-ones state to any other state.
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000467 *
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000468 * Warning: This function assumes that @have and @want point to naturally
469 * aligned regions.
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000470 *
471 * @have buffer with current content
472 * @want buffer with desired content
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000473 * @len length of the checked area
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000474 * @gran write granularity (enum, not count)
475 * @return 0 if no erase is needed, 1 otherwise
476 */
Edward O'Callaghana1805092022-05-16 11:10:36 +1000477static int need_erase(const uint8_t *have, const uint8_t *want, unsigned int len,
478 enum write_granularity gran, const uint8_t erased_value)
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000479{
Stefan Tauner02437452013-04-01 19:34:53 +0000480 unsigned int i;
Nico Huberb77607f2023-01-16 02:25:45 +0100481 size_t stride;
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000482
483 switch (gran) {
484 case write_gran_1bit:
Nico Huberb77607f2023-01-16 02:25:45 +0100485 for (i = 0; i < len; i++) {
486 if ((have[i] & want[i]) != want[i])
487 return 1;
488 }
489 return 0;
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000490 case write_gran_1byte:
Nico Huberb77607f2023-01-16 02:25:45 +0100491 for (i = 0; i < len; i++) {
492 if ((have[i] != want[i]) && (have[i] != erased_value))
493 return 1;
494 }
495 return 0;
Carl-Daniel Hailfinger1b0e9fc2014-06-16 22:36:17 +0000496 case write_gran_1byte_implicit_erase:
497 /* Do not erase, handle content changes from anything->0xff by writing 0xff. */
Nico Huberb77607f2023-01-16 02:25:45 +0100498 return 0;
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000499 default:
Nico Huberb77607f2023-01-16 02:25:45 +0100500 stride = gran_to_bytes(gran);
501 if (stride) {
502 return need_erase_gran_bytes(have, want, len, stride, erased_value);
503 }
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000504 msg_cerr("%s: Unsupported granularity! Please report a bug at "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200505 "flashprog@flashprog.org\n", __func__);
Nico Huberb77607f2023-01-16 02:25:45 +0100506 return 0;
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000507 }
Carl-Daniel Hailfingere8e369f2010-03-08 00:42:32 +0000508}
509
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000510/**
511 * Check if the buffer @have needs to be programmed to get the content of @want.
512 * If yes, return 1 and fill in first_start with the start address of the
513 * write operation and first_len with the length of the first to-be-written
514 * chunk. If not, return 0 and leave first_start and first_len undefined.
515 *
516 * Warning: This function assumes that @have and @want point to naturally
517 * aligned regions.
518 *
519 * @have buffer with current content
520 * @want buffer with desired content
521 * @len length of the checked area
522 * @gran write granularity (enum, not count)
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000523 * @first_start offset of the first byte which needs to be written (passed in
524 * value is increased by the offset of the first needed write
525 * relative to have/want or unchanged if no write is needed)
526 * @return length of the first contiguous area which needs to be written
527 * 0 if no write is needed
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000528 *
529 * FIXME: This function needs a parameter which tells it about coalescing
530 * in relation to the max write length of the programmer and the max write
531 * length of the chip.
532 */
Nico Huber3b9c86d2023-01-15 22:58:06 +0100533static unsigned int get_next_write(const uint8_t *have, const uint8_t *want, chipsize_t len,
534 chipoff_t *first_start, enum write_granularity gran)
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000535{
Felix Singerf25447e2022-08-19 02:44:28 +0200536 bool need_write = false;
Stefan Taunerc69c9c82011-11-23 09:13:48 +0000537 unsigned int rel_start = 0, first_len = 0;
Nico Huberb77607f2023-01-16 02:25:45 +0100538 unsigned int i, limit;
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000539
Nico Huberb77607f2023-01-16 02:25:45 +0100540 const size_t stride = gran_to_bytes(gran);
541 if (!stride) {
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000542 msg_cerr("%s: Unsupported granularity! Please report a bug at "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200543 "flashprog@flashprog.org\n", __func__);
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000544 /* Claim that no write was needed. A write with unknown
545 * granularity is too dangerous to try.
546 */
547 return 0;
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000548 }
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000549 for (i = 0; i < len / stride; i++) {
550 limit = min(stride, len - i * stride);
551 /* Are 'have' and 'want' identical? */
552 if (memcmp(have + i * stride, want + i * stride, limit)) {
553 if (!need_write) {
554 /* First location where have and want differ. */
Felix Singerf25447e2022-08-19 02:44:28 +0200555 need_write = true;
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000556 rel_start = i * stride;
557 }
558 } else {
559 if (need_write) {
560 /* First location where have and want
561 * do not differ anymore.
562 */
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000563 break;
564 }
565 }
566 }
Carl-Daniel Hailfinger202bf532010-12-06 13:05:44 +0000567 if (need_write)
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000568 first_len = min(i * stride - rel_start, len);
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000569 *first_start += rel_start;
Carl-Daniel Hailfinger12d6d822010-11-05 14:51:59 +0000570 return first_len;
Carl-Daniel Hailfinger6e2ea322010-11-04 01:04:27 +0000571}
572
Nico Huber2d625722016-05-03 10:48:02 +0200573/*
574 * Return a string corresponding to the bustype parameter.
575 * Memory is obtained with malloc() and must be freed with free() by the caller.
576 */
577char *flashbuses_to_text(enum chipbustype bustype)
578{
579 char *ret = calloc(1, 1);
580 /*
581 * FIXME: Once all chipsets and flash chips have been updated, NONSPI
582 * will cease to exist and should be eliminated here as well.
583 */
584 if (bustype == BUS_NONSPI) {
585 ret = strcat_realloc(ret, "Non-SPI, ");
586 } else {
587 if (bustype & BUS_PARALLEL)
588 ret = strcat_realloc(ret, "Parallel, ");
589 if (bustype & BUS_LPC)
590 ret = strcat_realloc(ret, "LPC, ");
591 if (bustype & BUS_FWH)
592 ret = strcat_realloc(ret, "FWH, ");
593 if (bustype & BUS_SPI)
594 ret = strcat_realloc(ret, "SPI, ");
595 if (bustype & BUS_PROG)
596 ret = strcat_realloc(ret, "Programmer-specific, ");
597 if (bustype == BUS_NONE)
598 ret = strcat_realloc(ret, "None, ");
599 }
600 /* Kill last comma. */
601 ret[strlen(ret) - 2] = '\0';
602 ret = realloc(ret, strlen(ret) + 1);
603 return ret;
604}
605
Nico Huberee8cf1c2025-01-02 23:17:25 +0100606int probe_noop(struct flashctx *flash)
607{
608 return 1;
609}
610
Edward O'Callaghan00ea3892022-10-11 21:27:37 +1100611static int init_default_layout(struct flashctx *flash)
612{
613 /* Fill default layout covering the whole chip. */
Nico Huberc3b02dc2023-08-12 01:13:45 +0200614 if (flashprog_layout_new(&flash->default_layout) ||
615 flashprog_layout_add_region(flash->default_layout,
Edward O'Callaghan00ea3892022-10-11 21:27:37 +1100616 0, flash->chip->total_size * 1024 - 1, "complete flash") ||
Nico Huberc3b02dc2023-08-12 01:13:45 +0200617 flashprog_layout_include_region(flash->default_layout, "complete flash"))
Edward O'Callaghan00ea3892022-10-11 21:27:37 +1100618 return -1;
619 return 0;
620}
621
Carl-Daniel Hailfingera5bcbce2014-07-19 22:03:29 +0000622int probe_flash(struct registered_master *mst, int startchip, struct flashctx *flash, int force)
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000623{
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000624 const struct flashchip *chip;
Carl-Daniel Hailfinger115d3902009-10-31 01:53:09 +0000625 enum chipbustype buses_common;
Carl-Daniel Hailfingerb22918c2009-06-01 02:08:58 +0000626 char *tmp;
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000627
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000628 for (chip = flashchips + startchip; chip && chip->name; chip++) {
629 if (chip_to_probe && strcmp(chip->name, chip_to_probe) != 0)
Ollie Lhocbbf1252004-03-17 22:22:08 +0000630 continue;
Carl-Daniel Hailfingera5bcbce2014-07-19 22:03:29 +0000631 buses_common = mst->buses_supported & chip->bustype;
Carl-Daniel Hailfingerc40cff72011-12-20 00:19:29 +0000632 if (!buses_common)
Carl-Daniel Hailfinger6573b742011-06-17 22:38:53 +0000633 continue;
Mike Banon31b5e3b2018-01-15 01:10:00 +0300634 /* Only probe for SPI25 chips by default. */
635 if (chip->bustype == BUS_SPI && !chip_to_probe && chip->spi_cmd_set != SPI25)
636 continue;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000637 msg_gdbg("Probing for %s %s, %d kB: ", chip->vendor, chip->name, chip->total_size);
638 if (!chip->probe && !force) {
Nico Huberc3b02dc2023-08-12 01:13:45 +0200639 msg_gdbg("failed! flashprog has no probe function for this flash chip.\n");
Carl-Daniel Hailfingerb22918c2009-06-01 02:08:58 +0000640 continue;
641 }
Stefan Reinauer70385642007-04-06 11:58:03 +0000642
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000643 /* Start filling in the dynamic data. */
Angel Pons690a9442021-06-07 12:33:53 +0200644 flash->chip = calloc(1, sizeof(*flash->chip));
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000645 if (!flash->chip) {
646 msg_gerr("Out of memory!\n");
Edward O'Callaghan6edf9f82022-11-12 12:08:46 +1100647 return -1;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000648 }
Angel Pons7e134562021-06-07 13:29:13 +0200649 *flash->chip = *chip;
Nico Huber9a11cbf2023-01-13 01:19:07 +0100650 flash->mst.par = &mst->par; /* both `mst` are unions, so we need only one pointer */
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000651
Nico Huber9eec4072023-01-12 01:17:30 +0100652 if (flash->chip->prepare_access && flash->chip->prepare_access(flash, PREPARE_PROBE))
653 goto free_chip;
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000654
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000655 /* We handle a forced match like a real match, we just avoid probing. Note that probe_flash()
656 * is only called with force=1 after normal probing failed.
657 */
Peter Stuge27c3e2d2008-07-02 17:15:47 +0000658 if (force)
659 break;
Stefan Reinauerfcb63682006-03-16 16:57:41 +0000660
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000661 if (flash->chip->probe(flash) != 1)
Peter Stuge483b8f02008-09-03 23:10:05 +0000662 goto notfound;
663
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000664 /* If this is the first chip found, accept it.
665 * If this is not the first chip found, accept it only if it is
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000666 * a non-generic match. SFDP and CFI are generic matches.
667 * startchip==0 means this call to probe_flash() is the first
Carl-Daniel Hailfingera5bcbce2014-07-19 22:03:29 +0000668 * one for this programmer interface (master) and thus no other chip has
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000669 * been found on this interface.
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000670 */
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000671 if (startchip == 0 && flash->chip->model_id == SFDP_DEVICE_ID) {
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000672 msg_cinfo("===\n"
673 "SFDP has autodetected a flash chip which is "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200674 "not natively supported by flashprog yet.\n");
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000675 if (count_usable_erasers(flash) == 0)
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000676 msg_cinfo("The standard operations read and "
677 "verify should work, but to support "
678 "erase, write and all other "
679 "possible features");
680 else
681 msg_cinfo("All standard operations (read, "
682 "verify, erase and write) should "
683 "work, but to support all possible "
684 "features");
685
Stefan Taunerb4e06bd2012-08-20 00:24:22 +0000686 msg_cinfo(" we need to add them manually.\n"
687 "You can help us by mailing us the output of the following command to "
Nico Huberc3b02dc2023-08-12 01:13:45 +0200688 "flashprog@flashprog.org:\n"
689 "'flashprog -VV [plus the -p/--programmer parameter]'\n"
Stefan Taunerb4e06bd2012-08-20 00:24:22 +0000690 "Thanks for your help!\n"
Stefan Taunerac1b4c82012-02-17 14:51:04 +0000691 "===\n");
692 }
693
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000694 /* First flash chip detected on this bus. */
695 if (startchip == 0)
Peter Stuge27c3e2d2008-07-02 17:15:47 +0000696 break;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000697 /* Not the first flash chip detected on this bus, but not a generic match either. */
698 if ((flash->chip->model_id != GENERIC_DEVICE_ID) && (flash->chip->model_id != SFDP_DEVICE_ID))
699 break;
700 /* 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 +0000701notfound:
Nico Huber9eec4072023-01-12 01:17:30 +0100702 if (flash->chip->finish_access)
703 flash->chip->finish_access(flash);
704free_chip:
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000705 free(flash->chip);
706 flash->chip = NULL;
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000707 }
Uwe Hermannffec5f32007-08-23 16:08:21 +0000708
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000709 if (!flash->chip)
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000710 return -1;
Peter Stuge27c3e2d2008-07-02 17:15:47 +0000711
Edward O'Callaghan00ea3892022-10-11 21:27:37 +1100712 if (init_default_layout(flash) < 0)
713 return -1;
Stefan Reinauer051e2362011-01-19 06:21:54 +0000714
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000715 tmp = flashbuses_to_text(flash->chip->bustype);
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000716 msg_cinfo("%s %s flash chip \"%s\" (%d kB, %s) ", force ? "Assuming" : "Found",
717 flash->chip->vendor, flash->chip->name, flash->chip->total_size, tmp);
Stefan Tauner00155492011-06-26 20:45:35 +0000718 free(tmp);
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000719#if CONFIG_INTERNAL == 1
Nico Huber0e76d992023-01-12 20:22:55 +0100720 if (flash->physical_memory != 0 && mst->par.map_flash == physmap)
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000721 msg_cinfo("mapped at physical address 0x%0*" PRIxPTR ".\n",
722 PRIxPTR_WIDTH, flash->physical_memory);
723 else
724#endif
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +0200725 msg_cinfo("on %s.\n", programmer->name);
Uwe Hermann9899cad2009-06-28 21:47:57 +0000726
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000727 /* Flash registers may more likely not be mapped if the chip was forced.
728 * Lock info may be stored in registers, so avoid lock info printing. */
Carl-Daniel Hailfinger859f3f02010-12-02 21:59:42 +0000729 if (!force)
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000730 if (flash->chip->printlock)
731 flash->chip->printlock(flash);
Sean Nelson6e0b9122010-02-19 00:52:10 +0000732
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000733 /* Get out of the way for later runs. */
Nico Huber9eec4072023-01-12 01:17:30 +0100734 if (flash->chip->finish_access)
735 flash->chip->finish_access(flash);
Stefan Tauner4e32ec12014-08-30 23:39:51 +0000736
Carl-Daniel Hailfinger4c823182011-05-04 00:39:50 +0000737 /* Return position of matching chip. */
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000738 return chip - flashchips;
Ronald G. Minnichf4cf2ba2002-01-29 18:26:26 +0000739}
740
Stefan Tauner96658be2014-05-26 22:05:31 +0000741/* Even if an error is found, the function will keep going and check the rest. */
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000742static int selfcheck_eraseblocks(const struct flashchip *chip)
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000743{
Carl-Daniel Hailfinger082c8b52011-08-15 19:54:20 +0000744 int i, j, k;
745 int ret = 0;
Aarya Chaumal478e1792022-06-04 01:34:44 +0530746 unsigned int prev_eraseblock_count = chip->total_size * 1024;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000747
748 for (k = 0; k < NUM_ERASEFUNCTIONS; k++) {
749 unsigned int done = 0;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000750 struct block_eraser eraser = chip->block_erasers[k];
Aarya Chaumal478e1792022-06-04 01:34:44 +0530751 unsigned int curr_eraseblock_count = 0;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000752
753 for (i = 0; i < NUM_ERASEREGIONS; i++) {
754 /* Blocks with zero size are bugs in flashchips.c. */
755 if (eraser.eraseblocks[i].count &&
756 !eraser.eraseblocks[i].size) {
Nico Huberac90af62022-12-18 00:22:47 +0000757 msg_gerr("ERROR: Flash chip %s erase function %i region %i has size 0.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +0200758 "Please report a bug at flashprog@flashprog.org\n",
Nico Huberac90af62022-12-18 00:22:47 +0000759 chip->name, k, i);
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000760 ret = 1;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000761 }
762 /* Blocks with zero count are bugs in flashchips.c. */
763 if (!eraser.eraseblocks[i].count &&
764 eraser.eraseblocks[i].size) {
Nico Huberac90af62022-12-18 00:22:47 +0000765 msg_gerr("ERROR: Flash chip %s erase function %i region %i has count 0.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +0200766 "Please report a bug at flashprog@flashprog.org\n",
Nico Huberac90af62022-12-18 00:22:47 +0000767 chip->name, k, i);
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000768 ret = 1;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000769 }
770 done += eraser.eraseblocks[i].count *
771 eraser.eraseblocks[i].size;
Aarya Chaumal478e1792022-06-04 01:34:44 +0530772 curr_eraseblock_count += eraser.eraseblocks[i].count;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000773 }
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000774 /* Empty eraseblock definition with erase function. */
775 if (!done && eraser.block_erase)
Sean Nelson316a29f2010-05-07 20:09:04 +0000776 msg_gspew("Strange: Empty eraseblock definition with "
Uwe Hermann91f4afa2011-07-28 08:13:25 +0000777 "non-empty erase function. Not an error.\n");
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000778 if (!done)
779 continue;
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000780 if (done != chip->total_size * 1024) {
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000781 msg_gerr("ERROR: Flash chip %s erase function %i "
782 "region walking resulted in 0x%06x bytes total,"
Nico Huberac90af62022-12-18 00:22:47 +0000783 " expected 0x%06x bytes.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +0200784 "Please report a bug at flashprog@flashprog.org\n",
Nico Huberac90af62022-12-18 00:22:47 +0000785 chip->name, k, done, chip->total_size * 1024);
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000786 ret = 1;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000787 }
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000788 if (!eraser.block_erase)
789 continue;
790 /* Check if there are identical erase functions for different
791 * layouts. That would imply "magic" erase functions. The
792 * easiest way to check this is with function pointers.
793 */
Uwe Hermann43959702010-03-13 17:28:29 +0000794 for (j = k + 1; j < NUM_ERASEFUNCTIONS; j++) {
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000795 if (eraser.block_erase ==
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000796 chip->block_erasers[j].block_erase) {
Nico Huberac90af62022-12-18 00:22:47 +0000797 msg_gerr("ERROR: Flash chip %s erase function %i and %i are identical.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +0200798 "Please report a bug at flashprog@flashprog.org\n",
Nico Huberac90af62022-12-18 00:22:47 +0000799 chip->name, k, j);
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000800 ret = 1;
801 }
Uwe Hermann43959702010-03-13 17:28:29 +0000802 }
Aarya Chaumal478e1792022-06-04 01:34:44 +0530803 if(curr_eraseblock_count > prev_eraseblock_count)
804 {
Nico Huberac90af62022-12-18 00:22:47 +0000805 msg_gerr("ERROR: Flash chip %s erase function %i is not in order.\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +0200806 "Please report a bug at flashprog@flashprog.org\n",
Nico Huberac90af62022-12-18 00:22:47 +0000807 chip->name, k);
Aarya Chaumal478e1792022-06-04 01:34:44 +0530808 ret = 1;
809 }
810 prev_eraseblock_count = curr_eraseblock_count;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000811 }
Carl-Daniel Hailfinger415afcf2010-01-19 06:42:46 +0000812 return ret;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +0000813}
814
Carl-Daniel Hailfinger63fd9022011-12-14 22:25:15 +0000815static int check_block_eraser(const struct flashctx *flash, int k, int log)
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000816{
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000817 struct block_eraser eraser = flash->chip->block_erasers[k];
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000818
819 if (!eraser.block_erase && !eraser.eraseblocks[0].count) {
820 if (log)
821 msg_cdbg("not defined. ");
822 return 1;
823 }
824 if (!eraser.block_erase && eraser.eraseblocks[0].count) {
825 if (log)
826 msg_cdbg("eraseblock layout is known, but matching "
Stefan Tauner355cbfd2011-05-28 02:37:14 +0000827 "block erase function is not implemented. ");
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000828 return 1;
829 }
830 if (eraser.block_erase && !eraser.eraseblocks[0].count) {
831 if (log)
832 msg_cdbg("block erase function found, but "
Stefan Tauner355cbfd2011-05-28 02:37:14 +0000833 "eraseblock layout is not defined. ");
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000834 return 1;
835 }
Aarya Chaumal6d98aec2022-08-14 23:16:44 +0530836
Nico Hubere149fbe2024-08-21 10:23:53 +0200837 if (flash->chip->bustype == BUS_SPI && flash->chip->spi_cmd_set == SPI25) {
Nico Huber13389362024-03-05 18:35:30 +0100838 bool native_4ba;
Nico Huber13f97a52023-01-14 23:55:06 +0100839 int i;
Nico Huber13389362024-03-05 18:35:30 +0100840
841 const uint8_t *opcode = spi_get_opcode_from_erasefn(eraser.block_erase, &native_4ba);
Nico Huber07ebc682024-08-21 10:18:27 +0200842 if (!opcode)
843 return 1;
844
Nico Huber13f97a52023-01-14 23:55:06 +0100845 for (i = 0; opcode[i]; i++) {
Nico Huber13389362024-03-05 18:35:30 +0100846 if ((native_4ba && !spi_master_4ba(flash)) ||
Nico Huber9a11cbf2023-01-13 01:19:07 +0100847 !flash->mst.spi->probe_opcode(flash, opcode[i])) {
Aarya Chaumal6d98aec2022-08-14 23:16:44 +0530848 if (log)
849 msg_cdbg("block erase function and layout found "
850 "but SPI master doesn't support the function. ");
851 return 1;
852 }
853 }
854 }
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +0000855 // TODO: Once erase functions are annotated with allowed buses, check that as well.
Carl-Daniel Hailfingerdce73ae2010-12-05 15:14:44 +0000856 return 0;
857}
858
Nico Huber7af0e792016-04-29 16:40:15 +0200859/**
860 * @brief Reads the included layout regions into a buffer.
861 *
862 * If there is no layout set in the given flash context, the whole chip will
863 * be read.
864 *
865 * @param flashctx Flash context to be used.
866 * @param buffer Buffer of full chip size to read into.
867 * @return 0 on success,
868 * 1 if any read fails.
869 */
870static int read_by_layout(struct flashctx *const flashctx, uint8_t *const buffer)
871{
Nico Huberc3b02dc2023-08-12 01:13:45 +0200872 const struct flashprog_layout *const layout = get_layout(flashctx);
Nico Huber5ca55232019-06-15 22:29:08 +0200873 const struct romentry *entry = NULL;
Nico Huber7af0e792016-04-29 16:40:15 +0200874
Richard Hughes842d6782021-01-15 09:48:12 +0000875 flashprog_progress_start_by_layout(flashctx, FLASHPROG_PROGRESS_READ, layout);
876
Nico Huber5ca55232019-06-15 22:29:08 +0200877 while ((entry = layout_next_included(layout, entry))) {
878 const chipoff_t region_start = entry->start;
879 const chipsize_t region_len = entry->end - entry->start + 1;
Nico Huber7af0e792016-04-29 16:40:15 +0200880
881 if (flashctx->chip->read(flashctx, buffer + region_start, region_start, region_len))
882 return 1;
883 }
Richard Hughes842d6782021-01-15 09:48:12 +0000884
885 flashprog_progress_finish(flashctx);
886
Nico Huber7af0e792016-04-29 16:40:15 +0200887 return 0;
888}
889
Nico Huber7af0e792016-04-29 16:40:15 +0200890/**
891 * @private
892 *
893 * For read-erase-write, `curcontents` and `newcontents` shall point
894 * to buffers of the chip's size. Both are supposed to be prefilled
895 * with at least the included layout regions of the current flash
896 * contents (`curcontents`) and the data to be written to the flash
897 * (`newcontents`).
898 *
899 * For erase, `curcontents` and `newcontents` shall be NULL-pointers.
900 *
901 * The `chipoff_t` values are used internally by `walk_by_layout()`.
902 */
903struct walk_info {
904 uint8_t *curcontents;
905 const uint8_t *newcontents;
906 chipoff_t region_start;
907 chipoff_t region_end;
908 chipoff_t erase_start;
909 chipoff_t erase_end;
910};
Nico Huber3b9c86d2023-01-15 22:58:06 +0100911
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530912struct eraseblock_data {
913 chipoff_t start_addr;
914 chipoff_t end_addr;
915 bool selected;
916 size_t block_num;
917 size_t first_sub_block_index;
918 size_t last_sub_block_index;
919};
920
921struct erase_layout {
922 struct eraseblock_data* layout_list;
923 size_t block_count;
924 const struct block_eraser *eraser;
925};
926
Nico Huber5ff6fdc2023-01-15 23:43:12 +0100927static bool explicit_erase(const struct walk_info *const info)
928{
929 /* For explicit erase, we are called without new contents. */
930 return !info->newcontents;
931}
932
Nico Huberd96e7032023-01-14 22:31:48 +0100933static size_t calculate_block_count(const struct block_eraser *const eraser)
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530934{
Nico Huberd96e7032023-01-14 22:31:48 +0100935 size_t block_count = 0, i;
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530936
Nico Huberd96e7032023-01-14 22:31:48 +0100937 for (i = 0; i < ARRAY_SIZE(eraser->eraseblocks); ++i)
938 block_count += eraser->eraseblocks[i].count;
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530939
940 return block_count;
941}
942
943static void init_eraseblock(struct erase_layout *layout, size_t idx, size_t block_num,
944 chipoff_t start_addr, chipoff_t end_addr, size_t *sub_block_index)
945{
946 struct eraseblock_data *edata = &layout[idx].layout_list[block_num];
947 edata->start_addr = start_addr;
948 edata->end_addr = end_addr;
949 edata->selected = false;
950 edata->block_num = block_num;
951
952 if (!idx)
953 return;
Nico Hubera02df332023-01-14 23:06:27 +0100954 const struct erase_layout *const sub_layout = &layout[idx - 1];
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530955
956 edata->first_sub_block_index = *sub_block_index;
Nico Hubera02df332023-01-14 23:06:27 +0100957 for (; *sub_block_index < sub_layout->block_count; ++*sub_block_index) {
958 if (sub_layout->layout_list[*sub_block_index].end_addr > end_addr)
959 break;
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530960 }
961 edata->last_sub_block_index = *sub_block_index - 1;
962}
963
964/*
965 * @brief Function to free the created erase_layout
966 *
967 * @param layout pointer to allocated layout
968 * @param erasefn_count number of erase functions for which the layout was created
969 *
970 */
971static void free_erase_layout(struct erase_layout *layout, unsigned int erasefn_count)
972{
Nico Huber13f97a52023-01-14 23:55:06 +0100973 size_t i;
974
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530975 if (!layout)
976 return;
Nico Huber13f97a52023-01-14 23:55:06 +0100977 for (i = 0; i < erasefn_count; i++) {
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530978 free(layout[i].layout_list);
979 }
980 free(layout);
981}
982
983/*
984 * @brief Function to create an erase layout
985 *
986 * @param flashctx flash context
987 * @param e_layout address to the pointer to store the layout
988 * @return 0 on success,
989 * -1 if layout creation fails
990 *
991 * This function creates a layout of which erase functions erase which regions
992 * of the flash chip. This helps to optimally select the erase functions for
993 * erase/write operations.
994 */
Nico Huberc09fca42023-01-29 15:58:09 +0100995static int create_erase_layout(struct flashctx *const flashctx, struct erase_layout **e_layout)
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530996{
997 const struct flashchip *chip = flashctx->chip;
998 const size_t erasefn_count = count_usable_erasers(flashctx);
Aarya Chaumal18cc8d32022-07-15 16:51:27 +0530999
1000 if (!erasefn_count) {
1001 msg_gerr("No erase functions supported\n");
1002 return 0;
1003 }
1004
Nico Huberd34864b2023-01-14 23:47:19 +01001005 struct erase_layout *layout = calloc(erasefn_count, sizeof(struct erase_layout));
1006 if (!layout) {
1007 msg_gerr("Out of memory!\n");
1008 return -1;
1009 }
1010
Nico Huber13f97a52023-01-14 23:55:06 +01001011 size_t layout_idx = 0, eraser_idx;
1012 for (eraser_idx = 0; eraser_idx < NUM_ERASEFUNCTIONS; eraser_idx++) {
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301013 if (check_block_eraser(flashctx, eraser_idx, 0))
1014 continue;
1015
1016 layout[layout_idx].eraser = &chip->block_erasers[eraser_idx];
Nico Huberd96e7032023-01-14 22:31:48 +01001017 const size_t block_count = calculate_block_count(&chip->block_erasers[eraser_idx]);
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301018 size_t sub_block_index = 0;
1019
1020 layout[layout_idx].block_count = block_count;
1021 layout[layout_idx].layout_list = (struct eraseblock_data *)calloc(block_count,
1022 sizeof(struct eraseblock_data));
1023
1024 if (!layout[layout_idx].layout_list) {
1025 free_erase_layout(layout, layout_idx);
1026 return -1;
1027 }
1028
1029 size_t block_num = 0;
1030 chipoff_t start_addr = 0;
1031
Nico Huber13f97a52023-01-14 23:55:06 +01001032 int i;
1033 for (i = 0; block_num < block_count; i++) {
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301034 const struct eraseblock *block = &chip->block_erasers[eraser_idx].eraseblocks[i];
1035
Nico Huber13f97a52023-01-14 23:55:06 +01001036 size_t num;
1037 for (num = 0; num < block->count; num++) {
Aarya Chaumal18cc8d32022-07-15 16:51:27 +05301038 chipoff_t end_addr = start_addr + block->size - 1;
1039 init_eraseblock(layout, layout_idx, block_num,
1040 start_addr, end_addr, &sub_block_index);
1041 block_num += 1;
1042 start_addr = end_addr + 1;
1043 }
1044 }
1045 layout_idx++;
1046 }
1047
1048 *e_layout = layout;
1049 return layout_idx;
1050}
1051
Nico Huber20073e72024-05-10 01:31:40 +02001052static void deselect_erase_block_rec(const struct erase_layout *layout, size_t findex, size_t block_num)
1053{
1054 struct eraseblock_data *const ed = &layout[findex].layout_list[block_num];
1055 size_t i;
1056
1057 if (ed->selected) {
1058 ed->selected = false;
1059 } else if (findex > 0) {
1060 for (i = ed->first_sub_block_index; i <= ed->last_sub_block_index; ++i)
1061 deselect_erase_block_rec(layout, findex - 1, i);
1062 }
1063}
1064
Aarya Chaumald33bea42022-07-14 12:51:14 +05301065/*
1066 * @brief Function to select the list of sectors that need erasing
1067 *
1068 * @param flashctx flash context
1069 * @param layout erase layout
1070 * @param findex index of the erase function
1071 * @param block_num index of the block to erase according to the erase function index
Nico Huber00d1b9f2023-01-29 15:07:33 +01001072 * @param info current info from walking the regions
Nico Huberaa714dd2023-04-22 14:59:33 +02001073 * @return number of bytes selected for erase
Aarya Chaumald33bea42022-07-14 12:51:14 +05301074 */
Nico Huberaa714dd2023-04-22 14:59:33 +02001075static size_t select_erase_functions_rec(const struct flashctx *flashctx, const struct erase_layout *layout,
1076 size_t findex, size_t block_num, const struct walk_info *info)
Aarya Chaumald33bea42022-07-14 12:51:14 +05301077{
1078 struct eraseblock_data *ll = &layout[findex].layout_list[block_num];
Nico Huberaa714dd2023-04-22 14:59:33 +02001079 const size_t eraseblock_size = ll->end_addr - ll->start_addr + 1;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301080 if (!findex) {
Nico Hubercf6ff0a2023-01-29 15:45:06 +01001081 if (ll->start_addr <= info->region_end && ll->end_addr >= info->region_start) {
Nico Huber1494f8e2023-01-29 15:48:00 +01001082 if (explicit_erase(info)) {
1083 ll->selected = true;
Nico Huberaa714dd2023-04-22 14:59:33 +02001084 return eraseblock_size;
Nico Huber1494f8e2023-01-29 15:48:00 +01001085 }
Nico Hubera6212482023-01-29 15:39:26 +01001086 const chipoff_t write_start = MAX(info->region_start, ll->start_addr);
1087 const chipoff_t write_end = MIN(info->region_end, ll->end_addr);
1088 const chipsize_t write_len = write_end - write_start + 1;
1089 const uint8_t erased_value = ERASED_VALUE(flashctx);
Nico Huber00d1b9f2023-01-29 15:07:33 +01001090 ll->selected = need_erase(
Nico Hubera6212482023-01-29 15:39:26 +01001091 info->curcontents + write_start, info->newcontents + write_start,
1092 write_len, flashctx->chip->gran, erased_value);
Nico Huberaa714dd2023-04-22 14:59:33 +02001093 if (ll->selected)
1094 return eraseblock_size;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301095 }
Nico Huberaa714dd2023-04-22 14:59:33 +02001096 return 0;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301097 } else {
Aarya Chaumald33bea42022-07-14 12:51:14 +05301098 const int sub_block_start = ll->first_sub_block_index;
1099 const int sub_block_end = ll->last_sub_block_index;
Nico Huberaa714dd2023-04-22 14:59:33 +02001100 size_t bytes = 0;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301101
Nico Huber13f97a52023-01-14 23:55:06 +01001102 int j;
Nico Huberaa714dd2023-04-22 14:59:33 +02001103 for (j = sub_block_start; j <= sub_block_end; j++)
1104 bytes += select_erase_functions_rec(flashctx, layout, findex - 1, j, info);
Aarya Chaumald33bea42022-07-14 12:51:14 +05301105
Nico Huberaa714dd2023-04-22 14:59:33 +02001106 if (bytes > eraseblock_size / 2) {
Nico Huber00d1b9f2023-01-29 15:07:33 +01001107 if (ll->start_addr >= info->region_start && ll->end_addr <= info->region_end) {
Nico Huber20073e72024-05-10 01:31:40 +02001108 deselect_erase_block_rec(layout, findex, block_num);
Aarya Chaumald33bea42022-07-14 12:51:14 +05301109 ll->selected = true;
Nico Huberaa714dd2023-04-22 14:59:33 +02001110 bytes = eraseblock_size;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301111 }
1112 }
Nico Huberaa714dd2023-04-22 14:59:33 +02001113 return bytes;
Aarya Chaumald33bea42022-07-14 12:51:14 +05301114 }
1115}
1116
Nico Huberaa714dd2023-04-22 14:59:33 +02001117static size_t select_erase_functions(const struct flashctx *flashctx, const struct erase_layout *layout,
1118 size_t erasefn_count, const struct walk_info *info)
Nico Huberb11b72c2023-01-29 15:33:11 +01001119{
Nico Huberaa714dd2023-04-22 14:59:33 +02001120 size_t bytes = 0;
Nico Huberb11b72c2023-01-29 15:33:11 +01001121 size_t block_num;
1122 for (block_num = 0; block_num < layout[erasefn_count - 1].block_count; ++block_num)
Nico Huberaa714dd2023-04-22 14:59:33 +02001123 bytes += select_erase_functions_rec(flashctx, layout, erasefn_count - 1, block_num, info);
1124 return bytes;
Nico Huberb11b72c2023-01-29 15:33:11 +01001125}
1126
Nico Huber3b9c86d2023-01-15 22:58:06 +01001127static int write_range(struct flashctx *const flashctx, const chipoff_t flash_offset,
1128 const uint8_t *const curcontents, const uint8_t *const newcontents,
1129 const chipsize_t len, bool *const skipped)
1130{
1131 unsigned int writecount = 0;
1132 chipoff_t starthere = 0;
1133 chipsize_t lenhere = 0;
1134
1135 while ((lenhere = get_next_write(curcontents + starthere, newcontents + starthere,
1136 len - starthere, &starthere, flashctx->chip->gran))) {
1137 if (!writecount++)
1138 msg_cdbg("W");
1139 if (flashctx->chip->write(flashctx, newcontents + starthere,
1140 flash_offset + starthere, lenhere))
1141 return 1;
1142 starthere += lenhere;
Richard Hughes842d6782021-01-15 09:48:12 +00001143 if (skipped) {
1144 flashprog_progress_set(flashctx, starthere);
Nico Huber3b9c86d2023-01-15 22:58:06 +01001145 *skipped = false;
Richard Hughes842d6782021-01-15 09:48:12 +00001146 }
Nico Huber3b9c86d2023-01-15 22:58:06 +01001147 }
1148 return 0;
1149}
1150
1151typedef int (*erasefn_t)(struct flashctx *, unsigned int addr, unsigned int len);
Nico Huber7af0e792016-04-29 16:40:15 +02001152/* returns 0 on success, 1 to retry with another erase function, 2 for immediate abort */
1153typedef int (*per_blockfn_t)(struct flashctx *, const struct walk_info *, erasefn_t);
1154
1155static int walk_eraseblocks(struct flashctx *const flashctx,
Nico Huberc09fca42023-01-29 15:58:09 +01001156 struct erase_layout *const layouts,
1157 const size_t layout_count,
Nico Huber7af0e792016-04-29 16:40:15 +02001158 struct walk_info *const info,
Nico Huberc09fca42023-01-29 15:58:09 +01001159 const per_blockfn_t per_blockfn)
Nico Huber7af0e792016-04-29 16:40:15 +02001160{
1161 int ret;
1162 size_t i, j;
1163 bool first = true;
Nico Huber7af0e792016-04-29 16:40:15 +02001164
Nico Huberc09fca42023-01-29 15:58:09 +01001165 for (i = 0; i < layout_count; ++i) {
1166 const struct erase_layout *const layout = &layouts[i];
Nico Huber7af0e792016-04-29 16:40:15 +02001167
Nico Huberc09fca42023-01-29 15:58:09 +01001168 for (j = 0; j < layout->block_count; ++j) {
1169 struct eraseblock_data *const eb = &layout->layout_list[j];
1170
1171 if (eb->start_addr > info->region_end)
Nico Huber7af0e792016-04-29 16:40:15 +02001172 break;
Nico Huberc09fca42023-01-29 15:58:09 +01001173 if (eb->end_addr < info->region_start)
1174 continue;
1175 if (!eb->selected)
1176 continue;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001177
Nico Huber7af0e792016-04-29 16:40:15 +02001178 /* Print this for every block except the first one. */
1179 if (first)
1180 first = false;
1181 else
1182 msg_cdbg(", ");
Nico Huberc09fca42023-01-29 15:58:09 +01001183 msg_cdbg("0x%06x-0x%06x:", eb->start_addr, eb->end_addr);
Nico Huber7af0e792016-04-29 16:40:15 +02001184
Nico Huberc09fca42023-01-29 15:58:09 +01001185 info->erase_start = eb->start_addr;
1186 info->erase_end = eb->end_addr;
1187 ret = per_blockfn(flashctx, info, layout->eraser->block_erase);
Nico Huber7af0e792016-04-29 16:40:15 +02001188 if (ret)
1189 return ret;
Nico Huberc09fca42023-01-29 15:58:09 +01001190
1191 /* Clean the erase layout up for future use on other
1192 regions. `.selected` is the only field we alter. */
1193 eb->selected = false;
Nico Huber7af0e792016-04-29 16:40:15 +02001194 }
Nico Huber7af0e792016-04-29 16:40:15 +02001195 }
1196 msg_cdbg("\n");
1197 return 0;
1198}
1199
1200static int walk_by_layout(struct flashctx *const flashctx, struct walk_info *const info,
1201 const per_blockfn_t per_blockfn)
1202{
Nico Huberc09fca42023-01-29 15:58:09 +01001203 const bool do_erase = explicit_erase(info) || !(flashctx->chip->feature_bits & FEATURE_NO_ERASE);
Nico Huberc3b02dc2023-08-12 01:13:45 +02001204 const struct flashprog_layout *const layout = get_layout(flashctx);
Nico Huberc09fca42023-01-29 15:58:09 +01001205 struct erase_layout *erase_layouts = NULL;
Nico Huber5ca55232019-06-15 22:29:08 +02001206 const struct romentry *entry = NULL;
Nico Huberc09fca42023-01-29 15:58:09 +01001207 int ret = 0, layout_count = 0;
Nico Huber7af0e792016-04-29 16:40:15 +02001208
1209 all_skipped = true;
Nico Huberc6a924a2024-09-04 15:09:52 +02001210 msg_cinfo("Erasing %sflash chip... ", info->newcontents ? "and writing " : "");
Nico Huber7af0e792016-04-29 16:40:15 +02001211
Nico Huberc09fca42023-01-29 15:58:09 +01001212 if (do_erase) {
1213 layout_count = create_erase_layout(flashctx, &erase_layouts);
1214 if (layout_count <= 0)
1215 return 1;
1216 }
1217
Nico Huber5ca55232019-06-15 22:29:08 +02001218 while ((entry = layout_next_included(layout, entry))) {
1219 info->region_start = entry->start;
1220 info->region_end = entry->end;
Nico Huber7af0e792016-04-29 16:40:15 +02001221
Nico Huberc09fca42023-01-29 15:58:09 +01001222 if (do_erase) {
Richard Hughes842d6782021-01-15 09:48:12 +00001223 const size_t total = select_erase_functions(flashctx, erase_layouts, layout_count, info);
1224
1225 /* We verify every erased block manually. Technically that's
1226 reading, but accounting for it as part of the erase helps
1227 to provide a smooth, overall progress. Hence `total * 2`. */
1228 flashprog_progress_start(flashctx, FLASHPROG_PROGRESS_ERASE, total * 2);
1229
Nico Huberc09fca42023-01-29 15:58:09 +01001230 ret = walk_eraseblocks(flashctx, erase_layouts, layout_count, info, per_blockfn);
1231 if (ret) {
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001232 msg_cerr("FAILED!\n");
Nico Huberc09fca42023-01-29 15:58:09 +01001233 goto free_ret;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001234 }
Richard Hughes842d6782021-01-15 09:48:12 +00001235
1236 flashprog_progress_finish(flashctx);
Nico Huber7af0e792016-04-29 16:40:15 +02001237 }
Nico Huberd34af7a2023-01-15 23:58:18 +01001238
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001239 if (info->newcontents) {
1240 bool skipped = true;
1241 msg_cdbg("0x%06x-0x%06x:", info->region_start, info->region_end);
Richard Hughes842d6782021-01-15 09:48:12 +00001242 flashprog_progress_start(flashctx, FLASHPROG_PROGRESS_WRITE,
1243 info->region_end - info->region_start + 1);
Nico Huberc09fca42023-01-29 15:58:09 +01001244 ret = write_range(flashctx, info->region_start,
1245 info->curcontents + info->region_start,
1246 info->newcontents + info->region_start,
1247 info->region_end + 1 - info->region_start, &skipped);
1248 if (ret) {
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001249 msg_cerr("FAILED!\n");
Nico Huberc09fca42023-01-29 15:58:09 +01001250 goto free_ret;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001251 }
Richard Hughes842d6782021-01-15 09:48:12 +00001252 flashprog_progress_finish(flashctx);
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001253 if (skipped) {
1254 msg_cdbg("S\n");
1255 } else {
1256 msg_cdbg("\n");
1257 all_skipped = false;
1258 }
Nico Huberd34af7a2023-01-15 23:58:18 +01001259 }
Nico Huber7af0e792016-04-29 16:40:15 +02001260 }
1261 if (all_skipped)
1262 msg_cinfo("\nWarning: Chip content is identical to the requested image.\n");
Nico Huberc6a924a2024-09-04 15:09:52 +02001263 msg_cinfo("Erase%s done.\n", info->newcontents ? "/write" : "");
Nico Huberc09fca42023-01-29 15:58:09 +01001264
1265free_ret:
1266 free_erase_layout(erase_layouts, layout_count);
1267 return ret;
Nico Huber7af0e792016-04-29 16:40:15 +02001268}
1269
1270static int erase_block(struct flashctx *const flashctx,
1271 const struct walk_info *const info, const erasefn_t erasefn)
1272{
1273 const unsigned int erase_len = info->erase_end + 1 - info->erase_start;
Nico Huber6e61e0c2019-01-23 17:07:49 +01001274 const bool region_unaligned = info->region_start > info->erase_start ||
1275 info->erase_end > info->region_end;
1276 uint8_t *backup_contents = NULL, *erased_contents = NULL;
Nico Huberd34af7a2023-01-15 23:58:18 +01001277 int ret = 1;
Nico Huber7af0e792016-04-29 16:40:15 +02001278
Nico Huber6e61e0c2019-01-23 17:07:49 +01001279 /*
1280 * If the region is not erase-block aligned, merge current flash con-
1281 * tents into a new buffer `backup_contents`.
1282 */
1283 if (region_unaligned) {
1284 backup_contents = malloc(erase_len);
1285 erased_contents = malloc(erase_len);
1286 if (!backup_contents || !erased_contents) {
1287 msg_cerr("Out of memory!\n");
Nico Huber6e61e0c2019-01-23 17:07:49 +01001288 goto _free_ret;
1289 }
1290 memset(backup_contents, ERASED_VALUE(flashctx), erase_len);
1291 memset(erased_contents, ERASED_VALUE(flashctx), erase_len);
1292
1293 msg_cdbg("R");
1294 /* Merge data preceding the current region. */
1295 if (info->region_start > info->erase_start) {
1296 const chipoff_t start = info->erase_start;
1297 const chipsize_t len = info->region_start - info->erase_start;
1298 if (flashctx->chip->read(flashctx, backup_contents, start, len)) {
1299 msg_cerr("Can't read! Aborting.\n");
1300 goto _free_ret;
1301 }
1302 }
1303 /* Merge data following the current region. */
1304 if (info->erase_end > info->region_end) {
1305 const chipoff_t start = info->region_end + 1;
1306 const chipoff_t rel_start = start - info->erase_start; /* within this erase block */
1307 const chipsize_t len = info->erase_end - info->region_end;
1308 if (flashctx->chip->read(flashctx, backup_contents + rel_start, start, len)) {
1309 msg_cerr("Can't read! Aborting.\n");
1310 goto _free_ret;
1311 }
1312 }
1313 }
1314
Nico Huber7af0e792016-04-29 16:40:15 +02001315 all_skipped = false;
1316
1317 msg_cdbg("E");
1318 if (erasefn(flashctx, info->erase_start, erase_len))
Nico Huber6e61e0c2019-01-23 17:07:49 +01001319 goto _free_ret;
Richard Hughes842d6782021-01-15 09:48:12 +00001320 flashprog_progress_add(flashctx, erase_len);
Nico Huber7af0e792016-04-29 16:40:15 +02001321 if (check_erased_range(flashctx, info->erase_start, erase_len)) {
1322 msg_cerr("ERASE FAILED!\n");
Nico Huber6e61e0c2019-01-23 17:07:49 +01001323 goto _free_ret;
Nico Huber7af0e792016-04-29 16:40:15 +02001324 }
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001325 if (info->curcontents)
1326 memset(info->curcontents + info->erase_start, ERASED_VALUE(flashctx), erase_len);
Nico Huber6e61e0c2019-01-23 17:07:49 +01001327
1328 if (region_unaligned) {
Nico Huber3b9c86d2023-01-15 22:58:06 +01001329 if (write_range(flashctx, info->erase_start, erased_contents, backup_contents, erase_len, NULL))
1330 goto _free_ret;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001331 if (info->curcontents)
1332 memcpy(info->curcontents + info->erase_start, backup_contents, erase_len);
Nico Huber6e61e0c2019-01-23 17:07:49 +01001333 }
1334
1335 ret = 0;
1336
1337_free_ret:
1338 free(erased_contents);
1339 free(backup_contents);
1340 return ret;
Nico Huber7af0e792016-04-29 16:40:15 +02001341}
1342
1343/**
1344 * @brief Erases the included layout regions.
1345 *
1346 * If there is no layout set in the given flash context, the whole chip will
1347 * be erased.
1348 *
1349 * @param flashctx Flash context to be used.
Nico Huber7af0e792016-04-29 16:40:15 +02001350 * @return 0 on success,
1351 * 1 if all available erase functions failed.
1352 */
Nico Huber454f6132012-12-10 13:34:10 +00001353static int erase_by_layout(struct flashctx *const flashctx)
Nico Huber7af0e792016-04-29 16:40:15 +02001354{
1355 struct walk_info info = { 0 };
1356 return walk_by_layout(flashctx, &info, &erase_block);
1357}
1358
Nico Huber7af0e792016-04-29 16:40:15 +02001359/**
1360 * @brief Writes the included layout regions from a given image.
1361 *
1362 * If there is no layout set in the given flash context, the whole image
1363 * will be written.
1364 *
1365 * @param flashctx Flash context to be used.
1366 * @param curcontents A buffer of full chip size with current chip contents of included regions.
1367 * @param newcontents The new image to be written.
1368 * @return 0 on success,
1369 * 1 if anything has gone wrong.
1370 */
Nico Huber454f6132012-12-10 13:34:10 +00001371static int write_by_layout(struct flashctx *const flashctx,
1372 void *const curcontents, const void *const newcontents)
Nico Huber7af0e792016-04-29 16:40:15 +02001373{
1374 struct walk_info info;
1375 info.curcontents = curcontents;
1376 info.newcontents = newcontents;
Nico Huber5ff6fdc2023-01-15 23:43:12 +01001377 return walk_by_layout(flashctx, &info, erase_block);
Nico Huber7af0e792016-04-29 16:40:15 +02001378}
1379
1380/**
1381 * @brief Compares the included layout regions with content from a buffer.
1382 *
1383 * If there is no layout set in the given flash context, the whole chip's
1384 * contents will be compared.
1385 *
1386 * @param flashctx Flash context to be used.
Nico Huber74d09d42019-06-16 03:27:26 +02001387 * @param layout Flash layout information.
Nico Huber7af0e792016-04-29 16:40:15 +02001388 * @param curcontents A buffer of full chip size to read current chip contents into.
1389 * @param newcontents The new image to compare to.
1390 * @return 0 on success,
1391 * 1 if reading failed,
1392 * 3 if the contents don't match.
1393 */
Nico Huber74d09d42019-06-16 03:27:26 +02001394static int verify_by_layout(
1395 struct flashctx *const flashctx,
Nico Huberc3b02dc2023-08-12 01:13:45 +02001396 const struct flashprog_layout *const layout,
Nico Huber74d09d42019-06-16 03:27:26 +02001397 void *const curcontents, const uint8_t *const newcontents)
Nico Huber7af0e792016-04-29 16:40:15 +02001398{
Nico Huber5ca55232019-06-15 22:29:08 +02001399 const struct romentry *entry = NULL;
Nico Huber7af0e792016-04-29 16:40:15 +02001400
Richard Hughes842d6782021-01-15 09:48:12 +00001401 flashprog_progress_start_by_layout(flashctx, FLASHPROG_PROGRESS_READ, layout);
1402
Nico Huber5ca55232019-06-15 22:29:08 +02001403 while ((entry = layout_next_included(layout, entry))) {
1404 const chipoff_t region_start = entry->start;
1405 const chipsize_t region_len = entry->end - entry->start + 1;
Nico Huber7af0e792016-04-29 16:40:15 +02001406
1407 if (flashctx->chip->read(flashctx, curcontents + region_start, region_start, region_len))
1408 return 1;
1409 if (compare_range(newcontents + region_start, curcontents + region_start,
1410 region_start, region_len))
1411 return 3;
1412 }
Richard Hughes842d6782021-01-15 09:48:12 +00001413
1414 flashprog_progress_finish(flashctx);
1415
Nico Huber7af0e792016-04-29 16:40:15 +02001416 return 0;
1417}
1418
Stefan Tauner136388f2013-07-15 10:47:53 +00001419static void nonfatal_help_message(void)
Carl-Daniel Hailfinger42d38a92010-10-19 22:06:20 +00001420{
Stefan Taunera58f6e92014-05-10 09:25:44 +00001421 msg_gerr("Good, writing to the flash chip apparently didn't do anything.\n");
Stefan Tauner136388f2013-07-15 10:47:53 +00001422#if CONFIG_INTERNAL == 1
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +02001423 if (programmer == &programmer_internal)
Stefan Tauner136388f2013-07-15 10:47:53 +00001424 msg_gerr("This means we have to add special support for your board, programmer or flash\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +02001425 "chip. Please report this to the mailing list at flashprog@flashprog.org or\n"
1426 "on IRC (see https://www.flashprog.org/Contact for details), thanks!\n"
Stefan Tauner136388f2013-07-15 10:47:53 +00001427 "-------------------------------------------------------------------------------\n"
1428 "You may now reboot or simply leave the machine running.\n");
1429 else
1430#endif
1431 msg_gerr("Please check the connections (especially those to write protection pins) between\n"
Nico Huberc3b02dc2023-08-12 01:13:45 +02001432 "the programmer and the flash chip. If you think the error is caused by flashprog\n"
1433 "please report this to the mailing list at flashprog@flashprog.org or on IRC\n"
1434 "(see https://www.flashprog.org/Contact for details), thanks!\n");
Carl-Daniel Hailfinger42d38a92010-10-19 22:06:20 +00001435}
1436
Edward O'Callaghanc72d20a2021-12-13 12:30:03 +11001437void emergency_help_message(void)
Carl-Daniel Hailfinger8ab49e72009-08-19 13:55:34 +00001438{
Stefan Tauner136388f2013-07-15 10:47:53 +00001439 msg_gerr("Your flash chip is in an unknown state.\n");
1440#if CONFIG_INTERNAL == 1
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +02001441 if (programmer == &programmer_internal)
Nico Huberc3b02dc2023-08-12 01:13:45 +02001442 msg_gerr("Get help on IRC (see https://www.flashprog.org/Contact) or mail\n"
1443 "flashprog@flashprog.org with the subject \"FAILED: <your board name>\"!\n"
Stefan Tauner136388f2013-07-15 10:47:53 +00001444 "-------------------------------------------------------------------------------\n"
1445 "DO NOT REBOOT OR POWEROFF!\n");
1446 else
1447#endif
Nico Huberc3b02dc2023-08-12 01:13:45 +02001448 msg_gerr("Please report this to the mailing list at flashprog@flashprog.org\n"
1449 "or on IRC (see https://www.flashprog.org/Contact for details), thanks!\n");
Carl-Daniel Hailfinger8ab49e72009-08-19 13:55:34 +00001450}
1451
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001452void list_programmers_linebreak(int startcol, int cols, int paren)
1453{
1454 const char *pname;
Carl-Daniel Hailfinger082c8b52011-08-15 19:54:20 +00001455 int pnamelen;
1456 int remaining = 0, firstline = 1;
Thomas Heijligen9163b812021-06-01 14:25:01 +02001457 size_t p;
Carl-Daniel Hailfinger082c8b52011-08-15 19:54:20 +00001458 int i;
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001459
Thomas Heijligend45cb592021-05-19 14:12:18 +02001460 for (p = 0; p < programmer_table_size; p++) {
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001461 pname = programmer_table[p]->name;
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001462 pnamelen = strlen(pname);
1463 if (remaining - pnamelen - 2 < 0) {
1464 if (firstline)
1465 firstline = 0;
1466 else
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001467 msg_ginfo("\n");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001468 for (i = 0; i < startcol; i++)
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001469 msg_ginfo(" ");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001470 remaining = cols - startcol;
1471 } else {
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001472 msg_ginfo(" ");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001473 remaining--;
1474 }
1475 if (paren && (p == 0)) {
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001476 msg_ginfo("(");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001477 remaining--;
1478 }
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001479 msg_ginfo("%s", pname);
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001480 remaining -= pnamelen;
Thomas Heijligend45cb592021-05-19 14:12:18 +02001481 if (p < programmer_table_size - 1) {
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001482 msg_ginfo(",");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001483 remaining--;
1484 } else {
1485 if (paren)
Carl-Daniel Hailfinger901a3ba2012-05-14 22:54:58 +00001486 msg_ginfo(")");
Carl-Daniel Hailfingera73fb492010-10-06 23:48:34 +00001487 }
1488 }
1489}
1490
Carl-Daniel Hailfinger552420b2009-12-24 02:15:55 +00001491int selfcheck(void)
1492{
Stefan Tauner96658be2014-05-26 22:05:31 +00001493 unsigned int i;
Stefan Taunera6d96482012-12-26 19:51:23 +00001494 int ret = 0;
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +00001495
Thomas Heijligend45cb592021-05-19 14:12:18 +02001496 for (i = 0; i < programmer_table_size; i++) {
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001497 const struct programmer_entry *const p = programmer_table[i];
1498 if (p == NULL) {
1499 msg_gerr("Programmer with index %d is NULL instead of a valid pointer!\n", i);
1500 ret = 1;
1501 continue;
1502 }
1503 if (p->name == NULL) {
Stefan Taunera6d96482012-12-26 19:51:23 +00001504 msg_gerr("All programmers need a valid name, but the one with index %d does not!\n", i);
1505 ret = 1;
1506 /* This might hide other problems with this programmer, but allows for better error
1507 * messages below without jumping through hoops. */
1508 continue;
1509 }
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001510 switch (p->type) {
Stefan Tauneraf358d62012-12-27 18:40:26 +00001511 case USB:
1512 case PCI:
1513 case OTHER:
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001514 if (p->devs.note == NULL) {
1515 if (strcmp("internal", p->name) == 0)
Stefan Tauneraf358d62012-12-27 18:40:26 +00001516 break; /* This one has its device list stored separately. */
1517 msg_gerr("Programmer %s has neither a device list nor a textual description!\n",
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001518 p->name);
Stefan Tauneraf358d62012-12-27 18:40:26 +00001519 ret = 1;
1520 }
1521 break;
1522 default:
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001523 msg_gerr("Programmer %s does not have a valid type set!\n", p->name);
Stefan Tauneraf358d62012-12-27 18:40:26 +00001524 ret = 1;
1525 break;
1526 }
Thomas Heijligen633d6db2021-03-31 19:09:44 +02001527 if (p->init == NULL) {
1528 msg_gerr("Programmer %s does not have a valid init function!\n", p->name);
Stefan Taunera6d96482012-12-26 19:51:23 +00001529 ret = 1;
1530 }
Stefan Taunera6d96482012-12-26 19:51:23 +00001531 }
Stefan Tauner96658be2014-05-26 22:05:31 +00001532
1533 /* It would be favorable if we could check for the correct layout (especially termination) of various
1534 * constant arrays: flashchips, chipset_enables, board_matches, boards_known, laptops_known.
1535 * They are all defined as externs in this compilation unit so we don't know their sizes which vary
1536 * depending on compiler flags, e.g. the target architecture, and can sometimes be 0.
1537 * For 'flashchips' we export the size explicitly to work around this and to be able to implement the
1538 * checks below. */
Stefan Tauner6697f712014-08-06 15:09:15 +00001539 if (flashchips_size <= 1 || flashchips[flashchips_size - 1].name != NULL) {
Stefan Tauner7bcacb12011-05-26 01:35:19 +00001540 msg_gerr("Flashchips table miscompilation!\n");
1541 ret = 1;
Stefan Tauner96658be2014-05-26 22:05:31 +00001542 } else {
1543 for (i = 0; i < flashchips_size - 1; i++) {
1544 const struct flashchip *chip = &flashchips[i];
Nico Huberd40037a2024-10-20 23:20:46 +02001545 const char *const name = chip->name != NULL ? chip->name : "unnamed";
Stefan Tauner96658be2014-05-26 22:05:31 +00001546 if (chip->vendor == NULL || chip->name == NULL || chip->bustype == BUS_NONE) {
1547 ret = 1;
1548 msg_gerr("ERROR: Some field of flash chip #%d (%s) is misconfigured.\n"
Nico Huberd40037a2024-10-20 23:20:46 +02001549 "Please report a bug at flashprog@flashprog.org\n", i, name);
Stefan Tauner96658be2014-05-26 22:05:31 +00001550 }
Nico Huber930d4212024-05-04 18:59:15 +02001551 if (chip->feature_bits &
1552 (FEATURE_4BA_ENTER | FEATURE_4BA_ENTER_WREN | FEATURE_4BA_ENTER_EAR7 |
1553 FEATURE_ANY_DUAL | FEATURE_ANY_QUAD)
1554 && !chip->prepare_access) {
1555 msg_gerr("ERROR: Flash chip #%d (%s) misses chip\n"
1556 "preparation function for 4BA and multi-i/o modes.\n"
Nico Huberd40037a2024-10-20 23:20:46 +02001557 "Please report a bug at flashprog@flashprog.org\n", i, name);
1558 ret = 1;
1559 }
Nico Huberf0503702024-11-08 16:15:53 +01001560 uint8_t zero_cycles[sizeof(chip->dummy_cycles)] = { 0 };
1561 if ((chip->feature_bits & (FEATURE_QPI_35_F5 | FEATURE_QPI_38_FF)) &&
1562 !memcmp(&chip->dummy_cycles, zero_cycles, sizeof(zero_cycles))) {
1563 msg_gerr("ERROR: Flash chip #%d (%s) misses QPI dummy-cycle\n"
1564 "settings. Please report a bug at flashprog@flashprog.org\n",
1565 i, name);
1566 ret = 1;
1567 }
Nico Huberd40037a2024-10-20 23:20:46 +02001568 if (chip->reg_bits.bp[0].reg != INVALID_REG &&
1569 (!chip->wp_write_cfg || !chip->wp_read_cfg ||
1570 !chip->wp_get_ranges || !chip->decode_range)) {
1571 msg_gerr("ERROR: Flash chip #%d (%s) advertises block-protection\n"
1572 "bits, but misses one or more write-protection functions.\n"
1573 "Please report a bug at flashprog@flashprog.org\n", i, name);
Nico Huber930d4212024-05-04 18:59:15 +02001574 ret = 1;
1575 }
Stefan Tauner96658be2014-05-26 22:05:31 +00001576 if (selfcheck_eraseblocks(chip)) {
1577 ret = 1;
1578 }
1579 }
Stefan Tauner7bcacb12011-05-26 01:35:19 +00001580 }
Stefan Tauner7bcacb12011-05-26 01:35:19 +00001581
Stefan Tauner600576b2014-06-12 22:57:36 +00001582#if CONFIG_INTERNAL == 1
1583 ret |= selfcheck_board_enables();
1584#endif
1585
Stefan Tauner96658be2014-05-26 22:05:31 +00001586 /* TODO: implement similar sanity checks for other arrays where deemed necessary. */
Carl-Daniel Hailfinger293adf02010-01-18 08:14:43 +00001587 return ret;
Carl-Daniel Hailfinger552420b2009-12-24 02:15:55 +00001588}
1589
Edward O'Callaghanacb24d42021-04-15 13:44:39 +10001590/* FIXME: This function signature needs to be improved once prepare_flash_access()
1591 * has a better function signature.
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001592 */
Jacob Garberbeeb8bc2019-06-21 15:24:17 -06001593static int chip_safety_check(const struct flashctx *flash, int force,
1594 int read_it, int write_it, int erase_it, int verify_it)
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001595{
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +00001596 const struct flashchip *chip = flash->chip;
1597
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001598 if (!programmer_may_write && (write_it || erase_it)) {
1599 msg_perr("Write/erase is not working yet on your programmer in "
1600 "its current configuration.\n");
1601 /* --force is the wrong approach, but it's the best we can do
1602 * until the generic programmer parameter parser is merged.
1603 */
1604 if (!force)
1605 return 1;
1606 msg_cerr("Continuing anyway.\n");
1607 }
1608
1609 if (read_it || erase_it || write_it || verify_it) {
1610 /* Everything needs read. */
Stefan Tauner6455dff2014-05-26 00:36:24 +00001611 if (chip->tested.read == BAD) {
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001612 msg_cerr("Read is not working on this chip. ");
1613 if (!force)
1614 return 1;
1615 msg_cerr("Continuing anyway.\n");
1616 }
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +00001617 if (!chip->read) {
Nico Huberc3b02dc2023-08-12 01:13:45 +02001618 msg_cerr("flashprog has no read function for this "
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001619 "flash chip.\n");
1620 return 1;
1621 }
1622 }
1623 if (erase_it || write_it) {
1624 /* Write needs erase. */
Stefan Tauner6455dff2014-05-26 00:36:24 +00001625 if (chip->tested.erase == NA) {
1626 msg_cerr("Erase is not possible on this chip.\n");
1627 return 1;
1628 }
1629 if (chip->tested.erase == BAD) {
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001630 msg_cerr("Erase is not working on this chip. ");
1631 if (!force)
1632 return 1;
1633 msg_cerr("Continuing anyway.\n");
1634 }
Sylvain "ythier" Hitier9db45512011-07-04 07:27:17 +00001635 if(count_usable_erasers(flash) == 0) {
Nico Huberc3b02dc2023-08-12 01:13:45 +02001636 msg_cerr("flashprog has no erase function for this "
Stefan Tauner5368dca2011-07-01 00:19:12 +00001637 "flash chip.\n");
1638 return 1;
1639 }
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001640 }
1641 if (write_it) {
Stefan Tauner6455dff2014-05-26 00:36:24 +00001642 if (chip->tested.write == NA) {
1643 msg_cerr("Write is not possible on this chip.\n");
1644 return 1;
1645 }
1646 if (chip->tested.write == BAD) {
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001647 msg_cerr("Write is not working on this chip. ");
1648 if (!force)
1649 return 1;
1650 msg_cerr("Continuing anyway.\n");
1651 }
Carl-Daniel Hailfinger5a7cb842012-08-25 01:17:58 +00001652 if (!chip->write) {
Nico Huberc3b02dc2023-08-12 01:13:45 +02001653 msg_cerr("flashprog has no write function for this "
Carl-Daniel Hailfinger43069442010-10-15 00:01:14 +00001654 "flash chip.\n");
1655 return 1;
1656 }
1657 }
1658 return 0;
1659}
1660
Nico Huber305f4172013-06-14 11:55:26 +02001661int prepare_flash_access(struct flashctx *const flash,
1662 const bool read_it, const bool write_it,
1663 const bool erase_it, const bool verify_it)
Nico Huber454f6132012-12-10 13:34:10 +00001664{
1665 if (chip_safety_check(flash, flash->flags.force, read_it, write_it, erase_it, verify_it)) {
1666 msg_cerr("Aborting.\n");
1667 return 1;
1668 }
1669
Nico Huber3ac761c2023-01-16 02:43:17 +01001670 if (layout_sanity_checks(flash, write_it)) {
Nico Huber454f6132012-12-10 13:34:10 +00001671 msg_cerr("Requested regions can not be handled. Aborting.\n");
1672 return 1;
1673 }
1674
Nico Huber901fb952023-01-11 23:24:23 +01001675 if (flash->chip->prepare_access && flash->chip->prepare_access(flash, PREPARE_FULL))
1676 return 1;
1677
Nikolai Artemiev4ad48642020-11-05 13:54:27 +11001678 /* Initialize chip_restore_fn_count before chip unlock calls. */
1679 flash->chip_restore_fn_count = 0;
1680
Nico Huber454f6132012-12-10 13:34:10 +00001681 /* Given the existence of read locks, we want to unlock for read,
1682 erase and write. */
1683 if (flash->chip->unlock)
1684 flash->chip->unlock(flash);
1685
1686 return 0;
1687}
1688
Nico Huber305f4172013-06-14 11:55:26 +02001689void finalize_flash_access(struct flashctx *const flash)
Nico Huber454f6132012-12-10 13:34:10 +00001690{
Nikolai Artemiev4ad48642020-11-05 13:54:27 +11001691 deregister_chip_restore(flash);
Nico Huber901fb952023-01-11 23:24:23 +01001692 if (flash->chip->finish_access)
1693 flash->chip->finish_access(flash);
Nico Huber454f6132012-12-10 13:34:10 +00001694}
1695
1696/**
Nico Huberc3b02dc2023-08-12 01:13:45 +02001697 * @addtogroup flashprog-flash
Nico Huber454f6132012-12-10 13:34:10 +00001698 * @{
1699 */
1700
1701/**
1702 * @brief Erase the specified ROM chip.
1703 *
1704 * If a layout is set in the given flash context, only included regions
1705 * will be erased.
1706 *
1707 * @param flashctx The context of the flash chip to erase.
1708 * @return 0 on success.
1709 */
Nico Huberc3b02dc2023-08-12 01:13:45 +02001710int flashprog_flash_erase(struct flashctx *const flashctx)
Nico Huber454f6132012-12-10 13:34:10 +00001711{
1712 if (prepare_flash_access(flashctx, false, false, true, false))
1713 return 1;
1714
1715 const int ret = erase_by_layout(flashctx);
1716
1717 finalize_flash_access(flashctx);
1718
1719 return ret;
1720}
1721
Nico Huberc3b02dc2023-08-12 01:13:45 +02001722/** @} */ /* end flashprog-flash */
Nico Huber454f6132012-12-10 13:34:10 +00001723
1724/**
Nico Huberc3b02dc2023-08-12 01:13:45 +02001725 * @defgroup flashprog-ops Operations
Nico Huber454f6132012-12-10 13:34:10 +00001726 * @{
1727 */
1728
1729/**
1730 * @brief Read the current image from the specified ROM chip.
1731 *
1732 * If a layout is set in the specified flash context, only included regions
1733 * will be read.
1734 *
1735 * @param flashctx The context of the flash chip.
1736 * @param buffer Target buffer to write image to.
1737 * @param buffer_len Size of target buffer in bytes.
1738 * @return 0 on success,
1739 * 2 if buffer_len is too short for the flash chip's contents,
1740 * or 1 on any other failure.
1741 */
Nico Huberc3b02dc2023-08-12 01:13:45 +02001742int flashprog_image_read(struct flashctx *const flashctx, void *const buffer, const size_t buffer_len)
Nico Huber454f6132012-12-10 13:34:10 +00001743{
1744 const size_t flash_size = flashctx->chip->total_size * 1024;
1745
1746 if (flash_size > buffer_len)
1747 return 2;
1748
1749 if (prepare_flash_access(flashctx, true, false, false, false))
1750 return 1;
1751
1752 msg_cinfo("Reading flash... ");
1753
1754 int ret = 1;
1755 if (read_by_layout(flashctx, buffer)) {
1756 msg_cerr("Read operation failed!\n");
1757 msg_cinfo("FAILED.\n");
1758 goto _finalize_ret;
1759 }
1760 msg_cinfo("done.\n");
1761 ret = 0;
1762
1763_finalize_ret:
1764 finalize_flash_access(flashctx);
1765 return ret;
1766}
1767
1768static void combine_image_by_layout(const struct flashctx *const flashctx,
1769 uint8_t *const newcontents, const uint8_t *const oldcontents)
1770{
Nico Huberc3b02dc2023-08-12 01:13:45 +02001771 const struct flashprog_layout *const layout = get_layout(flashctx);
Nico Huber3d7b1e32018-12-22 00:53:14 +01001772 const struct romentry *included;
1773 chipoff_t start = 0;
Nico Huber454f6132012-12-10 13:34:10 +00001774
Nico Huber3d7b1e32018-12-22 00:53:14 +01001775 while ((included = layout_next_included_region(layout, start))) {
1776 if (included->start > start) {
1777 /* copy everything up to the start of this included region */
1778 memcpy(newcontents + start, oldcontents + start, included->start - start);
1779 }
1780 /* skip this included region */
1781 start = included->end + 1;
1782 if (start == 0)
1783 return;
Nico Huber454f6132012-12-10 13:34:10 +00001784 }
Nico Huber3d7b1e32018-12-22 00:53:14 +01001785
1786 /* copy the rest of the chip */
1787 const chipsize_t copy_len = flashctx->chip->total_size * 1024 - start;
1788 memcpy(newcontents + start, oldcontents + start, copy_len);
Nico Huber454f6132012-12-10 13:34:10 +00001789}
1790
1791/**
1792 * @brief Write the specified image to the ROM chip.
1793 *
1794 * If a layout is set in the specified flash context, only erase blocks
1795 * containing included regions will be touched.
1796 *
1797 * @param flashctx The context of the flash chip.
Nico Huber1b172f22017-06-19 12:35:24 +02001798 * @param buffer Source buffer to read image from (may be altered for full verification).
Nico Huber454f6132012-12-10 13:34:10 +00001799 * @param buffer_len Size of source buffer in bytes.
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001800 * @param refbuffer If given, assume flash chip contains same data as `refbuffer`.
Nico Huber454f6132012-12-10 13:34:10 +00001801 * @return 0 on success,
1802 * 4 if buffer_len doesn't match the size of the flash chip,
1803 * 3 if write was tried but nothing has changed,
1804 * 2 if write failed and flash contents changed,
1805 * or 1 on any other failure.
1806 */
Nico Huberc3b02dc2023-08-12 01:13:45 +02001807int flashprog_image_write(struct flashctx *const flashctx, void *const buffer, const size_t buffer_len,
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001808 const void *const refbuffer)
Nico Huber454f6132012-12-10 13:34:10 +00001809{
1810 const size_t flash_size = flashctx->chip->total_size * 1024;
1811 const bool verify_all = flashctx->flags.verify_whole_chip;
1812 const bool verify = flashctx->flags.verify_after_write;
Nico Huberc3b02dc2023-08-12 01:13:45 +02001813 const struct flashprog_layout *const verify_layout =
Nico Huber74d09d42019-06-16 03:27:26 +02001814 verify_all ? get_default_layout(flashctx) : get_layout(flashctx);
Nico Huber454f6132012-12-10 13:34:10 +00001815
1816 if (buffer_len != flash_size)
1817 return 4;
1818
1819 int ret = 1;
1820
1821 uint8_t *const newcontents = buffer;
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001822 const uint8_t *const refcontents = refbuffer;
Nico Huber454f6132012-12-10 13:34:10 +00001823 uint8_t *const curcontents = malloc(flash_size);
1824 uint8_t *oldcontents = NULL;
1825 if (verify_all)
1826 oldcontents = malloc(flash_size);
1827 if (!curcontents || (verify_all && !oldcontents)) {
1828 msg_gerr("Out of memory!\n");
1829 goto _free_ret;
1830 }
1831
1832#if CONFIG_INTERNAL == 1
Thomas Heijligenc7e5b8b2021-06-01 14:21:41 +02001833 if (programmer == &programmer_internal && cb_check_image(newcontents, flash_size) < 0) {
Nico Huber454f6132012-12-10 13:34:10 +00001834 if (flashctx->flags.force_boardmismatch) {
1835 msg_pinfo("Proceeding anyway because user forced us to.\n");
1836 } else {
1837 msg_perr("Aborting. You can override this with "
1838 "-p internal:boardmismatch=force.\n");
1839 goto _free_ret;
1840 }
1841 }
1842#endif
1843
1844 if (prepare_flash_access(flashctx, false, true, false, verify))
1845 goto _free_ret;
1846
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001847 /* If given, assume flash chip contains same data as `refcontents`. */
1848 if (refcontents) {
1849 msg_cinfo("Assuming old flash chip contents as ref-file...\n");
1850 memcpy(curcontents, refcontents, flash_size);
1851 if (oldcontents)
1852 memcpy(oldcontents, refcontents, flash_size);
Nico Huber454f6132012-12-10 13:34:10 +00001853 } else {
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001854 /*
1855 * Read the whole chip to be able to check whether regions need to be
1856 * erased and to give better diagnostics in case write fails.
1857 * The alternative is to read only the regions which are to be
1858 * preserved, but in that case we might perform unneeded erase which
1859 * takes time as well.
1860 */
1861 msg_cinfo("Reading old flash chip contents... ");
1862 if (verify_all) {
Richard Hughes842d6782021-01-15 09:48:12 +00001863 if (flashprog_read_range(flashctx, oldcontents, 0, flash_size)) {
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001864 msg_cinfo("FAILED.\n");
1865 goto _finalize_ret;
1866 }
1867 memcpy(curcontents, oldcontents, flash_size);
1868 } else {
1869 if (read_by_layout(flashctx, curcontents)) {
1870 msg_cinfo("FAILED.\n");
1871 goto _finalize_ret;
1872 }
Nico Huber454f6132012-12-10 13:34:10 +00001873 }
Paul Kocialkowskif701f342018-01-15 01:10:36 +03001874 msg_cinfo("done.\n");
Nico Huber454f6132012-12-10 13:34:10 +00001875 }
Nico Huber454f6132012-12-10 13:34:10 +00001876
1877 if (write_by_layout(flashctx, curcontents, newcontents)) {
1878 msg_cerr("Uh oh. Erase/write failed. ");
1879 ret = 2;
1880 if (verify_all) {
1881 msg_cerr("Checking if anything has changed.\n");
1882 msg_cinfo("Reading current flash chip contents... ");
Richard Hughes842d6782021-01-15 09:48:12 +00001883 if (!flashprog_read_range(flashctx, curcontents, 0, flash_size)) {
Nico Huber454f6132012-12-10 13:34:10 +00001884 msg_cinfo("done.\n");
1885 if (!memcmp(oldcontents, curcontents, flash_size)) {
1886 nonfatal_help_message();
1887 goto _finalize_ret;
1888 }
1889 msg_cerr("Apparently at least some data has changed.\n");
1890 } else
1891 msg_cerr("Can't even read anymore!\n");
1892 emergency_help_message();
1893 goto _finalize_ret;
1894 } else {
1895 msg_cerr("\n");
1896 }
1897 emergency_help_message();
1898 goto _finalize_ret;
1899 }
1900
1901 /* Verify only if we actually changed something. */
1902 if (verify && !all_skipped) {
Nico Huber454f6132012-12-10 13:34:10 +00001903 msg_cinfo("Verifying flash... ");
1904
Nico Huber74d09d42019-06-16 03:27:26 +02001905 if (verify_all)
Nico Huber454f6132012-12-10 13:34:10 +00001906 combine_image_by_layout(flashctx, newcontents, oldcontents);
Nico Huber74d09d42019-06-16 03:27:26 +02001907 ret = verify_by_layout(flashctx, verify_layout, curcontents, newcontents);
Nico Huber454f6132012-12-10 13:34:10 +00001908 /* If we tried to write, and verification now fails, we
1909 might have an emergency situation. */
1910 if (ret)
1911 emergency_help_message();
1912 else
1913 msg_cinfo("VERIFIED.\n");
1914 } else {
1915 /* We didn't change anything. */
1916 ret = 0;
1917 }
1918
1919_finalize_ret:
1920 finalize_flash_access(flashctx);
1921_free_ret:
1922 free(oldcontents);
1923 free(curcontents);
1924 return ret;
1925}
1926
1927/**
1928 * @brief Verify the ROM chip's contents with the specified image.
1929 *
1930 * If a layout is set in the specified flash context, only included regions
1931 * will be verified.
1932 *
1933 * @param flashctx The context of the flash chip.
1934 * @param buffer Source buffer to verify with.
1935 * @param buffer_len Size of source buffer in bytes.
1936 * @return 0 on success,
1937 * 3 if the chip's contents don't match,
1938 * 2 if buffer_len doesn't match the size of the flash chip,
1939 * or 1 on any other failure.
1940 */
Nico Huberc3b02dc2023-08-12 01:13:45 +02001941int flashprog_image_verify(struct flashctx *const flashctx, const void *const buffer, const size_t buffer_len)
Nico Huber454f6132012-12-10 13:34:10 +00001942{
Nico Huberc3b02dc2023-08-12 01:13:45 +02001943 const struct flashprog_layout *const layout = get_layout(flashctx);
Nico Huber454f6132012-12-10 13:34:10 +00001944 const size_t flash_size = flashctx->chip->total_size * 1024;
1945
1946 if (buffer_len != flash_size)
1947 return 2;
1948
1949 const uint8_t *const newcontents = buffer;
1950 uint8_t *const curcontents = malloc(flash_size);
1951 if (!curcontents) {
1952 msg_gerr("Out of memory!\n");
1953 return 1;
1954 }
1955
1956 int ret = 1;
1957
1958 if (prepare_flash_access(flashctx, false, false, false, true))
1959 goto _free_ret;
1960
1961 msg_cinfo("Verifying flash... ");
Nico Huber74d09d42019-06-16 03:27:26 +02001962 ret = verify_by_layout(flashctx, layout, curcontents, newcontents);
Nico Huber454f6132012-12-10 13:34:10 +00001963 if (!ret)
1964 msg_cinfo("VERIFIED.\n");
1965
1966 finalize_flash_access(flashctx);
1967_free_ret:
1968 free(curcontents);
1969 return ret;
1970}
1971
Nico Huberc3b02dc2023-08-12 01:13:45 +02001972/** @} */ /* end flashprog-ops */