regmap.c 2.9 KB

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