1
2
3
4
5
6
7
8
9
10
11
12
13
14#include <linux/attribute_container.h>
15#include <linux/init.h>
16#include <linux/device.h>
17#include <linux/kernel.h>
18#include <linux/slab.h>
19#include <linux/list.h>
20#include <linux/module.h>
21
22#include "base.h"
23
24
25
26struct internal_container {
27 struct klist_node node;
28 struct attribute_container *cont;
29 struct class_device classdev;
30};
31
32static void internal_container_klist_get(struct klist_node *n)
33{
34 struct internal_container *ic =
35 container_of(n, struct internal_container, node);
36 class_device_get(&ic->classdev);
37}
38
39static void internal_container_klist_put(struct klist_node *n)
40{
41 struct internal_container *ic =
42 container_of(n, struct internal_container, node);
43 class_device_put(&ic->classdev);
44}
45
46
47
48
49
50
51
52
53
54struct attribute_container *
55attribute_container_classdev_to_container(struct class_device *classdev)
56{
57 struct internal_container *ic =
58 container_of(classdev, struct internal_container, classdev);
59 return ic->cont;
60}
61EXPORT_SYMBOL_GPL(attribute_container_classdev_to_container);
62
63static struct list_head attribute_container_list;
64
65static DECLARE_MUTEX(attribute_container_mutex);
66
67
68
69
70
71
72
73int
74attribute_container_register(struct attribute_container *cont)
75{
76 INIT_LIST_HEAD(&cont->node);
77 klist_init(&cont->containers,internal_container_klist_get,
78 internal_container_klist_put);
79
80 down(&attribute_container_mutex);
81 list_add_tail(&cont->node, &attribute_container_list);
82 up(&attribute_container_mutex);
83
84 return 0;
85}
86EXPORT_SYMBOL_GPL(attribute_container_register);
87
88
89
90
91
92
93int
94attribute_container_unregister(struct attribute_container *cont)
95{
96 int retval = -EBUSY;
97 down(&attribute_container_mutex);
98 spin_lock(&cont->containers.k_lock);
99 if (!list_empty(&cont->containers.k_list))
100 goto out;
101 retval = 0;
102 list_del(&cont->node);
103 out:
104 spin_unlock(&cont->containers.k_lock);
105 up(&attribute_container_mutex);
106 return retval;
107
108}
109EXPORT_SYMBOL_GPL(attribute_container_unregister);
110
111
112static void attribute_container_release(struct class_device *classdev)
113{
114 struct internal_container *ic
115 = container_of(classdev, struct internal_container, classdev);
116 struct device *dev = classdev->dev;
117
118 kfree(ic);
119 put_device(dev);
120}
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140void
141attribute_container_add_device(struct device *dev,
142 int (*fn)(struct attribute_container *,
143 struct device *,
144 struct class_device *))
145{
146 struct attribute_container *cont;
147
148 down(&attribute_container_mutex);
149 list_for_each_entry(cont, &attribute_container_list, node) {
150 struct internal_container *ic;
151
152 if (attribute_container_no_classdevs(cont))
153 continue;
154
155 if (!cont->match(cont, dev))
156 continue;
157
158 ic = kzalloc(sizeof(*ic), GFP_KERNEL);
159 if (!ic) {
160 dev_printk(KERN_ERR, dev, "failed to allocate class container\n");
161 continue;
162 }
163
164 ic->cont = cont;
165 class_device_initialize(&ic->classdev);
166 ic->classdev.dev = get_device(dev);
167 ic->classdev.class = cont->class;
168 cont->class->release = attribute_container_release;
169 strcpy(ic->classdev.class_id, dev->bus_id);
170 if (fn)
171 fn(cont, dev, &ic->classdev);
172 else
173 attribute_container_add_class_device(&ic->classdev);
174 klist_add_tail(&ic->node, &cont->containers);
175 }
176 up(&attribute_container_mutex);
177}
178
179
180
181
182#define klist_for_each_entry(pos, head, member, iter) \
183 for (klist_iter_init(head, iter); (pos = ({ \
184 struct klist_node *n = klist_next(iter); \
185 n ? container_of(n, typeof(*pos), member) : \
186 ({ klist_iter_exit(iter) ; NULL; }); \
187 }) ) != NULL; )
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206void
207attribute_container_remove_device(struct device *dev,
208 void (*fn)(struct attribute_container *,
209 struct device *,
210 struct class_device *))
211{
212 struct attribute_container *cont;
213
214 down(&attribute_container_mutex);
215 list_for_each_entry(cont, &attribute_container_list, node) {
216 struct internal_container *ic;
217 struct klist_iter iter;
218
219 if (attribute_container_no_classdevs(cont))
220 continue;
221
222 if (!cont->match(cont, dev))
223 continue;
224
225 klist_for_each_entry(ic, &cont->containers, node, &iter) {
226 if (dev != ic->classdev.dev)
227 continue;
228 klist_del(&ic->node);
229 if (fn)
230 fn(cont, dev, &ic->classdev);
231 else {
232 attribute_container_remove_attrs(&ic->classdev);
233 class_device_unregister(&ic->classdev);
234 }
235 }
236 }
237 up(&attribute_container_mutex);
238}
239
240
241
242
243
244
245
246
247
248
249
250void
251attribute_container_device_trigger(struct device *dev,
252 int (*fn)(struct attribute_container *,
253 struct device *,
254 struct class_device *))
255{
256 struct attribute_container *cont;
257
258 down(&attribute_container_mutex);
259 list_for_each_entry(cont, &attribute_container_list, node) {
260 struct internal_container *ic;
261 struct klist_iter iter;
262
263 if (!cont->match(cont, dev))
264 continue;
265
266 if (attribute_container_no_classdevs(cont)) {
267 fn(cont, dev, NULL);
268 continue;
269 }
270
271 klist_for_each_entry(ic, &cont->containers, node, &iter) {
272 if (dev == ic->classdev.dev)
273 fn(cont, dev, &ic->classdev);
274 }
275 }
276 up(&attribute_container_mutex);
277}
278
279
280
281
282
283
284
285
286
287
288
289
290
291void
292attribute_container_trigger(struct device *dev,
293 int (*fn)(struct attribute_container *,
294 struct device *))
295{
296 struct attribute_container *cont;
297
298 down(&attribute_container_mutex);
299 list_for_each_entry(cont, &attribute_container_list, node) {
300 if (cont->match(cont, dev))
301 fn(cont, dev);
302 }
303 up(&attribute_container_mutex);
304}
305
306
307
308
309
310
311
312
313
314int
315attribute_container_add_attrs(struct class_device *classdev)
316{
317 struct attribute_container *cont =
318 attribute_container_classdev_to_container(classdev);
319 struct class_device_attribute **attrs = cont->attrs;
320 int i, error;
321
322 if (!attrs)
323 return 0;
324
325 for (i = 0; attrs[i]; i++) {
326 error = class_device_create_file(classdev, attrs[i]);
327 if (error)
328 return error;
329 }
330
331 return 0;
332}
333
334
335
336
337
338
339
340
341
342
343int
344attribute_container_add_class_device(struct class_device *classdev)
345{
346 int error = class_device_add(classdev);
347 if (error)
348 return error;
349 return attribute_container_add_attrs(classdev);
350}
351
352
353
354
355
356
357
358int
359attribute_container_add_class_device_adapter(struct attribute_container *cont,
360 struct device *dev,
361 struct class_device *classdev)
362{
363 return attribute_container_add_class_device(classdev);
364}
365
366
367
368
369
370
371
372void
373attribute_container_remove_attrs(struct class_device *classdev)
374{
375 struct attribute_container *cont =
376 attribute_container_classdev_to_container(classdev);
377 struct class_device_attribute **attrs = cont->attrs;
378 int i;
379
380 if (!attrs)
381 return;
382
383 for (i = 0; attrs[i]; i++)
384 class_device_remove_file(classdev, attrs[i]);
385}
386
387
388
389
390
391
392
393
394
395void
396attribute_container_class_device_del(struct class_device *classdev)
397{
398 attribute_container_remove_attrs(classdev);
399 class_device_del(classdev);
400}
401
402
403
404
405
406
407
408
409
410
411struct class_device *
412attribute_container_find_class_device(struct attribute_container *cont,
413 struct device *dev)
414{
415 struct class_device *cdev = NULL;
416 struct internal_container *ic;
417 struct klist_iter iter;
418
419 klist_for_each_entry(ic, &cont->containers, node, &iter) {
420 if (ic->classdev.dev == dev) {
421 cdev = &ic->classdev;
422
423 klist_iter_exit(&iter);
424 break;
425 }
426 }
427
428 return cdev;
429}
430EXPORT_SYMBOL_GPL(attribute_container_find_class_device);
431
432int __init
433attribute_container_init(void)
434{
435 INIT_LIST_HEAD(&attribute_container_list);
436 return 0;
437}
438