mirror of
https://github.com/torvalds/linux.git
synced 2024-11-12 07:01:57 +00:00
e49140120c
Wolfgang Walter reported this oops on his via C3 using padlock for AES-encryption: ################################################################## BUG: unable to handle kernel NULL pointer dereference at 000001f0 IP: [<c01028c5>] __switch_to+0x30/0x117 *pde = 00000000 Oops: 0002 [#1] PREEMPT Modules linked in: Pid: 2071, comm: sleep Not tainted (2.6.26 #11) EIP: 0060:[<c01028c5>] EFLAGS: 00010002 CPU: 0 EIP is at __switch_to+0x30/0x117 EAX: 00000000 EBX: c0493300 ECX: dc48dd00 EDX: c0493300 ESI: dc48dd00 EDI: c0493530 EBP: c04cff8c ESP: c04cff7c DS: 007b ES: 007b FS: 0000 GS: 0033 SS: 0068 Process sleep (pid: 2071, ti=c04ce000 task=dc48dd00 task.ti=d2fe6000) Stack: dc48df30 c0493300 00000000 00000000 d2fe7f44 c03b5b43 c04cffc8 00000046 c0131856 0000005a dc472d3c c0493300 c0493470 d983ae00 00002696 00000000 c0239f54 00000000 c04c4000 c04cffd8 c01025fe c04f3740 00049800 c04cffe0 Call Trace: [<c03b5b43>] ? schedule+0x285/0x2ff [<c0131856>] ? pm_qos_requirement+0x3c/0x53 [<c0239f54>] ? acpi_processor_idle+0x0/0x434 [<c01025fe>] ? cpu_idle+0x73/0x7f [<c03a4dcd>] ? rest_init+0x61/0x63 ======================= Wolfgang also found out that adding kernel_fpu_begin() and kernel_fpu_end() around the padlock instructions fix the oops. Suresh wrote: These padlock instructions though don't use/touch SSE registers, but it behaves similar to other SSE instructions. For example, it might cause DNA faults when cr0.ts is set. While this is a spurious DNA trap, it might cause oops with the recent fpu code changes. This is the code sequence that is probably causing this problem: a) new app is getting exec'd and it is somewhere in between start_thread() and flush_old_exec() in the load_xyz_binary() b) At pont "a", task's fpu state (like TS_USEDFPU, used_math() etc) is cleared. c) Now we get an interrupt/softirq which starts using these encrypt/decrypt routines in the network stack. This generates a math fault (as cr0.ts is '1') which sets TS_USEDFPU and restores the math that is in the task's xstate. d) Return to exec code path, which does start_thread() which does free_thread_xstate() and sets xstate pointer to NULL while the TS_USEDFPU is still set. e) At the next context switch from the new exec'd task to another task, we have a scenarios where TS_USEDFPU is set but xstate pointer is null. This can cause an oops during unlazy_fpu() in __switch_to() Now: 1) This should happen with or with out pre-emption. Viro also encountered similar problem with out CONFIG_PREEMPT. 2) kernel_fpu_begin() and kernel_fpu_end() will fix this problem, because kernel_fpu_begin() will manually do a clts() and won't run in to the situation of setting TS_USEDFPU in step "c" above. 3) This was working before the fpu changes, because its a spurious math fault which doesn't corrupt any fpu/sse registers and the task's math state was always in an allocated state. With out the recent lazy fpu allocation changes, while we don't see oops, there is a possible race still present in older kernels(for example, while kernel is using kernel_fpu_begin() in some optimized clear/copy page and an interrupt/softirq happens which uses these padlock instructions generating DNA fault). This is the failing scenario that existed even before the lazy fpu allocation changes: 0. CPU's TS flag is set 1. kernel using FPU in some optimized copy routine and while doing kernel_fpu_begin() takes an interrupt just before doing clts() 2. Takes an interrupt and ipsec uses padlock instruction. And we take a DNA fault as TS flag is still set. 3. We handle the DNA fault and set TS_USEDFPU and clear cr0.ts 4. We complete the padlock routine 5. Go back to step-1, which resumes clts() in kernel_fpu_begin(), finishes the optimized copy routine and does kernel_fpu_end(). At this point, we have cr0.ts again set to '1' but the task's TS_USEFPU is stilll set and not cleared. 6. Now kernel resumes its user operation. And at the next context switch, kernel sees it has do a FP save as TS_USEDFPU is still set and then will do a unlazy_fpu() in __switch_to(). unlazy_fpu() will take a DNA fault, as cr0.ts is '1' and now, because we are in __switch_to(), math_state_restore() will get confused and will restore the next task's FP state and will save it in prev tasks's FP state. Remember, in __switch_to() we are already on the stack of the next task but take a DNA fault for the prev task. This causes the fpu leakage. Fix the padlock instruction usage by calling them inside the context of new routines irq_ts_save/restore(), which clear/restore cr0.ts manually in the interrupt context. This will not generate spurious DNA in the context of the interrupt which will fix the oops encountered and the possible FPU leakage issue. Reported-and-bisected-by: Wolfgang Walter <wolfgang.walter@stwm.de> Signed-off-by: Suresh Siddha <suresh.b.siddha@intel.com> Signed-off-by: Herbert Xu <herbert@gondor.apana.org.au>
311 lines
7.8 KiB
C
311 lines
7.8 KiB
C
/*
|
|
* Cryptographic API.
|
|
*
|
|
* Support for VIA PadLock hardware crypto engine.
|
|
*
|
|
* Copyright (c) 2006 Michal Ludvig <michal@logix.cz>
|
|
*
|
|
* 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.
|
|
*
|
|
*/
|
|
|
|
#include <crypto/algapi.h>
|
|
#include <crypto/sha.h>
|
|
#include <linux/err.h>
|
|
#include <linux/module.h>
|
|
#include <linux/init.h>
|
|
#include <linux/errno.h>
|
|
#include <linux/cryptohash.h>
|
|
#include <linux/interrupt.h>
|
|
#include <linux/kernel.h>
|
|
#include <linux/scatterlist.h>
|
|
#include <asm/i387.h>
|
|
#include "padlock.h"
|
|
|
|
#define SHA1_DEFAULT_FALLBACK "sha1-generic"
|
|
#define SHA256_DEFAULT_FALLBACK "sha256-generic"
|
|
|
|
struct padlock_sha_ctx {
|
|
char *data;
|
|
size_t used;
|
|
int bypass;
|
|
void (*f_sha_padlock)(const char *in, char *out, int count);
|
|
struct hash_desc fallback;
|
|
};
|
|
|
|
static inline struct padlock_sha_ctx *ctx(struct crypto_tfm *tfm)
|
|
{
|
|
return crypto_tfm_ctx(tfm);
|
|
}
|
|
|
|
/* We'll need aligned address on the stack */
|
|
#define NEAREST_ALIGNED(ptr) \
|
|
((void *)ALIGN((size_t)(ptr), PADLOCK_ALIGNMENT))
|
|
|
|
static struct crypto_alg sha1_alg, sha256_alg;
|
|
|
|
static void padlock_sha_bypass(struct crypto_tfm *tfm)
|
|
{
|
|
if (ctx(tfm)->bypass)
|
|
return;
|
|
|
|
crypto_hash_init(&ctx(tfm)->fallback);
|
|
if (ctx(tfm)->data && ctx(tfm)->used) {
|
|
struct scatterlist sg;
|
|
|
|
sg_init_one(&sg, ctx(tfm)->data, ctx(tfm)->used);
|
|
crypto_hash_update(&ctx(tfm)->fallback, &sg, sg.length);
|
|
}
|
|
|
|
ctx(tfm)->used = 0;
|
|
ctx(tfm)->bypass = 1;
|
|
}
|
|
|
|
static void padlock_sha_init(struct crypto_tfm *tfm)
|
|
{
|
|
ctx(tfm)->used = 0;
|
|
ctx(tfm)->bypass = 0;
|
|
}
|
|
|
|
static void padlock_sha_update(struct crypto_tfm *tfm,
|
|
const uint8_t *data, unsigned int length)
|
|
{
|
|
/* Our buffer is always one page. */
|
|
if (unlikely(!ctx(tfm)->bypass &&
|
|
(ctx(tfm)->used + length > PAGE_SIZE)))
|
|
padlock_sha_bypass(tfm);
|
|
|
|
if (unlikely(ctx(tfm)->bypass)) {
|
|
struct scatterlist sg;
|
|
sg_init_one(&sg, (uint8_t *)data, length);
|
|
crypto_hash_update(&ctx(tfm)->fallback, &sg, length);
|
|
return;
|
|
}
|
|
|
|
memcpy(ctx(tfm)->data + ctx(tfm)->used, data, length);
|
|
ctx(tfm)->used += length;
|
|
}
|
|
|
|
static inline void padlock_output_block(uint32_t *src,
|
|
uint32_t *dst, size_t count)
|
|
{
|
|
while (count--)
|
|
*dst++ = swab32(*src++);
|
|
}
|
|
|
|
static void padlock_do_sha1(const char *in, char *out, int count)
|
|
{
|
|
/* We can't store directly to *out as it may be unaligned. */
|
|
/* BTW Don't reduce the buffer size below 128 Bytes!
|
|
* PadLock microcode needs it that big. */
|
|
char buf[128+16];
|
|
char *result = NEAREST_ALIGNED(buf);
|
|
int ts_state;
|
|
|
|
((uint32_t *)result)[0] = SHA1_H0;
|
|
((uint32_t *)result)[1] = SHA1_H1;
|
|
((uint32_t *)result)[2] = SHA1_H2;
|
|
((uint32_t *)result)[3] = SHA1_H3;
|
|
((uint32_t *)result)[4] = SHA1_H4;
|
|
|
|
/* prevent taking the spurious DNA fault with padlock. */
|
|
ts_state = irq_ts_save();
|
|
asm volatile (".byte 0xf3,0x0f,0xa6,0xc8" /* rep xsha1 */
|
|
: "+S"(in), "+D"(result)
|
|
: "c"(count), "a"(0));
|
|
irq_ts_restore(ts_state);
|
|
|
|
padlock_output_block((uint32_t *)result, (uint32_t *)out, 5);
|
|
}
|
|
|
|
static void padlock_do_sha256(const char *in, char *out, int count)
|
|
{
|
|
/* We can't store directly to *out as it may be unaligned. */
|
|
/* BTW Don't reduce the buffer size below 128 Bytes!
|
|
* PadLock microcode needs it that big. */
|
|
char buf[128+16];
|
|
char *result = NEAREST_ALIGNED(buf);
|
|
int ts_state;
|
|
|
|
((uint32_t *)result)[0] = SHA256_H0;
|
|
((uint32_t *)result)[1] = SHA256_H1;
|
|
((uint32_t *)result)[2] = SHA256_H2;
|
|
((uint32_t *)result)[3] = SHA256_H3;
|
|
((uint32_t *)result)[4] = SHA256_H4;
|
|
((uint32_t *)result)[5] = SHA256_H5;
|
|
((uint32_t *)result)[6] = SHA256_H6;
|
|
((uint32_t *)result)[7] = SHA256_H7;
|
|
|
|
/* prevent taking the spurious DNA fault with padlock. */
|
|
ts_state = irq_ts_save();
|
|
asm volatile (".byte 0xf3,0x0f,0xa6,0xd0" /* rep xsha256 */
|
|
: "+S"(in), "+D"(result)
|
|
: "c"(count), "a"(0));
|
|
irq_ts_restore(ts_state);
|
|
|
|
padlock_output_block((uint32_t *)result, (uint32_t *)out, 8);
|
|
}
|
|
|
|
static void padlock_sha_final(struct crypto_tfm *tfm, uint8_t *out)
|
|
{
|
|
if (unlikely(ctx(tfm)->bypass)) {
|
|
crypto_hash_final(&ctx(tfm)->fallback, out);
|
|
ctx(tfm)->bypass = 0;
|
|
return;
|
|
}
|
|
|
|
/* Pass the input buffer to PadLock microcode... */
|
|
ctx(tfm)->f_sha_padlock(ctx(tfm)->data, out, ctx(tfm)->used);
|
|
|
|
ctx(tfm)->used = 0;
|
|
}
|
|
|
|
static int padlock_cra_init(struct crypto_tfm *tfm)
|
|
{
|
|
const char *fallback_driver_name = tfm->__crt_alg->cra_name;
|
|
struct crypto_hash *fallback_tfm;
|
|
|
|
/* For now we'll allocate one page. This
|
|
* could eventually be configurable one day. */
|
|
ctx(tfm)->data = (char *)__get_free_page(GFP_KERNEL);
|
|
if (!ctx(tfm)->data)
|
|
return -ENOMEM;
|
|
|
|
/* Allocate a fallback and abort if it failed. */
|
|
fallback_tfm = crypto_alloc_hash(fallback_driver_name, 0,
|
|
CRYPTO_ALG_ASYNC |
|
|
CRYPTO_ALG_NEED_FALLBACK);
|
|
if (IS_ERR(fallback_tfm)) {
|
|
printk(KERN_WARNING PFX "Fallback driver '%s' could not be loaded!\n",
|
|
fallback_driver_name);
|
|
free_page((unsigned long)(ctx(tfm)->data));
|
|
return PTR_ERR(fallback_tfm);
|
|
}
|
|
|
|
ctx(tfm)->fallback.tfm = fallback_tfm;
|
|
return 0;
|
|
}
|
|
|
|
static int padlock_sha1_cra_init(struct crypto_tfm *tfm)
|
|
{
|
|
ctx(tfm)->f_sha_padlock = padlock_do_sha1;
|
|
|
|
return padlock_cra_init(tfm);
|
|
}
|
|
|
|
static int padlock_sha256_cra_init(struct crypto_tfm *tfm)
|
|
{
|
|
ctx(tfm)->f_sha_padlock = padlock_do_sha256;
|
|
|
|
return padlock_cra_init(tfm);
|
|
}
|
|
|
|
static void padlock_cra_exit(struct crypto_tfm *tfm)
|
|
{
|
|
if (ctx(tfm)->data) {
|
|
free_page((unsigned long)(ctx(tfm)->data));
|
|
ctx(tfm)->data = NULL;
|
|
}
|
|
|
|
crypto_free_hash(ctx(tfm)->fallback.tfm);
|
|
ctx(tfm)->fallback.tfm = NULL;
|
|
}
|
|
|
|
static struct crypto_alg sha1_alg = {
|
|
.cra_name = "sha1",
|
|
.cra_driver_name = "sha1-padlock",
|
|
.cra_priority = PADLOCK_CRA_PRIORITY,
|
|
.cra_flags = CRYPTO_ALG_TYPE_DIGEST |
|
|
CRYPTO_ALG_NEED_FALLBACK,
|
|
.cra_blocksize = SHA1_BLOCK_SIZE,
|
|
.cra_ctxsize = sizeof(struct padlock_sha_ctx),
|
|
.cra_module = THIS_MODULE,
|
|
.cra_list = LIST_HEAD_INIT(sha1_alg.cra_list),
|
|
.cra_init = padlock_sha1_cra_init,
|
|
.cra_exit = padlock_cra_exit,
|
|
.cra_u = {
|
|
.digest = {
|
|
.dia_digestsize = SHA1_DIGEST_SIZE,
|
|
.dia_init = padlock_sha_init,
|
|
.dia_update = padlock_sha_update,
|
|
.dia_final = padlock_sha_final,
|
|
}
|
|
}
|
|
};
|
|
|
|
static struct crypto_alg sha256_alg = {
|
|
.cra_name = "sha256",
|
|
.cra_driver_name = "sha256-padlock",
|
|
.cra_priority = PADLOCK_CRA_PRIORITY,
|
|
.cra_flags = CRYPTO_ALG_TYPE_DIGEST |
|
|
CRYPTO_ALG_NEED_FALLBACK,
|
|
.cra_blocksize = SHA256_BLOCK_SIZE,
|
|
.cra_ctxsize = sizeof(struct padlock_sha_ctx),
|
|
.cra_module = THIS_MODULE,
|
|
.cra_list = LIST_HEAD_INIT(sha256_alg.cra_list),
|
|
.cra_init = padlock_sha256_cra_init,
|
|
.cra_exit = padlock_cra_exit,
|
|
.cra_u = {
|
|
.digest = {
|
|
.dia_digestsize = SHA256_DIGEST_SIZE,
|
|
.dia_init = padlock_sha_init,
|
|
.dia_update = padlock_sha_update,
|
|
.dia_final = padlock_sha_final,
|
|
}
|
|
}
|
|
};
|
|
|
|
static int __init padlock_init(void)
|
|
{
|
|
int rc = -ENODEV;
|
|
|
|
if (!cpu_has_phe) {
|
|
printk(KERN_NOTICE PFX "VIA PadLock Hash Engine not detected.\n");
|
|
return -ENODEV;
|
|
}
|
|
|
|
if (!cpu_has_phe_enabled) {
|
|
printk(KERN_NOTICE PFX "VIA PadLock detected, but not enabled. Hmm, strange...\n");
|
|
return -ENODEV;
|
|
}
|
|
|
|
rc = crypto_register_alg(&sha1_alg);
|
|
if (rc)
|
|
goto out;
|
|
|
|
rc = crypto_register_alg(&sha256_alg);
|
|
if (rc)
|
|
goto out_unreg1;
|
|
|
|
printk(KERN_NOTICE PFX "Using VIA PadLock ACE for SHA1/SHA256 algorithms.\n");
|
|
|
|
return 0;
|
|
|
|
out_unreg1:
|
|
crypto_unregister_alg(&sha1_alg);
|
|
out:
|
|
printk(KERN_ERR PFX "VIA PadLock SHA1/SHA256 initialization failed.\n");
|
|
return rc;
|
|
}
|
|
|
|
static void __exit padlock_fini(void)
|
|
{
|
|
crypto_unregister_alg(&sha1_alg);
|
|
crypto_unregister_alg(&sha256_alg);
|
|
}
|
|
|
|
module_init(padlock_init);
|
|
module_exit(padlock_fini);
|
|
|
|
MODULE_DESCRIPTION("VIA PadLock SHA1/SHA256 algorithms support.");
|
|
MODULE_LICENSE("GPL");
|
|
MODULE_AUTHOR("Michal Ludvig");
|
|
|
|
MODULE_ALIAS("sha1");
|
|
MODULE_ALIAS("sha256");
|
|
MODULE_ALIAS("sha1-padlock");
|
|
MODULE_ALIAS("sha256-padlock");
|