But since memory corruptions 36 * are rare we hope to get away with this. For example the operation to map back 34 * from RMAP chains to processes has to walk the complete process list and 35 * has non linear complexity with the number. 31 * 32 * There are several operations here with exponential complexity because 33 * of unsuitable VM data structures. 27 * - You have a test that can be added to mce-test 28 * 29 * - The case actually shows up as a frequent (top 10) page state in 30 * tools/vm/page-types when running a real workload. #Lxfree export a group how to#25 * In general any code for handling new cases should only be added iff: 26 * - You know how to test it. 23 * 24 * It can be very tempting to add handling for obscure cases here. Generally it tries to use 21 * normal locking rules, as in get the standard locks, even if that means 22 * the error handling takes potentially a long time. This is why 20 * this code has to be extremely careful. This could violate some of their assumptions. The tricky part 17 * here is that we can access any page asynchronously in respect to 18 * other VM users, because memory failures could happen anytime and 19 * anywhere. 15 * 16 * Handles page cache pages in various states. 12 * 13 * In addition there is a "soft offline" entry point that allows stop using 14 * not-yet-corrupted-by-suspicious pages without killing anything. Handles pages reported by the 10 * hardware as being corrupted usually due to a multi-bit ECC memory or cache 11 * failure. 8 * 9 * High level machine check handler. #Lxfree export a group software#~ ~ ~ ~ ~ ~ ~ ~ฤก /* 2 * Copyright (C) 2008, 2009 Intel Corporation 3 * Authors: Andi Kleen, Fengguang Wu 4 * 5 * This software may be redistributed and/or modified under the terms of 6 * the GNU General Public License ("GPL") version 2 only as published by the 7 * Free Software Foundation.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |