locking.c 1.7 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374
  1. /*
  2. * Copyright (C) 2008 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/sched.h>
  19. #include <linux/gfp.h>
  20. #include <linux/pagemap.h>
  21. #include <linux/spinlock.h>
  22. #include <linux/page-flags.h>
  23. #include <asm/bug.h>
  24. #include "ctree.h"
  25. #include "extent_io.h"
  26. #include "locking.h"
  27. int btrfs_tree_lock(struct extent_buffer *eb)
  28. {
  29. int i;
  30. if (mutex_trylock(&eb->mutex))
  31. return 0;
  32. for (i = 0; i < 512; i++) {
  33. cpu_relax();
  34. if (mutex_trylock(&eb->mutex))
  35. return 0;
  36. }
  37. cpu_relax();
  38. mutex_lock_nested(&eb->mutex, BTRFS_MAX_LEVEL - btrfs_header_level(eb));
  39. return 0;
  40. }
  41. int btrfs_try_tree_lock(struct extent_buffer *eb)
  42. {
  43. return mutex_trylock(&eb->mutex);
  44. }
  45. int btrfs_tree_unlock(struct extent_buffer *eb)
  46. {
  47. mutex_unlock(&eb->mutex);
  48. return 0;
  49. }
  50. int btrfs_tree_locked(struct extent_buffer *eb)
  51. {
  52. return mutex_is_locked(&eb->mutex);
  53. }
  54. int btrfs_path_lock_waiting(struct btrfs_path *path, int level)
  55. {
  56. int i;
  57. struct extent_buffer *eb;
  58. for (i = level; i <= level + 1 && i < BTRFS_MAX_LEVEL; i++) {
  59. eb = path->nodes[i];
  60. if (!eb)
  61. break;
  62. smp_mb();
  63. if (!list_empty(&eb->mutex.wait_list))
  64. return 1;
  65. }
  66. return 0;
  67. }