inode-item.c 2.1 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970
  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 "ctree.h"
  19. #include "disk-io.h"
  20. #include "transaction.h"
  21. int btrfs_insert_inode(struct btrfs_trans_handle *trans, struct btrfs_root
  22. *root, u64 objectid, struct btrfs_inode_item
  23. *inode_item)
  24. {
  25. struct btrfs_path *path;
  26. struct btrfs_key key;
  27. int ret;
  28. key.objectid = objectid;
  29. key.flags = 0;
  30. btrfs_set_key_type(&key, BTRFS_INODE_ITEM_KEY);
  31. key.offset = 0;
  32. path = btrfs_alloc_path();
  33. BUG_ON(!path);
  34. ret = btrfs_insert_item(trans, root, &key, inode_item,
  35. sizeof(*inode_item));
  36. btrfs_release_path(root, path);
  37. btrfs_free_path(path);
  38. if (ret == 0 && objectid > root->highest_inode)
  39. root->highest_inode = objectid;
  40. return ret;
  41. }
  42. int btrfs_lookup_inode(struct btrfs_trans_handle *trans, struct btrfs_root
  43. *root, struct btrfs_path *path,
  44. struct btrfs_key *location, int mod)
  45. {
  46. int ins_len = mod < 0 ? -1 : 0;
  47. int cow = mod != 0;
  48. int ret;
  49. int slot;
  50. struct btrfs_leaf *leaf;
  51. struct btrfs_key found_key;
  52. ret = btrfs_search_slot(trans, root, location, path, ins_len, cow);
  53. if (ret > 0 && btrfs_key_type(location) == BTRFS_ROOT_ITEM_KEY &&
  54. location->offset == (u64)-1 && path->slots[0] != 0) {
  55. slot = path->slots[0] - 1;
  56. leaf = btrfs_buffer_leaf(path->nodes[0]);
  57. btrfs_disk_key_to_cpu(&found_key, &leaf->items[slot].key);
  58. if (found_key.objectid == location->objectid &&
  59. btrfs_key_type(&found_key) == btrfs_key_type(location)) {
  60. path->slots[0]--;
  61. return 0;
  62. }
  63. }
  64. return ret;
  65. }