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