2019-05-29 14:18:09 +00:00
|
|
|
// SPDX-License-Identifier: GPL-2.0-only
|
2015-05-31 19:02:11 +00:00
|
|
|
/*
|
|
|
|
|
* Copyright(c) 2013-2015 Intel Corporation. All rights reserved.
|
|
|
|
|
*/
|
nd_btt: atomic sector updates
BTT stands for Block Translation Table, and is a way to provide power
fail sector atomicity semantics for block devices that have the ability
to perform byte granularity IO. It relies on the capability of libnvdimm
namespace devices to do byte aligned IO.
The BTT works as a stacked blocked device, and reserves a chunk of space
from the backing device for its accounting metadata. It is a bio-based
driver because all IO is done synchronously, and there is no queuing or
asynchronous completions at either the device or the driver level.
The BTT uses 'lanes' to index into various 'on-disk' data structures,
and lanes also act as a synchronization mechanism in case there are more
CPUs than available lanes. We did a comparison between two lane lock
strategies - first where we kept an atomic counter around that tracked
which was the last lane that was used, and 'our' lane was determined by
atomically incrementing that. That way, for the nr_cpus > nr_lanes case,
theoretically, no CPU would be blocked waiting for a lane. The other
strategy was to use the cpu number we're scheduled on to and hash it to
a lane number. Theoretically, this could block an IO that could've
otherwise run using a different, free lane. But some fio workloads
showed that the direct cpu -> lane hash performed faster than tracking
'last lane' - my reasoning is the cache thrash caused by moving the
atomic variable made that approach slower than simply waiting out the
in-progress IO. This supports the conclusion that the driver can be a
very simple bio-based one that does synchronous IOs instead of queuing.
Cc: Andy Lutomirski <luto@amacapital.net>
Cc: Boaz Harrosh <boaz@plexistor.com>
Cc: H. Peter Anvin <hpa@zytor.com>
Cc: Jens Axboe <axboe@fb.com>
Cc: Ingo Molnar <mingo@kernel.org>
Cc: Christoph Hellwig <hch@lst.de>
Cc: Neil Brown <neilb@suse.de>
Cc: Jeff Moyer <jmoyer@redhat.com>
Cc: Dave Chinner <david@fromorbit.com>
Cc: Greg KH <gregkh@linuxfoundation.org>
[jmoyer: fix nmi watchdog timeout in btt_map_init]
[jmoyer: move btt initialization to module load path]
[jmoyer: fix memory leak in the btt initialization path]
[jmoyer: Don't overwrite corrupted arenas]
Signed-off-by: Vishal Verma <vishal.l.verma@linux.intel.com>
Signed-off-by: Dan Williams <dan.j.williams@intel.com>
2015-06-25 08:20:32 +00:00
|
|
|
#include <linux/cpumask.h>
|
2015-05-31 19:02:11 +00:00
|
|
|
#include <linux/module.h>
|
|
|
|
|
#include <linux/device.h>
|
|
|
|
|
#include <linux/nd.h>
|
2017-04-07 22:33:20 +00:00
|
|
|
#include "nd-core.h"
|
2015-05-31 19:02:11 +00:00
|
|
|
#include "nd.h"
|
|
|
|
|
|
|
|
|
|
static int nd_region_probe(struct device *dev)
|
|
|
|
|
{
|
2015-06-25 08:21:02 +00:00
|
|
|
int err, rc;
|
nd_btt: atomic sector updates
BTT stands for Block Translation Table, and is a way to provide power
fail sector atomicity semantics for block devices that have the ability
to perform byte granularity IO. It relies on the capability of libnvdimm
namespace devices to do byte aligned IO.
The BTT works as a stacked blocked device, and reserves a chunk of space
from the backing device for its accounting metadata. It is a bio-based
driver because all IO is done synchronously, and there is no queuing or
asynchronous completions at either the device or the driver level.
The BTT uses 'lanes' to index into various 'on-disk' data structures,
and lanes also act as a synchronization mechanism in case there are more
CPUs than available lanes. We did a comparison between two lane lock
strategies - first where we kept an atomic counter around that tracked
which was the last lane that was used, and 'our' lane was determined by
atomically incrementing that. That way, for the nr_cpus > nr_lanes case,
theoretically, no CPU would be blocked waiting for a lane. The other
strategy was to use the cpu number we're scheduled on to and hash it to
a lane number. Theoretically, this could block an IO that could've
otherwise run using a different, free lane. But some fio workloads
showed that the direct cpu -> lane hash performed faster than tracking
'last lane' - my reasoning is the cache thrash caused by moving the
atomic variable made that approach slower than simply waiting out the
in-progress IO. This supports the conclusion that the driver can be a
very simple bio-based one that does synchronous IOs instead of queuing.
Cc: Andy Lutomirski <luto@amacapital.net>
Cc: Boaz Harrosh <boaz@plexistor.com>
Cc: H. Peter Anvin <hpa@zytor.com>
Cc: Jens Axboe <axboe@fb.com>
Cc: Ingo Molnar <mingo@kernel.org>
Cc: Christoph Hellwig <hch@lst.de>
Cc: Neil Brown <neilb@suse.de>
Cc: Jeff Moyer <jmoyer@redhat.com>
Cc: Dave Chinner <david@fromorbit.com>
Cc: Greg KH <gregkh@linuxfoundation.org>
[jmoyer: fix nmi watchdog timeout in btt_map_init]
[jmoyer: move btt initialization to module load path]
[jmoyer: fix memory leak in the btt initialization path]
[jmoyer: Don't overwrite corrupted arenas]
Signed-off-by: Vishal Verma <vishal.l.verma@linux.intel.com>
Signed-off-by: Dan Williams <dan.j.williams@intel.com>
2015-06-25 08:20:32 +00:00
|
|
|
static unsigned long once;
|
2016-06-08 00:00:04 +00:00
|
|
|
struct nd_region_data *ndrd;
|
2015-05-31 19:02:11 +00:00
|
|
|
struct nd_region *nd_region = to_nd_region(dev);
|
2022-03-10 03:49:48 +00:00
|
|
|
struct range range = {
|
|
|
|
|
.start = nd_region->ndr_start,
|
|
|
|
|
.end = nd_region->ndr_start + nd_region->ndr_size - 1,
|
|
|
|
|
};
|
2015-05-31 19:02:11 +00:00
|
|
|
|
nd_btt: atomic sector updates
BTT stands for Block Translation Table, and is a way to provide power
fail sector atomicity semantics for block devices that have the ability
to perform byte granularity IO. It relies on the capability of libnvdimm
namespace devices to do byte aligned IO.
The BTT works as a stacked blocked device, and reserves a chunk of space
from the backing device for its accounting metadata. It is a bio-based
driver because all IO is done synchronously, and there is no queuing or
asynchronous completions at either the device or the driver level.
The BTT uses 'lanes' to index into various 'on-disk' data structures,
and lanes also act as a synchronization mechanism in case there are more
CPUs than available lanes. We did a comparison between two lane lock
strategies - first where we kept an atomic counter around that tracked
which was the last lane that was used, and 'our' lane was determined by
atomically incrementing that. That way, for the nr_cpus > nr_lanes case,
theoretically, no CPU would be blocked waiting for a lane. The other
strategy was to use the cpu number we're scheduled on to and hash it to
a lane number. Theoretically, this could block an IO that could've
otherwise run using a different, free lane. But some fio workloads
showed that the direct cpu -> lane hash performed faster than tracking
'last lane' - my reasoning is the cache thrash caused by moving the
atomic variable made that approach slower than simply waiting out the
in-progress IO. This supports the conclusion that the driver can be a
very simple bio-based one that does synchronous IOs instead of queuing.
Cc: Andy Lutomirski <luto@amacapital.net>
Cc: Boaz Harrosh <boaz@plexistor.com>
Cc: H. Peter Anvin <hpa@zytor.com>
Cc: Jens Axboe <axboe@fb.com>
Cc: Ingo Molnar <mingo@kernel.org>
Cc: Christoph Hellwig <hch@lst.de>
Cc: Neil Brown <neilb@suse.de>
Cc: Jeff Moyer <jmoyer@redhat.com>
Cc: Dave Chinner <david@fromorbit.com>
Cc: Greg KH <gregkh@linuxfoundation.org>
[jmoyer: fix nmi watchdog timeout in btt_map_init]
[jmoyer: move btt initialization to module load path]
[jmoyer: fix memory leak in the btt initialization path]
[jmoyer: Don't overwrite corrupted arenas]
Signed-off-by: Vishal Verma <vishal.l.verma@linux.intel.com>
Signed-off-by: Dan Williams <dan.j.williams@intel.com>
2015-06-25 08:20:32 +00:00
|
|
|
if (nd_region->num_lanes > num_online_cpus()
|
|
|
|
|
&& nd_region->num_lanes < num_possible_cpus()
|
|
|
|
|
&& !test_and_set_bit(0, &once)) {
|
2018-04-07 14:47:10 +00:00
|
|
|
dev_dbg(dev, "online cpus (%d) < concurrent i/o lanes (%d) < possible cpus (%d)\n",
|
nd_btt: atomic sector updates
BTT stands for Block Translation Table, and is a way to provide power
fail sector atomicity semantics for block devices that have the ability
to perform byte granularity IO. It relies on the capability of libnvdimm
namespace devices to do byte aligned IO.
The BTT works as a stacked blocked device, and reserves a chunk of space
from the backing device for its accounting metadata. It is a bio-based
driver because all IO is done synchronously, and there is no queuing or
asynchronous completions at either the device or the driver level.
The BTT uses 'lanes' to index into various 'on-disk' data structures,
and lanes also act as a synchronization mechanism in case there are more
CPUs than available lanes. We did a comparison between two lane lock
strategies - first where we kept an atomic counter around that tracked
which was the last lane that was used, and 'our' lane was determined by
atomically incrementing that. That way, for the nr_cpus > nr_lanes case,
theoretically, no CPU would be blocked waiting for a lane. The other
strategy was to use the cpu number we're scheduled on to and hash it to
a lane number. Theoretically, this could block an IO that could've
otherwise run using a different, free lane. But some fio workloads
showed that the direct cpu -> lane hash performed faster than tracking
'last lane' - my reasoning is the cache thrash caused by moving the
atomic variable made that approach slower than simply waiting out the
in-progress IO. This supports the conclusion that the driver can be a
very simple bio-based one that does synchronous IOs instead of queuing.
Cc: Andy Lutomirski <luto@amacapital.net>
Cc: Boaz Harrosh <boaz@plexistor.com>
Cc: H. Peter Anvin <hpa@zytor.com>
Cc: Jens Axboe <axboe@fb.com>
Cc: Ingo Molnar <mingo@kernel.org>
Cc: Christoph Hellwig <hch@lst.de>
Cc: Neil Brown <neilb@suse.de>
Cc: Jeff Moyer <jmoyer@redhat.com>
Cc: Dave Chinner <david@fromorbit.com>
Cc: Greg KH <gregkh@linuxfoundation.org>
[jmoyer: fix nmi watchdog timeout in btt_map_init]
[jmoyer: move btt initialization to module load path]
[jmoyer: fix memory leak in the btt initialization path]
[jmoyer: Don't overwrite corrupted arenas]
Signed-off-by: Vishal Verma <vishal.l.verma@linux.intel.com>
Signed-off-by: Dan Williams <dan.j.williams@intel.com>
2015-06-25 08:20:32 +00:00
|
|
|
num_online_cpus(), nd_region->num_lanes,
|
|
|
|
|
num_possible_cpus());
|
2018-04-07 14:47:10 +00:00
|
|
|
dev_dbg(dev, "setting nr_cpus=%d may yield better libnvdimm device performance\n",
|
nd_btt: atomic sector updates
BTT stands for Block Translation Table, and is a way to provide power
fail sector atomicity semantics for block devices that have the ability
to perform byte granularity IO. It relies on the capability of libnvdimm
namespace devices to do byte aligned IO.
The BTT works as a stacked blocked device, and reserves a chunk of space
from the backing device for its accounting metadata. It is a bio-based
driver because all IO is done synchronously, and there is no queuing or
asynchronous completions at either the device or the driver level.
The BTT uses 'lanes' to index into various 'on-disk' data structures,
and lanes also act as a synchronization mechanism in case there are more
CPUs than available lanes. We did a comparison between two lane lock
strategies - first where we kept an atomic counter around that tracked
which was the last lane that was used, and 'our' lane was determined by
atomically incrementing that. That way, for the nr_cpus > nr_lanes case,
theoretically, no CPU would be blocked waiting for a lane. The other
strategy was to use the cpu number we're scheduled on to and hash it to
a lane number. Theoretically, this could block an IO that could've
otherwise run using a different, free lane. But some fio workloads
showed that the direct cpu -> lane hash performed faster than tracking
'last lane' - my reasoning is the cache thrash caused by moving the
atomic variable made that approach slower than simply waiting out the
in-progress IO. This supports the conclusion that the driver can be a
very simple bio-based one that does synchronous IOs instead of queuing.
Cc: Andy Lutomirski <luto@amacapital.net>
Cc: Boaz Harrosh <boaz@plexistor.com>
Cc: H. Peter Anvin <hpa@zytor.com>
Cc: Jens Axboe <axboe@fb.com>
Cc: Ingo Molnar <mingo@kernel.org>
Cc: Christoph Hellwig <hch@lst.de>
Cc: Neil Brown <neilb@suse.de>
Cc: Jeff Moyer <jmoyer@redhat.com>
Cc: Dave Chinner <david@fromorbit.com>
Cc: Greg KH <gregkh@linuxfoundation.org>
[jmoyer: fix nmi watchdog timeout in btt_map_init]
[jmoyer: move btt initialization to module load path]
[jmoyer: fix memory leak in the btt initialization path]
[jmoyer: Don't overwrite corrupted arenas]
Signed-off-by: Vishal Verma <vishal.l.verma@linux.intel.com>
Signed-off-by: Dan Williams <dan.j.williams@intel.com>
2015-06-25 08:20:32 +00:00
|
|
|
nd_region->num_lanes);
|
|
|
|
|
}
|
|
|
|
|
|
2016-06-08 00:00:04 +00:00
|
|
|
rc = nd_region_activate(nd_region);
|
|
|
|
|
if (rc)
|
|
|
|
|
return rc;
|
|
|
|
|
|
2022-03-10 03:49:48 +00:00
|
|
|
if (devm_init_badblocks(dev, &nd_region->bb))
|
|
|
|
|
return -ENODEV;
|
|
|
|
|
nd_region->bb_state =
|
|
|
|
|
sysfs_get_dirent(nd_region->dev.kobj.sd, "badblocks");
|
|
|
|
|
if (!nd_region->bb_state)
|
|
|
|
|
dev_warn(dev, "'badblocks' notification disabled\n");
|
|
|
|
|
nvdimm_badblocks_populate(nd_region, &nd_region->bb, &range);
|
2017-04-07 22:33:20 +00:00
|
|
|
|
2019-07-18 01:08:03 +00:00
|
|
|
rc = nd_region_register_namespaces(nd_region, &err);
|
|
|
|
|
if (rc < 0)
|
|
|
|
|
return rc;
|
|
|
|
|
|
|
|
|
|
ndrd = dev_get_drvdata(dev);
|
|
|
|
|
ndrd->ns_active = rc;
|
|
|
|
|
ndrd->ns_count = rc + err;
|
|
|
|
|
|
|
|
|
|
if (rc && err && rc == err)
|
|
|
|
|
return -ENODEV;
|
|
|
|
|
|
2015-06-25 08:20:04 +00:00
|
|
|
nd_region->btt_seed = nd_btt_create(nd_region);
|
2015-07-30 21:57:47 +00:00
|
|
|
nd_region->pfn_seed = nd_pfn_create(nd_region);
|
2016-03-11 18:15:36 +00:00
|
|
|
nd_region->dax_seed = nd_dax_create(nd_region);
|
2015-05-31 19:02:11 +00:00
|
|
|
if (err == 0)
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Given multiple namespaces per region, we do not want to
|
|
|
|
|
* disable all the successfully registered peer namespaces upon
|
|
|
|
|
* a single registration failure. If userspace is missing a
|
|
|
|
|
* namespace that it expects it can disable/re-enable the region
|
|
|
|
|
* to retry discovery after correcting the failure.
|
|
|
|
|
* <regionX>/namespaces returns the current
|
|
|
|
|
* "<async-registered>/<total>" namespace count.
|
|
|
|
|
*/
|
|
|
|
|
dev_err(dev, "failed to register %d namespace%s, continuing...\n",
|
|
|
|
|
err, err == 1 ? "" : "s");
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int child_unregister(struct device *dev, void *data)
|
|
|
|
|
{
|
|
|
|
|
nd_device_unregister(dev, ND_SYNC);
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2021-02-12 17:10:43 +00:00
|
|
|
static void nd_region_remove(struct device *dev)
|
2015-05-31 19:02:11 +00:00
|
|
|
{
|
2015-06-17 21:14:46 +00:00
|
|
|
struct nd_region *nd_region = to_nd_region(dev);
|
|
|
|
|
|
2016-07-09 23:46:29 +00:00
|
|
|
device_for_each_child(dev, NULL, child_unregister);
|
|
|
|
|
|
2015-05-31 19:02:11 +00:00
|
|
|
/* flush attribute readers and disable */
|
|
|
|
|
nvdimm_bus_lock(dev);
|
2015-06-17 21:14:46 +00:00
|
|
|
nd_region->ns_seed = NULL;
|
2015-06-25 08:20:04 +00:00
|
|
|
nd_region->btt_seed = NULL;
|
2015-07-30 21:57:47 +00:00
|
|
|
nd_region->pfn_seed = NULL;
|
2016-03-11 18:15:36 +00:00
|
|
|
nd_region->dax_seed = NULL;
|
2015-05-31 19:02:11 +00:00
|
|
|
dev_set_drvdata(dev, NULL);
|
|
|
|
|
nvdimm_bus_unlock(dev);
|
|
|
|
|
|
2017-07-01 01:56:03 +00:00
|
|
|
/*
|
2022-04-21 15:33:39 +00:00
|
|
|
* Note, this assumes device_lock() context to not race
|
2017-07-01 01:56:03 +00:00
|
|
|
* nd_region_notify()
|
|
|
|
|
*/
|
|
|
|
|
sysfs_put(nd_region->bb_state);
|
|
|
|
|
nd_region->bb_state = NULL;
|
2015-05-31 19:02:11 +00:00
|
|
|
}
|
|
|
|
|
|
2016-02-18 18:29:49 +00:00
|
|
|
static int child_notify(struct device *dev, void *data)
|
|
|
|
|
{
|
|
|
|
|
nd_device_notify(dev, *(enum nvdimm_event *) data);
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void nd_region_notify(struct device *dev, enum nvdimm_event event)
|
|
|
|
|
{
|
2017-04-07 22:33:20 +00:00
|
|
|
if (event == NVDIMM_REVALIDATE_POISON) {
|
|
|
|
|
struct nd_region *nd_region = to_nd_region(dev);
|
|
|
|
|
|
2019-09-19 08:33:55 +00:00
|
|
|
if (is_memory(&nd_region->dev)) {
|
2020-10-13 23:50:29 +00:00
|
|
|
struct range range = {
|
|
|
|
|
.start = nd_region->ndr_start,
|
|
|
|
|
.end = nd_region->ndr_start +
|
|
|
|
|
nd_region->ndr_size - 1,
|
|
|
|
|
};
|
|
|
|
|
|
2017-04-07 22:33:20 +00:00
|
|
|
nvdimm_badblocks_populate(nd_region,
|
2020-10-13 23:50:29 +00:00
|
|
|
&nd_region->bb, &range);
|
2017-06-12 22:25:11 +00:00
|
|
|
if (nd_region->bb_state)
|
|
|
|
|
sysfs_notify_dirent(nd_region->bb_state);
|
2017-04-07 22:33:20 +00:00
|
|
|
}
|
|
|
|
|
}
|
2016-02-18 18:29:49 +00:00
|
|
|
device_for_each_child(dev, &event, child_notify);
|
|
|
|
|
}
|
|
|
|
|
|
2015-05-31 19:02:11 +00:00
|
|
|
static struct nd_device_driver nd_region_driver = {
|
|
|
|
|
.probe = nd_region_probe,
|
|
|
|
|
.remove = nd_region_remove,
|
2016-02-18 18:29:49 +00:00
|
|
|
.notify = nd_region_notify,
|
2015-05-31 19:02:11 +00:00
|
|
|
.drv = {
|
|
|
|
|
.name = "nd_region",
|
|
|
|
|
},
|
|
|
|
|
.type = ND_DRIVER_REGION_BLK | ND_DRIVER_REGION_PMEM,
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
int __init nd_region_init(void)
|
|
|
|
|
{
|
|
|
|
|
return nd_driver_register(&nd_region_driver);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void nd_region_exit(void)
|
|
|
|
|
{
|
|
|
|
|
driver_unregister(&nd_region_driver.drv);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
MODULE_ALIAS_ND_DEVICE(ND_DEVICE_REGION_PMEM);
|