189 	prt_printf(out, "is_subvol %llu deleted %llu parent %10u children %10u %10u subvol %u tree %u",  in bch2_snapshot_to_text()
193 	       le32_to_cpu(s.v->children[0]),  in bch2_snapshot_to_text()
194 	       le32_to_cpu(s.v->children[1]),  in bch2_snapshot_to_text()
227 	bkey_fsck_err_on(le32_to_cpu(s.v->children[0]) < le32_to_cpu(s.v->children[1]), c, err,  in bch2_snapshot_invalid()
229 			 "children not normalized");  in bch2_snapshot_invalid()
231 	bkey_fsck_err_on(s.v->children[0] && s.v->children[0] == s.v->children[1], c, err,  in bch2_snapshot_invalid()
236 		id = le32_to_cpu(s.v->children[i]);  in bch2_snapshot_invalid()
301 		t->children[0]	= le32_to_cpu(s.v->children[0]);  in __bch2_mark_snapshot()
302 		t->children[1]	= le32_to_cpu(s.v->children[1]);  in __bch2_mark_snapshot()
387 	child[0] = le32_to_cpu(snap.v->children[0]);  in bch2_snapshot_set_equiv()
388 	child[1] = le32_to_cpu(snap.v->children[1]);  in bch2_snapshot_set_equiv()
416 	return snapshot_t(c, id)->children[child];  in bch2_snapshot_child()
742 		if (le32_to_cpu(v.children[0]) != k.k->p.offset &&  in check_snapshot()
743 		    le32_to_cpu(v.children[1]) != k.k->p.offset) {  in check_snapshot()
751 	for (i = 0; i < 2 && s.children[i]; i++) {  in check_snapshot()
752 		id = le32_to_cpu(s.children[i]);  in check_snapshot()
904 	if (le32_to_cpu(s->children[0]) < le32_to_cpu(s->children[1]))  in normalize_snapshot_child_pointers()
905 		swap(s->children[0], s->children[1]);  in normalize_snapshot_child_pointers()
928 	BUG_ON(s.v->children[1]);  in bch2_snapshot_node_delete()
931 	child_id = le32_to_cpu(s.v->children[0]);  in bch2_snapshot_node_delete()
945 		/* find entry in parent->children for node being deleted */  in bch2_snapshot_node_delete()
947 			if (le32_to_cpu(parent->v.children[i]) == id)  in bch2_snapshot_node_delete()
955 		parent->v.children[i] = cpu_to_le32(child_id);  in bch2_snapshot_node_delete()
989 		BUG_ON(s.v->children[1]);  in bch2_snapshot_node_delete()
998 		if (s.v->children[0]) {  in bch2_snapshot_node_delete()
999 			s_t->v.root_snapshot = s.v->children[0];  in bch2_snapshot_node_delete()
1082  * Create new snapshot IDs as children of an existing snapshot ID:
1103 	if (n_parent->v.children[0] || n_parent->v.children[1]) {  in bch2_snapshot_node_create_children()
1104 		bch_err(trans->c, "Trying to add child snapshot nodes to parent that already has children");  in bch2_snapshot_node_create_children()
1114 	n_parent->v.children[0] = cpu_to_le32(new_snapids[0]);  in bch2_snapshot_node_create_children()
1115 	n_parent->v.children[1] = cpu_to_le32(new_snapids[1]);  in bch2_snapshot_node_create_children()
1254 	u32 children[2];  in bch2_snapshot_needs_delete()  local
1265 	children[0] = le32_to_cpu(snap.v->children[0]);  in bch2_snapshot_needs_delete()
1266 	children[1] = le32_to_cpu(snap.v->children[1]);  in bch2_snapshot_needs_delete()
1268 	ret   = bch2_snapshot_live(trans, children[0]) ?:  in bch2_snapshot_needs_delete()
1269 		bch2_snapshot_live(trans, children[1]);  in bch2_snapshot_needs_delete()
1383 	 * For every snapshot node: If we have no live children and it's not  in bch2_delete_dead_snapshots()
1468 	 * Fixing children of deleted snapshots can't be done completely  in bch2_delete_dead_snapshots()
1557 	return s->children[1] ?: s->children[0];  in bch2_snapshot_smallest_child()