Loading fs/btrfs/print-tree.c +1 −1 Original line number Diff line number Diff line Loading @@ -43,7 +43,7 @@ void print_tree(struct ctree_root *root, struct tree_buffer *t) print_leaf((struct leaf *)c); return; } printf("node %Lu level %d total ptrs %d free spc %lu\n", t->blocknr, printf("node %Lu level %d total ptrs %d free spc %u\n", t->blocknr, node_level(c->header.flags), c->header.nritems, NODEPTRS_PER_BLOCK - c->header.nritems); fflush(stdout); Loading fs/btrfs/random-test.c +3 −2 Original line number Diff line number Diff line Loading @@ -40,15 +40,16 @@ static int ins_one(struct ctree_root *root, struct radix_tree_root *radix) struct key key; int ret; char buf[128]; unsigned long oid; init_path(&path); ret = setup_key(radix, &key, 0); sprintf(buf, "str-%Lu\n", key.objectid); ret = insert_item(root, &key, buf, strlen(buf)); if (ret) goto error; oid = (unsigned long)key.objectid; radix_tree_preload(GFP_KERNEL); ret = radix_tree_insert(radix, key.objectid, (void *)key.objectid); ret = radix_tree_insert(radix, oid, (void *)oid); radix_tree_preload_end(); if (ret) goto error; Loading Loading
fs/btrfs/print-tree.c +1 −1 Original line number Diff line number Diff line Loading @@ -43,7 +43,7 @@ void print_tree(struct ctree_root *root, struct tree_buffer *t) print_leaf((struct leaf *)c); return; } printf("node %Lu level %d total ptrs %d free spc %lu\n", t->blocknr, printf("node %Lu level %d total ptrs %d free spc %u\n", t->blocknr, node_level(c->header.flags), c->header.nritems, NODEPTRS_PER_BLOCK - c->header.nritems); fflush(stdout); Loading
fs/btrfs/random-test.c +3 −2 Original line number Diff line number Diff line Loading @@ -40,15 +40,16 @@ static int ins_one(struct ctree_root *root, struct radix_tree_root *radix) struct key key; int ret; char buf[128]; unsigned long oid; init_path(&path); ret = setup_key(radix, &key, 0); sprintf(buf, "str-%Lu\n", key.objectid); ret = insert_item(root, &key, buf, strlen(buf)); if (ret) goto error; oid = (unsigned long)key.objectid; radix_tree_preload(GFP_KERNEL); ret = radix_tree_insert(radix, key.objectid, (void *)key.objectid); ret = radix_tree_insert(radix, oid, (void *)oid); radix_tree_preload_end(); if (ret) goto error; Loading