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.
 
 
 
 
 
 

105 lines
2.8 KiB

  1. /***************************************************************************
  2. * Copyright (C) 2005 by Dominic Rath *
  3. * Dominic.Rath@gmx.de *
  4. * *
  5. * This program is free software; you can redistribute it and/or modify *
  6. * it under the terms of the GNU General Public License as published by *
  7. * the Free Software Foundation; either version 2 of the License, or *
  8. * (at your option) any later version. *
  9. * *
  10. * This program is distributed in the hope that it will be useful, *
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of *
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
  13. * GNU General Public License for more details. *
  14. * *
  15. * You should have received a copy of the GNU General Public License *
  16. * along with this program; if not, write to the *
  17. * Free Software Foundation, Inc., *
  18. * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
  19. ***************************************************************************/
  20. #ifdef HAVE_CONFIG_H
  21. #include "config.h"
  22. #endif
  23. #include "register.h"
  24. #include "log.h"
  25. #include "command.h"
  26. #include <string.h>
  27. #include <stdlib.h>
  28. reg_arch_type_t *reg_arch_types = NULL;
  29. reg_t* register_get_by_name(reg_cache_t *first, char *name, int search_all)
  30. {
  31. int i;
  32. reg_cache_t *cache = first;
  33. while (cache)
  34. {
  35. for (i = 0; i < cache->num_regs; i++)
  36. {
  37. if (strcmp(cache->reg_list[i].name, name) == 0)
  38. return &(cache->reg_list[i]);
  39. }
  40. if (search_all)
  41. cache = cache->next;
  42. else
  43. break;
  44. }
  45. return NULL;
  46. }
  47. reg_cache_t** register_get_last_cache_p(reg_cache_t **first)
  48. {
  49. reg_cache_t **cache_p = first;
  50. if (*cache_p)
  51. while (*cache_p)
  52. cache_p = &((*cache_p)->next);
  53. else
  54. return first;
  55. return cache_p;
  56. }
  57. int register_reg_arch_type(int (*get)(reg_t *reg), int (*set)(reg_t *reg, u8 *buf))
  58. {
  59. reg_arch_type_t** arch_type_p = &reg_arch_types;
  60. int id = 0;
  61. if (*arch_type_p)
  62. {
  63. while (*arch_type_p)
  64. {
  65. id = (*arch_type_p)->id;
  66. arch_type_p = &((*arch_type_p)->next);
  67. }
  68. }
  69. (*arch_type_p) = malloc(sizeof(reg_arch_type_t));
  70. (*arch_type_p)->id = id + 1;
  71. (*arch_type_p)->set = set;
  72. (*arch_type_p)->get = get;
  73. (*arch_type_p)->next = NULL;
  74. return id + 1;
  75. }
  76. reg_arch_type_t* register_get_arch_type(int id)
  77. {
  78. reg_arch_type_t *arch_type = reg_arch_types;
  79. while (arch_type)
  80. {
  81. if (arch_type->id == id)
  82. return arch_type;
  83. arch_type = arch_type->next;
  84. }
  85. return NULL;
  86. }