1 /***************************************************************************
2 * Copyright (C) 2005 by Dominic Rath *
3 * Dominic.Rath@gmx.de *
5 * Copyright (C) 2007,2008 Øyvind Harboe *
6 * oyvind.harboe@zylin.com *
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. *
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. *
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 ***************************************************************************/
27 #include <helper/log.h>
31 * Holds utilities to work with register caches.
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.
39 struct reg *register_get_by_number(struct reg_cache *first,
40 uint32_t reg_num, bool search_all)
43 struct reg_cache *cache = first;
46 for (i = 0; i < cache->num_regs; i++) {
47 if (cache->reg_list[i].exist == false)
49 if (cache->reg_list[i].number == reg_num)
50 return &(cache->reg_list[i]);
62 struct reg *register_get_by_name(struct reg_cache *first,
63 const char *name, bool search_all)
66 struct reg_cache *cache = first;
69 for (i = 0; i < cache->num_regs; i++) {
70 if (cache->reg_list[i].exist == false)
72 if (strcmp(cache->reg_list[i].name, name) == 0)
73 return &(cache->reg_list[i]);
85 struct reg_cache **register_get_last_cache_p(struct reg_cache **first)
87 struct reg_cache **cache_p = first;
91 cache_p = &((*cache_p)->next);
98 void register_unlink_cache(struct reg_cache **cache_p, const struct reg_cache *cache)
100 while (*cache_p && *cache_p != cache)
101 cache_p = &((*cache_p)->next);
103 *cache_p = cache->next;
106 /** Marks the contents of the register cache as invalid (and clean). */
107 void register_cache_invalidate(struct reg_cache *cache)
109 struct reg *reg = cache->reg_list;
111 for (unsigned n = cache->num_regs; n != 0; n--, reg++) {
112 if (reg->exist == false)
119 static int register_get_dummy_core_reg(struct reg *reg)
124 static int register_set_dummy_core_reg(struct reg *reg, uint8_t *buf)
132 static const struct reg_arch_type dummy_type = {
133 .get = register_get_dummy_core_reg,
134 .set = register_set_dummy_core_reg,
137 void register_init_dummy(struct reg *reg)
139 reg->type = &dummy_type;