]>
Commit | Line | Data |
---|---|---|
28644c80 DP |
1 | /* |
2 | * Register cache access API - rbtree caching support | |
3 | * | |
4 | * Copyright 2011 Wolfson Microelectronics plc | |
5 | * | |
6 | * Author: Dimitris Papastamos <dp@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 | ||
bad2ab4b | 13 | #include <linux/debugfs.h> |
e39be3a3 | 14 | #include <linux/device.h> |
28644c80 | 15 | #include <linux/rbtree.h> |
bad2ab4b | 16 | #include <linux/seq_file.h> |
e39be3a3 | 17 | #include <linux/slab.h> |
28644c80 DP |
18 | |
19 | #include "internal.h" | |
20 | ||
21 | static int regcache_rbtree_write(struct regmap *map, unsigned int reg, | |
22 | unsigned int value); | |
462a185c | 23 | static int regcache_rbtree_exit(struct regmap *map); |
28644c80 DP |
24 | |
25 | struct regcache_rbtree_node { | |
28644c80 DP |
26 | /* block of adjacent registers */ |
27 | void *block; | |
3f4ff561 LPC |
28 | /* Which registers are present */ |
29 | long *cache_present; | |
70d383b7 JCP |
30 | /* base register handled by this block */ |
31 | unsigned int base_reg; | |
28644c80 DP |
32 | /* number of registers available in the block */ |
33 | unsigned int blklen; | |
70d383b7 JCP |
34 | /* the actual rbtree node holding this block */ |
35 | struct rb_node node; | |
28644c80 DP |
36 | } __attribute__ ((packed)); |
37 | ||
38 | struct regcache_rbtree_ctx { | |
39 | struct rb_root root; | |
40 | struct regcache_rbtree_node *cached_rbnode; | |
41 | }; | |
42 | ||
43 | static inline void regcache_rbtree_get_base_top_reg( | |
f01ee60f | 44 | struct regmap *map, |
28644c80 DP |
45 | struct regcache_rbtree_node *rbnode, |
46 | unsigned int *base, unsigned int *top) | |
47 | { | |
48 | *base = rbnode->base_reg; | |
f01ee60f | 49 | *top = rbnode->base_reg + ((rbnode->blklen - 1) * map->reg_stride); |
28644c80 DP |
50 | } |
51 | ||
879082c9 MB |
52 | static unsigned int regcache_rbtree_get_register(struct regmap *map, |
53 | struct regcache_rbtree_node *rbnode, unsigned int idx) | |
28644c80 | 54 | { |
879082c9 | 55 | return regcache_get_val(map, rbnode->block, idx); |
28644c80 DP |
56 | } |
57 | ||
879082c9 MB |
58 | static void regcache_rbtree_set_register(struct regmap *map, |
59 | struct regcache_rbtree_node *rbnode, | |
60 | unsigned int idx, unsigned int val) | |
28644c80 | 61 | { |
3f4ff561 | 62 | set_bit(idx, rbnode->cache_present); |
879082c9 | 63 | regcache_set_val(map, rbnode->block, idx, val); |
28644c80 DP |
64 | } |
65 | ||
3405addd | 66 | static struct regcache_rbtree_node *regcache_rbtree_lookup(struct regmap *map, |
879082c9 | 67 | unsigned int reg) |
28644c80 | 68 | { |
3405addd | 69 | struct regcache_rbtree_ctx *rbtree_ctx = map->cache; |
28644c80 DP |
70 | struct rb_node *node; |
71 | struct regcache_rbtree_node *rbnode; | |
72 | unsigned int base_reg, top_reg; | |
73 | ||
3405addd LPC |
74 | rbnode = rbtree_ctx->cached_rbnode; |
75 | if (rbnode) { | |
f01ee60f SW |
76 | regcache_rbtree_get_base_top_reg(map, rbnode, &base_reg, |
77 | &top_reg); | |
3405addd LPC |
78 | if (reg >= base_reg && reg <= top_reg) |
79 | return rbnode; | |
80 | } | |
81 | ||
82 | node = rbtree_ctx->root.rb_node; | |
28644c80 | 83 | while (node) { |
671a911b | 84 | rbnode = rb_entry(node, struct regcache_rbtree_node, node); |
f01ee60f SW |
85 | regcache_rbtree_get_base_top_reg(map, rbnode, &base_reg, |
86 | &top_reg); | |
3405addd LPC |
87 | if (reg >= base_reg && reg <= top_reg) { |
88 | rbtree_ctx->cached_rbnode = rbnode; | |
28644c80 | 89 | return rbnode; |
3405addd | 90 | } else if (reg > top_reg) { |
28644c80 | 91 | node = node->rb_right; |
3405addd | 92 | } else if (reg < base_reg) { |
28644c80 | 93 | node = node->rb_left; |
3405addd | 94 | } |
28644c80 DP |
95 | } |
96 | ||
97 | return NULL; | |
98 | } | |
99 | ||
f01ee60f | 100 | static int regcache_rbtree_insert(struct regmap *map, struct rb_root *root, |
28644c80 DP |
101 | struct regcache_rbtree_node *rbnode) |
102 | { | |
103 | struct rb_node **new, *parent; | |
104 | struct regcache_rbtree_node *rbnode_tmp; | |
105 | unsigned int base_reg_tmp, top_reg_tmp; | |
106 | unsigned int base_reg; | |
107 | ||
108 | parent = NULL; | |
109 | new = &root->rb_node; | |
110 | while (*new) { | |
671a911b | 111 | rbnode_tmp = rb_entry(*new, struct regcache_rbtree_node, node); |
28644c80 | 112 | /* base and top registers of the current rbnode */ |
f01ee60f | 113 | regcache_rbtree_get_base_top_reg(map, rbnode_tmp, &base_reg_tmp, |
28644c80 DP |
114 | &top_reg_tmp); |
115 | /* base register of the rbnode to be added */ | |
116 | base_reg = rbnode->base_reg; | |
117 | parent = *new; | |
118 | /* if this register has already been inserted, just return */ | |
119 | if (base_reg >= base_reg_tmp && | |
120 | base_reg <= top_reg_tmp) | |
121 | return 0; | |
122 | else if (base_reg > top_reg_tmp) | |
123 | new = &((*new)->rb_right); | |
124 | else if (base_reg < base_reg_tmp) | |
125 | new = &((*new)->rb_left); | |
126 | } | |
127 | ||
128 | /* insert the node into the rbtree */ | |
129 | rb_link_node(&rbnode->node, parent, new); | |
130 | rb_insert_color(&rbnode->node, root); | |
131 | ||
132 | return 1; | |
133 | } | |
134 | ||
bad2ab4b MB |
135 | #ifdef CONFIG_DEBUG_FS |
136 | static int rbtree_show(struct seq_file *s, void *ignored) | |
137 | { | |
138 | struct regmap *map = s->private; | |
139 | struct regcache_rbtree_ctx *rbtree_ctx = map->cache; | |
140 | struct regcache_rbtree_node *n; | |
141 | struct rb_node *node; | |
142 | unsigned int base, top; | |
a42277c7 | 143 | size_t mem_size; |
bad2ab4b MB |
144 | int nodes = 0; |
145 | int registers = 0; | |
f01ee60f | 146 | int this_registers, average; |
bad2ab4b | 147 | |
f20c783c | 148 | map->lock(map->lock_arg); |
bad2ab4b | 149 | |
a42277c7 DP |
150 | mem_size = sizeof(*rbtree_ctx); |
151 | ||
bad2ab4b MB |
152 | for (node = rb_first(&rbtree_ctx->root); node != NULL; |
153 | node = rb_next(node)) { | |
671a911b | 154 | n = rb_entry(node, struct regcache_rbtree_node, node); |
a42277c7 DP |
155 | mem_size += sizeof(*n); |
156 | mem_size += (n->blklen * map->cache_word_size); | |
3f4ff561 | 157 | mem_size += BITS_TO_LONGS(n->blklen) * sizeof(long); |
bad2ab4b | 158 | |
f01ee60f SW |
159 | regcache_rbtree_get_base_top_reg(map, n, &base, &top); |
160 | this_registers = ((top - base) / map->reg_stride) + 1; | |
161 | seq_printf(s, "%x-%x (%d)\n", base, top, this_registers); | |
bad2ab4b MB |
162 | |
163 | nodes++; | |
f01ee60f | 164 | registers += this_registers; |
bad2ab4b MB |
165 | } |
166 | ||
c04c1b9e SW |
167 | if (nodes) |
168 | average = registers / nodes; | |
169 | else | |
170 | average = 0; | |
171 | ||
a42277c7 DP |
172 | seq_printf(s, "%d nodes, %d registers, average %d registers, used %zu bytes\n", |
173 | nodes, registers, average, mem_size); | |
bad2ab4b | 174 | |
f20c783c | 175 | map->unlock(map->lock_arg); |
bad2ab4b MB |
176 | |
177 | return 0; | |
178 | } | |
179 | ||
180 | static int rbtree_open(struct inode *inode, struct file *file) | |
181 | { | |
182 | return single_open(file, rbtree_show, inode->i_private); | |
183 | } | |
184 | ||
185 | static const struct file_operations rbtree_fops = { | |
186 | .open = rbtree_open, | |
187 | .read = seq_read, | |
188 | .llseek = seq_lseek, | |
189 | .release = single_release, | |
190 | }; | |
cce585ce MB |
191 | |
192 | static void rbtree_debugfs_init(struct regmap *map) | |
193 | { | |
194 | debugfs_create_file("rbtree", 0400, map->debugfs, map, &rbtree_fops); | |
195 | } | |
bad2ab4b MB |
196 | #endif |
197 | ||
28644c80 DP |
198 | static int regcache_rbtree_init(struct regmap *map) |
199 | { | |
200 | struct regcache_rbtree_ctx *rbtree_ctx; | |
201 | int i; | |
202 | int ret; | |
203 | ||
204 | map->cache = kmalloc(sizeof *rbtree_ctx, GFP_KERNEL); | |
205 | if (!map->cache) | |
206 | return -ENOMEM; | |
207 | ||
208 | rbtree_ctx = map->cache; | |
209 | rbtree_ctx->root = RB_ROOT; | |
210 | rbtree_ctx->cached_rbnode = NULL; | |
211 | ||
212 | for (i = 0; i < map->num_reg_defaults; i++) { | |
213 | ret = regcache_rbtree_write(map, | |
214 | map->reg_defaults[i].reg, | |
215 | map->reg_defaults[i].def); | |
216 | if (ret) | |
217 | goto err; | |
218 | } | |
219 | ||
220 | return 0; | |
221 | ||
222 | err: | |
462a185c | 223 | regcache_rbtree_exit(map); |
28644c80 DP |
224 | return ret; |
225 | } | |
226 | ||
227 | static int regcache_rbtree_exit(struct regmap *map) | |
228 | { | |
229 | struct rb_node *next; | |
230 | struct regcache_rbtree_ctx *rbtree_ctx; | |
231 | struct regcache_rbtree_node *rbtree_node; | |
232 | ||
233 | /* if we've already been called then just return */ | |
234 | rbtree_ctx = map->cache; | |
235 | if (!rbtree_ctx) | |
236 | return 0; | |
237 | ||
238 | /* free up the rbtree */ | |
239 | next = rb_first(&rbtree_ctx->root); | |
240 | while (next) { | |
241 | rbtree_node = rb_entry(next, struct regcache_rbtree_node, node); | |
242 | next = rb_next(&rbtree_node->node); | |
243 | rb_erase(&rbtree_node->node, &rbtree_ctx->root); | |
3f4ff561 | 244 | kfree(rbtree_node->cache_present); |
28644c80 DP |
245 | kfree(rbtree_node->block); |
246 | kfree(rbtree_node); | |
247 | } | |
248 | ||
249 | /* release the resources */ | |
250 | kfree(map->cache); | |
251 | map->cache = NULL; | |
252 | ||
253 | return 0; | |
254 | } | |
255 | ||
256 | static int regcache_rbtree_read(struct regmap *map, | |
257 | unsigned int reg, unsigned int *value) | |
258 | { | |
28644c80 | 259 | struct regcache_rbtree_node *rbnode; |
28644c80 DP |
260 | unsigned int reg_tmp; |
261 | ||
3405addd | 262 | rbnode = regcache_rbtree_lookup(map, reg); |
28644c80 | 263 | if (rbnode) { |
f01ee60f | 264 | reg_tmp = (reg - rbnode->base_reg) / map->reg_stride; |
3f4ff561 | 265 | if (!test_bit(reg_tmp, rbnode->cache_present)) |
0c7ed856 | 266 | return -ENOENT; |
879082c9 | 267 | *value = regcache_rbtree_get_register(map, rbnode, reg_tmp); |
28644c80 | 268 | } else { |
6e6ace00 | 269 | return -ENOENT; |
28644c80 DP |
270 | } |
271 | ||
272 | return 0; | |
273 | } | |
274 | ||
275 | ||
879082c9 MB |
276 | static int regcache_rbtree_insert_to_block(struct regmap *map, |
277 | struct regcache_rbtree_node *rbnode, | |
472fdec7 LPC |
278 | unsigned int base_reg, |
279 | unsigned int top_reg, | |
280 | unsigned int reg, | |
879082c9 | 281 | unsigned int value) |
28644c80 | 282 | { |
472fdec7 LPC |
283 | unsigned int blklen; |
284 | unsigned int pos, offset; | |
3f4ff561 | 285 | unsigned long *present; |
28644c80 DP |
286 | u8 *blk; |
287 | ||
472fdec7 LPC |
288 | blklen = (top_reg - base_reg) / map->reg_stride + 1; |
289 | pos = (reg - base_reg) / map->reg_stride; | |
290 | offset = (rbnode->base_reg - base_reg) / map->reg_stride; | |
291 | ||
28644c80 | 292 | blk = krealloc(rbnode->block, |
472fdec7 | 293 | blklen * map->cache_word_size, |
879082c9 | 294 | GFP_KERNEL); |
28644c80 DP |
295 | if (!blk) |
296 | return -ENOMEM; | |
297 | ||
8ef9724b GR |
298 | if (BITS_TO_LONGS(blklen) > BITS_TO_LONGS(rbnode->blklen)) { |
299 | present = krealloc(rbnode->cache_present, | |
300 | BITS_TO_LONGS(blklen) * sizeof(*present), | |
301 | GFP_KERNEL); | |
302 | if (!present) { | |
303 | kfree(blk); | |
304 | return -ENOMEM; | |
305 | } | |
306 | ||
307 | memset(present + BITS_TO_LONGS(rbnode->blklen), 0, | |
308 | (BITS_TO_LONGS(blklen) - BITS_TO_LONGS(rbnode->blklen)) | |
309 | * sizeof(*present)); | |
310 | } else { | |
311 | present = rbnode->cache_present; | |
3f4ff561 LPC |
312 | } |
313 | ||
28644c80 | 314 | /* insert the register value in the correct place in the rbnode block */ |
3f4ff561 | 315 | if (pos == 0) { |
472fdec7 LPC |
316 | memmove(blk + offset * map->cache_word_size, |
317 | blk, rbnode->blklen * map->cache_word_size); | |
328f494d | 318 | bitmap_shift_left(present, present, offset, blklen); |
3f4ff561 | 319 | } |
28644c80 DP |
320 | |
321 | /* update the rbnode block, its size and the base register */ | |
322 | rbnode->block = blk; | |
472fdec7 LPC |
323 | rbnode->blklen = blklen; |
324 | rbnode->base_reg = base_reg; | |
3f4ff561 | 325 | rbnode->cache_present = present; |
28644c80 | 326 | |
879082c9 | 327 | regcache_rbtree_set_register(map, rbnode, pos, value); |
28644c80 DP |
328 | return 0; |
329 | } | |
330 | ||
0186645d MB |
331 | static struct regcache_rbtree_node * |
332 | regcache_rbtree_node_alloc(struct regmap *map, unsigned int reg) | |
333 | { | |
334 | struct regcache_rbtree_node *rbnode; | |
7278af5f MB |
335 | const struct regmap_range *range; |
336 | int i; | |
0186645d MB |
337 | |
338 | rbnode = kzalloc(sizeof(*rbnode), GFP_KERNEL); | |
339 | if (!rbnode) | |
340 | return NULL; | |
341 | ||
7278af5f MB |
342 | /* If there is a read table then use it to guess at an allocation */ |
343 | if (map->rd_table) { | |
344 | for (i = 0; i < map->rd_table->n_yes_ranges; i++) { | |
345 | if (regmap_reg_in_range(reg, | |
346 | &map->rd_table->yes_ranges[i])) | |
347 | break; | |
348 | } | |
349 | ||
350 | if (i != map->rd_table->n_yes_ranges) { | |
351 | range = &map->rd_table->yes_ranges[i]; | |
b6752123 LPC |
352 | rbnode->blklen = (range->range_max - range->range_min) / |
353 | map->reg_stride + 1; | |
7278af5f MB |
354 | rbnode->base_reg = range->range_min; |
355 | } | |
356 | } | |
357 | ||
358 | if (!rbnode->blklen) { | |
4e67fb5f | 359 | rbnode->blklen = 1; |
7278af5f MB |
360 | rbnode->base_reg = reg; |
361 | } | |
362 | ||
549e08a0 | 363 | rbnode->block = kmalloc_array(rbnode->blklen, map->cache_word_size, |
364 | GFP_KERNEL); | |
3f4ff561 LPC |
365 | if (!rbnode->block) |
366 | goto err_free; | |
367 | ||
eeda1bd6 | 368 | rbnode->cache_present = kcalloc(BITS_TO_LONGS(rbnode->blklen), |
369 | sizeof(*rbnode->cache_present), | |
370 | GFP_KERNEL); | |
3f4ff561 LPC |
371 | if (!rbnode->cache_present) |
372 | goto err_free_block; | |
0186645d MB |
373 | |
374 | return rbnode; | |
3f4ff561 LPC |
375 | |
376 | err_free_block: | |
377 | kfree(rbnode->block); | |
378 | err_free: | |
379 | kfree(rbnode); | |
380 | return NULL; | |
0186645d MB |
381 | } |
382 | ||
28644c80 DP |
383 | static int regcache_rbtree_write(struct regmap *map, unsigned int reg, |
384 | unsigned int value) | |
385 | { | |
386 | struct regcache_rbtree_ctx *rbtree_ctx; | |
387 | struct regcache_rbtree_node *rbnode, *rbnode_tmp; | |
388 | struct rb_node *node; | |
28644c80 | 389 | unsigned int reg_tmp; |
28644c80 DP |
390 | int ret; |
391 | ||
392 | rbtree_ctx = map->cache; | |
0c7ed856 | 393 | |
28644c80 DP |
394 | /* if we can't locate it in the cached rbnode we'll have |
395 | * to traverse the rbtree looking for it. | |
396 | */ | |
3405addd | 397 | rbnode = regcache_rbtree_lookup(map, reg); |
28644c80 | 398 | if (rbnode) { |
f01ee60f | 399 | reg_tmp = (reg - rbnode->base_reg) / map->reg_stride; |
879082c9 | 400 | regcache_rbtree_set_register(map, rbnode, reg_tmp, value); |
28644c80 | 401 | } else { |
472fdec7 LPC |
402 | unsigned int base_reg, top_reg; |
403 | unsigned int new_base_reg, new_top_reg; | |
404 | unsigned int min, max; | |
405 | unsigned int max_dist; | |
1bc8da4e | 406 | unsigned int dist, best_dist = UINT_MAX; |
472fdec7 LPC |
407 | |
408 | max_dist = map->reg_stride * sizeof(*rbnode_tmp) / | |
409 | map->cache_word_size; | |
410 | if (reg < max_dist) | |
411 | min = 0; | |
412 | else | |
413 | min = reg - max_dist; | |
414 | max = reg + max_dist; | |
415 | ||
28644c80 | 416 | /* look for an adjacent register to the one we are about to add */ |
6399aea6 NO |
417 | node = rbtree_ctx->root.rb_node; |
418 | while (node) { | |
f01ee60f SW |
419 | rbnode_tmp = rb_entry(node, struct regcache_rbtree_node, |
420 | node); | |
194c753a LPC |
421 | |
422 | regcache_rbtree_get_base_top_reg(map, rbnode_tmp, | |
423 | &base_reg, &top_reg); | |
424 | ||
472fdec7 | 425 | if (base_reg <= max && top_reg >= min) { |
1bc8da4e LPC |
426 | if (reg < base_reg) |
427 | dist = base_reg - reg; | |
428 | else if (reg > top_reg) | |
429 | dist = reg - top_reg; | |
6399aea6 | 430 | else |
1bc8da4e LPC |
431 | dist = 0; |
432 | if (dist < best_dist) { | |
433 | rbnode = rbnode_tmp; | |
434 | best_dist = dist; | |
435 | new_base_reg = min(reg, base_reg); | |
436 | new_top_reg = max(reg, top_reg); | |
437 | } | |
28644c80 | 438 | } |
194c753a | 439 | |
1bc8da4e LPC |
440 | /* |
441 | * Keep looking, we want to choose the closest block, | |
442 | * otherwise we might end up creating overlapping | |
443 | * blocks, which breaks the rbtree. | |
444 | */ | |
445 | if (reg < base_reg) | |
446 | node = node->rb_left; | |
447 | else if (reg > top_reg) | |
448 | node = node->rb_right; | |
449 | else | |
450 | break; | |
451 | } | |
452 | ||
453 | if (rbnode) { | |
454 | ret = regcache_rbtree_insert_to_block(map, rbnode, | |
472fdec7 LPC |
455 | new_base_reg, |
456 | new_top_reg, reg, | |
457 | value); | |
194c753a LPC |
458 | if (ret) |
459 | return ret; | |
1bc8da4e | 460 | rbtree_ctx->cached_rbnode = rbnode; |
194c753a | 461 | return 0; |
28644c80 | 462 | } |
0186645d MB |
463 | |
464 | /* We did not manage to find a place to insert it in | |
465 | * an existing block so create a new rbnode. | |
28644c80 | 466 | */ |
0186645d | 467 | rbnode = regcache_rbtree_node_alloc(map, reg); |
28644c80 DP |
468 | if (!rbnode) |
469 | return -ENOMEM; | |
0186645d MB |
470 | regcache_rbtree_set_register(map, rbnode, |
471 | reg - rbnode->base_reg, value); | |
f01ee60f | 472 | regcache_rbtree_insert(map, &rbtree_ctx->root, rbnode); |
28644c80 DP |
473 | rbtree_ctx->cached_rbnode = rbnode; |
474 | } | |
475 | ||
476 | return 0; | |
477 | } | |
478 | ||
ac8d91c8 MB |
479 | static int regcache_rbtree_sync(struct regmap *map, unsigned int min, |
480 | unsigned int max) | |
28644c80 DP |
481 | { |
482 | struct regcache_rbtree_ctx *rbtree_ctx; | |
483 | struct rb_node *node; | |
484 | struct regcache_rbtree_node *rbnode; | |
b6752123 LPC |
485 | unsigned int base_reg, top_reg; |
486 | unsigned int start, end; | |
28644c80 | 487 | int ret; |
28644c80 DP |
488 | |
489 | rbtree_ctx = map->cache; | |
490 | for (node = rb_first(&rbtree_ctx->root); node; node = rb_next(node)) { | |
491 | rbnode = rb_entry(node, struct regcache_rbtree_node, node); | |
ac8d91c8 | 492 | |
b6752123 LPC |
493 | regcache_rbtree_get_base_top_reg(map, rbnode, &base_reg, |
494 | &top_reg); | |
495 | if (base_reg > max) | |
ac8d91c8 | 496 | break; |
b6752123 | 497 | if (top_reg < min) |
ac8d91c8 MB |
498 | continue; |
499 | ||
b6752123 LPC |
500 | if (min > base_reg) |
501 | start = (min - base_reg) / map->reg_stride; | |
ac8d91c8 | 502 | else |
b6752123 | 503 | start = 0; |
ac8d91c8 | 504 | |
b6752123 LPC |
505 | if (max < top_reg) |
506 | end = (max - base_reg) / map->reg_stride + 1; | |
ac8d91c8 MB |
507 | else |
508 | end = rbnode->blklen; | |
509 | ||
3f4ff561 LPC |
510 | ret = regcache_sync_block(map, rbnode->block, |
511 | rbnode->cache_present, | |
512 | rbnode->base_reg, start, end); | |
f8bd822c MB |
513 | if (ret != 0) |
514 | return ret; | |
28644c80 DP |
515 | } |
516 | ||
f8bd822c | 517 | return regmap_async_complete(map); |
28644c80 DP |
518 | } |
519 | ||
3f4ff561 LPC |
520 | static int regcache_rbtree_drop(struct regmap *map, unsigned int min, |
521 | unsigned int max) | |
522 | { | |
523 | struct regcache_rbtree_ctx *rbtree_ctx; | |
524 | struct regcache_rbtree_node *rbnode; | |
525 | struct rb_node *node; | |
526 | unsigned int base_reg, top_reg; | |
527 | unsigned int start, end; | |
528 | ||
529 | rbtree_ctx = map->cache; | |
530 | for (node = rb_first(&rbtree_ctx->root); node; node = rb_next(node)) { | |
531 | rbnode = rb_entry(node, struct regcache_rbtree_node, node); | |
532 | ||
533 | regcache_rbtree_get_base_top_reg(map, rbnode, &base_reg, | |
534 | &top_reg); | |
535 | if (base_reg > max) | |
536 | break; | |
537 | if (top_reg < min) | |
538 | continue; | |
539 | ||
540 | if (min > base_reg) | |
541 | start = (min - base_reg) / map->reg_stride; | |
542 | else | |
543 | start = 0; | |
544 | ||
545 | if (max < top_reg) | |
546 | end = (max - base_reg) / map->reg_stride + 1; | |
547 | else | |
548 | end = rbnode->blklen; | |
549 | ||
550 | bitmap_clear(rbnode->cache_present, start, end - start); | |
551 | } | |
552 | ||
553 | return 0; | |
554 | } | |
555 | ||
28644c80 DP |
556 | struct regcache_ops regcache_rbtree_ops = { |
557 | .type = REGCACHE_RBTREE, | |
558 | .name = "rbtree", | |
559 | .init = regcache_rbtree_init, | |
560 | .exit = regcache_rbtree_exit, | |
5e0cbe78 LPC |
561 | #ifdef CONFIG_DEBUG_FS |
562 | .debugfs_init = rbtree_debugfs_init, | |
563 | #endif | |
28644c80 DP |
564 | .read = regcache_rbtree_read, |
565 | .write = regcache_rbtree_write, | |
3f4ff561 LPC |
566 | .sync = regcache_rbtree_sync, |
567 | .drop = regcache_rbtree_drop, | |
28644c80 | 568 | }; |