2019-05-27 08:55:21 +02:00
|
|
|
// SPDX-License-Identifier: GPL-2.0-only
|
2010-08-12 11:55:17 +08:00
|
|
|
/*
|
|
|
|
* APEI Error Record Serialization Table debug support
|
|
|
|
*
|
|
|
|
* ERST is a way provided by APEI to save and retrieve hardware error
|
2010-09-07 12:49:45 -04:00
|
|
|
* information to and from a persistent store. This file provide the
|
2010-08-12 11:55:17 +08:00
|
|
|
* debugging/testing support for ERST kernel support and firmware
|
|
|
|
* implementation.
|
|
|
|
*
|
|
|
|
* Copyright 2010 Intel Corp.
|
|
|
|
* Author: Huang Ying <ying.huang@intel.com>
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/uaccess.h>
|
|
|
|
#include <acpi/apei.h>
|
|
|
|
#include <linux/miscdevice.h>
|
|
|
|
|
|
|
|
#include "apei-internal.h"
|
|
|
|
|
|
|
|
#define ERST_DBG_PFX "ERST DBG: "
|
|
|
|
|
2011-07-13 13:14:14 +08:00
|
|
|
#define ERST_DBG_RECORD_LEN_MAX 0x4000
|
2010-08-12 11:55:17 +08:00
|
|
|
|
|
|
|
static void *erst_dbg_buf;
|
|
|
|
static unsigned int erst_dbg_buf_len;
|
|
|
|
|
|
|
|
/* Prevent erst_dbg_read/write from being invoked concurrently */
|
|
|
|
static DEFINE_MUTEX(erst_dbg_mutex);
|
|
|
|
|
|
|
|
static int erst_dbg_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
ACPI, APEI, Add ERST record ID cache
APEI ERST firmware interface and implementation has no multiple users
in mind. For example, if there is four records in storage with ID: 1,
2, 3 and 4, if two ERST readers enumerate the records via
GET_NEXT_RECORD_ID as follow,
reader 1 reader 2
1
2
3
4
-1
-1
where -1 signals there is no more record ID.
Reader 1 has no chance to check record 2 and 4, while reader 2 has no
chance to check record 1 and 3. And any other GET_NEXT_RECORD_ID will
return -1, that is, other readers will has no chance to check any
record even they are not cleared by anyone.
This makes raw GET_NEXT_RECORD_ID not suitable for used by multiple
users.
To solve the issue, an in-memory ERST record ID cache is designed and
implemented. When enumerating record ID, the ID returned by
GET_NEXT_RECORD_ID is added into cache in addition to be returned to
caller. So other readers can check the cache to get all record ID
available.
Signed-off-by: Huang Ying <ying.huang@intel.com>
Reviewed-by: Andi Kleen <ak@linux.intel.com>
Signed-off-by: Len Brown <len.brown@intel.com>
2011-02-21 13:54:41 +08:00
|
|
|
int rc, *pos;
|
|
|
|
|
2010-08-12 11:55:17 +08:00
|
|
|
if (erst_disable)
|
|
|
|
return -ENODEV;
|
|
|
|
|
ACPI, APEI, Add ERST record ID cache
APEI ERST firmware interface and implementation has no multiple users
in mind. For example, if there is four records in storage with ID: 1,
2, 3 and 4, if two ERST readers enumerate the records via
GET_NEXT_RECORD_ID as follow,
reader 1 reader 2
1
2
3
4
-1
-1
where -1 signals there is no more record ID.
Reader 1 has no chance to check record 2 and 4, while reader 2 has no
chance to check record 1 and 3. And any other GET_NEXT_RECORD_ID will
return -1, that is, other readers will has no chance to check any
record even they are not cleared by anyone.
This makes raw GET_NEXT_RECORD_ID not suitable for used by multiple
users.
To solve the issue, an in-memory ERST record ID cache is designed and
implemented. When enumerating record ID, the ID returned by
GET_NEXT_RECORD_ID is added into cache in addition to be returned to
caller. So other readers can check the cache to get all record ID
available.
Signed-off-by: Huang Ying <ying.huang@intel.com>
Reviewed-by: Andi Kleen <ak@linux.intel.com>
Signed-off-by: Len Brown <len.brown@intel.com>
2011-02-21 13:54:41 +08:00
|
|
|
pos = (int *)&file->private_data;
|
|
|
|
|
|
|
|
rc = erst_get_record_id_begin(pos);
|
|
|
|
if (rc)
|
|
|
|
return rc;
|
|
|
|
|
2010-08-12 11:55:17 +08:00
|
|
|
return nonseekable_open(inode, file);
|
|
|
|
}
|
|
|
|
|
ACPI, APEI, Add ERST record ID cache
APEI ERST firmware interface and implementation has no multiple users
in mind. For example, if there is four records in storage with ID: 1,
2, 3 and 4, if two ERST readers enumerate the records via
GET_NEXT_RECORD_ID as follow,
reader 1 reader 2
1
2
3
4
-1
-1
where -1 signals there is no more record ID.
Reader 1 has no chance to check record 2 and 4, while reader 2 has no
chance to check record 1 and 3. And any other GET_NEXT_RECORD_ID will
return -1, that is, other readers will has no chance to check any
record even they are not cleared by anyone.
This makes raw GET_NEXT_RECORD_ID not suitable for used by multiple
users.
To solve the issue, an in-memory ERST record ID cache is designed and
implemented. When enumerating record ID, the ID returned by
GET_NEXT_RECORD_ID is added into cache in addition to be returned to
caller. So other readers can check the cache to get all record ID
available.
Signed-off-by: Huang Ying <ying.huang@intel.com>
Reviewed-by: Andi Kleen <ak@linux.intel.com>
Signed-off-by: Len Brown <len.brown@intel.com>
2011-02-21 13:54:41 +08:00
|
|
|
static int erst_dbg_release(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
erst_get_record_id_end();
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2010-08-12 11:55:17 +08:00
|
|
|
static long erst_dbg_ioctl(struct file *f, unsigned int cmd, unsigned long arg)
|
|
|
|
{
|
|
|
|
int rc;
|
|
|
|
u64 record_id;
|
|
|
|
u32 record_count;
|
|
|
|
|
|
|
|
switch (cmd) {
|
|
|
|
case APEI_ERST_CLEAR_RECORD:
|
|
|
|
rc = copy_from_user(&record_id, (void __user *)arg,
|
|
|
|
sizeof(record_id));
|
|
|
|
if (rc)
|
|
|
|
return -EFAULT;
|
|
|
|
return erst_clear(record_id);
|
|
|
|
case APEI_ERST_GET_RECORD_COUNT:
|
|
|
|
rc = erst_get_record_count();
|
|
|
|
if (rc < 0)
|
|
|
|
return rc;
|
|
|
|
record_count = rc;
|
|
|
|
rc = put_user(record_count, (u32 __user *)arg);
|
|
|
|
if (rc)
|
|
|
|
return rc;
|
|
|
|
return 0;
|
|
|
|
default:
|
|
|
|
return -ENOTTY;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static ssize_t erst_dbg_read(struct file *filp, char __user *ubuf,
|
|
|
|
size_t usize, loff_t *off)
|
|
|
|
{
|
ACPI, APEI, Add ERST record ID cache
APEI ERST firmware interface and implementation has no multiple users
in mind. For example, if there is four records in storage with ID: 1,
2, 3 and 4, if two ERST readers enumerate the records via
GET_NEXT_RECORD_ID as follow,
reader 1 reader 2
1
2
3
4
-1
-1
where -1 signals there is no more record ID.
Reader 1 has no chance to check record 2 and 4, while reader 2 has no
chance to check record 1 and 3. And any other GET_NEXT_RECORD_ID will
return -1, that is, other readers will has no chance to check any
record even they are not cleared by anyone.
This makes raw GET_NEXT_RECORD_ID not suitable for used by multiple
users.
To solve the issue, an in-memory ERST record ID cache is designed and
implemented. When enumerating record ID, the ID returned by
GET_NEXT_RECORD_ID is added into cache in addition to be returned to
caller. So other readers can check the cache to get all record ID
available.
Signed-off-by: Huang Ying <ying.huang@intel.com>
Reviewed-by: Andi Kleen <ak@linux.intel.com>
Signed-off-by: Len Brown <len.brown@intel.com>
2011-02-21 13:54:41 +08:00
|
|
|
int rc, *pos;
|
2010-08-12 11:55:17 +08:00
|
|
|
ssize_t len = 0;
|
|
|
|
u64 id;
|
|
|
|
|
ACPI, APEI, Add ERST record ID cache
APEI ERST firmware interface and implementation has no multiple users
in mind. For example, if there is four records in storage with ID: 1,
2, 3 and 4, if two ERST readers enumerate the records via
GET_NEXT_RECORD_ID as follow,
reader 1 reader 2
1
2
3
4
-1
-1
where -1 signals there is no more record ID.
Reader 1 has no chance to check record 2 and 4, while reader 2 has no
chance to check record 1 and 3. And any other GET_NEXT_RECORD_ID will
return -1, that is, other readers will has no chance to check any
record even they are not cleared by anyone.
This makes raw GET_NEXT_RECORD_ID not suitable for used by multiple
users.
To solve the issue, an in-memory ERST record ID cache is designed and
implemented. When enumerating record ID, the ID returned by
GET_NEXT_RECORD_ID is added into cache in addition to be returned to
caller. So other readers can check the cache to get all record ID
available.
Signed-off-by: Huang Ying <ying.huang@intel.com>
Reviewed-by: Andi Kleen <ak@linux.intel.com>
Signed-off-by: Len Brown <len.brown@intel.com>
2011-02-21 13:54:41 +08:00
|
|
|
if (*off)
|
2010-08-12 11:55:17 +08:00
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
if (mutex_lock_interruptible(&erst_dbg_mutex) != 0)
|
|
|
|
return -EINTR;
|
|
|
|
|
ACPI, APEI, Add ERST record ID cache
APEI ERST firmware interface and implementation has no multiple users
in mind. For example, if there is four records in storage with ID: 1,
2, 3 and 4, if two ERST readers enumerate the records via
GET_NEXT_RECORD_ID as follow,
reader 1 reader 2
1
2
3
4
-1
-1
where -1 signals there is no more record ID.
Reader 1 has no chance to check record 2 and 4, while reader 2 has no
chance to check record 1 and 3. And any other GET_NEXT_RECORD_ID will
return -1, that is, other readers will has no chance to check any
record even they are not cleared by anyone.
This makes raw GET_NEXT_RECORD_ID not suitable for used by multiple
users.
To solve the issue, an in-memory ERST record ID cache is designed and
implemented. When enumerating record ID, the ID returned by
GET_NEXT_RECORD_ID is added into cache in addition to be returned to
caller. So other readers can check the cache to get all record ID
available.
Signed-off-by: Huang Ying <ying.huang@intel.com>
Reviewed-by: Andi Kleen <ak@linux.intel.com>
Signed-off-by: Len Brown <len.brown@intel.com>
2011-02-21 13:54:41 +08:00
|
|
|
pos = (int *)&filp->private_data;
|
|
|
|
|
2010-08-12 11:55:17 +08:00
|
|
|
retry_next:
|
ACPI, APEI, Add ERST record ID cache
APEI ERST firmware interface and implementation has no multiple users
in mind. For example, if there is four records in storage with ID: 1,
2, 3 and 4, if two ERST readers enumerate the records via
GET_NEXT_RECORD_ID as follow,
reader 1 reader 2
1
2
3
4
-1
-1
where -1 signals there is no more record ID.
Reader 1 has no chance to check record 2 and 4, while reader 2 has no
chance to check record 1 and 3. And any other GET_NEXT_RECORD_ID will
return -1, that is, other readers will has no chance to check any
record even they are not cleared by anyone.
This makes raw GET_NEXT_RECORD_ID not suitable for used by multiple
users.
To solve the issue, an in-memory ERST record ID cache is designed and
implemented. When enumerating record ID, the ID returned by
GET_NEXT_RECORD_ID is added into cache in addition to be returned to
caller. So other readers can check the cache to get all record ID
available.
Signed-off-by: Huang Ying <ying.huang@intel.com>
Reviewed-by: Andi Kleen <ak@linux.intel.com>
Signed-off-by: Len Brown <len.brown@intel.com>
2011-02-21 13:54:41 +08:00
|
|
|
rc = erst_get_record_id_next(pos, &id);
|
2010-08-12 11:55:17 +08:00
|
|
|
if (rc)
|
|
|
|
goto out;
|
|
|
|
/* no more record */
|
2012-12-15 00:30:07 +01:00
|
|
|
if (id == APEI_ERST_INVALID_RECORD_ID) {
|
|
|
|
/*
|
|
|
|
* If the persistent store is empty initially, the function
|
|
|
|
* 'erst_read' below will return "-ENOENT" value. This causes
|
|
|
|
* 'retry_next' label is entered again. The returned value
|
|
|
|
* should be zero indicating the read operation is EOF.
|
|
|
|
*/
|
|
|
|
len = 0;
|
|
|
|
|
2010-08-12 11:55:17 +08:00
|
|
|
goto out;
|
2012-12-15 00:30:07 +01:00
|
|
|
}
|
2010-08-12 11:55:17 +08:00
|
|
|
retry:
|
2022-04-12 11:05:19 +08:00
|
|
|
rc = len = erst_read_record(id, erst_dbg_buf, erst_dbg_buf_len,
|
|
|
|
erst_dbg_buf_len, NULL);
|
2010-08-12 11:55:17 +08:00
|
|
|
/* The record may be cleared by others, try read next record */
|
|
|
|
if (rc == -ENOENT)
|
|
|
|
goto retry_next;
|
|
|
|
if (rc < 0)
|
|
|
|
goto out;
|
|
|
|
if (len > ERST_DBG_RECORD_LEN_MAX) {
|
2019-10-18 11:18:25 +08:00
|
|
|
pr_warn(ERST_DBG_PFX
|
|
|
|
"Record (ID: 0x%llx) length is too long: %zd\n", id, len);
|
2010-08-12 11:55:17 +08:00
|
|
|
rc = -EIO;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
if (len > erst_dbg_buf_len) {
|
2010-09-29 19:53:54 +08:00
|
|
|
void *p;
|
2010-08-12 11:55:17 +08:00
|
|
|
rc = -ENOMEM;
|
2010-09-29 19:53:54 +08:00
|
|
|
p = kmalloc(len, GFP_KERNEL);
|
|
|
|
if (!p)
|
2010-08-12 11:55:17 +08:00
|
|
|
goto out;
|
2010-09-29 19:53:54 +08:00
|
|
|
kfree(erst_dbg_buf);
|
|
|
|
erst_dbg_buf = p;
|
2010-08-12 11:55:17 +08:00
|
|
|
erst_dbg_buf_len = len;
|
|
|
|
goto retry;
|
|
|
|
}
|
|
|
|
|
|
|
|
rc = -EINVAL;
|
|
|
|
if (len > usize)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
rc = -EFAULT;
|
|
|
|
if (copy_to_user(ubuf, erst_dbg_buf, len))
|
|
|
|
goto out;
|
|
|
|
rc = 0;
|
|
|
|
out:
|
|
|
|
mutex_unlock(&erst_dbg_mutex);
|
|
|
|
return rc ? rc : len;
|
|
|
|
}
|
|
|
|
|
|
|
|
static ssize_t erst_dbg_write(struct file *filp, const char __user *ubuf,
|
|
|
|
size_t usize, loff_t *off)
|
|
|
|
{
|
|
|
|
int rc;
|
|
|
|
struct cper_record_header *rcd;
|
|
|
|
|
|
|
|
if (!capable(CAP_SYS_ADMIN))
|
|
|
|
return -EPERM;
|
|
|
|
|
|
|
|
if (usize > ERST_DBG_RECORD_LEN_MAX) {
|
|
|
|
pr_err(ERST_DBG_PFX "Too long record to be written\n");
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (mutex_lock_interruptible(&erst_dbg_mutex))
|
|
|
|
return -EINTR;
|
|
|
|
if (usize > erst_dbg_buf_len) {
|
2010-09-29 19:53:54 +08:00
|
|
|
void *p;
|
2010-08-12 11:55:17 +08:00
|
|
|
rc = -ENOMEM;
|
2010-09-29 19:53:54 +08:00
|
|
|
p = kmalloc(usize, GFP_KERNEL);
|
|
|
|
if (!p)
|
2010-08-12 11:55:17 +08:00
|
|
|
goto out;
|
2010-09-29 19:53:54 +08:00
|
|
|
kfree(erst_dbg_buf);
|
|
|
|
erst_dbg_buf = p;
|
2010-08-12 11:55:17 +08:00
|
|
|
erst_dbg_buf_len = usize;
|
|
|
|
}
|
|
|
|
rc = copy_from_user(erst_dbg_buf, ubuf, usize);
|
|
|
|
if (rc) {
|
|
|
|
rc = -EFAULT;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
rcd = erst_dbg_buf;
|
|
|
|
rc = -EINVAL;
|
|
|
|
if (rcd->record_length != usize)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
rc = erst_write(erst_dbg_buf);
|
|
|
|
|
|
|
|
out:
|
|
|
|
mutex_unlock(&erst_dbg_mutex);
|
|
|
|
return rc < 0 ? rc : usize;
|
|
|
|
}
|
|
|
|
|
|
|
|
static const struct file_operations erst_dbg_ops = {
|
|
|
|
.owner = THIS_MODULE,
|
|
|
|
.open = erst_dbg_open,
|
ACPI, APEI, Add ERST record ID cache
APEI ERST firmware interface and implementation has no multiple users
in mind. For example, if there is four records in storage with ID: 1,
2, 3 and 4, if two ERST readers enumerate the records via
GET_NEXT_RECORD_ID as follow,
reader 1 reader 2
1
2
3
4
-1
-1
where -1 signals there is no more record ID.
Reader 1 has no chance to check record 2 and 4, while reader 2 has no
chance to check record 1 and 3. And any other GET_NEXT_RECORD_ID will
return -1, that is, other readers will has no chance to check any
record even they are not cleared by anyone.
This makes raw GET_NEXT_RECORD_ID not suitable for used by multiple
users.
To solve the issue, an in-memory ERST record ID cache is designed and
implemented. When enumerating record ID, the ID returned by
GET_NEXT_RECORD_ID is added into cache in addition to be returned to
caller. So other readers can check the cache to get all record ID
available.
Signed-off-by: Huang Ying <ying.huang@intel.com>
Reviewed-by: Andi Kleen <ak@linux.intel.com>
Signed-off-by: Len Brown <len.brown@intel.com>
2011-02-21 13:54:41 +08:00
|
|
|
.release = erst_dbg_release,
|
2010-08-12 11:55:17 +08:00
|
|
|
.read = erst_dbg_read,
|
|
|
|
.write = erst_dbg_write,
|
|
|
|
.unlocked_ioctl = erst_dbg_ioctl,
|
|
|
|
};
|
|
|
|
|
|
|
|
static struct miscdevice erst_dbg_dev = {
|
|
|
|
.minor = MISC_DYNAMIC_MINOR,
|
|
|
|
.name = "erst_dbg",
|
|
|
|
.fops = &erst_dbg_ops,
|
|
|
|
};
|
|
|
|
|
|
|
|
static __init int erst_dbg_init(void)
|
|
|
|
{
|
2011-07-13 13:14:13 +08:00
|
|
|
if (erst_disable) {
|
|
|
|
pr_info(ERST_DBG_PFX "ERST support is disabled.\n");
|
|
|
|
return -ENODEV;
|
|
|
|
}
|
2010-08-12 11:55:17 +08:00
|
|
|
return misc_register(&erst_dbg_dev);
|
|
|
|
}
|
|
|
|
|
|
|
|
static __exit void erst_dbg_exit(void)
|
|
|
|
{
|
|
|
|
misc_deregister(&erst_dbg_dev);
|
|
|
|
kfree(erst_dbg_buf);
|
|
|
|
}
|
|
|
|
|
|
|
|
module_init(erst_dbg_init);
|
|
|
|
module_exit(erst_dbg_exit);
|
|
|
|
|
|
|
|
MODULE_AUTHOR("Huang Ying");
|
|
|
|
MODULE_DESCRIPTION("APEI Error Record Serialization Table debug support");
|
|
|
|
MODULE_LICENSE("GPL");
|