Commit | Line | Data |
---|---|---|
69517000 AC |
1 | /* Caching code for GDB, the GNU debugger. |
2 | ||
ecd75fc8 | 3 | Copyright (C) 1992-2014 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" | |
0e9f083f | 23 | #include <string.h> |
c906108c | 24 | #include "gdbcore.h" |
68c765e2 | 25 | #include "target-dcache.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 | ||
6ffb2242 DE |
142 | /* Add BLOCK to circular block list BLIST, behind the block at *BLIST. |
143 | *BLIST is not updated (unless it was previously NULL of course). | |
144 | This is for the least-recently-allocated list's sake: | |
145 | BLIST points to the oldest block. | |
146 | ??? This makes for poor cache usage of the free list, | |
147 | but is it measurable? */ | |
c906108c | 148 | |
6ffb2242 DE |
149 | static void |
150 | append_block (struct dcache_block **blist, struct dcache_block *block) | |
c906108c | 151 | { |
6ffb2242 DE |
152 | if (*blist) |
153 | { | |
154 | block->next = *blist; | |
155 | block->prev = (*blist)->prev; | |
156 | block->prev->next = block; | |
157 | (*blist)->prev = block; | |
158 | /* We don't update *BLIST here to maintain the invariant that for the | |
159 | least-recently-allocated list *BLIST points to the oldest block. */ | |
160 | } | |
161 | else | |
162 | { | |
163 | block->next = block; | |
164 | block->prev = block; | |
165 | *blist = block; | |
166 | } | |
167 | } | |
c906108c | 168 | |
6ffb2242 | 169 | /* Remove BLOCK from circular block list BLIST. */ |
c906108c | 170 | |
6ffb2242 DE |
171 | static void |
172 | remove_block (struct dcache_block **blist, struct dcache_block *block) | |
173 | { | |
174 | if (block->next == block) | |
175 | { | |
176 | *blist = NULL; | |
177 | } | |
178 | else | |
c906108c | 179 | { |
6ffb2242 DE |
180 | block->next->prev = block->prev; |
181 | block->prev->next = block->next; | |
182 | /* If we removed the block *BLIST points to, shift it to the next block | |
183 | to maintain the invariant that for the least-recently-allocated list | |
184 | *BLIST points to the oldest block. */ | |
185 | if (*blist == block) | |
186 | *blist = block->next; | |
187 | } | |
188 | } | |
c906108c | 189 | |
6ffb2242 DE |
190 | /* Iterate over all elements in BLIST, calling FUNC. |
191 | PARAM is passed to FUNC. | |
192 | FUNC may remove the block it's passed, but only that block. */ | |
25f122dc | 193 | |
6ffb2242 DE |
194 | static void |
195 | for_each_block (struct dcache_block **blist, block_func *func, void *param) | |
196 | { | |
197 | struct dcache_block *db; | |
198 | ||
199 | if (*blist == NULL) | |
200 | return; | |
201 | ||
202 | db = *blist; | |
203 | do | |
204 | { | |
205 | struct dcache_block *next = db->next; | |
206 | ||
207 | func (db, param); | |
208 | db = next; | |
c906108c | 209 | } |
6ffb2242 DE |
210 | while (*blist && db != *blist); |
211 | } | |
212 | ||
1a532630 PP |
213 | /* BLOCK_FUNC routine for dcache_free. */ |
214 | ||
215 | static void | |
216 | free_block (struct dcache_block *block, void *param) | |
217 | { | |
218 | xfree (block); | |
219 | } | |
220 | ||
221 | /* Free a data cache. */ | |
222 | ||
223 | void | |
224 | dcache_free (DCACHE *dcache) | |
225 | { | |
1a532630 PP |
226 | splay_tree_delete (dcache->tree); |
227 | for_each_block (&dcache->oldest, free_block, NULL); | |
228 | for_each_block (&dcache->freelist, free_block, NULL); | |
229 | xfree (dcache); | |
230 | } | |
231 | ||
232 | ||
6ffb2242 DE |
233 | /* BLOCK_FUNC function for dcache_invalidate. |
234 | This doesn't remove the block from the oldest list on purpose. | |
235 | dcache_invalidate will do it later. */ | |
236 | ||
237 | static void | |
238 | invalidate_block (struct dcache_block *block, void *param) | |
239 | { | |
240 | DCACHE *dcache = (DCACHE *) param; | |
241 | ||
242 | splay_tree_remove (dcache->tree, (splay_tree_key) block->addr); | |
243 | append_block (&dcache->freelist, block); | |
244 | } | |
245 | ||
246 | /* Free all the data cache blocks, thus discarding all cached data. */ | |
247 | ||
248 | void | |
249 | dcache_invalidate (DCACHE *dcache) | |
250 | { | |
251 | for_each_block (&dcache->oldest, invalidate_block, dcache); | |
c906108c | 252 | |
25f122dc | 253 | dcache->oldest = NULL; |
25f122dc | 254 | dcache->size = 0; |
4e5d721f | 255 | dcache->ptid = null_ptid; |
1a532630 PP |
256 | |
257 | if (dcache->line_size != dcache_line_size) | |
258 | { | |
259 | /* We've been asked to use a different line size. | |
260 | All of our freelist blocks are now the wrong size, so free them. */ | |
261 | ||
262 | for_each_block (&dcache->freelist, free_block, dcache); | |
263 | dcache->freelist = NULL; | |
264 | dcache->line_size = dcache_line_size; | |
265 | } | |
4e5d721f DE |
266 | } |
267 | ||
268 | /* Invalidate the line associated with ADDR. */ | |
269 | ||
270 | static void | |
271 | dcache_invalidate_line (DCACHE *dcache, CORE_ADDR addr) | |
272 | { | |
273 | struct dcache_block *db = dcache_hit (dcache, addr); | |
274 | ||
275 | if (db) | |
276 | { | |
277 | splay_tree_remove (dcache->tree, (splay_tree_key) db->addr); | |
6ffb2242 DE |
278 | remove_block (&dcache->oldest, db); |
279 | append_block (&dcache->freelist, db); | |
4e5d721f DE |
280 | --dcache->size; |
281 | } | |
c906108c SS |
282 | } |
283 | ||
284 | /* If addr is present in the dcache, return the address of the block | |
7f79c47e | 285 | containing it. Otherwise return NULL. */ |
c906108c SS |
286 | |
287 | static struct dcache_block * | |
fba45db2 | 288 | dcache_hit (DCACHE *dcache, CORE_ADDR addr) |
c906108c | 289 | { |
52f0bd74 | 290 | struct dcache_block *db; |
c906108c | 291 | |
25f122dc | 292 | splay_tree_node node = splay_tree_lookup (dcache->tree, |
1a532630 | 293 | (splay_tree_key) MASK (dcache, addr)); |
c906108c | 294 | |
25f122dc DE |
295 | if (!node) |
296 | return NULL; | |
c906108c | 297 | |
25f122dc DE |
298 | db = (struct dcache_block *) node->value; |
299 | db->refs++; | |
300 | return db; | |
c906108c SS |
301 | } |
302 | ||
7f79c47e DE |
303 | /* Fill a cache line from target memory. |
304 | The result is 1 for success, 0 if the (entire) cache line | |
305 | wasn't readable. */ | |
c906108c | 306 | |
8edbea78 C |
307 | static int |
308 | dcache_read_line (DCACHE *dcache, struct dcache_block *db) | |
309 | { | |
310 | CORE_ADDR memaddr; | |
6c932e54 | 311 | gdb_byte *myaddr; |
8edbea78 C |
312 | int len; |
313 | int res; | |
29e57380 C |
314 | int reg_len; |
315 | struct mem_region *region; | |
8edbea78 | 316 | |
1a532630 | 317 | len = dcache->line_size; |
8edbea78 C |
318 | memaddr = db->addr; |
319 | myaddr = db->data; | |
320 | ||
321 | while (len > 0) | |
322 | { | |
25f122dc DE |
323 | /* Don't overrun if this block is right at the end of the region. */ |
324 | region = lookup_mem_region (memaddr); | |
325 | if (region->hi == 0 || memaddr + len < region->hi) | |
29e57380 C |
326 | reg_len = len; |
327 | else | |
328 | reg_len = region->hi - memaddr; | |
329 | ||
4e5d721f DE |
330 | /* Skip non-readable regions. The cache attribute can be ignored, |
331 | since we may be loading this for a stack access. */ | |
332 | if (region->attrib.mode == MEM_WO) | |
29e57380 C |
333 | { |
334 | memaddr += reg_len; | |
335 | myaddr += reg_len; | |
336 | len -= reg_len; | |
337 | continue; | |
338 | } | |
9f713294 | 339 | |
aee4bf85 PA |
340 | res = target_read_raw_memory (memaddr, myaddr, reg_len); |
341 | if (res != 0) | |
cf7a04e8 | 342 | return 0; |
8edbea78 | 343 | |
aee4bf85 PA |
344 | memaddr += reg_len; |
345 | myaddr += reg_len; | |
346 | len -= reg_len; | |
8edbea78 C |
347 | } |
348 | ||
8edbea78 C |
349 | return 1; |
350 | } | |
351 | ||
c906108c | 352 | /* Get a free cache block, put or keep it on the valid list, |
f1d7622b | 353 | and return its address. */ |
c906108c SS |
354 | |
355 | static struct dcache_block * | |
f1d7622b | 356 | dcache_alloc (DCACHE *dcache, CORE_ADDR addr) |
c906108c | 357 | { |
52f0bd74 | 358 | struct dcache_block *db; |
c906108c | 359 | |
1a532630 | 360 | if (dcache->size >= dcache_size) |
c906108c | 361 | { |
6ffb2242 | 362 | /* Evict the least recently allocated line. */ |
25f122dc | 363 | db = dcache->oldest; |
6ffb2242 | 364 | remove_block (&dcache->oldest, db); |
25f122dc DE |
365 | |
366 | splay_tree_remove (dcache->tree, (splay_tree_key) db->addr); | |
c906108c SS |
367 | } |
368 | else | |
369 | { | |
25f122dc DE |
370 | db = dcache->freelist; |
371 | if (db) | |
6ffb2242 | 372 | remove_block (&dcache->freelist, db); |
25f122dc | 373 | else |
1a532630 PP |
374 | db = xmalloc (offsetof (struct dcache_block, data) + |
375 | dcache->line_size); | |
c906108c | 376 | |
25f122dc | 377 | dcache->size++; |
c906108c SS |
378 | } |
379 | ||
1a532630 | 380 | db->addr = MASK (dcache, addr); |
f1d7622b | 381 | db->refs = 0; |
f1d7622b | 382 | |
6ffb2242 DE |
383 | /* Put DB at the end of the list, it's the newest. */ |
384 | append_block (&dcache->oldest, db); | |
c906108c | 385 | |
25f122dc DE |
386 | splay_tree_insert (dcache->tree, (splay_tree_key) db->addr, |
387 | (splay_tree_value) db); | |
c906108c | 388 | |
25f122dc | 389 | return db; |
c906108c SS |
390 | } |
391 | ||
7f79c47e | 392 | /* Using the data cache DCACHE, store in *PTR the contents of the byte at |
8edbea78 C |
393 | address ADDR in the remote machine. |
394 | ||
25f122dc | 395 | Returns 1 for success, 0 for error. */ |
8edbea78 C |
396 | |
397 | static int | |
6c932e54 | 398 | dcache_peek_byte (DCACHE *dcache, CORE_ADDR addr, gdb_byte *ptr) |
8edbea78 | 399 | { |
52f0bd74 | 400 | struct dcache_block *db = dcache_hit (dcache, addr); |
8edbea78 C |
401 | |
402 | if (!db) | |
403 | { | |
404 | db = dcache_alloc (dcache, addr); | |
25f122dc DE |
405 | |
406 | if (!dcache_read_line (dcache, db)) | |
8edbea78 C |
407 | return 0; |
408 | } | |
409 | ||
1a532630 | 410 | *ptr = db->data[XFORM (dcache, addr)]; |
8edbea78 C |
411 | return 1; |
412 | } | |
413 | ||
c906108c | 414 | /* Write the byte at PTR into ADDR in the data cache. |
25f122dc DE |
415 | |
416 | The caller is responsible for also promptly writing the data | |
417 | through to target memory. | |
418 | ||
419 | If addr is not in cache, this function does nothing; writing to | |
420 | an area of memory which wasn't present in the cache doesn't cause | |
421 | it to be loaded in. | |
422 | ||
4e5d721f | 423 | Always return 1 (meaning success) to simplify dcache_xfer_memory. */ |
c906108c SS |
424 | |
425 | static int | |
6c932e54 | 426 | dcache_poke_byte (DCACHE *dcache, CORE_ADDR addr, gdb_byte *ptr) |
c906108c | 427 | { |
52f0bd74 | 428 | struct dcache_block *db = dcache_hit (dcache, addr); |
c906108c | 429 | |
25f122dc | 430 | if (db) |
1a532630 | 431 | db->data[XFORM (dcache, addr)] = *ptr; |
c906108c | 432 | |
c906108c SS |
433 | return 1; |
434 | } | |
435 | ||
25f122dc DE |
436 | static int |
437 | dcache_splay_tree_compare (splay_tree_key a, splay_tree_key b) | |
438 | { | |
439 | if (a > b) | |
440 | return 1; | |
441 | else if (a == b) | |
442 | return 0; | |
443 | else | |
444 | return -1; | |
445 | } | |
446 | ||
7f79c47e | 447 | /* Allocate and initialize a data cache. */ |
25f122dc | 448 | |
c906108c | 449 | DCACHE * |
4930751a | 450 | dcache_init (void) |
c906108c | 451 | { |
c906108c SS |
452 | DCACHE *dcache; |
453 | ||
454 | dcache = (DCACHE *) xmalloc (sizeof (*dcache)); | |
c906108c | 455 | |
25f122dc DE |
456 | dcache->tree = splay_tree_new (dcache_splay_tree_compare, |
457 | NULL, | |
458 | NULL); | |
c906108c | 459 | |
25f122dc | 460 | dcache->oldest = NULL; |
25f122dc DE |
461 | dcache->freelist = NULL; |
462 | dcache->size = 0; | |
1a532630 | 463 | dcache->line_size = dcache_line_size; |
4e5d721f | 464 | dcache->ptid = null_ptid; |
25f122dc | 465 | |
c906108c SS |
466 | return dcache; |
467 | } | |
468 | ||
e99586d5 | 469 | |
c906108c SS |
470 | /* Read or write LEN bytes from inferior memory at MEMADDR, transferring |
471 | to or from debugger address MYADDR. Write to inferior if SHOULD_WRITE is | |
472 | nonzero. | |
473 | ||
7f79c47e DE |
474 | Return the number of bytes actually transfered, or -1 if the |
475 | transfer is not supported or otherwise fails. Return of a non-negative | |
476 | value less than LEN indicates that no further transfer is possible. | |
477 | NOTE: This is different than the to_xfer_partial interface, in which | |
478 | positive values less than LEN mean further transfers may be possible. */ | |
c906108c SS |
479 | |
480 | int | |
25f122dc DE |
481 | dcache_xfer_memory (struct target_ops *ops, DCACHE *dcache, |
482 | CORE_ADDR memaddr, gdb_byte *myaddr, | |
1b0ba102 | 483 | int len, int should_write) |
c906108c SS |
484 | { |
485 | int i; | |
25f122dc | 486 | int res; |
6c932e54 | 487 | int (*xfunc) (DCACHE *dcache, CORE_ADDR addr, gdb_byte *ptr); |
9a619af0 | 488 | |
29e57380 | 489 | xfunc = should_write ? dcache_poke_byte : dcache_peek_byte; |
c906108c | 490 | |
4e5d721f DE |
491 | /* If this is a different inferior from what we've recorded, |
492 | flush the cache. */ | |
493 | ||
494 | if (! ptid_equal (inferior_ptid, dcache->ptid)) | |
495 | { | |
496 | dcache_invalidate (dcache); | |
497 | dcache->ptid = inferior_ptid; | |
498 | } | |
499 | ||
25f122dc DE |
500 | /* Do write-through first, so that if it fails, we don't write to |
501 | the cache at all. */ | |
502 | ||
503 | if (should_write) | |
504 | { | |
505 | res = target_write (ops, TARGET_OBJECT_RAW_MEMORY, | |
506 | NULL, myaddr, memaddr, len); | |
4e5d721f DE |
507 | if (res <= 0) |
508 | return res; | |
509 | /* Update LEN to what was actually written. */ | |
510 | len = res; | |
25f122dc DE |
511 | } |
512 | ||
29e57380 | 513 | for (i = 0; i < len; i++) |
c906108c | 514 | { |
29e57380 | 515 | if (!xfunc (dcache, memaddr + i, myaddr + i)) |
4e5d721f DE |
516 | { |
517 | /* That failed. Discard its cache line so we don't have a | |
518 | partially read line. */ | |
519 | dcache_invalidate_line (dcache, memaddr + i); | |
520 | /* If we're writing, we still wrote LEN bytes. */ | |
521 | if (should_write) | |
522 | return len; | |
523 | else | |
524 | return i; | |
525 | } | |
c906108c | 526 | } |
25f122dc DE |
527 | |
528 | return len; | |
529 | } | |
c906108c | 530 | |
25f122dc DE |
531 | /* FIXME: There would be some benefit to making the cache write-back and |
532 | moving the writeback operation to a higher layer, as it could occur | |
533 | after a sequence of smaller writes have been completed (as when a stack | |
534 | frame is constructed for an inferior function call). Note that only | |
535 | moving it up one level to target_xfer_memory[_partial]() is not | |
536 | sufficient since we want to coalesce memory transfers that are | |
537 | "logically" connected but not actually a single call to one of the | |
538 | memory transfer functions. */ | |
29e57380 | 539 | |
4e5d721f DE |
540 | /* Just update any cache lines which are already present. This is called |
541 | by memory_xfer_partial in cases where the access would otherwise not go | |
542 | through the cache. */ | |
543 | ||
544 | void | |
545 | dcache_update (DCACHE *dcache, CORE_ADDR memaddr, gdb_byte *myaddr, int len) | |
546 | { | |
547 | int i; | |
9a619af0 | 548 | |
4e5d721f DE |
549 | for (i = 0; i < len; i++) |
550 | dcache_poke_byte (dcache, memaddr + i, myaddr + i); | |
551 | } | |
552 | ||
2a2f9fe4 YQ |
553 | /* Print DCACHE line INDEX. */ |
554 | ||
25f122dc | 555 | static void |
2a2f9fe4 | 556 | dcache_print_line (DCACHE *dcache, int index) |
25f122dc DE |
557 | { |
558 | splay_tree_node n; | |
559 | struct dcache_block *db; | |
560 | int i, j; | |
561 | ||
2a2f9fe4 | 562 | if (dcache == NULL) |
25f122dc DE |
563 | { |
564 | printf_filtered (_("No data cache available.\n")); | |
565 | return; | |
566 | } | |
567 | ||
2a2f9fe4 | 568 | n = splay_tree_min (dcache->tree); |
25f122dc DE |
569 | |
570 | for (i = index; i > 0; --i) | |
571 | { | |
572 | if (!n) | |
573 | break; | |
2a2f9fe4 | 574 | n = splay_tree_successor (dcache->tree, n->key); |
25f122dc DE |
575 | } |
576 | ||
577 | if (!n) | |
578 | { | |
579 | printf_filtered (_("No such cache line exists.\n")); | |
580 | return; | |
581 | } | |
29e57380 | 582 | |
25f122dc DE |
583 | db = (struct dcache_block *) n->value; |
584 | ||
51939b3d | 585 | printf_filtered (_("Line %d: address %s [%d hits]\n"), |
f5656ead | 586 | index, paddress (target_gdbarch (), db->addr), db->refs); |
25f122dc | 587 | |
2a2f9fe4 | 588 | for (j = 0; j < dcache->line_size; j++) |
25f122dc DE |
589 | { |
590 | printf_filtered ("%02x ", db->data[j]); | |
591 | ||
0963b4bd | 592 | /* Print a newline every 16 bytes (48 characters). */ |
2a2f9fe4 | 593 | if ((j % 16 == 15) && (j != dcache->line_size - 1)) |
25f122dc DE |
594 | printf_filtered ("\n"); |
595 | } | |
596 | printf_filtered ("\n"); | |
c906108c SS |
597 | } |
598 | ||
2a2f9fe4 YQ |
599 | /* Parse EXP and show the info about DCACHE. */ |
600 | ||
c5aa993b | 601 | static void |
2a2f9fe4 | 602 | dcache_info_1 (DCACHE *dcache, char *exp) |
c906108c | 603 | { |
25f122dc | 604 | splay_tree_node n; |
9128a503 | 605 | int i, refcount; |
25f122dc DE |
606 | |
607 | if (exp) | |
608 | { | |
609 | char *linestart; | |
9a619af0 | 610 | |
25f122dc DE |
611 | i = strtol (exp, &linestart, 10); |
612 | if (linestart == exp || i < 0) | |
613 | { | |
614 | printf_filtered (_("Usage: info dcache [linenumber]\n")); | |
615 | return; | |
616 | } | |
c906108c | 617 | |
2a2f9fe4 | 618 | dcache_print_line (dcache, i); |
25f122dc DE |
619 | return; |
620 | } | |
621 | ||
1a532630 PP |
622 | printf_filtered (_("Dcache %u lines of %u bytes each.\n"), |
623 | dcache_size, | |
2a2f9fe4 | 624 | dcache ? (unsigned) dcache->line_size |
1a532630 | 625 | : dcache_line_size); |
c906108c | 626 | |
2a2f9fe4 | 627 | if (dcache == NULL || ptid_equal (dcache->ptid, null_ptid)) |
c906108c | 628 | { |
25f122dc DE |
629 | printf_filtered (_("No data cache available.\n")); |
630 | return; | |
631 | } | |
5e2039ea | 632 | |
4e5d721f | 633 | printf_filtered (_("Contains data for %s\n"), |
2a2f9fe4 | 634 | target_pid_to_str (dcache->ptid)); |
4e5d721f | 635 | |
25f122dc | 636 | refcount = 0; |
c906108c | 637 | |
2a2f9fe4 | 638 | n = splay_tree_min (dcache->tree); |
25f122dc | 639 | i = 0; |
c906108c | 640 | |
25f122dc DE |
641 | while (n) |
642 | { | |
643 | struct dcache_block *db = (struct dcache_block *) n->value; | |
644 | ||
51939b3d | 645 | printf_filtered (_("Line %d: address %s [%d hits]\n"), |
f5656ead | 646 | i, paddress (target_gdbarch (), db->addr), db->refs); |
25f122dc DE |
647 | i++; |
648 | refcount += db->refs; | |
649 | ||
2a2f9fe4 | 650 | n = splay_tree_successor (dcache->tree, n->key); |
c906108c | 651 | } |
25f122dc DE |
652 | |
653 | printf_filtered (_("Cache state: %d active lines, %d hits\n"), i, refcount); | |
c906108c SS |
654 | } |
655 | ||
2a2f9fe4 YQ |
656 | static void |
657 | dcache_info (char *exp, int tty) | |
658 | { | |
659 | dcache_info_1 (target_dcache_get (), exp); | |
660 | } | |
661 | ||
1a532630 PP |
662 | static void |
663 | set_dcache_size (char *args, int from_tty, | |
664 | struct cmd_list_element *c) | |
665 | { | |
666 | if (dcache_size == 0) | |
667 | { | |
668 | dcache_size = DCACHE_DEFAULT_SIZE; | |
669 | error (_("Dcache size must be greater than 0.")); | |
670 | } | |
2a2f9fe4 | 671 | target_dcache_invalidate (); |
1a532630 PP |
672 | } |
673 | ||
674 | static void | |
675 | set_dcache_line_size (char *args, int from_tty, | |
676 | struct cmd_list_element *c) | |
677 | { | |
678 | if (dcache_line_size < 2 | |
679 | || (dcache_line_size & (dcache_line_size - 1)) != 0) | |
680 | { | |
681 | unsigned d = dcache_line_size; | |
682 | dcache_line_size = DCACHE_DEFAULT_LINE_SIZE; | |
683 | error (_("Invalid dcache line size: %u (must be power of 2)."), d); | |
684 | } | |
2a2f9fe4 | 685 | target_dcache_invalidate (); |
1a532630 PP |
686 | } |
687 | ||
688 | static void | |
689 | set_dcache_command (char *arg, int from_tty) | |
690 | { | |
691 | printf_unfiltered ( | |
692 | "\"set dcache\" must be followed by the name of a subcommand.\n"); | |
693 | help_list (dcache_set_list, "set dcache ", -1, gdb_stdout); | |
694 | } | |
695 | ||
696 | static void | |
697 | show_dcache_command (char *args, int from_tty) | |
698 | { | |
699 | cmd_show_list (dcache_show_list, from_tty, ""); | |
700 | } | |
701 | ||
c906108c | 702 | void |
fba45db2 | 703 | _initialize_dcache (void) |
c906108c | 704 | { |
5bf193a2 AC |
705 | add_setshow_boolean_cmd ("remotecache", class_support, |
706 | &dcache_enabled_p, _("\ | |
707 | Set cache use for remote targets."), _("\ | |
708 | Show cache use for remote targets."), _("\ | |
4e5d721f DE |
709 | This used to enable the data cache for remote targets. The cache\n\ |
710 | functionality is now controlled by the memory region system and the\n\ | |
711 | \"stack-cache\" flag; \"remotecache\" now does nothing and\n\ | |
712 | exists only for compatibility reasons."), | |
5bf193a2 | 713 | NULL, |
920d2a44 | 714 | show_dcache_enabled_p, |
5bf193a2 | 715 | &setlist, &showlist); |
c906108c SS |
716 | |
717 | add_info ("dcache", dcache_info, | |
07128da0 DE |
718 | _("\ |
719 | Print information on the dcache performance.\n\ | |
25f122dc DE |
720 | With no arguments, this command prints the cache configuration and a\n\ |
721 | summary of each line in the cache. Use \"info dcache <lineno> to dump\"\n\ | |
722 | the contents of a given line.")); | |
1a532630 PP |
723 | |
724 | add_prefix_cmd ("dcache", class_obscure, set_dcache_command, _("\ | |
725 | Use this command to set number of lines in dcache and line-size."), | |
726 | &dcache_set_list, "set dcache ", /*allow_unknown*/0, &setlist); | |
727 | add_prefix_cmd ("dcache", class_obscure, show_dcache_command, _("\ | |
728 | Show dcachesettings."), | |
729 | &dcache_show_list, "show dcache ", /*allow_unknown*/0, &showlist); | |
730 | ||
dfd1f9bb PA |
731 | add_setshow_zuinteger_cmd ("line-size", class_obscure, |
732 | &dcache_line_size, _("\ | |
1a532630 PP |
733 | Set dcache line size in bytes (must be power of 2)."), _("\ |
734 | Show dcache line size."), | |
dfd1f9bb PA |
735 | NULL, |
736 | set_dcache_line_size, | |
737 | NULL, | |
738 | &dcache_set_list, &dcache_show_list); | |
739 | add_setshow_zuinteger_cmd ("size", class_obscure, | |
740 | &dcache_size, _("\ | |
1a532630 PP |
741 | Set number of dcache lines."), _("\ |
742 | Show number of dcache lines."), | |
dfd1f9bb PA |
743 | NULL, |
744 | set_dcache_size, | |
745 | NULL, | |
746 | &dcache_set_list, &dcache_show_list); | |
c906108c | 747 | } |