regmap.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723
  1. // SPDX-License-Identifier: GPL-2.0+
  2. /*
  3. * Copyright (c) 2015 Google, Inc
  4. * Written by Simon Glass <sjg@chromium.org>
  5. */
  6. #define LOG_CATEGORY LOGC_DM
  7. #include <common.h>
  8. #include <dm.h>
  9. #include <errno.h>
  10. #include <log.h>
  11. #include <asm/global_data.h>
  12. #include <linux/libfdt.h>
  13. #include <malloc.h>
  14. #include <mapmem.h>
  15. #include <regmap.h>
  16. #include <asm/io.h>
  17. #include <dm/of_addr.h>
  18. #include <dm/devres.h>
  19. #include <linux/ioport.h>
  20. #include <linux/compat.h>
  21. #include <linux/err.h>
  22. #include <linux/bitops.h>
  23. /*
  24. * Internal representation of a regmap field. Instead of storing the MSB and
  25. * LSB, store the shift and mask. This makes the code a bit cleaner and faster
  26. * because the shift and mask don't have to be calculated every time.
  27. */
  28. struct regmap_field {
  29. struct regmap *regmap;
  30. unsigned int mask;
  31. /* lsb */
  32. unsigned int shift;
  33. unsigned int reg;
  34. };
  35. DECLARE_GLOBAL_DATA_PTR;
  36. /**
  37. * do_range_check() - Control whether range checks are done
  38. *
  39. * Returns: true to do range checks, false to skip
  40. *
  41. * This is used to reduce code size on SPL where range checks are known not to
  42. * be needed
  43. *
  44. * Add this to the top of the file to enable them: #define LOG_DEBUG
  45. */
  46. static inline bool do_range_check(void)
  47. {
  48. return _LOG_DEBUG || !IS_ENABLED(CONFIG_SPL);
  49. }
  50. /**
  51. * regmap_alloc() - Allocate a regmap with a given number of ranges.
  52. *
  53. * @count: Number of ranges to be allocated for the regmap.
  54. *
  55. * The default regmap width is set to REGMAP_SIZE_32. Callers can override it
  56. * if they need.
  57. *
  58. * Return: A pointer to the newly allocated regmap, or NULL on error.
  59. */
  60. static struct regmap *regmap_alloc(int count)
  61. {
  62. struct regmap *map;
  63. size_t size = sizeof(*map) + sizeof(map->ranges[0]) * count;
  64. map = calloc(1, size);
  65. if (!map)
  66. return NULL;
  67. map->range_count = count;
  68. map->width = REGMAP_SIZE_32;
  69. return map;
  70. }
  71. #if CONFIG_IS_ENABLED(OF_PLATDATA)
  72. int regmap_init_mem_plat(struct udevice *dev, void *reg, int size, int count,
  73. struct regmap **mapp)
  74. {
  75. struct regmap_range *range;
  76. struct regmap *map;
  77. map = regmap_alloc(count);
  78. if (!map)
  79. return -ENOMEM;
  80. if (size == sizeof(fdt32_t)) {
  81. fdt32_t *ptr = (fdt32_t *)reg;
  82. for (range = map->ranges; count > 0;
  83. ptr += 2, range++, count--) {
  84. range->start = *ptr;
  85. range->size = ptr[1];
  86. }
  87. } else if (size == sizeof(fdt64_t)) {
  88. fdt64_t *ptr = (fdt64_t *)reg;
  89. for (range = map->ranges; count > 0;
  90. ptr += 2, range++, count--) {
  91. range->start = *ptr;
  92. range->size = ptr[1];
  93. }
  94. } else {
  95. return -EINVAL;
  96. }
  97. *mapp = map;
  98. return 0;
  99. }
  100. #else
  101. /**
  102. * init_range() - Initialize a single range of a regmap
  103. * @node: Device node that will use the map in question
  104. * @range: Pointer to a regmap_range structure that will be initialized
  105. * @addr_len: The length of the addr parts of the reg property
  106. * @size_len: The length of the size parts of the reg property
  107. * @index: The index of the range to initialize
  108. *
  109. * This function will read the necessary 'reg' information from the device tree
  110. * (the 'addr' part, and the 'length' part), and initialize the range in
  111. * quesion.
  112. *
  113. * Return: 0 if OK, -ve on error
  114. */
  115. static int init_range(ofnode node, struct regmap_range *range, int addr_len,
  116. int size_len, int index)
  117. {
  118. fdt_size_t sz;
  119. struct resource r;
  120. if (of_live_active()) {
  121. int ret;
  122. ret = of_address_to_resource(ofnode_to_np(node),
  123. index, &r);
  124. if (ret) {
  125. debug("%s: Could not read resource of range %d (ret = %d)\n",
  126. ofnode_get_name(node), index, ret);
  127. return ret;
  128. }
  129. range->start = r.start;
  130. range->size = r.end - r.start + 1;
  131. } else {
  132. int offset = ofnode_to_offset(node);
  133. range->start = fdtdec_get_addr_size_fixed(gd->fdt_blob, offset,
  134. "reg", index,
  135. addr_len, size_len,
  136. &sz, true);
  137. if (range->start == FDT_ADDR_T_NONE) {
  138. debug("%s: Could not read start of range %d\n",
  139. ofnode_get_name(node), index);
  140. return -EINVAL;
  141. }
  142. range->size = sz;
  143. }
  144. return 0;
  145. }
  146. int regmap_init_mem_index(ofnode node, struct regmap **mapp, int index)
  147. {
  148. struct regmap *map;
  149. int addr_len, size_len;
  150. int ret;
  151. addr_len = ofnode_read_simple_addr_cells(ofnode_get_parent(node));
  152. if (addr_len < 0) {
  153. debug("%s: Error while reading the addr length (ret = %d)\n",
  154. ofnode_get_name(node), addr_len);
  155. return addr_len;
  156. }
  157. size_len = ofnode_read_simple_size_cells(ofnode_get_parent(node));
  158. if (size_len < 0) {
  159. debug("%s: Error while reading the size length: (ret = %d)\n",
  160. ofnode_get_name(node), size_len);
  161. return size_len;
  162. }
  163. map = regmap_alloc(1);
  164. if (!map)
  165. return -ENOMEM;
  166. ret = init_range(node, map->ranges, addr_len, size_len, index);
  167. if (ret)
  168. goto err;
  169. if (ofnode_read_bool(node, "little-endian"))
  170. map->endianness = REGMAP_LITTLE_ENDIAN;
  171. else if (ofnode_read_bool(node, "big-endian"))
  172. map->endianness = REGMAP_BIG_ENDIAN;
  173. else if (ofnode_read_bool(node, "native-endian"))
  174. map->endianness = REGMAP_NATIVE_ENDIAN;
  175. else /* Default: native endianness */
  176. map->endianness = REGMAP_NATIVE_ENDIAN;
  177. *mapp = map;
  178. return 0;
  179. err:
  180. regmap_uninit(map);
  181. return ret;
  182. }
  183. int regmap_init_mem_range(ofnode node, ulong r_start, ulong r_size,
  184. struct regmap **mapp)
  185. {
  186. struct regmap *map;
  187. struct regmap_range *range;
  188. map = regmap_alloc(1);
  189. if (!map)
  190. return -ENOMEM;
  191. range = &map->ranges[0];
  192. range->start = r_start;
  193. range->size = r_size;
  194. if (ofnode_read_bool(node, "little-endian"))
  195. map->endianness = REGMAP_LITTLE_ENDIAN;
  196. else if (ofnode_read_bool(node, "big-endian"))
  197. map->endianness = REGMAP_BIG_ENDIAN;
  198. else if (ofnode_read_bool(node, "native-endian"))
  199. map->endianness = REGMAP_NATIVE_ENDIAN;
  200. else /* Default: native endianness */
  201. map->endianness = REGMAP_NATIVE_ENDIAN;
  202. *mapp = map;
  203. return 0;
  204. }
  205. int regmap_init_mem(ofnode node, struct regmap **mapp)
  206. {
  207. struct regmap_range *range;
  208. struct regmap *map;
  209. int count;
  210. int addr_len, size_len, both_len;
  211. int len;
  212. int index;
  213. int ret;
  214. addr_len = ofnode_read_simple_addr_cells(ofnode_get_parent(node));
  215. if (addr_len < 0) {
  216. debug("%s: Error while reading the addr length (ret = %d)\n",
  217. ofnode_get_name(node), addr_len);
  218. return addr_len;
  219. }
  220. size_len = ofnode_read_simple_size_cells(ofnode_get_parent(node));
  221. if (size_len < 0) {
  222. debug("%s: Error while reading the size length: (ret = %d)\n",
  223. ofnode_get_name(node), size_len);
  224. return size_len;
  225. }
  226. both_len = addr_len + size_len;
  227. if (!both_len) {
  228. debug("%s: Both addr and size length are zero\n",
  229. ofnode_get_name(node));
  230. return -EINVAL;
  231. }
  232. len = ofnode_read_size(node, "reg");
  233. if (len < 0) {
  234. debug("%s: Error while reading reg size (ret = %d)\n",
  235. ofnode_get_name(node), len);
  236. return len;
  237. }
  238. len /= sizeof(fdt32_t);
  239. count = len / both_len;
  240. if (!count) {
  241. debug("%s: Not enough data in reg property\n",
  242. ofnode_get_name(node));
  243. return -EINVAL;
  244. }
  245. map = regmap_alloc(count);
  246. if (!map)
  247. return -ENOMEM;
  248. for (range = map->ranges, index = 0; count > 0;
  249. count--, range++, index++) {
  250. ret = init_range(node, range, addr_len, size_len, index);
  251. if (ret)
  252. goto err;
  253. }
  254. if (ofnode_read_bool(node, "little-endian"))
  255. map->endianness = REGMAP_LITTLE_ENDIAN;
  256. else if (ofnode_read_bool(node, "big-endian"))
  257. map->endianness = REGMAP_BIG_ENDIAN;
  258. else if (ofnode_read_bool(node, "native-endian"))
  259. map->endianness = REGMAP_NATIVE_ENDIAN;
  260. else /* Default: native endianness */
  261. map->endianness = REGMAP_NATIVE_ENDIAN;
  262. *mapp = map;
  263. return 0;
  264. err:
  265. regmap_uninit(map);
  266. return ret;
  267. }
  268. static void devm_regmap_release(struct udevice *dev, void *res)
  269. {
  270. regmap_uninit(*(struct regmap **)res);
  271. }
  272. struct regmap *devm_regmap_init(struct udevice *dev,
  273. const struct regmap_bus *bus,
  274. void *bus_context,
  275. const struct regmap_config *config)
  276. {
  277. int rc;
  278. struct regmap **mapp, *map;
  279. /* this looks like a leak, but devres takes care of it */
  280. mapp = devres_alloc(devm_regmap_release, sizeof(struct regmap *),
  281. __GFP_ZERO);
  282. if (unlikely(!mapp))
  283. return ERR_PTR(-ENOMEM);
  284. if (config && config->r_size != 0)
  285. rc = regmap_init_mem_range(dev_ofnode(dev), config->r_start,
  286. config->r_size, mapp);
  287. else
  288. rc = regmap_init_mem(dev_ofnode(dev), mapp);
  289. if (rc)
  290. return ERR_PTR(rc);
  291. map = *mapp;
  292. if (config) {
  293. map->width = config->width;
  294. map->reg_offset_shift = config->reg_offset_shift;
  295. }
  296. devres_add(dev, mapp);
  297. return *mapp;
  298. }
  299. #endif
  300. void *regmap_get_range(struct regmap *map, unsigned int range_num)
  301. {
  302. struct regmap_range *range;
  303. if (range_num >= map->range_count)
  304. return NULL;
  305. range = &map->ranges[range_num];
  306. return map_sysmem(range->start, range->size);
  307. }
  308. int regmap_uninit(struct regmap *map)
  309. {
  310. free(map);
  311. return 0;
  312. }
  313. static inline u8 __read_8(u8 *addr, enum regmap_endianness_t endianness)
  314. {
  315. return readb(addr);
  316. }
  317. static inline u16 __read_16(u16 *addr, enum regmap_endianness_t endianness)
  318. {
  319. switch (endianness) {
  320. case REGMAP_LITTLE_ENDIAN:
  321. return in_le16(addr);
  322. case REGMAP_BIG_ENDIAN:
  323. return in_be16(addr);
  324. case REGMAP_NATIVE_ENDIAN:
  325. return readw(addr);
  326. }
  327. return readw(addr);
  328. }
  329. static inline u32 __read_32(u32 *addr, enum regmap_endianness_t endianness)
  330. {
  331. switch (endianness) {
  332. case REGMAP_LITTLE_ENDIAN:
  333. return in_le32(addr);
  334. case REGMAP_BIG_ENDIAN:
  335. return in_be32(addr);
  336. case REGMAP_NATIVE_ENDIAN:
  337. return readl(addr);
  338. }
  339. return readl(addr);
  340. }
  341. #if defined(in_le64) && defined(in_be64) && defined(readq)
  342. static inline u64 __read_64(u64 *addr, enum regmap_endianness_t endianness)
  343. {
  344. switch (endianness) {
  345. case REGMAP_LITTLE_ENDIAN:
  346. return in_le64(addr);
  347. case REGMAP_BIG_ENDIAN:
  348. return in_be64(addr);
  349. case REGMAP_NATIVE_ENDIAN:
  350. return readq(addr);
  351. }
  352. return readq(addr);
  353. }
  354. #endif
  355. int regmap_raw_read_range(struct regmap *map, uint range_num, uint offset,
  356. void *valp, size_t val_len)
  357. {
  358. struct regmap_range *range;
  359. void *ptr;
  360. if (do_range_check() && range_num >= map->range_count) {
  361. debug("%s: range index %d larger than range count\n",
  362. __func__, range_num);
  363. return -ERANGE;
  364. }
  365. range = &map->ranges[range_num];
  366. offset <<= map->reg_offset_shift;
  367. if (do_range_check() &&
  368. (offset + val_len > range->size || offset + val_len < offset)) {
  369. debug("%s: offset/size combination invalid\n", __func__);
  370. return -ERANGE;
  371. }
  372. ptr = map_physmem(range->start + offset, val_len, MAP_NOCACHE);
  373. switch (val_len) {
  374. case REGMAP_SIZE_8:
  375. *((u8 *)valp) = __read_8(ptr, map->endianness);
  376. break;
  377. case REGMAP_SIZE_16:
  378. *((u16 *)valp) = __read_16(ptr, map->endianness);
  379. break;
  380. case REGMAP_SIZE_32:
  381. *((u32 *)valp) = __read_32(ptr, map->endianness);
  382. break;
  383. #if defined(in_le64) && defined(in_be64) && defined(readq)
  384. case REGMAP_SIZE_64:
  385. *((u64 *)valp) = __read_64(ptr, map->endianness);
  386. break;
  387. #endif
  388. default:
  389. debug("%s: regmap size %zu unknown\n", __func__, val_len);
  390. return -EINVAL;
  391. }
  392. return 0;
  393. }
  394. int regmap_raw_read(struct regmap *map, uint offset, void *valp, size_t val_len)
  395. {
  396. return regmap_raw_read_range(map, 0, offset, valp, val_len);
  397. }
  398. int regmap_read(struct regmap *map, uint offset, uint *valp)
  399. {
  400. union {
  401. u8 v8;
  402. u16 v16;
  403. u32 v32;
  404. u64 v64;
  405. } u;
  406. int res;
  407. res = regmap_raw_read(map, offset, &u, map->width);
  408. if (res)
  409. return res;
  410. switch (map->width) {
  411. case REGMAP_SIZE_8:
  412. *valp = u.v8;
  413. break;
  414. case REGMAP_SIZE_16:
  415. *valp = u.v16;
  416. break;
  417. case REGMAP_SIZE_32:
  418. *valp = u.v32;
  419. break;
  420. case REGMAP_SIZE_64:
  421. *valp = u.v64;
  422. break;
  423. default:
  424. unreachable();
  425. }
  426. return 0;
  427. }
  428. static inline void __write_8(u8 *addr, const u8 *val,
  429. enum regmap_endianness_t endianness)
  430. {
  431. writeb(*val, addr);
  432. }
  433. static inline void __write_16(u16 *addr, const u16 *val,
  434. enum regmap_endianness_t endianness)
  435. {
  436. switch (endianness) {
  437. case REGMAP_NATIVE_ENDIAN:
  438. writew(*val, addr);
  439. break;
  440. case REGMAP_LITTLE_ENDIAN:
  441. out_le16(addr, *val);
  442. break;
  443. case REGMAP_BIG_ENDIAN:
  444. out_be16(addr, *val);
  445. break;
  446. }
  447. }
  448. static inline void __write_32(u32 *addr, const u32 *val,
  449. enum regmap_endianness_t endianness)
  450. {
  451. switch (endianness) {
  452. case REGMAP_NATIVE_ENDIAN:
  453. writel(*val, addr);
  454. break;
  455. case REGMAP_LITTLE_ENDIAN:
  456. out_le32(addr, *val);
  457. break;
  458. case REGMAP_BIG_ENDIAN:
  459. out_be32(addr, *val);
  460. break;
  461. }
  462. }
  463. #if defined(out_le64) && defined(out_be64) && defined(writeq)
  464. static inline void __write_64(u64 *addr, const u64 *val,
  465. enum regmap_endianness_t endianness)
  466. {
  467. switch (endianness) {
  468. case REGMAP_NATIVE_ENDIAN:
  469. writeq(*val, addr);
  470. break;
  471. case REGMAP_LITTLE_ENDIAN:
  472. out_le64(addr, *val);
  473. break;
  474. case REGMAP_BIG_ENDIAN:
  475. out_be64(addr, *val);
  476. break;
  477. }
  478. }
  479. #endif
  480. int regmap_raw_write_range(struct regmap *map, uint range_num, uint offset,
  481. const void *val, size_t val_len)
  482. {
  483. struct regmap_range *range;
  484. void *ptr;
  485. if (range_num >= map->range_count) {
  486. debug("%s: range index %d larger than range count\n",
  487. __func__, range_num);
  488. return -ERANGE;
  489. }
  490. range = &map->ranges[range_num];
  491. offset <<= map->reg_offset_shift;
  492. if (offset + val_len > range->size || offset + val_len < offset) {
  493. debug("%s: offset/size combination invalid\n", __func__);
  494. return -ERANGE;
  495. }
  496. ptr = map_physmem(range->start + offset, val_len, MAP_NOCACHE);
  497. switch (val_len) {
  498. case REGMAP_SIZE_8:
  499. __write_8(ptr, val, map->endianness);
  500. break;
  501. case REGMAP_SIZE_16:
  502. __write_16(ptr, val, map->endianness);
  503. break;
  504. case REGMAP_SIZE_32:
  505. __write_32(ptr, val, map->endianness);
  506. break;
  507. #if defined(out_le64) && defined(out_be64) && defined(writeq)
  508. case REGMAP_SIZE_64:
  509. __write_64(ptr, val, map->endianness);
  510. break;
  511. #endif
  512. default:
  513. debug("%s: regmap size %zu unknown\n", __func__, val_len);
  514. return -EINVAL;
  515. }
  516. return 0;
  517. }
  518. int regmap_raw_write(struct regmap *map, uint offset, const void *val,
  519. size_t val_len)
  520. {
  521. return regmap_raw_write_range(map, 0, offset, val, val_len);
  522. }
  523. int regmap_write(struct regmap *map, uint offset, uint val)
  524. {
  525. union {
  526. u8 v8;
  527. u16 v16;
  528. u32 v32;
  529. u64 v64;
  530. } u;
  531. switch (map->width) {
  532. case REGMAP_SIZE_8:
  533. u.v8 = val;
  534. break;
  535. case REGMAP_SIZE_16:
  536. u.v16 = val;
  537. break;
  538. case REGMAP_SIZE_32:
  539. u.v32 = val;
  540. break;
  541. case REGMAP_SIZE_64:
  542. u.v64 = val;
  543. break;
  544. default:
  545. debug("%s: regmap size %zu unknown\n", __func__,
  546. (size_t)map->width);
  547. return -EINVAL;
  548. }
  549. return regmap_raw_write(map, offset, &u, map->width);
  550. }
  551. int regmap_update_bits(struct regmap *map, uint offset, uint mask, uint val)
  552. {
  553. uint reg;
  554. int ret;
  555. ret = regmap_read(map, offset, &reg);
  556. if (ret)
  557. return ret;
  558. reg &= ~mask;
  559. return regmap_write(map, offset, reg | (val & mask));
  560. }
  561. int regmap_field_read(struct regmap_field *field, unsigned int *val)
  562. {
  563. int ret;
  564. unsigned int reg_val;
  565. ret = regmap_read(field->regmap, field->reg, &reg_val);
  566. if (ret != 0)
  567. return ret;
  568. reg_val &= field->mask;
  569. reg_val >>= field->shift;
  570. *val = reg_val;
  571. return ret;
  572. }
  573. int regmap_field_write(struct regmap_field *field, unsigned int val)
  574. {
  575. return regmap_update_bits(field->regmap, field->reg, field->mask,
  576. val << field->shift);
  577. }
  578. static void regmap_field_init(struct regmap_field *rm_field,
  579. struct regmap *regmap,
  580. struct reg_field reg_field)
  581. {
  582. rm_field->regmap = regmap;
  583. rm_field->reg = reg_field.reg;
  584. rm_field->shift = reg_field.lsb;
  585. rm_field->mask = GENMASK(reg_field.msb, reg_field.lsb);
  586. }
  587. struct regmap_field *devm_regmap_field_alloc(struct udevice *dev,
  588. struct regmap *regmap,
  589. struct reg_field reg_field)
  590. {
  591. struct regmap_field *rm_field = devm_kzalloc(dev, sizeof(*rm_field),
  592. GFP_KERNEL);
  593. if (!rm_field)
  594. return ERR_PTR(-ENOMEM);
  595. regmap_field_init(rm_field, regmap, reg_field);
  596. return rm_field;
  597. }
  598. void devm_regmap_field_free(struct udevice *dev, struct regmap_field *field)
  599. {
  600. devm_kfree(dev, field);
  601. }
  602. struct regmap_field *regmap_field_alloc(struct regmap *regmap,
  603. struct reg_field reg_field)
  604. {
  605. struct regmap_field *rm_field = kzalloc(sizeof(*rm_field), GFP_KERNEL);
  606. if (!rm_field)
  607. return ERR_PTR(-ENOMEM);
  608. regmap_field_init(rm_field, regmap, reg_field);
  609. return rm_field;
  610. }
  611. void regmap_field_free(struct regmap_field *field)
  612. {
  613. kfree(field);
  614. }