Lines Matching refs:children

208 	prt_printf(out, "is_subvol %llu deleted %llu parent %10u children %10u %10u subvol %u tree %u",
212 le32_to_cpu(s.v->children[0]),
213 le32_to_cpu(s.v->children[1]),
246 bkey_fsck_err_on(le32_to_cpu(s.v->children[0]) < le32_to_cpu(s.v->children[1]), c, err,
248 "children not normalized");
250 bkey_fsck_err_on(s.v->children[0] && s.v->children[0] == s.v->children[1], c, err,
255 id = le32_to_cpu(s.v->children[i]);
320 t->children[0] = le32_to_cpu(s.v->children[0]);
321 t->children[1] = le32_to_cpu(s.v->children[1]);
406 child[0] = le32_to_cpu(snap.v->children[0]);
407 child[1] = le32_to_cpu(snap.v->children[1]);
435 return snapshot_t(c, id)->children[child];
767 if (le32_to_cpu(v.children[0]) != k.k->p.offset &&
768 le32_to_cpu(v.children[1]) != k.k->p.offset) {
776 for (i = 0; i < 2 && s.children[i]; i++) {
777 id = le32_to_cpu(s.children[i]);
1077 if (le32_to_cpu(s->children[0]) < le32_to_cpu(s->children[1]))
1078 swap(s->children[0], s->children[1]);
1101 BUG_ON(s.v->children[1]);
1104 child_id = le32_to_cpu(s.v->children[0]);
1118 /* find entry in parent->children for node being deleted */
1120 if (le32_to_cpu(parent->v.children[i]) == id)
1128 parent->v.children[i] = cpu_to_le32(child_id);
1162 BUG_ON(s.v->children[1]);
1171 if (s.v->children[0]) {
1172 s_t->v.root_snapshot = s.v->children[0];
1255 * Create new snapshot IDs as children of an existing snapshot ID:
1276 if (n_parent->v.children[0] || n_parent->v.children[1]) {
1277 bch_err(trans->c, "Trying to add child snapshot nodes to parent that already has children");
1287 n_parent->v.children[0] = cpu_to_le32(new_snapids[0]);
1288 n_parent->v.children[1] = cpu_to_le32(new_snapids[1]);
1427 u32 children[2];
1438 children[0] = le32_to_cpu(snap.v->children[0]);
1439 children[1] = le32_to_cpu(snap.v->children[1]);
1441 ret = bch2_snapshot_live(trans, children[0]) ?:
1442 bch2_snapshot_live(trans, children[1]);
1556 * For every snapshot node: If we have no live children and it's not
1641 * Fixing children of deleted snapshots can't be done completely
1730 return s->children[1] ?: s->children[0];