icc-rpmh.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * Copyright (c) 2020-2021, The Linux Foundation. All rights reserved.
  4. * Copyright (c) 2023, Qualcomm Innovation Center, Inc. All rights reserved.
  5. */
  6. #include <linux/clk.h>
  7. #include <linux/interconnect.h>
  8. #include <linux/interconnect-provider.h>
  9. #include <linux/module.h>
  10. #include <linux/of.h>
  11. #include <linux/of_platform.h>
  12. #include <linux/of_device.h>
  13. #include <linux/slab.h>
  14. #include <soc/qcom/socinfo.h>
  15. #include "bcm-voter.h"
  16. #include "icc-common.h"
  17. #include "icc-debug.h"
  18. #include "icc-rpmh.h"
  19. #include "qnoc-qos.h"
  20. static LIST_HEAD(qnoc_probe_list);
  21. static DEFINE_MUTEX(probe_list_lock);
  22. /**
  23. * qcom_icc_pre_aggregate - cleans up stale values from prior icc_set
  24. * @node: icc node to operate on
  25. */
  26. void qcom_icc_pre_aggregate(struct icc_node *node)
  27. {
  28. size_t i;
  29. struct qcom_icc_node *qn;
  30. struct qcom_icc_provider *qp;
  31. qn = node->data;
  32. qp = to_qcom_provider(node->provider);
  33. for (i = 0; i < QCOM_ICC_NUM_BUCKETS; i++) {
  34. qn->sum_avg[i] = 0;
  35. qn->max_peak[i] = 0;
  36. qn->perf_mode[i] = false;
  37. }
  38. for (i = 0; i < qn->num_bcms; i++)
  39. qcom_icc_bcm_voter_add(qp->voters[qn->bcms[i]->voter_idx],
  40. qn->bcms[i]);
  41. }
  42. EXPORT_SYMBOL_GPL(qcom_icc_pre_aggregate);
  43. static void qcom_icc_pre_aggregate_stub(struct icc_node *node)
  44. {
  45. }
  46. /**
  47. * qcom_icc_aggregate - aggregate bw for buckets indicated by tag
  48. * @node: node to aggregate
  49. * @tag: tag to indicate which buckets to aggregate
  50. * @avg_bw: new bw to sum aggregate
  51. * @peak_bw: new bw to max aggregate
  52. * @agg_avg: existing aggregate avg bw val
  53. * @agg_peak: existing aggregate peak bw val
  54. */
  55. int qcom_icc_aggregate(struct icc_node *node, u32 tag, u32 avg_bw,
  56. u32 peak_bw, u32 *agg_avg, u32 *agg_peak)
  57. {
  58. size_t i;
  59. struct qcom_icc_node *qn;
  60. qn = node->data;
  61. if (!tag)
  62. tag = QCOM_ICC_TAG_ALWAYS;
  63. for (i = 0; i < QCOM_ICC_NUM_BUCKETS; i++) {
  64. if (tag & BIT(i)) {
  65. qn->sum_avg[i] += avg_bw;
  66. qn->max_peak[i] = max_t(u32, qn->max_peak[i], peak_bw);
  67. if (tag & QCOM_ICC_TAG_PERF_MODE && (avg_bw || peak_bw))
  68. qn->perf_mode[i] = true;
  69. }
  70. if (node->init_avg || node->init_peak) {
  71. qn->sum_avg[i] = max_t(u64, qn->sum_avg[i], node->init_avg);
  72. qn->max_peak[i] = max_t(u64, qn->max_peak[i], node->init_peak);
  73. }
  74. }
  75. *agg_avg += avg_bw;
  76. *agg_peak = max_t(u32, *agg_peak, peak_bw);
  77. return 0;
  78. }
  79. EXPORT_SYMBOL_GPL(qcom_icc_aggregate);
  80. int qcom_icc_aggregate_stub(struct icc_node *node, u32 tag, u32 avg_bw,
  81. u32 peak_bw, u32 *agg_avg, u32 *agg_peak)
  82. {
  83. return 0;
  84. }
  85. EXPORT_SYMBOL(qcom_icc_aggregate_stub);
  86. /**
  87. * qcom_icc_set - set the constraints based on path
  88. * @src: source node for the path to set constraints on
  89. * @dst: destination node for the path to set constraints on
  90. *
  91. * Return: 0 on success, or an error code otherwise
  92. */
  93. int qcom_icc_set(struct icc_node *src, struct icc_node *dst)
  94. {
  95. struct qcom_icc_provider *qp;
  96. struct icc_node *node;
  97. struct qcom_icc_node *qn;
  98. u64 clk_rate;
  99. int i, ret;
  100. if (!src)
  101. node = dst;
  102. else
  103. node = src;
  104. qp = to_qcom_provider(node->provider);
  105. qn = node->data;
  106. if (qn->bw_scale_numerator && qn->bw_scale_denominator) {
  107. node->avg_bw *= qn->bw_scale_numerator;
  108. do_div(node->avg_bw, qn->bw_scale_denominator);
  109. node->peak_bw *= qn->bw_scale_numerator;
  110. do_div(node->peak_bw, qn->bw_scale_denominator);
  111. }
  112. if (qn->clk) {
  113. /*
  114. * Multiply by 1000 to convert the unit of bandwidth from KBps
  115. * to Bps, then divide by the bandwidth to get the clk rate in Hz.
  116. */
  117. clk_rate = (u64)max(node->avg_bw, node->peak_bw) * 1000 / qn->buswidth;
  118. clk_rate = clk_rate > U32_MAX ? U32_MAX : clk_rate;
  119. if (clk_rate > 0) {
  120. ret = clk_set_rate(qn->clk, clk_rate);
  121. if (ret)
  122. dev_warn(qp->dev, "Failed to set %s rate to %d for %s\n",
  123. qn->clk_name, clk_rate, qn->name);
  124. if (qn->toggle_clk && !qn->clk_enabled) {
  125. ret = clk_prepare_enable(qn->clk);
  126. if (ret) {
  127. dev_err(qp->dev, "Failed to enable %s for %s\n",
  128. qn->clk_name, qn->name);
  129. return ret;
  130. }
  131. qn->clk_enabled = true;
  132. }
  133. } else if (qn->toggle_clk && qn->clk_enabled) {
  134. clk_disable_unprepare(qn->clk);
  135. qn->clk_enabled = false;
  136. }
  137. }
  138. for (i = 0; i < qp->num_voters; i++)
  139. qcom_icc_bcm_voter_commit(qp->voters[i]);
  140. return 0;
  141. }
  142. EXPORT_SYMBOL_GPL(qcom_icc_set);
  143. int qcom_icc_set_stub(struct icc_node *src, struct icc_node *dst)
  144. {
  145. return 0;
  146. }
  147. EXPORT_SYMBOL(qcom_icc_set_stub);
  148. int qcom_icc_get_bw_stub(struct icc_node *node, u32 *avg, u32 *peak)
  149. {
  150. *avg = 0;
  151. *peak = 0;
  152. return 0;
  153. }
  154. EXPORT_SYMBOL(qcom_icc_get_bw_stub);
  155. /**
  156. * qcom_icc_bcm_init - populates bcm aux data and connect qnodes
  157. * @bcm: bcm to be initialized
  158. * @dev: associated provider device
  159. *
  160. * Return: 0 on success, or an error code otherwise
  161. */
  162. int qcom_icc_bcm_init(struct qcom_icc_provider *qp, struct qcom_icc_bcm *bcm,
  163. struct device *dev)
  164. {
  165. struct qcom_icc_node *qn;
  166. const struct bcm_db *data;
  167. struct bcm_voter *voter;
  168. size_t data_count;
  169. int ret;
  170. int i;
  171. /* BCM is already initialised*/
  172. if (bcm->disabled || bcm->addr)
  173. return 0;
  174. bcm->addr = cmd_db_read_addr(bcm->name);
  175. if (!bcm->addr) {
  176. dev_err(dev, "%s could not find RPMh address\n",
  177. bcm->name);
  178. return -EINVAL;
  179. }
  180. data = cmd_db_read_aux_data(bcm->name, &data_count);
  181. if (IS_ERR(data)) {
  182. dev_err(dev, "%s command db read error (%ld)\n",
  183. bcm->name, PTR_ERR(data));
  184. return PTR_ERR(data);
  185. }
  186. if (!data_count) {
  187. dev_err(dev, "%s command db missing or partial aux data\n",
  188. bcm->name);
  189. return -EINVAL;
  190. }
  191. bcm->aux_data.unit = max_t(u32, 1, le32_to_cpu(data->unit));
  192. bcm->aux_data.width = max_t(u16, 1, le16_to_cpu(data->width));
  193. bcm->aux_data.vcd = data->vcd;
  194. bcm->aux_data.reserved = data->reserved;
  195. INIT_LIST_HEAD(&bcm->list);
  196. INIT_LIST_HEAD(&bcm->ws_list);
  197. if (!bcm->vote_scale)
  198. bcm->vote_scale = 1000;
  199. /* Link Qnodes to their respective BCMs */
  200. for (i = 0; i < bcm->num_nodes; i++) {
  201. qn = bcm->nodes[i];
  202. qn->bcms[qn->num_bcms] = bcm;
  203. qn->num_bcms++;
  204. }
  205. if (bcm->keepalive || bcm->keepalive_early) {
  206. voter = qp->voters[bcm->voter_idx];
  207. qcom_icc_bcm_voter_add(voter, bcm);
  208. ret = qcom_icc_bcm_voter_commit(voter);
  209. if (ret) {
  210. dev_err(dev, "failed to place initial vote for %s\n",
  211. bcm->name);
  212. return ret;
  213. }
  214. }
  215. return 0;
  216. }
  217. EXPORT_SYMBOL_GPL(qcom_icc_bcm_init);
  218. static bool bcm_needs_qos_proxy(struct qcom_icc_bcm *bcm)
  219. {
  220. int i;
  221. if (bcm->qos_proxy)
  222. return true;
  223. if (bcm->voter_idx == 0)
  224. for (i = 0; i < bcm->num_nodes; i++)
  225. if (bcm->nodes[i]->qosbox)
  226. return true;
  227. return false;
  228. }
  229. static int enable_qos_deps(struct qcom_icc_provider *qp)
  230. {
  231. struct qcom_icc_bcm *bcm;
  232. struct bcm_voter *voter;
  233. bool keepalive;
  234. int ret, i;
  235. for (i = 0; i < qp->num_bcms; i++) {
  236. bcm = qp->bcms[i];
  237. if (bcm_needs_qos_proxy(bcm)) {
  238. keepalive = bcm->keepalive;
  239. bcm->keepalive = true;
  240. voter = qp->voters[bcm->voter_idx];
  241. qcom_icc_bcm_voter_add(voter, bcm);
  242. ret = qcom_icc_bcm_voter_commit(voter);
  243. bcm->keepalive = keepalive;
  244. if (ret) {
  245. dev_err(qp->dev, "failed to vote BW to %s for QoS\n",
  246. bcm->name);
  247. return ret;
  248. }
  249. }
  250. }
  251. ret = clk_bulk_prepare_enable(qp->num_clks, qp->clks);
  252. if (ret) {
  253. dev_err(qp->dev, "failed to enable clocks for QoS\n");
  254. return ret;
  255. }
  256. return 0;
  257. }
  258. static void disable_qos_deps(struct qcom_icc_provider *qp)
  259. {
  260. struct qcom_icc_bcm *bcm;
  261. struct bcm_voter *voter;
  262. int i;
  263. clk_bulk_disable_unprepare(qp->num_clks, qp->clks);
  264. for (i = 0; i < qp->num_bcms; i++) {
  265. bcm = qp->bcms[i];
  266. if (bcm_needs_qos_proxy(bcm)) {
  267. voter = qp->voters[bcm->voter_idx];
  268. qcom_icc_bcm_voter_add(voter, bcm);
  269. qcom_icc_bcm_voter_commit(voter);
  270. }
  271. }
  272. }
  273. int qcom_icc_rpmh_configure_qos(struct qcom_icc_provider *qp)
  274. {
  275. struct qcom_icc_node *qnode;
  276. size_t i;
  277. int ret;
  278. ret = enable_qos_deps(qp);
  279. if (ret)
  280. return ret;
  281. for (i = 0; i < qp->num_nodes; i++) {
  282. qnode = qp->nodes[i];
  283. if (!qnode)
  284. continue;
  285. if (qnode->qosbox)
  286. qnode->noc_ops->set_qos(qnode);
  287. }
  288. disable_qos_deps(qp);
  289. return ret;
  290. }
  291. EXPORT_SYMBOL(qcom_icc_rpmh_configure_qos);
  292. static struct regmap *qcom_icc_rpmh_map(struct platform_device *pdev,
  293. const struct qcom_icc_desc *desc)
  294. {
  295. void __iomem *base;
  296. struct resource *res;
  297. struct device *dev = &pdev->dev;
  298. res = platform_get_resource(pdev, IORESOURCE_MEM, 0);
  299. if (!res)
  300. return NULL;
  301. base = devm_ioremap(dev, res->start, resource_size(res));
  302. if (IS_ERR(base))
  303. return ERR_CAST(base);
  304. return devm_regmap_init_mmio(dev, base, desc->config);
  305. }
  306. static bool is_voter_disabled(char *voter)
  307. {
  308. if ((strnstr(voter, "disp", strlen(voter)) && socinfo_get_part_info(PART_DISPLAY)) ||
  309. (strnstr(voter, "cam", strlen(voter)) && socinfo_get_part_info(PART_CAMERA)))
  310. return true;
  311. return false;
  312. }
  313. static int qcom_icc_init_disabled_parts(struct qcom_icc_provider *qp)
  314. {
  315. struct qcom_icc_bcm *bcm;
  316. struct qcom_icc_node * const *qnodes, *qn;
  317. const struct qcom_icc_desc *desc;
  318. int voter_idx, i, j;
  319. char *voter_name;
  320. desc = of_device_get_match_data(qp->dev);
  321. if (!desc)
  322. return -EINVAL;
  323. for (i = 0; i < qp->num_bcms; i++) {
  324. bcm = qp->bcms[i];
  325. voter_idx = bcm->voter_idx;
  326. voter_name = desc->voters[voter_idx];
  327. /* Disable BCMs incase of NO display or No Camera */
  328. if (is_voter_disabled(voter_name)) {
  329. bcm->disabled = true;
  330. qnodes = qp->nodes;
  331. for (j = 0; j < qp->num_nodes; j++) {
  332. qn = qnodes[j];
  333. if (!qn)
  334. continue;
  335. if (strnstr(qn->name, voter_name, strlen(qn->name)))
  336. qn->disabled = true;
  337. }
  338. }
  339. }
  340. return 0;
  341. }
  342. int qcom_icc_rpmh_probe(struct platform_device *pdev)
  343. {
  344. const struct qcom_icc_desc *desc;
  345. struct device *dev = &pdev->dev;
  346. struct icc_onecell_data *data;
  347. struct icc_provider *provider;
  348. struct qcom_icc_node * const *qnodes, *qn;
  349. struct qcom_icc_provider *qp;
  350. struct icc_node *node;
  351. size_t num_nodes, i, j;
  352. int ret;
  353. desc = of_device_get_match_data(dev);
  354. if (!desc)
  355. return -EINVAL;
  356. qnodes = desc->nodes;
  357. num_nodes = desc->num_nodes;
  358. qp = devm_kzalloc(dev, sizeof(*qp), GFP_KERNEL);
  359. if (!qp)
  360. return -ENOMEM;
  361. data = devm_kzalloc(dev, struct_size(data, nodes, num_nodes), GFP_KERNEL);
  362. if (!data)
  363. return -ENOMEM;
  364. qp->stub = of_property_read_bool(pdev->dev.of_node, "qcom,stub");
  365. qp->skip_qos = of_property_read_bool(pdev->dev.of_node, "qcom,skip-qos");
  366. provider = &qp->provider;
  367. provider->dev = dev;
  368. provider->set = qcom_icc_set_stub;
  369. provider->pre_aggregate = qcom_icc_pre_aggregate_stub;
  370. provider->aggregate = qcom_icc_aggregate_stub;
  371. provider->xlate_extended = qcom_icc_xlate_extended;
  372. provider->data = data;
  373. provider->get_bw = qcom_icc_get_bw_stub;
  374. icc_provider_init(provider);
  375. qp->dev = dev;
  376. qp->bcms = desc->bcms;
  377. qp->nodes = desc->nodes;
  378. qp->num_nodes = desc->num_nodes;
  379. if (!qp->stub) {
  380. qp->num_bcms = desc->num_bcms;
  381. qp->num_voters = desc->num_voters;
  382. qp->voters = devm_kcalloc(&pdev->dev, qp->num_voters,
  383. sizeof(*qp->voters), GFP_KERNEL);
  384. if (!qp->voters)
  385. return -ENOMEM;
  386. ret = qcom_icc_init_disabled_parts(qp);
  387. if (ret)
  388. return ret;
  389. for (i = 0; i < qp->num_voters; i++) {
  390. if (desc->voters[i] && !is_voter_disabled(desc->voters[i])) {
  391. qp->voters[i] = of_bcm_voter_get(qp->dev, desc->voters[i]);
  392. if (IS_ERR(qp->voters[i]))
  393. return PTR_ERR(qp->voters[i]);
  394. }
  395. }
  396. }
  397. qp->regmap = qcom_icc_rpmh_map(pdev, desc);
  398. if (IS_ERR(qp->regmap))
  399. return PTR_ERR(qp->regmap);
  400. qp->num_clks = devm_clk_bulk_get_all(qp->dev, &qp->clks);
  401. if (qp->num_clks < 0)
  402. return qp->num_clks;
  403. for (i = 0; i < qp->num_bcms; i++)
  404. qcom_icc_bcm_init(qp, qp->bcms[i], dev);
  405. for (i = 0; i < num_nodes; i++) {
  406. qn = qnodes[i];
  407. if (!qn || qn->disabled)
  408. continue;
  409. qn->regmap = dev_get_regmap(qp->dev, NULL);
  410. node = icc_node_create(qn->id);
  411. if (IS_ERR(node)) {
  412. ret = PTR_ERR(node);
  413. goto err_remove_nodes;
  414. }
  415. if (qn->clk_name) {
  416. qn->clk = devm_clk_get(qp->dev, qn->clk_name);
  417. if (IS_ERR(qn->clk)) {
  418. ret = PTR_ERR(qn->clk);
  419. if (ret != -EPROBE_DEFER)
  420. dev_err(qp->dev, "failed to get %s, err:(%d)\n",
  421. qn->clk_name, ret);
  422. goto err_remove_nodes;
  423. }
  424. }
  425. node->name = qn->name;
  426. node->data = qn;
  427. icc_node_add(node, provider);
  428. for (j = 0; j < qn->num_links; j++)
  429. icc_link_create(node, qn->links[j]);
  430. data->nodes[i] = node;
  431. }
  432. data->num_nodes = num_nodes;
  433. if (!qp->skip_qos) {
  434. ret = qcom_icc_rpmh_configure_qos(qp);
  435. if (ret)
  436. goto err_remove_nodes;
  437. }
  438. ret = icc_provider_register(provider);
  439. if (ret)
  440. goto err_remove_nodes;
  441. platform_set_drvdata(pdev, qp);
  442. if (!qp->stub) {
  443. provider->set = qcom_icc_set;
  444. provider->pre_aggregate = qcom_icc_pre_aggregate;
  445. provider->aggregate = qcom_icc_aggregate;
  446. }
  447. qcom_icc_debug_register(provider);
  448. mutex_lock(&probe_list_lock);
  449. list_add_tail(&qp->probe_list, &qnoc_probe_list);
  450. mutex_unlock(&probe_list_lock);
  451. /* Populate child NoC devices if any */
  452. if (of_get_child_count(dev->of_node) > 0) {
  453. ret = of_platform_populate(dev->of_node, NULL, NULL, dev);
  454. if (ret)
  455. goto err_deregister_provider;
  456. }
  457. return 0;
  458. err_deregister_provider:
  459. icc_provider_deregister(provider);
  460. err_remove_nodes:
  461. clk_bulk_put_all(qp->num_clks, qp->clks);
  462. icc_nodes_remove(provider);
  463. return ret;
  464. }
  465. EXPORT_SYMBOL_GPL(qcom_icc_rpmh_probe);
  466. int qcom_icc_rpmh_remove(struct platform_device *pdev)
  467. {
  468. struct qcom_icc_provider *qp = platform_get_drvdata(pdev);
  469. icc_provider_deregister(&qp->provider);
  470. qcom_icc_debug_unregister(&qp->provider);
  471. clk_bulk_put_all(qp->num_clks, qp->clks);
  472. icc_nodes_remove(&qp->provider);
  473. return 0;
  474. }
  475. EXPORT_SYMBOL_GPL(qcom_icc_rpmh_remove);
  476. void qcom_icc_rpmh_sync_state(struct device *dev)
  477. {
  478. struct platform_device *pdev = to_platform_device(dev);
  479. const struct of_device_id *oft = dev->driver->of_match_table;
  480. struct qcom_icc_provider *qp = platform_get_drvdata(pdev);
  481. struct qcom_icc_bcm *bcm;
  482. struct bcm_voter *voter;
  483. static int probe_count;
  484. int num_providers;
  485. for (num_providers = 0; oft[num_providers].data; num_providers++)
  486. ;
  487. mutex_lock(&probe_list_lock);
  488. probe_count++;
  489. if (probe_count < num_providers) {
  490. mutex_unlock(&probe_list_lock);
  491. return;
  492. }
  493. list_for_each_entry(qp, &qnoc_probe_list, probe_list) {
  494. int i;
  495. for (i = 0; i < qp->num_voters; i++)
  496. qcom_icc_bcm_voter_clear_init(qp->voters[i]);
  497. for (i = 0; i < qp->num_bcms; i++) {
  498. bcm = qp->bcms[i];
  499. if (!bcm->keepalive && !bcm->keepalive_early)
  500. continue;
  501. bcm->keepalive_early = false;
  502. voter = qp->voters[bcm->voter_idx];
  503. qcom_icc_bcm_voter_add(voter, bcm);
  504. qcom_icc_bcm_voter_commit(voter);
  505. }
  506. }
  507. mutex_unlock(&probe_list_lock);
  508. dev_info(dev, "sync-state\n");
  509. }
  510. EXPORT_SYMBOL(qcom_icc_rpmh_sync_state);
  511. MODULE_LICENSE("GPL v2");