1*c232d14dSAlex Kiernan /*
2*c232d14dSAlex Kiernan * Copyright (c) 2009, Google Inc.
3*c232d14dSAlex Kiernan * All rights reserved.
4*c232d14dSAlex Kiernan *
5*c232d14dSAlex Kiernan * Copyright (c) 2009-2014, The Linux Foundation. All rights reserved.
6*c232d14dSAlex Kiernan * Portions Copyright 2014 Broadcom Corporation.
7*c232d14dSAlex Kiernan *
8*c232d14dSAlex Kiernan * Redistribution and use in source and binary forms, with or without
9*c232d14dSAlex Kiernan * modification, are permitted provided that the following conditions are met:
10*c232d14dSAlex Kiernan * * Redistributions of source code must retain the above copyright
11*c232d14dSAlex Kiernan * notice, this list of conditions and the following disclaimer.
12*c232d14dSAlex Kiernan * * Redistributions in binary form must reproduce the above copyright
13*c232d14dSAlex Kiernan * notice, this list of conditions and the following disclaimer in the
14*c232d14dSAlex Kiernan * documentation and/or other materials provided with the distribution.
15*c232d14dSAlex Kiernan * * Neither the name of The Linux Foundation nor
16*c232d14dSAlex Kiernan * the names of its contributors may be used to endorse or promote
17*c232d14dSAlex Kiernan * products derived from this software without specific prior written
18*c232d14dSAlex Kiernan * permission.
19*c232d14dSAlex Kiernan *
20*c232d14dSAlex Kiernan * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
21*c232d14dSAlex Kiernan * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22*c232d14dSAlex Kiernan * IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
23*c232d14dSAlex Kiernan * NON-INFRINGEMENT ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
24*c232d14dSAlex Kiernan * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
25*c232d14dSAlex Kiernan * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
26*c232d14dSAlex Kiernan * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
27*c232d14dSAlex Kiernan * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
28*c232d14dSAlex Kiernan * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
29*c232d14dSAlex Kiernan * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
30*c232d14dSAlex Kiernan * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31*c232d14dSAlex Kiernan *
32*c232d14dSAlex Kiernan * NOTE:
33*c232d14dSAlex Kiernan * Although it is very similar, this license text is not identical
34*c232d14dSAlex Kiernan * to the "BSD-3-Clause", therefore, DO NOT MODIFY THIS LICENSE TEXT!
35*c232d14dSAlex Kiernan */
36*c232d14dSAlex Kiernan
37*c232d14dSAlex Kiernan #include <config.h>
38*c232d14dSAlex Kiernan #include <common.h>
39*c232d14dSAlex Kiernan #include <image-sparse.h>
40*c232d14dSAlex Kiernan #include <div64.h>
41*c232d14dSAlex Kiernan #include <malloc.h>
42*c232d14dSAlex Kiernan #include <part.h>
43*c232d14dSAlex Kiernan #include <sparse_format.h>
44*c232d14dSAlex Kiernan
45*c232d14dSAlex Kiernan #include <linux/math64.h>
46*c232d14dSAlex Kiernan
default_log(const char * ignored,char * response)47*c232d14dSAlex Kiernan static void default_log(const char *ignored, char *response) {}
48*c232d14dSAlex Kiernan
write_sparse_image(struct sparse_storage * info,const char * part_name,void * data,char * response)49*c232d14dSAlex Kiernan int write_sparse_image(struct sparse_storage *info,
50*c232d14dSAlex Kiernan const char *part_name, void *data, char *response)
51*c232d14dSAlex Kiernan {
52*c232d14dSAlex Kiernan lbaint_t blk;
53*c232d14dSAlex Kiernan lbaint_t blkcnt;
54*c232d14dSAlex Kiernan lbaint_t blks;
55*c232d14dSAlex Kiernan uint32_t bytes_written = 0;
56*c232d14dSAlex Kiernan unsigned int chunk;
57*c232d14dSAlex Kiernan unsigned int offset;
58*c232d14dSAlex Kiernan unsigned int chunk_data_sz;
59*c232d14dSAlex Kiernan uint32_t *fill_buf = NULL;
60*c232d14dSAlex Kiernan uint32_t fill_val;
61*c232d14dSAlex Kiernan sparse_header_t *sparse_header;
62*c232d14dSAlex Kiernan chunk_header_t *chunk_header;
63*c232d14dSAlex Kiernan uint32_t total_blocks = 0;
64*c232d14dSAlex Kiernan int fill_buf_num_blks;
65*c232d14dSAlex Kiernan int i;
66*c232d14dSAlex Kiernan int j;
67*c232d14dSAlex Kiernan
68*c232d14dSAlex Kiernan fill_buf_num_blks = CONFIG_IMAGE_SPARSE_FILLBUF_SIZE / info->blksz;
69*c232d14dSAlex Kiernan
70*c232d14dSAlex Kiernan /* Read and skip over sparse image header */
71*c232d14dSAlex Kiernan sparse_header = (sparse_header_t *)data;
72*c232d14dSAlex Kiernan
73*c232d14dSAlex Kiernan data += sparse_header->file_hdr_sz;
74*c232d14dSAlex Kiernan if (sparse_header->file_hdr_sz > sizeof(sparse_header_t)) {
75*c232d14dSAlex Kiernan /*
76*c232d14dSAlex Kiernan * Skip the remaining bytes in a header that is longer than
77*c232d14dSAlex Kiernan * we expected.
78*c232d14dSAlex Kiernan */
79*c232d14dSAlex Kiernan data += (sparse_header->file_hdr_sz - sizeof(sparse_header_t));
80*c232d14dSAlex Kiernan }
81*c232d14dSAlex Kiernan
82*c232d14dSAlex Kiernan if (!info->mssg)
83*c232d14dSAlex Kiernan info->mssg = default_log;
84*c232d14dSAlex Kiernan
85*c232d14dSAlex Kiernan debug("=== Sparse Image Header ===\n");
86*c232d14dSAlex Kiernan debug("magic: 0x%x\n", sparse_header->magic);
87*c232d14dSAlex Kiernan debug("major_version: 0x%x\n", sparse_header->major_version);
88*c232d14dSAlex Kiernan debug("minor_version: 0x%x\n", sparse_header->minor_version);
89*c232d14dSAlex Kiernan debug("file_hdr_sz: %d\n", sparse_header->file_hdr_sz);
90*c232d14dSAlex Kiernan debug("chunk_hdr_sz: %d\n", sparse_header->chunk_hdr_sz);
91*c232d14dSAlex Kiernan debug("blk_sz: %d\n", sparse_header->blk_sz);
92*c232d14dSAlex Kiernan debug("total_blks: %d\n", sparse_header->total_blks);
93*c232d14dSAlex Kiernan debug("total_chunks: %d\n", sparse_header->total_chunks);
94*c232d14dSAlex Kiernan
95*c232d14dSAlex Kiernan /*
96*c232d14dSAlex Kiernan * Verify that the sparse block size is a multiple of our
97*c232d14dSAlex Kiernan * storage backend block size
98*c232d14dSAlex Kiernan */
99*c232d14dSAlex Kiernan div_u64_rem(sparse_header->blk_sz, info->blksz, &offset);
100*c232d14dSAlex Kiernan if (offset) {
101*c232d14dSAlex Kiernan printf("%s: Sparse image block size issue [%u]\n",
102*c232d14dSAlex Kiernan __func__, sparse_header->blk_sz);
103*c232d14dSAlex Kiernan info->mssg("sparse image block size issue", response);
104*c232d14dSAlex Kiernan return -1;
105*c232d14dSAlex Kiernan }
106*c232d14dSAlex Kiernan
107*c232d14dSAlex Kiernan puts("Flashing Sparse Image\n");
108*c232d14dSAlex Kiernan
109*c232d14dSAlex Kiernan /* Start processing chunks */
110*c232d14dSAlex Kiernan blk = info->start;
111*c232d14dSAlex Kiernan for (chunk = 0; chunk < sparse_header->total_chunks; chunk++) {
112*c232d14dSAlex Kiernan /* Read and skip over chunk header */
113*c232d14dSAlex Kiernan chunk_header = (chunk_header_t *)data;
114*c232d14dSAlex Kiernan data += sizeof(chunk_header_t);
115*c232d14dSAlex Kiernan
116*c232d14dSAlex Kiernan if (chunk_header->chunk_type != CHUNK_TYPE_RAW) {
117*c232d14dSAlex Kiernan debug("=== Chunk Header ===\n");
118*c232d14dSAlex Kiernan debug("chunk_type: 0x%x\n", chunk_header->chunk_type);
119*c232d14dSAlex Kiernan debug("chunk_data_sz: 0x%x\n", chunk_header->chunk_sz);
120*c232d14dSAlex Kiernan debug("total_size: 0x%x\n", chunk_header->total_sz);
121*c232d14dSAlex Kiernan }
122*c232d14dSAlex Kiernan
123*c232d14dSAlex Kiernan if (sparse_header->chunk_hdr_sz > sizeof(chunk_header_t)) {
124*c232d14dSAlex Kiernan /*
125*c232d14dSAlex Kiernan * Skip the remaining bytes in a header that is longer
126*c232d14dSAlex Kiernan * than we expected.
127*c232d14dSAlex Kiernan */
128*c232d14dSAlex Kiernan data += (sparse_header->chunk_hdr_sz -
129*c232d14dSAlex Kiernan sizeof(chunk_header_t));
130*c232d14dSAlex Kiernan }
131*c232d14dSAlex Kiernan
132*c232d14dSAlex Kiernan chunk_data_sz = sparse_header->blk_sz * chunk_header->chunk_sz;
133*c232d14dSAlex Kiernan blkcnt = chunk_data_sz / info->blksz;
134*c232d14dSAlex Kiernan switch (chunk_header->chunk_type) {
135*c232d14dSAlex Kiernan case CHUNK_TYPE_RAW:
136*c232d14dSAlex Kiernan if (chunk_header->total_sz !=
137*c232d14dSAlex Kiernan (sparse_header->chunk_hdr_sz + chunk_data_sz)) {
138*c232d14dSAlex Kiernan info->mssg("Bogus chunk size for chunk type Raw",
139*c232d14dSAlex Kiernan response);
140*c232d14dSAlex Kiernan return -1;
141*c232d14dSAlex Kiernan }
142*c232d14dSAlex Kiernan
143*c232d14dSAlex Kiernan if (blk + blkcnt > info->start + info->size) {
144*c232d14dSAlex Kiernan printf(
145*c232d14dSAlex Kiernan "%s: Request would exceed partition size!\n",
146*c232d14dSAlex Kiernan __func__);
147*c232d14dSAlex Kiernan info->mssg("Request would exceed partition size!",
148*c232d14dSAlex Kiernan response);
149*c232d14dSAlex Kiernan return -1;
150*c232d14dSAlex Kiernan }
151*c232d14dSAlex Kiernan
152*c232d14dSAlex Kiernan blks = info->write(info, blk, blkcnt, data);
153*c232d14dSAlex Kiernan /* blks might be > blkcnt (eg. NAND bad-blocks) */
154*c232d14dSAlex Kiernan if (blks < blkcnt) {
155*c232d14dSAlex Kiernan printf("%s: %s" LBAFU " [" LBAFU "]\n",
156*c232d14dSAlex Kiernan __func__, "Write failed, block #",
157*c232d14dSAlex Kiernan blk, blks);
158*c232d14dSAlex Kiernan info->mssg("flash write failure", response);
159*c232d14dSAlex Kiernan return -1;
160*c232d14dSAlex Kiernan }
161*c232d14dSAlex Kiernan blk += blks;
162*c232d14dSAlex Kiernan bytes_written += blkcnt * info->blksz;
163*c232d14dSAlex Kiernan total_blocks += chunk_header->chunk_sz;
164*c232d14dSAlex Kiernan data += chunk_data_sz;
165*c232d14dSAlex Kiernan break;
166*c232d14dSAlex Kiernan
167*c232d14dSAlex Kiernan case CHUNK_TYPE_FILL:
168*c232d14dSAlex Kiernan if (chunk_header->total_sz !=
169*c232d14dSAlex Kiernan (sparse_header->chunk_hdr_sz + sizeof(uint32_t))) {
170*c232d14dSAlex Kiernan info->mssg("Bogus chunk size for chunk type FILL", response);
171*c232d14dSAlex Kiernan return -1;
172*c232d14dSAlex Kiernan }
173*c232d14dSAlex Kiernan
174*c232d14dSAlex Kiernan fill_buf = (uint32_t *)
175*c232d14dSAlex Kiernan memalign(ARCH_DMA_MINALIGN,
176*c232d14dSAlex Kiernan ROUNDUP(
177*c232d14dSAlex Kiernan info->blksz * fill_buf_num_blks,
178*c232d14dSAlex Kiernan ARCH_DMA_MINALIGN));
179*c232d14dSAlex Kiernan if (!fill_buf) {
180*c232d14dSAlex Kiernan info->mssg("Malloc failed for: CHUNK_TYPE_FILL",
181*c232d14dSAlex Kiernan response);
182*c232d14dSAlex Kiernan return -1;
183*c232d14dSAlex Kiernan }
184*c232d14dSAlex Kiernan
185*c232d14dSAlex Kiernan fill_val = *(uint32_t *)data;
186*c232d14dSAlex Kiernan data = (char *)data + sizeof(uint32_t);
187*c232d14dSAlex Kiernan
188*c232d14dSAlex Kiernan for (i = 0;
189*c232d14dSAlex Kiernan i < (info->blksz * fill_buf_num_blks /
190*c232d14dSAlex Kiernan sizeof(fill_val));
191*c232d14dSAlex Kiernan i++)
192*c232d14dSAlex Kiernan fill_buf[i] = fill_val;
193*c232d14dSAlex Kiernan
194*c232d14dSAlex Kiernan if (blk + blkcnt > info->start + info->size) {
195*c232d14dSAlex Kiernan printf(
196*c232d14dSAlex Kiernan "%s: Request would exceed partition size!\n",
197*c232d14dSAlex Kiernan __func__);
198*c232d14dSAlex Kiernan info->mssg("Request would exceed partition size!",
199*c232d14dSAlex Kiernan response);
200*c232d14dSAlex Kiernan return -1;
201*c232d14dSAlex Kiernan }
202*c232d14dSAlex Kiernan
203*c232d14dSAlex Kiernan for (i = 0; i < blkcnt;) {
204*c232d14dSAlex Kiernan j = blkcnt - i;
205*c232d14dSAlex Kiernan if (j > fill_buf_num_blks)
206*c232d14dSAlex Kiernan j = fill_buf_num_blks;
207*c232d14dSAlex Kiernan blks = info->write(info, blk, j, fill_buf);
208*c232d14dSAlex Kiernan /* blks might be > j (eg. NAND bad-blocks) */
209*c232d14dSAlex Kiernan if (blks < j) {
210*c232d14dSAlex Kiernan printf("%s: %s " LBAFU " [%d]\n",
211*c232d14dSAlex Kiernan __func__,
212*c232d14dSAlex Kiernan "Write failed, block #",
213*c232d14dSAlex Kiernan blk, j);
214*c232d14dSAlex Kiernan info->mssg("flash write failure",
215*c232d14dSAlex Kiernan response);
216*c232d14dSAlex Kiernan free(fill_buf);
217*c232d14dSAlex Kiernan return -1;
218*c232d14dSAlex Kiernan }
219*c232d14dSAlex Kiernan blk += blks;
220*c232d14dSAlex Kiernan i += j;
221*c232d14dSAlex Kiernan }
222*c232d14dSAlex Kiernan bytes_written += blkcnt * info->blksz;
223*c232d14dSAlex Kiernan total_blocks += chunk_data_sz / sparse_header->blk_sz;
224*c232d14dSAlex Kiernan free(fill_buf);
225*c232d14dSAlex Kiernan break;
226*c232d14dSAlex Kiernan
227*c232d14dSAlex Kiernan case CHUNK_TYPE_DONT_CARE:
228*c232d14dSAlex Kiernan blk += info->reserve(info, blk, blkcnt);
229*c232d14dSAlex Kiernan total_blocks += chunk_header->chunk_sz;
230*c232d14dSAlex Kiernan break;
231*c232d14dSAlex Kiernan
232*c232d14dSAlex Kiernan case CHUNK_TYPE_CRC32:
233*c232d14dSAlex Kiernan if (chunk_header->total_sz !=
234*c232d14dSAlex Kiernan sparse_header->chunk_hdr_sz) {
235*c232d14dSAlex Kiernan info->mssg("Bogus chunk size for chunk type Dont Care",
236*c232d14dSAlex Kiernan response);
237*c232d14dSAlex Kiernan return -1;
238*c232d14dSAlex Kiernan }
239*c232d14dSAlex Kiernan total_blocks += chunk_header->chunk_sz;
240*c232d14dSAlex Kiernan data += chunk_data_sz;
241*c232d14dSAlex Kiernan break;
242*c232d14dSAlex Kiernan
243*c232d14dSAlex Kiernan default:
244*c232d14dSAlex Kiernan printf("%s: Unknown chunk type: %x\n", __func__,
245*c232d14dSAlex Kiernan chunk_header->chunk_type);
246*c232d14dSAlex Kiernan info->mssg("Unknown chunk type", response);
247*c232d14dSAlex Kiernan return -1;
248*c232d14dSAlex Kiernan }
249*c232d14dSAlex Kiernan }
250*c232d14dSAlex Kiernan
251*c232d14dSAlex Kiernan debug("Wrote %d blocks, expected to write %d blocks\n",
252*c232d14dSAlex Kiernan total_blocks, sparse_header->total_blks);
253*c232d14dSAlex Kiernan printf("........ wrote %u bytes to '%s'\n", bytes_written, part_name);
254*c232d14dSAlex Kiernan
255*c232d14dSAlex Kiernan if (total_blocks != sparse_header->total_blks) {
256*c232d14dSAlex Kiernan info->mssg("sparse image write failure", response);
257*c232d14dSAlex Kiernan return -1;
258*c232d14dSAlex Kiernan }
259*c232d14dSAlex Kiernan
260*c232d14dSAlex Kiernan return 0;
261*c232d14dSAlex Kiernan }
262