w1_family.c 3.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141
  1. /*
  2. * w1_family.c
  3. *
  4. * Copyright (c) 2004 Evgeniy Polyakov <johnpol@2ka.mipt.ru>
  5. *
  6. *
  7. * This program is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU General Public License as published by
  9. * the Free Software Foundation; either version 2 of the License, or
  10. * (at your option) any later version.
  11. *
  12. * This program is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15. * GNU General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU General Public License
  18. * along with this program; if not, write to the Free Software
  19. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  20. */
  21. #include <linux/spinlock.h>
  22. #include <linux/list.h>
  23. #include <linux/delay.h>
  24. #include "w1_family.h"
  25. DEFINE_SPINLOCK(w1_flock);
  26. static LIST_HEAD(w1_families);
  27. extern void w1_reconnect_slaves(struct w1_family *f);
  28. int w1_register_family(struct w1_family *newf)
  29. {
  30. struct list_head *ent, *n;
  31. struct w1_family *f;
  32. int ret = 0;
  33. spin_lock(&w1_flock);
  34. list_for_each_safe(ent, n, &w1_families) {
  35. f = list_entry(ent, struct w1_family, family_entry);
  36. if (f->fid == newf->fid) {
  37. ret = -EEXIST;
  38. break;
  39. }
  40. }
  41. if (!ret) {
  42. atomic_set(&newf->refcnt, 0);
  43. newf->need_exit = 0;
  44. list_add_tail(&newf->family_entry, &w1_families);
  45. }
  46. spin_unlock(&w1_flock);
  47. w1_reconnect_slaves(newf);
  48. return ret;
  49. }
  50. void w1_unregister_family(struct w1_family *fent)
  51. {
  52. struct list_head *ent, *n;
  53. struct w1_family *f;
  54. spin_lock(&w1_flock);
  55. list_for_each_safe(ent, n, &w1_families) {
  56. f = list_entry(ent, struct w1_family, family_entry);
  57. if (f->fid == fent->fid) {
  58. list_del(&fent->family_entry);
  59. break;
  60. }
  61. }
  62. fent->need_exit = 1;
  63. spin_unlock(&w1_flock);
  64. while (atomic_read(&fent->refcnt)) {
  65. printk(KERN_INFO "Waiting for family %u to become free: refcnt=%d.\n",
  66. fent->fid, atomic_read(&fent->refcnt));
  67. if (msleep_interruptible(1000))
  68. flush_signals(current);
  69. }
  70. }
  71. /*
  72. * Should be called under w1_flock held.
  73. */
  74. struct w1_family * w1_family_registered(u8 fid)
  75. {
  76. struct list_head *ent, *n;
  77. struct w1_family *f = NULL;
  78. int ret = 0;
  79. list_for_each_safe(ent, n, &w1_families) {
  80. f = list_entry(ent, struct w1_family, family_entry);
  81. if (f->fid == fid) {
  82. ret = 1;
  83. break;
  84. }
  85. }
  86. return (ret) ? f : NULL;
  87. }
  88. void w1_family_put(struct w1_family *f)
  89. {
  90. spin_lock(&w1_flock);
  91. __w1_family_put(f);
  92. spin_unlock(&w1_flock);
  93. }
  94. void __w1_family_put(struct w1_family *f)
  95. {
  96. if (atomic_dec_and_test(&f->refcnt))
  97. f->need_exit = 1;
  98. }
  99. void w1_family_get(struct w1_family *f)
  100. {
  101. spin_lock(&w1_flock);
  102. __w1_family_get(f);
  103. spin_unlock(&w1_flock);
  104. }
  105. void __w1_family_get(struct w1_family *f)
  106. {
  107. smp_mb__before_atomic_inc();
  108. atomic_inc(&f->refcnt);
  109. smp_mb__after_atomic_inc();
  110. }
  111. EXPORT_SYMBOL(w1_family_get);
  112. EXPORT_SYMBOL(w1_family_put);
  113. EXPORT_SYMBOL(w1_family_registered);
  114. EXPORT_SYMBOL(w1_unregister_family);
  115. EXPORT_SYMBOL(w1_register_family);