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
|
/*
* This file is part of the flashrom project.
*
* Copyright (C) 2009-2010 Carl-Daniel Hailfinger
* Copyright (C) 2013 Stefan Tauner
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*/
#include <ctype.h>
#include <stdlib.h>
#include <string.h>
#include "flash.h"
int flashprog_read_chunked(struct flashctx *const flash, uint8_t *dst, unsigned int start, unsigned int len,
unsigned int chunksize, readfunc_t *const read)
{
int ret;
size_t to_read;
if (chunksize > 256 && chunksize & 3)
chunksize &= ~3;
for (; len; len -= to_read, dst += to_read, start += to_read) {
to_read = min(chunksize, len);
ret = read(flash, dst, start, to_read);
if (ret)
return ret;
flashprog_progress_add(flash, to_read);
}
return 0;
}
/* Returns the minimum number of bits needed to represent the given address.
* FIXME: use mind-blowing implementation. */
uint32_t address_to_bits(uint32_t addr)
{
unsigned int lzb = 0;
while (((1u << (31 - lzb)) & ~addr) != 0)
lzb++;
return 32 - lzb;
}
unsigned int bitcount(unsigned long a)
{
unsigned int i = 0;
for (; a != 0; a >>= 1)
if (a & 1)
i++;
return i;
}
int max(int a, int b)
{
return (a > b) ? a : b;
}
int min(int a, int b)
{
return (a < b) ? a : b;
}
char *strcat_realloc(char *dest, const char *src)
{
dest = realloc(dest, strlen(dest) + strlen(src) + 1);
if (!dest) {
msg_gerr("Out of memory!\n");
return NULL;
}
strcat(dest, src);
return dest;
}
void tolower_string(char *str)
{
for (; *str != '\0'; str++)
*str = (char)tolower((unsigned char)*str);
}
uint8_t reverse_byte(uint8_t x)
{
x = ((x >> 1) & 0x55) | ((x << 1) & 0xaa);
x = ((x >> 2) & 0x33) | ((x << 2) & 0xcc);
x = ((x >> 4) & 0x0f) | ((x << 4) & 0xf0);
return x;
}
void reverse_bytes(uint8_t *dst, const uint8_t *src, size_t length)
{
size_t i;
for (i = 0; i < length; i++)
dst[i] = reverse_byte(src[i]);
}
/* FIXME: Find a better solution for MinGW. Maybe wrap strtok_s (C11) if it becomes available */
#ifdef __MINGW32__
char* strtok_r(char *str, const char *delim, char **nextp)
{
if (str == NULL)
str = *nextp;
str += strspn(str, delim); /* Skip leading delimiters */
if (*str == '\0')
return NULL;
char *ret = str;
str += strcspn(str, delim); /* Find end of token */
if (*str != '\0')
*str++ = '\0';
*nextp = str;
return ret;
}
/* strndup is a POSIX function not present in MinGW */
char *strndup(const char *src, size_t maxlen)
{
char *retbuf;
size_t len;
for (len = 0; len < maxlen; len++)
if (src[len] == '\0')
break;
if ((retbuf = malloc(1 + len)) != NULL) {
memcpy(retbuf, src, len);
retbuf[len] = '\0';
}
return retbuf;
}
#endif
/* There is no strnlen in DJGPP */
#if defined(__DJGPP__) || (!defined(__LIBPAYLOAD__) && !defined(HAVE_STRNLEN))
size_t strnlen(const char *str, size_t n)
{
size_t i;
for (i = 0; i < n && str[i] != '\0'; i++)
;
return i;
}
#endif
|
