// SPDX-License-Identifier: GPL-2.0/* * Interconnect framework core driver * * Copyright (c) 2017-2019, Linaro Ltd. * Author: Georgi Djakov <georgi.djakov@linaro.org> */ #include <linux/debugfs.h>#include <linux/device.h>#include <linux/idr.h>#include <linux/init.h>#include <linux/interconnect.h>#include <linux/interconnect-provider.h>#include <linux/list.h>#include <linux/module.h>#include <linux/mutex.h>#include <linux/slab.h>#include <linux/of.h>#include <linux/overflow.h> #include "internal.h" #define CREATE_TRACE_POINTS#include "trace.h" static DEFINE_IDR(icc_idr);static LIST_HEAD(icc_providers);static DEFINE_MUTEX(icc_lock);static struct dentry *icc_debugfs_dir; static void icc_summary_show_one(struct seq_file *s, struct icc_node *n){	if (!n)		return; 	seq_printf(s, "%-42s %12u %12u\n",		   n->name, n->avg_bw, n->peak_bw);} static int icc_summary_show(struct seq_file *s, void *data){	struct icc_provider *provider; 	seq_puts(s, " node                                  tag          avg         peak\n");	seq_puts(s, "--------------------------------------------------------------------\n"); 	mutex_lock(&icc_lock); 	list_for_each_entry(provider, &icc_providers, provider_list) {		struct icc_node *n; 		list_for_each_entry(n, &provider->nodes, node_list) {			struct icc_req *r; 			icc_summary_show_one(s, n);			hlist_for_each_entry(r, &n->req_list, req_node) {				if (!r->dev)					continue; 				seq_printf(s, "  %-27s %12u %12u %12u\n",					   dev_name(r->dev), r->tag, r->avg_bw,					   r->peak_bw);			}		}	} 	mutex_unlock(&icc_lock); 	return 0;}DEFINE_SHOW_ATTRIBUTE(icc_summary); static void icc_graph_show_link(struct seq_file *s, int level,				struct icc_node *n, struct icc_node *m){	seq_printf(s, "%s\"%d:%s\" -> \"%d:%s\"\n",		   level == 2 ? "\t\t" : "\t",		   n->id, n->name, m->id, m->name);} static void icc_graph_show_node(struct seq_file *s, struct icc_node *n){	seq_printf(s, "\t\t\"%d:%s\" [label=\"%d:%s",		   n->id, n->name, n->id, n->name);	seq_printf(s, "\n\t\t\t|avg_bw=%ukBps", n->avg_bw);	seq_printf(s, "\n\t\t\t|peak_bw=%ukBps", n->peak_bw);	seq_puts(s, "\"]\n");} static int icc_graph_show(struct seq_file *s, void *data){	struct icc_provider *provider;	struct icc_node *n;	int cluster_index = 0;	int i; 	seq_puts(s, "digraph {\n\trankdir = LR\n\tnode [shape = record]\n");	mutex_lock(&icc_lock); 	/* draw providers as cluster subgraphs */	cluster_index = 0;	list_for_each_entry(provider, &icc_providers, provider_list) {		seq_printf(s, "\tsubgraph cluster_%d {\n", ++cluster_index);		if (provider->dev)			seq_printf(s, "\t\tlabel = \"%s\"\n",				   dev_name(provider->dev)); 		/* draw nodes */		list_for_each_entry(n, &provider->nodes, node_list)			icc_graph_show_node(s, n); 		/* draw internal links */		list_for_each_entry(n, &provider->nodes, node_list)			for (i = 0; i < n->num_links; ++i)				if (n->provider == n->links[i]->provider)					icc_graph_show_link(s, 2, n,							    n->links[i]); 		seq_puts(s, "\t}\n");	} 	/* draw external links */	list_for_each_entry(provider, &icc_providers, provider_list)		list_for_each_entry(n, &provider->nodes, node_list)			for (i = 0; i < n->num_links; ++i)				if (n->provider != n->links[i]->provider)					icc_graph_show_link(s, 1, n,							    n->links[i]); 	mutex_unlock(&icc_lock);	seq_puts(s, "}"); 	return 0;}DEFINE_SHOW_ATTRIBUTE(icc_graph); static struct icc_node *node_find(const int id){	return idr_find(&icc_idr, id);} static struct icc_path *path_init(struct device *dev, struct icc_node *dst,				  ssize_t num_nodes){	struct icc_node *node = dst;	struct icc_path *path;	int i; 	path = kzalloc(struct_size(path, reqs, num_nodes), GFP_KERNEL);	if (!path)		return ERR_PTR(-ENOMEM); 	path->num_nodes = num_nodes; 	for (i = num_nodes - 1; i >= 0; i--) {		node->provider->users++;		hlist_add_head(&path->reqs[i].req_node, &node->req_list);		path->reqs[i].node = node;		path->reqs[i].dev = dev;		path->reqs[i].enabled = true;		/* reference to previous node was saved during path traversal */		node = node->reverse;	} 	return path;} static struct icc_path *path_find(struct device *dev, struct icc_node *src,				  struct icc_node *dst){	struct icc_path *path = ERR_PTR(-EPROBE_DEFER);	struct icc_node *n, *node = NULL;	struct list_head traverse_list;	struct list_head edge_list;	struct list_head visited_list;	size_t i, depth = 1;	bool found = false; 	INIT_LIST_HEAD(&traverse_list);	INIT_LIST_HEAD(&edge_list);	INIT_LIST_HEAD(&visited_list); 	list_add(&src->search_list, &traverse_list);	src->reverse = NULL; 	do {		list_for_each_entry_safe(node, n, &traverse_list, search_list) {			if (node == dst) {				found = true;				list_splice_init(&edge_list, &visited_list);				list_splice_init(&traverse_list, &visited_list);				break;			}			for (i = 0; i < node->num_links; i++) {				struct icc_node *tmp = node->links[i]; 				if (!tmp) {					path = ERR_PTR(-ENOENT);					goto out;				} 				if (tmp->is_traversed)					continue; 				tmp->is_traversed = true;				tmp->reverse = node;				list_add_tail(&tmp->search_list, &edge_list);			}		} 		if (found)			break; 		list_splice_init(&traverse_list, &visited_list);		list_splice_init(&edge_list, &traverse_list); 		/* count the hops including the source */		depth++; 	} while (!list_empty(&traverse_list)); out: 	/* reset the traversed state */	list_for_each_entry_reverse(n, &visited_list, search_list)		n->is_traversed = false; 	if (found)		path = path_init(dev, dst, depth); 	return path;} /* * We want the path to honor all bandwidth requests, so the average and peak * bandwidth requirements from each consumer are aggregated at each node. * The aggregation is platform specific, so each platform can customize it by * implementing its own aggregate() function. */ static int aggregate_requests(struct icc_node *node){	struct icc_provider *p = node->provider;	struct icc_req *r;	u32 avg_bw, peak_bw; 	node->avg_bw = 0;	node->peak_bw = 0; 	if (p->pre_aggregate)		p->pre_aggregate(node); 	hlist_for_each_entry(r, &node->req_list, req_node) {		if (r->enabled) {			avg_bw = r->avg_bw;			peak_bw = r->peak_bw;		} else {			avg_bw = 0;			peak_bw = 0;		}		p->aggregate(node, r->tag, avg_bw, peak_bw,			     &node->avg_bw, &node->peak_bw);	} 	return 0;} static int apply_constraints(struct icc_path *path){	struct icc_node *next, *prev = NULL;	struct icc_provider *p;	int ret = -EINVAL;	int i; 	for (i = 0; i < path->num_nodes; i++) {		next = path->reqs[i].node;		p = next->provider; 		/* both endpoints should be valid master-slave pairs */		if (!prev || (p != prev->provider && !p->inter_set)) {			prev = next;			continue;		} 		/* set the constraints */		ret = p->set(prev, next);		if (ret)			goto out; 		prev = next;	}out:	return ret;} int icc_std_aggregate(struct icc_node *node, u32 tag, u32 avg_bw,		      u32 peak_bw, u32 *agg_avg, u32 *agg_peak){	*agg_avg += avg_bw;	*agg_peak = max(*agg_peak, peak_bw); 	return 0;}EXPORT_SYMBOL_GPL(icc_std_aggregate); /* of_icc_xlate_onecell() - Translate function using a single index. * @spec: OF phandle args to map into an interconnect node. * @data: private data (pointer to struct icc_onecell_data) * * This is a generic translate function that can be used to model simple * interconnect providers that have one device tree node and provide * multiple interconnect nodes. A single cell is used as an index into * an array of icc nodes specified in the icc_onecell_data struct when * registering the provider. */struct icc_node *of_icc_xlate_onecell(struct of_phandle_args *spec,				      void *data){	struct icc_onecell_data *icc_data = data;	unsigned int idx = spec->args[0]; 	if (idx >= icc_data->num_nodes) {		pr_err("%s: invalid index %u\n", __func__, idx);		return ERR_PTR(-EINVAL);	} 	return icc_data->nodes[idx];}EXPORT_SYMBOL_GPL(of_icc_xlate_onecell); /** * of_icc_get_from_provider() - Look-up interconnect node * @spec: OF phandle args to use for look-up * * Looks for interconnect provider under the node specified by @spec and if * found, uses xlate function of the provider to map phandle args to node. * * Returns a valid pointer to struct icc_node on success or ERR_PTR() * on failure. */struct icc_node *of_icc_get_from_provider(struct of_phandle_args *spec){	struct icc_node *node = ERR_PTR(-EPROBE_DEFER);	struct icc_provider *provider; 	if (!spec)		return ERR_PTR(-EINVAL); 	mutex_lock(&icc_lock);	list_for_each_entry(provider, &icc_providers, provider_list) {		if (provider->dev->of_node == spec->np)			node = provider->xlate(spec, provider->data);		if (!IS_ERR(node))			break;	}	mutex_unlock(&icc_lock); 	return node;}EXPORT_SYMBOL_GPL(of_icc_get_from_provider); static void devm_icc_release(struct device *dev, void *res){	icc_put(*(struct icc_path **)res);} struct icc_path *devm_of_icc_get(struct device *dev, const char *name){	struct icc_path **ptr, *path; 	ptr = devres_alloc(devm_icc_release, sizeof(**ptr), GFP_KERNEL);	if (!ptr)		return ERR_PTR(-ENOMEM); 	path = of_icc_get(dev, name);	if (!IS_ERR(path)) {		*ptr = path;		devres_add(dev, ptr);	} else {		devres_free(ptr);	} 	return path;}EXPORT_SYMBOL_GPL(devm_of_icc_get); /** * of_icc_get_by_index() - get a path handle from a DT node based on index * @dev: device pointer for the consumer device * @idx: interconnect path index * * This function will search for a path between two endpoints and return an * icc_path handle on success. Use icc_put() to release constraints when they * are not needed anymore. * If the interconnect API is disabled, NULL is returned and the consumer * drivers will still build. Drivers are free to handle this specifically, * but they don't have to. * * Return: icc_path pointer on success or ERR_PTR() on error. NULL is returned * when the API is disabled or the "interconnects" DT property is missing. */struct icc_path *of_icc_get_by_index(struct device *dev, int idx){	struct icc_path *path;	struct icc_node *src_node, *dst_node;	struct device_node *np;	struct of_phandle_args src_args, dst_args;	int ret; 	if (!dev || !dev->of_node)		return ERR_PTR(-ENODEV); 	np = dev->of_node; 	/*	 * When the consumer DT node do not have "interconnects" property	 * return a NULL path to skip setting constraints.	 */	if (!of_find_property(np, "interconnects", NULL))		return NULL; 	/*	 * We use a combination of phandle and specifier for endpoint. For now	 * lets support only global ids and extend this in the future if needed	 * without breaking DT compatibility.	 */	ret = of_parse_phandle_with_args(np, "interconnects",					 "#interconnect-cells", idx * 2,					 &src_args);	if (ret)		return ERR_PTR(ret); 	of_node_put(src_args.np); 	ret = of_parse_phandle_with_args(np, "interconnects",					 "#interconnect-cells", idx * 2 + 1,					 &dst_args);	if (ret)		return ERR_PTR(ret); 	of_node_put(dst_args.np); 	src_node = of_icc_get_from_provider(&src_args); 	if (IS_ERR(src_node)) {		if (PTR_ERR(src_node) != -EPROBE_DEFER)			dev_err(dev, "error finding src node: %ld\n",				PTR_ERR(src_node));		return ERR_CAST(src_node);	} 	dst_node = of_icc_get_from_provider(&dst_args); 	if (IS_ERR(dst_node)) {		if (PTR_ERR(dst_node) != -EPROBE_DEFER)			dev_err(dev, "error finding dst node: %ld\n",				PTR_ERR(dst_node));		return ERR_CAST(dst_node);	} 	mutex_lock(&icc_lock);	path = path_find(dev, src_node, dst_node);	mutex_unlock(&icc_lock);	if (IS_ERR(path)) {		dev_err(dev, "%s: invalid path=%ld\n", __func__, PTR_ERR(path));		return path;	} 	path->name = kasprintf(GFP_KERNEL, "%s-%s",			       src_node->name, dst_node->name);	if (!path->name) {		kfree(path);		return ERR_PTR(-ENOMEM);	} 	return path;}EXPORT_SYMBOL_GPL(of_icc_get_by_index); /** * of_icc_get() - get a path handle from a DT node based on name * @dev: device pointer for the consumer device * @name: interconnect path name * * This function will search for a path between two endpoints and return an * icc_path handle on success. Use icc_put() to release constraints when they * are not needed anymore. * If the interconnect API is disabled, NULL is returned and the consumer * drivers will still build. Drivers are free to handle this specifically, * but they don't have to. * * Return: icc_path pointer on success or ERR_PTR() on error. NULL is returned * when the API is disabled or the "interconnects" DT property is missing. */struct icc_path *of_icc_get(struct device *dev, const char *name){	struct device_node *np;	int idx = 0; 

Lines 1–500 of 1037. Load more