target/riscv-011: Fix memory leak in handle_halt_routine()
[openocd.git] / src / target / register.c
1 /***************************************************************************
2 * Copyright (C) 2005 by Dominic Rath *
3 * Dominic.Rath@gmx.de *
4 * *
5 * Copyright (C) 2007,2008 √ėyvind Harboe *
6 * oyvind.harboe@zylin.com *
7 * *
8 * This program is free software; you can redistribute it and/or modify *
9 * it under the terms of the GNU General Public License as published by *
10 * the Free Software Foundation; either version 2 of the License, or *
11 * (at your option) any later version. *
12 * *
13 * This program is distributed in the hope that it will be useful, *
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of *
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
16 * GNU General Public License for more details. *
17 * *
18 * You should have received a copy of the GNU General Public License *
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. *
20 ***************************************************************************/
21
22 #ifdef HAVE_CONFIG_H
23 #include "config.h"
24 #endif
25
26 #include "register.h"
27 #include <helper/log.h>
28
29 /**
30 * @file
31 * Holds utilities to work with register caches.
32 *
33 * OpenOCD uses machine registers internally, and exposes them by name
34 * to Tcl scripts. Sets of related registers are grouped into caches.
35 * For example, a CPU core will expose a set of registers, and there
36 * may be separate registers associated with debug or trace modules.
37 */
38
39 struct reg *register_get_by_name(struct reg_cache *first,
40 const char *name, bool search_all)
41 {
42 unsigned i;
43 struct reg_cache *cache = first;
44
45 while (cache) {
46 for (i = 0; i < cache->num_regs; i++) {
47 if (cache->reg_list[i].exist == false)
48 continue;
49 if (strcmp(cache->reg_list[i].name, name) == 0)
50 return &(cache->reg_list[i]);
51 }
52
53 if (search_all)
54 cache = cache->next;
55 else
56 break;
57 }
58
59 return NULL;
60 }
61
62 struct reg_cache **register_get_last_cache_p(struct reg_cache **first)
63 {
64 struct reg_cache **cache_p = first;
65
66 if (*cache_p)
67 while (*cache_p)
68 cache_p = &((*cache_p)->next);
69 else
70 return first;
71
72 return cache_p;
73 }
74
75 void register_unlink_cache(struct reg_cache **cache_p, const struct reg_cache *cache)
76 {
77 while (*cache_p && *cache_p != cache)
78 cache_p = &((*cache_p)->next);
79 if (*cache_p)
80 *cache_p = cache->next;
81 }
82
83 /** Marks the contents of the register cache as invalid (and clean). */
84 void register_cache_invalidate(struct reg_cache *cache)
85 {
86 struct reg *reg = cache->reg_list;
87
88 for (unsigned n = cache->num_regs; n != 0; n--, reg++) {
89 if (reg->exist == false)
90 continue;
91 reg->valid = 0;
92 reg->dirty = 0;
93 }
94 }
95
96 static int register_get_dummy_core_reg(struct reg *reg)
97 {
98 return ERROR_OK;
99 }
100
101 static int register_set_dummy_core_reg(struct reg *reg, uint8_t *buf)
102 {
103 reg->dirty = 1;
104 reg->valid = 1;
105
106 return ERROR_OK;
107 }
108
109 static const struct reg_arch_type dummy_type = {
110 .get = register_get_dummy_core_reg,
111 .set = register_set_dummy_core_reg,
112 };
113
114 void register_init_dummy(struct reg *reg)
115 {
116 reg->type = &dummy_type;
117 }