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 WARN_ON(list_empty(&map
->debugfs_off_cache
));
134 /* Find the relevant block */
135 list_for_each_entry(c
, &map
->debugfs_off_cache
, list
) {
136 if (from
>= c
->min
&& from
<= c
->max
) {
148 static ssize_t
regmap_read_debugfs(struct regmap
*map
, unsigned int from
,
149 unsigned int to
, char __user
*user_buf
,
150 size_t count
, loff_t
*ppos
)
157 unsigned int val
, start_reg
;
159 if (*ppos
< 0 || !count
)
162 buf
= kmalloc(count
, GFP_KERNEL
);
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 */
175 /* Work out which register we're starting at */
176 start_reg
= regmap_debugfs_get_dump_start(map
, from
, *ppos
, &p
);
178 for (i
= start_reg
; i
<= to
; i
+= map
->reg_stride
) {
179 if (!regmap_readable(map
, i
))
182 if (regmap_precious(map
, i
))
185 /* If we're in the region the user is trying to read */
187 /* ...but not beyond it */
188 if (buf_pos
+ 1 + map
->debugfs_tot_len
>= count
)
191 /* Format the register */
192 snprintf(buf
+ buf_pos
, count
- buf_pos
, "%.*x: ",
193 map
->debugfs_reg_len
, i
- from
);
194 buf_pos
+= map
->debugfs_reg_len
+ 2;
196 /* Format the value, write all X if we can't read */
197 ret
= regmap_read(map
, i
, &val
);
199 snprintf(buf
+ buf_pos
, count
- buf_pos
,
200 "%.*x", map
->debugfs_val_len
, val
);
202 memset(buf
+ buf_pos
, 'X',
203 map
->debugfs_val_len
);
204 buf_pos
+= 2 * map
->format
.val_bytes
;
206 buf
[buf_pos
++] = '\n';
208 p
+= map
->debugfs_tot_len
;
213 if (copy_to_user(user_buf
, buf
, buf_pos
)) {
225 static ssize_t
regmap_map_read_file(struct file
*file
, char __user
*user_buf
,
226 size_t count
, loff_t
*ppos
)
228 struct regmap
*map
= file
->private_data
;
230 return regmap_read_debugfs(map
, 0, map
->max_register
, user_buf
,
234 #undef REGMAP_ALLOW_WRITE_DEBUGFS
235 #ifdef REGMAP_ALLOW_WRITE_DEBUGFS
237 * This can be dangerous especially when we have clients such as
238 * PMICs, therefore don't provide any real compile time configuration option
239 * for this feature, people who want to use this will need to modify
240 * the source code directly.
242 static ssize_t
regmap_map_write_file(struct file
*file
,
243 const char __user
*user_buf
,
244 size_t count
, loff_t
*ppos
)
249 unsigned long reg
, value
;
250 struct regmap
*map
= file
->private_data
;
252 buf_size
= min(count
, (sizeof(buf
)-1));
253 if (copy_from_user(buf
, user_buf
, buf_size
))
257 while (*start
== ' ')
259 reg
= simple_strtoul(start
, &start
, 16);
260 while (*start
== ' ')
262 if (strict_strtoul(start
, 16, &value
))
265 /* Userspace has been fiddling around behind the kernel's back */
266 add_taint(TAINT_USER
);
268 regmap_write(map
, reg
, value
);
272 #define regmap_map_write_file NULL
275 static const struct file_operations regmap_map_fops
= {
277 .read
= regmap_map_read_file
,
278 .write
= regmap_map_write_file
,
279 .llseek
= default_llseek
,
282 static ssize_t
regmap_range_read_file(struct file
*file
, char __user
*user_buf
,
283 size_t count
, loff_t
*ppos
)
285 struct regmap_range_node
*range
= file
->private_data
;
286 struct regmap
*map
= range
->map
;
288 return regmap_read_debugfs(map
, range
->range_min
, range
->range_max
,
289 user_buf
, count
, ppos
);
292 static const struct file_operations regmap_range_fops
= {
294 .read
= regmap_range_read_file
,
295 .llseek
= default_llseek
,
298 static ssize_t
regmap_access_read_file(struct file
*file
,
299 char __user
*user_buf
, size_t count
,
302 int reg_len
, tot_len
;
307 struct regmap
*map
= file
->private_data
;
310 if (*ppos
< 0 || !count
)
313 buf
= kmalloc(count
, GFP_KERNEL
);
317 /* Calculate the length of a fixed format */
318 reg_len
= regmap_calc_reg_len(map
->max_register
, buf
, count
);
319 tot_len
= reg_len
+ 10; /* ': R W V P\n' */
321 for (i
= 0; i
<= map
->max_register
; i
+= map
->reg_stride
) {
322 /* Ignore registers which are neither readable nor writable */
323 if (!regmap_readable(map
, i
) && !regmap_writeable(map
, i
))
326 /* If we're in the region the user is trying to read */
328 /* ...but not beyond it */
329 if (buf_pos
>= count
- 1 - tot_len
)
332 /* Format the register */
333 snprintf(buf
+ buf_pos
, count
- buf_pos
,
334 "%.*x: %c %c %c %c\n",
336 regmap_readable(map
, i
) ? 'y' : 'n',
337 regmap_writeable(map
, i
) ? 'y' : 'n',
338 regmap_volatile(map
, i
) ? 'y' : 'n',
339 regmap_precious(map
, i
) ? 'y' : 'n');
348 if (copy_to_user(user_buf
, buf
, buf_pos
)) {
360 static const struct file_operations regmap_access_fops
= {
362 .read
= regmap_access_read_file
,
363 .llseek
= default_llseek
,
366 void regmap_debugfs_init(struct regmap
*map
, const char *name
)
368 struct rb_node
*next
;
369 struct regmap_range_node
*range_node
;
371 INIT_LIST_HEAD(&map
->debugfs_off_cache
);
374 map
->debugfs_name
= kasprintf(GFP_KERNEL
, "%s-%s",
375 dev_name(map
->dev
), name
);
376 name
= map
->debugfs_name
;
378 name
= dev_name(map
->dev
);
381 map
->debugfs
= debugfs_create_dir(name
, regmap_debugfs_root
);
383 dev_warn(map
->dev
, "Failed to create debugfs directory\n");
387 debugfs_create_file("name", 0400, map
->debugfs
,
388 map
, ®map_name_fops
);
390 if (map
->max_register
) {
391 debugfs_create_file("registers", 0400, map
->debugfs
,
392 map
, ®map_map_fops
);
393 debugfs_create_file("access", 0400, map
->debugfs
,
394 map
, ®map_access_fops
);
397 if (map
->cache_type
) {
398 debugfs_create_bool("cache_only", 0400, map
->debugfs
,
400 debugfs_create_bool("cache_dirty", 0400, map
->debugfs
,
402 debugfs_create_bool("cache_bypass", 0400, map
->debugfs
,
406 next
= rb_first(&map
->range_tree
);
408 range_node
= rb_entry(next
, struct regmap_range_node
, node
);
410 if (range_node
->name
)
411 debugfs_create_file(range_node
->name
, 0400,
412 map
->debugfs
, range_node
,
415 next
= rb_next(&range_node
->node
);
419 void regmap_debugfs_exit(struct regmap
*map
)
421 debugfs_remove_recursive(map
->debugfs
);
422 regmap_debugfs_free_dump_cache(map
);
423 kfree(map
->debugfs_name
);
426 void regmap_debugfs_initcall(void)
428 regmap_debugfs_root
= debugfs_create_dir("regmap", NULL
);
429 if (!regmap_debugfs_root
) {
430 pr_warn("regmap: Failed to create debugfs root\n");