-
Notifications
You must be signed in to change notification settings - Fork 509
/
tx.c
2517 lines (2060 loc) · 57.5 KB
/
tx.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
/*
* Copyright 2015-2017, Intel Corporation
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* * Neither the name of the copyright holder nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/*
* tx.c -- transactions implementation
*/
#include <inttypes.h>
#include <wchar.h>
#include "queue.h"
#include "ctree.h"
#include "obj.h"
#include "out.h"
#include "pmalloc.h"
#include "tx.h"
#include "valgrind_internal.h"
#define RANGE_FLAGS_MIN_BIT 48
#define RANGE_FLAGS_MASK (0xffffULL << RANGE_FLAGS_MIN_BIT)
#define RANGE_GET_SIZE(val) ((val) & ~RANGE_FLAGS_MASK)
#define RANGE_FLAG_NO_FLUSH (0x1ULL << RANGE_FLAGS_MIN_BIT)
struct tx_data {
SLIST_ENTRY(tx_data) tx_entry;
jmp_buf env;
};
struct tx {
PMEMobjpool *pop;
enum pobj_tx_stage stage;
int last_errnum;
struct lane_section *section;
SLIST_HEAD(txl, tx_lock_data) tx_locks;
SLIST_HEAD(txd, tx_data) tx_entries;
pmemobj_tx_callback stage_callback;
void *stage_callback_arg;
};
/*
* get_tx -- (internal) returns current transaction
*
* This function should be used only in high-level functions.
*/
static struct tx *
get_tx()
{
static __thread struct tx tx;
return &tx;
}
struct tx_lock_data {
union {
PMEMmutex *mutex;
PMEMrwlock *rwlock;
} lock;
enum pobj_tx_param lock_type;
SLIST_ENTRY(tx_lock_data) tx_lock;
};
struct tx_undo_runtime {
struct pvector_context *ctx[MAX_UNDO_TYPES];
};
#define MAX_MEMOPS_ENTRIES_PER_TX_ALLOC 2
#define MAX_TX_ALLOC_RESERVATIONS (MAX_MEMOPS_ENTRIES /\
MAX_MEMOPS_ENTRIES_PER_TX_ALLOC)
struct lane_tx_runtime {
unsigned lane_idx;
struct ctree *ranges;
uint64_t cache_offset;
struct tx_undo_runtime undo;
struct pobj_action alloc_actv[MAX_TX_ALLOC_RESERVATIONS];
int actvcnt; /* reservation count */
};
struct tx_alloc_args {
uint64_t flags;
const void *copy_ptr;
size_t copy_size;
};
#define COPY_ARGS(flags, copy_ptr, copy_size)\
(struct tx_alloc_args){flags, copy_ptr, copy_size}
#define ALLOC_ARGS(flags)\
(struct tx_alloc_args){flags, NULL, 0}
struct tx_add_range_args {
PMEMobjpool *pop;
uint64_t offset;
uint64_t size;
uint64_t flags;
};
/*
* tx_clr_flag -- flags for clearing undo log list
*/
enum tx_clr_flag {
/* remove and free each object */
TX_CLR_FLAG_FREE = 1 << 0,
/* clear valgrind state */
TX_CLR_FLAG_VG_CLEAN = 1 << 1,
/* remove from valgrind tx */
TX_CLR_FLAG_VG_TX_REMOVE = 1 << 2,
/*
* Conditionally remove and free each object, this is only safe in a
* single threaded context such as transaction recovery.
*/
TX_CLR_FLAG_FREE_IF_EXISTS = 1 << 3,
};
struct tx_parameters {
size_t cache_size;
size_t cache_threshold;
};
/*
* tx_params_new -- creates a new transactional parameters instance and fills it
* with default values.
*/
struct tx_parameters *
tx_params_new(void)
{
struct tx_parameters *tx_params = Malloc(sizeof(*tx_params));
if (tx_params == NULL)
return NULL;
tx_params->cache_size = TX_DEFAULT_RANGE_CACHE_SIZE;
tx_params->cache_threshold = TX_DEFAULT_RANGE_CACHE_THRESHOLD;
return tx_params;
}
/*
* tx_params_delete -- deletes transactional parameters instance
*/
void
tx_params_delete(struct tx_parameters *tx_params)
{
Free(tx_params);
}
static void
obj_tx_abort(int errnum, int user);
/*
* obj_tx_abort_err -- (internal) pmemobj_tx_abort variant that returns
* error code
*/
static inline int
obj_tx_abort_err(int errnum)
{
obj_tx_abort(errnum, 0);
return errnum;
}
/*
* obj_tx_abort_null -- (internal) pmemobj_tx_abort variant that returns
* null PMEMoid
*/
static inline PMEMoid
obj_tx_abort_null(int errnum)
{
obj_tx_abort(errnum, 0);
return OID_NULL;
}
/* ASSERT_IN_TX -- checks whether there's open transaction */
#define ASSERT_IN_TX(tx) do {\
if (tx->stage == TX_STAGE_NONE)\
FATAL("%s called outside of transaction", __func__);\
} while (0)
/* ASSERT_TX_STAGE_WORK -- checks whether current transaction stage is WORK */
#define ASSERT_TX_STAGE_WORK(tx) do {\
if (tx->stage != TX_STAGE_WORK)\
FATAL("%s called in invalid stage %d", __func__, tx->stage);\
} while (0)
/*
* constructor_tx_alloc -- (internal) constructor for normal alloc
*/
static int
constructor_tx_alloc(void *ctx, void *ptr, size_t usable_size, void *arg)
{
LOG(3, NULL);
ASSERTne(ptr, NULL);
ASSERTne(arg, NULL);
struct tx_alloc_args *args = arg;
/* do not report changes to the new object */
VALGRIND_ADD_TO_TX(ptr, usable_size);
if (args->flags & POBJ_FLAG_ZERO)
memset(ptr, 0, usable_size);
if (args->copy_ptr && args->copy_size != 0) {
memcpy(ptr, args->copy_ptr, args->copy_size);
}
return 0;
}
/*
* constructor_tx_add_range -- (internal) constructor for add_range
*/
static int
constructor_tx_add_range(void *ctx, void *ptr, size_t usable_size, void *arg)
{
LOG(3, NULL);
PMEMobjpool *pop = ctx;
ASSERTne(ptr, NULL);
ASSERTne(arg, NULL);
struct tx_add_range_args *args = arg;
struct tx_range *range = ptr;
const struct pmem_ops *p_ops = &pop->p_ops;
/* temporarily add the object copy to the transaction */
VALGRIND_ADD_TO_TX(range, sizeof(struct tx_range) + args->size);
range->offset = args->offset;
range->size = args->size;
void *src = OBJ_OFF_TO_PTR(args->pop, args->offset);
/* flush offset and size */
pmemops_flush(p_ops, range, sizeof(struct tx_range));
/* memcpy data and persist */
pmemops_memcpy_persist(p_ops, range->data, src, args->size);
VALGRIND_REMOVE_FROM_TX(range, sizeof(struct tx_range) + args->size);
/* do not report changes to the original object */
VALGRIND_ADD_TO_TX(src, args->size);
return 0;
}
/*
* tx_set_state -- (internal) set transaction state
*/
static inline void
tx_set_state(PMEMobjpool *pop, struct lane_tx_layout *layout, uint64_t state)
{
layout->state = state;
pmemops_persist(&pop->p_ops, &layout->state, sizeof(layout->state));
}
/*
* tx_clear_vec_entry -- (internal) clear undo log vector entry
*/
static void
tx_clear_vec_entry(PMEMobjpool *pop, uint64_t *entry)
{
VALGRIND_ADD_TO_TX(entry, sizeof(*entry));
*entry = 0;
pmemops_persist(&pop->p_ops, entry, sizeof(*entry));
VALGRIND_REMOVE_FROM_TX(entry, sizeof(*entry));
}
/*
* tx_free_vec_entry -- free the undo log vector entry
*/
static void
tx_free_vec_entry(PMEMobjpool *pop, uint64_t *entry)
{
pfree(pop, entry);
}
/*
* tx_free_existing_vec_entry -- free the undo log vector entry if it points to
* a valid object, otherwise zero it.
*/
static void
tx_free_existing_vec_entry(PMEMobjpool *pop, uint64_t *entry)
{
if (palloc_is_allocated(&pop->heap, *entry))
pfree(pop, entry);
else
tx_clear_vec_entry(pop, entry);
}
/*
* tx_clear_undo_log_vg -- (internal) tell Valgrind about removal from undo log
*/
static void
tx_clear_undo_log_vg(PMEMobjpool *pop, uint64_t off, enum tx_clr_flag flags)
{
#ifdef USE_VG_PMEMCHECK
if (!On_valgrind)
return;
/*
* Clean the valgrind state of the underlying memory for
* allocated objects in the undo log, so that not-persisted
* modifications after abort are not reported.
*/
if (flags & TX_CLR_FLAG_VG_CLEAN) {
void *ptr = OBJ_OFF_TO_PTR(pop, off);
size_t size = palloc_usable_size(&pop->heap, off);
VALGRIND_SET_CLEAN(ptr, size);
}
if (flags & TX_CLR_FLAG_VG_TX_REMOVE) {
/*
* This function can be called from transaction
* recovery, so in such case pmemobj_alloc_usable_size
* is not yet available. Use pmalloc version.
*/
size_t size = palloc_usable_size(&pop->heap, off);
VALGRIND_REMOVE_FROM_TX(OBJ_OFF_TO_PTR(pop, off), size);
}
#endif
}
/*
* tx_clear_undo_log -- (internal) clear undo log pointed by head
*/
static void
tx_clear_undo_log(PMEMobjpool *pop, struct pvector_context *undo, int nskip,
enum tx_clr_flag flags)
{
LOG(3, NULL);
uint64_t val;
while ((val = pvector_last(undo)) != 0) {
tx_clear_undo_log_vg(pop, val, flags);
if (nskip > 0) {
nskip--;
pvector_pop_back(undo, tx_clear_vec_entry);
continue;
}
if (flags & TX_CLR_FLAG_FREE) {
pvector_pop_back(undo, tx_free_vec_entry);
} else if (flags & TX_CLR_FLAG_FREE_IF_EXISTS) {
pvector_pop_back(undo, tx_free_existing_vec_entry);
} else {
pvector_pop_back(undo, tx_clear_vec_entry);
}
}
}
/*
* tx_abort_alloc -- (internal) abort all allocated objects
*/
static void
tx_abort_alloc(PMEMobjpool *pop, struct tx_undo_runtime *tx_rt,
struct lane_tx_runtime *lane)
{
LOG(3, NULL);
/*
* If not in recovery, the active reservations present in the undo log
* need to be removed from the undo log without deallocating.
*/
enum tx_clr_flag flags = TX_CLR_FLAG_VG_TX_REMOVE |
TX_CLR_FLAG_VG_CLEAN |
(lane ? TX_CLR_FLAG_FREE : TX_CLR_FLAG_FREE_IF_EXISTS);
tx_clear_undo_log(pop, tx_rt->ctx[UNDO_ALLOC], lane ? lane->actvcnt : 0,
flags);
}
/*
* tx_abort_free -- (internal) abort all freeing objects
*/
static void
tx_abort_free(PMEMobjpool *pop, struct tx_undo_runtime *tx_rt)
{
LOG(3, NULL);
tx_clear_undo_log(pop, tx_rt->ctx[UNDO_FREE], 0, 0);
}
struct tx_range_data {
void *begin;
void *end;
SLIST_ENTRY(tx_range_data) tx_range;
};
SLIST_HEAD(txr, tx_range_data);
/*
* tx_remove_range -- (internal) removes specified range from ranges list
*/
static void
tx_remove_range(struct txr *tx_ranges, void *begin, void *end)
{
struct tx_range_data *txr = SLIST_FIRST(tx_ranges);
while (txr) {
if (begin >= txr->end || end < txr->begin) {
txr = SLIST_NEXT(txr, tx_range);
continue;
}
LOG(4, "detected PMEM lock in undo log; "
"range %p-%p, lock %p-%p",
txr->begin, txr->end, begin, end);
/* split the range into new ones */
if (begin > txr->begin) {
struct tx_range_data *txrn = Malloc(sizeof(*txrn));
if (txrn == NULL)
FATAL("!Malloc");
txrn->begin = txr->begin;
txrn->end = begin;
LOG(4, "range split; %p-%p", txrn->begin, txrn->end);
SLIST_INSERT_HEAD(tx_ranges, txrn, tx_range);
}
if (end < txr->end) {
struct tx_range_data *txrn = Malloc(sizeof(*txrn));
if (txrn == NULL)
FATAL("!Malloc");
txrn->begin = end;
txrn->end = txr->end;
LOG(4, "range split; %p-%p", txrn->begin, txrn->end);
SLIST_INSERT_HEAD(tx_ranges, txrn, tx_range);
}
struct tx_range_data *next = SLIST_NEXT(txr, tx_range);
/* remove the original range from the list */
SLIST_REMOVE(tx_ranges, txr, tx_range_data, tx_range);
Free(txr);
txr = next;
}
}
/*
* tx_restore_range -- (internal) restore a single range from undo log
*
* If the snapshot contains any PMEM locks that are held by the current
* transaction, they won't be overwritten with the saved data to avoid changing
* their state. Those locks will be released in tx_end().
*/
static void
tx_restore_range(PMEMobjpool *pop, struct tx *tx, struct tx_range *range)
{
COMPILE_ERROR_ON(sizeof(PMEMmutex) != _POBJ_CL_SIZE);
COMPILE_ERROR_ON(sizeof(PMEMrwlock) != _POBJ_CL_SIZE);
COMPILE_ERROR_ON(sizeof(PMEMcond) != _POBJ_CL_SIZE);
struct lane_tx_runtime *runtime =
(struct lane_tx_runtime *)tx->section->runtime;
ASSERTne(runtime, NULL);
struct txr tx_ranges;
SLIST_INIT(&tx_ranges);
struct tx_range_data *txr;
txr = Malloc(sizeof(*txr));
if (txr == NULL) {
FATAL("!Malloc");
}
txr->begin = OBJ_OFF_TO_PTR(pop, range->offset);
txr->end = (char *)txr->begin + range->size;
SLIST_INSERT_HEAD(&tx_ranges, txr, tx_range);
struct tx_lock_data *txl;
/* check if there are any locks within given memory range */
SLIST_FOREACH(txl, &tx->tx_locks, tx_lock) {
void *lock_begin = txl->lock.mutex;
/* all PMEM locks have the same size */
void *lock_end = (char *)lock_begin + _POBJ_CL_SIZE;
tx_remove_range(&tx_ranges, lock_begin, lock_end);
}
ASSERT(!SLIST_EMPTY(&tx_ranges));
void *dst_ptr = OBJ_OFF_TO_PTR(pop, range->offset);
while (!SLIST_EMPTY(&tx_ranges)) {
txr = SLIST_FIRST(&tx_ranges);
SLIST_REMOVE_HEAD(&tx_ranges, tx_range);
/* restore partial range data from snapshot */
ASSERT((char *)txr->begin >= (char *)dst_ptr);
uint8_t *src = &range->data[
(char *)txr->begin - (char *)dst_ptr];
ASSERT((char *)txr->end >= (char *)txr->begin);
size_t size = (size_t)((char *)txr->end - (char *)txr->begin);
pmemops_memcpy_persist(&pop->p_ops, txr->begin, src, size);
Free(txr);
}
}
/*
* tx_foreach_set -- (internal) iterates over every memory range
*/
static void
tx_foreach_set(PMEMobjpool *pop, struct tx *tx, struct tx_undo_runtime *tx_rt,
void (*cb)(PMEMobjpool *pop, struct tx *tx, struct tx_range *range))
{
LOG(3, NULL);
struct tx_range *range = NULL;
uint64_t off;
struct pvector_context *ctx = tx_rt->ctx[UNDO_SET];
for (off = pvector_first(ctx); off != 0; off = pvector_next(ctx)) {
range = OBJ_OFF_TO_PTR(pop, off);
cb(pop, tx, range);
}
struct tx_range_cache *cache;
uint64_t cache_size;
ctx = tx_rt->ctx[UNDO_SET_CACHE];
for (off = pvector_first(ctx); off != 0; off = pvector_next(ctx)) {
cache = OBJ_OFF_TO_PTR(pop, off);
cache_size = palloc_usable_size(&pop->heap, off);
for (uint64_t cache_offset = 0; cache_offset < cache_size; ) {
range = (struct tx_range *)
((char *)cache + cache_offset);
if (range->offset == 0 || range->size == 0)
break;
cb(pop, tx, range);
size_t amask = pop->conversion_flags &
CONVERSION_FLAG_OLD_SET_CACHE ?
TX_RANGE_MASK_LEGACY : TX_RANGE_MASK;
cache_offset += TX_ALIGN_SIZE(range->size, amask) +
sizeof(struct tx_range);
}
}
}
/*
* tx_abort_restore_range -- (internal) restores content of the memory range
*/
static void
tx_abort_restore_range(PMEMobjpool *pop, struct tx *tx, struct tx_range *range)
{
tx_restore_range(pop, tx, range);
VALGRIND_REMOVE_FROM_TX(OBJ_OFF_TO_PTR(pop, range->offset),
range->size);
}
/*
* tx_abort_recover_range -- (internal) restores content while skipping locks
*/
static void
tx_abort_recover_range(PMEMobjpool *pop, struct tx *tx, struct tx_range *range)
{
ASSERTeq(tx, NULL);
void *ptr = OBJ_OFF_TO_PTR(pop, range->offset);
pmemops_memcpy_persist(&pop->p_ops, ptr, range->data, range->size);
}
/*
* tx_clear_set_cache_but_first -- (internal) removes all but the first cache
* from the UNDO_SET_CACHE vector
*
* Only the valgrind related flags are valid for the vg_flags variable.
*/
static void
tx_clear_set_cache_but_first(PMEMobjpool *pop, struct tx_undo_runtime *tx_rt,
struct tx *tx, enum tx_clr_flag vg_flags)
{
LOG(3, NULL);
struct pvector_context *cache_undo = tx_rt->ctx[UNDO_SET_CACHE];
uint64_t first_cache = pvector_first(cache_undo);
if (first_cache == 0)
return;
uint64_t off;
int zero_all = tx == NULL;
while ((off = pvector_last(cache_undo)) != first_cache) {
tx_clear_undo_log_vg(pop, off, vg_flags);
pvector_pop_back(cache_undo, tx_free_vec_entry);
zero_all = 1;
}
tx_clear_undo_log_vg(pop, first_cache, vg_flags);
struct tx_range_cache *cache = OBJ_OFF_TO_PTR(pop, first_cache);
size_t sz;
if (zero_all) {
sz = palloc_usable_size(&pop->heap, first_cache);
} else {
ASSERTne(tx, NULL);
struct lane_tx_runtime *r = tx->section->runtime;
sz = r->cache_offset;
}
if (sz) {
VALGRIND_ADD_TO_TX(cache, sz);
pmemops_memset_persist(&pop->p_ops, cache, 0, sz);
VALGRIND_REMOVE_FROM_TX(cache, sz);
}
#ifdef DEBUG
if (!zero_all && /* for recovery we know we zeroed everything */
!pop->tx_debug_skip_expensive_checks) {
uint64_t usable_size = palloc_usable_size(&pop->heap,
first_cache);
ASSERTeq(util_is_zeroed(cache, usable_size), 1);
}
#endif
}
/*
* tx_abort_set -- (internal) abort all set operations
*/
static void
tx_abort_set(PMEMobjpool *pop, struct tx_undo_runtime *tx_rt, int recovery)
{
LOG(3, NULL);
struct tx *tx = recovery ? NULL : get_tx();
if (recovery)
tx_foreach_set(pop, NULL, tx_rt, tx_abort_recover_range);
else
tx_foreach_set(pop, tx, tx_rt, tx_abort_restore_range);
if (recovery) /* if recovering from a crash, remove all of the caches */
tx_clear_undo_log(pop, tx_rt->ctx[UNDO_SET_CACHE], 0,
TX_CLR_FLAG_FREE | TX_CLR_FLAG_VG_CLEAN);
else /* otherwise leave the first one */
tx_clear_set_cache_but_first(pop, tx_rt, tx,
TX_CLR_FLAG_VG_CLEAN);
tx_clear_undo_log(pop, tx_rt->ctx[UNDO_SET], 0,
TX_CLR_FLAG_FREE | TX_CLR_FLAG_VG_CLEAN);
}
/*
* tx_post_commit_alloc -- (internal) do post commit operations for
* allocated objects
*/
static void
tx_post_commit_alloc(PMEMobjpool *pop, struct tx_undo_runtime *tx_rt)
{
LOG(3, NULL);
tx_clear_undo_log(pop, tx_rt->ctx[UNDO_ALLOC], 0,
TX_CLR_FLAG_VG_TX_REMOVE);
}
/*
* tx_post_commit_free -- (internal) do post commit operations for
* freeing objects
*/
static void
tx_post_commit_free(PMEMobjpool *pop, struct tx_undo_runtime *tx_rt)
{
LOG(3, NULL);
tx_clear_undo_log(pop, tx_rt->ctx[UNDO_FREE], 0,
TX_CLR_FLAG_FREE | TX_CLR_FLAG_VG_TX_REMOVE);
}
#ifdef USE_VG_PMEMCHECK
/*
* tx_post_commit_range_vg_tx_remove -- (internal) removes object from
* transaction tracked by pmemcheck
*/
static void
tx_post_commit_range_vg_tx_remove(PMEMobjpool *pop, struct tx *tx,
struct tx_range *range)
{
VALGRIND_REMOVE_FROM_TX(OBJ_OFF_TO_PTR(pop, range->offset),
range->size);
}
#endif
/*
* tx_post_commit_set -- (internal) do post commit operations for
* add range
*/
static void
tx_post_commit_set(PMEMobjpool *pop, struct tx *tx,
struct tx_undo_runtime *tx_rt, int recovery)
{
LOG(3, NULL);
#ifdef USE_VG_PMEMCHECK
if (On_valgrind)
tx_foreach_set(pop, tx, tx_rt,
tx_post_commit_range_vg_tx_remove);
#endif
if (recovery) /* if recovering from a crash, remove all of the caches */
tx_clear_undo_log(pop, tx_rt->ctx[UNDO_SET_CACHE], 0,
TX_CLR_FLAG_FREE);
else /* otherwise leave the first one */
tx_clear_set_cache_but_first(pop, tx_rt, tx, 0);
tx_clear_undo_log(pop, tx_rt->ctx[UNDO_SET], 0, TX_CLR_FLAG_FREE);
}
/*
* tx_flush_range -- (internal) flush one range
*/
static void
tx_flush_range(uint64_t offset, uint64_t size_flags, void *ctx)
{
if (size_flags & RANGE_FLAG_NO_FLUSH)
return;
PMEMobjpool *pop = ctx;
pmemops_flush(&pop->p_ops, OBJ_OFF_TO_PTR(pop, offset),
RANGE_GET_SIZE(size_flags));
}
/*
* tx_fulfill_reservations -- fulfills all volatile state
* allocation reservations
*/
static void
tx_fulfill_reservations(struct tx *tx)
{
struct lane_tx_runtime *lane =
(struct lane_tx_runtime *)tx->section->runtime;
if (lane->actvcnt == 0)
return;
PMEMobjpool *pop = tx->pop;
struct redo_log *redo = pmalloc_redo_hold(pop);
struct operation_context ctx;
operation_init(&ctx, pop, pop->redo, redo);
palloc_publish(&pop->heap, lane->alloc_actv, lane->actvcnt, &ctx);
lane->actvcnt = 0;
pmalloc_redo_release(pop);
}
/*
* tx_cancel_reservations -- cancels all volatile state allocation reservations
*/
static void
tx_cancel_reservations(PMEMobjpool *pop, struct lane_tx_runtime *lane)
{
palloc_cancel(&pop->heap, lane->alloc_actv, lane->actvcnt);
lane->actvcnt = 0;
}
/*
* tx_pre_commit -- (internal) do pre-commit operations
*/
static void
tx_pre_commit(PMEMobjpool *pop, struct tx *tx, struct lane_tx_runtime *lane)
{
LOG(3, NULL);
ASSERTne(tx->section->runtime, NULL);
tx_fulfill_reservations(tx);
/* Flush all regions and destroy the whole tree. */
ctree_delete_cb(lane->ranges, tx_flush_range, pop);
lane->ranges = NULL;
}
/*
* tx_rebuild_undo_runtime -- (internal) reinitializes runtime state of vectors
*/
static int
tx_rebuild_undo_runtime(PMEMobjpool *pop, struct lane_tx_layout *layout,
struct tx_undo_runtime *tx_rt)
{
LOG(3, NULL);
int i;
for (i = UNDO_ALLOC; i < MAX_UNDO_TYPES; ++i) {
if (tx_rt->ctx[i] == NULL)
tx_rt->ctx[i] = pvector_new(pop, &layout->undo_log[i]);
else
pvector_reinit(tx_rt->ctx[i]);
if (tx_rt->ctx[i] == NULL)
goto error_init;
}
return 0;
error_init:
for (--i; i >= 0; --i)
pvector_delete(tx_rt->ctx[i]);
return -1;
}
/*
* tx_destroy_undo_runtime -- (internal) destroys runtime state of undo logs
*/
static void
tx_destroy_undo_runtime(struct tx_undo_runtime *tx)
{
LOG(3, NULL);
for (int i = UNDO_ALLOC; i < MAX_UNDO_TYPES; ++i)
pvector_delete(tx->ctx[i]);
}
/*
* tx_post_commit -- (internal) do post commit operations
*/
static void
tx_post_commit(PMEMobjpool *pop, struct tx *tx, struct lane_tx_layout *layout,
int recovery)
{
LOG(3, NULL);
struct tx_undo_runtime *tx_rt;
struct tx_undo_runtime new_rt = { .ctx = {NULL, } };
if (recovery) {
if (tx_rebuild_undo_runtime(pop, layout, &new_rt) != 0)
FATAL("!Cannot rebuild runtime undo log state");
tx_rt = &new_rt;
} else {
struct lane_tx_runtime *lane = tx->section->runtime;
tx_rt = &lane->undo;
}
tx_post_commit_set(pop, tx, tx_rt, recovery);
tx_post_commit_alloc(pop, tx_rt);
tx_post_commit_free(pop, tx_rt);
if (recovery)
tx_destroy_undo_runtime(tx_rt);
}
#ifdef USE_VG_MEMCHECK
/*
* tx_abort_register_valgrind -- tells Valgrind about objects from specified
* undo log
*/
static void
tx_abort_register_valgrind(PMEMobjpool *pop, struct pvector_context *ctx)
{
uint64_t off;
for (off = pvector_first(ctx); off != 0; off = pvector_next(ctx)) {
/*
* Can't use pmemobj_direct and pmemobj_alloc_usable_size
* because pool has not been registered yet.
*/
void *p = (char *)pop + off;
size_t sz = palloc_usable_size(&pop->heap, off);
VALGRIND_DO_MEMPOOL_ALLOC(pop->heap.layout, p, sz);
VALGRIND_DO_MAKE_MEM_DEFINED(p, sz);
}
}
#endif
/*
* tx_abort -- (internal) abort all allocated objects
*/
static void
tx_abort(PMEMobjpool *pop, struct lane_tx_runtime *lane,
struct lane_tx_layout *layout, int recovery)
{
LOG(3, NULL);
struct tx_undo_runtime *tx_rt;
struct tx_undo_runtime new_rt = { .ctx = {NULL, } };
if (recovery) {
if (tx_rebuild_undo_runtime(pop, layout, &new_rt) != 0)
FATAL("!Cannot rebuild runtime undo log state");
tx_rt = &new_rt;
} else {
tx_rt = &lane->undo;
}
#ifdef USE_VG_MEMCHECK
if (recovery && On_valgrind) {
tx_abort_register_valgrind(pop, tx_rt->ctx[UNDO_SET]);
tx_abort_register_valgrind(pop, tx_rt->ctx[UNDO_ALLOC]);
tx_abort_register_valgrind(pop, tx_rt->ctx[UNDO_SET_CACHE]);
}
#endif
tx_abort_set(pop, tx_rt, recovery);
tx_abort_alloc(pop, tx_rt, lane);
tx_abort_free(pop, tx_rt);
if (recovery) {
tx_destroy_undo_runtime(tx_rt);
} else {
tx_cancel_reservations(pop, lane);
ASSERTne(lane, NULL);
ctree_delete(lane->ranges);
lane->ranges = NULL;
}
}
/*
* tx_get_pop -- returns the current transaction's pool handle, NULL if not
* within a transaction.
*/
PMEMobjpool *
tx_get_pop(void)
{
return get_tx()->pop;
}
/*
* add_to_tx_and_lock -- (internal) add lock to the transaction and acquire it
*/
static int
add_to_tx_and_lock(struct tx *tx, enum pobj_tx_param type, void *lock)
{
LOG(15, NULL);
int retval = 0;
struct tx_lock_data *txl;
/* check if the lock is already on the list */
SLIST_FOREACH(txl, &tx->tx_locks, tx_lock) {
if (memcmp(&txl->lock, &lock, sizeof(lock)) == 0)
return 0;
}
txl = Malloc(sizeof(*txl));
if (txl == NULL)
return ENOMEM;
txl->lock_type = type;
switch (txl->lock_type) {
case TX_PARAM_MUTEX:
txl->lock.mutex = lock;
retval = pmemobj_mutex_lock(tx->pop,
txl->lock.mutex);
if (retval) {
errno = retval;
ERR("!pmemobj_mutex_lock");
}
break;
case TX_PARAM_RWLOCK:
txl->lock.rwlock = lock;
retval = pmemobj_rwlock_wrlock(tx->pop,
txl->lock.rwlock);
if (retval) {
errno = retval;
ERR("!pmemobj_rwlock_wrlock");
}
break;
default: