forked from Minki/linux
011d826111
Introduce a simple data structure for collecting correctable errors along with accessors. More detailed description in the code itself. The error decoding is done with the decoding chain now and mce_first_notifier() gets to see the error first and the CEC decides whether to log it and then the rest of the chain doesn't hear about it - basically the main reason for the CE collector - or to continue running the notifiers. When the CEC hits the action threshold, it will try to soft-offine the page containing the ECC and then the whole decoding chain gets to see the error. Signed-off-by: Borislav Petkov <bp@suse.de> Cc: Linus Torvalds <torvalds@linux-foundation.org> Cc: Peter Zijlstra <peterz@infradead.org> Cc: Thomas Gleixner <tglx@linutronix.de> Cc: linux-edac <linux-edac@vger.kernel.org> Link: http://lkml.kernel.org/r/20170327093304.10683-5-bp@alien8.de Signed-off-by: Ingo Molnar <mingo@kernel.org>
9 lines
152 B
C
9 lines
152 B
C
#ifndef __RAS_DEBUGFS_H__
|
|
#define __RAS_DEBUGFS_H__
|
|
|
|
#include <linux/debugfs.h>
|
|
|
|
extern struct dentry *ras_debugfs_dir;
|
|
|
|
#endif /* __RAS_DEBUGFS_H__ */
|