blob: 4c3b9813b284318462152bb2963f59e85a499a92 [file] [log] [blame]
David Brazdil0f672f62019-12-10 10:32:29 +00001// SPDX-License-Identifier: GPL-2.0
2/*
3 * Software nodes for the firmware node framework.
4 *
5 * Copyright (C) 2018, Intel Corporation
6 * Author: Heikki Krogerus <heikki.krogerus@linux.intel.com>
7 */
8
9#include <linux/device.h>
10#include <linux/kernel.h>
11#include <linux/property.h>
12#include <linux/slab.h>
13
14struct swnode {
15 int id;
16 struct kobject kobj;
17 struct fwnode_handle fwnode;
18 const struct software_node *node;
19
20 /* hierarchy */
21 struct ida child_ids;
22 struct list_head entry;
23 struct list_head children;
24 struct swnode *parent;
25
26 unsigned int allocated:1;
27};
28
29static DEFINE_IDA(swnode_root_ids);
30static struct kset *swnode_kset;
31
32#define kobj_to_swnode(_kobj_) container_of(_kobj_, struct swnode, kobj)
33
34static const struct fwnode_operations software_node_ops;
35
36bool is_software_node(const struct fwnode_handle *fwnode)
37{
38 return !IS_ERR_OR_NULL(fwnode) && fwnode->ops == &software_node_ops;
39}
40EXPORT_SYMBOL_GPL(is_software_node);
41
42#define to_swnode(__fwnode) \
43 ({ \
44 typeof(__fwnode) __to_swnode_fwnode = __fwnode; \
45 \
46 is_software_node(__to_swnode_fwnode) ? \
47 container_of(__to_swnode_fwnode, \
48 struct swnode, fwnode) : NULL; \
49 })
50
51static struct swnode *
52software_node_to_swnode(const struct software_node *node)
53{
54 struct swnode *swnode = NULL;
55 struct kobject *k;
56
57 if (!node)
58 return NULL;
59
60 spin_lock(&swnode_kset->list_lock);
61
62 list_for_each_entry(k, &swnode_kset->list, entry) {
63 swnode = kobj_to_swnode(k);
64 if (swnode->node == node)
65 break;
66 swnode = NULL;
67 }
68
69 spin_unlock(&swnode_kset->list_lock);
70
71 return swnode;
72}
73
74const struct software_node *to_software_node(struct fwnode_handle *fwnode)
75{
76 struct swnode *swnode = to_swnode(fwnode);
77
78 return swnode ? swnode->node : NULL;
79}
80EXPORT_SYMBOL_GPL(to_software_node);
81
82struct fwnode_handle *software_node_fwnode(const struct software_node *node)
83{
84 struct swnode *swnode = software_node_to_swnode(node);
85
86 return swnode ? &swnode->fwnode : NULL;
87}
88EXPORT_SYMBOL_GPL(software_node_fwnode);
89
90/* -------------------------------------------------------------------------- */
91/* property_entry processing */
92
93static const struct property_entry *
94property_entry_get(const struct property_entry *prop, const char *name)
95{
96 if (!prop)
97 return NULL;
98
99 for (; prop->name; prop++)
100 if (!strcmp(name, prop->name))
101 return prop;
102
103 return NULL;
104}
105
106static void
107property_set_pointer(struct property_entry *prop, const void *pointer)
108{
109 switch (prop->type) {
110 case DEV_PROP_U8:
111 if (prop->is_array)
112 prop->pointer.u8_data = pointer;
113 else
114 prop->value.u8_data = *((u8 *)pointer);
115 break;
116 case DEV_PROP_U16:
117 if (prop->is_array)
118 prop->pointer.u16_data = pointer;
119 else
120 prop->value.u16_data = *((u16 *)pointer);
121 break;
122 case DEV_PROP_U32:
123 if (prop->is_array)
124 prop->pointer.u32_data = pointer;
125 else
126 prop->value.u32_data = *((u32 *)pointer);
127 break;
128 case DEV_PROP_U64:
129 if (prop->is_array)
130 prop->pointer.u64_data = pointer;
131 else
132 prop->value.u64_data = *((u64 *)pointer);
133 break;
134 case DEV_PROP_STRING:
135 if (prop->is_array)
136 prop->pointer.str = pointer;
137 else
138 prop->value.str = pointer;
139 break;
140 default:
141 break;
142 }
143}
144
145static const void *property_get_pointer(const struct property_entry *prop)
146{
147 switch (prop->type) {
148 case DEV_PROP_U8:
149 if (prop->is_array)
150 return prop->pointer.u8_data;
151 return &prop->value.u8_data;
152 case DEV_PROP_U16:
153 if (prop->is_array)
154 return prop->pointer.u16_data;
155 return &prop->value.u16_data;
156 case DEV_PROP_U32:
157 if (prop->is_array)
158 return prop->pointer.u32_data;
159 return &prop->value.u32_data;
160 case DEV_PROP_U64:
161 if (prop->is_array)
162 return prop->pointer.u64_data;
163 return &prop->value.u64_data;
164 case DEV_PROP_STRING:
165 if (prop->is_array)
166 return prop->pointer.str;
167 return &prop->value.str;
168 default:
169 return NULL;
170 }
171}
172
173static const void *property_entry_find(const struct property_entry *props,
174 const char *propname, size_t length)
175{
176 const struct property_entry *prop;
177 const void *pointer;
178
179 prop = property_entry_get(props, propname);
180 if (!prop)
181 return ERR_PTR(-EINVAL);
182 pointer = property_get_pointer(prop);
183 if (!pointer)
184 return ERR_PTR(-ENODATA);
185 if (length > prop->length)
186 return ERR_PTR(-EOVERFLOW);
187 return pointer;
188}
189
190static int property_entry_read_u8_array(const struct property_entry *props,
191 const char *propname,
192 u8 *values, size_t nval)
193{
194 const void *pointer;
195 size_t length = nval * sizeof(*values);
196
197 pointer = property_entry_find(props, propname, length);
198 if (IS_ERR(pointer))
199 return PTR_ERR(pointer);
200
201 memcpy(values, pointer, length);
202 return 0;
203}
204
205static int property_entry_read_u16_array(const struct property_entry *props,
206 const char *propname,
207 u16 *values, size_t nval)
208{
209 const void *pointer;
210 size_t length = nval * sizeof(*values);
211
212 pointer = property_entry_find(props, propname, length);
213 if (IS_ERR(pointer))
214 return PTR_ERR(pointer);
215
216 memcpy(values, pointer, length);
217 return 0;
218}
219
220static int property_entry_read_u32_array(const struct property_entry *props,
221 const char *propname,
222 u32 *values, size_t nval)
223{
224 const void *pointer;
225 size_t length = nval * sizeof(*values);
226
227 pointer = property_entry_find(props, propname, length);
228 if (IS_ERR(pointer))
229 return PTR_ERR(pointer);
230
231 memcpy(values, pointer, length);
232 return 0;
233}
234
235static int property_entry_read_u64_array(const struct property_entry *props,
236 const char *propname,
237 u64 *values, size_t nval)
238{
239 const void *pointer;
240 size_t length = nval * sizeof(*values);
241
242 pointer = property_entry_find(props, propname, length);
243 if (IS_ERR(pointer))
244 return PTR_ERR(pointer);
245
246 memcpy(values, pointer, length);
247 return 0;
248}
249
250static int
251property_entry_count_elems_of_size(const struct property_entry *props,
252 const char *propname, size_t length)
253{
254 const struct property_entry *prop;
255
256 prop = property_entry_get(props, propname);
257 if (!prop)
258 return -EINVAL;
259
260 return prop->length / length;
261}
262
263static int property_entry_read_int_array(const struct property_entry *props,
264 const char *name,
265 unsigned int elem_size, void *val,
266 size_t nval)
267{
268 if (!val)
269 return property_entry_count_elems_of_size(props, name,
270 elem_size);
271 switch (elem_size) {
272 case sizeof(u8):
273 return property_entry_read_u8_array(props, name, val, nval);
274 case sizeof(u16):
275 return property_entry_read_u16_array(props, name, val, nval);
276 case sizeof(u32):
277 return property_entry_read_u32_array(props, name, val, nval);
278 case sizeof(u64):
279 return property_entry_read_u64_array(props, name, val, nval);
280 }
281
282 return -ENXIO;
283}
284
285static int property_entry_read_string_array(const struct property_entry *props,
286 const char *propname,
287 const char **strings, size_t nval)
288{
289 const struct property_entry *prop;
290 const void *pointer;
291 size_t array_len, length;
292
293 /* Find out the array length. */
294 prop = property_entry_get(props, propname);
295 if (!prop)
296 return -EINVAL;
297
298 if (prop->is_array)
299 /* Find the length of an array. */
300 array_len = property_entry_count_elems_of_size(props, propname,
301 sizeof(const char *));
302 else
303 /* The array length for a non-array string property is 1. */
304 array_len = 1;
305
306 /* Return how many there are if strings is NULL. */
307 if (!strings)
308 return array_len;
309
310 array_len = min(nval, array_len);
311 length = array_len * sizeof(*strings);
312
313 pointer = property_entry_find(props, propname, length);
314 if (IS_ERR(pointer))
315 return PTR_ERR(pointer);
316
317 memcpy(strings, pointer, length);
318
319 return array_len;
320}
321
322static void property_entry_free_data(const struct property_entry *p)
323{
324 const void *pointer = property_get_pointer(p);
325 size_t i, nval;
326
327 if (p->is_array) {
328 if (p->type == DEV_PROP_STRING && p->pointer.str) {
329 nval = p->length / sizeof(const char *);
330 for (i = 0; i < nval; i++)
331 kfree(p->pointer.str[i]);
332 }
333 kfree(pointer);
334 } else if (p->type == DEV_PROP_STRING) {
335 kfree(p->value.str);
336 }
337 kfree(p->name);
338}
339
340static int property_copy_string_array(struct property_entry *dst,
341 const struct property_entry *src)
342{
343 const char **d;
344 size_t nval = src->length / sizeof(*d);
345 int i;
346
347 d = kcalloc(nval, sizeof(*d), GFP_KERNEL);
348 if (!d)
349 return -ENOMEM;
350
351 for (i = 0; i < nval; i++) {
352 d[i] = kstrdup(src->pointer.str[i], GFP_KERNEL);
353 if (!d[i] && src->pointer.str[i]) {
354 while (--i >= 0)
355 kfree(d[i]);
356 kfree(d);
357 return -ENOMEM;
358 }
359 }
360
361 dst->pointer.str = d;
362 return 0;
363}
364
365static int property_entry_copy_data(struct property_entry *dst,
366 const struct property_entry *src)
367{
368 const void *pointer = property_get_pointer(src);
369 const void *new;
370 int error;
371
372 if (src->is_array) {
373 if (!src->length)
374 return -ENODATA;
375
376 if (src->type == DEV_PROP_STRING) {
377 error = property_copy_string_array(dst, src);
378 if (error)
379 return error;
380 new = dst->pointer.str;
381 } else {
382 new = kmemdup(pointer, src->length, GFP_KERNEL);
383 if (!new)
384 return -ENOMEM;
385 }
386 } else if (src->type == DEV_PROP_STRING) {
387 new = kstrdup(src->value.str, GFP_KERNEL);
388 if (!new && src->value.str)
389 return -ENOMEM;
390 } else {
391 new = pointer;
392 }
393
394 dst->length = src->length;
395 dst->is_array = src->is_array;
396 dst->type = src->type;
397
398 property_set_pointer(dst, new);
399
400 dst->name = kstrdup(src->name, GFP_KERNEL);
401 if (!dst->name)
402 goto out_free_data;
403
404 return 0;
405
406out_free_data:
407 property_entry_free_data(dst);
408 return -ENOMEM;
409}
410
411/**
412 * property_entries_dup - duplicate array of properties
413 * @properties: array of properties to copy
414 *
415 * This function creates a deep copy of the given NULL-terminated array
416 * of property entries.
417 */
418struct property_entry *
419property_entries_dup(const struct property_entry *properties)
420{
421 struct property_entry *p;
422 int i, n = 0;
423 int ret;
424
425 if (!properties)
426 return NULL;
427
428 while (properties[n].name)
429 n++;
430
431 p = kcalloc(n + 1, sizeof(*p), GFP_KERNEL);
432 if (!p)
433 return ERR_PTR(-ENOMEM);
434
435 for (i = 0; i < n; i++) {
436 ret = property_entry_copy_data(&p[i], &properties[i]);
437 if (ret) {
438 while (--i >= 0)
439 property_entry_free_data(&p[i]);
440 kfree(p);
441 return ERR_PTR(ret);
442 }
443 }
444
445 return p;
446}
447EXPORT_SYMBOL_GPL(property_entries_dup);
448
449/**
450 * property_entries_free - free previously allocated array of properties
451 * @properties: array of properties to destroy
452 *
453 * This function frees given NULL-terminated array of property entries,
454 * along with their data.
455 */
456void property_entries_free(const struct property_entry *properties)
457{
458 const struct property_entry *p;
459
460 if (!properties)
461 return;
462
463 for (p = properties; p->name; p++)
464 property_entry_free_data(p);
465
466 kfree(properties);
467}
468EXPORT_SYMBOL_GPL(property_entries_free);
469
470/* -------------------------------------------------------------------------- */
471/* fwnode operations */
472
473static struct fwnode_handle *software_node_get(struct fwnode_handle *fwnode)
474{
475 struct swnode *swnode = to_swnode(fwnode);
476
477 kobject_get(&swnode->kobj);
478
479 return &swnode->fwnode;
480}
481
482static void software_node_put(struct fwnode_handle *fwnode)
483{
484 struct swnode *swnode = to_swnode(fwnode);
485
486 kobject_put(&swnode->kobj);
487}
488
489static bool software_node_property_present(const struct fwnode_handle *fwnode,
490 const char *propname)
491{
492 struct swnode *swnode = to_swnode(fwnode);
493
494 return !!property_entry_get(swnode->node->properties, propname);
495}
496
497static int software_node_read_int_array(const struct fwnode_handle *fwnode,
498 const char *propname,
499 unsigned int elem_size, void *val,
500 size_t nval)
501{
502 struct swnode *swnode = to_swnode(fwnode);
503
504 return property_entry_read_int_array(swnode->node->properties, propname,
505 elem_size, val, nval);
506}
507
508static int software_node_read_string_array(const struct fwnode_handle *fwnode,
509 const char *propname,
510 const char **val, size_t nval)
511{
512 struct swnode *swnode = to_swnode(fwnode);
513
514 return property_entry_read_string_array(swnode->node->properties,
515 propname, val, nval);
516}
517
518static struct fwnode_handle *
519software_node_get_parent(const struct fwnode_handle *fwnode)
520{
521 struct swnode *swnode = to_swnode(fwnode);
522
Olivier Deprez0e641232021-09-23 10:07:05 +0200523 if (!swnode || !swnode->parent)
524 return NULL;
525
526 return fwnode_handle_get(&swnode->parent->fwnode);
David Brazdil0f672f62019-12-10 10:32:29 +0000527}
528
529static struct fwnode_handle *
530software_node_get_next_child(const struct fwnode_handle *fwnode,
531 struct fwnode_handle *child)
532{
533 struct swnode *p = to_swnode(fwnode);
534 struct swnode *c = to_swnode(child);
535
536 if (!p || list_empty(&p->children) ||
Olivier Deprez0e641232021-09-23 10:07:05 +0200537 (c && list_is_last(&c->entry, &p->children))) {
538 fwnode_handle_put(child);
David Brazdil0f672f62019-12-10 10:32:29 +0000539 return NULL;
Olivier Deprez0e641232021-09-23 10:07:05 +0200540 }
David Brazdil0f672f62019-12-10 10:32:29 +0000541
542 if (c)
543 c = list_next_entry(c, entry);
544 else
545 c = list_first_entry(&p->children, struct swnode, entry);
Olivier Deprez0e641232021-09-23 10:07:05 +0200546
547 fwnode_handle_put(child);
548 return fwnode_handle_get(&c->fwnode);
David Brazdil0f672f62019-12-10 10:32:29 +0000549}
550
551static struct fwnode_handle *
552software_node_get_named_child_node(const struct fwnode_handle *fwnode,
553 const char *childname)
554{
555 struct swnode *swnode = to_swnode(fwnode);
556 struct swnode *child;
557
558 if (!swnode || list_empty(&swnode->children))
559 return NULL;
560
561 list_for_each_entry(child, &swnode->children, entry) {
562 if (!strcmp(childname, kobject_name(&child->kobj))) {
563 kobject_get(&child->kobj);
564 return &child->fwnode;
565 }
566 }
567 return NULL;
568}
569
570static int
571software_node_get_reference_args(const struct fwnode_handle *fwnode,
572 const char *propname, const char *nargs_prop,
573 unsigned int nargs, unsigned int index,
574 struct fwnode_reference_args *args)
575{
576 struct swnode *swnode = to_swnode(fwnode);
577 const struct software_node_reference *ref;
578 const struct property_entry *prop;
579 struct fwnode_handle *refnode;
580 int i;
581
582 if (!swnode || !swnode->node->references)
583 return -ENOENT;
584
585 for (ref = swnode->node->references; ref->name; ref++)
586 if (!strcmp(ref->name, propname))
587 break;
588
589 if (!ref->name || index > (ref->nrefs - 1))
590 return -ENOENT;
591
592 refnode = software_node_fwnode(ref->refs[index].node);
593 if (!refnode)
594 return -ENOENT;
595
596 if (nargs_prop) {
597 prop = property_entry_get(swnode->node->properties, nargs_prop);
598 if (!prop)
599 return -EINVAL;
600
601 nargs = prop->value.u32_data;
602 }
603
604 if (nargs > NR_FWNODE_REFERENCE_ARGS)
605 return -EINVAL;
606
607 args->fwnode = software_node_get(refnode);
608 args->nargs = nargs;
609
610 for (i = 0; i < nargs; i++)
611 args->args[i] = ref->refs[index].args[i];
612
613 return 0;
614}
615
616static const struct fwnode_operations software_node_ops = {
617 .get = software_node_get,
618 .put = software_node_put,
619 .property_present = software_node_property_present,
620 .property_read_int_array = software_node_read_int_array,
621 .property_read_string_array = software_node_read_string_array,
622 .get_parent = software_node_get_parent,
623 .get_next_child_node = software_node_get_next_child,
624 .get_named_child_node = software_node_get_named_child_node,
625 .get_reference_args = software_node_get_reference_args
626};
627
628/* -------------------------------------------------------------------------- */
629
630/**
631 * software_node_find_by_name - Find software node by name
632 * @parent: Parent of the software node
633 * @name: Name of the software node
634 *
635 * The function will find a node that is child of @parent and that is named
636 * @name. If no node is found, the function returns NULL.
637 *
638 * NOTE: you will need to drop the reference with fwnode_handle_put() after use.
639 */
640const struct software_node *
641software_node_find_by_name(const struct software_node *parent, const char *name)
642{
643 struct swnode *swnode = NULL;
644 struct kobject *k;
645
646 if (!name)
647 return NULL;
648
649 spin_lock(&swnode_kset->list_lock);
650
651 list_for_each_entry(k, &swnode_kset->list, entry) {
652 swnode = kobj_to_swnode(k);
653 if (parent == swnode->node->parent && swnode->node->name &&
654 !strcmp(name, swnode->node->name)) {
655 kobject_get(&swnode->kobj);
656 break;
657 }
658 swnode = NULL;
659 }
660
661 spin_unlock(&swnode_kset->list_lock);
662
663 return swnode ? swnode->node : NULL;
664}
665EXPORT_SYMBOL_GPL(software_node_find_by_name);
666
667static int
668software_node_register_properties(struct software_node *node,
669 const struct property_entry *properties)
670{
671 struct property_entry *props;
672
673 props = property_entries_dup(properties);
674 if (IS_ERR(props))
675 return PTR_ERR(props);
676
677 node->properties = props;
678
679 return 0;
680}
681
682static void software_node_release(struct kobject *kobj)
683{
684 struct swnode *swnode = kobj_to_swnode(kobj);
685
Olivier Deprez0e641232021-09-23 10:07:05 +0200686 if (swnode->parent) {
687 ida_simple_remove(&swnode->parent->child_ids, swnode->id);
688 list_del(&swnode->entry);
689 } else {
690 ida_simple_remove(&swnode_root_ids, swnode->id);
691 }
692
David Brazdil0f672f62019-12-10 10:32:29 +0000693 if (swnode->allocated) {
694 property_entries_free(swnode->node->properties);
695 kfree(swnode->node);
696 }
697 ida_destroy(&swnode->child_ids);
698 kfree(swnode);
699}
700
701static struct kobj_type software_node_type = {
702 .release = software_node_release,
703 .sysfs_ops = &kobj_sysfs_ops,
704};
705
706static struct fwnode_handle *
707swnode_register(const struct software_node *node, struct swnode *parent,
708 unsigned int allocated)
709{
710 struct swnode *swnode;
711 int ret;
712
713 swnode = kzalloc(sizeof(*swnode), GFP_KERNEL);
714 if (!swnode) {
715 ret = -ENOMEM;
716 goto out_err;
717 }
718
719 ret = ida_simple_get(parent ? &parent->child_ids : &swnode_root_ids,
720 0, 0, GFP_KERNEL);
721 if (ret < 0) {
722 kfree(swnode);
723 goto out_err;
724 }
725
726 swnode->id = ret;
727 swnode->node = node;
728 swnode->parent = parent;
729 swnode->allocated = allocated;
730 swnode->kobj.kset = swnode_kset;
731 swnode->fwnode.ops = &software_node_ops;
732
733 ida_init(&swnode->child_ids);
734 INIT_LIST_HEAD(&swnode->entry);
735 INIT_LIST_HEAD(&swnode->children);
736
737 if (node->name)
738 ret = kobject_init_and_add(&swnode->kobj, &software_node_type,
739 parent ? &parent->kobj : NULL,
740 "%s", node->name);
741 else
742 ret = kobject_init_and_add(&swnode->kobj, &software_node_type,
743 parent ? &parent->kobj : NULL,
744 "node%d", swnode->id);
745 if (ret) {
746 kobject_put(&swnode->kobj);
747 return ERR_PTR(ret);
748 }
749
750 if (parent)
751 list_add_tail(&swnode->entry, &parent->children);
752
753 kobject_uevent(&swnode->kobj, KOBJ_ADD);
754 return &swnode->fwnode;
755
756out_err:
757 if (allocated)
758 property_entries_free(node->properties);
759 return ERR_PTR(ret);
760}
761
762/**
763 * software_node_register_nodes - Register an array of software nodes
764 * @nodes: Zero terminated array of software nodes to be registered
765 *
766 * Register multiple software nodes at once.
767 */
768int software_node_register_nodes(const struct software_node *nodes)
769{
770 int ret;
771 int i;
772
773 for (i = 0; nodes[i].name; i++) {
774 ret = software_node_register(&nodes[i]);
775 if (ret) {
776 software_node_unregister_nodes(nodes);
777 return ret;
778 }
779 }
780
781 return 0;
782}
783EXPORT_SYMBOL_GPL(software_node_register_nodes);
784
785/**
786 * software_node_unregister_nodes - Unregister an array of software nodes
787 * @nodes: Zero terminated array of software nodes to be unregistered
788 *
789 * Unregister multiple software nodes at once.
790 */
791void software_node_unregister_nodes(const struct software_node *nodes)
792{
793 struct swnode *swnode;
794 int i;
795
796 for (i = 0; nodes[i].name; i++) {
797 swnode = software_node_to_swnode(&nodes[i]);
798 if (swnode)
799 fwnode_remove_software_node(&swnode->fwnode);
800 }
801}
802EXPORT_SYMBOL_GPL(software_node_unregister_nodes);
803
804/**
805 * software_node_register - Register static software node
806 * @node: The software node to be registered
807 */
808int software_node_register(const struct software_node *node)
809{
810 struct swnode *parent = software_node_to_swnode(node->parent);
811
812 if (software_node_to_swnode(node))
813 return -EEXIST;
814
Olivier Deprez0e641232021-09-23 10:07:05 +0200815 if (node->parent && !parent)
816 return -EINVAL;
817
David Brazdil0f672f62019-12-10 10:32:29 +0000818 return PTR_ERR_OR_ZERO(swnode_register(node, parent, 0));
819}
820EXPORT_SYMBOL_GPL(software_node_register);
821
822struct fwnode_handle *
823fwnode_create_software_node(const struct property_entry *properties,
824 const struct fwnode_handle *parent)
825{
826 struct software_node *node;
827 struct swnode *p = NULL;
828 int ret;
829
830 if (parent) {
831 if (IS_ERR(parent))
832 return ERR_CAST(parent);
833 if (!is_software_node(parent))
834 return ERR_PTR(-EINVAL);
835 p = to_swnode(parent);
836 }
837
838 node = kzalloc(sizeof(*node), GFP_KERNEL);
839 if (!node)
840 return ERR_PTR(-ENOMEM);
841
842 ret = software_node_register_properties(node, properties);
843 if (ret) {
844 kfree(node);
845 return ERR_PTR(ret);
846 }
847
848 node->parent = p ? p->node : NULL;
849
850 return swnode_register(node, p, 1);
851}
852EXPORT_SYMBOL_GPL(fwnode_create_software_node);
853
854void fwnode_remove_software_node(struct fwnode_handle *fwnode)
855{
856 struct swnode *swnode = to_swnode(fwnode);
857
858 if (!swnode)
859 return;
860
David Brazdil0f672f62019-12-10 10:32:29 +0000861 kobject_put(&swnode->kobj);
862}
863EXPORT_SYMBOL_GPL(fwnode_remove_software_node);
864
865int software_node_notify(struct device *dev, unsigned long action)
866{
867 struct fwnode_handle *fwnode = dev_fwnode(dev);
868 struct swnode *swnode;
869 int ret;
870
871 if (!fwnode)
872 return 0;
873
874 if (!is_software_node(fwnode))
875 fwnode = fwnode->secondary;
876 if (!is_software_node(fwnode))
877 return 0;
878
879 swnode = to_swnode(fwnode);
880
881 switch (action) {
882 case KOBJ_ADD:
883 ret = sysfs_create_link(&dev->kobj, &swnode->kobj,
884 "software_node");
885 if (ret)
886 break;
887
888 ret = sysfs_create_link(&swnode->kobj, &dev->kobj,
889 dev_name(dev));
890 if (ret) {
891 sysfs_remove_link(&dev->kobj, "software_node");
892 break;
893 }
894 kobject_get(&swnode->kobj);
895 break;
896 case KOBJ_REMOVE:
897 sysfs_remove_link(&swnode->kobj, dev_name(dev));
898 sysfs_remove_link(&dev->kobj, "software_node");
899 kobject_put(&swnode->kobj);
900 break;
901 default:
902 break;
903 }
904
905 return 0;
906}
907
908static int __init software_node_init(void)
909{
910 swnode_kset = kset_create_and_add("software_nodes", NULL, kernel_kobj);
911 if (!swnode_kset)
912 return -ENOMEM;
913 return 0;
914}
915postcore_initcall(software_node_init);
916
917static void __exit software_node_exit(void)
918{
919 ida_destroy(&swnode_root_ids);
920 kset_unregister(swnode_kset);
921}
922__exitcall(software_node_exit);