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,
59 static void regmap_debugfs_free_dump_cache(struct regmap *map)
61 struct regmap_debugfs_off_cache *c;
63 while (!list_empty(&map->debugfs_off_cache)) {
64 c = list_first_entry(&map->debugfs_off_cache,
65 struct regmap_debugfs_off_cache,
73 * Work out where the start offset maps into register numbers, bearing
74 * in mind that we suppress hidden registers.
76 static unsigned int regmap_debugfs_get_dump_start(struct regmap *map,
81 struct regmap_debugfs_off_cache *c = NULL;
86 * If we don't have a cache build one so we don't have to do a
87 * linear scan each time.
89 if (list_empty(&map->debugfs_off_cache)) {
90 for (i = base; i <= map->max_register; i += map->reg_stride) {
91 /* Skip unprinted registers, closing off cache entry */
92 if (!regmap_readable(map, i) ||
93 regmap_precious(map, i)) {
96 list_add_tail(&c->list,
97 &map->debugfs_off_cache);
104 /* No cache entry? Start a new one */
106 c = kzalloc(sizeof(*c), GFP_KERNEL);
108 regmap_debugfs_free_dump_cache(map);
115 p += map->debugfs_tot_len;
119 /* Close the last entry off if we didn't scan beyond it */
122 list_add_tail(&c->list,
123 &map->debugfs_off_cache);
127 * This should never happen; we return above if we fail to
128 * allocate and we should never be in this code if there are
129 * no registers at all.
131 if (list_empty(&map->debugfs_off_cache)) {
132 WARN_ON(list_empty(&map->debugfs_off_cache));
136 /* Find the relevant block */
137 list_for_each_entry(c, &map->debugfs_off_cache, list) {
138 if (from >= c->min && from <= c->max) {
150 static ssize_t regmap_read_debugfs(struct regmap *map, unsigned int from,
151 unsigned int to, char __user *user_buf,
152 size_t count, loff_t *ppos)
159 unsigned int val, start_reg;
161 if (*ppos < 0 || !count)
164 buf = kmalloc(count, GFP_KERNEL);
168 /* Calculate the length of a fixed format */
169 if (!map->debugfs_tot_len) {
170 map->debugfs_reg_len = regmap_calc_reg_len(map->max_register,
172 map->debugfs_val_len = 2 * map->format.val_bytes;
173 map->debugfs_tot_len = map->debugfs_reg_len +
174 map->debugfs_val_len + 3; /* : \n */
177 /* Work out which register we're starting at */
178 start_reg = regmap_debugfs_get_dump_start(map, from, *ppos, &p);
180 for (i = start_reg; i <= to; i += map->reg_stride) {
181 if (!regmap_readable(map, i))
184 if (regmap_precious(map, i))
187 /* If we're in the region the user is trying to read */
189 /* ...but not beyond it */
190 if (buf_pos + 1 + map->debugfs_tot_len >= count)
193 /* Format the register */
194 snprintf(buf + buf_pos, count - buf_pos, "%.*x: ",
195 map->debugfs_reg_len, i - from);
196 buf_pos += map->debugfs_reg_len + 2;
198 /* Format the value, write all X if we can't read */
199 ret = regmap_read(map, i, &val);
201 snprintf(buf + buf_pos, count - buf_pos,
202 "%.*x", map->debugfs_val_len, val);
204 memset(buf + buf_pos, 'X',
205 map->debugfs_val_len);
206 buf_pos += 2 * map->format.val_bytes;
208 buf[buf_pos++] = '\n';
210 p += map->debugfs_tot_len;
215 if (copy_to_user(user_buf, buf, buf_pos)) {
227 static ssize_t regmap_map_read_file(struct file *file, char __user *user_buf,
228 size_t count, loff_t *ppos)
230 struct regmap *map = file->private_data;
232 return regmap_read_debugfs(map, 0, map->max_register, user_buf,
236 #undef REGMAP_ALLOW_WRITE_DEBUGFS
237 #ifdef REGMAP_ALLOW_WRITE_DEBUGFS
239 * This can be dangerous especially when we have clients such as
240 * PMICs, therefore don't provide any real compile time configuration option
241 * for this feature, people who want to use this will need to modify
242 * the source code directly.
244 static ssize_t regmap_map_write_file(struct file *file,
245 const char __user *user_buf,
246 size_t count, loff_t *ppos)
251 unsigned long reg, value;
252 struct regmap *map = file->private_data;
254 buf_size = min(count, (sizeof(buf)-1));
255 if (copy_from_user(buf, user_buf, buf_size))
259 while (*start == ' ')
261 reg = simple_strtoul(start, &start, 16);
262 while (*start == ' ')
264 if (strict_strtoul(start, 16, &value))
267 /* Userspace has been fiddling around behind the kernel's back */
268 add_taint(TAINT_USER);
270 regmap_write(map, reg, value);
274 #define regmap_map_write_file NULL
277 static const struct file_operations regmap_map_fops = {
279 .read = regmap_map_read_file,
280 .write = regmap_map_write_file,
281 .llseek = default_llseek,
284 static ssize_t regmap_range_read_file(struct file *file, char __user *user_buf,
285 size_t count, loff_t *ppos)
287 struct regmap_range_node *range = file->private_data;
288 struct regmap *map = range->map;
290 return regmap_read_debugfs(map, range->range_min, range->range_max,
291 user_buf, count, ppos);
294 static const struct file_operations regmap_range_fops = {
296 .read = regmap_range_read_file,
297 .llseek = default_llseek,
300 static ssize_t regmap_access_read_file(struct file *file,
301 char __user *user_buf, size_t count,
304 int reg_len, tot_len;
309 struct regmap *map = file->private_data;
312 if (*ppos < 0 || !count)
315 buf = kmalloc(count, GFP_KERNEL);
319 /* Calculate the length of a fixed format */
320 reg_len = regmap_calc_reg_len(map->max_register, buf, count);
321 tot_len = reg_len + 10; /* ': R W V P\n' */
323 for (i = 0; i <= map->max_register; i += map->reg_stride) {
324 /* Ignore registers which are neither readable nor writable */
325 if (!regmap_readable(map, i) && !regmap_writeable(map, i))
328 /* If we're in the region the user is trying to read */
330 /* ...but not beyond it */
331 if (buf_pos >= count - 1 - tot_len)
334 /* Format the register */
335 snprintf(buf + buf_pos, count - buf_pos,
336 "%.*x: %c %c %c %c\n",
338 regmap_readable(map, i) ? 'y' : 'n',
339 regmap_writeable(map, i) ? 'y' : 'n',
340 regmap_volatile(map, i) ? 'y' : 'n',
341 regmap_precious(map, i) ? 'y' : 'n');
350 if (copy_to_user(user_buf, buf, buf_pos)) {
362 static const struct file_operations regmap_access_fops = {
364 .read = regmap_access_read_file,
365 .llseek = default_llseek,
368 void regmap_debugfs_init(struct regmap *map, const char *name)
370 struct rb_node *next;
371 struct regmap_range_node *range_node;
373 INIT_LIST_HEAD(&map->debugfs_off_cache);
376 map->debugfs_name = kasprintf(GFP_KERNEL, "%s-%s",
377 dev_name(map->dev), name);
378 name = map->debugfs_name;
380 name = dev_name(map->dev);
383 map->debugfs = debugfs_create_dir(name, regmap_debugfs_root);
385 dev_warn(map->dev, "Failed to create debugfs directory\n");
389 debugfs_create_file("name", 0400, map->debugfs,
390 map, ®map_name_fops);
392 if (map->max_register) {
393 debugfs_create_file("registers", 0400, map->debugfs,
394 map, ®map_map_fops);
395 debugfs_create_file("access", 0400, map->debugfs,
396 map, ®map_access_fops);
399 if (map->cache_type) {
400 debugfs_create_bool("cache_only", 0400, map->debugfs,
402 debugfs_create_bool("cache_dirty", 0400, map->debugfs,
404 debugfs_create_bool("cache_bypass", 0400, map->debugfs,
408 next = rb_first(&map->range_tree);
410 range_node = rb_entry(next, struct regmap_range_node, node);
412 if (range_node->name)
413 debugfs_create_file(range_node->name, 0400,
414 map->debugfs, range_node,
417 next = rb_next(&range_node->node);
421 void regmap_debugfs_exit(struct regmap *map)
423 debugfs_remove_recursive(map->debugfs);
424 regmap_debugfs_free_dump_cache(map);
425 kfree(map->debugfs_name);
428 void regmap_debugfs_initcall(void)
430 regmap_debugfs_root = debugfs_create_dir("regmap", NULL);
431 if (!regmap_debugfs_root) {
432 pr_warn("regmap: Failed to create debugfs root\n");