inode-item.c 2.1 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
  1. /*
  2. * Copyright (C) 2007 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,
  9. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  11. * General Public License for more details.
  12. *
  13. * You should have received a copy of the GNU General Public
  14. * License along with this program; if not, write to the
  15. * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  16. * Boston, MA 021110-1307, USA.
  17. */
  18. #include <linux/module.h>
  19. #include "ctree.h"
  20. #include "disk-io.h"
  21. #include "transaction.h"
  22. int btrfs_insert_inode(struct btrfs_trans_handle *trans, struct btrfs_root
  23. *root, u64 objectid, struct btrfs_inode_item
  24. *inode_item)
  25. {
  26. struct btrfs_path *path;
  27. struct btrfs_key key;
  28. int ret;
  29. key.objectid = objectid;
  30. key.flags = 0;
  31. btrfs_set_key_type(&key, BTRFS_INODE_ITEM_KEY);
  32. key.offset = 0;
  33. path = btrfs_alloc_path();
  34. BUG_ON(!path);
  35. ret = btrfs_insert_item(trans, root, &key, inode_item,
  36. sizeof(*inode_item));
  37. btrfs_release_path(root, path);
  38. btrfs_free_path(path);
  39. if (ret == 0 && objectid > root->highest_inode)
  40. root->highest_inode = objectid;
  41. return ret;
  42. }
  43. int btrfs_lookup_inode(struct btrfs_trans_handle *trans, struct btrfs_root
  44. *root, struct btrfs_path *path,
  45. struct btrfs_key *location, int mod)
  46. {
  47. int ins_len = mod < 0 ? -1 : 0;
  48. int cow = mod != 0;
  49. int ret;
  50. int slot;
  51. struct btrfs_leaf *leaf;
  52. struct btrfs_key found_key;
  53. ret = btrfs_search_slot(trans, root, location, path, ins_len, cow);
  54. if (ret > 0 && btrfs_key_type(location) == BTRFS_ROOT_ITEM_KEY &&
  55. location->offset == (u64)-1 && path->slots[0] != 0) {
  56. slot = path->slots[0] - 1;
  57. leaf = btrfs_buffer_leaf(path->nodes[0]);
  58. btrfs_disk_key_to_cpu(&found_key, &leaf->items[slot].key);
  59. if (found_key.objectid == location->objectid &&
  60. btrfs_key_type(&found_key) == btrfs_key_type(location)) {
  61. path->slots[0]--;
  62. return 0;
  63. }
  64. }
  65. return ret;
  66. }