| relocation.c (e2aed8dfa50bb061747eeb14e6af099554a03b76) | relocation.c (533574c6bc30cf526cc1c41bde050c854a945efb) |
|---|---|
| 1/* 2 * Copyright (C) 2009 Oracle. All rights reserved. 3 * 4 * This program is free software; you can redistribute it and/or 5 * modify it under the terms of the GNU General Public 6 * License v2 as published by the Free Software Foundation. 7 * 8 * This program is distributed in the hope that it will be useful, --- 1227 unchanged lines hidden (view full) --- 1236 1237 spin_lock(&rc->reloc_root_tree.lock); 1238 rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 1239 node->bytenr, &node->rb_node); 1240 spin_unlock(&rc->reloc_root_tree.lock); 1241 if (rb_node) { 1242 btrfs_panic(root->fs_info, -EEXIST, "Duplicate root found " 1243 "for start=%llu while inserting into relocation " | 1/* 2 * Copyright (C) 2009 Oracle. All rights reserved. 3 * 4 * This program is free software; you can redistribute it and/or 5 * modify it under the terms of the GNU General Public 6 * License v2 as published by the Free Software Foundation. 7 * 8 * This program is distributed in the hope that it will be useful, --- 1227 unchanged lines hidden (view full) --- 1236 1237 spin_lock(&rc->reloc_root_tree.lock); 1238 rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 1239 node->bytenr, &node->rb_node); 1240 spin_unlock(&rc->reloc_root_tree.lock); 1241 if (rb_node) { 1242 btrfs_panic(root->fs_info, -EEXIST, "Duplicate root found " 1243 "for start=%llu while inserting into relocation " |
| 1244 "tree\n"); | 1244 "tree\n", node->bytenr); |
| 1245 kfree(node); 1246 return -EEXIST; 1247 } 1248 1249 list_add_tail(&root->root_list, &rc->reloc_roots); 1250 return 0; 1251} 1252 --- 3213 unchanged lines hidden --- | 1245 kfree(node); 1246 return -EEXIST; 1247 } 1248 1249 list_add_tail(&root->root_list, &rc->reloc_roots); 1250 return 0; 1251} 1252 --- 3213 unchanged lines hidden --- |