ra_common.c 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363
  1. /*
  2. * Copyright (C) 2021 Alibaba Group Holding Limited
  3. * Author: LuChongzhi <chongzhi.lcz@alibaba-inc.com>
  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 version 2 as
  7. * published by the Free Software Foundation.
  8. */
  9. #include <stdio.h>
  10. #include <stdlib.h>
  11. #include <stdint.h>
  12. #include <unistd.h>
  13. #include <string.h>
  14. #include <ctype.h>
  15. #include <stdarg.h>
  16. #include "log_common.h"
  17. #include "ra_common.h"
  18. static char reg_desc_tmp[4096];
  19. int ra_dump_reg_fields(reg_analyzer_info_s *ra_info,
  20. const reg_field_s reg_field[], const uint32_t reg_field_count)
  21. {
  22. int i = 0, pos=-1;
  23. int has_meet = 0;
  24. char *reg_name;
  25. char *reg_desc;
  26. uint32_t reg_reset_val;
  27. uint32_t reg_offset = ra_info->reg_offset;
  28. uint32_t reg_val = ra_info->reg_value;
  29. if (strlen(ra_info->reg_name) == 0 && ra_info->reg_offset == INVALID_MAGIC32) {
  30. printf("Invalid reg_name('%s') or reg_offset(0x%08x)\n",
  31. ra_info->reg_name, ra_info->reg_offset);
  32. return -1;
  33. }
  34. for (i = 0; i < reg_field_count; i++) {
  35. if (ra_info->reg_offset == reg_field[i].offset ||
  36. (reg_field[i].reg_name != NULL &&
  37. strncmp(reg_field[i].reg_name, ra_info->reg_name, strlen(reg_field[i].reg_name))==0)) {
  38. pos = i;
  39. reg_offset = reg_field[pos].offset;
  40. reg_desc = reg_field[pos].reg_desc;
  41. reg_name = reg_field[pos].reg_name;
  42. reg_reset_val = reg_field[pos].reset_value;
  43. break;
  44. }
  45. }
  46. if (pos < 0) {
  47. //printf_red("Can't find register offset=0x%x\n", reg_offset);
  48. return -1;
  49. }
  50. printf("\n%-24s %-10s %10s %10s %s\n", " Register Name", "Offset", "ResetValue", "CurrentVal", "Description");
  51. printf("===================================================================================\n");
  52. printf("%-24s 0x%08x 0x%08x ", reg_name, reg_offset, reg_reset_val);
  53. if (reg_reset_val != reg_val)
  54. printf_green("0x%08x", reg_val);
  55. else
  56. printf("0x%08x", reg_val);
  57. printf(" %s\n", reg_desc);
  58. printf("\nBit[s] Len ResetValue CurrentValue(Hex/Dec) FieldName Description\n");
  59. printf("===================================================================================\n");
  60. for (i = pos; i < reg_field_count; i++) {
  61. if (reg_field[i].offset != reg_offset) {
  62. if (has_meet == 1) {
  63. break;
  64. }
  65. continue;
  66. }
  67. uint32_t msb = reg_field[i].msb;
  68. uint32_t lsb = reg_field[i].lsb;
  69. uint32_t curr_field_val = reg_val;
  70. if (msb != 31 || lsb != 0) {
  71. curr_field_val = (reg_val >> lsb) & (~(0xffffffff << (msb - lsb + 1)));
  72. }
  73. uint32_t reset_field_val;
  74. uint32_t field_len = msb - lsb + 1;
  75. reset_field_val = (reg_reset_val >> lsb) & (~(0xffffffff << (msb - lsb + 1)));
  76. if (field_len == 1) {
  77. printf(" %5d ", lsb);
  78. }
  79. else {
  80. printf(" %2d:%2d ", msb, reg_field[i].lsb);
  81. }
  82. printf("%4d ", field_len);
  83. printf("0x%-9x ", reset_field_val);
  84. if (curr_field_val != reset_field_val) {
  85. printf_green("0x%-8x/", curr_field_val);
  86. printf_green("%10u ", curr_field_val);
  87. } else {
  88. printf("0x%-8x/", curr_field_val);
  89. printf("%10u ", curr_field_val);
  90. }
  91. if (reg_field[i].field_name != NULL)
  92. printf("%-24s:", reg_field[i].field_name);
  93. else
  94. printf("%-24s", "");
  95. if (reg_field[i].field_desc != NULL) {
  96. if (strstr(reg_field[i].field_desc, LINE_PADDING_6TAB)) {
  97. strncpy(reg_desc_tmp, reg_field[i].field_desc, sizeof(reg_desc_tmp));
  98. char *p = strstr(reg_desc_tmp, LINE_PADDING_6TAB);
  99. while (p) {
  100. str_replace(p, strlen(LINE_PADDING_6TAB), LINE_PADDING_9TAB);
  101. p = p+strlen(LINE_PADDING_9TAB);
  102. p = strstr(p, LINE_PADDING_6TAB);
  103. }
  104. printf("%-s\n", reg_desc_tmp);
  105. } else {
  106. printf("%-s\n", reg_field[i].field_desc);
  107. }
  108. }
  109. else
  110. printf("%-s\n", "");
  111. if (has_meet == 0) {
  112. has_meet = 1;
  113. }
  114. }
  115. printf("\n");
  116. if (has_meet !=0 )
  117. return 0;
  118. else
  119. return -1;
  120. }
  121. int ra_dump_reg_define(reg_analyzer_info_s *ra_info,
  122. const reg_field_s reg_field[], const uint32_t reg_field_count)
  123. {
  124. int i = 0, pos=-1;
  125. int has_meet = 0;
  126. char *reg_desc;
  127. uint32_t reg_offset;
  128. uint32_t reg_reset_val;
  129. if (strlen(ra_info->reg_name) == 0 && ra_info->reg_offset == INVALID_MAGIC32) {
  130. printf("Invalid reg_name('%s') or reg_offset(0x%08x)\n",
  131. ra_info->reg_name, ra_info->reg_offset);
  132. return -1;
  133. }
  134. for (i = 0; i < reg_field_count; i++) {
  135. if (ra_info->reg_offset == reg_field[i].offset ||
  136. (reg_field[i].reg_name != NULL &&
  137. strncmp(reg_field[i].reg_name, ra_info->reg_name, strlen(reg_field[i].reg_name))==0)) {
  138. pos = i;
  139. reg_offset = reg_field[pos].offset;
  140. reg_desc = reg_field[pos].reg_desc;
  141. reg_reset_val = reg_field[pos].reset_value;
  142. break;
  143. }
  144. }
  145. if (pos < 0) {
  146. //printf_red("Can't find register offset=0x%x\n", reg_offset);
  147. return -1;
  148. }
  149. printf("\n%-24s %-10s %10s %s\n", "Register Name", "Offset", "ResetValue", "Description");
  150. printf("===================================================================================\n");
  151. printf("%-24s 0x%08x 0x%08x %s\n", reg_field[pos].reg_name, reg_offset, reg_reset_val, reg_desc);
  152. printf("\nBit[s] Len ResetValue FieldName Description\n");
  153. printf("===================================================================================\n");
  154. for (i = pos; i < reg_field_count; i++) {
  155. if (reg_field[i].offset != reg_offset) {
  156. if (has_meet == 1) {
  157. break;
  158. }
  159. continue;
  160. }
  161. uint32_t msb = reg_field[i].msb;
  162. uint32_t lsb = reg_field[i].lsb;
  163. uint32_t reset_field_val;
  164. uint32_t field_len = msb - lsb + 1;
  165. reset_field_val = (reg_reset_val >> lsb) & (~(0xffffffff << (msb - lsb + 1)));
  166. if (field_len == 1) {
  167. printf(" %5d ", lsb);
  168. }
  169. else {
  170. printf(" %2d:%2d ", msb, reg_field[i].lsb);
  171. }
  172. printf("%4d ", field_len);
  173. printf("0x%-9x ", reset_field_val);
  174. if (reg_field[i].field_name != NULL)
  175. printf("%-23s:", reg_field[i].field_name);
  176. else
  177. printf("%-23s", "");
  178. if (reg_field[i].field_desc != NULL)
  179. printf("%-s\n", reg_field[i].field_desc);
  180. else
  181. printf("%-s\n", "");
  182. if (has_meet == 0) {
  183. has_meet = 1;
  184. }
  185. }
  186. printf("\n");
  187. if (has_meet !=0 )
  188. return 0;
  189. else
  190. return -1;
  191. }
  192. int ra_dump_reg_find(reg_analyzer_info_s *ra_info,
  193. const reg_field_s reg_field[], const uint32_t reg_field_count)
  194. {
  195. int i = 0;
  196. char *last_reg_name = NULL;
  197. if (ra_info == NULL || ra_info->reg_name == NULL) {
  198. printf("ra_info or ra_info->reg_name is invalid\n");
  199. return -1;
  200. }
  201. for (i = 0; i < reg_field_count; i++) {
  202. const reg_field_s *pfield = &reg_field[i];
  203. if (last_reg_name == pfield->reg_name || pfield->reg_name == NULL)
  204. continue;
  205. if (stristr(pfield->reg_name, ra_info->reg_name) != NULL) {
  206. printf("Find register: offset=0x%08x, name='%s'\n",
  207. pfield->offset, pfield->reg_name);
  208. }
  209. last_reg_name = pfield->reg_name;
  210. }
  211. return 0;
  212. }
  213. void _dump_ra_info(reg_analyzer_info_s *ra_info)
  214. {
  215. printf("input params: [-m %s] [-o 0x%08X] [-r %s] [-v 0x%08x], op=%d\n",
  216. ra_info->module_name, ra_info->reg_offset, ra_info->reg_name,
  217. ra_info->reg_value, ra_info->operate);
  218. }
  219. char *strlwr(char *str)
  220. {
  221. char *orign = str;
  222. for (; *str != '\0'; str++)
  223. *str = tolower(*str);
  224. return orign;
  225. }
  226. void str_replace(char * cp, int n, char * str)
  227. {
  228. int lenofstr;
  229. char * tmp;
  230. lenofstr = strlen(str);
  231. //str3比str2短,往前移动
  232. if(lenofstr < n)
  233. {
  234. tmp = cp+n;
  235. while(*tmp)
  236. {
  237. *(tmp-(n-lenofstr)) = *tmp; //n-lenofstr是移动的距离
  238. tmp++;
  239. }
  240. *(tmp-(n-lenofstr)) = *tmp; //move '\0'
  241. }
  242. else
  243. //str3比str2长,往后移动
  244. if(lenofstr > n)
  245. {
  246. tmp = cp;
  247. while(*tmp) tmp++;
  248. while(tmp>=cp+n)
  249. {
  250. *(tmp+(lenofstr-n)) = *tmp;
  251. tmp--;
  252. }
  253. }
  254. strncpy(cp,str,lenofstr);
  255. }
  256. // compare string Ignore case
  257. int stricmp(const char* p1, const char* p2)
  258. {
  259. while (*p1 && *p2)
  260. {
  261. char c1 = *p1;
  262. char c2 = *p2;
  263. if (c1 >= 'A' && c1 <= 'Z')
  264. {
  265. c1 += 'a' - 'A';
  266. }
  267. if (c2 >= 'A' && c2 <= 'Z')
  268. {
  269. c2 += 'a' - 'A';
  270. }
  271. if (c1 != c2)
  272. {
  273. return c1 - c2;
  274. }
  275. p1++;
  276. p2++;
  277. }
  278. return *p1 - *p2;
  279. }
  280. // find string Ignore case
  281. char* stristr(const char* haystack, const char* needle)
  282. {
  283. char* char1 = NULL;
  284. char* char2 = NULL;
  285. if ((haystack == NULL) || (needle == NULL) || (strlen(haystack) < strlen(needle))){
  286. return NULL;
  287. }
  288. for (char1 = (char*)haystack; (*char1) != '\0'; ++char1) {
  289. char* char3 = char1;
  290. for (char2 = (char*)needle; (*char2) != '\0' && (*char1) != '\0'; ++char2, ++char1) {
  291. char c1 = (*char1) & 0xDF;
  292. char c2 = (*char2) & 0xDF;
  293. if ((c1 != c2) || (((c1 > 0x5A) || (c1 < 0x41)) && (*char1 != *char2)))
  294. break;
  295. }
  296. if ((*char2) == '\0')
  297. return char3;
  298. char1 = char3;
  299. }
  300. return NULL;
  301. }
  302. int ra_search_reg_by_offset(reg_analyzer_info_s *ra_info)
  303. {
  304. if (ra_info->reg_offset == INVALID_MAGIC32) {
  305. return -1;
  306. }
  307. return 0;
  308. }
  309. int ra_search_reg_by_name(reg_analyzer_info_s *ra_info)
  310. {
  311. if (strlen(ra_info->module_name) == 0) {
  312. return -1;
  313. }
  314. return 0;
  315. }