aboutsummaryrefslogtreecommitdiff
path: root/bin/flash-target
blob: aa77a99be35406b9db01bf59b4ba4fa18a42d2be (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
#!/bin/sh

PROJ="${1?'project'}"

OPENOCD=openocd

# location of OpenOCD Board .cfg files (only used with 'make flash-target')
#
# This path is from Ubuntu 14.04.
#
OPENOCD_BOARD_DIR=/usr/share/openocd/scripts/board

# Configuration (cfg) file containing programming directives for OpenOCD
#
# If you are using an STLINK v2.0 from an STM32 F4 DISCOVERY board,
# set this variable to "stm32f4discovery.cfg".
#
# If you are using an STLINK v2.1 from an STM32 F4 NUCLEO board,
# set this variable to "st_nucleo_f401re.cfg".
#
# If you are using something else, look for a matching configuration file in
# the OPENOCD_BOARD_DIR directory.
#
OPENOCD_PROC_FILE=stm32f4discovery.cfg
#OPENOCD_PROC_FILE=st_nucleo_f4.cfg

$OPENOCD -f $OPENOCD_BOARD_DIR/$OPENOCD_PROC_FILE -c "program $PROJ.elf verify reset exit"
0e1fffce61391dab4d37f231655c'>3252102
f141a79
3252102
f141a79
3252102
f141a79
3252102
f141a79
3252102
f141a79
3252102

















f141a79






































3252102

f141a79
3252102
aeaf94f
f141a79
3252102
f141a79
3252102

05b139f
3252102
aeaf94f

f141a79
3252102

f141a79
aeaf94f
3252102






f141a79
3252102










f141a79
3252102


aeaf94f
3252102



f141a79
3252102




f141a79


3252102


f141a79





3252102
f141a79
3252102


























f141a79
3252102





f141a79
3252102








b4cb0b5
3252102





































2de0824
3252102






























3252102















1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
  




                                                                       
  

                                                             
  



































                                                                           
                      
                      
                  
                   

                   
                     
 
             


                                                                           


                




                                                             
                    





                      
                                                        
                                                            
                                                            
                                                                
                                                            
                                                                                   
                                                            
                                                                                   
                                                            
                                                                           
                                                            

















                                                                           






































                                                                               

                                            
                                                                              
 
                                
                   
 
                                                      

                 
                                                         
 

                                                  
                                                          

 
                                                                               
                                                                






                                                
                                                          










                                                                   
                                                    


                                        
                                                        



                                    
                      




                                         


                    


                           





                                                                           
                           
                                                


























                                                    
                                                            





                                                                    
                                                              








                                                                              
                                  





































                                                                                           
                            






























                                                             















                                    
/*
 * hash.c
 * ------
 * This program uses the coretest_hashes subsystem to produce a
 * cryptographic hash of a file or input stream. It is a generalization
 * of the hash_tester.c test program.
 *
 * Authors: Joachim Strömbergson, Paul Selkirk
 * Copyright (c) 2014-2015, NORDUnet A/S All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are
 * met:
 * - Redistributions of source code must retain the above copyright notice,
 *   this list of conditions and the following disclaimer.
 *
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 *
 * - Neither the name of the NORDUnet nor the names of its contributors may
 *   be used to endorse or promote products derived from this software
 *   without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
 * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
 * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
 * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include <errno.h>
#include <sys/mman.h>
#include <fcntl.h>
#include <unistd.h>
#include <time.h>
#include <sys/time.h>
#include <sys/ioctl.h>
#include <arpa/inet.h>
#include <ctype.h>
#include <stdint.h>
#include <assert.h>

#include "cryptech.h"

char *usage =
"Usage: %s [-d] [-v] [-q] [algorithm [file]]\n"
"algorithms: sha-1, sha-256, sha-512/224, sha-512/256, sha-384, sha-512\n";

int quiet = 0;
int verbose = 0;


/* ---------------- algorithm lookup code ---------------- */

struct ctrl {
    char *name;
    off_t base_addr;
    off_t block_addr;
    int   block_len;
    off_t digest_addr;
    int   digest_len;
    int   mode;
} ctrl[] = {
    { "sha-1",       0, SHA1_ADDR_BLOCK, SHA1_BLOCK_LEN,
                     SHA1_ADDR_DIGEST, SHA1_DIGEST_LEN, 0 },
    { "sha-256",     0, SHA256_ADDR_BLOCK, SHA256_BLOCK_LEN,
                     SHA256_ADDR_DIGEST, SHA256_DIGEST_LEN, 0 },
    { "sha-512/224", 0, SHA512_ADDR_BLOCK, SHA512_BLOCK_LEN,
                     SHA512_ADDR_DIGEST, SHA512_224_DIGEST_LEN, MODE_SHA_512_224 },
    { "sha-512/256", 0, SHA512_ADDR_BLOCK, SHA512_BLOCK_LEN,
                     SHA512_ADDR_DIGEST, SHA512_256_DIGEST_LEN, MODE_SHA_512_256 },
    { "sha-384",     0, SHA512_ADDR_BLOCK, SHA512_BLOCK_LEN,
                     SHA512_ADDR_DIGEST, SHA384_DIGEST_LEN, MODE_SHA_384 },
    { "sha-512",     0, SHA512_ADDR_BLOCK, SHA512_BLOCK_LEN,
                     SHA512_ADDR_DIGEST, SHA512_DIGEST_LEN, MODE_SHA_512 },
    { NULL, 0, 0, 0 }
};

/* return the control structure for the given algorithm */
struct ctrl *find_algo(char *algo)
{
    int i;

    for (i = 0; ctrl[i].name != NULL; ++i)
        if (strcmp(ctrl[i].name, algo) == 0)
            return &ctrl[i];

    fprintf(stderr, "algorithm \"%s\" not found\n\n", algo);
    fprintf(stderr, usage, "hash");
    return NULL;
}

/* ---------------- startup code ---------------- */

static int patch(char *name, off_t base_addr) {
    struct ctrl *ctrl;

    ctrl = find_algo(name);
    if (ctrl == NULL)
	return -1;

    ctrl->base_addr = base_addr;
    return 0;
}

static int inited = 0;

static int init(void)
{
    struct core_info *core;

    if (inited)
        return 0;

    for (core = tc_core_first("sha"); core; core = tc_core_next(core, "sha")) {
        if (strncmp(core->name, SHA1_NAME0 SHA1_NAME1, 8) == 0)
            patch("sha-1", core->base);
        else if (strncmp(core->name, SHA256_NAME0 SHA256_NAME1, 8) == 0)
            patch("sha-256", core->base);
        else if (strncmp(core->name, SHA512_NAME0 SHA512_NAME1, 8) == 0) {
            patch("sha-512/224", core->base);
            patch("sha-512/256", core->base);
            patch("sha-384", core->base);
            patch("sha-512", core->base);
	}
    }

    inited = 1;
    return 0;
}

/* ---------------- hash ---------------- */

static int transmit(off_t base, uint8_t *block, int blen, int mode, int first)
{
    uint8_t ctrl_cmd[4] = { 0 };
    int limit = 10;

    if (tc_write(base + ADDR_BLOCK, block, blen) != 0)
        return 1;

    ctrl_cmd[3] = (first ? CTRL_INIT : CTRL_NEXT) | mode;

    return
	tc_write(base + ADDR_CTRL, ctrl_cmd, 4) ||
	tc_wait(base + ADDR_STATUS, STATUS_READY, &limit);
}

static int pad_transmit(off_t base, uint8_t *block, uint8_t flen, uint8_t blen,
			uint8_t mode, long long tlen, int first)
{
    assert(flen < blen);

    block[flen++] = 0x80;
    memset(block + flen, 0, blen - flen);

    if (blen - flen < ((blen == 64) ? 8 : 16)) {
        if (transmit(base, block, blen, mode, first) != 0)
            return 1;
        first = 0;
        memset(block, 0, blen);
    }

    /* properly the length is 128 bits for sha-512, but we can't
     * actually count above 64 bits
     */
    ((uint32_t *)block)[blen/4 - 2] = htonl((tlen >> 32) & 0xffff);
    ((uint32_t *)block)[blen/4 - 1] = htonl(tlen & 0xffff);

    return transmit(base, block, blen, mode, first);
}

/* return number of digest bytes read */
static int hash(char *algo, char *file, uint8_t *digest)
{
    uint8_t block[SHA512_BLOCK_LEN];
    struct ctrl *ctrl;
    int in_fd = 0;      /* stdin */
    off_t base, daddr;
    int blen, dlen, mode;
    int nblk, nread, first;
    int ret = -1;
    struct timeval start, stop, difftime;

    if (init() != 0)
        return -1;

    ctrl = find_algo(algo);
    if (ctrl == NULL)
        return -1;
    base = ctrl->base_addr;
    if (base == 0) {
	fprintf(stderr, "core for algorithm \"%s\" not installed\n", algo);
	return -1;
    }

    blen = ctrl->block_len;
    daddr = ctrl->base_addr + ctrl->digest_addr;
    dlen = ctrl->digest_len;
    mode = ctrl->mode;

    if (strcmp(file, "-") != 0) {
        in_fd = open(file, O_RDONLY);
        if (in_fd < 0) {
            perror("open");
            return -1;
        }
    }

    if (verbose) {
        if (gettimeofday(&start, NULL) < 0) {
            perror("gettimeofday");
            goto out;
        }
    }

    for (nblk = 0, first = 1; ; ++nblk, first = 0) {
        nread = read(in_fd, block, blen);
        if (nread < 0) {
            /* read error */
            perror("read");
            goto out;
        }
        else if (nread < blen) {
            /* partial read = last block */
            if (pad_transmit(base, block, nread, blen, mode,
                             (nblk * blen + nread) * 8, first) != 0)
                goto out;
            break;
        }
        else {
            /* full block read */
            if (transmit(base, block, blen, mode, first) != 0)
                goto out;
        }
    }

    /* Strictly speaking we should query "valid" status before reading digest,
     * but transmit() waits for "ready" status before returning, and the SHA
     * cores always assert valid before ready.
     */
    if (tc_read(daddr, digest, dlen) != 0) {
        perror("eim read failed");
        goto out;
    }

    if (verbose) {
        if (gettimeofday(&stop, NULL) < 0) {
            perror("gettimeofday");
            goto out;
        }
        timersub(&stop, &start, &difftime);
        printf("%d blocks written in %d.%03d sec (%.3f blocks/sec)\n",
               nblk, (int)difftime.tv_sec, (int)difftime.tv_usec/1000,
               (float)nblk / ((float)difftime.tv_sec + ((float)difftime.tv_usec)/1000000));
    }

    ret = dlen;
out:
    if (in_fd != 0)
        close(in_fd);
    return ret;
}

/* ---------------- main ---------------- */

int main(int argc, char *argv[])
{
    int i, opt;
    char *algo = "sha-1";
    char *file = "-";
    uint8_t digest[512/8];
    int dlen;

    while ((opt = getopt(argc, argv, "h?dvq")) != -1) {
        switch (opt) {
        case 'h':
        case '?':
            printf(usage, argv[0]);
            return EXIT_SUCCESS;
        case 'd':
            tc_set_debug(1);
            break;
        case 'v':
            verbose = 1;
            break;
        case 'q':
            quiet = 1;
            break;
        default:
            fprintf(stderr, usage, argv[0]);
            return EXIT_FAILURE;
        }
    }

    if (optind < argc) {
        algo = argv[optind];
        ++optind;
    }
    else {
        if (!quiet)
            printf("defaulting to algorithm \"%s\"\n", algo);
    }

    if (optind < argc) {
        file = argv[optind];
        ++optind;
    }
    else {
        if (!quiet)
            printf("reading from stdin\n");
    }

    dlen = hash(algo, file, digest);
    if (dlen < 0)
        return EXIT_FAILURE;

    for (i = 0; i < dlen; ++i) {
        printf("%02x", digest[i]);
        if (i % 16 == 15)
            printf("\n");
        else if (i % 4 == 3)
            printf(" ");
    }
    if (dlen % 16 != 0)
        printf("\n");

    return EXIT_SUCCESS;
}