You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 

108 lines
3.3 KiB

  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, write to the *
  20. * Free Software Foundation, Inc., *
  21. * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
  22. ***************************************************************************/
  23. #ifdef HAVE_CONFIG_H
  24. #include "config.h"
  25. #endif
  26. #include "register.h"
  27. #include <helper/log.h>
  28. /**
  29. * @file
  30. * Holds utilities to work with register caches.
  31. *
  32. * OpenOCD uses machine registers internally, and exposes them by name
  33. * to Tcl scripts. Sets of related registers are grouped into caches.
  34. * For example, a CPU core will expose a set of registers, and there
  35. * may be separate registers associated with debug or trace modules.
  36. */
  37. struct reg *register_get_by_name(struct reg_cache *first,
  38. const char *name, bool search_all)
  39. {
  40. unsigned i;
  41. struct reg_cache *cache = first;
  42. while (cache) {
  43. for (i = 0; i < cache->num_regs; i++) {
  44. if (strcmp(cache->reg_list[i].name, name) == 0)
  45. return &(cache->reg_list[i]);
  46. }
  47. if (search_all)
  48. cache = cache->next;
  49. else
  50. break;
  51. }
  52. return NULL;
  53. }
  54. struct reg_cache **register_get_last_cache_p(struct reg_cache **first)
  55. {
  56. struct reg_cache **cache_p = first;
  57. if (*cache_p)
  58. while (*cache_p)
  59. cache_p = &((*cache_p)->next);
  60. else
  61. return first;
  62. return cache_p;
  63. }
  64. /** Marks the contents of the register cache as invalid (and clean). */
  65. void register_cache_invalidate(struct reg_cache *cache)
  66. {
  67. struct reg *reg = cache->reg_list;
  68. for (unsigned n = cache->num_regs; n != 0; n--, reg++) {
  69. reg->valid = 0;
  70. reg->dirty = 0;
  71. }
  72. }
  73. static int register_get_dummy_core_reg(struct reg *reg)
  74. {
  75. return ERROR_OK;
  76. }
  77. static int register_set_dummy_core_reg(struct reg *reg, uint8_t *buf)
  78. {
  79. reg->dirty = 1;
  80. reg->valid = 1;
  81. return ERROR_OK;
  82. }
  83. static const struct reg_arch_type dummy_type = {
  84. .get = register_get_dummy_core_reg,
  85. .set = register_set_dummy_core_reg,
  86. };
  87. void register_init_dummy(struct reg *reg)
  88. {
  89. reg->type = &dummy_type;
  90. }