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.
 
 
 
 
 
 

110 lines
3.4 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 <helper/types.h>
  27. #include "register.h"
  28. #include <helper/log.h>
  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. struct reg* register_get_by_name(struct reg_cache *first,
  39. const char *name, bool search_all)
  40. {
  41. unsigned i;
  42. struct reg_cache *cache = first;
  43. while (cache)
  44. {
  45. for (i = 0; i < cache->num_regs; i++)
  46. {
  47. if (strcmp(cache->reg_list[i].name, name) == 0)
  48. return &(cache->reg_list[i]);
  49. }
  50. if (search_all)
  51. cache = cache->next;
  52. else
  53. break;
  54. }
  55. return NULL;
  56. }
  57. struct reg_cache** register_get_last_cache_p(struct reg_cache **first)
  58. {
  59. struct reg_cache **cache_p = first;
  60. if (*cache_p)
  61. while (*cache_p)
  62. cache_p = &((*cache_p)->next);
  63. else
  64. return first;
  65. return cache_p;
  66. }
  67. /** Marks the contents of the register cache as invalid (and clean). */
  68. void register_cache_invalidate(struct reg_cache *cache)
  69. {
  70. struct reg *reg = cache->reg_list;
  71. for (unsigned n = cache->num_regs; n != 0; n--, reg++) {
  72. reg->valid = 0;
  73. reg->dirty = 0;
  74. }
  75. }
  76. static int register_get_dummy_core_reg(struct reg *reg)
  77. {
  78. return ERROR_OK;
  79. }
  80. static int register_set_dummy_core_reg(struct reg *reg, uint8_t *buf)
  81. {
  82. reg->dirty = 1;
  83. reg->valid = 1;
  84. return ERROR_OK;
  85. }
  86. static const struct reg_arch_type dummy_type = {
  87. .get = register_get_dummy_core_reg,
  88. .set = register_set_dummy_core_reg,
  89. };
  90. void register_init_dummy(struct reg *reg)
  91. {
  92. reg->type = &dummy_type;
  93. }