d37ab454d4
In order to provide some insight on what code is executed during coreboot's run time and how well our test scenarios work, this adds code coverage support to coreboot's ram stage. This should be easily adaptable for payloads, and maybe even romstage. See http://gcc.gnu.org/onlinedocs/gcc/Gcov.html for more information. To instrument coreboot, select CONFIG_COVERAGE ("Code coverage support") in Kconfig, and recompile coreboot. coreboot will then store its code coverage information into CBMEM, if possible. Then, run "cbmem -CV" as root on the target system running the instrumented coreboot binary. This will create a whole bunch of .gcda files that contain coverage information. Tar them up, copy them to your build system machine, and untar them. Then you can use your favorite coverage utility (gcov, lcov, ...) to visualize code coverage. For a sneak peak of what will expect you, please take a look at http://www.coreboot.org/~stepan/coreboot-coverage/ Change-Id: Ib287d8309878a1f5c4be770c38b1bc0bb3aa6ec7 Signed-off-by: Stefan Reinauer <reinauer@google.com> Reviewed-on: http://review.coreboot.org/2052 Tested-by: build bot (Jenkins) Reviewed-by: David Hendricks <dhendrix@chromium.org> Reviewed-by: Martin Roth <martin@se-eng.com> Reviewed-by: Ronald G. Minnich <rminnich@gmail.com>
623 lines
15 KiB
C
623 lines
15 KiB
C
/*
|
|
* This file is part of the coreboot project.
|
|
*
|
|
* Copyright (C) 2012 The ChromiumOS Authors. All rights reserved.
|
|
*
|
|
* 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; version 2 of the License.
|
|
*
|
|
* 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., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <unistd.h>
|
|
#include <getopt.h>
|
|
#include <errno.h>
|
|
#include <fcntl.h>
|
|
#include <sys/types.h>
|
|
#include <sys/stat.h>
|
|
#include <sys/mman.h>
|
|
#include <libgen.h>
|
|
#include <assert.h>
|
|
|
|
#define ARRAY_SIZE(a) (sizeof(a) / sizeof((a)[0]))
|
|
#define MAP_BYTES (1024*1024)
|
|
|
|
#include "boot/coreboot_tables.h"
|
|
|
|
typedef uint16_t u16;
|
|
typedef uint32_t u32;
|
|
typedef uint64_t u64;
|
|
|
|
#include "cbmem.h"
|
|
#include "timestamp.h"
|
|
|
|
#define CBMEM_VERSION "1.0"
|
|
|
|
/* verbose output? */
|
|
static int verbose = 0;
|
|
#define debug(x...) if(verbose) printf(x)
|
|
|
|
/* File handle used to access /dev/mem */
|
|
static int fd;
|
|
|
|
/*
|
|
* calculate ip checksum (16 bit quantities) on a passed in buffer. In case
|
|
* the buffer length is odd last byte is excluded from the calculation
|
|
*/
|
|
static u16 ipchcksum(const void *addr, unsigned size)
|
|
{
|
|
const u16 *p = addr;
|
|
unsigned i, n = size / 2; /* don't expect odd sized blocks */
|
|
u32 sum = 0;
|
|
|
|
for (i = 0; i < n; i++)
|
|
sum += p[i];
|
|
|
|
sum = (sum >> 16) + (sum & 0xffff);
|
|
sum += (sum >> 16);
|
|
sum = ~sum & 0xffff;
|
|
return (u16) sum;
|
|
}
|
|
|
|
/*
|
|
* Functions to map / unmap physical memory into virtual address space. These
|
|
* functions always maps 1MB at a time and can only map one area at once.
|
|
*/
|
|
static void *mapped_virtual;
|
|
static void *map_memory(u64 physical)
|
|
{
|
|
void *v;
|
|
off_t p;
|
|
int page = getpagesize();
|
|
|
|
/* Mapped memory must be aligned to page size */
|
|
p = physical & ~(page - 1);
|
|
|
|
debug("Mapping 1MB of physical memory at 0x%zx.\n", p);
|
|
|
|
v = mmap(NULL, MAP_BYTES, PROT_READ, MAP_SHARED, fd, p);
|
|
|
|
if (v == MAP_FAILED) {
|
|
fprintf(stderr, "Failed to mmap /dev/mem: %s\n",
|
|
strerror(errno));
|
|
exit(1);
|
|
}
|
|
|
|
/* Remember what we actually mapped ... */
|
|
mapped_virtual = v;
|
|
|
|
/* ... but return address to the physical memory that was requested */
|
|
v += physical & (page-1);
|
|
|
|
return v;
|
|
}
|
|
|
|
static void unmap_memory(void)
|
|
{
|
|
if (mapped_virtual == NULL) {
|
|
fprintf(stderr, "Error unmapping memory\n");
|
|
return;
|
|
}
|
|
debug("Unmapping 1MB of virtual memory at %p.\n", mapped_virtual);
|
|
munmap(mapped_virtual, MAP_BYTES);
|
|
mapped_virtual = NULL;
|
|
}
|
|
|
|
/*
|
|
* Try finding the timestamp table and coreboot cbmem console starting from the
|
|
* passed in memory offset. Could be called recursively in case a forwarding
|
|
* entry is found.
|
|
*
|
|
* Returns pointer to a memory buffer containg the timestamp table or zero if
|
|
* none found.
|
|
*/
|
|
|
|
static struct lb_cbmem_ref timestamps;
|
|
static struct lb_cbmem_ref console;
|
|
static struct lb_memory_range cbmem;
|
|
|
|
static int parse_cbtable(u64 address)
|
|
{
|
|
int i, found = 0;
|
|
void *buf;
|
|
|
|
debug("Looking for coreboot table at %lx\n", address);
|
|
buf = map_memory(address);
|
|
|
|
/* look at every 16 bytes within 4K of the base */
|
|
|
|
for (i = 0; i < 0x1000; i += 0x10) {
|
|
struct lb_header *lbh;
|
|
struct lb_record* lbr_p;
|
|
void *lbtable;
|
|
int j;
|
|
|
|
lbh = (struct lb_header *)(buf + i);
|
|
if (memcmp(lbh->signature, "LBIO", sizeof(lbh->signature)) ||
|
|
!lbh->header_bytes ||
|
|
ipchcksum(lbh, sizeof(*lbh))) {
|
|
continue;
|
|
}
|
|
lbtable = buf + i + lbh->header_bytes;
|
|
|
|
if (ipchcksum(lbtable, lbh->table_bytes) !=
|
|
lbh->table_checksum) {
|
|
debug("Signature found, but wrong checksum.\n");
|
|
continue;
|
|
}
|
|
|
|
found = 1;
|
|
debug("Found!\n");
|
|
|
|
for (j = 0; j < lbh->table_bytes; j += lbr_p->size) {
|
|
/* look for the timestamp table */
|
|
lbr_p = (struct lb_record*) ((char *)lbtable + j);
|
|
debug(" coreboot table entry 0x%02x\n", lbr_p->tag);
|
|
switch (lbr_p->tag) {
|
|
case LB_TAG_MEMORY: {
|
|
int i = 0;
|
|
debug(" Found memory map.\n");
|
|
struct lb_memory *memory =
|
|
(struct lb_memory *)lbr_p;
|
|
while ((char *)&memory->map[i] < ((char *)lbtable
|
|
+ lbr_p->size)) {
|
|
if (memory->map[i].type == LB_MEM_TABLE) {
|
|
debug(" LB_MEM_TABLE found.\n");
|
|
/* The last one found is CBMEM */
|
|
cbmem = memory->map[i];
|
|
}
|
|
i++;
|
|
}
|
|
continue;
|
|
}
|
|
case LB_TAG_TIMESTAMPS: {
|
|
debug(" Found timestamp table.\n");
|
|
timestamps = *(struct lb_cbmem_ref *) lbr_p;
|
|
continue;
|
|
}
|
|
case LB_TAG_CBMEM_CONSOLE: {
|
|
debug(" Found cbmem console.\n");
|
|
console = *(struct lb_cbmem_ref *) lbr_p;
|
|
continue;
|
|
}
|
|
case LB_TAG_FORWARD: {
|
|
/*
|
|
* This is a forwarding entry - repeat the
|
|
* search at the new address.
|
|
*/
|
|
struct lb_forward lbf_p =
|
|
*(struct lb_forward *) lbr_p;
|
|
debug(" Found forwarding entry.\n");
|
|
unmap_memory();
|
|
return parse_cbtable(lbf_p.forward);
|
|
}
|
|
default:
|
|
break;
|
|
}
|
|
|
|
}
|
|
}
|
|
unmap_memory();
|
|
|
|
return found;
|
|
}
|
|
|
|
/*
|
|
* read CPU frequency from a sysfs file, return an frequency in Kilohertz as
|
|
* an int or exit on any error.
|
|
*/
|
|
static u64 get_cpu_freq_KHz(void)
|
|
{
|
|
FILE *cpuf;
|
|
char freqs[100];
|
|
int size;
|
|
char *endp;
|
|
u64 rv;
|
|
|
|
const char* freq_file =
|
|
"/sys/devices/system/cpu/cpu0/cpufreq/cpuinfo_max_freq";
|
|
|
|
cpuf = fopen(freq_file, "r");
|
|
if (!cpuf) {
|
|
fprintf(stderr, "Could not open %s: %s\n",
|
|
freq_file, strerror(errno));
|
|
exit(1);
|
|
}
|
|
|
|
memset(freqs, 0, sizeof(freqs));
|
|
size = fread(freqs, 1, sizeof(freqs), cpuf);
|
|
if (!size || (size == sizeof(freqs))) {
|
|
fprintf(stderr, "Wrong number of bytes(%d) read from %s\n",
|
|
size, freq_file);
|
|
exit(1);
|
|
}
|
|
fclose(cpuf);
|
|
rv = strtoull(freqs, &endp, 10);
|
|
|
|
if (*endp == '\0' || *endp == '\n')
|
|
return rv;
|
|
fprintf(stderr, "Wrong formatted value ^%s^ read from %s\n",
|
|
freqs, freq_file);
|
|
exit(1);
|
|
}
|
|
|
|
/*
|
|
* Print an integer in 'normalized' form - with commas separating every three
|
|
* decimal orders. The 'comma' parameter indicates if a comma is needed after
|
|
* the value is printed.
|
|
*/
|
|
static void print_norm(u64 v, int comma)
|
|
{
|
|
int first_triple = 1;
|
|
|
|
if (v > 1000) {
|
|
/* print the higher order sections first */
|
|
print_norm(v / 1000, 1);
|
|
first_triple = 0;
|
|
}
|
|
if (first_triple)
|
|
printf("%d", (u32)(v % 1000));
|
|
else
|
|
printf("%3.3d", (u32)(v % 1000));
|
|
if (comma)
|
|
printf(",");
|
|
}
|
|
|
|
/* dump the timestamp table */
|
|
static void dump_timestamps(void)
|
|
{
|
|
int i;
|
|
u64 cpu_freq_MHz = get_cpu_freq_KHz() / 1000;
|
|
struct timestamp_table *tst_p;
|
|
|
|
if (timestamps.tag != LB_TAG_TIMESTAMPS) {
|
|
fprintf(stderr, "No timestamps found in coreboot table.\n");
|
|
return;
|
|
}
|
|
|
|
tst_p = (struct timestamp_table *)
|
|
map_memory((unsigned long)timestamps.cbmem_addr);
|
|
|
|
printf("%d entries total:\n\n", tst_p->num_entries);
|
|
for (i = 0; i < tst_p->num_entries; i++) {
|
|
const struct timestamp_entry *tse_p = tst_p->entries + i;
|
|
|
|
printf("%4d:", tse_p->entry_id);
|
|
print_norm(tse_p->entry_stamp / cpu_freq_MHz, 0);
|
|
if (i) {
|
|
printf(" (");
|
|
print_norm((tse_p->entry_stamp -
|
|
tse_p[-1].entry_stamp) /
|
|
cpu_freq_MHz, 0);
|
|
printf(")");
|
|
}
|
|
printf("\n");
|
|
}
|
|
|
|
unmap_memory();
|
|
}
|
|
|
|
/* dump the cbmem console */
|
|
static void dump_console(void)
|
|
{
|
|
void *console_p;
|
|
char *console_c;
|
|
uint32_t size;
|
|
|
|
if (console.tag != LB_TAG_CBMEM_CONSOLE) {
|
|
fprintf(stderr, "No console found in coreboot table.\n");
|
|
return;
|
|
}
|
|
|
|
console_p = map_memory((unsigned long)console.cbmem_addr);
|
|
/* The in-memory format of the console area is:
|
|
* u32 size
|
|
* u32 cursor
|
|
* char console[size]
|
|
* Hence we have to add 8 to get to the actual console string.
|
|
*/
|
|
size = *(uint32_t *)console_p;
|
|
console_c = malloc(size + 1);
|
|
if (!console_c) {
|
|
fprintf(stderr, "Not enough memory for console.\n");
|
|
exit(1);
|
|
}
|
|
|
|
memcpy(console_c, console_p + 8, size);
|
|
console_c[size] = 0;
|
|
|
|
printf("%s", console_c);
|
|
|
|
free(console_c);
|
|
|
|
unmap_memory();
|
|
}
|
|
|
|
#define CBMEM_MAGIC 0x434f5245
|
|
#define MAX_CBMEM_ENTRIES 16
|
|
|
|
struct cbmem_entry {
|
|
uint32_t magic;
|
|
uint32_t id;
|
|
uint64_t base;
|
|
uint64_t size;
|
|
};
|
|
|
|
static void dump_cbmem_toc(void)
|
|
{
|
|
int i;
|
|
uint64_t start;
|
|
struct cbmem_entry *entries;
|
|
|
|
if (cbmem.type != LB_MEM_TABLE) {
|
|
fprintf(stderr, "No coreboot table area found!\n");
|
|
return;
|
|
}
|
|
|
|
start = unpack_lb64(cbmem.start);
|
|
|
|
entries = (struct cbmem_entry *)map_memory(start);
|
|
|
|
printf("CBMEM table of contents:\n");
|
|
printf(" ID START LENGTH\n");
|
|
for (i=0; i<MAX_CBMEM_ENTRIES; i++) {
|
|
if (entries[i].magic != CBMEM_MAGIC)
|
|
break;
|
|
|
|
printf("%2d. ", i);
|
|
switch (entries[i].id) {
|
|
case CBMEM_ID_FREESPACE: printf("FREE SPACE "); break;
|
|
case CBMEM_ID_GDT: printf("GDT "); break;
|
|
case CBMEM_ID_ACPI: printf("ACPI "); break;
|
|
case CBMEM_ID_ACPI_GNVS: printf("ACPI GNVS "); break;
|
|
case CBMEM_ID_CBTABLE: printf("COREBOOT "); break;
|
|
case CBMEM_ID_PIRQ: printf("IRQ TABLE "); break;
|
|
case CBMEM_ID_MPTABLE: printf("SMP TABLE "); break;
|
|
case CBMEM_ID_RESUME: printf("ACPI RESUME "); break;
|
|
case CBMEM_ID_RESUME_SCRATCH: printf("ACPI SCRATCH"); break;
|
|
case CBMEM_ID_SMBIOS: printf("SMBIOS "); break;
|
|
case CBMEM_ID_TIMESTAMP: printf("TIME STAMP "); break;
|
|
case CBMEM_ID_MRCDATA: printf("MRC DATA "); break;
|
|
case CBMEM_ID_CONSOLE: printf("CONSOLE "); break;
|
|
case CBMEM_ID_ELOG: printf("ELOG "); break;
|
|
case CBMEM_ID_COVERAGE: printf("COVERAGE "); break;
|
|
default: printf("%08x ",
|
|
entries[i].id); break;
|
|
}
|
|
printf(" 0x%08jx 0x%08jx\n", (uintmax_t)entries[i].base,
|
|
(uintmax_t)entries[i].size);
|
|
}
|
|
unmap_memory();
|
|
}
|
|
|
|
#define COVERAGE_MAGIC 0x584d4153
|
|
struct file {
|
|
uint32_t magic;
|
|
uint32_t next;
|
|
uint32_t filename;
|
|
uint32_t data;
|
|
int offset;
|
|
int len;
|
|
};
|
|
|
|
static int mkpath(char *path, mode_t mode)
|
|
{
|
|
assert (path && *path);
|
|
char *p;
|
|
for (p = strchr(path+1, '/'); p; p = strchr(p + 1, '/')) {
|
|
*p = '\0';
|
|
if (mkdir(path, mode) == -1) {
|
|
if (errno != EEXIST) {
|
|
*p = '/';
|
|
return -1;
|
|
}
|
|
}
|
|
*p = '/';
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
static void dump_coverage(void)
|
|
{
|
|
int i, found = 0;
|
|
uint64_t start;
|
|
struct cbmem_entry *entries;
|
|
void *coverage;
|
|
unsigned long phys_offset;
|
|
#define phys_to_virt(x) ((void *)(unsigned long)(x) + phys_offset)
|
|
|
|
if (cbmem.type != LB_MEM_TABLE) {
|
|
fprintf(stderr, "No coreboot table area found!\n");
|
|
return;
|
|
}
|
|
|
|
start = unpack_lb64(cbmem.start);
|
|
|
|
entries = (struct cbmem_entry *)map_memory(start);
|
|
|
|
for (i=0; i<MAX_CBMEM_ENTRIES; i++) {
|
|
if (entries[i].magic != CBMEM_MAGIC)
|
|
break;
|
|
if (entries[i].id == CBMEM_ID_COVERAGE) {
|
|
found = 1;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (!found) {
|
|
unmap_memory();
|
|
fprintf(stderr, "No coverage information found in"
|
|
" CBMEM area.\n");
|
|
return;
|
|
}
|
|
|
|
start = entries[i].base;
|
|
unmap_memory();
|
|
/* Map coverage area */
|
|
coverage = map_memory(start);
|
|
phys_offset = (unsigned long)coverage - (unsigned long)start;
|
|
|
|
printf("Dumping coverage data...\n");
|
|
|
|
struct file *file = (struct file *)coverage;
|
|
while (file && file->magic == COVERAGE_MAGIC) {
|
|
FILE *f;
|
|
char *filename;
|
|
|
|
debug(" -> %s\n", (char *)phys_to_virt(file->filename));
|
|
filename = strdup((char *)phys_to_virt(file->filename));
|
|
if (mkpath(filename, 0755) == -1) {
|
|
perror("Directory for coverage data could "
|
|
"not be created");
|
|
exit(1);
|
|
}
|
|
f = fopen(filename, "wb");
|
|
if (!f) {
|
|
printf("Could not open %s: %s\n",
|
|
filename, strerror(errno));
|
|
exit(1);
|
|
}
|
|
if (fwrite((void *)phys_to_virt(file->data),
|
|
file->len, 1, f) != 1) {
|
|
printf("Could not write to %s: %s\n",
|
|
filename, strerror(errno));
|
|
exit(1);
|
|
}
|
|
fclose(f);
|
|
free(filename);
|
|
|
|
if (file->next)
|
|
file = (struct file *)phys_to_virt(file->next);
|
|
else
|
|
file = NULL;
|
|
}
|
|
unmap_memory();
|
|
}
|
|
|
|
static void print_version(void)
|
|
{
|
|
printf("cbmem v%s -- ", CBMEM_VERSION);
|
|
printf("Copyright (C) 2012 The ChromiumOS Authors. All rights reserved.\n\n");
|
|
printf(
|
|
"This program is free software: you can redistribute it and/or modify\n"
|
|
"it under the terms of the GNU General Public License as published by\n"
|
|
"the Free Software Foundation, version 2 of the License.\n\n"
|
|
"This program is distributed in the hope that it will be useful,\n"
|
|
"but WITHOUT ANY WARRANTY; without even the implied warranty of\n"
|
|
"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n"
|
|
"GNU General Public License for more details.\n\n"
|
|
"You should have received a copy of the GNU General Public License\n"
|
|
"along with this program. If not, see <http://www.gnu.org/licenses/>.\n\n");
|
|
}
|
|
|
|
static void print_usage(const char *name)
|
|
{
|
|
printf("usage: %s [-cCltVvh?]\n", name);
|
|
printf("\n"
|
|
" -c | --console: print cbmem console\n"
|
|
" -C | --coverage: dump coverage information\n"
|
|
" -l | --list: print cbmem table of contents\n"
|
|
" -t | --timestamps: print timestamp information\n"
|
|
" -V | --verbose: verbose (debugging) output\n"
|
|
" -v | --version: print the version\n"
|
|
" -h | --help: print this help\n"
|
|
"\n");
|
|
exit(1);
|
|
}
|
|
|
|
int main(int argc, char** argv)
|
|
{
|
|
int j;
|
|
static const int possible_base_addresses[] = { 0, 0xf0000 };
|
|
|
|
int print_defaults = 1;
|
|
int print_console = 0;
|
|
int print_coverage = 0;
|
|
int print_list = 0;
|
|
int print_timestamps = 0;
|
|
|
|
int opt, option_index = 0;
|
|
static struct option long_options[] = {
|
|
{"console", 0, 0, 'c'},
|
|
{"coverage", 0, 0, 'C'},
|
|
{"list", 0, 0, 'l'},
|
|
{"timestamps", 0, 0, 't'},
|
|
{"verbose", 0, 0, 'V'},
|
|
{"version", 0, 0, 'v'},
|
|
{"help", 0, 0, 'h'},
|
|
{0, 0, 0, 0}
|
|
};
|
|
while ((opt = getopt_long(argc, argv, "cCltVvh?",
|
|
long_options, &option_index)) != EOF) {
|
|
switch (opt) {
|
|
case 'c':
|
|
print_console = 1;
|
|
print_defaults = 0;
|
|
break;
|
|
case 'C':
|
|
print_coverage = 1;
|
|
print_defaults = 0;
|
|
break;
|
|
case 'l':
|
|
print_list = 1;
|
|
print_defaults = 0;
|
|
break;
|
|
case 't':
|
|
print_timestamps = 1;
|
|
print_defaults = 0;
|
|
break;
|
|
case 'V':
|
|
verbose = 1;
|
|
break;
|
|
case 'v':
|
|
print_version();
|
|
exit(0);
|
|
break;
|
|
case 'h':
|
|
case '?':
|
|
default:
|
|
print_usage(argv[0]);
|
|
exit(0);
|
|
break;
|
|
}
|
|
}
|
|
|
|
fd = open("/dev/mem", O_RDONLY, 0);
|
|
if (fd < 0) {
|
|
fprintf(stderr, "Failed to gain memory access: %s\n",
|
|
strerror(errno));
|
|
return 1;
|
|
}
|
|
|
|
/* Find and parse coreboot table */
|
|
for (j = 0; j < ARRAY_SIZE(possible_base_addresses); j++) {
|
|
if (parse_cbtable(possible_base_addresses[j]))
|
|
break;
|
|
}
|
|
|
|
if (print_console)
|
|
dump_console();
|
|
|
|
if (print_coverage)
|
|
dump_coverage();
|
|
|
|
if (print_list)
|
|
dump_cbmem_toc();
|
|
|
|
if (print_defaults || print_timestamps)
|
|
dump_timestamps();
|
|
|
|
close(fd);
|
|
return 0;
|
|
}
|