1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (c) 2020, The Linux Foundation. All rights reserved.
6 #include <linux/interconnect.h>
7 #include <linux/interconnect-provider.h>
8 #include <linux/module.h>
10 #include <linux/slab.h>
12 #include "bcm-voter.h"
16 * qcom_icc_pre_aggregate - cleans up stale values from prior icc_set
17 * @node: icc node to operate on
19 void qcom_icc_pre_aggregate(struct icc_node *node)
22 struct qcom_icc_node *qn;
23 struct qcom_icc_provider *qp;
26 qp = to_qcom_provider(node->provider);
28 for (i = 0; i < QCOM_ICC_NUM_BUCKETS; i++) {
33 for (i = 0; i < qn->num_bcms; i++)
34 qcom_icc_bcm_voter_add(qp->voter, qn->bcms[i]);
36 EXPORT_SYMBOL_GPL(qcom_icc_pre_aggregate);
39 * qcom_icc_aggregate - aggregate bw for buckets indicated by tag
40 * @node: node to aggregate
41 * @tag: tag to indicate which buckets to aggregate
42 * @avg_bw: new bw to sum aggregate
43 * @peak_bw: new bw to max aggregate
44 * @agg_avg: existing aggregate avg bw val
45 * @agg_peak: existing aggregate peak bw val
47 int qcom_icc_aggregate(struct icc_node *node, u32 tag, u32 avg_bw,
48 u32 peak_bw, u32 *agg_avg, u32 *agg_peak)
51 struct qcom_icc_node *qn;
56 tag = QCOM_ICC_TAG_ALWAYS;
58 for (i = 0; i < QCOM_ICC_NUM_BUCKETS; i++) {
60 qn->sum_avg[i] += avg_bw;
61 qn->max_peak[i] = max_t(u32, qn->max_peak[i], peak_bw);
64 if (node->init_avg || node->init_peak) {
65 qn->sum_avg[i] = max_t(u64, qn->sum_avg[i], node->init_avg);
66 qn->max_peak[i] = max_t(u64, qn->max_peak[i], node->init_peak);
71 *agg_peak = max_t(u32, *agg_peak, peak_bw);
75 EXPORT_SYMBOL_GPL(qcom_icc_aggregate);
78 * qcom_icc_set - set the constraints based on path
79 * @src: source node for the path to set constraints on
80 * @dst: destination node for the path to set constraints on
82 * Return: 0 on success, or an error code otherwise
84 int qcom_icc_set(struct icc_node *src, struct icc_node *dst)
86 struct qcom_icc_provider *qp;
87 struct icc_node *node;
94 qp = to_qcom_provider(node->provider);
96 qcom_icc_bcm_voter_commit(qp->voter);
100 EXPORT_SYMBOL_GPL(qcom_icc_set);
102 struct icc_node_data *qcom_icc_xlate_extended(struct of_phandle_args *spec, void *data)
104 struct icc_node_data *ndata;
105 struct icc_node *node;
107 node = of_icc_xlate_onecell(spec, data);
109 return ERR_CAST(node);
111 ndata = kzalloc(sizeof(*ndata), GFP_KERNEL);
113 return ERR_PTR(-ENOMEM);
117 if (spec->args_count == 2)
118 ndata->tag = spec->args[1];
120 if (spec->args_count > 2)
121 pr_warn("%pOF: Too many arguments, path tag is not parsed\n", spec->np);
125 EXPORT_SYMBOL_GPL(qcom_icc_xlate_extended);
128 * qcom_icc_bcm_init - populates bcm aux data and connect qnodes
129 * @bcm: bcm to be initialized
130 * @dev: associated provider device
132 * Return: 0 on success, or an error code otherwise
134 int qcom_icc_bcm_init(struct qcom_icc_bcm *bcm, struct device *dev)
136 struct qcom_icc_node *qn;
137 const struct bcm_db *data;
141 /* BCM is already initialised*/
145 bcm->addr = cmd_db_read_addr(bcm->name);
147 dev_err(dev, "%s could not find RPMh address\n",
152 data = cmd_db_read_aux_data(bcm->name, &data_count);
154 dev_err(dev, "%s command db read error (%ld)\n",
155 bcm->name, PTR_ERR(data));
156 return PTR_ERR(data);
159 dev_err(dev, "%s command db missing or partial aux data\n",
164 bcm->aux_data.unit = le32_to_cpu(data->unit);
165 bcm->aux_data.width = le16_to_cpu(data->width);
166 bcm->aux_data.vcd = data->vcd;
167 bcm->aux_data.reserved = data->reserved;
168 INIT_LIST_HEAD(&bcm->list);
169 INIT_LIST_HEAD(&bcm->ws_list);
171 if (!bcm->vote_scale)
172 bcm->vote_scale = 1000;
174 /* Link Qnodes to their respective BCMs */
175 for (i = 0; i < bcm->num_nodes; i++) {
177 qn->bcms[qn->num_bcms] = bcm;
183 EXPORT_SYMBOL_GPL(qcom_icc_bcm_init);
185 MODULE_LICENSE("GPL v2");