regmap-debugfs.c 8.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371
  1. /*
  2. * Register map access API - debugfs
  3. *
  4. * Copyright 2011 Wolfson Microelectronics plc
  5. *
  6. * Author: Mark Brown <broonie@opensource.wolfsonmicro.com>
  7. *
  8. * This program is free software; you can redistribute it and/or modify
  9. * it under the terms of the GNU General Public License version 2 as
  10. * published by the Free Software Foundation.
  11. */
  12. #include <linux/slab.h>
  13. #include <linux/mutex.h>
  14. #include <linux/debugfs.h>
  15. #include <linux/uaccess.h>
  16. #include <linux/device.h>
  17. #include "internal.h"
  18. static struct dentry *regmap_debugfs_root;
  19. /* Calculate the length of a fixed format */
  20. static size_t regmap_calc_reg_len(int max_val, char *buf, size_t buf_size)
  21. {
  22. snprintf(buf, buf_size, "%x", max_val);
  23. return strlen(buf);
  24. }
  25. static ssize_t regmap_name_read_file(struct file *file,
  26. char __user *user_buf, size_t count,
  27. loff_t *ppos)
  28. {
  29. struct regmap *map = file->private_data;
  30. int ret;
  31. char *buf;
  32. buf = kmalloc(PAGE_SIZE, GFP_KERNEL);
  33. if (!buf)
  34. return -ENOMEM;
  35. ret = snprintf(buf, PAGE_SIZE, "%s\n", map->dev->driver->name);
  36. if (ret < 0) {
  37. kfree(buf);
  38. return ret;
  39. }
  40. ret = simple_read_from_buffer(user_buf, count, ppos, buf, ret);
  41. kfree(buf);
  42. return ret;
  43. }
  44. static const struct file_operations regmap_name_fops = {
  45. .open = simple_open,
  46. .read = regmap_name_read_file,
  47. .llseek = default_llseek,
  48. };
  49. /*
  50. * Work out where the start offset maps into register numbers, bearing
  51. * in mind that we suppress hidden registers.
  52. */
  53. static unsigned int regmap_debugfs_get_dump_start(struct regmap *map,
  54. unsigned int base,
  55. loff_t from,
  56. loff_t *pos)
  57. {
  58. loff_t p = *pos;
  59. unsigned int i;
  60. for (i = base; i <= map->max_register; i += map->reg_stride) {
  61. if (!regmap_readable(map, i))
  62. continue;
  63. if (regmap_precious(map, i))
  64. continue;
  65. if (i >= from) {
  66. *pos = p;
  67. return i;
  68. }
  69. p += map->debugfs_tot_len;
  70. }
  71. return base;
  72. }
  73. static ssize_t regmap_read_debugfs(struct regmap *map, unsigned int from,
  74. unsigned int to, char __user *user_buf,
  75. size_t count, loff_t *ppos)
  76. {
  77. size_t buf_pos = 0;
  78. loff_t p = *ppos;
  79. ssize_t ret;
  80. int i;
  81. char *buf;
  82. unsigned int val, start_reg;
  83. if (*ppos < 0 || !count)
  84. return -EINVAL;
  85. buf = kmalloc(count, GFP_KERNEL);
  86. if (!buf)
  87. return -ENOMEM;
  88. /* Calculate the length of a fixed format */
  89. if (!map->debugfs_tot_len) {
  90. map->debugfs_reg_len = regmap_calc_reg_len(map->max_register,
  91. buf, count);
  92. map->debugfs_val_len = 2 * map->format.val_bytes;
  93. map->debugfs_tot_len = map->debugfs_reg_len +
  94. map->debugfs_val_len + 3; /* : \n */
  95. }
  96. /* Work out which register we're starting at */
  97. start_reg = regmap_debugfs_get_dump_start(map, from, *ppos, &p);
  98. for (i = start_reg; i <= to; i += map->reg_stride) {
  99. if (!regmap_readable(map, i))
  100. continue;
  101. if (regmap_precious(map, i))
  102. continue;
  103. /* If we're in the region the user is trying to read */
  104. if (p >= *ppos) {
  105. /* ...but not beyond it */
  106. if (buf_pos + 1 + map->debugfs_tot_len >= count)
  107. break;
  108. /* Format the register */
  109. snprintf(buf + buf_pos, count - buf_pos, "%.*x: ",
  110. map->debugfs_reg_len, i - from);
  111. buf_pos += map->debugfs_reg_len + 2;
  112. /* Format the value, write all X if we can't read */
  113. ret = regmap_read(map, i, &val);
  114. if (ret == 0)
  115. snprintf(buf + buf_pos, count - buf_pos,
  116. "%.*x", map->debugfs_val_len, val);
  117. else
  118. memset(buf + buf_pos, 'X',
  119. map->debugfs_val_len);
  120. buf_pos += 2 * map->format.val_bytes;
  121. buf[buf_pos++] = '\n';
  122. }
  123. p += map->debugfs_tot_len;
  124. }
  125. ret = buf_pos;
  126. if (copy_to_user(user_buf, buf, buf_pos)) {
  127. ret = -EFAULT;
  128. goto out;
  129. }
  130. *ppos += buf_pos;
  131. out:
  132. kfree(buf);
  133. return ret;
  134. }
  135. static ssize_t regmap_map_read_file(struct file *file, char __user *user_buf,
  136. size_t count, loff_t *ppos)
  137. {
  138. struct regmap *map = file->private_data;
  139. return regmap_read_debugfs(map, 0, map->max_register, user_buf,
  140. count, ppos);
  141. }
  142. #undef REGMAP_ALLOW_WRITE_DEBUGFS
  143. #ifdef REGMAP_ALLOW_WRITE_DEBUGFS
  144. /*
  145. * This can be dangerous especially when we have clients such as
  146. * PMICs, therefore don't provide any real compile time configuration option
  147. * for this feature, people who want to use this will need to modify
  148. * the source code directly.
  149. */
  150. static ssize_t regmap_map_write_file(struct file *file,
  151. const char __user *user_buf,
  152. size_t count, loff_t *ppos)
  153. {
  154. char buf[32];
  155. size_t buf_size;
  156. char *start = buf;
  157. unsigned long reg, value;
  158. struct regmap *map = file->private_data;
  159. buf_size = min(count, (sizeof(buf)-1));
  160. if (copy_from_user(buf, user_buf, buf_size))
  161. return -EFAULT;
  162. buf[buf_size] = 0;
  163. while (*start == ' ')
  164. start++;
  165. reg = simple_strtoul(start, &start, 16);
  166. while (*start == ' ')
  167. start++;
  168. if (strict_strtoul(start, 16, &value))
  169. return -EINVAL;
  170. /* Userspace has been fiddling around behind the kernel's back */
  171. add_taint(TAINT_USER);
  172. regmap_write(map, reg, value);
  173. return buf_size;
  174. }
  175. #else
  176. #define regmap_map_write_file NULL
  177. #endif
  178. static const struct file_operations regmap_map_fops = {
  179. .open = simple_open,
  180. .read = regmap_map_read_file,
  181. .write = regmap_map_write_file,
  182. .llseek = default_llseek,
  183. };
  184. static ssize_t regmap_range_read_file(struct file *file, char __user *user_buf,
  185. size_t count, loff_t *ppos)
  186. {
  187. struct regmap_range_node *range = file->private_data;
  188. struct regmap *map = range->map;
  189. return regmap_read_debugfs(map, range->range_min, range->range_max,
  190. user_buf, count, ppos);
  191. }
  192. static const struct file_operations regmap_range_fops = {
  193. .open = simple_open,
  194. .read = regmap_range_read_file,
  195. .llseek = default_llseek,
  196. };
  197. static ssize_t regmap_access_read_file(struct file *file,
  198. char __user *user_buf, size_t count,
  199. loff_t *ppos)
  200. {
  201. int reg_len, tot_len;
  202. size_t buf_pos = 0;
  203. loff_t p = 0;
  204. ssize_t ret;
  205. int i;
  206. struct regmap *map = file->private_data;
  207. char *buf;
  208. if (*ppos < 0 || !count)
  209. return -EINVAL;
  210. buf = kmalloc(count, GFP_KERNEL);
  211. if (!buf)
  212. return -ENOMEM;
  213. /* Calculate the length of a fixed format */
  214. reg_len = regmap_calc_reg_len(map->max_register, buf, count);
  215. tot_len = reg_len + 10; /* ': R W V P\n' */
  216. for (i = 0; i <= map->max_register; i += map->reg_stride) {
  217. /* Ignore registers which are neither readable nor writable */
  218. if (!regmap_readable(map, i) && !regmap_writeable(map, i))
  219. continue;
  220. /* If we're in the region the user is trying to read */
  221. if (p >= *ppos) {
  222. /* ...but not beyond it */
  223. if (buf_pos >= count - 1 - tot_len)
  224. break;
  225. /* Format the register */
  226. snprintf(buf + buf_pos, count - buf_pos,
  227. "%.*x: %c %c %c %c\n",
  228. reg_len, i,
  229. regmap_readable(map, i) ? 'y' : 'n',
  230. regmap_writeable(map, i) ? 'y' : 'n',
  231. regmap_volatile(map, i) ? 'y' : 'n',
  232. regmap_precious(map, i) ? 'y' : 'n');
  233. buf_pos += tot_len;
  234. }
  235. p += tot_len;
  236. }
  237. ret = buf_pos;
  238. if (copy_to_user(user_buf, buf, buf_pos)) {
  239. ret = -EFAULT;
  240. goto out;
  241. }
  242. *ppos += buf_pos;
  243. out:
  244. kfree(buf);
  245. return ret;
  246. }
  247. static const struct file_operations regmap_access_fops = {
  248. .open = simple_open,
  249. .read = regmap_access_read_file,
  250. .llseek = default_llseek,
  251. };
  252. void regmap_debugfs_init(struct regmap *map, const char *name)
  253. {
  254. struct rb_node *next;
  255. struct regmap_range_node *range_node;
  256. if (name) {
  257. map->debugfs_name = kasprintf(GFP_KERNEL, "%s-%s",
  258. dev_name(map->dev), name);
  259. name = map->debugfs_name;
  260. } else {
  261. name = dev_name(map->dev);
  262. }
  263. map->debugfs = debugfs_create_dir(name, regmap_debugfs_root);
  264. if (!map->debugfs) {
  265. dev_warn(map->dev, "Failed to create debugfs directory\n");
  266. return;
  267. }
  268. debugfs_create_file("name", 0400, map->debugfs,
  269. map, &regmap_name_fops);
  270. if (map->max_register) {
  271. debugfs_create_file("registers", 0400, map->debugfs,
  272. map, &regmap_map_fops);
  273. debugfs_create_file("access", 0400, map->debugfs,
  274. map, &regmap_access_fops);
  275. }
  276. if (map->cache_type) {
  277. debugfs_create_bool("cache_only", 0400, map->debugfs,
  278. &map->cache_only);
  279. debugfs_create_bool("cache_dirty", 0400, map->debugfs,
  280. &map->cache_dirty);
  281. debugfs_create_bool("cache_bypass", 0400, map->debugfs,
  282. &map->cache_bypass);
  283. }
  284. next = rb_first(&map->range_tree);
  285. while (next) {
  286. range_node = rb_entry(next, struct regmap_range_node, node);
  287. if (range_node->name)
  288. debugfs_create_file(range_node->name, 0400,
  289. map->debugfs, range_node,
  290. &regmap_range_fops);
  291. next = rb_next(&range_node->node);
  292. }
  293. }
  294. void regmap_debugfs_exit(struct regmap *map)
  295. {
  296. debugfs_remove_recursive(map->debugfs);
  297. kfree(map->debugfs_name);
  298. }
  299. void regmap_debugfs_initcall(void)
  300. {
  301. regmap_debugfs_root = debugfs_create_dir("regmap", NULL);
  302. if (!regmap_debugfs_root) {
  303. pr_warn("regmap: Failed to create debugfs root\n");
  304. return;
  305. }
  306. }