]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blame - drivers/nvdimm/btt.c
Merge tag 'media/v4.14-1' of git://git.kernel.org/pub/scm/linux/kernel/git/mchehab...
[mirror_ubuntu-bionic-kernel.git] / drivers / nvdimm / btt.c
CommitLineData
5212e11f
VV
1/*
2 * Block Translation Table
3 * Copyright (c) 2014-2015, Intel Corporation.
4 *
5 * This program is free software; you can redistribute it and/or modify it
6 * under the terms and conditions of the GNU General Public License,
7 * version 2, as published by the Free Software Foundation.
8 *
9 * This program is distributed in the hope it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
12 * more details.
13 */
14#include <linux/highmem.h>
15#include <linux/debugfs.h>
16#include <linux/blkdev.h>
17#include <linux/module.h>
18#include <linux/device.h>
19#include <linux/mutex.h>
20#include <linux/hdreg.h>
21#include <linux/genhd.h>
22#include <linux/sizes.h>
23#include <linux/ndctl.h>
24#include <linux/fs.h>
25#include <linux/nd.h>
26#include "btt.h"
27#include "nd.h"
28
29enum log_ent_request {
30 LOG_NEW_ENT = 0,
31 LOG_OLD_ENT
32};
33
5212e11f 34static int arena_read_bytes(struct arena_info *arena, resource_size_t offset,
3ae3d67b 35 void *buf, size_t n, unsigned long flags)
5212e11f
VV
36{
37 struct nd_btt *nd_btt = arena->nd_btt;
38 struct nd_namespace_common *ndns = nd_btt->ndns;
39
14e49454
VV
40 /* arena offsets may be shifted from the base of the device */
41 offset += arena->nd_btt->initial_offset;
3ae3d67b 42 return nvdimm_read_bytes(ndns, offset, buf, n, flags);
5212e11f
VV
43}
44
45static int arena_write_bytes(struct arena_info *arena, resource_size_t offset,
3ae3d67b 46 void *buf, size_t n, unsigned long flags)
5212e11f
VV
47{
48 struct nd_btt *nd_btt = arena->nd_btt;
49 struct nd_namespace_common *ndns = nd_btt->ndns;
50
14e49454
VV
51 /* arena offsets may be shifted from the base of the device */
52 offset += arena->nd_btt->initial_offset;
3ae3d67b 53 return nvdimm_write_bytes(ndns, offset, buf, n, flags);
5212e11f
VV
54}
55
56static int btt_info_write(struct arena_info *arena, struct btt_sb *super)
57{
58 int ret;
59
b177fe85
VV
60 /*
61 * infooff and info2off should always be at least 512B aligned.
62 * We rely on that to make sure rw_bytes does error clearing
63 * correctly, so make sure that is the case.
64 */
65 WARN_ON_ONCE(!IS_ALIGNED(arena->infooff, 512));
66 WARN_ON_ONCE(!IS_ALIGNED(arena->info2off, 512));
67
5212e11f 68 ret = arena_write_bytes(arena, arena->info2off, super,
3ae3d67b 69 sizeof(struct btt_sb), 0);
5212e11f
VV
70 if (ret)
71 return ret;
72
73 return arena_write_bytes(arena, arena->infooff, super,
3ae3d67b 74 sizeof(struct btt_sb), 0);
5212e11f
VV
75}
76
77static int btt_info_read(struct arena_info *arena, struct btt_sb *super)
78{
79 WARN_ON(!super);
80 return arena_read_bytes(arena, arena->infooff, super,
3ae3d67b 81 sizeof(struct btt_sb), 0);
5212e11f
VV
82}
83
84/*
85 * 'raw' version of btt_map write
86 * Assumptions:
87 * mapping is in little-endian
88 * mapping contains 'E' and 'Z' flags as desired
89 */
3ae3d67b
VV
90static int __btt_map_write(struct arena_info *arena, u32 lba, __le32 mapping,
91 unsigned long flags)
5212e11f
VV
92{
93 u64 ns_off = arena->mapoff + (lba * MAP_ENT_SIZE);
94
95 WARN_ON(lba >= arena->external_nlba);
3ae3d67b 96 return arena_write_bytes(arena, ns_off, &mapping, MAP_ENT_SIZE, flags);
5212e11f
VV
97}
98
99static int btt_map_write(struct arena_info *arena, u32 lba, u32 mapping,
3ae3d67b 100 u32 z_flag, u32 e_flag, unsigned long rwb_flags)
5212e11f
VV
101{
102 u32 ze;
103 __le32 mapping_le;
104
105 /*
106 * This 'mapping' is supposed to be just the LBA mapping, without
107 * any flags set, so strip the flag bits.
108 */
109 mapping &= MAP_LBA_MASK;
110
111 ze = (z_flag << 1) + e_flag;
112 switch (ze) {
113 case 0:
114 /*
115 * We want to set neither of the Z or E flags, and
116 * in the actual layout, this means setting the bit
117 * positions of both to '1' to indicate a 'normal'
118 * map entry
119 */
120 mapping |= MAP_ENT_NORMAL;
121 break;
122 case 1:
123 mapping |= (1 << MAP_ERR_SHIFT);
124 break;
125 case 2:
126 mapping |= (1 << MAP_TRIM_SHIFT);
127 break;
128 default:
129 /*
130 * The case where Z and E are both sent in as '1' could be
131 * construed as a valid 'normal' case, but we decide not to,
132 * to avoid confusion
133 */
134 WARN_ONCE(1, "Invalid use of Z and E flags\n");
135 return -EIO;
136 }
137
138 mapping_le = cpu_to_le32(mapping);
3ae3d67b 139 return __btt_map_write(arena, lba, mapping_le, rwb_flags);
5212e11f
VV
140}
141
142static int btt_map_read(struct arena_info *arena, u32 lba, u32 *mapping,
3ae3d67b 143 int *trim, int *error, unsigned long rwb_flags)
5212e11f
VV
144{
145 int ret;
146 __le32 in;
147 u32 raw_mapping, postmap, ze, z_flag, e_flag;
148 u64 ns_off = arena->mapoff + (lba * MAP_ENT_SIZE);
149
150 WARN_ON(lba >= arena->external_nlba);
151
3ae3d67b 152 ret = arena_read_bytes(arena, ns_off, &in, MAP_ENT_SIZE, rwb_flags);
5212e11f
VV
153 if (ret)
154 return ret;
155
156 raw_mapping = le32_to_cpu(in);
157
158 z_flag = (raw_mapping & MAP_TRIM_MASK) >> MAP_TRIM_SHIFT;
159 e_flag = (raw_mapping & MAP_ERR_MASK) >> MAP_ERR_SHIFT;
160 ze = (z_flag << 1) + e_flag;
161 postmap = raw_mapping & MAP_LBA_MASK;
162
163 /* Reuse the {z,e}_flag variables for *trim and *error */
164 z_flag = 0;
165 e_flag = 0;
166
167 switch (ze) {
168 case 0:
169 /* Initial state. Return postmap = premap */
170 *mapping = lba;
171 break;
172 case 1:
173 *mapping = postmap;
174 e_flag = 1;
175 break;
176 case 2:
177 *mapping = postmap;
178 z_flag = 1;
179 break;
180 case 3:
181 *mapping = postmap;
182 break;
183 default:
184 return -EIO;
185 }
186
187 if (trim)
188 *trim = z_flag;
189 if (error)
190 *error = e_flag;
191
192 return ret;
193}
194
195static int btt_log_read_pair(struct arena_info *arena, u32 lane,
196 struct log_entry *ent)
197{
198 WARN_ON(!ent);
199 return arena_read_bytes(arena,
200 arena->logoff + (2 * lane * LOG_ENT_SIZE), ent,
3ae3d67b 201 2 * LOG_ENT_SIZE, 0);
5212e11f
VV
202}
203
204static struct dentry *debugfs_root;
205
206static void arena_debugfs_init(struct arena_info *a, struct dentry *parent,
207 int idx)
208{
209 char dirname[32];
210 struct dentry *d;
211
212 /* If for some reason, parent bttN was not created, exit */
213 if (!parent)
214 return;
215
216 snprintf(dirname, 32, "arena%d", idx);
217 d = debugfs_create_dir(dirname, parent);
218 if (IS_ERR_OR_NULL(d))
219 return;
220 a->debugfs_dir = d;
221
222 debugfs_create_x64("size", S_IRUGO, d, &a->size);
223 debugfs_create_x64("external_lba_start", S_IRUGO, d,
224 &a->external_lba_start);
225 debugfs_create_x32("internal_nlba", S_IRUGO, d, &a->internal_nlba);
226 debugfs_create_u32("internal_lbasize", S_IRUGO, d,
227 &a->internal_lbasize);
228 debugfs_create_x32("external_nlba", S_IRUGO, d, &a->external_nlba);
229 debugfs_create_u32("external_lbasize", S_IRUGO, d,
230 &a->external_lbasize);
231 debugfs_create_u32("nfree", S_IRUGO, d, &a->nfree);
232 debugfs_create_u16("version_major", S_IRUGO, d, &a->version_major);
233 debugfs_create_u16("version_minor", S_IRUGO, d, &a->version_minor);
234 debugfs_create_x64("nextoff", S_IRUGO, d, &a->nextoff);
235 debugfs_create_x64("infooff", S_IRUGO, d, &a->infooff);
236 debugfs_create_x64("dataoff", S_IRUGO, d, &a->dataoff);
237 debugfs_create_x64("mapoff", S_IRUGO, d, &a->mapoff);
238 debugfs_create_x64("logoff", S_IRUGO, d, &a->logoff);
239 debugfs_create_x64("info2off", S_IRUGO, d, &a->info2off);
240 debugfs_create_x32("flags", S_IRUGO, d, &a->flags);
241}
242
243static void btt_debugfs_init(struct btt *btt)
244{
245 int i = 0;
246 struct arena_info *arena;
247
248 btt->debugfs_dir = debugfs_create_dir(dev_name(&btt->nd_btt->dev),
249 debugfs_root);
250 if (IS_ERR_OR_NULL(btt->debugfs_dir))
251 return;
252
253 list_for_each_entry(arena, &btt->arena_list, list) {
254 arena_debugfs_init(arena, btt->debugfs_dir, i);
255 i++;
256 }
257}
258
259/*
260 * This function accepts two log entries, and uses the
261 * sequence number to find the 'older' entry.
262 * It also updates the sequence number in this old entry to
263 * make it the 'new' one if the mark_flag is set.
264 * Finally, it returns which of the entries was the older one.
265 *
266 * TODO The logic feels a bit kludge-y. make it better..
267 */
268static int btt_log_get_old(struct log_entry *ent)
269{
270 int old;
271
272 /*
273 * the first ever time this is seen, the entry goes into [0]
274 * the next time, the following logic works out to put this
275 * (next) entry into [1]
276 */
277 if (ent[0].seq == 0) {
278 ent[0].seq = cpu_to_le32(1);
279 return 0;
280 }
281
282 if (ent[0].seq == ent[1].seq)
283 return -EINVAL;
284 if (le32_to_cpu(ent[0].seq) + le32_to_cpu(ent[1].seq) > 5)
285 return -EINVAL;
286
287 if (le32_to_cpu(ent[0].seq) < le32_to_cpu(ent[1].seq)) {
288 if (le32_to_cpu(ent[1].seq) - le32_to_cpu(ent[0].seq) == 1)
289 old = 0;
290 else
291 old = 1;
292 } else {
293 if (le32_to_cpu(ent[0].seq) - le32_to_cpu(ent[1].seq) == 1)
294 old = 1;
295 else
296 old = 0;
297 }
298
299 return old;
300}
301
302static struct device *to_dev(struct arena_info *arena)
303{
304 return &arena->nd_btt->dev;
305}
306
307/*
308 * This function copies the desired (old/new) log entry into ent if
309 * it is not NULL. It returns the sub-slot number (0 or 1)
310 * where the desired log entry was found. Negative return values
311 * indicate errors.
312 */
313static int btt_log_read(struct arena_info *arena, u32 lane,
314 struct log_entry *ent, int old_flag)
315{
316 int ret;
317 int old_ent, ret_ent;
318 struct log_entry log[2];
319
320 ret = btt_log_read_pair(arena, lane, log);
321 if (ret)
322 return -EIO;
323
324 old_ent = btt_log_get_old(log);
325 if (old_ent < 0 || old_ent > 1) {
e6be2dcb 326 dev_err(to_dev(arena),
5212e11f
VV
327 "log corruption (%d): lane %d seq [%d, %d]\n",
328 old_ent, lane, log[0].seq, log[1].seq);
329 /* TODO set error state? */
330 return -EIO;
331 }
332
333 ret_ent = (old_flag ? old_ent : (1 - old_ent));
334
335 if (ent != NULL)
336 memcpy(ent, &log[ret_ent], LOG_ENT_SIZE);
337
338 return ret_ent;
339}
340
341/*
342 * This function commits a log entry to media
343 * It does _not_ prepare the freelist entry for the next write
344 * btt_flog_write is the wrapper for updating the freelist elements
345 */
346static int __btt_log_write(struct arena_info *arena, u32 lane,
3ae3d67b 347 u32 sub, struct log_entry *ent, unsigned long flags)
5212e11f
VV
348{
349 int ret;
350 /*
351 * Ignore the padding in log_entry for calculating log_half.
352 * The entry is 'committed' when we write the sequence number,
353 * and we want to ensure that that is the last thing written.
354 * We don't bother writing the padding as that would be extra
355 * media wear and write amplification
356 */
357 unsigned int log_half = (LOG_ENT_SIZE - 2 * sizeof(u64)) / 2;
358 u64 ns_off = arena->logoff + (((2 * lane) + sub) * LOG_ENT_SIZE);
359 void *src = ent;
360
361 /* split the 16B write into atomic, durable halves */
3ae3d67b 362 ret = arena_write_bytes(arena, ns_off, src, log_half, flags);
5212e11f
VV
363 if (ret)
364 return ret;
365
366 ns_off += log_half;
367 src += log_half;
3ae3d67b 368 return arena_write_bytes(arena, ns_off, src, log_half, flags);
5212e11f
VV
369}
370
371static int btt_flog_write(struct arena_info *arena, u32 lane, u32 sub,
372 struct log_entry *ent)
373{
374 int ret;
375
3ae3d67b 376 ret = __btt_log_write(arena, lane, sub, ent, NVDIMM_IO_ATOMIC);
5212e11f
VV
377 if (ret)
378 return ret;
379
380 /* prepare the next free entry */
381 arena->freelist[lane].sub = 1 - arena->freelist[lane].sub;
382 if (++(arena->freelist[lane].seq) == 4)
383 arena->freelist[lane].seq = 1;
384 arena->freelist[lane].block = le32_to_cpu(ent->old_map);
385
386 return ret;
387}
388
389/*
390 * This function initializes the BTT map to the initial state, which is
391 * all-zeroes, and indicates an identity mapping
392 */
393static int btt_map_init(struct arena_info *arena)
394{
395 int ret = -EINVAL;
396 void *zerobuf;
397 size_t offset = 0;
398 size_t chunk_size = SZ_2M;
399 size_t mapsize = arena->logoff - arena->mapoff;
400
401 zerobuf = kzalloc(chunk_size, GFP_KERNEL);
402 if (!zerobuf)
403 return -ENOMEM;
404
b177fe85
VV
405 /*
406 * mapoff should always be at least 512B aligned. We rely on that to
407 * make sure rw_bytes does error clearing correctly, so make sure that
408 * is the case.
409 */
410 WARN_ON_ONCE(!IS_ALIGNED(arena->mapoff, 512));
411
5212e11f
VV
412 while (mapsize) {
413 size_t size = min(mapsize, chunk_size);
414
b177fe85 415 WARN_ON_ONCE(size < 512);
5212e11f 416 ret = arena_write_bytes(arena, arena->mapoff + offset, zerobuf,
3ae3d67b 417 size, 0);
5212e11f
VV
418 if (ret)
419 goto free;
420
421 offset += size;
422 mapsize -= size;
423 cond_resched();
424 }
425
426 free:
427 kfree(zerobuf);
428 return ret;
429}
430
431/*
432 * This function initializes the BTT log with 'fake' entries pointing
433 * to the initial reserved set of blocks as being free
434 */
435static int btt_log_init(struct arena_info *arena)
436{
b177fe85
VV
437 size_t logsize = arena->info2off - arena->logoff;
438 size_t chunk_size = SZ_4K, offset = 0;
439 struct log_entry log;
440 void *zerobuf;
5212e11f
VV
441 int ret;
442 u32 i;
5212e11f 443
b177fe85
VV
444 zerobuf = kzalloc(chunk_size, GFP_KERNEL);
445 if (!zerobuf)
446 return -ENOMEM;
447 /*
448 * logoff should always be at least 512B aligned. We rely on that to
449 * make sure rw_bytes does error clearing correctly, so make sure that
450 * is the case.
451 */
452 WARN_ON_ONCE(!IS_ALIGNED(arena->logoff, 512));
453
454 while (logsize) {
455 size_t size = min(logsize, chunk_size);
456
457 WARN_ON_ONCE(size < 512);
458 ret = arena_write_bytes(arena, arena->logoff + offset, zerobuf,
459 size, 0);
460 if (ret)
461 goto free;
462
463 offset += size;
464 logsize -= size;
465 cond_resched();
466 }
5212e11f
VV
467
468 for (i = 0; i < arena->nfree; i++) {
469 log.lba = cpu_to_le32(i);
470 log.old_map = cpu_to_le32(arena->external_nlba + i);
471 log.new_map = cpu_to_le32(arena->external_nlba + i);
472 log.seq = cpu_to_le32(LOG_SEQ_INIT);
3ae3d67b 473 ret = __btt_log_write(arena, i, 0, &log, 0);
5212e11f 474 if (ret)
b177fe85 475 goto free;
5212e11f
VV
476 }
477
b177fe85
VV
478 free:
479 kfree(zerobuf);
480 return ret;
5212e11f
VV
481}
482
483static int btt_freelist_init(struct arena_info *arena)
484{
485 int old, new, ret;
486 u32 i, map_entry;
487 struct log_entry log_new, log_old;
488
489 arena->freelist = kcalloc(arena->nfree, sizeof(struct free_entry),
490 GFP_KERNEL);
491 if (!arena->freelist)
492 return -ENOMEM;
493
494 for (i = 0; i < arena->nfree; i++) {
495 old = btt_log_read(arena, i, &log_old, LOG_OLD_ENT);
496 if (old < 0)
497 return old;
498
499 new = btt_log_read(arena, i, &log_new, LOG_NEW_ENT);
500 if (new < 0)
501 return new;
502
503 /* sub points to the next one to be overwritten */
504 arena->freelist[i].sub = 1 - new;
505 arena->freelist[i].seq = nd_inc_seq(le32_to_cpu(log_new.seq));
506 arena->freelist[i].block = le32_to_cpu(log_new.old_map);
507
508 /* This implies a newly created or untouched flog entry */
509 if (log_new.old_map == log_new.new_map)
510 continue;
511
512 /* Check if map recovery is needed */
513 ret = btt_map_read(arena, le32_to_cpu(log_new.lba), &map_entry,
3ae3d67b 514 NULL, NULL, 0);
5212e11f
VV
515 if (ret)
516 return ret;
517 if ((le32_to_cpu(log_new.new_map) != map_entry) &&
518 (le32_to_cpu(log_new.old_map) == map_entry)) {
519 /*
520 * Last transaction wrote the flog, but wasn't able
521 * to complete the map write. So fix up the map.
522 */
523 ret = btt_map_write(arena, le32_to_cpu(log_new.lba),
3ae3d67b 524 le32_to_cpu(log_new.new_map), 0, 0, 0);
5212e11f
VV
525 if (ret)
526 return ret;
527 }
528
529 }
530
531 return 0;
532}
533
534static int btt_rtt_init(struct arena_info *arena)
535{
536 arena->rtt = kcalloc(arena->nfree, sizeof(u32), GFP_KERNEL);
537 if (arena->rtt == NULL)
538 return -ENOMEM;
539
540 return 0;
541}
542
543static int btt_maplocks_init(struct arena_info *arena)
544{
545 u32 i;
546
547 arena->map_locks = kcalloc(arena->nfree, sizeof(struct aligned_lock),
548 GFP_KERNEL);
549 if (!arena->map_locks)
550 return -ENOMEM;
551
552 for (i = 0; i < arena->nfree; i++)
553 spin_lock_init(&arena->map_locks[i].lock);
554
555 return 0;
556}
557
558static struct arena_info *alloc_arena(struct btt *btt, size_t size,
559 size_t start, size_t arena_off)
560{
561 struct arena_info *arena;
562 u64 logsize, mapsize, datasize;
563 u64 available = size;
564
565 arena = kzalloc(sizeof(struct arena_info), GFP_KERNEL);
566 if (!arena)
567 return NULL;
568 arena->nd_btt = btt->nd_btt;
569
570 if (!size)
571 return arena;
572
573 arena->size = size;
574 arena->external_lba_start = start;
575 arena->external_lbasize = btt->lbasize;
576 arena->internal_lbasize = roundup(arena->external_lbasize,
577 INT_LBASIZE_ALIGNMENT);
578 arena->nfree = BTT_DEFAULT_NFREE;
14e49454
VV
579 arena->version_major = btt->nd_btt->version_major;
580 arena->version_minor = btt->nd_btt->version_minor;
5212e11f
VV
581
582 if (available % BTT_PG_SIZE)
583 available -= (available % BTT_PG_SIZE);
584
585 /* Two pages are reserved for the super block and its copy */
586 available -= 2 * BTT_PG_SIZE;
587
588 /* The log takes a fixed amount of space based on nfree */
589 logsize = roundup(2 * arena->nfree * sizeof(struct log_entry),
590 BTT_PG_SIZE);
591 available -= logsize;
592
593 /* Calculate optimal split between map and data area */
594 arena->internal_nlba = div_u64(available - BTT_PG_SIZE,
595 arena->internal_lbasize + MAP_ENT_SIZE);
596 arena->external_nlba = arena->internal_nlba - arena->nfree;
597
598 mapsize = roundup((arena->external_nlba * MAP_ENT_SIZE), BTT_PG_SIZE);
599 datasize = available - mapsize;
600
601 /* 'Absolute' values, relative to start of storage space */
602 arena->infooff = arena_off;
603 arena->dataoff = arena->infooff + BTT_PG_SIZE;
604 arena->mapoff = arena->dataoff + datasize;
605 arena->logoff = arena->mapoff + mapsize;
606 arena->info2off = arena->logoff + logsize;
607 return arena;
608}
609
610static void free_arenas(struct btt *btt)
611{
612 struct arena_info *arena, *next;
613
614 list_for_each_entry_safe(arena, next, &btt->arena_list, list) {
615 list_del(&arena->list);
616 kfree(arena->rtt);
617 kfree(arena->map_locks);
618 kfree(arena->freelist);
619 debugfs_remove_recursive(arena->debugfs_dir);
620 kfree(arena);
621 }
622}
623
5212e11f
VV
624/*
625 * This function reads an existing valid btt superblock and
626 * populates the corresponding arena_info struct
627 */
628static void parse_arena_meta(struct arena_info *arena, struct btt_sb *super,
629 u64 arena_off)
630{
631 arena->internal_nlba = le32_to_cpu(super->internal_nlba);
632 arena->internal_lbasize = le32_to_cpu(super->internal_lbasize);
633 arena->external_nlba = le32_to_cpu(super->external_nlba);
634 arena->external_lbasize = le32_to_cpu(super->external_lbasize);
635 arena->nfree = le32_to_cpu(super->nfree);
636 arena->version_major = le16_to_cpu(super->version_major);
637 arena->version_minor = le16_to_cpu(super->version_minor);
638
639 arena->nextoff = (super->nextoff == 0) ? 0 : (arena_off +
640 le64_to_cpu(super->nextoff));
641 arena->infooff = arena_off;
642 arena->dataoff = arena_off + le64_to_cpu(super->dataoff);
643 arena->mapoff = arena_off + le64_to_cpu(super->mapoff);
644 arena->logoff = arena_off + le64_to_cpu(super->logoff);
645 arena->info2off = arena_off + le64_to_cpu(super->info2off);
646
5e329406
DW
647 arena->size = (le64_to_cpu(super->nextoff) > 0)
648 ? (le64_to_cpu(super->nextoff))
649 : (arena->info2off - arena->infooff + BTT_PG_SIZE);
5212e11f
VV
650
651 arena->flags = le32_to_cpu(super->flags);
652}
653
654static int discover_arenas(struct btt *btt)
655{
656 int ret = 0;
657 struct arena_info *arena;
658 struct btt_sb *super;
659 size_t remaining = btt->rawsize;
660 u64 cur_nlba = 0;
661 size_t cur_off = 0;
662 int num_arenas = 0;
663
664 super = kzalloc(sizeof(*super), GFP_KERNEL);
665 if (!super)
666 return -ENOMEM;
667
668 while (remaining) {
669 /* Alloc memory for arena */
670 arena = alloc_arena(btt, 0, 0, 0);
671 if (!arena) {
672 ret = -ENOMEM;
673 goto out_super;
674 }
675
676 arena->infooff = cur_off;
677 ret = btt_info_read(arena, super);
678 if (ret)
679 goto out;
680
ab45e763 681 if (!nd_btt_arena_is_valid(btt->nd_btt, super)) {
5212e11f
VV
682 if (remaining == btt->rawsize) {
683 btt->init_state = INIT_NOTFOUND;
684 dev_info(to_dev(arena), "No existing arenas\n");
685 goto out;
686 } else {
e6be2dcb 687 dev_err(to_dev(arena),
5212e11f
VV
688 "Found corrupted metadata!\n");
689 ret = -ENODEV;
690 goto out;
691 }
692 }
693
694 arena->external_lba_start = cur_nlba;
695 parse_arena_meta(arena, super, cur_off);
696
697 ret = btt_freelist_init(arena);
698 if (ret)
699 goto out;
700
701 ret = btt_rtt_init(arena);
702 if (ret)
703 goto out;
704
705 ret = btt_maplocks_init(arena);
706 if (ret)
707 goto out;
708
709 list_add_tail(&arena->list, &btt->arena_list);
710
711 remaining -= arena->size;
712 cur_off += arena->size;
713 cur_nlba += arena->external_nlba;
714 num_arenas++;
715
716 if (arena->nextoff == 0)
717 break;
718 }
719 btt->num_arenas = num_arenas;
720 btt->nlba = cur_nlba;
721 btt->init_state = INIT_READY;
722
723 kfree(super);
724 return ret;
725
726 out:
727 kfree(arena);
728 free_arenas(btt);
729 out_super:
730 kfree(super);
731 return ret;
732}
733
734static int create_arenas(struct btt *btt)
735{
736 size_t remaining = btt->rawsize;
737 size_t cur_off = 0;
738
739 while (remaining) {
740 struct arena_info *arena;
741 size_t arena_size = min_t(u64, ARENA_MAX_SIZE, remaining);
742
743 remaining -= arena_size;
744 if (arena_size < ARENA_MIN_SIZE)
745 break;
746
747 arena = alloc_arena(btt, arena_size, btt->nlba, cur_off);
748 if (!arena) {
749 free_arenas(btt);
750 return -ENOMEM;
751 }
752 btt->nlba += arena->external_nlba;
753 if (remaining >= ARENA_MIN_SIZE)
754 arena->nextoff = arena->size;
755 else
756 arena->nextoff = 0;
757 cur_off += arena_size;
758 list_add_tail(&arena->list, &btt->arena_list);
759 }
760
761 return 0;
762}
763
764/*
765 * This function completes arena initialization by writing
766 * all the metadata.
767 * It is only called for an uninitialized arena when a write
768 * to that arena occurs for the first time.
769 */
fbde1414 770static int btt_arena_write_layout(struct arena_info *arena)
5212e11f
VV
771{
772 int ret;
e1455744 773 u64 sum;
5212e11f 774 struct btt_sb *super;
fbde1414 775 struct nd_btt *nd_btt = arena->nd_btt;
6ec68954 776 const u8 *parent_uuid = nd_dev_to_uuid(&nd_btt->ndns->dev);
5212e11f
VV
777
778 ret = btt_map_init(arena);
779 if (ret)
780 return ret;
781
782 ret = btt_log_init(arena);
783 if (ret)
784 return ret;
785
786 super = kzalloc(sizeof(struct btt_sb), GFP_NOIO);
787 if (!super)
788 return -ENOMEM;
789
790 strncpy(super->signature, BTT_SIG, BTT_SIG_LEN);
fbde1414 791 memcpy(super->uuid, nd_btt->uuid, 16);
6ec68954 792 memcpy(super->parent_uuid, parent_uuid, 16);
5212e11f
VV
793 super->flags = cpu_to_le32(arena->flags);
794 super->version_major = cpu_to_le16(arena->version_major);
795 super->version_minor = cpu_to_le16(arena->version_minor);
796 super->external_lbasize = cpu_to_le32(arena->external_lbasize);
797 super->external_nlba = cpu_to_le32(arena->external_nlba);
798 super->internal_lbasize = cpu_to_le32(arena->internal_lbasize);
799 super->internal_nlba = cpu_to_le32(arena->internal_nlba);
800 super->nfree = cpu_to_le32(arena->nfree);
801 super->infosize = cpu_to_le32(sizeof(struct btt_sb));
802 super->nextoff = cpu_to_le64(arena->nextoff);
803 /*
804 * Subtract arena->infooff (arena start) so numbers are relative
805 * to 'this' arena
806 */
807 super->dataoff = cpu_to_le64(arena->dataoff - arena->infooff);
808 super->mapoff = cpu_to_le64(arena->mapoff - arena->infooff);
809 super->logoff = cpu_to_le64(arena->logoff - arena->infooff);
810 super->info2off = cpu_to_le64(arena->info2off - arena->infooff);
811
812 super->flags = 0;
e1455744
DW
813 sum = nd_sb_checksum((struct nd_gen_sb *) super);
814 super->checksum = cpu_to_le64(sum);
5212e11f
VV
815
816 ret = btt_info_write(arena, super);
817
818 kfree(super);
819 return ret;
820}
821
822/*
823 * This function completes the initialization for the BTT namespace
824 * such that it is ready to accept IOs
825 */
826static int btt_meta_init(struct btt *btt)
827{
828 int ret = 0;
829 struct arena_info *arena;
830
831 mutex_lock(&btt->init_lock);
832 list_for_each_entry(arena, &btt->arena_list, list) {
fbde1414 833 ret = btt_arena_write_layout(arena);
5212e11f
VV
834 if (ret)
835 goto unlock;
836
837 ret = btt_freelist_init(arena);
838 if (ret)
839 goto unlock;
840
841 ret = btt_rtt_init(arena);
842 if (ret)
843 goto unlock;
844
845 ret = btt_maplocks_init(arena);
846 if (ret)
847 goto unlock;
848 }
849
850 btt->init_state = INIT_READY;
851
852 unlock:
853 mutex_unlock(&btt->init_lock);
854 return ret;
855}
856
41cd8b70
VV
857static u32 btt_meta_size(struct btt *btt)
858{
859 return btt->lbasize - btt->sector_size;
860}
861
5212e11f
VV
862/*
863 * This function calculates the arena in which the given LBA lies
864 * by doing a linear walk. This is acceptable since we expect only
865 * a few arenas. If we have backing devices that get much larger,
866 * we can construct a balanced binary tree of arenas at init time
867 * so that this range search becomes faster.
868 */
869static int lba_to_arena(struct btt *btt, sector_t sector, __u32 *premap,
870 struct arena_info **arena)
871{
872 struct arena_info *arena_list;
873 __u64 lba = div_u64(sector << SECTOR_SHIFT, btt->sector_size);
874
875 list_for_each_entry(arena_list, &btt->arena_list, list) {
876 if (lba < arena_list->external_nlba) {
877 *arena = arena_list;
878 *premap = lba;
879 return 0;
880 }
881 lba -= arena_list->external_nlba;
882 }
883
884 return -EIO;
885}
886
887/*
888 * The following (lock_map, unlock_map) are mostly just to improve
889 * readability, since they index into an array of locks
890 */
891static void lock_map(struct arena_info *arena, u32 premap)
892 __acquires(&arena->map_locks[idx].lock)
893{
894 u32 idx = (premap * MAP_ENT_SIZE / L1_CACHE_BYTES) % arena->nfree;
895
896 spin_lock(&arena->map_locks[idx].lock);
897}
898
899static void unlock_map(struct arena_info *arena, u32 premap)
900 __releases(&arena->map_locks[idx].lock)
901{
902 u32 idx = (premap * MAP_ENT_SIZE / L1_CACHE_BYTES) % arena->nfree;
903
904 spin_unlock(&arena->map_locks[idx].lock);
905}
906
907static u64 to_namespace_offset(struct arena_info *arena, u64 lba)
908{
909 return arena->dataoff + ((u64)lba * arena->internal_lbasize);
910}
911
912static int btt_data_read(struct arena_info *arena, struct page *page,
913 unsigned int off, u32 lba, u32 len)
914{
915 int ret;
916 u64 nsoff = to_namespace_offset(arena, lba);
917 void *mem = kmap_atomic(page);
918
3ae3d67b 919 ret = arena_read_bytes(arena, nsoff, mem + off, len, NVDIMM_IO_ATOMIC);
5212e11f
VV
920 kunmap_atomic(mem);
921
922 return ret;
923}
924
925static int btt_data_write(struct arena_info *arena, u32 lba,
926 struct page *page, unsigned int off, u32 len)
927{
928 int ret;
929 u64 nsoff = to_namespace_offset(arena, lba);
930 void *mem = kmap_atomic(page);
931
3ae3d67b 932 ret = arena_write_bytes(arena, nsoff, mem + off, len, NVDIMM_IO_ATOMIC);
5212e11f
VV
933 kunmap_atomic(mem);
934
935 return ret;
936}
937
938static void zero_fill_data(struct page *page, unsigned int off, u32 len)
939{
940 void *mem = kmap_atomic(page);
941
942 memset(mem + off, 0, len);
943 kunmap_atomic(mem);
944}
945
41cd8b70
VV
946#ifdef CONFIG_BLK_DEV_INTEGRITY
947static int btt_rw_integrity(struct btt *btt, struct bio_integrity_payload *bip,
948 struct arena_info *arena, u32 postmap, int rw)
949{
950 unsigned int len = btt_meta_size(btt);
951 u64 meta_nsoff;
952 int ret = 0;
953
954 if (bip == NULL)
955 return 0;
956
957 meta_nsoff = to_namespace_offset(arena, postmap) + btt->sector_size;
958
959 while (len) {
960 unsigned int cur_len;
961 struct bio_vec bv;
962 void *mem;
963
964 bv = bvec_iter_bvec(bip->bip_vec, bip->bip_iter);
965 /*
966 * The 'bv' obtained from bvec_iter_bvec has its .bv_len and
967 * .bv_offset already adjusted for iter->bi_bvec_done, and we
968 * can use those directly
969 */
970
971 cur_len = min(len, bv.bv_len);
972 mem = kmap_atomic(bv.bv_page);
973 if (rw)
974 ret = arena_write_bytes(arena, meta_nsoff,
3ae3d67b
VV
975 mem + bv.bv_offset, cur_len,
976 NVDIMM_IO_ATOMIC);
41cd8b70
VV
977 else
978 ret = arena_read_bytes(arena, meta_nsoff,
3ae3d67b
VV
979 mem + bv.bv_offset, cur_len,
980 NVDIMM_IO_ATOMIC);
41cd8b70
VV
981
982 kunmap_atomic(mem);
983 if (ret)
984 return ret;
985
986 len -= cur_len;
987 meta_nsoff += cur_len;
b1fb2c52
DM
988 if (!bvec_iter_advance(bip->bip_vec, &bip->bip_iter, cur_len))
989 return -EIO;
41cd8b70
VV
990 }
991
992 return ret;
993}
994
995#else /* CONFIG_BLK_DEV_INTEGRITY */
996static int btt_rw_integrity(struct btt *btt, struct bio_integrity_payload *bip,
997 struct arena_info *arena, u32 postmap, int rw)
998{
999 return 0;
1000}
1001#endif
1002
1003static int btt_read_pg(struct btt *btt, struct bio_integrity_payload *bip,
1004 struct page *page, unsigned int off, sector_t sector,
1005 unsigned int len)
5212e11f
VV
1006{
1007 int ret = 0;
1008 int t_flag, e_flag;
1009 struct arena_info *arena = NULL;
1010 u32 lane = 0, premap, postmap;
1011
1012 while (len) {
1013 u32 cur_len;
1014
1015 lane = nd_region_acquire_lane(btt->nd_region);
1016
1017 ret = lba_to_arena(btt, sector, &premap, &arena);
1018 if (ret)
1019 goto out_lane;
1020
1021 cur_len = min(btt->sector_size, len);
1022
3ae3d67b
VV
1023 ret = btt_map_read(arena, premap, &postmap, &t_flag, &e_flag,
1024 NVDIMM_IO_ATOMIC);
5212e11f
VV
1025 if (ret)
1026 goto out_lane;
1027
1028 /*
1029 * We loop to make sure that the post map LBA didn't change
1030 * from under us between writing the RTT and doing the actual
1031 * read.
1032 */
1033 while (1) {
1034 u32 new_map;
1035
1036 if (t_flag) {
1037 zero_fill_data(page, off, cur_len);
1038 goto out_lane;
1039 }
1040
1041 if (e_flag) {
1042 ret = -EIO;
1043 goto out_lane;
1044 }
1045
1046 arena->rtt[lane] = RTT_VALID | postmap;
1047 /*
1048 * Barrier to make sure this write is not reordered
1049 * to do the verification map_read before the RTT store
1050 */
1051 barrier();
1052
1053 ret = btt_map_read(arena, premap, &new_map, &t_flag,
3ae3d67b 1054 &e_flag, NVDIMM_IO_ATOMIC);
5212e11f
VV
1055 if (ret)
1056 goto out_rtt;
1057
1058 if (postmap == new_map)
1059 break;
1060
1061 postmap = new_map;
1062 }
1063
1064 ret = btt_data_read(arena, page, off, postmap, cur_len);
1065 if (ret)
1066 goto out_rtt;
1067
41cd8b70
VV
1068 if (bip) {
1069 ret = btt_rw_integrity(btt, bip, arena, postmap, READ);
1070 if (ret)
1071 goto out_rtt;
1072 }
1073
5212e11f
VV
1074 arena->rtt[lane] = RTT_INVALID;
1075 nd_region_release_lane(btt->nd_region, lane);
1076
1077 len -= cur_len;
1078 off += cur_len;
1079 sector += btt->sector_size >> SECTOR_SHIFT;
1080 }
1081
1082 return 0;
1083
1084 out_rtt:
1085 arena->rtt[lane] = RTT_INVALID;
1086 out_lane:
1087 nd_region_release_lane(btt->nd_region, lane);
1088 return ret;
1089}
1090
41cd8b70
VV
1091static int btt_write_pg(struct btt *btt, struct bio_integrity_payload *bip,
1092 sector_t sector, struct page *page, unsigned int off,
1093 unsigned int len)
5212e11f
VV
1094{
1095 int ret = 0;
1096 struct arena_info *arena = NULL;
1097 u32 premap = 0, old_postmap, new_postmap, lane = 0, i;
1098 struct log_entry log;
1099 int sub;
1100
1101 while (len) {
1102 u32 cur_len;
1103
1104 lane = nd_region_acquire_lane(btt->nd_region);
1105
1106 ret = lba_to_arena(btt, sector, &premap, &arena);
1107 if (ret)
1108 goto out_lane;
1109 cur_len = min(btt->sector_size, len);
1110
1111 if ((arena->flags & IB_FLAG_ERROR_MASK) != 0) {
1112 ret = -EIO;
1113 goto out_lane;
1114 }
1115
1116 new_postmap = arena->freelist[lane].block;
1117
1118 /* Wait if the new block is being read from */
1119 for (i = 0; i < arena->nfree; i++)
1120 while (arena->rtt[i] == (RTT_VALID | new_postmap))
1121 cpu_relax();
1122
1123
1124 if (new_postmap >= arena->internal_nlba) {
1125 ret = -EIO;
1126 goto out_lane;
41cd8b70
VV
1127 }
1128
1129 ret = btt_data_write(arena, new_postmap, page, off, cur_len);
5212e11f
VV
1130 if (ret)
1131 goto out_lane;
1132
41cd8b70
VV
1133 if (bip) {
1134 ret = btt_rw_integrity(btt, bip, arena, new_postmap,
1135 WRITE);
1136 if (ret)
1137 goto out_lane;
1138 }
1139
5212e11f 1140 lock_map(arena, premap);
3ae3d67b
VV
1141 ret = btt_map_read(arena, premap, &old_postmap, NULL, NULL,
1142 NVDIMM_IO_ATOMIC);
5212e11f
VV
1143 if (ret)
1144 goto out_map;
1145 if (old_postmap >= arena->internal_nlba) {
1146 ret = -EIO;
1147 goto out_map;
1148 }
1149
1150 log.lba = cpu_to_le32(premap);
1151 log.old_map = cpu_to_le32(old_postmap);
1152 log.new_map = cpu_to_le32(new_postmap);
1153 log.seq = cpu_to_le32(arena->freelist[lane].seq);
1154 sub = arena->freelist[lane].sub;
1155 ret = btt_flog_write(arena, lane, sub, &log);
1156 if (ret)
1157 goto out_map;
1158
3ae3d67b 1159 ret = btt_map_write(arena, premap, new_postmap, 0, 0, 0);
5212e11f
VV
1160 if (ret)
1161 goto out_map;
1162
1163 unlock_map(arena, premap);
1164 nd_region_release_lane(btt->nd_region, lane);
1165
1166 len -= cur_len;
1167 off += cur_len;
1168 sector += btt->sector_size >> SECTOR_SHIFT;
1169 }
1170
1171 return 0;
1172
1173 out_map:
1174 unlock_map(arena, premap);
1175 out_lane:
1176 nd_region_release_lane(btt->nd_region, lane);
1177 return ret;
1178}
1179
41cd8b70
VV
1180static int btt_do_bvec(struct btt *btt, struct bio_integrity_payload *bip,
1181 struct page *page, unsigned int len, unsigned int off,
c11f0c0b 1182 bool is_write, sector_t sector)
5212e11f
VV
1183{
1184 int ret;
1185
c11f0c0b 1186 if (!is_write) {
41cd8b70 1187 ret = btt_read_pg(btt, bip, page, off, sector, len);
5212e11f
VV
1188 flush_dcache_page(page);
1189 } else {
1190 flush_dcache_page(page);
41cd8b70 1191 ret = btt_write_pg(btt, bip, sector, page, off, len);
5212e11f
VV
1192 }
1193
1194 return ret;
1195}
1196
dece1635 1197static blk_qc_t btt_make_request(struct request_queue *q, struct bio *bio)
5212e11f 1198{
41cd8b70 1199 struct bio_integrity_payload *bip = bio_integrity(bio);
5212e11f
VV
1200 struct btt *btt = q->queuedata;
1201 struct bvec_iter iter;
f0dc089c 1202 unsigned long start;
5212e11f 1203 struct bio_vec bvec;
abf54548 1204 int err = 0;
f0dc089c 1205 bool do_acct;
5212e11f 1206
e23947bd
DM
1207 if (!bio_integrity_prep(bio))
1208 return BLK_QC_T_NONE;
41cd8b70 1209
f0dc089c 1210 do_acct = nd_iostat_start(bio, &start);
5212e11f
VV
1211 bio_for_each_segment(bvec, bio, iter) {
1212 unsigned int len = bvec.bv_len;
1213
1214 BUG_ON(len > PAGE_SIZE);
1215 /* Make sure len is in multiples of sector size. */
1216 /* XXX is this right? */
1217 BUG_ON(len < btt->sector_size);
1218 BUG_ON(len % btt->sector_size);
1219
41cd8b70 1220 err = btt_do_bvec(btt, bip, bvec.bv_page, len, bvec.bv_offset,
c11f0c0b 1221 op_is_write(bio_op(bio)), iter.bi_sector);
5212e11f 1222 if (err) {
e6be2dcb 1223 dev_err(&btt->nd_btt->dev,
5212e11f 1224 "io error in %s sector %lld, len %d,\n",
abf54548
MC
1225 (op_is_write(bio_op(bio))) ? "WRITE" :
1226 "READ",
5212e11f 1227 (unsigned long long) iter.bi_sector, len);
4e4cbee9 1228 bio->bi_status = errno_to_blk_status(err);
f0dc089c 1229 break;
5212e11f
VV
1230 }
1231 }
f0dc089c
DW
1232 if (do_acct)
1233 nd_iostat_end(bio, start);
5212e11f 1234
4246a0b6 1235 bio_endio(bio);
dece1635 1236 return BLK_QC_T_NONE;
5212e11f
VV
1237}
1238
1239static int btt_rw_page(struct block_device *bdev, sector_t sector,
c11f0c0b 1240 struct page *page, bool is_write)
5212e11f
VV
1241{
1242 struct btt *btt = bdev->bd_disk->private_data;
c13c43d5 1243 int rc;
98cc093c 1244 unsigned int len;
5212e11f 1245
98cc093c
HY
1246 len = hpage_nr_pages(page) * PAGE_SIZE;
1247 rc = btt_do_bvec(btt, NULL, page, len, 0, is_write, sector);
c13c43d5
VV
1248 if (rc == 0)
1249 page_endio(page, is_write, 0);
1250
1251 return rc;
5212e11f
VV
1252}
1253
1254
1255static int btt_getgeo(struct block_device *bd, struct hd_geometry *geo)
1256{
1257 /* some standard values */
1258 geo->heads = 1 << 6;
1259 geo->sectors = 1 << 5;
1260 geo->cylinders = get_capacity(bd->bd_disk) >> 11;
1261 return 0;
1262}
1263
1264static const struct block_device_operations btt_fops = {
1265 .owner = THIS_MODULE,
1266 .rw_page = btt_rw_page,
1267 .getgeo = btt_getgeo,
58138820 1268 .revalidate_disk = nvdimm_revalidate_disk,
5212e11f
VV
1269};
1270
1271static int btt_blk_init(struct btt *btt)
1272{
1273 struct nd_btt *nd_btt = btt->nd_btt;
1274 struct nd_namespace_common *ndns = nd_btt->ndns;
1275
1276 /* create a new disk and request queue for btt */
1277 btt->btt_queue = blk_alloc_queue(GFP_KERNEL);
1278 if (!btt->btt_queue)
1279 return -ENOMEM;
1280
1281 btt->btt_disk = alloc_disk(0);
1282 if (!btt->btt_disk) {
1283 blk_cleanup_queue(btt->btt_queue);
1284 return -ENOMEM;
1285 }
1286
1287 nvdimm_namespace_disk_name(ndns, btt->btt_disk->disk_name);
5212e11f
VV
1288 btt->btt_disk->first_minor = 0;
1289 btt->btt_disk->fops = &btt_fops;
1290 btt->btt_disk->private_data = btt;
1291 btt->btt_disk->queue = btt->btt_queue;
1292 btt->btt_disk->flags = GENHD_FL_EXT_DEVT;
1293
1294 blk_queue_make_request(btt->btt_queue, btt_make_request);
1295 blk_queue_logical_block_size(btt->btt_queue, btt->sector_size);
1296 blk_queue_max_hw_sectors(btt->btt_queue, UINT_MAX);
5212e11f
VV
1297 queue_flag_set_unlocked(QUEUE_FLAG_NONROT, btt->btt_queue);
1298 btt->btt_queue->queuedata = btt;
1299
41cd8b70 1300 set_capacity(btt->btt_disk, 0);
0d52c756 1301 device_add_disk(&btt->nd_btt->dev, btt->btt_disk);
41cd8b70
VV
1302 if (btt_meta_size(btt)) {
1303 int rc = nd_integrity_init(btt->btt_disk, btt_meta_size(btt));
1304
1305 if (rc) {
1306 del_gendisk(btt->btt_disk);
1307 put_disk(btt->btt_disk);
1308 blk_cleanup_queue(btt->btt_queue);
1309 return rc;
1310 }
1311 }
1312 set_capacity(btt->btt_disk, btt->nlba * btt->sector_size >> 9);
abe8b4e3 1313 btt->nd_btt->size = btt->nlba * (u64)btt->sector_size;
58138820 1314 revalidate_disk(btt->btt_disk);
5212e11f
VV
1315
1316 return 0;
1317}
1318
1319static void btt_blk_cleanup(struct btt *btt)
1320{
1321 del_gendisk(btt->btt_disk);
1322 put_disk(btt->btt_disk);
1323 blk_cleanup_queue(btt->btt_queue);
1324}
1325
1326/**
1327 * btt_init - initialize a block translation table for the given device
1328 * @nd_btt: device with BTT geometry and backing device info
1329 * @rawsize: raw size in bytes of the backing device
1330 * @lbasize: lba size of the backing device
1331 * @uuid: A uuid for the backing device - this is stored on media
1332 * @maxlane: maximum number of parallel requests the device can handle
1333 *
1334 * Initialize a Block Translation Table on a backing device to provide
1335 * single sector power fail atomicity.
1336 *
1337 * Context:
1338 * Might sleep.
1339 *
1340 * Returns:
1341 * Pointer to a new struct btt on success, NULL on failure.
1342 */
1343static struct btt *btt_init(struct nd_btt *nd_btt, unsigned long long rawsize,
1344 u32 lbasize, u8 *uuid, struct nd_region *nd_region)
1345{
1346 int ret;
1347 struct btt *btt;
1348 struct device *dev = &nd_btt->dev;
1349
e32bc729 1350 btt = devm_kzalloc(dev, sizeof(struct btt), GFP_KERNEL);
5212e11f
VV
1351 if (!btt)
1352 return NULL;
1353
1354 btt->nd_btt = nd_btt;
1355 btt->rawsize = rawsize;
1356 btt->lbasize = lbasize;
1357 btt->sector_size = ((lbasize >= 4096) ? 4096 : 512);
1358 INIT_LIST_HEAD(&btt->arena_list);
1359 mutex_init(&btt->init_lock);
1360 btt->nd_region = nd_region;
1361
1362 ret = discover_arenas(btt);
1363 if (ret) {
1364 dev_err(dev, "init: error in arena_discover: %d\n", ret);
e32bc729 1365 return NULL;
5212e11f
VV
1366 }
1367
58138820 1368 if (btt->init_state != INIT_READY && nd_region->ro) {
e6be2dcb 1369 dev_warn(dev, "%s is read-only, unable to init btt metadata\n",
58138820 1370 dev_name(&nd_region->dev));
e32bc729 1371 return NULL;
58138820 1372 } else if (btt->init_state != INIT_READY) {
5212e11f
VV
1373 btt->num_arenas = (rawsize / ARENA_MAX_SIZE) +
1374 ((rawsize % ARENA_MAX_SIZE) ? 1 : 0);
1375 dev_dbg(dev, "init: %d arenas for %llu rawsize\n",
1376 btt->num_arenas, rawsize);
1377
1378 ret = create_arenas(btt);
1379 if (ret) {
1380 dev_info(dev, "init: create_arenas: %d\n", ret);
e32bc729 1381 return NULL;
5212e11f
VV
1382 }
1383
1384 ret = btt_meta_init(btt);
1385 if (ret) {
1386 dev_err(dev, "init: error in meta_init: %d\n", ret);
e32bc729 1387 return NULL;
5212e11f
VV
1388 }
1389 }
1390
1391 ret = btt_blk_init(btt);
1392 if (ret) {
1393 dev_err(dev, "init: error in blk_init: %d\n", ret);
e32bc729 1394 return NULL;
5212e11f
VV
1395 }
1396
1397 btt_debugfs_init(btt);
1398
1399 return btt;
5212e11f
VV
1400}
1401
1402/**
1403 * btt_fini - de-initialize a BTT
1404 * @btt: the BTT handle that was generated by btt_init
1405 *
1406 * De-initialize a Block Translation Table on device removal
1407 *
1408 * Context:
1409 * Might sleep.
1410 */
1411static void btt_fini(struct btt *btt)
1412{
1413 if (btt) {
1414 btt_blk_cleanup(btt);
1415 free_arenas(btt);
1416 debugfs_remove_recursive(btt->debugfs_dir);
5212e11f
VV
1417 }
1418}
1419
1420int nvdimm_namespace_attach_btt(struct nd_namespace_common *ndns)
1421{
1422 struct nd_btt *nd_btt = to_nd_btt(ndns->claim);
1423 struct nd_region *nd_region;
14e49454 1424 struct btt_sb *btt_sb;
5212e11f
VV
1425 struct btt *btt;
1426 size_t rawsize;
1427
9dec4892
DW
1428 if (!nd_btt->uuid || !nd_btt->ndns || !nd_btt->lbasize) {
1429 dev_dbg(&nd_btt->dev, "incomplete btt configuration\n");
5212e11f 1430 return -ENODEV;
9dec4892 1431 }
5212e11f 1432
14e49454
VV
1433 btt_sb = devm_kzalloc(&nd_btt->dev, sizeof(*btt_sb), GFP_KERNEL);
1434
1435 /*
1436 * If this returns < 0, that is ok as it just means there wasn't
1437 * an existing BTT, and we're creating a new one. We still need to
1438 * call this as we need the version dependent fields in nd_btt to be
1439 * set correctly based on the holder class
1440 */
1441 nd_btt_version(nd_btt, ndns, btt_sb);
1442
1443 rawsize = nvdimm_namespace_capacity(ndns) - nd_btt->initial_offset;
5212e11f 1444 if (rawsize < ARENA_MIN_SIZE) {
9dec4892 1445 dev_dbg(&nd_btt->dev, "%s must be at least %ld bytes\n",
14e49454
VV
1446 dev_name(&ndns->dev),
1447 ARENA_MIN_SIZE + nd_btt->initial_offset);
5212e11f
VV
1448 return -ENXIO;
1449 }
1450 nd_region = to_nd_region(nd_btt->dev.parent);
1451 btt = btt_init(nd_btt, rawsize, nd_btt->lbasize, nd_btt->uuid,
1452 nd_region);
1453 if (!btt)
1454 return -ENOMEM;
1455 nd_btt->btt = btt;
1456
1457 return 0;
1458}
1459EXPORT_SYMBOL(nvdimm_namespace_attach_btt);
1460
298f2bc5 1461int nvdimm_namespace_detach_btt(struct nd_btt *nd_btt)
5212e11f 1462{
5212e11f
VV
1463 struct btt *btt = nd_btt->btt;
1464
1465 btt_fini(btt);
1466 nd_btt->btt = NULL;
1467
1468 return 0;
1469}
1470EXPORT_SYMBOL(nvdimm_namespace_detach_btt);
1471
1472static int __init nd_btt_init(void)
1473{
ff8e92d5 1474 int rc = 0;
5212e11f
VV
1475
1476 debugfs_root = debugfs_create_dir("btt", NULL);
ff8e92d5 1477 if (IS_ERR_OR_NULL(debugfs_root))
5212e11f 1478 rc = -ENXIO;
5212e11f
VV
1479
1480 return rc;
1481}
1482
1483static void __exit nd_btt_exit(void)
1484{
1485 debugfs_remove_recursive(debugfs_root);
5212e11f
VV
1486}
1487
1488MODULE_ALIAS_ND_DEVICE(ND_DEVICE_BTT);
1489MODULE_AUTHOR("Vishal Verma <vishal.l.verma@linux.intel.com>");
1490MODULE_LICENSE("GPL v2");
1491module_init(nd_btt_init);
1492module_exit(nd_btt_exit);