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" | |
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 YQ |
339 | |
340 | res = target_read (current_target.beneath, TARGET_OBJECT_RAW_MEMORY, | |
cf7a04e8 DJ |
341 | NULL, myaddr, memaddr, reg_len); |
342 | if (res < reg_len) | |
343 | return 0; | |
8edbea78 | 344 | |
cf7a04e8 DJ |
345 | memaddr += res; |
346 | myaddr += res; | |
347 | len -= res; | |
8edbea78 C |
348 | } |
349 | ||
8edbea78 C |
350 | return 1; |
351 | } | |
352 | ||
c906108c | 353 | /* Get a free cache block, put or keep it on the valid list, |
f1d7622b | 354 | and return its address. */ |
c906108c SS |
355 | |
356 | static struct dcache_block * | |
f1d7622b | 357 | dcache_alloc (DCACHE *dcache, CORE_ADDR addr) |
c906108c | 358 | { |
52f0bd74 | 359 | struct dcache_block *db; |
c906108c | 360 | |
1a532630 | 361 | if (dcache->size >= dcache_size) |
c906108c | 362 | { |
6ffb2242 | 363 | /* Evict the least recently allocated line. */ |
25f122dc | 364 | db = dcache->oldest; |
6ffb2242 | 365 | remove_block (&dcache->oldest, db); |
25f122dc DE |
366 | |
367 | splay_tree_remove (dcache->tree, (splay_tree_key) db->addr); | |
c906108c SS |
368 | } |
369 | else | |
370 | { | |
25f122dc DE |
371 | db = dcache->freelist; |
372 | if (db) | |
6ffb2242 | 373 | remove_block (&dcache->freelist, db); |
25f122dc | 374 | else |
1a532630 PP |
375 | db = xmalloc (offsetof (struct dcache_block, data) + |
376 | dcache->line_size); | |
c906108c | 377 | |
25f122dc | 378 | dcache->size++; |
c906108c SS |
379 | } |
380 | ||
1a532630 | 381 | db->addr = MASK (dcache, addr); |
f1d7622b | 382 | db->refs = 0; |
f1d7622b | 383 | |
6ffb2242 DE |
384 | /* Put DB at the end of the list, it's the newest. */ |
385 | append_block (&dcache->oldest, db); | |
c906108c | 386 | |
25f122dc DE |
387 | splay_tree_insert (dcache->tree, (splay_tree_key) db->addr, |
388 | (splay_tree_value) db); | |
c906108c | 389 | |
25f122dc | 390 | return db; |
c906108c SS |
391 | } |
392 | ||
7f79c47e | 393 | /* Using the data cache DCACHE, store in *PTR the contents of the byte at |
8edbea78 C |
394 | address ADDR in the remote machine. |
395 | ||
25f122dc | 396 | Returns 1 for success, 0 for error. */ |
8edbea78 C |
397 | |
398 | static int | |
6c932e54 | 399 | dcache_peek_byte (DCACHE *dcache, CORE_ADDR addr, gdb_byte *ptr) |
8edbea78 | 400 | { |
52f0bd74 | 401 | struct dcache_block *db = dcache_hit (dcache, addr); |
8edbea78 C |
402 | |
403 | if (!db) | |
404 | { | |
405 | db = dcache_alloc (dcache, addr); | |
25f122dc DE |
406 | |
407 | if (!dcache_read_line (dcache, db)) | |
8edbea78 C |
408 | return 0; |
409 | } | |
410 | ||
1a532630 | 411 | *ptr = db->data[XFORM (dcache, addr)]; |
8edbea78 C |
412 | return 1; |
413 | } | |
414 | ||
c906108c | 415 | /* Write the byte at PTR into ADDR in the data cache. |
25f122dc DE |
416 | |
417 | The caller is responsible for also promptly writing the data | |
418 | through to target memory. | |
419 | ||
420 | If addr is not in cache, this function does nothing; writing to | |
421 | an area of memory which wasn't present in the cache doesn't cause | |
422 | it to be loaded in. | |
423 | ||
4e5d721f | 424 | Always return 1 (meaning success) to simplify dcache_xfer_memory. */ |
c906108c SS |
425 | |
426 | static int | |
6c932e54 | 427 | dcache_poke_byte (DCACHE *dcache, CORE_ADDR addr, gdb_byte *ptr) |
c906108c | 428 | { |
52f0bd74 | 429 | struct dcache_block *db = dcache_hit (dcache, addr); |
c906108c | 430 | |
25f122dc | 431 | if (db) |
1a532630 | 432 | db->data[XFORM (dcache, addr)] = *ptr; |
c906108c | 433 | |
c906108c SS |
434 | return 1; |
435 | } | |
436 | ||
25f122dc DE |
437 | static int |
438 | dcache_splay_tree_compare (splay_tree_key a, splay_tree_key b) | |
439 | { | |
440 | if (a > b) | |
441 | return 1; | |
442 | else if (a == b) | |
443 | return 0; | |
444 | else | |
445 | return -1; | |
446 | } | |
447 | ||
7f79c47e | 448 | /* Allocate and initialize a data cache. */ |
25f122dc | 449 | |
c906108c | 450 | DCACHE * |
4930751a | 451 | dcache_init (void) |
c906108c | 452 | { |
c906108c SS |
453 | DCACHE *dcache; |
454 | ||
455 | dcache = (DCACHE *) xmalloc (sizeof (*dcache)); | |
c906108c | 456 | |
25f122dc DE |
457 | dcache->tree = splay_tree_new (dcache_splay_tree_compare, |
458 | NULL, | |
459 | NULL); | |
c906108c | 460 | |
25f122dc | 461 | dcache->oldest = NULL; |
25f122dc DE |
462 | dcache->freelist = NULL; |
463 | dcache->size = 0; | |
1a532630 | 464 | dcache->line_size = dcache_line_size; |
4e5d721f | 465 | dcache->ptid = null_ptid; |
25f122dc | 466 | |
c906108c SS |
467 | return dcache; |
468 | } | |
469 | ||
e99586d5 | 470 | |
c906108c SS |
471 | /* Read or write LEN bytes from inferior memory at MEMADDR, transferring |
472 | to or from debugger address MYADDR. Write to inferior if SHOULD_WRITE is | |
473 | nonzero. | |
474 | ||
7f79c47e DE |
475 | Return the number of bytes actually transfered, or -1 if the |
476 | transfer is not supported or otherwise fails. Return of a non-negative | |
477 | value less than LEN indicates that no further transfer is possible. | |
478 | NOTE: This is different than the to_xfer_partial interface, in which | |
479 | positive values less than LEN mean further transfers may be possible. */ | |
c906108c SS |
480 | |
481 | int | |
25f122dc DE |
482 | dcache_xfer_memory (struct target_ops *ops, DCACHE *dcache, |
483 | CORE_ADDR memaddr, gdb_byte *myaddr, | |
1b0ba102 | 484 | int len, int should_write) |
c906108c SS |
485 | { |
486 | int i; | |
25f122dc | 487 | int res; |
6c932e54 | 488 | int (*xfunc) (DCACHE *dcache, CORE_ADDR addr, gdb_byte *ptr); |
9a619af0 | 489 | |
29e57380 | 490 | xfunc = should_write ? dcache_poke_byte : dcache_peek_byte; |
c906108c | 491 | |
4e5d721f DE |
492 | /* If this is a different inferior from what we've recorded, |
493 | flush the cache. */ | |
494 | ||
495 | if (! ptid_equal (inferior_ptid, dcache->ptid)) | |
496 | { | |
497 | dcache_invalidate (dcache); | |
498 | dcache->ptid = inferior_ptid; | |
499 | } | |
500 | ||
25f122dc DE |
501 | /* Do write-through first, so that if it fails, we don't write to |
502 | the cache at all. */ | |
503 | ||
504 | if (should_write) | |
505 | { | |
506 | res = target_write (ops, TARGET_OBJECT_RAW_MEMORY, | |
507 | NULL, myaddr, memaddr, len); | |
4e5d721f DE |
508 | if (res <= 0) |
509 | return res; | |
510 | /* Update LEN to what was actually written. */ | |
511 | len = res; | |
25f122dc DE |
512 | } |
513 | ||
29e57380 | 514 | for (i = 0; i < len; i++) |
c906108c | 515 | { |
29e57380 | 516 | if (!xfunc (dcache, memaddr + i, myaddr + i)) |
4e5d721f DE |
517 | { |
518 | /* That failed. Discard its cache line so we don't have a | |
519 | partially read line. */ | |
520 | dcache_invalidate_line (dcache, memaddr + i); | |
521 | /* If we're writing, we still wrote LEN bytes. */ | |
522 | if (should_write) | |
523 | return len; | |
524 | else | |
525 | return i; | |
526 | } | |
c906108c | 527 | } |
25f122dc DE |
528 | |
529 | return len; | |
530 | } | |
c906108c | 531 | |
25f122dc DE |
532 | /* FIXME: There would be some benefit to making the cache write-back and |
533 | moving the writeback operation to a higher layer, as it could occur | |
534 | after a sequence of smaller writes have been completed (as when a stack | |
535 | frame is constructed for an inferior function call). Note that only | |
536 | moving it up one level to target_xfer_memory[_partial]() is not | |
537 | sufficient since we want to coalesce memory transfers that are | |
538 | "logically" connected but not actually a single call to one of the | |
539 | memory transfer functions. */ | |
29e57380 | 540 | |
4e5d721f DE |
541 | /* Just update any cache lines which are already present. This is called |
542 | by memory_xfer_partial in cases where the access would otherwise not go | |
543 | through the cache. */ | |
544 | ||
545 | void | |
546 | dcache_update (DCACHE *dcache, CORE_ADDR memaddr, gdb_byte *myaddr, int len) | |
547 | { | |
548 | int i; | |
9a619af0 | 549 | |
4e5d721f DE |
550 | for (i = 0; i < len; i++) |
551 | dcache_poke_byte (dcache, memaddr + i, myaddr + i); | |
552 | } | |
553 | ||
2a2f9fe4 YQ |
554 | /* Print DCACHE line INDEX. */ |
555 | ||
25f122dc | 556 | static void |
2a2f9fe4 | 557 | dcache_print_line (DCACHE *dcache, int index) |
25f122dc DE |
558 | { |
559 | splay_tree_node n; | |
560 | struct dcache_block *db; | |
561 | int i, j; | |
562 | ||
2a2f9fe4 | 563 | if (dcache == NULL) |
25f122dc DE |
564 | { |
565 | printf_filtered (_("No data cache available.\n")); | |
566 | return; | |
567 | } | |
568 | ||
2a2f9fe4 | 569 | n = splay_tree_min (dcache->tree); |
25f122dc DE |
570 | |
571 | for (i = index; i > 0; --i) | |
572 | { | |
573 | if (!n) | |
574 | break; | |
2a2f9fe4 | 575 | n = splay_tree_successor (dcache->tree, n->key); |
25f122dc DE |
576 | } |
577 | ||
578 | if (!n) | |
579 | { | |
580 | printf_filtered (_("No such cache line exists.\n")); | |
581 | return; | |
582 | } | |
29e57380 | 583 | |
25f122dc DE |
584 | db = (struct dcache_block *) n->value; |
585 | ||
51939b3d | 586 | printf_filtered (_("Line %d: address %s [%d hits]\n"), |
f5656ead | 587 | index, paddress (target_gdbarch (), db->addr), db->refs); |
25f122dc | 588 | |
2a2f9fe4 | 589 | for (j = 0; j < dcache->line_size; j++) |
25f122dc DE |
590 | { |
591 | printf_filtered ("%02x ", db->data[j]); | |
592 | ||
0963b4bd | 593 | /* Print a newline every 16 bytes (48 characters). */ |
2a2f9fe4 | 594 | if ((j % 16 == 15) && (j != dcache->line_size - 1)) |
25f122dc DE |
595 | printf_filtered ("\n"); |
596 | } | |
597 | printf_filtered ("\n"); | |
c906108c SS |
598 | } |
599 | ||
2a2f9fe4 YQ |
600 | /* Parse EXP and show the info about DCACHE. */ |
601 | ||
c5aa993b | 602 | static void |
2a2f9fe4 | 603 | dcache_info_1 (DCACHE *dcache, char *exp) |
c906108c | 604 | { |
25f122dc | 605 | splay_tree_node n; |
9128a503 | 606 | int i, refcount; |
25f122dc DE |
607 | |
608 | if (exp) | |
609 | { | |
610 | char *linestart; | |
9a619af0 | 611 | |
25f122dc DE |
612 | i = strtol (exp, &linestart, 10); |
613 | if (linestart == exp || i < 0) | |
614 | { | |
615 | printf_filtered (_("Usage: info dcache [linenumber]\n")); | |
616 | return; | |
617 | } | |
c906108c | 618 | |
2a2f9fe4 | 619 | dcache_print_line (dcache, i); |
25f122dc DE |
620 | return; |
621 | } | |
622 | ||
1a532630 PP |
623 | printf_filtered (_("Dcache %u lines of %u bytes each.\n"), |
624 | dcache_size, | |
2a2f9fe4 | 625 | dcache ? (unsigned) dcache->line_size |
1a532630 | 626 | : dcache_line_size); |
c906108c | 627 | |
2a2f9fe4 | 628 | if (dcache == NULL || ptid_equal (dcache->ptid, null_ptid)) |
c906108c | 629 | { |
25f122dc DE |
630 | printf_filtered (_("No data cache available.\n")); |
631 | return; | |
632 | } | |
5e2039ea | 633 | |
4e5d721f | 634 | printf_filtered (_("Contains data for %s\n"), |
2a2f9fe4 | 635 | target_pid_to_str (dcache->ptid)); |
4e5d721f | 636 | |
25f122dc | 637 | refcount = 0; |
c906108c | 638 | |
2a2f9fe4 | 639 | n = splay_tree_min (dcache->tree); |
25f122dc | 640 | i = 0; |
c906108c | 641 | |
25f122dc DE |
642 | while (n) |
643 | { | |
644 | struct dcache_block *db = (struct dcache_block *) n->value; | |
645 | ||
51939b3d | 646 | printf_filtered (_("Line %d: address %s [%d hits]\n"), |
f5656ead | 647 | i, paddress (target_gdbarch (), db->addr), db->refs); |
25f122dc DE |
648 | i++; |
649 | refcount += db->refs; | |
650 | ||
2a2f9fe4 | 651 | n = splay_tree_successor (dcache->tree, n->key); |
c906108c | 652 | } |
25f122dc DE |
653 | |
654 | printf_filtered (_("Cache state: %d active lines, %d hits\n"), i, refcount); | |
c906108c SS |
655 | } |
656 | ||
2a2f9fe4 YQ |
657 | static void |
658 | dcache_info (char *exp, int tty) | |
659 | { | |
660 | dcache_info_1 (target_dcache_get (), exp); | |
661 | } | |
662 | ||
1a532630 PP |
663 | static void |
664 | set_dcache_size (char *args, int from_tty, | |
665 | struct cmd_list_element *c) | |
666 | { | |
667 | if (dcache_size == 0) | |
668 | { | |
669 | dcache_size = DCACHE_DEFAULT_SIZE; | |
670 | error (_("Dcache size must be greater than 0.")); | |
671 | } | |
2a2f9fe4 | 672 | target_dcache_invalidate (); |
1a532630 PP |
673 | } |
674 | ||
675 | static void | |
676 | set_dcache_line_size (char *args, int from_tty, | |
677 | struct cmd_list_element *c) | |
678 | { | |
679 | if (dcache_line_size < 2 | |
680 | || (dcache_line_size & (dcache_line_size - 1)) != 0) | |
681 | { | |
682 | unsigned d = dcache_line_size; | |
683 | dcache_line_size = DCACHE_DEFAULT_LINE_SIZE; | |
684 | error (_("Invalid dcache line size: %u (must be power of 2)."), d); | |
685 | } | |
2a2f9fe4 | 686 | target_dcache_invalidate (); |
1a532630 PP |
687 | } |
688 | ||
689 | static void | |
690 | set_dcache_command (char *arg, int from_tty) | |
691 | { | |
692 | printf_unfiltered ( | |
693 | "\"set dcache\" must be followed by the name of a subcommand.\n"); | |
694 | help_list (dcache_set_list, "set dcache ", -1, gdb_stdout); | |
695 | } | |
696 | ||
697 | static void | |
698 | show_dcache_command (char *args, int from_tty) | |
699 | { | |
700 | cmd_show_list (dcache_show_list, from_tty, ""); | |
701 | } | |
702 | ||
c906108c | 703 | void |
fba45db2 | 704 | _initialize_dcache (void) |
c906108c | 705 | { |
5bf193a2 AC |
706 | add_setshow_boolean_cmd ("remotecache", class_support, |
707 | &dcache_enabled_p, _("\ | |
708 | Set cache use for remote targets."), _("\ | |
709 | Show cache use for remote targets."), _("\ | |
4e5d721f DE |
710 | This used to enable the data cache for remote targets. The cache\n\ |
711 | functionality is now controlled by the memory region system and the\n\ | |
712 | \"stack-cache\" flag; \"remotecache\" now does nothing and\n\ | |
713 | exists only for compatibility reasons."), | |
5bf193a2 | 714 | NULL, |
920d2a44 | 715 | show_dcache_enabled_p, |
5bf193a2 | 716 | &setlist, &showlist); |
c906108c SS |
717 | |
718 | add_info ("dcache", dcache_info, | |
07128da0 DE |
719 | _("\ |
720 | Print information on the dcache performance.\n\ | |
25f122dc DE |
721 | With no arguments, this command prints the cache configuration and a\n\ |
722 | summary of each line in the cache. Use \"info dcache <lineno> to dump\"\n\ | |
723 | the contents of a given line.")); | |
1a532630 PP |
724 | |
725 | add_prefix_cmd ("dcache", class_obscure, set_dcache_command, _("\ | |
726 | Use this command to set number of lines in dcache and line-size."), | |
727 | &dcache_set_list, "set dcache ", /*allow_unknown*/0, &setlist); | |
728 | add_prefix_cmd ("dcache", class_obscure, show_dcache_command, _("\ | |
729 | Show dcachesettings."), | |
730 | &dcache_show_list, "show dcache ", /*allow_unknown*/0, &showlist); | |
731 | ||
dfd1f9bb PA |
732 | add_setshow_zuinteger_cmd ("line-size", class_obscure, |
733 | &dcache_line_size, _("\ | |
1a532630 PP |
734 | Set dcache line size in bytes (must be power of 2)."), _("\ |
735 | Show dcache line size."), | |
dfd1f9bb PA |
736 | NULL, |
737 | set_dcache_line_size, | |
738 | NULL, | |
739 | &dcache_set_list, &dcache_show_list); | |
740 | add_setshow_zuinteger_cmd ("size", class_obscure, | |
741 | &dcache_size, _("\ | |
1a532630 PP |
742 | Set number of dcache lines."), _("\ |
743 | Show number of dcache lines."), | |
dfd1f9bb PA |
744 | NULL, |
745 | set_dcache_size, | |
746 | NULL, | |
747 | &dcache_set_list, &dcache_show_list); | |
c906108c | 748 | } |