2 * Componentized device handling.
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License version 2 as
6 * published by the Free Software Foundation.
8 * This is work in progress. We gather up the component devices into a list,
9 * and bind them when instructed. At the moment, we're specific to the DRM
10 * subsystem, and only handles one master device, but this doesn't have to be
13 #include <linux/component.h>
14 #include <linux/device.h>
15 #include <linux/kref.h>
16 #include <linux/list.h>
17 #include <linux/module.h>
18 #include <linux/mutex.h>
19 #include <linux/slab.h>
23 struct component_match_array
{
25 int (*compare
)(struct device
*, void *);
26 void (*release
)(struct device
*, void *);
27 struct component
*component
;
31 struct component_match
{
34 struct component_match_array
*compare
;
38 struct list_head node
;
41 const struct component_master_ops
*ops
;
43 struct component_match
*match
;
47 struct list_head node
;
48 struct master
*master
;
51 const struct component_ops
*ops
;
55 static DEFINE_MUTEX(component_mutex
);
56 static LIST_HEAD(component_list
);
57 static LIST_HEAD(masters
);
59 static struct master
*__master_find(struct device
*dev
,
60 const struct component_master_ops
*ops
)
64 list_for_each_entry(m
, &masters
, node
)
65 if (m
->dev
== dev
&& (!ops
|| m
->ops
== ops
))
71 static struct component
*find_component(struct master
*master
,
72 int (*compare
)(struct device
*, void *), void *compare_data
)
76 list_for_each_entry(c
, &component_list
, node
) {
77 if (c
->master
&& c
->master
!= master
)
80 if (compare(c
->dev
, compare_data
))
87 static int find_components(struct master
*master
)
89 struct component_match
*match
= master
->match
;
94 * Scan the array of match functions and attach
95 * any components which are found to this master.
97 for (i
= 0; i
< match
->num
; i
++) {
98 struct component_match_array
*mc
= &match
->compare
[i
];
101 dev_dbg(master
->dev
, "Looking for component %zu\n", i
);
103 if (match
->compare
[i
].component
)
106 c
= find_component(master
, mc
->compare
, mc
->data
);
112 dev_dbg(master
->dev
, "found component %s, duplicate %u\n", dev_name(c
->dev
), !!c
->master
);
114 /* Attach this component to the master */
115 match
->compare
[i
].duplicate
= !!c
->master
;
116 match
->compare
[i
].component
= c
;
122 /* Detach component from associated master */
123 static void remove_component(struct master
*master
, struct component
*c
)
127 /* Detach the component from this master. */
128 for (i
= 0; i
< master
->match
->num
; i
++)
129 if (master
->match
->compare
[i
].component
== c
)
130 master
->match
->compare
[i
].component
= NULL
;
134 * Try to bring up a master. If component is NULL, we're interested in
135 * this master, otherwise it's a component which must be present to try
136 * and bring up the master.
138 * Returns 1 for successful bringup, 0 if not ready, or -ve errno.
140 static int try_to_bring_up_master(struct master
*master
,
141 struct component
*component
)
145 dev_dbg(master
->dev
, "trying to bring up master\n");
147 if (find_components(master
)) {
148 dev_dbg(master
->dev
, "master has incomplete components\n");
152 if (component
&& component
->master
!= master
) {
153 dev_dbg(master
->dev
, "master is not for this component (%s)\n",
154 dev_name(component
->dev
));
158 if (!devres_open_group(master
->dev
, NULL
, GFP_KERNEL
))
161 /* Found all components */
162 ret
= master
->ops
->bind(master
->dev
);
164 devres_release_group(master
->dev
, NULL
);
165 dev_info(master
->dev
, "master bind failed: %d\n", ret
);
169 master
->bound
= true;
173 static int try_to_bring_up_masters(struct component
*component
)
178 list_for_each_entry(m
, &masters
, node
) {
180 ret
= try_to_bring_up_master(m
, component
);
189 static void take_down_master(struct master
*master
)
192 master
->ops
->unbind(master
->dev
);
193 devres_release_group(master
->dev
, NULL
);
194 master
->bound
= false;
198 static void component_match_release(struct device
*master
,
199 struct component_match
*match
)
203 for (i
= 0; i
< match
->num
; i
++) {
204 struct component_match_array
*mc
= &match
->compare
[i
];
207 mc
->release(master
, mc
->data
);
210 kfree(match
->compare
);
213 static void devm_component_match_release(struct device
*dev
, void *res
)
215 component_match_release(dev
, res
);
218 static int component_match_realloc(struct device
*dev
,
219 struct component_match
*match
, size_t num
)
221 struct component_match_array
*new;
223 if (match
->alloc
== num
)
226 new = kmalloc_array(num
, sizeof(*new), GFP_KERNEL
);
230 if (match
->compare
) {
231 memcpy(new, match
->compare
, sizeof(*new) *
232 min(match
->num
, num
));
233 kfree(match
->compare
);
235 match
->compare
= new;
242 * Add a component to be matched, with a release function.
244 * The match array is first created or extended if necessary.
246 void component_match_add_release(struct device
*master
,
247 struct component_match
**matchptr
,
248 void (*release
)(struct device
*, void *),
249 int (*compare
)(struct device
*, void *), void *compare_data
)
251 struct component_match
*match
= *matchptr
;
257 match
= devres_alloc(devm_component_match_release
,
258 sizeof(*match
), GFP_KERNEL
);
260 *matchptr
= ERR_PTR(-ENOMEM
);
264 devres_add(master
, match
);
269 if (match
->num
== match
->alloc
) {
270 size_t new_size
= match
? match
->alloc
+ 16 : 15;
273 ret
= component_match_realloc(master
, match
, new_size
);
275 *matchptr
= ERR_PTR(ret
);
280 match
->compare
[match
->num
].compare
= compare
;
281 match
->compare
[match
->num
].release
= release
;
282 match
->compare
[match
->num
].data
= compare_data
;
283 match
->compare
[match
->num
].component
= NULL
;
286 EXPORT_SYMBOL(component_match_add_release
);
288 static void free_master(struct master
*master
)
290 struct component_match
*match
= master
->match
;
293 list_del(&master
->node
);
296 for (i
= 0; i
< match
->num
; i
++) {
297 struct component
*c
= match
->compare
[i
].component
;
306 int component_master_add_with_match(struct device
*dev
,
307 const struct component_master_ops
*ops
,
308 struct component_match
*match
)
310 struct master
*master
;
313 /* Reallocate the match array for its true size */
314 ret
= component_match_realloc(dev
, match
, match
->num
);
318 master
= kzalloc(sizeof(*master
), GFP_KERNEL
);
324 master
->match
= match
;
326 /* Add to the list of available masters. */
327 mutex_lock(&component_mutex
);
328 list_add(&master
->node
, &masters
);
330 ret
= try_to_bring_up_master(master
, NULL
);
335 mutex_unlock(&component_mutex
);
337 return ret
< 0 ? ret
: 0;
339 EXPORT_SYMBOL_GPL(component_master_add_with_match
);
341 void component_master_del(struct device
*dev
,
342 const struct component_master_ops
*ops
)
344 struct master
*master
;
346 mutex_lock(&component_mutex
);
347 master
= __master_find(dev
, ops
);
349 take_down_master(master
);
352 mutex_unlock(&component_mutex
);
354 EXPORT_SYMBOL_GPL(component_master_del
);
356 static void component_unbind(struct component
*component
,
357 struct master
*master
, void *data
)
359 WARN_ON(!component
->bound
);
361 component
->ops
->unbind(component
->dev
, master
->dev
, data
);
362 component
->bound
= false;
364 /* Release all resources claimed in the binding of this component */
365 devres_release_group(component
->dev
, component
);
368 void component_unbind_all(struct device
*master_dev
, void *data
)
370 struct master
*master
;
374 WARN_ON(!mutex_is_locked(&component_mutex
));
376 master
= __master_find(master_dev
, NULL
);
380 /* Unbind components in reverse order */
381 for (i
= master
->match
->num
; i
--; )
382 if (!master
->match
->compare
[i
].duplicate
) {
383 c
= master
->match
->compare
[i
].component
;
384 component_unbind(c
, master
, data
);
387 EXPORT_SYMBOL_GPL(component_unbind_all
);
389 static int component_bind(struct component
*component
, struct master
*master
,
395 * Each component initialises inside its own devres group.
396 * This allows us to roll-back a failed component without
397 * affecting anything else.
399 if (!devres_open_group(master
->dev
, NULL
, GFP_KERNEL
))
403 * Also open a group for the device itself: this allows us
404 * to release the resources claimed against the sub-device
405 * at the appropriate moment.
407 if (!devres_open_group(component
->dev
, component
, GFP_KERNEL
)) {
408 devres_release_group(master
->dev
, NULL
);
412 dev_dbg(master
->dev
, "binding %s (ops %ps)\n",
413 dev_name(component
->dev
), component
->ops
);
415 ret
= component
->ops
->bind(component
->dev
, master
->dev
, data
);
417 component
->bound
= true;
420 * Close the component device's group so that resources
421 * allocated in the binding are encapsulated for removal
422 * at unbind. Remove the group on the DRM device as we
423 * can clean those resources up independently.
425 devres_close_group(component
->dev
, NULL
);
426 devres_remove_group(master
->dev
, NULL
);
428 dev_info(master
->dev
, "bound %s (ops %ps)\n",
429 dev_name(component
->dev
), component
->ops
);
431 devres_release_group(component
->dev
, NULL
);
432 devres_release_group(master
->dev
, NULL
);
434 dev_err(master
->dev
, "failed to bind %s (ops %ps): %d\n",
435 dev_name(component
->dev
), component
->ops
, ret
);
441 int component_bind_all(struct device
*master_dev
, void *data
)
443 struct master
*master
;
448 WARN_ON(!mutex_is_locked(&component_mutex
));
450 master
= __master_find(master_dev
, NULL
);
454 /* Bind components in match order */
455 for (i
= 0; i
< master
->match
->num
; i
++)
456 if (!master
->match
->compare
[i
].duplicate
) {
457 c
= master
->match
->compare
[i
].component
;
458 ret
= component_bind(c
, master
, data
);
465 if (!master
->match
->compare
[i
].duplicate
) {
466 c
= master
->match
->compare
[i
].component
;
467 component_unbind(c
, master
, data
);
473 EXPORT_SYMBOL_GPL(component_bind_all
);
475 int component_add(struct device
*dev
, const struct component_ops
*ops
)
477 struct component
*component
;
480 component
= kzalloc(sizeof(*component
), GFP_KERNEL
);
484 component
->ops
= ops
;
485 component
->dev
= dev
;
487 dev_dbg(dev
, "adding component (ops %ps)\n", ops
);
489 mutex_lock(&component_mutex
);
490 list_add_tail(&component
->node
, &component_list
);
492 ret
= try_to_bring_up_masters(component
);
494 if (component
->master
)
495 remove_component(component
->master
, component
);
496 list_del(&component
->node
);
500 mutex_unlock(&component_mutex
);
502 return ret
< 0 ? ret
: 0;
504 EXPORT_SYMBOL_GPL(component_add
);
506 void component_del(struct device
*dev
, const struct component_ops
*ops
)
508 struct component
*c
, *component
= NULL
;
510 mutex_lock(&component_mutex
);
511 list_for_each_entry(c
, &component_list
, node
)
512 if (c
->dev
== dev
&& c
->ops
== ops
) {
518 if (component
&& component
->master
) {
519 take_down_master(component
->master
);
520 remove_component(component
->master
, component
);
523 mutex_unlock(&component_mutex
);
528 EXPORT_SYMBOL_GPL(component_del
);
530 MODULE_LICENSE("GPL v2");