btrace: honour scheduler-locking for all-stop targets
[deliverable/binutils-gdb.git] / gdb / gdbserver / regcache.c
CommitLineData
0a30fbc4 1/* Register support routines for the remote server for GDB.
32d0add0 2 Copyright (C) 2001-2015 Free Software Foundation, Inc.
0a30fbc4
DJ
3
4 This file is part of GDB.
5
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
a9762ec7 8 the Free Software Foundation; either version 3 of the License, or
0a30fbc4
DJ
9 (at your option) any later version.
10
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
15
16 You should have received a copy of the GNU General Public License
a9762ec7 17 along with this program. If not, see <http://www.gnu.org/licenses/>. */
0a30fbc4
DJ
18
19#include "server.h"
20#include "regdef.h"
623b6bdf 21#include "gdbthread.h"
3aee8918 22#include "tdesc.h"
9c3d6531 23#include "rsp-low.h"
fa593d66
PA
24#ifndef IN_PROCESS_AGENT
25
442ea881
PA
26struct regcache *
27get_thread_regcache (struct thread_info *thread, int fetch)
c04a1aa8 28{
442ea881 29 struct regcache *regcache;
c04a1aa8 30
a44892be 31 regcache = inferior_regcache_data (thread);
c04a1aa8 32
3aee8918
PA
33 /* Threads' regcaches are created lazily, because biarch targets add
34 the main thread/lwp before seeing it stop for the first time, and
35 it is only after the target sees the thread stop for the first
36 time that the target has a chance of determining the process's
37 architecture. IOW, when we first add the process's main thread
38 we don't know which architecture/tdesc its regcache should
39 have. */
c04a1aa8 40 if (regcache == NULL)
3aee8918
PA
41 {
42 struct process_info *proc = get_thread_process (thread);
43
38e08fca 44 gdb_assert (proc->tdesc != NULL);
3aee8918
PA
45
46 regcache = new_register_cache (proc->tdesc);
47 set_inferior_regcache_data (thread, regcache);
48 }
c04a1aa8 49
0d62e5e8
DJ
50 if (fetch && regcache->registers_valid == 0)
51 {
0bfdf32f 52 struct thread_info *saved_thread = current_thread;
442ea881 53
0bfdf32f 54 current_thread = thread;
098dbe61
AA
55 /* Invalidate all registers, to prevent stale left-overs. */
56 memset (regcache->register_status, REG_UNAVAILABLE,
57 regcache->tdesc->num_registers);
442ea881 58 fetch_inferior_registers (regcache, -1);
0bfdf32f 59 current_thread = saved_thread;
0d62e5e8
DJ
60 regcache->registers_valid = 1;
61 }
62
c04a1aa8
DJ
63 return regcache;
64}
65
361c8ade
GB
66/* See common/common-regcache.h. */
67
68struct regcache *
69get_thread_regcache_for_ptid (ptid_t ptid)
70{
71 return get_thread_regcache (find_thread_ptid (ptid), 1);
72}
73
0d62e5e8 74void
3aee8918 75regcache_invalidate_thread (struct thread_info *thread)
0d62e5e8 76{
442ea881 77 struct regcache *regcache;
0d62e5e8 78
a44892be 79 regcache = inferior_regcache_data (thread);
0d62e5e8 80
45ba0d02
PA
81 if (regcache == NULL)
82 return;
83
0d62e5e8
DJ
84 if (regcache->registers_valid)
85 {
0bfdf32f 86 struct thread_info *saved_thread = current_thread;
0d62e5e8 87
0bfdf32f 88 current_thread = thread;
442ea881 89 store_inferior_registers (regcache, -1);
0bfdf32f 90 current_thread = saved_thread;
0d62e5e8
DJ
91 }
92
93 regcache->registers_valid = 0;
94}
95
3aee8918
PA
96static int
97regcache_invalidate_one (struct inferior_list_entry *entry,
98 void *pid_p)
99{
100 struct thread_info *thread = (struct thread_info *) entry;
101 int pid = *(int *) pid_p;
102
103 /* Only invalidate the regcaches of threads of this process. */
104 if (ptid_get_pid (entry->id) == pid)
105 regcache_invalidate_thread (thread);
106
107 return 0;
108}
109
0d62e5e8 110void
442ea881 111regcache_invalidate (void)
0d62e5e8 112{
3aee8918 113 /* Only update the threads of the current process. */
0bfdf32f 114 int pid = ptid_get_pid (current_thread->entry.id);
3aee8918
PA
115
116 find_inferior (&all_threads, regcache_invalidate_one, &pid);
0d62e5e8
DJ
117}
118
fa593d66
PA
119#endif
120
219f2f23 121struct regcache *
3aee8918
PA
122init_register_cache (struct regcache *regcache,
123 const struct target_desc *tdesc,
124 unsigned char *regbuf)
219f2f23
PA
125{
126 if (regbuf == NULL)
127 {
87f6c4e3 128#ifndef IN_PROCESS_AGENT
219f2f23
PA
129 /* Make sure to zero-initialize the register cache when it is
130 created, in case there are registers the target never
131 fetches. This way they'll read as zero instead of
132 garbage. */
3aee8918
PA
133 regcache->tdesc = tdesc;
134 regcache->registers = xcalloc (1, tdesc->registers_size);
219f2f23 135 regcache->registers_owned = 1;
3aee8918 136 regcache->register_status = xcalloc (1, tdesc->num_registers);
1c79eb8a 137 gdb_assert (REG_UNAVAILABLE == 0);
fa593d66 138#else
38e08fca 139 gdb_assert_not_reached ("can't allocate memory from the heap");
fa593d66 140#endif
87f6c4e3
GB
141 }
142 else
219f2f23 143 {
3aee8918 144 regcache->tdesc = tdesc;
219f2f23
PA
145 regcache->registers = regbuf;
146 regcache->registers_owned = 0;
1c79eb8a
PA
147#ifndef IN_PROCESS_AGENT
148 regcache->register_status = NULL;
149#endif
219f2f23
PA
150 }
151
152 regcache->registers_valid = 0;
153
154 return regcache;
155}
156
fa593d66
PA
157#ifndef IN_PROCESS_AGENT
158
442ea881 159struct regcache *
3aee8918 160new_register_cache (const struct target_desc *tdesc)
c04a1aa8 161{
8d749320 162 struct regcache *regcache = XCNEW (struct regcache);
c04a1aa8 163
3aee8918 164 gdb_assert (tdesc->registers_size != 0);
5822d809 165
3aee8918 166 return init_register_cache (regcache, tdesc, NULL);
c04a1aa8
DJ
167}
168
169void
442ea881 170free_register_cache (struct regcache *regcache)
c04a1aa8 171{
5822d809
PA
172 if (regcache)
173 {
fa593d66
PA
174 if (regcache->registers_owned)
175 free (regcache->registers);
1c79eb8a 176 free (regcache->register_status);
5822d809
PA
177 free (regcache);
178 }
c04a1aa8
DJ
179}
180
fa593d66
PA
181#endif
182
219f2f23
PA
183void
184regcache_cpy (struct regcache *dst, struct regcache *src)
185{
3aee8918
PA
186 gdb_assert (src != NULL && dst != NULL);
187 gdb_assert (src->tdesc == dst->tdesc);
188 gdb_assert (src != dst);
189
190 memcpy (dst->registers, src->registers, src->tdesc->registers_size);
1c79eb8a
PA
191#ifndef IN_PROCESS_AGENT
192 if (dst->register_status != NULL && src->register_status != NULL)
3aee8918
PA
193 memcpy (dst->register_status, src->register_status,
194 src->tdesc->num_registers);
1c79eb8a 195#endif
219f2f23
PA
196 dst->registers_valid = src->registers_valid;
197}
198
219f2f23 199
fa593d66
PA
200#ifndef IN_PROCESS_AGENT
201
0a30fbc4 202void
442ea881 203registers_to_string (struct regcache *regcache, char *buf)
0a30fbc4 204{
442ea881 205 unsigned char *registers = regcache->registers;
3aee8918 206 const struct target_desc *tdesc = regcache->tdesc;
1c79eb8a 207 int i;
c04a1aa8 208
3aee8918 209 for (i = 0; i < tdesc->num_registers; i++)
1c79eb8a
PA
210 {
211 if (regcache->register_status[i] == REG_VALID)
212 {
e9371aff 213 bin2hex (registers, buf, register_size (tdesc, i));
3aee8918 214 buf += register_size (tdesc, i) * 2;
1c79eb8a
PA
215 }
216 else
217 {
3aee8918
PA
218 memset (buf, 'x', register_size (tdesc, i) * 2);
219 buf += register_size (tdesc, i) * 2;
1c79eb8a 220 }
3aee8918 221 registers += register_size (tdesc, i);
1c79eb8a
PA
222 }
223 *buf = '\0';
0a30fbc4
DJ
224}
225
226void
442ea881 227registers_from_string (struct regcache *regcache, char *buf)
0a30fbc4
DJ
228{
229 int len = strlen (buf);
442ea881 230 unsigned char *registers = regcache->registers;
3aee8918 231 const struct target_desc *tdesc = regcache->tdesc;
0a30fbc4 232
3aee8918 233 if (len != tdesc->registers_size * 2)
0a30fbc4 234 {
1b3f6016 235 warning ("Wrong sized register packet (expected %d bytes, got %d)",
3aee8918
PA
236 2 * tdesc->registers_size, len);
237 if (len > tdesc->registers_size * 2)
238 len = tdesc->registers_size * 2;
0a30fbc4 239 }
a7191e8b 240 hex2bin (buf, registers, len / 2);
0a30fbc4
DJ
241}
242
243struct reg *
3aee8918 244find_register_by_name (const struct target_desc *tdesc, const char *name)
0a30fbc4
DJ
245{
246 int i;
247
3aee8918
PA
248 for (i = 0; i < tdesc->num_registers; i++)
249 if (strcmp (name, tdesc->reg_defs[i].name) == 0)
250 return &tdesc->reg_defs[i];
38e08fca
GB
251 internal_error (__FILE__, __LINE__, "Unknown register %s requested",
252 name);
0a30fbc4
DJ
253}
254
255int
3aee8918 256find_regno (const struct target_desc *tdesc, const char *name)
0a30fbc4
DJ
257{
258 int i;
259
3aee8918
PA
260 for (i = 0; i < tdesc->num_registers; i++)
261 if (strcmp (name, tdesc->reg_defs[i].name) == 0)
0a30fbc4 262 return i;
38e08fca
GB
263 internal_error (__FILE__, __LINE__, "Unknown register %s requested",
264 name);
0a30fbc4
DJ
265}
266
267struct reg *
3aee8918 268find_register_by_number (const struct target_desc *tdesc, int n)
0a30fbc4 269{
3aee8918 270 return &tdesc->reg_defs[n];
0a30fbc4
DJ
271}
272
fa593d66
PA
273#endif
274
3aee8918
PA
275#ifndef IN_PROCESS_AGENT
276static void
277free_register_cache_thread (struct thread_info *thread)
278{
a44892be 279 struct regcache *regcache = inferior_regcache_data (thread);
3aee8918
PA
280
281 if (regcache != NULL)
282 {
283 regcache_invalidate_thread (thread);
284 free_register_cache (regcache);
285 set_inferior_regcache_data (thread, NULL);
286 }
287}
288
289static void
290free_register_cache_thread_one (struct inferior_list_entry *entry)
291{
292 struct thread_info *thread = (struct thread_info *) entry;
293
294 free_register_cache_thread (thread);
295}
296
297void
298regcache_release (void)
299{
300 /* Flush and release all pre-existing register caches. */
301 for_each_inferior (&all_threads, free_register_cache_thread_one);
302}
303#endif
304
0a30fbc4 305int
3aee8918 306register_cache_size (const struct target_desc *tdesc)
0a30fbc4 307{
3aee8918
PA
308 return tdesc->registers_size;
309}
310
311int
312register_size (const struct target_desc *tdesc, int n)
313{
314 return tdesc->reg_defs[n].size / 8;
0a30fbc4
DJ
315}
316
f450004a 317static unsigned char *
442ea881 318register_data (struct regcache *regcache, int n, int fetch)
0a30fbc4 319{
3aee8918 320 return regcache->registers + regcache->tdesc->reg_defs[n].offset / 8;
0a30fbc4
DJ
321}
322
1c79eb8a
PA
323/* Supply register N, whose contents are stored in BUF, to REGCACHE.
324 If BUF is NULL, the register's value is recorded as
325 unavailable. */
326
58caa3dc 327void
442ea881 328supply_register (struct regcache *regcache, int n, const void *buf)
58caa3dc 329{
3327ccf7 330 if (buf)
1c79eb8a 331 {
3aee8918
PA
332 memcpy (register_data (regcache, n, 0), buf,
333 register_size (regcache->tdesc, n));
1c79eb8a
PA
334#ifndef IN_PROCESS_AGENT
335 if (regcache->register_status != NULL)
336 regcache->register_status[n] = REG_VALID;
337#endif
338 }
3327ccf7 339 else
1c79eb8a 340 {
3aee8918
PA
341 memset (register_data (regcache, n, 0), 0,
342 register_size (regcache->tdesc, n));
1c79eb8a
PA
343#ifndef IN_PROCESS_AGENT
344 if (regcache->register_status != NULL)
345 regcache->register_status[n] = REG_UNAVAILABLE;
346#endif
347 }
58caa3dc
DJ
348}
349
1c79eb8a
PA
350/* Supply register N with value zero to REGCACHE. */
351
352void
353supply_register_zeroed (struct regcache *regcache, int n)
354{
3aee8918
PA
355 memset (register_data (regcache, n, 0), 0,
356 register_size (regcache->tdesc, n));
1c79eb8a
PA
357#ifndef IN_PROCESS_AGENT
358 if (regcache->register_status != NULL)
359 regcache->register_status[n] = REG_VALID;
360#endif
361}
362
363/* Supply the whole register set whose contents are stored in BUF, to
364 REGCACHE. If BUF is NULL, all the registers' values are recorded
365 as unavailable. */
366
219f2f23
PA
367void
368supply_regblock (struct regcache *regcache, const void *buf)
369{
370 if (buf)
1c79eb8a 371 {
3aee8918
PA
372 const struct target_desc *tdesc = regcache->tdesc;
373
374 memcpy (regcache->registers, buf, tdesc->registers_size);
1c79eb8a
PA
375#ifndef IN_PROCESS_AGENT
376 {
377 int i;
378
3aee8918 379 for (i = 0; i < tdesc->num_registers; i++)
1c79eb8a
PA
380 regcache->register_status[i] = REG_VALID;
381 }
382#endif
383 }
219f2f23 384 else
1c79eb8a 385 {
3aee8918
PA
386 const struct target_desc *tdesc = regcache->tdesc;
387
388 memset (regcache->registers, 0, tdesc->registers_size);
1c79eb8a
PA
389#ifndef IN_PROCESS_AGENT
390 {
391 int i;
392
3aee8918 393 for (i = 0; i < tdesc->num_registers; i++)
1c79eb8a
PA
394 regcache->register_status[i] = REG_UNAVAILABLE;
395 }
396#endif
397 }
219f2f23
PA
398}
399
fa593d66
PA
400#ifndef IN_PROCESS_AGENT
401
58caa3dc 402void
442ea881
PA
403supply_register_by_name (struct regcache *regcache,
404 const char *name, const void *buf)
58caa3dc 405{
3aee8918 406 supply_register (regcache, find_regno (regcache->tdesc, name), buf);
58caa3dc
DJ
407}
408
fa593d66
PA
409#endif
410
58caa3dc 411void
442ea881 412collect_register (struct regcache *regcache, int n, void *buf)
58caa3dc 413{
3aee8918
PA
414 memcpy (buf, register_data (regcache, n, 1),
415 register_size (regcache->tdesc, n));
0d62e5e8
DJ
416}
417
fa593d66
PA
418#ifndef IN_PROCESS_AGENT
419
0d62e5e8 420void
442ea881 421collect_register_as_string (struct regcache *regcache, int n, char *buf)
0d62e5e8 422{
e9371aff
TT
423 bin2hex (register_data (regcache, n, 1), buf,
424 register_size (regcache->tdesc, n));
58caa3dc
DJ
425}
426
427void
442ea881
PA
428collect_register_by_name (struct regcache *regcache,
429 const char *name, void *buf)
58caa3dc 430{
3aee8918 431 collect_register (regcache, find_regno (regcache->tdesc, name), buf);
58caa3dc 432}
219f2f23
PA
433
434/* Special handling for register PC. */
435
436CORE_ADDR
437regcache_read_pc (struct regcache *regcache)
438{
439 CORE_ADDR pc_val;
440
441 if (the_target->read_pc)
442 pc_val = the_target->read_pc (regcache);
443 else
444 internal_error (__FILE__, __LINE__,
445 "regcache_read_pc: Unable to find PC");
446
447 return pc_val;
448}
449
450void
451regcache_write_pc (struct regcache *regcache, CORE_ADDR pc)
452{
453 if (the_target->write_pc)
454 the_target->write_pc (regcache, pc);
455 else
456 internal_error (__FILE__, __LINE__,
457 "regcache_write_pc: Unable to update PC");
458}
fa593d66
PA
459
460#endif
This page took 1.060107 seconds and 4 git commands to generate.