Orange Pi5 kernel

^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300   1) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300   2)  * Copyright (C) 2011 Red Hat, Inc.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300   3)  *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300   4)  * This file is released under the GPL.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300   5)  */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300   6) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300   7) #include "dm-btree-internal.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300   8) #include "dm-transaction-manager.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300   9) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  10) #include <linux/device-mapper.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  11) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  12) #define DM_MSG_PREFIX "btree spine"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  13) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  14) /*----------------------------------------------------------------*/
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  15) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  16) #define BTREE_CSUM_XOR 121107
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  17) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  18) static int node_check(struct dm_block_validator *v,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  19) 		      struct dm_block *b,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  20) 		      size_t block_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  21) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  22) static void node_prepare_for_write(struct dm_block_validator *v,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  23) 				   struct dm_block *b,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  24) 				   size_t block_size)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  25) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  26) 	struct btree_node *n = dm_block_data(b);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  27) 	struct node_header *h = &n->header;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  28) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  29) 	h->blocknr = cpu_to_le64(dm_block_location(b));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  30) 	h->csum = cpu_to_le32(dm_bm_checksum(&h->flags,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  31) 					     block_size - sizeof(__le32),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  32) 					     BTREE_CSUM_XOR));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  33) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  34) 	BUG_ON(node_check(v, b, 4096));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  35) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  36) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  37) static int node_check(struct dm_block_validator *v,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  38) 		      struct dm_block *b,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  39) 		      size_t block_size)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  40) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  41) 	struct btree_node *n = dm_block_data(b);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  42) 	struct node_header *h = &n->header;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  43) 	size_t value_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  44) 	__le32 csum_disk;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  45) 	uint32_t flags;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  46) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  47) 	if (dm_block_location(b) != le64_to_cpu(h->blocknr)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  48) 		DMERR_LIMIT("node_check failed: blocknr %llu != wanted %llu",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  49) 			    le64_to_cpu(h->blocknr), dm_block_location(b));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  50) 		return -ENOTBLK;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  51) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  52) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  53) 	csum_disk = cpu_to_le32(dm_bm_checksum(&h->flags,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  54) 					       block_size - sizeof(__le32),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  55) 					       BTREE_CSUM_XOR));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  56) 	if (csum_disk != h->csum) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  57) 		DMERR_LIMIT("node_check failed: csum %u != wanted %u",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  58) 			    le32_to_cpu(csum_disk), le32_to_cpu(h->csum));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  59) 		return -EILSEQ;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  60) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  61) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  62) 	value_size = le32_to_cpu(h->value_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  63) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  64) 	if (sizeof(struct node_header) +
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  65) 	    (sizeof(__le64) + value_size) * le32_to_cpu(h->max_entries) > block_size) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  66) 		DMERR_LIMIT("node_check failed: max_entries too large");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  67) 		return -EILSEQ;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  68) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  69) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  70) 	if (le32_to_cpu(h->nr_entries) > le32_to_cpu(h->max_entries)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  71) 		DMERR_LIMIT("node_check failed: too many entries");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  72) 		return -EILSEQ;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  73) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  74) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  75) 	/*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  76) 	 * The node must be either INTERNAL or LEAF.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  77) 	 */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  78) 	flags = le32_to_cpu(h->flags);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  79) 	if (!(flags & INTERNAL_NODE) && !(flags & LEAF_NODE)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  80) 		DMERR_LIMIT("node_check failed: node is neither INTERNAL or LEAF");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  81) 		return -EILSEQ;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  82) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  83) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  84) 	return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  85) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  86) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  87) struct dm_block_validator btree_node_validator = {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  88) 	.name = "btree_node",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  89) 	.prepare_for_write = node_prepare_for_write,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  90) 	.check = node_check
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  91) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  92) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  93) /*----------------------------------------------------------------*/
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  94) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  95) int bn_read_lock(struct dm_btree_info *info, dm_block_t b,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  96) 		 struct dm_block **result)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  97) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  98) 	return dm_tm_read_lock(info->tm, b, &btree_node_validator, result);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  99) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 100) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 101) static int bn_shadow(struct dm_btree_info *info, dm_block_t orig,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 102) 	      struct dm_btree_value_type *vt,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 103) 	      struct dm_block **result)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 104) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 105) 	int r, inc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 106) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 107) 	r = dm_tm_shadow_block(info->tm, orig, &btree_node_validator,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 108) 			       result, &inc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 109) 	if (!r && inc)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 110) 		inc_children(info->tm, dm_block_data(*result), vt);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 111) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 112) 	return r;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 113) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 114) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 115) int new_block(struct dm_btree_info *info, struct dm_block **result)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 116) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 117) 	return dm_tm_new_block(info->tm, &btree_node_validator, result);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 118) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 119) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 120) void unlock_block(struct dm_btree_info *info, struct dm_block *b)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 121) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 122) 	dm_tm_unlock(info->tm, b);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 123) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 124) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 125) /*----------------------------------------------------------------*/
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 126) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 127) void init_ro_spine(struct ro_spine *s, struct dm_btree_info *info)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 128) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 129) 	s->info = info;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 130) 	s->count = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 131) 	s->nodes[0] = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 132) 	s->nodes[1] = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 133) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 134) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 135) void exit_ro_spine(struct ro_spine *s)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 136) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 137) 	int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 138) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 139) 	for (i = 0; i < s->count; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 140) 		unlock_block(s->info, s->nodes[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 141) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 142) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 143) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 144) int ro_step(struct ro_spine *s, dm_block_t new_child)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 145) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 146) 	int r;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 147) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 148) 	if (s->count == 2) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 149) 		unlock_block(s->info, s->nodes[0]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 150) 		s->nodes[0] = s->nodes[1];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 151) 		s->count--;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 152) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 153) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 154) 	r = bn_read_lock(s->info, new_child, s->nodes + s->count);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 155) 	if (!r)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 156) 		s->count++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 157) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 158) 	return r;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 159) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 160) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 161) void ro_pop(struct ro_spine *s)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 162) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 163) 	BUG_ON(!s->count);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 164) 	--s->count;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 165) 	unlock_block(s->info, s->nodes[s->count]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 166) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 167) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 168) struct btree_node *ro_node(struct ro_spine *s)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 169) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 170) 	struct dm_block *block;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 171) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 172) 	BUG_ON(!s->count);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 173) 	block = s->nodes[s->count - 1];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 174) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 175) 	return dm_block_data(block);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 176) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 177) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 178) /*----------------------------------------------------------------*/
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 179) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 180) void init_shadow_spine(struct shadow_spine *s, struct dm_btree_info *info)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 181) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 182) 	s->info = info;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 183) 	s->count = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 184) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 185) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 186) int exit_shadow_spine(struct shadow_spine *s)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 187) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 188) 	int r = 0, i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 189) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 190) 	for (i = 0; i < s->count; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 191) 		unlock_block(s->info, s->nodes[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 192) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 193) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 194) 	return r;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 195) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 196) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 197) int shadow_step(struct shadow_spine *s, dm_block_t b,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 198) 		struct dm_btree_value_type *vt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 199) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 200) 	int r;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 201) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 202) 	if (s->count == 2) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 203) 		unlock_block(s->info, s->nodes[0]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 204) 		s->nodes[0] = s->nodes[1];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 205) 		s->count--;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 206) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 207) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 208) 	r = bn_shadow(s->info, b, vt, s->nodes + s->count);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 209) 	if (!r) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 210) 		if (!s->count)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 211) 			s->root = dm_block_location(s->nodes[0]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 212) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 213) 		s->count++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 214) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 215) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 216) 	return r;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 217) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 218) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 219) struct dm_block *shadow_current(struct shadow_spine *s)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 220) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 221) 	BUG_ON(!s->count);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 222) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 223) 	return s->nodes[s->count - 1];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 224) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 225) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 226) struct dm_block *shadow_parent(struct shadow_spine *s)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 227) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 228) 	BUG_ON(s->count != 2);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 229) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 230) 	return s->count == 2 ? s->nodes[0] : NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 231) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 232) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 233) int shadow_has_parent(struct shadow_spine *s)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 234) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 235) 	return s->count >= 2;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 236) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 237) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 238) int shadow_root(struct shadow_spine *s)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 239) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 240) 	return s->root;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 241) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 242) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 243) static void le64_inc(void *context, const void *value_le)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 244) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 245) 	struct dm_transaction_manager *tm = context;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 246) 	__le64 v_le;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 247) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 248) 	memcpy(&v_le, value_le, sizeof(v_le));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 249) 	dm_tm_inc(tm, le64_to_cpu(v_le));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 250) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 251) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 252) static void le64_dec(void *context, const void *value_le)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 253) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 254) 	struct dm_transaction_manager *tm = context;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 255) 	__le64 v_le;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 256) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 257) 	memcpy(&v_le, value_le, sizeof(v_le));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 258) 	dm_tm_dec(tm, le64_to_cpu(v_le));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 259) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 260) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 261) static int le64_equal(void *context, const void *value1_le, const void *value2_le)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 262) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 263) 	__le64 v1_le, v2_le;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 264) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 265) 	memcpy(&v1_le, value1_le, sizeof(v1_le));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 266) 	memcpy(&v2_le, value2_le, sizeof(v2_le));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 267) 	return v1_le == v2_le;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 268) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 269) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 270) void init_le64_type(struct dm_transaction_manager *tm,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 271) 		    struct dm_btree_value_type *vt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 272) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 273) 	vt->context = tm;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 274) 	vt->size = sizeof(__le64);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 275) 	vt->inc = le64_inc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 276) 	vt->dec = le64_dec;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 277) 	vt->equal = le64_equal;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 278) }