PTR_FMT
" fblk "PTR_FMT" blkno %llu index %d magic 0x%x",
"page discard on page "PTR_FMT", inode 0x%llx, pos %llu.",
"Bad inode buffer log record (ptr = "PTR_FMT", bp = "PTR_FMT"). "
"%s: Bad inode %llu magic number 0x%x, ptr "PTR_FMT,
"%s: Bad %s meta btree inode %Lu, ptr "PTR_FMT,
"%s: Bad regular inode %llu, ptr "PTR_FMT,
"%s: Bad directory inode %llu, ptr "PTR_FMT,
"total extents = %llu nblocks = %lld, ptr "PTR_FMT,
"%s: bad inode %llu, forkoff 0x%x, ptr "PTR_FMT,
"%s: meta btree in inode %Lu attr fork, ptr "PTR_FMT,
"%s: Bad inode magic number, dip = "PTR_FMT", dino bp = "PTR_FMT", ino = %lld",
"%s: Bad inode log record, rec ptr "PTR_FMT", ino %lld",
"%s: op %d invalid clientid %d op "PTR_FMT" offset 0x%lx",
pr_err("Error %lX > %lX " PTR_FMT "\n", mas->index, mas->last,
pr_cont("value %ld (0x%lx) [" PTR_FMT "]\n", xa_to_value(entry),
pr_cont("UNKNOWN ENTRY (" PTR_FMT ")\n", entry);
pr_cont(PTR_FMT "\n", entry);
pr_cont(PTR_FMT " %lX ", node->slot[i], node->pivot[i]);
pr_cont(PTR_FMT " %lu ", node->slot[i], node->pivot[i]);
pr_cont(PTR_FMT "\n", node->slot[i]);
pr_err("node " PTR_FMT " last (%lx) > max (%lx) at pivot %d!\n",
pr_err("node " PTR_FMT " last (%lu) > max (%lu) at pivot %d!\n",
pr_cont(PTR_FMT " %lX ", node->slot[i], node->pivot[i]);
pr_cont(PTR_FMT " %lu ", node->slot[i], node->pivot[i]);
pr_cont(PTR_FMT "\n", node->slot[i]);
pr_err("node " PTR_FMT " last (%lx) > max (%lx) at pivot %d!\n",
pr_err("node " PTR_FMT " last (%lu) > max (%lu) at pivot %d!\n",
pr_cont("node " PTR_FMT " depth %d type %d parent " PTR_FMT, node,
pr_info("maple_tree(" PTR_FMT ") flags %X, height %u root " PTR_FMT "\n",
pr_err(PTR_FMT "[%u] %lu >= %lu - %lu + 1 (%lu)\n",
pr_err("gap offset " PTR_FMT "[%u] is invalid\n", node, offset);
pr_err("gap " PTR_FMT "[%u] is not the largest gap %lu\n",
pr_err("gap " PTR_FMT "[%u] beyond node limit != 0\n",
pr_err("gap " PTR_FMT "[%u] != %lu\n", p_mn, p_slot, max_gap);
pr_err("parent " PTR_FMT "[%u] does not have " PTR_FMT "\n",
pr_err("Invalid child " PTR_FMT " at parent " PTR_FMT "[%u] p_slot %u\n",
pr_err("Non-leaf node lacks child at " PTR_FMT "[%u]\n",
pr_err("Slot error at " PTR_FMT "[%u]: child " PTR_FMT " has pslot %u\n",
pr_err("child " PTR_FMT " has parent " PTR_FMT " not " PTR_FMT "\n",
pr_err("Missing node limit pivot at " PTR_FMT "[%u]",
pr_err(PTR_FMT "[%u] piv %lu < prev_piv %lu\n",
pr_err(PTR_FMT "[%u] %lu < %lu\n", mas_mn(mas), i,
pr_err(PTR_FMT "[%u] %lu > %lu\n", mas_mn(mas), i,
pr_err("node" PTR_FMT ": data_end %u != the last slot offset %u\n",
pr_err(PTR_FMT "[%u] should not have entry " PTR_FMT "\n",
pr_err(PTR_FMT "[%u] should not have piv %lu\n",
pr_err("Sequential nulls end at " PTR_FMT "[%u]\n",
pr_err("Invalid size %u of " PTR_FMT "\n",
pr_err("MAS: tree=" PTR_FMT " enode=" PTR_FMT " ",
pr_err(" min=%lx max=%lx sheaf=" PTR_FMT ", request %lu depth=%u, flags=%x\n",
pr_err("WR_MAS: node=" PTR_FMT " r_min=%lx r_max=%lx\n",