2 * Register map access API - debugfs
4 * Copyright 2011 Wolfson Microelectronics plc
6 * Author: Mark Brown <broonie@opensource.wolfsonmicro.com>
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.
13 #include <linux/slab.h>
14 #include <linux/mutex.h>
15 #include <linux/debugfs.h>
16 #include <linux/uaccess.h>
17 #include <linux/device.h>
21 static struct dentry *regmap_debugfs_root;
23 /* Calculate the length of a fixed format */
24 static size_t regmap_calc_reg_len(int max_val, char *buf, size_t buf_size)
26 snprintf(buf, buf_size, "%x", max_val);
30 static ssize_t regmap_name_read_file(struct file *file,
31 char __user *user_buf, size_t count,
34 struct regmap *map = file->private_data;
38 buf = kmalloc(PAGE_SIZE, GFP_KERNEL);
42 ret = snprintf(buf, PAGE_SIZE, "%s\n", map->dev->driver->name);
48 ret = simple_read_from_buffer(user_buf, count, ppos, buf, ret);
53 static const struct file_operations regmap_name_fops = {
55 .read = regmap_name_read_file,
56 .llseek = default_llseek,
60 * Work out where the start offset maps into register numbers, bearing
61 * in mind that we suppress hidden registers.
63 static unsigned int regmap_debugfs_get_dump_start(struct regmap *map,
68 struct regmap_debugfs_off_cache *c = NULL;
73 * If we don't have a cache build one so we don't have to do a
74 * linear scan each time.
76 if (list_empty(&map->debugfs_off_cache)) {
77 for (i = base; i <= map->max_register; i += map->reg_stride) {
78 /* Skip unprinted registers, closing off cache entry */
79 if (!regmap_readable(map, i) ||
80 regmap_precious(map, i)) {
83 list_add_tail(&c->list,
84 &map->debugfs_off_cache);
91 /* No cache entry? Start a new one */
93 c = kzalloc(sizeof(*c), GFP_KERNEL);
100 p += map->debugfs_tot_len;
104 /* Find the relevant block */
105 list_for_each_entry(c, &map->debugfs_off_cache, list) {
106 if (from >= c->min && from <= c->max) {
118 static ssize_t regmap_read_debugfs(struct regmap *map, unsigned int from,
119 unsigned int to, char __user *user_buf,
120 size_t count, loff_t *ppos)
127 unsigned int val, start_reg;
129 if (*ppos < 0 || !count)
132 buf = kmalloc(count, GFP_KERNEL);
136 /* Calculate the length of a fixed format */
137 if (!map->debugfs_tot_len) {
138 map->debugfs_reg_len = regmap_calc_reg_len(map->max_register,
140 map->debugfs_val_len = 2 * map->format.val_bytes;
141 map->debugfs_tot_len = map->debugfs_reg_len +
142 map->debugfs_val_len + 3; /* : \n */
145 /* Work out which register we're starting at */
146 start_reg = regmap_debugfs_get_dump_start(map, from, *ppos, &p);
148 for (i = start_reg; i <= to; i += map->reg_stride) {
149 if (!regmap_readable(map, i))
152 if (regmap_precious(map, i))
155 /* If we're in the region the user is trying to read */
157 /* ...but not beyond it */
158 if (buf_pos + 1 + map->debugfs_tot_len >= count)
161 /* Format the register */
162 snprintf(buf + buf_pos, count - buf_pos, "%.*x: ",
163 map->debugfs_reg_len, i - from);
164 buf_pos += map->debugfs_reg_len + 2;
166 /* Format the value, write all X if we can't read */
167 ret = regmap_read(map, i, &val);
169 snprintf(buf + buf_pos, count - buf_pos,
170 "%.*x", map->debugfs_val_len, val);
172 memset(buf + buf_pos, 'X',
173 map->debugfs_val_len);
174 buf_pos += 2 * map->format.val_bytes;
176 buf[buf_pos++] = '\n';
178 p += map->debugfs_tot_len;
183 if (copy_to_user(user_buf, buf, buf_pos)) {
195 static ssize_t regmap_map_read_file(struct file *file, char __user *user_buf,
196 size_t count, loff_t *ppos)
198 struct regmap *map = file->private_data;
200 return regmap_read_debugfs(map, 0, map->max_register, user_buf,
204 #undef REGMAP_ALLOW_WRITE_DEBUGFS
205 #ifdef REGMAP_ALLOW_WRITE_DEBUGFS
207 * This can be dangerous especially when we have clients such as
208 * PMICs, therefore don't provide any real compile time configuration option
209 * for this feature, people who want to use this will need to modify
210 * the source code directly.
212 static ssize_t regmap_map_write_file(struct file *file,
213 const char __user *user_buf,
214 size_t count, loff_t *ppos)
219 unsigned long reg, value;
220 struct regmap *map = file->private_data;
222 buf_size = min(count, (sizeof(buf)-1));
223 if (copy_from_user(buf, user_buf, buf_size))
227 while (*start == ' ')
229 reg = simple_strtoul(start, &start, 16);
230 while (*start == ' ')
232 if (strict_strtoul(start, 16, &value))
235 /* Userspace has been fiddling around behind the kernel's back */
236 add_taint(TAINT_USER);
238 regmap_write(map, reg, value);
242 #define regmap_map_write_file NULL
245 static const struct file_operations regmap_map_fops = {
247 .read = regmap_map_read_file,
248 .write = regmap_map_write_file,
249 .llseek = default_llseek,
252 static ssize_t regmap_range_read_file(struct file *file, char __user *user_buf,
253 size_t count, loff_t *ppos)
255 struct regmap_range_node *range = file->private_data;
256 struct regmap *map = range->map;
258 return regmap_read_debugfs(map, range->range_min, range->range_max,
259 user_buf, count, ppos);
262 static const struct file_operations regmap_range_fops = {
264 .read = regmap_range_read_file,
265 .llseek = default_llseek,
268 static ssize_t regmap_access_read_file(struct file *file,
269 char __user *user_buf, size_t count,
272 int reg_len, tot_len;
277 struct regmap *map = file->private_data;
280 if (*ppos < 0 || !count)
283 buf = kmalloc(count, GFP_KERNEL);
287 /* Calculate the length of a fixed format */
288 reg_len = regmap_calc_reg_len(map->max_register, buf, count);
289 tot_len = reg_len + 10; /* ': R W V P\n' */
291 for (i = 0; i <= map->max_register; i += map->reg_stride) {
292 /* Ignore registers which are neither readable nor writable */
293 if (!regmap_readable(map, i) && !regmap_writeable(map, i))
296 /* If we're in the region the user is trying to read */
298 /* ...but not beyond it */
299 if (buf_pos >= count - 1 - tot_len)
302 /* Format the register */
303 snprintf(buf + buf_pos, count - buf_pos,
304 "%.*x: %c %c %c %c\n",
306 regmap_readable(map, i) ? 'y' : 'n',
307 regmap_writeable(map, i) ? 'y' : 'n',
308 regmap_volatile(map, i) ? 'y' : 'n',
309 regmap_precious(map, i) ? 'y' : 'n');
318 if (copy_to_user(user_buf, buf, buf_pos)) {
330 static const struct file_operations regmap_access_fops = {
332 .read = regmap_access_read_file,
333 .llseek = default_llseek,
336 void regmap_debugfs_init(struct regmap *map, const char *name)
338 struct rb_node *next;
339 struct regmap_range_node *range_node;
341 INIT_LIST_HEAD(&map->debugfs_off_cache);
344 map->debugfs_name = kasprintf(GFP_KERNEL, "%s-%s",
345 dev_name(map->dev), name);
346 name = map->debugfs_name;
348 name = dev_name(map->dev);
351 map->debugfs = debugfs_create_dir(name, regmap_debugfs_root);
353 dev_warn(map->dev, "Failed to create debugfs directory\n");
357 debugfs_create_file("name", 0400, map->debugfs,
358 map, ®map_name_fops);
360 if (map->max_register) {
361 debugfs_create_file("registers", 0400, map->debugfs,
362 map, ®map_map_fops);
363 debugfs_create_file("access", 0400, map->debugfs,
364 map, ®map_access_fops);
367 if (map->cache_type) {
368 debugfs_create_bool("cache_only", 0400, map->debugfs,
370 debugfs_create_bool("cache_dirty", 0400, map->debugfs,
372 debugfs_create_bool("cache_bypass", 0400, map->debugfs,
376 next = rb_first(&map->range_tree);
378 range_node = rb_entry(next, struct regmap_range_node, node);
380 if (range_node->name)
381 debugfs_create_file(range_node->name, 0400,
382 map->debugfs, range_node,
385 next = rb_next(&range_node->node);
389 void regmap_debugfs_exit(struct regmap *map)
391 struct regmap_debugfs_off_cache *c;
393 debugfs_remove_recursive(map->debugfs);
394 while (!list_empty(&map->debugfs_off_cache)) {
395 c = list_first_entry(&map->debugfs_off_cache,
396 struct regmap_debugfs_off_cache,
401 kfree(map->debugfs_name);
404 void regmap_debugfs_initcall(void)
406 regmap_debugfs_root = debugfs_create_dir("regmap", NULL);
407 if (!regmap_debugfs_root) {
408 pr_warn("regmap: Failed to create debugfs root\n");