mirror of
https://github.com/Motorhead1991/qemu.git
synced 2025-08-04 00:03:54 -06:00
d61cc5b6a8
Use simple heuristics to determine the cost of scanning any given chunk, assuming cost is equal across the whole device, without differentiating between volatile or persistent partitions. This is aligned to the fact that these constraints are not enforced in respective poison query commands. Signed-off-by: Davidlohr Bueso <dave@stgolabs.net> Link: https://lore.kernel.org/r/20230908073152.4386-3-dave@stgolabs.net Signed-off-by: Jonathan Cameron <Jonathan.Cameron@huawei.com> Message-Id: <20240705120643.959422-2-Jonathan.Cameron@huawei.com> Reviewed-by: Michael S. Tsirkin <mst@redhat.com> Signed-off-by: Michael S. Tsirkin <mst@redhat.com> |
||
|---|---|---|
| .. | ||
| cxl_type3.c | ||
| cxl_type3_stubs.c | ||
| Kconfig | ||
| memory-device-stubs.c | ||
| memory-device.c | ||
| meson.build | ||
| npcm7xx_mc.c | ||
| nvdimm.c | ||
| pc-dimm.c | ||
| sparse-mem.c | ||
| trace-events | ||
| trace.h | ||