]> git.proxmox.com Git - mirror_ubuntu-jammy-kernel.git/blame - drivers/base/swnode.c
device property: export set_secondary_fwnode() to modules
[mirror_ubuntu-jammy-kernel.git] / drivers / base / swnode.c
CommitLineData
59abd836
HK
1// 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
80488a6b 14struct swnode {
59abd836
HK
15 int id;
16 struct kobject kobj;
17 struct fwnode_handle fwnode;
80488a6b 18 const struct software_node *node;
59abd836
HK
19
20 /* hierarchy */
21 struct ida child_ids;
22 struct list_head entry;
23 struct list_head children;
80488a6b 24 struct swnode *parent;
59abd836 25
80488a6b 26 unsigned int allocated:1;
59abd836
HK
27};
28
29static DEFINE_IDA(swnode_root_ids);
30static struct kset *swnode_kset;
31
80488a6b 32#define kobj_to_swnode(_kobj_) container_of(_kobj_, struct swnode, kobj)
59abd836
HK
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}
80488a6b 40EXPORT_SYMBOL_GPL(is_software_node);
59abd836 41
80488a6b 42#define to_swnode(__fwnode) \
59abd836 43 ({ \
80488a6b 44 typeof(__fwnode) __to_swnode_fwnode = __fwnode; \
59abd836 45 \
80488a6b
HK
46 is_software_node(__to_swnode_fwnode) ? \
47 container_of(__to_swnode_fwnode, \
48 struct swnode, fwnode) : NULL; \
59abd836
HK
49 })
50
80488a6b
HK
51static struct swnode *
52software_node_to_swnode(const struct software_node *node)
53{
61636873 54 struct swnode *swnode = NULL;
80488a6b
HK
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
56c9aa07 74const struct software_node *to_software_node(const struct fwnode_handle *fwnode)
80488a6b 75{
56c9aa07 76 const struct swnode *swnode = to_swnode(fwnode);
80488a6b
HK
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
59abd836
HK
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 const void *property_get_pointer(const struct property_entry *prop)
107{
1f74d70f 108 if (!prop->length)
59abd836 109 return NULL;
1f74d70f 110
e6bff466 111 return prop->is_inline ? &prop->value : prop->pointer;
59abd836
HK
112}
113
114static const void *property_entry_find(const struct property_entry *props,
115 const char *propname, size_t length)
116{
117 const struct property_entry *prop;
118 const void *pointer;
119
120 prop = property_entry_get(props, propname);
121 if (!prop)
122 return ERR_PTR(-EINVAL);
123 pointer = property_get_pointer(prop);
124 if (!pointer)
125 return ERR_PTR(-ENODATA);
126 if (length > prop->length)
127 return ERR_PTR(-EOVERFLOW);
128 return pointer;
129}
130
59abd836
HK
131static int
132property_entry_count_elems_of_size(const struct property_entry *props,
133 const char *propname, size_t length)
134{
135 const struct property_entry *prop;
136
137 prop = property_entry_get(props, propname);
138 if (!prop)
139 return -EINVAL;
140
141 return prop->length / length;
142}
143
144static int property_entry_read_int_array(const struct property_entry *props,
145 const char *name,
146 unsigned int elem_size, void *val,
147 size_t nval)
148{
5236f5fe
DT
149 const void *pointer;
150 size_t length;
151
59abd836
HK
152 if (!val)
153 return property_entry_count_elems_of_size(props, name,
154 elem_size);
59abd836 155
5236f5fe
DT
156 if (!is_power_of_2(elem_size) || elem_size > sizeof(u64))
157 return -ENXIO;
158
159 length = nval * elem_size;
160
161 pointer = property_entry_find(props, name, length);
162 if (IS_ERR(pointer))
163 return PTR_ERR(pointer);
164
165 memcpy(val, pointer, length);
166 return 0;
59abd836
HK
167}
168
169static int property_entry_read_string_array(const struct property_entry *props,
170 const char *propname,
171 const char **strings, size_t nval)
172{
59abd836 173 const void *pointer;
1afc1403
DT
174 size_t length;
175 int array_len;
59abd836
HK
176
177 /* Find out the array length. */
1afc1403
DT
178 array_len = property_entry_count_elems_of_size(props, propname,
179 sizeof(const char *));
180 if (array_len < 0)
181 return array_len;
59abd836
HK
182
183 /* Return how many there are if strings is NULL. */
184 if (!strings)
185 return array_len;
186
1afc1403 187 array_len = min_t(size_t, nval, array_len);
59abd836
HK
188 length = array_len * sizeof(*strings);
189
190 pointer = property_entry_find(props, propname, length);
191 if (IS_ERR(pointer))
192 return PTR_ERR(pointer);
193
194 memcpy(strings, pointer, length);
195
196 return array_len;
197}
198
ed1cdf31
HK
199static void property_entry_free_data(const struct property_entry *p)
200{
1f74d70f 201 const char * const *src_str;
ed1cdf31
HK
202 size_t i, nval;
203
996b0830
DT
204 if (p->type == DEV_PROP_STRING) {
205 src_str = property_get_pointer(p);
206 nval = p->length / sizeof(*src_str);
207 for (i = 0; i < nval; i++)
208 kfree(src_str[i]);
ed1cdf31 209 }
996b0830
DT
210
211 if (!p->is_inline)
212 kfree(p->pointer);
213
ed1cdf31
HK
214 kfree(p->name);
215}
216
996b0830
DT
217static bool property_copy_string_array(const char **dst_ptr,
218 const char * const *src_ptr,
219 size_t nval)
ed1cdf31 220{
ed1cdf31
HK
221 int i;
222
ed1cdf31 223 for (i = 0; i < nval; i++) {
996b0830
DT
224 dst_ptr[i] = kstrdup(src_ptr[i], GFP_KERNEL);
225 if (!dst_ptr[i] && src_ptr[i]) {
ed1cdf31 226 while (--i >= 0)
996b0830
DT
227 kfree(dst_ptr[i]);
228 return false;
ed1cdf31
HK
229 }
230 }
231
996b0830 232 return true;
ed1cdf31
HK
233}
234
235static int property_entry_copy_data(struct property_entry *dst,
236 const struct property_entry *src)
237{
238 const void *pointer = property_get_pointer(src);
996b0830
DT
239 void *dst_ptr;
240 size_t nval;
241
242 /*
243 * Properties with no data should not be marked as stored
244 * out of line.
245 */
246 if (!src->is_inline && !src->length)
247 return -ENODATA;
248
e64b674b
DT
249 /*
250 * Reference properties are never stored inline as
251 * they are too big.
252 */
253 if (src->type == DEV_PROP_REF && src->is_inline)
254 return -EINVAL;
255
996b0830
DT
256 if (src->length <= sizeof(dst->value)) {
257 dst_ptr = &dst->value;
258 dst->is_inline = true;
259 } else {
260 dst_ptr = kmalloc(src->length, GFP_KERNEL);
261 if (!dst_ptr)
ed1cdf31 262 return -ENOMEM;
996b0830
DT
263 dst->pointer = dst_ptr;
264 }
1f74d70f 265
996b0830
DT
266 if (src->type == DEV_PROP_STRING) {
267 nval = src->length / sizeof(const char *);
268 if (!property_copy_string_array(dst_ptr, pointer, nval)) {
269 if (!dst->is_inline)
270 kfree(dst->pointer);
271 return -ENOMEM;
272 }
ed1cdf31 273 } else {
996b0830 274 memcpy(dst_ptr, pointer, src->length);
ed1cdf31
HK
275 }
276
277 dst->length = src->length;
ed1cdf31 278 dst->type = src->type;
ed1cdf31 279 dst->name = kstrdup(src->name, GFP_KERNEL);
996b0830
DT
280 if (!dst->name) {
281 property_entry_free_data(dst);
282 return -ENOMEM;
283 }
ed1cdf31
HK
284
285 return 0;
ed1cdf31
HK
286}
287
288/**
289 * property_entries_dup - duplicate array of properties
290 * @properties: array of properties to copy
291 *
292 * This function creates a deep copy of the given NULL-terminated array
293 * of property entries.
294 */
295struct property_entry *
296property_entries_dup(const struct property_entry *properties)
297{
298 struct property_entry *p;
299 int i, n = 0;
300 int ret;
301
a7996986
HK
302 if (!properties)
303 return NULL;
304
ed1cdf31
HK
305 while (properties[n].name)
306 n++;
307
308 p = kcalloc(n + 1, sizeof(*p), GFP_KERNEL);
309 if (!p)
310 return ERR_PTR(-ENOMEM);
311
312 for (i = 0; i < n; i++) {
313 ret = property_entry_copy_data(&p[i], &properties[i]);
314 if (ret) {
315 while (--i >= 0)
316 property_entry_free_data(&p[i]);
317 kfree(p);
318 return ERR_PTR(ret);
319 }
320 }
321
322 return p;
323}
324EXPORT_SYMBOL_GPL(property_entries_dup);
325
326/**
327 * property_entries_free - free previously allocated array of properties
328 * @properties: array of properties to destroy
329 *
330 * This function frees given NULL-terminated array of property entries,
331 * along with their data.
332 */
333void property_entries_free(const struct property_entry *properties)
334{
335 const struct property_entry *p;
336
337 if (!properties)
338 return;
339
340 for (p = properties; p->name; p++)
341 property_entry_free_data(p);
342
343 kfree(properties);
344}
345EXPORT_SYMBOL_GPL(property_entries_free);
346
59abd836
HK
347/* -------------------------------------------------------------------------- */
348/* fwnode operations */
349
350static struct fwnode_handle *software_node_get(struct fwnode_handle *fwnode)
351{
80488a6b 352 struct swnode *swnode = to_swnode(fwnode);
59abd836
HK
353
354 kobject_get(&swnode->kobj);
355
356 return &swnode->fwnode;
357}
358
359static void software_node_put(struct fwnode_handle *fwnode)
360{
80488a6b 361 struct swnode *swnode = to_swnode(fwnode);
59abd836
HK
362
363 kobject_put(&swnode->kobj);
364}
365
366static bool software_node_property_present(const struct fwnode_handle *fwnode,
367 const char *propname)
368{
80488a6b
HK
369 struct swnode *swnode = to_swnode(fwnode);
370
371 return !!property_entry_get(swnode->node->properties, propname);
59abd836
HK
372}
373
374static int software_node_read_int_array(const struct fwnode_handle *fwnode,
375 const char *propname,
376 unsigned int elem_size, void *val,
377 size_t nval)
378{
80488a6b 379 struct swnode *swnode = to_swnode(fwnode);
59abd836 380
80488a6b 381 return property_entry_read_int_array(swnode->node->properties, propname,
59abd836
HK
382 elem_size, val, nval);
383}
384
385static int software_node_read_string_array(const struct fwnode_handle *fwnode,
386 const char *propname,
387 const char **val, size_t nval)
388{
80488a6b 389 struct swnode *swnode = to_swnode(fwnode);
59abd836 390
80488a6b
HK
391 return property_entry_read_string_array(swnode->node->properties,
392 propname, val, nval);
59abd836
HK
393}
394
bc0500c1
SA
395static const char *
396software_node_get_name(const struct fwnode_handle *fwnode)
397{
398 const struct swnode *swnode = to_swnode(fwnode);
399
400 if (!swnode)
401 return "(null)";
402
403 return kobject_name(&swnode->kobj);
404}
405
e7e242bc
SA
406static const char *
407software_node_get_name_prefix(const struct fwnode_handle *fwnode)
408{
409 struct fwnode_handle *parent;
410 const char *prefix;
411
412 parent = fwnode_get_parent(fwnode);
413 if (!parent)
414 return "";
415
416 /* Figure out the prefix from the parents. */
417 while (is_software_node(parent))
418 parent = fwnode_get_next_parent(parent);
419
420 prefix = fwnode_get_name_prefix(parent);
421 fwnode_handle_put(parent);
422
423 /* Guess something if prefix was NULL. */
424 return prefix ?: "/";
425}
426
0e3edd94 427static struct fwnode_handle *
59abd836
HK
428software_node_get_parent(const struct fwnode_handle *fwnode)
429{
80488a6b 430 struct swnode *swnode = to_swnode(fwnode);
59abd836 431
51c100a6
SA
432 if (!swnode || !swnode->parent)
433 return NULL;
434
435 return fwnode_handle_get(&swnode->parent->fwnode);
59abd836
HK
436}
437
0e3edd94 438static struct fwnode_handle *
59abd836
HK
439software_node_get_next_child(const struct fwnode_handle *fwnode,
440 struct fwnode_handle *child)
441{
80488a6b
HK
442 struct swnode *p = to_swnode(fwnode);
443 struct swnode *c = to_swnode(child);
59abd836 444
1d8f062e 445 if (!p || list_empty(&p->children) ||
59abd836
HK
446 (c && list_is_last(&c->entry, &p->children)))
447 return NULL;
448
449 if (c)
450 c = list_next_entry(c, entry);
451 else
80488a6b 452 c = list_first_entry(&p->children, struct swnode, entry);
59abd836
HK
453 return &c->fwnode;
454}
455
34479820
HK
456static struct fwnode_handle *
457software_node_get_named_child_node(const struct fwnode_handle *fwnode,
458 const char *childname)
459{
80488a6b 460 struct swnode *swnode = to_swnode(fwnode);
80488a6b 461 struct swnode *child;
34479820
HK
462
463 if (!swnode || list_empty(&swnode->children))
464 return NULL;
465
466 list_for_each_entry(child, &swnode->children, entry) {
c959d0c2 467 if (!strcmp(childname, kobject_name(&child->kobj))) {
34479820
HK
468 kobject_get(&child->kobj);
469 return &child->fwnode;
470 }
471 }
472 return NULL;
473}
59abd836 474
b06184ac
HK
475static int
476software_node_get_reference_args(const struct fwnode_handle *fwnode,
477 const char *propname, const char *nargs_prop,
478 unsigned int nargs, unsigned int index,
479 struct fwnode_reference_args *args)
480{
481 struct swnode *swnode = to_swnode(fwnode);
e64b674b 482 const struct software_node_ref_args *ref_array;
e933bedd 483 const struct software_node_ref_args *ref;
b06184ac
HK
484 const struct property_entry *prop;
485 struct fwnode_handle *refnode;
996b0830
DT
486 u32 nargs_prop_val;
487 int error;
b06184ac
HK
488 int i;
489
e64b674b 490 if (!swnode)
b06184ac
HK
491 return -ENOENT;
492
e64b674b 493 prop = property_entry_get(swnode->node->properties, propname);
e933bedd
DT
494 if (!prop)
495 return -ENOENT;
496
497 if (prop->type != DEV_PROP_REF)
498 return -EINVAL;
e64b674b 499
e933bedd
DT
500 /*
501 * We expect that references are never stored inline, even
502 * single ones, as they are too big.
503 */
504 if (prop->is_inline)
505 return -EINVAL;
e64b674b 506
e933bedd
DT
507 if (index * sizeof(*ref) >= prop->length)
508 return -ENOENT;
e64b674b 509
e933bedd
DT
510 ref_array = prop->pointer;
511 ref = &ref_array[index];
b06184ac 512
e933bedd 513 refnode = software_node_fwnode(ref->node);
b06184ac
HK
514 if (!refnode)
515 return -ENOENT;
516
517 if (nargs_prop) {
996b0830
DT
518 error = property_entry_read_int_array(swnode->node->properties,
519 nargs_prop, sizeof(u32),
520 &nargs_prop_val, 1);
521 if (error)
522 return error;
b06184ac 523
996b0830 524 nargs = nargs_prop_val;
b06184ac
HK
525 }
526
527 if (nargs > NR_FWNODE_REFERENCE_ARGS)
528 return -EINVAL;
529
530 args->fwnode = software_node_get(refnode);
531 args->nargs = nargs;
532
533 for (i = 0; i < nargs; i++)
e933bedd 534 args->args[i] = ref->args[i];
b06184ac
HK
535
536 return 0;
537}
538
59abd836
HK
539static const struct fwnode_operations software_node_ops = {
540 .get = software_node_get,
541 .put = software_node_put,
542 .property_present = software_node_property_present,
543 .property_read_int_array = software_node_read_int_array,
544 .property_read_string_array = software_node_read_string_array,
bc0500c1 545 .get_name = software_node_get_name,
e7e242bc 546 .get_name_prefix = software_node_get_name_prefix,
59abd836
HK
547 .get_parent = software_node_get_parent,
548 .get_next_child_node = software_node_get_next_child,
34479820 549 .get_named_child_node = software_node_get_named_child_node,
b06184ac 550 .get_reference_args = software_node_get_reference_args
59abd836
HK
551};
552
553/* -------------------------------------------------------------------------- */
554
1666faed
HK
555/**
556 * software_node_find_by_name - Find software node by name
557 * @parent: Parent of the software node
558 * @name: Name of the software node
559 *
560 * The function will find a node that is child of @parent and that is named
561 * @name. If no node is found, the function returns NULL.
562 *
563 * NOTE: you will need to drop the reference with fwnode_handle_put() after use.
564 */
565const struct software_node *
566software_node_find_by_name(const struct software_node *parent, const char *name)
567{
016049a8 568 struct swnode *swnode = NULL;
1666faed
HK
569 struct kobject *k;
570
571 if (!name)
572 return NULL;
573
574 spin_lock(&swnode_kset->list_lock);
575
576 list_for_each_entry(k, &swnode_kset->list, entry) {
577 swnode = kobj_to_swnode(k);
578 if (parent == swnode->node->parent && swnode->node->name &&
579 !strcmp(name, swnode->node->name)) {
580 kobject_get(&swnode->kobj);
581 break;
582 }
583 swnode = NULL;
584 }
585
586 spin_unlock(&swnode_kset->list_lock);
587
588 return swnode ? swnode->node : NULL;
589}
590EXPORT_SYMBOL_GPL(software_node_find_by_name);
591
59abd836 592static int
80488a6b 593software_node_register_properties(struct software_node *node,
59abd836
HK
594 const struct property_entry *properties)
595{
596 struct property_entry *props;
597
598 props = property_entries_dup(properties);
599 if (IS_ERR(props))
600 return PTR_ERR(props);
601
80488a6b 602 node->properties = props;
59abd836
HK
603
604 return 0;
605}
606
607static void software_node_release(struct kobject *kobj)
608{
80488a6b 609 struct swnode *swnode = kobj_to_swnode(kobj);
59abd836 610
7589238a
BH
611 if (swnode->parent) {
612 ida_simple_remove(&swnode->parent->child_ids, swnode->id);
613 list_del(&swnode->entry);
614 } else {
615 ida_simple_remove(&swnode_root_ids, swnode->id);
616 }
617
80488a6b
HK
618 if (swnode->allocated) {
619 property_entries_free(swnode->node->properties);
620 kfree(swnode->node);
621 }
59abd836 622 ida_destroy(&swnode->child_ids);
59abd836
HK
623 kfree(swnode);
624}
625
626static struct kobj_type software_node_type = {
627 .release = software_node_release,
628 .sysfs_ops = &kobj_sysfs_ops,
629};
630
80488a6b
HK
631static struct fwnode_handle *
632swnode_register(const struct software_node *node, struct swnode *parent,
633 unsigned int allocated)
59abd836 634{
80488a6b 635 struct swnode *swnode;
59abd836
HK
636 int ret;
637
59abd836 638 swnode = kzalloc(sizeof(*swnode), GFP_KERNEL);
80488a6b
HK
639 if (!swnode) {
640 ret = -ENOMEM;
641 goto out_err;
642 }
59abd836 643
80488a6b
HK
644 ret = ida_simple_get(parent ? &parent->child_ids : &swnode_root_ids,
645 0, 0, GFP_KERNEL);
59abd836
HK
646 if (ret < 0) {
647 kfree(swnode);
80488a6b 648 goto out_err;
59abd836
HK
649 }
650
651 swnode->id = ret;
80488a6b
HK
652 swnode->node = node;
653 swnode->parent = parent;
654 swnode->allocated = allocated;
59abd836
HK
655 swnode->kobj.kset = swnode_kset;
656 swnode->fwnode.ops = &software_node_ops;
657
658 ida_init(&swnode->child_ids);
659 INIT_LIST_HEAD(&swnode->entry);
660 INIT_LIST_HEAD(&swnode->children);
59abd836 661
80488a6b
HK
662 if (node->name)
663 ret = kobject_init_and_add(&swnode->kobj, &software_node_type,
664 parent ? &parent->kobj : NULL,
665 "%s", node->name);
666 else
667 ret = kobject_init_and_add(&swnode->kobj, &software_node_type,
668 parent ? &parent->kobj : NULL,
669 "node%d", swnode->id);
59abd836
HK
670 if (ret) {
671 kobject_put(&swnode->kobj);
672 return ERR_PTR(ret);
673 }
674
80488a6b
HK
675 if (parent)
676 list_add_tail(&swnode->entry, &parent->children);
677
678 kobject_uevent(&swnode->kobj, KOBJ_ADD);
679 return &swnode->fwnode;
680
681out_err:
682 if (allocated)
683 property_entries_free(node->properties);
684 return ERR_PTR(ret);
685}
686
687/**
688 * software_node_register_nodes - Register an array of software nodes
689 * @nodes: Zero terminated array of software nodes to be registered
690 *
691 * Register multiple software nodes at once.
692 */
693int software_node_register_nodes(const struct software_node *nodes)
694{
695 int ret;
696 int i;
697
698 for (i = 0; nodes[i].name; i++) {
699 ret = software_node_register(&nodes[i]);
700 if (ret) {
701 software_node_unregister_nodes(nodes);
702 return ret;
703 }
704 }
705
706 return 0;
707}
708EXPORT_SYMBOL_GPL(software_node_register_nodes);
709
710/**
711 * software_node_unregister_nodes - Unregister an array of software nodes
712 * @nodes: Zero terminated array of software nodes to be unregistered
713 *
714 * Unregister multiple software nodes at once.
715 */
716void software_node_unregister_nodes(const struct software_node *nodes)
717{
718 struct swnode *swnode;
719 int i;
720
721 for (i = 0; nodes[i].name; i++) {
722 swnode = software_node_to_swnode(&nodes[i]);
723 if (swnode)
724 fwnode_remove_software_node(&swnode->fwnode);
725 }
726}
727EXPORT_SYMBOL_GPL(software_node_unregister_nodes);
728
729/**
730 * software_node_register - Register static software node
731 * @node: The software node to be registered
732 */
733int software_node_register(const struct software_node *node)
734{
735 struct swnode *parent = software_node_to_swnode(node->parent);
736
737 if (software_node_to_swnode(node))
738 return -EEXIST;
739
740 return PTR_ERR_OR_ZERO(swnode_register(node, parent, 0));
741}
742EXPORT_SYMBOL_GPL(software_node_register);
743
744struct fwnode_handle *
745fwnode_create_software_node(const struct property_entry *properties,
746 const struct fwnode_handle *parent)
747{
748 struct software_node *node;
749 struct swnode *p = NULL;
750 int ret;
751
752 if (parent) {
753 if (IS_ERR(parent))
754 return ERR_CAST(parent);
755 if (!is_software_node(parent))
756 return ERR_PTR(-EINVAL);
757 p = to_swnode(parent);
758 }
759
760 node = kzalloc(sizeof(*node), GFP_KERNEL);
761 if (!node)
762 return ERR_PTR(-ENOMEM);
763
764 ret = software_node_register_properties(node, properties);
59abd836 765 if (ret) {
80488a6b 766 kfree(node);
59abd836
HK
767 return ERR_PTR(ret);
768 }
769
80488a6b 770 node->parent = p ? p->node : NULL;
3df85a1a 771
80488a6b 772 return swnode_register(node, p, 1);
59abd836
HK
773}
774EXPORT_SYMBOL_GPL(fwnode_create_software_node);
775
776void fwnode_remove_software_node(struct fwnode_handle *fwnode)
777{
80488a6b 778 struct swnode *swnode = to_swnode(fwnode);
59abd836
HK
779
780 if (!swnode)
781 return;
782
783 kobject_put(&swnode->kobj);
784}
785EXPORT_SYMBOL_GPL(fwnode_remove_software_node);
786
787int software_node_notify(struct device *dev, unsigned long action)
788{
789 struct fwnode_handle *fwnode = dev_fwnode(dev);
80488a6b 790 struct swnode *swnode;
59abd836
HK
791 int ret;
792
793 if (!fwnode)
794 return 0;
795
796 if (!is_software_node(fwnode))
797 fwnode = fwnode->secondary;
798 if (!is_software_node(fwnode))
799 return 0;
800
80488a6b 801 swnode = to_swnode(fwnode);
59abd836
HK
802
803 switch (action) {
804 case KOBJ_ADD:
805 ret = sysfs_create_link(&dev->kobj, &swnode->kobj,
806 "software_node");
807 if (ret)
808 break;
809
810 ret = sysfs_create_link(&swnode->kobj, &dev->kobj,
811 dev_name(dev));
812 if (ret) {
813 sysfs_remove_link(&dev->kobj, "software_node");
814 break;
815 }
816 kobject_get(&swnode->kobj);
817 break;
818 case KOBJ_REMOVE:
819 sysfs_remove_link(&swnode->kobj, dev_name(dev));
820 sysfs_remove_link(&dev->kobj, "software_node");
821 kobject_put(&swnode->kobj);
822 break;
823 default:
824 break;
825 }
826
827 return 0;
828}
829
830static int __init software_node_init(void)
831{
832 swnode_kset = kset_create_and_add("software_nodes", NULL, kernel_kobj);
833 if (!swnode_kset)
834 return -ENOMEM;
835 return 0;
836}
837postcore_initcall(software_node_init);
838
839static void __exit software_node_exit(void)
840{
841 ida_destroy(&swnode_root_ids);
842 kset_unregister(swnode_kset);
843}
844__exitcall(software_node_exit);