1 // SPDX-License-Identifier: GPL-2.0
3 * Interconnect framework core driver
5 * Copyright (c) 2017-2019, Linaro Ltd.
6 * Author: Georgi Djakov <georgi.djakov@linaro.org>
9 #include <linux/debugfs.h>
10 #include <linux/device.h>
11 #include <linux/idr.h>
12 #include <linux/init.h>
13 #include <linux/interconnect.h>
14 #include <linux/interconnect-provider.h>
15 #include <linux/list.h>
16 #include <linux/module.h>
17 #include <linux/mutex.h>
18 #include <linux/slab.h>
20 #include <linux/overflow.h>
24 #define CREATE_TRACE_POINTS
27 static DEFINE_IDR(icc_idr);
28 static LIST_HEAD(icc_providers);
29 static int providers_count;
30 static bool synced_state;
31 static DEFINE_MUTEX(icc_lock);
32 static struct dentry *icc_debugfs_dir;
34 static void icc_summary_show_one(struct seq_file *s, struct icc_node *n)
39 seq_printf(s, "%-42s %12u %12u\n",
40 n->name, n->avg_bw, n->peak_bw);
43 static int icc_summary_show(struct seq_file *s, void *data)
45 struct icc_provider *provider;
47 seq_puts(s, " node tag avg peak\n");
48 seq_puts(s, "--------------------------------------------------------------------\n");
50 mutex_lock(&icc_lock);
52 list_for_each_entry(provider, &icc_providers, provider_list) {
55 list_for_each_entry(n, &provider->nodes, node_list) {
58 icc_summary_show_one(s, n);
59 hlist_for_each_entry(r, &n->req_list, req_node) {
60 u32 avg_bw = 0, peak_bw = 0;
70 seq_printf(s, " %-27s %12u %12u %12u\n",
71 dev_name(r->dev), r->tag, avg_bw, peak_bw);
76 mutex_unlock(&icc_lock);
80 DEFINE_SHOW_ATTRIBUTE(icc_summary);
82 static void icc_graph_show_link(struct seq_file *s, int level,
83 struct icc_node *n, struct icc_node *m)
85 seq_printf(s, "%s\"%d:%s\" -> \"%d:%s\"\n",
86 level == 2 ? "\t\t" : "\t",
87 n->id, n->name, m->id, m->name);
90 static void icc_graph_show_node(struct seq_file *s, struct icc_node *n)
92 seq_printf(s, "\t\t\"%d:%s\" [label=\"%d:%s",
93 n->id, n->name, n->id, n->name);
94 seq_printf(s, "\n\t\t\t|avg_bw=%ukBps", n->avg_bw);
95 seq_printf(s, "\n\t\t\t|peak_bw=%ukBps", n->peak_bw);
99 static int icc_graph_show(struct seq_file *s, void *data)
101 struct icc_provider *provider;
103 int cluster_index = 0;
106 seq_puts(s, "digraph {\n\trankdir = LR\n\tnode [shape = record]\n");
107 mutex_lock(&icc_lock);
109 /* draw providers as cluster subgraphs */
111 list_for_each_entry(provider, &icc_providers, provider_list) {
112 seq_printf(s, "\tsubgraph cluster_%d {\n", ++cluster_index);
114 seq_printf(s, "\t\tlabel = \"%s\"\n",
115 dev_name(provider->dev));
118 list_for_each_entry(n, &provider->nodes, node_list)
119 icc_graph_show_node(s, n);
121 /* draw internal links */
122 list_for_each_entry(n, &provider->nodes, node_list)
123 for (i = 0; i < n->num_links; ++i)
124 if (n->provider == n->links[i]->provider)
125 icc_graph_show_link(s, 2, n,
128 seq_puts(s, "\t}\n");
131 /* draw external links */
132 list_for_each_entry(provider, &icc_providers, provider_list)
133 list_for_each_entry(n, &provider->nodes, node_list)
134 for (i = 0; i < n->num_links; ++i)
135 if (n->provider != n->links[i]->provider)
136 icc_graph_show_link(s, 1, n,
139 mutex_unlock(&icc_lock);
144 DEFINE_SHOW_ATTRIBUTE(icc_graph);
146 static struct icc_node *node_find(const int id)
148 return idr_find(&icc_idr, id);
151 static struct icc_path *path_init(struct device *dev, struct icc_node *dst,
154 struct icc_node *node = dst;
155 struct icc_path *path;
158 path = kzalloc(struct_size(path, reqs, num_nodes), GFP_KERNEL);
160 return ERR_PTR(-ENOMEM);
162 path->num_nodes = num_nodes;
164 for (i = num_nodes - 1; i >= 0; i--) {
165 node->provider->users++;
166 hlist_add_head(&path->reqs[i].req_node, &node->req_list);
167 path->reqs[i].node = node;
168 path->reqs[i].dev = dev;
169 path->reqs[i].enabled = true;
170 /* reference to previous node was saved during path traversal */
171 node = node->reverse;
177 static struct icc_path *path_find(struct device *dev, struct icc_node *src,
178 struct icc_node *dst)
180 struct icc_path *path = ERR_PTR(-EPROBE_DEFER);
181 struct icc_node *n, *node = NULL;
182 struct list_head traverse_list;
183 struct list_head edge_list;
184 struct list_head visited_list;
188 INIT_LIST_HEAD(&traverse_list);
189 INIT_LIST_HEAD(&edge_list);
190 INIT_LIST_HEAD(&visited_list);
192 list_add(&src->search_list, &traverse_list);
196 list_for_each_entry_safe(node, n, &traverse_list, search_list) {
199 list_splice_init(&edge_list, &visited_list);
200 list_splice_init(&traverse_list, &visited_list);
203 for (i = 0; i < node->num_links; i++) {
204 struct icc_node *tmp = node->links[i];
207 path = ERR_PTR(-ENOENT);
211 if (tmp->is_traversed)
214 tmp->is_traversed = true;
216 list_add_tail(&tmp->search_list, &edge_list);
223 list_splice_init(&traverse_list, &visited_list);
224 list_splice_init(&edge_list, &traverse_list);
226 /* count the hops including the source */
229 } while (!list_empty(&traverse_list));
233 /* reset the traversed state */
234 list_for_each_entry_reverse(n, &visited_list, search_list)
235 n->is_traversed = false;
238 path = path_init(dev, dst, depth);
244 * We want the path to honor all bandwidth requests, so the average and peak
245 * bandwidth requirements from each consumer are aggregated at each node.
246 * The aggregation is platform specific, so each platform can customize it by
247 * implementing its own aggregate() function.
250 static int aggregate_requests(struct icc_node *node)
252 struct icc_provider *p = node->provider;
259 if (p->pre_aggregate)
260 p->pre_aggregate(node);
262 hlist_for_each_entry(r, &node->req_list, req_node) {
265 peak_bw = r->peak_bw;
270 p->aggregate(node, r->tag, avg_bw, peak_bw,
271 &node->avg_bw, &node->peak_bw);
273 /* during boot use the initial bandwidth as a floor value */
275 node->avg_bw = max(node->avg_bw, node->init_avg);
276 node->peak_bw = max(node->peak_bw, node->init_peak);
283 static int apply_constraints(struct icc_path *path)
285 struct icc_node *next, *prev = NULL;
286 struct icc_provider *p;
290 for (i = 0; i < path->num_nodes; i++) {
291 next = path->reqs[i].node;
294 /* both endpoints should be valid master-slave pairs */
295 if (!prev || (p != prev->provider && !p->inter_set)) {
300 /* set the constraints */
301 ret = p->set(prev, next);
311 int icc_std_aggregate(struct icc_node *node, u32 tag, u32 avg_bw,
312 u32 peak_bw, u32 *agg_avg, u32 *agg_peak)
315 *agg_peak = max(*agg_peak, peak_bw);
319 EXPORT_SYMBOL_GPL(icc_std_aggregate);
321 /* of_icc_xlate_onecell() - Translate function using a single index.
322 * @spec: OF phandle args to map into an interconnect node.
323 * @data: private data (pointer to struct icc_onecell_data)
325 * This is a generic translate function that can be used to model simple
326 * interconnect providers that have one device tree node and provide
327 * multiple interconnect nodes. A single cell is used as an index into
328 * an array of icc nodes specified in the icc_onecell_data struct when
329 * registering the provider.
331 struct icc_node *of_icc_xlate_onecell(struct of_phandle_args *spec,
334 struct icc_onecell_data *icc_data = data;
335 unsigned int idx = spec->args[0];
337 if (idx >= icc_data->num_nodes) {
338 pr_err("%s: invalid index %u\n", __func__, idx);
339 return ERR_PTR(-EINVAL);
342 return icc_data->nodes[idx];
344 EXPORT_SYMBOL_GPL(of_icc_xlate_onecell);
347 * of_icc_get_from_provider() - Look-up interconnect node
348 * @spec: OF phandle args to use for look-up
350 * Looks for interconnect provider under the node specified by @spec and if
351 * found, uses xlate function of the provider to map phandle args to node.
353 * Returns a valid pointer to struct icc_node_data on success or ERR_PTR()
356 struct icc_node_data *of_icc_get_from_provider(struct of_phandle_args *spec)
358 struct icc_node *node = ERR_PTR(-EPROBE_DEFER);
359 struct icc_node_data *data = NULL;
360 struct icc_provider *provider;
363 return ERR_PTR(-EINVAL);
365 mutex_lock(&icc_lock);
366 list_for_each_entry(provider, &icc_providers, provider_list) {
367 if (provider->dev->of_node == spec->np) {
368 if (provider->xlate_extended) {
369 data = provider->xlate_extended(spec, provider->data);
375 node = provider->xlate(spec, provider->data);
381 mutex_unlock(&icc_lock);
384 return ERR_PTR(-EINVAL);
387 return ERR_CAST(node);
390 data = kzalloc(sizeof(*data), GFP_KERNEL);
392 return ERR_PTR(-ENOMEM);
398 EXPORT_SYMBOL_GPL(of_icc_get_from_provider);
400 static void devm_icc_release(struct device *dev, void *res)
402 icc_put(*(struct icc_path **)res);
405 struct icc_path *devm_of_icc_get(struct device *dev, const char *name)
407 struct icc_path **ptr, *path;
409 ptr = devres_alloc(devm_icc_release, sizeof(*ptr), GFP_KERNEL);
411 return ERR_PTR(-ENOMEM);
413 path = of_icc_get(dev, name);
416 devres_add(dev, ptr);
423 EXPORT_SYMBOL_GPL(devm_of_icc_get);
426 * of_icc_get_by_index() - get a path handle from a DT node based on index
427 * @dev: device pointer for the consumer device
428 * @idx: interconnect path index
430 * This function will search for a path between two endpoints and return an
431 * icc_path handle on success. Use icc_put() to release constraints when they
432 * are not needed anymore.
433 * If the interconnect API is disabled, NULL is returned and the consumer
434 * drivers will still build. Drivers are free to handle this specifically,
435 * but they don't have to.
437 * Return: icc_path pointer on success or ERR_PTR() on error. NULL is returned
438 * when the API is disabled or the "interconnects" DT property is missing.
440 struct icc_path *of_icc_get_by_index(struct device *dev, int idx)
442 struct icc_path *path;
443 struct icc_node_data *src_data, *dst_data;
444 struct device_node *np;
445 struct of_phandle_args src_args, dst_args;
448 if (!dev || !dev->of_node)
449 return ERR_PTR(-ENODEV);
454 * When the consumer DT node do not have "interconnects" property
455 * return a NULL path to skip setting constraints.
457 if (!of_find_property(np, "interconnects", NULL))
461 * We use a combination of phandle and specifier for endpoint. For now
462 * lets support only global ids and extend this in the future if needed
463 * without breaking DT compatibility.
465 ret = of_parse_phandle_with_args(np, "interconnects",
466 "#interconnect-cells", idx * 2,
471 of_node_put(src_args.np);
473 ret = of_parse_phandle_with_args(np, "interconnects",
474 "#interconnect-cells", idx * 2 + 1,
479 of_node_put(dst_args.np);
481 src_data = of_icc_get_from_provider(&src_args);
483 if (IS_ERR(src_data)) {
484 dev_err_probe(dev, PTR_ERR(src_data), "error finding src node\n");
485 return ERR_CAST(src_data);
488 dst_data = of_icc_get_from_provider(&dst_args);
490 if (IS_ERR(dst_data)) {
491 dev_err_probe(dev, PTR_ERR(dst_data), "error finding dst node\n");
493 return ERR_CAST(dst_data);
496 mutex_lock(&icc_lock);
497 path = path_find(dev, src_data->node, dst_data->node);
498 mutex_unlock(&icc_lock);
500 dev_err(dev, "%s: invalid path=%ld\n", __func__, PTR_ERR(path));
504 if (src_data->tag && src_data->tag == dst_data->tag)
505 icc_set_tag(path, src_data->tag);
507 path->name = kasprintf(GFP_KERNEL, "%s-%s",
508 src_data->node->name, dst_data->node->name);
511 path = ERR_PTR(-ENOMEM);
519 EXPORT_SYMBOL_GPL(of_icc_get_by_index);
522 * of_icc_get() - get a path handle from a DT node based on name
523 * @dev: device pointer for the consumer device
524 * @name: interconnect path name
526 * This function will search for a path between two endpoints and return an
527 * icc_path handle on success. Use icc_put() to release constraints when they
528 * are not needed anymore.
529 * If the interconnect API is disabled, NULL is returned and the consumer
530 * drivers will still build. Drivers are free to handle this specifically,
531 * but they don't have to.
533 * Return: icc_path pointer on success or ERR_PTR() on error. NULL is returned
534 * when the API is disabled or the "interconnects" DT property is missing.
536 struct icc_path *of_icc_get(struct device *dev, const char *name)
538 struct device_node *np;
541 if (!dev || !dev->of_node)
542 return ERR_PTR(-ENODEV);
547 * When the consumer DT node do not have "interconnects" property
548 * return a NULL path to skip setting constraints.
550 if (!of_find_property(np, "interconnects", NULL))
554 * We use a combination of phandle and specifier for endpoint. For now
555 * lets support only global ids and extend this in the future if needed
556 * without breaking DT compatibility.
559 idx = of_property_match_string(np, "interconnect-names", name);
564 return of_icc_get_by_index(dev, idx);
566 EXPORT_SYMBOL_GPL(of_icc_get);
569 * icc_set_tag() - set an optional tag on a path
570 * @path: the path we want to tag
571 * @tag: the tag value
573 * This function allows consumers to append a tag to the requests associated
574 * with a path, so that a different aggregation could be done based on this tag.
576 void icc_set_tag(struct icc_path *path, u32 tag)
583 mutex_lock(&icc_lock);
585 for (i = 0; i < path->num_nodes; i++)
586 path->reqs[i].tag = tag;
588 mutex_unlock(&icc_lock);
590 EXPORT_SYMBOL_GPL(icc_set_tag);
593 * icc_get_name() - Get name of the icc path
594 * @path: reference to the path returned by icc_get()
596 * This function is used by an interconnect consumer to get the name of the icc
599 * Returns a valid pointer on success, or NULL otherwise.
601 const char *icc_get_name(struct icc_path *path)
608 EXPORT_SYMBOL_GPL(icc_get_name);
611 * icc_set_bw() - set bandwidth constraints on an interconnect path
612 * @path: reference to the path returned by icc_get()
613 * @avg_bw: average bandwidth in kilobytes per second
614 * @peak_bw: peak bandwidth in kilobytes per second
616 * This function is used by an interconnect consumer to express its own needs
617 * in terms of bandwidth for a previously requested path between two endpoints.
618 * The requests are aggregated and each node is updated accordingly. The entire
619 * path is locked by a mutex to ensure that the set() is completed.
620 * The @path can be NULL when the "interconnects" DT properties is missing,
621 * which will mean that no constraints will be set.
623 * Returns 0 on success, or an appropriate error code otherwise.
625 int icc_set_bw(struct icc_path *path, u32 avg_bw, u32 peak_bw)
627 struct icc_node *node;
628 u32 old_avg, old_peak;
635 if (WARN_ON(IS_ERR(path) || !path->num_nodes))
638 mutex_lock(&icc_lock);
640 old_avg = path->reqs[0].avg_bw;
641 old_peak = path->reqs[0].peak_bw;
643 for (i = 0; i < path->num_nodes; i++) {
644 node = path->reqs[i].node;
646 /* update the consumer request for this path */
647 path->reqs[i].avg_bw = avg_bw;
648 path->reqs[i].peak_bw = peak_bw;
650 /* aggregate requests for this node */
651 aggregate_requests(node);
653 trace_icc_set_bw(path, node, i, avg_bw, peak_bw);
656 ret = apply_constraints(path);
658 pr_debug("interconnect: error applying constraints (%d)\n",
661 for (i = 0; i < path->num_nodes; i++) {
662 node = path->reqs[i].node;
663 path->reqs[i].avg_bw = old_avg;
664 path->reqs[i].peak_bw = old_peak;
665 aggregate_requests(node);
667 apply_constraints(path);
670 mutex_unlock(&icc_lock);
672 trace_icc_set_bw_end(path, ret);
676 EXPORT_SYMBOL_GPL(icc_set_bw);
678 static int __icc_enable(struct icc_path *path, bool enable)
685 if (WARN_ON(IS_ERR(path) || !path->num_nodes))
688 mutex_lock(&icc_lock);
690 for (i = 0; i < path->num_nodes; i++)
691 path->reqs[i].enabled = enable;
693 mutex_unlock(&icc_lock);
695 return icc_set_bw(path, path->reqs[0].avg_bw,
696 path->reqs[0].peak_bw);
699 int icc_enable(struct icc_path *path)
701 return __icc_enable(path, true);
703 EXPORT_SYMBOL_GPL(icc_enable);
705 int icc_disable(struct icc_path *path)
707 return __icc_enable(path, false);
709 EXPORT_SYMBOL_GPL(icc_disable);
712 * icc_get() - return a handle for path between two endpoints
713 * @dev: the device requesting the path
714 * @src_id: source device port id
715 * @dst_id: destination device port id
717 * This function will search for a path between two endpoints and return an
718 * icc_path handle on success. Use icc_put() to release
719 * constraints when they are not needed anymore.
720 * If the interconnect API is disabled, NULL is returned and the consumer
721 * drivers will still build. Drivers are free to handle this specifically,
722 * but they don't have to.
724 * Return: icc_path pointer on success, ERR_PTR() on error or NULL if the
725 * interconnect API is disabled.
727 struct icc_path *icc_get(struct device *dev, const int src_id, const int dst_id)
729 struct icc_node *src, *dst;
730 struct icc_path *path = ERR_PTR(-EPROBE_DEFER);
732 mutex_lock(&icc_lock);
734 src = node_find(src_id);
738 dst = node_find(dst_id);
742 path = path_find(dev, src, dst);
744 dev_err(dev, "%s: invalid path=%ld\n", __func__, PTR_ERR(path));
748 path->name = kasprintf(GFP_KERNEL, "%s-%s", src->name, dst->name);
751 path = ERR_PTR(-ENOMEM);
754 mutex_unlock(&icc_lock);
757 EXPORT_SYMBOL_GPL(icc_get);
760 * icc_put() - release the reference to the icc_path
761 * @path: interconnect path
763 * Use this function to release the constraints on a path when the path is
764 * no longer needed. The constraints will be re-aggregated.
766 void icc_put(struct icc_path *path)
768 struct icc_node *node;
772 if (!path || WARN_ON(IS_ERR(path)))
775 ret = icc_set_bw(path, 0, 0);
777 pr_err("%s: error (%d)\n", __func__, ret);
779 mutex_lock(&icc_lock);
780 for (i = 0; i < path->num_nodes; i++) {
781 node = path->reqs[i].node;
782 hlist_del(&path->reqs[i].req_node);
783 if (!WARN_ON(!node->provider->users))
784 node->provider->users--;
786 mutex_unlock(&icc_lock);
788 kfree_const(path->name);
791 EXPORT_SYMBOL_GPL(icc_put);
793 static struct icc_node *icc_node_create_nolock(int id)
795 struct icc_node *node;
797 /* check if node already exists */
798 node = node_find(id);
802 node = kzalloc(sizeof(*node), GFP_KERNEL);
804 return ERR_PTR(-ENOMEM);
806 id = idr_alloc(&icc_idr, node, id, id + 1, GFP_KERNEL);
808 WARN(1, "%s: couldn't get idr\n", __func__);
819 * icc_node_create() - create a node
822 * Return: icc_node pointer on success, or ERR_PTR() on error
824 struct icc_node *icc_node_create(int id)
826 struct icc_node *node;
828 mutex_lock(&icc_lock);
830 node = icc_node_create_nolock(id);
832 mutex_unlock(&icc_lock);
836 EXPORT_SYMBOL_GPL(icc_node_create);
839 * icc_node_destroy() - destroy a node
842 void icc_node_destroy(int id)
844 struct icc_node *node;
846 mutex_lock(&icc_lock);
848 node = node_find(id);
850 idr_remove(&icc_idr, node->id);
851 WARN_ON(!hlist_empty(&node->req_list));
854 mutex_unlock(&icc_lock);
862 EXPORT_SYMBOL_GPL(icc_node_destroy);
865 * icc_link_create() - create a link between two nodes
866 * @node: source node id
867 * @dst_id: destination node id
869 * Create a link between two nodes. The nodes might belong to different
870 * interconnect providers and the @dst_id node might not exist (if the
871 * provider driver has not probed yet). So just create the @dst_id node
872 * and when the actual provider driver is probed, the rest of the node
875 * Return: 0 on success, or an error code otherwise
877 int icc_link_create(struct icc_node *node, const int dst_id)
879 struct icc_node *dst;
880 struct icc_node **new;
886 mutex_lock(&icc_lock);
888 dst = node_find(dst_id);
890 dst = icc_node_create_nolock(dst_id);
898 new = krealloc(node->links,
899 (node->num_links + 1) * sizeof(*node->links),
907 node->links[node->num_links++] = dst;
910 mutex_unlock(&icc_lock);
914 EXPORT_SYMBOL_GPL(icc_link_create);
917 * icc_link_destroy() - destroy a link between two nodes
918 * @src: pointer to source node
919 * @dst: pointer to destination node
921 * Return: 0 on success, or an error code otherwise
923 int icc_link_destroy(struct icc_node *src, struct icc_node *dst)
925 struct icc_node **new;
929 if (IS_ERR_OR_NULL(src))
932 if (IS_ERR_OR_NULL(dst))
935 mutex_lock(&icc_lock);
937 for (slot = 0; slot < src->num_links; slot++)
938 if (src->links[slot] == dst)
941 if (WARN_ON(slot == src->num_links)) {
946 src->links[slot] = src->links[--src->num_links];
948 new = krealloc(src->links, src->num_links * sizeof(*src->links),
956 mutex_unlock(&icc_lock);
960 EXPORT_SYMBOL_GPL(icc_link_destroy);
963 * icc_node_add() - add interconnect node to interconnect provider
964 * @node: pointer to the interconnect node
965 * @provider: pointer to the interconnect provider
967 void icc_node_add(struct icc_node *node, struct icc_provider *provider)
969 mutex_lock(&icc_lock);
971 node->provider = provider;
972 list_add_tail(&node->node_list, &provider->nodes);
974 /* get the initial bandwidth values and sync them with hardware */
975 if (provider->get_bw) {
976 provider->get_bw(node, &node->init_avg, &node->init_peak);
978 node->init_avg = INT_MAX;
979 node->init_peak = INT_MAX;
981 node->avg_bw = node->init_avg;
982 node->peak_bw = node->init_peak;
984 if (provider->pre_aggregate)
985 provider->pre_aggregate(node);
987 if (provider->aggregate)
988 provider->aggregate(node, 0, node->init_avg, node->init_peak,
989 &node->avg_bw, &node->peak_bw);
991 provider->set(node, node);
995 mutex_unlock(&icc_lock);
997 EXPORT_SYMBOL_GPL(icc_node_add);
1000 * icc_node_del() - delete interconnect node from interconnect provider
1001 * @node: pointer to the interconnect node
1003 void icc_node_del(struct icc_node *node)
1005 mutex_lock(&icc_lock);
1007 list_del(&node->node_list);
1009 mutex_unlock(&icc_lock);
1011 EXPORT_SYMBOL_GPL(icc_node_del);
1014 * icc_nodes_remove() - remove all previously added nodes from provider
1015 * @provider: the interconnect provider we are removing nodes from
1017 * Return: 0 on success, or an error code otherwise
1019 int icc_nodes_remove(struct icc_provider *provider)
1021 struct icc_node *n, *tmp;
1023 if (WARN_ON(IS_ERR_OR_NULL(provider)))
1026 list_for_each_entry_safe_reverse(n, tmp, &provider->nodes, node_list) {
1028 icc_node_destroy(n->id);
1033 EXPORT_SYMBOL_GPL(icc_nodes_remove);
1036 * icc_provider_add() - add a new interconnect provider
1037 * @provider: the interconnect provider that will be added into topology
1039 * Return: 0 on success, or an error code otherwise
1041 int icc_provider_add(struct icc_provider *provider)
1043 if (WARN_ON(!provider->set))
1045 if (WARN_ON(!provider->xlate && !provider->xlate_extended))
1048 mutex_lock(&icc_lock);
1050 INIT_LIST_HEAD(&provider->nodes);
1051 list_add_tail(&provider->provider_list, &icc_providers);
1053 mutex_unlock(&icc_lock);
1055 dev_dbg(provider->dev, "interconnect provider added to topology\n");
1059 EXPORT_SYMBOL_GPL(icc_provider_add);
1062 * icc_provider_del() - delete previously added interconnect provider
1063 * @provider: the interconnect provider that will be removed from topology
1065 * Return: 0 on success, or an error code otherwise
1067 int icc_provider_del(struct icc_provider *provider)
1069 mutex_lock(&icc_lock);
1070 if (provider->users) {
1071 pr_warn("interconnect provider still has %d users\n",
1073 mutex_unlock(&icc_lock);
1077 if (!list_empty(&provider->nodes)) {
1078 pr_warn("interconnect provider still has nodes\n");
1079 mutex_unlock(&icc_lock);
1083 list_del(&provider->provider_list);
1084 mutex_unlock(&icc_lock);
1088 EXPORT_SYMBOL_GPL(icc_provider_del);
1090 static int of_count_icc_providers(struct device_node *np)
1092 struct device_node *child;
1094 const struct of_device_id __maybe_unused ignore_list[] = {
1095 { .compatible = "qcom,sc7180-ipa-virt" },
1099 for_each_available_child_of_node(np, child) {
1100 if (of_property_read_bool(child, "#interconnect-cells") &&
1101 likely(!of_match_node(ignore_list, child)))
1103 count += of_count_icc_providers(child);
1109 void icc_sync_state(struct device *dev)
1111 struct icc_provider *p;
1117 if (count < providers_count)
1120 mutex_lock(&icc_lock);
1121 synced_state = true;
1122 list_for_each_entry(p, &icc_providers, provider_list) {
1123 dev_dbg(p->dev, "interconnect provider is in synced state\n");
1124 list_for_each_entry(n, &p->nodes, node_list) {
1125 if (n->init_avg || n->init_peak) {
1128 aggregate_requests(n);
1133 mutex_unlock(&icc_lock);
1135 EXPORT_SYMBOL_GPL(icc_sync_state);
1137 static int __init icc_init(void)
1139 struct device_node *root = of_find_node_by_path("/");
1141 providers_count = of_count_icc_providers(root);
1144 icc_debugfs_dir = debugfs_create_dir("interconnect", NULL);
1145 debugfs_create_file("interconnect_summary", 0444,
1146 icc_debugfs_dir, NULL, &icc_summary_fops);
1147 debugfs_create_file("interconnect_graph", 0444,
1148 icc_debugfs_dir, NULL, &icc_graph_fops);
1152 device_initcall(icc_init);
1154 MODULE_AUTHOR("Georgi Djakov <georgi.djakov@linaro.org>");
1155 MODULE_DESCRIPTION("Interconnect Driver Core");
1156 MODULE_LICENSE("GPL v2");