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 DEFINE_MUTEX(icc_lock);
30 static struct dentry *icc_debugfs_dir;
32 static void icc_summary_show_one(struct seq_file *s, struct icc_node *n)
37 seq_printf(s, "%-42s %12u %12u\n",
38 n->name, n->avg_bw, n->peak_bw);
41 static int icc_summary_show(struct seq_file *s, void *data)
43 struct icc_provider *provider;
45 seq_puts(s, " node tag avg peak\n");
46 seq_puts(s, "--------------------------------------------------------------------\n");
48 mutex_lock(&icc_lock);
50 list_for_each_entry(provider, &icc_providers, provider_list) {
53 list_for_each_entry(n, &provider->nodes, node_list) {
56 icc_summary_show_one(s, n);
57 hlist_for_each_entry(r, &n->req_list, req_node) {
61 seq_printf(s, " %-27s %12u %12u %12u\n",
62 dev_name(r->dev), r->tag, r->avg_bw,
68 mutex_unlock(&icc_lock);
72 DEFINE_SHOW_ATTRIBUTE(icc_summary);
74 static void icc_graph_show_link(struct seq_file *s, int level,
75 struct icc_node *n, struct icc_node *m)
77 seq_printf(s, "%s\"%d:%s\" -> \"%d:%s\"\n",
78 level == 2 ? "\t\t" : "\t",
79 n->id, n->name, m->id, m->name);
82 static void icc_graph_show_node(struct seq_file *s, struct icc_node *n)
84 seq_printf(s, "\t\t\"%d:%s\" [label=\"%d:%s",
85 n->id, n->name, n->id, n->name);
86 seq_printf(s, "\n\t\t\t|avg_bw=%ukBps", n->avg_bw);
87 seq_printf(s, "\n\t\t\t|peak_bw=%ukBps", n->peak_bw);
91 static int icc_graph_show(struct seq_file *s, void *data)
93 struct icc_provider *provider;
95 int cluster_index = 0;
98 seq_puts(s, "digraph {\n\trankdir = LR\n\tnode [shape = record]\n");
99 mutex_lock(&icc_lock);
101 /* draw providers as cluster subgraphs */
103 list_for_each_entry(provider, &icc_providers, provider_list) {
104 seq_printf(s, "\tsubgraph cluster_%d {\n", ++cluster_index);
106 seq_printf(s, "\t\tlabel = \"%s\"\n",
107 dev_name(provider->dev));
110 list_for_each_entry(n, &provider->nodes, node_list)
111 icc_graph_show_node(s, n);
113 /* draw internal links */
114 list_for_each_entry(n, &provider->nodes, node_list)
115 for (i = 0; i < n->num_links; ++i)
116 if (n->provider == n->links[i]->provider)
117 icc_graph_show_link(s, 2, n,
120 seq_puts(s, "\t}\n");
123 /* draw external links */
124 list_for_each_entry(provider, &icc_providers, provider_list)
125 list_for_each_entry(n, &provider->nodes, node_list)
126 for (i = 0; i < n->num_links; ++i)
127 if (n->provider != n->links[i]->provider)
128 icc_graph_show_link(s, 1, n,
131 mutex_unlock(&icc_lock);
136 DEFINE_SHOW_ATTRIBUTE(icc_graph);
138 static struct icc_node *node_find(const int id)
140 return idr_find(&icc_idr, id);
143 static struct icc_path *path_init(struct device *dev, struct icc_node *dst,
146 struct icc_node *node = dst;
147 struct icc_path *path;
150 path = kzalloc(struct_size(path, reqs, num_nodes), GFP_KERNEL);
152 return ERR_PTR(-ENOMEM);
154 path->num_nodes = num_nodes;
156 for (i = num_nodes - 1; i >= 0; i--) {
157 node->provider->users++;
158 hlist_add_head(&path->reqs[i].req_node, &node->req_list);
159 path->reqs[i].node = node;
160 path->reqs[i].dev = dev;
161 path->reqs[i].enabled = true;
162 /* reference to previous node was saved during path traversal */
163 node = node->reverse;
169 static struct icc_path *path_find(struct device *dev, struct icc_node *src,
170 struct icc_node *dst)
172 struct icc_path *path = ERR_PTR(-EPROBE_DEFER);
173 struct icc_node *n, *node = NULL;
174 struct list_head traverse_list;
175 struct list_head edge_list;
176 struct list_head visited_list;
180 INIT_LIST_HEAD(&traverse_list);
181 INIT_LIST_HEAD(&edge_list);
182 INIT_LIST_HEAD(&visited_list);
184 list_add(&src->search_list, &traverse_list);
188 list_for_each_entry_safe(node, n, &traverse_list, search_list) {
191 list_splice_init(&edge_list, &visited_list);
192 list_splice_init(&traverse_list, &visited_list);
195 for (i = 0; i < node->num_links; i++) {
196 struct icc_node *tmp = node->links[i];
199 path = ERR_PTR(-ENOENT);
203 if (tmp->is_traversed)
206 tmp->is_traversed = true;
208 list_add_tail(&tmp->search_list, &edge_list);
215 list_splice_init(&traverse_list, &visited_list);
216 list_splice_init(&edge_list, &traverse_list);
218 /* count the hops including the source */
221 } while (!list_empty(&traverse_list));
225 /* reset the traversed state */
226 list_for_each_entry_reverse(n, &visited_list, search_list)
227 n->is_traversed = false;
230 path = path_init(dev, dst, depth);
236 * We want the path to honor all bandwidth requests, so the average and peak
237 * bandwidth requirements from each consumer are aggregated at each node.
238 * The aggregation is platform specific, so each platform can customize it by
239 * implementing its own aggregate() function.
242 static int aggregate_requests(struct icc_node *node)
244 struct icc_provider *p = node->provider;
250 if (p->pre_aggregate)
251 p->pre_aggregate(node);
253 hlist_for_each_entry(r, &node->req_list, req_node) {
256 p->aggregate(node, r->tag, r->avg_bw, r->peak_bw,
257 &node->avg_bw, &node->peak_bw);
263 static int apply_constraints(struct icc_path *path)
265 struct icc_node *next, *prev = NULL;
269 for (i = 0; i < path->num_nodes; i++) {
270 next = path->reqs[i].node;
273 * Both endpoints should be valid master-slave pairs of the
274 * same interconnect provider that will be configured.
276 if (!prev || next->provider != prev->provider) {
281 /* set the constraints */
282 ret = next->provider->set(prev, next);
292 int icc_std_aggregate(struct icc_node *node, u32 tag, u32 avg_bw,
293 u32 peak_bw, u32 *agg_avg, u32 *agg_peak)
296 *agg_peak = max(*agg_peak, peak_bw);
300 EXPORT_SYMBOL_GPL(icc_std_aggregate);
302 /* of_icc_xlate_onecell() - Translate function using a single index.
303 * @spec: OF phandle args to map into an interconnect node.
304 * @data: private data (pointer to struct icc_onecell_data)
306 * This is a generic translate function that can be used to model simple
307 * interconnect providers that have one device tree node and provide
308 * multiple interconnect nodes. A single cell is used as an index into
309 * an array of icc nodes specified in the icc_onecell_data struct when
310 * registering the provider.
312 struct icc_node *of_icc_xlate_onecell(struct of_phandle_args *spec,
315 struct icc_onecell_data *icc_data = data;
316 unsigned int idx = spec->args[0];
318 if (idx >= icc_data->num_nodes) {
319 pr_err("%s: invalid index %u\n", __func__, idx);
320 return ERR_PTR(-EINVAL);
323 return icc_data->nodes[idx];
325 EXPORT_SYMBOL_GPL(of_icc_xlate_onecell);
328 * of_icc_get_from_provider() - Look-up interconnect node
329 * @spec: OF phandle args to use for look-up
331 * Looks for interconnect provider under the node specified by @spec and if
332 * found, uses xlate function of the provider to map phandle args to node.
334 * Returns a valid pointer to struct icc_node on success or ERR_PTR()
337 static struct icc_node *of_icc_get_from_provider(struct of_phandle_args *spec)
339 struct icc_node *node = ERR_PTR(-EPROBE_DEFER);
340 struct icc_provider *provider;
342 if (!spec || spec->args_count != 1)
343 return ERR_PTR(-EINVAL);
345 mutex_lock(&icc_lock);
346 list_for_each_entry(provider, &icc_providers, provider_list) {
347 if (provider->dev->of_node == spec->np)
348 node = provider->xlate(spec, provider->data);
352 mutex_unlock(&icc_lock);
357 static void devm_icc_release(struct device *dev, void *res)
359 icc_put(*(struct icc_path **)res);
362 struct icc_path *devm_of_icc_get(struct device *dev, const char *name)
364 struct icc_path **ptr, *path;
366 ptr = devres_alloc(devm_icc_release, sizeof(**ptr), GFP_KERNEL);
368 return ERR_PTR(-ENOMEM);
370 path = of_icc_get(dev, name);
373 devres_add(dev, ptr);
380 EXPORT_SYMBOL_GPL(devm_of_icc_get);
383 * of_icc_get_by_index() - get a path handle from a DT node based on index
384 * @dev: device pointer for the consumer device
385 * @idx: interconnect path index
387 * This function will search for a path between two endpoints and return an
388 * icc_path handle on success. Use icc_put() to release constraints when they
389 * are not needed anymore.
390 * If the interconnect API is disabled, NULL is returned and the consumer
391 * drivers will still build. Drivers are free to handle this specifically,
392 * but they don't have to.
394 * Return: icc_path pointer on success or ERR_PTR() on error. NULL is returned
395 * when the API is disabled or the "interconnects" DT property is missing.
397 struct icc_path *of_icc_get_by_index(struct device *dev, int idx)
399 struct icc_path *path;
400 struct icc_node *src_node, *dst_node;
401 struct device_node *np;
402 struct of_phandle_args src_args, dst_args;
405 if (!dev || !dev->of_node)
406 return ERR_PTR(-ENODEV);
411 * When the consumer DT node do not have "interconnects" property
412 * return a NULL path to skip setting constraints.
414 if (!of_find_property(np, "interconnects", NULL))
418 * We use a combination of phandle and specifier for endpoint. For now
419 * lets support only global ids and extend this in the future if needed
420 * without breaking DT compatibility.
422 ret = of_parse_phandle_with_args(np, "interconnects",
423 "#interconnect-cells", idx * 2,
428 of_node_put(src_args.np);
430 ret = of_parse_phandle_with_args(np, "interconnects",
431 "#interconnect-cells", idx * 2 + 1,
436 of_node_put(dst_args.np);
438 src_node = of_icc_get_from_provider(&src_args);
440 if (IS_ERR(src_node)) {
441 if (PTR_ERR(src_node) != -EPROBE_DEFER)
442 dev_err(dev, "error finding src node: %ld\n",
444 return ERR_CAST(src_node);
447 dst_node = of_icc_get_from_provider(&dst_args);
449 if (IS_ERR(dst_node)) {
450 if (PTR_ERR(dst_node) != -EPROBE_DEFER)
451 dev_err(dev, "error finding dst node: %ld\n",
453 return ERR_CAST(dst_node);
456 mutex_lock(&icc_lock);
457 path = path_find(dev, src_node, dst_node);
458 mutex_unlock(&icc_lock);
460 dev_err(dev, "%s: invalid path=%ld\n", __func__, PTR_ERR(path));
464 path->name = kasprintf(GFP_KERNEL, "%s-%s",
465 src_node->name, dst_node->name);
468 return ERR_PTR(-ENOMEM);
473 EXPORT_SYMBOL_GPL(of_icc_get_by_index);
476 * of_icc_get() - get a path handle from a DT node based on name
477 * @dev: device pointer for the consumer device
478 * @name: interconnect path name
480 * This function will search for a path between two endpoints and return an
481 * icc_path handle on success. Use icc_put() to release constraints when they
482 * are not needed anymore.
483 * If the interconnect API is disabled, NULL is returned and the consumer
484 * drivers will still build. Drivers are free to handle this specifically,
485 * but they don't have to.
487 * Return: icc_path pointer on success or ERR_PTR() on error. NULL is returned
488 * when the API is disabled or the "interconnects" DT property is missing.
490 struct icc_path *of_icc_get(struct device *dev, const char *name)
492 struct device_node *np;
495 if (!dev || !dev->of_node)
496 return ERR_PTR(-ENODEV);
501 * When the consumer DT node do not have "interconnects" property
502 * return a NULL path to skip setting constraints.
504 if (!of_find_property(np, "interconnects", NULL))
508 * We use a combination of phandle and specifier for endpoint. For now
509 * lets support only global ids and extend this in the future if needed
510 * without breaking DT compatibility.
513 idx = of_property_match_string(np, "interconnect-names", name);
518 return of_icc_get_by_index(dev, idx);
520 EXPORT_SYMBOL_GPL(of_icc_get);
523 * icc_set_tag() - set an optional tag on a path
524 * @path: the path we want to tag
525 * @tag: the tag value
527 * This function allows consumers to append a tag to the requests associated
528 * with a path, so that a different aggregation could be done based on this tag.
530 void icc_set_tag(struct icc_path *path, u32 tag)
537 mutex_lock(&icc_lock);
539 for (i = 0; i < path->num_nodes; i++)
540 path->reqs[i].tag = tag;
542 mutex_unlock(&icc_lock);
544 EXPORT_SYMBOL_GPL(icc_set_tag);
547 * icc_get_name() - Get name of the icc path
548 * @path: reference to the path returned by icc_get()
550 * This function is used by an interconnect consumer to get the name of the icc
553 * Returns a valid pointer on success, or NULL otherwise.
555 const char *icc_get_name(struct icc_path *path)
562 EXPORT_SYMBOL_GPL(icc_get_name);
565 * icc_set_bw() - set bandwidth constraints on an interconnect path
566 * @path: reference to the path returned by icc_get()
567 * @avg_bw: average bandwidth in kilobytes per second
568 * @peak_bw: peak bandwidth in kilobytes per second
570 * This function is used by an interconnect consumer to express its own needs
571 * in terms of bandwidth for a previously requested path between two endpoints.
572 * The requests are aggregated and each node is updated accordingly. The entire
573 * path is locked by a mutex to ensure that the set() is completed.
574 * The @path can be NULL when the "interconnects" DT properties is missing,
575 * which will mean that no constraints will be set.
577 * Returns 0 on success, or an appropriate error code otherwise.
579 int icc_set_bw(struct icc_path *path, u32 avg_bw, u32 peak_bw)
581 struct icc_node *node;
582 u32 old_avg, old_peak;
589 if (WARN_ON(IS_ERR(path) || !path->num_nodes))
592 mutex_lock(&icc_lock);
594 old_avg = path->reqs[0].avg_bw;
595 old_peak = path->reqs[0].peak_bw;
597 for (i = 0; i < path->num_nodes; i++) {
598 node = path->reqs[i].node;
600 /* update the consumer request for this path */
601 path->reqs[i].avg_bw = avg_bw;
602 path->reqs[i].peak_bw = peak_bw;
604 /* aggregate requests for this node */
605 aggregate_requests(node);
607 trace_icc_set_bw(path, node, i, avg_bw, peak_bw);
610 ret = apply_constraints(path);
612 pr_debug("interconnect: error applying constraints (%d)\n",
615 for (i = 0; i < path->num_nodes; i++) {
616 node = path->reqs[i].node;
617 path->reqs[i].avg_bw = old_avg;
618 path->reqs[i].peak_bw = old_peak;
619 aggregate_requests(node);
621 apply_constraints(path);
624 mutex_unlock(&icc_lock);
626 trace_icc_set_bw_end(path, ret);
630 EXPORT_SYMBOL_GPL(icc_set_bw);
632 static int __icc_enable(struct icc_path *path, bool enable)
639 if (WARN_ON(IS_ERR(path) || !path->num_nodes))
642 mutex_lock(&icc_lock);
644 for (i = 0; i < path->num_nodes; i++)
645 path->reqs[i].enabled = enable;
647 mutex_unlock(&icc_lock);
649 return icc_set_bw(path, path->reqs[0].avg_bw,
650 path->reqs[0].peak_bw);
653 int icc_enable(struct icc_path *path)
655 return __icc_enable(path, true);
657 EXPORT_SYMBOL_GPL(icc_enable);
659 int icc_disable(struct icc_path *path)
661 return __icc_enable(path, false);
663 EXPORT_SYMBOL_GPL(icc_disable);
666 * icc_get() - return a handle for path between two endpoints
667 * @dev: the device requesting the path
668 * @src_id: source device port id
669 * @dst_id: destination device port id
671 * This function will search for a path between two endpoints and return an
672 * icc_path handle on success. Use icc_put() to release
673 * constraints when they are not needed anymore.
674 * If the interconnect API is disabled, NULL is returned and the consumer
675 * drivers will still build. Drivers are free to handle this specifically,
676 * but they don't have to.
678 * Return: icc_path pointer on success, ERR_PTR() on error or NULL if the
679 * interconnect API is disabled.
681 struct icc_path *icc_get(struct device *dev, const int src_id, const int dst_id)
683 struct icc_node *src, *dst;
684 struct icc_path *path = ERR_PTR(-EPROBE_DEFER);
686 mutex_lock(&icc_lock);
688 src = node_find(src_id);
692 dst = node_find(dst_id);
696 path = path_find(dev, src, dst);
698 dev_err(dev, "%s: invalid path=%ld\n", __func__, PTR_ERR(path));
702 path->name = kasprintf(GFP_KERNEL, "%s-%s", src->name, dst->name);
705 path = ERR_PTR(-ENOMEM);
708 mutex_unlock(&icc_lock);
711 EXPORT_SYMBOL_GPL(icc_get);
714 * icc_put() - release the reference to the icc_path
715 * @path: interconnect path
717 * Use this function to release the constraints on a path when the path is
718 * no longer needed. The constraints will be re-aggregated.
720 void icc_put(struct icc_path *path)
722 struct icc_node *node;
726 if (!path || WARN_ON(IS_ERR(path)))
729 ret = icc_set_bw(path, 0, 0);
731 pr_err("%s: error (%d)\n", __func__, ret);
733 mutex_lock(&icc_lock);
734 for (i = 0; i < path->num_nodes; i++) {
735 node = path->reqs[i].node;
736 hlist_del(&path->reqs[i].req_node);
737 if (!WARN_ON(!node->provider->users))
738 node->provider->users--;
740 mutex_unlock(&icc_lock);
742 kfree_const(path->name);
745 EXPORT_SYMBOL_GPL(icc_put);
747 static struct icc_node *icc_node_create_nolock(int id)
749 struct icc_node *node;
751 /* check if node already exists */
752 node = node_find(id);
756 node = kzalloc(sizeof(*node), GFP_KERNEL);
758 return ERR_PTR(-ENOMEM);
760 id = idr_alloc(&icc_idr, node, id, id + 1, GFP_KERNEL);
762 WARN(1, "%s: couldn't get idr\n", __func__);
773 * icc_node_create() - create a node
776 * Return: icc_node pointer on success, or ERR_PTR() on error
778 struct icc_node *icc_node_create(int id)
780 struct icc_node *node;
782 mutex_lock(&icc_lock);
784 node = icc_node_create_nolock(id);
786 mutex_unlock(&icc_lock);
790 EXPORT_SYMBOL_GPL(icc_node_create);
793 * icc_node_destroy() - destroy a node
796 void icc_node_destroy(int id)
798 struct icc_node *node;
800 mutex_lock(&icc_lock);
802 node = node_find(id);
804 idr_remove(&icc_idr, node->id);
805 WARN_ON(!hlist_empty(&node->req_list));
808 mutex_unlock(&icc_lock);
812 EXPORT_SYMBOL_GPL(icc_node_destroy);
815 * icc_link_create() - create a link between two nodes
816 * @node: source node id
817 * @dst_id: destination node id
819 * Create a link between two nodes. The nodes might belong to different
820 * interconnect providers and the @dst_id node might not exist (if the
821 * provider driver has not probed yet). So just create the @dst_id node
822 * and when the actual provider driver is probed, the rest of the node
825 * Return: 0 on success, or an error code otherwise
827 int icc_link_create(struct icc_node *node, const int dst_id)
829 struct icc_node *dst;
830 struct icc_node **new;
836 mutex_lock(&icc_lock);
838 dst = node_find(dst_id);
840 dst = icc_node_create_nolock(dst_id);
848 new = krealloc(node->links,
849 (node->num_links + 1) * sizeof(*node->links),
857 node->links[node->num_links++] = dst;
860 mutex_unlock(&icc_lock);
864 EXPORT_SYMBOL_GPL(icc_link_create);
867 * icc_link_destroy() - destroy a link between two nodes
868 * @src: pointer to source node
869 * @dst: pointer to destination node
871 * Return: 0 on success, or an error code otherwise
873 int icc_link_destroy(struct icc_node *src, struct icc_node *dst)
875 struct icc_node **new;
879 if (IS_ERR_OR_NULL(src))
882 if (IS_ERR_OR_NULL(dst))
885 mutex_lock(&icc_lock);
887 for (slot = 0; slot < src->num_links; slot++)
888 if (src->links[slot] == dst)
891 if (WARN_ON(slot == src->num_links)) {
896 src->links[slot] = src->links[--src->num_links];
898 new = krealloc(src->links, src->num_links * sizeof(*src->links),
904 mutex_unlock(&icc_lock);
908 EXPORT_SYMBOL_GPL(icc_link_destroy);
911 * icc_node_add() - add interconnect node to interconnect provider
912 * @node: pointer to the interconnect node
913 * @provider: pointer to the interconnect provider
915 void icc_node_add(struct icc_node *node, struct icc_provider *provider)
917 mutex_lock(&icc_lock);
919 node->provider = provider;
920 list_add_tail(&node->node_list, &provider->nodes);
922 mutex_unlock(&icc_lock);
924 EXPORT_SYMBOL_GPL(icc_node_add);
927 * icc_node_del() - delete interconnect node from interconnect provider
928 * @node: pointer to the interconnect node
930 void icc_node_del(struct icc_node *node)
932 mutex_lock(&icc_lock);
934 list_del(&node->node_list);
936 mutex_unlock(&icc_lock);
938 EXPORT_SYMBOL_GPL(icc_node_del);
941 * icc_nodes_remove() - remove all previously added nodes from provider
942 * @provider: the interconnect provider we are removing nodes from
944 * Return: 0 on success, or an error code otherwise
946 int icc_nodes_remove(struct icc_provider *provider)
948 struct icc_node *n, *tmp;
950 if (WARN_ON(IS_ERR_OR_NULL(provider)))
953 list_for_each_entry_safe_reverse(n, tmp, &provider->nodes, node_list) {
955 icc_node_destroy(n->id);
960 EXPORT_SYMBOL_GPL(icc_nodes_remove);
963 * icc_provider_add() - add a new interconnect provider
964 * @provider: the interconnect provider that will be added into topology
966 * Return: 0 on success, or an error code otherwise
968 int icc_provider_add(struct icc_provider *provider)
970 if (WARN_ON(!provider->set))
972 if (WARN_ON(!provider->xlate))
975 mutex_lock(&icc_lock);
977 INIT_LIST_HEAD(&provider->nodes);
978 list_add_tail(&provider->provider_list, &icc_providers);
980 mutex_unlock(&icc_lock);
982 dev_dbg(provider->dev, "interconnect provider added to topology\n");
986 EXPORT_SYMBOL_GPL(icc_provider_add);
989 * icc_provider_del() - delete previously added interconnect provider
990 * @provider: the interconnect provider that will be removed from topology
992 * Return: 0 on success, or an error code otherwise
994 int icc_provider_del(struct icc_provider *provider)
996 mutex_lock(&icc_lock);
997 if (provider->users) {
998 pr_warn("interconnect provider still has %d users\n",
1000 mutex_unlock(&icc_lock);
1004 if (!list_empty(&provider->nodes)) {
1005 pr_warn("interconnect provider still has nodes\n");
1006 mutex_unlock(&icc_lock);
1010 list_del(&provider->provider_list);
1011 mutex_unlock(&icc_lock);
1015 EXPORT_SYMBOL_GPL(icc_provider_del);
1017 static int __init icc_init(void)
1019 icc_debugfs_dir = debugfs_create_dir("interconnect", NULL);
1020 debugfs_create_file("interconnect_summary", 0444,
1021 icc_debugfs_dir, NULL, &icc_summary_fops);
1022 debugfs_create_file("interconnect_graph", 0444,
1023 icc_debugfs_dir, NULL, &icc_graph_fops);
1027 device_initcall(icc_init);
1029 MODULE_AUTHOR("Georgi Djakov <georgi.djakov@linaro.org>");
1030 MODULE_DESCRIPTION("Interconnect Driver Core");
1031 MODULE_LICENSE("GPL v2");