w1_family.c 3.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142
  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/sched.h> /* schedule_timeout() */
  24. #include <linux/delay.h>
  25. #include "w1_family.h"
  26. #include "w1.h"
  27. DEFINE_SPINLOCK(w1_flock);
  28. static LIST_HEAD(w1_families);
  29. int w1_register_family(struct w1_family *newf)
  30. {
  31. struct list_head *ent, *n;
  32. struct w1_family *f;
  33. int ret = 0;
  34. spin_lock(&w1_flock);
  35. list_for_each_safe(ent, n, &w1_families) {
  36. f = list_entry(ent, struct w1_family, family_entry);
  37. if (f->fid == newf->fid) {
  38. ret = -EEXIST;
  39. break;
  40. }
  41. }
  42. if (!ret) {
  43. atomic_set(&newf->refcnt, 0);
  44. newf->need_exit = 0;
  45. list_add_tail(&newf->family_entry, &w1_families);
  46. }
  47. spin_unlock(&w1_flock);
  48. w1_reconnect_slaves(newf);
  49. return ret;
  50. }
  51. void w1_unregister_family(struct w1_family *fent)
  52. {
  53. struct list_head *ent, *n;
  54. struct w1_family *f;
  55. spin_lock(&w1_flock);
  56. list_for_each_safe(ent, n, &w1_families) {
  57. f = list_entry(ent, struct w1_family, family_entry);
  58. if (f->fid == fent->fid) {
  59. list_del(&fent->family_entry);
  60. break;
  61. }
  62. }
  63. fent->need_exit = 1;
  64. spin_unlock(&w1_flock);
  65. while (atomic_read(&fent->refcnt)) {
  66. printk(KERN_INFO "Waiting for family %u to become free: refcnt=%d.\n",
  67. fent->fid, atomic_read(&fent->refcnt));
  68. if (msleep_interruptible(1000))
  69. flush_signals(current);
  70. }
  71. }
  72. /*
  73. * Should be called under w1_flock held.
  74. */
  75. struct w1_family * w1_family_registered(u8 fid)
  76. {
  77. struct list_head *ent, *n;
  78. struct w1_family *f = NULL;
  79. int ret = 0;
  80. list_for_each_safe(ent, n, &w1_families) {
  81. f = list_entry(ent, struct w1_family, family_entry);
  82. if (f->fid == fid) {
  83. ret = 1;
  84. break;
  85. }
  86. }
  87. return (ret) ? f : NULL;
  88. }
  89. void w1_family_put(struct w1_family *f)
  90. {
  91. spin_lock(&w1_flock);
  92. __w1_family_put(f);
  93. spin_unlock(&w1_flock);
  94. }
  95. void __w1_family_put(struct w1_family *f)
  96. {
  97. if (atomic_dec_and_test(&f->refcnt))
  98. f->need_exit = 1;
  99. }
  100. void w1_family_get(struct w1_family *f)
  101. {
  102. spin_lock(&w1_flock);
  103. __w1_family_get(f);
  104. spin_unlock(&w1_flock);
  105. }
  106. void __w1_family_get(struct w1_family *f)
  107. {
  108. smp_mb__before_atomic_inc();
  109. atomic_inc(&f->refcnt);
  110. smp_mb__after_atomic_inc();
  111. }
  112. EXPORT_SYMBOL(w1_family_get);
  113. EXPORT_SYMBOL(w1_family_put);
  114. EXPORT_SYMBOL(w1_family_registered);
  115. EXPORT_SYMBOL(w1_unregister_family);
  116. EXPORT_SYMBOL(w1_register_family);