Commit | Line | Data |
---|---|---|
69517000 AC |
1 | /* Caching code for GDB, the GNU debugger. |
2 | ||
28e7fd62 | 3 | Copyright (C) 1992-2013 Free Software Foundation, Inc. |
c906108c SS |
4 | |
5 | This file is part of GDB. | |
6 | ||
7 | This program is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
a9762ec7 | 9 | the Free Software Foundation; either version 3 of the License, or |
c906108c SS |
10 | (at your option) any later version. |
11 | ||
12 | This program is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
a9762ec7 | 18 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
c906108c SS |
19 | |
20 | #include "defs.h" | |
21 | #include "dcache.h" | |
22 | #include "gdbcmd.h" | |
23 | #include "gdb_string.h" | |
24 | #include "gdbcore.h" | |
4930751a | 25 | #include "target.h" |
4e5d721f | 26 | #include "inferior.h" |
25f122dc | 27 | #include "splay-tree.h" |
c906108c | 28 | |
1a532630 PP |
29 | /* Commands with a prefix of `{set,show} dcache'. */ |
30 | static struct cmd_list_element *dcache_set_list = NULL; | |
31 | static struct cmd_list_element *dcache_show_list = NULL; | |
32 | ||
29e57380 C |
33 | /* The data cache could lead to incorrect results because it doesn't |
34 | know about volatile variables, thus making it impossible to debug | |
35 | functions which use memory mapped I/O devices. Set the nocache | |
36 | memory region attribute in those cases. | |
c906108c | 37 | |
25f122dc | 38 | In general the dcache speeds up performance. Some speed improvement |
c906108c SS |
39 | comes from the actual caching mechanism, but the major gain is in |
40 | the reduction of the remote protocol overhead; instead of reading | |
41 | or writing a large area of memory in 4 byte requests, the cache | |
25f122dc DE |
42 | bundles up the requests into LINE_SIZE chunks, reducing overhead |
43 | significantly. This is most useful when accessing a large amount | |
44 | of data, such as when performing a backtrace. | |
45 | ||
46 | The cache is a splay tree along with a linked list for replacement. | |
e124be18 MS |
47 | Each block caches a LINE_SIZE area of memory. Within each line we |
48 | remember the address of the line (which must be a multiple of | |
49 | LINE_SIZE) and the actual data block. | |
25f122dc DE |
50 | |
51 | Lines are only allocated as needed, so DCACHE_SIZE really specifies the | |
52 | *maximum* number of lines in the cache. | |
53 | ||
54 | At present, the cache is write-through rather than writeback: as soon | |
55 | as data is written to the cache, it is also immediately written to | |
56 | the target. Therefore, cache lines are never "dirty". Whether a given | |
57 | line is valid or not depends on where it is stored in the dcache_struct; | |
58 | there is no per-block valid flag. */ | |
c906108c | 59 | |
29e57380 | 60 | /* NOTE: Interaction of dcache and memory region attributes |
c906108c | 61 | |
29e57380 C |
62 | As there is no requirement that memory region attributes be aligned |
63 | to or be a multiple of the dcache page size, dcache_read_line() and | |
64 | dcache_write_line() must break up the page by memory region. If a | |
65 | chunk does not have the cache attribute set, an invalid memory type | |
66 | is set, etc., then the chunk is skipped. Those chunks are handled | |
67 | in target_xfer_memory() (or target_xfer_memory_partial()). | |
c906108c | 68 | |
29e57380 C |
69 | This doesn't occur very often. The most common occurance is when |
70 | the last bit of the .text segment and the first bit of the .data | |
71 | segment fall within the same dcache page with a ro/cacheable memory | |
72 | region defined for the .text segment and a rw/non-cacheable memory | |
25f122dc | 73 | region defined for the .data segment. */ |
c906108c | 74 | |
25f122dc DE |
75 | /* The maximum number of lines stored. The total size of the cache is |
76 | equal to DCACHE_SIZE times LINE_SIZE. */ | |
1a532630 PP |
77 | #define DCACHE_DEFAULT_SIZE 4096 |
78 | static unsigned dcache_size = DCACHE_DEFAULT_SIZE; | |
c906108c | 79 | |
1a532630 | 80 | /* The default size of a cache line. Smaller values reduce the time taken to |
25f122dc DE |
81 | read a single byte and make the cache more granular, but increase |
82 | overhead and reduce the effectiveness of the cache as a prefetcher. */ | |
1a532630 PP |
83 | #define DCACHE_DEFAULT_LINE_SIZE 64 |
84 | static unsigned dcache_line_size = DCACHE_DEFAULT_LINE_SIZE; | |
c906108c SS |
85 | |
86 | /* Each cache block holds LINE_SIZE bytes of data | |
87 | starting at a multiple-of-LINE_SIZE address. */ | |
88 | ||
1a532630 PP |
89 | #define LINE_SIZE_MASK(dcache) ((dcache->line_size - 1)) |
90 | #define XFORM(dcache, x) ((x) & LINE_SIZE_MASK (dcache)) | |
91 | #define MASK(dcache, x) ((x) & ~LINE_SIZE_MASK (dcache)) | |
c906108c | 92 | |
c906108c | 93 | struct dcache_block |
25f122dc | 94 | { |
0963b4bd | 95 | /* For least-recently-allocated and free lists. */ |
6ffb2242 DE |
96 | struct dcache_block *prev; |
97 | struct dcache_block *next; | |
98 | ||
25f122dc | 99 | CORE_ADDR addr; /* address of data */ |
25f122dc | 100 | int refs; /* # hits */ |
1a532630 | 101 | gdb_byte data[1]; /* line_size bytes at given address */ |
25f122dc | 102 | }; |
29e57380 | 103 | |
c5aa993b | 104 | struct dcache_struct |
25f122dc DE |
105 | { |
106 | splay_tree tree; | |
0963b4bd | 107 | struct dcache_block *oldest; /* least-recently-allocated list. */ |
c906108c | 108 | |
6ffb2242 DE |
109 | /* The free list is maintained identically to OLDEST to simplify |
110 | the code: we only need one set of accessors. */ | |
25f122dc | 111 | struct dcache_block *freelist; |
c906108c | 112 | |
25f122dc DE |
113 | /* The number of in-use lines in the cache. */ |
114 | int size; | |
1a532630 | 115 | CORE_ADDR line_size; /* current line_size. */ |
4e5d721f DE |
116 | |
117 | /* The ptid of last inferior to use cache or null_ptid. */ | |
118 | ptid_t ptid; | |
25f122dc | 119 | }; |
c906108c | 120 | |
6ffb2242 DE |
121 | typedef void (block_func) (struct dcache_block *block, void *param); |
122 | ||
8edbea78 | 123 | static struct dcache_block *dcache_hit (DCACHE *dcache, CORE_ADDR addr); |
c906108c | 124 | |
8edbea78 | 125 | static int dcache_read_line (DCACHE *dcache, struct dcache_block *db); |
c906108c | 126 | |
8edbea78 C |
127 | static struct dcache_block *dcache_alloc (DCACHE *dcache, CORE_ADDR addr); |
128 | ||
a14ed312 | 129 | static void dcache_info (char *exp, int tty); |
c906108c | 130 | |
a14ed312 | 131 | void _initialize_dcache (void); |
c906108c | 132 | |
4e5d721f | 133 | static int dcache_enabled_p = 0; /* OBSOLETE */ |
07128da0 | 134 | |
920d2a44 AC |
135 | static void |
136 | show_dcache_enabled_p (struct ui_file *file, int from_tty, | |
137 | struct cmd_list_element *c, const char *value) | |
138 | { | |
4e5d721f | 139 | fprintf_filtered (file, _("Deprecated remotecache flag is %s.\n"), value); |
920d2a44 AC |
140 | } |
141 | ||
0963b4bd | 142 | static DCACHE *last_cache; /* Used by info dcache. */ |
c906108c | 143 | |
6ffb2242 DE |
144 | /* Add BLOCK to circular block list BLIST, behind the block at *BLIST. |
145 | *BLIST is not updated (unless it was previously NULL of course). | |
146 | This is for the least-recently-allocated list's sake: | |
147 | BLIST points to the oldest block. | |
148 | ??? This makes for poor cache usage of the free list, | |
149 | but is it measurable? */ | |
c906108c | 150 | |
6ffb2242 DE |
151 | static void |
152 | append_block (struct dcache_block **blist, struct dcache_block *block) | |
c906108c | 153 | { |
6ffb2242 DE |
154 | if (*blist) |
155 | { | |
156 | block->next = *blist; | |
157 | block->prev = (*blist)->prev; | |
158 | block->prev->next = block; | |
159 | (*blist)->prev = block; | |
160 | /* We don't update *BLIST here to maintain the invariant that for the | |
161 | least-recently-allocated list *BLIST points to the oldest block. */ | |
162 | } | |
163 | else | |
164 | { | |
165 | block->next = block; | |
166 | block->prev = block; | |
167 | *blist = block; | |
168 | } | |
169 | } | |
c906108c | 170 | |
6ffb2242 | 171 | /* Remove BLOCK from circular block list BLIST. */ |
c906108c | 172 | |
6ffb2242 DE |
173 | static void |
174 | remove_block (struct dcache_block **blist, struct dcache_block *block) | |
175 | { | |
176 | if (block->next == block) | |
177 | { | |
178 | *blist = NULL; | |
179 | } | |
180 | else | |
c906108c | 181 | { |
6ffb2242 DE |
182 | block->next->prev = block->prev; |
183 | block->prev->next = block->next; | |
184 | /* If we removed the block *BLIST points to, shift it to the next block | |
185 | to maintain the invariant that for the least-recently-allocated list | |
186 | *BLIST points to the oldest block. */ | |
187 | if (*blist == block) | |
188 | *blist = block->next; | |
189 | } | |
190 | } | |
c906108c | 191 | |
6ffb2242 DE |
192 | /* Iterate over all elements in BLIST, calling FUNC. |
193 | PARAM is passed to FUNC. | |
194 | FUNC may remove the block it's passed, but only that block. */ | |
25f122dc | 195 | |
6ffb2242 DE |
196 | static void |
197 | for_each_block (struct dcache_block **blist, block_func *func, void *param) | |
198 | { | |
199 | struct dcache_block *db; | |
200 | ||
201 | if (*blist == NULL) | |
202 | return; | |
203 | ||
204 | db = *blist; | |
205 | do | |
206 | { | |
207 | struct dcache_block *next = db->next; | |
208 | ||
209 | func (db, param); | |
210 | db = next; | |
c906108c | 211 | } |
6ffb2242 DE |
212 | while (*blist && db != *blist); |
213 | } | |
214 | ||
1a532630 PP |
215 | /* BLOCK_FUNC routine for dcache_free. */ |
216 | ||
217 | static void | |
218 | free_block (struct dcache_block *block, void *param) | |
219 | { | |
220 | xfree (block); | |
221 | } | |
222 | ||
223 | /* Free a data cache. */ | |
224 | ||
225 | void | |
226 | dcache_free (DCACHE *dcache) | |
227 | { | |
228 | if (last_cache == dcache) | |
229 | last_cache = NULL; | |
230 | ||
231 | splay_tree_delete (dcache->tree); | |
232 | for_each_block (&dcache->oldest, free_block, NULL); | |
233 | for_each_block (&dcache->freelist, free_block, NULL); | |
234 | xfree (dcache); | |
235 | } | |
236 | ||
237 | ||
6ffb2242 DE |
238 | /* BLOCK_FUNC function for dcache_invalidate. |
239 | This doesn't remove the block from the oldest list on purpose. | |
240 | dcache_invalidate will do it later. */ | |
241 | ||
242 | static void | |
243 | invalidate_block (struct dcache_block *block, void *param) | |
244 | { | |
245 | DCACHE *dcache = (DCACHE *) param; | |
246 | ||
247 | splay_tree_remove (dcache->tree, (splay_tree_key) block->addr); | |
248 | append_block (&dcache->freelist, block); | |
249 | } | |
250 | ||
251 | /* Free all the data cache blocks, thus discarding all cached data. */ | |
252 | ||
253 | void | |
254 | dcache_invalidate (DCACHE *dcache) | |
255 | { | |
256 | for_each_block (&dcache->oldest, invalidate_block, dcache); | |
c906108c | 257 | |
25f122dc | 258 | dcache->oldest = NULL; |
25f122dc | 259 | dcache->size = 0; |
4e5d721f | 260 | dcache->ptid = null_ptid; |
1a532630 PP |
261 | |
262 | if (dcache->line_size != dcache_line_size) | |
263 | { | |
264 | /* We've been asked to use a different line size. | |
265 | All of our freelist blocks are now the wrong size, so free them. */ | |
266 | ||
267 | for_each_block (&dcache->freelist, free_block, dcache); | |
268 | dcache->freelist = NULL; | |
269 | dcache->line_size = dcache_line_size; | |
270 | } | |
4e5d721f DE |
271 | } |
272 | ||
273 | /* Invalidate the line associated with ADDR. */ | |
274 | ||
275 | static void | |
276 | dcache_invalidate_line (DCACHE *dcache, CORE_ADDR addr) | |
277 | { | |
278 | struct dcache_block *db = dcache_hit (dcache, addr); | |
279 | ||
280 | if (db) | |
281 | { | |
282 | splay_tree_remove (dcache->tree, (splay_tree_key) db->addr); | |
6ffb2242 DE |
283 | remove_block (&dcache->oldest, db); |
284 | append_block (&dcache->freelist, db); | |
4e5d721f DE |
285 | --dcache->size; |
286 | } | |
c906108c SS |
287 | } |
288 | ||
289 | /* If addr is present in the dcache, return the address of the block | |
7f79c47e | 290 | containing it. Otherwise return NULL. */ |
c906108c SS |
291 | |
292 | static struct dcache_block * | |
fba45db2 | 293 | dcache_hit (DCACHE *dcache, CORE_ADDR addr) |
c906108c | 294 | { |
52f0bd74 | 295 | struct dcache_block *db; |
c906108c | 296 | |
25f122dc | 297 | splay_tree_node node = splay_tree_lookup (dcache->tree, |
1a532630 | 298 | (splay_tree_key) MASK (dcache, addr)); |
c906108c | 299 | |
25f122dc DE |
300 | if (!node) |
301 | return NULL; | |
c906108c | 302 | |
25f122dc DE |
303 | db = (struct dcache_block *) node->value; |
304 | db->refs++; | |
305 | return db; | |
c906108c SS |
306 | } |
307 | ||
7f79c47e DE |
308 | /* Fill a cache line from target memory. |
309 | The result is 1 for success, 0 if the (entire) cache line | |
310 | wasn't readable. */ | |
c906108c | 311 | |
8edbea78 C |
312 | static int |
313 | dcache_read_line (DCACHE *dcache, struct dcache_block *db) | |
314 | { | |
315 | CORE_ADDR memaddr; | |
6c932e54 | 316 | gdb_byte *myaddr; |
8edbea78 C |
317 | int len; |
318 | int res; | |
29e57380 C |
319 | int reg_len; |
320 | struct mem_region *region; | |
8edbea78 | 321 | |
1a532630 | 322 | len = dcache->line_size; |
8edbea78 C |
323 | memaddr = db->addr; |
324 | myaddr = db->data; | |
325 | ||
326 | while (len > 0) | |
327 | { | |
25f122dc DE |
328 | /* Don't overrun if this block is right at the end of the region. */ |
329 | region = lookup_mem_region (memaddr); | |
330 | if (region->hi == 0 || memaddr + len < region->hi) | |
29e57380 C |
331 | reg_len = len; |
332 | else | |
333 | reg_len = region->hi - memaddr; | |
334 | ||
4e5d721f DE |
335 | /* Skip non-readable regions. The cache attribute can be ignored, |
336 | since we may be loading this for a stack access. */ | |
337 | if (region->attrib.mode == MEM_WO) | |
29e57380 C |
338 | { |
339 | memaddr += reg_len; | |
340 | myaddr += reg_len; | |
341 | len -= reg_len; | |
342 | continue; | |
343 | } | |
344 | ||
cf7a04e8 DJ |
345 | res = target_read (¤t_target, TARGET_OBJECT_RAW_MEMORY, |
346 | NULL, myaddr, memaddr, reg_len); | |
347 | if (res < reg_len) | |
348 | return 0; | |
8edbea78 | 349 | |
cf7a04e8 DJ |
350 | memaddr += res; |
351 | myaddr += res; | |
352 | len -= res; | |
8edbea78 C |
353 | } |
354 | ||
8edbea78 C |
355 | return 1; |
356 | } | |
357 | ||
c906108c | 358 | /* Get a free cache block, put or keep it on the valid list, |
f1d7622b | 359 | and return its address. */ |
c906108c SS |
360 | |
361 | static struct dcache_block * | |
f1d7622b | 362 | dcache_alloc (DCACHE *dcache, CORE_ADDR addr) |
c906108c | 363 | { |
52f0bd74 | 364 | struct dcache_block *db; |
c906108c | 365 | |
1a532630 | 366 | if (dcache->size >= dcache_size) |
c906108c | 367 | { |
6ffb2242 | 368 | /* Evict the least recently allocated line. */ |
25f122dc | 369 | db = dcache->oldest; |
6ffb2242 | 370 | remove_block (&dcache->oldest, db); |
25f122dc DE |
371 | |
372 | splay_tree_remove (dcache->tree, (splay_tree_key) db->addr); | |
c906108c SS |
373 | } |
374 | else | |
375 | { | |
25f122dc DE |
376 | db = dcache->freelist; |
377 | if (db) | |
6ffb2242 | 378 | remove_block (&dcache->freelist, db); |
25f122dc | 379 | else |
1a532630 PP |
380 | db = xmalloc (offsetof (struct dcache_block, data) + |
381 | dcache->line_size); | |
c906108c | 382 | |
25f122dc | 383 | dcache->size++; |
c906108c SS |
384 | } |
385 | ||
1a532630 | 386 | db->addr = MASK (dcache, addr); |
f1d7622b | 387 | db->refs = 0; |
f1d7622b | 388 | |
6ffb2242 DE |
389 | /* Put DB at the end of the list, it's the newest. */ |
390 | append_block (&dcache->oldest, db); | |
c906108c | 391 | |
25f122dc DE |
392 | splay_tree_insert (dcache->tree, (splay_tree_key) db->addr, |
393 | (splay_tree_value) db); | |
c906108c | 394 | |
25f122dc | 395 | return db; |
c906108c SS |
396 | } |
397 | ||
7f79c47e | 398 | /* Using the data cache DCACHE, store in *PTR the contents of the byte at |
8edbea78 C |
399 | address ADDR in the remote machine. |
400 | ||
25f122dc | 401 | Returns 1 for success, 0 for error. */ |
8edbea78 C |
402 | |
403 | static int | |
6c932e54 | 404 | dcache_peek_byte (DCACHE *dcache, CORE_ADDR addr, gdb_byte *ptr) |
8edbea78 | 405 | { |
52f0bd74 | 406 | struct dcache_block *db = dcache_hit (dcache, addr); |
8edbea78 C |
407 | |
408 | if (!db) | |
409 | { | |
410 | db = dcache_alloc (dcache, addr); | |
25f122dc DE |
411 | |
412 | if (!dcache_read_line (dcache, db)) | |
8edbea78 C |
413 | return 0; |
414 | } | |
415 | ||
1a532630 | 416 | *ptr = db->data[XFORM (dcache, addr)]; |
8edbea78 C |
417 | return 1; |
418 | } | |
419 | ||
c906108c | 420 | /* Write the byte at PTR into ADDR in the data cache. |
25f122dc DE |
421 | |
422 | The caller is responsible for also promptly writing the data | |
423 | through to target memory. | |
424 | ||
425 | If addr is not in cache, this function does nothing; writing to | |
426 | an area of memory which wasn't present in the cache doesn't cause | |
427 | it to be loaded in. | |
428 | ||
4e5d721f | 429 | Always return 1 (meaning success) to simplify dcache_xfer_memory. */ |
c906108c SS |
430 | |
431 | static int | |
6c932e54 | 432 | dcache_poke_byte (DCACHE *dcache, CORE_ADDR addr, gdb_byte *ptr) |
c906108c | 433 | { |
52f0bd74 | 434 | struct dcache_block *db = dcache_hit (dcache, addr); |
c906108c | 435 | |
25f122dc | 436 | if (db) |
1a532630 | 437 | db->data[XFORM (dcache, addr)] = *ptr; |
c906108c | 438 | |
c906108c SS |
439 | return 1; |
440 | } | |
441 | ||
25f122dc DE |
442 | static int |
443 | dcache_splay_tree_compare (splay_tree_key a, splay_tree_key b) | |
444 | { | |
445 | if (a > b) | |
446 | return 1; | |
447 | else if (a == b) | |
448 | return 0; | |
449 | else | |
450 | return -1; | |
451 | } | |
452 | ||
7f79c47e | 453 | /* Allocate and initialize a data cache. */ |
25f122dc | 454 | |
c906108c | 455 | DCACHE * |
4930751a | 456 | dcache_init (void) |
c906108c | 457 | { |
c906108c SS |
458 | DCACHE *dcache; |
459 | ||
460 | dcache = (DCACHE *) xmalloc (sizeof (*dcache)); | |
c906108c | 461 | |
25f122dc DE |
462 | dcache->tree = splay_tree_new (dcache_splay_tree_compare, |
463 | NULL, | |
464 | NULL); | |
c906108c | 465 | |
25f122dc | 466 | dcache->oldest = NULL; |
25f122dc DE |
467 | dcache->freelist = NULL; |
468 | dcache->size = 0; | |
1a532630 | 469 | dcache->line_size = dcache_line_size; |
4e5d721f | 470 | dcache->ptid = null_ptid; |
c906108c | 471 | last_cache = dcache; |
25f122dc | 472 | |
c906108c SS |
473 | return dcache; |
474 | } | |
475 | ||
e99586d5 | 476 | |
c906108c SS |
477 | /* Read or write LEN bytes from inferior memory at MEMADDR, transferring |
478 | to or from debugger address MYADDR. Write to inferior if SHOULD_WRITE is | |
479 | nonzero. | |
480 | ||
7f79c47e DE |
481 | Return the number of bytes actually transfered, or -1 if the |
482 | transfer is not supported or otherwise fails. Return of a non-negative | |
483 | value less than LEN indicates that no further transfer is possible. | |
484 | NOTE: This is different than the to_xfer_partial interface, in which | |
485 | positive values less than LEN mean further transfers may be possible. */ | |
c906108c SS |
486 | |
487 | int | |
25f122dc DE |
488 | dcache_xfer_memory (struct target_ops *ops, DCACHE *dcache, |
489 | CORE_ADDR memaddr, gdb_byte *myaddr, | |
1b0ba102 | 490 | int len, int should_write) |
c906108c SS |
491 | { |
492 | int i; | |
25f122dc | 493 | int res; |
6c932e54 | 494 | int (*xfunc) (DCACHE *dcache, CORE_ADDR addr, gdb_byte *ptr); |
9a619af0 | 495 | |
29e57380 | 496 | xfunc = should_write ? dcache_poke_byte : dcache_peek_byte; |
c906108c | 497 | |
4e5d721f DE |
498 | /* If this is a different inferior from what we've recorded, |
499 | flush the cache. */ | |
500 | ||
501 | if (! ptid_equal (inferior_ptid, dcache->ptid)) | |
502 | { | |
503 | dcache_invalidate (dcache); | |
504 | dcache->ptid = inferior_ptid; | |
505 | } | |
506 | ||
25f122dc DE |
507 | /* Do write-through first, so that if it fails, we don't write to |
508 | the cache at all. */ | |
509 | ||
510 | if (should_write) | |
511 | { | |
512 | res = target_write (ops, TARGET_OBJECT_RAW_MEMORY, | |
513 | NULL, myaddr, memaddr, len); | |
4e5d721f DE |
514 | if (res <= 0) |
515 | return res; | |
516 | /* Update LEN to what was actually written. */ | |
517 | len = res; | |
25f122dc DE |
518 | } |
519 | ||
29e57380 | 520 | for (i = 0; i < len; i++) |
c906108c | 521 | { |
29e57380 | 522 | if (!xfunc (dcache, memaddr + i, myaddr + i)) |
4e5d721f DE |
523 | { |
524 | /* That failed. Discard its cache line so we don't have a | |
525 | partially read line. */ | |
526 | dcache_invalidate_line (dcache, memaddr + i); | |
527 | /* If we're writing, we still wrote LEN bytes. */ | |
528 | if (should_write) | |
529 | return len; | |
530 | else | |
531 | return i; | |
532 | } | |
c906108c | 533 | } |
25f122dc DE |
534 | |
535 | return len; | |
536 | } | |
c906108c | 537 | |
25f122dc DE |
538 | /* FIXME: There would be some benefit to making the cache write-back and |
539 | moving the writeback operation to a higher layer, as it could occur | |
540 | after a sequence of smaller writes have been completed (as when a stack | |
541 | frame is constructed for an inferior function call). Note that only | |
542 | moving it up one level to target_xfer_memory[_partial]() is not | |
543 | sufficient since we want to coalesce memory transfers that are | |
544 | "logically" connected but not actually a single call to one of the | |
545 | memory transfer functions. */ | |
29e57380 | 546 | |
4e5d721f DE |
547 | /* Just update any cache lines which are already present. This is called |
548 | by memory_xfer_partial in cases where the access would otherwise not go | |
549 | through the cache. */ | |
550 | ||
551 | void | |
552 | dcache_update (DCACHE *dcache, CORE_ADDR memaddr, gdb_byte *myaddr, int len) | |
553 | { | |
554 | int i; | |
9a619af0 | 555 | |
4e5d721f DE |
556 | for (i = 0; i < len; i++) |
557 | dcache_poke_byte (dcache, memaddr + i, myaddr + i); | |
558 | } | |
559 | ||
25f122dc DE |
560 | static void |
561 | dcache_print_line (int index) | |
562 | { | |
563 | splay_tree_node n; | |
564 | struct dcache_block *db; | |
565 | int i, j; | |
566 | ||
567 | if (!last_cache) | |
568 | { | |
569 | printf_filtered (_("No data cache available.\n")); | |
570 | return; | |
571 | } | |
572 | ||
573 | n = splay_tree_min (last_cache->tree); | |
574 | ||
575 | for (i = index; i > 0; --i) | |
576 | { | |
577 | if (!n) | |
578 | break; | |
579 | n = splay_tree_successor (last_cache->tree, n->key); | |
580 | } | |
581 | ||
582 | if (!n) | |
583 | { | |
584 | printf_filtered (_("No such cache line exists.\n")); | |
585 | return; | |
586 | } | |
29e57380 | 587 | |
25f122dc DE |
588 | db = (struct dcache_block *) n->value; |
589 | ||
51939b3d | 590 | printf_filtered (_("Line %d: address %s [%d hits]\n"), |
f5656ead | 591 | index, paddress (target_gdbarch (), db->addr), db->refs); |
25f122dc | 592 | |
1a532630 | 593 | for (j = 0; j < last_cache->line_size; j++) |
25f122dc DE |
594 | { |
595 | printf_filtered ("%02x ", db->data[j]); | |
596 | ||
0963b4bd | 597 | /* Print a newline every 16 bytes (48 characters). */ |
1a532630 | 598 | if ((j % 16 == 15) && (j != last_cache->line_size - 1)) |
25f122dc DE |
599 | printf_filtered ("\n"); |
600 | } | |
601 | printf_filtered ("\n"); | |
c906108c SS |
602 | } |
603 | ||
c5aa993b | 604 | static void |
fba45db2 | 605 | dcache_info (char *exp, int tty) |
c906108c | 606 | { |
25f122dc | 607 | splay_tree_node n; |
9128a503 | 608 | int i, refcount; |
25f122dc DE |
609 | |
610 | if (exp) | |
611 | { | |
612 | char *linestart; | |
9a619af0 | 613 | |
25f122dc DE |
614 | i = strtol (exp, &linestart, 10); |
615 | if (linestart == exp || i < 0) | |
616 | { | |
617 | printf_filtered (_("Usage: info dcache [linenumber]\n")); | |
618 | return; | |
619 | } | |
c906108c | 620 | |
25f122dc DE |
621 | dcache_print_line (i); |
622 | return; | |
623 | } | |
624 | ||
1a532630 PP |
625 | printf_filtered (_("Dcache %u lines of %u bytes each.\n"), |
626 | dcache_size, | |
627 | last_cache ? (unsigned) last_cache->line_size | |
628 | : dcache_line_size); | |
c906108c | 629 | |
4e5d721f | 630 | if (!last_cache || ptid_equal (last_cache->ptid, null_ptid)) |
c906108c | 631 | { |
25f122dc DE |
632 | printf_filtered (_("No data cache available.\n")); |
633 | return; | |
634 | } | |
5e2039ea | 635 | |
4e5d721f DE |
636 | printf_filtered (_("Contains data for %s\n"), |
637 | target_pid_to_str (last_cache->ptid)); | |
638 | ||
25f122dc | 639 | refcount = 0; |
c906108c | 640 | |
25f122dc DE |
641 | n = splay_tree_min (last_cache->tree); |
642 | i = 0; | |
c906108c | 643 | |
25f122dc DE |
644 | while (n) |
645 | { | |
646 | struct dcache_block *db = (struct dcache_block *) n->value; | |
647 | ||
51939b3d | 648 | printf_filtered (_("Line %d: address %s [%d hits]\n"), |
f5656ead | 649 | i, paddress (target_gdbarch (), db->addr), db->refs); |
25f122dc DE |
650 | i++; |
651 | refcount += db->refs; | |
652 | ||
653 | n = splay_tree_successor (last_cache->tree, n->key); | |
c906108c | 654 | } |
25f122dc DE |
655 | |
656 | printf_filtered (_("Cache state: %d active lines, %d hits\n"), i, refcount); | |
c906108c SS |
657 | } |
658 | ||
1a532630 PP |
659 | static void |
660 | set_dcache_size (char *args, int from_tty, | |
661 | struct cmd_list_element *c) | |
662 | { | |
663 | if (dcache_size == 0) | |
664 | { | |
665 | dcache_size = DCACHE_DEFAULT_SIZE; | |
666 | error (_("Dcache size must be greater than 0.")); | |
667 | } | |
668 | if (last_cache) | |
669 | dcache_invalidate (last_cache); | |
670 | } | |
671 | ||
672 | static void | |
673 | set_dcache_line_size (char *args, int from_tty, | |
674 | struct cmd_list_element *c) | |
675 | { | |
676 | if (dcache_line_size < 2 | |
677 | || (dcache_line_size & (dcache_line_size - 1)) != 0) | |
678 | { | |
679 | unsigned d = dcache_line_size; | |
680 | dcache_line_size = DCACHE_DEFAULT_LINE_SIZE; | |
681 | error (_("Invalid dcache line size: %u (must be power of 2)."), d); | |
682 | } | |
683 | if (last_cache) | |
684 | dcache_invalidate (last_cache); | |
685 | } | |
686 | ||
687 | static void | |
688 | set_dcache_command (char *arg, int from_tty) | |
689 | { | |
690 | printf_unfiltered ( | |
691 | "\"set dcache\" must be followed by the name of a subcommand.\n"); | |
692 | help_list (dcache_set_list, "set dcache ", -1, gdb_stdout); | |
693 | } | |
694 | ||
695 | static void | |
696 | show_dcache_command (char *args, int from_tty) | |
697 | { | |
698 | cmd_show_list (dcache_show_list, from_tty, ""); | |
699 | } | |
700 | ||
c906108c | 701 | void |
fba45db2 | 702 | _initialize_dcache (void) |
c906108c | 703 | { |
5bf193a2 AC |
704 | add_setshow_boolean_cmd ("remotecache", class_support, |
705 | &dcache_enabled_p, _("\ | |
706 | Set cache use for remote targets."), _("\ | |
707 | Show cache use for remote targets."), _("\ | |
4e5d721f DE |
708 | This used to enable the data cache for remote targets. The cache\n\ |
709 | functionality is now controlled by the memory region system and the\n\ | |
710 | \"stack-cache\" flag; \"remotecache\" now does nothing and\n\ | |
711 | exists only for compatibility reasons."), | |
5bf193a2 | 712 | NULL, |
920d2a44 | 713 | show_dcache_enabled_p, |
5bf193a2 | 714 | &setlist, &showlist); |
c906108c SS |
715 | |
716 | add_info ("dcache", dcache_info, | |
07128da0 DE |
717 | _("\ |
718 | Print information on the dcache performance.\n\ | |
25f122dc DE |
719 | With no arguments, this command prints the cache configuration and a\n\ |
720 | summary of each line in the cache. Use \"info dcache <lineno> to dump\"\n\ | |
721 | the contents of a given line.")); | |
1a532630 PP |
722 | |
723 | add_prefix_cmd ("dcache", class_obscure, set_dcache_command, _("\ | |
724 | Use this command to set number of lines in dcache and line-size."), | |
725 | &dcache_set_list, "set dcache ", /*allow_unknown*/0, &setlist); | |
726 | add_prefix_cmd ("dcache", class_obscure, show_dcache_command, _("\ | |
727 | Show dcachesettings."), | |
728 | &dcache_show_list, "show dcache ", /*allow_unknown*/0, &showlist); | |
729 | ||
730 | add_setshow_uinteger_cmd ("line-size", class_obscure, | |
731 | &dcache_line_size, _("\ | |
732 | Set dcache line size in bytes (must be power of 2)."), _("\ | |
733 | Show dcache line size."), | |
734 | NULL, | |
735 | set_dcache_line_size, | |
736 | NULL, | |
737 | &dcache_set_list, &dcache_show_list); | |
738 | add_setshow_uinteger_cmd ("size", class_obscure, | |
739 | &dcache_size, _("\ | |
740 | Set number of dcache lines."), _("\ | |
741 | Show number of dcache lines."), | |
742 | NULL, | |
743 | set_dcache_size, | |
744 | NULL, | |
745 | &dcache_set_list, &dcache_show_list); | |
c906108c | 746 | } |