regmap.c 2.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135
  1. // SPDX-License-Identifier: GPL-2.0+
  2. /*
  3. * Copyright (c) 2015 Google, Inc
  4. * Written by Simon Glass <sjg@chromium.org>
  5. */
  6. #include <common.h>
  7. #include <dm.h>
  8. #include <errno.h>
  9. #include <linux/libfdt.h>
  10. #include <malloc.h>
  11. #include <mapmem.h>
  12. #include <regmap.h>
  13. #include <asm/io.h>
  14. #include <dm/of_addr.h>
  15. #include <linux/ioport.h>
  16. DECLARE_GLOBAL_DATA_PTR;
  17. static struct regmap *regmap_alloc(int count)
  18. {
  19. struct regmap *map;
  20. map = malloc(sizeof(*map) + sizeof(map->ranges[0]) * count);
  21. if (!map)
  22. return NULL;
  23. map->range_count = count;
  24. return map;
  25. }
  26. #if CONFIG_IS_ENABLED(OF_PLATDATA)
  27. int regmap_init_mem_platdata(struct udevice *dev, fdt_val_t *reg, int count,
  28. struct regmap **mapp)
  29. {
  30. struct regmap_range *range;
  31. struct regmap *map;
  32. map = regmap_alloc(count);
  33. if (!map)
  34. return -ENOMEM;
  35. for (range = map->ranges; count > 0; reg += 2, range++, count--) {
  36. range->start = *reg;
  37. range->size = reg[1];
  38. }
  39. *mapp = map;
  40. return 0;
  41. }
  42. #else
  43. int regmap_init_mem(struct udevice *dev, struct regmap **mapp)
  44. {
  45. struct regmap_range *range;
  46. struct regmap *map;
  47. int count;
  48. int addr_len, size_len, both_len;
  49. int len;
  50. int index;
  51. ofnode node = dev_ofnode(dev);
  52. struct resource r;
  53. addr_len = dev_read_simple_addr_cells(dev->parent);
  54. size_len = dev_read_simple_size_cells(dev->parent);
  55. both_len = addr_len + size_len;
  56. len = dev_read_size(dev, "reg");
  57. if (len < 0)
  58. return len;
  59. len /= sizeof(fdt32_t);
  60. count = len / both_len;
  61. if (!count)
  62. return -EINVAL;
  63. map = regmap_alloc(count);
  64. if (!map)
  65. return -ENOMEM;
  66. for (range = map->ranges, index = 0; count > 0;
  67. count--, range++, index++) {
  68. fdt_size_t sz;
  69. if (of_live_active()) {
  70. of_address_to_resource(ofnode_to_np(node), index, &r);
  71. range->start = r.start;
  72. range->size = r.end - r.start + 1;
  73. } else {
  74. range->start = fdtdec_get_addr_size_fixed(gd->fdt_blob,
  75. dev_of_offset(dev), "reg", index,
  76. addr_len, size_len, &sz, true);
  77. range->size = sz;
  78. }
  79. }
  80. *mapp = map;
  81. return 0;
  82. }
  83. #endif
  84. void *regmap_get_range(struct regmap *map, unsigned int range_num)
  85. {
  86. struct regmap_range *range;
  87. if (range_num >= map->range_count)
  88. return NULL;
  89. range = &map->ranges[range_num];
  90. return map_sysmem(range->start, range->size);
  91. }
  92. int regmap_uninit(struct regmap *map)
  93. {
  94. free(map);
  95. return 0;
  96. }
  97. int regmap_read(struct regmap *map, uint offset, uint *valp)
  98. {
  99. u32 *ptr = map_physmem(map->ranges[0].start + offset, 4, MAP_NOCACHE);
  100. *valp = le32_to_cpu(readl(ptr));
  101. return 0;
  102. }
  103. int regmap_write(struct regmap *map, uint offset, uint val)
  104. {
  105. u32 *ptr = map_physmem(map->ranges[0].start + offset, 4, MAP_NOCACHE);
  106. writel(cpu_to_le32(val), ptr);
  107. return 0;
  108. }