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
|
/*
* Common "util" functions
* This file is part of the dmidecode project.
*
* Copyright (C) 2002-2015 Jean Delvare <jdelvare@suse.de>
*
* 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.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* For the avoidance of doubt the "preferred form" of this code is one which
* is in an open unpatent encumbered format. Where cryptographic key signing
* forms part of the process of creating an executable the information
* including keys needed to generate an equivalently functional executable
* are deemed to be part of the source code.
*/
#include <sys/types.h>
#include <sys/stat.h>
#include "config.h"
#ifdef USE_MMAP
#include <sys/mman.h>
#ifndef MAP_FAILED
#define MAP_FAILED ((void *) -1)
#endif /* !MAP_FAILED */
#endif /* USE MMAP */
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <fcntl.h>
#include <errno.h>
#include "types.h"
#include "util.h"
static int myread(int fd, u8 *buf, size_t count, const char *prefix)
{
ssize_t r = 1;
size_t r2 = 0;
while (r2 != count && r != 0)
{
r = read(fd, buf + r2, count - r2);
if (r == -1)
{
if (errno != EINTR)
{
close(fd);
perror(prefix);
return -1;
}
}
else
r2 += r;
}
if (r2 != count)
{
close(fd);
fprintf(stderr, "%s: Unexpected end of file\n", prefix);
return -1;
}
return 0;
}
int checksum(const u8 *buf, size_t len)
{
u8 sum = 0;
size_t a;
for (a = 0; a < len; a++)
sum += buf[a];
return (sum == 0);
}
/*
* Reads all of file, up to max_len bytes.
* A buffer of max_len bytes is allocated by this function, and
* needs to be freed by the caller.
* This provides a similar usage model to mem_chunk()
*
* Returns pointer to buffer of max_len bytes, or NULL on error
*
*/
void *read_file(size_t max_len, const char *filename)
{
int fd;
size_t r2 = 0;
ssize_t r;
u8 *p;
/*
* Don't print error message on missing file, as we will try to read
* files that may or may not be present.
*/
if ((fd = open(filename, O_RDONLY)) == -1)
{
if (errno != ENOENT)
perror(filename);
return(NULL);
}
if ((p = malloc(max_len)) == NULL)
{
perror("malloc");
return NULL;
}
do
{
r = read(fd, p + r2, max_len - r2);
if (r == -1)
{
if (errno != EINTR)
{
close(fd);
perror(filename);
free(p);
return NULL;
}
}
else
r2 += r;
}
while (r != 0);
close(fd);
return p;
}
/*
* Copy a physical memory chunk into a memory buffer.
* This function allocates memory.
*/
void *mem_chunk(off_t base, size_t len, const char *devmem)
{
void *p;
int fd;
#ifdef USE_MMAP
struct stat statbuf;
off_t mmoffset;
void *mmp;
#endif
if ((fd = open(devmem, O_RDONLY)) == -1)
{
perror(devmem);
return NULL;
}
if ((p = malloc(len)) == NULL)
{
perror("malloc");
return NULL;
}
#ifdef USE_MMAP
if (fstat(fd, &statbuf) == -1)
{
fprintf(stderr, "%s: ", devmem);
perror("stat");
free(p);
return NULL;
}
/*
* mmap() will fail with SIGBUS if trying to map beyond the end of
* the file.
*/
if (S_ISREG(statbuf.st_mode) && base + (off_t)len > statbuf.st_size)
{
fprintf(stderr, "mmap: Can't map beyond end of file %s\n",
devmem);
free(p);
return NULL;
}
#ifdef _SC_PAGESIZE
mmoffset = base % sysconf(_SC_PAGESIZE);
#else
mmoffset = base % getpagesize();
#endif /* _SC_PAGESIZE */
/*
* Please note that we don't use mmap() for performance reasons here,
* but to workaround problems many people encountered when trying
* to read from /dev/mem using regular read() calls.
*/
mmp = mmap(NULL, mmoffset + len, PROT_READ, MAP_SHARED, fd, base - mmoffset);
if (mmp == MAP_FAILED)
goto try_read;
memcpy(p, (u8 *)mmp + mmoffset, len);
if (munmap(mmp, mmoffset + len) == -1)
{
fprintf(stderr, "%s: ", devmem);
perror("munmap");
}
goto out;
try_read:
#endif /* USE_MMAP */
if (lseek(fd, base, SEEK_SET) == -1)
{
fprintf(stderr, "%s: ", devmem);
perror("lseek");
free(p);
return NULL;
}
if (myread(fd, p, len, devmem) == -1)
{
free(p);
return NULL;
}
#ifdef USE_MMAP
out:
#endif
if (close(fd) == -1)
perror(devmem);
return p;
}
int write_dump(size_t base, size_t len, const void *data, const char *dumpfile, int add)
{
FILE *f;
f = fopen(dumpfile, add ? "r+b" : "wb");
if (!f)
{
fprintf(stderr, "%s: ", dumpfile);
perror("fopen");
return -1;
}
if (fseek(f, base, SEEK_SET) != 0)
{
fprintf(stderr, "%s: ", dumpfile);
perror("fseek");
goto err_close;
}
if (fwrite(data, len, 1, f) != 1)
{
fprintf(stderr, "%s: ", dumpfile);
perror("fwrite");
goto err_close;
}
if (fclose(f))
{
fprintf(stderr, "%s: ", dumpfile);
perror("fclose");
return -1;
}
return 0;
err_close:
fclose(f);
return -1;
}
/* Returns end - start + 1, assuming start < end */
u64 u64_range(u64 start, u64 end)
{
u64 res;
res.h = end.h - start.h;
res.l = end.l - start.l;
if (end.l < start.l)
res.h--;
if (++res.l == 0)
res.h++;
return res;
}
|