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
;
84 unsigned int fpos_offset
;
85 unsigned int reg_offset
;
87 /* Suppress the cache if we're using a subrange */
92 * If we don't have a cache build one so we don't have to do a
93 * linear scan each time.
95 mutex_lock(&map
->cache_lock
);
97 if (list_empty(&map
->debugfs_off_cache
)) {
98 for (; i
<= map
->max_register
; i
+= map
->reg_stride
) {
99 /* Skip unprinted registers, closing off cache entry */
100 if (!regmap_readable(map
, i
) ||
101 regmap_precious(map
, i
)) {
104 c
->max_reg
= i
- map
->reg_stride
;
105 list_add_tail(&c
->list
,
106 &map
->debugfs_off_cache
);
113 /* No cache entry? Start a new one */
115 c
= kzalloc(sizeof(*c
), GFP_KERNEL
);
117 regmap_debugfs_free_dump_cache(map
);
118 mutex_unlock(&map
->cache_lock
);
125 p
+= map
->debugfs_tot_len
;
129 /* Close the last entry off if we didn't scan beyond it */
132 c
->max_reg
= i
- map
->reg_stride
;
133 list_add_tail(&c
->list
,
134 &map
->debugfs_off_cache
);
138 * This should never happen; we return above if we fail to
139 * allocate and we should never be in this code if there are
140 * no registers at all.
142 WARN_ON(list_empty(&map
->debugfs_off_cache
));
145 /* Find the relevant block:offset */
146 list_for_each_entry(c
, &map
->debugfs_off_cache
, list
) {
147 if (from
>= c
->min
&& from
<= c
->max
) {
148 fpos_offset
= from
- c
->min
;
149 reg_offset
= fpos_offset
/ map
->debugfs_tot_len
;
150 *pos
= c
->min
+ (reg_offset
* map
->debugfs_tot_len
);
151 mutex_unlock(&map
->cache_lock
);
152 return c
->base_reg
+ (reg_offset
* map
->reg_stride
);
158 mutex_unlock(&map
->cache_lock
);
163 static inline void regmap_calc_tot_len(struct regmap
*map
,
164 void *buf
, size_t count
)
166 /* Calculate the length of a fixed format */
167 if (!map
->debugfs_tot_len
) {
168 map
->debugfs_reg_len
= regmap_calc_reg_len(map
->max_register
,
170 map
->debugfs_val_len
= 2 * map
->format
.val_bytes
;
171 map
->debugfs_tot_len
= map
->debugfs_reg_len
+
172 map
->debugfs_val_len
+ 3; /* : \n */
176 static ssize_t
regmap_read_debugfs(struct regmap
*map
, unsigned int from
,
177 unsigned int to
, char __user
*user_buf
,
178 size_t count
, loff_t
*ppos
)
185 unsigned int val
, start_reg
;
187 if (*ppos
< 0 || !count
)
190 buf
= kmalloc(count
, GFP_KERNEL
);
194 regmap_calc_tot_len(map
, buf
, count
);
196 /* Work out which register we're starting at */
197 start_reg
= regmap_debugfs_get_dump_start(map
, from
, *ppos
, &p
);
199 for (i
= start_reg
; i
<= to
; i
+= map
->reg_stride
) {
200 if (!regmap_readable(map
, i
))
203 if (regmap_precious(map
, i
))
206 /* If we're in the region the user is trying to read */
208 /* ...but not beyond it */
209 if (buf_pos
+ map
->debugfs_tot_len
> count
)
212 /* Format the register */
213 snprintf(buf
+ buf_pos
, count
- buf_pos
, "%.*x: ",
214 map
->debugfs_reg_len
, i
- from
);
215 buf_pos
+= map
->debugfs_reg_len
+ 2;
217 /* Format the value, write all X if we can't read */
218 ret
= regmap_read(map
, i
, &val
);
220 snprintf(buf
+ buf_pos
, count
- buf_pos
,
221 "%.*x", map
->debugfs_val_len
, val
);
223 memset(buf
+ buf_pos
, 'X',
224 map
->debugfs_val_len
);
225 buf_pos
+= 2 * map
->format
.val_bytes
;
227 buf
[buf_pos
++] = '\n';
229 p
+= map
->debugfs_tot_len
;
234 if (copy_to_user(user_buf
, buf
, buf_pos
)) {
246 static ssize_t
regmap_map_read_file(struct file
*file
, char __user
*user_buf
,
247 size_t count
, loff_t
*ppos
)
249 struct regmap
*map
= file
->private_data
;
251 return regmap_read_debugfs(map
, 0, map
->max_register
, user_buf
,
255 #undef REGMAP_ALLOW_WRITE_DEBUGFS
256 #ifdef REGMAP_ALLOW_WRITE_DEBUGFS
258 * This can be dangerous especially when we have clients such as
259 * PMICs, therefore don't provide any real compile time configuration option
260 * for this feature, people who want to use this will need to modify
261 * the source code directly.
263 static ssize_t
regmap_map_write_file(struct file
*file
,
264 const char __user
*user_buf
,
265 size_t count
, loff_t
*ppos
)
270 unsigned long reg
, value
;
271 struct regmap
*map
= file
->private_data
;
274 buf_size
= min(count
, (sizeof(buf
)-1));
275 if (copy_from_user(buf
, user_buf
, buf_size
))
279 while (*start
== ' ')
281 reg
= simple_strtoul(start
, &start
, 16);
282 while (*start
== ' ')
284 if (kstrtoul(start
, 16, &value
))
287 /* Userspace has been fiddling around behind the kernel's back */
288 add_taint(TAINT_USER
, LOCKDEP_STILL_OK
);
290 ret
= regmap_write(map
, reg
, value
);
296 #define regmap_map_write_file NULL
299 static const struct file_operations regmap_map_fops
= {
301 .read
= regmap_map_read_file
,
302 .write
= regmap_map_write_file
,
303 .llseek
= default_llseek
,
306 static ssize_t
regmap_range_read_file(struct file
*file
, char __user
*user_buf
,
307 size_t count
, loff_t
*ppos
)
309 struct regmap_range_node
*range
= file
->private_data
;
310 struct regmap
*map
= range
->map
;
312 return regmap_read_debugfs(map
, range
->range_min
, range
->range_max
,
313 user_buf
, count
, ppos
);
316 static const struct file_operations regmap_range_fops
= {
318 .read
= regmap_range_read_file
,
319 .llseek
= default_llseek
,
322 static ssize_t
regmap_reg_ranges_read_file(struct file
*file
,
323 char __user
*user_buf
, size_t count
,
326 struct regmap
*map
= file
->private_data
;
327 struct regmap_debugfs_off_cache
*c
;
334 if (*ppos
< 0 || !count
)
337 buf
= kmalloc(count
, GFP_KERNEL
);
341 entry
= kmalloc(PAGE_SIZE
, GFP_KERNEL
);
347 /* While we are at it, build the register dump cache
348 * now so the read() operation on the `registers' file
349 * can benefit from using the cache. We do not care
350 * about the file position information that is contained
351 * in the cache, just about the actual register blocks */
352 regmap_calc_tot_len(map
, buf
, count
);
353 regmap_debugfs_get_dump_start(map
, 0, *ppos
, &p
);
355 /* Reset file pointer as the fixed-format of the `registers'
356 * file is not compatible with the `range' file */
358 mutex_lock(&map
->cache_lock
);
359 list_for_each_entry(c
, &map
->debugfs_off_cache
, list
) {
360 snprintf(entry
, PAGE_SIZE
, "%x-%x",
361 c
->base_reg
, c
->max_reg
);
363 if (buf_pos
+ 1 + strlen(entry
) > count
)
365 snprintf(buf
+ buf_pos
, count
- buf_pos
,
367 buf_pos
+= strlen(entry
);
371 p
+= strlen(entry
) + 1;
373 mutex_unlock(&map
->cache_lock
);
378 if (copy_to_user(user_buf
, buf
, buf_pos
)) {
389 static const struct file_operations regmap_reg_ranges_fops
= {
391 .read
= regmap_reg_ranges_read_file
,
392 .llseek
= default_llseek
,
395 static ssize_t
regmap_access_read_file(struct file
*file
,
396 char __user
*user_buf
, size_t count
,
399 int reg_len
, tot_len
;
404 struct regmap
*map
= file
->private_data
;
407 if (*ppos
< 0 || !count
)
410 buf
= kmalloc(count
, GFP_KERNEL
);
414 /* Calculate the length of a fixed format */
415 reg_len
= regmap_calc_reg_len(map
->max_register
, buf
, count
);
416 tot_len
= reg_len
+ 10; /* ': R W V P\n' */
418 for (i
= 0; i
<= map
->max_register
; i
+= map
->reg_stride
) {
419 /* Ignore registers which are neither readable nor writable */
420 if (!regmap_readable(map
, i
) && !regmap_writeable(map
, i
))
423 /* If we're in the region the user is trying to read */
425 /* ...but not beyond it */
426 if (buf_pos
>= count
- 1 - tot_len
)
429 /* Format the register */
430 snprintf(buf
+ buf_pos
, count
- buf_pos
,
431 "%.*x: %c %c %c %c\n",
433 regmap_readable(map
, i
) ? 'y' : 'n',
434 regmap_writeable(map
, i
) ? 'y' : 'n',
435 regmap_volatile(map
, i
) ? 'y' : 'n',
436 regmap_precious(map
, i
) ? 'y' : 'n');
445 if (copy_to_user(user_buf
, buf
, buf_pos
)) {
457 static const struct file_operations regmap_access_fops
= {
459 .read
= regmap_access_read_file
,
460 .llseek
= default_llseek
,
463 void regmap_debugfs_init(struct regmap
*map
, const char *name
)
465 struct rb_node
*next
;
466 struct regmap_range_node
*range_node
;
468 INIT_LIST_HEAD(&map
->debugfs_off_cache
);
469 mutex_init(&map
->cache_lock
);
472 map
->debugfs_name
= kasprintf(GFP_KERNEL
, "%s-%s",
473 dev_name(map
->dev
), name
);
474 name
= map
->debugfs_name
;
476 name
= dev_name(map
->dev
);
479 map
->debugfs
= debugfs_create_dir(name
, regmap_debugfs_root
);
481 dev_warn(map
->dev
, "Failed to create debugfs directory\n");
485 debugfs_create_file("name", 0400, map
->debugfs
,
486 map
, ®map_name_fops
);
488 debugfs_create_file("range", 0400, map
->debugfs
,
489 map
, ®map_reg_ranges_fops
);
491 if (map
->max_register
) {
492 debugfs_create_file("registers", 0400, map
->debugfs
,
493 map
, ®map_map_fops
);
494 debugfs_create_file("access", 0400, map
->debugfs
,
495 map
, ®map_access_fops
);
498 if (map
->cache_type
) {
499 debugfs_create_bool("cache_only", 0400, map
->debugfs
,
501 debugfs_create_bool("cache_dirty", 0400, map
->debugfs
,
503 debugfs_create_bool("cache_bypass", 0400, map
->debugfs
,
507 next
= rb_first(&map
->range_tree
);
509 range_node
= rb_entry(next
, struct regmap_range_node
, node
);
511 if (range_node
->name
)
512 debugfs_create_file(range_node
->name
, 0400,
513 map
->debugfs
, range_node
,
516 next
= rb_next(&range_node
->node
);
520 void regmap_debugfs_exit(struct regmap
*map
)
522 debugfs_remove_recursive(map
->debugfs
);
523 mutex_lock(&map
->cache_lock
);
524 regmap_debugfs_free_dump_cache(map
);
525 mutex_unlock(&map
->cache_lock
);
526 kfree(map
->debugfs_name
);
529 void regmap_debugfs_initcall(void)
531 regmap_debugfs_root
= debugfs_create_dir("regmap", NULL
);
532 if (!regmap_debugfs_root
) {
533 pr_warn("regmap: Failed to create debugfs root\n");