-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathjournal.cc
3023 lines (2668 loc) · 86.6 KB
/
journal.cc
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
// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
// vim: ts=8 sw=2 smarttab
/*
* Ceph - scalable distributed file system
*
* Copyright (C) 2004-2006 Sage Weil <[email protected]>
*
* This is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software
* Foundation. See file COPYING.
*
*/
#include "common/config.h"
#include "osdc/Journaler.h"
#include "events/ESubtreeMap.h"
#include "events/ESession.h"
#include "events/ESessions.h"
#include "events/EMetaBlob.h"
#include "events/EResetJournal.h"
#include "events/ENoOp.h"
#include "events/EUpdate.h"
#include "events/ESlaveUpdate.h"
#include "events/EOpen.h"
#include "events/ECommitted.h"
#include "events/EExport.h"
#include "events/EImportStart.h"
#include "events/EImportFinish.h"
#include "events/EFragment.h"
#include "events/ETableClient.h"
#include "events/ETableServer.h"
#include "include/stringify.h"
#include "LogSegment.h"
#include "MDS.h"
#include "MDLog.h"
#include "MDCache.h"
#include "Server.h"
#include "Migrator.h"
#include "Mutation.h"
#include "InoTable.h"
#include "MDSTableClient.h"
#include "MDSTableServer.h"
#include "Locker.h"
#define dout_subsys ceph_subsys_mds
#undef DOUT_COND
#define DOUT_COND(cct, l) (l<=cct->_conf->debug_mds || l <= cct->_conf->debug_mds_log \
|| l <= cct->_conf->debug_mds_log_expire)
#undef dout_prefix
#define dout_prefix *_dout << "mds." << mds->get_nodeid() << ".journal "
// -----------------------
// LogSegment
void LogSegment::try_to_expire(MDS *mds, C_GatherBuilder &gather_bld, int op_prio)
{
set<CDir*> commit;
dout(6) << "LogSegment(" << offset << ").try_to_expire" << dendl;
assert(g_conf->mds_kill_journal_expire_at != 1);
// commit dirs
for (elist<CDir*>::iterator p = new_dirfrags.begin(); !p.end(); ++p) {
dout(20) << " new_dirfrag " << **p << dendl;
assert((*p)->is_auth());
commit.insert(*p);
}
for (elist<CDir*>::iterator p = dirty_dirfrags.begin(); !p.end(); ++p) {
dout(20) << " dirty_dirfrag " << **p << dendl;
assert((*p)->is_auth());
commit.insert(*p);
}
for (elist<CDentry*>::iterator p = dirty_dentries.begin(); !p.end(); ++p) {
dout(20) << " dirty_dentry " << **p << dendl;
assert((*p)->is_auth());
commit.insert((*p)->get_dir());
}
for (elist<CInode*>::iterator p = dirty_inodes.begin(); !p.end(); ++p) {
dout(20) << " dirty_inode " << **p << dendl;
assert((*p)->is_auth());
if ((*p)->is_base()) {
(*p)->store(gather_bld.new_sub());
} else
commit.insert((*p)->get_parent_dn()->get_dir());
}
if (!commit.empty()) {
for (set<CDir*>::iterator p = commit.begin();
p != commit.end();
++p) {
CDir *dir = *p;
assert(dir->is_auth());
if (dir->can_auth_pin()) {
dout(15) << "try_to_expire committing " << *dir << dendl;
dir->commit(0, gather_bld.new_sub(), false, op_prio);
} else {
dout(15) << "try_to_expire waiting for unfreeze on " << *dir << dendl;
dir->add_waiter(CDir::WAIT_UNFREEZE, gather_bld.new_sub());
}
}
}
// master ops with possibly uncommitted slaves
for (set<metareqid_t>::iterator p = uncommitted_masters.begin();
p != uncommitted_masters.end();
++p) {
dout(10) << "try_to_expire waiting for slaves to ack commit on " << *p << dendl;
mds->mdcache->wait_for_uncommitted_master(*p, gather_bld.new_sub());
}
// uncommitted fragments
for (set<dirfrag_t>::iterator p = uncommitted_fragments.begin();
p != uncommitted_fragments.end();
++p) {
dout(10) << "try_to_expire waiting for uncommitted fragment " << *p << dendl;
mds->mdcache->wait_for_uncommitted_fragment(*p, gather_bld.new_sub());
}
// nudge scatterlocks
for (elist<CInode*>::iterator p = dirty_dirfrag_dir.begin(); !p.end(); ++p) {
CInode *in = *p;
dout(10) << "try_to_expire waiting for dirlock flush on " << *in << dendl;
mds->locker->scatter_nudge(&in->filelock, gather_bld.new_sub());
}
for (elist<CInode*>::iterator p = dirty_dirfrag_dirfragtree.begin(); !p.end(); ++p) {
CInode *in = *p;
dout(10) << "try_to_expire waiting for dirfragtreelock flush on " << *in << dendl;
mds->locker->scatter_nudge(&in->dirfragtreelock, gather_bld.new_sub());
}
for (elist<CInode*>::iterator p = dirty_dirfrag_nest.begin(); !p.end(); ++p) {
CInode *in = *p;
dout(10) << "try_to_expire waiting for nest flush on " << *in << dendl;
mds->locker->scatter_nudge(&in->nestlock, gather_bld.new_sub());
}
assert(g_conf->mds_kill_journal_expire_at != 2);
// open files
if (!open_files.empty()) {
assert(!mds->mdlog->is_capped()); // hmm FIXME
EOpen *le = 0;
LogSegment *ls = mds->mdlog->get_current_segment();
assert(ls != this);
elist<CInode*>::iterator p = open_files.begin(member_offset(CInode, item_open_file));
while (!p.end()) {
CInode *in = *p;
assert(in->last == CEPH_NOSNAP);
++p;
if (in->is_auth() && !in->is_ambiguous_auth() && in->is_any_caps()) {
if (in->is_any_caps_wanted()) {
dout(20) << "try_to_expire requeueing open file " << *in << dendl;
if (!le) {
le = new EOpen(mds->mdlog);
mds->mdlog->start_entry(le);
}
le->add_clean_inode(in);
ls->open_files.push_back(&in->item_open_file);
} else {
// drop inodes that aren't wanted
dout(20) << "try_to_expire not requeueing and delisting unwanted file " << *in << dendl;
in->item_open_file.remove_myself();
}
} else {
/*
* we can get a capless inode here if we replay an open file, the client fails to
* reconnect it, but does REPLAY an open request (that adds it to the logseg). AFAICS
* it's ok for the client to replay an open on a file it doesn't have in it's cache
* anymore.
*
* this makes the mds less sensitive to strict open_file consistency, although it does
* make it easier to miss subtle problems.
*/
dout(20) << "try_to_expire not requeueing and delisting capless file " << *in << dendl;
in->item_open_file.remove_myself();
}
}
if (le) {
mds->mdlog->submit_entry(le, gather_bld.new_sub());
dout(10) << "try_to_expire waiting for open files to rejournal" << dendl;
}
}
assert(g_conf->mds_kill_journal_expire_at != 3);
// backtraces to be stored/updated
for (elist<CInode*>::iterator p = dirty_parent_inodes.begin(); !p.end(); ++p) {
CInode *in = *p;
assert(in->is_auth());
if (in->can_auth_pin()) {
dout(15) << "try_to_expire waiting for storing backtrace on " << *in << dendl;
in->store_backtrace(gather_bld.new_sub(), op_prio);
} else {
dout(15) << "try_to_expire waiting for unfreeze on " << *in << dendl;
in->add_waiter(CInode::WAIT_UNFREEZE, gather_bld.new_sub());
}
}
assert(g_conf->mds_kill_journal_expire_at != 4);
// slave updates
for (elist<MDSlaveUpdate*>::iterator p = slave_updates.begin(member_offset(MDSlaveUpdate,
item));
!p.end(); ++p) {
MDSlaveUpdate *su = *p;
dout(10) << "try_to_expire waiting on slave update " << su << dendl;
assert(su->waiter == 0);
su->waiter = gather_bld.new_sub();
}
// idalloc
if (inotablev > mds->inotable->get_committed_version()) {
dout(10) << "try_to_expire saving inotable table, need " << inotablev
<< ", committed is " << mds->inotable->get_committed_version()
<< " (" << mds->inotable->get_committing_version() << ")"
<< dendl;
mds->inotable->save(gather_bld.new_sub(), inotablev);
}
// sessionmap
if (sessionmapv > mds->sessionmap.committed) {
dout(10) << "try_to_expire saving sessionmap, need " << sessionmapv
<< ", committed is " << mds->sessionmap.committed
<< " (" << mds->sessionmap.committing << ")"
<< dendl;
mds->sessionmap.save(gather_bld.new_sub(), sessionmapv);
}
// pending commit atids
for (map<int, ceph::unordered_set<version_t> >::iterator p = pending_commit_tids.begin();
p != pending_commit_tids.end();
++p) {
MDSTableClient *client = mds->get_table_client(p->first);
assert(client);
for (ceph::unordered_set<version_t>::iterator q = p->second.begin();
q != p->second.end();
++q) {
dout(10) << "try_to_expire " << get_mdstable_name(p->first) << " transaction " << *q
<< " pending commit (not yet acked), waiting" << dendl;
assert(!client->has_committed(*q));
client->wait_for_ack(*q, gather_bld.new_sub());
}
}
// table servers
for (map<int, version_t>::iterator p = tablev.begin();
p != tablev.end();
++p) {
MDSTableServer *server = mds->get_table_server(p->first);
assert(server);
if (p->second > server->get_committed_version()) {
dout(10) << "try_to_expire waiting for " << get_mdstable_name(p->first)
<< " to save, need " << p->second << dendl;
server->save(gather_bld.new_sub());
}
}
// truncating
for (set<CInode*>::iterator p = truncating_inodes.begin();
p != truncating_inodes.end();
++p) {
dout(10) << "try_to_expire waiting for truncate of " << **p << dendl;
(*p)->add_waiter(CInode::WAIT_TRUNC, gather_bld.new_sub());
}
if (gather_bld.has_subs()) {
dout(6) << "LogSegment(" << offset << ").try_to_expire waiting" << dendl;
mds->mdlog->flush();
} else {
assert(g_conf->mds_kill_journal_expire_at != 5);
dout(6) << "LogSegment(" << offset << ").try_to_expire success" << dendl;
}
}
#undef DOUT_COND
#define DOUT_COND(cct, l) (l<=cct->_conf->debug_mds || l <= cct->_conf->debug_mds_log)
// -----------------------
// EMetaBlob
EMetaBlob::EMetaBlob(MDLog *mdlog) : opened_ino(0), renamed_dirino(0),
inotablev(0), sessionmapv(0),
allocated_ino(0),
last_subtree_map(mdlog ? mdlog->get_last_segment_offset() : 0),
my_offset(mdlog ? mdlog->get_write_pos() : 0) //, _segment(0)
{ }
void EMetaBlob::add_dir_context(CDir *dir, int mode)
{
MDS *mds = dir->cache->mds;
list<CDentry*> parents;
// it may be okay not to include the maybe items, if
// - we journaled the maybe child inode in this segment
// - that subtree turns out to be unambiguously auth
list<CDentry*> maybe;
bool maybenot = false;
while (true) {
// already have this dir? (we must always add in order)
if (lump_map.count(dir->dirfrag())) {
dout(20) << "EMetaBlob::add_dir_context(" << dir << ") have lump " << dir->dirfrag() << dendl;
break;
}
// stop at root/stray
CInode *diri = dir->get_inode();
CDentry *parent = diri->get_projected_parent_dn();
if (mode == TO_AUTH_SUBTREE_ROOT) {
// subtree root?
if (dir->is_subtree_root() && !dir->state_test(CDir::STATE_EXPORTBOUND)) {
if (dir->is_auth() && !dir->is_ambiguous_auth()) {
// it's an auth subtree, we don't need maybe (if any), and we're done.
dout(20) << "EMetaBlob::add_dir_context(" << dir << ") reached unambig auth subtree, don't need " << maybe
<< " at " << *dir << dendl;
maybe.clear();
break;
} else {
dout(20) << "EMetaBlob::add_dir_context(" << dir << ") reached ambig or !auth subtree, need " << maybe
<< " at " << *dir << dendl;
// we need the maybe list after all!
parents.splice(parents.begin(), maybe);
maybenot = false;
}
}
// was the inode journaled in this blob?
if (my_offset && diri->last_journaled == my_offset) {
dout(20) << "EMetaBlob::add_dir_context(" << dir << ") already have diri this blob " << *diri << dendl;
break;
}
// have we journaled this inode since the last subtree map?
if (!maybenot && last_subtree_map && diri->last_journaled >= last_subtree_map) {
dout(20) << "EMetaBlob::add_dir_context(" << dir << ") already have diri in this segment ("
<< diri->last_journaled << " >= " << last_subtree_map << "), setting maybenot flag "
<< *diri << dendl;
maybenot = true;
}
}
if (!parent)
break;
if (maybenot) {
dout(25) << "EMetaBlob::add_dir_context(" << dir << ") maybe " << *parent << dendl;
maybe.push_front(parent);
} else {
dout(25) << "EMetaBlob::add_dir_context(" << dir << ") definitely " << *parent << dendl;
parents.push_front(parent);
}
dir = parent->get_dir();
}
parents.splice(parents.begin(), maybe);
dout(20) << "EMetaBlob::add_dir_context final: " << parents << dendl;
for (list<CDentry*>::iterator p = parents.begin(); p != parents.end(); ++p) {
assert((*p)->get_projected_linkage()->is_primary());
add_dentry(*p, false);
}
}
void EMetaBlob::update_segment(LogSegment *ls)
{
// dirty inode mtimes
// -> handled directly by Server.cc, replay()
// alloc table update?
if (inotablev)
ls->inotablev = inotablev;
if (sessionmapv)
ls->sessionmapv = sessionmapv;
// truncated inodes
// -> handled directly by Server.cc
// client requests
// note the newest request per client
//if (!client_reqs.empty())
// ls->last_client_tid[client_reqs.rbegin()->client] = client_reqs.rbegin()->tid);
}
// EMetaBlob::fullbit
void EMetaBlob::fullbit::encode(bufferlist& bl) const {
ENCODE_START(6, 5, bl);
::encode(dn, bl);
::encode(dnfirst, bl);
::encode(dnlast, bl);
::encode(dnv, bl);
::encode(inode, bl);
::encode(xattrs, bl);
if (inode.is_symlink())
::encode(symlink, bl);
if (inode.is_dir()) {
::encode(dirfragtree, bl);
::encode(snapbl, bl);
}
::encode(state, bl);
if (old_inodes.empty()) {
::encode(false, bl);
} else {
::encode(true, bl);
::encode(old_inodes, bl);
}
ENCODE_FINISH(bl);
}
void EMetaBlob::fullbit::decode(bufferlist::iterator &bl) {
DECODE_START_LEGACY_COMPAT_LEN(6, 5, 5, bl);
::decode(dn, bl);
::decode(dnfirst, bl);
::decode(dnlast, bl);
::decode(dnv, bl);
::decode(inode, bl);
::decode(xattrs, bl);
if (inode.is_symlink())
::decode(symlink, bl);
if (inode.is_dir()) {
::decode(dirfragtree, bl);
::decode(snapbl, bl);
if ((struct_v == 2) || (struct_v == 3)) {
bool dir_layout_exists;
::decode(dir_layout_exists, bl);
if (dir_layout_exists) {
__u8 dir_struct_v;
::decode(dir_struct_v, bl); // default_file_layout version
::decode(inode.layout, bl); // and actual layout, that we care about
}
}
}
if (struct_v >= 6) {
::decode(state, bl);
} else {
bool dirty;
::decode(dirty, bl);
state = dirty ? EMetaBlob::fullbit::STATE_DIRTY : 0;
}
if (struct_v >= 3) {
bool old_inodes_present;
::decode(old_inodes_present, bl);
if (old_inodes_present) {
::decode(old_inodes, bl);
}
}
DECODE_FINISH(bl);
}
void EMetaBlob::fullbit::dump(Formatter *f) const
{
f->dump_string("dentry", dn);
f->dump_stream("snapid.first") << dnfirst;
f->dump_stream("snapid.last") << dnlast;
f->dump_int("dentry version", dnv);
f->open_object_section("inode");
inode.dump(f);
f->close_section(); // inode
f->open_array_section("xattrs");
for (map<string, bufferptr>::const_iterator iter = xattrs.begin();
iter != xattrs.end(); ++iter) {
f->dump_string(iter->first.c_str(), iter->second.c_str());
}
f->close_section(); // xattrs
if (inode.is_symlink()) {
f->dump_string("symlink", symlink);
}
if (inode.is_dir()) {
f->dump_stream("frag tree") << dirfragtree;
f->dump_string("has_snapbl", snapbl.length() ? "true" : "false");
if (inode.has_layout()) {
f->open_object_section("file layout policy");
// FIXME
f->dump_string("layout", "the layout exists");
f->close_section(); // file layout policy
}
}
f->dump_string("state", state_string());
if (!old_inodes.empty()) {
f->open_array_section("old inodes");
for (old_inodes_t::const_iterator iter = old_inodes.begin();
iter != old_inodes.end(); ++iter) {
f->open_object_section("inode");
f->dump_int("snapid", iter->first);
iter->second.dump(f);
f->close_section(); // inode
}
f->close_section(); // old inodes
}
}
void EMetaBlob::fullbit::generate_test_instances(list<EMetaBlob::fullbit*>& ls)
{
inode_t inode;
fragtree_t fragtree;
map<string,bufferptr> empty_xattrs;
bufferlist empty_snapbl;
fullbit *sample = new fullbit("/testdn", 0, 0, 0,
inode, fragtree, empty_xattrs, "", empty_snapbl,
false, NULL);
ls.push_back(sample);
}
void EMetaBlob::fullbit::update_inode(MDS *mds, CInode *in)
{
in->inode = inode;
in->xattrs = xattrs;
if (in->inode.is_dir()) {
if (!(in->dirfragtree == dirfragtree)) {
dout(10) << "EMetaBlob::fullbit::update_inode dft " << in->dirfragtree << " -> "
<< dirfragtree << " on " << *in << dendl;
in->dirfragtree = dirfragtree;
in->force_dirfrags();
if (in->has_dirfrags() && in->authority() == CDIR_AUTH_UNDEF) {
list<CDir*> ls;
in->get_nested_dirfrags(ls);
for (list<CDir*>::iterator p = ls.begin(); p != ls.end(); ++p) {
CDir *dir = *p;
if (dir->get_num_any() == 0 &&
mds->mdcache->can_trim_non_auth_dirfrag(dir)) {
dout(10) << " closing empty non-auth dirfrag " << *dir << dendl;
in->close_dirfrag(dir->get_frag());
}
}
}
}
/*
* we can do this before linking hte inode bc the split_at would
* be a no-op.. we have no children (namely open snaprealms) to
* divy up
*/
in->decode_snap_blob(snapbl);
} else if (in->inode.is_symlink()) {
in->symlink = symlink;
}
in->old_inodes = old_inodes;
}
// EMetaBlob::remotebit
void EMetaBlob::remotebit::encode(bufferlist& bl) const
{
ENCODE_START(2, 2, bl);
::encode(dn, bl);
::encode(dnfirst, bl);
::encode(dnlast, bl);
::encode(dnv, bl);
::encode(ino, bl);
::encode(d_type, bl);
::encode(dirty, bl);
ENCODE_FINISH(bl);
}
void EMetaBlob::remotebit::decode(bufferlist::iterator &bl)
{
DECODE_START_LEGACY_COMPAT_LEN(2, 2, 2, bl);
::decode(dn, bl);
::decode(dnfirst, bl);
::decode(dnlast, bl);
::decode(dnv, bl);
::decode(ino, bl);
::decode(d_type, bl);
::decode(dirty, bl);
DECODE_FINISH(bl);
}
void EMetaBlob::remotebit::dump(Formatter *f) const
{
f->dump_string("dentry", dn);
f->dump_int("snapid.first", dnfirst);
f->dump_int("snapid.last", dnlast);
f->dump_int("dentry version", dnv);
f->dump_int("inodeno", ino);
uint32_t type = DTTOIF(d_type) & S_IFMT; // convert to type entries
string type_string;
switch(type) {
case S_IFREG:
type_string = "file"; break;
case S_IFLNK:
type_string = "symlink"; break;
case S_IFDIR:
type_string = "directory"; break;
case S_IFIFO:
type_string = "fifo"; break;
case S_IFCHR:
type_string = "chr"; break;
case S_IFBLK:
type_string = "blk"; break;
case S_IFSOCK:
type_string = "sock"; break;
default:
assert (0 == "unknown d_type!");
}
f->dump_string("d_type", type_string);
f->dump_string("dirty", dirty ? "true" : "false");
}
void EMetaBlob::remotebit::
generate_test_instances(list<EMetaBlob::remotebit*>& ls)
{
remotebit *remote = new remotebit("/test/dn", 0, 10, 15, 1, IFTODT(S_IFREG), false);
ls.push_back(remote);
}
// EMetaBlob::nullbit
void EMetaBlob::nullbit::encode(bufferlist& bl) const
{
ENCODE_START(2, 2, bl);
::encode(dn, bl);
::encode(dnfirst, bl);
::encode(dnlast, bl);
::encode(dnv, bl);
::encode(dirty, bl);
ENCODE_FINISH(bl);
}
void EMetaBlob::nullbit::decode(bufferlist::iterator &bl)
{
DECODE_START_LEGACY_COMPAT_LEN(2, 2, 2, bl);
::decode(dn, bl);
::decode(dnfirst, bl);
::decode(dnlast, bl);
::decode(dnv, bl);
::decode(dirty, bl);
DECODE_FINISH(bl);
}
void EMetaBlob::nullbit::dump(Formatter *f) const
{
f->dump_string("dentry", dn);
f->dump_int("snapid.first", dnfirst);
f->dump_int("snapid.last", dnlast);
f->dump_int("dentry version", dnv);
f->dump_string("dirty", dirty ? "true" : "false");
}
void EMetaBlob::nullbit::generate_test_instances(list<nullbit*>& ls)
{
nullbit *sample = new nullbit("/test/dentry", 0, 10, 15, false);
nullbit *sample2 = new nullbit("/test/dirty", 10, 20, 25, true);
ls.push_back(sample);
ls.push_back(sample2);
}
// EMetaBlob::dirlump
void EMetaBlob::dirlump::encode(bufferlist& bl) const
{
ENCODE_START(2, 2, bl);
::encode(fnode, bl);
::encode(state, bl);
::encode(nfull, bl);
::encode(nremote, bl);
::encode(nnull, bl);
_encode_bits();
::encode(dnbl, bl);
ENCODE_FINISH(bl);
}
void EMetaBlob::dirlump::decode(bufferlist::iterator &bl)
{
DECODE_START_LEGACY_COMPAT_LEN(2, 2, 2, bl)
::decode(fnode, bl);
::decode(state, bl);
::decode(nfull, bl);
::decode(nremote, bl);
::decode(nnull, bl);
::decode(dnbl, bl);
dn_decoded = false; // don't decode bits unless we need them.
DECODE_FINISH(bl);
}
void EMetaBlob::dirlump::dump(Formatter *f) const
{
if (!dn_decoded) {
dirlump *me = const_cast<dirlump*>(this);
me->_decode_bits();
}
f->open_object_section("fnode");
fnode.dump(f);
f->close_section(); // fnode
f->dump_string("state", state_string());
f->dump_int("nfull", nfull);
f->dump_int("nremote", nremote);
f->dump_int("nnull", nnull);
f->open_array_section("full bits");
for (list<ceph::shared_ptr<fullbit> >::const_iterator
iter = dfull.begin(); iter != dfull.end(); ++iter) {
f->open_object_section("fullbit");
(*iter)->dump(f);
f->close_section(); // fullbit
}
f->close_section(); // full bits
f->open_array_section("remote bits");
for (list<remotebit>::const_iterator
iter = dremote.begin(); iter != dremote.end(); ++iter) {
f->open_object_section("remotebit");
(*iter).dump(f);
f->close_section(); // remotebit
}
f->close_section(); // remote bits
f->open_array_section("null bits");
for (list<nullbit>::const_iterator
iter = dnull.begin(); iter != dnull.end(); ++iter) {
f->open_object_section("null bit");
(*iter).dump(f);
f->close_section(); // null bit
}
f->close_section(); // null bits
}
void EMetaBlob::dirlump::generate_test_instances(list<dirlump*>& ls)
{
ls.push_back(new dirlump());
}
/**
* EMetaBlob proper
*/
void EMetaBlob::encode(bufferlist& bl) const
{
ENCODE_START(7, 5, bl);
::encode(lump_order, bl);
::encode(lump_map, bl);
::encode(roots, bl);
::encode(table_tids, bl);
::encode(opened_ino, bl);
::encode(allocated_ino, bl);
::encode(used_preallocated_ino, bl);
::encode(preallocated_inos, bl);
::encode(client_name, bl);
::encode(inotablev, bl);
::encode(sessionmapv, bl);
::encode(truncate_start, bl);
::encode(truncate_finish, bl);
::encode(destroyed_inodes, bl);
::encode(client_reqs, bl);
::encode(renamed_dirino, bl);
::encode(renamed_dir_frags, bl);
{
// make MDS use v6 format happy
int64_t i = -1;
bool b = false;
::encode(i, bl);
::encode(b, bl);
}
ENCODE_FINISH(bl);
}
void EMetaBlob::decode(bufferlist::iterator &bl)
{
DECODE_START_LEGACY_COMPAT_LEN(7, 5, 5, bl);
::decode(lump_order, bl);
::decode(lump_map, bl);
if (struct_v >= 4) {
::decode(roots, bl);
} else {
bufferlist rootbl;
::decode(rootbl, bl);
if (rootbl.length()) {
bufferlist::iterator p = rootbl.begin();
roots.push_back(ceph::shared_ptr<fullbit>(new fullbit(p)));
}
}
::decode(table_tids, bl);
::decode(opened_ino, bl);
::decode(allocated_ino, bl);
::decode(used_preallocated_ino, bl);
::decode(preallocated_inos, bl);
::decode(client_name, bl);
::decode(inotablev, bl);
::decode(sessionmapv, bl);
::decode(truncate_start, bl);
::decode(truncate_finish, bl);
::decode(destroyed_inodes, bl);
if (struct_v >= 2) {
::decode(client_reqs, bl);
} else {
list<metareqid_t> r;
::decode(r, bl);
while (!r.empty()) {
client_reqs.push_back(pair<metareqid_t,uint64_t>(r.front(), 0));
r.pop_front();
}
}
if (struct_v >= 3) {
::decode(renamed_dirino, bl);
::decode(renamed_dir_frags, bl);
}
if (struct_v >= 6) {
// ignore
int64_t i;
bool b;
::decode(i, bl);
::decode(b, bl);
}
DECODE_FINISH(bl);
}
/**
* Get all inodes touched by this metablob. Includes the 'bits' within
* dirlumps, and the inodes of the dirs themselves.
*/
void EMetaBlob::get_inodes(
std::set<inodeno_t> &inodes) const
{
// For all dirlumps in this metablob
for (std::map<dirfrag_t, dirlump>::const_iterator i = lump_map.begin(); i != lump_map.end(); ++i) {
// Record inode of dirlump
inodeno_t const dir_ino = i->first.ino;
inodes.insert(dir_ino);
// Decode dirlump bits
dirlump const &dl = i->second;
dl._decode_bits();
// Record inodes of fullbits
list<ceph::shared_ptr<fullbit> > const &fb_list = dl.get_dfull();
for (list<ceph::shared_ptr<fullbit> >::const_iterator
iter = fb_list.begin(); iter != fb_list.end(); ++iter) {
inodes.insert((*iter)->inode.ino);
}
// Record inodes of remotebits
list<remotebit> const &rb_list = dl.get_dremote();
for (list<remotebit>::const_iterator
iter = rb_list.begin(); iter != rb_list.end(); ++iter) {
inodes.insert(iter->ino);
}
}
}
/**
* Get a map of dirfrag to set of dentries in that dirfrag which are
* touched in this operation.
*/
void EMetaBlob::get_dentries(std::map<dirfrag_t, std::set<std::string> > &dentries) const
{
for (std::map<dirfrag_t, dirlump>::const_iterator i = lump_map.begin(); i != lump_map.end(); ++i) {
dirlump const &dl = i->second;
dirfrag_t const &df = i->first;
// Get all bits
dl._decode_bits();
list<ceph::shared_ptr<fullbit> > const &fb_list = dl.get_dfull();
list<nullbit> const &nb_list = dl.get_dnull();
list<remotebit> const &rb_list = dl.get_dremote();
// For all bits, store dentry
for (list<ceph::shared_ptr<fullbit> >::const_iterator
iter = fb_list.begin(); iter != fb_list.end(); ++iter) {
dentries[df].insert((*iter)->dn);
}
for (list<nullbit>::const_iterator
iter = nb_list.begin(); iter != nb_list.end(); ++iter) {
dentries[df].insert(iter->dn);
}
for (list<remotebit>::const_iterator
iter = rb_list.begin(); iter != rb_list.end(); ++iter) {
dentries[df].insert(iter->dn);
}
}
}
/**
* Calculate all paths that we can infer are touched by this metablob. Only uses
* information local to this metablob so it may only be the path within the
* subtree.
*/
void EMetaBlob::get_paths(
std::vector<std::string> &paths) const
{
// Each dentry has a 'location' which is a 2-tuple of parent inode and dentry name
typedef std::pair<inodeno_t, std::string> Location;
// Whenever we see a dentry within a dirlump, we remember it as a child of
// the dirlump's inode
std::map<inodeno_t, std::list<std::string> > children;
// Whenever we see a location for an inode, remember it: this allows us to
// build a path given an inode
std::map<inodeno_t, Location> ino_locations;
// Special case: operations on root inode populate roots but not dirlumps
if (lump_map.empty() && !roots.empty()) {
paths.push_back("/");
return;
}
// First pass
// ==========
// Build a tiny local metadata cache for the path structure in this metablob
for (std::map<dirfrag_t, dirlump>::const_iterator i = lump_map.begin(); i != lump_map.end(); ++i) {
inodeno_t const dir_ino = i->first.ino;
dirlump const &dl = i->second;
dl._decode_bits();
list<ceph::shared_ptr<fullbit> > const &fb_list = dl.get_dfull();
list<nullbit> const &nb_list = dl.get_dnull();
list<remotebit> const &rb_list = dl.get_dremote();
for (list<ceph::shared_ptr<fullbit> >::const_iterator
iter = fb_list.begin(); iter != fb_list.end(); ++iter) {
std::string const &dentry = (*iter)->dn;
children[dir_ino].push_back(dentry);
ino_locations[(*iter)->inode.ino] = Location(dir_ino, dentry);
}
for (list<nullbit>::const_iterator
iter = nb_list.begin(); iter != nb_list.end(); ++iter) {
std::string const &dentry = iter->dn;
children[dir_ino].push_back(dentry);
}
for (list<remotebit>::const_iterator
iter = rb_list.begin(); iter != rb_list.end(); ++iter) {
std::string const &dentry = iter->dn;
children[dir_ino].push_back(dentry);
}
}
std::vector<Location> leaf_locations;
// Second pass
// ===========
// Output paths for all childless nodes in the metablob
for (std::map<dirfrag_t, dirlump>::const_iterator i = lump_map.begin(); i != lump_map.end(); ++i) {
inodeno_t const dir_ino = i->first.ino;
dirlump const &dl = i->second;
dl._decode_bits();
list<ceph::shared_ptr<fullbit> > const &fb_list = dl.get_dfull();
for (list<ceph::shared_ptr<fullbit> >::const_iterator
iter = fb_list.begin(); iter != fb_list.end(); ++iter) {
std::string const &dentry = (*iter)->dn;
children[dir_ino].push_back(dentry);
ino_locations[(*iter)->inode.ino] = Location(dir_ino, dentry);
if (children.find((*iter)->inode.ino) == children.end()) {
leaf_locations.push_back(Location(dir_ino, dentry));
}
}
list<nullbit> const &nb_list = dl.get_dnull();
for (list<nullbit>::const_iterator
iter = nb_list.begin(); iter != nb_list.end(); ++iter) {
std::string const &dentry = iter->dn;
leaf_locations.push_back(Location(dir_ino, dentry));
}
list<remotebit> const &rb_list = dl.get_dremote();
for (list<remotebit>::const_iterator
iter = rb_list.begin(); iter != rb_list.end(); ++iter) {
std::string const &dentry = iter->dn;
leaf_locations.push_back(Location(dir_ino, dentry));
}
}
// For all the leaf locations identified, generate paths
for (std::vector<Location>::iterator i = leaf_locations.begin(); i != leaf_locations.end(); ++i) {
Location const &loc = *i;
std::string path = loc.second;
inodeno_t ino = loc.first;
while(ino_locations.find(ino) != ino_locations.end()) {
Location const &loc = ino_locations[ino];
if (!path.empty()) {
path = loc.second + "/" + path;
} else {
path = loc.second + path;
}
ino = loc.first;
}
paths.push_back(path);
}
}