-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathballoc.c
1092 lines (939 loc) · 29.8 KB
/
balloc.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* NOVA persistent memory management
*
* Copyright 2015-2016 Regents of the University of California,
* UCSD Non-Volatile Systems Lab, Andiry Xu <[email protected]>
* Copyright 2012-2013 Intel Corporation
* Copyright 2009-2011 Marco Stornelli <[email protected]>
* Copyright 2003 Sony Corporation
* Copyright 2003 Matsushita Electric Industrial Co., Ltd.
* 2003-2004 (c) MontaVista Software, Inc. , Steve Longerbeam
*
* This program is free software; you can redistribute it and/or modify it
* under the terms and conditions of the GNU General Public License,
* version 2, as published by the Free Software Foundation.
*
* This program is distributed in the hope it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
* more details.
*
* You should have received a copy of the GNU General Public License along with
* this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin St - Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include <linux/fs.h>
#include <linux/bitops.h>
#include "nova.h"
#include "inode.h"
#include "entry.h"
#include "dedup.h"
int nova_alloc_block_free_lists(struct super_block *sb)
{
struct nova_sb_info *sbi = NOVA_SB(sb);
struct free_list *free_list;
int i;
sbi->free_lists = kcalloc(sbi->cpus, sizeof(struct free_list),
GFP_KERNEL);
if (!sbi->free_lists)
return -ENOMEM;
for (i = 0; i < sbi->cpus; i++) {
free_list = nova_get_free_list(sb, i);
free_list->block_free_tree = RB_ROOT;
spin_lock_init(&free_list->s_lock);
free_list->index = i;
}
return 0;
}
void nova_delete_free_lists(struct super_block *sb)
{
struct nova_sb_info *sbi = NOVA_SB(sb);
/* Each tree is freed in save_blocknode_mappings */
kfree(sbi->free_lists);
sbi->free_lists = NULL;
}
static int nova_data_csum_init_free_list(struct super_block *sb,
struct free_list *free_list)
{
struct nova_sb_info *sbi = NOVA_SB(sb);
unsigned long data_csum_blocks;
/* Allocate pages to hold data checksums. We store one checksum for
* each stripe for each page. We replicate the checksums at the
* beginning and end of per-cpu region that holds the data they cover.
*/
data_csum_blocks = ((sbi->initsize >> NOVA_STRIPE_SHIFT)
* NOVA_DATA_CSUM_LEN) >> PAGE_SHIFT;
free_list->csum_start = free_list->block_start;
free_list->block_start += data_csum_blocks / sbi->cpus;
if (data_csum_blocks % sbi->cpus)
free_list->block_start++;
free_list->num_csum_blocks =
free_list->block_start - free_list->csum_start;
free_list->replica_csum_start = free_list->block_end + 1 -
free_list->num_csum_blocks;
free_list->block_end -= free_list->num_csum_blocks;
return 0;
}
static int nova_data_parity_init_free_list(struct super_block *sb,
struct free_list *free_list)
{
struct nova_sb_info *sbi = NOVA_SB(sb);
unsigned long blocksize, total_blocks, parity_blocks;
/* Allocate blocks to store data block parity stripes.
* Always reserve in case user turns it off at init mount but later
* turns it on.
*/
blocksize = sb->s_blocksize;
total_blocks = sbi->initsize / blocksize;
parity_blocks = total_blocks / (blocksize / NOVA_STRIPE_SIZE + 1);
if (total_blocks % (blocksize / NOVA_STRIPE_SIZE + 1))
parity_blocks++;
free_list->parity_start = free_list->block_start;
free_list->block_start += parity_blocks / sbi->cpus;
if (parity_blocks % sbi->cpus)
free_list->block_start++;
free_list->num_parity_blocks =
free_list->block_start - free_list->parity_start;
free_list->replica_parity_start = free_list->block_end + 1 -
free_list->num_parity_blocks;
return 0;
}
// Initialize a free list. Each CPU gets an equal share of the block space to
// manage.
static void nova_init_free_list(struct super_block *sb,
struct free_list *free_list, int index)
{
struct nova_sb_info *sbi = NOVA_SB(sb);
unsigned long per_list_blocks;
per_list_blocks = sbi->num_blocks / sbi->cpus;
free_list->block_start = per_list_blocks * index;
free_list->block_end = free_list->block_start +
per_list_blocks - 1;
// if (index == 0)
// free_list->block_start += sbi->head_reserved_blocks;
if(free_list->block_start < sbi->head_reserved_blocks)
free_list->block_start = sbi->head_reserved_blocks;
if (index == sbi->cpus - 1)
free_list->block_end -= sbi->tail_reserved_blocks;
nova_data_csum_init_free_list(sb, free_list);
nova_data_parity_init_free_list(sb, free_list);
}
struct nova_range_node *nova_alloc_blocknode(struct super_block *sb)
{
return nova_alloc_range_node(sb);
}
void nova_free_blocknode(struct nova_range_node *node)
{
nova_free_range_node(node);
}
void nova_init_blockmap(struct super_block *sb, int recovery)
{
struct nova_sb_info *sbi = NOVA_SB(sb);
struct rb_root *tree;
struct nova_range_node *blknode;
struct free_list *free_list;
int i;
int ret;
/* Divide the block range among per-CPU free lists */
sbi->per_list_blocks = sbi->num_blocks / sbi->cpus;
for (i = 0; i < sbi->cpus; i++) {
free_list = nova_get_free_list(sb, i);
tree = &(free_list->block_free_tree);
nova_init_free_list(sb, free_list, i);
/* For recovery, update these fields later */
if (recovery == 0) {
free_list->num_free_blocks = free_list->block_end -
free_list->block_start + 1;
blknode = nova_alloc_blocknode(sb);
if (blknode == NULL)
BUG();
blknode->range_low = free_list->block_start;
blknode->range_high = free_list->block_end;
nova_update_range_node_checksum(blknode);
ret = nova_insert_blocktree(tree, blknode);
if (ret) {
nova_err(sb, "%s failed\n", __func__);
nova_free_blocknode(blknode);
return;
}
free_list->first_node = blknode;
free_list->last_node = blknode;
free_list->num_blocknode = 1;
}
nova_dbgv("%s: free list %d: block start %lu, end %lu, "
"%lu free blocks\n",
__func__, i,
free_list->block_start,
free_list->block_end,
free_list->num_free_blocks);
}
}
static inline int nova_rbtree_compare_rangenode(struct nova_range_node *curr,
unsigned long key, enum node_type type)
{
if (type == NODE_DIR) {
if (key < curr->hash)
return -1;
if (key > curr->hash)
return 1;
return 0;
}
/* Block and inode */
if (key < curr->range_low)
return -1;
if (key > curr->range_high)
return 1;
return 0;
}
int nova_find_range_node(struct rb_root *tree, unsigned long key,
enum node_type type, struct nova_range_node **ret_node)
{
struct nova_range_node *curr = NULL;
struct rb_node *temp;
int compVal;
int ret = 0;
temp = tree->rb_node;
while (temp) {
curr = container_of(temp, struct nova_range_node, node);
compVal = nova_rbtree_compare_rangenode(curr, key, type);
if (compVal == -1) {
temp = temp->rb_left;
} else if (compVal == 1) {
temp = temp->rb_right;
} else {
ret = 1;
break;
}
}
if (curr && !nova_range_node_checksum_ok(curr)) {
nova_dbg("%s: curr failed\n", __func__);
return 0;
}
*ret_node = curr;
return ret;
}
int nova_insert_range_node(struct rb_root *tree,
struct nova_range_node *new_node, enum node_type type)
{
struct nova_range_node *curr;
struct rb_node **temp, *parent;
int compVal;
temp = &(tree->rb_node);
parent = NULL;
while (*temp) {
curr = container_of(*temp, struct nova_range_node, node);
compVal = nova_rbtree_compare_rangenode(curr,
new_node->range_low, type);
parent = *temp;
if (compVal == -1) {
temp = &((*temp)->rb_left);
} else if (compVal == 1) {
temp = &((*temp)->rb_right);
} else {
nova_dbg("%s: type %d entry %lu - %lu already exists: "
"%lu - %lu\n",
__func__, type, new_node->range_low,
new_node->range_high, curr->range_low,
curr->range_high);
return -EINVAL;
}
}
rb_link_node(&new_node->node, parent, temp);
rb_insert_color(&new_node->node, tree);
return 0;
}
void nova_destroy_range_node_tree(struct super_block *sb,
struct rb_root *tree)
{
struct nova_range_node *curr;
struct rb_node *temp;
temp = rb_first(tree);
while (temp) {
curr = container_of(temp, struct nova_range_node, node);
temp = rb_next(temp);
rb_erase(&curr->node, tree);
nova_free_range_node(curr);
}
}
int nova_insert_blocktree(struct rb_root *tree,
struct nova_range_node *new_node)
{
int ret;
ret = nova_insert_range_node(tree, new_node, NODE_BLOCK);
if (ret)
nova_dbg("ERROR: %s failed %d\n", __func__, ret);
return ret;
}
/* Used for both block free tree and inode inuse tree */
int nova_find_free_slot(struct rb_root *tree, unsigned long range_low,
unsigned long range_high, struct nova_range_node **prev,
struct nova_range_node **next)
{
struct nova_range_node *ret_node = NULL;
struct rb_node *tmp;
int check_prev = 0, check_next = 0;
int ret;
ret = nova_find_range_node(tree, range_low, NODE_BLOCK, &ret_node);
if (ret) {
nova_dbg("%s ERROR: %lu - %lu already in free list\n",
__func__, range_low, range_high);
return -EINVAL;
}
if (!ret_node) {
*prev = *next = NULL;
} else if (ret_node->range_high < range_low) {
*prev = ret_node;
tmp = rb_next(&ret_node->node);
if (tmp) {
*next = container_of(tmp, struct nova_range_node, node);
check_next = 1;
} else {
*next = NULL;
}
} else if (ret_node->range_low > range_high) {
*next = ret_node;
tmp = rb_prev(&ret_node->node);
if (tmp) {
*prev = container_of(tmp, struct nova_range_node, node);
check_prev = 1;
} else {
*prev = NULL;
}
} else {
nova_dbg("%s ERROR: %lu - %lu overlaps with existing "
"node %lu - %lu\n",
__func__, range_low, range_high, ret_node->range_low,
ret_node->range_high);
return -EINVAL;
}
if (check_prev && !nova_range_node_checksum_ok(*prev)) {
nova_dbg("%s: prev failed\n", __func__);
return -EIO;
}
if (check_next && !nova_range_node_checksum_ok(*next)) {
nova_dbg("%s: next failed\n", __func__);
return -EIO;
}
return 0;
}
static int nova_free_blocks(struct super_block *sb, unsigned long blocknr,
int num, unsigned short btype, int log_page)
{
struct nova_sb_info *sbi = NOVA_SB(sb);
struct rb_root *tree;
unsigned long block_low;
unsigned long block_high;
unsigned long num_blocks = 0;
struct nova_range_node *prev = NULL;
struct nova_range_node *next = NULL;
struct nova_range_node *curr_node;
struct free_list *free_list;
int cpuid;
int new_node_used = 0;
int ret;
INIT_TIMING(free_time);
if (num <= 0) {
nova_dbg("%s ERROR: free %d\n", __func__, num);
return -EINVAL;
}
NOVA_START_TIMING(free_blocks_t, free_time);
cpuid = blocknr / sbi->per_list_blocks;
/* Pre-allocate blocknode */
curr_node = nova_alloc_blocknode(sb);
if (curr_node == NULL) {
/* returning without freeing the block*/
NOVA_END_TIMING(free_blocks_t, free_time);
return -ENOMEM;
}
free_list = nova_get_free_list(sb, cpuid);
spin_lock(&free_list->s_lock);
tree = &(free_list->block_free_tree);
num_blocks = nova_get_numblocks(btype) * num;
block_low = blocknr;
block_high = blocknr + num_blocks - 1;
nova_dbgv("Free: %lu - %lu\n", block_low, block_high);
if (blocknr < free_list->block_start ||
blocknr + num > free_list->block_end + 1) {
nova_err(sb, "free blocks %lu to %lu, free list %d, "
"start %lu, end %lu\n",
blocknr, blocknr + num - 1,
free_list->index,
free_list->block_start,
free_list->block_end);
ret = -EIO;
goto out;
}
ret = nova_find_free_slot(tree, block_low,
block_high, &prev, &next);
if (ret) {
nova_dbg("%s: find free slot fail: %d\n", __func__, ret);
goto out;
}
if (prev && next && (block_low == prev->range_high + 1) &&
(block_high + 1 == next->range_low)) {
/* fits the hole */
rb_erase(&next->node, tree);
free_list->num_blocknode--;
prev->range_high = next->range_high;
nova_update_range_node_checksum(prev);
if (free_list->last_node == next)
free_list->last_node = prev;
nova_free_blocknode(next);
goto block_found;
}
if (prev && (block_low == prev->range_high + 1)) {
/* Aligns left */
prev->range_high += num_blocks;
nova_update_range_node_checksum(prev);
goto block_found;
}
if (next && (block_high + 1 == next->range_low)) {
/* Aligns right */
next->range_low -= num_blocks;
nova_update_range_node_checksum(next);
goto block_found;
}
/* Aligns somewhere in the middle */
curr_node->range_low = block_low;
curr_node->range_high = block_high;
nova_update_range_node_checksum(curr_node);
new_node_used = 1;
ret = nova_insert_blocktree(tree, curr_node);
if (ret) {
new_node_used = 0;
goto out;
}
if (!prev)
free_list->first_node = curr_node;
if (!next)
free_list->last_node = curr_node;
free_list->num_blocknode++;
block_found:
free_list->num_free_blocks += num_blocks;
if (log_page) {
free_list->free_log_count++;
free_list->freed_log_pages += num_blocks;
} else {
free_list->free_data_count++;
free_list->freed_data_pages += num_blocks;
}
out:
spin_unlock(&free_list->s_lock);
if (new_node_used == 0)
nova_free_blocknode(curr_node);
NOVA_END_TIMING(free_blocks_t, free_time);
return ret;
}
int nova_free_data_blocks(struct super_block *sb,
struct nova_inode_info_header *sih, unsigned long blocknr, int num)
{
int ret;
struct nova_sb_info *sbi = NOVA_SB(sb);
struct nova_pmm_entry *pentry, *pentries;
u32 weak_idx;
u64 strong_idx;
int64_t to_be_free_idx = 0;
// struct nova_hentry *weak_hentry, *strong_hentry;
struct nova_hentry *weak_find_hentry, *strong_find_hentry;
bool is_free = false;
INIT_TIMING(free_time);
INIT_TIMING(hash_table_time);
nova_dbgv("Inode %lu: free %d data block from %lu to %lu\n",
sih->ino, num, blocknr, blocknr + num - 1);
if (blocknr == 0) {
nova_dbg("%s: ERROR: %lu, %d\n", __func__, blocknr, num);
return -EINVAL;
}
NOVA_START_TIMING(free_data_t, free_time);
if(sih->i_blk_type == NOVA_BLOCK_TYPE_4K) {
pentries = nova_get_block(sb, nova_get_block_off(sb, sbi->metadata_start, NOVA_BLOCK_TYPE_4K));
// kmem = nova_get_block(sb, nova_get_block_off(sb, blocknr, NOVA_BLOCK_TYPE_4K));
to_be_free_idx = sbi->blocknr_to_entry[blocknr];
if (to_be_free_idx >= 0) {
/* an entry's refcount is never changed */
pentry = pentries + to_be_free_idx;
spin_lock(sbi->non_dedup_fp_locks + to_be_free_idx % NON_DEDUP_FP_LOCK_NUM);
/* NOTE: pentry->fp_weak could be changed by calc_no_fin thread */
weak_idx = (pentry->fp_weak.u32 & ((1 << sbi->num_entries_bits) - 1));
strong_idx = (pentry->fp_strong.u64s[0] & ((1 << sbi->num_entries_bits) - 1));
spin_lock(sbi->weak_hash_table_locks + weak_idx % HASH_TABLE_LOCK_NUM);
NOVA_START_TIMING(hash_table_t, hash_table_time);
weak_find_hentry = nova_find_in_weak_hlist(sb, &sbi->weak_hash_table[weak_idx], &pentry->fp_weak);
NOVA_END_TIMING(hash_table_t, hash_table_time);
spin_lock(sbi->strong_hash_table_locks + strong_idx % HASH_TABLE_LOCK_NUM);
NOVA_START_TIMING(hash_table_t, hash_table_time);
strong_find_hentry = nova_find_in_strong_hlist(sb, &sbi->strong_hash_table[strong_idx], &pentry->fp_strong);
NOVA_END_TIMING(hash_table_t, hash_table_time);
--pentry->refcount;
if (pentry->refcount == 0) {
is_free = true;
if (strong_find_hentry) {
if (strong_find_hentry->entrynr == to_be_free_idx) {
hlist_del(&strong_find_hentry->node);
kmem_cache_free(sbi->nova_hentry_cachep, strong_find_hentry);
}
}
if (weak_find_hentry) {
if (weak_find_hentry->entrynr == to_be_free_idx) {
hlist_del(&weak_find_hentry->node);
kmem_cache_free(sbi->nova_hentry_cachep, weak_find_hentry);
}
}
pentry->blocknr = 0;
/* NON_FIN_FLAG entry is freed by background */
if (pentry->flag != NON_FIN_FLAG) {
nova_free_entry(sb, to_be_free_idx);
}
}
spin_unlock(sbi->weak_hash_table_locks + weak_idx % HASH_TABLE_LOCK_NUM);
spin_unlock(sbi->strong_hash_table_locks + strong_idx % HASH_TABLE_LOCK_NUM);
spin_unlock(sbi->non_dedup_fp_locks + to_be_free_idx % NON_DEDUP_FP_LOCK_NUM);
if (!is_free) {
return 0;
}
}
}
ret = nova_free_blocks(sb, blocknr, num, sih->i_blk_type, 0);
if (ret) {
nova_err(sb, "Inode %lu: free %d data block from %lu to %lu "
"failed!\n",
sih->ino, num, blocknr, blocknr + num - 1);
// nova_print_nova_log(sb, sih);
}
NOVA_END_TIMING(free_data_t, free_time);
return ret;
}
int nova_free_log_blocks(struct super_block *sb,
struct nova_inode_info_header *sih, unsigned long blocknr, int num)
{
int ret;
INIT_TIMING(free_time);
nova_dbgv("Inode %lu: free %d log block from %lu to %lu\n",
sih->ino, num, blocknr, blocknr + num - 1);
if (blocknr == 0) {
nova_dbg("%s: ERROR: %lu, %d\n", __func__, blocknr, num);
return -EINVAL;
}
NOVA_START_TIMING(free_log_t, free_time);
ret = nova_free_blocks(sb, blocknr, num, sih->i_blk_type, 1);
if (ret) {
nova_err(sb, "Inode %lu: free %d log block from %lu to %lu "
"failed!\n",
sih->ino, num, blocknr, blocknr + num - 1);
nova_print_nova_log(sb, sih);
}
NOVA_END_TIMING(free_log_t, free_time);
return ret;
}
static int not_enough_blocks(struct free_list *free_list,
unsigned long num_blocks, enum alloc_type atype)
{
struct nova_range_node *first = free_list->first_node;
struct nova_range_node *last = free_list->last_node;
if (free_list->num_free_blocks < num_blocks || !first || !last) {
nova_dbgv("%s: num_free_blocks=%ld; num_blocks=%ld; "
"first=0x%p; last=0x%p",
__func__, free_list->num_free_blocks, num_blocks,
first, last);
return 1;
}
if (atype == LOG &&
last->range_high - first->range_low < DEAD_ZONE_BLOCKS) {
nova_dbgv("%s: allocation would cause deadzone violation. "
"high=0x%lx, low=0x%lx, DEADZONE=%d",
__func__, last->range_high, first->range_low,
DEAD_ZONE_BLOCKS);
return 1;
}
return 0;
}
struct nova_range_node *nova_alloc_blocknode_atomic(struct super_block *sb)
{
return nova_alloc_range_node_atomic(sb);
}
#define PAGES_PER_2MB 512
#define PAGES_PER_2MB_MASK (512 - 1)
#define IS_DATABLOCKS_2MB_ALIGNED(numblocks, atype) \
(!(num_blocks & PAGES_PER_2MB_MASK) && (atype == DATA))
bool nova_alloc_superpage(struct super_block *sb,
struct free_list *free_list, unsigned long num_blocks,
unsigned long *new_blocknr, enum nova_alloc_direction from_tail)
{
struct rb_root *tree;
struct rb_node *temp;
struct nova_range_node *curr;
unsigned long curr_blocks;
bool found = 0;
unsigned long step = 0;
unsigned int left_margin;
unsigned int right_margin;
tree = &(free_list->block_free_tree);
if (from_tail == ALLOC_FROM_HEAD)
temp = &(free_list->first_node->node);
else
temp = &(free_list->last_node->node);
while (temp) {
step++;
curr = container_of(temp, struct nova_range_node, node);
if (!nova_range_node_checksum_ok(curr)) {
nova_err(sb, "%s curr failed\n", __func__);
goto next;
}
curr_blocks = curr->range_high - curr->range_low + 1;
left_margin = PAGES_PER_2MB -
(curr->range_low & PAGES_PER_2MB_MASK);
/*
* Guard against cases where:
* a. Unaligned free blocks is smaller than #512
* left_margin could larger than curr_blocks.
* b. After alignment, free blocks is smaller than
* requested blocks.
* Otherwise, we are free to go.
*/
if ((curr_blocks > left_margin) && \
(num_blocks <= (curr_blocks - left_margin))) {
struct nova_range_node *node;
unsigned long saved_range_high = curr->range_high;
*new_blocknr = curr->range_low + left_margin;
right_margin = curr_blocks - left_margin - num_blocks;
nova_dbgv("curr:%p: num_blocks:%lu curr->range_low:%lu high:%lu",
curr, num_blocks, curr->range_low, curr->range_high);
if (left_margin) {
/* Reuse "curr" and its "first_node" indicator. */
curr->range_high = curr->range_low + left_margin - 1;
nova_update_range_node_checksum(curr);
nova_dbgv("Insert node for left_margin, range_low:%lu high:%lu",
curr->range_low, curr->range_high);
}
if (right_margin) {
if (left_margin) {
/* curr was reused for left_margin node, grab new one. */
node = nova_alloc_blocknode_atomic(sb);
if (node == NULL) {
nova_warn("Failed to allocate new block node.\n");
return -ENOMEM;
}
node->range_low = curr->range_low + left_margin + num_blocks;
node->range_high = saved_range_high;
nova_update_range_node_checksum(node);
nova_insert_blocktree(tree, node);
free_list->num_blocknode++;
if (curr == free_list->last_node)
free_list->last_node = node;
} else {
/*
* curr->range_low is aligned, reuse curr for right_margin.
* Update the checksum as needed.
*/
curr->range_low = curr->range_low + num_blocks;
nova_update_range_node_checksum(curr);
}
nova_dbgv("Insert node for right_margin, range_low:%lu high:%lu",
node->range_low, node->range_high);
}
/* Catch up special case where curr is aligned and used up. */
if (!left_margin && !right_margin) {
/* corner case in corner, spotted by Andiry. */
node = NULL;
if (curr == free_list->first_node) {
temp = rb_next(temp);
if (temp)
node = container_of(temp, struct nova_range_node, node);
free_list->first_node = node;
}
if (curr == free_list->last_node) {
temp = rb_prev(temp);
if (temp)
node = container_of(temp, struct nova_range_node, node);
free_list->last_node = node;
}
/* release curr after updating {first, last}_node */
rb_erase(&curr->node, tree);
nova_free_blocknode(curr);
free_list->num_blocknode--;
}
found = 1;
break;
}
next:
if (from_tail == ALLOC_FROM_HEAD)
temp = rb_next(temp);
else
temp = rb_prev(temp);
}
NOVA_STATS_ADD(alloc_steps, step);
return found;
}
/* Return how many blocks allocated */
static long nova_alloc_blocks_in_free_list(struct super_block *sb,
struct free_list *free_list, unsigned short btype,
enum alloc_type atype, unsigned long num_blocks,
unsigned long *new_blocknr, enum nova_alloc_direction from_tail)
{
struct rb_root *tree;
struct nova_range_node *curr, *next = NULL, *prev = NULL;
struct rb_node *temp, *next_node, *prev_node;
unsigned long curr_blocks;
bool found = 0;
bool found_hugeblock = 0;
unsigned long step = 0;
if (!free_list->first_node || free_list->num_free_blocks == 0) {
nova_dbgv("%s: Can't alloc. free_list->first_node=0x%p "
"free_list->num_free_blocks = %lu",
__func__, free_list->first_node,
free_list->num_free_blocks);
return -ENOSPC;
}
if (atype == LOG && not_enough_blocks(free_list, num_blocks, atype)) {
nova_dbgv("%s: Can't alloc. not_enough_blocks() == true",
__func__);
return -ENOSPC;
}
tree = &(free_list->block_free_tree);
if (from_tail == ALLOC_FROM_HEAD)
temp = &(free_list->first_node->node);
else
temp = &(free_list->last_node->node);
/* Try huge block allocation for data blocks first */
if (IS_DATABLOCKS_2MB_ALIGNED(num_blocks, atype)) {
found_hugeblock = nova_alloc_superpage(sb, free_list,
num_blocks, new_blocknr, from_tail);
if (found_hugeblock)
goto success;
}
/* fallback to un-aglined allocation then */
while (temp) {
step++;
curr = container_of(temp, struct nova_range_node, node);
if (!nova_range_node_checksum_ok(curr)) {
nova_err(sb, "%s curr failed\n", __func__);
goto next;
}
curr_blocks = curr->range_high - curr->range_low + 1;
if (num_blocks >= curr_blocks) {
/* Superpage allocation must succeed */
if (btype > 0 && num_blocks > curr_blocks)
goto next;
/* Otherwise, allocate the whole blocknode */
if (curr == free_list->first_node) {
next_node = rb_next(temp);
if (next_node)
next = container_of(next_node,
struct nova_range_node, node);
free_list->first_node = next;
}
if (curr == free_list->last_node) {
prev_node = rb_prev(temp);
if (prev_node)
prev = container_of(prev_node,
struct nova_range_node, node);
free_list->last_node = prev;
}
rb_erase(&curr->node, tree);
free_list->num_blocknode--;
num_blocks = curr_blocks;
*new_blocknr = curr->range_low;
nova_free_blocknode(curr);
found = 1;
break;
}
/* Allocate partial blocknode */
if (from_tail == ALLOC_FROM_HEAD) {
*new_blocknr = curr->range_low;
curr->range_low += num_blocks;
} else {
*new_blocknr = curr->range_high + 1 - num_blocks;
curr->range_high -= num_blocks;
}
nova_update_range_node_checksum(curr);
found = 1;
break;
next:
if (from_tail == ALLOC_FROM_HEAD)
temp = rb_next(temp);
else
temp = rb_prev(temp);
}
if (free_list->num_free_blocks < num_blocks) {
nova_dbg("%s: free list %d has %lu free blocks, "
"but allocated %lu blocks?\n",
__func__, free_list->index,
free_list->num_free_blocks, num_blocks);
return -ENOSPC;
}
success:
if ((found == 1) || (found_hugeblock == 1))
free_list->num_free_blocks -= num_blocks;
else {
nova_dbgv("%s: Can't alloc. found = %d", __func__, found);
return -ENOSPC;
}
NOVA_STATS_ADD(alloc_steps, step);
return num_blocks;
}
/* Find out the free list with most free blocks */
static int nova_get_candidate_free_list(struct super_block *sb)
{
struct nova_sb_info *sbi = NOVA_SB(sb);
struct free_list *free_list;
int cpuid = 0;
int num_free_blocks = 0;
int i;
for (i = 0; i < sbi->cpus; i++) {
free_list = nova_get_free_list(sb, i);
if (free_list->num_free_blocks > num_free_blocks) {
cpuid = i;
num_free_blocks = free_list->num_free_blocks;
}
}
return cpuid;
}
static int nova_new_blocks(struct super_block *sb, unsigned long *blocknr,
unsigned int num, unsigned short btype, int zero,
enum alloc_type atype, int cpuid, enum nova_alloc_direction from_tail)
{
struct free_list *free_list;
void *bp;
unsigned long num_blocks = 0;
unsigned long new_blocknr = 0;
long ret_blocks = 0;
int retried = 0;
INIT_TIMING(alloc_time);
num_blocks = num * nova_get_numblocks(btype);
if (num_blocks == 0) {
nova_dbg_verbose("%s: num_blocks == 0", __func__);
return -EINVAL;
}
NOVA_START_TIMING(new_blocks_t, alloc_time);
if (cpuid == ANY_CPU)
cpuid = nova_get_cpuid(sb);
retry:
free_list = nova_get_free_list(sb, cpuid);
spin_lock(&free_list->s_lock);
if (not_enough_blocks(free_list, num_blocks, atype)) {
nova_dbgv("%s: cpu %d, free_blocks %lu, required %lu, "
"blocknode %lu\n",
__func__, cpuid, free_list->num_free_blocks,
num_blocks, free_list->num_blocknode);
if (retried >= 2)
/* Allocate anyway */
goto alloc;
spin_unlock(&free_list->s_lock);
cpuid = nova_get_candidate_free_list(sb);
retried++;
goto retry;
}
alloc:
ret_blocks = nova_alloc_blocks_in_free_list(sb, free_list, btype, atype,
num_blocks, &new_blocknr, from_tail);
if (ret_blocks > 0) {
if (atype == LOG) {
free_list->alloc_log_count++;
free_list->alloc_log_pages += ret_blocks;
} else if (atype == DATA) {
free_list->alloc_data_count++;
free_list->alloc_data_pages += ret_blocks;
}
}
spin_unlock(&free_list->s_lock);
NOVA_END_TIMING(new_blocks_t, alloc_time);
if (ret_blocks <= 0 || new_blocknr == 0) {
nova_dbgv("%s: not able to allocate %d blocks. "
"ret_blocks=%ld; new_blocknr=%lu",
__func__, num, ret_blocks, new_blocknr);
return -ENOSPC;
}
if (zero) {
bp = nova_get_block(sb, nova_get_block_off(sb,
new_blocknr, btype));
nova_memunlock_range(sb, bp, PAGE_SIZE * ret_blocks);
memset_nt(bp, 0, PAGE_SIZE * ret_blocks);
nova_memlock_range(sb, bp, PAGE_SIZE * ret_blocks);
}
*blocknr = new_blocknr;
nova_dbg_verbose("Alloc %lu NVMM blocks 0x%lx\n", ret_blocks, *blocknr);
return ret_blocks / nova_get_numblocks(btype);
}
// Allocate data blocks. The offset for the allocated block comes back in