summaryrefslogtreecommitdiffstats
path: root/arch/x86/purgatory/purgatory.c
blob: b6d5c8946e664aad672d15c3058e214c8192b8c6 (plain)
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
/*
 * purgatory: Runs between two kernels
 *
 * Copyright (C) 2014 Red Hat Inc.
 *
 * Author:
 *       Vivek Goyal <vgoyal@redhat.com>
 *
 * This source code is licensed under the GNU General Public License,
 * Version 2.  See the file COPYING for more details.
 */

#include "sha256.h"
#include "purgatory.h"
#include "../boot/string.h"

struct sha_region {
	unsigned long start;
	unsigned long len;
};

static unsigned long backup_dest;
static unsigned long backup_src;
static unsigned long backup_sz;

static u8 sha256_digest[SHA256_DIGEST_SIZE] = { 0 };

struct sha_region sha_regions[16] = {};

/*
 * On x86, second kernel requries first 640K of memory to boot. Copy
 * first 640K to a backup region in reserved memory range so that second
 * kernel can use first 640K.
 */
static int copy_backup_region(void)
{
	if (backup_dest)
		memcpy((void *)backup_dest, (void *)backup_src, backup_sz);

	return 0;
}

static int verify_sha256_digest(void)
{
	struct sha_region *ptr, *end;
	u8 digest[SHA256_DIGEST_SIZE];
	struct sha256_state sctx;

	sha256_init(&sctx);
	end = &sha_regions[sizeof(sha_regions)/sizeof(sha_regions[0])];
	for (ptr = sha_regions; ptr < end; ptr++)
		sha256_update(&sctx, (uint8_t *)(ptr->start), ptr->len);

	sha256_final(&sctx, digest);

	if (memcmp(digest, sha256_digest, sizeof(digest)))
		return 1;

	return 0;
}

void purgatory(void)
{
	int ret;

	ret = verify_sha256_digest();
	if (ret) {
		/* loop forever */
		for (;;)
			;
	}
	copy_backup_region();
}